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
19,957 Commits 4 Branches 5 Tags 704 MiB
d9930002aa
Commit Graph

10920 Commits

Author SHA1 Message Date
Nate Begeman
1675c67c62 Move yet more folds over to the dag combiner from sd.cpp 
llvm-svn: 23278
 2005-09-08 20:18:10 +00:00
Chris Lattner
ca093b4f92 Add a bunch of stuff needed for node type inference. Move 'BLR' down with 
the rest of the instructions, add comment markers to seperate portions of
the file into logical parts

llvm-svn: 23277
 2005-09-08 19:50:41 +00:00
Chris Lattner
7d0a6e4db4 add patterns for x?oris? 
llvm-svn: 23268
 2005-09-08 17:40:49 +00:00
Chris Lattner
c23c950d73 add patterns to the addi/addis/mulli etc instructions. Define predicates 
for matching signed 16-bit and shifted 16-bit ppc immediates

llvm-svn: 23267
 2005-09-08 17:33:10 +00:00
Chris Lattner
f0d65ab5d3 Add patterns for some new instructions, allowing the use of the ineg fragment. 
llvm-svn: 23266
 2005-09-08 17:01:54 +00:00
Chris Lattner
1f7f2544fc ignore generated files 
llvm-svn: 23263
 2005-09-07 23:47:44 +00:00
Chris Lattner
1769be4699 Remove some cases handled by the generated portion of the isel 
llvm-svn: 23262
 2005-09-07 23:45:15 +00:00
Nate Begeman
c0f764ada4 Another round of dag combiner changes. This fixes some missing XOR folds 
as well as fixing how we replace old values with new values.

llvm-svn: 23260
 2005-09-07 23:25:52 +00:00
Chris Lattner
b3516c123f Fix a bug that Tzu-Chien Chiu noticed: live interval analysis does NOT 
preserve livevar

llvm-svn: 23259
 2005-09-07 17:34:39 +00:00
Nate Begeman
e8db0c961a Implement a common missing fold, (add (add x, c1), c2) -> (add x, c1+c2). 
This restores all of stanford to being identical with and without the dag
combiner with the add folding turned off in sd.cpp.

llvm-svn: 23258
 2005-09-07 16:09:19 +00:00
Chris Lattner
617b26ddd7 On non-apple systems, when using -march=ppc32, do not print: 
'' is not a recognized processor for this target (ignoring processor)

Default to "generic" instead of "" for the default CPU.

llvm-svn: 23257
 2005-09-07 05:45:33 +00:00
Chris Lattner
4c5e794a9c Print: 
'' is not a recognized processor for this target (ignoring processor)

instead of:

 is not a recognized processor for this target (ignoring processor)

llvm-svn: 23256
 2005-09-07 05:44:14 +00:00
Chris Lattner
482f71733a Fix a bug nate ran into with replacealluseswith. In the recursive cse case, 
we were losing a node, causing an assertion to fail.  Now we eagerly delete
discovered CSE's, and provide an optional vector to keep track of these
discovered equivalences.

llvm-svn: 23255
 2005-09-07 05:37:01 +00:00
Nate Begeman
143dc2039d Add an option to the DAG Combiner to enable it for beta runs, and turn on 
that option for PowerPC's beta.

llvm-svn: 23253
 2005-09-07 00:15:36 +00:00
Nate Begeman
718cae4eba Implement i64<->fp using the fctidz/fcfid instructions on PowerPC when we 
are allowed to generate 64-bit-only PowerPC instructions for 32 bit hosts,
such as the PowerPC 970.

This speeds up 189.lucas from 81.99 to 32.64 seconds.

llvm-svn: 23250
 2005-09-06 22:03:27 +00:00
Andrew Lenharth
6f61810447 Fix up the AssertXext problem, as well as adding it at calls 
llvm-svn: 23246
 2005-09-06 17:00:23 +00:00
Nate Begeman
a94912c555 Add note about future optimization noted in the ppc compiler writer's guide 
llvm-svn: 23245
 2005-09-06 15:30:48 +00:00
Nate Begeman
f1994fa030 Add accessor for 64bit flag, so that we can tell when it is safe to 
generate the fun in-register fp<->long instructions.

llvm-svn: 23244
 2005-09-06 15:30:12 +00:00
Nate Begeman
e1a34193fa Next round of DAGCombiner changes. This version now passes all the tests 
I have run so far when run before Legalize.  It still needs to pick up the
SetCC folds, and nodes that use SetCC.

llvm-svn: 23243
 2005-09-06 04:43:02 +00:00
Andrew Lenharth
00a229859e revert part of the last change, should fix regressions 
llvm-svn: 23241
 2005-09-04 06:12:19 +00:00
Chris Lattner
e9b488e262 explicitly specify an operands list for patterns with inputs (e.g. neg) 
llvm-svn: 23240
 2005-09-03 01:28:40 +00:00
Chris Lattner
dcb9830e25 include the dag isel fragment 
llvm-svn: 23239
 2005-09-03 01:17:22 +00:00
Chris Lattner
4186020e3b ask for a dag isel 
llvm-svn: 23238
 2005-09-03 01:15:41 +00:00
Chris Lattner
29929a3745 Fix a checking failure in gs 
llvm-svn: 23235
 2005-09-03 01:04:40 +00:00
Chris Lattner
cbfe5d4180 Change the isel to not break out of the big giant switch. Instead, the 
switch should never be exited, so its bottom is now unreachable.

llvm-svn: 23234
 2005-09-03 00:53:47 +00:00
Chris Lattner
47c5e11f36 rearrange logical ops to group them together more consistently. 
Define the PatFrag class which can be used to define subpatterns to match
things with.  Define 'not', and use it to define the patterns for andc,
nand, etc.

