RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-25 20:23:11 +01:00
Code Issues Projects Releases Wiki Activity
60,963 Commits 4 Branches 5 Tags 704 MiB
a6c568fa77
Commit Graph

476 Commits

Author SHA1 Message Date
Dan Gohman
5c61a913b2 Use the SCEVAddRecExpr::getPostIncExpr utility function instead 
of doing the same thing manually.

llvm-svn: 102997
 2010-05-04 01:12:27 +00:00
Dan Gohman
4e1dbacdf8 Fix a copy+pasto. 
llvm-svn: 102996
 2010-05-04 01:11:15 +00:00
Dan Gohman
2f27d59870 Use getConstant instead of getIntegerSCEV. The two are basically the 
same, now that getConstant has overloads consistent with ConstantInt::get.

llvm-svn: 102965
 2010-05-03 22:09:21 +00:00
Dan Gohman
66c6519877 Silence warnings about -1 being converted to an unsigned value. 
Also, pass true for isSigned even when creating constants for unsigned
comparisons, because the point is to create an all-ones constant,
rather than UINT64_MAX, even for integers wider than 64 bits.

llvm-svn: 102946
 2010-05-03 20:23:47 +00:00
Dan Gohman
51faf74c7d Use isTrueWhenEqual and isFalseWhenEqual instead of assuming that 
SimplifyICmpOperands will simplify such cases to EQ or NE. This makes
the correcntess of the code independent on SimplifyICmpOperands doing
certain simplifications.

llvm-svn: 102927
 2010-05-03 18:00:24 +00:00
Dan Gohman
b4fdc7ea81 In ScalarEvolution::print, don't bother printing out the SCEVs for 
comparison instructions, since they aren't interesting, despite having
integer result types.

llvm-svn: 102925
 2010-05-03 17:03:23 +00:00
Dan Gohman
043875bc90 In SimplifyICmpOperands, avoid needlessly swapping the operands in the 
case where both are addrecs in unrelated loops.

llvm-svn: 102924
 2010-05-03 17:00:11 +00:00
Dan Gohman
02c26ed601 Factor out the new <= and >= analysis code into SimplifyICmpOperands. 
llvm-svn: 102922
 2010-05-03 16:35:17 +00:00
Dan Gohman
116829ede7 Set isSigned to true when creating an all-ones integer constant, even 
for unsigned purposes, so >64-bit integer values get a full all-ones
value.

llvm-svn: 102739
 2010-04-30 19:22:39 +00:00
Dan Gohman
3c454a3df0 Silence compiler warnings. 
llvm-svn: 102734
 2010-04-30 19:21:13 +00:00
Dan Gohman
231fe284cd ScalarEvolution support for <= and >= loops. 
Also, generalize ScalarEvolutions's min and max recognition to handle
some new forms of min and max that this change makes more common.

llvm-svn: 102234
 2010-04-24 03:09:42 +00:00
Dan Gohman
bae847c4c6 Use SimplifyICmpOperands in isKnownPredicate too. 
llvm-svn: 102233
 2010-04-24 01:38:36 +00:00
Dan Gohman
815586b78c Update isImpliedCond to use the new SimplifyICmpOperands utility. 
llvm-svn: 102232
 2010-04-24 01:34:53 +00:00
Dan Gohman
0fbfae5efe Add a new utility function SimplifyICmpOperands. Much of this code is 
refactored out of ScalarEvolution::isImpliedCond, which will be updated
to use this new utility routine soon.

llvm-svn: 102229
 2010-04-24 01:28:42 +00:00
Dan Gohman
4196c77b3b When it doesn't matter whether zero or sign extension is used, 
use ScalarEvolutions "any" extend function.

llvm-svn: 102156
 2010-04-23 01:51:29 +00:00
Dan Gohman
31d6b29bae Don't attempt to analyze values which are obviously undef. This fixes some 
assertion failures in extreme cases.

llvm-svn: 102042
 2010-04-22 01:35:11 +00:00
