RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-23 21:13:02 +02:00
Code Issues Projects Releases Wiki Activity
85,220 Commits 4 Branches 5 Tags 704 MiB
1c5e7904de
Commit Graph

183 Commits

Author SHA1 Message Date
Sylvestre Ledru
1c5e7904de Fix a typo 'iff' => 'if' 
llvm-svn: 164767
 2012-09-27 09:59:43 +00:00
Craig Topper
1d55f3f906 Mark unimplemented copy constructors and copy assignment operators as LLVM_DELETED_FUNCTION. 
llvm-svn: 164015
 2012-09-17 06:43:55 +00:00
Benjamin Kramer
3578c169bf Teach SCEV's icmp simplification logic that a-b == 0 is equivalent to a == b. 
This also required making recursive simplifications until
nothing changes or a hard limit (currently 3) is hit.

With the simplification in place indvars can canonicalize
loops of the form
for (unsigned i = 0; i < a-b; ++i)
into
for (unsigned i = 0; i != a-b; ++i)
which used to fail because SCEV created a weird umax expr
for the backedge taken count.

llvm-svn: 157701
 2012-05-30 18:32:23 +00:00
Andrew Trick
c3765e6af0 SCEV: Add MarkPendingLoopPredicates to avoid recursive isImpliedCond. 
getUDivExpr attempts to simplify by checking for overflow.
isLoopEntryGuardedByCond then evaluates the loop predicate which
may lead to the same getUDivExpr causing endless recursion.

Fixes PR12868: clang 3.2 segmentation fault.

llvm-svn: 157092
 2012-05-19 00:48:25 +00:00
Benjamin Kramer
c1e98c85e2 FoldingSet: Push the hash through FoldingSetTraits::Equals, so clients can use it. 
llvm-svn: 154496
 2012-04-11 14:06:47 +00:00
Andrew Trick
1454836d05 Clarified the SCEV getSmallConstantTripCount interface with in-your-face comments. 
This interface is misleading and dangerous, but it is actually what we need for unrolling.

llvm-svn: 147926
 2012-01-11 06:52:55 +00:00
Andrew Trick
60f6beef61 Expose isNonConstantNegative to users of ScalarEvolution. 
llvm-svn: 147700
 2012-01-07 00:27:31 +00:00
Chad Rosier
49a66381f7 Propagate TargetLibraryInfo throughout ConstantFolding.cpp and 
InstructionSimplify.cpp.  Other fixups as needed.
Part of rdar://10500969

llvm-svn: 145559
 2011-12-01 03:08:23 +00:00
Nick Lewycky
6833d72fc0 The product of two chrec's can always be represented as a chrec. 
llvm-svn: 141066
 2011-10-04 06:51:26 +00:00
Andrew Trick
43d88c3879 Comment and clarifying assert. 
llvm-svn: 139036
 2011-09-02 21:20:46 +00:00
Andrew Trick
5a5a5ebe68 Allow loop unrolling to get known trip counts from ScalarEvolution. 
SCEV unrolling can unroll loops with arbitrary induction variables. It
is a prerequisite for -disable-iv-rewrite performance. It is also
easily handles loops of arbitrary structure including multiple exits
and is generally more robust.

This is under a temporary option to avoid affecting default
behavior for the next couple of weeks. It is needed so that I can
checkin unit tests for updateUnloop.

llvm-svn: 137384
 2011-08-11 23:36:16 +00:00
Andrew Trick
bbb5c7b0aa SCEV: Use AssertingVH to catch dangling BasicBlock* when passes forget 
to notify SCEV of a change. Add forgetLoop in a couple of those places.

llvm-svn: 136797
 2011-08-03 18:32:11 +00:00
Andrew Trick
86f6a3c645 Use consistent terminology for loop exit/exiting blocks. Name change only. 
llvm-svn: 136677
 2011-08-02 04:23:35 +00:00
Andrew Trick
ae93f1bf46 SCEV: Added a data structure for storing not-taken info per loop 
exit. Added an interfaces for querying either the loop's exact/max
backedge taken count or a specific loop exit's not-taken count.

llvm-svn: 136100
 2011-07-26 17:19:55 +00:00
Chris Lattner
e1fe7061ce land David Blaikie's patch to de-constify Type, with a few tweaks. 
llvm-svn: 135375
 2011-07-18 04:54:35 +00:00
Dan Gohman
392ab7a6ba Change a few std::maps to DenseMaps. 
llvm-svn: 131088
 2011-05-09 18:44:09 +00:00
Jay Foad
0d5ca4cf44 Don't include Operator.h from InstrTypes.h. 
llvm-svn: 129271
 2011-04-11 09:35:34 +00:00
