maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity
38,189 Commits 23 Branches 0 Tags 2.2 GiB
Commit Graph

3665 Commits

Author SHA1 Message Date
Devang Patel 69a55a38ed Relax loop ExitCondition predicate restriction. 
llvm-svn: 42122
 2007-09-19 00:28:47 +00:00
Devang Patel 455a53b7db 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 4c238c451f Bail out early, before modifying anything. 
llvm-svn: 42120
 2007-09-19 00:11:01 +00:00
Devang Patel 31f2c8592c Work is incomplete. Loop is not modified at all right now. 
llvm-svn: 42119
 2007-09-19 00:08:13 +00:00
Devang Patel fcda998ab2 Fix PR1657 
llvm-svn: 42075
 2007-09-18 01:54:42 +00:00
Devang Patel 267c07b51f 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 712dbe9d13 Skeleton for transformations to truncate loop's iteration space. 
llvm-svn: 42054
 2007-09-17 20:39:48 +00:00
Devang Patel 9d1af9b63d Fix comment. 
llvm-svn: 42048
 2007-09-17 20:07:40 +00:00
Chris Lattner 0625bd6472 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 2ac2652779 Instcombine x-((x/y)*y) into a remainder operator. 
llvm-svn: 42035
 2007-09-17 17:31:57 +00:00
Duncan Sands 6d5da71288 Factor the trampoline transformation into a subroutine. 
llvm-svn: 42021
 2007-09-17 10:26:40 +00:00
Owen Anderson 4cd516b50b Be more careful when constant-folding PHI nodes. 
llvm-svn: 41998
 2007-09-16 08:04:16 +00:00
Owen Anderson 8d0cb881e5 Remove RLE. It is subsumed by GVN. 
llvm-svn: 41968
 2007-09-14 22:33:52 +00:00
Dale Johannesen 98d3a08d8f 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 5d13fb538f 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 d9111b88d1 silence a bogus gcc warning. 
llvm-svn: 41949
 2007-09-14 03:07:24 +00:00
Bill Wendling 264d4813c7 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 011f91b5b2 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 ba98f89388 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 f315d4f1a7 refactor some code, no functionality change. On the path to PR1639 
llvm-svn: 41929
 2007-09-13 17:29:05 +00:00
Chris Lattner 6eed0e7366 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 2d2892ee6e 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 7b412cb823 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 9204663bcb Turn calls to trampolines into calls to the underlying 
nested function.

llvm-svn: 41844
 2007-09-11 14:35:41 +00:00
Devang Patel 7ed6eb8992 Avoid negative logic. 
llvm-svn: 41829
 2007-09-11 01:10:45 +00:00
Devang Patel 8c95373ced Refactor code into a separate method. 
llvm-svn: 41826
 2007-09-11 00:42:56 +00:00
Devang Patel d67479b6ee Clear split info object. 
llvm-svn: 41823
 2007-09-11 00:23:56 +00:00
Devang Patel a28a7f1b2d Split condition does not have to be ICmpInst in all cases. 
llvm-svn: 41822
 2007-09-11 00:12:56 +00:00
Devang Patel f4202e91f8 Check all terminators inside loop. 
llvm-svn: 41821
 2007-09-10 23:57:58 +00:00
Chris Lattner e804567cd8 remove some dead code, this is handled by constant folding. 
llvm-svn: 41819
 2007-09-10 23:46:29 +00:00
Devang Patel 2181b8e86a Swap exit condition operands if it works. 
llvm-svn: 41817
 2007-09-10 23:34:06 +00:00
Chris Lattner c75cbe6473 Prevent tailcallelim from breaking "recursive" calls to builtins. 
llvm-svn: 41804
 2007-09-10 20:58:55 +00:00
Devang Patel f8ab0a9acc Filter exit conditions which are not yet handled. 
llvm-svn: 41800
 2007-09-10 18:33:42 +00:00
Devang Patel d7409fdce5 Require SCEV before LCSSA. 
llvm-svn: 41798
 2007-09-10 18:08:23 +00:00
