Searched refs:CtxI (Results 1 - 7 of 7) sorted by relevance

/external/llvm/include/llvm/Analysis/
H A DLoads.h31 const Instruction *CtxI = nullptr,
40 const Instruction *CtxI = nullptr,
H A DValueTracking.h278 /// If the CtxI is specified this method performs context-sensitive analysis
280 /// before the CtxI.
282 /// If the CtxI is NOT specified this method only looks at the instruction
290 const Instruction *CtxI = nullptr,
313 const Instruction *CtxI = nullptr,
/external/llvm/lib/Analysis/
H A DLoads.cpp56 const Instruction *CtxI, const DominatorTree *DT,
64 DL, CtxI, DT, Visited);
71 if (!CheckForNonNull || isKnownNonNullAt(V, CtxI, DT))
92 CtxI, DT, Visited);
98 RelocateInst->getDerivedPtr(), Align, Size, DL, CtxI, DT, Visited);
102 DL, CtxI, DT, Visited);
106 return isDereferenceableAndAlignedPointer(RV, Align, Size, DL, CtxI, DT,
115 const Instruction *CtxI,
134 CtxI, DT, Visited);
138 const Instruction *CtxI,
54 isDereferenceableAndAlignedPointer( const Value *V, unsigned Align, const APInt &Size, const DataLayout &DL, const Instruction *CtxI, const DominatorTree *DT, SmallPtrSetImpl<const Value *> &Visited) argument
113 isDereferenceableAndAlignedPointer(const Value *V, unsigned Align, const DataLayout &DL, const Instruction *CtxI, const DominatorTree *DT) argument
137 isDereferenceablePointer(const Value *V, const DataLayout &DL, const Instruction *CtxI, const DominatorTree *DT) argument
195 const Instruction* CtxI = DT ? ScanFrom : nullptr; local
[all...]
H A DValueTracking.cpp3065 const Instruction *CtxI,
3116 LI->getAlignment(), DL, CtxI, DT);
3230 const Instruction *CtxI,
3254 if (Edge.isSingleEdge() && DT->dominates(Edge, CtxI->getParent()))
3258 DT->dominates(cast<Instruction>(CmpU), CtxI)) {
3267 bool llvm::isKnownNonNullAt(const Value *V, const Instruction *CtxI, argument
3272 return CtxI ? ::isKnownNonNullFromDominatingCondition(V, CtxI, DT) : false;
3064 isSafeToSpeculativelyExecute(const Value *V, const Instruction *CtxI, const DominatorTree *DT) argument
3229 isKnownNonNullFromDominatingCondition(const Value *V, const Instruction *CtxI, const DominatorTree *DT) argument
/external/llvm/lib/Transforms/Scalar/
H A DLICM.cpp95 const Instruction *CtxI = nullptr);
754 const Instruction *CtxI) {
755 if (isSafeToSpeculativelyExecute(&Inst, CtxI, DT))
750 isSafeToExecuteUnconditionally(const Instruction &Inst, const DominatorTree *DT, const Loop *CurLoop, const LoopSafetyInfo *SafetyInfo, const Instruction *CtxI) argument
/external/llvm/lib/Transforms/InstCombine/
H A DInstCombinePHI.cpp922 Instruction *CtxI = PN.getIncomingBlock(i)->getTerminator(); local
924 if (isKnownNonZero(VA, DL, 0, AC, CtxI, DT)) {
H A DInstCombineInternal.h371 /// then CtxI has to be the call instruction calling that intrinsic. If this
372 /// overflow check is done by arithmetic followed by a compare, then CtxI has
380 Instruction &CtxI, Value *&OperationResult,

Completed in 6598 milliseconds