RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-26 22:42:46 +02:00
Code Issues Projects Releases Wiki Activity
41,643 Commits 4 Branches 5 Tags 704 MiB
3d2e449078
Commit Graph

1858 Commits

Author SHA1 Message Date
Owen Anderson
392a40e40a Fix for PR2190. Memdep's non-local caching was checking dirtied blocks in the 
wrong order.

llvm-svn: 49499
 2008-04-10 22:13:32 +00:00
Daniel Berlin
b8533b394a Fix PR 2169. 
llvm-svn: 49339
 2008-04-07 14:20:50 +00:00
Gabor Greif
6c6b8a57f3 API changes for class Use size reduction, wave 1. 
Specifically, introduction of XXX::Create methods
for Users that have a potentially variable number of
Uses.

llvm-svn: 49277
 2008-04-06 20:25:17 +00:00
Dan Gohman
f7dfe555d7 Set blockBegin to point to the beginning of the block, 
not the end.

llvm-svn: 48999
 2008-03-31 22:08:00 +00:00
Erick Tryzelaar
847ee3e279 Expose Function::viewCFG and Function::viewCFGOnly to bindings. 
llvm-svn: 48982
 2008-03-31 16:22:09 +00:00
Chris Lattner
a69d949942 minor code cleanups, allow constant folding sinf/cosf. 
llvm-svn: 48961
 2008-03-30 18:02:00 +00:00
Dan Gohman
a363ba510c Don't include <map> in Pass.h, which doesn't need it. This requires 
adding <map> to many files that actually do need it.

llvm-svn: 48667
 2008-03-21 23:51:57 +00:00
Devang Patel
1b64c7d1e5 These passes preserve CFG. 
This patch fixes Benchmarks/Trimaran/enc-pc1/enc-pc1 failure reported by Grawp-PIC i386 nightly tester

llvm-svn: 48623
 2008-03-20 23:27:18 +00:00
Andrew Lenharth
6e32942dfa enable -analyze for andersens 
llvm-svn: 48601
 2008-03-20 15:36:44 +00:00
Devang Patel
f15fe34521 Restore isCFGOnly property of various analysis passes. 
llvm-svn: 48579
 2008-03-20 02:25:21 +00:00
Devang Patel
5e8cbbea65 PassInfo keep tracks whether a pass is an analysis pass or not. 
llvm-svn: 48554
 2008-03-19 21:56:59 +00:00
Devang Patel
38f181fa8c Do not use virtual function to identify an analysis pass. 
llvm-svn: 48520
 2008-03-19 00:48:41 +00:00
Daniel Berlin
0f20fa71ba Fix PR 2160 by making sure arguments to external functions get marked as pointing to anything 
llvm-svn: 48509
 2008-03-18 22:22:53 +00:00
Scott Michel
889ee011f7 Dial down gcc's warnings: don't use 0UL when 0U suffices (and when the 
variables and methods themselves only use unsigned.)

llvm-svn: 48492
 2008-03-18 16:55:06 +00:00
Devang Patel
811ca3ddba Identify Analysis pass. 
Do not run analysis pass again if analysis info is still available.
This fixes PR1441.

llvm-svn: 48476
 2008-03-18 00:39:19 +00:00
Daniel Berlin
2a8fd44b9d Add Hybrid Cycle Detection to Andersen's analysis. 
Patch by Curtis Dunham.

llvm-svn: 47959
 2008-03-05 19:31:47 +00:00
Gabor Greif
fd0fb616f8 Fix http://llvm.org/bugs/show_bug.cgi?id=2104 by ordering lexicographically what gets printed. Be const-correct in PrintResults and uninline it too 
llvm-svn: 47712
 2008-02-28 08:38:45 +00:00
Bill Wendling
af80fae2a7 De-tabify. 
llvm-svn: 47598
 2008-02-26 10:51:52 +00:00
Evan Cheng
e283043860 Temporarily reverting 46959. 
llvm-svn: 47542
 2008-02-25 03:57:32 +00:00
Dan Gohman
0220a930c7 Change a C-style cast to const_cast, to avoid a -Wcast-qual warning. 
llvm-svn: 47437
 2008-02-21 17:33:24 +00:00
Nick Lewycky
3df036a7bf Simplify this code, no functionality change. 
llvm-svn: 47434
 2008-02-21 09:14:53 +00:00
Nick Lewycky
5f7dc506e1 GlobalValues are Constants, remove redundant code. Also fix typo in a comment. 
llvm-svn: 47433
 2008-02-21 08:34:02 +00:00
Anton Korobeynikov
0c5e186924 Unbreak build with gcc 4.3: provide missed includes and silence most annoying warnings. 
llvm-svn: 47367
 2008-02-20 11:08:44 +00:00
Nick Lewycky
4df6c66b42 Use getConstant for ConstantInts. 
llvm-svn: 47361
 2008-02-20 06:58:55 +00:00
Nick Lewycky
0b6cdd1eff Add 'umax' similar to 'smax' SCEV. Closes PR2003. 
Parse reversed smax and umax as smin and umin and express them with negative
or binary-not SCEVs (which are really just subtract under the hood).

Parse 'xor %x, -1' as (-1 - %x).

Remove dead code (ConstantInt::get always returns a ConstantInt).

Don't use getIntegerSCEV(-1, Ty). The first value is an int, then it gets
passed into a uint64_t. Instead, create the -1 directly from
ConstantInt::getAllOnesValue().

llvm-svn: 47360
 2008-02-20 06:48:22 +00:00
Duncan Sands
1bba49ca55 Fix a compiler warning. 
llvm-svn: 47328
 2008-02-19 09:28:48 +00:00
Owen Anderson
3efff61819 In addition to arguments passed to it, memcpy (and all other calls) can ModRef pointers that alias their arguments as well. This fixes PR2057. 
llvm-svn: 47317
 2008-02-19 06:47:18 +00:00
Chris Lattner
57eff5b5f5 don't bother calling getUnderlyingObject for non-pointers. 
llvm-svn: 47272
 2008-02-18 17:28:21 +00:00
