OSchip
/
llvm-project
mirror of https://github.com/THU-DSP-LAB/llvm-project.git
13
0
Fork 6
Code Issues Packages Projects Releases Wiki Activity
43,768 Commits 31 Branches 0 Tags 2.2 GiB
Commit Graph

4096 Commits

Author SHA1 Message Date
Bill Wendling 86ceb0db9c Porting r50563 from Tak to mainline. 
llvm-svn: 50564
 2008-05-02 00:43:20 +00:00
Dale Johannesen 78ffe6e939 Don't try to create PHIs of struct types. Fallout 
from x86-64 calling convention work.

llvm-svn: 50545
 2008-05-01 22:27:44 +00:00
Dan Gohman 4be6ae4e6c Fix an overaggressive SimplifyDemandedBits optimization on urem. This 
fixes the 254.gap regression on x86 and the 403.gcc regression on x86-64.

llvm-svn: 50537
 2008-05-01 19:13:24 +00:00
Chris Lattner bb41aab426 1) add '-debug' output 
2) Return NULL instead of false in several places for tidiness.
3) fix a bug optimizing  sprintf(p, "%c", x)

llvm-svn: 50521
 2008-05-01 06:39:12 +00:00
Chris Lattner b9b5d6ddaa Delete the IPO simplify-libcalls and completely reimplement it as 
a FunctionPass.  This makes it simpler, fixes dozens of bugs, adds
a couple of minor features, and shrinks is considerably: from
2214 to 1437 lines.

llvm-svn: 50520
 2008-05-01 06:25:24 +00:00
Owen Anderson 0ced13ccd9 This condition got inverted accidentally. 
llvm-svn: 50473
 2008-04-30 07:16:33 +00:00
Chris Lattner 2dc4426675 move lowering of llvm.memset -> store from simplify libcalls 
to instcombine.

llvm-svn: 50472
 2008-04-30 06:39:11 +00:00
Chris Lattner 438e35c4d1 use string length computation to generalize several xforms. 
llvm-svn: 50464
 2008-04-30 03:07:53 +00:00
Owen Anderson ad5367f8ed Revert r50441. The original code was correct. Add some more comments so that I don't make the same mistake in the future. 
llvm-svn: 50446
 2008-04-29 21:51:00 +00:00
Owen Anderson ff7d7b18e5 Fix a bug in memcpyopt where the memcpy-memcpy transform was never being applied because 
we were checking for it in the wrong order.  This caused a miscompilation because the
return slot optimization assumes that the call it is dealing with is NOT a memcpy.

llvm-svn: 50444
 2008-04-29 21:26:06 +00:00
Owen Anderson f07de734cf We should be returning true here since we've changed the function. 
llvm-svn: 50442
 2008-04-29 21:02:46 +00:00
Owen Anderson e674600266 A lot of cleanups and documentation improvements, as well as a few corner case fixes. Most 
of this was suggested by Chris.

llvm-svn: 50441
 2008-04-29 20:59:33 +00:00
Owen Anderson 2306a1e098 Rename DeadLoopElimination to LoopDeletion, part 2. 
llvm-svn: 50437
 2008-04-29 20:06:54 +00:00
Owen Anderson e9f05bd1f0 Rename DeadLoopElimination to LoopDeletion, part one. 
llvm-svn: 50436
 2008-04-29 19:58:07 +00:00
Chris Lattner d9e3b5c5bd don't eliminate load from volatile value on paths where the load is dead. 
This fixes the second half of PR2262

llvm-svn: 50430
 2008-04-29 17:28:22 +00:00
Chris Lattner 9233c124c9 fix a subtle volatile handling bug. 
llvm-svn: 50428
 2008-04-29 17:13:43 +00:00
Chris Lattner 92f4702254 Implement more aggressive support for analyzing string length. This 
generalizes the previous code to handle the case when the string is not
an immediate to the strlen call (for example, crazy stuff like 
strlen(c ? "foo" : "bart"+1) -> 3).  This implements 
gcc.c-torture/execute/builtins/strlen-2.c.  I will generalize other
cases in simplifylibcalls to use the same routine later.

