RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-28 06:22:51 +01:00
Code Issues Projects Releases Wiki Activity
69,009 Commits 4 Branches 5 Tags 704 MiB
3567bd2bcb
Commit Graph

44742 Commits

Author SHA1 Message Date
Devang Patel
7cb0e7c2ef Emit 128 bit constant. 
This fixes PR 8913 crash.

llvm-svn: 122971
 2011-01-06 21:39:25 +00:00
Bob Wilson
461eb28678 PR8921: LDM/POP do not support interworking prior to v5t. 
llvm-svn: 122970
 2011-01-06 19:24:41 +00:00
Bob Wilson
f4a821c3d3 Remove extra whitespace. 
llvm-svn: 122969
 2011-01-06 19:24:36 +00:00
Bob Wilson
42b8976610 Fix comment typo. 
llvm-svn: 122968
 2011-01-06 19:24:32 +00:00
Benjamin Kramer
4e31a65344 Add a note from llvmdev, this time with more info. 
llvm-svn: 122966
 2011-01-06 17:35:50 +00:00
Abramo Bagnara
d4c067af6e Fixed parsing of hex floats. 
llvm-svn: 122963
 2011-01-06 16:55:14 +00:00
Rafael Espindola
64814fff0b Correctly disassemble truncated asm. 
Patch by Richard Simth.

llvm-svn: 122962
 2011-01-06 16:48:42 +00:00
Benjamin Kramer
fb2bb22b6f InstCombine: Turn _chk functions into the "unsafe" variant if length and max langth are equal. 
This happens when we take the (non-constant) length from a malloc.

llvm-svn: 122961
 2011-01-06 14:22:52 +00:00
Benjamin Kramer
33e41f4986 EarlyCSE does this now (and GVN always did it). 
llvm-svn: 122960
 2011-01-06 13:19:46 +00:00
Benjamin Kramer
5834b2bab8 InstCombine: If we call llvm.objectsize on a malloc call we can replace it with the size passed to malloc. 
llvm-svn: 122959
 2011-01-06 13:11:05 +00:00
Benjamin Kramer
d5e1c24646 InstCombine: Teach llvm.objectsize folding to look through GEPs. 
llvm-svn: 122958
 2011-01-06 13:07:49 +00:00
Benjamin Kramer
dcff486813 Remove dead code and silence warnings. 
llvm-svn: 122957
 2011-01-06 13:01:02 +00:00
Evan Cheng
1a1771584e Use movups to lower memcpy and memset even if it's not fast (like corei7). 
The theory is it's still faster than a pair of movq / a quad of movl. This
will probably hurt older chips like P4 but should run faster on current
and future Intel processors. rdar://8817010

llvm-svn: 122955
 2011-01-06 07:58:36 +00:00
Chris Lattner
40973baa5f add a note about object size from drystone, add a poorly optimized loop from 179.art. 
llvm-svn: 122954
 2011-01-06 07:41:22 +00:00
Chris Lattner
69ff12968c add a trivial instcombine missed in Dhrystone 
llvm-svn: 122953
 2011-01-06 07:09:23 +00:00
Evan Cheng
cb39cc2164 Re-implement r122936 with proper target hooks. Now getMaxStoresPerMemcpy 
etc. takes an option OptSize. If OptSize is true, it would return
the inline limit for functions with attribute OptSize.

llvm-svn: 122952
 2011-01-06 06:52:41 +00:00
Chris Lattner
83067bc3e7 implement constant folding support for an exotic constant expr: 
ret i64 ptrtoint (i8* getelementptr ([1000 x i8]* @X, i64 1, i64 sub (i64 0, i64 ptrtoint ([1000 x i8]* @X to i64))) to i64)

to "ret i64 1000".  This allows us to correctly compute the trip count
on a loop in PR8883, which occurs with std::fill on a char array.  This
allows us to transform it into a memset with a constant size.

llvm-svn: 122950
 2011-01-06 06:19:46 +00:00
Evan Cheng
70711ea54d Revert r122936. I'll re-implement the change. 
llvm-svn: 122949
 2011-01-06 06:17:53 +00:00
Cameron Zwarich
246056cbb7 Add the CallInst optimizations that don't involve expanding inline assembly to 
OptimizeInst() so that they can be used on a worklist instruction.

llvm-svn: 122945
 2011-01-06 02:56:42 +00:00
Cameron Zwarich
314d16039a Move the GEP handling in CodeGenPrepare to OptimizeInst(). 
llvm-svn: 122944
 2011-01-06 02:44:52 +00:00
Cameron Zwarich
40cfb75bd7 Split the optimizations in CodeGenPrepare that don't manipulate the iterators 
into a separate function, so that it can be called from a loop using a worklist
rather than a loop traversing a whole basic block.

