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

12345

/freebsd-9.3-release/contrib/llvm/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 DCFG.cpp138 const DominatorTree *DT,
142 if (DT && !DT->isReachableFromEntry(StopBB))
143 DT = 0;
155 if (DT && DT->dominates(BB, StopBB))
183 const DominatorTree *DT, const LoopInfo *LI) {
191 DT, LI);
195 const DominatorTree *DT, const LoopInfo *LI) {
244 DT, L
136 isPotentiallyReachableInner(SmallVectorImpl<BasicBlock *> &Worklist, BasicBlock *StopBB, const DominatorTree *DT, const LoopInfo *LI) argument
182 isPotentiallyReachable(const BasicBlock *A, const BasicBlock *B, const DominatorTree *DT, const LoopInfo *LI) argument
194 isPotentiallyReachable(const Instruction *A, const Instruction *B, const DominatorTree *DT, const LoopInfo *LI) 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:__anon2087::PostIncTransform
78 Kind(kind), Loops(loops), SE(se), DT(dt) {}
133 IVUseShouldUsePostIncValue(User, OperandValToReplace, L, &DT)) {
228 DominatorTree &DT) {
229 PostIncTransform Transform(Kind, Loops, SE, DT);
29 IVUseShouldUsePostIncValue(Instruction *User, Value *Operand, const Loop *L, DominatorTree *DT) argument
222 TransformForPostIncUse(TransformKind Kind, const SCEV *S, Instruction *User, Value *OperandValToReplace, PostIncLoopSet &Loops, ScalarEvolution &SE, DominatorTree &DT) argument
/freebsd-9.3-release/contrib/llvm/include/llvm/Analysis/
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
93 getEntryNode(PostDominatorTree *DT) argument
[all...]
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 DInstructionSimplify.h53 const DominatorTree *DT = 0);
60 const DominatorTree *DT = 0);
67 const DominatorTree *DT = 0);
74 const DominatorTree *DT = 0);
82 const DominatorTree *DT = 0);
88 const DominatorTree *DT = 0);
94 const DominatorTree *DT = 0);
100 const DominatorTree *DT = 0);
106 const DominatorTree *DT = 0);
112 const DominatorTree *DT
[all...]
H A DCFG.h61 /// Using DT or LI allows us to answer more quickly. LI reduces the cost of
63 /// single block. DT reduces the cost by allowing the search to terminate when
64 /// we find a block that dominates the block containing 'To'. DT is most useful
68 const DominatorTree *DT = 0,
78 const DominatorTree *DT = 0,
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
743 DominatorTreeBase<BasicBlock>* DT; member in class:llvm::DominatorTree
924 getEntryNode(DominatorTree *DT) argument
[all...]
H A DDominanceFrontier.h172 DominatorTree &DT = getAnalysis<DominatorTree>(); local
173 Roots = DT.getRoots();
175 calculate(DT, DT[Roots[0]]);
184 const DomSetType &calculate(const DominatorTree &DT,
/freebsd-9.3-release/contrib/llvm/include/llvm/CodeGen/
H A DMachinePostDominators.h30 DominatorTreeBase<MachineBasicBlock> *DT; member in struct:llvm::MachinePostDominatorTree
42 return DT->getRoots();
46 return DT->getRootNode();
50 return DT->getNode(BB);
54 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();
73 return DT->dominates(A, B);
78 return DT->dominates(A, B);
85 if (BBA != BBB) return DT->dominates(BBA, BBB);
92 //if(!DT.IsPostDominators) {
103 return DT
198 getEntryNode(MachineDominatorTree *DT) argument
[all...]
/freebsd-9.3-release/contrib/llvm/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);
/freebsd-9.3-release/contrib/llvm/tools/clang/include/clang/Analysis/Analyses/
H A DDominators.h35 llvm::DominatorTreeBase<CFGBlock>* DT; member in class:clang::DominatorTree
38 DT = new llvm::DominatorTreeBase<CFGBlock>(false);
42 delete DT;
45 llvm::DominatorTreeBase<CFGBlock>& getBase() { return *DT; }
50 return DT->getRoot();
56 return DT->getRootNode();
70 if (DT->compare(Other.getBase()))
81 DT->recalculate(*cfg);
91 if(DT->getNode(*I)->getIDom())
94 << DT
197 getEntryNode(::clang::DominatorTree *DT) argument
[all...]
/freebsd-9.3-release/contrib/llvm/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.h43 void PromoteMemToReg(ArrayRef<AllocaInst *> Allocas, DominatorTree &DT,
/freebsd-9.3-release/contrib/llvm/tools/clang/include/clang/Lex/
H A DDirectoryLookup.h68 DirectoryLookup(const DirectoryEntry *dir, SrcMgr::CharacteristicKind DT, argument
70 : DirCharacteristic(DT),
78 DirectoryLookup(const HeaderMap *map, SrcMgr::CharacteristicKind DT, argument
80 : DirCharacteristic(DT), LookupType(LT_HeaderMap),
/freebsd-9.3-release/contrib/llvm/lib/Transforms/Utils/
H A DLCSSA.cpp56 DominatorTree *DT; member in struct:__anon2700::LCSSA
84 assert(L->isLCSSAForm(*DT) && "LCSSA form not preserved!");
103 DominatorTree *DT) {
104 DomTreeNode *DomNode = DT->getNode(BB);
106 if (DT->dominates(DomNode, DT->getNode(ExitBlocks[i])))
117 DT = &getAnalysis<DominatorTree>();
139 if (!BlockDominatesAnExit(BB, ExitBlocks, DT))
161 assert(L->isLCSSAForm(*DT));
209 DomTreeNode *DomNode = DT
101 BlockDominatesAnExit(BasicBlock *BB, const SmallVectorImpl<BasicBlock*> &ExitBlocks, DominatorTree *DT) argument
[all...]
H A DMem2Reg.cpp64 DominatorTree &DT = getAnalysis<DominatorTree>(); local
78 PromoteMemToReg(Allocas, DT);
/freebsd-9.3-release/contrib/llvm/lib/Transforms/Scalar/
H A DLoopRotation.cpp254 if (DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>())
255 DT->eraseNode(Latch);
436 if (DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>()) {
441 DomTreeNode *OrigHeaderNode = DT->getNode(OrigHeader);
444 DomTreeNode *OrigPreheaderNode = DT->getNode(OrigPreheader);
446 DT->changeImmediateDominator(HeaderChildren[I], OrigPreheaderNode);
448 assert(DT->getNode(Exit)->getIDom() == OrigPreheaderNode);
449 assert(DT->getNode(NewHeader)->getIDom() == OrigPreheaderNode);
452 DT->changeImmediateDominator(OrigHeader, OrigLatch);
474 if (DominatorTree *DT
[all...]
/freebsd-9.3-release/share/colldef/
H A Dhr_HR.ISO8859-2.src39 \{;|;\};~;<DG>;<DT>
H A Dsl_SI.ISO8859-2.src39 \{;|;\};~;<DG>;<DT>

Completed in 134 milliseconds

12345