Owen Anderson
f3107c8546 Since we're not checking for the more general AllocationInst first, we need to explicitly check 
that Object is an Argument before casting it to one.

llvm-svn: 47268
 2008-02-18 10:11:00 +00:00
Owen Anderson
1b743c32fd This check is not correct for mallocs, so exclude them earlier. 
llvm-svn: 47263
 2008-02-18 09:11:02 +00:00
Owen Anderson
b0891af18b Fix a comment, and a bug where we weren't applying the tail call logic in cases that failed the first test. 
llvm-svn: 47253
 2008-02-18 03:52:21 +00:00
Owen Anderson
0ef73a5d06 Fix bugs that Chris noticed in my last patch. 
llvm-svn: 47252
 2008-02-18 02:31:23 +00:00
Chris Lattner
d5885d43ef bitcasts of pointers are always pointers. 
If we see a memcpy of a pointer, make sure to check later
uses of the pointer as well.

llvm-svn: 47250
 2008-02-18 02:11:28 +00:00
Owen Anderson
884f6801df Teach getModRefInfo that memcpy, memmove, and memset don't "capture" memory addresses. 
Also, noalias arguments are be considered "like" stack allocated ones for this purpose, because
the only way they can be modref'ed is if they escape somewhere in the current function.

llvm-svn: 47247
 2008-02-17 21:29:08 +00:00
Wojciech Matyjewicz
a62f8557d9 Fix typo. Thanks to Duncan for noticing. 
llvm-svn: 47062
 2008-02-13 12:21:32 +00:00
Wojciech Matyjewicz
86032c3a2f Add comments as per review feedback. 
llvm-svn: 47061
 2008-02-13 11:51:34 +00:00
Owen Anderson
274aa2846e Re-apply the patch to improve the optimizations of memcpy's, with several 
bugs fixed.  This now passes PPC bootstrap.

llvm-svn: 47026
 2008-02-12 21:15:18 +00:00
Wojciech Matyjewicz
b6e6dacc60 Fix PR2002. Suppose n is the initial value for the induction 
variable (with step 1) and m is its final value. Then, the correct trip 
count is SMAX(m,n)-n. Previously, we used SMAX(0,m-n), but m-n may 
overflow and can't in general be interpreted as signed.

Patch by Nick Lewycky.

llvm-svn: 47007
 2008-02-12 15:09:36 +00:00
Wojciech Matyjewicz
2874a19254 If the LHS of the comparison is a loop-invariant we also want to move it 
to the RHS. This simple change allows to compute loop iteration count 
for loops with condition similar to the one in the testcase (which seems 
to be quite common).

llvm-svn: 46959
 2008-02-11 18:37:34 +00:00
Wojciech Matyjewicz
76c2b22ee4 Fix PR1798 - an error in the evaluation of SCEVAddRecExpr at an 
arbitrary iteration.

The patch:
1) changes SCEVSDivExpr into SCEVUDivExpr,
2) replaces PartialFact() function with BinomialCoefficient(); the 
computations (essentially, the division) in BinomialCoefficient() are 
performed with the apprioprate bitwidth necessary to avoid overflow; 
unsigned division is used instead of the signed one.

Computations in BinomialCoefficient() require support from the code 
generator for APInts. Currently, we use a hack rounding up the 
neccessary bitwidth to the nearest power of 2. The hack is easy to turn 
off in future.

One remaining issue: we assume the divisor of the binomial coefficient 
formula can be computed accurately using 16 bits. It means we can handle 
AddRecs of length up to 9. In future, we should use APInts to evaluate 
the divisor.

Thanks to Nicholas for cooperation!

llvm-svn: 46955
 2008-02-11 11:03:14 +00:00
Wojciech Matyjewicz
8095000596 We should check that existing cast operation has the appropriate opcode before we reuse it. 
llvm-svn: 46908
 2008-02-09 18:30:13 +00:00
Tanya Lattner
1234229bc7 Throttle the non-local dependence analysis for basic blocks with more than 50 predecessors. Added command line option to play with this threshold. 
llvm-svn: 46790
 2008-02-06 00:54:55 +00:00
Owen Anderson
28d90a4a6a Fix an obscure read-after-free bug that Duncan found. 
llvm-svn: 46738
 2008-02-05 04:34:03 +00:00
Dan Gohman
562ed58408 Avoid unnecessarily casting away const, fixing a FIXME. 
llvm-svn: 46591
 2008-01-31 01:05:10 +00:00
Owen Anderson
7d21431939 Fix an issue where, under very specific circumstances, memdep could end up dereferencing the end 
of one of its internal maps.

llvm-svn: 46541
 2008-01-30 01:24:05 +00:00
Chris Lattner
2c3646ea4a getUnderlyingObject can return null, handle this. 
llvm-svn: 46318
 2008-01-24 19:07:10 +00:00
Chris Lattner
cd5013eb2f Teach basicaa that 'byval' arguments define a new memory location that 
can't be aliased to other known objects.  This allows us to know that byval 
pointer args don't alias globals, etc.

llvm-svn: 46315
 2008-01-24 18:00:32 +00:00
Nick Lewycky
ea4de32234 Don't be rude, emit debugging info where asked to. 
llvm-svn: 45485
 2008-01-02 02:49:20 +00:00
Chris Lattner
ad9a6ccb83 Remove attribution from file headers, per discussion on llvmdev. 
llvm-svn: 45418
 2007-12-29 20:36:04 +00:00
Chris Lattner
8193d4af33 remove attribution from lib Makefiles. 
llvm-svn: 45415
 2007-12-29 20:09:26 +00:00
Gordon Henriksen
46137f1e2e Adding bindings for memory buffers and module providers. Switching 
to exceptions rather than variants for error handling in Ocaml.

llvm-svn: 45226
 2007-12-19 22:30:40 +00:00
Dan Gohman
80af3e255d Add explicit keywords, and fix a minor typo that they uncovered. 
llvm-svn: 45034
 2007-12-14 15:41:34 +00:00
