/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | DwarfEHPrepare.cpp | 51 DominatorTree *DT = nullptr; member in class:__anon4535::DwarfEHPrepare 149 if (isPotentiallyReachable(LP, RI, nullptr, DT)) { 262 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); 265 DT = nullptr;
|
H A D | MachineCSE.cpp | 69 MachineDominatorTree *DT; member in class:__anon4579::MachineCSE 140 bool PerformSimplePRE(MachineDominatorTree *DT); 792 bool MachineCSE::ProcessBlockPRE(MachineDominatorTree *DT, argument 809 !DT->properlyDominates(MBB, MBB1) && 811 auto CMBB = DT->findNearestCommonDominator(MBB, MBB1); 850 bool MachineCSE::PerformSimplePRE(MachineDominatorTree *DT) { argument 855 BBs.push_back(DT->getRootNode()); 863 Changed |= ProcessBlockPRE(DT, MBB); 875 assert(DT->dominates(CandidateBB, MBB) && "CandidateBB should dominate MBB"); 876 assert(DT [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | ConstantHoisting.cpp | 194 auto IDom = DT->getNode(Inst->getParent())->getIDom(); 206 static void findBestInsertionSet(DominatorTree &DT, BlockFrequencyInfo &BFI, argument 218 if (!DT.isReachableFromEntry(BB)) 232 assert(DT.getNode(Node)->getIDom() && 234 Node = DT.getNode(Node)->getIDom()->getBlock(); 253 for (auto ChildDomNode : DT.getNode(Node)->getChildren()) { 284 BasicBlock *Parent = DT.getNode(Node)->getIDom()->getBlock(); 325 findBestInsertionSet(*DT, *BFI, Entry, BBs); 339 BB = DT->findNearestCommonDominator(BB1, BB2); 506 if (!DT 932 runImpl(Function &Fn, TargetTransformInfo &TTI, DominatorTree &DT, BlockFrequencyInfo *BFI, BasicBlock &Entry, ProfileSummaryInfo *PSI) argument 973 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); local [all...] |
H A D | LoopPassManager.cpp | 61 assert(L.isRecursivelyLCSSAForm(AR.DT, AR.LI) &&
|
H A D | AlignmentFromAssumptions.cpp | 313 if (isValidAssumeForContext(ACall, K, DT)) 366 if (!Visited.count(K) && isValidAssumeForContext(ACall, K, DT)) 380 DominatorTree *DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree(); local 382 return Impl.runImpl(F, AC, SE, DT); 389 DT = DT_; 404 DominatorTree &DT = AM.getResult<DominatorTreeAnalysis>(F); local 405 if (!runImpl(F, AC, &SE, &DT))
|
H A D | CorrelatedValuePropagation.cpp | 161 DominatorTree *DT) { 184 if (!DT->dominates(CommonInst, ToBB)) 212 static bool processPHI(PHINode *P, LazyValueInfo *LVI, DominatorTree *DT, argument 274 Changed = simplifyCommonValuePhi(P, LVI, DT); 338 DominatorTree *DT) { 339 DomTreeUpdater DTU(*DT, DomTreeUpdater::UpdateStrategy::Lazy); 830 static bool runImpl(Function &F, LazyValueInfo *LVI, DominatorTree *DT, argument 847 BBChanged |= processPHI(cast<PHINode>(II), LVI, DT, SQ); 892 BBChanged |= processSwitch(cast<SwitchInst>(Term), LVI, DT); 921 DominatorTree *DT local 160 simplifyCommonValuePhi(PHINode *P, LazyValueInfo *LVI, DominatorTree *DT) argument 337 processSwitch(SwitchInst *I, LazyValueInfo *LVI, DominatorTree *DT) argument 929 DominatorTree *DT = &AM.getResult<DominatorTreeAnalysis>(F); local [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/AArch64/ |
H A D | AArch64PromoteConstant.cpp | 370 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>( local 376 if (NewPt == IPI.first || DT.dominates(IPI.first, NewPt) || 377 // When IPI.first is a terminator instruction, DT may think that 381 DT.dominates(IPI.first->getParent(), NewPt->getParent()))) { 396 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>( local 419 BasicBlock *CommonDominator = DT.findNearestCommonDominator(NewBB, CurBB); 490 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>(F).getDomTree(); local 507 assert(DT.dominates(LoadedCst,
|
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | RegionInfo.h | 275 DomTreeT *DT; member in class:llvm::RegionBase 309 /// @param DT The dominator tree of the current function. 312 RegionBase(BlockT *Entry, BlockT *Exit, RegionInfoT *RI, DomTreeT *DT, 699 : DT(std::move(Arg.DT)), PDT(std::move(Arg.PDT)), DF(std::move(Arg.DF)), 706 DT = std::move(RHS.DT); 717 DomTreeT *DT; member in class:llvm::RegionInfoBase 747 DT = nullptr; 895 Region(BasicBlock *Entry, BasicBlock *Exit, RegionInfo *RI, DominatorTree *DT, [all...] |
H A D | LoopAnalysisManager.h | 56 DominatorTree &DT; member in struct:llvm::LoopStandardAnalysisResults
|
H A D | MemoryDependenceAnalysis.h | 361 DominatorTree &DT; member in class:llvm::MemoryDependenceResults 369 const TargetLibraryInfo &TLI, DominatorTree &DT, 371 : AA(AA), AC(AC), TLI(TLI), DT(DT), PV(PV), 368 MemoryDependenceResults(AliasAnalysis &AA, AssumptionCache &AC, const TargetLibraryInfo &TLI, DominatorTree &DT, PhiValues &PV, unsigned DefaultBlockScanLimit) argument
|
H A D | IVDescriptors.h | 167 /// RecurrenceDescriptor. If either \p DB is non-null or \p AC and \p DT are 175 DominatorTree *DT = nullptr); 178 /// is returned in RedDes. If either \p DB is non-null or \p AC and \p DT are 185 DominatorTree *DT = nullptr); 197 DominatorTree *DT);
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | SymbolRewriter.cpp | 112 template <RewriteDescriptor::Type DT, typename ValueType, 120 : RewriteDescriptor(DT), Source(Naked ? StringRef("\01" + S.str()) : S), 126 return RD->getType() == DT; 132 template <RewriteDescriptor::Type DT, typename ValueType, 134 bool ExplicitRewriteDescriptor<DT, ValueType, Get>::performOnModule(Module &M) { 152 template <RewriteDescriptor::Type DT, typename ValueType, 162 : RewriteDescriptor(DT), Pattern(P), Transform(T) { } 167 return RD->getType() == DT; 173 template <RewriteDescriptor::Type DT, typename ValueType, 177 bool PatternRewriteDescriptor<DT, ValueTyp [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | SIAnnotateControlFlow.cpp | 75 DominatorTree *DT; member in class:__anon5009::SIAnnotateControlFlow 186 BasicBlock *IDom = DT->getNode(Phi->getParent())->getIDom()->getBlock(); 281 else if (L->contains(Pred) && DT->dominates(Pred, BB)) 310 BB = SplitBlockPredecessors(BB, Preds, "endcf.split", DT, LI, nullptr, 323 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
|
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | ValueTracking.cpp | 100 // the context instruction are not in the same block then the DT helps in 106 const DominatorTree *DT; member in struct:__anon4483::Query 128 const DominatorTree *DT, bool UseInstrInfo, 130 : DL(DL), AC(AC), CxtI(CxtI), DT(DT), ORE(ORE), IIQ(UseInstrInfo) {} 133 : DL(Q.DL), AC(Q.AC), CxtI(Q.CxtI), DT(Q.DT), ORE(Q.ORE), IIQ(Q.IIQ), 172 const DominatorTree *DT, 175 Query(DL, AC, safeCxtI(V, CxtI), DT, UseInstrInfo, ORE)); 184 const DominatorTree *DT, 127 Query(const DataLayout &DL, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT, bool UseInstrInfo, OptimizationRemarkEmitter *ORE = nullptr) argument 169 computeKnownBits(const Value *V, KnownBits &Known, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT, OptimizationRemarkEmitter *ORE, bool UseInstrInfo) argument 181 computeKnownBits(const Value *V, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT, OptimizationRemarkEmitter *ORE, bool UseInstrInfo) argument 191 haveNoCommonBitsSet(const Value *LHS, const Value *RHS, const DataLayout &DL, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT, bool UseInstrInfo) argument 230 isKnownToBeAPowerOfTwo(const Value *V, const DataLayout &DL, bool OrZero, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT, bool UseInstrInfo) argument 240 isKnownNonZero(const Value *V, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT, bool UseInstrInfo) argument 247 isKnownNonNegative(const Value *V, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT, bool UseInstrInfo) argument 256 isKnownPositive(const Value *V, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT, bool UseInstrInfo) argument 268 isKnownNegative(const Value *V, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT, bool UseInstrInfo) argument 278 isKnownNonEqual(const Value *V1, const Value *V2, const DataLayout &DL, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT, bool UseInstrInfo) argument 290 MaskedValueIsZero(const Value *V, const APInt &Mask, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT, bool UseInstrInfo) argument 301 ComputeNumSignBits(const Value *V, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT, bool UseInstrInfo) argument 527 isValidAssumeForContext(const Instruction *Inv, const Instruction *CxtI, const DominatorTree *DT) argument 1989 isKnownNonNullFromDominatingCondition(const Value *V, const Instruction *CtxI, const DominatorTree *DT) argument 4057 isSafeToSpeculativelyExecute(const Value *V, const Instruction *CtxI, const DominatorTree *DT) argument 4161 computeConstantRangeIncludingKnownBits( const Value *V, bool ForSigned, const DataLayout &DL, unsigned Depth, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT, OptimizationRemarkEmitter *ORE = nullptr, bool UseInstrInfo = true) argument 4174 computeOverflowForUnsignedMul( const Value *LHS, const Value *RHS, const DataLayout &DL, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT, bool UseInstrInfo) argument 4188 computeOverflowForSignedMul(const Value *LHS, const Value *RHS, const DataLayout &DL, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT, bool UseInstrInfo) argument 4230 computeOverflowForUnsignedAdd( const Value *LHS, const Value *RHS, const DataLayout &DL, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT, bool UseInstrInfo) argument 4243 computeOverflowForSignedAdd(const Value *LHS, const Value *RHS, const AddOperator *Add, const DataLayout &DL, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument 4306 computeOverflowForUnsignedSub(const Value *LHS, const Value *RHS, const DataLayout &DL, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument 4319 computeOverflowForSignedSub(const Value *LHS, const Value *RHS, const DataLayout &DL, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument 4338 isOverflowIntrinsicNoWrap(const WithOverflowInst *WO, const DominatorTree &DT) argument 4403 computeOverflowForSignedAdd(const AddOperator *Add, const DataLayout &DL, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument 4412 computeOverflowForSignedAdd(const Value *LHS, const Value *RHS, const DataLayout &DL, AssumptionCache *AC, const Instruction *CxtI, const DominatorTree *DT) argument [all...] |
H A D | DemandedBits.cpp | 106 computeKnownBits(V1, Known, DL, 0, &AC, UserI, &DT); 110 computeKnownBits(V2, Known2, DL, 0, &AC, UserI, &DT); 298 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); local 299 DB.emplace(F, AC, DT); 481 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); local 482 return DemandedBits(F, AC, DT);
|
H A D | MemorySSA.cpp | 517 DominatorTree &DT; member in class:__anon4463::ClobberWalker 531 DomTreeNode *Node = DT.getNode(BB); 885 if (DT.dominates(ChainBB, TP.Clobber->getBlock())) 926 ClobberWalker(const MemorySSA &MSSA, AliasAnalysisType &AA, DominatorTree &DT) argument 927 : MSSA(MSSA), AA(AA), DT(DT) {} 1189 assert(!DT->isReachableFromEntry(BB) && 1197 if (!DT->isReachableFromEntry(S)) 1225 MemorySSA::MemorySSA(Function &Func, AliasAnalysis *AA, DominatorTree *DT) argument 1226 : AA(nullptr), DT(D 1277 OptimizeUses(MemorySSA *MSSA, CachingWalker<BatchAAResults> *Walker, BatchAAResults *BAA, DominatorTree *DT) argument 1309 DominatorTree *DT; member in class:llvm::MemorySSA::OptimizeUses 2251 auto &DT = AM.getResult<DominatorTreeAnalysis>(F); local 2295 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); local [all...] |
H A D | DomPrinter.cpp | 57 static std::string getGraphName(DominatorTree *DT) { argument 73 static std::string getGraphName(PostDominatorTree *DT) { argument
|
H A D | LazyValueInfo.cpp | 363 DominatorTree &DT; member in class:__anon4450::LazyValueInfoAnnotatedWriter 367 : LVIImpl(L), DT(DTree) {} 407 DominatorTree *DT; ///< An optional DT pointer. member in class:__anon4451::LazyValueInfoImpl 408 DominatorTree *DisabledDT; ///< Stores DT if it's disabled. 487 if (DT) { 488 assert(!DisabledDT && "Both DT and DisabledDT are not nullptr!"); 489 std::swap(DT, DisabledDT); 494 /// instance was initialized without a DT pointer. 497 assert(!DT [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/ |
H A D | DwarfUnit.cpp | 1463 DIE &DwarfUnit::constructMemberDIE(DIE &Buffer, const DIDerivedType *DT) { argument 1464 DIE &MemberDie = createAndAddDIE(DT->getTag(), Buffer); 1465 StringRef Name = DT->getName(); 1469 if (DIType *Resolved = DT->getBaseType()) 1472 addSourceLine(MemberDie, DT); 1474 if (DT->getTag() == dwarf::DW_TAG_inheritance && DT->isVirtual()) { 1484 addUInt(*VBaseLocationDie, dwarf::DW_FORM_udata, DT->getOffsetInBits()); 1491 uint64_t Size = DT->getSizeInBits(); 1492 uint64_t FieldSize = DD->getBaseTypeSize(DT); 1572 getOrCreateStaticMemberDIE(const DIDerivedType *DT) argument [all...] |
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | MachineRegionInfo.h | 64 MachineRegionInfo *RI, MachineDominatorTree *DT, 81 void recalculate(MachineFunction &F, MachineDominatorTree *DT,
|
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/ |
H A D | ConstantHoisting.h | 129 bool runImpl(Function &F, TargetTransformInfo &TTI, DominatorTree &DT, 150 DominatorTree *DT; member in class:llvm::ConstantHoistingPass
|
H A D | GVN.h | 82 DominatorTree &getDominatorTree() const { return *DT; } 112 DominatorTree *DT = nullptr; member in class:llvm::GVN::ValueTable 149 void setDomTree(DominatorTree *D) { DT = D; } 159 DominatorTree *DT = nullptr; member in class:llvm::GVN
|
H A D | NaryReassociate.h | 169 DominatorTree *DT; member in class:llvm::NaryReassociatePass
|
H A D | SROA.h | 66 DominatorTree *DT = nullptr; member in class:llvm::SROA
|
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Vectorize/ |
H A D | LoopVectorize.h | 136 DominatorTree *DT; member in struct:llvm::LoopVectorizePass
|