Searched refs:DFS (Results 1 - 25 of 26) sorted by relevance

12

/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLoopIterator.h109 /// 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; member in class:llvm::LoopBlocksRPO
177 LoopBlocksRPO(Loop *Container) : DFS(Container) {}
179 /// Traverse the loop blocks and store the DFS resul
206 LoopBlocksDFS &DFS; member in class:llvm::LoopBlocksTraversal
[all...]
H A DLoopInfoImpl.h474 /// Populate all loop data in a stable order during a single forward DFS.
490 /// Top-level driver for the forward DFS within the loop.
532 /// 2) Visited during a forward DFS CFG traversal.
533 /// 3) Reverse-inserted in the loop in postorder following forward DFS.
562 PopulateLoopsDFS<BlockT, LoopT> DFS(this);
563 DFS.traverse(DomRoot->getBlock());
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DDataFlowSanitizer.cpp387 DataFlowSanitizer &DFS; member in struct:__anon2623::DFSanFunction
410 DFSanFunction(DataFlowSanitizer &DFS, Function *F, bool IsNativeABI) argument
411 : DFS(DFS), F(F), IA(DFS.getInstrumentedABI()), IsNativeABI(IsNativeABI) {
988 Value *Ne = IRB.CreateICmpNE(V, DFSF.DFS.ZeroShadow);
992 ThenIRB.CreateCall(DFSF.DFS.DFSanNonzeroLabelFn, {});
1003 if (DFS.ArgTLS)
1004 return ArgTLSPtr = DFS.ArgTLS;
1007 return ArgTLSPtr = IRB.CreateCall(DFS
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopSimplifyCFG.cpp124 LoopBlocksDFS DFS; member in class:__anon2708::ConstantTerminatorFoldingImpl
189 bool hasIrreducibleCFG(LoopBlocksDFS &DFS) { argument
190 assert(DFS.isComplete() && "DFS is expected to be finished");
194 for (auto I = DFS.beginRPO(), E = DFS.endRPO(); I != E; ++I)
197 for (auto I = DFS.beginRPO(), E = DFS.endRPO(); I != E; ++I) {
212 DFS.perform(&LI);
213 assert(DFS
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUAnnotateUniformValues.cpp80 static void DFS(BasicBlock *Root, SetVector<BasicBlock*> & Set) { function
83 DFS(I, Set);
89 // loop and check for the writes. If NOT - start DFS over all preds.
90 // 3. Start DFS over all preds from the most outer loop header.
106 DFS(Start, Checklist);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DDDG.cpp202 LoopBlocksDFS DFS(&L);
203 DFS.perform(&LI);
205 for (BasicBlock *BB : make_range(DFS.beginRPO(), DFS.endRPO()))
H A DLoopInfo.cpp666 LoopBlocksDFS DFS;
680 : Unloop(*UL), LI(LInfo), DFS(UL), FoundIB(false) {}
699 LoopBlocksTraversal Traversal(DFS, LI);
718 // the DFS result cached by Traversal.
726 for (LoopBlocksDFS::POIterator POI = DFS.beginPostorder(),
727 POE = DFS.endPostorder();
770 assert(SubloopParents.count(Subloop) && "DFS failed to visit subloop");
814 assert((FoundIB || !DFS.hasPostorder(*I)) && "should have seen IB");
1105 /// Traverse the loop blocks and store the DFS result.
1106 /// Useful for clients that just want the final DFS resul
[all...]
H A DVectorUtils.cpp815 LoopBlocksDFS DFS(TheLoop);
816 DFS.perform(LI);
817 for (BasicBlock *BB : make_range(DFS.beginRPO(), DFS.endRPO()))
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DScheduleDAGInstrs.cpp1247 /// Returns true if this node been visited by the DFS traversal.
1356 /// Joins the predecessor subtree with the successor that is its DFS parent.
1456 SchedDAGReverseDFS DFS; local
1458 DFS.follow(&SU);
1461 while (DFS.getPred() != DFS.getPredEnd()) {
1462 const SDep &PredDep = *DFS.getPred();
1463 DFS.advance();
1471 Impl.visitCrossEdge(PredDep, DFS.getCurr());
1475 DFS
[all...]
H A DScheduleDAG.cpp462 // 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,
729 DFS(TargetSU, UpperBound, HasLoop);
H A DMachineScheduler.cpp3519 // Restore the heap in ReadyQ with the updated DFS results.
3717 const SchedDFSResult *DFS = DAG->hasVRegLiveness() ? local
3720 if (DFS)
3721 SS << " I:" << DFS->getNumInstrs(SU);
3732 const SchedDFSResult *DFS = DAG->hasVRegLiveness() ? local
3734 if (DFS) {
3736 Str += DOT::getColorString(DFS->getSubtreeID(N));
/freebsd-11-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/
H A DWorkList.cpp36 class DFS : public WorkList { class in namespace:__anon903
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
H A DAnalyzerOptions.cpp69 .Case("dfs", ExplorationStrategyKind::DFS)
H A DCoreEngine.cpp58 case ExplorationStrategyKind::DFS:
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DPartialInlining.cpp466 std::vector<BasicBlock *> DFS; local
468 DFS.push_back(CurrEntry);
476 while (!DFS.empty()) {
477 auto *thisBB = DFS.back();
478 DFS.pop_back();
489 DFS.push_back(*SI);
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/
H A DAnalyzerOptions.h123 DFS, member in class:clang::ExplorationStrategyKind
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLoopUnroll.cpp571 LoopBlocksDFS DFS(L);
572 DFS.perform(LI);
574 // Stash the DFS iterators before adding blocks to the loop.
575 LoopBlocksDFS::RPOIterator BlockBegin = DFS.beginRPO();
576 LoopBlocksDFS::RPOIterator BlockEnd = DFS.endRPO();
H A DLoopUnrollAndJam.cpp293 LoopBlocksDFS DFS(L);
294 DFS.perform(LI);
295 // Stash the DFS iterators before adding blocks to the loop.
296 LoopBlocksDFS::RPOIterator BlockBegin = DFS.beginRPO();
297 LoopBlocksDFS::RPOIterator BlockEnd = DFS.endRPO();
/freebsd-11-stable/sys/dev/ncr/
H A Dncrreg.h164 #define DFS 0x20 /* mod: dma fifo size */ macro
H A Dncr.c3536 np->rv_ctest5 |= DFS; /* Dma Fifo Size */
3642 (np->rv_ctest5 & DFS) ? "large" : "normal");
5613 ctest5 = (np->rv_ctest5 & DFS) ? INB (nc_ctest5) : 0;
5614 if (ctest5 & DFS)
/freebsd-11-stable/contrib/llvm-project/lldb/source/Target/
H A DStackFrameList.cpp277 // Run DFS on the tail-calling edges out of the first callee to find \p end.
280 struct DFS { struct
289 DFS(Function *end, ModuleList &images, ExecutionContext &context) function in struct:DFS
332 DFS(&end, images, exe_ctx).search(*first_callee, path);
/freebsd-11-stable/sys/dev/sym/
H A Dsym_defs.h382 #define DFS 0x20 /* mod: dma fifo size */ macro
H A Dsym_hipd.c2638 np->rv_ctest5 |= DFS; /* Dma Fifo Size */
4256 if (dfifo & (DFS << 16))
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DScheduleDAG.h704 /// a set of nodes visited during a DFS traversal.
707 /// Makes a DFS traversal and mark all nodes affected by the edge insertion.
710 void DFS(const SUnit *SU, int UpperBound, bool& HasLoop);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DLoopVectorize.cpp5377 LoopBlocksDFS DFS(TheLoop);
5378 DFS.perform(LI);
5397 for (BasicBlock *BB : make_range(DFS.beginRPO(), DFS.endRPO())) {
7193 LoopBlocksDFS DFS(OrigLoop);
7194 DFS.perform(LI);
7196 for (BasicBlock *BB : make_range(DFS.beginRPO(), DFS.endRPO())) {

Completed in 270 milliseconds

12