Andrew Trick
07887af00c Added isValidRewrite() to check the result of ScalarEvolutionExpander. 
SCEV may generate expressions composed of multiple pointers, which can
lead to invalid GEP expansion. Until we can teach SCEV to follow strict
pointer rules, make sure no bad GEPs creep into IR.
Fixes rdar://problem/9038671.

llvm-svn: 127839
 2011-03-17 23:51:11 +00:00
Andrew Trick
5d45b563c5 Added SCEV::NoWrapFlags to manage unsigned, signed, and self wrap 
properties.
Added the self-wrap flag for SCEV::AddRecExpr.
A slew of temporary FIXMEs indicate the intention of the no-self-wrap flag
without changing behavior in this revision.

llvm-svn: 127590
 2011-03-14 16:50:06 +00:00
Chris Lattner
8c0a70a30c some comment improvements. 
llvm-svn: 123243
 2011-01-11 17:11:59 +00:00
Chris Lattner
b6a67a9068 Step #2 to improve trip count analysis for loops like this: 
void f(int* begin, int* end) { std::fill(begin, end, 0); }

which turns into a != exit expression where one pointer is
strided and (thanks to step #1) known to not overflow, and 
the other is loop invariant.

The observation here is that, though the IV is strided by
4 in this case, that the IV *has* to become equal to the
end value.  It cannot "miss" the end value by stepping over
it, because if it did, the strided IV expression would
eventually wrap around.

Handle this by turning A != B into "A-B != 0" where the A-B
part is known to be NUW.

llvm-svn: 123131
 2011-01-09 22:26:35 +00:00
Chris Lattner
d4daf9f002 implement enough of the memset inference algorithm to recognize and insert 
memsets.  This is still missing one important validity check, but this is enough
to compile stuff like this:

void test0(std::vector<char> &X) {
  for (std::vector<char>::iterator I = X.begin(), E = X.end(); I != E; ++I)
    *I = 0;
}

void test1(std::vector<int> &X) {
  for (long i = 0, e = X.size(); i != e; ++i)
    X[i] = 0x01010101;
}

With:
 $ clang t.cpp -S -o - -O2 -emit-llvm | opt -loop-idiom | opt -O3 | llc 

to:

__Z5test0RSt6vectorIcSaIcEE:            ## @_Z5test0RSt6vectorIcSaIcEE
## BB#0:                                ## %entry
	subq	$8, %rsp
	movq	(%rdi), %rax
	movq	8(%rdi), %rsi
	cmpq	%rsi, %rax
	je	LBB0_2
## BB#1:                                ## %bb.nph
	subq	%rax, %rsi
	movq	%rax, %rdi
	callq	___bzero
LBB0_2:                                 ## %for.end
	addq	$8, %rsp
	ret
...
__Z5test1RSt6vectorIiSaIiEE:            ## @_Z5test1RSt6vectorIiSaIiEE
## BB#0:                                ## %entry
	subq	$8, %rsp
	movq	(%rdi), %rax
	movq	8(%rdi), %rdx
	subq	%rax, %rdx
	cmpq	$4, %rdx
	jb	LBB1_2
## BB#1:                                ## %for.body.preheader
	andq	$-4, %rdx
	movl	$1, %esi
	movq	%rax, %rdi
	callq	_memset
LBB1_2:                                 ## %for.end
	addq	$8, %rsp
	ret

llvm-svn: 122573
 2010-12-26 23:42:51 +00:00
Michael J. Spencer
d5ec932c3a Merge System into Support. 
llvm-svn: 120298
 2010-11-29 18:16:10 +00:00
Dan Gohman
3213622610 Introduce memoization for ScalarEvolution dominates and properlyDominates 
queries, and SCEVExpander getRelevantLoop queries.

llvm-svn: 119595
 2010-11-18 00:34:22 +00:00
Dan Gohman
ecff21cc67 Factor out the code for purging a SCEV from all the various memoization maps. 
Some of these maps may merge in the future, but for now it's convenient to have
a utility function for them.

llvm-svn: 119587
 2010-11-17 23:28:48 +00:00
Dan Gohman
8e594dfe39 Merge the implementations of isLoopInvariant and hasComputableLoopEvolution, and 
memoize the results. This improves compile time in code which highly complex
expressions which get queried many times.

llvm-svn: 119584
 2010-11-17 23:21:44 +00:00
Dan Gohman
fb6ea18d0a Make SCEV::getType() and SCEV::print non-virtual. Move SCEV::hasOperand 
to ScalarEvolution. Delete SCEV::~SCEV. SCEV is no longer virtual.

llvm-svn: 119578
 2010-11-17 22:27:42 +00:00
Dan Gohman
9bbb0fa515 Move SCEV::dominates and properlyDominates to ScalarEvolution. 
llvm-svn: 119570
 2010-11-17 21:41:58 +00:00
Dan Gohman
04df5af12b Move SCEV::isLoopInvariant and hasComputableLoopEvolution to be member 
functions of ScalarEvolution, in preparation for memoization and
other optimizations.

llvm-svn: 119562
 2010-11-17 21:23:15 +00:00
Dan Gohman
a585073323 Fix ScalarEvolution's range memoization to avoid using a 
default ctor with ConstantRange.

llvm-svn: 119550
 2010-11-17 20:23:08 +00:00
Dan Gohman
b10ff802a0 Memoize results from ScalarEvolution's getUnsignedRange and getSignedRange. 
This fixes some extreme compile times on unrolled sha512 code.

llvm-svn: 119455
 2010-11-17 02:44:44 +00:00
Dan Gohman
636c57c5de Switch ScalarEvolution's main Value*->SCEV* map from std::map 
to DenseMap.

llvm-svn: 112281
 2010-08-27 18:55:03 +00:00
Dan Gohman
928cf9d77b Placate overzealous compiler warnings. 
llvm-svn: 111152
 2010-08-16 17:01:55 +00:00
Dan Gohman
3921a903bb Specialize FoldingSetTrait<SCEV>, providing implementations of node 
comparison and hash computation which don't require constructing
temporary ID values.

llvm-svn: 111131
 2010-08-16 15:31:45 +00:00
Dan Gohman
7e49302e9a Rename and reorder the arguments to isImpliedCond, for consistency and clarity. 
llvm-svn: 110750
 2010-08-10 23:46:30 +00:00
Dan Gohman
68ac0492a4 Make SCEVUnknown a CallbackVH, so that it can be notified directly 
of Value deletions and RAUWs, instead of relying on ScalarEvolution's
Scalars map being notified, as that's complicated at best, and
insufficient in general.

This means SCEVUnknown needs a non-trivial destructor, so introduce
a mechanism to allow ScalarEvolution to locate all the SCEVUnknowns.

llvm-svn: 110086
 2010-08-02 23:49:30 +00:00
Eric Christopher
6a1da7b4a5 Speculatively revert r109705 since it seems to be causing some build bot 
angst.

llvm-svn: 109718
 2010-07-29 01:25:38 +00:00
Dan Gohman
ea1486b53c Factor out some of the code for updating old SCEVUnknown values, and 
extend it to handle the case where multiple RAUWs affect a single
SCEVUnknown.

Add a ScalarEvolution unittest to test for this situation.

llvm-svn: 109705
 2010-07-29 00:17:55 +00:00
Dan Gohman
b4699b3002 Add some extra friend declarations to fix a gcc-4.0 compile error. 
This is a temporary fix, until more elaborate changes are ready.

llvm-svn: 109593
 2010-07-28 17:09:24 +00:00
Dan Gohman
f44783ab4e Replace ScalarEvolution's private copy of getLoopPredecessor 
with LoopInfo's public copy.

llvm-svn: 106603
 2010-06-22 23:43:28 +00:00
Dan Gohman
b5ec637e57 Revert r106304 (105548 and friends), which are the SCEVComplexityCompare 
optimizations. There is still some nondeterminism remaining.

llvm-svn: 106306
 2010-06-18 19:54:20 +00:00
Dan Gohman
527b570925 Reapply 105540, 105542, and 105548, and revert r105732. 
llvm-svn: 106304
 2010-06-18 19:26:04 +00:00
Dan Gohman
e20e668c7e Remove getIntegerSCEV; it's redundant with getConstant, and getConstant 
is more consistent with the ConstantInt API.

llvm-svn: 106281
 2010-06-18 14:33:50 +00:00
Evan Cheng
28c151ae52 Revert 105540, 105542, 105544, 105546, and 105548 to unbreak bootstrapping. 
llvm-svn: 105740
 2010-06-09 18:59:43 +00:00
Dan Gohman
490f4d7020 The FoldingSet hash data includes pointer values, so it isn't 
determinstic. Instead, give SCEV objects an arbitrary sequence
number.

llvm-svn: 105548
 2010-06-07 19:36:14 +00:00
Dan Gohman
65954b2eb4 Optimize ScalarEvolution's SCEVComplexityCompare predicate: don't go 
scrounging through SCEVUnknown contents and SCEVNAryExpr operands;
instead just do a simple deterministic comparison of the precomputed
hash data.

Also, since this is more precise, it eliminates the need for the slow
N^2 duplicate detection code.

llvm-svn: 105540
 2010-06-07 19:06:13 +00:00
Dan Gohman
cfd0d9393a Add some comments. 
llvm-svn: 102731
 2010-04-30 18:33:41 +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
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
ff456e3f4d Enhance ScalarEvolution::isKnownPredicate with support for 
loop conditions which are invariants.

llvm-svn: 100995
 2010-04-11 22:16:48 +00:00