llvm-svn: 122943
 2011-01-06 02:37:26 +00:00
Jakob Stoklund Olesen
b3e7b27c1f Zap the last two -Wself-assign warnings in llvm. 
Simplify RALinScan::DowngradeRegister with TRI::getOverlaps while we are there.

llvm-svn: 122940
 2011-01-06 01:33:22 +00:00
Jakob Stoklund Olesen
7b1480ff12 Add the SpillPlacement analysis pass. 
This pass precomputes CFG block frequency information that can be used by the
register allocator to find optimal spill code placement.

Given an interference pattern, placeSpills() will compute which basic blocks
should have the current variable enter or exit in a register, and which blocks
prefer the stack.

The algorithm is ready to consume block frequencies from profiling data, but for
now it gets by with the static estimates used for spill weights.

This is a work in progress and still not hooked up to RegAllocGreedy.

llvm-svn: 122938
 2011-01-06 01:21:53 +00:00
Evan Cheng
d425aa5d2a r105228 reduced the memcpy / memset inline limit to 4 with -Os to avoid blowing 
up freebsd bootloader. However, this doesn't make much sense for Darwin, whose
-Os is meant to optimize for size only if it doesn't hurt performance.
rdar://8821501

llvm-svn: 122936
 2011-01-06 01:04:47 +00:00
Evan Cheng
2af40ae781 Avoid zero extend bit test operands to pointer type if all the masks fit in 
the original type of the switch statement key.
rdar://8781238

llvm-svn: 122935
 2011-01-06 01:02:44 +00:00
Bill Wendling
a59afdaec5 PR8919 - LLVM incorrectly generates "_alloca" as the stack probing call. That 
works only on MinGW32. On 64-bit, the function to call is "__chkstk".
Patch by KS Sreeram!

llvm-svn: 122934
 2011-01-06 00:50:34 +00:00
Bill Wendling
fae0dd1afa PR8918 - When used with MinGW64, LLVM generates a "calll __main" at the 
beginning of the "main" function. The assembler complains about the invalid
suffix for the 'call' instruction. The right instruction is "callq __main".
Patch by KS Sreeram!

llvm-svn: 122933
 2011-01-06 00:47:10 +00:00
Cameron Zwarich
eeea9f7113 Stop reallocating SunkAddrs for each basic block. When we move to an instruction 
worklist, the key will need to become std::pair<BasicBlock*, Value*>.

llvm-svn: 122932
 2011-01-06 00:42:50 +00:00
Owen Anderson
ba8ae674d7 Reorder, rename, and document some members to make this easier to follow. 
llvm-svn: 122929
 2011-01-05 23:26:22 +00:00
Evan Cheng
bf92316fab Optimize: 
r1025 = s/zext r1024, 4
  r1026 = extract_subreg r1025, 4
to:
  r1026 = copy r1024

llvm-svn: 122925
 2011-01-05 23:06:49 +00:00
Chris Lattner
3ef9db5cd4 fix PR8900, a shuffle miscompilation. Patch by Nadav Rotem! 
llvm-svn: 122921
 2011-01-05 22:28:46 +00:00
Chris Lattner
0caa2500c0 silence more self assignment warnings. 
llvm-svn: 122920
 2011-01-05 22:26:52 +00:00
Jakob Stoklund Olesen
ce25984bae Add a hidden command line option to display edge bundle graphs as they are 
calculated.

llvm-svn: 122912
 2011-01-05 21:50:24 +00:00
Jakob Stoklund Olesen
bd9910dbe2 Silence a warning from non-standard warning avoidance code. 
llvm-svn: 122911
 2011-01-05 21:50:21 +00:00
Eric Christopher
651810d717 80-cols. 
llvm-svn: 122909
 2011-01-05 21:45:56 +00:00
Owen Anderson
97bd86a5e7 When computing the value on an edge, in certain cases LVI would fail to compute the value range 
in the predecessor block, leading to an incorrect conclusion for the edge value.  Found by inspection.

llvm-svn: 122908
 2011-01-05 21:37:18 +00:00
Owen Anderson
3d7ba422df Re-convert several of LazyValueInfo's internal maps to Dense{Map|Set}, and fix the issue in 
hasBlockValue() that was causing iterator invalidations.  Many thanks to Dimitry Andric for
tracking down those invalidations!

llvm-svn: 122906
 2011-01-05 21:15:29 +00:00
Chris Lattner
d419fe1dfe fix some -Wself-assign warnings. 
llvm-svn: 122893
 2011-01-05 18:41:05 +00:00
