/llvm-project/llvm/lib/Analysis/ |
H A D | Loads.cpp | 39 isDereferenceableAndAlignedPointer(const Value * V,Align Alignment,const APInt & Size,const DataLayout & DL,const Instruction * CtxI,AssumptionCache * AC,const DominatorTree * DT,const TargetLibraryInfo * TLI,SmallPtrSetImpl<const Value * > & Visited,unsigned MaxDepth) isDereferenceableAndAlignedPointer() argument 189 isDereferenceableAndAlignedPointer(const Value * V,Align Alignment,const APInt & Size,const DataLayout & DL,const Instruction * CtxI,AssumptionCache * AC,const DominatorTree * DT,const TargetLibraryInfo * TLI) isDereferenceableAndAlignedPointer() argument 203 isDereferenceableAndAlignedPointer(const Value * V,Type * Ty,Align Alignment,const DataLayout & DL,const Instruction * CtxI,AssumptionCache * AC,const DominatorTree * DT,const TargetLibraryInfo * TLI) isDereferenceableAndAlignedPointer() argument 223 isDereferenceablePointer(const Value * V,Type * Ty,const DataLayout & DL,const Instruction * CtxI,AssumptionCache * AC,const DominatorTree * DT,const TargetLibraryInfo * TLI) isDereferenceablePointer() argument 359 const Instruction* CtxI = DT ? ScanFrom : nullptr; isSafeToLoadUnconditionally() local [all...] |
H A D | AssumeBundleQueries.cpp | 199 const Instruction *CtxI, const DominatorTree *DT, AssumptionCache *AC) { in getKnowledgeValidInContext()
|
H A D | BasicAliasAnalysis.cpp | 897 alias(const MemoryLocation & LocA,const MemoryLocation & LocB,AAQueryInfo & AAQI,const Instruction * CtxI) alias() argument 1538 aliasCheck(const Value * V1,LocationSize V1Size,const Value * V2,LocationSize V2Size,AAQueryInfo & AAQI,const Instruction * CtxI) aliasCheck() argument
|
H A D | AliasAnalysis.cpp | 113 const Instruction *CtxI) { in alias() argument
|
H A D | ValueTracking.cpp | 2377 isKnownNonNullFromDominatingCondition(const Value * V,const Instruction * CtxI,const DominatorTree * DT) isKnownNonNullFromDominatingCondition() argument 6648 isSafeToSpeculativelyExecute(const Instruction * Inst,const Instruction * CtxI,AssumptionCache * AC,const DominatorTree * DT,const TargetLibraryInfo * TLI) isSafeToSpeculativelyExecute() argument 6657 isSafeToSpeculativelyExecuteWithOpcode(unsigned Opcode,const Instruction * Inst,const Instruction * CtxI,AssumptionCache * AC,const DominatorTree * DT,const TargetLibraryInfo * TLI) isSafeToSpeculativelyExecuteWithOpcode() argument 7300 isGuaranteedNotToBeUndefOrPoison(const Value * V,AssumptionCache * AC,const Instruction * CtxI,const DominatorTree * DT,unsigned Depth,UndefPoisonKind Kind) isGuaranteedNotToBeUndefOrPoison() argument 7445 isGuaranteedNotToBeUndefOrPoison(const Value * V,AssumptionCache * AC,const Instruction * CtxI,const DominatorTree * DT,unsigned Depth) isGuaranteedNotToBeUndefOrPoison() argument 7453 isGuaranteedNotToBePoison(const Value * V,AssumptionCache * AC,const Instruction * CtxI,const DominatorTree * DT,unsigned Depth) isGuaranteedNotToBePoison() argument 7460 isGuaranteedNotToBeUndef(const Value * V,AssumptionCache * AC,const Instruction * CtxI,const DominatorTree * DT,unsigned Depth) isGuaranteedNotToBeUndef() argument 9518 computeConstantRange(const Value * V,bool ForSigned,bool UseInstrInfo,AssumptionCache * AC,const Instruction * CtxI,const DominatorTree * DT,unsigned Depth) computeConstantRange() argument [all...] |
H A D | ScalarEvolution.cpp | 2302 willNotOverflow(Instruction::BinaryOps BinOp,bool Signed,const SCEV * LHS,const SCEV * RHS,const Instruction * CtxI) willNotOverflow() argument 2400 const Instruction *CtxI = getStrengthenedNoWrapFlagsFromBinOp() local 10959 isKnownPredicateAt(ICmpInst::Predicate Pred,const SCEV * LHS,const SCEV * RHS,const Instruction * CtxI) isKnownPredicateAt() argument 10967 evaluatePredicateAt(ICmpInst::Predicate Pred,const SCEV * LHS,const SCEV * RHS,const Instruction * CtxI) evaluatePredicateAt() argument 11056 getLoopInvariantPredicate(ICmpInst::Predicate Pred,const SCEV * LHS,const SCEV * RHS,const Loop * L,const Instruction * CtxI) getLoopInvariantPredicate() argument 11141 getLoopInvariantExitCondDuringFirstIterations(ICmpInst::Predicate Pred,const SCEV * LHS,const SCEV * RHS,const Loop * L,const Instruction * CtxI,const SCEV * MaxIter) getLoopInvariantExitCondDuringFirstIterations() argument 11161 getLoopInvariantExitCondDuringFirstIterationsImpl(ICmpInst::Predicate Pred,const SCEV * LHS,const SCEV * RHS,const Loop * L,const Instruction * CtxI,const SCEV * MaxIter) getLoopInvariantExitCondDuringFirstIterationsImpl() argument 11547 const Instruction *CtxI = &BB->front(); isBasicBlockEntryGuardedByCond() local 11629 isImpliedCond(ICmpInst::Predicate Pred,const SCEV * LHS,const SCEV * RHS,const Value * FoundCondValue,bool Inverse,const Instruction * CtxI) isImpliedCond() argument 11674 isImpliedCond(ICmpInst::Predicate Pred,const SCEV * LHS,const SCEV * RHS,ICmpInst::Predicate FoundPred,const SCEV * FoundLHS,const SCEV * FoundRHS,const Instruction * CtxI) isImpliedCond() argument 11728 isImpliedCondBalancedTypes(ICmpInst::Predicate Pred,const SCEV * LHS,const SCEV * RHS,ICmpInst::Predicate FoundPred,const SCEV * FoundLHS,const SCEV * FoundRHS,const Instruction * CtxI) isImpliedCondBalancedTypes() argument 12003 isImpliedCondOperandsViaAddRecStart(ICmpInst::Predicate Pred,const SCEV * LHS,const SCEV * RHS,const SCEV * FoundLHS,const SCEV * FoundRHS,const Instruction * CtxI) isImpliedCondOperandsViaAddRecStart() argument 12283 isImpliedCondOperands(ICmpInst::Predicate Pred,const SCEV * LHS,const SCEV * RHS,const SCEV * FoundLHS,const SCEV * FoundRHS,const Instruction * CtxI) isImpliedCondOperands() argument [all...] |
/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | AssumeBundleBuilder.cpp | 310 buildAssumeFromKnowledge(ArrayRef<RetainedKnowledge> Knowledge,Instruction * CtxI,AssumptionCache * AC,DominatorTree * DT) buildAssumeFromKnowledge() argument
|
H A D | SimplifyIndVar.cpp | 272 const Instruction *CtxI = findCommonDominator(Users, *DT); in eliminateIVComparison() local 1731 const Instruction *CtxI = findCommonDominator(ExtUsers, *DT); in widenWithVariantUse() local
|
/llvm-project/llvm/lib/Transforms/IPO/ |
H A D | AttributorAttributes.cpp | 621 const Instruction *CtxI, in followUsesInContext() argument 647 Instruction &CtxI) { in followUsesInMBEC() argument 2562 if (Instruction *CtxI = getCtxI()) initialize() local 4924 if (Instruction *CtxI = getCtxI()) initialize() local 5237 if (Instruction *CtxI = getCtxI()) initialize() local 6978 Instruction *CtxI = isa<InvokeInst>(AI.CB) ? AI.CB : AI.CB->getNextNode(); updateImpl() local 9443 __anon30d26d8f7e02(Value &V, const Instruction *CtxI) updateImpl() argument 10229 if (Instruction *CtxI = getCtxI()) initialize() local 10335 if (Instruction *CtxI = getCtxI()) initialize() local 10384 __anon30d26d8f8202(Value &V, const Instruction *CtxI) updateImpl() argument 10511 __anon30d26d8f8302(Value &V, const Instruction *CtxI) updateImpl() argument 10525 __anon30d26d8f8402(Value *V, Instruction *CtxI) updateImpl() argument 11086 const Instruction *CtxI = II.I.getCtxI(); handleSelectInst() local 11159 const Instruction *CtxI = II.I.getCtxI(); handleLoadInst() local 11323 const Instruction *CtxI = II.I.getCtxI(); genericValueTraversal() local 11500 __anon30d26d8f9002(Value &V, Instruction *CtxI, bool AddValues) updateImpl() argument [all...] |
H A D | Attributor.cpp | 296 if (CtxI) in isValidAtPosition() local 1679 if (CtxI in isAssumedDead() local 922 isPotentiallyAffectedByBarrier(Attributor & A,ArrayRef<const Value * > Ptrs,const AbstractAttribute & QueryingAA,const Instruction * CtxI) isPotentiallyAffectedByBarrier() argument [all...] |
/llvm-project/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombinePHI.cpp | 1537 Instruction *CtxI = PN.getIncomingBlock(I)->getTerminator(); visitPHINode() local
|
H A D | InstCombineSelect.cpp | 3513 matchFMulByZeroIfResultEqZero(InstCombinerImpl & IC,Value * Cmp0,Value * Cmp1,Value * TrueVal,Value * FalseVal,Instruction & CtxI,bool SelectIsNSZ) matchFMulByZeroIfResultEqZero() argument
|
/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | LICM.cpp | 1785 isSafeToExecuteUnconditionally(Instruction & Inst,const DominatorTree * DT,const TargetLibraryInfo * TLI,const Loop * CurLoop,const LoopSafetyInfo * SafetyInfo,OptimizationRemarkEmitter * ORE,const Instruction * CtxI,AssumptionCache * AC,bool AllowSpeculation) isSafeToExecuteUnconditionally() argument
|
/llvm-project/llvm/lib/Transforms/Vectorize/ |
H A D | VectorCombine.cpp | 1191 canScalarizeAccess(VectorType * VecTy,Value * Idx,Instruction * CtxI,AssumptionCache & AC,const DominatorTree & DT) canScalarizeAccess() argument
|