Searched refs:DT (Results 76 - 100 of 182) sorted by relevance

12345678

/freebsd-11.0-release/contrib/llvm/include/llvm/Analysis/
H A DDominanceFrontierImpl.h153 ForwardDominanceFrontierBase<BlockT>::calculate(const DomTreeT &DT, argument
181 if (DT[*SI]->getIDom() != currentNode)
213 if (!DT.properlyDominates(parentNode, DT[*CDFI]))
H A DLazyValueInfo.h33 DominatorTree *DT; member in class:llvm::LazyValueInfo
H A DLoopAccessAnalysis.h513 DominatorTree *DT, LoopInfo *LI,
533 DominatorTree *DT);
619 DominatorTree *DT; member in class:llvm::LoopAccessInfo
705 DominatorTree *DT; member in class:llvm::LoopAccessAnalysis
/freebsd-11.0-release/contrib/llvm/include/llvm/CodeGen/
H A DStackProtector.h61 DominatorTree *DT; member in class:llvm::StackProtector
H A DMachineRegionInfo.h69 MachineDominatorTree *DT, MachineRegion *Parent = nullptr);
87 MachineDominatorTree *DT,
/freebsd-11.0-release/contrib/llvm/lib/Analysis/
H A DBasicAliasAnalysis.cpp184 AssumptionCache *AC, DominatorTree *DT, bool &NSW, bool &NUW) {
224 BOp, DT)) {
232 SExtBits, DL, Depth + 1, AC, DT, NSW, NUW);
237 SExtBits, DL, Depth + 1, AC, DT, NSW, NUW);
242 SExtBits, DL, Depth + 1, AC, DT, NSW, NUW);
248 SExtBits, DL, Depth + 1, AC, DT, NSW, NUW);
275 Depth + 1, AC, DT, NSW, NUW);
338 const DataLayout &DL, AssumptionCache *AC, DominatorTree *DT) {
426 SExtBits, DL, 0, AC, DT, NSW, NUW);
936 GEP2MaxLookupReached, DL, &AC, DT);
181 GetLinearExpression( const Value *V, APInt &Scale, APInt &Offset, unsigned &ZExtBits, unsigned &SExtBits, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, DominatorTree *DT, bool &NSW, bool &NUW) argument
335 DecomposeGEPExpression( const Value *V, int64_t &BaseOffs, SmallVectorImpl<VariableGEPIndex> &VarIndices, bool &MaxLookupReached, const DataLayout &DL, AssumptionCache *AC, DominatorTree *DT) argument
1096 0, &AC, nullptr, DT); local
1521 constantOffsetHeuristic( const SmallVectorImpl<VariableGEPIndex> &VarIndices, uint64_t V1Size, uint64_t V2Size, int64_t BaseOffset, AssumptionCache *AC, DominatorTree *DT) argument
[all...]
H A DValueTracking.cpp95 // the context instruction are not in the same block then the DT helps in
101 const DominatorTree *DT; member in struct:__anon2420::Query
104 const DominatorTree *DT = nullptr)
105 : AC(AC), CxtI(CxtI), DT(DT) {}
108 : ExclInvs(Q.ExclInvs), AC(Q.AC), CxtI(Q.CxtI), DT(Q.DT) {
137 const DominatorTree *DT) {
139 Query(AC, safeCxtI(V, CxtI), DT));
144 const DominatorTree *DT) {
134 computeKnownBits(Value *V, APInt &KnownZero, APInt &KnownOne, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument
142 haveNoCommonBitsSet(Value *LHS, Value *RHS, const DataLayout &DL, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument
161 ComputeSignBit(Value *V, bool &KnownZero, bool &KnownOne, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument
172 isKnownToBeAPowerOfTwo(Value *V, const DataLayout &DL, bool OrZero, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument
183 isKnownNonZero(Value *V, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument
189 isKnownNonNegative(Value *V, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument
200 isKnownNonEqual(Value *V1, Value *V2, const DataLayout &DL, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument
211 MaskedValueIsZero(Value *V, const APInt &Mask, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument
221 ComputeNumSignBits(Value *V, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument
507 isValidAssumeForContext(const Instruction *I, const Instruction *CxtI, const DominatorTree *DT) argument
3136 isDereferenceableFromAttribute(const Value *BV, APInt Offset, Type *Ty, const DataLayout &DL, const Instruction *CtxI, const DominatorTree *DT, const TargetLibraryInfo *TLI) argument
3181 isDereferenceableFromAttribute(const Value *V, const DataLayout &DL, const Instruction *CtxI, const DominatorTree *DT, const TargetLibraryInfo *TLI) argument
3220 isDereferenceableAndAlignedPointer( const Value *V, unsigned Align, const DataLayout &DL, const Instruction *CtxI, const DominatorTree *DT, const TargetLibraryInfo *TLI, SmallPtrSetImpl<const Value *> &Visited) argument
3301 isDereferenceableAndAlignedPointer(const Value *V, unsigned Align, const DataLayout &DL, const Instruction *CtxI, const DominatorTree *DT, const TargetLibraryInfo *TLI) argument
3332 isDereferenceablePointer(const Value *V, const DataLayout &DL, const Instruction *CtxI, const DominatorTree *DT, const TargetLibraryInfo *TLI) argument
3339 isSafeToSpeculativelyExecute(const Value *V, const Instruction *CtxI, const DominatorTree *DT, const TargetLibraryInfo *TLI) argument
3495 isKnownNonNullFromDominatingCondition(const Value *V, const Instruction *CtxI, const DominatorTree *DT) argument
3543 isKnownNonNullAt(const Value *V, const Instruction *CtxI, const DominatorTree *DT, const TargetLibraryInfo *TLI) argument
3551 computeOverflowForUnsignedMul(Value *LHS, Value *RHS, const DataLayout &DL, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument
3601 computeOverflowForUnsignedAdd(Value *LHS, Value *RHS, const DataLayout &DL, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument
3630 computeOverflowForSignedAdd( Value *LHS, Value *RHS, AddOperator *Add, const DataLayout &DL, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument
3674 computeOverflowForSignedAdd(AddOperator *Add, const DataLayout &DL, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument
3683 computeOverflowForSignedAdd(Value *LHS, Value *RHS, const DataLayout &DL, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument
4115 isTruePredicate(CmpInst::Predicate Pred, Value *LHS, Value *RHS, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument
4176 isImpliedCondOperands(CmpInst::Predicate Pred, Value *ALHS, Value *ARHS, Value *BLHS, Value *BRHS, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument
4201 isImpliedCondition(Value *LHS, Value *RHS, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument
[all...]
H A DDomPrinter.cpp57 static std::string getGraphName(DominatorTree *DT) { argument
73 static std::string getGraphName(PostDominatorTree *DT) { argument
H A DLazyValueInfo.cpp363 DominatorTree *DT; ///< An optional DT pointer. member in class:__anon2399::LazyValueInfoCache
463 DominatorTree *DT = nullptr)
464 : AC(AC), DL(DL), DT(DT) {}
796 if (!isValidAssumeForContext(I, BBI, DT))
1167 DominatorTree *DT = nullptr) {
1170 PImpl = new LazyValueInfoCache(AC, *DL, DT);
1181 DT = DTWP ? &DTWP->getDomTree() : nullptr;
1186 getCache(PImpl, AC, &DL, DT)
[all...]
H A DScalarEvolutionExpander.cpp83 assert(SE.DT.dominates(Ret, &*BIP));
497 SE.DT.dominates(cast<Instruction>(V), &*Builder.GetInsertPoint()));
588 DominatorTree &DT) {
593 if (DT.dominates(A->getHeader(), B->getHeader())) return B;
594 if (DT.dominates(B->getHeader(), A->getHeader())) return A;
620 L = PickMostRelevantLoop(L, getRelevantLoop(Op), SE.DT);
629 getRelevantLoop(D->getLHS()), getRelevantLoop(D->getRHS()), SE.DT);
639 DominatorTree &DT; member in class:__anon2414::LoopCompare
641 explicit LoopCompare(DominatorTree &dt) : DT(dt) {}
652 return PickMostRelevantLoop(LHS.first, RHS.first, DT) !
587 PickMostRelevantLoop(const Loop *A, const Loop *B, DominatorTree &DT) argument
992 hoistBeforePos(DominatorTree *DT, Instruction *InstToHoist, Instruction *Pos, PHINode *LoopPhi) argument
1689 replaceCongruentIVs(Loop *L, const DominatorTree *DT, SmallVectorImpl<WeakVH> &DeadInsts, const TargetTransformInfo *TTI) argument
[all...]
/freebsd-11.0-release/contrib/llvm/lib/CodeGen/
H A DStackProtector.cpp90 DT = DTWP ? &DTWP->getDomTree() : nullptr;
439 if (DT && DT->isReachableFromEntry(BB)) {
440 DT->addNewBlock(NewBB, BB);
441 DT->addNewBlock(FailBB, BB);
H A DMachineSink.cpp60 MachineDominatorTree *DT; // Machine dominator tree member in class:__anon2495::MachineSinking
251 if (!DT->dominates(MBB, UseBlock))
267 DT = &getAnalysis<MachineDominatorTree>();
317 if (!DT->isReachableFromEntry(&MBB)) return false;
462 if (!DT->dominates(ToBB, *PI))
560 DT->getNode(MBB)->getChildren();
740 if (!TryBreak && !DT->dominates(ParentBlock, SuccToSinkTo)) {
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Scalar/
H A DLoopInterchange.cpp334 LoopInfo *LI, DominatorTree *DT, bool PreserveLCSSA)
335 : OuterLoop(Outer), InnerLoop(Inner), SE(SE), LI(LI), DT(DT),
362 DominatorTree *DT; member in class:__anon3204::LoopInterchangeLegality
393 LoopInfo *LI, DominatorTree *DT,
396 : OuterLoop(Outer), InnerLoop(Inner), SE(SE), LI(LI), DT(DT),
423 DominatorTree *DT; member in class:__anon3204::LoopInterchangeTransform
434 DominatorTree *DT; member in struct:__anon3204::LoopInterchange
437 : FunctionPass(ID), SE(nullptr), LI(nullptr), DA(nullptr), DT(nullpt
333 LoopInterchangeLegality(Loop *Outer, Loop *Inner, ScalarEvolution *SE, LoopInfo *LI, DominatorTree *DT, bool PreserveLCSSA) argument
392 LoopInterchangeTransform(Loop *Outer, Loop *Inner, ScalarEvolution *SE, LoopInfo *LI, DominatorTree *DT, BasicBlock *LoopNestExit, bool InnerLoopContainsReductions) argument
[all...]
H A DEarlyCSE.cpp269 DominatorTree &DT; member in class:__anon3181::EarlyCSE
329 DominatorTree &DT, AssumptionCache &AC)
330 : TLI(TLI), TTI(TTI), DT(DT), AC(AC), CurrentGeneration(0) {}
534 replaceDominatedUsesWith(CondInst, ConditionalConstant, DT,
572 if (Value *V = SimplifyInstruction(Inst, DL, &TLI, &DT, &AC)) {
779 DT.getRootNode(), DT.getRootNode()->begin(), DT.getRootNode()->end()));
824 auto &DT local
328 EarlyCSE(const TargetLibraryInfo &TLI, const TargetTransformInfo &TTI, DominatorTree &DT, AssumptionCache &AC) argument
861 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); variable
[all...]
H A DLoopInstSimplify.cpp78 DominatorTree *DT = DTWP ? &DTWP->getDomTree() : nullptr; local
125 Value *V = SimplifyInstruction(I, DL, TLI, DT, &AC);
H A DLoopUnswitch.cpp186 DominatorTree *DT; member in class:__anon3223::LoopUnswitch
201 currentLoop(nullptr), DT(nullptr), loopHeader(nullptr),
440 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
459 assert(currentLoop->isLCSSAForm(*DT));
466 DT->recalculate(*F);
750 auto Options = CriticalEdgeSplittingOptions(DT, LI).setPreserveLCSSA();
772 BasicBlock *NewPH = SplitEdge(loopPreheader, loopHeader, DT, LI);
783 BasicBlock *NewExit = SplitBlock(ExitBlock, &ExitBlock->front(), DT, LI);
961 SplitBlockPredecessors(ExitBlock, Preds, ".us-lcssa", DT, LI,
985 BasicBlock *NewPreheader = SplitEdge(loopPreheader, loopHeader, DT, L
[all...]
H A DConstantHoisting.cpp110 DominatorTree *DT; member in class:__anon3172::ConstantHoisting
123 ConstantHoisting() : FunctionPass(ID), TTI(nullptr), DT(nullptr),
141 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
153 DT = nullptr;
235 BasicBlock *IDom = DT->getNode(Inst->getParent())->getIDom()->getBlock();
256 BB = DT->findNearestCommonDominator(BB1, BB2);
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Utils/
H A DLoopUnroll.cpp161 DominatorTree *DT, AssumptionCache *AC,
232 !UnrollRuntimeLoopProlog(L, Count, AllowExpensiveTripCount, LI, SE, DT,
490 if (DT)
491 DT->recalculate(*L->getHeader()->getParent());
496 simplifyLoopIVs(L, SE, DT, LI, DeadInsts);
537 if (DT) {
541 bool Simplified = simplifyLoop(OuterL, DT, LI, SE, AC, PreserveLCSSA);
552 formLCSSARecursively(*OuterL, *DT, LI, SE);
554 assert(OuterL->isLCSSAForm(*DT) &&
158 UnrollLoop(Loop *L, unsigned Count, unsigned TripCount, bool AllowRuntime, bool AllowExpensiveTripCount, unsigned TripMultiple, LoopInfo *LI, ScalarEvolution *SE, DominatorTree *DT, AssumptionCache *AC, bool PreserveLCSSA) argument
H A DLoopUnrollRuntime.cpp65 ValueToValueMapTy &VMap, DominatorTree *DT,
130 SplitBlockPredecessors(Exit, Preds, ".unr-lcssa", DT, LI,
282 ScalarEvolution *SE, DominatorTree *DT,
338 BasicBlock *PEnd = SplitEdge(PH, Header, DT, LI);
339 BasicBlock *NewPH = SplitBlock(PEnd, PEnd->getTerminator(), DT, LI);
411 ConnectProlog(L, BECount, Count, LastLoopBB, PEnd, PH, NewPH, VMap, DT, LI,
62 ConnectProlog(Loop *L, Value *BECount, unsigned Count, BasicBlock *LastPrologBB, BasicBlock *PrologEnd, BasicBlock *OrigPH, BasicBlock *NewPH, ValueToValueMapTy &VMap, DominatorTree *DT, LoopInfo *LI, bool PreserveLCSSA) argument
280 UnrollRuntimeLoopProlog(Loop *L, unsigned Count, bool AllowExpensiveTripCount, LoopInfo *LI, ScalarEvolution *SE, DominatorTree *DT, bool PreserveLCSSA) argument
H A DPromoteMemoryToRegister.cpp225 DominatorTree &DT; member in struct:__anon3284::PromoteMem2Reg
271 PromoteMem2Reg(ArrayRef<AllocaInst *> Allocas, DominatorTree &DT, argument
273 : Allocas(Allocas.begin(), Allocas.end()), DT(DT),
274 DIB(*DT.getRoot()->getParent()->getParent(), /*AllowUnresolved*/ false),
338 DominatorTree &DT,
375 !DT.dominates(StoreBB, LI->getParent())) {
518 Function &F = *DT.getRoot()->getParent();
526 IDFCalculator IDF(DT);
556 if (rewriteSingleStoreAlloca(AI, Info, LBI, DT, AS
336 rewriteSingleStoreAlloca(AllocaInst *AI, AllocaInfo &Info, LargeBlockInfo &LBI, DominatorTree &DT, AliasSetTracker *AST) argument
986 PromoteMemToReg(ArrayRef<AllocaInst *> Allocas, DominatorTree &DT, AliasSetTracker *AST, AssumptionCache *AC) argument
[all...]
/freebsd-11.0-release/contrib/llvm/include/llvm/Support/
H A DGenericDomTree.h179 void Calculate(DominatorTreeBase<typename GraphTraits<N>::NodeType> &DT,
253 void Split(DominatorTreeBase<typename GraphT::NodeType> &DT, argument
276 if (ND != NewBB && !DT.dominates(NewBBSucc, ND) &&
277 DT.isReachableFromEntry(ND)) {
288 if (DT.isReachableFromEntry(PredBlocks[i])) {
300 if (DT.isReachableFromEntry(PredBlocks[i]))
301 NewBBIDom = DT.findNearestCommonDominator(NewBBIDom, PredBlocks[i]);
305 DomTreeNodeBase<NodeT> *NewBBNode = DT.addNewBlock(NewBB, NewBBIDom);
310 DomTreeNodeBase<NodeT> *NewBBSuccNode = DT.getNode(NewBBSucc);
311 DT
[all...]
H A DCommandLine.h383 template <class DT> void setValue(const DT & /*V*/) {}
451 template <class DT> OptionValue<DataType> &operator=(const DT &V) {
695 template <class DT>
696 void addLiteralOption(const char *Name, const DT &V, const char *HelpStr) {
990 template <class ParserClass, class DT>
991 void printOptionDiff(const Option &O, const generic_parser_base &P, const DT &V,
992 const OptionValue<DT> &Default, size_t GlobalWidth) {
993 OptionValue<DT> O
[all...]
/freebsd-11.0-release/contrib/llvm/lib/Target/Hexagon/
H A DHexagonGenExtract.cpp71 DominatorTree *DT; member in class:__anon2856::HexagonGenExtract
213 DomTreeNode *DTN = DT->getNode(B);
245 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
H A DHexagonCommonGEP.cpp139 DominatorTree *DT; member in class:__anon2837::HexagonCommonGEP
299 // Compute block ordering for a typical DT-based traversal of the flow
304 DomTreeNode *DTN = DT->getNode(Root);
394 // The creation of gep nodes requires DT-traversal. When processing a GEP
653 BasicBlock *nearest_common_dominator(DominatorTree *DT, T &Blocks) { argument
673 Dom = B ? DT->findNearestCommonDominator(Dom, B) : 0;
682 BasicBlock *nearest_common_dominatee(DominatorTree *DT, T &Blocks) { argument
690 return DT->getRoot();
696 if (DT->dominates(B, DomB))
698 if (!DT
855 preheader(DominatorTree *DT, Loop *L) argument
[all...]
/freebsd-11.0-release/contrib/llvm/lib/Target/AMDGPU/
H A DSIAnnotateControlFlow.cpp67 DominatorTree *DT; member in class:__anon2746::SIAnnotateControlFlow
173 BasicBlock *IDom = DT->getNode(Phi->getParent())->getIDom()->getBlock();
239 BasicBlock *IDom = DT->getNode(Parent)->getIDom()->getBlock();
315 BB = llvm::SplitBlockPredecessors(BB, Preds, "endcf.split", DT, LI, false);
324 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();

Completed in 202 milliseconds

12345678