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

3480 Commits

Author SHA1 Message Date
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