/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | ScalarEvolutionNormalization.cpp | 39 ScalarEvolution &SE) 40 : SCEVRewriteVisitor<NormalizeDenormalizeRewriter>(SE), Kind(Kind), 54 return SE.getAddRecExpr(Operands, AR->getLoop(), SCEV::FlagAnyWrap); 66 Operands[i] = SE.getAddExpr(Operands[i], Operands[i + 1]); 90 Operands[i] = SE.getMinusSCEV(Operands[i], Operands[i + 1]); 93 return SE.getAddRecExpr(Operands, AR->getLoop(), SCEV::FlagAnyWrap); 98 ScalarEvolution &SE) { 102 return NormalizeDenormalizeRewriter(Normalize, Pred, SE).visit(S); 106 ScalarEvolution &SE) { 107 return NormalizeDenormalizeRewriter(Normalize, Pred, SE) 38 NormalizeDenormalizeRewriter(TransformKind Kind, NormalizePredTy Pred, ScalarEvolution &SE) argument 96 normalizeForPostIncUse(const SCEV *S, const PostIncLoopSet &Loops, ScalarEvolution &SE) argument 105 normalizeForPostIncUseIf(const SCEV *S, NormalizePredTy Pred, ScalarEvolution &SE) argument 110 denormalizeForPostIncUse(const SCEV *S, const PostIncLoopSet &Loops, ScalarEvolution &SE) argument [all...] |
H A D | ScalarEvolutionExpander.cpp | 80 assert(SE.DT.dominates(Ret, &*BIP)); 115 assert(SE.getTypeSizeInBits(V->getType()) == SE.getTypeSizeInBits(Ty) && 129 SE.getTypeSizeInBits(Ty) == SE.getTypeSizeInBits(V->getType())) { 133 SE.getTypeSizeInBits(CI->getType()) == 134 SE.getTypeSizeInBits(CI->getOperand(0)->getType())) 139 SE.getTypeSizeInBits(CE->getType()) == 140 SE.getTypeSizeInBits(CE->getOperand(0)->getType())) 217 while (const Loop *L = SE 243 FactorOutConstant(const SCEV *&S, const SCEV *&Remainder, const SCEV *Factor, ScalarEvolution &SE, const DataLayout &DL) argument 316 SimplifyAddOperands(SmallVectorImpl<const SCEV *> &Ops, Type *Ty, ScalarEvolution &SE) argument 345 SplitAddRecs(SmallVectorImpl<const SCEV *> &Ops, Type *Ty, ScalarEvolution &SE) argument 875 ExposePointerBase(const SCEV *&Base, const SCEV *&Rest, ScalarEvolution &SE) argument 1096 canBeCheaplyTransformed(ScalarEvolution &SE, const SCEVAddRecExpr *Phi, const SCEVAddRecExpr *Requested, bool &InvertStep) argument 1127 IsIncrementNSW(ScalarEvolution &SE, const SCEVAddRecExpr *AR) argument 1141 IsIncrementNUW(ScalarEvolution &SE, const SCEVAddRecExpr *AR) argument 2397 ScalarEvolution &SE; member in struct:__anon1651::SCEVFindUnsafe 2424 isSafeToExpand(const SCEV *S, ScalarEvolution &SE) argument 2430 isSafeToExpandAt(const SCEV *S, const Instruction *InsertionPoint, ScalarEvolution &SE) argument [all...] |
H A D | LoopCacheAnalysis.cpp | 76 const Loop &L, ScalarEvolution &SE) { 85 const SCEV *Step = AR->getStepRecurrence(SE); 90 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) 93 return AR->getStepRecurrence(SE) == &ElemSize; 98 static const SCEV *computeTripCount(const Loop &L, ScalarEvolution &SE) { 99 const SCEV *BackedgeTakenCount = SE.getBackedgeTakenCount(&L); 104 return SE.getAddExpr(BackedgeTakenCount, 105 SE.getOne(BackedgeTakenCount->getType())); 130 const LoopInfo &LI, ScalarEvolution &SE) [all...] |
H A D | ScalarEvolutionAliasAnalysis.cpp | 34 const SCEV *AS = SE.getSCEV(const_cast<Value *>(LocA.Ptr)); 35 const SCEV *BS = SE.getSCEV(const_cast<Value *>(LocB.Ptr)); 43 if (SE.getEffectiveSCEVType(AS->getType()) == 44 SE.getEffectiveSCEVType(BS->getType())) { 45 unsigned BitWidth = SE.getTypeSizeInBits(AS->getType()); 54 const SCEV *BA = SE.getMinusSCEV(BS, AS); 59 if (ASizeInt.ule(SE.getUnsignedRange(BA).getUnsignedMin()) && 60 (-BSizeInt).uge(SE.getUnsignedRange(BA).getUnsignedMax())) 68 const SCEV *AB = SE.getMinusSCEV(AS, BS); 73 if (BSizeInt.ule(SE [all...] |
H A D | Delinearization.cpp | 44 ScalarEvolution *SE; member in class:__anon1614::Delinearization 67 SE = &getAnalysis<ScalarEvolutionWrapperPass>().getSE(); 86 const SCEV *AccessFn = SE->getSCEVAtScope(getPointerOperand(Inst), L); 89 dyn_cast<SCEVUnknown>(SE->getPointerBase(AccessFn)); 93 AccessFn = SE->getMinusSCEV(AccessFn, BasePointer); 101 SE->delinearize(AccessFn, Subscripts, Sizes, SE->getElementSize(Inst));
|
H A D | DependenceAnalysis.cpp | 128 auto &SE = FAM.getResult<ScalarEvolutionAnalysis>(F); local 130 return DependenceInfo(&F, &AA, &SE, &LI); 156 auto &SE = getAnalysis<ScalarEvolutionWrapperPass>().getSE(); local 158 info.reset(new DependenceInfo(&F, &AA, &SE, &LI)); 364 return SE->getNegativeSCEV(C); 395 A = SE->getOne(D->getType()); 396 B = SE->getNegativeSCEV(A); 397 C = SE->getNegativeSCEV(D); 404 SE = NewSE; 484 const SCEV *Prod1 = SE [all...] |
H A D | IVUsers.cpp | 42 return IVUsers(&L, &AR.AC, &AR.LI, &AR.DT, &AR.SE); 61 ScalarEvolution *SE, LoopInfo *LI) { 69 SE->getSCEVAtScope(AR, LI->getLoopFor(I->getParent())) != AR); 73 return isInteresting(AR->getStart(), I, L, SE, LI) && 74 !isInteresting(AR->getStepRecurrence(*SE), I, L, SE, LI); 81 if (isInteresting(Op, I, L, SE, LI)) { 177 if (!SE->isSCEVable(I->getType())) 189 uint64_t Width = SE->getTypeSizeInBits(I->getType()); 199 const SCEV *ISE = SE 60 isInteresting(const SCEV *S, const Instruction *I, const Loop *L, ScalarEvolution *SE, LoopInfo *LI) argument 305 IVUsers(Loop *L, AssumptionCache *AC, LoopInfo *LI, DominatorTree *DT, ScalarEvolution *SE) argument 371 auto *SE = &getAnalysis<ScalarEvolutionWrapperPass>().getSE(); local [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | ScalarEvolutionNormalization.h | 55 ScalarEvolution &SE); 60 ScalarEvolution &SE); 65 ScalarEvolution &SE);
|
H A D | ScalarEvolutionAliasAnalysis.h | 27 ScalarEvolution &SE; member in class:llvm::SCEVAAResult 30 explicit SCEVAAResult(ScalarEvolution &SE) : AAResultBase(), SE(SE) {} argument 31 SCEVAAResult(SCEVAAResult &&Arg) : AAResultBase(std::move(Arg)), SE(Arg.SE) {}
|
H A D | LoopUnrollAnalyzer.h | 50 ScalarEvolution &SE, const Loop *L) 51 : SimplifiedValues(SimplifiedValues), SE(SE), L(L) { 52 IterationNumber = SE.getConstant(APInt(64, Iteration)); 81 ScalarEvolution &SE; member in class:llvm::UnrolledInstAnalyzer 48 UnrolledInstAnalyzer(unsigned Iteration, DenseMap<Value *, Constant *> &SimplifiedValues, ScalarEvolution &SE, const Loop *L) argument
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | SetOperations.h | 25 for (typename S2Ty::const_iterator SI = S2.begin(), SE = S2.end(); 26 SI != SE; ++SI) 52 for (typename S1Ty::const_iterator SI = S1.begin(), SE = S1.end(); 53 SI != SE; ++SI) 63 for (typename S2Ty::const_iterator SI = S2.begin(), SE = S2.end(); 64 SI != SE; ++SI)
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | InductiveRangeCheckElimination.cpp | 148 static bool parseRangeCheckICmp(Loop *L, ICmpInst *ICI, ScalarEvolution &SE, 153 extractRangeChecksFromCond(Loop *L, ScalarEvolution &SE, Use &ConditionUse, 198 bool isEmpty(ScalarEvolution &SE, bool IsSigned) const { argument 202 return SE.isKnownPredicate(ICmpInst::ICMP_SGE, Begin, End); 204 return SE.isKnownPredicate(ICmpInst::ICMP_UGE, Begin, End); 215 Optional<Range> computeSafeIterationSpace(ScalarEvolution &SE, 225 extractRangeChecksFromBranch(BranchInst *BI, Loop *L, ScalarEvolution &SE, 231 ScalarEvolution &SE; member in class:__anon2683::InductiveRangeCheckElimination 237 InductiveRangeCheckElimination(ScalarEvolution &SE, argument 240 : SE(S 277 parseRangeCheckICmp(Loop *L, ICmpInst *ICI, ScalarEvolution &SE, Value *&Index, Value *&Length, bool &IsSigned) argument 336 extractRangeChecksFromCond( Loop *L, ScalarEvolution &SE, Use &ConditionUse, SmallVectorImpl<InductiveRangeCheck> &Checks, SmallPtrSetImpl<Value *> &Visited) argument 392 extractRangeChecksFromBranch( BranchInst *BI, Loop *L, ScalarEvolution &SE, BranchProbabilityInfo *BPI, SmallVectorImpl<InductiveRangeCheck> &Checks) argument 604 ScalarEvolution &SE; member in class:__anon2684::LoopConstrainer 627 LoopConstrainer(Loop &L, LoopInfo &LI, function_ref<void(Loop *, bool)> LPMAddNewLoop, const LoopStructure &LS, ScalarEvolution &SE, DominatorTree &DT, InductiveRangeCheck::Range R) argument 643 isSafeDecreasingBound(const SCEV *Start, const SCEV *BoundSCEV, const SCEV *Step, ICmpInst::Predicate Pred, unsigned LatchBrExitIdx, Loop *L, ScalarEvolution &SE) argument 693 isSafeIncreasingBound(const SCEV *Start, const SCEV *BoundSCEV, const SCEV *Step, ICmpInst::Predicate Pred, unsigned LatchBrExitIdx, Loop *L, ScalarEvolution &SE) argument 737 parseLoopStructure(ScalarEvolution &SE, BranchProbabilityInfo *BPI, Loop &L, const char *&FailureReason) argument 1042 NoopOrExtend(const SCEV *S, Type *Ty, ScalarEvolution &SE, bool Signed) argument 1567 computeSafeIterationSpace( ScalarEvolution &SE, const SCEVAddRecExpr *IndVar, bool IsLatchSigned) const argument 1693 IntersectSignedRange(ScalarEvolution &SE, const Optional<InductiveRangeCheck::Range> &R1, const InductiveRangeCheck::Range &R2) argument 1722 IntersectUnsignedRange(ScalarEvolution &SE, const Optional<InductiveRangeCheck::Range> &R1, const InductiveRangeCheck::Range &R2) argument [all...] |
H A D | AlignmentFromAssumptions.cpp | 95 ScalarEvolution *SE) { 97 const SCEV *DiffUnitsSCEV = SE->getURemExpr(DiffSCEV, AlignSCEV); 128 ScalarEvolution *SE) { 129 const SCEV *PtrSCEV = SE->getSCEV(Ptr); 130 const SCEV *DiffSCEV = SE->getMinusSCEV(PtrSCEV, AASCEV); 134 DiffSCEV = SE->getNoopOrSignExtend(DiffSCEV, OffSCEV->getType()); 138 DiffSCEV = SE->getMinusSCEV(DiffSCEV, OffSCEV); 144 unsigned NewAlignment = getNewAlignmentDiff(DiffSCEV, AlignSCEV, SE); 159 const SCEV *DiffIncSCEV = DiffARSCEV->getStepRecurrence(*SE); 168 NewAlignment = getNewAlignmentDiff(DiffStartSCEV, AlignSCEV, SE); 93 getNewAlignmentDiff(const SCEV *DiffSCEV, const SCEV *AlignSCEV, ScalarEvolution *SE) argument 126 getNewAlignment(const SCEV *AASCEV, const SCEV *AlignSCEV, const SCEV *OffSCEV, Value *Ptr, ScalarEvolution *SE) argument 379 ScalarEvolution *SE = &getAnalysis<ScalarEvolutionWrapperPass>().getSE(); local 403 ScalarEvolution &SE = AM.getResult<ScalarEvolutionAnalysis>(F); local [all...] |
H A D | IndVarSimplify.cpp | 138 ScalarEvolution *SE; member in class:__anon123::IndVarSimplify 170 IndVarSimplify(LoopInfo *LI, ScalarEvolution *SE, DominatorTree *DT, argument 173 : LI(LI), SE(SE), DT(DT), DL(DL), TLI(TLI), TTI(TTI) {} 219 const SCEV *FromBase = SE->getPointerBase(SE->getSCEV(FromPtr)); 220 const SCEV *ToBase = SE->getPointerBase(SE->getSCEV(ToPtr)); 521 SE->forgetLoop(L); 611 if (!SE 921 visitIVCast(CastInst *Cast, WideIVInfo &WI, ScalarEvolution *SE, const TargetTransformInfo *TTI) argument 1000 ScalarEvolution *SE; member in class:__anon126::WidenIV 1964 ScalarEvolution *SE; member in class:__anon127::IndVarSimplifyVisitor 2246 isLoopCounter(PHINode* Phi, Loop *L, ScalarEvolution *SE) argument 2274 FindLoopCounter(Loop *L, BasicBlock *ExitingBB, const SCEV *BECount, ScalarEvolution *SE, DominatorTree *DT) argument 2358 genLoopLimit(PHINode *IndVar, BasicBlock *ExitingBB, const SCEV *ExitCount, bool UsePostInc, Loop *L, SCEVExpander &Rewriter, ScalarEvolution *SE) argument 2683 getMaxBackedgeTakenCount(ScalarEvolution &SE, DominatorTree &DT, Loop *L) argument 3213 auto *SE = &getAnalysis<ScalarEvolutionWrapperPass>().getSE(); variable [all...] |
H A D | LoopPredication.cpp | 255 ScalarEvolution *SE; member in class:__anon2705::LoopPredication 312 ScalarEvolution *SE, LoopInfo *LI, 314 : AA(AA), DT(DT), SE(SE), LI(LI), BPI(BPI) {}; 333 auto *SE = &getAnalysis<ScalarEvolutionWrapperPass>().getSE(); 339 LoopPredication LP(AA, DT, SE, LI, &BPI); 365 LoopPredication LP(&AR.AA, &AR.DT, &AR.SE, &AR.LI, BPI); 378 const SCEV *LHSS = SE->getSCEV(LHS); 381 const SCEV *RHSS = SE->getSCEV(RHS); 386 if (SE 311 LoopPredication(AliasAnalysis *AA, DominatorTree *DT, ScalarEvolution *SE, LoopInfo *LI, BranchProbabilityInfo *BPI) argument 435 isSafeToTruncateWideIVType(const DataLayout &DL, ScalarEvolution &SE, const LoopICmp LatchCheck, Type *RangeCheckType) argument 470 generateLoopLatchCheck(const DataLayout &DL, ScalarEvolution &SE, const LoopICmp LatchCheck, Type *RangeCheckType) argument 658 normalizePredicate(ScalarEvolution *SE, Loop *L, LoopICmp& RC) argument 1002 getMinAnalyzeableBackedgeTakenCount(ScalarEvolution &SE, DominatorTree &DT, Loop *L) argument [all...] |
H A D | LoopDataPrefetch.cpp | 64 LoopDataPrefetch(AssumptionCache *AC, LoopInfo *LI, ScalarEvolution *SE, argument 67 : AC(AC), LI(LI), SE(SE), TTI(TTI), ORE(ORE) {} 98 ScalarEvolution *SE; member in class:__anon2692::LoopDataPrefetch 147 const auto *ConstStride = dyn_cast<SCEVConstant>(AR->getStepRecurrence(*SE)); 160 ScalarEvolution *SE = &AM.getResult<ScalarEvolutionAnalysis>(F); local 166 LoopDataPrefetch LDP(AC, LI, SE, TTI, ORE); 184 ScalarEvolution *SE = &getAnalysis<ScalarEvolutionWrapperPass>().getSE(); local 192 LoopDataPrefetch LDP(AC, LI, SE, TTI, ORE); 273 const SCEV *LSCEV = SE [all...] |
H A D | LoopStrengthReduce.cpp | 364 void initialMatch(const SCEV *S, Loop *L, ScalarEvolution &SE); 393 ScalarEvolution &SE) { 395 if (SE.properlyDominates(S, L->getHeader())) { 403 DoInitialMatch(S, L, Good, Bad, SE); 410 DoInitialMatch(AR->getStart(), L, Good, Bad, SE); 411 DoInitialMatch(SE.getAddRecExpr(SE.getConstant(AR->getType(), 0), 412 AR->getStepRecurrence(SE), 415 L, Good, Bad, SE); 423 const SCEV *NewMul = SE 390 DoInitialMatch(const SCEV *S, Loop *L, SmallVectorImpl<const SCEV *> &Good, SmallVectorImpl<const SCEV *> &Bad, ScalarEvolution &SE) argument 444 initialMatch(const SCEV *S, Loop *L, ScalarEvolution &SE) argument 631 isAddRecSExtable(const SCEVAddRecExpr *AR, ScalarEvolution &SE) argument 639 isAddSExtable(const SCEVAddExpr *A, ScalarEvolution &SE) argument 647 isMulSExtable(const SCEVMulExpr *M, ScalarEvolution &SE) argument 659 getExactSDiv(const SCEV *LHS, const SCEV *RHS, ScalarEvolution &SE, bool IgnoreSignificantBits = false) argument 746 ExtractImmediate(const SCEV *&S, ScalarEvolution &SE) argument 772 ExtractSymbol(const SCEV *&S, ScalarEvolution &SE) argument 884 isExistingPhi(const SCEVAddRecExpr *AR, ScalarEvolution &SE) argument 904 isHighCostExpansion(const SCEV *S, SmallPtrSetImpl<const SCEV*> &Processed, ScalarEvolution &SE) argument 1020 ScalarEvolution *SE = nullptr; member in class:__anon2715::Cost 1026 Cost(const Loop *L, ScalarEvolution &SE, const TargetTransformInfo &TTI) argument 1818 isAlwaysFoldable(const TargetTransformInfo &TTI, ScalarEvolution &SE, int64_t MinOffset, int64_t MaxOffset, LSRUse::KindType Kind, MemAccessTy AccessTy, const SCEV *S, bool HasBaseReg) argument 1912 ScalarEvolution &SE; member in class:__anon2716::LSRInstance 2719 findIVOperand(User::op_iterator OI, User::op_iterator OE, Loop *L, ScalarEvolution &SE) argument 2804 isProfitableIncrement(const SCEV *OperExpr, const SCEV *IncExpr, ScalarEvolution &SE) argument 2834 isProfitableChain(IVChain &Chain, SmallPtrSetImpl<Instruction*> &Users, ScalarEvolution &SE) argument 3486 CollectSubexprs(const SCEV *S, const SCEVConstant *C, SmallVectorImpl<const SCEV *> &Ops, const Loop *L, ScalarEvolution &SE, unsigned Depth = 0) argument 3544 mayUsePostIncMode(const TargetTransformInfo &TTI, LSRUse &LU, const SCEV *S, const Loop *L, ScalarEvolution &SE) argument 5496 LSRInstance(Loop *L, IVUsers &IU, ScalarEvolution &SE, DominatorTree &DT, LoopInfo &LI, const TargetTransformInfo &TTI, AssumptionCache &AC, TargetLibraryInfo &LibInfo) argument 5707 ReduceLoopStrength(Loop *L, IVUsers &IU, ScalarEvolution &SE, DominatorTree &DT, LoopInfo &LI, const TargetTransformInfo &TTI, AssumptionCache &AC, TargetLibraryInfo &LibInfo) argument 5742 auto &SE = getAnalysis<ScalarEvolutionWrapperPass>().getSE(); local [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | SimplifyIndVar.cpp | 55 ScalarEvolution *SE; member in class:__anon3238::SimplifyIndvar 63 SimplifyIndvar(Loop *Loop, ScalarEvolution *SE, DominatorTree *DT, argument 66 : L(Loop), LI(LI), SE(SE), DT(DT), Rewriter(Rewriter), DeadInsts(Dead), 132 assert(SE->isSCEVable(IVSrc->getType()) && "Expect SCEVable IV operand"); 144 FoldedExpr = SE->getUDivExpr(SE->getSCEV(IVSrc), SE->getSCEV(D)); 148 SE->getSCEV(IVSrc) != SE 405 willNotOverflow(ScalarEvolution *SE, Instruction::BinaryOps BinOp, bool Signed, const SCEV *LHS, const SCEV *RHS) argument 825 isSimpleIVUser(Instruction *I, const Loop *L, ScalarEvolution *SE) argument 933 simplifyUsersOfIV(PHINode *CurrIV, ScalarEvolution *SE, DominatorTree *DT, LoopInfo *LI, SmallVectorImpl<WeakTrackingVH> &Dead, SCEVExpander &Rewriter, IVVisitor *V) argument 944 simplifyLoopIVs(Loop *L, ScalarEvolution *SE, DominatorTree *DT, LoopInfo *LI, SmallVectorImpl<WeakTrackingVH> &Dead) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
H A D | LoopSimplify.h | 62 bool simplifyLoop(Loop *L, DominatorTree *DT, LoopInfo *LI, ScalarEvolution *SE,
|
H A D | UnrollLoop.h | 82 ScalarEvolution *SE, DominatorTree *DT, 90 ScalarEvolution *SE, DominatorTree *DT, 96 unsigned &TripCount, ScalarEvolution &SE); 100 bool peelLoop(Loop *L, unsigned PeelCount, LoopInfo *LI, ScalarEvolution *SE, 105 LoopInfo *LI, ScalarEvolution *SE, 110 bool isSafeToUnrollAndJam(Loop *L, ScalarEvolution &SE, DominatorTree &DT, 114 DominatorTree &DT, LoopInfo *LI, ScalarEvolution &SE, 125 ScalarEvolution *SE, DominatorTree *DT, 131 Loop *L, ScalarEvolution &SE, const TargetTransformInfo &TTI,
|
H A D | SimplifyIndVar.h | 48 bool simplifyUsersOfIV(PHINode *CurrIV, ScalarEvolution *SE, DominatorTree *DT, 54 bool simplifyLoopIVs(Loop *L, ScalarEvolution *SE, DominatorTree *DT,
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/ |
H A D | BoundsChecking.cpp | 60 BuilderTy &IRB, ScalarEvolution &SE) { 79 auto SizeRange = SE.getUnsignedRange(SE.getSCEV(Size)); 80 auto OffsetRange = SE.getUnsignedRange(SE.getSCEV(Offset)); 81 auto NeededSizeRange = SE.getUnsignedRange(SE.getSCEV(NeededSizeVal)); 144 ScalarEvolution &SE) { 158 ObjSizeEval, IRB, SE); 161 DL, TLI, ObjSizeEval, IRB, SE); 57 getBoundsCheckCond(Value *Ptr, Value *InstVal, const DataLayout &DL, TargetLibraryInfo &TLI, ObjectSizeOffsetEvaluator &ObjSizeEval, BuilderTy &IRB, ScalarEvolution &SE) argument 143 addBoundsChecking(Function &F, TargetLibraryInfo &TLI, ScalarEvolution &SE) argument 211 auto &SE = AM.getResult<ScalarEvolutionAnalysis>(F); local 229 auto &SE = getAnalysis<ScalarEvolutionWrapperPass>().getSE(); variable [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | SymExpr.h | 77 symbol_iterator(const SymExpr *SE); 105 const clang::ento::SymExpr *SE) { 106 SE->dumpToStream(os); 136 static inline bool classof(const SymExpr *SE) { argument 137 Kind k = SE->getKind(); 104 operator <<(raw_ostream &os, const clang::ento::SymExpr *SE) argument
|
/freebsd-11-stable/crypto/heimdal/appl/telnet/telnetd/ |
H A D | termstat.c | 60 IAC, SE); 68 IAC, SE);
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/ |
H A D | VLASizeChecker.cpp | 96 const Expr *SE = VLA->getSizeExpr(); local 98 SVal sizeV = C.getSVal(SE); 101 reportBug(VLA_Garbage, SE, state, C); 112 reportBug(VLA_Tainted, SE, nullptr, C, 124 reportBug(VLA_Zero, SE, stateZero, C); 138 QualType Ty = SE->getType(); 149 reportBug(VLA_Negative, SE, state, C); 158 svalBuilder.evalCast(sizeD, SizeTy, SE->getType()).castAs<NonLoc>();
|