Wojciech Matyjewicz
d76f256282 Make these loops follow GetGEPOperands() behavior. 
Let: %q = GEP %p, X, ...
If %p is a GEP, we can chase baseptr further, only if X==0.

llvm-svn: 44999
 2007-12-13 16:22:58 +00:00
Duncan Sands
998cd21867 Revert r44626, which turned off the use of readonly 
and readnone for functions with bodies because it
broke llvm-gcc-4.2 bootstrap.  It turns out that,
because of LLVM's array_ref hack, gcc was computing
pure/const attributes wrong (now fixed by turning
off the gcc ipa-pure-const pass).

llvm-svn: 44937
 2007-12-12 16:01:40 +00:00
Chris Lattner
77ca8bde9d Fix a bug in my previous patch, thanks to Jay Foad for 
pointing this out and correcting the patch!

llvm-svn: 44907
 2007-12-12 03:56:54 +00:00
Daniel Berlin
fcce408d12 Changes from Curtis Dunham implementing lazy cycle detection algorithm. 
Changes from me implementing different way of representing points-to anything.
Changes from me that improve slightly on LCD.

llvm-svn: 44895
 2007-12-12 00:37:04 +00:00
Chris Lattner
568d56425b Implement constant folding if vector<->vector bitcasts where the number 
of source/dest elements changes.  This implements
test/Transforms/InstCombine/bitcast-vector-fold.ll

llvm-svn: 44855
 2007-12-11 07:29:44 +00:00
Chris Lattner
5ca42cd342 Fix PR1850 by removing an unsafe transformation from VMCore/ConstantFold.cpp. 
Reimplement the xform in Analysis/ConstantFolding.cpp where we can use
targetdata to validate that it is safe.  While I'm in there, fix some const
correctness issues and generalize the interface to the "operand folder".

llvm-svn: 44817
 2007-12-10 22:53:04 +00:00
Chris Lattner
95f9743c43 Fix PR1782, patch by Wojtek Matyjewicz! 
llvm-svn: 44733
 2007-12-09 07:35:13 +00:00
Owen Anderson
e3de18ac1d Fix several cache coherence bugs in MemDep/GVN that were found. Also add some (disabled) debugging code 
to make such problems easier to diagnose in the future, written by Duncan Sands.

llvm-svn: 44695
 2007-12-08 01:37:09 +00:00
Duncan Sands
928143423b Commit 44487 broke bootstrap of llvm-gcc-4.2. It is 
not yet clear why, but in the meantime work around the
problem by making less use of readnone/readonly info.

llvm-svn: 44626
 2007-12-05 21:03:28 +00:00
Duncan Sands
1e2e4972ff Rather than having special rules like "intrinsics cannot 
throw exceptions", just mark intrinsics with the nounwind
attribute.  Likewise, mark intrinsics as readnone/readonly
and get rid of special aliasing logic (which didn't use
anything more than this anyway).

llvm-svn: 44544
 2007-12-03 20:06:50 +00:00
Duncan Sands
14f11d6836 Integrate the readonly/readnone logic more deeply 
into alias analysis.  This meant updating the API
which now has versions of the getModRefBehavior,
doesNotAccessMemory and onlyReadsMemory methods
which take a callsite parameter.  These should be
used unless the callsite is not known, since in
general they can do a better job than the versions
that take a function.  Also, users should no longer
call the version of getModRefBehavior that takes
both a function and a callsite.  To reduce the
chance of misuse it is now protected.

llvm-svn: 44487
 2007-12-01 07:51:45 +00:00
Chris Lattner
c75545d4a8 chain update requests properly. 
llvm-svn: 44460
 2007-11-30 18:52:58 +00:00
Duncan Sands
1b0feb42e2 Add some convenience methods for querying attributes, and 
use them.

llvm-svn: 44403
 2007-11-28 17:07:01 +00:00
Duncan Sands
3602011bec Fix PR1146: parameter attributes are longer part of 
the function type, instead they belong to functions
and function calls.  This is an updated and slightly
corrected version of Reid Spencer's original patch.
The only known problem is that auto-upgrading of
bitcode files doesn't seem to work properly (see
test/Bitcode/AutoUpgradeIntrinsics.ll).  Hopefully
a bitcode guru (who might that be? :) ) will fix it.

llvm-svn: 44359
 2007-11-27 13:23:08 +00:00
Owen Anderson
43d4a82d4b Make LoopInfoBase more generic, in preparation for having MachineLoopInfo. This involves a small interface change. 
llvm-svn: 44348
 2007-11-27 03:43:35 +00:00
Owen Anderson
8b919de439 Fix a silly bug that Nicholas noticed. 
llvm-svn: 44324
 2007-11-26 03:27:38 +00:00
Owen Anderson
05275b7b14 Allow GVN to eliminate read-only function calls when it can detect that they are redundant. 
llvm-svn: 44323
 2007-11-26 02:26:36 +00:00
Nick Lewycky
1536b3f230 Add new SCEV, SCEVSMax. This allows LLVM to analyze do-while loops. 
llvm-svn: 44319
 2007-11-25 22:41:31 +00:00
Chris Lattner
cdc6bbd519 simplify some code. 
llvm-svn: 44295
 2007-11-23 22:36:49 +00:00
Chris Lattner
f9379ef949 splice some lines together, no functionality change. 
llvm-svn: 44292
 2007-11-23 22:34:59 +00:00
Duncan Sands
265752ae8f Ding dong, the DoesntAccessMemoryFns and 
OnlyReadsMemoryFns tables are dead!  We
get more, and more accurate, information
from gcc via the readnone and readonly
function attributes.

llvm-svn: 44288
 2007-11-23 19:30:27 +00:00
Chris Lattner
ac2de0424b Fix a bug where we'd try to find a scev value for a bitcast operand, 
even though the bitcast operand did not have integer type.  This fixes
PR1814.

llvm-svn: 44286
 2007-11-23 08:46:22 +00:00
