| /NextBSD/contrib/llvm/lib/Transforms/Utils/ |
| HD | SimplifyIndVar.cpp | 49 ScalarEvolution *SE; member in __anon5a27a7ee0111::SimplifyIndvar 56 SimplifyIndvar(Loop *Loop, ScalarEvolution *SE, LoopInfo *LI, in SimplifyIndvar() argument 58 : L(Loop), LI(LI), SE(SE), DeadInsts(Dead), Changed(false) { in SimplifyIndvar() 113 assert(SE->isSCEVable(IVSrc->getType()) && "Expect SCEVable IV operand"); in foldIVUser() 125 FoldedExpr = SE->getUDivExpr(SE->getSCEV(IVSrc), SE->getSCEV(D)); in foldIVUser() 128 if (!SE->isSCEVable(UseInst->getType())) in foldIVUser() 132 if (SE->getSCEV(UseInst) != FoldedExpr) in foldIVUser() 139 assert(SE->getSCEV(UseInst) == FoldedExpr && "bad SCEV with folded oper"); in foldIVUser() 161 const SCEV *S = SE->getSCEV(ICmp->getOperand(IVOperIdx)); in eliminateIVComparison() 162 const SCEV *X = SE->getSCEV(ICmp->getOperand(1 - IVOperIdx)); in eliminateIVComparison() [all …]
|
| HD | LoopSimplify.cpp | 255 LoopInfo *LI, ScalarEvolution *SE, Pass *PP, in separateNestedLoop() argument 286 if (SE) in separateNestedLoop() 287 SE->forgetLoop(L); in separateNestedLoop() 480 ScalarEvolution *SE, Pass *PP, in simplifyOneLoop() argument 508 for (succ_iterator SI = succ_begin(P), SE = succ_end(P); SI != SE; ++SI) in simplifyOneLoop() local 537 if (SE) in simplifyOneLoop() 538 SE->forgetLoop(L); in simplifyOneLoop() 588 separateNestedLoop(L, Preheader, AA, DT, LI, SE, PP, AC)) { in simplifyOneLoop() 622 if (SE) SE->forgetValue(PN); in simplifyOneLoop() 674 if (SE) in simplifyOneLoop() [all …]
|
| /NextBSD/contrib/llvm/lib/Analysis/ |
| HD | ScalarEvolutionExpander.cpp | 83 assert(SE.DT->dominates(Ret, BIP)); in ReuseOrCreateCast() 98 assert(SE.getTypeSizeInBits(V->getType()) == SE.getTypeSizeInBits(Ty) && in InsertNoopCastOfTo() 112 SE.getTypeSizeInBits(Ty) == SE.getTypeSizeInBits(V->getType())) { in InsertNoopCastOfTo() 116 SE.getTypeSizeInBits(CI->getType()) == in InsertNoopCastOfTo() 117 SE.getTypeSizeInBits(CI->getOperand(0)->getType())) in InsertNoopCastOfTo() 122 SE.getTypeSizeInBits(CE->getType()) == in InsertNoopCastOfTo() 123 SE.getTypeSizeInBits(CE->getOperand(0)->getType())) in InsertNoopCastOfTo() 187 while (const Loop *L = SE.LI->getLoopFor(Builder.GetInsertBlock())) { in InsertBinop() 212 const SCEV *Factor, ScalarEvolution &SE, in FactorOutConstant() argument 220 S = SE.getConstant(S->getType(), 1); in FactorOutConstant() [all …]
|
| HD | DependenceAnalysis.cpp | 136 SE = &getAnalysis<ScalarEvolution>(); in runOnFunction() 337 return SE->getNegativeSCEV(C); in getD() 374 A = SE->getConstant(D->getType(), 1); in setDistance() 375 B = SE->getNegativeSCEV(A); in setDistance() 376 C = SE->getNegativeSCEV(D); in setDistance() 387 SE = NewSE; in setAny() 467 const SCEV *Prod1 = SE->getMulExpr(X->getA(), Y->getB()); in intersectConstraints() 468 const SCEV *Prod2 = SE->getMulExpr(X->getB(), Y->getA()); in intersectConstraints() 472 Prod1 = SE->getMulExpr(X->getC(), Y->getB()); in intersectConstraints() 473 Prod2 = SE->getMulExpr(X->getB(), Y->getC()); in intersectConstraints() [all …]
|
| HD | ScalarEvolutionNormalization.cpp | 70 ScalarEvolution &SE; member in __anonce0708b40111::PostIncTransform 78 Kind(kind), Loops(loops), SE(se), DT(dt) {} in PostIncTransform() 99 case scZeroExtend: return SE.getZeroExtendExpr(N, S->getType()); in TransformImpl() 100 case scSignExtend: return SE.getSignExtendExpr(N, S->getType()); in TransformImpl() 101 case scTruncate: return SE.getTruncateExpr(N, S->getType()); in TransformImpl() 119 const SCEV *Result = SE.getAddRecExpr(Operands, L, SCEV::FlagAnyWrap); in TransformImpl() 135 TransformSubExpr(AR->getStepRecurrence(SE), in TransformImpl() 137 Result = SE.getMinusSCEV(Result, TransformedStep); in TransformImpl() 166 TransformSubExpr(AR->getStepRecurrence(SE), in TransformImpl() 168 Result = SE.getMinusSCEV(Result, TransformedStep); in TransformImpl() [all …]
|
| HD | ScalarEvolutionAliasAnalysis.cpp | 34 ScalarEvolution *SE; member in __anond42ad13b0111::ScalarEvolutionAliasAnalysis 38 ScalarEvolutionAliasAnalysis() : FunctionPass(ID), SE(nullptr) { in ScalarEvolutionAliasAnalysis() 85 SE = &getAnalysis<ScalarEvolution>(); in runOnFunction() 119 const SCEV *AS = SE->getSCEV(const_cast<Value *>(LocA.Ptr)); in alias() 120 const SCEV *BS = SE->getSCEV(const_cast<Value *>(LocB.Ptr)); in alias() 127 if (SE->getEffectiveSCEVType(AS->getType()) == in alias() 128 SE->getEffectiveSCEVType(BS->getType())) { in alias() 129 unsigned BitWidth = SE->getTypeSizeInBits(AS->getType()); in alias() 134 const SCEV *BA = SE->getMinusSCEV(BS, AS); in alias() 139 if (ASizeInt.ule(SE->getUnsignedRange(BA).getUnsignedMin()) && in alias() [all …]
|
| HD | IVUsers.cpp | 54 ScalarEvolution *SE, LoopInfo *LI) { in isInteresting() argument 62 SE->getSCEVAtScope(AR, LI->getLoopFor(I->getParent())) != AR); in isInteresting() 66 return isInteresting(AR->getStart(), I, L, SE, LI) && in isInteresting() 67 !isInteresting(AR->getStepRecurrence(*SE), I, L, SE, LI); in isInteresting() 75 if (isInteresting(*OI, I, L, SE, LI)) { in isInteresting() 127 if (!SE->isSCEVable(I->getType())) in AddUsersImpl() 139 uint64_t Width = SE->getTypeSizeInBits(I->getType()); in AddUsersImpl() 149 const SCEV *ISE = SE->getSCEV(I); in AddUsersImpl() 153 if (!isInteresting(ISE, I, L, SE, LI)) in AddUsersImpl() 208 *SE, *DT); in AddUsersImpl() [all …]
|
| HD | LoopAccessAnalysis.cpp | 90 const SCEV *llvm::replaceSymbolicStrideSCEV(ScalarEvolution *SE, in replaceSymbolicStrideSCEV() argument 94 const SCEV *OrigSCEV = SE->getSCEV(Ptr); in replaceSymbolicStrideSCEV() 112 SCEVParameterRewriter::rewrite(OrigSCEV, *SE, RewriteMap, true); in replaceSymbolicStrideSCEV() 119 return SE->getSCEV(Ptr); in replaceSymbolicStrideSCEV() 126 const SCEV *Sc = replaceSymbolicStrideSCEV(SE, Strides, Ptr); in insert() 129 const SCEV *Ex = SE->getBackedgeTakenCount(Lp); in insert() 130 const SCEV *ScEnd = AR->evaluateAtIteration(Ex, *SE); in insert() 148 ScalarEvolution *SE) { in getMinFromExprs() argument 149 const SCEV *Diff = SE->getMinusSCEV(J, I); in getMinFromExprs() 166 const SCEV *Min0 = getMinFromExprs(Start, Low, RtCheck.SE); in addPointer() [all …]
|
| HD | Delinearization.cpp | 45 ScalarEvolution *SE; member in __anon570cd6340111::Delinearization 68 SE = &getAnalysis<ScalarEvolution>(); in runOnFunction() 97 const SCEV *AccessFn = SE->getSCEVAtScope(getPointerOperand(*Inst), L); in print() 100 dyn_cast<SCEVUnknown>(SE->getPointerBase(AccessFn)); in print() 104 AccessFn = SE->getMinusSCEV(AccessFn, BasePointer); in print() 118 SE->delinearize(AR, Subscripts, Sizes, SE->getElementSize(Inst)); in print()
|
| HD | ScalarEvolution.cpp | 367 SE->forgetMemoizedResults(this); in deleted() 370 SE->UniqueSCEVs.RemoveNode(this); in deleted() 378 SE->forgetMemoizedResults(this); in allUsesReplacedWith() 381 SE->UniqueSCEVs.RemoveNode(this); in allUsesReplacedWith() 708 static void divide(ScalarEvolution &SE, const SCEV *Numerator, in divide() 713 SCEVDivision D(SE, Numerator, Denominator); in divide() 741 divide(SE, *Quotient, Op, &Q, &R); in divide() 787 Quotient = SE.getConstant(QuotientVal); in visitConstant() 788 Remainder = SE.getConstant(RemainderVal); in visitConstant() 796 divide(SE, Numerator->getStart(), Denominator, &StartQ, &StartR); in visitAddRecExpr() [all …]
|
| /NextBSD/contrib/llvm/lib/Transforms/Scalar/ |
| HD | InductiveRangeCheckElimination.cpp | 126 ScalarEvolution &SE, Value *&Index, 130 parseRangeCheck(Loop *L, ScalarEvolution &SE, Value *Condition, 192 Optional<Range> computeSafeIterationSpace(ScalarEvolution &SE, 199 Loop *L, ScalarEvolution &SE, 260 ScalarEvolution &SE, Value *&Index, in parseRangeCheckICmp() argument 263 auto IsNonNegativeAndNotLoopVarying = [&SE, L](Value *V) { in parseRangeCheckICmp() 264 const SCEV *S = SE.getSCEV(V); in parseRangeCheckICmp() 268 return SE.getLoopDisposition(S, L) == ScalarEvolution::LoopInvariant && in parseRangeCheckICmp() 269 SE.isKnownNonNegative(S); in parseRangeCheckICmp() 326 InductiveRangeCheck::parseRangeCheck(Loop *L, ScalarEvolution &SE, in parseRangeCheck() argument [all …]
|
| HD | AlignmentFromAssumptions.cpp | 72 ScalarEvolution *SE; member 103 ScalarEvolution *SE) { in getNewAlignmentDiff() argument 105 const SCEV *DiffAlignDiv = SE->getUDivExpr(DiffSCEV, AlignSCEV); in getNewAlignmentDiff() 106 const SCEV *DiffAlign = SE->getMulExpr(DiffAlignDiv, AlignSCEV); in getNewAlignmentDiff() 107 const SCEV *DiffUnitsSCEV = SE->getMinusSCEV(DiffAlign, DiffSCEV); in getNewAlignmentDiff() 138 ScalarEvolution *SE) { in getNewAlignment() argument 139 const SCEV *PtrSCEV = SE->getSCEV(Ptr); in getNewAlignment() 140 const SCEV *DiffSCEV = SE->getMinusSCEV(PtrSCEV, AASCEV); in getNewAlignment() 144 DiffSCEV = SE->getNoopOrSignExtend(DiffSCEV, OffSCEV->getType()); in getNewAlignment() 148 DiffSCEV = SE->getMinusSCEV(DiffSCEV, OffSCEV); in getNewAlignment() [all …]
|
| HD | LoopStrengthReduce.cpp | 263 void InitialMatch(const SCEV *S, Loop *L, ScalarEvolution &SE); 290 ScalarEvolution &SE) { in DoInitialMatch() argument 292 if (SE.properlyDominates(S, L->getHeader())) { in DoInitialMatch() 300 DoInitialMatch(S, L, Good, Bad, SE); in DoInitialMatch() 307 DoInitialMatch(AR->getStart(), L, Good, Bad, SE); in DoInitialMatch() 308 DoInitialMatch(SE.getAddRecExpr(SE.getConstant(AR->getType(), 0), in DoInitialMatch() 309 AR->getStepRecurrence(SE), in DoInitialMatch() 312 L, Good, Bad, SE); in DoInitialMatch() 320 const SCEV *NewMul = SE.getMulExpr(Ops); in DoInitialMatch() 324 DoInitialMatch(NewMul, L, MyGood, MyBad, SE); in DoInitialMatch() [all …]
|
| HD | IndVarSimplify.cpp | 91 ScalarEvolution *SE; member in __anonb0340ef30211::IndVarSimplify 102 : LoopPass(ID), LI(nullptr), SE(nullptr), DT(nullptr), Changed(false) { in IndVarSimplify() 200 const SCEV *FromBase = SE->getPointerBase(SE->getSCEV(FromPtr)); in isValidRewrite() 201 const SCEV *ToBase = SE->getPointerBase(SE->getSCEV(ToPtr)); in isValidRewrite() 486 SE->forgetLoop(L); in RewriteNonIntegerIVs() 533 if (SE->getSCEV(LHS) == S && DT->dominates(LHS, InsertPt)) { in ExpandSCEVIfNeeded() 538 if (SE->getSCEV(RHS) == S && DT->dominates(RHS, InsertPt)) { in ExpandSCEVIfNeeded() 616 SE->forgetValue(PN); in RewriteLoopExitValues() 638 const SCEV *ExitValue = SE->getSCEVAtScope(Inst, L->getParentLoop()); in RewriteLoopExitValues() 639 if (!SE->isLoopInvariant(ExitValue, L) || in RewriteLoopExitValues() [all …]
|
| HD | NaryReassociate.cpp | 173 ScalarEvolution *SE; member in __anonef45414f0111::NaryReassociate 210 SE = &getAnalysis<ScalarEvolution>(); in runOnFunction() 242 if (SE->isSCEVable(I->getType()) && isPotentiallyNaryReassociable(I)) { in doOneIteration() 243 const SCEV *OldSCEV = SE->getSCEV(I); in doOneIteration() 246 SE->forgetValue(I); in doOneIteration() 253 const SCEV *NewSCEV = SE->getSCEV(I); in doOneIteration() 415 IndexExprs.push_back(SE->getSCEV(*Index)); in tryReassociateGEPAtIndex() 417 IndexExprs[I] = SE->getSCEV(LHS); in tryReassociateGEPAtIndex() 426 SE->getZeroExtendExpr(IndexExprs[I], GEP->getOperand(I)->getType()); in tryReassociateGEPAtIndex() 428 const SCEV *CandidateExpr = SE->getGEPExpr( in tryReassociateGEPAtIndex() [all …]
|
| HD | LoopIdiomRecognize.cpp | 134 ScalarEvolution *SE; member in __anonc88a29140111::LoopIdiomRecognize 142 SE = nullptr; in LoopIdiomRecognize() 190 return SE ? SE : (SE = &getAnalysis<ScalarEvolution>()); in getScalarEvolution() 464 ScalarEvolution *SE = LIR.getScalarEvolution(); in transform() local 567 SE->forgetLoop(CurLoop); in transform() 613 const SCEV *BECount = SE->getBackedgeTakenCount(CurLoop); in runOnCountableLoop() 676 SE = &getAnalysis<ScalarEvolution>(); in runOnLoop() 677 if (SE->hasLoopInvariantBackedgeTakenCount(L)) in runOnLoop() 745 dyn_cast<SCEVAddRecExpr>(SE->getSCEV(StorePtr)); in processLoopStore() 776 dyn_cast<SCEVAddRecExpr>(SE->getSCEV(LI->getOperand(0))); in processLoopStore() [all …]
|
| /NextBSD/contrib/llvm/include/llvm/Analysis/ |
| HD | ScalarEvolutionExpressions.h | 305 const SCEV *getStepRecurrence(ScalarEvolution &SE) const { in getStepRecurrence() argument 307 return SE.getAddRecExpr(SmallVector<const SCEV *, 3>(op_begin()+1, in getStepRecurrence() 338 const SCEV *evaluateAtIteration(const SCEV *It, ScalarEvolution &SE) const; 347 ScalarEvolution &SE) const; 351 const SCEVAddRecExpr *getPostIncExpr(ScalarEvolution &SE) const { in getPostIncExpr() argument 352 return cast<SCEVAddRecExpr>(SE.getAddExpr(this, getStepRecurrence(SE))); in getPostIncExpr() 417 ScalarEvolution *SE; variable 425 SCEV(ID, scUnknown), CallbackVH(V), SE(se), Next(next) {} in SCEVUnknown() 563 static const SCEV *rewrite(const SCEV *Scev, ScalarEvolution &SE, 566 SCEVParameterRewriter Rewriter(SE, Map, InterpretConsts); [all …]
|
| HD | LoopAccessAnalysis.h | 181 : SE(Se), InnermostLoop(L), AccessIdx(0), in MemoryDepChecker() 241 ScalarEvolution *SE; 324 RuntimePointerChecking(ScalarEvolution *SE) : Need(false), SE(SE) {} in RuntimePointerChecking() argument 419 ScalarEvolution *SE; variable 438 LoopAccessInfo(Loop *L, ScalarEvolution *SE, const DataLayout &DL, 532 ScalarEvolution *SE; variable 564 const SCEV *replaceSymbolicStrideSCEV(ScalarEvolution *SE, 570 int isStridedPtr(ScalarEvolution *SE, Value *Ptr, const Loop *Lp, 613 ScalarEvolution *SE; variable
|
| /NextBSD/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| HD | SymbolManager.h | 81 symbol_iterator(const SymExpr *SE); 117 static inline bool classof(const SymExpr *SE) { in classof() argument 118 Kind k = SE->getKind(); in classof() 147 static inline bool classof(const SymExpr *SE) { in classof() argument 148 return SE->getKind() == RegionValueKind; in classof() 193 static inline bool classof(const SymExpr *SE) { in classof() argument 194 return SE->getKind() == ConjuredKind; in classof() 227 static inline bool classof(const SymExpr *SE) { in classof() argument 228 return SE->getKind() == DerivedKind; in classof() 258 static inline bool classof(const SymExpr *SE) { in classof() argument [all …]
|
| /NextBSD/contrib/file/magic/Magdir/ |
| HD | selinux | 1 # Type: SE Linux policy modules *.pp reference policy 6 0 lelong 0xf97cff8f SE Linux modular policy 17 1 string policy_module( SE Linux policy module source 18 2 string policy_module( SE Linux policy module source 20 0 string ##\ <summary> SE Linux policy interface source 22 #0 search gen_context( SE Linux policy file contexts 24 #0 search gen_sens( SE Linux policy MLS constraints source
|
| /NextBSD/contrib/llvm/lib/Target/PowerPC/ |
| HD | PPCLoopPreIncPrep.cpp | 88 ScalarEvolution *SE; member in __anon2e9c26390111::PPCLoopPreIncPrep 106 SCEVLess(ScalarEvolution *SE) : SE(SE) {} in SCEVLess() 109 const SCEV *Diff = SE->getMinusSCEV(X, Y); in operator ()() 114 ScalarEvolution *SE; member 143 SE = &getAnalysis<ScalarEvolution>(); in runOnFunction() 206 const SCEV *LSCEV = SE->getSCEVAtScope(PtrValue, L); in runOnLoop() 218 const SCEV *Diff = SE->getMinusSCEV(K->first, LSCEV); in runOnLoop() 227 Buckets.push_back(Bucket(SCEVLess(SE))); in runOnLoop() 274 if (!SE->isLoopInvariant(BasePtrStartSCEV, L)) in runOnLoop() 278 dyn_cast<SCEVConstant>(BasePtrSCEV->getStepRecurrence(*SE)); in runOnLoop() [all …]
|
| HD | PPCLoopDataPrefetch.cpp | 87 ScalarEvolution *SE; member in __anon6861932c0111::PPCLoopDataPrefetch 107 SE = &getAnalysis<ScalarEvolution>(); in runOnFunction() 179 const SCEV *LSCEV = SE->getSCEV(PtrValue); in runOnLoop() 191 const SCEV *PtrDiff = SE->getMinusSCEV(LSCEVAddRec, K->second); in runOnLoop() 204 const SCEV *NextLSCEV = SE->getAddExpr(LSCEVAddRec, SE->getMulExpr( in runOnLoop() 205 SE->getConstant(LSCEVAddRec->getType(), ItersAhead), in runOnLoop() 206 LSCEVAddRec->getStepRecurrence(*SE))); in runOnLoop() 207 if (!isSafeToExpand(NextLSCEV, *SE)) in runOnLoop() 213 SCEVExpander SCEVE(*SE, J->getModule()->getDataLayout(), "prefaddr"); in runOnLoop()
|
| /NextBSD/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/ |
| HD | SimpleConstraintManager.cpp | 29 const SymExpr *SE = SymVal->getSymbol(); in canReasonAbout() local 31 if (const SymIntExpr *SIE = dyn_cast<SymIntExpr>(SE)) { in canReasonAbout() 52 if (const SymSymExpr *SSE = dyn_cast<SymSymExpr>(SE)) { in canReasonAbout() 140 } else if (const SymIntExpr *SE = dyn_cast<SymIntExpr>(sym)) { in assumeAux() local 143 BinaryOperator::Opcode op = SE->getOpcode(); in assumeAux() 148 return assumeSymRel(state, SE->getLHS(), op, SE->getRHS()); in assumeAux() 195 if (const SymIntExpr *SE = dyn_cast<SymIntExpr>(Sym)) { in computeAdjustment() local 196 BinaryOperator::Opcode Op = SE->getOpcode(); in computeAdjustment() 198 Sym = SE->getLHS(); in computeAdjustment() 199 Adjustment = APSIntType(Adjustment).convert(SE->getRHS()); in computeAdjustment()
|
| /NextBSD/contrib/llvm/include/llvm/ADT/ |
| HD | SetOperations.h | 26 for (typename S2Ty::const_iterator SI = S2.begin(), SE = S2.end(); in set_union() local 27 SI != SE; ++SI) in set_union() 53 for (typename S1Ty::const_iterator SI = S1.begin(), SE = S1.end(); in set_difference() local 54 SI != SE; ++SI) in set_difference() 64 for (typename S2Ty::const_iterator SI = S2.begin(), SE = S2.end(); in set_subtract() local 65 SI != SE; ++SI) in set_subtract()
|
| /NextBSD/contrib/llvm/tools/clang/lib/StaticAnalyzer/Checkers/ |
| HD | VLASizeChecker.cpp | 96 const Expr *SE = VLA->getSizeExpr(); in checkPreStmt() local 98 SVal sizeV = state->getSVal(SE, C.getLocationContext()); in checkPreStmt() 101 reportBug(VLA_Garbage, SE, state, C); in checkPreStmt() 112 reportBug(VLA_Tainted, SE, nullptr, C); in checkPreStmt() 123 reportBug(VLA_Zero, SE, stateZero, C); in checkPreStmt() 137 QualType Ty = SE->getType(); in checkPreStmt() 148 reportBug(VLA_Negative, SE, state, C); in checkPreStmt() 157 svalBuilder.evalCast(sizeD, SizeTy, SE->getType()).castAs<NonLoc>(); in checkPreStmt()
|