addEdgeInsertionPoints
void addEdgeInsertionPoints(ControlFlowGraph& controlflow); | Add information to each edge on where to insert statements on that edge. The insertion point structure is a pair of (SgNode*, bool), where the bool is true for inserting before the given node and false for inserting after it. |
makeCfg
void makeCfg( SgFunctionDefinition* n, ControlFlowGraph& graph); | Make the control flow graph for a given node |
partialRedundancyElimination
[[visibility("default")]] void partialRedundancyElimination(SgNode* n); | Do partial redundancy elimination on all functions within the scope n. |
partialRedundancyEliminationFunction
void partialRedundancyEliminationFunction(SgFunctionDefinition* n); | Do partial redundancy for all expressions within a given function, whose definition is given in n. |
partialRedundancyEliminationOne
void partialRedundancyEliminationOne( SgExpression* expr, SgBasicBlock* root, myControlFlowGraph const& cfg, std::vector<SgExpression*>& retired_expressions); | Do partial redundancy elimination, looking for copies of one expression expr within the basic block root. A control flow graph for root must be provided in cfg, with a map from nodes to their statements in node_statements, a map from edges to their CFG edge types in edge_type, and a map from edges to their insertion points in edge_insertion_point. The algorithm used is that of Paleri, Srikant, and Shankar ("Partial redundancy elimination: a simple, pragmatic, and provably correct algorithm", Science of Computer Programming 48 (2003) 1--20). Removed roots are appended to retired_expressions. The caller owns them until its expression worklist and equality scans have finished, then must delete them. Their former AST parents are cleared at replacement. |