Duncan Sands
703986d327 Teach alias analysis about readnone/readonly functions. 
Based on a patch by Török Edwin.

llvm-svn: 44279
 2007-11-22 21:43:27 +00:00
Nick Lewycky
aff0962501 Instead of calculating constant factors, calculate the number of trailing 
bits. Patch from Wojciech Matyjewicz.

llvm-svn: 44268
 2007-11-22 07:59:40 +00:00
Nick Lewycky
e34dd3a90f Create nodes for inline asm so that we don't crash looking for the node later. 
llvm-svn: 44267
 2007-11-22 03:07:37 +00:00
Nick Lewycky
bb69ad8a1b Small cleanup. Use APInt::getHighBitsSet method instead of shift left. 
"setcc" -> "icmp op" in comments. No functionality change.

llvm-svn: 44249
 2007-11-20 08:44:50 +00:00
Nick Lewycky
f1d30ded71 Be more careful when transforming | to +. Patch from Wojciech Matyjewicz. 
llvm-svn: 44248
 2007-11-20 08:24:44 +00:00
Tanya Lattner
a3d1741c70 Fix for PR1801 
llvm-svn: 44193
 2007-11-16 22:44:50 +00:00
Anton Korobeynikov
c9ab2516fa Reverted r44163 per request 
llvm-svn: 44177
 2007-11-15 18:33:16 +00:00
Nick Lewycky
6690b9499b Fix handling of overflow in loop calculation by adding new UDiv SCEV. This SCEV 
is disabled in the sense that it will refuse to create one from a UDiv
instruction, until the code is better tested.

llvm-svn: 44163
 2007-11-15 06:30:50 +00:00
Owen Anderson
b88ac41e0e More templatization. 
llvm-svn: 44158
 2007-11-15 05:00:15 +00:00
Owen Anderson
7b92dab615 Start the process of making MachineLoopInfo possible by templating Loop. 
llvm-svn: 44097
 2007-11-14 02:33:58 +00:00
Chris Lattner
02a91dce21 Fix PR1774 and BasicAA/2007-11-05-SizeCrash.ll 
llvm-svn: 43756
 2007-11-06 05:58:42 +00:00
Duncan Sands
eb464e976f Executive summary: getTypeSize -> getTypeStoreSize / getABITypeSize. 
The meaning of getTypeSize was not clear - clarifying it is important
now that we have x86 long double and arbitrary precision integers.
The issue with long double is that it requires 80 bits, and this is
not a multiple of its alignment.  This gives a primitive type for
which getTypeSize differed from getABITypeSize.  For arbitrary precision
integers it is even worse: there is the minimum number of bits needed to
hold the type (eg: 36 for an i36), the maximum number of bits that will
be overwriten when storing the type (40 bits for i36) and the ABI size
(i.e. the storage size rounded up to a multiple of the alignment; 64 bits
for i36).

This patch removes getTypeSize (not really - it is still there but
deprecated to allow for a gradual transition).  Instead there is:

(1) getTypeSizeInBits - a number of bits that suffices to hold all
values of the type.  For a primitive type, this is the minimum number
of bits.  For an i36 this is 36 bits.  For x86 long double it is 80.
This corresponds to gcc's TYPE_PRECISION.

(2) getTypeStoreSizeInBits - the maximum number of bits that is
written when storing the type (or read when reading it).  For an
i36 this is 40 bits, for an x86 long double it is 80 bits.  This
is the size alias analysis is interested in (getTypeStoreSize
returns the number of bytes).  There doesn't seem to be anything
corresponding to this in gcc.

(3) getABITypeSizeInBits - this is getTypeStoreSizeInBits rounded
up to a multiple of the alignment.  For an i36 this is 64, for an
x86 long double this is 96 or 128 depending on the OS.  This is the
spacing between consecutive elements when you form an array out of
this type (getABITypeSize returns the number of bytes).  This is
TYPE_SIZE in gcc.

Since successive elements in a SequentialType (arrays, pointers
and vectors) need to be aligned, the spacing between them will be
given by getABITypeSize.  This means that the size of an array
is the length times the getABITypeSize.  It also means that GEP
computations need to use getABITypeSize when computing offsets.
Furthermore, if an alloca allocates several elements at once then
these too need to be aligned, so the size of the alloca has to be
the number of elements multiplied by getABITypeSize.  Logically
speaking this doesn't have to be the case when allocating just
one element, but it is simpler to also use getABITypeSize in this
case.  So alloca's and mallocs should use getABITypeSize.  Finally,
since gcc's only notion of size is that given by getABITypeSize, if
you want to output assembler etc the same as gcc then getABITypeSize
is the size you want.

Since a store will overwrite no more than getTypeStoreSize bytes,
and a read will read no more than that many bytes, this is the
notion of size appropriate for alias analysis calculations.

In this patch I have corrected all type size uses except some of
those in ScalarReplAggregates, lib/Codegen, lib/Target (the hard
cases).  I will get around to auditing these too at some point,
but I could do with some help.

Finally, I made one change which I think wise but others might
consider pointless and suboptimal: in an unpacked struct the
amount of space allocated for a field is now given by the ABI
size rather than getTypeStoreSize.  I did this because every
other place that reserves memory for a type (eg: alloca) now
uses getABITypeSize, and I didn't want to make an exception
for unpacked structs, i.e. I did it to make things more uniform.
This only effects structs containing long doubles and arbitrary
precision integers.  If someone wants to pack these types more
tightly they can always use a packed struct.

llvm-svn: 43620
 2007-11-01 20:53:16 +00:00
Dan Gohman
65be3b6502 Add explicit keywords. 
llvm-svn: 43464
 2007-10-29 19:52:04 +00:00
Owen Anderson
8bf547855a Make a comment better. 
llvm-svn: 43379
 2007-10-26 03:47:14 +00:00
Hartmut Kaiser
d57d01b8e0 Silenced a VC++ warning. 
llvm-svn: 43374
 2007-10-25 23:49:14 +00:00
