/freebsd-src/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | Loads.cpp | 39 const Instruction *CtxI, AssumptionCache *AC, const DominatorTree *DT, in isDereferenceableAndAlignedPointer() argument 187 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 201 isDereferenceableAndAlignedPointer(const Value * V,Type * Ty,Align Alignment,const DataLayout & DL,const Instruction * CtxI,AssumptionCache * AC,const DominatorTree * DT,const TargetLibraryInfo * TLI) isDereferenceableAndAlignedPointer() argument 221 isDereferenceablePointer(const Value * V,Type * Ty,const DataLayout & DL,const Instruction * CtxI,AssumptionCache * AC,const DominatorTree * DT,const TargetLibraryInfo * TLI) isDereferenceablePointer() argument 357 const Instruction* CtxI = DT ? ScanFrom : nullptr; isSafeToLoadUnconditionally() local 712 canReplacePointersIfEqual(Value * A,Value * B,const DataLayout & DL,Instruction * CtxI) canReplacePointersIfEqual() argument [all...] |
H A D | AssumeBundleQueries.cpp | 199 const Instruction *CtxI, const DominatorTree *DT, AssumptionCache *AC) { in getKnowledgeValidInContext()
|
H A D | ValueTracking.cpp | 2159 isKnownNonNullFromDominatingCondition(const Value * V,const Instruction * CtxI,const DominatorTree * DT) isKnownNonNullFromDominatingCondition() argument 6146 isSafeToSpeculativelyExecute(const Instruction * Inst,const Instruction * CtxI,AssumptionCache * AC,const DominatorTree * DT,const TargetLibraryInfo * TLI) isSafeToSpeculativelyExecute() argument 6155 isSafeToSpeculativelyExecuteWithOpcode(unsigned Opcode,const Instruction * Inst,const Instruction * CtxI,AssumptionCache * AC,const DominatorTree * DT,const TargetLibraryInfo * TLI) isSafeToSpeculativelyExecuteWithOpcode() argument 6792 isGuaranteedNotToBeUndefOrPoison(const Value * V,AssumptionCache * AC,const Instruction * CtxI,const DominatorTree * DT,unsigned Depth,UndefPoisonKind Kind) isGuaranteedNotToBeUndefOrPoison() argument 6930 isGuaranteedNotToBeUndefOrPoison(const Value * V,AssumptionCache * AC,const Instruction * CtxI,const DominatorTree * DT,unsigned Depth) isGuaranteedNotToBeUndefOrPoison() argument 6938 isGuaranteedNotToBePoison(const Value * V,AssumptionCache * AC,const Instruction * CtxI,const DominatorTree * DT,unsigned Depth) isGuaranteedNotToBePoison() argument 6945 isGuaranteedNotToBeUndef(const Value * V,AssumptionCache * AC,const Instruction * CtxI,const DominatorTree * DT,unsigned Depth) isGuaranteedNotToBeUndef() argument 8877 computeConstantRange(const Value * V,bool ForSigned,bool UseInstrInfo,AssumptionCache * AC,const Instruction * CtxI,const DominatorTree * DT,unsigned Depth) computeConstantRange() argument [all...] |
H A D | BasicAliasAnalysis.cpp | 865 alias(const MemoryLocation & LocA,const MemoryLocation & LocB,AAQueryInfo & AAQI,const Instruction * CtxI) alias() argument 1465 aliasCheck(const Value * V1,LocationSize V1Size,const Value * V2,LocationSize V2Size,AAQueryInfo & AAQI,const Instruction * CtxI) aliasCheck() argument
|
H A D | AliasAnalysis.cpp | 113 alias(const MemoryLocation & LocA,const MemoryLocation & LocB,AAQueryInfo & AAQI,const Instruction * CtxI) alias() argument
|
H A D | ScalarEvolution.cpp | 2300 willNotOverflow(Instruction::BinaryOps BinOp,bool Signed,const SCEV * LHS,const SCEV * RHS,const Instruction * CtxI) willNotOverflow() argument 2398 const Instruction *CtxI = getStrengthenedNoWrapFlagsFromBinOp() local 10883 isKnownPredicateAt(ICmpInst::Predicate Pred,const SCEV * LHS,const SCEV * RHS,const Instruction * CtxI) isKnownPredicateAt() argument 10891 evaluatePredicateAt(ICmpInst::Predicate Pred,const SCEV * LHS,const SCEV * RHS,const Instruction * CtxI) evaluatePredicateAt() argument 10980 getLoopInvariantPredicate(ICmpInst::Predicate Pred,const SCEV * LHS,const SCEV * RHS,const Loop * L,const Instruction * CtxI) getLoopInvariantPredicate() argument 11065 getLoopInvariantExitCondDuringFirstIterations(ICmpInst::Predicate Pred,const SCEV * LHS,const SCEV * RHS,const Loop * L,const Instruction * CtxI,const SCEV * MaxIter) getLoopInvariantExitCondDuringFirstIterations() argument 11085 getLoopInvariantExitCondDuringFirstIterationsImpl(ICmpInst::Predicate Pred,const SCEV * LHS,const SCEV * RHS,const Loop * L,const Instruction * CtxI,const SCEV * MaxIter) getLoopInvariantExitCondDuringFirstIterationsImpl() argument 11471 const Instruction *CtxI = &BB->front(); isBasicBlockEntryGuardedByCond() local 11553 isImpliedCond(ICmpInst::Predicate Pred,const SCEV * LHS,const SCEV * RHS,const Value * FoundCondValue,bool Inverse,const Instruction * CtxI) isImpliedCond() argument 11598 isImpliedCond(ICmpInst::Predicate Pred,const SCEV * LHS,const SCEV * RHS,ICmpInst::Predicate FoundPred,const SCEV * FoundLHS,const SCEV * FoundRHS,const Instruction * CtxI) isImpliedCond() argument 11652 isImpliedCondBalancedTypes(ICmpInst::Predicate Pred,const SCEV * LHS,const SCEV * RHS,ICmpInst::Predicate FoundPred,const SCEV * FoundLHS,const SCEV * FoundRHS,const Instruction * CtxI) isImpliedCondBalancedTypes() argument 11927 isImpliedCondOperandsViaAddRecStart(ICmpInst::Predicate Pred,const SCEV * LHS,const SCEV * RHS,const SCEV * FoundLHS,const SCEV * FoundRHS,const Instruction * CtxI) isImpliedCondOperandsViaAddRecStart() argument 12207 isImpliedCondOperands(ICmpInst::Predicate Pred,const SCEV * LHS,const SCEV * RHS,const SCEV * FoundLHS,const SCEV * FoundRHS,const Instruction * CtxI) isImpliedCondOperands() argument [all...] |
/freebsd-src/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | AssumeBundleBuilder.cpp | 310 Instruction *CtxI, AssumptionCache *AC, in buildAssumeFromKnowledge() argument
|
H A D | SimplifyIndVar.cpp | 263 const Instruction *CtxI = findCommonDominator(Users, *DT); eliminateIVComparison() local 1632 const Instruction *CtxI = findCommonDominator(ExtUsers, *DT); widenWithVariantUse() local
|
/freebsd-src/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
H A D | AttributorAttributes.cpp | 620 followUsesInContext(AAType & AA,Attributor & A,MustBeExecutedContextExplorer & Explorer,const Instruction * CtxI,SetVector<const Use * > & Uses,StateType & State) followUsesInContext() argument 646 followUsesInMBEC(AAType & AA,Attributor & A,StateType & S,Instruction & CtxI) followUsesInMBEC() argument 2559 if (Instruction *CtxI = getCtxI()) initialize() local 4921 if (Instruction *CtxI = getCtxI()) initialize() local 5228 if (Instruction *CtxI = getCtxI()) initialize() local 6962 Instruction *CtxI = isa<InvokeInst>(AI.CB) ? AI.CB : AI.CB->getNextNode(); updateImpl() local 9428 __anon84dfdece7e02(Value &V, const Instruction *CtxI) updateImpl() argument 10214 if (Instruction *CtxI = getCtxI()) initialize() local 10320 if (Instruction *CtxI = getCtxI()) initialize() local 10392 __anon84dfdece8202(Value &V, const Instruction *CtxI) updateImpl() argument 10518 __anon84dfdece8302(Value &V, const Instruction *CtxI) updateImpl() argument 10532 __anon84dfdece8402(Value *V, Instruction *CtxI) updateImpl() argument 11095 const Instruction *CtxI = II.I.getCtxI(); handleSelectInst() local 11168 const Instruction *CtxI = II.I.getCtxI(); handleLoadInst() local 11332 const Instruction *CtxI = II.I.getCtxI(); genericValueTraversal() local 11516 __anon84dfdece9002(Value &V, Instruction *CtxI, bool AddValues) updateImpl() argument [all...] |
H A D | Attributor.cpp | 296 const Instruction *CtxI = VAC.getCtxI(); in isValidAtPosition() local 922 const Instruction *CtxI) { in isPotentiallyAffectedByBarrier() argument 1679 Instruction *CtxI = IRP.getCtxI(); in isAssumedDead() local [all...] |
/freebsd-src/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombinePHI.cpp | 1485 Instruction *CtxI = PN.getIncomingBlock(I)->getTerminator(); visitPHINode() local
|
H A D | InstCombineSelect.cpp | 3348 matchFMulByZeroIfResultEqZero(InstCombinerImpl & IC,Value * Cmp0,Value * Cmp1,Value * TrueVal,Value * FalseVal,Instruction & CtxI,bool SelectIsNSZ) matchFMulByZeroIfResultEqZero() argument
|
/freebsd-src/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
H A D | VectorCombine.cpp | 1148 canScalarizeAccess(VectorType * VecTy,Value * Idx,Instruction * CtxI,AssumptionCache & AC,const DominatorTree & DT) canScalarizeAccess() argument
|
/freebsd-src/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | LICM.cpp | 1773 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
|