Chris Lattner 85a51e0060 Don't zap back to back volatile load/stores 
llvm-svn: 41759
 2007-09-07 05:33:03 +00:00
Dale Johannesen bed9dc423c 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 0c5c47944a Use isTrueWhenEqual. Thanks Chris! 
llvm-svn: 41741
 2007-09-06 02:40:25 +00:00
Nick Lewycky b0b066eaaa 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 2320323647 Forgot to obey 80 column rule. Fixing that. 
llvm-svn: 41725
 2007-09-05 20:36:41 +00:00
Chuck Rose III e58572233d 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 f6ef552f3d Insert cloned loop basic blocks before original loop header. 
llvm-svn: 41713
 2007-09-04 20:46:35 +00:00
David Greene c656cbb8c2 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 35322d745c Silence warning while compiling with gcc 4.2 
llvm-svn: 41676
 2007-09-02 22:11:14 +00:00
Evan Cheng ffac17a223 Fix a gcroot lowering bug. 
llvm-svn: 41668
 2007-09-01 02:00:51 +00:00
Chris Lattner 0e258b8518 Cut off crazy computation. This helps PR1622 slightly. 
llvm-svn: 41522
 2007-08-28 04:23:55 +00:00
Devang Patel d2456a171d Use simpler test to filter loops. 
llvm-svn: 41516
 2007-08-27 21:34:31 +00:00
David Greene 703623d571 Update InvokeInst to work like CallInst 
llvm-svn: 41506
 2007-08-27 19:04:21 +00:00
Dan Gohman 71eaf62e5f 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 24fb6b2f8c 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 2b9ec7ff33 Don't DSe volatile stores. 
llvm-svn: 41456
 2007-08-26 21:14:47 +00:00
Devang Patel 6114751544 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 c1ef32ef3d 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 4e63e1f5b5 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 f5a01bf025 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 4bc9298f2a 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 4be56a5d12 Reject ICMP_NE as index split condition. 
llvm-svn: 41357
 2007-08-24 06:02:25 +00:00
Devang Patel 5e46fac6de Tightenup loop filter. 
llvm-svn: 41356
 2007-08-24 05:36:56 +00:00
Devang Patel 504dc0aaed Remove incomplete cost analysis. 
llvm-svn: 41354
 2007-08-24 05:21:13 +00:00
Chris Lattner b0f158cfdf 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 887db2d832 Remove dead code. 
llvm-svn: 41295
 2007-08-22 21:07:41 +00:00
Devang Patel 6f4f23320d Fix typo. 
llvm-svn: 41292
 2007-08-22 20:55:18 +00:00
Devang Patel 31206b56d5 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 90da534987 Refactor loop condition check in a separate function. 
llvm-svn: 41282
 2007-08-22 18:27:01 +00:00
Devang Patel cd8beb7645 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 a12000d572 Rename bunch of variables. 
llvm-svn: 41250
 2007-08-21 21:12:02 +00:00
Devang Patel f98db5e62a Preserve LCSSA. 
llvm-svn: 41246
 2007-08-21 19:47:46 +00:00
Devang Patel b5933bbbd5 Use SmallVector instead of std::vector. 
llvm-svn: 41207
 2007-08-21 00:31:24 +00:00
Devang Patel 8f4228d619 s/ExitBlock/ExitingBlock/g 
llvm-svn: 41204
 2007-08-20 23:51:18 +00:00
Devang Patel 49c4f9a889 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 c2e2d15f45 Do not split loops rejected by processOneIterationLoop(). 
llvm-svn: 41194
 2007-08-20 20:24:15 +00:00
Nick Lewycky bfa9499a88 Oops, remove assert that wasn't meant to be committed. 
llvm-svn: 41170
 2007-08-18 23:21:28 +00:00
Nick Lewycky 5b5b1ab9e0 Never insert duplicate edges. 
llvm-svn: 41169
 2007-08-18 23:18:03 +00:00
