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

12345

/macosx-10.9.5/llvmCore-3425.0.33/unittests/VMCore/
H A DDominatorTreeTest.cpp19 DominatorTree *DT = &getAnalysis<DominatorTree>(); local
47 EXPECT_TRUE(DT->isReachableFromEntry(BB0));
48 EXPECT_TRUE(DT->isReachableFromEntry(BB1));
49 EXPECT_TRUE(DT->isReachableFromEntry(BB2));
50 EXPECT_FALSE(DT->isReachableFromEntry(BB3));
51 EXPECT_TRUE(DT->isReachableFromEntry(BB4));
54 EXPECT_TRUE(DT->dominates(BB0, BB0));
55 EXPECT_TRUE(DT->dominates(BB0, BB1));
56 EXPECT_TRUE(DT->dominates(BB0, BB2));
57 EXPECT_TRUE(DT
[all...]
/macosx-10.9.5/llvmCore-3425.0.33/lib/Analysis/
H A DPostDominators.cpp35 DT->recalculate(F);
40 delete DT;
44 DT->print(OS);
H A DPHITransAddr.cpp147 const DominatorTree *DT) {
191 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, TD, TLI, DT)) {
247 (!DT || DT->dominates(GEPI->getParent(), PredBB))) {
269 Value *LHS = PHITranslateSubExpr(Inst->getOperand(0), CurBB, PredBB, DT);
288 if (Value *Res = SimplifyAddInst(LHS, RHS, isNSW, isNUW, TD, TLI, DT)) {
145 PHITranslateSubExpr(Value *V, BasicBlock *CurBB, BasicBlock *PredBB, const DominatorTree *DT) argument
322 PHITranslateValue(BasicBlock *CurBB, BasicBlock *PredBB, const DominatorTree *DT) argument
346 PHITranslateWithInsertion(BasicBlock *CurBB, BasicBlock *PredBB, const DominatorTree &DT, SmallVectorImpl<Instruction*> &NewInsts) argument
370 InsertPHITranslatedSubExpr(Value *InVal, BasicBlock *CurBB, BasicBlock *PredBB, const DominatorTree &DT, SmallVectorImpl<Instruction*> &NewInsts) argument
[all...]
H A DScalarEvolutionNormalization.cpp30 const Loop *L, DominatorTree *DT) {
40 if (DT->dominates(LatchBlock, User->getParent()))
55 !DT->dominates(LatchBlock, PN->getIncomingBlock(i)))
71 DominatorTree &DT; member in class:__anon10109::PostIncTransform
78 Kind(kind), Loops(loops), SE(se), DT(dt) {}
122 if (IVUseShouldUsePostIncValue(User, OperandValToReplace, L, &DT)) {
220 DominatorTree &DT) {
221 PostIncTransform Transform(Kind, Loops, SE, DT);
29 IVUseShouldUsePostIncValue(Instruction *User, Value *Operand, const Loop *L, DominatorTree *DT) argument
214 TransformForPostIncUse(TransformKind Kind, const SCEV *S, Instruction *User, Value *OperandValToReplace, PostIncLoopSet &Loops, ScalarEvolution &SE, DominatorTree &DT) argument
/macosx-10.9.5/llvmCore-3425.0.33/include/llvm/Analysis/
H A DDominatorInternals.h34 unsigned DFSPass(DominatorTreeBase<typename GraphT::NodeType>& DT, argument
40 InfoRec &VInfo = DT.Info[DT.Roots[i]];
47 InfoRec &SuccVInfo = DT.Info[*SI];
50 N = DTDFSPass(DT, *SI, N);
64 DT.Info[BB];
71 DT.Vertex.push_back(BB); // Vertex[n] = V;
96 DT.Info[Succ];
108 Eval(DominatorTreeBase<typename GraphT::NodeType>& DT, argument
111 DT
151 Calculate(DominatorTreeBase<typename GraphTraits<NodeT>::NodeType>& DT, FuncT& F) argument
[all...]
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
88 getEntryNode(PostDominatorTree *DT) argument
[all...]
H A DInstructionSimplify.h37 const DominatorTree *DT = 0);
44 const DominatorTree *DT = 0);
50 const DominatorTree *DT = 0);
56 const DominatorTree *DT = 0);
62 const DominatorTree *DT = 0);
68 const DominatorTree *DT = 0);
74 const DominatorTree *DT = 0);
80 const DominatorTree *DT = 0);
86 const DominatorTree *DT = 0);
93 const DominatorTree *DT
[all...]
H A DPHITransAddr.h74 /// dominator tree DT is non-null, the translated value must dominate
77 const DominatorTree *DT);
87 const DominatorTree &DT,
98 const DominatorTree *DT);
106 BasicBlock *PredBB, const DominatorTree &DT,
H A DScalarEvolutionNormalization.h74 DominatorTree &DT);
H A DDominators.h183 void Calculate(DominatorTreeBase<typename GraphTraits<N>::NodeType>& DT,
239 void Split(DominatorTreeBase<typename GraphT::NodeType>& DT, argument
260 if (ND != NewBB && !DT.dominates(NewBBSucc, ND) &&
261 DT.isReachableFromEntry(ND)) {
272 if (DT.isReachableFromEntry(PredBlocks[i])) {
284 if (DT.isReachableFromEntry(PredBlocks[i]))
285 NewBBIDom = DT.findNearestCommonDominator(NewBBIDom, PredBlocks[i]);
289 DomTreeNodeBase<NodeT> *NewBBNode = DT.addNewBlock(NewBB, NewBBIDom);
294 DomTreeNodeBase<NodeT> *NewBBSuccNode = DT.getNode(NewBBSucc);
295 DT
730 DominatorTreeBase<BasicBlock>* DT; member in class:llvm::DominatorTree
905 getEntryNode(DominatorTree *DT) argument
[all...]
/macosx-10.9.5/llvmCore-3425.0.33/include/llvm/CodeGen/
H A DMachinePostDominators.h31 DominatorTreeBase<MachineBasicBlock> *DT; member in struct:llvm::MachinePostDominatorTree
43 return DT->getRoots();
47 return DT->getRootNode();
51 return DT->getNode(BB);
55 return DT->getNode(BB);
59 return DT->dominates(A, B);
63 return DT->dominates(A, B);
68 return DT->properlyDominates(A, B);
73 return DT->properlyDominates(A, B);
78 return DT
[all...]
H A DMachineDominators.h43 DominatorTreeBase<MachineBasicBlock>* DT; member in class:llvm::MachineDominatorTree
49 DominatorTreeBase<MachineBasicBlock>& getBase() { return *DT; }
58 return DT->getRoots();
62 return DT->getRoot();
66 return DT->getRootNode();
72 return DT->dominates(A, B);
76 return DT->dominates(A, B);
83 if (BBA != BBB) return DT->dominates(BBA, BBB);
90 //if(!DT.IsPostDominators) {
101 return DT
196 getEntryNode(MachineDominatorTree *DT) argument
[all...]
/macosx-10.9.5/llvmCore-3425.0.33/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.cpp38 DT->recalculate(F);
46 DT = new DominatorTreeBase<MachineBasicBlock>(false);
50 delete DT;
54 DT->releaseMemory();
58 DT->print(OS);
H A DStackProtector.cpp44 DominatorTree *DT; member in class:__anon10221::StackProtector
95 DT = getAnalysisIfAvailable<DominatorTree>();
243 if (DT && DT->isReachableFromEntry(BB)) {
244 DT->addNewBlock(NewBB, BB);
245 FailBBDom = FailBBDom ? DT->findNearestCommonDominator(FailBBDom, BB) :BB;
266 if (DT && FailBBDom)
267 DT->addNewBlock(FailBB, FailBBDom);
/macosx-10.9.5/IOSCSIParallelFamily-300.0.2/TestTools/SCSITargetProber/Cocoa/Resources/English.lproj/
H A DLocalizable.strings24 DT = "DT";
/macosx-10.9.5/llvmCore-3425.0.33/include/llvm/Transforms/Utils/
H A DCodeExtractor.h48 DominatorTree *const DT; member in class:llvm::CodeExtractor
69 CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT = 0,
76 CodeExtractor(DominatorTree &DT, Loop &L, bool AggregateArgs = false);
82 CodeExtractor(DominatorTree &DT, const RegionNode &RN,
H A DPromoteMemToReg.h40 DominatorTree &DT, AliasSetTracker *AST = 0);
/macosx-10.9.5/llvmCore-3425.0.33/lib/Transforms/Utils/
H A DLCSSA.cpp55 DominatorTree *DT; member in struct:__anon10649::LCSSA
81 assert(L->isLCSSAForm(*DT) && "LCSSA form not preserved!");
105 DominatorTree *DT) {
106 DomTreeNode *DomNode = DT->getNode(BB);
108 if (DT->dominates(DomNode, DT->getNode(ExitBlocks[i])))
119 DT = &getAnalysis<DominatorTree>();
144 if (!BlockDominatesAnExit(BB, ExitBlocks, DT))
160 assert(L->isLCSSAForm(*DT));
208 DomTreeNode *DomNode = DT
103 BlockDominatesAnExit(BasicBlock *BB, const SmallVectorImpl<BasicBlock*> &ExitBlocks, DominatorTree *DT) argument
[all...]
H A DMem2Reg.cpp64 DominatorTree &DT = getAnalysis<DominatorTree>(); local
78 PromoteMemToReg(Allocas, DT);
/macosx-10.9.5/tcl-102/tcl/tcl/tools/
H A Dindex.tcl115 DT -
145 DESCRIPTION {set state DT}
146 INTRODUCTION {set state DT}
/macosx-10.9.5/tcl-102/tcl84/tcl/tools/
H A Dindex.tcl115 DT -
145 DESCRIPTION {set state DT}
146 INTRODUCTION {set state DT}
/macosx-10.9.5/tcl-102/tcl_ext/incrtcl/iwidgets/doc/
H A Dtk2html.awk71 # <DT> Line1
73 # <DT>
86 print "<DT> " $0
108 print "<DT> " $2 "\t\t" $3 "\t\t("$4")"
/macosx-10.9.5/llvmCore-3425.0.33/lib/Transforms/Scalar/
H A DLoopRotation.cpp248 if (DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>())
249 DT->eraseNode(Latch);
409 if (DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>()) {
414 DomTreeNode *OrigHeaderNode = DT->getNode(OrigHeader);
417 DomTreeNode *OrigPreheaderNode = DT->getNode(OrigPreheader);
419 DT->changeImmediateDominator(HeaderChildren[I], OrigPreheaderNode);
421 assert(DT->getNode(Exit)->getIDom() == OrigPreheaderNode);
422 assert(DT->getNode(NewHeader)->getIDom() == OrigPreheaderNode);
425 DT->changeImmediateDominator(OrigHeader, OrigLatch);
447 if (DominatorTree *DT
[all...]
/macosx-10.9.5/CPANInternal-140/DateTime/t/
H A D14locale.t26 package DT::Object;
30 eval { DateTime->from_object( object => (bless {}, 'DT::Object'), locale => 'en_US' ) };

Completed in 194 milliseconds

12345