1
0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-22 10:42:39 +01:00
llvm-mirror/test/Analysis/ScalarEvolution
Nikita Popov 3c59cf5aa7 [SCEV] Fix applyLoopGuards() with range check idiom (PR51760)
Due to a typo, this replaced %x with umax(C1, umin(C2, %x + C3))
rather than umax(C1, umin(C2, %x)). This didn't make a difference
for the existing tests, because the result is only used for range
calculation, and %x will usually have an unknown starting range,
and the additional offset keeps it unknown. However, if %x already
has a known range, we may compute a result range that is too
small.

(cherry picked from commit 8d54c8a0c3d7d4a50186ae7087780c6082e5bb46)
2021-09-07 22:34:39 -07:00
..
2007-07-15-NegativeStride.ll
2007-08-06-MisinterpretBranch.ll
2007-08-06-Unsigned.ll
2007-09-27-LargeStepping.ll
2007-11-14-SignedAddRec.ll
2007-11-18-OrInstruction.ll
2008-02-11-ReversedCondition.ll
2008-02-12-SMAXTripCount.ll
2008-02-15-UMax.ll
2008-05-25-NegativeStepToZero.ll
2008-06-12-BinomialInt64.ll
2008-07-12-UnneededSelect1.ll
2008-07-12-UnneededSelect2.ll
2008-07-19-InfiniteLoop.ll
2008-07-19-WrappingIV.ll
2008-07-29-SGTTripCount.ll
2008-07-29-SMinExpr.ll
2008-08-04-IVOverflow.ll
2008-08-04-LongAddRec.ll
2008-11-02-QuadraticCrash.ll
2008-11-15-CubicOOM.ll
2008-11-18-LessThanOrEqual.ll
2008-11-18-Stride1.ll
2008-11-18-Stride2.ll
2008-12-08-FiniteSGE.ll
2008-12-11-SMaxOverflow.ll
2008-12-14-StrideAndSigned.ll
2008-12-15-DontUseSDiv.ll
2009-01-02-SignedNegativeStride.ll
2009-04-22-TruncCast.ll
2009-05-09-PointerEdgeCount.ll
2009-07-04-GroupConstantsWidthMismatch.ll
2010-09-03-RequiredTransitive.ll
2011-03-09-ExactNoMaxBECount.ll
2011-04-26-FoldAddRec.ll
2011-10-04-ConstEvolve.ll
2012-03-26-LoadConstant.ll
2012-05-18-LoopPredRecurse.ll
2012-05-29-MulAddRec.ll
abs-intrinsic.ll
add-expr-pointer-operand-sorting.ll
add-like-or.ll
and-xor.ll
ashr.ll
avoid-assume-hang.ll
avoid-infinite-recursion-0.ll
avoid-infinite-recursion-1.ll
avoid-smax-0.ll
avoid-smax-1.ll
binomial-explision.ll
cache_loop_exit_limit.ll
constant_condition.ll
depth-limit-overrun.ll
different-loops-recs.ll
div-overflow.ll
do-loop.ll
exact_iter_count.ll
exact-exit-count-more-precise.ll
exhaustive-trip-counts.ll
exit-count-select.ll
expander-replace-congruent-ivs.ll
exponential-behavior.ll
ext-antecedent.ll
extract-highbits-sameconstmask.ll
extract-highbits-variablemask.ll
extract-lowbits-sameconstmask.ll
extract-lowbits-variablemask.ll
flags-from-poison-dbg.ll
flags-from-poison.ll
flattened-0.ll
fold.ll
guards.ll
how-far-to-zero.ll
huge_expression_limit.ll
implied-via-addition.ll
implied-via-division.ll
incorrect-exit-count.ll
incorrect-nsw.ll
increasing-or-decreasing-iv.ll
infer-prestart-no-wrap.ll
infer-via-ranges.ll
inner-loop-by-latch-cond-unknown.ll
invalidation.ll
latch-dominating-conditions.ll
limit-depth.ll
load-with-range-metadata.ll
load.ll
lshr-shl-differentconstmask.ll
lt-overflow.ll
max-addops-inline.ll
max-addrec-size.ll
max-backedge-taken-count-guard-info.ll [SCEV] Fix applyLoopGuards() with range check idiom (PR51760) 2021-09-07 22:34:39 -07:00
max-backedge-taken-count-limit-by-wrapping.ll
max-be-count-not-constant.ll
max-expr-cache.ll
max-mulops-inline.ll
max-trip-count-address-space.ll
max-trip-count.ll
merge-add-rec-many-inputs.ll
min-max-exprs.ll
minmax-intrinsics.ll
multiple-max-iterations.ll
ne-overflow.ll
no-wrap-add-exprs.ll
no-wrap-symbolic-becount.ll
no-wrap-unknown-becount.ll
non-IV-phi.ll
nowrap-preinc-limits.ll
nsw-offset-assume.ll
nsw-offset.ll
nsw.ll
nw-sub-is-not-nw-add.ll
overflow-intrinsics-trip-count.ll
overflow-intrinsics.ll
pointer-sign-bits.ll
pr3909.ll
pr18606-min-zeros.ll
pr18606.ll
pr22179.ll
pr22641.ll
pr22674.ll
pr22856.ll
pr24757.ll
pr25369.ll
pr27315.ll
pr34538.ll
pr35890.ll
pr40420.ll
pr44605.ll
pr46786.ll
pr48225.ll
pr49856.ll
predicated-trip-count.ll
ptrtoint-constantexpr-loop.ll
ptrtoint.ll
range_nw_flag.ll
range-signedness.ll
ranges.ll
returned.ll
saturating-intrinsics.ll
scalable-vector.ll
scev-aa.ll
scev-canonical-mode.ll
scev-dispositions.ll
scev-expander-existing-value-offset.ll
scev-expander-incorrect-nowrap.ll
scev-expander-reuse-gep.ll
scev-expander-reuse-unroll.ll
scev-expander-reuse-vect.ll
scev-invalid.ll
scev-prestart-nowrap.ll
sdiv.ll
sext-inreg.ll
sext-iv-0.ll
sext-iv-1.ll
sext-iv-2.ll
sext-mul.ll
sext-to-zext.ll
sext-zero.ll
shift-op.ll
shift-recurrences.ll
shl-lshr-differentconstmask.ll
sle.ll
smax-br-phi-idioms.ll
smin-smax-folds.ll
solve-quadratic-i1.ll
solve-quadratic-overflow.ll
solve-quadratic.ll
SolveQuadraticEquation.ll
srem.ll
strip-injective-zext.ll
trip-count2.ll
trip-count3.ll
trip-count4.ll
trip-count5.ll
trip-count6.ll
trip-count7.ll
trip-count8.ll
trip-count9.ll
trip-count10.ll
trip-count11.ll
trip-count12.ll
trip-count13.ll
trip-count14.ll
trip-count15.ll
trip-count-andor-selectform.ll
trip-count-andor.ll
trip-count-negative-stride.ll
trip-count-non-unit-stride.ll
trip-count-pow2.ll
trip-count-switch.ll
trip-count-unknown-stride.ll
trip-count.ll
trip-multiple-guard-info.ll
tripmultiple_calculation.ll
trivial-phis.ll
trunc-simplify.ll
truncate.ll
umin-umax-folds.ll
undefined.ll
unknown_phis.ll
unreachable-code.ll
unsimplified-loop.ll
urem-0.ll
widenable-condition.ll
ZeroStep.ll
zext-divrem.ll
zext-mul.ll
zext-signed-addrec.ll
zext-wrap.ll