llvm-project/polly/test/DeadCodeElimination
Tobias Grosser 356faa8f09 Dead code elimination: Schedule another approximative step before actual DCE
In 'obsequi' we have a scop in which the current dead code elimination works,
but the generated code is way too complex. To avoid this trouble (and to not
disable the DCE entirely) we add an additional approximative step before
the actual dead code elimination. This should fix one of the two current
nightly-test issues.

Polly could be improved to handle 'obsequi' by teaching it to introduce only a
single parameter for (%1 and zext %1) which halves the number of parameters and
allows polly to derive a simpler representation for the set of live iterations.
However, this needs some time to investigate.

I will commit a test case as soon as we have a reduced one.

llvm-svn: 202010
2014-02-24 08:52:20 +00:00
..
chained_iterations.ll
chained_iterations_2.ll
computeout.ll Do not fail in case we do not have valid dependences 2014-02-23 15:15:44 +00:00
dead_iteration_elimination.ll Dead code elimination: Schedule another approximative step before actual DCE 2014-02-24 08:52:20 +00:00
null_schedule.ll