| /freebsd-9.3-release/contrib/llvm/include/llvm/Analysis/ |
| H A D | LoopIterator.h | 50 /// preorder visited by DFS. It's postorder number is initially zero and set
63 /// Traverse the loop blocks and store the DFS result.
71 assert(isComplete() && "bad loop DFS");
78 assert(isComplete() && "bad loop DFS");
95 assert(I != PostNumbers.end() && "block not visited by DFS");
96 assert(I->second && "block not finished by DFS");
128 LoopBlocksDFS &DFS; member in class:llvm::LoopBlocksTraversal
133 DFS(Storage), LI(LInfo) {}
137 /// finishPostorder to record the DFS result.
139 assert(DFS
[all...] |
| H A D | LoopInfoImpl.h | 405 /// Populate all loop data in a stable order during a single forward DFS.
434 /// Top-level driver for the forward DFS within the loop.
447 // Push the next DFS successor onto the stack.
491 /// 2) Visited during a forward DFS CFG traversal.
492 /// 3) Reverse-inserted in the loop in postorder following forward DFS.
530 PopulateLoopsDFS<BlockT, LoopT> DFS(this);
531 DFS.traverse(DomRoot->getBlock());
|
| /freebsd-9.3-release/contrib/llvm/lib/Transforms/Instrumentation/ |
| H A D | DataFlowSanitizer.cpp | 205 DataFlowSanitizer &DFS; member in struct:__anon2600::DFSanFunction
218 DFSanFunction(DataFlowSanitizer &DFS, Function *F, bool IsNativeABI) argument
219 : DFS(DFS), F(F), IA(DFS.getInstrumentedABI()),
722 IRB.CreateICmpNE(*i, DFSF.DFS.ZeroShadow));
726 ThenIRB.CreateCall(DFSF.DFS.DFSanNonzeroLabelFn);
737 if (DFS.ArgTLS)
738 return ArgTLSPtr = DFS.ArgTLS;
741 return ArgTLSPtr = IRB.CreateCall(DFS
[all...] |
| /freebsd-9.3-release/contrib/llvm/lib/Analysis/ |
| H A D | LoopInfo.cpp | 427 LoopBlocksDFS DFS; member in class:__anon2072::UnloopUpdater
441 Unloop(UL), LI(LInfo), DFS(UL), FoundIB(false) {}
460 LoopBlocksTraversal Traversal(DFS, LI);
481 // the DFS result cached by Traversal.
489 for (LoopBlocksDFS::POIterator POI = DFS.beginPostorder(),
490 POE = DFS.endPostorder(); POI != POE; ++POI) {
534 assert(SubloopParents.count(Subloop) && "DFS failed to visit subloop");
579 assert((FoundIB || !DFS.hasPostorder(*I)) && "should have seen IB");
719 /// Traverse the loop blocks and store the DFS result.
720 /// Useful for clients that just want the final DFS resul
[all...] |
| /freebsd-9.3-release/contrib/llvm/lib/CodeGen/ |
| H A D | ScheduleDAGInstrs.cpp | 1059 /// Return true if this node been visited by the DFS traversal.
1172 /// Join the predecessor subtree with the successor that is its DFS
1272 SchedDAGReverseDFS DFS; local
1274 DFS.follow(SU);
1277 while (DFS.getPred() != DFS.getPredEnd()) {
1278 const SDep &PredDep = *DFS.getPred();
1279 DFS.advance();
1287 Impl.visitCrossEdge(PredDep, DFS.getCurr());
1291 DFS
[all...] |
| H A D | ScheduleDAG.cpp | 457 /// On insertion of the edge X->Y, the algorithm first marks by calling DFS
528 DFS(Y, UpperBound, HasLoop);
542 /// DFS - Make a DFS traversal to mark all nodes reachable from SU and mark
545 void ScheduleDAGTopologicalSort::DFS(const SUnit *SU, int UpperBound,
627 DFS(TargetSU, UpperBound, HasLoop);
|
| H A D | MachineScheduler.cpp | 2908 // Restore the heap in ReadyQ with the updated DFS results.
3098 const SchedDFSResult *DFS = local
3101 if (DFS)
3102 SS << " I:" << DFS->getNumInstrs(SU);
3112 const SchedDFSResult *DFS = local
3114 if (DFS) {
3116 Str += DOT::getColorString(DFS->getSubtreeID(N));
|
| /freebsd-9.3-release/contrib/llvm/lib/Transforms/Utils/ |
| H A D | LoopUnroll.cpp | 263 LoopBlocksDFS DFS(L);
264 DFS.perform(LI);
266 // Stash the DFS iterators before adding blocks to the loop.
267 LoopBlocksDFS::RPOIterator BlockBegin = DFS.beginRPO();
268 LoopBlocksDFS::RPOIterator BlockEnd = DFS.endRPO();
|
| /freebsd-9.3-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/ |
| H A D | CoreEngine.cpp | 43 class DFS : public WorkList { class in namespace:__anon3499
104 WorkList *WorkList::makeDFS() { return new DFS(); }
|
| /freebsd-9.3-release/sys/pci/ |
| H A D | ncrreg.h | 164 #define DFS 0x20 /* mod: dma fifo size */ macro
|
| H A D | ncr.c | 3562 np->rv_ctest5 |= DFS; /* Dma Fifo Size */
3668 (np->rv_ctest5 & DFS) ? "large" : "normal");
5650 ctest5 = (np->rv_ctest5 & DFS) ? INB (nc_ctest5) : 0;
5651 if (ctest5 & DFS)
|
| /freebsd-9.3-release/contrib/llvm/include/llvm/CodeGen/ |
| H A D | ScheduleDAG.h | 686 /// Visited - a set of nodes visited during a DFS traversal.
689 /// DFS - make a DFS traversal and mark all nodes affected by the
692 void DFS(const SUnit *SU, int UpperBound, bool& HasLoop);
|
| /freebsd-9.3-release/sys/dev/sym/ |
| H A D | sym_defs.h | 382 #define DFS 0x20 /* mod: dma fifo size */ macro
|
| H A D | sym_hipd.c | 2637 np->rv_ctest5 |= DFS; /* Dma Fifo Size */
4255 if (dfifo & (DFS << 16))
|
| /freebsd-9.3-release/contrib/llvm/lib/Transforms/Vectorize/ |
| H A D | LoopVectorize.cpp | 2141 LoopBlocksDFS DFS(OrigLoop);
2142 DFS.perform(LI);
2145 for (LoopBlocksDFS::RPOIterator bb = DFS.beginRPO(),
2146 be = DFS.endRPO(); bb != be; ++bb)
4676 LoopBlocksDFS DFS(TheLoop);
4677 DFS.perform(LI);
4697 for (LoopBlocksDFS::RPOIterator bb = DFS.beginRPO(),
4698 be = DFS.endRPO(); bb != be; ++bb) {
|
| /freebsd-9.3-release/crypto/heimdal/ |
| H A D | configure | 1639 --enable-dce if you want support for DCE/DFS PAG's
[all...] |