Owen Anderson
6cc4e90741 Fix for PR1741. 
llvm-svn: 43326
 2007-10-25 02:36:18 +00:00
Owen Anderson
33b9693ab8 Make DomTree and PostDomTree thin wrappers around DomTreeBase, rather than inheriting from it. 
llvm-svn: 43259
 2007-10-23 20:58:37 +00:00
Dan Gohman
68fc6d7395 Move the SCEV object factors from being static members of the individual 
SCEV subclasses to being non-static member functions of the ScalarEvolution
class.

llvm-svn: 43224
 2007-10-22 18:31:58 +00:00
Owen Anderson
43fefb53a6 Template DominatorTreeBase by node type. This is the next major step towards 
having dominator information on MBB's.

llvm-svn: 43036
 2007-10-16 19:59:25 +00:00
Gordon Henriksen
06eeba26c1 Bindings for the verifier. 
llvm-svn: 42707
 2007-10-06 21:00:36 +00:00
Owen Anderson
cb51170957 Completely merge the implementation details of DomTree and PostDomTree. 
Also, add a FIXME for a bug in PostDomTree calculation I noticed while writing this,

llvm-svn: 42593
 2007-10-03 21:25:45 +00:00
Dan Gohman
30ba45b569 Use empty() member functions when that's what's being tested for instead 
of comparing begin() and end().

llvm-svn: 42585
 2007-10-03 19:26:29 +00:00
Owen Anderson
91e23d710c Factor some code from the DomTree and PostDomTree calculate methods up into 
each one's runOnFunction method.

llvm-svn: 42563
 2007-10-03 03:20:17 +00:00
Dale Johannesen
a4e3643cb3 Rewrite sqrt and powi to use anyfloat. By popular demand. 
llvm-svn: 42537
 2007-10-02 17:43:59 +00:00
Owen Anderson
09ba812a80 Template-ize more of the DomTree internal implementation details. Only the calculate() methods for DomTree and PostDomTree remain to be merged/template-ized. 
llvm-svn: 42476
 2007-09-30 04:17:16 +00:00
Chris Lattner
1654385fd0 Add a new DenseSet abstraction. 
llvm-svn: 42474
 2007-09-30 00:47:20 +00:00
Daniel Berlin
90642519e9 Switch to densemap rather than std::set 
llvm-svn: 42462
 2007-09-29 00:50:40 +00:00
Owen Anderson
bc2f1ab49d Remove unneeded #include. 
llvm-svn: 42428
 2007-09-28 01:25:07 +00:00
Owen Anderson
a533c458f5 Have PostDomTree use the newly templated DFSPass. 
llvm-svn: 42427
 2007-09-28 01:23:47 +00:00
Dale Johannesen
e61886cee4 Add sqrt and powi intrinsics for long double. 
llvm-svn: 42423
 2007-09-28 01:08:20 +00:00
Daniel Berlin
b3d303b103 Ignore redundant constraints 
llvm-svn: 42397
 2007-09-27 15:42:23 +00:00
Nick Lewycky
a44e458ddc Build the correct range for loops with unusual bounds. Fix from Jay Foad. 
llvm-svn: 42394
 2007-09-27 14:12:54 +00:00
Duncan Sands
db0b588ea2 Add a newline to the end of this file. 
llvm-svn: 42314
 2007-09-25 20:08:48 +00:00
Bill Wendling
9390abcf16 Don't execute dump unless NDEBUG isn't defined. 
llvm-svn: 42280
 2007-09-24 22:43:48 +00:00
Daniel Berlin
f6cb4c3d65 Comment fixups 
llvm-svn: 42279
 2007-09-24 22:20:45 +00:00
Daniel Berlin
f900d1295f Implement offline variable substitution in order to reduce memory 
and time usage.
Fixup operator == to make this work, and add a resize method to DenseMap
so we can resize our hashtable once we know how big it should be.

llvm-svn: 42269
 2007-09-24 19:45:49 +00:00
Owen Anderson
a0a11ee8b9 Merge significant portions of the DomTree and PostDomTree implementations. 
The two remaining unmerged parts are DFSPass, and the Calculate().

llvm-svn: 42255
 2007-09-24 02:29:29 +00:00
Owen Anderson
bc099e74d8 Factor the calculation details for PostDomTree out of PostDominators.cpp and 
into a separate header file.

Next step: merging PostDominatorCalculation.h with DominatorCalculation.h.

llvm-svn: 42251
 2007-09-23 22:21:00 +00:00
Owen Anderson
9070cf6dea Add partial caching of non-local memory dependence queries. This provides a modest 
speedup for GVN.

llvm-svn: 42185
 2007-09-21 03:53:52 +00:00
Owen Anderson
5454d4cbc9 Add a flag to mark a dirty cache entry. This is not yet used, but will eventually 
help non-local memdep caching.

llvm-svn: 42137
 2007-09-19 16:13:57 +00:00
Devang Patel
d9c8d99cac ooops... 
llvm-svn: 42118
 2007-09-18 23:58:14 +00:00
Daniel Berlin
d44b2016ca Fix bug in andersen's related to test_and_set. 
Add operator == and != to SparseBitVector.
Simplify code for test_and_set

llvm-svn: 42018
 2007-09-16 23:59:53 +00:00
Daniel Berlin
3625ac77e4 Rewrite of andersen's to be about 100x faster, cleaner, and begin to support field sensitivity 
llvm-svn: 42016
 2007-09-16 21:45:02 +00:00
Dan Gohman
5f29ab68e1 Change "tmp." to "tmp" for temporaries created by ScalarEvolutionExpander 
for consistency with many other transforms.

llvm-svn: 41957
 2007-09-14 20:11:40 +00:00
Owen Anderson
3a7df6cf67 Fix a typo in memdep, which was causing PR1648. 
llvm-svn: 41833
 2007-09-11 04:31:00 +00:00
Owen Anderson
ab8a978ed7 Remove an un-needed dependence query. This improves compile time marginally on 401.bzip2. 
llvm-svn: 41792
 2007-09-09 21:43:49 +00:00
