/external/llvm/include/llvm/Analysis/ |
H A D | LoopIterator.h | 50 /// preorder visited by DFS. It's postorder number is initially zero and set 63 /// Traverse the loop blocks and store the DFS result. 71 assert(isComplete() && "bad loop DFS"); 78 assert(isComplete() && "bad loop DFS"); 95 assert(I != PostNumbers.end() && "block not visited by DFS"); 96 assert(I->second && "block not finished by DFS"); 128 LoopBlocksDFS &DFS; member in class:llvm::LoopBlocksTraversal 133 DFS(Storage), LI(LInfo) {} 137 /// finishPostorder to record the DFS result. 139 assert(DFS [all...] |
H A D | LoopInfoImpl.h | 406 /// Populate all loop data in a stable order during a single forward DFS. 435 /// Top-level driver for the forward DFS within the loop. 448 // Push the next DFS successor onto the stack. 492 /// 2) Visited during a forward DFS CFG traversal. 493 /// 3) Reverse-inserted in the loop in postorder following forward DFS. 531 PopulateLoopsDFS<BlockT, LoopT> DFS(this); 532 DFS.traverse(DomRoot->getBlock());
|
/external/llvm/lib/Transforms/Instrumentation/ |
H A D | DataFlowSanitizer.cpp | 267 DataFlowSanitizer &DFS; member in struct:__anon26251::DFSanFunction 280 DFSanFunction(DataFlowSanitizer &DFS, Function *F, bool IsNativeABI) argument 281 : DFS(DFS), F(F), IA(DFS.getInstrumentedABI()), 785 Value *Ne = IRB.CreateICmpNE(*i, DFSF.DFS.ZeroShadow); 789 ThenIRB.CreateCall(DFSF.DFS.DFSanNonzeroLabelFn); 800 if (DFS.ArgTLS) 801 return ArgTLSPtr = DFS.ArgTLS; 804 return ArgTLSPtr = IRB.CreateCall(DFS [all...] |
/external/lldb/examples/scripting/ |
H A D | tree_utils.py | 17 For a thorough explanation of how the DFS function works, and 23 def DFS (root, word, cur_path): function 66 return DFS (left_child_ptr, word, cur_path) 75 return DFS (right_child_ptr, word, cur_path)
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
H A D | Graph.java | 70 /** DFS-based topological sort. A valid sort is the reverse of 91 DFS(n, visited, sorted); 96 public void DFS(Node n, Set<Node> visited, ArrayList<Object> sorted) { method in class:Graph 102 DFS(target, visited, sorted);
|
/external/llvm/lib/Analysis/ |
H A D | LoopInfo.cpp | 425 LoopBlocksDFS DFS; member in class:__anon25690::UnloopUpdater 439 Unloop(UL), LI(LInfo), DFS(UL), FoundIB(false) {} 458 LoopBlocksTraversal Traversal(DFS, LI); 479 // the DFS result cached by Traversal. 487 for (LoopBlocksDFS::POIterator POI = DFS.beginPostorder(), 488 POE = DFS.endPostorder(); POI != POE; ++POI) { 532 assert(SubloopParents.count(Subloop) && "DFS failed to visit subloop"); 577 assert((FoundIB || !DFS.hasPostorder(*I)) && "should have seen IB"); 717 /// Traverse the loop blocks and store the DFS result. 718 /// Useful for clients that just want the final DFS resul [all...] |
/external/llvm/lib/Transforms/Utils/ |
H A D | LoopUnroll.cpp | 286 LoopBlocksDFS DFS(L); 287 DFS.perform(LI); 289 // Stash the DFS iterators before adding blocks to the loop. 290 LoopBlocksDFS::RPOIterator BlockBegin = DFS.beginRPO(); 291 LoopBlocksDFS::RPOIterator BlockEnd = DFS.endRPO();
|
/external/llvm/lib/CodeGen/ |
H A D | ScheduleDAGInstrs.cpp | 1250 /// Return true if this node been visited by the DFS traversal. 1363 /// Join the predecessor subtree with the successor that is its DFS 1463 SchedDAGReverseDFS DFS; local 1465 DFS.follow(SU); 1468 while (DFS.getPred() != DFS.getPredEnd()) { 1469 const SDep &PredDep = *DFS.getPred(); 1470 DFS.advance(); 1478 Impl.visitCrossEdge(PredDep, DFS.getCurr()); 1482 DFS [all...] |
H A D | ScheduleDAG.cpp | 458 /// On insertion of the edge X->Y, the algorithm first marks by calling DFS 529 DFS(Y, UpperBound, HasLoop); 543 /// DFS - Make a DFS traversal to mark all nodes reachable from SU and mark 546 void ScheduleDAGTopologicalSort::DFS(const SUnit *SU, int UpperBound, 628 DFS(TargetSU, UpperBound, HasLoop);
|
H A D | MachineScheduler.cpp | 3061 // Restore the heap in ReadyQ with the updated DFS results. 3252 const SchedDFSResult *DFS = DAG->hasVRegLiveness() ? local 3255 if (DFS) 3256 SS << " I:" << DFS->getNumInstrs(SU); 3266 const SchedDFSResult *DFS = DAG->hasVRegLiveness() ? local 3268 if (DFS) { 3270 Str += DOT::getColorString(DFS->getSubtreeID(N));
|
/external/clang/lib/StaticAnalyzer/Core/ |
H A D | CoreEngine.cpp | 43 class DFS : public WorkList { class in namespace:__anon18268 104 WorkList *WorkList::makeDFS() { return new DFS(); }
|
/external/antlr/antlr-3.4/runtime/C/src/ |
H A D | antlr3collections.c | 2415 DFS(pANTLR3_TOPO topo, ANTLR3_UINT32 node) function 2500 DFS(topo, i); 2564 DFS(topo, v);
|
/external/llvm/include/llvm/CodeGen/ |
H A D | ScheduleDAG.h | 700 /// Visited - a set of nodes visited during a DFS traversal. 703 /// DFS - make a DFS traversal and mark all nodes affected by the 706 void DFS(const SUnit *SU, int UpperBound, bool& HasLoop);
|
/external/llvm/lib/Transforms/Vectorize/ |
H A D | LoopVectorize.cpp | 2620 LoopBlocksDFS DFS(OrigLoop); 2621 DFS.perform(LI); 2624 for (LoopBlocksDFS::RPOIterator bb = DFS.beginRPO(), 2625 be = DFS.endRPO(); bb != be; ++bb) 5465 LoopBlocksDFS DFS(TheLoop); 5466 DFS.perform(LI); 5486 for (LoopBlocksDFS::RPOIterator bb = DFS.beginRPO(), 5487 be = DFS.endRPO(); bb != be; ++bb) {
|
/external/pdfium/core/src/fxcodec/jbig2/ |
H A D | JBig2_GeneralDecoder.cpp | 1825 FX_INT32 DT, DFS, CURS;
local 1864 if(pHuffmanDecoder->decodeAValue(SBHUFFFS, &DFS) != 0) {
1868 FIRSTS = FIRSTS + DFS;
2045 FX_INT32 DT, DFS, CURS;
local 2108 if(IAFS->decode(pArithDecoder, &DFS) == -1) {
2112 FIRSTS = FIRSTS + DFS;
|
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
H A D | org.eclipse.core.resources_3.6.1.R36x_v20101007-1215.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
H A D | org.eclipse.osgi_3.6.1.R36x_v20100806.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
H A D | org.eclipse.osgi_3.6.2.R36x_v20101103.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
/external/antlr/antlr-3.4/lib/ |
H A D | antlr-3.4-complete.jar | META-INF/ META-INF/MANIFEST.MF org/ org/antlr/ org/antlr/analysis/ org/antlr/codegen/ org/ ... |