Nick Lewycky a0d49dac26 Typo. 
llvm-svn: 41168
 2007-08-18 15:08:56 +00:00
Devang Patel 1282b6e181 Avoid spliting loops where two split condition branches are not independent. 
llvm-svn: 41148
 2007-08-18 00:00:32 +00:00
Devang Patel d1fcfcc76c 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 f5023a7a84 Factor out some code into a helper function. 
llvm-svn: 41131
 2007-08-16 22:51:56 +00:00
Owen Anderson 221a43604e Add some more comments to GVN. 
llvm-svn: 41129
 2007-08-16 22:02:55 +00:00
Devang Patel 3640e78057 Dominance frontier is now required. 
llvm-svn: 41096
 2007-08-15 03:34:53 +00:00
Devang Patel b81bcbde09 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 0db035567c Remove unneeded header file. 
llvm-svn: 41094
 2007-08-15 03:01:04 +00:00
Devang Patel f55b79fa71 Avoid triangle loops. 
llvm-svn: 41093
 2007-08-15 02:14:55 +00:00
Devang Patel 22c7993ecf Break infinite loop. 
llvm-svn: 41091
 2007-08-14 23:59:17 +00:00
Devang Patel 7cad917160 Avoid nested loops at the moment. 
llvm-svn: 41090
 2007-08-14 23:53:57 +00:00
Devang Patel 33ba97d747 Fix dominance frontier update while removing blocks. 
llvm-svn: 41082
 2007-08-14 18:35:57 +00:00
Owen Anderson bc271a02fd 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 398602a6eb 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 676070d503 Make GVN iterative. 
llvm-svn: 41078
 2007-08-14 18:04:11 +00:00
Owen Anderson a7b220f23a 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 dbe8497d45 Handle last value assignments. 
llvm-svn: 41063
 2007-08-14 01:30:57 +00:00
Devang Patel f74ccbb4e8 StartValue is already calculated. 
llvm-svn: 41062
 2007-08-14 00:15:45 +00:00
Devang Patel 948653915f Preserve simple analysis. 
llvm-svn: 41054
 2007-08-13 22:22:13 +00:00
Devang Patel b8a41bb4f1 Preserve dominator info. 
llvm-svn: 41053
 2007-08-13 22:13:24 +00:00
Devang Patel da48cf40db 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 f258578206 Split loops and do CFG cleanup. 
llvm-svn: 41029
 2007-08-12 07:02:51 +00:00
Reid Spencer 9f90f965de Remove unused variables. 
llvm-svn: 41028
 2007-08-12 04:45:36 +00:00
Chris Lattner 99c8ee2977 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 f417c2cc34 Clone loop. 
llvm-svn: 40998
 2007-08-10 18:07:13 +00:00
Devang Patel aa36a43908 Add utility to clone loops. 
llvm-svn: 40997
 2007-08-10 17:59:47 +00:00
Devang Patel 9a4761464f Remove unncessary duplication. 
llvm-svn: 40979
 2007-08-10 00:59:03 +00:00
Devang Patel 7bdf4531bb 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 67af6cd7ea ExitCondition and Induction variable are loop constraints 
not split condition constraints.

llvm-svn: 40977
 2007-08-10 00:33:50 +00:00
Chris Lattner a8e4b4bc7b 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 9b1cc8cac0 Make NonLocal and None const in the right way. :-) 
llvm-svn: 40961
 2007-08-09 04:42:44 +00:00
Devang Patel 42e3e5bec1 Traverse loop blocks' terminators to find split candidates. 
llvm-svn: 40960
 2007-08-09 01:39:01 +00:00
Devang Patel 0183c797c4 Add cost analysis. 
llvm-svn: 40952
 2007-08-08 22:25:28 +00:00
Devang Patel 0e34ee25ab Preserve dom info while processing one iteration loop. 
llvm-svn: 40947
 2007-08-08 21:39:47 +00:00
