| Commit message (Collapse) | Author | Age | Files | Lines |
| |
|
|
|
|
| |
PR4238.
llvm-svn: 72244
|
| |
|
|
|
|
|
|
| |
Instcombine to be more aggressive about using SimplifyDemandedBits
on shift nodes. This allows a shift to be simplified to zero in the
included test case.
llvm-svn: 72204
|
| |
|
|
|
|
|
|
| |
of the comparison is defined inside the loop. This fixes a
use-before-def problem, because the transformation puts a use
of the RHS outside the loop.
llvm-svn: 72149
|
| |
|
|
| |
llvm-svn: 72132
|
| |
|
|
| |
llvm-svn: 72131
|
| |
|
|
| |
llvm-svn: 72130
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
instructions. It attempts to create high-level multi-operand GEPs,
though in cases where this isn't possible it falls back to casting
the pointer to i8* and emitting a GEP with that. Using GEP instructions
instead of ptrtoint+arithmetic+inttoptr helps pointer analyses that
don't use ScalarEvolution, such as BasicAliasAnalysis.
Also, make the AddrModeMatcher more aggressive in handling GEPs.
Previously it assumed that operand 0 of a GEP would require a register
in almost all cases. It now does extra checking and can do more
matching if operand 0 of the GEP is foldable. This fixes a problem
that was exposed by SCEVExpander using GEPs.
llvm-svn: 72093
|
| |
|
|
|
|
| |
avoid ambiguity with the word "use" in IVStrideUse.
llvm-svn: 72012
|
| |
|
|
|
|
| |
adding another copy.
llvm-svn: 71783
|
| |
|
|
| |
llvm-svn: 71775
|
| |
|
|
| |
llvm-svn: 71717
|
| |
|
|
|
|
|
| |
external. These may have address 0 and are not safe
to execute unconditionally.
llvm-svn: 71688
|
| |
|
|
|
|
|
| |
is not known to be nothrow. This allows readnone/readonly functions
to be deleted even if we don't know whether the callee can throw.
llvm-svn: 71676
|
| |
|
|
| |
llvm-svn: 71644
|
| |
|
|
|
|
|
|
|
|
|
| |
without one. Use it where we were using abs on
int64_t objects.
(I strongly suspect the casts to unsigned in the
fragments in LoopStrengthReduce are not doing whatever
the original intent was, but the obvious change to
uint64_t doesn't work. Maybe later.)
llvm-svn: 71612
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
and generalize it so that it can be used by IndVarSimplify. Implement the
base IndVarSimplify transformation code using IVUsers. This removes
TestOrigIVForWrap and associated code, as ScalarEvolution now has enough
builtin overflow detection and folding logic to handle all the same cases,
and more. Run "opt -iv-users -analyze -disable-output" on your favorite
loop for an example of what IVUsers does.
This lets IndVarSimplify eliminate IV casts and compute trip counts in
more cases. Also, this happens to finally fix the remaining testcases
in PR1301.
Now that IndVarSimplify is being more aggressive, it occasionally runs
into the problem where ScalarEvolutionExpander's code for avoiding
duplicate expansions makes it difficult to ensure that all expanded
instructions dominate all the instructions that will use them. As a
temporary measure, IndVarSimplify now uses a FixUsesBeforeDefs function
to fix up instructions inserted by SCEVExpander. Fortunately, this code
is contained, and can be easily removed once a more comprehensive
solution is available.
llvm-svn: 71535
|
| |
|
|
|
|
|
|
| |
postinc iv value. Previously LSR would only optimize those which are in the loop latch block. However, if LSR can prove it is safe (and profitable), it's now possible to change those not in the latch blocks to use postinc values.
Also, if the compare is the only use, LSR would place the iv increment instruction before the compare instead in the latch.
llvm-svn: 71485
|
| |
|
|
|
|
|
|
| |
count down to 0 instead, under very restricted
circumstances. Adjust 4 testcases in which this
optimization fires.
llvm-svn: 71439
|
| |
|
|
|
|
|
| |
will make it more obvious what it represents, and stop
it being confused with the StoreSize.
llvm-svn: 71349
|
| |
|
|
| |
llvm-svn: 71305
|
| |
|
|
|
|
|
|
|
| |
method, fixing a crash on PR4146. While the store will
ultimately overwrite the "padded size" number of bits in memory,
the stored value may be a subset of this size. This function
only wants to handle the case where all bits are stored.
llvm-svn: 71224
|
| |
|
|
|
|
| |
preparation for the day we use null TargetData when no target is specified.
llvm-svn: 71210
|
| |
|
|
| |
llvm-svn: 71199
|
| |
|
|
|
|
| |
types, such as loads and calls.
llvm-svn: 71175
|
| |
|
|
| |
llvm-svn: 71091
|
| |
|
|
| |
llvm-svn: 71090
|
| |
|
|
|
|
| |
separate back() and pop_back() calls.
llvm-svn: 71089
|
| |
|
|
|
|
|
|
| |
the readnone. Since MallocInst is scheduled for deletion
it doesn't seem worth doing anything more subtle, such as
having mayWriteToMemory return true for MallocInst.
llvm-svn: 71077
|
| |
|
|
|
|
|
|
| |
the optimizers about this. For example, a readonly
function with no uses cannot be removed unless it is
also marked nounwind.
llvm-svn: 71071
|
| |
|
|
| |
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
|
| |
|
|
| |
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: 70872
|
| |
|
|
|
|
|
|
|
|
| |
ThreadEdge directly. This shares the code, but is just a refactoring.
* Make JumpThreading compute the set of loop headers and avoid threading
across them. This prevents jump threading from forming irreducible
loops (goodness) but also prevents it from threading in other cases that
are beneficial (see the comment above FindFunctionBackedges).
llvm-svn: 70820
|
| |
|
|
|
|
| |
FindFunctionBackedges function.
llvm-svn: 70819
|
| |
|
|
| |
llvm-svn: 70661
|
| |
|
|
|
|
| |
them to bool.
llvm-svn: 70653
|
| |
|
|
|
|
|
|
|
| |
makes ScalarEvolution::deleteValueFromRecords, and it's code that
subtly needed to be called before ReplaceAllUsesWith, unnecessary.
It also makes ValueDeletionListener unnecessary.
llvm-svn: 70645
|
| |
|
|
|
|
| |
a default value, and will hopefully be going away soon.
llvm-svn: 70642
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
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
|
| |
|
|
|
|
|
| |
deleting it. This will let ScalarEvolution be more complete about
updating its records.
llvm-svn: 70632
|
| |
|
|
| |
llvm-svn: 70630
|
| |
|
|
|
|
|
|
|
|
|
|
|
| |
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
|