Cameron Zwarich
2543ec1d29 Add some more statistics to CodeGenPrepare. 
llvm-svn: 122891
 2011-01-05 17:47:38 +00:00
Wesley Peck
b6eccbe55a Commit 122778 broke DWARF debug output when using the MBlaze backend. Fixed by overriding TargetFrameInfo::getFrameIndexOffset to take into account the new frame index information. 
llvm-svn: 122889
 2011-01-05 17:34:20 +00:00
Cameron Zwarich
eca6d2c70a Add some stats to CodeGenPrepare to make it easier to speed it up without 
regressing code quality.

llvm-svn: 122887
 2011-01-05 17:27:27 +00:00
Michael J. Spencer
76c9f102b3 Support/PathV2: Implement remove_all. 
llvm-svn: 122884
 2011-01-05 16:39:38 +00:00
Michael J. Spencer
674358d496 Support/Windows/PathV2: Make directory iteration ignore . and .. 
llvm-svn: 122883
 2011-01-05 16:39:30 +00:00
Michael J. Spencer
bacdde1270 Support/Windows/PathV2: Fix remove to handle both files and directories. 
llvm-svn: 122882
 2011-01-05 16:39:22 +00:00
Michael J. Spencer
6bae59fb06 Support/PathV2: Implement directory_entry::status. 
llvm-svn: 122881
 2011-01-05 16:39:13 +00:00
Michael J. Spencer
e369cc8053 Support/PathV2: Implement directory iteration on POSIX. 
llvm-svn: 122879
 2011-01-05 16:38:57 +00:00
Cameron Zwarich
a7b9603f24 Use pop_back_val instead of back followed by pop_back. 
llvm-svn: 122876
 2011-01-05 16:08:47 +00:00
Cameron Zwarich
1dc3325c51 Use a worklist for later iterations just like ordinary instsimplify. The next 
step is to only process instructions in subloops if they have been modified by
an earlier simplification.

llvm-svn: 122869
 2011-01-05 05:47:47 +00:00
Cameron Zwarich
498b19fe4f Change LoopInstSimplify back to a LoopPass. It revisits subloops rather than 
skipping them, but it should probably use a worklist and only revisit those
instructions in subloops that have actually changed. It should probably also
use a worklist after the first iteration like instsimplify now does. Regardless,
it's only 0.3% of opt -O2 time on 403.gcc if it replaces the instcombine placed
in the middle of the loop passes.

llvm-svn: 122868
 2011-01-05 05:15:53 +00:00
Eric Christopher
be2382f9a6 Remove TODO, these appear to be implemented. 
llvm-svn: 122849
 2011-01-04 22:31:50 +00:00
Owen Anderson
cc0a091a5b Don't bother value numbering instructions with void types in GVN. In theory this should allow us to insert 
fewer things into the value numbering maps, but any speedup is beneath the noise threshold on my machine
on 403.gcc.

llvm-svn: 122844
 2011-01-04 22:15:21 +00:00
Jakob Stoklund Olesen
76e782c385 Use the EdgeBundles analysis in X86FloatingPoint instead of recomputing CFG 
bundles in the pass.

llvm-svn: 122833
 2011-01-04 21:10:11 +00:00
Jakob Stoklund Olesen
abf8941a60 Turn the EdgeBundles class into a stand-alone machine CFG analysis pass. 
The analysis will be needed by both the greedy register allocator and the
X86FloatingPoint pass. It only needs to be computed once when the CFG doesn't
change.

This pass is very fast, usually showing up as 0.0% wall time.

llvm-svn: 122832
 2011-01-04 21:10:05 +00:00
Dale Johannesen
c7168aa6fe Eliminate a warning compiling with llvm-gcc. (IMO the 
warning is overzealous but gcc is what it is.)

llvm-svn: 122829
 2011-01-04 19:31:24 +00:00
Owen Anderson
21c2cbcdbc Complete the NumberTable --> LeaderTable rename. 
llvm-svn: 122828
 2011-01-04 19:29:46 +00:00
Owen Anderson
52b41efbe8 Fix typo in a comment. 
llvm-svn: 122827
 2011-01-04 19:25:18 +00:00
Owen Anderson
eab44ddb0d Prune #include's. 
llvm-svn: 122826
 2011-01-04 19:24:57 +00:00
Owen Anderson
e8b5675dfa Clarify terminology, settling on referring to what was the "number table" as the "leader table", and 
rename methods to make it much more clear what they're doing.

llvm-svn: 122823
 2011-01-04 19:13:25 +00:00
Owen Anderson
192bc8fe10 When removing a value from GVN's leaders list, don't drop the Next pointer in a corner case. 
llvm-svn: 122822
 2011-01-04 19:10:54 +00:00