Owen Anderson
4b71e55287 Add lengthof and endof templates that hide a lot of sizeof computations. 
Patch by Sterling Stein!

llvm-svn: 41758
 2007-09-07 04:06:50 +00:00
Dale Johannesen
86f367a6b7 Next round of APFloat changes. 
Use APFloat in UpgradeParser and AsmParser.
Change all references to ConstantFP to use the
APFloat interface rather than double.  Remove
the ConstantFP double interfaces.
Use APFloat functions for constant folding arithmetic
and comparisons.
(There are still way too many places APFloat is
just a wrapper around host float/double, but we're
getting there.)

llvm-svn: 41747
 2007-09-06 18:13:44 +00:00
Evan Cheng
804e104123 Missing break. Patch by Wojciech Matyjewicz. 
llvm-svn: 41727
 2007-09-05 21:36:14 +00:00
Devang Patel
b86f1fdb3f Use SmallVector. 
llvm-svn: 41230
 2007-08-21 16:54:51 +00:00
Devang Patel
e92ff0baef No need to hardcode SmallVector size. 
llvm-svn: 41228
 2007-08-21 16:39:43 +00:00
Devang Patel
f06e667e9c Use SmallVector instead of std::vector. 
llvm-svn: 41207
 2007-08-21 00:31:24 +00:00
Anton Korobeynikov
4e15adaf04 - Use correct header for SCEV inside LoopPass.cpp 
- Move SCEVExpander::expand() out-of-line workarounding possible toolchain bug

llvm-svn: 41197
 2007-08-20 21:17:26 +00:00
Owen Anderson
03cbda804e Cache non-local memory dependence analysis. This is a significant compile 
time performance win in most cases.

llvm-svn: 41126
 2007-08-16 21:27:05 +00:00
Chris Lattner
afb3c33c2a constant fold ptrtoint(inttoptr) with target data when available. This allows 
us to fold the entry block of PR1602 to false instead of:

br i1 icmp eq (i32 and (i32 ptrtoint (void (%struct.S*)* inttoptr (i64
1 to void (%struct.S*)*) to i32), i32 1), i32 0), label %cond_next, label
%cond_true

llvm-svn: 41023
 2007-08-11 23:49:01 +00:00
Devang Patel
fa7277dd34 Do not overuse std::string. Pass around char * directly. 
llvm-svn: 41001
 2007-08-10 18:29:32 +00:00
Owen Anderson
3eba1e8f5c Make NonLocal and None const in the right way. :-) 
llvm-svn: 40961
 2007-08-09 04:42:44 +00:00
Owen Anderson
3db807751b Add more comments to memdep. 
llvm-svn: 40953
 2007-08-08 22:26:03 +00:00
Owen Anderson
d791c9f667 Make memdep fit in 80 cols. 
llvm-svn: 40950
 2007-08-08 22:01:54 +00:00
Owen Anderson
f988c3ee5c Change the None and NonLocal markers in memdep to be const. 
llvm-svn: 40946
 2007-08-08 21:39:39 +00:00
Chris Lattner
3e94308eb7 Handle functions with no name better. 
llvm-svn: 40926
 2007-08-08 16:07:23 +00:00
Chris Lattner
606d5bced1 significantly speed up constant folding of calls (and thus all clients that use 
ConstantFoldInstruction on calls) by avoiding Value::getName().  getName() constructs
and returns an std::string, which does heap allocation stuff.  This slightly speeds up
instcombine.

llvm-svn: 40924
 2007-08-08 06:55:43 +00:00
Chris Lattner
65d638a918 reimplement dfs number computation to be significantly faster. This speeds up 
natural loop canonicalization (which does many cfg xforms) by 4.3x, for 
example.  This also fixes a bug in postdom dfnumber computation.

llvm-svn: 40920
 2007-08-08 05:51:24 +00:00
Owen Anderson
22d94da65b Clean up a bunch of caching stuff in memdep. This reduces the time to run GVN 
on 403.gcc from ~15s to ~10s.

llvm-svn: 40884
 2007-08-07 00:33:45 +00:00
Owen Anderson
da58c95cd3 Improve the accuracy of memdep for determining the dependencies of loads. 
This brings GVN to parity with GCSE+LoadVN.

llvm-svn: 40882
 2007-08-06 23:26:03 +00:00
Chandler Carruth
67d3119773 This resolves a regression of BasicAA which failed to find any memory information for overloaded intrinsics (PR1600). This resolves that issue, and improves the matching scheme to use a BitVector rather than a binary search. 
llvm-svn: 40872
 2007-08-06 20:57:16 +00:00
Nick Lewycky
04447caa7b Let scalar-evolution analyze loops with an unsigned comparison for the exit 
condition. Fixes 1597.

llvm-svn: 40867
 2007-08-06 19:21:00 +00:00
Nick Lewycky
071a2c6a5e Don't assume it's safe to transform a loop just because it's dominated by any 
comparison. Fixes bug 1598.

llvm-svn: 40866
 2007-08-06 18:33:46 +00:00
Chris Lattner
428a773f45 Upgrade BasicAliasAnalysis::getModRefBehavior to not call Value::getName, 
which dynamically allocates the string result.  This speeds up dse on the
testcase from PR1432 from 0.3781s to 0.1804s (2.1x).

llvm-svn: 40838
 2007-08-05 07:50:06 +00:00
Chris Lattner
4b65325ba7 Fix an iterator invalidation bug I induced. 
llvm-svn: 40830
 2007-08-05 00:24:30 +00:00
Chris Lattner
7cdaff2298 Switch some std::sets to SmallPtrSet. This speeds up 
domtree by 10% and postdomtree by 17%

llvm-svn: 40829
 2007-08-05 00:15:57 +00:00
Chris Lattner
a5a692b9bb Switch the internal "Info" map from an std::map to a DenseMap. This 
speeds up idom by about 45% and postidom by about 33%.

