https://gcc.gnu.org/bugzilla/show_bug.cgi?id=100736
--- Comment #4 from HaoChen Gui <guihaoc at gcc dot gnu.org> ---
Yes, there is a question. With my patch, the test case generates following
assembly. Seems they have the same latency (cror vs. crnot). I wonder why we
need reverse the CR bit comparison when finite-math-only is set. Thanks.
without finite-math-only
bcdsub. %v2,%v2,%v3,0
cror 26,25,26
mfcr %r3,2
rlwinm %r3,%r3,27,1
with finite-math-only
bcdsub. %v2,%v2,%v3,0
crnot 26,24
mfcr %r3,2
rlwinm %r3,%r3,27,1
