shylie/llvm-project
1
0
Fork 0
Code Issues Pull Requests Actions 6 Packages Projects Releases Wiki Activity
17,060 Commits 1,713 Branches 298 Tags
Commit Graph

1786 Commits

Author SHA1 Message Date
Chris Lattner
a3cc1835ad Fix 'raise' to work with packed types. Patch by Morten Ofstad. 
llvm-svn: 19693
 2005-01-19 16:16:35 +00:00
Chris Lattner
715364364b Delete PHI nodes that are not dead but are locked in a cycle of single 
useness.

llvm-svn: 19629
 2005-01-17 05:10:15 +00:00
Chris Lattner
03f06f11aa Move code out of indentation one level to make it easier to read. 
Disable the xform for < > cases.  It turns out that the following is being
miscompiled:

bool %test(sbyte %S) {
        %T = cast sbyte %S to uint
        %V = setgt uint %T, 255
        ret bool %V
}

llvm-svn: 19628
 2005-01-17 03:20:02 +00:00
Chris Lattner
51726c47fe Fix some bugs in an xform added yesterday. This fixes Prolangs-C/allroots. 
llvm-svn: 19553
 2005-01-14 17:35:12 +00:00
Chris Lattner
7aa41cfa88 Fix a compile crash on spiff 
llvm-svn: 19552
 2005-01-14 17:17:59 +00:00
Chris Lattner
4fa89827e2 if two gep comparisons only differ by one index, compare that index directly. 
This allows us to better optimize begin() -> end() comparisons in common cases.

llvm-svn: 19542
 2005-01-14 00:20:05 +00:00
Chris Lattner
d35d210ea0 Do not overrun iterators. This fixes a 176.gcc crash 
llvm-svn: 19541
 2005-01-13 23:26:48 +00:00
Chris Lattner
a04c904c4c Turn select C, (X+Y), (X-Y) --> (X+(select C, Y, (-Y))). This occurs in 
the 'sim' program and probably elsewhere.  In sim, it comes up for cases
like this:

#define round(x) ((x)>0.0 ? (x)+0.5 : (x)-0.5)
double G;
void T(double X) { G = round(X); }

