wangtao
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
7,936 Commits 29 Branches 0 Tags 2.2 GiB
Commit Graph

120 Commits

Author SHA1 Message Date
Chris Lattner dbba189f15 Implement InstCombine/add.ll:test(15|16) 
llvm-svn: 8604
 2003-09-19 15:35:42 +00:00
Chris Lattner cce81be1e1 Simplify code 
Implement InstCombine/mul.ll:test9

llvm-svn: 8488
 2003-09-11 22:24:54 +00:00
Chris Lattner 216c7b8aed Fix spell-o's 
llvm-svn: 8431
 2003-09-10 05:29:43 +00:00
Chris Lattner 3ac7c26a1c Implement instcombine optimizations: 
(A <setcc1> B) logicalop (A <setcc2> B)  -> (A <setcc3> B) or true or false

Where setcc[123] is one of the 6 setcc instructions, and logicalop is one of: And, Or, Xor

llvm-svn: 7828
 2003-08-13 20:16:26 +00:00
Chris Lattner b8b97505ba Generalize some of the add tests to allow for reassociation to take place 
llvm-svn: 7825
 2003-08-13 19:01:45 +00:00
Chris Lattner d07283a2ad Implement InstCombine/2003-08-12-AllocaNonNull.ll 
llvm-svn: 7807
 2003-08-13 05:38:46 +00:00
Chris Lattner c992add9fe Do not cannonicalize (X != 0) into (cast X to bool) 
llvm-svn: 7806
 2003-08-13 05:33:12 +00:00
Chris Lattner ede3fe05c5 Change cannonicalization rules: add X,X is represented as multiplies, multiplies 
of a power of two are represented as a shift.

llvm-svn: 7803
 2003-08-13 04:18:28 +00:00
Chris Lattner deaa0dd71a Allow pulling logical operations through shifts. 
This implements InstCombine/shift.ll:test14*

llvm-svn: 7793
 2003-08-12 21:53:41 +00:00
Chris Lattner 01d5639515 Simplify code 
llvm-svn: 7783
 2003-08-12 19:17:27 +00:00
Chris Lattner 812aab7727 Implement testcases InstCombine/or.ll:test16/test17 
llvm-svn: 7782
 2003-08-12 19:11:07 +00:00
Chris Lattner ab780dfab5 Instcombine: (A >> c1) << c2 for signed integers 
llvm-svn: 7295
 2003-07-24 18:38:56 +00:00
Chris Lattner 3204d4ed4e Reorganization of code, no functional changes. 
Now it shoudl be a bit more efficient

llvm-svn: 7292
 2003-07-24 17:52:58 +00:00
Chris Lattner dfae8be3c9 Allow folding several instructions into casts, which can simplify a lot 
of codes.  For example,
short kernel (short t1) {
  t1 >>= 8; t1 <<= 8;
  return t1;
}

became:

short %kernel(short %t1.1) {
        %tmp.3 = shr short %t1.1, ubyte 8               ; <short> [#uses=1]
        %tmp.5 = cast short %tmp.3 to int               ; <int> [#uses=1]
        %tmp.7 = shl int %tmp.5, ubyte 8                ; <int> [#uses=1]
        %tmp.8 = cast int %tmp.7 to short               ; <short> [#uses=1]
        ret short %tmp.8
}

before, now it becomes:
short %kernel(short %t1.1) {
        %tmp.3 = shr short %t1.1, ubyte 8               ; <short> [#uses=1]
        %tmp.8 = shl short %tmp.3, ubyte 8              ; <short> [#uses=1]
        ret short %tmp.8
}

which will become:
short %kernel(short %t1.1) {
        %tmp.3 = and short %t1.1, 0xFF00
        ret short %tmp.3
}

This implements cast-set.ll:test4 and test5

llvm-svn: 7290
 2003-07-24 17:35:25 +00:00
Chris Lattner bfb1d03159 Add comments 
llvm-svn: 7283
 2003-07-23 21:41:57 +00:00
Chris Lattner 9763859e8d Remove explicit check for: not (not X) = X, it is already handled because xor is commutative 
- InstCombine: (X & C1) ^ C2 --> (X & C1) | C2 iff (C1&C2) == 0
  - InstCombine: (X | C1) ^ C2 --> (X | C1) & ~C2 iff (C1&C2) == C2

llvm-svn: 7282
 2003-07-23 21:37:07 +00:00
Chris Lattner 33217db4d9 InstCombine: (X ^ C1) & C2 --> (X & C2) iff (C1&C2) == 0 
llvm-svn: 7272
 2003-07-23 19:36:21 +00:00
Chris Lattner 16464b36ff - InstCombine: (X | C1) & C2 --> X & C2 iff C1 & C1 == 0 
- InstCombine: (X | C) & C --> C
  - InstCombine: (X | C1) & C2 --> (X | (C1&C2)) & C2

llvm-svn: 7269
 2003-07-23 19:25:52 +00:00
Chris Lattner 8f0d15601a IC: (X & C1) | C2 --> (X | C2) & (C1|C2) 
IC: (X ^ C1) | C2 --> (X | C2) ^ (C1&~C2)

We are now guaranteed that all 'or's will be inside of 'and's, and all 'and's
will be inside of 'xor's, if the second operands are constants.

llvm-svn: 7264
 2003-07-23 18:29:44 +00:00
Chris Lattner 49b47ae565 IC: (X ^ C1) & C2 --> (X & C2) ^ (C1&C2) 
Minor code cleanup

llvm-svn: 7262
 2003-07-23 17:57:01 +00:00
Chris Lattner cfbce7c880 InstCombine: (X ^ 4) == 8 --> X == 12 
llvm-svn: 7260
 2003-07-23 17:26:36 +00:00
Chris Lattner d492a0b7b4 IC: (X & 5) == 13 --> false 
IC: (X | 8) == 4  --> false

llvm-svn: 7257
 2003-07-23 17:02:11 +00:00
Chris Lattner 6077c3195f Simplify code by using ConstantInt::getRawValue instead of checking to see 
whether the constant is signed or unsigned, then casting

llvm-svn: 7252
 2003-07-23 15:22:26 +00:00
Chris Lattner bdb0ce0605 - InstCombine (cast (xor A, B) to bool) ==> (setne A, B) 
- InstCombine (cast (and X, (1 << size(X)-1)) to bool) ==> x < 0

llvm-svn: 7241
 2003-07-22 21:46:59 +00:00
John Criswell d6dcbc6ce8 Added code that checks to see if a global variable is external before replacing 
a load of the global variable with the variable's constant value.

llvm-svn: 7216
 2003-07-21 19:42:57 +00:00
John Criswell 0643ceafcf Dinakar and I fixed a bug where we were trying to get the initializer of 
an external constant.  Since external constants don't have initializers, we
were failing on an assert() call in llvm/GlobalVariable.h.

llvm-svn: 7193
 2003-07-17 19:06:55 +00:00
Chris Lattner 0f1d8a3947 Add support for elimination of load instruction from global constants 
llvm-svn: 6912
 2003-06-26 05:06:25 +00:00
Chris Lattner 35236d8477 Instcombine: X * -1 -> -X 
llvm-svn: 6904
 2003-06-25 17:09:20 +00:00
Chris Lattner 55d4bda861 Implement new transforms: 
Replace (cast (sub A, B) to bool) -> (setne A, B)
  Replace (cast (add A, B) to bool) -> (setne A, -B)

llvm-svn: 6873
 2003-06-23 21:59:52 +00:00
Chris Lattner d0d51605b2 Instcombine cast (getelementptr Ptr, 0, 0, 0) to ... into: cast Ptr to ... 
This fixes type safety problems in a variety of benchmarks that were confusing
DSA.

llvm-svn: 6837
 2003-06-21 23:12:02 +00:00
Chris Lattner 970c33abb1 Implement the functionality of InstCombine/call.ll 
llvm-svn: 6783
 2003-06-19 17:00:31 +00:00
Chris Lattner 45789aca97 Fix bug: InstCombine/2003-06-05-BranchInvertInfLoop.ll 
llvm-svn: 6630
 2003-06-05 20:12:51 +00:00
Chris Lattner e967b348bf Clean up previous code. 
Add new combination to turn seteq X, 0 -> not(cast X to bool)

llvm-svn: 6604
 2003-06-04 05:10:11 +00:00
Chris Lattner 9eef8a78b4 Implement combination of boolean not with branch 
llvm-svn: 6599
 2003-06-04 04:46:00 +00:00
Chris Lattner 791ac1a4c8 Implement xform: (X != 0) -> (bool)X 
llvm-svn: 6506
 2003-06-01 03:35:25 +00:00
Chris Lattner 3442844742 Fix bug: Instcombine/2003-05-27-ConstExprCrash.ll 
llvm-svn: 6352
 2003-05-27 16:40:51 +00:00
Chris Lattner 196897c424 Fix bug: InstCombine/2003-05-26-CastMiscompile.ll 
llvm-svn: 6338
 2003-05-26 23:41:32 +00:00
Chris Lattner 471bd76281 Minor cleanups. 
This hunk:
-    } else if (Src->getNumOperands() == 2 && Src->use_size() == 1) {
+    } else if (Src->getNumOperands() == 2) {

Allows GEP folding to be more aggressive, which reduces the number of instructions
and can dramatically speed up BasicAA in some cases.

llvm-svn: 6286
 2003-05-22 19:07:21 +00:00
Misha Brukman e5838c4d72 s/convertable/convertible/g 
llvm-svn: 6248
 2003-05-20 18:45:36 +00:00
Chris Lattner dd65d863a9 Fix another case where constexprs could cause a crash 
llvm-svn: 5972
 2003-04-30 22:34:06 +00:00
Chris Lattner 9244df60d3 Fix constant folding of constexprs 
llvm-svn: 5971
 2003-04-30 22:19:10 +00:00
Chris Lattner 46b3d30bf6 Change the interface to constant expressions to allow automatic folding 
llvm-svn: 5793
 2003-04-16 22:40:51 +00:00
Chris Lattner 7fb29e19f0 Add the following instcombine xforms: 
- Implement simple reassociation: (A|c1)|(B|c2) == (A|B)|(c1|c2)
  - (A & C1)+(B & C2) -> (A & C1)|(B & C2) iff C1&C2 == 0
  - (A & C1)^(B & C2) -> (A & C1)|(B & C2) iff C1&C2 == 0

llvm-svn: 5743
 2003-03-11 00:12:48 +00:00
Chris Lattner 934a64cfa4 Implement: -A*-B == A*B 
llvm-svn: 5740
 2003-03-10 23:23:04 +00:00
Chris Lattner 3e327a4334 Add new transformation: // (~A | ~B) == (~(A & B)) 
llvm-svn: 5738
 2003-03-10 23:13:59 +00:00
Chris Lattner bb74e2284a Generalize not and neg comparison testers to allow constant to be considered not'able and neg'able. This 
allows optimization of this:
int %test4(int %A, int %B) {
        %a = xor int %A, -1
        %c = and int %a, 5    ; 5 = ~c2
        %d = xor int %c, -1
        ret int %d
}

into this:
int %test4(int %A, int %B) {            ; No predecessors!
        %c.demorgan = or int %A, -6             ; <int> [#uses=1]
        ret int %c.demorgan
}

llvm-svn: 5736
 2003-03-10 23:06:50 +00:00
Chris Lattner dcf240a649 Generalize (A+c1)+c2 optimization to work with all associative operators 
llvm-svn: 5733
 2003-03-10 21:43:22 +00:00
Chris Lattner 3695257724 Minor change, no functionality diff 
llvm-svn: 5731
 2003-03-10 19:20:30 +00:00
Chris Lattner e8d6c604bb Fix bug: (x << 100) wasn't folded to 0, but (x >> 100) was (when x is unsigned) 
Implement new shift optimizations for shifting the result of a shift.

llvm-svn: 5729
 2003-03-10 19:16:08 +00:00
Chris Lattner 1bbb7b6f19 Implement: (A|B)^B == A & (~B) 
llvm-svn: 5728
 2003-03-10 18:24:17 +00:00