Dale Johannesen
de70d69dff Improve the accuracy of the inlining heuristic looking for the 
case where a static caller is itself inlined everywhere else, and
thus may go away if it doesn't get too big due to inlining other
things into it.  If there are references to the caller other than
calls, it will not be removed; account for this.
This results in same-day completion of the case in PR8853.

llvm-svn: 122821
 2011-01-04 19:01:54 +00:00
Owen Anderson
0ebc81b8d6 Branch instructions don't produce values, so there's no need to generate a value number for them. This 
avoids adding them to the various value numbering tables, resulting in a minor (~3%) speedup for GVN
on 40.gcc.

llvm-svn: 122819
 2011-01-04 18:54:18 +00:00
Owen Anderson
035828ecc6 Remove commented out code. 
llvm-svn: 122817
 2011-01-04 18:22:08 +00:00
Cameron Zwarich
8df51d24bd Switch to the new style of asterisk placement. 
llvm-svn: 122815
 2011-01-04 18:19:19 +00:00
Chris Lattner
dbb1b09731 fix an off-by-one bug that caused a crash analyzing 
ashr's with huge shift amounts, PR8896

llvm-svn: 122814
 2011-01-04 18:19:15 +00:00
Cameron Zwarich
fce4db4cbe Switch to path halving from path compression for a small speedup. This also 
makes getLeader() nonrecursive.

llvm-svn: 122811
 2011-01-04 16:24:51 +00:00
Duncan Sands
d252c6dae7 These methods should be "const"; make them so. 
llvm-svn: 122809
 2011-01-04 12:52:29 +00:00
Chris Lattner
1f58120bfe Teach loop-idiom to turn a loop containing a memset into a larger memset 
when safe.

The testcase is basically this nested loop:
void foo(char *X) {
  for (int i = 0; i != 100; ++i) 
    for (int j = 0; j != 100; ++j)
      X[j+i*100] = 0;
}

which gets turned into a single memset now.  clang -O3 doesn't optimize
this yet though due to a phase ordering issue I haven't analyzed yet.

llvm-svn: 122806
 2011-01-04 07:46:33 +00:00
Chris Lattner
0c29b20b46 restructure this a bit. Initialize the WeakVH with "I", the 
instruction *after* the store.  The store will always be deleted
if the transformation kicks in, so we'd do an N^2 scan of every
loop block.  Whoops.

llvm-svn: 122805
 2011-01-04 07:27:30 +00:00
Cameron Zwarich
2975ee7cc6 Eliminate repeated allocation of a per-BB DenseMap for a 4.6% reduction of time 
spent in StrongPHIElimination on 403.gcc.

llvm-svn: 122803
 2011-01-04 06:42:27 +00:00
Cameron Zwarich
150ef32f67 Avoid finding loop back edges when we are not splitting critical edges in 
CodeGenPrepare (which is the default behavior).

llvm-svn: 122801
 2011-01-04 04:43:31 +00:00
Owen Anderson
9eeb0d483e Clean up a funky pass registration that got passed over when I got rid of static constructors. 
llvm-svn: 122795
 2011-01-04 00:55:21 +00:00
Andrew Trick
3637733170 Fix the ARM IIC_iCMPsi itinerary and add an important assert. 
llvm-svn: 122794
 2011-01-04 00:32:57 +00:00
Cameron Zwarich
61a903b51b Address most of Duncan's review comments. Also, make LoopInstSimplify a simple 
FunctionPass. It probably doesn't have a reason to be a LoopPass, as it will
probably drop the simple fixed point and either use RPO iteration or Duncan's
approach in instsimplify of only revisiting instructions that have changed.

The next step is to preserve LoopSimplify. This looks like it won't be too hard,
although the pass manager doesn't actually seem to respect when non-loop passes
claim to preserve LCSSA or LoopSimplify. This will have to be fixed.

llvm-svn: 122791
 2011-01-04 00:12:46 +00:00
Chris Lattner
0caf5cbbe7 use the very-handy getTruncateOrZeroExtend helper function, and 
stop setting NSW: signed overflow is possible.  Thanks to Dan
for pointing these out.

llvm-svn: 122790
 2011-01-04 00:06:55 +00:00
Bill Wendling
b402d3881e Formatting changes. No functionality change. 
llvm-svn: 122789
 2011-01-03 23:59:05 +00:00
Owen Anderson
c724c5969d Fix comment. 
llvm-svn: 122788
 2011-01-03 23:51:56 +00:00
Owen Anderson
ce48a5e838 Use the new addEscapingValue callback to update GlobalsModRef when GVN adds PHIs of GEPs. For the moment, 
have GlobalsModRef handle this conservatively by simply removing the value from its maps.