(it uses the round macro a lot).  This changes the LLVM code from:

        %tmp.1 = setgt double %X, 0.000000e+00          ; <bool> [#uses=1]
        %tmp.4 = add double %X, 5.000000e-01            ; <double> [#uses=1]
        %tmp.6 = sub double %X, 5.000000e-01            ; <double> [#uses=1]
        %mem_tmp.0 = select bool %tmp.1, double %tmp.4, double %tmp.6
        store double %mem_tmp.0, double* %G

to:

        %tmp.1 = setgt double %X, 0.000000e+00          ; <bool> [#uses=1]
        %mem_tmp.0.p = select bool %tmp.1, double 5.000000e-01, double -5.000000e-01
        %mem_tmp.0 = add double %mem_tmp.0.p, %X
        store double %mem_tmp.0, double* %G
        ret void

llvm-svn: 19537
 2005-01-13 22:52:24 +00:00
Chris Lattner
81e8417614 Implement an optimization for == and != comparisons like this: 
_Bool test2(int X, int Y) {
  return &arr[X][Y] == arr;
}

instead of generating this:

bool %test2(int %X, int %Y) {
        %tmp.3.idx = mul int %X, 160            ; <int> [#uses=1]
        %tmp.3.idx1 = shl int %Y, ubyte 2               ; <int> [#uses=1]
        %tmp.3.offs2 = sub int 0, %tmp.3.idx            ; <int> [#uses=1]
        %tmp.7 = seteq int %tmp.3.idx1, %tmp.3.offs2            ; <bool> [#uses=1]
        ret bool %tmp.7
}


generate this:

bool %test2(int %X, int %Y) {
        seteq int %X, 0         ; <bool>:0 [#uses=1]
        seteq int %Y, 0         ; <bool>:1 [#uses=1]
        %tmp.7 = and bool %0, %1                ; <bool> [#uses=1]
        ret bool %tmp.7
}

This idiom occurs in C++ programs when iterating from begin() to end(),
in a vector or array.  For example, we now compile this:

void test(int X, int Y) {
  for (int *i = arr; i != arr+100; ++i)
    foo(*i);
}

to this:

no_exit:                ; preds = %entry, %no_exit
	...
        %exitcond = seteq uint %indvar.next, 100                ; <bool> [#uses=1]
        br bool %exitcond, label %return, label %no_exit



instead of this:

no_exit:                ; preds = %entry, %no_exit
	...
        %inc5 = getelementptr [100 x [40 x int]]* %arr, int 0, int 0, int %inc.rec              ; <int*> [#uses=1]
        %tmp.8 = seteq int* %inc5, getelementptr ([100 x [40 x int]]* %arr, int 0, int 100, int 0)              ; <bool> [#uses=1]
        %indvar.next = add uint %indvar, 1              ; <uint> [#uses=1]
        br bool %tmp.8, label %return, label %no_exit

llvm-svn: 19536
 2005-01-13 22:25:21 +00:00
Chris Lattner
4cb9fa373b Fix some bugs in code I didn't mean to check in. 
llvm-svn: 19534
 2005-01-13 20:40:58 +00:00
Chris Lattner
0798af33a5 Fix a crash compiling 129.compress 
llvm-svn: 19533
 2005-01-13 20:14:25 +00:00
Reid Spencer
134f02d0c7 Add the LOADABLE_MODULE=1 directive to indicate that this shared library is 
intended to be a dlopenable module and not a "plain" shared library.

llvm-svn: 19456
 2005-01-11 04:33:32 +00:00
Jeff Cohen
3e62e7c68b Apply feedback from Chris. 
llvm-svn: 19432
 2005-01-10 04:23:32 +00:00
Chris Lattner
798e84f59e Fix VS warnings 
llvm-svn: 19383
 2005-01-08 19:48:40 +00:00
Chris Lattner
46fa04b531 Fix VS warnings. 
llvm-svn: 19382
 2005-01-08 19:45:31 +00:00
Chris Lattner
fdfe3e49fe Fix uint64_t -> unsigned VS warnings. 
llvm-svn: 19381
 2005-01-08 19:42:22 +00:00
Chris Lattner
47f395cd85 Silence VS warnings. 
llvm-svn: 19380
 2005-01-08 19:37:20 +00:00
Chris Lattner
ce274ce93d Silence warnings 
llvm-svn: 19379
 2005-01-08 19:34:41 +00:00
Jeff Cohen
677babc4d4 Add more missing createXxxPass functions. 
llvm-svn: 19370
 2005-01-08 17:21:40 +00:00
Misha Brukman
417ca179a9 Convert tabs to spaces 
llvm-svn: 19320
 2005-01-07 07:05:34 +00:00
Jeff Cohen
9a7ac16214 Add missing createXxxPass functions 
llvm-svn: 19319
 2005-01-07 06:57:28 +00:00
Jeff Cohen
844410b48e Add missing include 
llvm-svn: 19315
 2005-01-07 05:42:13 +00:00
Jeff Cohen
eca0d0f2da Put createLoopUnswitchPass() into proper namespace 
llvm-svn: 19306
 2005-01-06 05:47:18 +00:00
Jeff Cohen
27595a4aec Add missing include 
llvm-svn: 19305
 2005-01-06 05:46:44 +00:00
Chris Lattner
86102b8ad5 This is a bulk commit that implements the following primary improvements: 
* We can now fold cast instructions into select instructions that
    have at least one constant operand.
  * We now optimize expressions more aggressively based on bits that are
    known to be zero.  These optimizations occur a lot in code that uses
    bitfields even in simple ways.
  * We now turn more cast-cast sequences into AND instructions.  Before we
    would only do this if it if all types were unsigned.  Now only the
    middle type needs to be unsigned (guaranteeing a zero extend).
  * We transform sign extensions into zero extensions in several cases.

This corresponds to these test/Regression/Transforms/InstCombine testcases:
  2004-11-22-Missed-and-fold.ll
  and.ll: test28-29
  cast.ll: test21-24
  and-or-and.ll
  cast-cast-to-and.ll
  zeroext-and-reduce.ll

llvm-svn: 19220
 2005-01-01 16:22:27 +00:00
Chris Lattner
3215bb6049 Implement SimplifyCFG/DeadSetCC.ll 
SimplifyCFG is one of those passes that we use for final cleanup: it should
not rely on other passes to clean up its garbage.  This fixes the "why are
trivially dead setcc's in the output of gccas" problem.

llvm-svn: 19212
 2005-01-01 16:02:12 +00:00
Chris Lattner
13516fe2e7 Fix PR491 and testcase Transforms/DeadStoreElimination/2004-12-28-PartialStore.ll 
llvm-svn: 19180
 2004-12-29 04:36:02 +00:00
Chris Lattner
b17f3e13ec Adjust to new interfaces 
llvm-svn: 18958
 2004-12-15 07:22:25 +00:00
Chris Lattner
9ad0d55025 Constant exprs are not efficiently negatable in practice. This disables 
turning X - (constantexpr) into X + (-constantexpr) among other things.

llvm-svn: 18935
 2004-12-14 20:08:06 +00:00
Brian Gaeke
f9639d2a74 Fix link error in PPC optimized build of 'opt'. 
llvm-svn: 18913
 2004-12-13 21:28:39 +00:00
Chris Lattner
8f430a3b59 Get rid of getSizeOf, using ConstantExpr::getSizeOf instead. 
do not insert a prototype for malloc of: void* malloc(uint): on 64-bit u
targets this is not correct.  Instead of prototype it as void *malloc(...),
and pass the correct intptr_t through the "...".

Finally, fix Regression/CodeGen/SparcV9/2004-12-13-MallocCrash.ll, by not
forming constantexpr casts from pointer to uint.

llvm-svn: 18908
 2004-12-13 20:00:02 +00:00
Chris Lattner
a199e3c1e2 Change indentation of a whole bunch of code, no real changes here. 
llvm-svn: 18843
 2004-12-12 23:49:37 +00:00
Chris Lattner
14d07db44d More substantial simplifications and speedups. This makes ADCE about 20% faster 
in some cases.

llvm-svn: 18842
 2004-12-12 23:40:17 +00:00
Chris Lattner
9115eb3024 More minor microoptimizations 
llvm-svn: 18841
 2004-12-12 22:44:30 +00:00
Chris Lattner
d4298781c1 Remove some more set operations 
llvm-svn: 18840
 2004-12-12 22:22:18 +00:00
Chris Lattner
a538439bf0 Reduce number of set operations. 
llvm-svn: 18839
 2004-12-12 22:16:13 +00:00
Chris Lattner
bf5b7cf638 Optimize div/rem + select combinations more. 
In particular, implement div.ll:test10 and rem.ll:test4.

llvm-svn: 18838
 2004-12-12 21:48:58 +00:00
Chris Lattner
745196a5fc Properly implement copying of a global, fixing the 255.vortex & povray 
failures from last night.

llvm-svn: 18832
 2004-12-12 19:34:41 +00:00
Chris Lattner
88deefa303 Simplify code and do not invalidate iterators. 
This fixes a crash compiling TimberWolfMC that was exposed due to recent
optimizer changes.

llvm-svn: 18831
 2004-12-12 18:23:20 +00:00
Chris Lattner
1cbd5be7a1 Though the previous xform applies to literally dozens (hundreds?) of variables 
in SPEC, the subsequent optimziations that we are after don't play with
with FP values, so disable this xform for them.  Really we just don't want
stuff like:

double G;   (always 0 or 412312.312)
  = G;

turning into:

bool G_b;
  = G_b ? 412312.312 : 0;

We'd rather just do the load.

-Chris

llvm-svn: 18819
 2004-12-12 06:03:06 +00:00
Chris Lattner
40e4cec9ee If a variable can only hold two values, and is not already a bool, shrink it 
down to actually BE a bool.  This allows simple value range propagation
stuff work harder, deleting comparisons in bzip2 in some hot loops.

This implements GlobalOpt/integer-bool.ll, which is the essence of the
loop condition distilled into a testcase.

llvm-svn: 18817
 2004-12-12 05:53:50 +00:00
Chris Lattner
cbc0161d1f If one side of and/or is known to be 0/-1, it doesn't matter 
if the other side is overdefined.

This allows us to fold conditions like:  if (X < Y || Y > Z) in some cases.

llvm-svn: 18807
 2004-12-11 23:15:19 +00:00
Chris Lattner
263b0a1669 Only cound if we actually made a change. 
llvm-svn: 18800
 2004-12-11 17:00:14 +00:00
Chris Lattner
ffefea0772 The split bb is really the exit of the old function 
llvm-svn: 18799
 2004-12-11 16:59:54 +00:00
Chris Lattner
2f687fd9d6 Two bug fixes: 
1. Actually increment the Statistic for the GV elim optzn
 2. When resolving undef branches, only resolve branches in executable blocks,
    avoiding marking a bunch of completely dead blocks live.  This has a big
    impact on the quality of the generated code.

With this patch, we positively rip up vortex, compiling Ut_MoveBytes to a
single memcpy call. In vortex we get this:

     12 ipsccp           - Number of globals found to be constant
    986 ipsccp           - Number of arguments constant propagated
   1378 ipsccp           - Number of basic blocks unreachable
   8919 ipsccp           - Number of instructions removed

llvm-svn: 18796
 2004-12-11 06:05:53 +00:00
Chris Lattner
8525ebe465 Do not delete the entry block to a function. 
llvm-svn: 18795
 2004-12-11 05:32:19 +00:00
Chris Lattner
91dbae6fee Implement Transforms/SCCP/ipsccp-gvar.ll, by tracking values stored to 
non-address-taken global variables.

llvm-svn: 18790
 2004-12-11 05:15:59 +00:00
Chris Lattner
99e1295645 Fix a bug where we could delete dead invoke instructions with uses. 
In functions where we fully constant prop the return value, replace all
ret instructions with 'ret undef'.

llvm-svn: 18786
 2004-12-11 02:53:57 +00:00
Chris Lattner
bae4b64553 Implement SCCP/ipsccp-conditional.ll, by totally deleting dead blocks. 
llvm-svn: 18781
 2004-12-10 22:29:08 +00:00
Chris Lattner
7285f43836 Fix SCCP/2004-12-10-UndefBranchBug.ll 
llvm-svn: 18776
 2004-12-10 20:41:50 +00:00