Files
clang-p2996/llvm/test/CodeGen/PowerPC
Max Kazantsev 6b03ce374e [LICM] Simplify (X < A && X < B) into (X < MIN(A, B)) if MIN(A, B) is loop-invariant
We don't do this transform in InstCombine in general case for arbitrary values, because cost of
AND and 2 ICMP's isn't higher than of MIN and ICMP. However, LICM also has a notion
about the loop structure. This transform becomes profitable if `A` and `B` are loop-invariant and
`X` is not: by doing this, we can compute min outside the loop.

Differential Revision: https://reviews.llvm.org/D143726
Reviewed By: nikic
2023-03-10 17:36:52 +07:00
..
2023-01-05 18:49:23 +00:00
2022-10-11 17:24:06 +00:00
2023-02-14 10:25:24 -04:00
2022-10-11 17:24:06 +00:00
2022-10-11 17:24:06 +00:00
2022-11-29 15:47:32 -06:00
2022-10-11 17:24:06 +00:00
2022-11-04 10:18:04 -07:00