| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/ |
| H A D | DataFlowSanitizer.cpp | 539 DataFlowSanitizer &DFS; member
575 : DFS(DFS), F(F), IA(DFS.getInstrumentedABI()), IsNativeABI(IsNativeABI) { in DFSanFunction()
1624 Value *Base = IRB.CreatePointerCast(DFS.ArgTLS, DFS.IntptrTy); in getArgTLS()
1633 DFS.RetvalTLS, PointerType::get(DFS.getShadowTy(T), 0), "_dfsret"); in getRetvalTLS()
1639 return IRB.CreateConstGEP2_64(DFS.ArgOriginTLSTy, DFS.ArgOriginTLS, 0, ArgNo, in getArgOriginTLS()
1646 return DFS.ZeroOrigin; in getOrigin()
1827 if (DFS.isZeroShadow(V1)) in combineShadows()
1910 return DFS.ZeroOrigin; in combineOrigins()
2015 ShadowSize == 4 ? Type::getInt32Ty(*DFS.Ctx) : Type::getInt64Ty(*DFS.Ctx); in loadShadowFast()
2173 DFS.DFSanUnionLoadFn, {ShadowAddr, ConstantInt::get(DFS.IntptrTy, Size)}); in loadShadowOriginSansLoadTracking()
[all …]
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | LoopIterator.h | 174 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 …]
|
| H A D | LoopInfoImpl.h | 572 PopulateLoopsDFS<BlockT, LoopT> DFS(this); in analyze()
573 DFS.traverse(DomRoot->getBlock()); in analyze()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | LoopSimplifyCFG.cpp | 125 LoopBlocksDFS DFS; member in __anon5e6c24be0111::ConstantTerminatorFoldingImpl
190 bool hasIrreducibleCFG(LoopBlocksDFS &DFS) { in hasIrreducibleCFG() argument
191 assert(DFS.isComplete() && "DFS is expected to be finished"); in hasIrreducibleCFG()
195 for (auto I = DFS.beginRPO(), E = DFS.endRPO(); I != E; ++I) in hasIrreducibleCFG()
198 for (auto I = DFS.beginRPO(), E = DFS.endRPO(); I != E; ++I) { in hasIrreducibleCFG()
213 DFS.perform(&LI); in analyze()
214 assert(DFS.isComplete() && "DFS is expected to be finished"); in analyze()
223 if (hasIrreducibleCFG(DFS)) { in analyze()
230 for (auto I = DFS.beginRPO(), E = DFS.endRPO(); I != E; ++I) { in analyze()
302 for (auto I = DFS.beginPostorder(), E = DFS.endPostorder(); I != E; ++I) { in analyze()
[all …]
|
| /freebsd-13.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-13.1/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | DDG.cpp | 206 LoopBlocksDFS DFS(&L); in DataDependenceGraph() local
207 DFS.perform(&LI); in DataDependenceGraph()
209 append_range(BBList, make_range(DFS.beginRPO(), DFS.endRPO())); in DataDependenceGraph()
|
| H A D | LoopInfo.cpp | 687 LoopBlocksDFS DFS; member in __anon2f4fe09d0511::UnloopUpdater
701 : Unloop(*UL), LI(LInfo), DFS(UL), FoundIB(false) {} in UnloopUpdater()
720 LoopBlocksTraversal Traversal(DFS, LI); in updateBlockParents()
747 for (LoopBlocksDFS::POIterator POI = DFS.beginPostorder(), in updateBlockParents()
748 POE = DFS.endPostorder(); in updateBlockParents()
834 assert((FoundIB || !DFS.hasPostorder(*I)) && "should have seen IB"); in getNearestLoop()
|
| H A D | VectorUtils.cpp | 967 LoopBlocksDFS DFS(TheLoop); in collectConstStrideAccesses() local
968 DFS.perform(LI); in collectConstStrideAccesses()
969 for (BasicBlock *BB : make_range(DFS.beginRPO(), DFS.endRPO())) in collectConstStrideAccesses()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | ScheduleDAGInstrs.cpp | 1461 SchedDAGReverseDFS DFS; in compute() local
1463 DFS.follow(&SU); in compute()
1466 while (DFS.getPred() != DFS.getPredEnd()) { in compute()
1467 const SDep &PredDep = *DFS.getPred(); in compute()
1468 DFS.advance(); in compute()
1476 Impl.visitCrossEdge(PredDep, DFS.getCurr()); in compute()
1480 DFS.follow(PredDep.getSUnit()); in compute()
1483 const SUnit *Child = DFS.getCurr(); in compute()
1484 const SDep *PredDep = DFS.backtrack(); in compute()
1487 Impl.visitPostorderEdge(*PredDep, DFS.getCurr()); in compute()
[all …]
|
| H A D | ScheduleDAG.cpp | 557 DFS(Y, UpperBound, HasLoop); in AddPred()
570 void ScheduleDAGTopologicalSort::DFS(const SUnit *SU, int UpperBound, in DFS() function in ScheduleDAGTopologicalSort
737 DFS(TargetSU, UpperBound, HasLoop); in IsReachable()
|
| H A D | MachineScheduler.cpp | 3908 const SchedDFSResult *DFS = DAG->hasVRegLiveness() ? in getNodeLabel() local
3911 if (DFS) in getNodeLabel()
3912 SS << " I:" << DFS->getNumInstrs(SU); in getNodeLabel()
3923 const SchedDFSResult *DFS = DAG->hasVRegLiveness() ? in getNodeAttributes() local
3925 if (DFS) { in getNodeAttributes()
3927 Str += DOT::getColorString(DFS->getSubtreeID(N)); in getNodeAttributes()
|
| /freebsd-13.1/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/ |
| H A D | WorkList.cpp | 36 class DFS : public WorkList { class
82 return std::make_unique<DFS>(); in makeDFS()
|
| H A D | AnalyzerOptions.cpp | 69 .Case("dfs", ExplorationStrategyKind::DFS) in getExplorationStrategy()
|
| /freebsd-13.1/sys/contrib/device-tree/Bindings/clock/ |
| H A D | mvebu-cpu-clock.txt | 8 by address and length of the PMU DFS registers
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | LoopUnroll.cpp | 480 LoopBlocksDFS DFS(L); in UnrollLoop() local
481 DFS.perform(LI); in UnrollLoop()
484 LoopBlocksDFS::RPOIterator BlockBegin = DFS.beginRPO(); in UnrollLoop()
485 LoopBlocksDFS::RPOIterator BlockEnd = DFS.endRPO(); in UnrollLoop()
|
| H A D | LoopUnrollAndJam.cpp | 346 LoopBlocksDFS DFS(L); in UnrollAndJamLoop() local
347 DFS.perform(LI); in UnrollAndJamLoop()
349 LoopBlocksDFS::RPOIterator BlockBegin = DFS.beginRPO(); in UnrollAndJamLoop()
350 LoopBlocksDFS::RPOIterator BlockEnd = DFS.endRPO(); in UnrollAndJamLoop()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
| H A D | PartialInlining.cpp | 467 std::vector<BasicBlock *> DFS; in computeOutliningColdRegionsInfo() local
469 DFS.push_back(CurrEntry); in computeOutliningColdRegionsInfo()
478 while (!DFS.empty()) { in computeOutliningColdRegionsInfo()
479 auto *ThisBB = DFS.back(); in computeOutliningColdRegionsInfo()
480 DFS.pop_back(); in computeOutliningColdRegionsInfo()
491 DFS.push_back(*SI); in computeOutliningColdRegionsInfo()
|
| /freebsd-13.1/contrib/llvm-project/lldb/source/Target/ |
| H A D | StackFrameList.cpp | 289 struct DFS { in FindInterveningFrames() struct
299 DFS(Function *end, ModuleList &images, Target &target, in FindInterveningFrames() function
347 DFS(&end, images, target, exe_ctx).search(*first_edge, *first_callee, path); in FindInterveningFrames()
|
| /freebsd-13.1/sys/contrib/device-tree/Bindings/cpufreq/ |
| H A D | brcm,stb-avs-cpu-freq.txt | 16 firmware. On some SoCs, this firmware supports DFS and DVFS in addition to
|
| /freebsd-13.1/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/ |
| H A D | AnalyzerOptions.h | 124 DFS, enumerator
|
| /freebsd-13.1/sys/contrib/dev/iwlwifi/ |
| H A D | iwl-eeprom-parse.c | 499 CHECK_AND_PRINT(DFS), in iwl_mod_ht40_chan_info()
582 CHECK_AND_PRINT_I(DFS), in iwl_init_channel_map()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/LiveDebugValues/ |
| H A D | InstrRefBasedImpl.cpp | 3230 DFS; in vlocDataflow() local
3238 DFS.push_back(std::make_pair(succ, succ->succ_begin())); in vlocDataflow()
3243 while (!DFS.empty()) { in vlocDataflow()
3244 const MachineBasicBlock *CurBB = DFS.back().first; in vlocDataflow()
3245 MachineBasicBlock::const_succ_iterator &CurSucc = DFS.back().second; in vlocDataflow()
3248 DFS.pop_back(); in vlocDataflow()
3255 DFS.push_back(std::make_pair(*CurSucc, (*CurSucc)->succ_begin())); in vlocDataflow()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Target/ARM/ |
| H A D | ARMLowOverheadLoops.cpp | 1720 PostOrderLoopTraversal DFS(LoLoop.ML, *MLI); in Expand() local
1721 DFS.ProcessLoop(); in Expand()
1722 const SmallVectorImpl<MachineBasicBlock*> &PostOrder = DFS.getOrder(); in Expand()
|
| /freebsd-13.1/sys/dev/sym/ |
| H A D | sym_defs.h | 384 #define DFS 0x20 /* mod: dma fifo size */ macro
|
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | ScheduleDAG.h | 715 void DFS(const SUnit *SU, int UpperBound, bool& HasLoop);
|