RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-28 22:42:52 +01:00
Code Issues Projects Releases Wiki Activity
37,094 Commits 4 Branches 5 Tags 704 MiB
432abc0479
Commit Graph

3850 Commits

Author SHA1 Message Date
Andrew Lenharth
83adca5075 Better check 
llvm-svn: 43897
 2007-11-08 18:45:15 +00:00
Andrew Lenharth
310a65171d Fix PR1780 
llvm-svn: 43893
 2007-11-08 17:39:28 +00:00
Chris Lattner
8e982efdc5 fix const correctness, BB is const, so its predecessors are too 
llvm-svn: 43780
 2007-11-06 22:07:40 +00:00
Chris Lattner
2a909d32b6 don't put erase or query for non-allocainst pointers in an set of allocainsts*'s 
llvm-svn: 43779
 2007-11-06 22:07:22 +00:00
Chris Lattner
907b9b92fe Implement PR1777 by detecting dependent phis that 
all compute the same value.

llvm-svn: 43777
 2007-11-06 21:52:06 +00:00
Duncan Sands
59b08debe3 At the point of calculating the shift amount, the 
type of SV has changed from what it originally was.
However we need the store width of the original.

llvm-svn: 43775
 2007-11-06 20:39:11 +00:00
Chris Lattner
e194944b29 wrap long lines 
llvm-svn: 43745
 2007-11-06 01:15:27 +00:00
Dan Gohman
adc21ed938 Fix an abort in instcombine when folding creates a vector rem instruction. 
llvm-svn: 43743
 2007-11-05 23:16:33 +00:00
Devang Patel
963e54c2cf If a value is incoming from outside the loop then the value does not need remapping and the value is never tracked through LastValueMap. 
llvm-svn: 43728
 2007-11-05 19:32:30 +00:00
Gordon Henriksen
8188f028a2 Deleting redundant copy of block extractor pass. See also PR1775. 
llvm-svn: 43694
 2007-11-05 01:54:05 +00:00
Duncan Sands
7c0f410b42 If a long double is in a packed struct, it may be 
that there is no padding.

llvm-svn: 43691
 2007-11-05 00:35:07 +00:00
Gordon Henriksen
4d157a1bc6 Finishing initial docs for all transformations in Passes.html. 
Also cleaned up some comments in source files.

llvm-svn: 43674
 2007-11-04 16:15:04 +00:00
Duncan Sands
662fb070a7 Change uses of getTypeSize to getABITypeSize, getTypeStoreSize 
or getTypeSizeInBits as appropriate in ScalarReplAggregates.
The right change to make was not always obvious, so it would
be good to have an sroa guru review this.  While there I noticed
some bugs, and fixed them: (1) arrays of x86 long double have
holes due to alignment padding, but this wasn't being spotted
by HasStructPadding (renamed to HasPadding).  The same goes
for arrays of oddly sized ints.  Vectors also suffer from this,
in fact the problem for vectors is much worse because basic
vector assumptions seem to be broken by vectors of type with
alignment padding.   I didn't try to fix any of these vector
problems.  (2) The code for extracting smaller integers from
larger ones (in the "int union" case) was wrong on big-endian
machines for integers with size not a multiple of 8, like i1.
Probably this is impossible to hit via llvm-gcc, but I fixed
it anyway while there and added a testcase.  I also got rid of
some trailing whitespace and changed a function name which
had an obvious typo in it.

llvm-svn: 43672
 2007-11-04 14:43:57 +00:00
Chris Lattner
493f83eeb1 Disable tail duplication of call instructions. The cost 
metric is way off for these in general, and this works around
buggy code like that in PR1764.  we'll see if there is a big
performance impact of this.  If so, I'll revert it tomorrow.

llvm-svn: 43668
 2007-11-04 06:37:55 +00:00
Dan Gohman
19d88d511b Add std:: to sort calls. 
llvm-svn: 43652
 2007-11-02 22:24:01 +00:00
Dan Gohman
26c8800fbd Change illegal uses of ++ to uses of STLExtra.h's next function. 
llvm-svn: 43651
 2007-11-02 22:22:02 +00:00
Duncan Sands
eb464e976f Executive summary: getTypeSize -> getTypeStoreSize / getABITypeSize. 
The meaning of getTypeSize was not clear - clarifying it is important
now that we have x86 long double and arbitrary precision integers.
The issue with long double is that it requires 80 bits, and this is
not a multiple of its alignment.  This gives a primitive type for
which getTypeSize differed from getABITypeSize.  For arbitrary precision
integers it is even worse: there is the minimum number of bits needed to
hold the type (eg: 36 for an i36), the maximum number of bits that will
be overwriten when storing the type (40 bits for i36) and the ABI size
(i.e. the storage size rounded up to a multiple of the alignment; 64 bits
for i36).

This patch removes getTypeSize (not really - it is still there but
deprecated to allow for a gradual transition).  Instead there is:

(1) getTypeSizeInBits - a number of bits that suffices to hold all
values of the type.  For a primitive type, this is the minimum number
of bits.  For an i36 this is 36 bits.  For x86 long double it is 80.
This corresponds to gcc's TYPE_PRECISION.

(2) getTypeStoreSizeInBits - the maximum number of bits that is
written when storing the type (or read when reading it).  For an
i36 this is 40 bits, for an x86 long double it is 80 bits.  This
is the size alias analysis is interested in (getTypeStoreSize
returns the number of bytes).  There doesn't seem to be anything
corresponding to this in gcc.

(3) getABITypeSizeInBits - this is getTypeStoreSizeInBits rounded
up to a multiple of the alignment.  For an i36 this is 64, for an
x86 long double this is 96 or 128 depending on the OS.  This is the
spacing between consecutive elements when you form an array out of
this type (getABITypeSize returns the number of bytes).  This is
TYPE_SIZE in gcc.

Since successive elements in a SequentialType (arrays, pointers
and vectors) need to be aligned, the spacing between them will be
given by getABITypeSize.  This means that the size of an array
is the length times the getABITypeSize.  It also means that GEP
computations need to use getABITypeSize when computing offsets.
Furthermore, if an alloca allocates several elements at once then
these too need to be aligned, so the size of the alloca has to be
the number of elements multiplied by getABITypeSize.  Logically
speaking this doesn't have to be the case when allocating just
one element, but it is simpler to also use getABITypeSize in this
case.  So alloca's and mallocs should use getABITypeSize.  Finally,
since gcc's only notion of size is that given by getABITypeSize, if
you want to output assembler etc the same as gcc then getABITypeSize
is the size you want.

Since a store will overwrite no more than getTypeStoreSize bytes,
and a read will read no more than that many bytes, this is the
notion of size appropriate for alias analysis calculations.

In this patch I have corrected all type size uses except some of
those in ScalarReplAggregates, lib/Codegen, lib/Target (the hard
cases).  I will get around to auditing these too at some point,
but I could do with some help.

