AstCycleTest¶
AstCycleTest is based on the successor information of SgNodes (the same information that is used by the traversals). It tests such that it allows a preorder traversal to revisit nodes but reports an error if the traversal would run into a cycle. If a cycle is found it reports the list of SgNodes that are part of the cycle to stdout, starting with "CYCLE FOUND: ..." and stops testing. Usage: AstCycleTest t; t.traverse(SgNode* n); // where n is the root node of the subtree to be tested.
Synopsis¶
Declared in <src/midend/astProcessing/AstTraversal.h>
class AstCycleTest
: public AstPrePostOrderTraversal Base Classes¶
| Name | Description |
|---|---|
AstPrePostOrderTraversal |
Member Functions¶
| Name | Description |
|---|---|
determineCyclestd::list<SgNode*> determineCycle( std::list<SgNode*>& l, SgNode* node); | determines whether the given sequence l of nodes extended by node creates a cycle the found cycle is returned. If no cycle is found, the returned list is empty. |
modifyChildrenContainervirtual void modifyChildrenContainer( SgNode*, std::vector<SgNode*>&); [virtual] | |
postOrderVisitvirtual void postOrderVisit(SgNode* node); [virtual] | |
preOrderVisitvirtual void preOrderVisit(SgNode* node); [virtual] | |
setChildrenContainervirtual void setChildrenContainer( SgNode* node, std::vector<SgNode*>& c); [virtual] | In case of a cycle the traversal does not continue to prevent an infinite recursion of the traversal. |
Data Members¶
| Name |
|---|
activeNodes |
Created with MrDocs