hanchenye-llvm-project/polly/test/DeadCodeElimination
Tobias Grosser c2920ff747 DeadCodeElimination: Fix liveout computation
We move back to a simple approach where the liveout is the last must-write
statement for a data-location plus all may-write statements. The previous
approach did not work out. We would have to consider per-data-access
dependences, instead of per-statement dependences to correct it. As this adds
complexity and it seems we would not gain anything over the simpler approach
that we implement in this commit, I moved us back to the old approach of
computing the liveout, but enhanced it to also add may-write accesses.

We also fix the test case and explain why we can not perform dead code
elimination in this case.

llvm-svn: 212925
2014-07-14 08:32:01 +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
non-affine-affine-mix.ll DeadCodeElimination: Fix liveout computation 2014-07-14 08:32:01 +00:00
non-affine.ll DeadCodeElim: Compute correct liveout for non-affine accesses 2014-07-11 07:12:10 +00:00
null_schedule.ll