RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-25 04:02:41 +01:00
Code Issues Projects Releases Wiki Activity
55,631 Commits 4 Branches 5 Tags 704 MiB
e5c3a6f658
Commit Graph

55631 Commits

This Branch
This Branch
All Branches
Author SHA1 Message Date
Devang Patel
23fa5c982d Fix begin and end markers for nested scopes. 
llvm-svn: 92505
 2010-01-04 20:44:00 +00:00
Dan Gohman
a89531ec4f Replace some special-case code which probably was buggy with an assertion 
verifying that the special case does not occur.

llvm-svn: 92504
 2010-01-04 20:36:57 +00:00
Dan Gohman
f47c2a2335 Remove the CPAttrParentAsRoot code, which is unused, and inconvenient 
for a refactoring I'm working on.

llvm-svn: 92503
 2010-01-04 20:31:55 +00:00
David Greene
ff1cb647fb Change errs() to dbgs(). 
llvm-svn: 92502
 2010-01-04 19:57:26 +00:00
Devang Patel
46d7029a91 The test, derived from optimzed IR, does not mention "bar" in debug info anywhere so the dwarf writer is not expected to emit any debug info for function "bar". 
llvm-svn: 92499
 2010-01-04 19:41:13 +00:00
David Greene
1c49766403 Change errs() to dbgs(). 
llvm-svn: 92498
 2010-01-04 19:36:42 +00:00
David Greene
11dfd04083 Change errs() to dbgs(). 
llvm-svn: 92496
 2010-01-04 19:10:20 +00:00
Chris Lattner
3b060b2d41 Truncate GEP indexes larger than the pointer size down to pointer size 
when doing this transform if the GEP is not inbounds.  No testcase because
it is very difficult to trigger this: instcombine already canonicalizes
GEP indices to pointer size, so it relies specific permutations of the
instcombine worklist.

Thanks to Duncan for pointing this possible problem out.

llvm-svn: 92495
 2010-01-04 18:57:15 +00:00
Chris Lattner
8304a93ff4 silence a bogus 'might be used uninit' warning from GCC. 
llvm-svn: 92494
 2010-01-04 18:48:26 +00:00
Dan Gohman
4a8e4ee52a Add a comment. 
llvm-svn: 92492
 2010-01-04 18:38:39 +00:00
David Greene
c6beea09c5 Change errs() to dbgs(). 
llvm-svn: 92490
 2010-01-04 17:47:05 +00:00
Anton Korobeynikov
3915cf5ef4 Fix invalid chain folding for memory variant of sdiv / udiv 
llvm-svn: 92472
 2010-01-04 10:31:54 +00:00
Chris Lattner
e19878577c move some more cast-related stuff 
llvm-svn: 92471
 2010-01-04 07:59:07 +00:00
Mikhail Glushenkov
38e36d577a 80-col violations, trailing whitespace. 
llvm-svn: 92470
 2010-01-04 07:55:25 +00:00
Chris Lattner
f9920fbac9 move the [Can]EvaluateInDifferentType functions out to InstCombineCasts.cpp 
llvm-svn: 92469
 2010-01-04 07:54:59 +00:00
Chris Lattner
7a5037baf5 split 943 lines of instcombine out to a new InstCombineCasts.cpp 
file.  InstructionCombining.cpp is now down to a svelte 9300 lines :)

llvm-svn: 92468
 2010-01-04 07:53:58 +00:00
Chris Lattner
fed736376e split instcombine of compares (visit[FI]Cmp) out to 
a new InstCombineCompares.cpp file.

llvm-svn: 92467
 2010-01-04 07:37:31 +00:00
Chris Lattner
176c21d33e update cmakefile 
llvm-svn: 92466
 2010-01-04 07:19:55 +00:00
Chris Lattner
fbcc4eb5a5 move the 'SimplifyDemandedFoo' methods out to their own file, cutting 1K lines out of instcombine.cpp 
llvm-svn: 92465
 2010-01-04 07:17:19 +00:00
Mikhail Glushenkov
a73e92b400 Fix the Emacs mode string. 
Also trailing whitespace & 80-col violations.

llvm-svn: 92464
 2010-01-04 07:16:12 +00:00
