Keno Fischer ca6b59008b [SCEV] Add explicit representations of umin/smin ... Summary: Currently we express umin as `~umax(~x, ~y)`. However, this becomes a problem for operands in non-integral pointer spaces, because `~x` is not something we can compute for `x` non-integral. However, since comparisons are generally still allowed, we are actually able to express `umin(x, y)` directly as long as we don't try to express is as a umax. Support this by adding an explicit umin/smin representation to SCEV. We do this by factoring the existing getUMax/getSMax functions into a new function that does all four. The previous two functions were largely identical. Reviewed By: sanjoy Differential Revision: https://reviews.llvm.org/D50167 llvm-svn: 360159		2019-05-07 15:28:47 +00: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	[SCEV] Add explicit representations of umin/smin	2019-05-07 15:28:47 +00:00
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
and-xor.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
different-loops-recs.ll
div-overflow.ll
do-loop.ll
exact_iter_count.ll
exact-exit-count-more-precise.ll	[SCEV] Handle case where MaxBECount is less precise than ExactBECount for OR.	2019-03-02 02:31:44 +00:00
exhaustive-trip-counts.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	[SCEV] Prohibit SCEV transformations for huge SCEVs	2019-01-31 06:19:25 +00:00
implied-via-addition.ll
implied-via-division.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	[SCEV] Use depth limit for trunc analysis	2019-03-12 18:28:05 +00:00
load-with-range-metadata.ll
load.ll
lshr-shl-differentconstmask.ll
max-addops-inline.ll
max-addrec-size.ll
max-be-count-not-constant.ll
max-expr-cache.ll	[SCEV] Add explicit representations of umin/smin	2019-05-07 15:28:47 +00:00
max-mulops-inline.ll
max-trip-count-address-space.ll
max-trip-count.ll
merge-add-rec-many-inputs.ll
min-max-exprs.ll	[SCEV] Add explicit representations of umin/smin	2019-05-07 15:28:47 +00:00
no-wrap-add-exprs.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.ll
pointer-sign-bits.ll
pr3909.ll
pr18606-min-zeros.ll	Fixed typos in tests: s/CEHCK/CHECK/	2019-02-25 13:12:33 +00:00
pr18606.ll	Fixed typos in tests: s/CEHCK/CHECK/	2019-02-25 13:12:33 +00:00
pr22179.ll
pr22641.ll
pr22674.ll
pr22856.ll
pr24757.ll
pr25369.ll
pr27315.ll
pr28705.ll	Return "[IndVars] Smart hard uses detection"	2018-11-08 11:54:35 +00:00
pr34538.ll
pr35890.ll
pr40420.ll	[SCEV] Take correct loop in AddRec simplification. PR40420	2019-01-29 05:37:59 +00:00
predicated-trip-count.ll	[SCEV] Add explicit representations of umin/smin	2019-05-07 15:28:47 +00:00
range-signedness.ll
returned.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
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
shl-lshr-differentconstmask.ll
sle.ll
smax-br-phi-idioms.ll
smax.ll
solve-quadratic-i1.ll
solve-quadratic-overflow.ll
solve-quadratic.ll	[test] Fix ScalarEvolution test to allow __func__ with prototype	2018-12-02 16:49:28 +00:00
SolveQuadraticEquation.ll
strip-injective-zext.ll
trip-count2.ll
trip-count3.ll	[SCEV] Add explicit representations of umin/smin	2019-05-07 15:28:47 +00:00
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	[SCEV] Add explicit representations of umin/smin	2019-05-07 15:28:47 +00:00
trip-count-pow2.ll
trip-count-switch.ll
trip-count-unknown-stride.ll
trip-count.ll
tripmultiple_calculation.ll
trunc-simplify.ll
truncate.ll
undefined.ll
unknown_phis.ll
unreachable-code.ll	[SCEV] Do not bother creating separate SCEVUnknown for unreachable nodes	2019-02-04 05:04:19 +00:00
unsimplified-loop.ll
urem-0.ll
ZeroStep.ll
zext-divrem.ll
zext-mul.ll
zext-signed-addrec.ll
zext-wrap.ll