Finally, I made one change which I think wise but others might
consider pointless and suboptimal: in an unpacked struct the
amount of space allocated for a field is now given by the ABI
size rather than getTypeStoreSize.  I did this because every
other place that reserves memory for a type (eg: alloca) now
uses getABITypeSize, and I didn't want to make an exception
for unpacked structs, i.e. I did it to make things more uniform.
This only effects structs containing long doubles and arbitrary
precision integers.  If someone wants to pack these types more
tightly they can always use a packed struct.

llvm-svn: 43620
 2007-11-01 20:53:16 +00:00
Owen Anderson
594b0fe9e2 Fix test/Transforms/DeadStoreElimination/PartialStore.ll, which had been 
silently failing because of an incorrect run line for some time.

llvm-svn: 43605
 2007-11-01 05:29:16 +00:00
Chris Lattner
d29624e11a Fix InstCombine/2007-10-31-RangeCrash.ll 
llvm-svn: 43596
 2007-11-01 02:18:41 +00:00
Dan Gohman
51cadc3b59 Fix a typo in a comment. 
llvm-svn: 43553
 2007-10-31 14:35:39 +00:00
Evan Cheng
06ec64fcda At end of LSR, replace uses of now constant (as result of SplitCriticalEdge) PHI node with the constant value. 
llvm-svn: 43533
 2007-10-30 23:45:15 +00:00
Evan Cheng
5e058e94b5 It's not safe to tell SplitCriticalEdge to merge identical edges. It may delete the phi instruction that's being processed. 
llvm-svn: 43524
 2007-10-30 22:27:26 +00:00
Evan Cheng
633cd3e84d - Bug fixes. 
- Allow icmp rewrite using an iv / stride of a smaller integer type.

llvm-svn: 43480
 2007-10-29 22:07:18 +00:00
Dan Gohman
1c499173c8 Don't bitcast from pointer-to-vector to pointer-to-array when 
lowering load and store instructions.

llvm-svn: 43468
 2007-10-29 20:34:35 +00:00
Dan Gohman
8f74d7f5c0 Use an array instead of a fixed-length std::vector. 
llvm-svn: 43467
 2007-10-29 20:24:00 +00:00
Dan Gohman
0e9e5b6534 Do a real assert if there is an unhandled vector instruction instead 
of just printing to cerr.

llvm-svn: 43466
 2007-10-29 20:14:29 +00:00
Dan Gohman
a309c59972 Update a comment to reflect the current code. 
llvm-svn: 43463
 2007-10-29 19:32:39 +00:00
Dan Gohman
459bb8cbd2 Remove an unused function argument. 
llvm-svn: 43462
 2007-10-29 19:31:25 +00:00
Dan Gohman
30b8bd2ad4 Fix a typo in a comment. 
llvm-svn: 43461
 2007-10-29 19:26:14 +00:00
Dan Gohman
957fd1704a Avoid calling ValidStride when not all uses are addresses. 
llvm-svn: 43460
 2007-10-29 19:23:53 +00:00
Chris Lattner
891066cfff Fix PR1752 and LoopSimplify/2007-10-28-InvokeCrash.ll: terminators 
can have uses too.  Wouldn't it be nice if invoke didn't exist? :)

llvm-svn: 43426
 2007-10-29 02:30:37 +00:00
Evan Cheng
c8adcda731 A number of LSR fixes: 
- ChangeCompareStride only reuse stride that is larger than current stride. It
  will let the general reuse mechanism to try to reuse a smaller stride.
- Watch out for multiplication overflow in ChangeCompareStride.
- Replace std::set with SmallPtrSet.

llvm-svn: 43408
 2007-10-26 23:08:19 +00:00
Evan Cheng
53b2e7f3ca Fix a crash. Make sure TLI is not null. 
llvm-svn: 43384
 2007-10-26 17:24:46 +00:00
Gordon Henriksen
609997aa7d More fleshing out of docs/Passes.html, plus some typo fixes and 
improved wording in source files.

llvm-svn: 43377
 2007-10-26 03:03:51 +00:00
Evan Cheng
53696b7e9f Loosen up iv reuse to allow reuse of the same stride but a larger type when truncating from the larger type to smaller type is free. 
e.g.
Turns this loop:
LBB1_1: # entry.bb_crit_edge
        xorl    %ecx, %ecx
        xorw    %dx, %dx
        movw    %dx, %si
LBB1_2: # bb
        movl    L_X$non_lazy_ptr, %edi
        movw    %si, (%edi)
        movl    L_Y$non_lazy_ptr, %edi
        movw    %dx, (%edi)
		addw    $4, %dx
		incw    %si
		incl    %ecx
		cmpl    %eax, %ecx
		jne     LBB1_2  # bb
	
into

LBB1_1: # entry.bb_crit_edge
        xorl    %ecx, %ecx
        xorw    %dx, %dx
LBB1_2: # bb
        movl    L_X$non_lazy_ptr, %esi
        movw    %cx, (%esi)
        movl    L_Y$non_lazy_ptr, %esi
        movw    %dx, (%esi)
        addw    $4, %dx
		incl    %ecx
        cmpl    %eax, %ecx
        jne     LBB1_2  # bb

llvm-svn: 43375
 2007-10-26 01:56:11 +00:00
Evan Cheng
d7eab3a984 Do not rewrite compare instruction using iv of a different stride if the new 
stride may be rewritten using the stride of the compare instruction.

llvm-svn: 43367
 2007-10-25 22:45:20 +00:00
Evan Cheng
c25c4276a6 Remove code that's commented out. 
llvm-svn: 43356
 2007-10-25 18:38:24 +00:00
Evan Cheng
66cbf54030 If a loop termination compare instruction is the only use of its stride, 
and the compaison is against a constant value, try eliminate the stride
by moving the compare instruction to another stride and change its
constant operand accordingly. e.g.

loop:
...
v1 = v1 + 3
v2 = v2 + 1
if (v2 < 10) goto loop
=>
loop:
...
v1 = v1 + 3
if (v1 < 30) goto loop

llvm-svn: 43336
 2007-10-25 09:11:16 +00:00
Dale Johannesen
414ad5d4a4 Fix off by 1 bug in printf->puts lowering. 
llvm-svn: 43309
 2007-10-24 20:14:50 +00:00
Chris Lattner
ae9cfd2fb0 simplify some code by using the new isNaN predicate 
llvm-svn: 43305
 2007-10-24 18:54:45 +00:00
Chris Lattner
483c471daa Implement a couple of foldings for ordered and unordered comparisons, 
implementing cases related to PR1738.

llvm-svn: 43289
 2007-10-24 05:38:08 +00:00
Dan Gohman
df1f166e4a Strength reduction improvements. 
- Avoid attempting stride-reuse in the case that there are users that
   aren't addresses. In that case, there will be places where the
   multiplications won't be folded away, so it's better to try to
   strength-reduce them.

 - Several SSE intrinsics have operands that strength-reduction can
   treat as addresses. The previous item makes this more visible, as
   any non-address use of an IV can inhibit stride-reuse.

 - Make ValidStride aware of whether there's likely to be a base
   register in the address computation. This prevents it from thinking
   that things like stride 9 are valid on x86 when the base register is
   already occupied.

