mirrors/llvm-project
0
0
Fork 0
mirror of https://github.com/llvm/llvm-project.git synced 2025-05-08 04:26:06 +00:00
Code Issues Projects Releases Wiki Activity
95,913 Commits 1,258 Branches 288 Tags
Commit Graph

570 Commits

Author SHA1 Message Date
Dan Gohman
7e6b393e66 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
7ee1bbb76c 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
534749bf70 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
20d9ce21ef Move SCEV::dominates and properlyDominates to ScalarEvolution. 
llvm-svn: 119570
 2010-11-17 21:41:58 +00:00
Dan Gohman
afd6db9932 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
Duncan Sands
39d77131a1 Before replacing a phi node with a different value, it 
needs to be checked that this won't break LCSSA form.
Change the existing checking method to a more direct one:
rather than seeing if all predecessors belong to the loop,
check that the replacing value is either not in any loop or
is in a loop that contains the phi node.

llvm-svn: 119556
 2010-11-17 20:49:12 +00:00
Dan Gohman
d3a32ae4c8 Verify SCEVAddRecExpr's invariant in ScalarEvolution::getAddRecExpr 
instead of in SCEVAddRecExpr's constructor, in preparation for an
upcoming change.

llvm-svn: 119554
 2010-11-17 20:48:38 +00:00
Dan Gohman
ed75631743 Fix ScalarEvolution's range memoization to avoid using a 
default ctor with ConstantRange.

llvm-svn: 119550
 2010-11-17 20:23:08 +00:00
Duncan Sands
d06f50e2db Have ScalarEvolution use SimplifyInstruction rather than hasConstantValue. 
While there, add a note about an inefficiency I noticed.

llvm-svn: 119458
 2010-11-17 04:18:45 +00:00
Dan Gohman
761065e3b7 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
dcb354b234 Make ScalarEvolution::forgetLoop forget all contained loops too, because 
they may have ValuesAtScopes map entries referencing their outer loops.
This fixes a user-after-free reported in PR8471.

llvm-svn: 117698
 2010-10-29 20:16:10 +00:00
Owen Anderson
6c18d1aac0 Get rid of static constructors for pass registration. Instead, every pass exposes an initializeMyPassFunction(), which 
must be called in the pass's constructor.  This function uses static dependency declarations to recursively initialize
the pass's dependencies.

Clients that only create passes through the createFooPass() APIs will require no changes.  Clients that want to use the
CommandLine options for passes will need to manually call the appropriate initialization functions in PassInitialization.h
before parsing commandline arguments.

I have tested this with all standard configurations of clang and llvm-gcc on Darwin.  It is possible that there are problems
with the static dependencies that will only be visible with non-standard options.  If you encounter any crash in pass
registration/creation, please send the testcase to me directly.

llvm-svn: 116820
 2010-10-19 17:21:58 +00:00
Owen Anderson
8ac477ffb5 Begin adding static dependence information to passes, which will allow us to 
perform initialization without static constructors AND without explicit initialization
by the client.  For the moment, passes are required to initialize both their
(potential) dependencies and any passes they preserve.  I hope to be able to relax
the latter requirement in the future.

llvm-svn: 116334
 2010-10-12 19:48:12 +00:00
Owen Anderson
df7a4f2515 Now with fewer extraneous semicolons! 
llvm-svn: 115996
 2010-10-07 22:25:06 +00:00
Dan Gohman
8e4c19ac44 Don't add the operand count to SCEV uniquing data; FoldingSetNodeID 
already knows its own length, so this is redundant.

llvm-svn: 115521
 2010-10-04 17:24:08 +00:00
Dan Gohman
47308d5da3 Reapply r112432, now that the real problem is addressed. 
llvm-svn: 112667
 2010-08-31 22:53:17 +00:00
Dan Gohman
f01a5eed1e Reapply r112433, now that the real problem is addressed. 
llvm-svn: 112666
 2010-08-31 22:52:12 +00:00
Dan Gohman
aabfc52790 Revert r110916. This patch is buggy because the code inside the 
inner loop doesn't update all the variables in the outer loop.

llvm-svn: 112665
 2010-08-31 22:50:31 +00:00
Dan Gohman
90f29bcd90 Revert r112432. It appears to be exposing a problem in the emacs build. 
llvm-svn: 112638
 2010-08-31 20:58:44 +00:00
Dan Gohman
444c24a9f0 Speculatively revert r112433. 
llvm-svn: 112608
 2010-08-31 17:56:47 +00:00
Dan Gohman
d1da5cdfee Restructure the {A,+,B}<L> * {C,+,D}<L> folding so that it folds 
all applicable addrecs before recursing on getMulExpr, instead of
recursing on getMulExpr for each one.

llvm-svn: 112433
 2010-08-29 15:16:58 +00:00
Dan Gohman
3e6fc18943 Batch up subtracts along with adds, when analyzing long chains of 
operations.

llvm-svn: 112432
 2010-08-29 15:10:06 +00:00
Dan Gohman
7712d2900d Micro-optimize GroupByComplexity. 
llvm-svn: 112431
 2010-08-29 15:07:13 +00:00
Dan Gohman
0f2de01355 Hold AddRec->getLoop() in a variable, to make the Mul code more consistent 
with the Add code.

