mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-25 04:02:41 +01:00
89ff4e2b47
The original algorithm only used recursive pair fusion of equal-length types. This is now extended to allow pairing of any types that share the same underlying scalar type. Because we would still generally prefer the 2^n-length types, those are formed first. Then a second set of iterations form the non-2^n-length types. Also, a call to SimplifyInstructionsInBlock has been added after each pairing iteration. This takes care of DCE (and a few other things) that make the following iterations execute somewhat faster. For the same reason, some of the simple shuffle-combination cases are now handled internally. There is some additional refactoring work to be done, but I've had many requests for this feature, so additional refactoring will come soon in future commits (as will additional test cases). llvm-svn: 159330 |
||
|---|---|---|
| .. | ||
| cycle.ll | ||
| func-alias.ll | ||
| ld1.ll | ||
| lit.local.cfg | ||
| loop1.ll | ||
| mem-op-depth.ll | ||
| metadata.ll | ||
| no-ldstr-conn.ll | ||
| req-depth.ll | ||
| search-limit.ll | ||
| simple3.ll | ||
| simple-int.ll | ||
| simple-ldstr-ptrs.ll | ||
| simple-ldstr.ll | ||
| simple-sel.ll | ||
| simple-tst.ll | ||
| simple.ll | ||