| /freebsd-12.1/contrib/llvm/include/llvm/Analysis/ |
| H A D | LoopIterator.h | 175 LoopBlocksDFS DFS;
178 LoopBlocksRPO(Loop *Container) : DFS(Container) {} in LoopBlocksRPO()
182 DFS.perform(LI); in perform()
207 LoopBlocksDFS &DFS;
212 DFS(Storage), LI(LInfo) {} in LoopBlocksTraversal()
220 return po_ext_begin(DFS.L->getHeader(), *this); in begin()
224 return po_ext_end(DFS.L->getHeader(), *this); in end()
233 if (!DFS.L->contains(LI->getLoopFor(BB))) in visitPreorder()
236 return DFS.PostNumbers.insert(std::make_pair(BB, 0)).second; in visitPreorder()
243 DFS.PostBlocks.push_back(BB); in finishPostorder()
[all …]
|
| H A D | LoopInfoImpl.h | 578 PopulateLoopsDFS<BlockT, LoopT> DFS(this); in analyze()
579 DFS.traverse(DomRoot->getBlock()); in analyze()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/Instrumentation/ |
| H A D | DataFlowSanitizer.cpp | 384 DataFlowSanitizer &DFS; member
408 : DFS(DFS), F(F), IA(DFS.getInstrumentedABI()), IsNativeABI(IsNativeABI) { in DFSanFunction()
981 if (DFS.ArgTLS) in getArgTLSPtr()
991 if (DFS.RetvalTLS) in getRetvalTLS()
1005 return DFS.ZeroShadow; in getShadow()
1064 if (V1 == DFS.ZeroShadow) in combineShadows()
1146 return DFS.ZeroShadow; in combineOperandShadows()
1186 return DFS.ZeroShadow; in loadShadow()
1191 return DFS.ZeroShadow; in loadShadow()
1270 DFS.DFSanUnionLoadFn, {ShadowAddr, ConstantInt::get(DFS.IntptrTy, Size)}); in loadShadow()
[all …]
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/Scalar/ |
| H A D | LoopSimplifyCFG.cpp | 155 bool hasIrreducibleCFG(LoopBlocksDFS &DFS) { in hasIrreducibleCFG() argument
156 assert(DFS.isComplete() && "DFS is expected to be finished"); in hasIrreducibleCFG()
160 for (auto I = DFS.beginRPO(), E = DFS.endRPO(); I != E; ++I) in hasIrreducibleCFG()
163 for (auto I = DFS.beginRPO(), E = DFS.endRPO(); I != E; ++I) { in hasIrreducibleCFG()
178 LoopBlocksDFS DFS(&L); in analyze() local
179 DFS.perform(&LI); in analyze()
180 assert(DFS.isComplete() && "DFS is expected to be finished"); in analyze()
189 if (hasIrreducibleCFG(DFS)) { in analyze()
196 for (auto I = DFS.beginRPO(), E = DFS.endRPO(); I != E; ++I) { in analyze()
265 for (auto I = DFS.beginPostorder(), E = DFS.endPostorder(); I != E; ++I) { in analyze()
|
| /freebsd-12.1/contrib/llvm/lib/Target/AMDGPU/ |
| H A D | AMDGPUAnnotateUniformValues.cpp | 81 static void DFS(BasicBlock *Root, SetVector<BasicBlock*> & Set) { in DFS() function
84 DFS(I, Set); in DFS()
107 DFS(Start, Checklist); in isClobberedInFunction()
|
| /freebsd-12.1/contrib/file/magic/Magdir/ |
| H A D | dyadic | 50 >>>1 byte 0x16 DFS component file 64-bit level 1 journaled checksummed
51 >>>1 byte 0x17 DFS component file 64-bit level 2 journaled checksummed
52 >>>1 byte 0x18 DFS component file 64-bit level 3 journaled checksummed
|
| /freebsd-12.1/contrib/llvm/lib/CodeGen/ |
| H A D | ScheduleDAGInstrs.cpp | 1392 SchedDAGReverseDFS DFS; in compute() local
1394 DFS.follow(&SU); in compute()
1397 while (DFS.getPred() != DFS.getPredEnd()) { in compute()
1398 const SDep &PredDep = *DFS.getPred(); in compute()
1399 DFS.advance(); in compute()
1407 Impl.visitCrossEdge(PredDep, DFS.getCurr()); in compute()
1411 DFS.follow(PredDep.getSUnit()); in compute()
1414 const SUnit *Child = DFS.getCurr(); in compute()
1415 const SDep *PredDep = DFS.backtrack(); in compute()
1418 Impl.visitPostorderEdge(*PredDep, DFS.getCurr()); in compute()
[all …]
|
| H A D | ScheduleDAG.cpp | 522 DFS(Y, UpperBound, HasLoop); in AddPred()
533 void ScheduleDAGTopologicalSort::DFS(const SUnit *SU, int UpperBound, in DFS() function in ScheduleDAGTopologicalSort
690 DFS(TargetSU, UpperBound, HasLoop); in IsReachable()
|
| H A D | MachineScheduler.cpp | 3686 const SchedDFSResult *DFS = DAG->hasVRegLiveness() ? in getNodeLabel() local
3689 if (DFS) in getNodeLabel()
3690 SS << " I:" << DFS->getNumInstrs(SU); in getNodeLabel()
3701 const SchedDFSResult *DFS = DAG->hasVRegLiveness() ? in getNodeAttributes() local
3703 if (DFS) { in getNodeAttributes()
3705 Str += DOT::getColorString(DFS->getSubtreeID(N)); in getNodeAttributes()
|
| /freebsd-12.1/contrib/llvm/lib/Analysis/ |
| H A D | LoopInfo.cpp | 419 LoopBlocksDFS DFS; member in __anona6d42f2e0511::UnloopUpdater
433 : Unloop(*UL), LI(LInfo), DFS(UL), FoundIB(false) {} in UnloopUpdater()
452 LoopBlocksTraversal Traversal(DFS, LI); in updateBlockParents()
479 for (LoopBlocksDFS::POIterator POI = DFS.beginPostorder(), in updateBlockParents()
480 POE = DFS.endPostorder(); in updateBlockParents()
567 assert((FoundIB || !DFS.hasPostorder(*I)) && "should have seen IB"); in getNearestLoop()
|
| H A D | VectorUtils.cpp | 730 LoopBlocksDFS DFS(TheLoop); in collectConstStrideAccesses() local
731 DFS.perform(LI); in collectConstStrideAccesses()
732 for (BasicBlock *BB : make_range(DFS.beginRPO(), DFS.endRPO())) in collectConstStrideAccesses()
|
| /freebsd-12.1/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/ |
| H A D | WorkList.cpp | 37 class DFS : public WorkList { class
83 return llvm::make_unique<DFS>(); in makeDFS()
|
| H A D | AnalyzerOptions.cpp | 57 .Case("dfs", ExplorationStrategyKind::DFS) in getExplorationStrategy()
|
| H A D | CoreEngine.cpp | 59 case ExplorationStrategyKind::DFS: in generateWorkList()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/Utils/ |
| H A D | LoopUnroll.cpp | 580 LoopBlocksDFS DFS(L); in UnrollLoop() local
581 DFS.perform(LI); in UnrollLoop()
584 LoopBlocksDFS::RPOIterator BlockBegin = DFS.beginRPO(); in UnrollLoop()
585 LoopBlocksDFS::RPOIterator BlockEnd = DFS.endRPO(); in UnrollLoop()
|
| H A D | LoopUnrollAndJam.cpp | 293 LoopBlocksDFS DFS(L); in UnrollAndJamLoop() local
294 DFS.perform(LI); in UnrollAndJamLoop()
296 LoopBlocksDFS::RPOIterator BlockBegin = DFS.beginRPO(); in UnrollAndJamLoop()
297 LoopBlocksDFS::RPOIterator BlockEnd = DFS.endRPO(); in UnrollAndJamLoop()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/IPO/ |
| H A D | PartialInlining.cpp | 455 std::vector<BasicBlock *> DFS; in computeOutliningColdRegionsInfo() local
457 DFS.push_back(CurrEntry); in computeOutliningColdRegionsInfo()
465 while (!DFS.empty()) { in computeOutliningColdRegionsInfo()
466 auto *thisBB = DFS.back(); in computeOutliningColdRegionsInfo()
467 DFS.pop_back(); in computeOutliningColdRegionsInfo()
478 DFS.push_back(*SI); in computeOutliningColdRegionsInfo()
|
| /freebsd-12.1/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/ |
| H A D | AnalyzerOptions.h | 124 DFS, enumerator
|
| /freebsd-12.1/contrib/llvm/tools/lldb/source/Target/ |
| H A D | StackFrameList.cpp | 284 struct DFS { in FindInterveningFrames() struct
292 DFS(Function *end, ModuleList &images) : end(end), images(images) {} in FindInterveningFrames() argument
334 DFS(&end, images).search(first_callee, path); in FindInterveningFrames()
|
| /freebsd-12.1/sys/dev/ncr/ |
| H A D | ncrreg.h | 164 #define DFS 0x20 /* mod: dma fifo size */ macro
|
| H A D | ncr.c | 3536 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-12.1/sys/dev/sym/ |
| H A D | sym_defs.h | 384 #define DFS 0x20 /* mod: dma fifo size */ macro
|
| /freebsd-12.1/contrib/llvm/include/llvm/CodeGen/ |
| H A D | ScheduleDAG.h | 708 void DFS(const SUnit *SU, int UpperBound, bool& HasLoop);
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/Vectorize/ |
| H A D | LoopVectorize.cpp | 5079 LoopBlocksDFS DFS(TheLoop); in calculateRegisterUsage() local
5080 DFS.perform(LI); in calculateRegisterUsage()
5099 for (BasicBlock *BB : make_range(DFS.beginRPO(), DFS.endRPO())) { in calculateRegisterUsage()
6782 LoopBlocksDFS DFS(OrigLoop); in buildVPlanWithVPRecipes() local
6783 DFS.perform(LI); in buildVPlanWithVPRecipes()
6785 for (BasicBlock *BB : make_range(DFS.beginRPO(), DFS.endRPO())) { in buildVPlanWithVPRecipes()
|
| /freebsd-12.1/crypto/heimdal/ |
| H A D | NEWS | 620 * implement more DCE/DFS support, enabled with --enable-dce, see
|