llvm-svn: 112430
 2010-08-29 14:55:19 +00:00
Dan Gohman
028c18158a Rename a variable, for consistency. 
llvm-svn: 112429
 2010-08-29 14:53:34 +00:00
Dan Gohman
28a84d4ba1 Use iterators instead of indices. 
llvm-svn: 112428
 2010-08-29 14:52:02 +00:00
Dan Gohman
fe22f1d3cc Fix an index calculation thinko. 
llvm-svn: 112337
 2010-08-28 00:39:27 +00:00
Dan Gohman
15871f23e3 When merging adjacent operands, scan ahead and merge all equal 
adjacent operands at once, instead of just two at a time.

llvm-svn: 112299
 2010-08-27 21:39:59 +00:00
Dan Gohman
c866bf4fec Make the {A,+,B}<L> + {C,+,D}<L> --> Other + {A+C,+,B+D}<L> 
transformation collect all the addrecs with the same loop
add combine them at once rather than starting everything over
at the first chance.

llvm-svn: 112290
 2010-08-27 20:45:56 +00:00
Dan Gohman
9bad2fb378 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
2706567c5c Optimize SCEVComplexityCompare. Use a 3-way return instead of a 2-way 
return to avoid needing two calls to test for equivalence, and sort
addrecs by their degree before examining their operands.

llvm-svn: 112267
 2010-08-27 15:26:01 +00:00
Dan Gohman
797a1dbb1c To create a copy of a SmallVector with an element removed from the 
middle, copy the elements in two groups, rather than copying all the
elements and then doing an erase on the middle of the result. These
are SmallVectors, so we shouldn't expect to hit dynamic allocation
in the common case.

llvm-svn: 111151
 2010-08-16 16:57:24 +00:00
Dan Gohman
0d0cc18af5 Tidy whitespace. 
llvm-svn: 111147
 2010-08-16 16:34:09 +00:00
Dan Gohman
c29eeaecec Add a comment. 
llvm-svn: 111145
 2010-08-16 16:31:39 +00:00
Dan Gohman
7eac4961d7 Use const_iterator in a few places. 
llvm-svn: 111144
 2010-08-16 16:30:01 +00:00
Dan Gohman
74c61503b1 Use iterators instead of indices in a few more places. 
llvm-svn: 111143
 2010-08-16 16:27:53 +00:00
Dan Gohman
f29618236e Micro-optimize SCEVConstant comparison. 
llvm-svn: 111142
 2010-08-16 16:25:35 +00:00
Dan Gohman
3688ea5c7d Move SCEVNAryExpr's virtual member functions out of line, and convert 
them to iterators.

llvm-svn: 111140
 2010-08-16 16:21:27 +00:00
Dan Gohman
d6925bbe0d Use iterators instead of indices in simple cases. 
llvm-svn: 111138
 2010-08-16 16:16:11 +00:00
Dan Gohman
b6c773ec2e Avoid gratuitous inefficiency in ifndef NDEBUG code. 
llvm-svn: 111137
 2010-08-16 16:13:54 +00:00
Dan Gohman
e5fb1036e6 Make one getAddExpr call when analyzing a+b+c+d+e+... instead of one 
for each add instruction. Ditto for Mul.

llvm-svn: 111136
 2010-08-16 16:03:49 +00:00
Dan Gohman
b094b39111 Delete an unused function. 
llvm-svn: 111135
 2010-08-16 15:57:14 +00:00
Dan Gohman
0c436ab356 Various optimizations. Don't compare two loops' depths 
when they are the same loop. Don't compare two instructions'
loop depths when they are in the same block.

llvm-svn: 111045
 2010-08-13 21:24:58 +00:00
Dan Gohman
63c020a210 When testing whether one loop contains another, test this directly 
rather than testing whether the loop contains the other's header.

llvm-svn: 111039
 2010-08-13 20:23:25 +00:00
Dan Gohman
3324b9ec67 Add a const. 
llvm-svn: 111038
 2010-08-13 20:17:27 +00:00
Dan Gohman
cf32f2bde1 When creating a symmetric SCEV with a constant operand, put 
the constant operand on the left, as that's where ScalarEvolution
will end up canonicalizing to.

llvm-svn: 111037
 2010-08-13 20:17:14 +00:00
Dan Gohman
ec0120a123 An add recurrence is loop-invariant in any loop inside of its 
associated loop. This avoids potentially expensive traversals
of the add recurrence's operands.

llvm-svn: 111034
 2010-08-13 20:11:39 +00:00
Dan Gohman
2de47777f4 Optimize ScalarEvolution::getAddExpr's operand factoring code by 
having it finish processing all of the muliply operands before
starting the whole getAddExpr process over again, instead of
immediately after the first simplification.

llvm-svn: 110916
 2010-08-12 15:00:23 +00:00
Dan Gohman
157847f5d1 Hoist some loop-invariant code out of a hot loop. 
llvm-svn: 110915
 2010-08-12 14:52:55 +00:00
Dan Gohman
e67b287451 Optimize ScalarEvolution::getAddExpr's duplicate operand detection 
by having it finish processing the whole operand list before
starting the whole getAddExpr process over again, instead of
immediately after the first duplicate is found.

llvm-svn: 110914
 2010-08-12 14:46:54 +00:00