| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Instrumentation/ |
| H A D | DataFlowSanitizer.cpp | 564 DataFlowSanitizer &DFS; member
600 DFSanFunction(DataFlowSanitizer &DFS, Function *F, bool IsNativeABI) in DFSanFunction()
601 : DFS(DFS), F(F), IA(DFS.getInstrumentedABI()), IsNativeABI(IsNativeABI) { in DFSanFunction()
987 Type *ShadowTy = DFS.getShadowTy(T); in expandFromPrimitiveShadow()
992 if (DFS.isZeroShadow(PrimitiveShadow)) in expandFromPrimitiveShadow()
993 return DFS.getZeroShadow(ShadowTy); in expandFromPrimitiveShadow()
1010 return DFS.ZeroPrimitiveShadow; in collapseAggregateShadow()
1041 assert(DFS.shouldTrackFieldsAndIndices()); in collapseToPrimitiveShadow()
1714 IRB.CreateICmpNE(PrimitiveShadow, DFSF.DFS.ZeroPrimitiveShadow); in runImpl()
1718 ThenIRB.CreateCall(DFSF.DFS.DFSanNonzeroLabelFn, {}); in runImpl()
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/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()
185 LoopBlocksDFS::RPOIterator begin() const { return DFS.beginRPO(); } in begin()
186 LoopBlocksDFS::RPOIterator end() const { return DFS.endRPO(); } in end()
206 LoopBlocksDFS &DFS;
211 DFS(Storage), LI(LInfo) {} in LoopBlocksTraversal()
217 assert(DFS.PostBlocks.empty() && "Need clear DFS result before traversing"); in begin()
218 assert(DFS.L->getNumBlocks() && "po_iterator cannot handle an empty graph"); in begin()
219 return po_ext_begin(DFS.L->getHeader(), *this); in begin()
[all …]
|
| H A D | LoopInfoImpl.h | 572 PopulateLoopsDFS<BlockT, LoopT> DFS(this); in analyze()
573 DFS.traverse(DomRoot->getBlock()); in analyze()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| H A D | LoopSimplifyCFG.cpp | 125 LoopBlocksDFS DFS; member in __anone26eb4350111::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 …]
|
| /netbsd-src/external/bsd/file/dist/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
|
| H A D | svf | 5 0 string DFS\ File\x0D\x0Ahttp://www.difstream.com\x0D\x0A SmartVersion binary patch file
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| H A D | ScheduleDAGInstrs.cpp | 1463 SchedDAGReverseDFS DFS; in compute() local
1465 DFS.follow(&SU); in compute()
1468 while (DFS.getPred() != DFS.getPredEnd()) { in compute()
1469 const SDep &PredDep = *DFS.getPred(); in compute()
1470 DFS.advance(); in compute()
1478 Impl.visitCrossEdge(PredDep, DFS.getCurr()); in compute()
1482 DFS.follow(PredDep.getSUnit()); in compute()
1485 const SUnit *Child = DFS.getCurr(); in compute()
1486 const SDep *PredDep = DFS.backtrack(); in compute()
1489 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()
|
| /netbsd-src/external/apache2/llvm/dist/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 __anonf52862140511::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 | 958 LoopBlocksDFS DFS(TheLoop); in collectConstStrideAccesses() local
959 DFS.perform(LI); in collectConstStrideAccesses()
960 for (BasicBlock *BB : make_range(DFS.beginRPO(), DFS.endRPO())) in collectConstStrideAccesses()
|
| /netbsd-src/external/apache2/llvm/dist/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()
|
| /netbsd-src/external/gpl3/gcc/dist/gcc/ |
| H A D | lto-streamer-out.cc | 596 class DFS class
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, in DFS() function in DFS
941 DFS::~DFS () in ~DFS()
950 DFS::DFS_write_tree_body (struct output_block *ob, in DFS_write_tree_body()
1585 DFS::scc_entry_compare (const void *p1_, const void *p2_) in scc_entry_compare()
1600 DFS::hash_scc (struct output_block *ob, unsigned first, unsigned size, in hash_scc()
1677 DFS again (ob, sccstack[first+firstunique].t, ref_p, this_ref_p, in hash_scc()
1751 DFS::DFS_write_tree (struct output_block *ob, sccs *from_state, in DFS_write_tree()
[all …]
|
| /netbsd-src/external/gpl3/gcc.old/dist/gcc/ |
| H A D | lto-streamer-out.c | 576 class DFS
579 DFS (struct output_block *ob, tree expr, bool ref_p, bool this_ref_p,
581 ~DFS ();
665 DFS::DFS (struct output_block *ob, tree expr, bool ref_p, bool this_ref_p, in DFS() function
897 DFS::~DFS () in ~DFS()
906 DFS::DFS_write_tree_body (struct output_block *ob, in DFS_write_tree_body()
1546 DFS::scc_entry_compare (const void *p1_, const void *p2_) in scc_entry_compare()
1561 DFS::hash_scc (struct output_block *ob, unsigned first, unsigned size, in hash_scc()
1638 DFS again (ob, sccstack[first+firstunique].t, ref_p, this_ref_p, in hash_scc()
1712 DFS::DFS_write_tree (struct output_block *ob, sccs *from_state, in DFS_write_tree()
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| H A D | LoopUnroll.cpp | 560 LoopBlocksDFS DFS(L); in UnrollLoop() local
561 DFS.perform(LI); in UnrollLoop()
564 LoopBlocksDFS::RPOIterator BlockBegin = DFS.beginRPO(); in UnrollLoop()
565 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()
|
| /netbsd-src/sys/arch/landisk/stand/bootxx/ |
| H A D | Makefile.bootxx | 25 CPPFLAGS+= -DFS=${FS}
|
| /netbsd-src/external/apache2/llvm/dist/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()
|
| /netbsd-src/sys/arch/i386/stand/bootxx/ |
| H A D | Makefile.bootxx | 52 CPPFLAGS+= -DFS=${FS}
|
| /netbsd-src/external/apache2/llvm/dist/llvm/docs/HistoricalNotes/ |
| H A D | 2003-06-25-Reoptimizer1.txt | 33 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
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/LiveDebugValues/ |
| H A D | InstrRefBasedImpl.cpp | 2934 DFS; in vlocDataflow() local
2942 DFS.push_back(std::make_pair(succ, succ->succ_begin())); in vlocDataflow()
2947 while (!DFS.empty()) { in vlocDataflow()
2948 const MachineBasicBlock *CurBB = DFS.back().first; in vlocDataflow()
2949 MachineBasicBlock::const_succ_iterator &CurSucc = DFS.back().second; in vlocDataflow()
2952 DFS.pop_back(); in vlocDataflow()
2959 DFS.push_back(std::make_pair(*CurSucc, (*CurSucc)->succ_begin())); in vlocDataflow()
|
| /netbsd-src/external/apache2/llvm/dist/clang/include/clang/StaticAnalyzer/Core/ |
| H A D | AnalyzerOptions.h | 124 DFS, enumerator
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/ARM/ |
| H A D | ARMLowOverheadLoops.cpp | 1643 PostOrderLoopTraversal DFS(LoLoop.ML, *MLI); in Expand() local
1644 DFS.ProcessLoop(); in Expand()
1645 const SmallVectorImpl<MachineBasicBlock*> &PostOrder = DFS.getOrder(); in Expand()
|
| /netbsd-src/crypto/external/bsd/heimdal/dist/ |
| H A D | configure.ac | 230 AS_HELP_STRING([--enable-dce],[if you want support for DCE/DFS PAG's]))
232 AC_DEFINE(DCE, 1, [Define if you want support for DCE/DFS PAG's.])
|