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
31,467 Commits 4 Branches 5 Tags 704 MiB
5bb6590218
Commit Graph

3078 Commits

Author SHA1 Message Date
Zhou Sheng
cf7d99a731 1. Make more use of getLowBitsSet/getHighBitsSet. 
2. Make the APInt value do the zext/trunc stuff instead of using
   ConstantExpr::getZExt().

llvm-svn: 35422
 2007-03-28 09:19:01 +00:00
Zhou Sheng
2dc7cf0114 Use UnknownBIts[BitWidth-1] instead of UnknownBIts & SignBits. 
llvm-svn: 35418
 2007-03-28 05:15:57 +00:00
Zhou Sheng
e43a68551e Remove unused APInt variable. 
llvm-svn: 35414
 2007-03-28 03:02:21 +00:00
Zhou Sheng
7245616070 Clean up codes in ComputeMaskedBits(): 
1. Line out nested use of zext/trunc.
2. Make more use of getHighBitsSet/getLowBitsSet.
3. Use APInt[] != 0 instead of "(APInt & SignBit) != 0".

llvm-svn: 35408
 2007-03-28 02:19:03 +00:00
Reid Spencer
3b614f9dad For PR1280: 
When converting an add/xor/and triplet into a trunc/sext, only do so if the
intermediate integer type is a bitwidth that the targets can handle.

llvm-svn: 35400
 2007-03-28 01:36:16 +00:00
Evan Cheng
a23cc41b11 Unbreaks non-debug builds. 
llvm-svn: 35383
 2007-03-27 16:44:48 +00:00
Reid Spencer
e4b331a4f2 Implement some minor review feedback. 
llvm-svn: 35373
 2007-03-26 23:58:26 +00:00
Reid Spencer
0cdfe48fc8 For PR1271: 
Fix another incorrectly converted shift mask.

llvm-svn: 35371
 2007-03-26 23:45:51 +00:00
Devang Patel
c2708c8ccb Reduce malloc/free traffic. 
llvm-svn: 35370
 2007-03-26 23:19:29 +00:00
Chris Lattner
16700ef424 eliminate use of std::set 
llvm-svn: 35361
 2007-03-26 20:40:50 +00:00
Reid Spencer
73d778edb7 Get better debug output by having modified instructions print both the 
original and new instruction. A slight performance hit with ostringstream
but it is only for debug.
Also, clean up an uninitialized variable warning noticed in a release build.

llvm-svn: 35358
 2007-03-26 17:44:01 +00:00
Reid Spencer
3fea170ecd Get the number of bits to set in a mask correct for a shl/lshr transform. 
llvm-svn: 35357
 2007-03-26 17:18:58 +00:00
Reid Spencer
a6a4dbd24e For PR1271: 
Fix SingleSource/Regression/C/2003-05-21-UnionBitFields.c by changing a
getHighBitsSet call to getLowBitsSet call that was incorrectly converted
from the original lshr constant expression.

llvm-svn: 35348
 2007-03-26 05:25:00 +00:00