Dan Gohman
4ca879bebb Make ScalarEvolution::getConstant support pointer types, for consistency 
with ScalarEvolution's overall approach to pointer types.

llvm-svn: 102003
 2010-04-21 16:04:04 +00:00
Dan Gohman
2d575a91e0 Fix SCEVCommutativeExpr::print to be robust in the case of improper 
expression canonicalization. Its job is to print what's there, not to
make judgements about it.

llvm-svn: 101461
 2010-04-16 15:03:25 +00:00
Dan Gohman
034c0f7354 Make getPredecessorWithUniqueSuccessorForBB return the unique successor 
in addition to the predecessor.

llvm-svn: 101374
 2010-04-15 16:19:08 +00:00
Dan Gohman
a71d62f6e4 Add a comment. 
llvm-svn: 101248
 2010-04-14 16:08:56 +00:00
Dan Gohman
1521831bff Teach ScalarEvolution to simplify smax and umax when it can prove 
that one operand is always greater than another.

llvm-svn: 101142
 2010-04-13 16:51:03 +00:00
Dan Gohman
298e7410d6 Minor code micro-optimizations. 
llvm-svn: 101141
 2010-04-13 16:49:23 +00:00
Dan Gohman
2b5e134433 Micro-optimize a few hot spots. 
llvm-svn: 101086
 2010-04-12 23:08:18 +00:00
Dan Gohman
ece51fc413 Add fast paths to ScalarEvolution::getSizeOf and getOffsetOf, as 
they're used a lot by getNodeForGEP, which can be called a lot.
This speeds up -iv-users by around 15% on several testcases.

llvm-svn: 101083
 2010-04-12 23:03:26 +00:00
Dan Gohman
e87da8a25d Generalize ScalarEvolution's PHI analysis to handle loops that don't 
have preheaders or dedicated exit blocks, as clients may not otherwise
need to run LoopSimplify.

llvm-svn: 101030
 2010-04-12 07:49:36 +00:00
Dan Gohman
eee8b53fdb Rewrite the overflow checking in the get{Signed,Unsigned}Range code for 
AddRecs so that it checks for overflow in the computation that it is
performing, rather than just checking hasNo{Signed,Unsigned}Wrap, since
those flags are for a different computation. This fixes a bug that
impacts an upcoming change.

llvm-svn: 101028
 2010-04-12 07:39:33 +00:00
Dan Gohman
3bf0040d05 Fix indentation. 
llvm-svn: 101001
 2010-04-11 23:44:58 +00:00
Dan Gohman
ff456e3f4d Enhance ScalarEvolution::isKnownPredicate with support for 
loop conditions which are invariants.

llvm-svn: 100995
 2010-04-11 22:16:48 +00:00
Dan Gohman
f73ed98d56 Minor code simplification. 
llvm-svn: 100994
 2010-04-11 22:13:11 +00:00
Dan Gohman
07d134b751 When creating a ConstantRange for [n,UINT_MAX], special case n == 0, because 
ConstantRange(0, 0) creates an empty range rather than a full one.

llvm-svn: 100993
 2010-04-11 22:12:18 +00:00
Dan Gohman
9ca5efece4 Rename isLoopGuardedByCond to isLoopEntryGuardedByCond, to emphasise 
that it's only testing for the entry condition, not full loop-invariant
conditions.

llvm-svn: 100979
 2010-04-11 19:27:13 +00:00
Dan Gohman
127f5c53e1 Add variants of ult, ule, etc. which take a uint64_t RHS, for convenience. 
llvm-svn: 100824
 2010-04-08 23:03:40 +00:00
Dan Gohman
bd878ac80b Revert this change from a while ago; ScalarEvolution shouldn't analyze 
undef as 0, since it can't force other analyses to intepret the undef
in the same way.

llvm-svn: 100749
 2010-04-08 05:58:24 +00:00
Dan Gohman
ff37afdc4b Define placement new wrappers for BumpPtrAllocator and 
RecyclingAllocator to allow client code to be simpler, and
simplify several clients.

llvm-svn: 98847
 2010-03-18 18:49:47 +00:00
