RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-12-19 01:27:40 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity
94,639 Commits 4 Branches 5 Tags 634 MiB
3e8c045f48
Commit Graph

498 Commits

Author SHA1 Message Date
Rafael Espindola
745797b9c4 Move the loads after the calls so that the fix for 
PR10292 doesn't show that the loads don't alias
the allocas.

llvm-svn: 134852
 2011-07-09 23:53:58 +00:00
Rafael Espindola
ec48ea17ca Use CHECK-NEXT. 
llvm-svn: 134850
 2011-07-09 22:56:50 +00:00
Chris Lattner
6aa403748e Remove support for parsing the "type i32" syntax for defining a numbered 
top level type without a specified number.  This syntax isn't documented
and blocks forward progress.

llvm-svn: 133371
 2011-06-19 00:03:46 +00:00
Chris Lattner
ad5400fa72 rip out a ton of intrinsic modernization logic from AutoUpgrade.cpp, which is 
for pre-2.9 bitcode files.  We keep x86 unaligned loads, movnt, crc32, and the
target indep prefetch change.

As usual, updating the testsuite is a PITA.

llvm-svn: 133337
 2011-06-18 06:05:24 +00:00
Chris Lattner
0899957b99 make the asmparser reject function and type redefinitions. 'Merging' hasn't been 
needed since llvm-gcc 3.4 days.

llvm-svn: 133248
 2011-06-17 07:06:44 +00:00
Chris Lattner
4eb6f76fa6 Remove support for using "foo" as symbols instead of %"foo". This is ancient 
syntax and has been long obsolete.  As usual, updating the tests is the nasty
part of this.

llvm-svn: 133242
 2011-06-17 06:36:20 +00:00
Chris Lattner
9ec82f54d4 manually upgrade a bunch of tests to modern syntax, and remove some that 
are either unreduced or only test old syntax.

llvm-svn: 133228
 2011-06-17 03:14:27 +00:00
John McCall
7e1ecf5edb Test case for r132797. 
llvm-svn: 132962
 2011-06-14 03:02:05 +00:00
Dan Gohman
aa7c0761db Reapply r131781, now that the GVN bug with partially-aliasing loads 
is disabled.

llvm-svn: 132632
 2011-06-04 06:50:18 +00:00
Dan Gohman
c7cda7f467 Remove this test, which should have been reverted along with r131781. 
llvm-svn: 132628
 2011-06-04 06:21:23 +00:00
Dan Gohman
8fd6804868 Revert r131781 again. Apparently there is more going on here. 
llvm-svn: 132625
 2011-06-04 05:11:22 +00:00
Dan Gohman
24ef4a0b7d Reapply r131781 (revert r131809), now that some BasicAA shortcomings 
it exposed are fixed.

llvm-svn: 132611
 2011-06-04 00:46:31 +00:00
Dan Gohman
edaf7c535a Fix BasicAA's recursion detection so that it doesn't pessimize 
queries in the case of a DAG, where a query reaches a node
visited earlier, but it's not on a cycle. This avoids
MayAlias results in cases where BasicAA is expected to
return MustAlias or PartialAlias in order to protect TBAA.

llvm-svn: 132609
 2011-06-04 00:31:50 +00:00
Dan Gohman
6d082aec26 When merging MustAlias and PartialAlias, chose PartialAlias instead 
of conservatively choosing MayAlias.

llvm-svn: 132579
 2011-06-03 20:17:36 +00:00
Dan Gohman
5b2ad67709 Make DecomposeGEPExpression check SimplifyInstruction only 
after checking for a GEP, so that it matches what GetUnderlyingObject
does. This fixes an obscure bug turned up by bugpoint in the testcase
for PR9931.

llvm-svn: 131971
 2011-05-24 18:24:08 +00:00
Chris Lattner
6830c25f35 I missed a checking with my GVN change. 
llvm-svn: 131851
 2011-05-22 07:20:02 +00:00
Duncan Sands
c228e6bdea Revert commit 131781, to see if it fixes the x86-64 dragonegg buildbot. 
Original log message:
When BasicAA can determine that two pointers have the same base but
differ by a dynamic offset, return PartialAlias instead of MayAlias.
See the comment in the code for details. This fixes PR9971.

llvm-svn: 131809
 2011-05-21 20:54:46 +00:00
Dan Gohman
048c261e5d When BasicAA can determine that two pointers have the same base but 
differ by a dynamic offset, return PartialAlias instead of MayAlias.
See the comment in the code for details. This fixes PR9971.

llvm-svn: 131781
 2011-05-21 01:05:08 +00:00
Dan Gohman
4e15bcfe01 Teach BasicAA about arm.neon.vld1 and vst1. 
llvm-svn: 130327
 2011-04-27 20:44:28 +00:00
Dan Gohman
d96c818dd2 When analyzing functions known to only access argument pointees, 
only check arguments with pointer types. Update the documentation
of IntrReadArgMem reflect this.

While here, add support for TBAA tags on intrinsic calls.

llvm-svn: 130317
 2011-04-27 18:39:03 +00:00
Andrew Trick
cef977b295 Test case and comment for PR9633. 
llvm-svn: 130294
 2011-04-27 05:42:17 +00:00
Benjamin Kramer
b2992c34b5 Make tests more useful. 
lit needs a linter ...

llvm-svn: 130126
 2011-04-25 10:12:01 +00:00
Eli Friedman
b0e846a68c PR9634: Don't unconditionally tell the AliasSetTracker that the PreheaderLoad 
is equivalent to any other relevant value; it isn't true in general.
If it is equivalent, the LoopPromoter will tell the AST the equivalence.
Also, delete the PreheaderLoad if it is unused.

Chris, since you were the last one to make major changes here, can you check
that this is sane?

llvm-svn: 129049
 2011-04-07 01:35:06 +00:00
