| /external/llvm/include/llvm/Analysis/ |
| DominanceFrontier.h | 172 DominatorTree &DT = getAnalysis<DominatorTree>();
173 Roots = DT.getRoots();
175 calculate(DT, DT[Roots[0]]);
184 const DomSetType &calculate(const DominatorTree &DT,
|
| /external/llvm/lib/Transforms/Utils/ |
| BreakCriticalEdges.cpp | 246 DominatorTree *DT = P->getAnalysisIfAvailable<DominatorTree>();
251 if (DT == 0 && LI == 0 && PI == 0)
279 if (DT) {
280 DomTreeNode *TINode = DT->getNode(TIBB);
286 DomTreeNode *NewBBNode = DT->addNewBlock(NewBB, TIBB);
289 // If NewBBDominatesDestBB hasn't been computed yet, do so with DT.
291 DestBBNode = DT->getNode(DestBB);
293 if (DomTreeNode *OPNode = DT->getNode(OtherPreds.back()))
294 NewBBDominatesDestBB = DT->dominates(DestBBNode, OPNode);
303 if (!DestBBNode) DestBBNode = DT->getNode(DestBB)
[all...] |
| SimplifyInstructions.cpp | 48 const DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>();
66 if (Value *V = SimplifyInstruction(I, TD, TLI, DT)) {
|
| CodeExtractor.cpp | 121 : DT(0), AggregateArgs(AggregateArgs||AggregateArgsOpt),
124 CodeExtractor::CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT,
126 : DT(DT), AggregateArgs(AggregateArgs||AggregateArgsOpt),
129 CodeExtractor::CodeExtractor(DominatorTree &DT, Loop &L, bool AggregateArgs)
130 : DT(&DT), AggregateArgs(AggregateArgs||AggregateArgsOpt),
133 CodeExtractor::CodeExtractor(DominatorTree &DT, const RegionNode &RN,
135 : DT(&DT), AggregateArgs(AggregateArgs||AggregateArgsOpt)
[all...] |
| BasicBlockUtils.cpp | 169 if (DominatorTree *DT = P->getAnalysisIfAvailable<DominatorTree>()) {
170 if (DomTreeNode *DTN = DT->getNode(BB)) {
171 DomTreeNode *PredDTN = DT->getNode(PredBB);
175 DT->changeImmediateDominator(*DI, PredDTN);
177 DT->eraseNode(BB);
299 if (DominatorTree *DT = P->getAnalysisIfAvailable<DominatorTree>()) {
301 if (DomTreeNode *OldNode = DT->getNode(Old)) {
307 DomTreeNode *NewNode = DT->addNewBlock(New,Old);
310 DT->changeImmediateDominator(*I, NewNode);
355 DominatorTree *DT = P->getAnalysisIfAvailable<DominatorTree>()
[all...] |
| LoopSimplify.cpp | 78 DominatorTree *DT;
133 DT = &getAnalysis<DominatorTree>();
276 if (Value *V = SimplifyInstruction(PN, 0, 0, DT)) {
348 DomTreeNode *Node = DT->getNode(ExitingBlock);
353 DT->changeImmediateDominator(Child, Node->getIDom());
355 DT->eraseNode(ExitingBlock);
468 static PHINode *FindPHIToPartitionLoops(Loop *L, DominatorTree *DT,
473 if (Value *V = SimplifyInstruction(PN, 0, 0, DT)) {
556 PHINode *PN = FindPHIToPartitionLoops(L, DT, AA, LI);
616 if (DT->dominates(Header, P)
[all...] |
| /external/clang/lib/Lex/ |
| PPExpressions.cpp | 82 static bool EvaluateDefined(PPValue &Result, Token &PeekTok, DefinedTracker &DT,
152 DT.State = DefinedTracker::DefinedMacro;
153 DT.TheMacro = II;
160 /// expression in DT. See above for information on what DT means.
165 static bool EvaluateValue(PPValue &Result, Token &PeekTok, DefinedTracker &DT,
167 DT.State = DefinedTracker::Unknown;
182 return(EvaluateDefined(Result, PeekTok, DT, ValueLive, PP));
326 if (EvaluateValue(Result, PeekTok, DT, ValueLive, PP)) return true;
331 // Just use DT unmodified as our result
[all...] |
| /external/llvm/lib/Analysis/ |
| InstructionSimplify.cpp | 47 const DominatorTree *DT;
50 const DominatorTree *dt) : TD(td), TLI(tli), DT(dt) {}
93 static bool ValueDominatesPHI(Value *V, PHINode *P, const DominatorTree *DT) {
106 if (DT) {
107 if (!DT->isReachableFromEntry(P->getParent()))
109 if (!DT->isReachableFromEntry(I->getParent()))
111 return DT->dominates(I, P);
522 if (!ValueDominatesPHI(RHS, PI, Q.DT))
[all...] |
| DominanceFrontier.cpp | 41 DominanceFrontier::calculate(const DominatorTree &DT,
70 if (DT[*SI]->getIDom() != currentNode)
102 if (!DT.properlyDominates(parentNode, DT[*CDFI]))
|
| AliasAnalysis.cpp | 387 CapturesBefore(const Instruction *I, DominatorTree *DT)
388 : BeforeHere(I), DT(DT), Captured(false) {}
397 if (BeforeHere != I && !DT->isReachableFromEntry(BB))
402 if (BeforeHere != I && DT->dominates(BeforeHere, I) &&
412 if (BeforeHere != I && !DT->isReachableFromEntry(BB))
414 if (BeforeHere != I && DT->dominates(BeforeHere, I) &&
422 DominatorTree *DT;
435 DominatorTree *DT) {
436 if (!DT || !TD) return AliasAnalysis::ModRef
[all...] |
| RegionInfo.cpp | 56 DominatorTree *dt, Region *Parent)
57 : RegionNode(Parent, Entry, 1), RI(RInfo), DT(dt), exit(Exit) {}
85 assert(DT->getNode(BB) && "BB not part of the dominance tree");
93 return (DT->dominates(entry, BB)
94 && !(DT->dominates(exit, BB) && DT->dominates(entry, exit)));
143 if (DT->getNode(Pred) && !contains(Pred)) {
372 if (!DT->dominates(getEntry(), *PI))
379 return new Region(getEntry(), *succ_begin(exit), RI, DT);
[all...] |
| IVUsers.cpp | 85 static bool isSimplifiedLoopNest(BasicBlock *BB, const DominatorTree *DT,
89 for (DomTreeNode *Rung = DT->getNode(BB);
165 if (!isSimplifiedLoopNest(UseBB, DT, LI, SimpleLoopNests))
198 *SE, *DT);
236 DT = &getAnalysis<DominatorTree>();
299 *SE, *DT);
|
| ScalarEvolutionExpander.cpp | 79 assert(SE.DT->dominates(Ret, BIP));
522 SE.DT->dominates(cast<Instruction>(V), Builder.GetInsertPoint()));
624 DominatorTree &DT) {
629 if (DT.dominates(A->getHeader(), B->getHeader())) return B;
630 if (DT.dominates(B->getHeader(), A->getHeader())) return A;
658 L = PickMostRelevantLoop(L, getRelevantLoop(*I), *SE.DT);
669 *SE.DT);
679 DominatorTree &DT;
681 explicit LoopCompare(DominatorTree &dt) : DT(dt) {
[all...] |
| DomPrinter.cpp | 57 static std::string getGraphName(DominatorTree *DT) {
73 static std::string getGraphName(PostDominatorTree *DT) {
|
| /external/clang/test/SemaTemplate/ |
| default-arguments.cpp | 130 typename DT>
131 container<DT> initializer(const DT& d) {
132 return container<DT>();
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoopDeletion.cpp | 203 DominatorTree& DT = getAnalysis<DominatorTree>();
209 ChildNodes.insert(ChildNodes.begin(), DT[*LI]->begin(), DT[*LI]->end());
212 DT.changeImmediateDominator(*DI, DT[preheader]);
216 DT.eraseNode(*LI);
|
| Sink.cpp | 34 DominatorTree *DT;
92 if (!DT->dominates(BB, UseBlock))
99 DT = &getAnalysis<DominatorTree>();
126 if (!DT->isReachableFromEntry(&BB)) return false;
202 if (!DT->dominates(Inst->getParent(), SuccToSinkTo))
240 DomTreeNode *DTN = DT->getNode(Inst->getParent());
|
| IndVarSimplify.cpp | 70 DominatorTree *DT;
79 IndVarSimplify() : LoopPass(ID), LI(0), SE(0), DT(0), TD(0),
191 DominatorTree *DT) {
206 InsertBB = DT->findNearestCommonDominator(InsertPt->getParent(), InsertBB);
211 DT->dominates(cast<Instruction>(Def), InsertPt)) &&
479 assert(L->isLCSSAForm(*DT));
672 DominatorTree *DT;
693 DT(DTree),
722 static bool isLoopInvariant(Value *V, const Loop *L, const DominatorTree *DT) {
727 return DT->properlyDominates(Inst->getParent(), L->getHeader())
[all...] |
| /external/llvm/lib/Transforms/IPO/ |
| PartialInlining.cpp | 121 DominatorTree DT;
122 DT.runOnFunction(*duplicateFunction);
126 = CodeExtractor(toExtract, &DT).extractCodeRegion();
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfCompileUnit.cpp | 522 DIDerivedType DT = DIDerivedType(Element);
523 StringRef fieldName = DT.getName();
[all...] |
| /frameworks/compile/slang/ |
| slang_rs_object_ref_count.cpp | 81 RSExportPrimitiveType::DataType DT =
83 slangAssert(RSExportPrimitiveType::IsRSObjectType(DT)
86 RSObjectFD[(DT - RSExportPrimitiveType::FirstRSObjectType)] = FD;
580 RSExportPrimitiveType::DataType DT =
587 } else if (DT == RSExportPrimitiveType::DataTypeUnknown) {
624 RSExportPrimitiveType::DataType DT =
626 if (DT != RSExportPrimitiveType::DataTypeUnknown) {
627 return (RSExportPrimitiveType::IsRSObjectType(DT) ? 1 : 0);
[all...] |
| slang_rs_export_type.h | 272 DataType DT,
275 mType(DT),
297 static bool IsRSMatrixType(DataType DT);
298 static bool IsRSObjectType(DataType DT);
316 static RSReflectionType *getRSReflectionType(DataType DT);
370 DataType DT,
374 DT, Normalized),
|
| /external/llvm/lib/Target/R600/ |
| AMDGPUStructurizeCFG.cpp | 61 DominatorTree *DT;
72 DT = DomTree;
79 DomTreeNode *Node = DT->getNode(BB);
177 DominatorTree *DT;
474 NearestCommonDominator Dominator(DT);
550 NearestCommonDominator Dominator(DT);
618 Dominator = DT->findNearestCommonDominator(Dominator, BB);
624 DT->changeImmediateDominator(NewExit, Dominator);
635 DT->changeImmediateDominator(NewExit, BB);
646 DT->addNewBlock(Flow, Dominator)
[all...] |
| /external/llvm/lib/CodeGen/ |
| MachineSink.cpp | 49 MachineDominatorTree *DT; // Machine dominator tree
214 if (!DT->dominates(MBB, UseBlock))
228 DT = &getAnalysis<MachineDominatorTree>();
257 if (!DT->isReachableFromEntry(&MBB)) return false;
382 if (!DT->dominates(ToBB, *PI))
633 if (!TryBreak && !DT->dominates(ParentBlock, SuccToSinkTo)) {
|
| /external/clang/lib/AST/ |
| Mangle.cpp | 97 CXXDtorType DT, const BlockDecl *BD,
102 mangleCXXDtor(DD, DT, Out);
|
