HomeSort by: relevance | last modified time | path
    Searched refs:DFS (Results 1 - 24 of 24) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
LoopIterator.h 109 /// preorder visited by DFS. It's postorder number is initially zero and set
122 /// Traverse the loop blocks and store the DFS result.
130 assert(isComplete() && "bad loop DFS");
137 assert(isComplete() && "bad loop DFS");
154 assert(I != PostNumbers.end() && "block not visited by DFS");
155 assert(I->second && "block not finished by DFS");
171 /// interface for the DFS reverse post-order traversal of blocks in a loop body.
174 LoopBlocksDFS DFS;
177 LoopBlocksRPO(Loop *Container) : DFS(Container) {}
179 /// Traverse the loop blocks and store the DFS result
    [all...]
LoopInfoImpl.h 484 /// Populate all loop data in a stable order during a single forward DFS.
500 /// Top-level driver for the forward DFS within the loop.
542 /// 2) Visited during a forward DFS CFG traversal.
543 /// 3) Reverse-inserted in the loop in postorder following forward DFS.
572 PopulateLoopsDFS<BlockT, LoopT> DFS(this);
573 DFS.traverse(DomRoot->getBlock());
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Instrumentation/
DataFlowSanitizer.cpp 564 DataFlowSanitizer &DFS;
600 DFSanFunction(DataFlowSanitizer &DFS, Function *F, bool IsNativeABI)
601 : DFS(DFS), F(F), IA(DFS.getInstrumentedABI()), IsNativeABI(IsNativeABI) {
987 Type *ShadowTy = DFS.getShadowTy(T);
992 if (DFS.isZeroShadow(PrimitiveShadow))
993 return DFS.getZeroShadow(ShadowTy);
1010 return DFS.ZeroPrimitiveShadow;
1041 assert(DFS.shouldTrackFieldsAndIndices())
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
LoopSimplifyCFG.cpp 125 LoopBlocksDFS DFS;
190 bool hasIrreducibleCFG(LoopBlocksDFS &DFS) {
191 assert(DFS.isComplete() && "DFS is expected to be finished");
195 for (auto I = DFS.beginRPO(), E = DFS.endRPO(); I != E; ++I)
198 for (auto I = DFS.beginRPO(), E = DFS.endRPO(); I != E; ++I) {
213 DFS.perform(&LI);
214 assert(DFS.isComplete() && "DFS is expected to be finished")
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
DDG.cpp 206 LoopBlocksDFS DFS(&L);
207 DFS.perform(&LI);
209 append_range(BBList, make_range(DFS.beginRPO(), DFS.endRPO()));
LoopInfo.cpp 687 LoopBlocksDFS DFS;
701 : Unloop(*UL), LI(LInfo), DFS(UL), FoundIB(false) {}
720 LoopBlocksTraversal Traversal(DFS, LI);
739 // the DFS result cached by Traversal.
747 for (LoopBlocksDFS::POIterator POI = DFS.beginPostorder(),
748 POE = DFS.endPostorder();
790 assert(SubloopParents.count(Subloop) && "DFS failed to visit subloop");
834 assert((FoundIB || !DFS.hasPostorder(*I)) && "should have seen IB");
1146 /// Traverse the loop blocks and store the DFS result.
1147 /// Useful for clients that just want the final DFS result and don't need t
    [all...]
VectorUtils.cpp 958 LoopBlocksDFS DFS(TheLoop);
959 DFS.perform(LI);
960 for (BasicBlock *BB : make_range(DFS.beginRPO(), DFS.endRPO()))
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
ScheduleDAGInstrs.cpp 1254 /// Returns true if this node been visited by the DFS traversal.
1363 /// Joins the predecessor subtree with the successor that is its DFS parent.
1463 SchedDAGReverseDFS DFS;
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.follow(PredDep.getSUnit())
    [all...]
ScheduleDAG.cpp 462 // On insertion of the edge X->Y, the algorithm first marks by calling DFS
557 DFS(Y, UpperBound, HasLoop);
570 void ScheduleDAGTopologicalSort::DFS(const SUnit *SU, int UpperBound,
737 DFS(TargetSU, UpperBound, HasLoop);
MachineScheduler.cpp 3702 // Restore the heap in ReadyQ with the updated DFS results.
3900 const SchedDFSResult *DFS = DAG->hasVRegLiveness() ?
3903 if (DFS)
3904 SS << " I:" << DFS->getNumInstrs(SU);
3915 const SchedDFSResult *DFS = DAG->hasVRegLiveness() ?
3917 if (DFS) {
3919 Str += DOT::getColorString(DFS->getSubtreeID(N));
  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/
WorkList.cpp 36 class DFS : public WorkList {
82 return std::make_unique<DFS>();
214 // Number of inserted nodes, used to emulate DFS ordering in the priority
276 // Number of inserted nodes, used to emulate DFS ordering in the priority
AnalyzerOptions.cpp 69 .Case("dfs", ExplorationStrategyKind::DFS)
CoreEngine.cpp 57 case ExplorationStrategyKind::DFS:
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/
PartialInlining.cpp 467 std::vector<BasicBlock *> DFS;
469 DFS.push_back(CurrEntry);
478 while (!DFS.empty()) {
479 auto *ThisBB = DFS.back();
480 DFS.pop_back();
491 DFS.push_back(*SI);
  /src/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/
AnalyzerOptions.h 124 DFS,
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
LoopUnroll.cpp 560 LoopBlocksDFS DFS(L);
561 DFS.perform(LI);
563 // Stash the DFS iterators before adding blocks to the loop.
564 LoopBlocksDFS::RPOIterator BlockBegin = DFS.beginRPO();
565 LoopBlocksDFS::RPOIterator BlockEnd = DFS.endRPO();
LoopUnrollAndJam.cpp 346 LoopBlocksDFS DFS(L);
347 DFS.perform(LI);
348 // Stash the DFS iterators before adding blocks to the loop.
349 LoopBlocksDFS::RPOIterator BlockBegin = DFS.beginRPO();
350 LoopBlocksDFS::RPOIterator BlockEnd = DFS.endRPO();
  /src/external/gpl3/gcc/dist/gcc/
lto-streamer-out.cc 463 This is used to stream tree bodies where we know the DFS walk arranged
603 class DFS
606 DFS (struct output_block *ob, tree expr, bool ref_p, bool this_ref_p,
608 ~DFS ();
692 DFS::DFS (struct output_block *ob, tree expr, bool ref_p, bool this_ref_p,
722 /* Not yet visited. DFS recurse and push it onto the stack. */
948 DFS::~DFS ()
953 /* Handle the tree EXPR in the DFS walk with SCC state EXPR_STATE an
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
lto-streamer-out.cc 456 This is used to stream tree bodies where we know the DFS walk arranged
596 class DFS
599 DFS (struct output_block *ob, tree expr, bool ref_p, bool this_ref_p,
601 ~DFS ();
685 DFS::DFS (struct output_block *ob, tree expr, bool ref_p, bool this_ref_p,
715 /* Not yet visited. DFS recurse and push it onto the stack. */
941 DFS::~DFS ()
946 /* Handle the tree EXPR in the DFS walk with SCC state EXPR_STATE an
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/LiveDebugValues/
InstrRefBasedImpl.cpp 2934 DFS;
2942 DFS.push_back(std::make_pair(succ, succ->succ_begin()));
2947 while (!DFS.empty()) {
2948 const MachineBasicBlock *CurBB = DFS.back().first;
2949 MachineBasicBlock::const_succ_iterator &CurSucc = DFS.back().second;
2952 DFS.pop_back();
2959 DFS.push_back(std::make_pair(*CurSucc, (*CurSucc)->succ_begin()));
  /src/external/apache2/llvm/dist/llvm/lib/Target/ARM/
ARMLowOverheadLoops.cpp 1643 PostOrderLoopTraversal DFS(LoLoop.ML, *MLI);
1644 DFS.ProcessLoop();
1645 const SmallVectorImpl<MachineBasicBlock*> &PostOrder = DFS.getOrder();
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
ScheduleDAG.h 709 /// a set of nodes visited during a DFS traversal.
712 /// Makes a DFS traversal and mark all nodes affected by the edge insertion.
715 void DFS(const SUnit *SU, int UpperBound, bool& HasLoop);
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
LoopVectorize.cpp 6508 LoopBlocksDFS DFS(TheLoop);
6509 DFS.perform(LI);
6528 for (BasicBlock *BB : make_range(DFS.beginRPO(), DFS.endRPO())) {
9063 LoopBlocksDFS DFS(OrigLoop);
9064 DFS.perform(LI);
9066 for (BasicBlock *BB : make_range(DFS.beginRPO(), DFS.endRPO())) {
  /src/crypto/external/bsd/heimdal/dist/
configure 1732 --enable-dce if you want support for DCE/DFS PAG's

Completed in 166 milliseconds