RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-30 15:32:52 +01:00
Code Issues Projects Releases Wiki Activity
18,578 Commits 4 Branches 5 Tags 704 MiB
562734e130
Commit Graph

31 Commits

Author SHA1 Message Date
Misha Brukman
122d682689 Remove trailing whitespace 
llvm-svn: 21416
 2005-04-21 21:13:18 +00:00
Chris Lattner
703dfdda2a Due to previous simplifications, we can simplify the data structures being 
used here.

llvm-svn: 19913
 2005-01-29 07:04:10 +00:00
Chris Lattner
0823ac4234 Properly handle volatile. 
llvm-svn: 19912
 2005-01-29 06:42:34 +00:00
Chris Lattner
8df4ba51b4 Remove some useless map operations. Loads/stores that are in the same 
BB as the load are not included in the Cand* sets at all.

llvm-svn: 19911
 2005-01-29 06:39:25 +00:00
Chris Lattner
af286e3600 Before doing expensive global analysis, check to make sure the pointer is 
not invalidated on entry and on exit of the block.  This fixes some N^2
behavior in common cases, and speeds up gcc another 5% to 22.35s.

llvm-svn: 19910
 2005-01-29 06:31:53 +00:00
Chris Lattner
43ccc5c945 Minor simplification/speedup. Replaces a set lookup with a pointer comparison. 
This speeds up 176.gcc from 25.73s to 23.48s, which is 9.5%

llvm-svn: 19907
 2005-01-29 06:20:55 +00:00
Chris Lattner
ae8d4bb675 Eliminate generality that is not buying us anything. In particular, this 
will cause us to miss cases where the input pointer to a load could be value
numbered to another load.  Something like this:


  %X = load int* %P1
  %Y = load int* %P2

Those are obviously the same if P1/P2 are the same.  The code this patch
removes attempts to handle that.  However, since GCSE iterates, this doesn't
actually buy us anything: GCSE will first replace P1 or P2 with the other
one, then the load can be value numbered as equal.

Removing this code speeds up gcse a lot.  On 176.gcc in debug mode, this
speeds up gcse from 29.08s -> 25.73s, a 13% savings.

llvm-svn: 19906
 2005-01-29 06:11:16 +00:00
Chris Lattner
68d73bed4a If we see: 
%A = alloca int
  %V = load int* %A

value number %V to undef, not 0.

llvm-svn: 19905
 2005-01-29 05:57:01 +00:00
Chris Lattner
be18a7e20a Eliminate a virtual method call 
llvm-svn: 18964
 2004-12-15 18:14:04 +00:00
Alkis Evlogimenos
0c50e0f211 Fixes to make LLVM compile with vc7.1. 
Patch contributed by Paolo Invernizzi!

llvm-svn: 16152
 2004-09-03 18:19:51 +00:00
Misha Brukman
58104df77b Fix #includes of i*.h => Instructions.h as per PR403. 
llvm-svn: 15334
 2004-07-29 17:30:56 +00:00
Brian Gaeke
45adb41f46 Make the create...() functions for some of these passes return a FunctionPass *. 
llvm-svn: 15276
 2004-07-27 17:43:21 +00:00
Chris Lattner
6c71895a16 Implement the interfaces to update value numbering information. Add an 
assert.

llvm-svn: 13679
 2004-05-23 21:13:24 +00:00
Chris Lattner
3ccb7f2275 Implement test/Regression/Transforms/GCSE/undefined_load.ll 
llvm-svn: 12641
 2004-04-03 00:45:16 +00:00
Chris Lattner
c2eb0678d8 Add some missing functions. Make sure to handle calls together in case the 
client has another VN implementation that can VN calls.

llvm-svn: 12427
 2004-03-16 03:41:35 +00:00
Chris Lattner
62771c4bef Implement CSE of call instructions in the most trivial case. This implements 
GCSE/call_cse.ll

llvm-svn: 12419
 2004-03-15 05:44:59 +00:00
Chris Lattner
ffc5eee17a In a "seeing the forest through the trees" kinda situation, I realized that a 
complete rewrite of load-vn will make it a bit faster.  This changes speeds up
the gcse pass (which uses load-vn) from 25.45s to 0.42s on the testcase in
PR209.

I've also verified that this gives the exact same results as the old one.

llvm-svn: 11132
 2004-02-05 17:20:00 +00:00
Chris Lattner
1a04f2a635 This is a big diff with no functionality change. We just reorder some code, 
which causes big reindentation.  While I'm at it, I fix the fixme by removing
some dead code.

llvm-svn: 11131
 2004-02-05 05:56:23 +00:00
Chris Lattner
7d5e3febb7 finegrainify namespacification 
llvm-svn: 11130
 2004-02-05 05:51:40 +00:00
Tanya Lattner
d7b137d9fb Fixed Chris' typo. 
llvm-svn: 11128
 2004-02-05 04:45:21 +00:00
Chris Lattner
b721589bc0 Implement optimizations for handling large basic blocks. 
llvm-svn: 11126
 2004-02-05 00:36:43 +00:00
Brian Gaeke
d25f86d683 Put all LLVM code into the llvm namespace, as per bug 109. 
llvm-svn: 9903
 2003-11-11 22:41:34 +00:00
John Criswell
b402729b30 Added LLVM project notice to the top of every C++ source file. 
Header files will be on the way.

llvm-svn: 9298
 2003-10-20 19:43:21 +00:00
Misha Brukman
b9a4ddbfc5 Fixed spelling and grammar. 
llvm-svn: 8478
 2003-09-11 18:14:24 +00:00
Misha Brukman
6c4ffae6a5 Spell `definitely' correctly. 
llvm-svn: 8466
 2003-09-11 15:31:17 +00:00
Chris Lattner
f3505abe43 Fix bug: RLE-Preserve-Volatile.ll 
Volatile loads and stores must not be value numbered

llvm-svn: 8398
 2003-09-08 18:13:58 +00:00
Misha Brukman
56f7db4178 Spell `necessary' correctly. 
llvm-svn: 7944
 2003-08-18 14:43:39 +00:00
Chris Lattner
d1ca41db68 If the alias analysis algorithm we are using can provide MUST alias information, 
expose it directly as value numbering information

llvm-svn: 6972
 2003-06-29 00:53:34 +00:00
Chris Lattner
24441a15c5 Implement forwarding from stores to loads of must-aliased pointers. 
This implements: GCSE/2003-06-13-LoadStoreEliminate.ll

llvm-svn: 6694
 2003-06-16 12:06:41 +00:00
Chris Lattner
5afbabc83b Calculate and pass load sizes to the alias analysis infrastructure 
llvm-svn: 5635
 2003-02-26 19:27:35 +00:00
Chris Lattner
9c31585ee4 Initial implementation of value numbering for load instructions 
llvm-svn: 3540
 2002-08-30 20:28:10 +00:00