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

1234567891011>>

/openbsd-current/regress/lib/libc/db/
H A DMakefile13 .for DT in ${DBTARGETS}
14 db-${DT}: ${PROG}
15 sh ${.CURDIR}/run.test ${DT}
16 REGRESS_TARGETS+=db-${DT}
17 .PHONY: db-${DT}
/openbsd-current/gnu/llvm/llvm/lib/CodeGen/
H A DMachineDominators.cpp62 DT.reset(new DomTreeBase<MachineBasicBlock>());
63 DT->recalculate(F);
73 DT.reset(nullptr);
77 if (DT && VerifyMachineDomInfo)
78 if (!DT->verify(MachineDomTree::VerificationLevel::Basic)) {
85 if (DT)
86 DT->print(OS);
102 // the underlying DT.
106 MachineDomTreeNode *SuccDTNode = DT->getNode(Succ);
122 // FromBB2 since Split2 is still unknown of the underlying DT structur
[all...]
/openbsd-current/gnu/llvm/llvm/include/llvm/Transforms/Utils/
H A DCodeMoverUtils.h29 const DominatorTree &DT,
36 const DominatorTree &DT,
41 DominatorTree &DT,
49 DominatorTree &DT,
56 DominatorTree &DT,
63 DominatorTree &DT, const PostDominatorTree &PDT,
72 const DominatorTree *DT,
77 const DominatorTree *DT, const PostDominatorTree *PDT);
H A DSimplifyIndVar.h36 const DominatorTree *DT = nullptr; member in class:llvm::IVVisitor
44 const DominatorTree *getDomTree() const { return DT; }
50 bool simplifyUsersOfIV(PHINode *CurrIV, ScalarEvolution *SE, DominatorTree *DT,
57 bool simplifyLoopIVs(Loop *L, ScalarEvolution *SE, DominatorTree *DT,
78 DominatorTree *DT, SmallVectorImpl<WeakTrackingVH> &DeadInsts,
H A DAssumeBundleBuilder.h44 DominatorTree *DT = nullptr);
51 DominatorTree *DT = nullptr);
73 DominatorTree *DT);
H A DLoopPeel.h27 DominatorTree &DT, AssumptionCache *AC, bool PreserveLCSSA,
39 unsigned TripCount, DominatorTree &DT,
H A DPromoteMemToReg.h39 void PromoteMemToReg(ArrayRef<AllocaInst *> Allocas, DominatorTree &DT,
/openbsd-current/gnu/llvm/llvm/include/llvm/Support/
H A DGenericDomTreeConstruction.h134 TreeNodePtr getNodeForBlock(NodePtr BB, DomTreeT &DT) { argument
135 if (TreeNodePtr Node = DT.getNode(BB)) return Node;
141 assert(IDom || DT.DomTreeNodes[nullptr]);
142 TreeNodePtr IDomNode = getNodeForBlock(IDom, DT);
146 return DT.createChild(BB, IDomNode);
272 void runSemiNCA(DomTreeT &DT, const unsigned MinLevel = 0) { argument
293 const TreeNodePtr TN = DT.getNode(N);
343 static NodePtr GetEntryNode(const DomTreeT &DT) { argument
344 assert(DT.Parent && "Parent not set");
345 return GraphTraits<typename DomTreeT::ParentPtr>::getEntryNode(DT
351 FindRoots(const DomTreeT &DT, BatchUpdatePtr BUI) argument
507 RemoveRedundantRoots(const DomTreeT &DT, BatchUpdatePtr BUI, RootsT &Roots) argument
547 doFullDFSWalk(const DomTreeT &DT, DescendCondition DC) argument
559 CalculateFromScratch(DomTreeT &DT, BatchUpdatePtr BUI) argument
598 attachNewSubtree(DomTreeT& DT, const TreeNodePtr AttachTo) argument
619 reattachExistingSubtree(DomTreeT &DT, const TreeNodePtr AttachTo) argument
650 InsertEdge(DomTreeT &DT, const BatchUpdatePtr BUI, const NodePtr From, const NodePtr To) argument
680 UpdateRootsBeforeInsertion(DomTreeT &DT, const BatchUpdatePtr BUI, const TreeNodePtr From, const TreeNodePtr To) argument
712 UpdateRootsAfterUpdate(DomTreeT &DT, const BatchUpdatePtr BUI) argument
738 InsertReachable(DomTreeT &DT, const BatchUpdatePtr BUI, const TreeNodePtr From, const TreeNodePtr To) argument
844 UpdateInsertion(DomTreeT &DT, const BatchUpdatePtr BUI, const TreeNodePtr NCD, InsertionInfo &II) argument
864 InsertUnreachable(DomTreeT &DT, const BatchUpdatePtr BUI, const TreeNodePtr From, const NodePtr To) argument
889 ComputeUnreachableDominators( DomTreeT &DT, const BatchUpdatePtr BUI, const NodePtr Root, const TreeNodePtr Incoming, SmallVectorImpl<std::pair<NodePtr, TreeNodePtr>> &DiscoveredConnectingEdges) argument
914 DeleteEdge(DomTreeT &DT, const BatchUpdatePtr BUI, const NodePtr From, const NodePtr To) argument
967 DeleteReachable(DomTreeT &DT, const BatchUpdatePtr BUI, const TreeNodePtr FromTN, const TreeNodePtr ToTN) argument
1008 HasProperSupport(DomTreeT &DT, const BatchUpdatePtr BUI, const TreeNodePtr TN) argument
1032 DeleteUnreachable(DomTreeT &DT, const BatchUpdatePtr BUI, const TreeNodePtr ToTN) argument
1131 EraseNode(DomTreeT &DT, const TreeNodePtr TN) argument
1150 ApplyUpdates(DomTreeT &DT, GraphDiffT &PreViewCFG, GraphDiffT *PostViewCFG) argument
1199 ApplyNextUpdate(DomTreeT &DT, BatchUpdateInfo &BUI) argument
1225 verifyRoots(const DomTreeT &DT) argument
1264 verifyReachability(const DomTreeT &DT) argument
1300 VerifyLevels(const DomTreeT &DT) argument
1332 VerifyDFSNumbers(const DomTreeT &DT) argument
1468 verifyParentProperty(const DomTreeT &DT) argument
1502 verifySiblingProperty(const DomTreeT &DT) argument
1541 IsSameAsFreshTree(const DomTreeT &DT) argument
1561 Calculate(DomTreeT &DT) argument
1566 CalculateWithUpdates(DomTreeT &DT, ArrayRef<typename DomTreeT::UpdateType> Updates) argument
1577 InsertEdge(DomTreeT &DT, typename DomTreeT::NodePtr From, typename DomTreeT::NodePtr To) argument
1584 DeleteEdge(DomTreeT &DT, typename DomTreeT::NodePtr From, typename DomTreeT::NodePtr To) argument
1591 ApplyUpdates(DomTreeT &DT, GraphDiff<typename DomTreeT::NodePtr, DomTreeT::IsPostDominator> &PreViewCFG, GraphDiff<typename DomTreeT::NodePtr, DomTreeT::IsPostDominator> *PostViewCFG) argument
1600 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();
152 if (DomTreeNodeBase<NodeTy> *Node = DT.getNode(BB)) {
177 DomTreeNodeBase<NodeTy> *SuccNode = DT
[all...]
/openbsd-current/gnu/llvm/llvm/lib/Transforms/AggressiveInstCombine/
H A DAggressiveInstCombineInternal.h58 const DominatorTree &DT; member in class:llvm::TruncInstCombine
83 const DataLayout &DL, const DominatorTree &DT)
84 : AC(AC), TLI(TLI), DL(DL), DT(DT) {}
114 &DT);
120 &DT);
82 TruncInstCombine(AssumptionCache &AC, TargetLibraryInfo &TLI, const DataLayout &DL, const DominatorTree &DT) argument
/openbsd-current/gnu/llvm/llvm/include/llvm/CodeGen/
H A DMachineDominators.h74 std::unique_ptr<MachineDomTree> DT; member in class:llvm::MachineDominatorTree
76 /// Apply all the recorded critical edges to the DT.
77 /// This updates the underlying DT information in a way that uses
78 /// the fast query path of DT as much as possible.
92 if (!DT)
93 DT.reset(new MachineDomTree());
95 return *DT;
102 return DT->getRoot();
107 return DT->getRootNode();
117 return DT
285 getEntryNode(MachineDominatorTree *DT) argument
[all...]
/openbsd-current/gnu/llvm/llvm/lib/Transforms/Utils/
H A DCodeMoverUtils.cpp64 const DominatorTree &DT,
95 static bool domTreeLevelBefore(DominatorTree *DT, const Instruction *InstA, argument
102 DomTreeNode *DA = DT->getNode(InstA->getParent());
103 DomTreeNode *DB = DT->getNode(InstB->getParent());
110 const DominatorTree &DT,
113 assert(DT.dominates(&Dominator, &BB) && "Expecting Dominator to dominate BB");
123 // Walk up the dominator tree from the associated DT node for BB to the
124 // associated DT node for Dominator.
126 assert(DT.getNode(CurBlock) && "Expecting a valid DT nod
108 collectControlConditions(const BasicBlock &BB, const BasicBlock &Dominator, const DominatorTree &DT, const PostDominatorTree &PDT, unsigned MaxLookup) argument
[all...]
H A DFixIrreducible.cpp167 static void createNaturalLoopInternal(LoopInfo &LI, DominatorTree &DT, argument
196 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Eager);
199 assert(DT.verify(DominatorTree::VerificationLevel::Full));
201 assert(DT.verify(DominatorTree::VerificationLevel::Fast));
243 LI.verify(DT);
256 static void createNaturalLoop(LoopInfo &LI, DominatorTree &DT, Function *F, argument
259 createNaturalLoopInternal(LI, DT, nullptr, Blocks, Headers);
262 static void createNaturalLoop(LoopInfo &LI, DominatorTree &DT, Loop &L, argument
265 createNaturalLoopInternal(LI, DT, &L, Blocks, Headers);
270 static bool makeReducible(LoopInfo &LI, DominatorTree &DT, Grap argument
316 FixIrreducibleImpl(Function &F, LoopInfo &LI, DominatorTree &DT) argument
345 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); local
352 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); local
[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);
/openbsd-current/gnu/llvm/compiler-rt/lib/orc/
H A Ddebug.cpp34 if (const char *DT = getenv("ORC_RT_DEBUG")) {
36 if (strcmp(DT, "1") == 0) {
43 if (strcmp(DT, "") != 0) {
44 DebugTypes.store(DT, std::memory_order_relaxed);
45 return DT;
/openbsd-current/gnu/llvm/llvm/include/llvm/Analysis/
H A DPostDominators.h76 PostDominatorTree DT; member in struct:llvm::PostDominatorTreeWrapperPass
80 PostDominatorTree &getPostDomTree() { return DT; }
81 const PostDominatorTree &getPostDomTree() const { return DT; }
91 void releaseMemory() override { DT.reset(); }
100 static NodeRef getEntryNode(PostDominatorTree *DT) { argument
101 return DT->getRootNode();
H A DIteratedDominanceFrontier.h45 IDFCalculator(DominatorTreeBase<BasicBlock, IsPostDom> &DT) argument
46 : IDFCalculatorBase(DT) {}
48 IDFCalculator(DominatorTreeBase<BasicBlock, IsPostDom> &DT, argument
50 : IDFCalculatorBase(DT, ChildrenGetterTy(GD)) {
H A DPHITransAddr.h82 const DominatorTree *DT, bool MustDominate);
92 const DominatorTree &DT,
104 const DominatorTree *DT);
112 BasicBlock *PredBB, const DominatorTree &DT,
/openbsd-current/gnu/llvm/clang/include/clang/Analysis/Analyses/
H A DDominators.h56 DominatorTreeBase &getBase() { return DT; }
62 return DT.getRoot();
67 return DT.getRootNode();
80 if (DT.compare(Other.getBase()))
90 DT.recalculate(*cfg);
104 DomTreeNode *IDom = DT.getNode(*I)->getIDom();
137 return DT.dominates(A, B);
144 return DT.properlyDominates(A, B);
150 return DT.findNearestCommonDominator(A, B);
155 return DT
179 DominatorTreeBase DT; member in class:clang::CFGDominatorTreeImpl
302 getEntryNode(clang::CFGDomTree *DT) argument
[all...]
/openbsd-current/gnu/llvm/llvm/lib/Analysis/
H A DCFG.cpp135 const SmallPtrSetImpl<BasicBlock *> *ExclusionSet, const DominatorTree *DT,
139 if (DT && !DT->isReachableFromEntry(StopBB))
140 DT = nullptr;
145 DT = nullptr;
170 if (DT && DT->dominates(BB, StopBB))
209 const SmallPtrSetImpl<BasicBlock *> *ExclusionSet, const DominatorTree *DT,
214 if (DT) {
215 if (DT
133 isPotentiallyReachableFromMany( SmallVectorImpl<BasicBlock *> &Worklist, const BasicBlock *StopBB, const SmallPtrSetImpl<BasicBlock *> *ExclusionSet, const DominatorTree *DT, const LoopInfo *LI) argument
207 isPotentiallyReachable( const BasicBlock *A, const BasicBlock *B, const SmallPtrSetImpl<BasicBlock *> *ExclusionSet, const DominatorTree *DT, const LoopInfo *LI) argument
231 isPotentiallyReachable( const Instruction *A, const Instruction *B, const SmallPtrSetImpl<BasicBlock *> *ExclusionSet, const DominatorTree *DT, const LoopInfo *LI) argument
[all...]
H A DDomTreeUpdater.cpp60 if (Strategy != UpdateStrategy::Lazy || !DT)
68 DT->applyUpdates(ArrayRef<DominatorTree::UpdateType>(I, E));
123 if (DT)
124 DT->recalculate(F);
139 if (DT)
140 DT->recalculate(F);
155 if (!DT)
172 // The DT and PDT require the nodes related to updates
205 if (DT && !IsRecalculatingDomTree)
206 if (DT
[all...]
/openbsd-current/gnu/llvm/llvm/lib/Transforms/Scalar/
H A DSink.cpp66 DominatorTree &DT, LoopInfo &LI) {
88 if (!DT.dominates(Inst->getParent(), SuccToSinkTo))
105 DominatorTree &DT, LoopInfo &LI, AAResults &AA) {
135 if (!DT.isReachableFromEntry(UseBlock))
144 SuccToSinkTo = DT.findNearestCommonDominator(SuccToSinkTo, UseBlock);
148 if (!DT.dominates(BB, SuccToSinkTo))
156 !IsAcceptableTarget(Inst, SuccToSinkTo, DT, LI))
157 SuccToSinkTo = DT.getNode(SuccToSinkTo)->getIDom()->getBlock();
175 static bool ProcessBlock(BasicBlock &BB, DominatorTree &DT, LoopInfo &LI, argument
180 if (!DT
65 IsAcceptableTarget(Instruction *Inst, BasicBlock *SuccToSinkTo, DominatorTree &DT, LoopInfo &LI) argument
103 SinkInstruction(Instruction *Inst, SmallPtrSetImpl<Instruction *> &Stores, DominatorTree &DT, LoopInfo &LI, AAResults &AA) argument
212 iterativelySinkInstructions(Function &F, DominatorTree &DT, LoopInfo &LI, AAResults &AA) argument
230 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); local
251 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); variable
[all...]
/openbsd-current/gnu/llvm/llvm/lib/IR/
H A DDominators.cpp80 DomTreeBuilder::BBDomTree &DT);
83 DomTreeBuilder::BBDomTree &DT, BBUpdates U);
86 DomTreeBuilder::BBPostDomTree &DT);
90 DomTreeBuilder::BBDomTree &DT, BasicBlock *From, BasicBlock *To);
92 DomTreeBuilder::BBPostDomTree &DT, BasicBlock *From, BasicBlock *To);
95 DomTreeBuilder::BBDomTree &DT, BasicBlock *From, BasicBlock *To);
97 DomTreeBuilder::BBPostDomTree &DT, BasicBlock *From, BasicBlock *To);
100 DomTreeBuilder::BBDomTree &DT, DomTreeBuilder::BBDomTreeGraphDiff &,
103 DomTreeBuilder::BBPostDomTree &DT, DomTreeBuilder::BBPostDomTreeGraphDiff &,
107 const DomTreeBuilder::BBDomTree &DT,
387 DominatorTree DT; local
406 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); local
[all...]
/openbsd-current/regress/usr.bin/mandoc/man/
H A DMakefile3 SUBDIR = AT B BI DT EX HP IP MR MT OP PD PP RS SH SS SY TH TP TS UC UR nf blank
/openbsd-current/gnu/llvm/llvm/lib/Target/AMDGPU/
H A DAMDGPURewriteUndefForPHI.cpp103 bool rewritePHIs(Function &F, LegacyDivergenceAnalysis *DA, DominatorTree *DT) { argument
128 if (!DT->dominates(&BB, IncomingBB))
138 if (DT->dominates(IncomingBB, DominateBB))
157 if (DT->dominates(DominateBB, &BB) && all_of(Undefs, [&](BasicBlock *UD) {
158 return DT->dominates(DominateBB, UD);
175 DominatorTree *DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); local
176 return rewritePHIs(F, DA, DT);

Completed in 1433 milliseconds

1234567891011>>