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

1234567891011>>

/freebsd-11-stable/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-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DOrderedInstructions.h35 DominatorTree *DT; member in class:llvm::OrderedInstructions
44 OrderedInstructions(DominatorTree *DT) : DT(DT) {} argument
H A DInstructionPrecedenceTracking.h52 InstructionPrecedenceTracking(DominatorTree *DT) argument
53 : OI(OrderedInstructions(DT)) {}
99 ImplicitControlFlowTracking(DominatorTree *DT) argument
100 : InstructionPrecedenceTracking(DT) {}
124 MemoryWriteTracking(DominatorTree *DT) : InstructionPrecedenceTracking(DT) {} argument
H A DPostDominators.h76 PostDominatorTree DT; member in struct:llvm::PostDominatorTreeWrapperPass
80 PostDominatorTree &getPostDomTree() { return DT; }
81 const PostDominatorTree &getPostDomTree() const { return DT; }
92 DT.releaseMemory();
102 static NodeRef getEntryNode(PostDominatorTree *DT) { argument
103 return DT->getRootNode();
H A DLoads.h33 const DominatorTree *DT = nullptr);
43 const DominatorTree *DT = nullptr);
52 const DominatorTree *DT = nullptr);
56 /// If DT and ScanFrom are specified this method performs context-sensitive
65 const DominatorTree *DT = nullptr);
76 DominatorTree &DT);
80 /// If DT and ScanFrom are specified this method performs context-sensitive
89 const DominatorTree *DT = nullptr);
H A DTypeMetadataUtils.h44 DominatorTree &DT);
52 const CallInst *CI, DominatorTree &DT);
H A DPHITransAddr.h82 const DominatorTree *DT, bool MustDominate);
92 const DominatorTree &DT,
104 const DominatorTree *DT);
112 BasicBlock *PredBB, const DominatorTree &DT,
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineDominators.cpp60 DT.reset(new DomTreeBase<MachineBasicBlock>());
61 DT->recalculate(F);
71 DT.reset(nullptr);
75 if (DT && VerifyMachineDomInfo)
76 if (!DT->verify(DomTreeT::VerificationLevel::Basic)) {
83 if (DT)
84 DT->print(OS);
100 // the underlying DT.
104 MachineDomTreeNode *SuccDTNode = DT->getNode(Succ);
120 // FromBB2 since Split2 is still unknown of the underlying DT structur
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DCodeMoverUtils.h31 const DominatorTree &DT,
40 const DominatorTree &DT,
45 const DominatorTree &DT, const PostDominatorTree &PDT,
51 const DominatorTree &DT, const PostDominatorTree &PDT,
H A DSimplifyIndVar.h34 const DominatorTree *DT = nullptr; member in class:llvm::IVVisitor
42 const DominatorTree *getDomTree() const { return DT; }
48 bool simplifyUsersOfIV(PHINode *CurrIV, ScalarEvolution *SE, DominatorTree *DT,
54 bool simplifyLoopIVs(Loop *L, ScalarEvolution *SE, DominatorTree *DT,
H A DLoopSimplify.h62 bool simplifyLoop(Loop *L, DominatorTree *DT, LoopInfo *LI, ScalarEvolution *SE,
H A DPromoteMemToReg.h40 void PromoteMemToReg(ArrayRef<AllocaInst *> Allocas, DominatorTree &DT,
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericDomTreeConstruction.h176 TreeNodePtr getNodeForBlock(NodePtr BB, DomTreeT &DT) { argument
177 if (TreeNodePtr Node = DT.getNode(BB)) return Node;
183 assert(IDom || DT.DomTreeNodes[nullptr]);
184 TreeNodePtr IDomNode = getNodeForBlock(IDom, DT);
188 return (DT.DomTreeNodes[BB] = IDomNode->addChild(
304 void runSemiNCA(DomTreeT &DT, const unsigned MinLevel = 0) { argument
325 const TreeNodePtr TN = DT.getNode(N);
375 static NodePtr GetEntryNode(const DomTreeT &DT) { argument
376 assert(DT.Parent && "Parent not set");
377 return GraphTraits<typename DomTreeT::ParentPtr>::getEntryNode(DT
383 FindRoots(const DomTreeT &DT, BatchUpdatePtr BUI) argument
510 RemoveRedundantRoots(const DomTreeT &DT, BatchUpdatePtr BUI, RootsT &Roots) argument
550 doFullDFSWalk(const DomTreeT &DT, DescendCondition DC) argument
562 CalculateFromScratch(DomTreeT &DT, BatchUpdatePtr BUI) argument
594 attachNewSubtree(DomTreeT& DT, const TreeNodePtr AttachTo) argument
618 reattachExistingSubtree(DomTreeT &DT, const TreeNodePtr AttachTo) argument
649 InsertEdge(DomTreeT &DT, const BatchUpdatePtr BUI, const NodePtr From, const NodePtr To) argument
682 UpdateRootsBeforeInsertion(DomTreeT &DT, const BatchUpdatePtr BUI, const TreeNodePtr From, const TreeNodePtr To) argument
715 UpdateRootsAfterUpdate(DomTreeT &DT, const BatchUpdatePtr BUI) argument
741 InsertReachable(DomTreeT &DT, const BatchUpdatePtr BUI, const TreeNodePtr From, const TreeNodePtr To) argument
848 UpdateInsertion(DomTreeT &DT, const BatchUpdatePtr BUI, const TreeNodePtr NCD, InsertionInfo &II) argument
868 InsertUnreachable(DomTreeT &DT, const BatchUpdatePtr BUI, const TreeNodePtr From, const NodePtr To) argument
893 ComputeUnreachableDominators( DomTreeT &DT, const BatchUpdatePtr BUI, const NodePtr Root, const TreeNodePtr Incoming, SmallVectorImpl<std::pair<NodePtr, TreeNodePtr>> &DiscoveredConnectingEdges) argument
918 DeleteEdge(DomTreeT &DT, const BatchUpdatePtr BUI, const NodePtr From, const NodePtr To) argument
971 DeleteReachable(DomTreeT &DT, const BatchUpdatePtr BUI, const TreeNodePtr FromTN, const TreeNodePtr ToTN) argument
1012 HasProperSupport(DomTreeT &DT, const BatchUpdatePtr BUI, const TreeNodePtr TN) argument
1037 DeleteUnreachable(DomTreeT &DT, const BatchUpdatePtr BUI, const TreeNodePtr ToTN) argument
1136 EraseNode(DomTreeT &DT, const TreeNodePtr TN) argument
1155 ApplyUpdates(DomTreeT &DT, ArrayRef<UpdateT> Updates) argument
1223 ApplyNextUpdate(DomTreeT &DT, BatchUpdateInfo &BUI) argument
1264 verifyRoots(const DomTreeT &DT) argument
1303 verifyReachability(const DomTreeT &DT) argument
1339 VerifyLevels(const DomTreeT &DT) argument
1371 VerifyDFSNumbers(const DomTreeT &DT) argument
1507 verifyParentProperty(const DomTreeT &DT) argument
1540 verifySiblingProperty(const DomTreeT &DT) argument
1579 IsSameAsFreshTree(const DomTreeT &DT) argument
1599 Calculate(DomTreeT &DT) argument
1604 CalculateWithUpdates(DomTreeT &DT, ArrayRef<typename DomTreeT::UpdateType> Updates) argument
1623 InsertEdge(DomTreeT &DT, typename DomTreeT::NodePtr From, typename DomTreeT::NodePtr To) argument
1630 DeleteEdge(DomTreeT &DT, typename DomTreeT::NodePtr From, typename DomTreeT::NodePtr To) argument
1637 ApplyUpdates(DomTreeT &DT, ArrayRef<typename DomTreeT::UpdateType> Updates) argument
1643 Verify(const DomTreeT &DT, typename DomTreeT::VerificationLevel VL) argument
[all...]
H A DGenericIteratedDominanceFrontier.h64 IDFCalculatorBase(DominatorTreeBase<NodeTy, IsPostDom> &DT) : DT(DT) {} argument
66 IDFCalculatorBase(DominatorTreeBase<NodeTy, IsPostDom> &DT, argument
68 : DT(DT), ChildrenGetter(C) {}
105 DominatorTreeBase<NodeTy, IsPostDom> &DT; member in class:llvm::IDFCalculatorBase
145 DT.updateDFSNumbers();
148 if (DomTreeNodeBase<NodeTy> *Node = DT.getNode(BB))
177 DomTreeNodeBase<NodeTy> *SuccNode = DT
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/AggressiveInstCombine/
H A DAggressiveInstCombineInternal.h55 const DominatorTree &DT; member in class:llvm::TruncInstCombine
80 const DominatorTree &DT)
81 : TLI(TLI), DL(DL), DT(DT), CurrentTruncInst(nullptr) {}
79 TruncInstCombine(TargetLibraryInfo &TLI, const DataLayout &DL, const DominatorTree &DT) argument
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineDominators.h71 std::unique_ptr<DomTreeT> DT; member in class:llvm::MachineDominatorTree
73 /// Apply all the recorded critical edges to the DT.
74 /// This updates the underlying DT information in a way that uses
75 /// the fast query path of DT as much as possible.
89 if (!DT) DT.reset(new DomTreeT());
91 return *DT;
102 return DT->getRoots();
107 return DT->getRoot();
112 return DT
283 getEntryNode(MachineDominatorTree *DT) argument
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DDomTreeUpdater.cpp60 if (Strategy != UpdateStrategy::Lazy || !DT)
68 DT->applyUpdates(ArrayRef<DominatorTree::UpdateType>(I, E));
124 if (DT)
125 DT->recalculate(F);
140 if (DT)
141 DT->recalculate(F);
156 if (!DT)
173 // The DT and PDT require the nodes related to updates
206 if (DT && !IsRecalculatingDomTree)
207 if (DT
[all...]
H A DCFG.cpp132 const SmallPtrSetImpl<BasicBlock *> *ExclusionSet, const DominatorTree *DT,
136 if (DT && !DT->isReachableFromEntry(StopBB))
137 DT = nullptr;
142 DT = nullptr;
169 if (DT && DT->dominates(BB, StopBB))
207 const DominatorTree *DT, const LoopInfo *LI) {
215 nullptr, DT, LI);
220 const SmallPtrSetImpl<BasicBlock *> *ExclusionSet, const DominatorTree *DT,
130 isPotentiallyReachableFromMany( SmallVectorImpl<BasicBlock *> &Worklist, BasicBlock *StopBB, const SmallPtrSetImpl<BasicBlock *> *ExclusionSet, const DominatorTree *DT, const LoopInfo *LI) argument
206 isPotentiallyReachable(const BasicBlock *A, const BasicBlock *B, const DominatorTree *DT, const LoopInfo *LI) argument
218 isPotentiallyReachable( const Instruction *A, const Instruction *B, const SmallPtrSetImpl<BasicBlock *> *ExclusionSet, const DominatorTree *DT, const LoopInfo *LI) argument
[all...]
H A DPHITransAddr.cpp145 const DominatorTree *DT) {
189 Value *PHIIn = PHITranslateSubExpr(Cast->getOperand(0), CurBB, PredBB, DT);
207 (!DT || DT->dominates(CastI->getParent(), PredBB)))
218 Value *GEPOp = PHITranslateSubExpr(GEP->getOperand(i), CurBB, PredBB, DT);
230 GEPOps, {DL, TLI, DT, AC})) {
244 (!DT || DT->dominates(GEPI->getParent(), PredBB))) {
260 Value *LHS = PHITranslateSubExpr(Inst->getOperand(0), CurBB, PredBB, DT);
279 if (Value *Res = SimplifyAddInst(LHS, RHS, isNSW, isNUW, {DL, TLI, DT, A
143 PHITranslateSubExpr(Value *V, BasicBlock *CurBB, BasicBlock *PredBB, const DominatorTree *DT) argument
312 PHITranslateValue(BasicBlock *CurBB, BasicBlock *PredBB, const DominatorTree *DT, bool MustDominate) argument
341 PHITranslateWithInsertion(BasicBlock *CurBB, BasicBlock *PredBB, const DominatorTree &DT, SmallVectorImpl<Instruction*> &NewInsts) argument
365 InsertPHITranslatedSubExpr(Value *InVal, BasicBlock *CurBB, BasicBlock *PredBB, const DominatorTree &DT, SmallVectorImpl<Instruction*> &NewInsts) argument
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/IR/
H A DDominators.h47 extern template void Calculate<BBDomTree>(BBDomTree &DT);
48 extern template void CalculateWithUpdates<BBDomTree>(BBDomTree &DT,
51 extern template void Calculate<BBPostDomTree>(BBPostDomTree &DT);
53 extern template void InsertEdge<BBDomTree>(BBDomTree &DT, BasicBlock *From,
55 extern template void InsertEdge<BBPostDomTree>(BBPostDomTree &DT,
59 extern template void DeleteEdge<BBDomTree>(BBDomTree &DT, BasicBlock *From,
61 extern template void DeleteEdge<BBPostDomTree>(BBPostDomTree &DT,
65 extern template void ApplyUpdates<BBDomTree>(BBDomTree &DT, BBUpdates);
66 extern template void ApplyUpdates<BBPostDomTree>(BBPostDomTree &DT, BBUpdates);
68 extern template bool Verify<BBDomTree>(const BBDomTree &DT,
150 DominatorTree(DominatorTree &DT, DomTreeBuilder::BBUpdates U) argument
218 getEntryNode(DominatorTree *DT) argument
260 DominatorTree DT; member in class:llvm::DominatorTreeWrapperPass
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DCodeMoverUtils.cpp34 const DominatorTree &DT,
36 return isControlFlowEquivalent(*I0.getParent(), *I1.getParent(), DT, PDT);
40 const DominatorTree &DT,
45 return ((DT.dominates(&BB0, &BB1) && PDT.dominates(&BB1, &BB0)) ||
46 (PDT.dominates(&BB0, &BB1) && DT.dominates(&BB1, &BB0)));
93 const DominatorTree &DT,
111 if (!isControlFlowEquivalent(I, InsertPoint, DT, PDT))
116 const bool MoveForward = DT.dominates(&I, &InsertPoint);
122 if (UserInst != &InsertPoint && !DT.dominates(&InsertPoint, U))
129 if (&InsertPoint == OpInst || !DT
33 isControlFlowEquivalent(const Instruction &I0, const Instruction &I1, const DominatorTree &DT, const PostDominatorTree &PDT) argument
39 isControlFlowEquivalent(const BasicBlock &BB0, const BasicBlock &BB1, const DominatorTree &DT, const PostDominatorTree &PDT) argument
92 isSafeToMoveBefore(Instruction &I, Instruction &InsertPoint, const DominatorTree &DT, const PostDominatorTree &PDT, DependenceInfo &DI) argument
177 moveInstsBottomUp(BasicBlock &FromBB, BasicBlock &ToBB, const DominatorTree &DT, const PostDominatorTree &PDT, DependenceInfo &DI) argument
[all...]
H A DMem2Reg.cpp35 static bool promoteMemoryToRegister(Function &F, DominatorTree &DT, argument
54 PromoteMemToReg(Allocas, DT, &AC);
62 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); local
64 if (!promoteMemoryToRegister(F, DT, AC))
88 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree();
91 return promoteMemoryToRegister(F, DT, AC);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DSink.cpp38 DominatorTree &DT) {
54 if (!DT.dominates(BB, UseBlock))
96 DominatorTree &DT, LoopInfo &LI) {
122 if (!DT.dominates(Inst->getParent(), SuccToSinkTo))
134 return AllUsesDominatedByBlock(Inst, SuccToSinkTo, DT);
141 DominatorTree &DT, LoopInfo &LI, AAResults &AA) {
168 DomTreeNode *DTN = DT.getNode(Inst->getParent());
174 if (IsAcceptableTarget(Inst, Candidate, DT, LI))
182 if (IsAcceptableTarget(Inst, *I, DT, LI))
199 static bool ProcessBlock(BasicBlock &BB, DominatorTree &DT, LoopInf argument
37 AllUsesDominatedByBlock(Instruction *Inst, BasicBlock *BB, DominatorTree &DT) argument
95 IsAcceptableTarget(Instruction *Inst, BasicBlock *SuccToSinkTo, DominatorTree &DT, LoopInfo &LI) argument
139 SinkInstruction(Instruction *Inst, SmallPtrSetImpl<Instruction *> &Stores, DominatorTree &DT, LoopInfo &LI, AAResults &AA) argument
239 iterativelySinkInstructions(Function &F, DominatorTree &DT, LoopInfo &LI, AAResults &AA) argument
257 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); local
278 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); variable
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/IR/
H A DDominators.cpp73 DomTreeBuilder::BBDomTree &DT);
76 DomTreeBuilder::BBDomTree &DT, BBUpdates U);
79 DomTreeBuilder::BBPostDomTree &DT);
83 DomTreeBuilder::BBDomTree &DT, BasicBlock *From, BasicBlock *To);
85 DomTreeBuilder::BBPostDomTree &DT, BasicBlock *From, BasicBlock *To);
88 DomTreeBuilder::BBDomTree &DT, BasicBlock *From, BasicBlock *To);
90 DomTreeBuilder::BBPostDomTree &DT, BasicBlock *From, BasicBlock *To);
93 DomTreeBuilder::BBDomTree &DT, DomTreeBuilder::BBUpdates);
95 DomTreeBuilder::BBPostDomTree &DT, DomTreeBuilder::BBUpdates);
98 const DomTreeBuilder::BBDomTree &DT,
326 DominatorTree DT; local
345 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); local
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DSCCP.cpp18 DominatorTree &DT = FAM.getResult<DominatorTreeAnalysis>(F);
20 std::make_unique<PredicateInfo>(F, DT, FAM.getResult<AssumptionAnalysis>(F)),
21 &DT, FAM.getCachedResult<PostDominatorTreeAnalysis>(F)};
57 DominatorTree &DT =
61 F, DT,
64 nullptr, // We cannot preserve the DT or PDT with the legacy pass

Completed in 371 milliseconds

1234567891011>>