| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | InductiveRangeCheckElimination.cpp | 144 static bool parseRangeCheckICmp(Loop *L, ICmpInst *ICI, ScalarEvolution &SE,
149 extractRangeChecksFromCond(Loop *L, ScalarEvolution &SE, Use &ConditionUse,
154 ICmpInst::Predicate Pred, ScalarEvolution &SE,
159 ICmpInst::Predicate Pred, ScalarEvolution &SE,
202 bool isEmpty(ScalarEvolution &SE, bool IsSigned) const { in isEmpty() argument
206 return SE.isKnownPredicate(ICmpInst::ICMP_SGE, Begin, End); in isEmpty()
208 return SE.isKnownPredicate(ICmpInst::ICMP_UGE, Begin, End); in isEmpty()
219 std::optional<Range> computeSafeIterationSpace(ScalarEvolution &SE,
229 BranchInst *BI, Loop *L, ScalarEvolution &SE, BranchProbabilityInfo *BPI,
235 ScalarEvolution &SE; member in __anona4c10e620111::InductiveRangeCheckElimination
[all …]
|
| H A D | LoopBoundSplit.cpp | 51 static void analyzeICmp(ScalarEvolution &SE, ICmpInst *ICmp, in analyzeICmp() argument
56 const SCEV *AddRecSCEV = SE.getSCEV(Cond.AddRecValue); in analyzeICmp()
57 const SCEV *BoundSCEV = SE.getSCEV(Cond.BoundValue); in analyzeICmp()
80 static bool calculateUpperBound(const Loop &L, ScalarEvolution &SE, in calculateUpperBound() argument
83 const SCEV *ExitCount = SE.getExitCount(&L, Cond.ICmp->getParent()); in calculateUpperBound()
107 const SCEV *MaxSCEV = SE.getConstant(Max); in calculateUpperBound()
111 if (SE.isKnownPredicate(Pred, Cond.BoundSCEV, MaxSCEV)) { in calculateUpperBound()
113 SE.getAddExpr(Cond.BoundSCEV, SE.getOne(BoundSCEVIntType)); in calculateUpperBound()
125 static bool hasProcessableCondition(const Loop &L, ScalarEvolution &SE, in hasProcessableCondition() argument
128 analyzeICmp(SE, ICmp, Cond, L); in hasProcessableCondition()
[all …]
|
| H A D | IndVarSimplify.cpp | 129 ScalarEvolution *SE; member in __anon28dbd4a40111::IndVarSimplify
164 IndVarSimplify(LoopInfo *LI, ScalarEvolution *SE, DominatorTree *DT, in IndVarSimplify() argument
167 : LI(LI), SE(SE), DT(DT), DL(DL), TLI(TLI), TTI(TTI), in IndVarSimplify()
421 SE->forgetLoop(L); in rewriteNonIntegerIVs()
493 SE->forgetValue(&PN); in rewriteFirstIterationLoopExitValues()
509 ScalarEvolution *SE, in visitIVCast() argument
516 uint64_t Width = SE->getTypeSizeInBits(Ty); in visitIVCast()
524 uint64_t NarrowIVWidth = SE->getTypeSizeInBits(WI.NarrowIV->getType()); in visitIVCast()
542 Width > SE->getTypeSizeInBits(WI.WidestNativeType)) { in visitIVCast()
543 WI.WidestNativeType = SE->getEffectiveSCEVType(Ty); in visitIVCast()
[all …]
|
| H A D | AlignmentFromAssumptions.cpp | 52 ScalarEvolution *SE) { in getNewAlignmentDiff() argument
54 const SCEV *DiffUnitsSCEV = SE->getURemExpr(DiffSCEV, AlignSCEV); in getNewAlignmentDiff()
84 ScalarEvolution *SE) { in getNewAlignment() argument
85 const SCEV *PtrSCEV = SE->getSCEV(Ptr); in getNewAlignment()
87 const SCEV *DiffSCEV = SE->getMinusSCEV(PtrSCEV, AASCEV); in getNewAlignment()
93 DiffSCEV = SE->getNoopOrSignExtend(DiffSCEV, OffSCEV->getType()); in getNewAlignment()
97 DiffSCEV = SE->getAddExpr(DiffSCEV, OffSCEV); in getNewAlignment()
103 if (MaybeAlign NewAlignment = getNewAlignmentDiff(DiffSCEV, AlignSCEV, SE)) { in getNewAlignment()
117 const SCEV *DiffIncSCEV = DiffARSCEV->getStepRecurrence(*SE); in getNewAlignment()
126 MaybeAlign NewAlignment = getNewAlignmentDiff(DiffStartSCEV, AlignSCEV, SE); in getNewAlignment()
[all …]
|
| H A D | LoopStrengthReduce.cpp | 321 const SCEV *getSCEV(ScalarEvolution &SE, Type *Ty) const { in getSCEV() argument
322 const SCEV *S = SE.getConstant(Ty, Quantity); in getSCEV()
324 S = SE.getMulExpr(S, SE.getVScale(S->getType())); in getSCEV()
328 const SCEV *getNegativeSCEV(ScalarEvolution &SE, Type *Ty) const { in getNegativeSCEV() argument
329 const SCEV *NegS = SE.getConstant(Ty, -(uint64_t)Quantity); in getNegativeSCEV()
331 NegS = SE.getMulExpr(NegS, SE.getVScale(NegS->getType())); in getNegativeSCEV()
335 const SCEV *getUnknownSCEV(ScalarEvolution &SE, Type *Ty) const { in getUnknownSCEV() argument
336 const SCEV *SU = SE.getUnknown(ConstantInt::getSigned(Ty, Quantity)); in getUnknownSCEV()
338 SU = SE.getMulExpr(SU, SE.getVScale(SU->getType())); in getUnknownSCEV()
514 void initialMatch(const SCEV *S, Loop *L, ScalarEvolution &SE);
[all …]
|
| H A D | NaryReassociate.cpp | 175 auto *SE = &getAnalysis<ScalarEvolutionWrapperPass>().getSE(); in runOnFunction() local
179 return Impl.runImpl(F, AC, DT, SE, TLI, TTI); in runOnFunction()
186 auto *SE = &AM.getResult<ScalarEvolutionAnalysis>(F); in run() local
190 if (!runImpl(F, AC, DT, SE, TLI, TTI)) in run()
205 SE = SE_; in runImpl()
237 const SCEV *NewSCEV = SE->getSCEV(NewI); in doOneIteration()
268 DeadInsts, TLI, nullptr, [this](Value *V) { SE->forgetValue(V); }); in doOneIteration()
284 OrigSCEV = SE->getSCEV(I); in matchAndReassociateMinOrMax()
298 if (!SE->isSCEVable(I->getType())) in tryReassociate()
304 OrigSCEV = SE->getSCEV(I); in tryReassociate()
[all …]
|
| H A D | LoopTermFold.cpp | 52 canFoldTermCondOfLoop(Loop *L, ScalarEvolution &SE, DominatorTree &DT, in canFoldTermCondOfLoop() argument
64 if (!SE.hasLoopInvariantBackedgeTakenCount(L)) { in canFoldTermCondOfLoop()
112 if (unsigned SmallTC = SE.getSmallConstantMaxTripCount(L)) in canFoldTermCondOfLoop()
120 const SCEV *BECount = SE.getBackedgeTakenCount(L); in canFoldTermCondOfLoop()
122 SCEVExpander Expander(SE, DL, "lsr_fold_term_cond"); in canFoldTermCondOfLoop()
132 if (!SE.isSCEVable(PN.getType())) { in canFoldTermCondOfLoop()
138 const SCEVAddRecExpr *AddRec = dyn_cast<SCEVAddRecExpr>(SE.getSCEV(&PN)); in canFoldTermCondOfLoop()
157 !SE.isKnownNonZero(AddRec->getStepRecurrence(SE))) in canFoldTermCondOfLoop()
160 const SCEVAddRecExpr *PostInc = AddRec->getPostIncExpr(SE); in canFoldTermCondOfLoop()
161 const SCEV *TermValueSLocal = PostInc->evaluateAtIteration(BECount, SE); in canFoldTermCondOfLoop()
[all …]
|
| H A D | LoopPredication.cpp | 264 ScalarEvolution *SE; member in __anon4970eb7f0111::LoopPredication
323 LoopPredication(AliasAnalysis *AA, DominatorTree *DT, ScalarEvolution *SE, in LoopPredication() argument
325 : AA(AA), DT(DT), SE(SE), LI(LI), MSSAU(MSSAU){}; in LoopPredication()
337 LoopPredication LP(&AR.AA, &AR.DT, &AR.SE, &AR.LI, in run()
353 const SCEV *LHSS = SE->getSCEV(LHS); in parseLoopICmp()
356 const SCEV *RHSS = SE->getSCEV(RHS); in parseLoopICmp()
361 if (SE->isLoopInvariant(LHSS, L)) { in parseLoopICmp()
381 if (SE->isLoopInvariant(LHS, L) && SE->isLoopInvariant(RHS, L)) { in expandCheck()
383 if (SE->isLoopEntryGuardedByCond(L, Pred, LHS, RHS)) in expandCheck()
385 if (SE->isLoopEntryGuardedByCond(L, ICmpInst::getInversePredicate(Pred), in expandCheck()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | LoopCacheAnalysis.cpp | 82 const Loop &L, ScalarEvolution &SE) { in isOneDimensionalArray() argument
91 const SCEV *Step = AR->getStepRecurrence(SE); in isOneDimensionalArray()
96 if (!SE.isLoopInvariant(Start, &L) || !SE.isLoopInvariant(Step, &L)) in isOneDimensionalArray()
99 const SCEV *StepRec = AR->getStepRecurrence(SE); in isOneDimensionalArray()
100 if (StepRec && SE.isKnownNegative(StepRec)) in isOneDimensionalArray()
101 StepRec = SE.getNegativeSCEV(StepRec); in isOneDimensionalArray()
110 ScalarEvolution &SE) { in computeTripCount() argument
111 const SCEV *BackedgeTakenCount = SE.getBackedgeTakenCount(&L); in computeTripCount()
114 ? SE.getTripCountFromExitCount(BackedgeTakenCount) in computeTripCount()
120 TripCount = SE.getConstant(ElemSize.getType(), DefaultTripCount); in computeTripCount()
[all …]
|
| H A D | Delinearization.cpp | 48 ScalarEvolution &SE; member
51 SCEVCollectStrides(ScalarEvolution &SE, SmallVectorImpl<const SCEV *> &S) in SCEVCollectStrides()
52 : SE(SE), Strides(S) {} in SCEVCollectStrides()
56 Strides.push_back(AR->getStepRecurrence(SE)); in follow()
123 ScalarEvolution &SE; member
126 ScalarEvolution &SE) in SCEVCollectAddRecMultiplies()
127 : Terms(T), SE(SE) {} in SCEVCollectAddRecMultiplies()
152 Terms.push_back(SE.getMulExpr(Operands)); in follow()
170 void llvm::collectParametricTerms(ScalarEvolution &SE, const SCEV *Expr, in collectParametricTerms() argument
173 SCEVCollectStrides StrideCollector(SE, Strides); in collectParametricTerms()
[all …]
|
| H A D | DependenceAnalysis.cpp | 130 auto &SE = FAM.getResult<ScalarEvolutionAnalysis>(F); in run() local
132 return DependenceInfo(&F, &AA, &SE, &LI); in run()
156 auto &SE = getAnalysis<ScalarEvolutionWrapperPass>().getSE(); in runOnFunction() local
158 info.reset(new DependenceInfo(&F, &AA, &SE, &LI)); in runOnFunction()
178 ScalarEvolution &SE, bool NormalizeResults) { in dumpExampleDependence() argument
205 if (NormalizeResults && D->normalize(&SE)) in dumpExampleDependence()
322 bool FullDependence::normalize(ScalarEvolution *SE) { in normalize() argument
342 SE->getNegativeSCEV(DV[Level - 1].Distance); in normalize()
448 return SE->getNegativeSCEV(C); in getD()
479 A = SE->getOne(D->getType()); in setDistance()
[all …]
|
| H A D | ScalarEvolutionAliasAnalysis.cpp | 27 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()
69 SE.getPtrToIntExpr(AS, SE.getEffectiveSCEVType(AS->getType())); in alias()
71 SE.getPtrToIntExpr(BS, SE.getEffectiveSCEVType(BS->getType())); in alias()
[all …]
|
| H A D | ScalarEvolutionDivision.cpp | 55 void SCEVDivision::divide(ScalarEvolution &SE, const SCEV *Numerator, in divide() argument
60 SCEVDivision D(SE, Numerator, Denominator); in divide()
88 divide(SE, *Quotient, Op, &Q, &R); in divide()
123 Quotient = SE.getConstant(QuotientVal); in visitConstant()
124 Remainder = SE.getConstant(RemainderVal); in visitConstant()
137 divide(SE, Numerator->getStart(), Denominator, &StartQ, &StartR); in visitAddRecExpr()
138 divide(SE, Numerator->getStepRecurrence(SE), Denominator, &StepQ, &StepR); in visitAddRecExpr()
144 Quotient = SE.getAddRecExpr(StartQ, StepQ, Numerator->getLoop(), in visitAddRecExpr()
146 Remainder = SE.getAddRecExpr(StartR, StepR, Numerator->getLoop(), in visitAddRecExpr()
156 divide(SE, Op, Denominator, &Q, &R); in visitAddExpr()
[all …]
|
| H A D | ScalarEvolutionNormalization.cpp | 40 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()
108 const SCEV *Denormalized = denormalizeForPostIncUse(Normalized, Loops, SE); in normalizeForPostIncUse()
116 ScalarEvolution &SE) { in normalizeForPostIncUseIf() argument
[all …]
|
| H A D | IVUsers.cpp | 38 return IVUsers(&L, &AR.AC, &AR.LI, &AR.DT, &AR.SE); in run()
57 ScalarEvolution *SE, LoopInfo *LI) { in isInteresting() argument
65 SE->getSCEVAtScope(AR, LI->getLoopFor(I->getParent())) != AR); in isInteresting()
69 return isInteresting(AR->getStart(), I, L, SE, LI) && in isInteresting()
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()
156 uint64_t Width = SE->getTypeSizeInBits(I->getType()); in AddUsersIfInteresting()
166 const SCEV *ISE = SE->getSCEV(I); in AddUsersIfInteresting()
170 if (!isInteresting(ISE, I, L, SE, LI)) in AddUsersIfInteresting()
[all …]
|
| H A D | LoopAccessAnalysis.cpp | 171 ScalarEvolution *SE = PSE.getSE(); in replaceSymbolicStrideSCEV() local
172 const SCEV *CT = SE->getOne(StrideSCEV->getType()); in replaceSymbolicStrideSCEV()
173 PSE.addPredicate(*SE->getEqualPredicate(StrideSCEV, CT)); in replaceSymbolicStrideSCEV()
194 ScalarEvolution &SE) { in addSCEVNoOverflow() argument
195 if (!SE.willNotOverflow(Instruction::Add, /*IsSigned=*/false, A, B)) in addSCEVNoOverflow()
197 return SE.getAddExpr(A, B); in addSCEVNoOverflow()
203 ScalarEvolution &SE) { in mulSCEVOverflow() argument
204 if (!SE.willNotOverflow(Instruction::Mul, /*IsSigned=*/false, A, B)) in mulSCEVOverflow()
206 return SE.getMulExpr(A, B); in mulSCEVOverflow()
214 ScalarEvolution &SE, in evaluatePtrAddRecAtMaxBTCWillNotWrap() argument
[all …]
|
| H A D | LoopNestAnalysis.cpp | 36 ScalarEvolution &SE);
42 LoopNest::LoopNest(Loop &Root, ScalarEvolution &SE) in LoopNest() argument
43 : MaxPerfectDepth(getMaxPerfectDepth(Root, SE)) { in LoopNest()
48 ScalarEvolution &SE) { in getLoopNest() argument
49 return std::make_unique<LoopNest>(Root, SE); in getLoopNest()
104 ScalarEvolution &SE) { in arePerfectlyNested() argument
105 return (analyzeLoopNestForPerfectNest(OuterLoop, InnerLoop, SE) == in arePerfectlyNested()
110 const Loop &OuterLoop, const Loop &InnerLoop, ScalarEvolution &SE) { in analyzeLoopNestForPerfectNest() argument
124 if (!checkLoopsStructure(OuterLoop, InnerLoop, SE)) { in analyzeLoopNestForPerfectNest()
130 auto OuterLoopLB = OuterLoop.getBounds(SE); in analyzeLoopNestForPerfectNest()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | LoopConstrainer.cpp | 22 ScalarEvolution &SE) { in isSafeDecreasingBound() argument
27 if (!SE.isAvailableAtLoopEntry(BoundSCEV, L)) in isSafeDecreasingBound()
30 assert(SE.isKnownNegative(Step) && "expecting negative step"); in isSafeDecreasingBound()
45 auto StartLG = SE.applyLoopGuards(Start, L); in isSafeDecreasingBound()
46 auto BoundLG = SE.applyLoopGuards(BoundSCEV, L); in isSafeDecreasingBound()
49 return SE.isLoopEntryGuardedByCond(L, BoundPred, StartLG, BoundLG); in isSafeDecreasingBound()
53 const SCEV *StepPlusOne = SE.getAddExpr(Step, SE.getOne(Step->getType())); in isSafeDecreasingBound()
57 const SCEV *Limit = SE.getMinusSCEV(SE.getConstant(Min), StepPlusOne); in isSafeDecreasingBound()
60 SE.getMinusSCEV(BoundLG, SE.getOne(BoundLG->getType())); in isSafeDecreasingBound()
62 return SE.isLoopEntryGuardedByCond(L, BoundPred, StartLG, MinusOne) && in isSafeDecreasingBound()
[all …]
|
| H A D | ScalarEvolutionExpander.cpp | 145 SE.DT.dominates(cast<Instruction>(Ret), &*BIP)); in ReuseOrCreateCast()
213 assert(SE.getTypeSizeInBits(V->getType()) == SE.getTypeSizeInBits(Ty) && in InsertNoopCastOfTo()
237 SE.getTypeSizeInBits(Ty) == SE.getTypeSizeInBits(V->getType())) { in InsertNoopCastOfTo()
241 SE.getTypeSizeInBits(CI->getType()) == in InsertNoopCastOfTo()
242 SE.getTypeSizeInBits(CI->getOperand(0)->getType())) in InsertNoopCastOfTo()
247 SE.getTypeSizeInBits(CE->getType()) == in InsertNoopCastOfTo()
248 SE.getTypeSizeInBits(CE->getOperand(0)->getType())) in InsertNoopCastOfTo()
307 while (const Loop *L = SE.LI.getLoopFor(Builder.GetInsertBlock())) { in InsertBinop()
360 SE.DT.dominates(cast<Instruction>(V), &*Builder.GetInsertPoint())); in expandAddToGEP()
396 while (const Loop *L = SE.LI.getLoopFor(Builder.GetInsertBlock())) { in expandAddToGEP()
[all …]
|
| H A D | SimplifyIndVar.cpp | 56 ScalarEvolution *SE; member in __anonb324fb7f0111::SimplifyIndvar
66 SimplifyIndvar(Loop *Loop, ScalarEvolution *SE, DominatorTree *DT, in SimplifyIndvar() argument
70 : L(Loop), LI(LI), SE(SE), DT(DT), TTI(TTI), Rewriter(Rewriter), in SimplifyIndvar()
158 assert(SE->isSCEVable(IVSrc->getType()) && "Expect SCEVable IV operand"); in foldIVUser()
170 const SCEV *LHS = SE->getSCEV(IVSrc); in foldIVUser()
171 const SCEV *RHS = SE->getSCEV(D); in foldIVUser()
172 FoldedExpr = SE->getUDivExpr(LHS, RHS); in foldIVUser()
175 if (UseInst->isExact() && LHS != SE->getMulExpr(FoldedExpr, RHS)) in foldIVUser()
179 if (!SE->isSCEVable(UseInst->getType())) in foldIVUser()
183 if (SE->getSCEV(UseInst) != FoldedExpr) in foldIVUser()
[all …]
|
| H A D | LoopPeel.cpp | 332 bool llvm::canPeelLastIteration(const Loop &L, ScalarEvolution &SE) { in canPeelLastIteration() argument
333 const SCEV *BTC = SE.getBackedgeTakenCount(&L); in canPeelLastIteration()
355 SE.isLoopInvariant(SE.getSCEV(Bound), &L) && in canPeelLastIteration()
356 match(SE.getSCEV(Inc), in canPeelLastIteration()
365 const SCEV *RightSCEV, ScalarEvolution &SE, in shouldPeelLastIteration() argument
367 if (!canPeelLastIteration(L, SE)) in shouldPeelLastIteration()
370 const SCEV *BTC = SE.getBackedgeTakenCount(&L); in shouldPeelLastIteration()
371 SCEVExpander Expander(SE, L.getHeader()->getDataLayout(), "loop-peel"); in shouldPeelLastIteration()
372 if (!SE.isKnownNonZero(BTC) && in shouldPeelLastIteration()
377 auto Guards = ScalarEvolution::LoopGuards::collect(&L, SE); in shouldPeelLastIteration()
[all …]
|
| H A D | LCSSA.cpp | 85 ScalarEvolution *SE, in formLCSSAForInstructionsImpl() argument
155 bool HasSCEV = SE && SE->isSCEVable(I->getType()) && in formLCSSAForInstructionsImpl()
156 SE->getExistingSCEV(I) != nullptr; in formLCSSAForInstructionsImpl()
211 SE->getSCEV(PN); in formLCSSAForInstructionsImpl()
327 ScalarEvolution *SE, in formLCSSAForInstructions() argument
332 return formLCSSAForInstructionsImpl(Worklist, DT, LI, SE, PHIsToRemove, in formLCSSAForInstructions()
380 ScalarEvolution *SE, in formLCSSAImpl() argument
436 Changed = formLCSSAForInstructionsImpl(Worklist, DT, *LI, SE, nullptr, in formLCSSAImpl()
445 ScalarEvolution *SE) { in formLCSSA() argument
448 return formLCSSAImpl(L, DT, LI, SE, LoopExitBlocks); in formLCSSA()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/ARM/ |
| H A D | MVETailPredication.cpp | 84 ScalarEvolution *SE = nullptr; member in __anond339c0390111::MVETailPredication
131 SE = &getAnalysis<ScalarEvolutionWrapperPass>().getSE(); in runOnLoop()
206 const SCEV *EC = SE->getSCEV(ElemCount); in IsSafeActiveMask()
207 const SCEV *TC = SE->getSCEV(TripCount); in IsSafeActiveMask()
218 if (!SE->isLoopInvariant(EC, L)) { in IsSafeActiveMask()
229 const SCEV *IVExpr = SE->getSCEV(IV); in IsSafeActiveMask()
293 SE->getSCEV(ConstantInt::get(TripCount->getType(), VectorWidth)); in IsSafeActiveMask()
296 const SCEV *ECPlusVWMinus1 = SE->getAddExpr( in IsSafeActiveMask()
298 SE->getSCEV(ConstantInt::get(TripCount->getType(), VectorWidth - 1))); in IsSafeActiveMask()
301 const SCEV *Ceil = SE->getUDivExpr(ECPlusVWMinus1, VW); in IsSafeActiveMask()
[all …]
|
| /freebsd/contrib/file/magic/Magdir/ |
| H A D | cafebabe | 78 >>4 belong 0x0035 (Java SE 9)
79 >>4 belong 0x0036 (Java SE 10)
80 >>4 belong 0x0037 (Java SE 11)
81 >>4 belong 0x0038 (Java SE 12)
82 >>4 belong 0x0039 (Java SE 13)
83 >>4 belong 0x003A (Java SE 14)
84 >>4 belong 0x003B (Java SE 15)
85 >>4 belong 0x003C (Java SE 16)
86 >>4 belong 0x003D (Java SE 17)
87 >>4 belong 0x003E (Java SE 18)
[all …]
|
| H A D | 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
|