Searched refs:dfsStack (Results 1 – 3 of 3) sorted by relevance
/external/llvm/lib/Analysis/ |
D | PathNumbering.cpp | 236 std::stack<BallLarusNode*> dfsStack; in init() local 242 dfsStack.push(getRoot()); in init() 245 while(dfsStack.size()) in init() 246 buildNode(inDag, dfsStack); in init() 364 void BallLarusDag::buildNode(BLBlockNodeMap& inDag, BLNodeStack& dfsStack) { in buildNode() argument 365 BallLarusNode* currentNode = dfsStack.top(); in buildNode() 370 dfsStack.pop(); in buildNode() 410 buildEdge(inDag, dfsStack, currentNode, succBB, duplicateNumber); in buildNode() 417 dfsStack, BallLarusNode* currentNode, in buildEdge() argument 438 dfsStack.push(childNode); in buildEdge()
|
/external/llvm/include/llvm/Analysis/ |
D | PathNumbering.h | 287 void buildNode(BLBlockNodeMap& inDag, std::stack<BallLarusNode*>& dfsStack); 290 void buildEdge(BLBlockNodeMap& inDag, std::stack<BallLarusNode*>& dfsStack,
|
/external/llvm/lib/Transforms/Instrumentation/ |
D | PathProfiling.cpp | 579 std::stack<BallLarusNode*> dfsStack; in calculateSpanningTree() local 586 dfsStack.push(getRoot()); in calculateSpanningTree() 587 while(dfsStack.size() > 0) { in calculateSpanningTree() 588 BallLarusNode* node = dfsStack.top(); in calculateSpanningTree() 589 dfsStack.pop(); in calculateSpanningTree()
|