llvm-svn: 122787
 2011-01-03 23:51:43 +00:00
Chris Lattner
cd13979300 Duncan deftly points out that readnone functions aren't 
invalidated by stores, so they can be handled as 'simple'
operations.

llvm-svn: 122785
 2011-01-03 23:38:13 +00:00
Evan Cheng
25f7df1bce Use pushq / popq instead of subq $8, %rsp / addq $8, %rsp to adjust stack in 
prologue and epilogue if the adjustment is 8. Similarly, use pushl / popl if
the adjustment is 4 in 32-bit mode.

In the epilogue, takes care to pop to a caller-saved register that's not live
at the exit (either return or tailcall instruction).
rdar://8771137

llvm-svn: 122783
 2011-01-03 22:53:22 +00:00
Wesley Peck
d22aae0d68 Fix more stack layout issues in the MBlaze backend. 
llvm-svn: 122778
 2011-01-03 21:40:26 +00:00
Owen Anderson
a52e5dbdfa Stub out a new updating interface to AliasAnalysis, allowing stateful analyses to be informed when 
a pointer value has potentially become escaping.  Implementations can choose to either fall back to
conservative responses for that value, or may recompute their analysis to accomodate the change.

llvm-svn: 122777
 2011-01-03 21:38:41 +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
Owen Anderson
e7a89f4646 Simplify GVN's value expression structure, allowing the elimination of a lot of 
almost-but-not-quite-identical code.  No intended functionality change.

llvm-svn: 122760
 2011-01-03 19:00:11 +00:00
Chris Lattner
5b5347fde6 stength reduce my previous patch a bit. The only instructions 
that are allowed to have metadata operands are intrinsic calls,
and the only ones that take metadata currently return void.
Just reject all void instructions, which should not be value
numbered anyway.  To future proof things, add an assert to the
getHashValue impl for calls to check that metadata operands 
aren't present.

llvm-svn: 122759
 2011-01-03 18:43:03 +00:00
Chris Lattner
9f81cc5372 fix PR8895: metadata operands don't have a strong use of their 
nested values, so they can change and drop to null, which can
change the hash and cause havok.

It turns out that it isn't a good idea to value number stuff
with metadata operands anyway, so... don't.

llvm-svn: 122758
 2011-01-03 18:28:15 +00:00
Duncan Sands
667024a2eb Speed up instsimplify by about 10-15% by not bothering to retry 
InstructionSimplify on instructions that didn't change since the
last time round the loop.

llvm-svn: 122745
 2011-01-03 10:50:04 +00:00
Cameron Zwarich
3914a9751c Switch a worklist in CodeGenPrepare to SmallVector and increase the inline 
capacity on the Visited SmallPtrSet. On 403.gcc, this is about a 4.5% speedup of
CodeGenPrepare time (which itself is 10% of time spent in the backend).

This is progress towards PR8889.

llvm-svn: 122741
 2011-01-03 06:33:01 +00:00
Chris Lattner
c1ebe702b1 earlycse can do trivial with-a-block dead store 
elimination as well.  This deletes 60 stores in 176.gcc
that largely come from bitfield code.

llvm-svn: 122736
 2011-01-03 04:17:24 +00:00
Cameron Zwarich
60ec113434 Use a RecyclingAllocator to allocate values for MachineCSE's ScopedHashTable for 
a 28% speedup of MachineCSE time on 403.gcc.

llvm-svn: 122735
 2011-01-03 04:07:46 +00:00
Chris Lattner
e44a99ac89 switch the load table to use a recycling bump pointer allocator, 
speeding earlycse up by 6%.

llvm-svn: 122733
 2011-01-03 03:53:50 +00:00
Chris Lattner
d19ae32f2f now that loads are in their own table, we can implement 
store->load forwarding.  This allows EarlyCSE to zap 600 more
loads from 176.gcc.

llvm-svn: 122732
 2011-01-03 03:46:34 +00:00
Chris Lattner
b242caa491 split loads and calls into separate tables. Loads are now just indexed 
by their pointer instead of using MemoryValue to wrap it.

llvm-svn: 122731
 2011-01-03 03:41:27 +00:00
Chris Lattner
3d56e5f6d5 various cleanups, no functionality change. 
llvm-svn: 122729
 2011-01-03 03:28:23 +00:00
Nick Lewycky
4840065424 Add spliceFunction to the CallGraph interface. This allows users to efficiently 
update a callGraph when performing the common operation of splicing the body to
a new function and updating all callers (such as via RAUW).

No users yet, though this is intended for DeadArgumentElimination as part of
PR8887.

llvm-svn: 122728
 2011-01-03 03:19:35 +00:00
