Convert expressions so that each expression contains at most one side effect. More...

Inheritance diagram for P4::DoSimplifyExpressions:

Public Member Functions
	DoSimplifyExpressions (ReferenceMap refMap, TypeMap typeMap, std::set< const IR::Expression * > *added)

void	end_apply (const IR::Node *) override

const IR::Node *	postorder (IR::AssignmentStatement *statement) override

const IR::Node *	postorder (IR::Expression *expression) override

const IR::Node *	postorder (IR::Function *function) override

const IR::Node *	postorder (IR::MethodCallStatement *statement) override

const IR::Node *	postorder (IR::P4Action *action) override

const IR::Node *	postorder (IR::P4Control *control) override

const IR::Node *	postorder (IR::P4Parser *parser) override

const IR::Node *	postorder (IR::ParserState *state) override

const IR::Node *	postorder (IR::ReturnStatement *statement) override

const IR::Node *	preorder (IR::Annotation *anno) override

const IR::Node *	preorder (IR::ArrayIndex *expression) override

const IR::Node *	preorder (IR::ConstructorCallExpression *cce) override

const IR::Node *	preorder (IR::IfStatement *statement) override

const IR::Node *	preorder (IR::LAnd *expression) override

const IR::Node *	preorder (IR::ListExpression *expression) override

const IR::Node *	preorder (IR::Literal *expression) override

const IR::Node *	preorder (IR::LOr *expression) override

const IR::Node *	preorder (IR::Member *expression) override

const IR::Node *	preorder (IR::MethodCallExpression *mce) override

const IR::Node *	preorder (IR::Mux *expression) override

const IR::Node *	preorder (IR::Operation_Binary *expression) override

const IR::Node *	preorder (IR::Operation_Unary *expression) override

const IR::Node *	preorder (IR::Property *prop) override

const IR::Node *	preorder (IR::SelectExpression *expression) override

const IR::Node *	preorder (IR::StructExpression *expression) override

const IR::Node *	preorder (IR::SwitchStatement *statement) override

const IR::Node *	shortCircuit (IR::Operation_Binary *expression)

Public Member Functions inherited from Transform
const IR::Node *	apply_visitor (const IR::Node , const char name=0) override

profile_t	init_apply (const IR::Node *root) override

virtual void	loop_revisit (const IR::Node *)

virtual const IR::Node *	postorder (IR::Node *n)

virtual const IR::Node *	preorder (IR::Node *n)

void	prune ()

virtual void	revisit (const IR::Node , const IR::Node )

void	revisit_visited ()

bool	visit_in_progress (const IR::Node *) const

void	visitAgain () const override

void	visitOnce () const override

Public Member Functions inherited from Visitor
virtual bool	check_global (cstring)

virtual void	clear_globals ()

virtual Visitor *	clone () const

virtual void	end_apply ()

virtual void	erase_global (cstring)

template<class T >
const T *	findContext () const

template<class T >
const T *	findContext (const Context *&c) const

template<class T >
const T *	findOrigCtxt () const

template<class T >
const T *	findOrigCtxt (const Context *&c) const

virtual Visitor &	flow_clone ()

virtual void	flow_merge (Visitor &)

virtual void	flow_merge_global_from (cstring)

virtual void	flow_merge_global_to (cstring)

const Context *	getChildContext () const

int	getChildrenVisited () const

const Context *	getContext () const

int	getContextDepth () const

const IR::Node *	getCurrentNode () const

template<class T >
const T *	getCurrentNode () const

const IR::Node *	getOriginal () const

template<class T >
const T *	getOriginal () const

template<class T >
const T *	getParent () const

virtual bool	has_flow_joins () const

profile_t	init_apply (const IR::Node root, const Context parent_context)

bool	isInContext (const IR::Node *n) const

virtual const char *	name () const

template<class T >
void	parallel_visit (const IR::Vector< T > &v, const char *name, int cidx)

template<class T >
void	parallel_visit (const IR::Vector< T > &v, const char *name=0)

template<class T >
void	parallel_visit (IR::Vector< T > &v, const char *name, int cidx)

template<class T >
void	parallel_visit (IR::Vector< T > &v, const char *name=0)

void	print_context () const

const Visitor &	setCalledBy (const Visitor *visitor)

void	setName (const char *name)

void	visit (const IR::Node &n, const char *name, int cidx)

void	visit (const IR::Node &n, const char *name=0)

void	visit (const IR::Node &n, const char name, int cidx)

void	visit (const IR::Node &n, const char name=0)

void	visit (const IR::Node const &n, const char name, int cidx)

void	visit (const IR::Node const &n, const char name=0)

void	visit (IR::Node &n, const char *name, int cidx)

void	visit (IR::Node &n, const char *name=0)

void	visit (IR::Node &, const char =0, int=0)

template<class T , typename = typename std::enable_if<std::is_base_of<Util::IHasSourceInfo, T>::value>::type, class... Args>
void	warn (const int kind, const char *format, const T &node, Args... args)
	The const ref variant of the above.

template<class T , typename = typename std::enable_if<std::is_base_of<Util::IHasSourceInfo, T>::value>::type, class... Args>
void	warn (const int kind, const char format, const T node, Args... args)

bool	warning_enabled (int warning_kind) const

Additional Inherited Members
Public Types inherited from Visitor
typedef Visitor_Context	Context

Static Public Member Functions inherited from Visitor
static cstring	demangle (const char *)

static bool	warning_enabled (const Visitor *visitor, int warning_kind)

Public Attributes inherited from Visitor
const Visitor *	called_by = nullptr

cstring	internalName

SplitFlowVisit_base *&	split_link

SplitFlowVisit_base *	split_link_mem = nullptr

Protected Member Functions inherited from Transform
const IR::Node *	transform_child (const IR::Node *child)

Protected Member Functions inherited from Visitor
virtual void	init_join_flows (const IR::Node *)

virtual bool	join_flows (const IR::Node *)

virtual void	post_join_flows (const IR::Node , const IR::Node )

void	visit_children (const IR::Node *, std::function< void()> fn)

Protected Attributes inherited from Visitor
bool	dontForwardChildrenBeforePreorder = false

bool	joinFlows = false

bool	visitDagOnce = true

Detailed Description

Convert expressions so that each expression contains at most one side effect.

Left-values are converted to contain no side-effects. An important consequence of this pass is that it converts function calls so that no two parameters (one of which is output) can alias. This makes the job of the inliner simpler. For example:

The expression a[f(x)] = b; is converted to tmp = f(x); a[tmp] = b;
And m(n()) is converted to tmp = n(); m(tmp)

This is especially tricky for handling out and inout arguments. Consider two function prototypes, bit f(inout T a, in T b); T g(inout T c);. The expression a[g(w)].x = f(a[1].x, g(a[1].x)); is translated as

T tmp1 = g(w);           // modifies w
T tmp2 = a[1].x;         // save a[1].x
T tmp3 = g(a[1].x);      // modifies a[1].x
T tmp4 = f(tmp2, tmp3);  // modifies tmp2
a[1].x = tmp2;           // copy tmp2 to a[1].x - out argument
a[tmp1].x = tmp4;        // assign result of call of f to actual left value

Translating function calls proceeds as follows:

arguments are evaluated in order
inout and out arguments produce left-values—these are "saved"
function is called with temporaries for all arguments
out and inout temporaries are copied to the saved left-values in order

For assignment statements e = e1; the left hand side is evaluated first.

Public Member Functions

Additional Inherited Members

Detailed Description