Owen Anderson b84d3b1c92 Change the None and NonLocal markers in memdep to be const. 
llvm-svn: 40946
 2007-08-08 21:39:39 +00:00
Devang Patel 8abc5c82b7 Clear split info. 
llvm-svn: 40944
 2007-08-08 21:18:27 +00:00
Devang Patel 593bf9ceb3 Handle multiple split conditions. 
llvm-svn: 40941
 2007-08-08 21:02:17 +00:00
Owen Anderson 680862880d 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 ddf4aee543 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 50df9685b0 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 52aaabf74d 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 b17ab03081 A few more small cleanups. 
llvm-svn: 40922
 2007-08-08 06:06:02 +00:00
Owen Anderson 0aecf0ebef First round of cleanups from Chris' feedback. 
llvm-svn: 40919
 2007-08-08 04:52:29 +00:00
Devang Patel 68de1ae816 Embrace patch review feedback. 
llvm-svn: 40915
 2007-08-08 01:51:27 +00:00
Devang Patel c7e53bdcfd Fix new compare instruction's signness. Caught by Chris during review. 
llvm-svn: 40912
 2007-08-07 23:17:52 +00:00
Owen Anderson 0cc1a76283 Don't insert nearly as many redundant phi nodes. 
llvm-svn: 40909
 2007-08-07 23:12:31 +00:00
Devang Patel 19211b6528 Use eraseFromParent(). 
llvm-svn: 40903
 2007-08-07 17:45:35 +00:00
David Greene bacdbaa0da Fix comment typo 
llvm-svn: 40898
 2007-08-07 16:52:03 +00:00
David Greene 816a190cdf Fix GLIBCXX_DEBUG error triggered by incrementing erased iterator. 
llvm-svn: 40897
 2007-08-07 16:44:38 +00:00
Devang Patel c70106cb30 Begin loop index split pass. 
llvm-svn: 40883
 2007-08-07 00:25:56 +00:00
Nick Lewycky 8052019a20 It's safe to fold not of fcmp. 
llvm-svn: 40870
 2007-08-06 20:04:16 +00:00
David Greene 77b2accbca Make this code more efficient. 
llvm-svn: 40861
 2007-08-06 15:09:17 +00:00
Chris Lattner c7ba225705 remove some dead lines 
llvm-svn: 40859
 2007-08-06 06:21:06 +00:00
Reid Spencer d959cfc882 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 f0da7975ea 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 edce70d2fe 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 d91576b01e 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 4e1b4140eb 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 b6a4ba808b 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 840259c8d3 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 050bac4bed reserve operand space for phi nodes when we insert them. 
llvm-svn: 40820
 2007-08-04 20:14:34 +00:00
Chris Lattner 9318785df5 use continue to avoid nesting, no functionality change. 
llvm-svn: 40819
 2007-08-04 20:07:06 +00:00
Chris Lattner 6b04ecbaf9 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 4a930f9444 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 63c039780c std::map -> DenseMap 
llvm-svn: 40816
 2007-08-04 19:52:20 +00:00
Nick Lewycky 20f0811fc0 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 7d382f7680 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 1b215f0661 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 862f125457 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 ae1e00eb36 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 9181801bb7 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 7132e00de7 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 886a41a007 split rewriting of single-store allocas into its own 
method.

llvm-svn: 40806
 2007-08-04 01:47:41 +00:00
Chris Lattner 3cede09c67 refactor some code to shrink PromoteMem2Reg::run a bit 
llvm-svn: 40805
 2007-08-04 01:41:18 +00:00
Chris Lattner d524537fe9 add a typedef, no other change. 
llvm-svn: 40804
 2007-08-04 01:19:38 +00:00
Chris Lattner df138be527 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 fd838f0770 make RenamePassWorkList a local var instead of an ivar. 
llvm-svn: 40802
 2007-08-04 01:04:40 +00:00
Owen Anderson 2d19aae4ca Fix a subtle miscompilation. This allows 197.parser to be compiled correctly. 
llvm-svn: 40791
 2007-08-03 19:59:35 +00:00