Chris Lattner
4cfdaa3f02 Teach EarlyCSE to do trivial CSE of loads and read-only calls. 
On 176.gcc, this catches 13090 loads and calls, and increases the
number of simple instructions CSE'd from 29658 to 36208.

llvm-svn: 122727
 2011-01-03 03:18:43 +00:00
Chris Lattner
4ad0cdebbb rename InstValue to SimpleValue, add some comments. 
llvm-svn: 122725
 2011-01-03 02:20:48 +00:00
Michael J. Spencer
1c649efb52 CMake: Add missing source file. 
llvm-svn: 122724
 2011-01-03 02:13:05 +00:00
Chris Lattner
e89f2f9078 Allocate nodes for the scoped hash table from a recyling bump pointer 
allocator.  This speeds up early cse by about 20%

llvm-svn: 122723
 2011-01-03 01:42:46 +00:00
Chris Lattner
f6a71c6cd5 reduce redundancy in the hashing code and other misc cleanups. 
llvm-svn: 122720
 2011-01-03 01:10:08 +00:00
Cameron Zwarich
a4f2efdd41 Add a new loop-instsimplify pass, with the intention of replacing the instance 
of instcombine that is currently in the middle of the loop pass pipeline. This
commit only checks in the pass; it will hopefully be enabled by default later.

llvm-svn: 122719
 2011-01-03 00:25:16 +00:00
Chris Lattner
506c2deff3 fix some pastos 
llvm-svn: 122718
 2011-01-02 23:29:58 +00:00
Chris Lattner
39d1fb3320 add DEBUG and -stats output to earlycse. 
Teach it to CSE the rest of the non-side-effecting instructions.

llvm-svn: 122716
 2011-01-02 23:19:45 +00:00
Chris Lattner
dbad0b5e40 Enhance earlycse to do CSE of casts, instsimplify and die. 
Add a testcase.

llvm-svn: 122715
 2011-01-02 23:04:14 +00:00
Chris Lattner
e396e846b4 split dom frontier handling stuff out to its own DominanceFrontier header, 
so that Dominators.h is *just* domtree.  Also prune #includes a bit.

llvm-svn: 122714
 2011-01-02 22:09:33 +00:00
Chris Lattner
688675a0be sketch out a new early cse pass. No functionality yet. 
llvm-svn: 122713
 2011-01-02 21:47:05 +00:00
Chris Lattner
0c2cfcf430 fix a miscompilation of tramp3d-v4: when forming a memcpy, we have to make 
sure that the loop we're promoting into a memcpy doesn't mutate the input
of the memcpy.  Before we were just checking that the dest of the memcpy
wasn't mod/ref'd by the loop.

llvm-svn: 122712
 2011-01-02 21:14:18 +00:00
Chris Lattner
c655681b32 If a loop iterates exactly once (has backedge count = 0) then don't 
mess with it.  We'd rather peel/unroll it than convert all of its 
stores into memsets.

llvm-svn: 122711
 2011-01-02 20:24:21 +00:00
Benjamin Kramer
a58b69aa9d Try to reuse the value when lowering memset. 
This allows us to compile:
  void test(char *s, int a) {
    __builtin_memset(s, a, 15);
  }
into 1 mul + 3 stores instead of 3 muls + 3 stores.

llvm-svn: 122710
 2011-01-02 19:57:05 +00:00
Benjamin Kramer
38491f47ce Lower the i8 extension in memset to a multiply instead of a potentially long series of shifts and ors. 
We could implement a DAGCombine to turn x * 0x0101 back into logic operations
on targets that doesn't support the multiply or it is slow (p4) if someone cares
enough.

Example code:
  void test(char *s, int a) {
      __builtin_memset(s, a, 4);
  }
before:
  _test:                                  ## @test
    movzbl  8(%esp), %eax
    movl  %eax, %ecx
    shll  $8, %ecx
    orl %eax, %ecx
    movl  %ecx, %eax
    shll  $16, %eax
    orl %ecx, %eax
    movl  4(%esp), %ecx
    movl  %eax, 4(%ecx)
    movl  %eax, (%ecx)
    ret
after:
  _test:                                  ## @test
    movzbl  8(%esp), %eax
    imull $16843009, %eax, %eax   ## imm = 0x1010101
    movl  4(%esp), %ecx
    movl  %eax, 4(%ecx)
    movl  %eax, (%ecx)
    ret

llvm-svn: 122707
 2011-01-02 19:44:58 +00:00
Oscar Fuentes
6514b0ac68 A workaround for a bug in cmake 2.8.3 diagnosed on PR 8885. 
llvm-svn: 122706
 2011-01-02 19:32:31 +00:00