llvm-svn: 50408
 2008-04-29 06:56:02 +00:00
Owen Anderson 304ef22f6e Clarify what we mean by a dead loop. 
llvm-svn: 50406
 2008-04-29 06:34:55 +00:00
Chris Lattner e331a65c79 don't delete the last store to an alloca if the store is volatile. 
llvm-svn: 50390
 2008-04-29 04:58:38 +00:00
Owen Anderson 586216e5bb Add some more comments. 
llvm-svn: 50384
 2008-04-29 00:45:15 +00:00
Owen Anderson 41377175d3 Remove debugging code. 
llvm-svn: 50383
 2008-04-29 00:39:24 +00:00
Owen Anderson 94ad702412 Add dead loop elimination, which removes dead loops for which we can compute 
the trip count.

llvm-svn: 50382
 2008-04-29 00:38:34 +00:00
Dan Gohman 8cb19d967f Fix DSE to not eliminate volatile loads with no uses. 
llvm-svn: 50370
 2008-04-28 19:51:27 +00:00
Dan Gohman 72ec3f4562 Teach InstCombine's ComputeMaskedBits what SelectionDAG's 
ComputeMaskedBits knows about cttz, ctlz, and ctpop. Teach
SelectionDAG's ComputeMaskedBits what InstCombine's knows
about SRem. And teach them both some things about high bits
in Mul, UDiv, URem, and Sub. This allows instcombine and
dagcombine to eliminate sign-extension operations in
several new cases.

llvm-svn: 50358
 2008-04-28 17:02:21 +00:00
Chris Lattner 8be72700b8 Fix PR2256, yet another miscompilation in simplifycfg of i 
multiple return values.

Bill, please pull this into Tak.

llvm-svn: 50332
 2008-04-28 00:19:07 +00:00
Chris Lattner 2237973438 Implement a signficant optimization for inline asm: 
When choosing between constraints with multiple options,
like "ir", test to see if we can use the 'i' constraint and
go with that if possible.  This produces more optimal ASM in
all cases (sparing a register and an instruction to load it),
and fixes inline asm like this:

void test () {
  asm volatile (" %c0 %1 " : : "imr" (42), "imr"(14));
}

Previously we would dump "42" into a memory location (which
is ok for the 'm' constraint) which would cause a problem
because the 'c' modifier is not valid on memory operands.

Isn't it great how inline asm turns 'missed optimization'
into 'compile failed'??

Incidentally, this was the todo in 
PowerPC/2007-04-24-InlineAsm-I-Modifier.ll

Please do NOT pull this into Tak.

llvm-svn: 50315
 2008-04-27 00:37:18 +00:00
Chris Lattner 4793515a9c Move a bunch of inline asm code out of line. 
llvm-svn: 50313
 2008-04-27 00:09:47 +00:00
