Home
last modified time | relevance | path

Searched refs:SE (Results 1 – 25 of 318) sorted by relevance

12345678910>>...13

/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DInductiveRangeCheckElimination.cpp242 ScalarEvolution &SE; member in __anonfea5f1180111::InductiveRangeCheckElimination
259 : SE(SE), BPI(BPI), DT(DT), LI(LI), GetBFI(GetBFI) {} in InductiveRangeCheckElimination()
275 return SE.isLoopInvariant(SE.getSCEV(V), L); in parseRangeCheckICmp()
457 return (SE.*Operation)(SE.getSignExtendExpr(LHS, WideTy), in reassociateSubLHS()
624 ? SE.getSMaxExpr(Smallest, SE.getSMinExpr(Greatest, S)) in calculateSubRanges()
625 : SE.getUMaxExpr(Smallest, SE.getUMinExpr(Greatest, S)); in calculateSubRanges()
690 NoopOrExtend(IndVar->getStepRecurrence(SE), RCType, SE, IsLatchSigned)); in computeSafeIterationSpace()
734 return SE.getMinusSCEV(X, SE.getSMaxExpr(Y, XMinusSIntMax), in computeSafeIterationSpace()
747 return SE.getMinusSCEV(X, SE.getSMinExpr(X, Y), SCEV::FlagNUW); in computeSafeIterationSpace()
765 return SE.getAddExpr(SE.getSMaxExpr(SE.getSMinExpr(X, Zero), NegOne), One); in computeSafeIterationSpace()
[all …]
H A DLoopBoundSplit.cpp107 const SCEV *MaxSCEV = SE.getConstant(Max); in calculateUpperBound()
113 SE.getAddExpr(Cond.BoundSCEV, SE.getOne(BoundSCEVIntType)); in calculateUpperBound()
128 analyzeICmp(SE, ICmp, Cond, L); in hasProcessableCondition()
153 if (!calculateUpperBound(L, SE, Cond, IsExitCond)) in hasProcessableCondition()
169 if (!SE.isSCEVable(LHS->getType())) in isProcessableCondBI()
211 if (!isProcessableCondBI(SE, ExitingBI)) in canSplitLoopBound()
256 if (!isProcessableCondBI(SE, BI)) in findSplitCandidate()
294 if (!canSplitLoopBound(L, DT, SE, ExitingCond)) in splitLoopBound()
383 if (!SE.isSCEVable(PN.getType())) in splitLoopBound()
461 SE.forgetLoop(&L); in splitLoopBound()
[all …]
H A DIndVarSimplify.cpp130 ScalarEvolution *SE; member in __anonc22e0b5a0111::IndVarSimplify
166 : LI(LI), SE(SE), DT(DT), DL(DL), TLI(TLI), TTI(TTI), in IndVarSimplify()
415 SE->forgetLoop(L); in rewriteNonIntegerIVs()
560 ScalarEvolution *SE; member in __anonc22e0b5a0211::IndVarSimplifyVisitor
1274 if (SE->getTypeSizeInBits(ARTy) > SE->getTypeSizeInBits(MaxIterTy)) in createReplacement()
1276 else if (SE->getTypeSizeInBits(ARTy) < SE->getTypeSizeInBits(MaxIterTy)) { in createReplacement()
1291 Elements.push_back(SE->getMinusSCEV(Op, SE->getOne(Op->getType()))); in createReplacement()
1294 MaxIter = SE->getMinusSCEV(MaxIter, SE->getOne(MaxIter->getType())); in createReplacement()
1459 auto RHSCR = SE->getUnsignedRange(SE->applyLoopGuards(SE->getSCEV(RHS), L)); in canonicalizeExitCondition()
1534 auto RHSCR = SE->getUnsignedRange(SE->applyLoopGuards(SE->getSCEV(RHS), L)); in canonicalizeExitCondition()
[all …]
H A DAlignmentFromAssumptions.cpp52 ScalarEvolution *SE) { in getNewAlignmentDiff() argument
84 ScalarEvolution *SE) { in getNewAlignment() argument
85 const SCEV *PtrSCEV = SE->getSCEV(Ptr); in getNewAlignment()
97 DiffSCEV = SE->getAddExpr(DiffSCEV, OffSCEV); in getNewAlignment()
128 getNewAlignmentDiff(DiffIncSCEV, AlignSCEV, SE); in getNewAlignment()
172 AlignSCEV = SE->getSCEV(AlignOB.Inputs[1].get()); in extractAlignmentInfo()
182 OffSCEV = SE->getSCEV(AlignOB.Inputs[2].get()); in extractAlignmentInfo()
184 OffSCEV = SE->getZero(Int64Ty); in extractAlignmentInfo()
201 const SCEV *AASCEV = SE->getSCEV(AAPtr); in processAssumption()
285 SE = SE_; in runImpl()
[all …]
H A DLoopStrengthReduce.cpp442 DoInitialMatch(SE.getAddRecExpr(SE.getConstant(AR->getType(), 0), in DoInitialMatch()
733 const SCEV *Step = getExactSDiv(AR->getStepRecurrence(SE), RHS, SE, in getExactSDiv()
1072 L(L), SE(&SE), TTI(&TTI), AMK(AMK) { in Cost()
1957 ScalarEvolution &SE; member in __anon926e14ea0a11::LSRInstance
3239 const SCEV *IVOperExpr = SE.getAddExpr(SE.getUnknown(IVSrc), in GenerateIVChain()
3269 if (!PostIncV || (SE.getSCEV(PostIncV) != SE.getSCEV(IVSrc))) in GenerateIVChain()
3343 SE.getPointerBase(N) == SE.getPointerBase(S))) { in CollectFixupsAndInitialFormulae()
3568 if (SE.hasComputableLoopEvolution(SE.getSCEV(OtherOp), L)) in CollectLoopInvariantFixupsAndFormulae()
5855 : IU(IU), SE(SE), DT(DT), LI(LI), AC(AC), TLI(TLI), TTI(TTI), L(L), in LSRInstance()
6738 return Rec->isAffine() && !SE.containsUndefs(SE.getSCEV(P)); in GetInductionVariable()
[all …]
H A DLoopPredication.cpp265 ScalarEvolution *SE; member in __anon0d09f8f50111::LoopPredication
326 : AA(AA), DT(DT), SE(SE), LI(LI), MSSAU(MSSAU){}; in LoopPredication()
354 const SCEV *LHSS = SE->getSCEV(LHS); in parseLoopICmp()
362 if (SE->isLoopInvariant(LHSS, L)) { in parseLoopICmp()
382 if (SE->isLoopInvariant(LHS, L) && SE->isLoopInvariant(RHS, L)) { in expandCheck()
523 if (SE->isLoopInvariant(S, L)) in isLoopInvariantValue()
572 SE->getAddExpr(SE->getMinusSCEV(GuardLimit, GuardStart), in widenICmpRangeCheckIncrementingLoop()
573 SE->getMinusSCEV(LatchStart, SE->getOne(Ty))); in widenICmpRangeCheckIncrementingLoop()
1021 return SE.getCouldNotCompute(); in getMinAnalyzeableBackedgeTakenCount()
1093 SE->forgetLoop(L); in predicateLoopExits()
[all …]
H A DNaryReassociate.cpp205 SE = SE_; in runImpl()
284 OrigSCEV = SE->getSCEV(I); in matchAndReassociateMinOrMax()
298 if (!SE->isSCEVable(I->getType())) in tryReassociate()
304 OrigSCEV = SE->getSCEV(I); in tryReassociate()
307 OrigSCEV = SE->getSCEV(I); in tryReassociate()
404 IndexExprs[I] = SE->getSCEV(LHS); in tryReassociateGEPAtIndex()
469 if (SE->getSCEV(I)->isZero()) in tryReassociateBinaryOp()
486 const SCEV *AExpr = SE->getSCEV(A), *BExpr = SE->getSCEV(B); in tryReassociateBinaryOp()
544 return SE->getAddExpr(LHS, RHS); in getBinarySCEV()
546 return SE->getMulExpr(LHS, RHS); in getBinarySCEV()
[all …]
H A DBDCE.cpp111 if (SExtInst *SE = dyn_cast<SExtInst>(&I)) { in bitTrackingDCE() local
112 APInt Demanded = DB.getDemandedBits(SE); in bitTrackingDCE()
113 const uint32_t SrcBitSize = SE->getSrcTy()->getScalarSizeInBits(); in bitTrackingDCE()
114 auto *const DstTy = SE->getDestTy(); in bitTrackingDCE()
117 clearAssumptionsOfUsers(SE, DB); in bitTrackingDCE()
118 IRBuilder<> Builder(SE); in bitTrackingDCE()
120 Builder.CreateZExt(SE->getOperand(0), DstTy, SE->getName())); in bitTrackingDCE()
121 Worklist.push_back(SE); in bitTrackingDCE()
H A DLoopDataPrefetch.cpp65 ScalarEvolution *SE, const TargetTransformInfo *TTI, in LoopDataPrefetch() argument
67 : AC(AC), DT(DT), LI(LI), SE(SE), TTI(TTI), ORE(ORE) {} in LoopDataPrefetch()
109 ScalarEvolution *SE; member in __anon42e9458e0111::LoopDataPrefetch
176 ScalarEvolution *SE = &AM.getResult<ScalarEvolutionAnalysis>(F); in run() local
182 LoopDataPrefetch LDP(AC, DT, LI, SE, TTI, ORE); in run()
209 LoopDataPrefetch LDP(AC, DT, LI, SE, TTI, ORE); in runOnFunction()
319 unsigned ConstantMaxTripCount = SE->getSmallConstantMaxTripCount(L); in runOnLoop()
347 const SCEV *LSCEV = SE->getSCEV(PtrValue); in runOnLoop()
395 const SCEV *NextLSCEV = SE->getAddExpr(P.LSCEVAddRec, SE->getMulExpr( in runOnLoop()
396 SE->getConstant(P.LSCEVAddRec->getType(), ItersAhead), in runOnLoop()
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/lib/Analysis/
H A DLoopCacheAnalysis.cpp96 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isOneDimensionalArray()
100 if (StepRec && SE.isKnownNegative(StepRec)) in isOneDimensionalArray()
101 StepRec = SE.getNegativeSCEV(StepRec); in isOneDimensionalArray()
149 : StoreOrLoadInst(StoreOrLoadInst), SE(SE) { in IndexedReference()
326 RefCost = SE.getMulExpr(SE.getNoopOrZeroExtend(RefCost, WiderType), in computeRefCost()
450 if (SE.isLoopInvariant(SE.getSCEV(Addr), &L)) in isLoopInvariant()
488 Stride = SE.getMulExpr(SE.getNoopOrSignExtend(Coeff, WiderType), in isConsecutive()
492 Stride = SE.isKnownNegative(Stride) ? SE.getNegativeSCEV(Stride) : Stride; in isConsecutive()
509 return AR->getStepRecurrence(SE); in getLastCoefficient()
533 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isSimpleAddRecurrence()
[all …]
H A DDelinearization.cpp49 ScalarEvolution &SE; member
53 : SE(SE), Strides(S) {} in SCEVCollectStrides()
57 Strides.push_back(AR->getStepRecurrence(SE)); in follow()
124 ScalarEvolution &SE; member
127 ScalarEvolution &SE) in SCEVCollectAddRecMultiplies()
128 : Terms(T), SE(SE) {} in SCEVCollectAddRecMultiplies()
153 Terms.push_back(SE.getMulExpr(Operands)); in follow()
212 Step = SE.getMulExpr(Qs); in findArrayDimensionsRec()
271 return SE.getMulExpr(Factors); in removeConstantFactors()
454 collectParametricTerms(SE, Expr, Terms); in delinearize()
[all …]
H A DDependenceAnalysis.cpp469 SE = NewSE; in setAny()
1124 SE->getMinusSCEV(S, SE->getSMaxExpr(Size, SE->getOne(Size->getType()))); in isKnownLessThan()
1407 SE->getSMaxExpr(SE->getZero(Delta->getType()), Delta), in weakCrossingSIVtest()
2837 SE->getMulExpr(SE->getMinusSCEV(A[K].NegPart, B[K].PosPart), in findBoundsALL()
2985 return SE->getSMaxExpr(X, SE->getZero(X->getType())); in getPositivePart()
2991 return SE->getSMinExpr(X, SE->getZero(X->getType())); in getNegativePart()
3224 Src = SE->getMinusSCEV(Src, SE->getMulExpr(AP_K, SE->getConstant(CdivB))); in propagateLine()
3238 Src = SE->getAddExpr(Src, SE->getMulExpr(A_K, SE->getConstant(CdivA))); in propagateLine()
3252 Src = SE->getAddExpr(Src, SE->getMulExpr(A_K, SE->getConstant(CdivA))); in propagateLine()
3263 Src = SE->getAddExpr(Src, SE->getMulExpr(A_K, C)); in propagateLine()
[all …]
H A DScalarEvolutionDivision.cpp60 SCEVDivision D(SE, Numerator, Denominator); in divide()
88 divide(SE, *Quotient, Op, &Q, &R); in divide()
123 Quotient = SE.getConstant(QuotientVal); in visitConstant()
138 divide(SE, Numerator->getStepRecurrence(SE), Denominator, &StepQ, &StepR); in visitAddRecExpr()
156 divide(SE, Op, Denominator, &Q, &R); in visitAddExpr()
172 Quotient = SE.getAddExpr(Qs); in visitAddExpr()
173 Remainder = SE.getAddExpr(Rs); in visitAddExpr()
193 divide(SE, Op, Denominator, &Q, &R); in visitMulExpr()
212 Quotient = SE.getMulExpr(Qs); in visitMulExpr()
237 divide(SE, Diff, Denominator, &Q, &R); in visitMulExpr()
[all …]
H A DScalarEvolutionNormalization.cpp40 ScalarEvolution &SE) in NormalizeDenormalizeRewriter()
41 : SCEVRewriteVisitor<NormalizeDenormalizeRewriter>(SE), Kind(Kind), in NormalizeDenormalizeRewriter()
55 return SE.getAddRecExpr(Operands, AR->getLoop(), SCEV::FlagAnyWrap); in visitAddRecExpr()
67 Operands[i] = SE.getAddExpr(Operands[i], Operands[i + 1]); in visitAddRecExpr()
91 Operands[i] = SE.getMinusSCEV(Operands[i], Operands[i + 1]); in visitAddRecExpr()
94 return SE.getAddRecExpr(Operands, AR->getLoop(), SCEV::FlagAnyWrap); in visitAddRecExpr()
99 ScalarEvolution &SE, in normalizeForPostIncUse() argument
107 NormalizeDenormalizeRewriter(Normalize, Pred, SE).visit(S); in normalizeForPostIncUse()
116 ScalarEvolution &SE) { in normalizeForPostIncUseIf() argument
117 return NormalizeDenormalizeRewriter(Normalize, Pred, SE).visit(S); in normalizeForPostIncUseIf()
[all …]
H A DIVUsers.cpp38 return IVUsers(&L, &AR.AC, &AR.LI, &AR.DT, &AR.SE); in run()
70 !isInteresting(AR->getStepRecurrence(*SE), I, L, SE, LI); in isInteresting()
77 if (isInteresting(Op, I, L, SE, LI)) { in isInteresting()
144 if (!SE->isSCEVable(I->getType())) in AddUsersIfInteresting()
166 const SCEV *ISE = SE->getSCEV(I); in AddUsersIfInteresting()
170 if (!isInteresting(ISE, I, L, SE, LI)) in AddUsersIfInteresting()
239 LLVM_DEBUG(if (SE->getSCEV(I) != ISE) dbgs() in AddUsersIfInteresting()
252 ScalarEvolution *SE) in IVUsers() argument
253 : L(L), AC(AC), LI(LI), DT(DT), SE(SE) { in IVUsers()
319 IU.reset(new IVUsers(L, AC, LI, DT, SE)); in runOnLoop()
[all …]
H A DScalarEvolutionAliasAnalysis.cpp27 static bool canComputePointerDiff(ScalarEvolution &SE, in canComputePointerDiff() argument
29 if (SE.getEffectiveSCEVType(A->getType()) != in canComputePointerDiff()
30 SE.getEffectiveSCEVType(B->getType())) in canComputePointerDiff()
33 return SE.instructionCouldExistWithOperands(A, B); in canComputePointerDiff()
46 const SCEV *AS = SE.getSCEV(const_cast<Value *>(LocA.Ptr)); in alias()
47 const SCEV *BS = SE.getSCEV(const_cast<Value *>(LocB.Ptr)); in alias()
55 if (canComputePointerDiff(SE, AS, BS)) { in alias()
56 unsigned BitWidth = SE.getTypeSizeInBits(AS->getType()); in alias()
65 const SCEV *BA = SE.getMinusSCEV(BS, AS); in alias()
71 ASizeInt.ule(SE.getUnsignedRange(BA).getUnsignedMin()) && in alias()
[all …]
H A DLoopAccessAnalysis.cpp172 ScalarEvolution *SE = PSE.getSE(); in replaceSymbolicStrideSCEV() local
210 ScalarEvolution *SE = PSE.getSE(); in insert() local
913 return SE->getAddExpr(L, R); in findForkedSCEVs()
1861 if (SE.isKnownPositive(Minus)) in isSafeDependenceDistance()
1868 if (SE.isKnownPositive(Minus)) in isSafeDependenceDistance()
1916 return !SE.isLoopInvariant(SE.getSCEV(const_cast<Value *>(UO)), L); in isLoopVariantIndirectAddress()
1935 auto &SE = *PSE.getSE(); in getDependenceDistanceStrideAndSize() local
2588 auto *SE = PSE->getSE(); in analyzeLoop() local
2723 auto *SE = PSE->getSE(); in isInvariant() local
2773 !SE->isLoopInvariant(SE->getSCEV(GEP->getOperand(i)), Lp)) in stripGetElementPtr()
[all …]
H A DLoopNestAnalysis.cpp36 ScalarEvolution &SE);
42 LoopNest::LoopNest(Loop &Root, ScalarEvolution &SE) in LoopNest() argument
43 : MaxPerfectDepth(getMaxPerfectDepth(Root, SE)) { in LoopNest()
49 return std::make_unique<LoopNest>(Root, SE); in getLoopNest()
104 ScalarEvolution &SE) { in arePerfectlyNested() argument
124 if (!checkLoopsStructure(OuterLoop, InnerLoop, SE)) { in analyzeLoopNestForPerfectNest()
130 auto OuterLoopLB = OuterLoop.getBounds(SE); in analyzeLoopNestForPerfectNest()
205 auto OuterLoopLB = OuterLoop.getBounds(SE); in getInterveningInstructions()
241 LoopNest::getPerfectLoops(ScalarEvolution &SE) const { in getPerfectLoops()
316 ScalarEvolution &SE) { in checkLoopsStructure() argument
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLoopConstrainer.cpp50 const SCEV *StepPlusOne = SE.getAddExpr(Step, SE.getOne(Step->getType())); in isSafeDecreasingBound()
54 const SCEV *Limit = SE.getMinusSCEV(SE.getConstant(Min), StepPlusOne); in isSafeDecreasingBound()
57 SE.getMinusSCEV(BoundSCEV, SE.getOne(BoundSCEV->getType())); in isSafeDecreasingBound()
94 const SCEV *StepMinusOne = SE.getMinusSCEV(Step, SE.getOne(Step->getType())); in isSafeIncreasingBound()
98 const SCEV *Limit = SE.getMinusSCEV(SE.getConstant(Max), StepMinusOne); in isSafeIncreasingBound()
203 SE.getSignExtendExpr(AR->getStepRecurrence(SE), WideTy); in parseLoopStructure()
244 const SCEV *Addend = SE.getNegativeSCEV(IndVarBase->getStepRecurrence(SE)); in parseLoopStructure()
282 SE.getMinusSCEV(RightSCEV, SE.getOne(RightSCEV->getType())); in parseLoopStructure()
287 SE.getMinusSCEV(RightSCEV, SE.getOne(RightSCEV->getType())); in parseLoopStructure()
319 SE.getAddExpr(RightSCEV, SE.getOne(RightSCEV->getType())); in parseLoopStructure()
[all …]
H A DScalarEvolutionExpander.cpp162 assert(SE.getTypeSizeInBits(V->getType()) == SE.getTypeSizeInBits(Ty) && in InsertNoopCastOfTo()
186 SE.getTypeSizeInBits(Ty) == SE.getTypeSizeInBits(V->getType())) { in InsertNoopCastOfTo()
852 SE.getSignExtendExpr(SE.getAddExpr(AR, Step), WideTy); in IsIncrementNSW()
866 SE.getZeroExtendExpr(SE.getAddExpr(AR, Step), WideTy); in IsIncrementNUW()
1180 V = expand(SE.getTruncateExpr(SE.getUnknown(V), Ty), NewInsertPt); in visitAddRecExpr()
1255 SE.getMulExpr(SE.getUnknown(CanonicalIV), in visitAddRecExpr()
1549 if (Value *V = simplifyInstruction(PN, {DL, &SE.TLI, &SE.DT, &SE.AC})) in replaceCongruentIVs()
1693 if (SE.getSCEV(LHS) == S && SE.DT.dominates(LHS, At)) in hasRelatedExistingExpansion()
1696 if (SE.getSCEV(RHS) == S && SE.DT.dominates(RHS, At)) in hasRelatedExistingExpansion()
2182 formLCSSAForInstructions(ToUpdate, SE.DT, SE.LI, &SE, &PHIsToRemove, in fixupLCSSAFormFor()
[all …]
H A DSimplifyIndVar.cpp55 ScalarEvolution *SE; member in __anoncf1033750111::SimplifyIndvar
68 : L(Loop), LI(LI), SE(SE), DT(DT), TTI(TTI), Rewriter(Rewriter), in SimplifyIndvar()
265 SE->forgetValue(ICmp); in eliminateIVComparison()
272 SE->isKnownNonNegative(S) && SE->isKnownNonNegative(X)) { in eliminateIVComparison()
300 if (SE->isKnownNonNegative(N) && SE->isKnownNonNegative(D)) { in eliminateSDiv()
388 const auto *NLessOne = SE->getMinusSCEV(N, SE->getOne(T)); in simplifyIVRemainder()
538 return SE->isKnownNonNegative(SCEVOP1) && SE->isKnownNonNegative(SCEVOP2); in eliminateTrunc()
806 ConstantRange IVRange = SE->getUnsignedRange(SE->getSCEV(IVOperand)); in strengthenRightShift()
999 SCEVExpander Rewriter(*SE, SE->getDataLayout(), "indvars"); in simplifyLoopIVs()
1027 ScalarEvolution *SE; member in __anoncf1033750311::WidenIV
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/ARM/
H A DMVETailPredication.cpp86 ScalarEvolution *SE = nullptr; member in __anonffea82af0111::MVETailPredication
208 auto *EC= SE->getSCEV(ElemCount); in IsSafeActiveMask()
209 auto *TC = SE->getSCEV(TripCount); in IsSafeActiveMask()
220 if (!SE->isLoopInvariant(EC, L)) { in IsSafeActiveMask()
231 auto *IVExpr = SE->getSCEV(IV); in IsSafeActiveMask()
327 const SCEV *Div = SE->getUDivExpr( in IsSafeActiveMask()
328 SE->getAddExpr(SE->getMulExpr(Ceil, VW), SE->getNegativeSCEV(VW), in IsSafeActiveMask()
331 const SCEV *Sub = SE->getMinusSCEV(SE->getBackedgeTakenCount(L), Div); in IsSafeActiveMask()
337 Sub = SE->applyLoopGuards(Sub, L); in IsSafeActiveMask()
352 return SE->getMinusSCEV(EC, BaseC); in IsSafeActiveMask()
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSetOperations.h26 for (typename S2Ty::const_iterator SI = S2.begin(), SE = S2.end(); in set_union() local
27 SI != SE; ++SI) in set_union()
51 for (typename S1Ty::const_iterator SI = S1.begin(), SE = S1.end(); SI != SE; in set_intersection_impl() local
72 for (typename S1Ty::const_iterator SI = S1.begin(), SE = S1.end(); in set_difference() local
73 SI != SE; ++SI) in set_difference()
83 for (typename S2Ty::const_iterator SI = S2.begin(), SE = S2.end(); in set_subtract() local
84 SI != SE; ++SI) in set_subtract()
93 for (typename S2Ty::const_iterator SI = S2.begin(), SE = S2.end(); SI != SE; in set_subtract() local
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DBoundsChecking.cpp59 BuilderTy &IRB, ScalarEvolution &SE) { in getBoundsCheckCond() argument
78 auto SizeRange = SE.getUnsignedRange(SE.getSCEV(Size)); in getBoundsCheckCond()
79 auto OffsetRange = SE.getUnsignedRange(SE.getSCEV(Offset)); in getBoundsCheckCond()
80 auto NeededSizeRange = SE.getUnsignedRange(SE.getSCEV(NeededSizeVal)); in getBoundsCheckCond()
143 ScalarEvolution &SE) { in addBoundsChecking() argument
162 ObjSizeEval, IRB, SE); in addBoundsChecking()
166 DL, TLI, ObjSizeEval, IRB, SE); in addBoundsChecking()
171 DL, TLI, ObjSizeEval, IRB, SE); in addBoundsChecking()
175 DL, TLI, ObjSizeEval, IRB, SE); in addBoundsChecking()
227 auto &SE = AM.getResult<ScalarEvolutionAnalysis>(F); in run() local
[all …]
/freebsd-14.2/contrib/file/magic/Magdir/
H A Dselinux1 # 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

12345678910>>...13