Chris Lattner
a2345ee59d remove postdom frontiers, because it is dead. Forward dom frontiers are 
still used by RegionInfo :(

llvm-svn: 128943
 2011-04-05 21:57:17 +00:00
Anders Carlsson
8681fe2359 Revert r128140 for now. 
llvm-svn: 128149
 2011-03-23 15:51:12 +00:00
Anders Carlsson
556ad25dec A global variable with internal linkage where all uses are in one function and whose address is never taken is a non-escaping local object and can't alias anything else. 
llvm-svn: 128140
 2011-03-23 02:19:48 +00:00
Andrew Trick
5c8b815e5f Propagate SCEV no-wrap flags whenever possible. 
This needs review.

llvm-svn: 127638
 2011-03-15 00:37:00 +00:00
Andrew Trick
c4703f6ea1 When SCEV can determine the loop test is X < X, set ExactBECount=0. 
When ExactBECount is a constant, use it for MaxBECount.
When MaxBECount cannot be computed, replace it with ExactBECount.
Fixes PR9424.

llvm-svn: 127342
 2011-03-09 17:29:58 +00:00
Chris Lattner
2596ac19b9 teach SCEV that the scale and addition of an inbounds gep don't NSW. 
This fixes a FIXME in scev-aa.ll (allowing a new no-alias result) and
generally makes things more precise.

llvm-svn: 125449
 2011-02-13 03:14:49 +00:00
Chris Lattner
fec8b6bd6d Per discussion with Dan G, inbounds geps *certainly* can have 
unsigned overflow (e.g. "gep P, -1"), and while they can have
signed wrap in theoretical situations, modelling an AddRec as
not having signed wrap is going enough for any case we can 
think of today.  In the future if this isn't enough, we can
revisit this.  Modeling them as having NUW isn't causing any
known problems either FWIW.

llvm-svn: 125410
 2011-02-11 21:43:33 +00:00
Dan Gohman
6f83adb763 Add another rdar number. 
llvm-svn: 124125
 2011-01-24 17:54:01 +00:00
Nick Lewycky
13a2b8281f Simplify some code with no functionality change. Make the test a lot more 
robust against smarter optimizations, using the power of FileCheck.

llvm-svn: 124081
 2011-01-23 20:06:05 +00:00
Nick Lewycky
2503c9f9c8 Use value ranges to fold ext(trunc) in SCEV when possible. 
llvm-svn: 124062
 2011-01-23 06:20:19 +00:00
Tobias Grosser
ea8985cc25 Implement requiredTransitive 
The PassManager did not implement the transitivity of requiredTransitive. This
was unnoticed since 2006.

llvm-svn: 123942
 2011-01-20 21:03:22 +00:00
Nick Lewycky
51c13384f5 Similarly, analyze truncate through multiply. 
llvm-svn: 123842
 2011-01-19 18:56:00 +00:00
Nick Lewycky
9867e58096 Add a missed SCEV fold that is required to continue analyzing the IR produced 
by indvars through the scev expander.

trunc(add x, y) --> add(trunc x, y). Currently SCEV largely folds the other way
which is probably wrong, but preserved to minimize churn. Instcombine doesn't
do this fold either, demonstrating a missed optz'n opportunity on code doing
add+trunc+add.

llvm-svn: 123838
 2011-01-19 16:59:46 +00:00
Nick Lewycky
5a538b62ca Add a missing SCEV simplification sext(zext x) --> zext x. 
llvm-svn: 123832
 2011-01-19 15:56:12 +00:00
Dan Gohman
df668227fb Teach BasicAA to return PartialAlias in cases where both pointers 
are pointing to the same object, one pointer is accessing the entire
object, and the other is access has a non-zero size. This prevents
TBAA from kicking in and saying NoAlias in such cases.

llvm-svn: 123775
 2011-01-18 21:16:06 +00:00
Eric Christopher
c6db56a31e Revert the testcase from the previous reverted commit. 
llvm-svn: 123227
 2011-01-11 09:20:44 +00:00
Chris Lattner
749f1eff13 add a testcase I missed in previous commit. 
llvm-svn: 123143
 2011-01-09 23:52:31 +00:00
Chris Lattner
57e9b35653 teach SCEV analysis of PHI nodes that PHI recurences formed 
with GEP instructions are always NUW, because PHIs cannot wrap
the end of the address space.

llvm-svn: 123105
 2011-01-09 02:28:48 +00:00
Chris Lattner
fa37cac39c reduce indentation. Print <nuw> and <nsw> when dumping SCEV AddRec's 
that have the bit set.

llvm-svn: 123104
 2011-01-09 02:16:18 +00:00
Chris Lattner
a7735a573d fix rdar://8813415 - a miscompilation of 164.gzip that loop-idiom 
exposed.  It turns out to be a latent bug in basicaa, scary.

llvm-svn: 122772
 2011-01-03 21:03:33 +00:00
Chris Lattner
76b74870be filecheckize 
llvm-svn: 122771
 2011-01-03 21:01:26 +00:00
Dan Gohman
29a260015a -enable-tbaa is on by default now. 
llvm-svn: 121945
 2010-12-16 02:53:48 +00:00
Dan Gohman
e106936414 Make memcpyopt TBAA-aware. 
llvm-svn: 121944
 2010-12-16 02:51:19 +00:00
Duncan Sands
2699fb1072 Move Sub simplifications and additional Add simplifications out of 
instcombine and into InstructionSimplify.

llvm-svn: 121861
 2010-12-15 14:07:39 +00:00
Dan Gohman
b187cce266 Reapply r121520, PartialAlias implementation for BasicAA, now that 
memdep is updated to handle it.

llvm-svn: 121725
 2010-12-13 22:50:24 +00:00
Dan Gohman
18e2a55c07 Revert r121520, which may have introduced miscompilations. 
llvm-svn: 121573
 2010-12-10 21:48:28 +00:00
Dan Gohman
d1bf1d8013 Implement PartialAlias checking in BasicAA. 
llvm-svn: 121520
 2010-12-10 20:47:03 +00:00
Chris Lattner
191aa08db1 remove fixme comment too. 
llvm-svn: 120493
 2010-11-30 23:25:01 +00:00
Chris Lattner
eee2bb2ff0 check in *all* files. This is now handled by my previous DSE commit. 
llvm-svn: 120492
 2010-11-30 23:23:59 +00:00
NAKAMURA Takumi
fc880d67f7 test: Check the feature 'loadable_module' with load modules in %llvmshlibdir. 
%llvmshlibdir should be 'bin' on Cygming.

llvm-svn: 120282
 2010-11-29 07:58:32 +00:00
Dan Gohman
139b090e0e Delete unneeded ssp attributes. 
llvm-svn: 118836
 2010-11-11 21:08:46 +00:00
Dan Gohman
7c6a63aea3 TBAA-enable ArgumentPromotion. 
llvm-svn: 118804
 2010-11-11 18:09:32 +00:00
Dan Gohman
01ed16d764 Make Sink tbaa-aware. 
llvm-svn: 118788
 2010-11-11 16:21:47 +00:00
Dan Gohman
2ffc9c8de3 Add a testcase which demonstrates alias analysis pass precedence. 
llvm-svn: 118755
 2010-11-11 01:03:30 +00:00
Dan Gohman
aef3e95364 Fully invalidate cached results when a prior query's size or 
type is insufficient for, or incompatible with, the current query.

llvm-svn: 118721
 2010-11-10 21:45:11 +00:00
Dan Gohman
a42f6c32a3 Teach FunctionAttrs about the VAArg instruction. 
llvm-svn: 118627
 2010-11-09 20:17:38 +00:00
Dan Gohman
cee4cb4b0a Add a testcase for a call which BasicAA says only accesses memory through 
its arguments and which TBAA says doesn't write to memory.

llvm-svn: 118439
 2010-11-08 20:20:11 +00:00
Dan Gohman
c04ed6e5da Make FunctionAttrs TBAA-aware. 
llvm-svn: 118417
 2010-11-08 17:12:04 +00:00
Dan Gohman
753c9ce807 Teach memdep to use pointsToConstantMemory to determine that loads 
from constant memory don't alias any stores.

llvm-svn: 117636
 2010-10-29 01:14:04 +00:00
Dan Gohman
a592a0f539 Add a basic testcase for TBAA-aware DSE. 
llvm-svn: 117632
 2010-10-29 00:54:02 +00:00
Dan Gohman
afaaf2f56b Add some comments. 
llvm-svn: 116957
 2010-10-20 22:04:02 +00:00
Dan Gohman
6efd04961b Don't pass the raw invalid pointer used to represent conflicting 
TBAA information to AliasAnalysis.

llvm-svn: 116751
 2010-10-18 21:28:00 +00:00
Dan Gohman
ed8fc1b23f Add a basic testcase for TBAA-aware LICM. 
llvm-svn: 116745
 2010-10-18 21:00:09 +00:00
Dan Gohman
2427af80d1 Run tbaa before basicaa, since that's how it's expected to be used. 
llvm-svn: 116731
 2010-10-18 18:45:59 +00:00
Dan Gohman
7820328076 Make TypeBasedAliasAnalysis default to doing nothing, with a command-line 
option to enable it.

llvm-svn: 116722
 2010-10-18 18:17:47 +00:00
Dan Gohman
6aff5b94ff Make BasicAliasAnalysis a normal AliasAnalysis implementation which 
does normal initialization and normal chaining. Change the default
AliasAnalysis implementation to NoAlias.

Update StandardCompileOpts.h and friends to explicitly request
BasicAliasAnalysis.

Update tests to explicitly request -basicaa.

llvm-svn: 116720
 2010-10-18 18:04:47 +00:00
Dan Gohman
8dc9781a91 Add a simple testcase for tbaa. 
llvm-svn: 116272
 2010-10-11 23:54:13 +00:00
Benjamin Kramer
caacff25e4 Remove PointerTracking tests. 
llvm-svn: 115072
 2010-09-29 19:20:35 +00:00
Eli Friedman
b5aea103fc PR7959: Handle negative scales in GEPs correctly in BasicAA for non-64-bit 
targets.

llvm-svn: 114015
 2010-09-15 20:08:03 +00:00
Chris Lattner
238f46d92e remove some noise from tests. 
llvm-svn: 112889
 2010-09-02 22:35:33 +00:00
Michael J. Spencer
2f463fc492 Fix constant-over-index.ll test on windows. 
llvm-svn: 112483
 2010-08-30 15:08:02 +00:00
Chris Lattner
7663b66c31 refix PR1143 by making basicaa analyze zexts of indices aggresively, 
which I broke with a recent patch.

llvm-svn: 111452
 2010-08-18 23:09:49 +00:00
Chris Lattner
b4602679d7 fix a buggy test 
llvm-svn: 111354
 2010-08-18 04:55:12 +00:00
Chris Lattner
49d0f29752 fix PR7589: In brief: 
gep P, (zext x) != gep P, (sext x)

DecomposeGEPExpression was getting this wrong, confusing
basicaa.

llvm-svn: 111352
 2010-08-18 04:28:19 +00:00
Chris Lattner
6ac971a27f filecheckize and detrivialize. 
llvm-svn: 111350
 2010-08-18 04:25:43 +00:00
Dan Gohman
603e66618f When analyzing loop exit conditions combined with and and or, don't 
make any assumptions about when the two conditions will agree on when
to permit the loop to exit. This fixes PR7845.

llvm-svn: 110758
 2010-08-11 00:12:36 +00:00
Tobias Grosser
7b96737b7f RegionInfo: Do not assert if a BB is not part of the dominance tree. 
llvm-svn: 110665
 2010-08-10 09:54:35 +00:00
Dan Gohman
da3f592fb3 Implement a proper getModRefInfo for va_arg. 
llvm-svn: 110458
 2010-08-06 18:24:38 +00:00
Dan Gohman
9135b410fe Implement AccessesArguments checking in the two-callsite form 
of BasicAA::getModRefInfo. This allows BasicAA to say that two
memset calls to non-aliasing memory locations don't interfere.

llvm-svn: 110393
 2010-08-05 23:34:50 +00:00
Dan Gohman
7260387710 Fix memdep's code for reasoning about dependences between two calls. A Ref 
response from getModRefInfo is not useful here. Instead, check for identical
calls only in the NoModRef case.

Reapply r110270, and strengthen it to compensate for the memdep changes.
When both calls are readonly, there is no dependence between them.

llvm-svn: 110382
 2010-08-05 22:09:15 +00:00
Dan Gohman
c42ed0aa91 Revert r110270 for now. It appears to uncover a memdep bug. 
llvm-svn: 110293
 2010-08-05 00:43:10 +00:00
Dan Gohman
fc6b043376 The trouble with testing for "ModRef" and "NoModRef" is that 
one is a suffix of the other, and FileCheck accepts superstrings.
Adjust the output to avoid this problem.

llvm-svn: 110280
 2010-08-04 23:37:55 +00:00
Dan Gohman
dcb6099f9e The two-callsite form of AliasAnalysis::getModRefInfo is documented 
to return Ref if the left callsite only reads memory read or written
by the right callsite; fix BasicAliasAnalysis to implement this.

Add AliasAnalysisEvaluator support for testing the two-callsite
form of getModRefInfo.

llvm-svn: 110270
 2010-08-04 22:56:29 +00:00
Tobias Grosser
604a50cd71 Add new RegionInfo pass. 
The RegionInfo pass detects single entry single exit regions in a function,
where a region is defined as any subgraph that is connected to the remaining
graph at only two spots.
Furthermore an hierarchical region tree is built.
Use it by calling "opt -regions analyze" or "opt -view-regions".

llvm-svn: 109089
 2010-07-22 07:46:31 +00:00
Dan Gohman
2a08e2ce81 Remove interprocedural-basic-aa and associated code. The AliasAnalysis 
interface needs implementations to be consistent, so any code which
wants to support different semantics must use a different interface.
It's not currently worthwhile to add a new interface for this new
concept.

Document that AliasAnalysis doesn't support cross-function queries.

llvm-svn: 107776
 2010-07-07 14:27:09 +00:00
Dan Gohman
f9365363db Remove context sensitivity concerns from interprocedural-basic-aa, and 
make it more aggressive in cases where both pointers are known to live
in the same function.

llvm-svn: 107420
 2010-07-01 20:08:40 +00:00
Dan Gohman
683a9e2498 Revert the part of r107257 which introduced new logic for using 
nsw and nuw flags from IR Instructions. On further consideration,
this isn't valid.

llvm-svn: 107298
 2010-06-30 17:27:11 +00:00
Dan Gohman
6e7eecf743 Add a testcase for scev-aa's new capability. 
llvm-svn: 107258
 2010-06-30 07:17:47 +00:00
Dan Gohman
338d04a2dd Add a few more interesting testcases. 
llvm-svn: 107177
 2010-06-29 18:17:11 +00:00
Dan Gohman
37bf33ccff Add an Intraprocedural form of BasicAliasAnalysis, which aims to 
properly handles instructions and arguments defined in different
functions, or across recursive function iterations.

llvm-svn: 107109
 2010-06-29 00:50:39 +00:00
Dan Gohman
bd121d9b9f Fix Value::stripPointerCasts and BasicAA to avoid trouble on 
code in unreachable blocks, which have have use-def cycles.
This fixes PR7514.

llvm-svn: 107071
 2010-06-28 21:16:52 +00:00
Dan Gohman
a3bc6b13f7 Allow "exhaustive" trip count evaluation on phi nodes with all 
constant operands.

llvm-svn: 106537
 2010-06-22 13:15:46 +00:00
Dan Gohman
cec5b682b6 Fix ScalarEvolution's "exhaustive" trip count evaluation code to avoid 
assuming that loops are in canonical form, as ScalarEvolution doesn't
depend on LoopSimplify itself. Also, with indirectbr not all loops can
be simplified. This fixes PR7416.

llvm-svn: 106389
 2010-06-19 14:17:24 +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
Daniel Dunbar
acd46f61df Workaround SCEV non-determinism on this test, for now, to get buildbots back to 
green. Dan, please revert this once the real problem is fixed.

llvm-svn: 105732
 2010-06-09 17:54:40 +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
9c1b7fdc46 Add a comment to this test. 
llvm-svn: 102387
 2010-04-26 21:37:43 +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
Chris Lattner
790231f95e fix some failures my callgraph dump format change broke. 
llvm-svn: 102197
 2010-04-23 18:38:40 +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
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
b2a87fa39d Pointers to zero-sized objects don't point to overlapping objects. 
llvm-svn: 100789
 2010-04-08 18:11:50 +00:00
Chris Lattner
23334439e9 add newlines at the end of files. 
llvm-svn: 100705
 2010-04-07 22:53:17 +00:00
Mon P Wang
484bbe6aa9 Reapply address space patch after fixing an issue in MemCopyOptimizer. 
Added support for address spaces and added a isVolatile field to memcpy, memmove, and memset,
e.g., llvm.memcpy.i32(i8*, i8*, i32, i32) -> llvm.memcpy.p0i8.p0i8.i32(i8*, i8*, i32, i32, i1)

llvm-svn: 100304
 2010-04-04 03:10:48 +00:00
Mon P Wang
0ccf050ca3 Revert r100191 since it breaks objc in clang 
llvm-svn: 100199
 2010-04-02 18:43:02 +00:00
Mon P Wang
a01350755e Reapply address space patch after fixing an issue in MemCopyOptimizer. 
Added support for address spaces and added a isVolatile field to memcpy, memmove, and memset,
e.g., llvm.memcpy.i32(i8*, i8*, i32, i32) -> llvm.memcpy.p0i8.p0i8.i32(i8*, i8*, i32, i32, i1)

llvm-svn: 100191
 2010-04-02 18:04:15 +00:00
Bob Wilson
aae933cc81 Revert Mon Ping's change 99928, since it broke all the llvm-gcc buildbots. 
llvm-svn: 99948
 2010-03-30 22:27:04 +00:00
Mon P Wang
9351ea594a Added support for address spaces and added a isVolatile field to memcpy, memmove, and memset, 
e.g., llvm.memcpy.i32(i8*, i8*, i32, i32) -> llvm.memcpy.p0i8.p0i8.i32(i8*, i8*, i32, i32, i1)
A update of langref will occur in a subsequent checkin.

llvm-svn: 99928
 2010-03-30 20:55:56 +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
Chris Lattner
5649a97c00 remove andersen's tests. 
llvm-svn: 97490
 2010-03-01 20:23:15 +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
Dan Gohman
71fc5e8fce -disable-output is no longer needed with -analyze. 
llvm-svn: 94574
 2010-01-26 19:25:59 +00:00
Dan Gohman
5e06a05a16 Fix the the ceiling-division used in computing the MaxBECount so that it doesn't 
have trouble with an intermediate add overflowing. Also, be more conservative
about the case where the induction variable in an SLT loop exit can step past
the RHS of the SLT and overflow in a single step.

Make getSignedRange more aggressive, to recover for some common cases which
the above fixes pessimized.

This addresses rdar://7561161.

llvm-svn: 94512
 2010-01-26 04:40:18 +00:00
Tobias Grosser
24e0f1ed17 Fix PR6047 
Nodes that had children outside of the post dominator tree (infinite loops)
where removed from the post dominator tree. This seems to be wrong. Leave them
in the tree.

llvm-svn: 93633
 2010-01-16 13:38:07 +00:00
Dan Gohman
771144e807 Use WriteAsOperand instead of getName() to print loop header names, 
so that unnamed blocks are handled.

llvm-svn: 93059
 2010-01-09 18:17:45 +00:00
Dan Gohman
5fa04f2707 Delete useless trailing semicolons. 
llvm-svn: 92740
 2010-01-05 17:55:26 +00:00
Chris Lattner
6d180b4a2c gvn is optimizing this better now. 
llvm-svn: 90696
 2009-12-06 04:16:05 +00:00
Dan Gohman
6bb055cfcd Add a comment about A[i+(j+1)]. 
llvm-svn: 90185
 2009-12-01 01:38:10 +00:00
Chris Lattner
911e5047d0 @test9 is a testcase for r89958. Before 89958, we misanalyzed the 
first expression as P+4+4*i which we considered to possibly alias
P+4*j.  Now we correctly analyze the former one as P+1+4*i.

@test10 is a sanity test that verfies that we know that P+4+4*i != P+4*i.

llvm-svn: 89960
 2009-11-26 19:25:46 +00:00
Chris Lattner
ce573daf09 Implement PR1143 (at -m64) by making basicaa look through extensions. We 
previously already handled it at -m32 because there were no i32->i64 
extensions for addressing.

llvm-svn: 89959
 2009-11-26 18:53:33 +00:00
Chris Lattner
d86a693b70 teach GetLinearExpression to be a bit more aggressive. 
llvm-svn: 89955
 2009-11-26 17:00:01 +00:00
Chris Lattner
993cb8c911 update status of this. basicaa is much improved now, 
only missing the one form (in this testcase).  Dan, do you
consider this example to be important?

llvm-svn: 89953
 2009-11-26 16:42:00 +00:00
Chris Lattner
9c88c96b3f Teach basicaa that x|c == x+c when the c bits of x are clear. This 
allows us to compile the example in readme.txt into:

LBB1_1:                                                     ## %bb
	movl	4(%rdx,%rax), %ecx
	movl	%ecx, %esi
	imull	(%rdx,%rax), %esi
	imull	%esi, %ecx
	movl	%esi, 8(%rdx,%rax)
	imull	%ecx, %esi
	movl	%ecx, 12(%rdx,%rax)
	movl	%esi, 16(%rdx,%rax)
	imull	%ecx, %esi
	movl	%esi, 20(%rdx,%rax)
	addq	$16, %rax
	cmpq	$4000, %rax
	jne	LBB1_1

instead of:

LBB1_1: 
	movl	(%rdx,%rax), %ecx
	imull	4(%rdx,%rax), %ecx
	movl	%ecx, 8(%rdx,%rax)
	imull	4(%rdx,%rax), %ecx
	movl	%ecx, 12(%rdx,%rax)
	imull	8(%rdx,%rax), %ecx
	movl	%ecx, 16(%rdx,%rax)
	imull	12(%rdx,%rax), %ecx
	movl	%ecx, 20(%rdx,%rax)
	addq	$16, %rax
	cmpq	$4000, %rax
	jne	LBB1_1

GCC (4.2) doesn't seem to be able to eliminate the loads in this 
testcase either, it generates:

L2:
	movl	(%rdx), %eax
	imull	4(%rdx), %eax
	movl	%eax, 8(%rdx)
	imull	4(%rdx), %eax
	movl	%eax, 12(%rdx)
	imull	8(%rdx), %eax
	movl	%eax, 16(%rdx)
	imull	12(%rdx), %eax
	movl	%eax, 20(%rdx)
	addl	$4, %ecx
	addq	$16, %rdx
	cmpl	$1002, %ecx
	jne	L2

llvm-svn: 89952
 2009-11-26 16:26:43 +00:00
Chris Lattner
677b93d4c8 teach basicaa that A[i] != A[i+1]. 
llvm-svn: 89951
 2009-11-26 16:18:10 +00:00
Chris Lattner
82257f0385 rename test 
llvm-svn: 89950
 2009-11-26 16:08:41 +00:00
Chris Lattner
69e59e50f3 Change the other half of aliasGEP (which handles GEP differencing) to use DecomposeGEPExpression. This dramatically simplifies and shrinks the code by eliminating the horrible CheckGEPInstructions method, fixes a miscompilation (@test3) and makes the code more aggressive. In particular, we now handle the @test4 case, which is reduced from the SmallPtrSet constructor. Missing this caused us to emit a variable length memset instead of a fixed size one. 
llvm-svn: 89922
 2009-11-26 02:17:34 +00:00
Chris Lattner
862a3532d6 add a new random feature test 
llvm-svn: 89921
 2009-11-26 02:16:28 +00:00
Chris Lattner
632f60ccc9 remove a silly condition that doesn't make a lot of sense anymore. 
llvm-svn: 89601
 2009-11-22 16:15:59 +00:00
Victor Hernandez
3c98070f2c Update computeArraySize() to use ComputeMultiple() to determine the array size associated with a malloc; also extend PerformHeapAllocSRoA() to check if the optimized malloc's arg had its highest bit set, so that it is safe for ComputeMultiple() to look through sext instructions while determining the optimized malloc's array size 
llvm-svn: 86676
 2009-11-10 08:32:25 +00:00
Victor Hernandez
8736a8fca4 Re-commit r86077 now that r86290 fixes the 179.art and 175.vpr ARM regressions. 
Here is the original commit message:

This commit updates malloc optimizations to operate on malloc calls that have constant int size arguments.

Update CreateMalloc so that its callers specify the size to allocate:
MallocInst-autoupgrade users use non-TargetData-computed allocation sizes.
Optimization uses use TargetData to compute the allocation size.

Now that malloc calls can have constant sizes, update isArrayMallocHelper() to use TargetData to determine the size of the malloced type and the size of malloced arrays.
Extend getMallocType() to support malloc calls that have non-bitcast uses.

Update OptimizeGlobalAddressOfMalloc() to optimize malloc calls that have non-bitcast uses.  The bitcast use of a malloc call has to be treated specially here because the uses of the bitcast need to be replaced and the bitcast needs to be erased (just like the malloc call) for OptimizeGlobalAddressOfMalloc() to work correctly.

Update PerformHeapAllocSRoA() to optimize malloc calls that have non-bitcast uses.  The bitcast use of the malloc is not handled specially here because ReplaceUsesOfMallocWithGlobal replaces through the bitcast use.

Update OptimizeOnceStoredGlobal() to not care about the malloc calls' bitcast use.

Update all globalopt malloc tests to not rely on autoupgraded-MallocInsts, but instead use explicit malloc calls with correct allocation sizes.

llvm-svn: 86311
 2009-11-07 00:16:28 +00:00
Victor Hernandez
a5a12cd62e Revert r86077 because it caused crashes in 179.art and 175.vpr on ARM 
llvm-svn: 86213
 2009-11-06 01:33:24 +00:00
Victor Hernandez
21ec158c23 Update CreateMalloc so that its callers specify the size to allocate: 
MallocInst-autoupgrade users use non-TargetData-computed allocation sizes.
Optimization uses use TargetData to compute the allocation size.

Now that malloc calls can have constant sizes, update isArrayMallocHelper() to use TargetData to determine the size of the malloced type and the size of malloced arrays.
Extend getMallocType() to support malloc calls that have non-bitcast uses.

Update OptimizeGlobalAddressOfMalloc() to optimize malloc calls that have non-bitcast uses.  The bitcast use of a malloc call has to be treated specially here because the uses of the bitcast need to be replaced and the bitcast needs to be erased (just like the malloc call) for OptimizeGlobalAddressOfMalloc() to work correctly.

Update PerformHeapAllocSRoA() to optimize malloc calls that have non-bitcast uses.  The bitcast use of the malloc is not handled specially here because ReplaceUsesOfMallocWithGlobal replaces through the bitcast use.

Update OptimizeOnceStoredGlobal() to not care about the malloc calls' bitcast use.

Update all globalopt malloc tests to not rely on autoupgraded-MallocInsts, but instead use explicit malloc calls with correct allocation sizes.

llvm-svn: 86077
 2009-11-05 00:03:03 +00:00
Kenneth Uildriks
e711736014 Make opt default to not adding a target data string and update tests that depend on target data to supply it within the test 
llvm-svn: 85900
 2009-11-03 15:29:06 +00:00
Edward O'Callaghan
142c2fc0ae Convert Analysis tests to FileCheck in regards to PR5307. 
llvm-svn: 85241
 2009-10-27 14:54:46 +00:00
Dan Gohman
c8468855a7 Teach BasicAA how to analyze Select instructions, and make it more 
aggressive on PHI instructions.

llvm-svn: 85158
 2009-10-26 21:55:43 +00:00
Dan Gohman
06621f065a Update these tests to match what Loop::print now prints. 
llvm-svn: 85021
 2009-10-24 23:52:07 +00:00
Chris Lattner
eebed04912 fix test 
llvm-svn: 84405
 2009-10-18 05:03:00 +00:00
Chris Lattner
8db424f027 tighten up test3, add test3a for the converse 
transform, which isn't happening yet.

llvm-svn: 84402
 2009-10-18 04:55:26 +00:00
Chris Lattner
aff491fab6 tighten test2, add a test that it doesn't get transformed in the invalid edge case. 
llvm-svn: 84401
 2009-10-18 04:50:18 +00:00
Nick Lewycky
671ca16583 Merge tests into modref.ll. Also add a test for r84174 at Chris' behest! 
llvm-svn: 84400
 2009-10-18 04:41:36 +00:00
Nick Lewycky
d21c892821 Add a couple new testcases. 
llvm-svn: 84385
 2009-10-18 00:42:07 +00:00
Chris Lattner
1ed26100a4 replace a useless test with a useful one 
llvm-svn: 84383
 2009-10-17 23:59:51 +00:00
Nick Lewycky
0498027dec Make use of the result of the loads even though that means adding -instcombine. 
llvm-svn: 84125
 2009-10-14 19:02:13 +00:00
Evan Cheng
907fd9c3fb Another BasicAA fix. If a value does not alias a GEP's base pointer, then it 
cannot alias the GEP. GEP pointer alias rule states this clearly:
A pointer value formed from a getelementptr instruction is associated with the
addresses associated with the first operand of the getelementptr.

llvm-svn: 84079
 2009-10-14 06:41:49 +00:00
Evan Cheng
b193d9df99 Replace test with a simpler hand crafted one. 
llvm-svn: 84069
 2009-10-14 01:45:10 +00:00
Evan Cheng
3130aba687 Teach basic AA about PHI nodes. If all operands of a phi NoAlias another value than it's safe to declare the PHI NoAlias the value. Ditto for MustAlias. 
llvm-svn: 84038
 2009-10-13 22:02:20 +00:00
Chris Lattner
a433d8cb67 don't use dead loads as tests. 
llvm-svn: 83985
 2009-10-13 17:39:29 +00:00
Nick Lewycky
72f185f281 Teach BasicAA a little something about the atomic intrinsics: they can only 
modify through the pointer they're given.

llvm-svn: 83959
 2009-10-13 07:48:38 +00:00
Victor Hernandez
f772c0b8b2 Revert 82694 "Auto-upgrade malloc instructions to malloc calls." because it causes regressions in the nightly tests. 
llvm-svn: 82784
 2009-09-25 18:11:52 +00:00
Victor Hernandez
ff8027ced6 Auto-upgrade malloc instructions to malloc calls. 
Reviewed by Devang Patel.

llvm-svn: 82694
 2009-09-24 17:47:49 +00:00
Dan Gohman
723717853b Teach ScalarEvolution how to reason about no-wrap flags on loops 
where the induction variable has a non-unit stride, such as {0,+,2}, and
there are expressions such as {1,+,2} inside the loop formed with
or or add nsw operators.

llvm-svn: 82151
 2009-09-17 18:05:20 +00:00
Dan Gohman
c9307490ce Eliminate more redundant llvm-as calls. 
llvm-svn: 81540
 2009-09-11 18:17:12 +00:00
Dan Gohman
205b641954 Change tests from "opt %s" to "opt < %s" so that opt doesn't see the 
input filename so that opt doesn't print the input filename in the
output so that grep lines in the tests don't unintentionally match
strings in the input filename.

llvm-svn: 81537
 2009-09-11 18:01:28 +00:00
Dan Gohman
142428ce64 Eliminate more uses of llvm-as and llvm-dis. 
llvm-svn: 81293
 2009-09-09 00:09:15 +00:00
Dan Gohman
a3ab9b3b9e Convert a few more opt | llvm-dis to opt -S. 
llvm-svn: 81261
 2009-09-08 22:41:33 +00:00
Dan Gohman
c95df8b6d8 Use opt -S instead of piping bitcode output through llvm-dis. 
llvm-svn: 81257
 2009-09-08 22:34:10 +00:00
Dan Gohman
8d84372836 Change these tests to feed the assembly files to opt directly, instead 
of using llvm-as, now that opt supports this.

llvm-svn: 81226
 2009-09-08 16:50:01 +00:00
Andreas Neustifter
d842a676d6 Updated tests to use ProfileVerifer to test ProfileLoader and ProfileEstimator. 
(Keep disabled test disabled until selfhosted build issue is resolved.)

llvm-svn: 81008
 2009-09-04 17:21:59 +00:00
Daniel Dunbar
e1e99bbb67 Revert "--- Reverse-merging r80908 into '.':", I already "fixed" this. 
llvm-svn: 80970
 2009-09-03 23:40:10 +00:00
Bill Wendling
faf3fd8b85 --- Reverse-merging r80908 into '.': 
D    test/Analysis/Profiling

--- Reverse-merging r80907 into '.':
U    lib/Analysis/ProfileInfoLoaderPass.cpp

Attempt to remove failure in the self-hosting build bot.

llvm-svn: 80966
 2009-09-03 23:13:46 +00:00
Daniel Dunbar
23700a97d2 Disable some parts of the profiling-tool-chain test, which is currently failing 
on a self-hosted build (although it seems to work on non-self hosted). I'll work
with Andreas to figure this out.

llvm-svn: 80947
 2009-09-03 21:09:53 +00:00
Daniel Dunbar
eed0ecc21a Reapply profiling tests. 
llvm-svn: 80908
 2009-09-03 07:38:00 +00:00
Andreas Neustifter
3418f26ee5 Removed temporarily because of breaking Darwin builds. 
(See http://lists.cs.uiuc.edu/pipermail/llvm-commits/Week-of-Mon-20090831/086214.html)

llvm-svn: 80799
 2009-09-02 16:47:24 +00:00
Andreas Neustifter
3b25ffcef0 Changed profiling-tool-chain.ll test to use optimal-edge-profiling instead of 
edge-profiling, this is more useful since the loading of the
optimal-edge-profiling is more complicated.
The edge-profiling is tested in edge-profiling.ll where only the
instrumentation is tested.

llvm-svn: 80791
 2009-09-02 14:24:08 +00:00
Daniel Dunbar
3b7954c9bf Don't force the triple or data layout in this test. We just have to get them 
from the host and hope that works.

llvm-svn: 80751
 2009-09-02 02:43:11 +00:00
Chris Lattner
4c06cf3a4f rename test so that name reflects what it is testing for. 
llvm-svn: 80519
 2009-08-30 21:36:39 +00:00
Chris Lattner
0ad4b1ca5e convert to filecheck format. 
llvm-svn: 80518
 2009-08-30 21:36:06 +00:00
Torok Edwin
f1fbd8af64 rm needs -f 
llvm-svn: 80363
 2009-08-28 14:05:07 +00:00
Torok Edwin
b9c2b743ea Remove the llvmprof.out from the test output, otherwise running 
make check in a non-clean directory causes it to fail (for example when running
make check twice), since execution counts will differ.

llvm-svn: 80362
 2009-08-28 13:35:44 +00:00
Andreas Neustifter
c2d92270a2 Remove profiling output file because two consecutive runs of make check give 
error.

llvm-svn: 80357
 2009-08-28 10:38:26 +00:00
Andreas Neustifter
e4c8ff4447 Removed unnecessary file creation during test. 
llvm-svn: 80356
 2009-08-28 10:07:41 +00:00
Andreas Neustifter
da88343196 Pulled all tests into one test. Removed some redundant tests. Rename. 
llvm-svn: 80355
 2009-08-28 10:00:28 +00:00
Andreas Neustifter
233f8ec4db Readded test from r79615, this tests the complete profiling tool chain. Furhter 
tests can test only parts of this system.

llvm-svn: 80348
 2009-08-28 06:41:00 +00:00
Dan Gohman
cfb6234d13 Create a ScalarEvolution-based AliasAnalysis implementation. 
This is a simple AliasAnalysis implementation which works by making
ScalarEvolution queries. ScalarEvolution has a more complete understanding
of arithmetic than BasicAA's collection of ad-hoc checks, so it handles
some cases that BasicAA misses, for example p[i] and p[i+1] within the
same iteration of a loop.

This is currently experimental. It may be that the main use for this pass
will be to help find cases where BasicAA can be profitably extended, or
to help in the development of the overall AliasAnalysis infrastructure,
however it's also possible that it could grow up to become a directly
useful pass.

llvm-svn: 80098
 2009-08-26 14:53:06 +00:00
Andreas Neustifter
fb55ceecf3 Removed profiling test, lli not available on all platforms. 
llvm-svn: 79633
 2009-08-21 15:27:35 +00:00
Andreas Neustifter
b11ab6b931 Added tests for Profiling Infrastructure. 
llvm-svn: 79615
 2009-08-21 09:36:28 +00:00
Dan Gohman
7965c57a0f Loosen up the regex for this test so that it doesn't implicitly 
depend on TargetData information.

llvm-svn: 79491
 2009-08-19 23:19:36 +00:00
Dan Gohman
9f80d2be6b Make LLVM Assembly dramatically easier to read by aligning the comments, 
using formatted_raw_ostream's PadToColumn.

Before:

bb1:            ; preds = %bb
  %2 = sext i32 %i.01 to i64            ; <i64> [#uses=1]
  %3 = getelementptr double* %p, i64 %2         ; <double*> [#uses=1]
  %4 = load double* %3, align 8         ; <double> [#uses=1]
  %5 = fmul double %4, 1.100000e+00             ; <double> [#uses=1]
  %6 = sext i32 %i.01 to i64            ; <i64> [#uses=1]
  %7 = getelementptr double* %p, i64 %6         ; <double*> [#uses=1]

After:

bb1:                                        ; preds = %bb
  %2 = sext i32 %i.01 to i64                ; <i64> [#uses=1]
  %3 = getelementptr double* %p, i64 %2     ; <double*> [#uses=1]
  %4 = load double* %3, align 8             ; <double> [#uses=1]
  %5 = fmul double %4, 1.100000e+00         ; <double> [#uses=1]
  %6 = sext i32 %i.01 to i64                ; <i64> [#uses=1]
  %7 = getelementptr double* %p, i64 %6     ; <double*> [#uses=1]

Several tests required whitespace adjustments.

llvm-svn: 78816
 2009-08-12 17:23:50 +00:00
Andreas Bolka
facd1be2d6 Add another Strong-SIV testcase. 
llvm-svn: 78446
 2009-08-08 00:21:49 +00:00
Andreas Bolka
8c032970b9 Fix Strong-SIV testcase. 
llvm-svn: 78384
 2009-08-07 15:42:32 +00:00
Andreas Bolka
4d59f26912 ZIV tester for LDA. 
llvm-svn: 78157
 2009-08-05 04:26:05 +00:00
Andreas Bolka
1532dc3110 Fix LDA testcases. 
llvm-svn: 78153
 2009-08-05 04:03:29 +00:00
Andreas Bolka
d713824363 Expand LDA testcases. 
llvm-svn: 77926
 2009-08-02 23:28:14 +00:00
Andreas Bolka
7d6b4c24e6 Slightly reformat LDA tests to ease grepping. 
llvm-svn: 77398
 2009-07-28 23:40:40 +00:00
Dan Gohman
39c0d3b10a Change the assembly syntax for nsw, nuw, and exact, putting them 
after their associated opcodes rather than before. This makes them
a little easier to read.

llvm-svn: 77194
 2009-07-27 16:11:46 +00:00
Dan Gohman
c126330ef1 When attempting to sign-extend an addrec by interpreting 
the step value as unsigned, the start value and the addrec
itself still need to be treated as signed.

llvm-svn: 77078
 2009-07-25 16:03:30 +00:00
Dan Gohman
13aabe2ba4 Teach ScalarEvolution to make use of no-overflow flags when 
analyzing add recurrences.

llvm-svn: 77034
 2009-07-25 01:22:26 +00:00
Andreas Bolka
fa70ad653b FileCheck'ize and expand LDA testcases. 
llvm-svn: 76880
 2009-07-23 15:56:53 +00:00
Dan Gohman
190d29cb5c Replace the original ad-hoc code for determining whether (v pred w) implies 
(x pred y) with more thorough code that does more complete canonicalization
before resorting to range checks. This helps it find more cases where
the canonicalized expressions match.

llvm-svn: 76671
 2009-07-21 23:03:19 +00:00
Dan Gohman
7a836d6400 Add a testcase for PR4569, which is now fixed. 
llvm-svn: 76526
 2009-07-21 00:50:52 +00:00
Torok Edwin
bbccd95874 Introduce a pointertracking pass. 
For now this only computes the allocated size of the memory pointed to by a
pointer, and offset a pointer from allocated pointer.
The actual checkLimits part will come later, after another round of review.

llvm-svn: 75657
 2009-07-14 18:44:28 +00:00
Dan Gohman
5d53d0b73b Add testcases for PR4538, PR4537, and PR4534. 
llvm-svn: 75533
 2009-07-13 22:30:31 +00:00
Nick Lewycky
d9573d899d When comparing constants, consider a less wide constant to be "less complex" 
than a wider one, before trying to compare their contents which will crash
if their sizes are different.

llvm-svn: 74792
 2009-07-04 17:24:52 +00:00
Andreas Bolka
71ef361d1d Array accesses are independent if the underlying arrays differ. 
llvm-svn: 74499
 2009-06-30 02:12:10 +00:00
Andreas Bolka
bed5622fb7 Print pairwise dependence results, add testcases. 
llvm-svn: 74402
 2009-06-28 00:35:22 +00:00
Dan Gohman
60844e20f0 Add a testcase demoing some of ScalarEvolution's new trip count logic. 
llvm-svn: 74049
 2009-06-24 01:22:30 +00:00