Also, XFAIL the 2007-08-10-LEA16Use32.ll test; the new logic to avoid
stride-reuse elimintes the LEA in the loop, so the test is no longer
testing what it was intended to test.

llvm-svn: 43231
 2007-10-22 20:40:42 +00:00
Dan Gohman
68fc6d7395 Move the SCEV object factors from being static members of the individual 
SCEV subclasses to being non-static member functions of the ScalarEvolution
class.

llvm-svn: 43224
 2007-10-22 18:31:58 +00:00
Anton Korobeynikov
bcee4726bf Reg2Mem cleanup and optimizations: 
- enable phi instructions demotion to stack
 - create alloca instructions in the entry block

llvm-svn: 43208
 2007-10-21 23:05:16 +00:00
Devang Patel
eff4619cc8 Try again. 
Instead of loading small global string from memory, use
integer constant.

llvm-svn: 43148
 2007-10-18 19:52:32 +00:00
Owen Anderson
f0e040a0c7 Allow GVN to eliminate redundant calls to functions without side effects. 
llvm-svn: 43147
 2007-10-18 19:39:33 +00:00
Chris Lattner
efaf4ba65d Fix PR1735 and Transforms/DeadArgElim/2007-10-18-VarargsReturn.ll by 
fixing some obviously broken code :(

llvm-svn: 43141
 2007-10-18 18:49:29 +00:00
Owen Anderson
4b407757d0 Move Split<...>() into DomTreeBase. This should make the #include's of DominatorInternals.h 
in CodeExtractor and LoopSimplify unnecessary.

Hartmut, could you confirm that this fixes the issues you were seeing?

llvm-svn: 43115
 2007-10-18 05:13:52 +00:00
Evan Cheng
1c34d807ce Reverting r43070 for now. It's causing llc test failures. 
llvm-svn: 43103
 2007-10-17 23:51:13 +00:00
Devang Patel
9cb3c09156 Do not raise free() call that is called through invoke instruction. 
llvm-svn: 43083
 2007-10-17 20:12:58 +00:00
Hartmut Kaiser
4cbb4f081b Fixed linker errors (unresolved externals: split<>(...)) when compiling with VC++. Please review. 
llvm-svn: 43081
 2007-10-17 18:37:09 +00:00
Devang Patel
cf2f9d6daa Apply "Instead of loading small c string constant, use integer constant directly" transformation while processing load instruction. 
llvm-svn: 43070
 2007-10-17 07:24:40 +00:00
Devang Patel
c3d0477a0e Use immediate stores. 
llvm-svn: 43055
 2007-10-16 23:44:18 +00:00
Devang Patel
7d1d5d6bf6 Achieve same result but use fewer lines of code. 
llvm-svn: 42985
 2007-10-15 15:31:35 +00:00
Devang Patel
f65c028dad Dest type is always i8 *. This allows some simplification. 
Do not filter memmove.

llvm-svn: 42930
 2007-10-12 20:10:21 +00:00
Chris Lattner
3af877f26a Fix a bug in my patch last night that broke InstCombine/2007-10-12-Crash.ll 
llvm-svn: 42920
 2007-10-12 18:05:47 +00:00
Gabor Greif
cbfb655705 eliminate warning 
llvm-svn: 42892
 2007-10-12 07:44:54 +00:00
Chris Lattner
3c23c37233 Fix some 80 column violations. 
Fix DecomposeSimpleLinearExpr to handle simple constants better.
Don't nuke gep(bitcast(allocation)) if the bitcast(allocation) will
fold the allocation.  This fixes PR1728 and Instcombine/malloc3.ll

llvm-svn: 42891
 2007-10-12 05:30:59 +00:00
Devang Patel
15d6257fa8 Lower memcpy if it makes sense. 
llvm-svn: 42864
 2007-10-11 17:21:57 +00:00
Devang Patel
b13057acf6 Do not walk invalid iterator. 
llvm-svn: 42812
 2007-10-09 21:31:36 +00:00
Devang Patel
36b68478cb Fix bug in updating dominance frontier after loop 
unswitch when frontier includes basic blocks that 
are not inside loop.

llvm-svn: 42654
 2007-10-05 22:29:34 +00:00
Devang Patel
5efcf79cf3 Fix 80 col violation. 
llvm-svn: 42591
 2007-10-03 21:17:43 +00:00
Devang Patel
1e2cced8b9 Refactor code in a separate method. 
llvm-svn: 42590
 2007-10-03 21:16:08 +00:00
Dan Gohman
30ba45b569 Use empty() member functions when that's what's being tested for instead 
of comparing begin() and end().

llvm-svn: 42585
 2007-10-03 19:26:29 +00:00
Dale Johannesen
529cc16893 Tone down an overzealous optimization. 
llvm-svn: 42582
 2007-10-03 17:45:27 +00:00
Tanya Lattner
1400027d41 Fix PR1719, by not marking llvm.global.annotations internal. 
llvm-svn: 42578
 2007-10-03 17:05:40 +00:00
Chris Lattner
21b1f72d4c Fix PR1719, by not marking llvm.noinline internal. 
llvm-svn: 42565
 2007-10-03 03:59:15 +00:00
Dale Johannesen
d94f00234f Fix stride computations for long double arrays. 
llvm-svn: 42508
 2007-10-01 23:08:35 +00:00
Devang Patel
42f006a51a Relax unsafe use check. If there is one unconditional use inside the loop then it is safe to promote value even if there is another conditional use inside the loop. 
llvm-svn: 42493
 2007-10-01 18:12:58 +00:00
Dale Johannesen
a30678c8f0 minor long double related changes 
llvm-svn: 42439
 2007-09-28 18:06:58 +00:00
Dale Johannesen
412575891e Don't do SRA for unions with long double fields. 
Fixes a SWB crash.

llvm-svn: 42422
 2007-09-28 00:21:38 +00:00
Devang Patel
d98abb62ce Handle multiple induction variables. 
This fixes PR714.

llvm-svn: 42309
 2007-09-25 18:24:48 +00:00
Devang Patel
ab58843813 Do not reserve DOM check for GetElementPtrInst. 
llvm-svn: 42306
 2007-09-25 17:55:50 +00:00
Devang Patel
f35e6c1181 doh.. 
llvm-svn: 42300
 2007-09-25 17:43:08 +00:00
Devang Patel
de9d1c3654 Add transformation to update loop interation space. Now, 
for (i=A; i<N; i++) {
  if (i < X && i > Y)
    do_something();
}

is transformed into

U=min(N,X); L=max(A,Y);
for (i=L;i<U;i++)
  do_somethihg();                            

llvm-svn: 42299
 2007-09-25 17:31:19 +00:00
Devang Patel
65f8d0c2d7 Do not promote null values because it may be unsafe to do so. 
llvm-svn: 42270
 2007-09-24 20:02:42 +00:00
Dan Gohman
ed361aa114 explicit keywords. 
llvm-svn: 42262
 2007-09-24 15:48:49 +00:00
Devang Patel
b741c56cfc Fix PR1692 
llvm-svn: 42209
 2007-09-21 21:18:19 +00:00
Owen Anderson
9070cf6dea Add partial caching of non-local memory dependence queries. This provides a modest 
speedup for GVN.

llvm-svn: 42185
 2007-09-21 03:53:52 +00:00
Devang Patel
632653ce8f Update aux. info associated with an instruction before erasing instruction. 
llvm-svn: 42180
 2007-09-20 23:45:50 +00:00
Devang Patel
57b0b31257 Don't increment invalid iterator. 
llvm-svn: 42178
 2007-09-20 23:01:50 +00:00
Nick Lewycky
3baa4cde1c Fix optimization. %x = sub %x, %y does not imply that %y is zero. 
llvm-svn: 42157
 2007-09-20 00:48:36 +00:00
Devang Patel
648d7a1074 Avoid unsafe promotion. 
llvm-svn: 42149
 2007-09-19 20:18:51 +00:00
Duncan Sands
f7abe75944 Improve comment. 
llvm-svn: 42132
 2007-09-19 10:25:38 +00:00
Duncan Sands
d88f60ed32 A global variable with external weak linkage can be null, while 
an alias could alias such a global variable.

llvm-svn: 42130
 2007-09-19 10:10:31 +00:00
Devang Patel
339bee9291 Relax loop ExitCondition predicate restriction. 
llvm-svn: 42122
 2007-09-19 00:28:47 +00:00
Devang Patel
2883f5cc94 Filter loops where split condition's false branch is not empty. For example 
for (int i = 0; i < N; ++i) {
  if (i == somevalue)
    dosomething();
   else
    dosomethingelse();
}

llvm-svn: 42121
 2007-09-19 00:15:16 +00:00
Devang Patel
03df2adc31 Bail out early, before modifying anything. 
llvm-svn: 42120
 2007-09-19 00:11:01 +00:00
Devang Patel
9806df698b Work is incomplete. Loop is not modified at all right now. 
llvm-svn: 42119
 2007-09-19 00:08:13 +00:00
Devang Patel
4014965efb Fix PR1657 
llvm-svn: 42075
 2007-09-18 01:54:42 +00:00
Devang Patel
578a1ae12a Do not eliminate loop when it is invalid to do so. For example, 
for(int i = 0; i < N; i++) {
	if ( i == XYZ) {
		A;
	else
		B;
	}
	C;
	D;
}

llvm-svn: 42058
 2007-09-17 21:01:05 +00:00
Devang Patel
14b9a01c02 Skeleton for transformations to truncate loop's iteration space. 
llvm-svn: 42054
 2007-09-17 20:39:48 +00:00
Devang Patel
f4411aa165 Fix comment. 
llvm-svn: 42048
 2007-09-17 20:07:40 +00:00
Chris Lattner
cc315726f7 Merge DenseMapKeyInfo & DenseMapValueInfo into DenseMapInfo 
Add a new DenseMapInfo::isEqual method to allow clients to redefine
the equality predicate used when probing the hash table.

llvm-svn: 42042
 2007-09-17 18:34:04 +00:00
Dan Gohman
2de5779a99 Instcombine x-((x/y)*y) into a remainder operator. 
llvm-svn: 42035
 2007-09-17 17:31:57 +00:00
Duncan Sands
901cb2662d Factor the trampoline transformation into a subroutine. 
llvm-svn: 42021
 2007-09-17 10:26:40 +00:00
Owen Anderson
fd6ec5cf82 Be more careful when constant-folding PHI nodes. 
llvm-svn: 41998
 2007-09-16 08:04:16 +00:00
Owen Anderson
fe5adad9c4 Remove RLE. It is subsumed by GVN. 
llvm-svn: 41968
 2007-09-14 22:33:52 +00:00
Dale Johannesen
575bd6070a Remove the assumption that FP's are either float or 
double from some of the many places in the optimizers
it appears, and do something reasonable with x86
long double.
Make APInt::dump() public, remove newline, use it to
dump ConstantSDNode's.
Allow APFloats in FoldingSet.
Expand X86 backend handling of long doubles (conversions
to/from int, mostly).

llvm-svn: 41967
 2007-09-14 22:26:36 +00:00
Chris Lattner
601d09bf08 Fix a logic error in ValueIsOnlyUsedLocallyOrStoredToOneGlobal that caused 
miscompilation of 188.ammp.  Reject select and bitcast in 
ValueIsOnlyUsedLocallyOrStoredToOneGlobal because RewriteHeapSROALoadUser can't handle it.

llvm-svn: 41950
 2007-09-14 03:41:21 +00:00
Chris Lattner
9c3cd36dd0 silence a bogus gcc warning. 
llvm-svn: 41949
 2007-09-14 03:07:24 +00:00
Bill Wendling
843ac5aebe Temporary reverting r41817 
(http://lists.cs.uiuc.edu/pipermail/llvm-commits/Week-of-Mon-20070910/053370.html). It's
causing SPASS to fail.

llvm-svn: 41938
 2007-09-14 01:13:55 +00:00
Chris Lattner
f3448236f8 Teach GlobalLoadUsesSimpleEnoughForHeapSRA and the SROA rewriter how to handle 
a limited form of PHI nodes.  This finally fixes PR1639, speeding 179.art up
from 7.84s to 3.13s on PPC.

llvm-svn: 41933
 2007-09-13 21:31:36 +00:00
Chris Lattner
c5d83b7270 be tolerant of PHI nodes when rewriting heap SROA code. This is a step 
along the way of PR1639

llvm-svn: 41930
 2007-09-13 18:00:31 +00:00
Chris Lattner
c9f2f2dd92 refactor some code, no functionality change. On the path to PR1639 
llvm-svn: 41929
 2007-09-13 17:29:05 +00:00
Chris Lattner
31d34baa89 Make ValueIsOnlyUsedLocallyOrStoredToOneGlobal smart enough to see through 
bitcasts and phis.  This is a step to fixing PR1639.

llvm-svn: 41928
 2007-09-13 16:37:20 +00:00
Chris Lattner
b83dee72ee Make AllUsesOfLoadedValueWillTrapIfNull strong enough to see through PHI 
nodes.  This is the first step of the fix for PR1639.

llvm-svn: 41927
 2007-09-13 16:30:19 +00:00
Chris Lattner
d58e0026ec Change llvm.gcroot to not init the root to null at runtime, this prevents 
using it for live-in values etc.

llvm-svn: 41879
 2007-09-12 17:53:10 +00:00
Duncan Sands
c63fd15cd9 Turn calls to trampolines into calls to the underlying 
nested function.

llvm-svn: 41844
 2007-09-11 14:35:41 +00:00
Devang Patel
8f8fe2f0da Avoid negative logic. 
llvm-svn: 41829
 2007-09-11 01:10:45 +00:00
Devang Patel
9bc265b94a Refactor code into a separate method. 
llvm-svn: 41826
 2007-09-11 00:42:56 +00:00
Devang Patel
49ffe783eb Clear split info object. 
llvm-svn: 41823
 2007-09-11 00:23:56 +00:00
Devang Patel
8394964f1a Split condition does not have to be ICmpInst in all cases. 
llvm-svn: 41822
 2007-09-11 00:12:56 +00:00
Devang Patel
82374f7476 Check all terminators inside loop. 
llvm-svn: 41821
 2007-09-10 23:57:58 +00:00
Chris Lattner
3ace09794b remove some dead code, this is handled by constant folding. 
llvm-svn: 41819
 2007-09-10 23:46:29 +00:00
Devang Patel
ce76c29be0 Swap exit condition operands if it works. 
llvm-svn: 41817
 2007-09-10 23:34:06 +00:00
Chris Lattner
ab8aa7d61a Prevent tailcallelim from breaking "recursive" calls to builtins. 
llvm-svn: 41804
 2007-09-10 20:58:55 +00:00
Devang Patel
76790c1b28 Filter exit conditions which are not yet handled. 
llvm-svn: 41800
 2007-09-10 18:33:42 +00:00
Devang Patel
7a759cdfd7 Require SCEV before LCSSA. 
llvm-svn: 41798
 2007-09-10 18:08:23 +00:00
Chris Lattner
8e6c39d961 Don't zap back to back volatile load/stores 
llvm-svn: 41759
 2007-09-07 05:33:03 +00:00
Dale Johannesen
86f367a6b7 Next round of APFloat changes. 
Use APFloat in UpgradeParser and AsmParser.
Change all references to ConstantFP to use the
APFloat interface rather than double.  Remove
the ConstantFP double interfaces.
Use APFloat functions for constant folding arithmetic
and comparisons.
(There are still way too many places APFloat is
just a wrapper around host float/double, but we're
getting there.)

llvm-svn: 41747
 2007-09-06 18:13:44 +00:00
Nick Lewycky
79e179ff1f Use isTrueWhenEqual. Thanks Chris! 
llvm-svn: 41741
 2007-09-06 02:40:25 +00:00
Nick Lewycky
2f66503c0a When the two operands of an icmp are equal, there are five possible predicates 
that would make the icmp true. Fixes PR1637.

llvm-svn: 41740
 2007-09-06 01:10:22 +00:00
Chuck Rose III
4f602f5eba Forgot to obey 80 column rule. Fixing that. 
llvm-svn: 41725
 2007-09-05 20:36:41 +00:00
Chuck Rose III
a1061872a7 Added default parameters to GetElementPtrInstr constructor call. Visual Studio 2k5 was getting confused and was unable to compile it. Suspected compiler error. 
llvm-svn: 41721
 2007-09-05 16:54:38 +00:00
Devang Patel
2cebc6f649 Insert cloned loop basic blocks before original loop header. 
llvm-svn: 41713
 2007-09-04 20:46:35 +00:00
David Greene
8cda5af2e7 Update GEP constructors to use an iterator interface to fix 
GLIBCXX_DEBUG issues.

llvm-svn: 41697
 2007-09-04 15:46:09 +00:00
Anton Korobeynikov
5b49f44609 Silence warning while compiling with gcc 4.2 
llvm-svn: 41676
 2007-09-02 22:11:14 +00:00
Evan Cheng
9c7cff8e62 Fix a gcroot lowering bug. 
llvm-svn: 41668
 2007-09-01 02:00:51 +00:00
Chris Lattner
73aa3d62dc Cut off crazy computation. This helps PR1622 slightly. 
llvm-svn: 41522
 2007-08-28 04:23:55 +00:00
Devang Patel
c649f24384 Use simpler test to filter loops. 
llvm-svn: 41516
 2007-08-27 21:34:31 +00:00
David Greene
5b85021be8 Update InvokeInst to work like CallInst 
llvm-svn: 41506
 2007-08-27 19:04:21 +00:00
Dan Gohman
0b3fc43d5e Change comments to refer to @malloc and @free instead of %malloc and %free. 
llvm-svn: 41488
 2007-08-27 16:11:48 +00:00
Anton Korobeynikov
3dffac0c59 Don't promote volatile loads/stores. This is needed (for example) to handle setjmp/longjmp properly. 
This fixes PR1520.

llvm-svn: 41461
 2007-08-26 21:43:30 +00:00
Owen Anderson
f660f11ec4 Don't DSe volatile stores. 
llvm-svn: 41456
 2007-08-26 21:14:47 +00:00
Devang Patel
cbfa564c1c Move exit condition and exit branch from exiting block into loop header and dominator info. This avoid execution of dead iteration. Loop is already filter in the beginning such that this change is safe. 
llvm-svn: 41394
 2007-08-25 02:39:24 +00:00
Devang Patel
d961a55c5a Constant split values needs upper bound and lower bound check, just like any other split value. 
llvm-svn: 41389
 2007-08-25 01:09:14 +00:00
Devang Patel
027410a7aa While calculating upper loop bound for first loop and lower loop bound for second loop, take care of edge cases. 
llvm-svn: 41387
 2007-08-25 00:56:38 +00:00
Devang Patel
c46dc61548 Fix regression that I caused yesterday night while adding logic to select appropriate split condition branch. 
llvm-svn: 41365
 2007-08-24 19:32:26 +00:00
Devang Patel
0b351a64db It is not safe to execute split condition's true branch first all the time. If split 
condition predicate is GT or GE then execute false branch first.

llvm-svn: 41358
 2007-08-24 06:17:19 +00:00
Devang Patel
59af13f0cf Reject ICMP_NE as index split condition. 
llvm-svn: 41357
 2007-08-24 06:02:25 +00:00
Devang Patel
4b52632179 Tightenup loop filter. 
llvm-svn: 41356
 2007-08-24 05:36:56 +00:00
Devang Patel
8b1d0a1ad2 Remove incomplete cost analysis. 
llvm-svn: 41354
 2007-08-24 05:21:13 +00:00
Chris Lattner
742b745b0c rename APInt::toString -> toStringUnsigned for symmetry with toStringSigned() 
Add an APSInt::toString() method.

llvm-svn: 41309
 2007-08-23 05:15:32 +00:00
Devang Patel
4ad7c57729 Remove dead code. 
llvm-svn: 41295
 2007-08-22 21:07:41 +00:00
Devang Patel
798ba45c39 Fix typo. 
llvm-svn: 41292
 2007-08-22 20:55:18 +00:00
Devang Patel
59b8967a74 Cosmetic change 
"True Loop" and "False Loop" naming terminology to refer two loops
after loop cloning is confusing. Instead just use A_Loop and B_Loop.

llvm-svn: 41287
 2007-08-22 19:33:29 +00:00
Devang Patel
797fbef078 Refactor loop condition check in a separate function. 
llvm-svn: 41282
 2007-08-22 18:27:01 +00:00
Devang Patel
7e6f9f4779 Fix thinko. 
Starting value of second loop's induction variable can not be lower 
then starting value of original loop's induction variable.

llvm-svn: 41280
 2007-08-22 18:07:47 +00:00
Devang Patel
60f5256cd1 Rename bunch of variables. 
llvm-svn: 41250
 2007-08-21 21:12:02 +00:00
Devang Patel
4fe5509c7d Preserve LCSSA. 
llvm-svn: 41246
 2007-08-21 19:47:46 +00:00
Devang Patel
f06e667e9c Use SmallVector instead of std::vector. 
llvm-svn: 41207
 2007-08-21 00:31:24 +00:00
Devang Patel
b64f73f8f0 s/ExitBlock/ExitingBlock/g 
llvm-svn: 41204
 2007-08-20 23:51:18 +00:00
Devang Patel
b6ebf8cbf3 Replace indunction variable with split value in loop body. 
This fixes art miscompile.

llvm-svn: 41195
 2007-08-20 20:49:01 +00:00
Devang Patel
6c91023dad Do not split loops rejected by processOneIterationLoop(). 
llvm-svn: 41194
 2007-08-20 20:24:15 +00:00
Nick Lewycky
3ea7d43047 Oops, remove assert that wasn't meant to be committed. 
llvm-svn: 41170
 2007-08-18 23:21:28 +00:00
Nick Lewycky
125c9f2db3 Never insert duplicate edges. 
llvm-svn: 41169
 2007-08-18 23:18:03 +00:00
Nick Lewycky
9570c4c5ca Typo. 
llvm-svn: 41168
 2007-08-18 15:08:56 +00:00
Devang Patel
17cd20c077 Avoid spliting loops where two split condition branches are not independent. 
llvm-svn: 41148
 2007-08-18 00:00:32 +00:00
Devang Patel
fded73828f When one branch of condition is eliminated then head of the other 
branch is not necessary immediate dominators of merge blcok in all cases.

llvm-svn: 41144
 2007-08-17 21:59:16 +00:00
Owen Anderson
5173494693 Factor out some code into a helper function. 
llvm-svn: 41131
 2007-08-16 22:51:56 +00:00
Owen Anderson
70ac81f489 Add some more comments to GVN. 
llvm-svn: 41129
 2007-08-16 22:02:55 +00:00
Devang Patel
423d18e306 Dominance frontier is now required. 
llvm-svn: 41096
 2007-08-15 03:34:53 +00:00
Devang Patel
315ea9c519 Cleanup removeBlocks. 
Use dominance frontier to fixup incoming edges of successor blocks not domianted by DeadBB.
Use df_iterator to walk and delete basic blocks dominated by DeadBB.

llvm-svn: 41095
 2007-08-15 03:31:47 +00:00
Reid Spencer
2cfe29fc0b Remove unneeded header file. 
llvm-svn: 41094
 2007-08-15 03:01:04 +00:00
Devang Patel
b0924a406a Avoid triangle loops. 
llvm-svn: 41093
 2007-08-15 02:14:55 +00:00
Devang Patel
1dd44d7501 Break infinite loop. 
llvm-svn: 41091
 2007-08-14 23:59:17 +00:00
Devang Patel
d39b9d41bb Avoid nested loops at the moment. 
llvm-svn: 41090
 2007-08-14 23:53:57 +00:00
Devang Patel
7ff808f08e Fix dominance frontier update while removing blocks. 
llvm-svn: 41082
 2007-08-14 18:35:57 +00:00
Owen Anderson
b970937b06 Eliminate PHI nodes with constant values during normal GVN processing, even when 
they're not related to eliminating a load.

llvm-svn: 41081
 2007-08-14 18:33:27 +00:00
Owen Anderson
d9a7b61a64 Be more aggressive in pruning unnecessary PHI nodes when doing PHI construction. 
llvm-svn: 41080
 2007-08-14 18:16:29 +00:00
Owen Anderson
c855195b2f Make GVN iterative. 
llvm-svn: 41078
 2007-08-14 18:04:11 +00:00
Owen Anderson
8d15350c4e Fix a case where GVN was failing to return true when it had, in fact, modified 
the function.

llvm-svn: 41077
 2007-08-14 17:59:48 +00:00
Devang Patel
5d8b2b3293 Handle last value assignments. 
llvm-svn: 41063
 2007-08-14 01:30:57 +00:00
Devang Patel
55b6a8f212 StartValue is already calculated. 
llvm-svn: 41062
 2007-08-14 00:15:45 +00:00
Devang Patel
762259ba73 Preserve simple analysis. 
llvm-svn: 41054
 2007-08-13 22:22:13 +00:00
Devang Patel
e3ea62e49a Preserve dominator info. 
llvm-svn: 41053
 2007-08-13 22:13:24 +00:00
Devang Patel
d1d0316041 If NewBB dominates DestBB then DestBB is not part of NewBB's dominance frontier. 
llvm-svn: 41051
 2007-08-13 21:59:17 +00:00
Devang Patel
63d1affed8 Split loops and do CFG cleanup. 
llvm-svn: 41029
 2007-08-12 07:02:51 +00:00
Reid Spencer
c71871ba30 Remove unused variables. 
llvm-svn: 41028
 2007-08-12 04:45:36 +00:00
Chris Lattner
50f25115cd Transform a load from an undef/zero global into an undef/global even if we 
have complex pointer manipulation going on.  This allows us to compile
stuff like this:

__m128i foo(__m128i x){
                static const unsigned int c_0[4] = { 0, 0, 0, 0 };
                __m128i v_Zero = _mm_loadu_si128((__m128i*)c_0);
                x  = _mm_unpacklo_epi8(x,  v_Zero);
                return x;
}

into:

_foo:
        xorps   %xmm1, %xmm1
        punpcklbw       %xmm1, %xmm0
        ret

llvm-svn: 41022
 2007-08-11 18:48:48 +00:00
Devang Patel
c8cff19c2e Clone loop. 
llvm-svn: 40998
 2007-08-10 18:07:13 +00:00
Devang Patel
d412a2a0ed Add utility to clone loops. 
llvm-svn: 40997
 2007-08-10 17:59:47 +00:00
Devang Patel
b1160475fd Remove unncessary duplication. 
llvm-svn: 40979
 2007-08-10 00:59:03 +00:00
Devang Patel
23c5e2dcd3 Calculate exit and start value of true loop and false loop respectively. 
llvm-svn: 40978
 2007-08-10 00:53:35 +00:00
Devang Patel
51da0a465a ExitCondition and Induction variable are loop constraints 
not split condition constraints.

llvm-svn: 40977
 2007-08-10 00:33:50 +00:00
Chris Lattner
3548932573 when we see a unaligned load from an insufficiently aligned global or 
alloca, increase the alignment of the load, turning it into an aligned load.

This allows us to compile:

#include <xmmintrin.h>
__m128i foo(__m128i x){
 static const unsigned int c_0[4] = { 0, 0, 0, 0 };
	  __m128i v_Zero = _mm_loadu_si128((__m128i*)c_0);
  x  = _mm_unpacklo_epi8(x,  v_Zero);
  return x;
}

into:

_foo:
	punpcklbw	_c_0.5944, %xmm0
	ret
	.data
	.lcomm	_c_0.5944,16,4		# c_0.5944

instead of:

_foo:
	movdqu	_c_0.5944, %xmm1
	punpcklbw	%xmm1, %xmm0
	ret
	.data
	.lcomm	_c_0.5944,16,2		# c_0.5944

llvm-svn: 40971
 2007-08-09 19:05:49 +00:00
Owen Anderson
3eba1e8f5c Make NonLocal and None const in the right way. :-) 
llvm-svn: 40961
 2007-08-09 04:42:44 +00:00
Devang Patel
652613b1db Traverse loop blocks' terminators to find split candidates. 
llvm-svn: 40960
 2007-08-09 01:39:01 +00:00
Devang Patel
30bf54b9d3 Add cost analysis. 
llvm-svn: 40952
 2007-08-08 22:25:28 +00:00
Devang Patel
ed9b08c44f Preserve dom info while processing one iteration loop. 
llvm-svn: 40947
 2007-08-08 21:39:47 +00:00
Owen Anderson
f988c3ee5c Change the None and NonLocal markers in memdep to be const. 
llvm-svn: 40946
 2007-08-08 21:39:39 +00:00
Devang Patel
a74e533c5e Clear split info. 
llvm-svn: 40944
 2007-08-08 21:18:27 +00:00
Devang Patel
4bd07b86ae Handle multiple split conditions. 
llvm-svn: 40941
 2007-08-08 21:02:17 +00:00
Owen Anderson
04ba98d0f5 Global values also don't undead-ify pointers in our dead alloca's set. 
llvm-svn: 40936
 2007-08-08 19:12:31 +00:00
Owen Anderson
fd772509e9 Make handleEndBlock significantly faster with one trivial improvement, 
and one hack to avoid hitting a bad case when the alias analysis is imprecise.

llvm-svn: 40935
 2007-08-08 18:38:28 +00:00
Owen Anderson
930610cceb Small improvement: if a function doesn't access memory, we don't need to scan 
it for potentially undeading pointers.

llvm-svn: 40933
 2007-08-08 17:58:56 +00:00
Owen Anderson
ecd9348bd6 Add some comments, remove a dead argument, and simplify some control flow. 
No functionality change.

llvm-svn: 40932
 2007-08-08 17:50:09 +00:00
Owen Anderson
02298f7388 A few more small cleanups. 
llvm-svn: 40922
 2007-08-08 06:06:02 +00:00
Owen Anderson
a9facda8db First round of cleanups from Chris' feedback. 
llvm-svn: 40919
 2007-08-08 04:52:29 +00:00
Devang Patel
62f8bf41c3 Embrace patch review feedback. 
llvm-svn: 40915
 2007-08-08 01:51:27 +00:00
Devang Patel
08504a95b0 Fix new compare instruction's signness. Caught by Chris during review. 
llvm-svn: 40912
 2007-08-07 23:17:52 +00:00
Owen Anderson
2c98f8ee3c Don't insert nearly as many redundant phi nodes. 
llvm-svn: 40909
 2007-08-07 23:12:31 +00:00
Devang Patel
92d6834fd7 Use eraseFromParent(). 
llvm-svn: 40903
 2007-08-07 17:45:35 +00:00
David Greene
310b0d7e39 Fix comment typo 
llvm-svn: 40898
 2007-08-07 16:52:03 +00:00
David Greene
7eea029403 Fix GLIBCXX_DEBUG error triggered by incrementing erased iterator. 
llvm-svn: 40897
 2007-08-07 16:44:38 +00:00
Devang Patel
228dc09ff6 Begin loop index split pass. 
llvm-svn: 40883
 2007-08-07 00:25:56 +00:00
Nick Lewycky
34cf98c558 It's safe to fold not of fcmp. 
llvm-svn: 40870
 2007-08-06 20:04:16 +00:00
David Greene
02ac5cfce9 Make this code more efficient. 
llvm-svn: 40861
 2007-08-06 15:09:17 +00:00
Chris Lattner
bf64e878e6 remove some dead lines 
llvm-svn: 40859
 2007-08-06 06:21:06 +00:00
Reid Spencer
ac9262072f Silence some warnings from doxygen about @param argument name not matching the 
actual argument name of the documented function.

llvm-svn: 40851
 2007-08-05 19:35:22 +00:00
Chris Lattner
6d8e77a703 at the end of instcombine, explicitly clear WorklistMap. 
This shrinks it down to something small.  On the testcase
from PR1432, this speeds up instcombine from 0.7959s to 0.5000s,
(59%)

llvm-svn: 40840
 2007-08-05 08:47:58 +00:00
Chris Lattner
e562e9bdb0 rewrite the code used to construct pruned SSA form with the IDF method. 
In the old way, we computed and inserted phi nodes for the whole IDF of 
the definitions of the alloca, then computed which ones were dead and
removed them.

In the new method, we first compute the region where the value is live,
and use that information to only insert phi nodes that are live.  This
eliminates the need to compute liveness later, and stops the algorithm
from inserting a bunch of phis which it then later removes.

This speeds up the testcase in PR1432 from 2.00s to 0.15s (14x) in a
release build and 6.84s->0.50s (14x) in a debug build.

llvm-svn: 40825
 2007-08-04 22:50:14 +00:00
Chris Lattner
b7d4ef6ca6 Factor out a whole bunch of code into it's own method. 
llvm-svn: 40824
 2007-08-04 21:14:29 +00:00
Chris Lattner
d4a88d77d4 Use getNumPreds(BB) instead of computing them manually. This is a very small but 
measurable speedup.

llvm-svn: 40823
 2007-08-04 21:06:15 +00:00
Chris Lattner
6b9dca62dd Change the rename pass to be "tail recursive", only adding N-1 successors 
to the worklist, and handling the last one with a 'tail call'.  This speeds
up PR1432 from 2.0578s to 2.0012s (2.8%)

llvm-svn: 40822
 2007-08-04 20:40:27 +00:00
Chris Lattner
c1d2c2bdc8 cache computation of #preds for a BB. This speeds up 
mem2reg from 2.0742->2.0522s on PR1432.

llvm-svn: 40821
 2007-08-04 20:24:50 +00:00
Chris Lattner
8335a86536 reserve operand space for phi nodes when we insert them. 
llvm-svn: 40820
 2007-08-04 20:14:34 +00:00
Chris Lattner
32d9e4ba5c use continue to avoid nesting, no functionality change. 
llvm-svn: 40819
 2007-08-04 20:07:06 +00:00
Chris Lattner
a97ceae263 Promoting allocas with the 'single store' fastpath is 
faster than with the 'local to a block' fastpath.  This speeds
up PR1432 from 2.1232 to 2.0686s (2.6%)

llvm-svn: 40818
 2007-08-04 20:03:23 +00:00
Chris Lattner
479e3fa267 When PromoteLocallyUsedAllocas promoted allocas, it didn't remember 
to increment NumLocalPromoted, and didn't actually delete the
dead alloca, leading to an extra iteration of mem2reg.

llvm-svn: 40817
 2007-08-04 20:01:43 +00:00
Chris Lattner
bd506a8e12 std::map -> DenseMap 
llvm-svn: 40816
 2007-08-04 19:52:20 +00:00
Nick Lewycky
4e96222245 Clean up comments, fix up some confusing code logic. 
Predsimplify fails llvm-gcc bootstrap.

llvm-svn: 40815
 2007-08-04 18:45:32 +00:00
Chris Lattner
9748fa5c6f fix a logic bug where we wouldn't promote single store allocas if the 
stored value was a non-instruction value.  Doh.

This increase the # single store allocas from 8982 to 9026, and
speeds up mem2reg on the testcase in PR1432 from 2.17 to 2.13s.

llvm-svn: 40813
 2007-08-04 02:45:02 +00:00
Chris Lattner
3f971fdbd5 When we do the single-store optimization, delete both the store 
and the alloca so they don't get reprocessed.

This speeds up PR1432 from 2.20s to 2.17s.

llvm-svn: 40812
 2007-08-04 02:38:38 +00:00
Chris Lattner
c38b2a2473 Three improvements: 
1. Check for revisiting a block before checking domination, which is faster.
  2. If the stored value isn't an instruction, we don't have to check for domination.
  3. If we have a value used in the same block more than once, make sure to remove the
     block from the UsingBlocks vector.  Not doing so forces us to go through the slow
     path for the alloca.

The combination of these improvements increases the number of allocas on the fastpath
from 8935 to 8982 on PR1432.  This speeds it up from 2.90s to 2.20s (31%)

llvm-svn: 40811
 2007-08-04 02:32:22 +00:00
Chris Lattner
fe6a3e2fb4 switch from using a std::set to using a SmallPtrSet. This speeds up the 
testcase in PR1432 from 6.33s to 2.90s (2.22x)

llvm-svn: 40810
 2007-08-04 02:21:22 +00:00
Chris Lattner
9b45ad1f5c In mem2reg, when handling the single-store case, make sure to remove 
a using block from the list if we handle it.  Not doing this caused us
to not be able to promote (with the fast path) allocas which have uses (whoops).

This increases the # allocas hitting this fastpath from 4042 to 8935 on the
testcase in PR1432, speeding up mem2reg by 2.6x

llvm-svn: 40809
 2007-08-04 02:15:24 +00:00
Chandler Carruth
00e56b0e81 This is the patch to provide clean intrinsic function overloading support in LLVM. It cleans up the intrinsic definitions and generally smooths the process for more complicated intrinsic writing. It will be used by the upcoming atomic intrinsics as well as vector and float intrinsics in the future. 
This also changes the syntax for llvm.bswap, llvm.part.set, llvm.part.select, and llvm.ct* intrinsics. They are automatically upgraded by both the LLVM ASM reader and the bitcode reader. The test cases have been updated, with special tests added to ensure the automatic upgrading is supported.

llvm-svn: 40807
 2007-08-04 01:51:18 +00:00
Chris Lattner
b5af2cf90d split rewriting of single-store allocas into its own 
method.

llvm-svn: 40806
 2007-08-04 01:47:41 +00:00
Chris Lattner
f8b22a3568 refactor some code to shrink PromoteMem2Reg::run a bit 
llvm-svn: 40805
 2007-08-04 01:41:18 +00:00
Chris Lattner
2d4d557c80 add a typedef, no other change. 
llvm-svn: 40804
 2007-08-04 01:19:38 +00:00
Chris Lattner
65181deba3 avoid an unneeded vector copy. This speeds up mem2reg on the testcase 
in PR1432 by 6%

llvm-svn: 40803
 2007-08-04 01:07:49 +00:00
Chris Lattner
34cf111957 make RenamePassWorkList a local var instead of an ivar. 
llvm-svn: 40802
 2007-08-04 01:04:40 +00:00
Owen Anderson
891f5b4d28 Fix a subtle miscompilation. This allows 197.parser to be compiled correctly. 
llvm-svn: 40791
 2007-08-03 19:59:35 +00:00
Owen Anderson
d1063b7a3c Fix a subtle iterator invalidation bug in a recursive algorithm. 
llvm-svn: 40776
 2007-08-03 11:03:26 +00:00
Chris Lattner
cf6dd53ad8 Fix an accidental commit. 
llvm-svn: 40758
 2007-08-02 21:33:36 +00:00
Owen Anderson
414247c075 Fix 80 col. violations. 
llvm-svn: 40751
 2007-08-02 18:20:52 +00:00
Owen Anderson
ad74eeed3d Fix 80 col. violations. 
llvm-svn: 40750
 2007-08-02 18:16:06 +00:00
Owen Anderson
ae769ac824 Fix 80 col. violations. 
llvm-svn: 40749
 2007-08-02 18:11:11 +00:00
Owen Anderson
d617e4c963 Fix a bug that was causing several miscompilations on SPEC. 
llvm-svn: 40746
 2007-08-02 17:56:05 +00:00
Chris Lattner
5ca7348fc4 Replacing a cast with another one does not reduce the number of 
casts in the input.

llvm-svn: 40741
 2007-08-02 17:23:38 +00:00
Chris Lattner
7c6e8f735f Disable an xform that causes an infinite loop. This fixes PR1594 
llvm-svn: 40739
 2007-08-02 16:56:32 +00:00
Chris Lattner
25a8bfdedb wrap some long lines. Major offenders that are left include 
gvn, gvnpre, dse, and predsimplify.  To see these, use:

  make check-line-length

llvm-svn: 40738
 2007-08-02 16:53:43 +00:00
Devang Patel
937b07fb5e Update dominator info for the middle blocks created while spliting 
exit edge to preserve LCSSA.

Fix dominance frontier update during loop unswitch. This fixes PR 1589, again

llvm-svn: 40737
 2007-08-02 15:25:57 +00:00
Chris Lattner
0111f62050 Enhance instcombine to be more aggressive about folding casts of 
operations of casts.  This implements InstCombine/zext-fold.ll

llvm-svn: 40726
 2007-08-02 06:11:14 +00:00
Chris Lattner
2cacb6cc56 Fix PR1575 and test/Transforms/CondProp/2007-08-01-InvalidRead.ll 
llvm-svn: 40720
 2007-08-02 04:47:05 +00:00
Devang Patel
f21f509c2c Undo previous check-in. 
llvm-svn: 40698
 2007-08-01 23:24:50 +00:00
Devang Patel
51c61e730a Update dominator info for the middle blocks created while spliting 
exit edge to preserve LCSSA.

Fix dominance frontier update during loop unswitch. This fixes PR 1589.

llvm-svn: 40695
 2007-08-01 22:23:50 +00:00
Owen Anderson
7028dfaf9d Make non-local memdep not be recursive, and fix a bug on 403.gcc that this exposed. 
llvm-svn: 40692
 2007-08-01 22:01:54 +00:00