Searched refs:DT (Results 1 - 25 of 182) sorted by relevance

12345678

/freebsd-11.0-release/contrib/dtc/
H A Ddtdiff11 DT="$1"
12 if [ -d "$DT" ]; then
14 elif [ -f "$DT" ]; then
15 case "$DT" in
26 echo "Unrecognized format for $DT" >&2
30 $DTC -I $IFORMAT -O dts -qq -f -s -o - "$DT"
/freebsd-11.0-release/contrib/llvm/include/llvm/Analysis/
H A DPostDominators.h26 DominatorTreeBase<BasicBlock>* DT; member in struct:llvm::PostDominatorTree
30 DT = new DominatorTreeBase<BasicBlock>(true);
42 return DT->getRoots();
46 return DT->getRootNode();
50 return DT->getNode(BB);
54 return DT->getNode(BB);
58 return DT->dominates(A, B);
62 return DT->dominates(A, B);
66 return DT->properlyDominates(A, B);
70 return DT
99 getEntryNode(PostDominatorTree *DT) argument
[all...]
H A DIteratedDominanceFrontier.h50 IDFCalculator(DominatorTreeBase<BasicBlock> &DT) : DT(DT), useLiveIn(false) {} argument
88 DominatorTreeBase<BasicBlock> &DT; member in class:llvm::IDFCalculator
H A DInstructionSimplify.h54 const DominatorTree *DT = nullptr,
63 const DominatorTree *DT = nullptr,
72 const DominatorTree *DT = nullptr,
81 const DominatorTree *DT = nullptr,
90 const DominatorTree *DT = nullptr,
98 const DominatorTree *DT = nullptr,
106 const DominatorTree *DT = nullptr,
114 const DominatorTree *DT = nullptr,
123 const DominatorTree *DT = nullptr,
131 const DominatorTree *DT
[all...]
H A DValueTracking.h49 const DominatorTree *DT = nullptr);
59 const DominatorTree *DT = nullptr);
67 const DominatorTree *DT = nullptr);
78 const DominatorTree *DT = nullptr);
87 const DominatorTree *DT = nullptr);
93 const DominatorTree *DT = nullptr);
100 const DominatorTree *DT = nullptr);
114 const DominatorTree *DT = nullptr);
127 const DominatorTree *DT = nullptr);
245 const DominatorTree *DT
[all...]
H A DCFG.h61 /// Using DT or LI allows us to answer more quickly. LI reduces the cost of
63 /// single block. DT reduces the cost by allowing the search to terminate when
64 /// we find a block that dominates the block containing 'To'. DT is most useful
68 const DominatorTree *DT = nullptr,
78 const DominatorTree *DT = nullptr,
90 const DominatorTree *DT = nullptr,
H A DPHITransAddr.h83 const DominatorTree *DT, bool MustDominate);
93 const DominatorTree &DT,
105 const DominatorTree *DT);
113 BasicBlock *PredBB, const DominatorTree &DT,
/freebsd-11.0-release/contrib/llvm/lib/Analysis/
H A DPostDominators.cpp34 DT->recalculate(F);
39 delete DT;
43 DT->print(OS);
H A DPHITransAddr.cpp147 const DominatorTree *DT) {
192 Value *PHIIn = PHITranslateSubExpr(Cast->getOperand(0), CurBB, PredBB, DT);
210 (!DT || DT->dominates(CastI->getParent(), PredBB)))
221 Value *GEPOp = PHITranslateSubExpr(GEP->getOperand(i), CurBB, PredBB, DT);
232 if (Value *V = SimplifyGEPInst(GEPOps, DL, TLI, DT, AC)) {
246 (!DT || DT->dominates(GEPI->getParent(), PredBB))) {
262 Value *LHS = PHITranslateSubExpr(Inst->getOperand(0), CurBB, PredBB, DT);
282 if (Value *Res = SimplifyAddInst(LHS, RHS, isNSW, isNUW, DL, TLI, DT, A
145 PHITranslateSubExpr(Value *V, BasicBlock *CurBB, BasicBlock *PredBB, const DominatorTree *DT) argument
315 PHITranslateValue(BasicBlock *CurBB, BasicBlock *PredBB, const DominatorTree *DT, bool MustDominate) argument
344 PHITranslateWithInsertion(BasicBlock *CurBB, BasicBlock *PredBB, const DominatorTree &DT, SmallVectorImpl<Instruction*> &NewInsts) argument
368 InsertPHITranslatedSubExpr(Value *InVal, BasicBlock *CurBB, BasicBlock *PredBB, const DominatorTree &DT, SmallVectorImpl<Instruction*> &NewInsts) argument
[all...]
H A DRegionInfo.cpp69 DominatorTree *DT, Region *Parent) :
70 RegionBase<RegionTraits<Function>>(Entry, Exit, RI, DT, Parent) {
99 DT = DT_;
104 this, DT, nullptr);
130 auto DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); local
134 RI.recalculate(F, DT, PDT, DF);
67 Region(BasicBlock *Entry, BasicBlock *Exit, RegionInfo* RI, DominatorTree *DT, Region *Parent) argument
/freebsd-11.0-release/contrib/llvm/include/llvm/Support/
H A DGenericDomTreeConstruction.h33 unsigned DFSPass(DominatorTreeBase<typename GraphT::NodeType>& DT, argument
39 InfoRec &VInfo = DT.Info[DT.Roots[i]];
46 InfoRec &SuccVInfo = DT.Info[*SI];
49 N = DTDFSPass(DT, *SI, N);
63 DT.Info[BB];
70 DT.Vertex.push_back(BB); // Vertex[n] = V;
95 DT.Info[Succ];
107 Eval(DominatorTreeBase<typename GraphT::NodeType> &DT, argument
110 DT
150 Calculate(DominatorTreeBase<typename GraphTraits<NodeT>::NodeType>& DT, FuncT& F) argument
[all...]
/freebsd-11.0-release/contrib/llvm/include/llvm/CodeGen/
H A DMachinePostDominators.h29 DominatorTreeBase<MachineBasicBlock> *DT; member in struct:llvm::MachinePostDominatorTree
41 return DT->getRoots();
45 return DT->getRootNode();
49 return DT->getNode(BB);
53 return DT->getNode(BB);
58 return DT->dominates(A, B);
62 return DT->dominates(A, B);
67 return DT->properlyDominates(A, B);
72 return DT->properlyDominates(A, B);
77 return DT
[all...]
H A DMachineDominators.h62 /// \brief Apply all the recorded critical edges to the DT.
63 /// This updates the underlying DT information in a way that uses
64 /// the fast query path of DT as much as possible.
71 DominatorTreeBase<MachineBasicBlock>* DT; member in class:llvm::MachineDominatorTree
79 return *DT;
90 return DT->getRoots();
95 return DT->getRoot();
100 return DT->getRootNode();
108 return DT->dominates(A, B);
114 return DT
276 getEntryNode(MachineDominatorTree *DT) argument
[all...]
/freebsd-11.0-release/contrib/llvm/include/llvm/Transforms/Utils/
H A DSimplifyIndVar.h36 const DominatorTree *DT; member in class:llvm::IVVisitor
42 IVVisitor(): DT(nullptr), ShouldSplitOverflowIntrinsics(false) {}
45 const DominatorTree *getDomTree() const { return DT; }
52 assert(DT && "Splitting overflow intrinsics requires a DomTree.");
60 bool simplifyUsersOfIV(PHINode *CurrIV, ScalarEvolution *SE, DominatorTree *DT,
66 bool simplifyLoopIVs(Loop *L, ScalarEvolution *SE, DominatorTree *DT,
H A DUnrollLoop.h34 LoopInfo *LI, ScalarEvolution *SE, DominatorTree *DT,
39 ScalarEvolution *SE, DominatorTree *DT,
H A DCodeExtractor.h48 DominatorTree *const DT; member in class:llvm::CodeExtractor
69 CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT = nullptr,
76 CodeExtractor(DominatorTree &DT, Loop &L, bool AggregateArgs = false);
82 CodeExtractor(DominatorTree &DT, const RegionNode &RN,
H A DPromoteMemToReg.h44 void PromoteMemToReg(ArrayRef<AllocaInst *> Allocas, DominatorTree &DT,
H A DBasicBlockUtils.h54 bool MergeBlockIntoPredecessor(BasicBlock *BB, DominatorTree *DT = nullptr,
83 DominatorTree *DT; member in struct:llvm::CriticalEdgeSplittingOptions
89 CriticalEdgeSplittingOptions(DominatorTree *DT = nullptr,
91 : DT(DT), LI(LI), MergeIdenticalEdges(false),
183 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr);
191 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr);
210 DominatorTree *DT = nullptr,
230 DominatorTree *DT = nullptr,
262 /// Updates DT i
[all...]
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/
H A DMachinePostDominators.cpp27 DT = new DominatorTreeBase<MachineBasicBlock>(true); //true indicate
38 DT->recalculate(F);
43 delete DT;
54 DT->print(OS);
H A DMachineDominators.cpp41 DT->recalculate(F);
49 DT = new DominatorTreeBase<MachineBasicBlock>(false);
53 delete DT;
57 DT->releaseMemory();
61 DT->print(OS);
77 // the underlying DT.
81 MachineDomTreeNode *SuccDTNode = DT->getNode(Succ);
97 // FromBB2 since Split2 is still unknown of the underlying DT structure.
104 if (!DT->dominates(SuccDTNode, DT
[all...]
H A DMachineRegionInfo.cpp26 MachineDominatorTree *DT, MachineRegion *Parent) :
27 RegionBase<RegionTraits<MachineFunction>>(Entry, Exit, RI, DT, Parent) {
58 DT = DT_;
64 TopLevelRegion = new MachineRegion(Entry, nullptr, this, DT, nullptr);
84 auto DT = &getAnalysis<MachineDominatorTree>(); local
88 RI.recalculate(F, DT, PDT, DF);
24 MachineRegion(MachineBasicBlock *Entry, MachineBasicBlock *Exit, MachineRegionInfo* RI, MachineDominatorTree *DT, MachineRegion *Parent) argument
/freebsd-11.0-release/contrib/llvm/tools/clang/include/clang/Analysis/Analyses/
H A DDominators.h41 llvm::DominatorTreeBase<CFGBlock>* DT; member in class:clang::DominatorTree
44 DT = new llvm::DominatorTreeBase<CFGBlock>(false);
47 ~DominatorTree() override { delete DT; }
49 llvm::DominatorTreeBase<CFGBlock>& getBase() { return *DT; }
54 return DT->getRoot();
60 return DT->getRootNode();
74 if (DT->compare(Other.getBase()))
85 DT->recalculate(*cfg);
95 if(DT->getNode(*I)->getIDom())
98 << DT
196 getEntryNode(::clang::DominatorTree *DT) argument
[all...]
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Utils/
H A DLCSSA.cpp64 static bool processInstruction(Loop &L, Instruction &Inst, DominatorTree &DT, argument
102 DomTreeNode *DomNode = DT.getNode(DomBB);
113 if (!DT.dominates(DomNode, DT.getNode(ExitBB)))
194 processInstruction(*OtherLoop, *I, DT, EBs, PredCache, LI);
209 DominatorTree &DT,
211 DomTreeNode *DomNode = DT.getNode(BB);
213 if (DT.dominates(DomNode, DT.getNode(ExitBB)))
219 bool llvm::formLCSSA(Loop &L, DominatorTree &DT, LoopInf argument
208 blockDominatesAnExit(BasicBlock *BB, DominatorTree &DT, const SmallVectorImpl<BasicBlock *> &ExitBlocks) argument
265 formLCSSARecursively(Loop &L, DominatorTree &DT, LoopInfo *LI, ScalarEvolution *SE) argument
285 DominatorTree *DT; member in struct:__anon3277::LCSSA
[all...]
H A DBreakCriticalEdges.cpp46 auto *DT = DTWP ? &DTWP->getDomTree() : nullptr; variable
50 SplitAllCriticalEdges(F, CriticalEdgeSplittingOptions(DT, LI));
199 auto *DT = Options.DT; local
201 if (!DT && !LI)
229 if (DT) {
230 DomTreeNode *TINode = DT->getNode(TIBB);
236 DomTreeNode *NewBBNode = DT->addNewBlock(NewBB, TIBB);
239 // If NewBBDominatesDestBB hasn't been computed yet, do so with DT.
241 DestBBNode = DT
[all...]
/freebsd-11.0-release/contrib/llvm/lib/Target/WebAssembly/
H A DWebAssemblyOptimizeReturned.cpp40 DominatorTree *DT; member in class:__anon3042::final
44 OptimizeReturned() : FunctionPass(ID), DT(nullptr) {}
66 if (DT->dominates(Inst, U))
73 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();

Completed in 213 milliseconds

12345678