mirror of
https://github.com/RPCS3/llvm.git
synced 2024-12-25 21:46:50 +00:00
b04fde3708
This change is simply enhancing the existing inference algorithm to handle insertelement instructions by conservatively inserting a new instruction to propagate the vector of associated base pointers. In the process, I'm ripping out the peephole optimizations which mostly helped cover the fact this hadn't been done. Note that most of the newly inserted nodes will be nearly immediately removed by the post insertion optimization pass introduced in 246718. Arguably, we should be trying harder to avoid the malloc traffic here, but I'd rather get the code correct, then worry about compile time. Unlike previous extensions of the algorithm to handle more case, I discovered the existing code was causing miscompiles in some cases. In particular, we had an implicit assumption that the peephole covered *all* insert element instructions, so if we had a value directly based on a insert element the peephole didn't cover, we proceeded as if it were a base anyways. Not good. I believe we had the same issue with shufflevector which is why I adjusted the predicate for them as well. Differential Revision: http://reviews.llvm.org/D12583 git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@247210 91177308-0d34-0410-b5e6-96231b3b80d8 |
||
|---|---|---|
| .. | ||
| base-pointers-1.ll | ||
| base-pointers-2.ll | ||
| base-pointers-3.ll | ||
| base-pointers-4.ll | ||
| base-pointers-5.ll | ||
| base-pointers-6.ll | ||
| base-pointers-7.ll | ||
| base-pointers-8.ll | ||
| base-pointers-9.ll | ||
| base-pointers-10.ll | ||
| base-pointers-11.ll | ||
| base-pointers.ll | ||
| base-vector.ll | ||
| basics.ll | ||
| codegen-cond.ll | ||
| constants.ll | ||
| deref-pointers.ll | ||
| gc_relocate_creation.ll | ||
| live-vector.ll | ||
| liveness-basics.ll | ||
| preprocess.ll | ||
| relocate_invoke_result.ll | ||
| relocation.ll | ||
| rematerialize-derived-pointers.ll | ||