HomeSort by relevance Sort by last modified time
    Searched refs:DFS (Results 1 - 18 of 18) sorted by null

  /external/llvm/include/llvm/Analysis/
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;
133 DFS(Storage), LI(LInfo) {}
137 /// finishPostorder to record the DFS result.
139 assert(DFS.PostBlocks.empty() && "Need clear DFS result before traversing")
    [all...]
LoopInfoImpl.h 425 /// Populate all loop data in a stable order during a single forward DFS.
454 /// Top-level driver for the forward DFS within the loop.
467 // Push the next DFS successor onto the stack.
512 /// 2) Visited during a forward DFS CFG traversal.
513 /// 3) Reverse-inserted in the loop in postorder following forward DFS.
551 PopulateLoopsDFS<BlockT, LoopT> DFS(this);
552 DFS.traverse(DomRoot->getBlock());
  /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
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) {
102 DFS(target, visited, sorted);
  /external/llvm/lib/Analysis/
LoopInfo.cpp 388 LoopBlocksDFS DFS;
402 Unloop(UL), LI(LInfo), DFS(UL), FoundIB(false) {}
421 LoopBlocksTraversal Traversal(DFS, LI);
442 // the DFS result cached by Traversal.
450 for (LoopBlocksDFS::POIterator POI = DFS.beginPostorder(),
451 POE = DFS.endPostorder(); POI != POE; ++POI) {
495 assert(SubloopParents.count(Subloop) && "DFS failed to visit subloop");
540 assert((FoundIB || !DFS.hasPostorder(*I)) && "should have seen IB");
680 /// Traverse the loop blocks and store the DFS result.
681 /// Useful for clients that just want the final DFS result and don't need t
    [all...]
  /external/llvm/lib/CodeGen/
ScheduleDAGInstrs.cpp     [all...]
ScheduleDAG.cpp 457 /// On insertion of the edge X->Y, the algorithm first marks by calling DFS
528 DFS(Y, UpperBound, HasLoop);
542 /// DFS - Make a DFS traversal to mark all nodes reachable from SU and mark
545 void ScheduleDAGTopologicalSort::DFS(const SUnit *SU, int UpperBound,
627 DFS(TargetSU, UpperBound, HasLoop);
MachineScheduler.cpp     [all...]
  /external/llvm/lib/Transforms/Utils/
LoopUnroll.cpp 263 LoopBlocksDFS DFS(L);
264 DFS.perform(LI);
266 // Stash the DFS iterators before adding blocks to the loop.
267 LoopBlocksDFS::RPOIterator BlockBegin = DFS.beginRPO();
268 LoopBlocksDFS::RPOIterator BlockEnd = DFS.endRPO();
  /external/clang/lib/StaticAnalyzer/Core/
CoreEngine.cpp 43 class DFS : public WorkList {
104 WorkList *WorkList::makeDFS() { return new DFS(); }
  /external/llvm/include/llvm/CodeGen/
ScheduleDAG.h 704 /// Visited - a set of nodes visited during a DFS traversal.
707 /// DFS - make a DFS traversal and mark all nodes affected by the
710 void DFS(const SUnit *SU, int UpperBound, bool& HasLoop);
  /external/llvm/lib/Transforms/Vectorize/
LoopVectorize.cpp     [all...]
  /external/antlr/antlr-3.4/runtime/C/src/
antlr3collections.c     [all...]
  /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
org.eclipse.core.resources_3.6.1.R36x_v20101007-1215.jar 
org.eclipse.osgi_3.6.1.R36x_v20100806.jar 
org.eclipse.osgi_3.6.2.R36x_v20101103.jar 
  /prebuilts/tools/common/eclipse/
org.eclipse.osgi_3.6.2.R36x_v20110210.jar 
  /external/antlr/antlr-3.4/lib/
antlr-3.4-complete.jar 
  /prebuilts/misc/common/antlr/
antlr-3.4-complete.jar 

Completed in 5339 milliseconds