RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-24 19:52:54 +01:00
Code Issues Projects Releases Wiki Activity
20,846 Commits 4 Branches 5 Tags 704 MiB
4868465cb6
Commit Graph

11473 Commits

Author SHA1 Message Date
Chris Lattner
4868465cb6 Get rid of casts by #including the right header 
llvm-svn: 24275
 2005-11-10 18:36:17 +00:00
Chris Lattner
7ad799fbc1 Make the aix asm printer interface properly with the parent class 
llvm-svn: 24274
 2005-11-10 18:20:29 +00:00
Chris Lattner
aa86c10fe6 Compile C strings to: 
l1__2E_str_1:                           ; '.str_1'
        .asciz  "foo"

not:

        .align  0
l1__2E_str_1:                           ; '.str_1'
        .asciz  "foo"

llvm-svn: 24273
 2005-11-10 18:09:27 +00:00
Chris Lattner
88c7013f18 add support for .asciz, and enable it by default. If your target assemblerdoesn't support .asciz, just set AscizDirective to null in your asmprinter. 
This compiles C strings to:

l1__2E_str_1:                           ; '.str_1'
        .asciz  "foo"

instead of:

l1__2E_str_1:                           ; '.str_1'
        .ascii  "foo\000"

llvm-svn: 24272
 2005-11-10 18:06:33 +00:00
Andrew Lenharth
b4169fe539 this works with backedges to the existing entry block alot better 
llvm-svn: 24270
 2005-11-10 17:35:34 +00:00
Andrew Lenharth
fb7763398b fix a bunch of regressions 
llvm-svn: 24269
 2005-11-10 16:59:55 +00:00
Andrew Lenharth
03d60c3d09 The pass everyone has been waiting for! 
Reg2Mem

for fun you can opt -reg2mem -mem2reg

llvm-svn: 24267
 2005-11-10 01:58:38 +00:00
Chris Lattner
8a169a30ae Force vectors to be a power of two in size 
llvm-svn: 24265
 2005-11-10 01:42:43 +00:00
Chris Lattner
6a14d020a3 Force packed vectors to be a power of two in length. 
llvm-svn: 24264
 2005-11-10 01:40:59 +00:00
Chris Lattner
29585fd8c8 Switch the allnodes list from a vector of pointers to an ilist of nodes.This eliminates the vector, allows constant time removal of a node froma graph, and makes iteration over the all nodes list stable when adding 
nodes to the graph.

llvm-svn: 24263
 2005-11-09 23:47:37 +00:00
Chris Lattner
11d12a572e Refactor intrinsic lowering stuff out of visitCall 
llvm-svn: 24261
 2005-11-09 19:44:01 +00:00
Andrew Lenharth
1acb71df32 whatever. Intermediate patch to see what breaks. Seems ok. 
llvm-svn: 24260
 2005-11-09 19:17:08 +00:00
Chris Lattner
8052f32866 Handle the trivial (but common) two-op case more efficiently 
llvm-svn: 24259
 2005-11-09 18:48:57 +00:00
Chris Lattner
82596272da Nuke noop copies. 
llvm-svn: 24258
 2005-11-09 18:22:42 +00:00
Chris Lattner
306c386a79 Fix CodeGen/X86/shift-folding.ll:test3 on X86 
llvm-svn: 24256
 2005-11-09 16:50:40 +00:00
Chris Lattner
90e4c8a2a7 Disable some overly-aggressive checking code. This speeds up the local 
allocator from 23s to 11s on kc++ in debug mode.

llvm-svn: 24255
 2005-11-09 05:28:45 +00:00
Chris Lattner
798441d725 Avoid creating a token factor node in trivially redundant cases. This 
eliminates almost one node per block in common cases.

llvm-svn: 24254
 2005-11-09 05:03:03 +00:00
Chris Lattner
948932a624 Handle GEP's a bit more intelligently. Fold constant indices early and 
turn power-of-two multiplies into shifts early to improve compile time.

llvm-svn: 24253
 2005-11-09 04:45:33 +00:00
Chris Lattner
90eff65d1c Allocate the right amount of memory for this vector up front. 
llvm-svn: 24252
 2005-11-08 23:32:44 +00:00
Chris Lattner
89f1b405f4 Change the ValueList array for each node to be shared instead of individuallyallocated. Further, in the common case where a node has a single value, justreference an element from a small array. This is a small compile-time win. 
llvm-svn: 24251
 2005-11-08 23:30:28 +00:00