Some extra precautions must be taken not to invalidate densemap iterators.

llvm-svn: 40827
 2007-08-05 00:02:00 +00:00
Chris Lattner
5912537997 switch the DomTreeNodes and IDoms maps in idom/postidom to a 
DenseMap instead of an std::map.  This speeds up postdomtree
by about 25% and domtree by about 23%.  It also speeds up clients,
for example, domfrontier by 11%, mem2reg by 4% and ADCE by 6%.

llvm-svn: 40826
 2007-08-04 23:48:07 +00:00
Chandler Carruth
00e56b0e81 This is the patch to provide clean intrinsic function overloading support in LLVM. It cleans up the intrinsic definitions and generally smooths the process for more complicated intrinsic writing. It will be used by the upcoming atomic intrinsics as well as vector and float intrinsics in the future. 
This also changes the syntax for llvm.bswap, llvm.part.set, llvm.part.select, and llvm.ct* intrinsics. They are automatically upgraded by both the LLVM ASM reader and the bitcode reader. The test cases have been updated, with special tests added to ensure the automatic upgrading is supported.

llvm-svn: 40807
 2007-08-04 01:51:18 +00:00
Owen Anderson
d617e4c963 Fix a bug that was causing several miscompilations on SPEC. 
llvm-svn: 40746
 2007-08-02 17:56:05 +00:00
Christopher Lamb
f27d856acd Implement review feedback. 
llvm-svn: 40745
 2007-08-02 17:52:00 +00:00
Christopher Lamb
9a2a58c818 Teach BasicAA about noalias parameter attributes, but do it correctly this time. 
llvm-svn: 40711
 2007-08-02 01:18:14 +00:00
Owen Anderson
7028dfaf9d Make non-local memdep not be recursive, and fix a bug on 403.gcc that this exposed. 
llvm-svn: 40692
 2007-08-01 22:01:54 +00:00
Dan Gohman
7dd04fb91c More explicit keywords. 
llvm-svn: 40673
 2007-08-01 15:32:29 +00:00
David Greene
4251f42689 Fix GLIBCXX_DEBUG error owing to dereference of end iterator. There's 
no guarantee that an instruction returned by getDependency exists in
the maps.

llvm-svn: 40647
 2007-07-31 20:01:27 +00:00
Christopher Lamb
5487dd14b4 Revert overly aggressive interpretation of noalias 
llvm-svn: 40635
 2007-07-31 16:18:07 +00:00
Devang Patel
6dd3a5f747 Introduce Simple Analysis interface for loop passes. 
Right now, this interface provides hooks for only to operations, 1) clone basic block 2) delete value.

llvm-svn: 40625
 2007-07-31 08:00:57 +00:00
Christopher Lamb
907892e47a Teach BasicAA about noalias function parameters. Passes all of DejaGNU and test-suite. 
llvm-svn: 40624
 2007-07-31 07:04:51 +00:00
Owen Anderson
fff534d147 Use more caching when computing non-local dependence. This makes bzip2 not 
use up the entire 32-bit address space.

llvm-svn: 40596
 2007-07-30 17:29:24 +00:00
Owen Anderson
ed3e63a203 Fix a bug introduced in my last commit. 
llvm-svn: 40542
 2007-07-26 18:57:04 +00:00
Owen Anderson
f2b10d3de3 Fix a couple more bugs in the phi construction by pulling in code that does 
almost the same things from LCSSA.

llvm-svn: 40540
 2007-07-26 18:26:51 +00:00
Owen Anderson
b215074820 Fix a bug in non-local memdep that was causing an infinite loop on 175.vpr. 
llvm-svn: 40495
 2007-07-25 21:26:36 +00:00
Owen Anderson
6a1a8d05b8 Add basic support for performing whole-function RLE. 
Note: This has not yet been thoroughly tested.  Use at your own risk.

llvm-svn: 40489
 2007-07-25 19:57:03 +00:00
Owen Anderson
b9ad251288 Add initial support for non-local memory dependence analysis. 
NOTE: This has only been cursorily tested.  Expected improvements soon.

llvm-svn: 40476
 2007-07-24 21:52:37 +00:00
Devang Patel
aa2a753350 Unreachable block is not a root node in post dominator tree. 
llvm-svn: 40458
 2007-07-24 01:02:25 +00:00
Owen Anderson
3a92d35e62 When removing instructions from the analysis, be sure to check the confirmed 
flag when determining what to do with dependencies.

llvm-svn: 40079
 2007-07-20 06:16:07 +00:00
Devang Patel
45675e56ad Verify loop info. 
llvm-svn: 40062
 2007-07-19 18:02:32 +00:00
Duncan Sands
8c6657894f Replace mysterious code causing a g++-4.2 warning 
with hopefully correct code that pleases g++-4.2.

llvm-svn: 40051
 2007-07-19 09:42:01 +00:00
Owen Anderson
efc00e35cf Add support for walking up memory def chains, which enables finding many more 
dead stores on 400.perlbench.

llvm-svn: 39929
 2007-07-16 21:52:50 +00:00
Dan Gohman
ef7c87f4d8 Use ConstantFoldFP for folding all unary floating-point operations which may 
have an error, and refector out the code for binary operators into
ConstantFoldBinaryFP and use it for all binary floating-point operations
which may have an error. These functions still rely exclusively on errno
to detect errors though.

llvm-svn: 39923
 2007-07-16 15:26:22 +00:00
Dan Gohman
0ba554c0c8 Fix comments about vectors to use the current wording. 
llvm-svn: 39921
 2007-07-16 14:29:03 +00:00
Nick Lewycky
43e5fd5be7 Handle decrementing loops properly. Fixes PR1533. 
Always pass the constant as the second parameter to HowManyLessThans.

Remove obsolete "isSigned" parameter.

llvm-svn: 39893
 2007-07-16 02:08:00 +00:00
Owen Anderson
b6211f5b50 Let MemoryDependenceAnalysis take care of updating AliasAnalysis. 
llvm-svn: 39769
 2007-07-12 00:06:21 +00:00