Nick Lewycky
06b94a5e5b Also remove functions that use complex constant expressions in terms of 
another function.

llvm-svn: 122705
 2011-01-02 19:16:44 +00:00
Chris Lattner
c78e4bc366 enhance loop idiom recognition to scan *all* unconditionally executed 
blocks in a loop, instead of just the header block.  This makes it more
aggressive, able to handle Duncan's Ada examples.

llvm-svn: 122704
 2011-01-02 19:01:03 +00:00
Chris Lattner
3bb2e83433 make inSubLoop much more efficient. 
llvm-svn: 122703
 2011-01-02 18:53:08 +00:00
Chris Lattner
2bcd2564d6 rip out isExitBlockDominatedByBlockInLoop, calling DomTree::dominates instead. 
isExitBlockDominatedByBlockInLoop is a relic of the days when domtree was 
*just* a tree and didn't have DFS numbers.  Checking DFS numbers is faster
and easier than "limiting the search of the tree".

llvm-svn: 122702
 2011-01-02 18:45:39 +00:00
Chris Lattner
bbae3ddf12 add a list of opportunities for future improvement. 
llvm-svn: 122701
 2011-01-02 18:32:09 +00:00
Chris Lattner
222b24e2de update a bunch of entries. 
llvm-svn: 122700
 2011-01-02 18:31:38 +00:00
Duncan Sands
2d1c116071 Fix PR8702 by not having LoopSimplify claim to preserve LCSSA form. As described 
in the PR, the pass could break LCSSA form when inserting preheaders.  It probably
would be easy enough to fix this, but since currently we always go into LCSSA form
after running this pass, doing so is not urgent.

llvm-svn: 122695
 2011-01-02 13:38:21 +00:00
Chris Lattner
f669d6a901 Allow loop-idiom to run on multiple BB loops, but still only scan the loop 
header for now for memset/memcpy opportunities.  It turns out that loop-rotate
is successfully rotating loops, but *DOESN'T MERGE THE BLOCKS*, turning "for 
loops" into 2 basic block loops that loop-idiom was ignoring.

With this fix, we form many *many* more memcpy and memsets than before, including
on the "history" loops in the viterbi benchmark, which look like this:

        for (j=0; j<MAX_history; ++j) {
          history_new[i][j+1] = history[2*i][j];
        }

Transforming these loops into memcpy's speeds up the viterbi benchmark from
11.98s to 3.55s on my machine.  Woo.

llvm-svn: 122685
 2011-01-02 07:58:36 +00:00
Chris Lattner
8a72a8f315 remove debugging code. 
llvm-svn: 122683
 2011-01-02 07:37:13 +00:00
Chris Lattner
bbd22e0c3c add some -stats output. 
llvm-svn: 122682
 2011-01-02 07:36:44 +00:00
Chris Lattner
2afc3c0dc4 improve loop rotation to use CodeMetrics to analyze the 
size of a loop header instead of its own code size estimator.
This allows it to handle bitcasts etc more precisely.

llvm-svn: 122681
 2011-01-02 07:35:53 +00:00
Chris Lattner
34a61ab676 teach loop idiom recognition to form memcpy's from simple loops. 
llvm-svn: 122678
 2011-01-02 03:37:56 +00:00
Nick Lewycky
68d915ae1a Remove functions from the FnSet when one of their callee's is being merged. This 
maintains the guarantee that the DenseSet expects two elements it contains to
not go from inequal to equal under its nose.

As a side-effect, this also lets us switch from iterating to a fixed-point to
actually maintaining a work queue of functions to look at again, and we don't
add thunks to our work queue so we don't need to detect and ignore them.

llvm-svn: 122677
 2011-01-02 02:46:33 +00:00
Chris Lattner
9dadac901f a missed __builtin_object_size case. 
llvm-svn: 122676
 2011-01-01 22:57:31 +00:00
Chris Lattner
e3e3cb83a5 various updates. 
llvm-svn: 122675
 2011-01-01 22:52:11 +00:00
Chris Lattner
fda382af51 fix a globalopt crash on two Adobe-C++ testcases that the recent 
loop idiom pass exposed.

llvm-svn: 122674
 2011-01-01 22:31:46 +00:00
Rafael Espindola
55f7a5057d Add support for the 'H' modifier. 
llvm-svn: 122667
 2011-01-01 20:58:46 +00:00
Anton Korobeynikov
d37cb4cd1c Model operand restrictions of mul-like instructions on ARMv5 via 
earlyclobber stuff. This should fix PRs 2313 and 8157.

Unfortunately, no testcase, since it'd be dependent on register
assignments.

llvm-svn: 122663
 2011-01-01 20:38:38 +00:00