Dan Gohman
8f98d70a9b Add the ability to "intern" FoldingSetNodeID data into a 
BumpPtrAllocator-allocated region to allow it to be stored in a more
compact form and to avoid the need for a non-trivial destructor call.

Use this new mechanism in ScalarEvolution instead of
FastFoldingSetNode to avoid leaking memory in the case where a
FoldingSetNodeID uses heap storage, and to reduce overall memory
usage.

llvm-svn: 98829
 2010-03-18 16:16:38 +00:00
Dan Gohman
69cd222c14 Reapply r98755 with a thinko which miscompiled gengtype fixed. 
llvm-svn: 98793
 2010-03-18 01:17:13 +00:00
Dan Gohman
f9a688a249 Revert 98755, which may be causing trouble. 
llvm-svn: 98762
 2010-03-17 19:54:53 +00:00
Dan Gohman
d90131eff2 Change SCEVNAryExpr's operand array from a SmallVector to a plain 
pointer and length, and allocate the arrays in ScalarEvolution's
BumpPtrAllocator, so that they get released when their owning
SCEV gets released. SCEVs are immutable, so they don't need to worry
about operand array resizing. This fixes a memory leak reported
in PR6637.

llvm-svn: 98755
 2010-03-17 18:51:01 +00:00
Dan Gohman
a722142044 Avoid analyzing instructions in blocks not reachable from the entry block. 
They are lots of trouble, and they don't matter. This fixes PR6559.

llvm-svn: 98103
 2010-03-09 23:46:50 +00:00
Dan Gohman
c08c48c9f3 Spelling fixes. 
llvm-svn: 97453
 2010-03-01 17:49:51 +00:00
Dan Gohman
52ed61204b Make LoopSimplify change conditional branches in loop exiting blocks 
which branch on undef to branch on a boolean constant for the edge
exiting the loop. This helps ScalarEvolution compute trip counts for
loops.

Teach ScalarEvolution to recognize single-value PHIs, when safe, and
ForgetSymbolicName to forget such single-value PHI nodes as apprpriate
in ForgetSymbolicName.

llvm-svn: 97126
 2010-02-25 06:57:05 +00:00
Dan Gohman
4d65bd9c6a ConstantFoldInstOperands can theoretically return null if it 
didn't fold anything.

llvm-svn: 97049
 2010-02-24 19:31:47 +00:00
Dan Gohman
fa19b098dc Simplify this code; these casts aren't necessary. 
llvm-svn: 97048
 2010-02-24 19:31:06 +00:00
Dan Gohman
6aacf4728c Convert a few more backedge-taken count functions to use BackedgeTakenInfo. 
llvm-svn: 97042
 2010-02-24 17:31:30 +00:00
Dan Gohman
2575392bf1 Remove unused variables and parameters. 
llvm-svn: 96780
 2010-02-22 04:11:59 +00:00
Dan Gohman
39b7e5961e Add a comment. 
llvm-svn: 96688
 2010-02-19 18:49:22 +00:00
Dan Gohman
9268d67079 Teach ScalarEvolution how to compute a tripcount for a loop with 
true or false as its exit condition. These are usually eliminated by
SimplifyCFG, but the may be left around during a pass which wishes
to preserve the CFG.

llvm-svn: 96683
 2010-02-19 18:12:07 +00:00
Dale Johannesen
0f58c73229 recommit 96626, evidence that it broke things appears 
to be spurious

llvm-svn: 96662
 2010-02-19 07:14:22 +00:00
Dale Johannesen
d73b81bf12 Revert 96626, which causes build failure on ppc Darwin. 
llvm-svn: 96653
 2010-02-19 01:54:37 +00:00
Dan Gohman
2f0615ee5e Indvars needs to explicitly notify ScalarEvolution when it is replacing 
a loop exit value, so that if a loop gets deleted, ScalarEvolution
isn't stick holding on to dangling SCEVAddRecExprs for that loop. This
fixes PR6339.

llvm-svn: 96626
 2010-02-18 23:26:33 +00:00