Chris Lattner
cf0889fda3 split the instcombine class definition out to a header shared 
among the instcombine library.

llvm-svn: 92463
 2010-01-04 07:12:23 +00:00
Chris Lattner
cb0fe8a20b remove a ton of unneeded LLVMContext stuff. 
llvm-svn: 92462
 2010-01-04 07:02:48 +00:00
Chris Lattner
ec9a1ab1bb move InstCombineWorklist out to its own header. 
llvm-svn: 92461
 2010-01-04 06:30:00 +00:00
Chris Lattner
2e86be5607 forgot to svn add these. 
llvm-svn: 92460
 2010-01-04 06:28:20 +00:00
Chris Lattner
2d9948f5f1 move instcombine to its own library, it's past time. 
llvm-svn: 92459
 2010-01-04 06:23:24 +00:00
Chris Lattner
ce3f5f3448 implement an instcombine xform needed by clang's codegen 
on the example in PR4216.  This doesn't trigger in the testsuite,
so I'd really appreciate someone scrutinizing the logic for
correctness.

llvm-svn: 92458
 2010-01-04 06:03:59 +00:00
Chris Lattner
8e83066d12 fix PR5930, allowing the asmprinter to emit difference between 
two labels as a truncate.

llvm-svn: 92455
 2010-01-03 18:33:18 +00:00
Chris Lattner
80802043f4 it isn't safe to speculative load from a malloc, it might have 
returned null, and may not have been big enough in any case.  
Thanks to Jay Foad for pointing this out!

llvm-svn: 92452
 2010-01-03 18:14:24 +00:00
Chris Lattner
49cda26f7e add PR# 
llvm-svn: 92451
 2010-01-03 18:10:58 +00:00
Chris Lattner
7246a69d2b differences between two blockaddress's don't cause a 
global variable initializer to require relocations.

llvm-svn: 92450
 2010-01-03 18:09:40 +00:00
Chris Lattner
eb68b810a8 pull my debug hooks out, I'm done with this xform for now. 
llvm-svn: 92446
 2010-01-03 06:58:48 +00:00
Nick Lewycky
ebb78c871c Small cleanups, refactor some duplicated code into a single method. No 
functionality change.

llvm-svn: 92445
 2010-01-03 04:39:07 +00:00
Chris Lattner
647c629ee4 generalize the previous transformation to handle indexing into 
arrays of structs and other arrays, so long as all the subsequent
indexes are constants.  This triggers frequently for stuff like:

@divisions = internal constant [29 x [2 x i32]] [[2 x i32] zeroinitializer, [2 x i32] [i32 0, i32 1], [2 x i32] [i32 0, i32 2], [2 x i32] [i32 0, i32 1], [2 x i32] zeroinitializer, [2 x i32] [i32 0, i32 1], [2 x i32] [i32 0, i32 1], [2 x i32] [i32 0, i32 2], [2 x i32] [i32 0, i32 2], [2 x i32] zeroinitializer, [2 x i32] zeroinitializer, [2 x i32] zeroinitializer, [2 x i32] [i32 0, i32 2], [2 x i32] [i32 0, i32 1], [2 x i32] zeroinitializer, [2 x i32] [i32 1, i32 0], [2 x i32] [i32 1, i32 1], [2 x i32] [i32 1, i32 1], [2 x i32] [i32 1, i32 2], [2 x i32] [i32 1, i32 1], [2 x i32] [i32 1, i32 0], [2 x i32] [i32 1, i32 2], [2 x i32] [i32 1, i32 2], [2 x i32] [i32 1, i32 0], [2 x i32] [i32 1, i32 0], [2 x i32] [i32 1, i32 0], [2 x i32] [i32 1, i32 1], [2 x i32] [i32 1, i32 2], [2 x i32] [i32 1, i32 2]], align 32 ; <[29 x [2 x i32]]*> [#uses=50]

	  %623 = getelementptr inbounds [29 x [2 x i32]]* @divisions, i64 0, i64 %619, i64 0 ; <i32*> [#uses=1]
	   %684 = icmp eq i32 %683, 999 

also for the "my_defs" table in 'gs', etc.

llvm-svn: 92444
 2010-01-03 03:03:27 +00:00
Nick Lewycky
b871238139 Cleanup. 
llvm-svn: 92436
 2010-01-03 00:55:31 +00:00
Chris Lattner
acb0c133ec teach instcombine to optimize idioms like A[i]&42 == 0. This 
occurs in 403.gcc in mode_mask_array, in safe-ctype.c (which
is copied in multiple apps) in _sch_istable, etc.

llvm-svn: 92427
 2010-01-02 22:08:28 +00:00
Chris Lattner
4af67af013 Teach the table lookup optimization to generate range compares 
when a consequtive sequence of elements all satisfies the 
predicate.  Like the double compare case, this generates better
code than the magic constant case and generalizes to more than
32/64 element array lookups.

Here are some examples where it triggers.  From 403.gcc, most
accesses to the rtx_class array are handled, e.g.:

@rtx_class = constant [153 x i8] c"xxxxxmmmmmmmmxxxxxxxxxxxxmxxxxxxiiixxxxxxxxxxxxxxxxxxxooxooooooxxoooooox3x2c21c2222ccc122222ccccaaaaaa<<<<<<<<<<<<<<<<<<111111111111bbooxxxxxxxxxxcc2211x", align 32 ; <[153 x i8]*> [#uses=547]
   %142 = icmp eq i8 %141, 105
@rtx_class = constant [153 x i8] c"xxxxxmmmmmmmmxxxxxxxxxxxxmxxxxxxiiixxxxxxxxxxxxxxxxxxxooxooooooxxoooooox3x2c21c2222ccc122222ccccaaaaaa<<<<<<<<<<<<<<<<<<111111111111bbooxxxxxxxxxxcc2211x", align 32 ; <[153 x i8]*> [#uses=543]
	   %165 = icmp eq i8 %164, 60      

Also, most of the 59-element arrays (mode_class/rid_to_yy, etc) 
optimized before are actually range compares.  This lets 32-bit
machines optimize them.

400.perlbmk has stuff like this:

400.perlbmk: PL_regkind, even for 32-bit:
@PL_regkind = constant [62 x i8] c"\00\00\02\02\02\06\06\06\06\09\09\0B\0B\0D\0E\0E\0E\11\12\12\14\14\16\16\18\18\1A\1A\1C\1C\1E\1F !!!$$&'((((,-.///88886789:;8$", align 32 ; <[62 x i8]*> [#uses=4]
	   %811 = icmp ne i8 %810, 33 

@PL_utf8skip = constant [256 x i8] c"\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\01\02\02\02\02\02\02\02\02\02\02\02\02\02\02\02\02\02\02\02\02\02\02\02\02\02\02\02\02\02\02\02\02\03\03\03\03\03\03\03\03\03\03\03\03\03\03\03\03\04\04\04\04\04\04\04\04\05\05\05\05\06\06\07\0D", align 32 ; <[256 x i8]*> [#uses=94]
	   %12 = icmp ult i8 %10, 2
           
etc.

llvm-svn: 92426
 2010-01-02 21:50:18 +00:00
Chris Lattner
c67cde71b1 theoretically the negate we find could be in a different function, check 
for this case.

llvm-svn: 92425
 2010-01-02 21:46:33 +00:00
Chris Lattner
dfb25d34f5 use enums for the over/underdefined markers for clarity. Switch 
to using -2/-3 instead of -1/-2 for a future xform.

llvm-svn: 92423
 2010-01-02 20:20:33 +00:00
Chris Lattner
07a1a284d3 remove the random sampling framework, which is not maintained anymore. 
If there is interest, it can be resurrected from SVN.  PR4912.

llvm-svn: 92422
 2010-01-02 20:07:03 +00:00
Nick Lewycky
cda0109ec5 Fix logic error in previous commit. The != case needs to become an or, not an 
and.

llvm-svn: 92419
 2010-01-02 16:14:56 +00:00
Nick Lewycky
3cc8fe073a Optimize pointer comparison into the typesafe form, now that the backends will 
handle them efficiently. This is the opposite direction of the transformation
we used to have here.

llvm-svn: 92418
 2010-01-02 15:25:44 +00:00
Chris Lattner
e1a2489017 Generalize the previous xform to handle cases where exactly 
two elements match or don't match with two comparisons.  For
example, the testcase compiles into:

define i1 @test5(i32 %X) {
  %1 = icmp eq i32 %X, 2                          ; <i1> [#uses=1]
  %2 = icmp eq i32 %X, 7                          ; <i1> [#uses=1]
  %R = or i1 %1, %2                               ; <i1> [#uses=1]
  ret i1 %R
}

This generalizes the previous xforms when the array is larger than
64 elements (and this case matches) and generates better code for
cases where it overlaps with the magic bitshift case.

This generalizes more cases than you might expect.  For example,
400.perlbmk has:

@PL_utf8skip = constant [256 x i8] c"\01\01\01\...
%15 = icmp ult i8 %7, 7

403.gcc has:
@rid_to_yy = internal constant [114 x i16] [i16 259, i16 260, ...
%18 = icmp eq i16 %16, 295 

and xalancbmk has a bunch of examples, such as 
_ZN11xercesc_2_5L15gCombiningCharsE and _ZN11xercesc_2_5L10gBaseCharsE.

llvm-svn: 92417
 2010-01-02 09:35:17 +00:00
Chris Lattner
8b60c9de65 fix a miscompilation I introduced of cdecl with a late change. 
llvm-svn: 92416
 2010-01-02 09:22:13 +00:00
Chris Lattner
1cdc77b8da enhance the compare/load/index optimization to work on *any* load 
from a global with 32/64 elements or less (depending on whether
i64 is native on the target), generating a bitshift idiom to 
determine the result.  For example, on test4 we produce:

define i1 @test4(i32 %X) {
  %1 = lshr i32 933, %X                           ; <i32> [#uses=1]
  %2 = and i32 %1, 1                              ; <i32> [#uses=1]
  %R = icmp ne i32 %2, 0                          ; <i1> [#uses=1]
  ret i1 %R
}

This triggers in a number of interesting cases, for example, here's an
fp case:
@A.3255 = internal constant [4 x double] [double 4.100000e+00, double -3.900000e+00, double -1.000000e+00, double 1.000000e+00], align 32 ; <[4 x double]*> [#uses=7]
...
	   %7 = fcmp olt double %3, 0.000000e+00

In this case we make the slen2_tab global dead, which is nice:
@slen2_tab = internal constant [16 x i32] [i32 0, i32 1, i32 2, i32 3, i32 0, i32 1, i32 2, i32 3, i32 1, i32 2, i32 3, i32 1, i32 2, i32 3, i32 2, i32 3], align 32 ; <[16 x i32]*> [#uses=1]
...
	   %204 = icmp eq i32 %46, 0     

Perl has a bunch of these, also on the 'Perl_regkind' array:
@Perl_yygindex = internal constant [51 x i16] [i16 0, i16 0, i16 0, i16 0, i16 374, i16 351, i16 0, i16 -12, i16 0, i16 946, i16 413, i16 -83, i16 0, i16 0, i16 0, i16 -311, i16 -13, i16 4007, i16 2893, i16 0, i16 0, i16 0, i16 0, i16 0, i16 372, i16 -8, i16 0, i16 0, i16 246, i16 -131, i16 43, i16 86, i16 208, i16 -45, i16 -169, i16 987, i16 0, i16 0, i16 0, i16 0, i16 308, i16 0, i16 -271, i16 0, i16 0, i16 0, i16 0, i16 0, i16 0, i16 0, i16 0], align 32 ; <[51 x i16]*> [#uses=1]
...
  %1364 = icmp eq i16 %1361, 0

186.crafty really likes this on 64-bit machines, because it triggers on a bunch of globals like this:
@white_outpost = internal constant [64 x i8] c"\00\00\00\00\00\00\00\00\00\00\00\00\00\00\00\00\00\00\00\00\00\00\00\00\00\00\00\02\02\00\00\00\00\00\04\05\05\04\00\00\00\00\03\06\06\03\00\00\00\00\00\01\01\00\00\00\00\00\00\00\00\00\00\00", align 32 ; <[64 x i8]*> [#uses=2]

However the big winner is 403.gcc, which triggers hundreds of times, eliminating all the accesses to the 57-element arrays 'mode_class', mode_unit_size, mode_bitsize, regclass_map, etc.

go 64-bit machines :)

llvm-svn: 92415
 2010-01-02 08:56:52 +00:00
Mikhail Glushenkov
ebbb5dabd1 Forward -O0 to llvm-gcc. 
llvm-svn: 92414
 2010-01-02 08:27:23 +00:00
Mikhail Glushenkov
1768e877ec Apparently, it is OK for -MT to be specified several times. 
llvm-svn: 92413
 2010-01-02 08:27:10 +00:00
Chris Lattner
59136ba5ad enhance the previous optimization to work with fcmp in addition 
to icmp.

llvm-svn: 92412
 2010-01-02 08:20:51 +00:00
Chris Lattner
f3f6c10218 Teach instcombine to fold compares of loads from constant 
arrays with variable indices into a comparison of the index
with a constant.  The most common occurrence of this that
I see by far is stuff like:

if ("foobar"[i] == '\0') ...

which we compile into: if (i == 6), saving a load and 
materialization of the global address.  This also exposes 
loop trip count information to later passes in many cases.

This triggers hundreds of times in xalancbmk, which is where I first
noticed it, but it also triggers in many other apps.  Here are a few 
interesting ones from various apps:

@must_be_connected_without = internal constant [8 x i8*] [i8* getelementptr inbounds ([3 x i8]* @.str64320, i64 0, i64 0), i8* getelementptr inbounds ([3 x i8]* @.str27283, i64 0, i64 0), i8* getelementptr inbounds ([4 x i8]* @.str71327, i64 0, i64 0), i8* getelementptr inbounds ([4 x i8]* @.str72328, i64 0, i64 0), i8* getelementptr inbounds ([3 x i8]* @.str18274, i64 0, i64 0), i8* getelementptr inbounds ([6 x i8]* @.str11267, i64 0, i64 0), i8* getelementptr inbounds ([3 x i8]* @.str32288, i64 0, i64 0), i8* null], align 32 ; <[8 x i8*]*> [#uses=2]
  %scevgep.i = getelementptr [8 x i8*]* @must_be_connected_without, i64 0, i64 %indvar.i ; <i8**> [#uses=1]
  %17 = load ...
  %18 = icmp eq i8* %17, null                     ; <i1> [#uses=1]
-> icmp eq i64 %indvar.i, 7 


@yytable1095 = internal constant [84 x i8] c"\12\01(\05\06\07\08\09\0A\0B\0C\0D\0E1\0F\10\11266\1D: \10\11,-,0\03'\10\11B6\04\17&\18\1945\05\06\07\08\09\0A\0B\0C\0D\0E\1E\0F\10\11*\1A\1B\1C$3+>#%;<IJ=ADFEGH9KL\00\00\00C", align 32 ; <[84 x i8]*> [#uses=2]
  %57 = getelementptr inbounds [84 x i8]* @yytable1095, i64 0, i64 %56 ; <i8*> [#uses=1]
   %mode.0.in = getelementptr inbounds [9 x i32]* @mb_mode_table, i64 0, i64 %.pn ; <i32*> [#uses=1]
load ...
   %64 = icmp eq i8 %58, 4                         ; <i1> [#uses=1]
-> icmp eq i64 %.pn, 35             ; <i1> [#uses=0]


@gsm_DLB = internal constant [4 x i16] [i16 6554, i16 16384, i16 26214, i16 32767]
%scevgep.i = getelementptr [4 x i16]* @gsm_DLB, i64 0, i64 %indvar.i ; <i16*> [#uses=1]
%425 = load %scevgep.i
%426 = icmp eq i16 %425, -32768                 ; <i1> [#uses=0]
-> false

llvm-svn: 92411
 2010-01-02 08:12:04 +00:00
Chris Lattner
8a0648118b constant fold nasty constant expressions formed by llvm-gcc, 
wrapping up PR3351.

llvm-svn: 92410
 2010-01-02 01:22:23 +00:00
Chris Lattner
cf784992da remove the instcombine transformations that are inserting nasty 
pointer to int casts that confuse later optimizations.  See PR3351
for details.

This improves but doesn't complete fix 483.xalancbmk because llvm-gcc
does this xform in GCC's "fold" routine as well.  Clang++ will do
better I guess.

llvm-svn: 92408
 2010-01-02 00:31:05 +00:00