Chris Lattner
cffd7d5bdc Switch the operandlist/valuelist from being vectors to being just an array.This saves 12 bytes from SDNode, but doesn't speed things up substantially 
(our graphs apparently already fit within the cache on my g5).  In any case
this reduces memory usage.

llvm-svn: 24249
 2005-11-08 22:07:03 +00:00
Chris Lattner
80717f007c Explicitly initialize some instance vars 
llvm-svn: 24247
 2005-11-08 21:54:57 +00:00
Chris Lattner
e394cb13bd Clean up RemoveDeadNodes significantly, by eliminating the need for a temporary 
set and eliminating the need to iterate whenever something is removed (which
can be really slow in some cases).  Thx to Jim for pointing out something silly
I was getting stuck on. :)

llvm-svn: 24241
 2005-11-08 18:52:27 +00:00
Chris Lattner
bb448515ae Add a new option to indicate we want the code generator to emit code quickly, 
not spending tons of time microoptimizing it.  This is useful for an -O0
style of build.

llvm-svn: 24235
 2005-11-08 02:12:47 +00:00
Chris Lattner
3fdc97d460 Add a new option to indicate we want the code generator to emit code quickly,not spending tons of time microoptimizing it. This is useful for an -O0style of build. 
llvm-svn: 24233
 2005-11-08 02:11:51 +00:00
Jim Laskey
0c65e09865 Let's try ignoring resource utilization on the backward pass. 
llvm-svn: 24231
 2005-11-07 19:08:53 +00:00
Duraid Madina
fb806bb309 add support for storing and returning bools 
llvm-svn: 24228
 2005-11-07 03:11:02 +00:00
Chris Lattner
fc76f9f0c1 Always compute max align. 
llvm-svn: 24227
 2005-11-06 17:43:20 +00:00
Duraid Madina
f0469f0376 just some random hacking - calls (particularly indirect) need a lot of 
love (especially with -sched=simple)

llvm-svn: 24225
 2005-11-06 13:43:30 +00:00
Nate Begeman
aecebc076b Add the necessary support to the ISel to allow targets to codegen the new 
alignment information appropriately.  Includes code for PowerPC to support
fixed-size allocas with alignment larger than the stack.  Support for
arbitrarily aligned dynamic allocas coming soon.

llvm-svn: 24224
 2005-11-06 09:00:38 +00:00
Chris Lattner
d88f347ba5 minor clarity changes, no functionality difference. 
llvm-svn: 24223
 2005-11-06 08:23:17 +00:00
Chris Lattner
e86e4acf28 don't misencode CC#'s 
llvm-svn: 24219
 2005-11-06 07:46:13 +00:00
Chris Lattner
6c8657e621 encode/decode function alignment in bc files 
llvm-svn: 24218
 2005-11-06 07:43:39 +00:00
Chris Lattner
b456fb372d Read/write global variable alignments if present 
llvm-svn: 24216
 2005-11-06 07:11:04 +00:00
Chris Lattner
6991a6f23f print alignment info for globals and functions 
llvm-svn: 24212
 2005-11-06 06:48:53 +00:00
Chris Lattner
96d1807bfc regenerate 
llvm-svn: 24211
 2005-11-06 06:46:53 +00:00
Chris Lattner
8cda8020c7 Allow globals to have an alignment specified. Switch to using isPowerOf2_32 
at Jim's request for the checking code.

llvm-svn: 24210
 2005-11-06 06:46:28 +00:00
Chris Lattner
f98cdabb75 regenerate 
llvm-svn: 24208
 2005-11-06 06:34:34 +00:00
Chris Lattner
e09addd94b factor optional alignment 
llvm-svn: 24207
 2005-11-06 06:34:12 +00:00
Duraid Madina
cf11aefc91 ask for 16-byte aligned jmpbufs. This should unbreak C++ on IA64 (and 
a bunch of other things) but is currently ignored by the code
generator.

llvm-svn: 24206
 2005-11-06 04:29:30 +00:00
Chris Lattner
76a2afc0d3 Write/read allocation instruction alignment info to .bc files. 
llvm-svn: 24203
 2005-11-05 22:08:14 +00:00
Chris Lattner
c6ef0112c0 verify that alignments are always a power of 2 
llvm-svn: 24200
 2005-11-05 21:57:54 +00:00
