diff options
| author | Chad Rosier <mcrosier@codeaurora.org> | 2015-11-11 23:00:59 +0000 |
|---|---|---|
| committer | Chad Rosier <mcrosier@codeaurora.org> | 2015-11-11 23:00:59 +0000 |
| commit | cc9030b60a4b84e3057836eaef2e2fc39b2712c8 (patch) | |
| tree | db5bcb6bfa74c973ff328cb3423c1ecaad7ac378 /llvm/test/CodeGen/AMDGPU/schedule-fs-loop-nested-if.ll | |
| parent | 673283cc7c11de672e1b72d9c38a729da81035ae (diff) | |
| download | bcm5719-llvm-cc9030b60a4b84e3057836eaef2e2fc39b2712c8.tar.gz bcm5719-llvm-cc9030b60a4b84e3057836eaef2e2fc39b2712c8.zip | |
[LIR] General refactor to improve compile-time and simplify code.
First create a list of candidates, then transform. This simplifies the code in
that you have don't have to worry that you may be using an invalidated
iterator.
Previously, each time we created a memset/memcpy we would reevaluate the entire
loop potentially resulting in lots of redundant work for large basic blocks.
llvm-svn: 252817
Diffstat (limited to 'llvm/test/CodeGen/AMDGPU/schedule-fs-loop-nested-if.ll')
0 files changed, 0 insertions, 0 deletions
