Home
last modified time | relevance | path

Searched refs:DFS (Results 1 – 25 of 39) sorted by relevance

12

/llvm-project-15.0.7/clang/test/Analysis/
H A Dtraversal-algorithm.mm53 // DFS:27 WhileStmt
54 // DFS-next:33 ForStmt
60 // DFS-next:--END PATH--
67 // DFS-next:--END PATH--
75 // DFS-next:33 ForStmt
83 // DFS-next:33 ForStmt
91 // DFS-next:33 ForStmt
100 // DFS-next:33 ForStmt
108 // DFS-next:33 ForStmt
116 // DFS-next:33 ForStmt
[all …]
H A Dloop-unrolling.cpp349 #ifdef DFS in simple_unknown_bound_loop()
371 #ifdef DFS in nested_inlined_no_unroll1()
/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DLoopIterator.h174 LoopBlocksDFS DFS;
177 LoopBlocksRPO(Loop *Container) : DFS(Container) {} in LoopBlocksRPO()
181 DFS.perform(LI); in perform()
206 LoopBlocksDFS &DFS;
211 DFS(Storage), LI(LInfo) {} in LoopBlocksTraversal()
219 return po_ext_begin(DFS.L->getHeader(), *this); in begin()
223 return po_ext_end(DFS.L->getHeader(), *this); in end()
232 if (!DFS.L->contains(LI->getLoopFor(BB))) in visitPreorder()
235 return DFS.PostNumbers.insert(std::make_pair(BB, 0)).second; in visitPreorder()
242 DFS.PostBlocks.push_back(BB); in finishPostorder()
[all …]
/llvm-project-15.0.7/llvm/lib/Transforms/Instrumentation/
H A DDataFlowSanitizer.cpp546 DataFlowSanitizer &DFS; member
583 : DFS(DFS), F(F), IsNativeABI(IsNativeABI), in DFSanFunction()
1597 Value *Base = IRB.CreatePointerCast(DFS.ArgTLS, DFS.IntptrTy); in getArgTLS()
1606 DFS.RetvalTLS, PointerType::get(DFS.getShadowTy(T), 0), "_dfsret"); in getRetvalTLS()
1612 return IRB.CreateConstGEP2_64(DFS.ArgOriginTLSTy, DFS.ArgOriginTLS, 0, ArgNo, in getArgOriginTLS()
1619 return DFS.ZeroOrigin; in getOrigin()
1778 if (DFS.isZeroShadow(V1)) in combineShadows()
1861 return DFS.ZeroOrigin; in combineOrigins()
1974 ShadowSize == 4 ? Type::getInt32Ty(*DFS.Ctx) : Type::getInt64Ty(*DFS.Ctx); in loadShadowFast()
2132 DFS.DFSanUnionLoadFn, {ShadowAddr, ConstantInt::get(DFS.IntptrTy, Size)}); in loadShadowOriginSansLoadTracking()
[all …]
/llvm-project-15.0.7/llvm/lib/Transforms/Scalar/
H A DLoopSimplifyCFG.cpp118 LoopBlocksDFS DFS; member in __anon5fa539ba0111::ConstantTerminatorFoldingImpl
183 bool hasIrreducibleCFG(LoopBlocksDFS &DFS) { in hasIrreducibleCFG() argument
184 assert(DFS.isComplete() && "DFS is expected to be finished"); in hasIrreducibleCFG()
188 for (auto I = DFS.beginRPO(), E = DFS.endRPO(); I != E; ++I) in hasIrreducibleCFG()
191 for (auto I = DFS.beginRPO(), E = DFS.endRPO(); I != E; ++I) { in hasIrreducibleCFG()
206 DFS.perform(&LI); in analyze()
207 assert(DFS.isComplete() && "DFS is expected to be finished"); in analyze()
216 if (hasIrreducibleCFG(DFS)) { in analyze()
223 for (auto I = DFS.beginRPO(), E = DFS.endRPO(); I != E; ++I) { in analyze()
299 for (auto I = DFS.beginPostorder(), E = DFS.endPostorder(); I != E; ++I) { in analyze()
[all …]
/llvm-project-15.0.7/clang-tools-extra/pseudo/tool/
H A DClangPseudo.cpp196 auto DFS = [&](const ForestNode &N, Token::Index End, auto &DFS) -> void { in main() argument
203 DFS(*C, End, DFS); in main()
207 DFS(*N.children()[I], in main()
211 DFS); in main()
215 DFS(Root, Len, DFS); in main()
/llvm-project-15.0.7/lldb/examples/scripting/
H A Dtree_utils.py24 def DFS(root, word, cur_path): function
67 return DFS(left_child_ptr, word, cur_path)
76 return DFS(right_child_ptr, word, cur_path)
/llvm-project-15.0.7/lldb/docs/use/
H A Dpython.rst67 1: def DFS (root, word, cur_path):
85 19: return DFS (left_child_ptr, word, cur_path)
91 25: return DFS (right_child_ptr, word, cur_path)
100 the DFS function. The first parameter is going to be a node in our
136 Explaining DFS Script in Detail
178 The DFS Script in Action
213 >>> path = tree_utils.DFS (root, "Romeo", current_path)
256 path = tree_utils.DFS (root, "Romeo", current_path)
521 def DFS(root, word, cur_path):
564 return DFS(left_child_ptr, word, cur_path)
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/HotColdSplit/
H A Dforward-dfs-reaches-marked-block.ll13 ; This will be marked by the inverse DFS on sink-predecesors.
19 ; Do not allow the forward-DFS on sink-successors to mark the block again.
/llvm-project-15.0.7/llvm/lib/Analysis/
H A DDDG.cpp205 LoopBlocksDFS DFS(&L); in DataDependenceGraph() local
206 DFS.perform(&LI); in DataDependenceGraph()
208 append_range(BBList, make_range(DFS.beginRPO(), DFS.endRPO())); in DataDependenceGraph()
H A DLoopInfo.cpp681 LoopBlocksDFS DFS; member in __anon90567d990511::UnloopUpdater
694 UnloopUpdater(Loop *UL, LoopInfo *LInfo) : Unloop(*UL), LI(LInfo), DFS(UL) {} in UnloopUpdater()
713 LoopBlocksTraversal Traversal(DFS, LI); in updateBlockParents()
741 for (LoopBlocksDFS::POIterator POI = DFS.beginPostorder(), in updateBlockParents()
742 POE = DFS.endPostorder(); in updateBlockParents()
828 assert((FoundIB || !DFS.hasPostorder(*I)) && "should have seen IB"); in getNearestLoop()
/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DScheduleDAGInstrs.cpp1451 SchedDAGReverseDFS DFS; in compute() local
1453 DFS.follow(&SU); in compute()
1456 while (DFS.getPred() != DFS.getPredEnd()) { in compute()
1457 const SDep &PredDep = *DFS.getPred(); in compute()
1458 DFS.advance(); in compute()
1466 Impl.visitCrossEdge(PredDep, DFS.getCurr()); in compute()
1470 DFS.follow(PredDep.getSUnit()); in compute()
1473 const SUnit *Child = DFS.getCurr(); in compute()
1474 const SDep *PredDep = DFS.backtrack(); in compute()
1477 Impl.visitPostorderEdge(*PredDep, DFS.getCurr()); in compute()
[all …]
H A DScheduleDAG.cpp557 DFS(Y, UpperBound, HasLoop); in AddPred()
570 void ScheduleDAGTopologicalSort::DFS(const SUnit *SU, int UpperBound, in DFS() function in ScheduleDAGTopologicalSort
736 DFS(TargetSU, UpperBound, HasLoop); in IsReachable()
/llvm-project-15.0.7/clang-tools-extra/pseudo/lib/
H A DGLR.cpp440 auto DFS = [&](const GSS::Node *N, unsigned I, auto &DFS) { in pop() argument
460 DFS(Parent, I + 1, DFS); in pop()
462 DFS(Head, 0, DFS); in pop()
/llvm-project-15.0.7/clang/test/CodeGenCXX/
H A Dstrict-vtable-pointers.cpp74 DynamicFromStatic DFS; in LocalObjects() local
75 DFS.bar(); in LocalObjects()
/llvm-project-15.0.7/clang/lib/StaticAnalyzer/Core/
H A DWorkList.cpp36 class DFS : public WorkList { class
82 return std::make_unique<DFS>(); in makeDFS()
H A DAnalyzerOptions.cpp69 .Case("dfs", ExplorationStrategyKind::DFS) in getExplorationStrategy()
/llvm-project-15.0.7/clang-tools-extra/pseudo/lib/grammar/
H A DGrammarBNF.cpp154 std::function<void(SymbolID)> DFS = [&](SymbolID SID) -> void { in getTopologicalOrder() local
167 DFS(It->second); in getTopologicalOrder()
172 DFS(ID); in getTopologicalOrder()
/llvm-project-15.0.7/llvm/lib/Transforms/Utils/
H A DLoopUnroll.cpp490 LoopBlocksDFS DFS(L); in UnrollLoop() local
491 DFS.perform(LI); in UnrollLoop()
494 LoopBlocksDFS::RPOIterator BlockBegin = DFS.beginRPO(); in UnrollLoop()
495 LoopBlocksDFS::RPOIterator BlockEnd = DFS.endRPO(); in UnrollLoop()
H A DLoopUnrollAndJam.cpp344 LoopBlocksDFS DFS(L); in UnrollAndJamLoop() local
345 DFS.perform(LI); in UnrollAndJamLoop()
347 LoopBlocksDFS::RPOIterator BlockBegin = DFS.beginRPO(); in UnrollAndJamLoop()
348 LoopBlocksDFS::RPOIterator BlockEnd = DFS.endRPO(); in UnrollAndJamLoop()
/llvm-project-15.0.7/llvm/lib/Transforms/IPO/
H A DPartialInlining.cpp462 std::vector<BasicBlock *> DFS; in computeOutliningColdRegionsInfo() local
464 DFS.push_back(CurrEntry); in computeOutliningColdRegionsInfo()
473 while (!DFS.empty()) { in computeOutliningColdRegionsInfo()
474 auto *ThisBB = DFS.back(); in computeOutliningColdRegionsInfo()
475 DFS.pop_back(); in computeOutliningColdRegionsInfo()
486 DFS.push_back(*SI); in computeOutliningColdRegionsInfo()
/llvm-project-15.0.7/llvm/docs/
H A DCycleTerminology.rst41 is always chosen as the header of some cycle C regardless of the DFS
113 This hierarchy arises when DFS visits the blocks in the order ``A``,
212 DFS, consider the smallest cycle C which contains P. For the sake
/llvm-project-15.0.7/lldb/source/Target/
H A DStackFrameList.cpp290 struct DFS { in FindInterveningFrames() struct
300 DFS(Function *end, ModuleList &images, Target &target, in FindInterveningFrames() argument
348 DFS(&end, images, target, exe_ctx).search(*first_edge, *first_callee, path); in FindInterveningFrames()
/llvm-project-15.0.7/llvm/docs/HistoricalNotes/
H A D2003-06-25-Reoptimizer1.txt33 1) Do a DFS from the first machine-code basic block of the hot loop
36 2) Do a DFS from the last machine-code basic block of the hot loop
/llvm-project-15.0.7/clang/include/clang/StaticAnalyzer/Core/
H A DAnalyzerOptions.h110 DFS, enumerator

12