llvm-svn: 23233
 2005-09-03 00:21:51 +00:00
Chris Lattner
a1a3e767e3 Add AND/OR/XOR 
llvm-svn: 23232
 2005-09-02 22:35:53 +00:00
Nate Begeman
613f777bbc Next round of DAG Combiner changes. Just need to support multiple return 
values, and then we should be able to hook it up.

llvm-svn: 23231
 2005-09-02 21:18:40 +00:00
Chris Lattner
0b07b6f9a1 Add some initial patterns to simple binary instructions, though they 
currently don't do anything.  This elides patterns for binary operators
that ping on the carry flag, since we don't model it yet.

This patch also removes PPC::SUB, because it is dead.

llvm-svn: 23230
 2005-09-02 21:18:00 +00:00
Chris Lattner
da97aa059c Clean up some code from the last checkin 
llvm-svn: 23229
 2005-09-02 20:32:45 +00:00
Chris Lattner
4c2b614aa6 Fix a bug in legalize where it would emit two calls to libcalls that return 
i64 values on targets that need that expanded to 32-bit registers.  This fixes
PowerPC/2005-09-02-LegalizeDuplicatesCalls.ll and speeds up 189.lucas from
taking 122.72s to 81.96s on my desktop.

llvm-svn: 23228
 2005-09-02 20:26:58 +00:00
Chris Lattner
e1a69ba1bd turn on dag isel by default 
llvm-svn: 23226
 2005-09-02 19:53:54 +00:00
Chris Lattner
17b67e5137 Make sure to auto-cse nullary ops 
llvm-svn: 23224
 2005-09-02 19:36:17 +00:00
Jim Laskey
1f9c40400c Add help support for -mcpu and -mattr. 
llvm-svn: 23222
 2005-09-02 19:27:43 +00:00
Chris Lattner
7995b70148 Fix some buggy logic where we would try to remove nodes with two operands 
from the binary ops map, even if they had multiple results.  This latent bug
caused a few failures with the dag isel last night.

To prevent stuff like this from happening in the future, add some really
strict checking to make sure that the CSE maps always match up with reality!

llvm-svn: 23221
 2005-09-02 19:15:44 +00:00
Andrew Lenharth
94da25ae50 Pull out Lowering in preperation for multiple ISels. Oh, and get rid of some stuff 
llvm-svn: 23220
 2005-09-02 18:46:02 +00:00
Chris Lattner
365774f457 Don't create zero sized stack objects even for array allocas with a zero 
number of elements.

llvm-svn: 23219
 2005-09-02 18:41:28 +00:00
Chris Lattner
813a73e8e9 Decouple fsqrt from gpul optimizations, implementing fsqrt.ll. 
Remove the -enable-gpopt option which is subsumed by feature flags.

llvm-svn: 23218
 2005-09-02 18:33:05 +00:00
Chris Lattner
7d89863a77 Fix the release build, noticed by Eric van Riet Paap 
llvm-svn: 23215
 2005-09-02 07:09:28 +00:00
Chris Lattner
371f542759 Fix a problem that Dan Berlin noticed, where reassociation would not succeed 
in building maximal expressions before simplifying them.  In particular, i
cases like this:

X-(A+B+X)

the code would consider A+B+X to be a maximal expression (not understanding
that the single use '-' would be turned into a + later), simplify it (a noop)
then later get simplified again.

Each of these simplify steps is where the cost of reassociation comes from,
so this patch should speed up the already fast pass a bit.

Thanks to Dan for noticing this!

llvm-svn: 23214
 2005-09-02 07:07:58 +00:00
Chris Lattner
4cade5915d Avoid creating garbage instructions, just move the old add instruction 
to where we need it when converting -(A+B+C) -> -A + -B + -C.

llvm-svn: 23213
 2005-09-02 06:38:04 +00:00
Chris Lattner
dfba6f5029 add some assertions and fix problems where reassociate could access the 
Ops vector out of range

llvm-svn: 23211
 2005-09-02 05:23:22 +00:00
Jeff Cohen
930e81f03b Fix VC++ build errors 
llvm-svn: 23210
 2005-09-02 02:51:42 +00:00
Chris Lattner
6f9e01aa94 Restore this patch now that the latent bug has been fixed 
llvm-svn: 23209
 2005-09-02 01:24:55 +00:00
Chris Lattner
86bed2f90b Make sure to legalize assert[zs]ext's operand correctly 
llvm-svn: 23208
 2005-09-02 01:15:01 +00:00
Chris Lattner
a58ee78b78 Revert the previous patch which causes a mysterious regression in toast. 
llvm-svn: 23207
 2005-09-02 00:47:05 +00:00
Chris Lattner
4919477f39 Teach live intervals to not crash on dead livein regs 
llvm-svn: 23206
 2005-09-02 00:20:32 +00:00
Chris Lattner
8a6c15f4f4 For values that are live across basic blocks and need promotion, use ANY_EXTEND 
instead of ZERO_EXTEND to eliminate extraneous extensions.  This eliminates
dead zero extensions on formal arguments and other cases on PPC, implementing
the newly tightened up test/Regression/CodeGen/PowerPC/small-arguments.ll test.

llvm-svn: 23205
 2005-09-02 00:19:37 +00:00
Chris Lattner
aae61e684c legalize ANY_EXTEND appropriately 
llvm-svn: 23204
 2005-09-02 00:18:10 +00:00
Chris Lattner
3f7fbe14a8 Add support for ANY_EXTEND and add a few minor folds for it 
llvm-svn: 23203
 2005-09-02 00:17:32 +00:00