- Aug 06, 2010
-
-
Owen Anderson authored
ID member as the sole unique type identifier. Clean up APIs related to this change. llvm-svn: 110396
-
- Jul 28, 2010
-
-
Gabor Greif authored
llvm-svn: 109589
-
- Jul 27, 2010
-
-
Gabor Greif authored
llvm-svn: 109506
-
- Jul 26, 2010
-
-
Dan Gohman authored
dependence on DominanceFrontier. Instead, add an explicit DominanceFrontier pass in StandardPasses.h to ensure that it gets scheduled at the right time. Declare that loop unrolling preserves ScalarEvolution, and shuffle some getAnalysisUsages. This eliminates one LoopSimplify and one LCCSA run in the standard compile opts sequence. llvm-svn: 109413
-
Dan Gohman authored
llvm-svn: 109412
-
- Jul 24, 2010
-
-
Nick Lewycky authored
build of llvm-gcc. llvm-svn: 109355
-
Nick Lewycky authored
it needs to be mapped to refer to the function in the new module, not the old one. Fixes PR7700. llvm-svn: 109353
-
- Jul 22, 2010
-
-
Devang Patel authored
llvm-svn: 109132
-
Gabor Greif authored
llvm-svn: 109122
-
Devang Patel authored
A non function local MDNode can have an operand which is cloned by MapValue(). llvm-svn: 109117
-
Gabor Greif authored
llvm-svn: 109103
-
Gabor Greif authored
llvm-svn: 109098
-
Gabor Greif authored
llvm-svn: 109092
-
Dan Gohman authored
for creating and populating NamedMDNodes. llvm-svn: 109061
-
Owen Anderson authored
llvm-svn: 109045
-
- Jul 21, 2010
-
-
Dan Gohman authored
llvm-svn: 108967
-
Dan Gohman authored
llvm-svn: 108961
-
- Jul 16, 2010
-
-
Dan Gohman authored
a redundant loopsimplify run from the default -O2 sequence. llvm-svn: 108539
-
Gabor Greif authored
llvm-svn: 108522
-
- Jul 15, 2010
-
-
Owen Anderson authored
llvm-svn: 108427
-
Chris Lattner authored
it *changing* the things it replaces, not just causing them to drop to null. There is no functionality change yet, but this is required for a subsequent patch. llvm-svn: 108414
-
- Jul 14, 2010
-
-
Owen Anderson authored
"bonus" instruction to be speculatively executed. Add a heuristic to ensure we're not tripping up out-of-order execution by checking that this bonus instruction only uses values that were already guaranteed to be available. This allows us to eliminate the short circuit in (x&1)&&(x&2). llvm-svn: 108351
-
- Jul 12, 2010
-
-
Gabor Greif authored
llvm-svn: 108133
-
Gabor Greif authored
llvm-svn: 108132
-
- Jul 09, 2010
-
-
Gabor Greif authored
llvm-svn: 107984
-
Gabor Greif authored
llvm-svn: 107983
-
Gabor Greif authored
llvm-svn: 107981
-
Gabor Greif authored
llvm-svn: 107975
-
Gabor Greif authored
llvm-svn: 107974
-
Gabor Greif authored
llvm-svn: 107968
-
Gabor Greif authored
llvm-svn: 107966
-
Gabor Greif authored
llvm-svn: 107965
-
- Jul 02, 2010
-
-
Devang Patel authored
llvm-svn: 107516
-
- Jul 01, 2010
-
-
Jim Grosbach authored
llvm-svn: 107335
-
- Jun 30, 2010
-
-
Gabor Greif authored
llvm-svn: 107269
-
- Jun 28, 2010
-
-
Gabor Greif authored
llvm-svn: 107003
-
Gabor Greif authored
llvm-svn: 107002
-
- Jun 25, 2010
-
-
Dale Johannesen authored
for an "i" constraint should get lowered; PR 6309. While this argument was passed around a lot, this is the only place it was used, so it goes away from a lot of other places. llvm-svn: 106893
-
Gabor Greif authored
llvm-svn: 106825
-
Gabor Greif authored
llvm-svn: 106824
-