Chris Lattner 67ca6f6347 When SRoA'ing a global variable, make sure the new globals get the 
appropriate alignment.  This fixes a miscompilation of 252.eon on
x86-64 (rdar://5891920).

Bill, please pull this into Tak.

llvm-svn: 50308
 2008-04-26 07:40:11 +00:00
Dale Johannesen 0d1d3df564 change comments per review 
llvm-svn: 50300
 2008-04-25 21:16:07 +00:00
Dan Gohman ca95a5f49f Remove the code from CodeGenPrepare that moved getresult instructions 
to the block that defines their operands. This doesn't work in the
case that the operand is an invoke, because invoke is a terminator
and must be the last instruction in a block.

Replace it with support in SelectionDAGISel for copying struct values
into sequences of virtual registers.

llvm-svn: 50279
 2008-04-25 18:27:55 +00:00
Nate Begeman ca270ad96f Feedback from chris 
llvm-svn: 50271
 2008-04-25 17:45:52 +00:00
Nick Lewycky 4d43d3c72c Remove 'unwinds to' support from mainline. This patch undoes r47802 r47989 
r48047 r48084 r48085 r48086 r48088 r48096 r48099 r48109 and r48123.

llvm-svn: 50265
 2008-04-25 16:53:59 +00:00
Nate Begeman 6fed3b2038 Teach the PruningFunctionCloner how to look through loads with 
ConstantExpression GEPs pointing into constant globals.

llvm-svn: 50256
 2008-04-25 06:37:06 +00:00
Chris Lattner f7de528463 Don't infininitely thread branches when a threaded edge 
goes back to the block, e.g.:

  Threading edge through bool from 'bb37.us.thread3829' to 'bb37.us' with cost: 1, across block:

bb37.us:		; preds = %bb37.us.thread3829, %bb37.us, %bb33
	%D1361.1.us = phi i32 [ %tmp36, %bb33 ], [ %D1361.1.us, %bb37.us ], [ 0, %bb37.us.thread3829 ]		; <i32> [#uses=2]
	%tmp39.us = icmp eq i32 %D1361.1.us, 0		; <i1> [#uses=1]
	br i1 %tmp39.us, label %bb37.us, label %bb42.us

llvm-svn: 50251
 2008-04-25 04:12:29 +00:00
Evan Cheng 608eeef5ce Adjust inline cost computation to be less aggressive. 
llvm-svn: 50222
 2008-04-24 18:42:47 +00:00
Chris Lattner 97951ac580 code restructuring, not functionality change. 
llvm-svn: 50203
 2008-04-24 00:21:50 +00:00
Chris Lattner 12f1e007f7 Don't replace multiple result of calls with undef, 
sccp tracks getresult values, not call values in this
case.

llvm-svn: 50202
 2008-04-24 00:19:54 +00:00
Chris Lattner 769203cb03 code cleanup, no functionality change. 
llvm-svn: 50201
 2008-04-24 00:16:28 +00:00
Chris Lattner 86bbf338e5 Split some code out of the main SimplifyCFG loop into its own function. 
Fix said code to handle merging return instructions together correctly
when handling multiple return values.

llvm-svn: 50199
 2008-04-24 00:01:19 +00:00
Devang Patel 8f83081fea Check type instead of no. of operands. 
llvm-svn: 50179
 2008-04-23 20:18:29 +00:00
Dale Johannesen f6e15a4774 Rewrite previous patch to suit Chris's preference. 
llvm-svn: 50174
 2008-04-23 18:34:37 +00:00
Chris Lattner a82d691caa simplify code for propagation of constant arguments into 
callees.

llvm-svn: 50142
 2008-04-23 06:16:27 +00:00
Chris Lattner 5f1802cfdf Fix a number of bugs in ipconstantprop, simplify the code, fit in 80 cols, 
fix read after free bug (PR2238).

llvm-svn: 50141
 2008-04-23 05:59:23 +00:00
Chris Lattner 5a58a4dc6d Rewrite multiple return value handling in SCCP. Before, the -sccp pass 
would turn every getresult instruction into undef.  This helps with
rdar://5778210

llvm-svn: 50140
 2008-04-23 05:38:20 +00:00
Dale Johannesen 493527d8c9 Do not change the type of a ByVal argument to a 
type of a different size.

llvm-svn: 50121
 2008-04-23 01:03:05 +00:00
Evan Cheng 1c89ca7295 Don't do: "(X & 4) >> 1 == 2 --> (X & 4) == 4" if there are more than one uses of the shift result. 
llvm-svn: 50118
 2008-04-23 00:38:06 +00:00
Chris Lattner 37e9c187b0 Start doing the significantly useful part of jump threading: handle cases 
where a comparison has a phi input and that phi is a constant.  For example,
stuff like:

  Threading edge through bool from 'bb2149' to 'bb2231' with cost: 1, across block:
bb2237:		; preds = %bb2231, %bb2149
	%tmp2328.rle = phi i32 [ %tmp2232, %bb2231 ], [ %tmp2232439, %bb2149 ]		; <i32> [#uses=2]
	%done.0 = phi i32 [ %done.2, %bb2231 ], [ 0, %bb2149 ]		; <i32> [#uses=1]
	%tmp2239 = icmp eq i32 %done.0, 0		; <i1> [#uses=1]
	br i1 %tmp2239, label %bb2231, label %bb2327

or

bb38.i298:		; preds = %bb33.i295, %bb1693
	%tmp39.i296.rle = phi %struct.ibox* [ null, %bb1693 ], [ %tmp39.i296.rle1109, %bb33.i295 ]		; <%struct.ibox*> [#uses=2]
	%minspan.1.i291.reg2mem.1 = phi i32 [ 32000, %bb1693 ], [ %minspan.0.i288, %bb33.i295 ]		; <i32> [#uses=1]
	%tmp40.i297 = icmp eq %struct.ibox* %tmp39.i296.rle, null		; <i1> [#uses=1]
	br i1 %tmp40.i297, label %implfeeds.exit311, label %bb43.i301

This triggers thousands of times in spec.

llvm-svn: 50110
 2008-04-22 21:40:39 +00:00
Chris Lattner d5425e8f8d Dig through multiple levels of AND to thread jumps if needed. 
llvm-svn: 50106
 2008-04-22 20:46:09 +00:00
Chris Lattner 3df4c15dc7 Teach jump threading to thread through blocks like: 
br (and X, phi(Y, Z, false)), label L1, label L2

This triggers once on 252.eon and 6 times on 176.gcc.  Blocks 
in question often look like this:

bb262:		; preds = %bb261, %bb248
	%iftmp.251.0 = phi i1 [ true, %bb261 ], [ false, %bb248 ]		; <i1> [#uses=4]
	%tmp270 = icmp eq %struct.rtx_def* %tmp.0.i, null		; <i1> [#uses=1]
	%bothcond = or i1 %iftmp.251.0, %tmp270		; <i1> [#uses=1]
	br i1 %bothcond, label %bb288, label %bb273

In this case, it is clear that it doesn't matter if tmp.0.i is null when coming from bb261.  When coming from bb248, it is all that matters.


Another random example:

check_asm_operands.exit:		; preds = %check_asm_operands.exit.thr_comm, %bb30.i, %bb12.i, %bb6.i413
	%tmp.0.i420 = phi i1 [ true, %bb6.i413 ], [ true, %bb12.i ], [ true, %bb30.i ], [ false, %check_asm_operands.exit.thr_comm ; <i1> [#uses=1]
	call void @llvm.stackrestore( i8* %savedstack ) nounwind 
	%tmp4389 = icmp eq i32 %added_sets_1.0, 0		; <i1> [#uses=1]
	%tmp4394 = icmp eq i32 %added_sets_2.0, 0		; <i1> [#uses=1]
	%bothcond80 = and i1 %tmp4389, %tmp4394		; <i1> [#uses=1]
	%bothcond81 = and i1 %bothcond80, %tmp.0.i420		; <i1> [#uses=1]
	br i1 %bothcond81, label %bb4398, label %bb4397

Here is the case from 252.eon:

bb290.i.i:		; preds = %bb23.i57.i.i, %bb8.i39.i.i, %bb100.i.i, %bb100.i.i, %bb85.i.i110
	%myEOF.1.i.i = phi i1 [ true, %bb100.i.i ], [ true, %bb100.i.i ], [ true, %bb85.i.i110 ], [ true, %bb8.i39.i.i ], [ false, %bb23.i57.i.i ]		; <i1> [#uses=2]
	%i.4.i.i = phi i32 [ %i.1.i.i, %bb85.i.i110 ], [ %i.0.i.i, %bb100.i.i ], [ %i.0.i.i, %bb100.i.i ], [ %i.3.i.i, %bb8.i39.i.i ], [ %i.3.i.i, %bb23.i57.i.i ]		; <i32> [#uses=3]
	%tmp292.i.i = load i8* %tmp16.i.i100, align 1		; <i8> [#uses=1]
	%tmp293.not.i.i = icmp ne i8 %tmp292.i.i, 0		; <i1> [#uses=1]
	%bothcond.i.i = and i1 %tmp293.not.i.i, %myEOF.1.i.i		; <i1> [#uses=1]
	br i1 %bothcond.i.i, label %bb202.i.i, label %bb301.i.i
  Factoring out 3 common predecessors.

On the path from any blocks other than bb23.i57.i.i, the load and compare 
are dead.

llvm-svn: 50096
 2008-04-22 07:05:46 +00:00
Chris Lattner e369c35a84 refactor some code, no functionality change. 
llvm-svn: 50094
 2008-04-22 06:36:15 +00:00
Chris Lattner 8fb13cbe4e remove dead code. 
llvm-svn: 50080
 2008-04-22 03:21:48 +00:00
Chris Lattner c3a439351c optimize "p != gep p, ..." better. This allows us to compile 
getelementptr-seteq.ll into:

define i1 @test(i64 %X, %S* %P) {
	%C = icmp eq i64 %X, -1		; <i1> [#uses=1]
	ret i1 %C
}

instead of:

define i1 @test(i64 %X, %S* %P) {
	%A.idx.mask = and i64 %X, 4611686018427387903		; <i64> [#uses=1]
	%C = icmp eq i64 %A.idx.mask, 4611686018427387903		; <i1> [#uses=1]
	ret i1 %C
}

And fixes the second half of PR2235.  This speeds up the insertion sort
case by 45%, from 1.12s to 0.77s.  In practice, this will significantly
speed up for loops structured like:

for (double *P = Base + N; P != Base; --P)
  ...

Which happens frequently for C++ iterators.

llvm-svn: 50079
 2008-04-22 02:53:33 +00:00
Chris Lattner bab7bec9c8 fix grammar-o, thanks to Duncan for noticing. 
llvm-svn: 50047
 2008-04-21 18:25:01 +00:00
Owen Anderson a5b96ecef9 Remove unneeded #include's. 
llvm-svn: 50035
 2008-04-21 07:47:38 +00:00
Owen Anderson 6a7355caa2 Refactor memcpyopt based on Chris' suggestions. Consolidate several functions 
and simplify code that was fallout from the separation of memcpyopt and gvn.

llvm-svn: 50034
 2008-04-21 07:45:10 +00:00
Chris Lattner ad0d42ba15 don't assume that the argument passed to fprintf("%s" is a string. This 
fixes a crash in opt on 433.milc.

llvm-svn: 50023
 2008-04-21 03:18:33 +00:00
Chris Lattner f6236cc2e9 Use the new SplitBlockPredecessors to implement a todo. 
llvm-svn: 50022
 2008-04-21 02:57:57 +00:00
Chris Lattner a5b11705b6 Move SplitBlockPredecessors out of loopsimplify into BasicBlockUtils.h 
as a global helper function.  At the same type, switch it from taking
a vector of predecessors to an arbitrary sequential input.  This allows
us to switch LoopSimplify to use a SmallVector for various temporary
vectors that it passed into SplitBlockPredecessors.

llvm-svn: 50020
 2008-04-21 01:28:02 +00:00
Chris Lattner d418b06abf Move domtree/frontier updating earlier, allowing us to use it to update phi 
nodes, removing a hack.

llvm-svn: 50019
 2008-04-21 01:05:08 +00:00
Chris Lattner 96e9e22269 Factor dominator tree and frontier updating into SplitBlockPredecessors 
instead of doing it after every call.

llvm-svn: 50018
 2008-04-21 00:54:38 +00:00
Chris Lattner 559c867ece fit some more code in 80 cols. 
llvm-svn: 50016
 2008-04-21 00:25:49 +00:00
Chris Lattner aca912d793 simplify code, fit in 80 cols. 
llvm-svn: 50015
 2008-04-21 00:23:14 +00:00
Chris Lattner 38806c3e9c fit in 80 cols 
llvm-svn: 50014
 2008-04-21 00:19:16 +00:00
Chris Lattner ff1c6e388c finish the first cut of a jump threading pass implementation. 
llvm-svn: 50006
 2008-04-20 22:39:42 +00:00
Chris Lattner 567166c0a8 replace a slow and verbose version of Instruction::isUsedOutsideOfBlock with 
a call to Instruction::isUsedOutsideOfBlock.

llvm-svn: 50005
 2008-04-20 22:18:22 +00:00
Chris Lattner 9c1f1a82bf we can only thread blocks when there is a pred we can determine the succ of. 
llvm-svn: 50003
 2008-04-20 21:18:09 +00:00
Chris Lattner 2115722ffa improve comments, infrastructure, and add some validity checks for threading. 
Add a cost function.

llvm-svn: 50002
 2008-04-20 21:13:06 +00:00
Chris Lattner b3b6007c8b Add a new Jump Threading pass, which will handle cases 
such as those in PR2235.  Right now the pass is not very
effective. :)

llvm-svn: 50000
 2008-04-20 20:35:01 +00:00
Torok Edwin ab20784740 g++-4.3 build-fix: CHAR_BIT requires <climits>. 
llvm-svn: 49989
 2008-04-20 08:33:11 +00:00
Chris Lattner 3b18762f40 Switch to using Simplified ConstantFP::get API. 
llvm-svn: 49977
 2008-04-20 00:41:09 +00:00
Chris Lattner eb6bb803a7 Allow argpromote to promote struct arguments with a specified number 
of elements.  Patch by Matthijs Kooijman!

llvm-svn: 49962
 2008-04-19 19:50:01 +00:00
Owen Anderson f9ae76d89c Make GVN able to remove unnecessary calls to read-only functions again. 
llvm-svn: 49842
 2008-04-17 05:36:50 +00:00
Scott Michel 376acf4aaa Remove unused variable 
llvm-svn: 49838
 2008-04-17 01:30:44 +00:00
Scott Michel f66cb3696a Workaround for PR2207, in which pred_iterator assert gets triggered due to a 
wee problem in Xcode 2.[45]/gcc 4.0.1.

llvm-svn: 49831
 2008-04-16 23:46:39 +00:00
Chuck Rose III c6a47e8a79 VisualStudio project files updated. #include <algorithm> added to make VisualStudio happy. Also had to undefine setjmp because of #include <csetjmp> turning setjmp into _setjmp in VisualStudio. 
llvm-svn: 49743
 2008-04-15 21:27:11 +00:00
Dan Gohman 4fff979a43 Remove unnecessary <sstream> includes. 
llvm-svn: 49681
 2008-04-14 20:40:47 +00:00
Dan Gohman e36714c0b4 Minor whitespace and comment cleanups. 
llvm-svn: 49671
 2008-04-14 18:26:16 +00:00
Owen Anderson 7629b71dd4 Revert r49614. As Dan pointed out, some of these aren't correct. 
llvm-svn: 49657
 2008-04-14 17:38:21 +00:00
Owen Anderson 1f6fbc4bc3 Replace calls of the form V1->setName(V2->getName()) with V1->takeName(V2), 
which is significantly more efficient.

llvm-svn: 49614
 2008-04-13 19:15:17 +00:00
Owen Anderson 1e73f29a7f Fix PR2213 by simultaneously making GVN more aggressive with the return values 
of calls and less aggressive with non-readnone calls.

llvm-svn: 49516
 2008-04-11 05:11:49 +00:00
Dan Gohman 99b7b3f03b Teach InstCombine's ComputeMaskedBits to handle pointer expressions 
in addition to integer expressions. Rewrite GetOrEnforceKnownAlignment
as a ComputeMaskedBits problem, moving all of its special alignment
knowledge to ComputeMaskedBits as low-zero-bits knowledge.

Also, teach ComputeMaskedBits a few basic things about Mul and PHI
instructions.

This improves ComputeMaskedBits-based simplifications in a few cases,
but more noticeably it significantly improves instcombine's alignment
detection for loads, stores, and memory intrinsics.

llvm-svn: 49492
 2008-04-10 18:43:06 +00:00
Chris Lattner a29d2536aa Disable an xform we've had for a long time, pow(x,0.5) -> sqrt. 
This is not safe for all inputs.

llvm-svn: 49458
 2008-04-10 02:07:51 +00:00
Chris Lattner 802134fc02 Generalize getUnaryFloatFunction to handle any FP unary function, automatically 
figuring out the suffix to use.  implement pow(2,x) -> exp2(x).

llvm-svn: 49437
 2008-04-09 17:48:11 +00:00
Chris Lattner cca74e5ab9 use the new ConstantFP::get method to make this work with 
long double and simplify the code.

llvm-svn: 49435
 2008-04-09 17:17:35 +00:00
Devang Patel a7dfbc0366 Be conservative if getresult operand is neither call nor invoke. 
llvm-svn: 49430
 2008-04-09 15:58:24 +00:00
Owen Anderson ef9a6fd5c2 Factor a bunch of functionality related to memcpy and memset transforms out of 
GVN and into its own pass.

llvm-svn: 49419
 2008-04-09 08:23:16 +00:00
Owen Anderson 8ee792d1b6 Remove accidentally duplicated code. 
llvm-svn: 49418
 2008-04-09 07:55:01 +00:00
Chris Lattner b859fb49ed many cleanups to the pow optimizer. Allow it to handle powf, 
add support for  pow(x, 2.0) -> x*x.

llvm-svn: 49411
 2008-04-09 00:07:45 +00:00
Devang Patel 8cd2a3ae2a Fix insert point handling for multiple return values. 
llvm-svn: 49367
 2008-04-08 02:24:08 +00:00
Owen Anderson ed92b41a39 Add operator= implementations to SparseBitVector, allowing it to be used in GVN. This results 
in both time and memory savings for GVN.  For example, one testcase went from 10.5s to 6s with
this patch.

llvm-svn: 49345
 2008-04-07 17:38:23 +00:00
Duncan Sands 813384951e Use Intrinsic::getDeclaration in more places. 
llvm-svn: 49338
 2008-04-07 13:45:04 +00:00
Duncan Sands 1416ebf1fe The "stacksave is not nounwind problem" no longer 
needs to be fixed here - a previous commit made sure
that intrinsics always get the right attributes.
So remove no-longer needed code, and while there use
Intrinsic::getDeclaration rather than getOrInsertFunction. 

llvm-svn: 49337
 2008-04-07 13:43:58 +00:00
Duncan Sands fbc6adcc59 Use Intrinsic::getDeclaration to get hold of 
intrinsics.  Fix up the argument type (should
be i8*, was an array*).

llvm-svn: 49336
 2008-04-07 13:41:19 +00:00
Owen Anderson 0c1e634cbb Make GVN more memory efficient, particularly on code that contains a large number of 
allocations, which GVN can't optimize anyways.

llvm-svn: 49329
 2008-04-07 09:59:07 +00:00
Dale Johannesen 87e484f08b Mark calls to llvm.stacksave, llvm.stackrestore as 
nounwind.  When such calls are inlined into something
else that is invoked, they were getting changed to invokes,
which is badness.

llvm-svn: 49299
 2008-04-07 00:08:48 +00:00
Chris Lattner a39cfc5c5b silence a warning when assertions are disabled. 
llvm-svn: 49283
 2008-04-06 21:44:08 +00:00
Gabor Greif e9ecc68d8f API changes for class Use size reduction, wave 1. 
Specifically, introduction of XXX::Create methods
for Users that have a potentially variable number of
Uses.

llvm-svn: 49277
 2008-04-06 20:25:17 +00:00
David Greene 586740f401 Iterators folloring a SmallVector erased element are invalidated so 
don't access cached iterators from after the erased element.

Re-apply 49056 with SmallVector support.

llvm-svn: 49106
 2008-04-02 18:24:46 +00:00
Evan Cheng ac38d444e2 1. Drop default inline threshold back down to 200. 
2. Do not use # of basic blocks as part of the cost computation since it doesn't really figure into function size.
3. More aggressively inline function with vector code.

llvm-svn: 49061
 2008-04-01 23:59:29 +00:00
Tanya Lattner 052838c55d Reverting 49056 due to the build being broken. 
llvm-svn: 49060
 2008-04-01 23:41:44 +00:00