llvm-svn: 71091

Make sure to use signed arithmetic in APInt to fix a regression.

llvm-svn: 71090

llvm-svn: 71035

llvm-svn: 71033

Running /Volumes/Sandbox/Buildbot/llvm/full-llvm/build/llvm.src/test/
CodeGen/X86/dg.exp ...
FAIL: /Volumes/Sandbox/Buildbot/llvm/full-llvm/build/llvm.src/test/
CodeGen/X86/change-compare-stride-1.ll
Failed with exit(1) at line 2
while running: grep {cmpq       $-478,} change-compare-stride-1.ll.tmp
child process exited abnormally

llvm-svn: 71013

Handle overflow of 64-bit loop conditions.

llvm-svn: 71008

CallbackVH, with fixes. allUsesReplacedWith need to
walk the def-use chains and invalidate all users of a
value that is replaced. SCEVs of users need to be
recalcualted even if the new value is equivalent. Also,
make forgetLoopPHIs walk def-use chains, since any
SCEV that depends on a PHI should be recalculated when
more information about that PHI becomes available.

llvm-svn: 70927

llvm-svn: 70919

llvm-svn: 70661

makes ScalarEvolution::deleteValueFromRecords, and it's code that
subtly needed to be called before ReplaceAllUsesWith, unnecessary.

It also makes ValueDeletionListener unnecessary.

llvm-svn: 70645

of returning a list of pointers to Values that are deleted. This was
unsafe, because the pointers in the list are, by nature of what
RecursivelyDeleteDeadInstructions does, always dangling. Replace this
with a simple callback mechanism. This may eventually be removed if
all clients can reasonably be expected to use CallbackVH.

Use this to factor out the dead-phi-cycle-elimination code from LSR
utility function, and generalize it to use the
RecursivelyDeleteTriviallyDeadInstructions utility function.

This makes LSR more aggressive about eliminating dead PHI cycles;
adjust tests to either be less trivial or to simply expect fewer
instructions.

llvm-svn: 70636

of LSR. This makes the AddUsersIfInteresting phase of LSR a pure
analysis instead of a phase that potentially does CFG modifications.

The conditions where this code would actually perform a split are
rare, and in the cases where it actually would do a split the split
is usually undone by CodeGenPrepare, and in cases where splits
actually survive into codegen, they appear to hurt more often than
they help.

llvm-svn: 70625

target hooks canLosslesslyBitCastTo and isTruncateFree. This allows
targets to avoid worrying about handling all combinations of integer
and pointer types.

llvm-svn: 70555

llvm-svn: 70551

llvm-svn: 70546

llvm-svn: 70427

between the comparison's iv stride and the candidate stride is
exactly -1.

llvm-svn: 70244

and SCEVSignExtendExpr.

llvm-svn: 69649

the code to minimize dependencies on TargetData.

llvm-svn: 69644

llvm-svn: 69450

regression in 403.gcc in PIC_CODEGEN=1 and DISABLE_LTO=1
mode.

llvm-svn: 69344

to get the correct answer for pointer types.

llvm-svn: 69321

targets with pointers larger than 64 bits, due to the code not
yet being APInt clean.

llvm-svn: 69296

optimizer, which just happen to frequently involve optimizing GEPs.

llvm-svn: 69295

since the operand is always a constant.

llvm-svn: 69291

new instruction with SCEVExpander::InsertCastOfTo.

llvm-svn: 69290

have pointer types, though in contrast to C pointer types, SCEV
addition is never implicitly scaled. This not only eliminates the
need for special code like IndVars' EliminatePointerRecurrence
and LSR's own GEP expansion code, it also does a better job because
it lets the normal optimizations handle pointer expressions just
like integer expressions.

Also, since LLVM IR GEPs can't directly index into multi-dimensional
VLAs, moving the GEP analysis out of client code and into the SCEV
framework makes it easier for clients to handle multi-dimensional
VLAs the same way as other arrays.

Some existing regression tests show improved optimization.
test/CodeGen/ARM/2007-03-13-InstrSched.ll in particular improved to
the point where if-conversion started kicking in; I turned it off
for this test to preserve the intent of the test.

llvm-svn: 69258

it is not APInt clean, but even when it is it needs to be evaluated carefully
to determine whether it is actually profitable.

This fixes a crash on PR3806

llvm-svn: 67134

if needed. This simplifies the code a little, and is needed for an
upcoming refactoring.

llvm-svn: 66479

where memory access types are needed.

llvm-svn: 66470

llvm-svn: 66469

llvm-svn: 66467

Use VoidTy instead, to be properly conservative.

llvm-svn: 66463

of an instruction into a helper function.

llvm-svn: 66460

have to be done twice.

llvm-svn: 66449

llvm-svn: 66446

before it does any processing.

llvm-svn: 66443

llvm-svn: 66065

immediately obvious.

llvm-svn: 66062

to more accurately describe what it does. Expand its doxygen comment
to describe what the backedge-taken count is and how it differs
from the actual iteration count of the loop. Adjust names and
comments in associated code accordingly.

llvm-svn: 65382