Home
last modified time | relevance | path

Searched refs:dfsStack (Results 1 – 4 of 4) sorted by relevance

/external/swiftshader/third_party/LLVM/lib/Analysis/
DPathNumbering.cpp237 std::stack<BallLarusNode*> dfsStack; in init() local
243 dfsStack.push(getRoot()); in init()
246 while(dfsStack.size()) in init()
247 buildNode(inDag, dfsStack); in init()
365 void BallLarusDag::buildNode(BLBlockNodeMap& inDag, BLNodeStack& dfsStack) { in buildNode() argument
366 BallLarusNode* currentNode = dfsStack.top(); in buildNode()
371 dfsStack.pop(); in buildNode()
411 buildEdge(inDag, dfsStack, currentNode, succBB, duplicateNumber); in buildNode()
418 dfsStack, BallLarusNode* currentNode, in buildEdge() argument
439 dfsStack.push(childNode); in buildEdge()
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/
DPathNumbering.h287 void buildNode(BLBlockNodeMap& inDag, std::stack<BallLarusNode*>& dfsStack);
290 void buildEdge(BLBlockNodeMap& inDag, std::stack<BallLarusNode*>& dfsStack,
/external/swiftshader/third_party/LLVM/lib/Transforms/Instrumentation/
DPathProfiling.cpp580 std::stack<BallLarusNode*> dfsStack; in calculateSpanningTree() local
587 dfsStack.push(getRoot()); in calculateSpanningTree()
588 while(dfsStack.size() > 0) { in calculateSpanningTree()
589 BallLarusNode* node = dfsStack.top(); in calculateSpanningTree()
590 dfsStack.pop(); in calculateSpanningTree()
/external/v8/tools/turbolizer/
Dgraph-layout.js285 var dfsStack = [];