Chris Lattner
a0d532c757 regenerate 
llvm-svn: 24199
 2005-11-05 21:54:23 +00:00
Chris Lattner
f2e7f355a0 Verify that alignment amounts are a power of 2 
llvm-svn: 24198
 2005-11-05 21:54:03 +00:00
Chris Lattner
8eee9a6234 fix printing the alignment directive 
llvm-svn: 24197
 2005-11-05 21:20:34 +00:00
Nate Begeman
f299b9fb03 Add support alignment of allocation instructions. 
Add support for specifying alignment and size of setjmp jmpbufs.

No targets currently do anything with this information, nor is it presrved
in the bytecode representation.  That's coming up next.

llvm-svn: 24196
 2005-11-05 09:21:28 +00:00
Chris Lattner
dc19995e25 add a case Nate sent me 
llvm-svn: 24195
 2005-11-05 08:57:56 +00:00
Chris Lattner
0bd3e3230c Implement Transforms/TailCallElim/return-undef.ll, a trivial case 
that has been sitting in my inbox since May 18. :)

llvm-svn: 24194
 2005-11-05 08:21:11 +00:00
Chris Lattner
4352c050d1 Turn sdiv into udiv if both operands have a clear sign bit. This occurs 
a few times in crafty:

OLD:    %tmp.36 = div int %tmp.35, 8            ; <int> [#uses=1]
NEW:    %tmp.36 = div uint %tmp.35, 8           ; <uint> [#uses=0]
OLD:    %tmp.19 = div int %tmp.18, 8            ; <int> [#uses=1]
NEW:    %tmp.19 = div uint %tmp.18, 8           ; <uint> [#uses=0]
OLD:    %tmp.117 = div int %tmp.116, 8          ; <int> [#uses=1]
NEW:    %tmp.117 = div uint %tmp.116, 8         ; <uint> [#uses=0]
OLD:    %tmp.92 = div int %tmp.91, 8            ; <int> [#uses=1]
NEW:    %tmp.92 = div uint %tmp.91, 8           ; <uint> [#uses=0]

Which all turn into shrs.

llvm-svn: 24190
 2005-11-05 07:40:31 +00:00
Chris Lattner
297e545d4b Turn srem -> urem when neither input has their sign bit set. This triggers 
8 times in vortex, allowing the srems to be turned into shrs:

OLD:    %tmp.104 = rem int %tmp.5.i37, 16               ; <int> [#uses=1]
NEW:    %tmp.104 = rem uint %tmp.5.i37, 16              ; <uint> [#uses=0]
OLD:    %tmp.98 = rem int %tmp.5.i24, 16                ; <int> [#uses=1]
NEW:    %tmp.98 = rem uint %tmp.5.i24, 16               ; <uint> [#uses=0]
OLD:    %tmp.91 = rem int %tmp.5.i19, 8         ; <int> [#uses=1]
NEW:    %tmp.91 = rem uint %tmp.5.i19, 8                ; <uint> [#uses=0]
OLD:    %tmp.88 = rem int %tmp.5.i14, 8         ; <int> [#uses=1]
NEW:    %tmp.88 = rem uint %tmp.5.i14, 8                ; <uint> [#uses=0]
OLD:    %tmp.85 = rem int %tmp.5.i9, 1024               ; <int> [#uses=2]
NEW:    %tmp.85 = rem uint %tmp.5.i9, 1024              ; <uint> [#uses=0]
OLD:    %tmp.82 = rem int %tmp.5.i, 512         ; <int> [#uses=2]
NEW:    %tmp.82 = rem uint %tmp.5.i1, 512               ; <uint> [#uses=0]
OLD:    %tmp.48.i = rem int %tmp.5.i.i161, 4            ; <int> [#uses=1]
NEW:    %tmp.48.i = rem uint %tmp.5.i.i161, 4           ; <uint> [#uses=0]
OLD:    %tmp.20.i2 = rem int %tmp.5.i.i, 4              ; <int> [#uses=1]
NEW:    %tmp.20.i2 = rem uint %tmp.5.i.i, 4             ; <uint> [#uses=0]

it also occurs 9 times in gcc, but with odd constant divisors (1009 and 61)
so the payoff isn't as great.

llvm-svn: 24189
 2005-11-05 07:28:37 +00:00