Chris Lattner
b9c1684fce add a validity check that was missed, fixing a crash on the 
new testcase.

llvm-svn: 122662
 2011-01-01 20:12:04 +00:00
Duncan Sands
aaddf57af9 Revert commit 122654 at the request of Chris, who reckons that instsimplify 
is the wrong hammer for this nail, and is probably right.

llvm-svn: 122661
 2011-01-01 20:08:02 +00:00
Chris Lattner
9a9f43c4a2 improve validity check to handle constant-trip-count loops more 
aggressively.  In practice, this doesn't help anything though,
see the todo.

llvm-svn: 122660
 2011-01-01 19:54:22 +00:00
Chris Lattner
4651f8b037 implement the "no aliasing accesses in loop" safety check. This pass 
should be correct now.

llvm-svn: 122659
 2011-01-01 19:39:01 +00:00
Rafael Espindola
e223c0aa14 Fix PR8878. 
llvm-svn: 122658
 2011-01-01 19:05:35 +00:00
Duncan Sands
ec8b2b4cc5 Fix a README item by having InstructionSimplify do a mild form of value 
numbering, in which it considers (for example) "%a = add i32 %x, %y" and
"%b = add i32 %x, %y" to be equal because the operands are equal and the
result of the instructions only depends on the values of the operands.
This has almost no effect (it removes 4 instructions from gcc-as-one-file),
and perhaps slows down compilation: I measured a 0.4% slowdown on the large
gcc-as-one-file testcase, but it wasn't statistically significant.

llvm-svn: 122654
 2011-01-01 16:12:09 +00:00
Che-Liang Chiou
a188cfb574 ptx: remove reg-reg addressing mode and st.const 
llvm-svn: 122653
 2011-01-01 11:58:58 +00:00
Che-Liang Chiou
995a853724 ptx: add store instruction 
llvm-svn: 122652
 2011-01-01 10:50:37 +00:00
Oscar Fuentes
a63d0dbfbf Add to the list of cmake files the object file, not the asm file. This 
is necessary for executing the custom command that runs the
assember. Fixes PR8877.

llvm-svn: 122649
 2010-12-31 20:15:37 +00:00
Duncan Sands
74270e8100 Simplify this pass by using a depth-first iterator to ensure that all 
operands are visited before the instructions themselves.

llvm-svn: 122647
 2010-12-31 17:49:05 +00:00
Duncan Sands
ca280dbcd5 Zap dead instructions harder. 
llvm-svn: 122645
 2010-12-31 16:17:54 +00:00
Benjamin Kramer
c84434924f Make a bunch of symbols internal. 
llvm-svn: 122642
 2010-12-30 22:34:44 +00:00
Nick Lewycky
5cb84ee2cf Add another non-commutable instruction that gas accepts commuted forms for. 
Fixes PR8861.

llvm-svn: 122641
 2010-12-30 22:10:49 +00:00
Che-Liang Chiou
f4aaa1b2e1 ptx: add state spaces 
llvm-svn: 122638
 2010-12-30 10:41:27 +00:00
Chris Lattner
f0e1e53e62 include the module identifier when emitting this warning, PR8865. 
llvm-svn: 122637
 2010-12-30 02:49:45 +00:00
Chris Lattner
f3912fd05b print the right string, thanks for Frits for noticing. 
llvm-svn: 122636
 2010-12-30 01:07:20 +00:00
Cameron Zwarich
ae468579bb Use getVRegDef() instead of def_iterator. This leads to fewer defs being added 
with 2-address instructions, for about a 3.5% speedup of StrongPHIElimination on
403.gcc.

llvm-svn: 122635
 2010-12-30 00:42:23 +00:00
Chris Lattner
8b738dffaa improve warning message to at least say what the triples are. 
llvm-svn: 122632
 2010-12-29 22:41:18 +00:00
Wesley Peck
5a551350c3 Fix stack layout error in MBlaze backend. 
llvm-svn: 122631
 2010-12-29 19:46:28 +00:00
Daniel Dunbar
9ee74282a6 MC/Mach-O/Thumb: Set the thumb bit in the symbol table. 
llvm-svn: 122630
 2010-12-29 14:14:06 +00:00
Cameron Zwarich
1e7124e6fa None of the other pass names in CodeGen have terminating periods. 
llvm-svn: 122628
 2010-12-29 11:49:10 +00:00
Cameron Zwarich
a7052a3c06 Instead of processing every instruction when splitting interferences, only 
process those instructions that define phi sources. This is a 47% speedup of
StrongPHIElimination compile time on 403.gcc.

llvm-svn: 122627
 2010-12-29 11:00:09 +00:00