llvm-svn: 100824

ensure that the expansion is dominated by the increments of those loops.

llvm-svn: 100748

explicitly split into stride-and-offset pairs. Also, add the
ability to track multiple post-increment loops on the same expression.

This refines the concept of "normalizing" SCEV expressions used for
to post-increment uses, and introduces a dedicated utility routine for
normalizing and denormalizing expressions.

This fixes the expansion of expressions which are post-increment users
of more than one loop at a time. More broadly, this takes LSR another
step closer to being able to reason about more than one loop at a time.

llvm-svn: 100699

llvm-svn: 99580

llvm-svn: 99564

of loops.

llvm-svn: 97642

emitted after the increment. Make sure the insert position
reflects this. This fixes PR6453.

llvm-svn: 97537

llvm-svn: 97453

llvm-svn: 96780

induction variable value and a loop-variant value, don't force the
insert position to be at the post-increment position, because it may
not be dominated by the loop-variant value. This fixes a
use-before-def problem noticed on PPC.

llvm-svn: 96774

the division would have a remainder.

llvm-svn: 96693

scaled reuse.

llvm-svn: 96692

strides in foreign loops. This helps locate reuse opportunities
with existing induction variables in foreign loops and reduces
the need for inserting new ones. This fixes rdar://7657764.

llvm-svn: 96629

llvm-svn: 96429

have overflowed.

llvm-svn: 96428

llvm-svn: 96382

llvm-svn: 96372

and T->isPointerTy().  Convert most instances of the first form to the second form.
Requested by Chris.

llvm-svn: 96344

as it also peeks at which registers are being used by other uses. This
makes LSR less sensitive to use-list order.

llvm-svn: 96308

llvm-svn: 96179

llvm-svn: 96178

with multiplication by constants distributed through, occasionally
those subexpressions can include both x and -x. For now, if this
condition is discovered within LSR, just prune such cases away,
as they won't be profitable. This fixes a "zero allocated in a
base register" assertion failure.

llvm-svn: 96177

the no-TLI case. But it should still default to declining the
transformation.

llvm-svn: 96152

because profitability can't be sufficiently approximated.

llvm-svn: 96148

from opt.

llvm-svn: 96135

deterministically sorted.

llvm-svn: 96071

llvm-svn: 96005

offset distributions it doesn't expect.

llvm-svn: 96002

is breaking llvm-gcc bootstrap.

llvm-svn: 95988

doesn't matter, except that ScalarEvolution tends to need less time
to fold the results this way.

llvm-svn: 95979

bug fixes, and with improved heuristics for analyzing foreign-loop
addrecs.

This change also flattens IVUsers, eliminating the stride-oriented
groupings, which makes it easier to work with.

llvm-svn: 95975

llvm-svn: 94771

llvm-svn: 94765

llvm-svn: 94123

loop-variant components, adds must be inserted after the increment.
Keep track of the increment position for this case, and insert
these adds in the correct location.

llvm-svn: 94110

llvm-svn: 94108

operands exceeds the number of registers used in the initial
solution, as that wouldn't lead to a profitable solution anyway.

llvm-svn: 94107

llvm-svn: 94104

This new version is much more aggressive about doing "full" reduction in
cases where it reduces register pressure, and also more aggressive about
rewriting induction variables to count down (or up) to zero when doing so
reduces register pressure.

It currently uses fairly simplistic algorithms for finding reuse
opportunities, but it introduces a new framework allows it to combine
multiple strategies at once to form hybrid solutions, instead of doing
all full-reduction or all base+index.

llvm-svn: 94061

llvm-svn: 92735