| Commit message (Collapse) | Author | Age | Files | Lines |
| ... | |
| |
|
|
|
|
| |
regressing code quality.
llvm-svn: 122887
|
| |
|
|
| |
llvm-svn: 122886
|
| |
|
|
|
|
| |
code.
llvm-svn: 122885
|
| |
|
|
| |
llvm-svn: 122884
|
| |
|
|
| |
llvm-svn: 122883
|
| |
|
|
| |
llvm-svn: 122882
|
| |
|
|
| |
llvm-svn: 122881
|
| |
|
|
|
|
| |
entities easier.
llvm-svn: 122880
|
| |
|
|
| |
llvm-svn: 122879
|
| |
|
|
| |
llvm-svn: 122876
|
| |
|
|
|
|
| |
directory name on Unix-like systems.
llvm-svn: 122873
|
| |
|
|
|
|
|
| |
step is to only process instructions in subloops if they have been modified by
an earlier simplification.
llvm-svn: 122869
|
| |
|
|
|
|
|
|
|
|
| |
skipping them, but it should probably use a worklist and only revisit those
instructions in subloops that have actually changed. It should probably also
use a worklist after the first iteration like instsimplify now does. Regardless,
it's only 0.3% of opt -O2 time on 403.gcc if it replaces the instcombine placed
in the middle of the loop passes.
llvm-svn: 122868
|
| |
|
|
|
|
|
|
| |
It forms memset and memcpy's, and will someday form popcount and
other stuff. All of this is bad when compiling the implementation
of memset, memcpy, popcount, etc.
llvm-svn: 122854
|
| |
|
|
| |
llvm-svn: 122849
|
| |
|
|
|
|
|
|
|
| |
this should allow us to insert
fewer things into the value numbering maps, but any speedup is beneath the noise threshold on my machine
on 403.gcc.
llvm-svn: 122844
|
| |
|
|
|
|
| |
bundles in the pass.
llvm-svn: 122833
|
| |
|
|
|
|
|
|
|
|
| |
The analysis will be needed by both the greedy register allocator and the
X86FloatingPoint pass. It only needs to be computed once when the CFG doesn't
change.
This pass is very fast, usually showing up as 0.0% wall time.
llvm-svn: 122832
|
| |
|
|
|
|
| |
warning is overzealous but gcc is what it is.)
llvm-svn: 122829
|
| |
|
|
| |
llvm-svn: 122828
|
| |
|
|
| |
llvm-svn: 122827
|
| |
|
|
| |
llvm-svn: 122826
|
| |
|
|
|
|
|
|
| |
the "leader table", and
rename methods to make it much more clear what they're doing.
llvm-svn: 122823
|
| |
|
|
|
|
| |
in a corner case.
llvm-svn: 122822
|
| |
|
|
|
|
|
|
|
|
| |
case where a static caller is itself inlined everywhere else, and
thus may go away if it doesn't get too big due to inlining other
things into it. If there are references to the caller other than
calls, it will not be removed; account for this.
This results in same-day completion of the case in PR8853.
llvm-svn: 122821
|
| |
|
|
|
|
|
|
|
| |
value number for them. This
avoids adding them to the various value numbering tables, resulting in a minor (~3%) speedup for GVN
on 40.gcc.
llvm-svn: 122819
|
| |
|
|
| |
llvm-svn: 122817
|
| |
|
|
|
|
| |
reports prettier.
llvm-svn: 122816
|
| |
|
|
| |
llvm-svn: 122815
|
| |
|
|
|
|
| |
ashr's with huge shift amounts, PR8896
llvm-svn: 122814
|
| |
|
|
| |
llvm-svn: 122812
|
| |
|
|
|
|
| |
makes getLeader() nonrecursive.
llvm-svn: 122811
|
| |
|
|
|
|
| |
This ensures that always the recently compiled tools are picked for testing.
llvm-svn: 122810
|
| |
|
|
| |
llvm-svn: 122809
|
| |
|
|
| |
llvm-svn: 122808
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
when safe.
The testcase is basically this nested loop:
void foo(char *X) {
for (int i = 0; i != 100; ++i)
for (int j = 0; j != 100; ++j)
X[j+i*100] = 0;
}
which gets turned into a single memset now. clang -O3 doesn't optimize
this yet though due to a phase ordering issue I haven't analyzed yet.
llvm-svn: 122806
|
| |
|
|
|
|
|
|
| |
instruction *after* the store. The store will always be deleted
if the transformation kicks in, so we'd do an N^2 scan of every
loop block. Whoops.
llvm-svn: 122805
|
| |
|
|
|
|
| |
spent in StrongPHIElimination on 403.gcc.
llvm-svn: 122803
|
| |
|
|
|
|
| |
CodeGenPrepare (which is the default behavior).
llvm-svn: 122801
|
| |
|
|
|
|
| |
tests use absolute paths to clang.
llvm-svn: 122796
|
| |
|
|
|
|
| |
static constructors.
llvm-svn: 122795
|
| |
|
|
| |
llvm-svn: 122794
|
| |
|
|
|
|
|
|
|
|
|
|
| |
FunctionPass. It probably doesn't have a reason to be a LoopPass, as it will
probably drop the simple fixed point and either use RPO iteration or Duncan's
approach in instsimplify of only revisiting instructions that have changed.
The next step is to preserve LoopSimplify. This looks like it won't be too hard,
although the pass manager doesn't actually seem to respect when non-loop passes
claim to preserve LCSSA or LoopSimplify. This will have to be fixed.
llvm-svn: 122791
|
| |
|
|
|
|
|
| |
stop setting NSW: signed overflow is possible. Thanks to Dan
for pointing these out.
llvm-svn: 122790
|
| |
|
|
| |
llvm-svn: 122789
|
| |
|
|
| |
llvm-svn: 122788
|
| |
|
|
|
|
|
|
| |
PHIs of GEPs. For the moment,
have GlobalsModRef handle this conservatively by simply removing the value from its maps.
llvm-svn: 122787
|
| |
|
|
| |
llvm-svn: 122786
|
| |
|
|
|
|
|
| |
invalidated by stores, so they can be handled as 'simple'
operations.
llvm-svn: 122785
|
| |
|
|
|
|
|
|
|
|
|
| |
prologue and epilogue if the adjustment is 8. Similarly, use pushl / popl if
the adjustment is 4 in 32-bit mode.
In the epilogue, takes care to pop to a caller-saved register that's not live
at the exit (either return or tailcall instruction).
rdar://8771137
llvm-svn: 122783
|