https://gcc.gnu.org/bugzilla/show_bug.cgi?id=102927
--- Comment #7 from Martin Liška <marxin at gcc dot gnu.org> --- (In reply to Gabriel Ravier from comment #5) > Um, what ? How is this invalid, exactly ? Are you saying foo is faster than > baz (in which case it seems the opposite optimization should be implemented > for baz and bar), or that this optimization just won't ever be implemented > (which seems like more of a WONTFIX), or something else ? This seems kind of > odd... I say that we optimize 'foo' as 'baz' (if you adjust the minimal number of cases we consider beneficial: --param case-values-threshold=4).