Owen Anderson
bb0f7c00ab Calculate the size of a array allocation correctly. 
llvm-svn: 38511
 2007-07-10 20:48:38 +00:00
Owen Anderson
04b3497eb7 Fix a crasher when finding the dependency of a call. 
llvm-svn: 38510
 2007-07-10 20:39:07 +00:00
Owen Anderson
b11a2f3a32 Make this pass registration static as well. 
llvm-svn: 38509
 2007-07-10 20:21:08 +00:00
Owen Anderson
6c92149ce5 Handle vaarg instructions correctly. 
llvm-svn: 38504
 2007-07-10 18:43:15 +00:00
Owen Anderson
f4bea94dbd Volatile loads and stores depend on each other. 
llvm-svn: 38502
 2007-07-10 18:11:42 +00:00
Owen Anderson
1f5fb875b6 Add support for finding the dependencies of call and invoke instructions. 
llvm-svn: 38497
 2007-07-10 17:59:22 +00:00
Owen Anderson
1bd416b823 Fix the build, and fix the handling of pointer sizes. 
llvm-svn: 38494
 2007-07-10 17:25:03 +00:00
Owen Anderson
1fabbda503 Fix a bunch of things from Chris' feedback 
llvm-svn: 38493
 2007-07-10 17:08:11 +00:00
Dan Gohman
4e45063081 Move the APInt form of SCEVUnknown::getIntegerSCEV to SCEVConstant::get, and 
use SCEVConstant::get instead of SCEVUnknown::get when constructing a SCEV
for a ConstantInt.

llvm-svn: 38457
 2007-07-09 15:25:17 +00:00
Owen Anderson
23d5d3add4 A first stab at memory dependence analysis. This is an interface on top of 
alias analysis, adding caching and lazy computation of queries.  This will
be used in planned improvements to memory access optimizations.

llvm-svn: 37958
 2007-07-06 23:14:35 +00:00
Dan Gohman
048c6f805b Add explicit keywords. 
llvm-svn: 37839
 2007-07-02 14:53:37 +00:00
Devang Patel
593a23252d Add loop info verification mechanism. 
llvm-svn: 37822
 2007-06-29 23:13:42 +00:00
Devang Patel
0b2cb3ec61 CallGraphSCCPass manager may require other passes. 
Use schedulePass() to accomodate these requirement instead of directly
assigning a manager to new CallGraph PassManager.

llvm-svn: 37695
 2007-06-21 22:29:02 +00:00
Dan Gohman
bb705e230a Rename ScalarEvolution::deleteInstructionFromRecords to 
deleteValueFromRecords and loosen the types to all it to accept
Value* instead of just Instruction*, since this is what
ScalarEvolution uses internally anyway. This allows more flexibility
for future uses.

llvm-svn: 37657
 2007-06-19 14:28:31 +00:00
Dan Gohman
5db3ad4b32 In SCEVAddExpr::get, skip over any cast operands before looking for nested 
add operands after constant operands. The recent change to recognize
sign-extend expressions caused this to be exposed more often.

llvm-svn: 37628
 2007-06-18 19:30:09 +00:00
Anton Korobeynikov
76361958e8 Make BasicAliasAnalysis correctly register itself. Patch by Devang 
llvm-svn: 37627
 2007-06-18 17:13:29 +00:00
Dan Gohman
1c73ccb4d3 Fold a binary operator with constant operands when expanding code for a SCEV. 
llvm-svn: 37602
 2007-06-15 19:21:55 +00:00
Dan Gohman
838ba27094 Add a SCEV class and supporting code for sign-extend expressions. 
This created an ambiguity for expandInTy to decide when to use
sign-extension or zero-extension, but it turns out that most of its callers
don't actually need a type conversion, now that LLVM types don't have
explicit signedness. Drop expandInTy in favor of plain expand, and change
the few places that actually need a type conversion to do it themselves.

llvm-svn: 37591
 2007-06-15 14:38:12 +00:00
Devang Patel
ab4cb51479 Break DominatorTree from ETNode. 
Remove unused PostETForest.

llvm-svn: 37551
 2007-06-12 00:54:38 +00:00
Devang Patel
d544f5262e Use DominatorTree instead of ETForest. 
llvm-svn: 37507
 2007-06-08 00:17:13 +00:00
Devang Patel
67ede3d635 Use DominatorTree instead of ETForest. 
llvm-svn: 37505
 2007-06-07 23:53:38 +00:00
Devang Patel
babcd06827 Maintain ETNode as part of DomTreeNode. 
This adds redundancy for now.

llvm-svn: 37492
 2007-06-07 17:47:21 +00:00
Nick Lewycky
2897eb89d0 Optimize this test. Firstly, only Instructions may use other Instructions. 
Secondly, checking whether removal succeeded tells you whether it was in
the map to begin with.

llvm-svn: 37469
 2007-06-06 11:26:20 +00:00
Nick Lewycky
c667323382 Fix PR1487 and Transforms/IndVar/2007-06-06-DeleteDanglesPtr.ll 
llvm-svn: 37459
 2007-06-06 04:12:20 +00:00
Devang Patel
606fb412b0 Fix PR 1497 
Use separate pass id for CFGOnlyPrinter.

llvm-svn: 37439
 2007-06-05 20:24:36 +00:00
Devang Patel
2ef6caf14f s/llvm::DominatorTreeBase::DomTreeNode/llvm::DomTreeNode/g 
llvm-svn: 37407
 2007-06-04 00:32:22 +00:00
Devang Patel
d58b82f83a s/DominatorTreeBase::Node/DominatorTreeBase:DomTreeNode/g 
llvm-svn: 37403
 2007-06-03 06:26:14 +00:00
Chris Lattner
d339f51afd when merging two alias sets together, be sure to propagate the volatility of 
the inner set.  This fixes PR1435 and Transforms/LICM/2007-05-22-VolatileSink.ll

llvm-svn: 37305
 2007-05-23 06:36:35 +00:00