"compiler-rt/lib/git@repo.hca.bsc.es:rferrer/llvm-epi-0.8.git" did not exist on "32956d651a1f1d9d01600a893bdcea74e05ad646"
- Nov 02, 2009
-
-
Chris Lattner authored
llvm-svn: 85786
-
- Oct 25, 2009
-
-
Nick Lewycky authored
VISIBILITY_HIDDEN removal. llvm-svn: 85043
-
Nick Lewycky authored
Chris claims we should never have visibility_hidden inside any .cpp file but that's still not true even after this commit. llvm-svn: 85042
-
- Sep 22, 2009
-
-
Chris Lattner authored
llvm-svn: 82488
-
- Sep 03, 2009
-
-
Dan Gohman authored
instead of a bool argument, and to do the dominator check itself. This makes it eaiser to use when DominatorTree information is available. llvm-svn: 80920
-
- Aug 07, 2009
-
-
Dan Gohman authored
llvm-svn: 78363
-
- Jul 31, 2009
-
-
Owen Anderson authored
llvm-svn: 77635
-
- Jul 30, 2009
-
-
Daniel Dunbar authored
llvm-svn: 77605
-
Daniel Dunbar authored
a Twine, e.g., for names). - I am a little ambivalent about this; we don't want the string conversion of utostr, but using overload '+' mixed with string and integer arguments is sketchy. On the other hand, this particular usage is something of an idiom. llvm-svn: 77579
-
- Jul 22, 2009
-
-
Owen Anderson authored
llvm-svn: 76702
-
- Jul 07, 2009
-
-
Owen Anderson authored
llvm-svn: 74878
-
- Jul 06, 2009
-
-
Owen Anderson authored
llvm-svn: 74807
-
- May 06, 2009
-
-
Dan Gohman authored
separate back() and pop_back() calls. llvm-svn: 71089
-
- Apr 16, 2009
-
-
Eli Friedman authored
incoming edges for a block with many predecessors. llvm-svn: 69312
-
- Mar 06, 2009
-
-
Dale Johannesen authored
debug intrinsics correctly. llvm-svn: 66225
-
- Nov 17, 2008
-
-
Devang Patel authored
llvm-svn: 59454
-
- Nov 08, 2008
-
-
Daniel Dunbar authored
promotion. - Eliminate uses after free and simplify tests. Devang: Please check that this is still doing what you intended. llvm-svn: 58887
-
- Nov 07, 2008
-
-
Bill Wendling authored
llvm-svn: 58830
-
Devang Patel authored
llvm-svn: 58826
-
- Oct 27, 2008
-
-
Chris Lattner authored
LargeBlockInfo, we can now dramatically simplify their implementation and speed them up at the same time. Now the code has time proportional to the number of uses of the alloca, not the size of the block. This also eliminates code that tried to batch up different allocas which are used in the same blocks, and eliminates the 'retry list' logic which was baroque and no unneccesary. In addition to being a speedup for crazy cases, this is also a nice cleanup: PromoteMemoryToRegister.cpp | 270 +++++++++++++++----------------------------- 1 file changed, 96 insertions(+), 174 deletions(-) llvm-svn: 58229
-
Chris Lattner authored
a trivial dense map. Use this in RewriteSingleStoreAlloca to avoid aggressively rescanning blocks over and over again. This fixes PR2925, speeding up mem2reg on the testcase in that bug from 4.56s to 0.02s in a debug build on my machine. llvm-svn: 58227
-
- Apr 06, 2008
-
-
Gabor Greif authored
Specifically, introduction of XXX::Create methods for Users that have a potentially variable number of Uses. llvm-svn: 49277
-
- Mar 13, 2008
-
-
Nick Lewycky authored
successors. This makes it support nounwind. llvm-svn: 48320
-
- Feb 05, 2008
-
-
Chris Lattner authored
check more intelligent. This speeds up mem2reg from 5.29s to 0.79s on a synthetic testcase with tons of predecessors and phi nodes. llvm-svn: 46767
-
- Dec 29, 2007
-
-
Chris Lattner authored
llvm-svn: 45418
-
- Nov 04, 2007
-
-
Gordon Henriksen authored
Also cleaned up some comments in source files. llvm-svn: 43674
-
- Sep 17, 2007
-
-
Chris Lattner authored
Add a new DenseMapInfo::isEqual method to allow clients to redefine the equality predicate used when probing the hash table. llvm-svn: 42042
-
- Aug 26, 2007
-
-
Anton Korobeynikov authored
Don't promote volatile loads/stores. This is needed (for example) to handle setjmp/longjmp properly. This fixes PR1520. llvm-svn: 41461
-
- Aug 05, 2007
-
-
Chris Lattner authored
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
-
- Aug 04, 2007
-
-
Chris Lattner authored
llvm-svn: 40824
-
Chris Lattner authored
measurable speedup. llvm-svn: 40823
-
Chris Lattner authored
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
-
Chris Lattner authored
mem2reg from 2.0742->2.0522s on PR1432. llvm-svn: 40821
-
Chris Lattner authored
llvm-svn: 40820
-
Chris Lattner authored
llvm-svn: 40819
-
Chris Lattner authored
faster than with the 'local to a block' fastpath. This speeds up PR1432 from 2.1232 to 2.0686s (2.6%) llvm-svn: 40818
-
Chris Lattner authored
to increment NumLocalPromoted, and didn't actually delete the dead alloca, leading to an extra iteration of mem2reg. llvm-svn: 40817
-
Chris Lattner authored
llvm-svn: 40816
-
Chris Lattner authored
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
-
Chris Lattner authored
and the alloca so they don't get reprocessed. This speeds up PR1432 from 2.20s to 2.17s. llvm-svn: 40812
-