| Commit message (Collapse) | Author | Age | Files | Lines |
| ... | |
| |
|
|
|
|
| |
are loop invariant, not just the start operand.
llvm-svn: 74338
|
| |
|
|
| |
llvm-svn: 74285
|
| |
|
|
|
|
| |
and llvm.dbg.global_variables.
llvm-svn: 74251
|
| |
|
|
|
|
| |
this case, but it should help avoid issues in the future.
llvm-svn: 74178
|
| |
|
|
| |
llvm-svn: 74129
|
| |
|
|
| |
llvm-svn: 74125
|
| |
|
|
| |
llvm-svn: 74120
|
| |
|
|
|
|
|
|
| |
through the GraphViz rendering code.
Update other uses in the codebase for this change.
llvm-svn: 74084
|
| |
|
|
| |
llvm-svn: 74074
|
| |
|
|
|
|
|
|
|
| |
computations in loops with multiple exits.
Adjust the testcase for PR4436 so that the relevant portion isn't
optimized away.
llvm-svn: 74073
|
| |
|
|
|
|
| |
and tidy up a few other formatting issues.
llvm-svn: 74060
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
trip counts in more cases.
Generalize ScalarEvolution's isLoopGuardedByCond code to recognize
And and Or conditions, splitting the code out into an
isNecessaryCond helper function so that it can evaluate Ands and Ors
recursively, and make SCEVExpander be much more aggressive about
hoisting instructions out of loops.
test/CodeGen/X86/pr3495.ll has an additional instruction now, but
it appears to be due to an arbitrary register allocation difference.
llvm-svn: 74048
|
| |
|
|
| |
llvm-svn: 74045
|
| |
|
|
|
|
|
|
|
| |
createSCEV. Also, recognize UndefValue in createSCEV.
Change getIntegerSCEV's comment to avoid mentioning FP types,
and re-implement it in terms of getConstant instead of getUnknown.
llvm-svn: 74041
|
| |
|
|
|
|
|
| |
SCEVConstants. This cleanup is a step toward letting getUnknown
be simpler.
llvm-svn: 74037
|
| |
|
|
| |
llvm-svn: 74035
|
| |
|
|
| |
llvm-svn: 74032
|
| |
|
|
|
|
| |
fact, it is a simple receipe to waste an hour or so.
llvm-svn: 74018
|
| |
|
|
| |
llvm-svn: 74017
|
| |
|
|
|
|
| |
sides is CouldNotCompute, the resulting exact count must be CouldNotCompute.
llvm-svn: 73920
|
| |
|
|
| |
llvm-svn: 73911
|
| |
|
|
| |
llvm-svn: 73910
|
| |
|
|
|
|
| |
conservatively correctly, instead of aborting.
llvm-svn: 73908
|
| |
|
|
| |
llvm-svn: 73907
|
| |
|
|
| |
llvm-svn: 73906
|
| |
|
|
| |
llvm-svn: 73903
|
| |
|
|
|
|
|
|
|
|
|
| |
tables attached to the ScalarEvolution pass.
This also throws out the SCEV reference counting scheme, as the the SCEVs now have a lifetime controlled by the
ScalarEvolution pass.
Note that SCEVHandle is now a no-op, and will be remove in a future commit.
llvm-svn: 73892
|
| |
|
|
|
|
|
|
|
|
|
|
| |
counts for loops with multiple exits, replacing more conservative code
which only handled constants. This is derived from a patch by
Nick Lewycky.
This also fixes llc aborts in ClamAV and others, as
getUMinFromMismatchedTypes takes care of balancing the types before
working with them.
llvm-svn: 73884
|
| |
|
|
| |
llvm-svn: 73883
|
| |
|
|
|
|
| |
helper functions. Based on a patch by Nick Lewycky.
llvm-svn: 73869
|
| |
|
|
|
|
|
|
|
| |
blocks, and also exit blocks with multiple conditions (combined
with (bitwise) ands and ors). It's often infeasible to compute an
exact trip count in such cases, but a useful upper bound can often
be found.
llvm-svn: 73866
|
| |
|
|
| |
llvm-svn: 73865
|
| |
|
|
|
|
|
|
| |
overflow when computing a integer division to round up.
Thanks to Nick Lewycky for noticing this!
llvm-svn: 73862
|
| |
|
|
|
|
|
|
|
|
| |
SCEVUnknowns with identical Instructions to be equal. This allows
it to analze cases such as the attached testcase, where the front-end
has cloned the loop controlling expression. Along with r73805, this
lets IndVarSimplify eliminate all the sign-extend casts in the
loop in the attached testcase.
llvm-svn: 73807
|
| |
|
|
|
|
|
| |
in the loop backedge-taken count computation of the maximum
possible trip count.
llvm-svn: 73805
|
| |
|
|
|
|
|
|
|
|
|
| |
so that it can access the TargetData member (when available) and
use ValueTracking.h information to compute information for
SCEVUnknown Values.
Also add GetMinLeadingZeros and GetMinSignBits functions,
with minimal implementations.
llvm-svn: 73794
|
| |
|
|
|
|
| |
expressions, when interesting.
llvm-svn: 73776
|
| |
|
|
|
|
|
|
| |
expression in IVUsers, because in the case of a use of a non-linear
addrec outside of a loop, this causes the addrec to be evaluated as
a linear addrec.
llvm-svn: 73774
|
| |
|
|
|
|
| |
uniquing tables. No functionality change.
llvm-svn: 73728
|
| |
|
|
|
|
|
| |
comparisons were recognized for umax, but instcombine canonicalizes
unsigned comparisons with zero to this simpler form.
llvm-svn: 73717
|
| |
|
|
|
|
|
|
|
|
|
| |
casted induction variables in cases where the cast
isn't foldable. It ended up being a pessimization in
many cases. This could be fixed, but it would require
a bunch of complicated code in IVUsers' clients. The
advantages of this approach aren't visible enough to
justify it at this time.
llvm-svn: 73706
|
| |
|
|
| |
llvm-svn: 73704
|
| |
|
|
| |
llvm-svn: 73666
|
| |
|
|
|
|
|
| |
If C is a single bit and the and gets analyzed as a truncate and
zero-extend, the xor can be represnted as an add.
llvm-svn: 73664
|
| |
|
|
| |
llvm-svn: 73663
|
| |
|
|
|
|
|
| |
that gets recognized with a SCEVZeroExtendExpr must be an And
with a low-bits mask. With r73540, this is no longer the case.
llvm-svn: 73594
|
| |
|
|
|
|
|
|
| |
obscuring what would otherwise be a low-bits mask. Use ComputeMaskedBits
to compute what ShrinkDemandedConstant knew about to reconstruct a
low-bits mask value.
llvm-svn: 73540
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
failures.
To support this, add some utility functions to Type to help support
vector/scalar-independent code. Change ConstantInt::get and
ConstantFP::get to support vector types, and add an overload to
ConstantInt::get that uses a static IntegerType type, for
convenience.
Introduce a new getConstant method for ScalarEvolution, to simplify
common use cases.
llvm-svn: 73431
|
| |
|
|
| |
llvm-svn: 73401
|
| |
|
|
| |
llvm-svn: 73362
|