| /src/external/gpl2/dtc/dist/ |
| dtdiff | 12 DT="$1"
13 if [ -d "$DT" ]; then
15 elif [ -f "$DT" ]; then
16 case "$DT" in
27 echo "Unrecognized format for $DT" >&2
31 $DTC -I $IFORMAT -O dts -qq -f -s -o - "$DT"
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| MachineDominators.cpp | 60 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 structure
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Utils/ |
| CodeMoverUtils.h | 29 const DominatorTree &DT,
36 const DominatorTree &DT,
41 DominatorTree &DT,
48 DominatorTree &DT,
55 DominatorTree &DT,
62 DominatorTree &DT, const PostDominatorTree &PDT,
|
| SimplifyIndVar.h | 37 const DominatorTree *DT = nullptr;
45 const DominatorTree *getDomTree() const { return DT; }
51 bool simplifyUsersOfIV(PHINode *CurrIV, ScalarEvolution *SE, DominatorTree *DT,
58 bool simplifyLoopIVs(Loop *L, ScalarEvolution *SE, DominatorTree *DT,
79 DominatorTree *DT, SmallVectorImpl<WeakTrackingVH> &DeadInsts,
|
| AssumeBundleBuilder.h | 43 DominatorTree *DT = nullptr);
50 DominatorTree *DT = nullptr);
72 DominatorTree *DT);
|
| PromoteMemToReg.h | 39 void PromoteMemToReg(ArrayRef<AllocaInst *> Allocas, DominatorTree &DT,
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 133 TreeNodePtr getNodeForBlock(NodePtr BB, DomTreeT &DT) {
134 if (TreeNodePtr Node = DT.getNode(BB)) return Node;
140 assert(IDom || DT.DomTreeNodes[nullptr]);
141 TreeNodePtr IDomNode = getNodeForBlock(IDom, DT);
145 return DT.createChild(BB, IDomNode);
271 void runSemiNCA(DomTreeT &DT, const unsigned MinLevel = 0) {
292 const TreeNodePtr TN = DT.getNode(N);
342 static NodePtr GetEntryNode(const DomTreeT &DT) {
343 assert(DT.Parent && "Parent not set");
344 return GraphTraits<typename DomTreeT::ParentPtr>::getEntryNode(DT.Parent)
[all...] |
| GenericIteratedDominanceFrontier.h | 64 IDFCalculatorBase(DominatorTreeBase<NodeTy, IsPostDom> &DT) : DT(DT) {}
66 IDFCalculatorBase(DominatorTreeBase<NodeTy, IsPostDom> &DT,
68 : DT(DT), ChildrenGetter(C) {}
105 DominatorTreeBase<NodeTy, IsPostDom> &DT;
145 DT.updateDFSNumbers();
152 if (DomTreeNodeBase<NodeTy> *Node = DT.getNode(BB)) {
177 DomTreeNodeBase<NodeTy> *SuccNode = DT.getNode(Succ)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/AggressiveInstCombine/ |
| AggressiveInstCombineInternal.h | 54 const DominatorTree &DT;
79 const DominatorTree &DT)
80 : TLI(TLI), DL(DL), DT(DT), CurrentTruncInst(nullptr) {}
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/ |
| MachineDominators.h | 70 std::unique_ptr<DomTreeT> DT;
72 /// Apply all the recorded critical edges to the DT.
73 /// This updates the underlying DT information in a way that uses
74 /// the fast query path of DT as much as possible.
88 if (!DT) DT.reset(new DomTreeT());
90 return *DT;
97 return DT->getRoot();
102 return DT->getRootNode();
112 return DT->dominates(A, B)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| DomTreeUpdater.cpp | 59 if (Strategy != UpdateStrategy::Lazy || !DT)
67 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->getNode(DelBB)
[all...] |
| TypeMetadataUtils.cpp | 28 const CallInst *CI, DominatorTree &DT) {
37 if (!DT.dominates(CI, User))
41 DT);
55 int64_t Offset, const CallInst *CI, DominatorTree &DT) {
59 findLoadCallsAtConstantOffset(M, DevirtCalls, User, Offset, CI, DT);
61 findCallsAtConstantOffset(DevirtCalls, nullptr, User, Offset, CI, DT);
69 CI, DT);
78 DominatorTree &DT) {
92 M, DevirtCalls, CI->getArgOperand(0)->stripPointerCasts(), 0, CI, DT);
99 const CallInst *CI, DominatorTree &DT) {
[all...] |
| CFG.cpp | 139 const SmallPtrSetImpl<BasicBlock *> *ExclusionSet, const DominatorTree *DT,
143 if (DT && !DT->isReachableFromEntry(StopBB))
144 DT = nullptr;
149 DT = nullptr;
174 if (DT && DT->dominates(BB, StopBB))
213 const SmallPtrSetImpl<BasicBlock *> *ExclusionSet, const DominatorTree *DT,
218 if (DT) {
219 if (DT->isReachableFromEntry(A) && !DT->isReachableFromEntry(B)
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/IR/ |
| Dominators.h | 50 extern template void Calculate<BBDomTree>(BBDomTree &DT);
51 extern template void CalculateWithUpdates<BBDomTree>(BBDomTree &DT,
54 extern template void Calculate<BBPostDomTree>(BBPostDomTree &DT);
56 extern template void InsertEdge<BBDomTree>(BBDomTree &DT, BasicBlock *From,
58 extern template void InsertEdge<BBPostDomTree>(BBPostDomTree &DT,
62 extern template void DeleteEdge<BBDomTree>(BBDomTree &DT, BasicBlock *From,
64 extern template void DeleteEdge<BBPostDomTree>(BBPostDomTree &DT,
68 extern template void ApplyUpdates<BBDomTree>(BBDomTree &DT,
71 extern template void ApplyUpdates<BBPostDomTree>(BBPostDomTree &DT,
75 extern template bool Verify<BBDomTree>(const BBDomTree &DT,
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| FixIrreducible.cpp | 158 static void createNaturalLoopInternal(LoopInfo &LI, DominatorTree &DT,
187 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Eager);
190 assert(DT.verify(DominatorTree::VerificationLevel::Full));
192 assert(DT.verify(DominatorTree::VerificationLevel::Fast));
234 LI.verify(DT);
247 static void createNaturalLoop(LoopInfo &LI, DominatorTree &DT, Function *F,
250 createNaturalLoopInternal(LI, DT, nullptr, Blocks, Headers);
253 static void createNaturalLoop(LoopInfo &LI, DominatorTree &DT, Loop &L,
256 createNaturalLoopInternal(LI, DT, &L, Blocks, Headers);
261 static bool makeReducible(LoopInfo &LI, DominatorTree &DT, Graph &&G)
[all...] |
| Mem2Reg.cpp | 35 static bool promoteMemoryToRegister(Function &F, DominatorTree &DT,
54 PromoteMemToReg(Allocas, DT, &AC);
62 auto &DT = AM.getResult<DominatorTreeAnalysis>(F);
64 if (!promoteMemoryToRegister(F, DT, AC))
88 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree();
91 return promoteMemoryToRegister(F, DT, AC);
|
| CodeMoverUtils.cpp | 65 const DominatorTree &DT,
96 static bool domTreeLevelBefore(DominatorTree *DT, const Instruction *InstA,
103 DomTreeNode *DA = DT->getNode(InstA->getParent());
104 DomTreeNode *DB = DT->getNode(InstB->getParent());
109 const BasicBlock &BB, const BasicBlock &Dominator, const DominatorTree &DT,
111 assert(DT.dominates(&Dominator, &BB) && "Expecting Dominator to dominate BB");
121 // Walk up the dominator tree from the associated DT node for BB to the
122 // associated DT node for Dominator.
124 assert(DT.getNode(CurBlock) && "Expecting a valid DT node for CurBlock")
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| PostDominators.h | 76 PostDominatorTree DT;
80 PostDominatorTree &getPostDomTree() { return DT; }
81 const PostDominatorTree &getPostDomTree() const { return DT; }
91 void releaseMemory() override { DT.reset(); }
100 static NodeRef getEntryNode(PostDominatorTree *DT) {
101 return DT->getRootNode();
|
| IteratedDominanceFrontier.h | 45 IDFCalculator(DominatorTreeBase<BasicBlock, IsPostDom> &DT)
46 : IDFCalculatorBase(DT) {}
48 IDFCalculator(DominatorTreeBase<BasicBlock, IsPostDom> &DT,
50 : IDFCalculatorBase(DT, ChildrenGetterTy(GD)) {
|
| PHITransAddr.h | 82 const DominatorTree *DT, bool MustDominate);
92 const DominatorTree &DT,
104 const DominatorTree *DT);
112 BasicBlock *PredBB, const DominatorTree &DT,
|
| /src/external/apache2/llvm/dist/clang/include/clang/Analysis/Analyses/ |
| Dominators.h | 56 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.findNearestCommonDominator(A, B)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| Sink.cpp | 71 DominatorTree &DT, LoopInfo &LI) {
92 if (!DT.dominates(Inst->getParent(), SuccToSinkTo))
109 DominatorTree &DT, LoopInfo &LI, AAResults &AA) {
139 if (!DT.isReachableFromEntry(UseBlock))
148 SuccToSinkTo = DT.findNearestCommonDominator(SuccToSinkTo, UseBlock);
152 if (!DT.dominates(BB, SuccToSinkTo))
160 !IsAcceptableTarget(Inst, SuccToSinkTo, DT, LI))
161 SuccToSinkTo = DT.getNode(SuccToSinkTo)->getIDom()->getBlock();
179 static bool ProcessBlock(BasicBlock &BB, DominatorTree &DT, LoopInfo &LI,
187 if (!DT.isReachableFromEntry(&BB)) return false
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/IR/ |
| Dominators.cpp | 73 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::BBDomTreeGraphDiff &,
96 DomTreeBuilder::BBPostDomTree &DT, DomTreeBuilder::BBPostDomTreeGraphDiff &,
100 const DomTreeBuilder::BBDomTree &DT,
[all...] |
| /src/external/apache2/llvm/dist/llvm/examples/IRTransforms/ |
| SimplifyCFG.cpp | 102 static bool removeDeadBlocks_v2(Function &F, DominatorTree &DT) {
104 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Lazy);
173 static bool eliminateCondBranches_v2(Function &F, DominatorTree &DT) {
176 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Lazy);
219 static bool eliminateCondBranches_v3(Function &F, DominatorTree &DT) {
221 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Lazy);
306 static bool mergeIntoSinglePredecessor_v2(Function &F, DominatorTree &DT) {
308 DomTreeUpdater DTU(DT, DomTreeUpdater::UpdateStrategy::Lazy);
361 static bool doSimplify_v2(Function &F, DominatorTree &DT) {
362 return eliminateCondBranches_v2(F, DT) |
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/ |
| SCCP.cpp | 30 DominatorTree &DT = FAM.getResult<DominatorTreeAnalysis>(F);
32 std::make_unique<PredicateInfo>(F, DT, FAM.getResult<AssumptionAnalysis>(F)),
33 &DT, FAM.getCachedResult<PostDominatorTreeAnalysis>(F)};
69 DominatorTree &DT =
73 F, DT,
76 nullptr, // We cannot preserve the DT or PDT with the legacy pass
|