Dale Johannesen
43fc14d6e4 Look through bitcast when finding IVs. (Chris' patch really.) 
llvm-svn: 35347
 2007-03-26 03:01:27 +00:00
Reid Spencer
4d3d7d0f2a For PR1271: 
Remove a use of getLowBitsSet that caused the mask used for replacement of
shl/lshr pairs with an AND instruction to be computed incorrectly. Its not
clear exactly why this is the case. This solves the disappearing shifts
problem, but it doesn't fix Regression/C/2003-05-21-UnionBitFields. It
seems there is more going on.

llvm-svn: 35342
 2007-03-25 21:11:44 +00:00
Chris Lattner
26cfd91db8 implement Transforms/InstCombine/cast2.ll:test3 and PR1263 
llvm-svn: 35341
 2007-03-25 20:43:09 +00:00
Reid Spencer
1677543a3a Some cleanup from review: 
* Don't assume shift amounts are <= 64 bits
* Avoid creating an extra APInt in SubOne and AddOne by using -- and ++
* Add another use of getLowBitsSet
* Convert a series of if statements to a switch

llvm-svn: 35339
 2007-03-25 19:55:33 +00:00
Reid Spencer
8449e5fa0e Refactor several ConstantExpr::getXXX calls with ConstantInt arguments 
using the facilities of APInt. While this duplicates a tiny fraction of
the constant folding code, it also makes the code easier to read and
avoids large ConstantExpr overhead for simple, known computations.

llvm-svn: 35335
 2007-03-25 05:33:51 +00:00
Zhou Sheng
3312a86598 1. Avoid unnecessary APInt construction if possible. 
2. Use isStrictlyPositive() instead of isPositive() in two places where
   they need APInt value > 0 not only >=0.

llvm-svn: 35333
 2007-03-25 05:01:29 +00:00
Reid Spencer
e601991a5e Make more uses of getHighBitsSet and get rid of some pointless & of an 
APInt with its type mask.

llvm-svn: 35325
 2007-03-25 04:26:16 +00:00
Reid Spencer
676eeb9c94 More APIntification: 
* Convert the last use of a uint64_t that should have been an APInt.
* Change ComputeMaskedBits to have a const reference argument for the Mask
  so that recursions don't cause unneeded temporaries. This causes temps
  to be needed in other places (where the mask has to change) but this
  change optimizes for the recursion which is more frequent.
* Remove two instances of &ing a Mask with getAllOnesValue. Its not
  needed any more because APInt is accurate in its bit computations.
* Start using the getLowBitsSet and getHighBits set methods on APInt
  instead of shifting. This makes it more clear in the code what is
  going on.

llvm-svn: 35321
 2007-03-25 02:03:12 +00:00
Chris Lattner
3f71a6b498 fix a regression on vector or instructions. 
llvm-svn: 35314
 2007-03-24 23:56:43 +00:00
Zhou Sheng
ce8c7becec Make some codes more efficient. 
llvm-svn: 35297
 2007-03-24 15:34:37 +00:00
Reid Spencer
b03fc33244 For PR1205: 
Convert some calls to ConstantInt::getZExtValue() into getValue() and
use APInt facilities in the subsequent computations.

llvm-svn: 35294
 2007-03-24 00:42:08 +00:00
Reid Spencer
01d252add1 For PR1205: 
* APIntify visitAdd and visitSelectInst
* Remove unused uint64_t versions of utility functions that have been
  replaced with APInt versions.
This completes most of the changes for APIntification of InstCombine. This
passes llvm-test and llvm/test/Transforms/InstCombine/APInt.

Patch by Zhou Sheng.

llvm-svn: 35287
 2007-03-23 21:24:59 +00:00
Reid Spencer
da8ec61ec4 For PR1205: 
APIntify visitDiv, visitMul and visitRem.

Patch by Zhou Sheng.

llvm-svn: 35283
 2007-03-23 20:05:17 +00:00
Chris Lattner
04baffb0c5 switch AddReachableCodeToWorklist from being recursive to being iterative. 
llvm-svn: 35282
 2007-03-23 19:17:18 +00:00
Reid Spencer
1fd12cf9f6 For PR1205: 
APIntify several utility functions supporting logical operators and shift
operators.

Patch by Zhou Sheng.

llvm-svn: 35281
 2007-03-23 18:46:34 +00:00
Zhou Sheng
e706d8f56d Make the "KnownZero ^ TypeMask" computation just once. 
llvm-svn: 35276
 2007-03-23 03:13:21 +00:00
Zhou Sheng
6b7b4945f1 Simplify the code. 
llvm-svn: 35275
 2007-03-23 02:39:25 +00:00
Reid Spencer
9881580cec For PR1205: 
APInt support for logical operators in visitAnd, visitOr, and visitXor.

Patch by Zhou Sheng.

llvm-svn: 35273
 2007-03-22 22:19:58 +00:00
Reid Spencer
74288268d3 For PR1205: 
* APIntify commonIntCastTransforms
* APIntify visitTrunc
* APIntify visitZExt

Patch by Zhou Sheng.

llvm-svn: 35271
 2007-03-22 20:56:53 +00:00
Reid Spencer
b6c09a009e For PR1205: 
* Re-enable the APInt version of MaskedValueIsZero.
* APIntify the Comput{Un}SignedMinMaxValuesFromKnownBits functions
* APIntify visitICmpInst.

llvm-svn: 35270
 2007-03-22 20:36:03 +00:00
Dan Gohman
d0a0ea9916 Change uses of Function::front to Function::getEntryBlock for readability. 
llvm-svn: 35265
 2007-03-22 16:38:57 +00:00
Nick Lewycky
428523f51a Fix broken optimization disabled by a logic bug. 
Analyze GEPs. If the indices are all zero, transfer whether the pointer is
known to be not null through the GEP.

Add a few more cases for xor and shift instructions.

llvm-svn: 35257
 2007-03-22 02:02:51 +00:00
Reid Spencer
bdfbda05fb For PR1248: 
* Fix some indentation and comments in InsertRangeTest
* Add an "IsSigned" parameter to AddWithOverflow and make it handle signed
  additions. Also, APIntify this function so it works with any bitwidth.
* For the icmp pred ([us]div %X, C1), C2 transforms, exit early if the
  div instruction's RHS is zero.
* Finally, for icmp pred (sdiv %X, C1), -C2, fix an off-by-one error. The
  HiBound needs to be incremented in order to get the range test correct.

llvm-svn: 35247
 2007-03-21 23:19:50 +00:00
Dale Johannesen
3e422e3b49 do not share old induction variables when this would result in invalid 
instructions (that would have to be split later)

llvm-svn: 35227
 2007-03-20 21:54:54 +00:00
Jeff Cohen
8dea6ada6f Fix some VC++ warnings. 
llvm-svn: 35224
 2007-03-20 20:43:18 +00:00
Devang Patel
18146cf2a2 LoopSimplify::FindPHIToPartitionLoops() 
Use ETForest instead of DominatorSet.

llvm-svn: 35221
 2007-03-20 20:18:12 +00:00
Zhou Sheng
0ae1c9e1ad Simplify isHighOnes(). 
llvm-svn: 35211
 2007-03-20 12:49:06 +00:00
Dale Johannesen
516d98c710 use types of loads and stores, not address, in CheckForIVReuse 
llvm-svn: 35197
 2007-03-20 00:47:50 +00:00
Reid Spencer
2f1ee85f90 Make isOneBitSet faster by using APInt::isPowerOf2. Thanks Chris. 
llvm-svn: 35194
 2007-03-20 00:16:52 +00:00
Reid Spencer
a792b71ab3 APIntify the isHighOnes utility function. 
llvm-svn: 35190
 2007-03-19 21:29:50 +00:00
Reid Spencer
4009f1eacb Implement isMaxValueMinusOne in terms of APInt instead of uint64_t. 
Patch by Sheng Zhou.

llvm-svn: 35188
 2007-03-19 21:10:28 +00:00
Reid Spencer
57a15f4445 Implement isMinValuePlusOne using facilities of APInt instead of uint64_t 
Patch by Zhou Sheng.

llvm-svn: 35187
 2007-03-19 21:08:07 +00:00
Reid Spencer
1985e3645b Implement isOneBitSet in terms of APInt::countPopulation. 
llvm-svn: 35186
 2007-03-19 21:04:43 +00:00
Reid Spencer
367a2917c0 1. Use APInt::getSignBit to reduce clutter (patch by Sheng Zhou) 
2. Replace uses of the "isPositive" utility function with APInt::isPositive

llvm-svn: 35185
 2007-03-19 20:58:18 +00:00
Reid Spencer
49ea42b719 Remove a redundant clause in an if statement. 
Patch by Sheng Zhou.

llvm-svn: 35184
 2007-03-19 20:47:50 +00:00
Chris Lattner
5f1d3ac7e4 fix ScalarRepl/2007-03-19-CanonicalizeMemcpy.ll 
llvm-svn: 35169
 2007-03-19 18:25:57 +00:00
Chris Lattner
5e2e3ddb7e implement the next chunk of SROA with memset/memcpy's of aggregates. This 
implements Transforms/ScalarRepl/memset-aggregate-byte-leader.ll

llvm-svn: 35150
 2007-03-19 00:16:43 +00:00
Nick Lewycky
2a51ea0c0e Clean up this code and fix subtract miscompile. 
llvm-svn: 35146
 2007-03-18 22:58:46 +00:00
Chris Lattner
adf7003452 Implement InstCombine/and-xor-merge.ll:test[12]. 
Rearrange some code to simplify it now that shifts are binops

llvm-svn: 35145
 2007-03-18 22:51:34 +00:00
Nick Lewycky
41f13d431a Propagate ValueRanges across equality. 
Add some more micro-optimizations: x * 0 = 0, a - x = a --> x = 0.

llvm-svn: 35138
 2007-03-18 01:09:32 +00:00
Anton Korobeynikov
b34e09291b Silence warning 
llvm-svn: 35137
 2007-03-17 14:48:06 +00:00
Nick Lewycky
de44438e24 Add more comments and update to new asm syntax. 
Add new micro-optimizations.

Add icmp predicate snuggling. Given %x ULT 4, "icmp ugt %x, 2" becomes
"icmp eq %x, 3". This doesn't apply in any non-trivial cases yet due to missing
support for NE values in ValueRanges.

llvm-svn: 35119
 2007-03-16 02:37:39 +00:00
Zhou Sheng
5c6399dab7 ShiftAmt might equal to zero. Handle this situation. 
llvm-svn: 35094
 2007-03-14 09:07:33 +00:00
Zhou Sheng
4415c2647e Enable KnownZero/One.clear(). 
llvm-svn: 35093
 2007-03-14 03:21:24 +00:00
Evan Cheng
bd964bd8eb Correct type info for isLegalAddressImmediate() check. 
llvm-svn: 35086
 2007-03-13 20:34:37 +00:00
Chris Lattner
efc2339bd7 ifdef out some dead code. 
Fix PR1244 and Transforms/InstCombine/2007-03-13-CompareMerge.ll

llvm-svn: 35082
 2007-03-13 14:27:42 +00:00
Zhou Sheng
7cf2811ab3 For expression like 
"APInt::getAllOnesValue(ShiftAmt).zextOrCopy(BitWidth)",
to handle ShiftAmt == BitWidth situation, use zextOrCopy() instead of
zext().

llvm-svn: 35080
 2007-03-13 06:40:59 +00:00
Zhou Sheng
14cef9ec74 In APInt version ComputeMaskedBits(): 
1. Ensure VTy, KnownOne and KnownZero have same bitwidth.
  2. Make code more efficient.

llvm-svn: 35078
 2007-03-13 02:23:10 +00:00
Evan Cheng
1fcdd7e1e5 Use new TargetLowering addressing modes hooks. 
llvm-svn: 35072
 2007-03-12 23:27:37 +00:00
Jeff Cohen
91930bc4d4 Unbreak VC++ build. Do not use identifiers starting with _ as they are reserved and 
can collide with system defined names.  Windows defines _BB, for example.

llvm-svn: 35066
 2007-03-12 17:56:27 +00:00
Reid Spencer
d59425085f Add an APInt version of SimplifyDemandedBits. 
Patch by Zhou Sheng.

llvm-svn: 35064
 2007-03-12 17:25:59 +00:00
Reid Spencer
b18f916bbe Add an APInt version of ShrinkDemandedConstant. 
Patch by Zhou Sheng.

llvm-svn: 35063
 2007-03-12 17:15:10 +00:00
Zhou Sheng
c8583ff888 Avoid to assert on "(KnownZero & KnownOne) == 0". 
llvm-svn: 35062
 2007-03-12 16:54:56 +00:00
Zhou Sheng
c9c53385b8 In function ComputeMaskedBits(): 
1. Replace getSignedMinValue() with getSignBit() for better code readability.
  2. Replace APIntOps::shl() with operator<<= for convenience.
  3. Make APInt construction more effective.

llvm-svn: 35060
 2007-03-12 05:44:52 +00:00
Nick Lewycky
8a08bcfbe7 Add value ranges. Currently inefficient in both execution time and 
optimization power.

llvm-svn: 35058
 2007-03-10 18:12:48 +00:00
Anton Korobeynikov
0c2d312725 Use range tests in LowerSwitch, where possible 
llvm-svn: 35057
 2007-03-10 16:46:28 +00:00
Devang Patel
20b8163ad3 Remove dead comments. 
llvm-svn: 35053
 2007-03-09 23:41:03 +00:00
Devang Patel
8a26f4caa0 Avoid recursion. Use iterative algorithm for RenamePass(). 
llvm-svn: 35052
 2007-03-09 23:39:14 +00:00
Devang Patel
ca60446cb4 Increment iterator now because IVUseShouldUsePostIncValue may remove 
User from the list of I users.

llvm-svn: 35051
 2007-03-09 21:19:53 +00:00
Zhou Sheng
acc59870f7 Fix a bug in function ComputeMaskedBits(). 
llvm-svn: 35027
 2007-03-08 15:15:18 +00:00
Chris Lattner
66843dbef9 This appears correct, enable it so we can see perf changes on testers 
llvm-svn: 35024
 2007-03-08 07:03:55 +00:00
Chris Lattner
049f21257d Second half of PR1226. This is currently still disabled, until I have a chance to 
do the correctness/performance analysis testing.

llvm-svn: 35023
 2007-03-08 06:36:54 +00:00
Zhou Sheng
37cb2e2d53 Fix a bug in APIntified ComputeMaskedBits(). 
llvm-svn: 35022
 2007-03-08 05:42:00 +00:00
Reid Spencer
c3f0724204 For PR1205: 
Provide an APIntified version of MaskedValueIsZero. This will (temporarily)
cause a "defined but not used" message from the compiler. It will be used
in the next patch in this series.

Patch by Sheng Zhou.

llvm-svn: 35019
 2007-03-08 01:52:58 +00:00
Reid Spencer
6a924d1a1d For PR1205: 
Add a new ComputeMaskedBits function that is APIntified. We'll slowly
convert things over to use this version. When its all done, we'll remove
the existing version.

llvm-svn: 35018
 2007-03-08 01:46:38 +00:00
Devang Patel
6a56e3c1a0 Now IndVarSimplify is a LoopPass. 
llvm-svn: 35003
 2007-03-07 06:39:01 +00:00
Devang Patel
16107bb71b Now LICM is a LoopPass. 
llvm-svn: 35001
 2007-03-07 04:41:30 +00:00
Devang Patel
3a24891f80 Now LoopUnroll is a LoopPass. 
llvm-svn: 34996
 2007-03-07 01:38:05 +00:00
Devang Patel
c35610b9f9 Now LoopUnswitch is a LoopPass. 
llvm-svn: 34992
 2007-03-07 00:26:10 +00:00
Devang Patel
0b82378a28 Now LoopStrengthReduce is a LoopPass. 
llvm-svn: 34984
 2007-03-06 21:14:09 +00:00
Reid Spencer
db1c09aef1 Remove an unnecessary if statement and adjust indentation. 
llvm-svn: 34939
 2007-03-05 23:36:13 +00:00
Chris Lattner
b0de2b2a9c This is the first major step of implementing PR1226. We now successfully 
scalarrepl things down to elements, but mem2reg can't promote elements that
are memset/memcpy'd.  Until then, the code is disabled "0 &&".

llvm-svn: 34924
 2007-03-05 07:52:57 +00:00
Chris Lattner
4dfdbab24b fix a subtle bug that caused an MSVC warning. Thanks to Jeffc for pointing this out. 
llvm-svn: 34920
 2007-03-05 00:11:19 +00:00
Chris Lattner
4fadd9defa Add some simplifications for demanded bits, this allows instcombine to turn: 
define i64 @test(i64 %A, i32 %B) {
        %tmp12 = zext i32 %B to i64             ; <i64> [#uses=1]
        %tmp3 = shl i64 %tmp12, 32              ; <i64> [#uses=1]
        %tmp5 = add i64 %tmp3, %A               ; <i64> [#uses=1]
        %tmp6 = and i64 %tmp5, 123              ; <i64> [#uses=1]
        ret i64 %tmp6
}

into:

define i64 @test(i64 %A, i32 %B) {
        %tmp6 = and i64 %A, 123         ; <i64> [#uses=1]
        ret i64 %tmp6
}

This implements Transforms/InstCombine/add2.ll:test1

llvm-svn: 34919
 2007-03-05 00:02:29 +00:00
Jeff Cohen
98c99a3a02 Unbreak VC++ build. 
llvm-svn: 34917
 2007-03-05 00:00:42 +00:00
Chris Lattner
0036009167 simplify some code 
llvm-svn: 34914
 2007-03-04 23:16:36 +00:00
Chris Lattner
758a83d1b0 minor cleanups 
llvm-svn: 34904
 2007-03-04 04:50:21 +00:00
Chris Lattner
de2b4322ff Speed up -instcombine by 20% by avoiding a particularly expensive passmgr call. 
llvm-svn: 34902
 2007-03-04 04:27:24 +00:00
Chris Lattner
f2304552f7 switch MarkAliveBlocks over to using SmallPtrSet instead of std::set, speeding 
up simplifycfg by 20%

llvm-svn: 34901
 2007-03-04 04:20:48 +00:00
Chris Lattner
4d48389d2d make better use of LCSSA information in RewriteLoopExitValues. Before, we 
would scan the entire loop body, then scan all users of instructions in the
loop, looking for users outside the loop.  Now, since we know that the
loop is in LCSSA form, we know that any users outside the loop will be LCSSA
phi nodes.  Just scan them.

This speeds up indvars significantly.

llvm-svn: 34898
 2007-03-04 03:43:23 +00:00
Chris Lattner
519ed087bb Implement PR1179/PR1232 and test/Transforms/IndVarsSimplify/loop_evaluate_[234].ll 
This makes -indvars require and use LCSSA, updating it as appropriate.

llvm-svn: 34896
 2007-03-04 01:00:28 +00:00
Chris Lattner
f45fa39069 Make RewriteLoopExitValues far less nested by using continue in the loop 
llvm-svn: 34891
 2007-03-03 22:48:48 +00:00
Chris Lattner
f22da20af4 my recent change caused a failure in a bswap testcase, because it changed 
the order that instcombine processed instructions in the testcase.  The end
result is that instcombine finished with:

define i16 @test1(i16 %a) {
        %tmp = zext i16 %a to i32               ; <i32> [#uses=2]
        %tmp21 = lshr i32 %tmp, 8               ; <i32> [#uses=1]
        %tmp5 = shl i32 %tmp, 8         ; <i32> [#uses=1]
        %tmp.upgrd.32 = or i32 %tmp21, %tmp5            ; <i32> [#uses=1]
        %tmp.upgrd.3 = trunc i32 %tmp.upgrd.32 to i16           ; <i16> [#uses=1]
        ret i16 %tmp.upgrd.3
}

which can't get matched as a bswap.

This patch makes instcombine more sophisticated about removing truncating
casts, allowing it to turn this into:

define i16 @test2(i16 %a) {
        %tmp211 = lshr i16 %a, 8
        %tmp52 = shl i16 %a, 8
        %tmp.upgrd.323 = or i16 %tmp211, %tmp52
        ret i16 %tmp.upgrd.323
}

which then matches as bswap.  This fixes bswap.ll and implements
InstCombine/cast2.ll:test[12].  This also implements cast elimination of
add/sub.

llvm-svn: 34870
 2007-03-03 05:27:34 +00:00
Nick Lewycky
a0a23a645d Translate bit operations to English. 
llvm-svn: 34868
 2007-03-03 03:14:40 +00:00
Chris Lattner
892090ea95 add a top-level iteration loop to instcombine. This means that it will never 
finish without combining something it is capable of.

llvm-svn: 34865
 2007-03-03 02:04:50 +00:00
Reid Spencer
8c49eb7da5 APIntify this pass. 
llvm-svn: 34863
 2007-03-03 00:48:31 +00:00
Reid Spencer
6f7b9afc1c Finally get this patch right :) 
Replace expensive getZExtValue() == 0 calls with isZero() calls.

llvm-svn: 34861
 2007-03-02 23:51:25 +00:00
Reid Spencer
438d17b5ad Dang, I've done that twice now! Undo previous commit. 
llvm-svn: 34860
 2007-03-02 23:37:53 +00:00
Reid Spencer
70fbfc75e8 Use more efficient test for one value in a ConstantInt. 
llvm-svn: 34859
 2007-03-02 23:35:28 +00:00
Reid Spencer
76f02c5848 Guard against huge loop trip counts in an APInt safe way. 
llvm-svn: 34858
 2007-03-02 23:31:34 +00:00
Reid Spencer
884f32fd12 Make sure debug code is not evaluated in non-debug case. 
llvm-svn: 34856
 2007-03-02 23:15:21 +00:00
Reid Spencer
69858df100 1. Sort switch cases using APInt safe comparison. 
2. Make sure debug output of APInt values is safe for all bit widths.

llvm-svn: 34855
 2007-03-02 23:05:28 +00:00
Reid Spencer
bf4956bcc4 Use APInt safe isOne() method on ConstantInt instead of getZExtValue()==1 
llvm-svn: 34854
 2007-03-02 23:03:17 +00:00
Reid Spencer
0f63188d6a Make sorting of ConstantInt be APInt clean through use of ult function. 
llvm-svn: 34853
 2007-03-02 23:01:14 +00:00
Chris Lattner
e11cd0460a Fix a significant algorithm problem with the instcombine worklist. removing 
a value from the worklist required scanning the entire worklist to remove all
entries.  We now use a combination map+vector to prevent duplicates from
happening and prevent the scan.  This speeds up instcombine on a large file
from the llvm-gcc bootstrap from 189.7s to 4.84s in a debug build and from
5.04s to 1.37s in a release build.

llvm-svn: 34848
 2007-03-02 21:28:56 +00:00
Chris Lattner
fb4d1a6437 minor cleanup 
llvm-svn: 34846
 2007-03-02 19:59:19 +00:00
Chris Lattner
4fbb8286bf switch the inliner from being recursive to being iterative. 
llvm-svn: 34832
 2007-03-02 03:11:20 +00:00
Reid Spencer
2814c17704 Reverse a premature commital. 
llvm-svn: 34822
 2007-03-02 00:31:39 +00:00
Reid Spencer
1f970769e8 Prefer non-virtual calls to ConstantInt::isZero over virtual calls to 
Constant::isNullValue() in situations where it is possible.

llvm-svn: 34821
 2007-03-02 00:28:52 +00:00
Reid Spencer
e5456dea52 Although probably not necessary, guard against a potential assertion by 
using isNullValue() instead of getZExtValue() == 0.

llvm-svn: 34815
 2007-03-01 21:54:37 +00:00
Reid Spencer
3a7689fe22 Use isUnitValue() instead of getZExtValue() == 1 which will prevent an 
assert if the ConstantInt's value is large.

llvm-svn: 34814
 2007-03-01 21:51:23 +00:00
Reid Spencer
327ae8b712 Use APInt conversion to string so the result is correct regardless of the 
bit width of the ConstantInt being converted.

llvm-svn: 34810
 2007-03-01 21:00:32 +00:00
Reid Spencer
30eac3e0b1 The 64-bit constructor for ConstantInt changes from int64_t to uint64_t. 
This caused a warning for construction with -1. Avoid the warning by using
-1ULL instead.

llvm-svn: 34796
 2007-03-01 19:33:52 +00:00
Reid Spencer
3f3487918c Remove the "isSigned" parameters from ConstantRange. It turns out they 
are not needed as the results are the same with or without it.

Patch by Nicholas Lewycky.

llvm-svn: 34782
 2007-03-01 07:54:15 +00:00
Reid Spencer
19e5279a38 For PR1205: 
Adjust to changes in ConstantRange interface.

llvm-svn: 34762
 2007-02-28 22:03:51 +00:00
Reid Spencer
965067a054 For PR1205: 
Remove ConstantInt from ConstantRange interface and adjust its users to
compensate.

llvm-svn: 34758
 2007-02-28 19:57:34 +00:00
Reid Spencer
e2b4631435 For PR1205: 
First round of ConstantRange changes. This makes all CR constructors use
only APInt and not use ConstantInt. Clients are adjusted accordingly.

llvm-svn: 34756
 2007-02-28 18:57:32 +00:00
Devang Patel
c13055b251 Use efficient container SmallPtrSet 
llvm-svn: 34640
 2007-02-26 20:22:50 +00:00
Devang Patel
b0b949f93e Do not unswitch loop on same value again and again. 
llvm-svn: 34638
 2007-02-26 19:31:58 +00:00
Chris Lattner
14217fb105 Fix InstCombine/2007-02-23-PhiFoldInfLoop.ll and PR1217 
llvm-svn: 34546
 2007-02-24 01:03:45 +00:00
Chris Lattner
6334a918d8 fix an obscure and tricky bug the inliner can hit sometimes. 
llvm-svn: 34531
 2007-02-23 19:54:30 +00:00
Jim Laskey
8ddfb7141b Revert changes for a simplier solution. 
llvm-svn: 34495
 2007-02-22 16:21:18 +00:00
Jim Laskey
2bbd4312c0 Itanium ABI exception handing support. 
llvm-svn: 34480
 2007-02-21 22:49:50 +00:00
Dan Gohman
e24135a647 Fix typos in comments. 
llvm-svn: 34456
 2007-02-20 20:52:03 +00:00
Chris Lattner
bfbeedf462 remove reoptimizer-specific passes 
llvm-svn: 34439
 2007-02-20 05:31:49 +00:00
Chris Lattner
b83d08ddc2 eliminate use of deprecated apis 
llvm-svn: 34417
 2007-02-19 07:34:47 +00:00
Chris Lattner
69435023b2 fix comment 
llvm-svn: 34395
 2007-02-18 22:10:58 +00:00
Chris Lattner
d085064847 simplify pass, delete dead gvar protos as well. 
llvm-svn: 34394
 2007-02-18 22:10:34 +00:00
Chris Lattner
9572ded44a convert more vectors to smallvectors, 2.8% speedup 
llvm-svn: 34333
 2007-02-15 22:52:10 +00:00
Chris Lattner
fa8782ac3f change some vectors to smallvectors. This speeds up instcombine on 447.dealII 
by 5%.

llvm-svn: 34332
 2007-02-15 22:48:32 +00:00
Chris Lattner
8b185bf778 switch an std::set to a SmallPtr set, this speeds up instcombine by 9.5% 
on 447.dealII

llvm-svn: 34323
 2007-02-15 19:41:52 +00:00
Reid Spencer
e7ff3305d6 For PR1195: 
Change use of "packed" term to "vector" in comments, strings, variable
names, etc.

llvm-svn: 34300
 2007-02-15 03:39:18 +00:00
Reid Spencer
21061dd3df Change an assert that mentions Packed Type -> Vector Type. 
llvm-svn: 34298
 2007-02-15 03:11:20 +00:00
Reid Spencer
55e4e98a2a For PR1195: 
Rename PackedType -> VectorType, ConstantPacked -> ConstantVector, and
PackedTyID -> VectorTyID. No functional changes.

llvm-svn: 34293
 2007-02-15 02:26:10 +00:00
Chris Lattner
5cece73ec8 Generalize TargetData strings, to support more interesting forms of data. 
Patch by Scott Michel.

llvm-svn: 34266
 2007-02-14 05:52:17 +00:00
Chris Lattner
68420e1d7d eliminate a bunch of vector-related heap traffic 
llvm-svn: 34222
 2007-02-13 05:58:53 +00:00
Chris Lattner
ce2cc6e404 Eliminate use of ctors that take vectors. 
llvm-svn: 34219
 2007-02-13 02:10:56 +00:00
Chris Lattner
b73ffa20af stop using methods that take vectors. 
llvm-svn: 34205
 2007-02-12 22:56:41 +00:00
Chris Lattner
5a58a65c10 Switch ValueSymbolTable to use StringMap<Value*> instead of std::map<std::string, Value*> 
as its main datastructure.  There are many improvements yet to be made, but
this speeds up opt --std-compile-opts on 447.dealII by 7.3%.

llvm-svn: 34193
 2007-02-12 05:18:08 +00:00
Chris Lattner
bbd6f81f3d simplify code by using Value::takeName 
llvm-svn: 34177
 2007-02-11 01:37:51 +00:00
Chris Lattner
b131b3e07e Simplify code by using value::takename 
llvm-svn: 34176
 2007-02-11 01:23:03 +00:00
Chris Lattner
fc50a34437 simplify name juggling through the use of Value::takeName. 
llvm-svn: 34175
 2007-02-11 01:08:35 +00:00
Chris Lattner
9dafd9fe90 Privatize StructLayout::MemberOffsets, adding an accessor 
llvm-svn: 34156
 2007-02-10 19:55:17 +00:00
Chris Lattner
12663c4a66 Fix Transforms/DeadArgElim/2007-02-07-FuncRename.ll, fallout from PR411. 
This happened because deadargelim now causes VMCore to auto-rename every
function that it hacks arguments out of.  Because it hacks arguments out of
functions in a non-deterministic order, this caused the resultant numbering
to be nondet.  The fix is to just be careful to not rename functions!

llvm-svn: 34005
 2007-02-07 19:31:33 +00:00
Chris Lattner
22fc4be632 shrink vmcore by moving symbol table stripping support out of VMCore into 
the one IPO pass that uses it.

llvm-svn: 33990
 2007-02-07 06:22:45 +00:00
Chris Lattner
474d7b219d redesign the primary datastructure used by mem2reg to eliminate an 
std::map of std::vector's (ouch!).  This speeds up mem2reg by 10% on 176.gcc.

llvm-svn: 33974
 2007-02-07 01:15:04 +00:00
Chris Lattner
5fee493a8c With the last change, we no longer need both directions of mapping from 
BBNumbers.  Instead of using a bi-directional mapping, just use a single
densemap.  This speeds up mem2reg on 176.gcc by 8%, from  1.3489 to
1.2485s.

llvm-svn: 33940
 2007-02-05 23:37:20 +00:00