https://gcc.gnu.org/bugzilla/show_bug.cgi?id=122385
--- Comment #1 from Richard Biener <rguenth at gcc dot gnu.org> --- This gets very tricky with machine specific costs, like whether multiplication sets ZF or what the throughput of reg == 0 is. So I suppose it is best handled by a peephole2 or combiner pattern in targets?
