https://gcc.gnu.org/bugzilla/show_bug.cgi?id=59429
--- Comment #13 from Kai Tietz <ktietz at gcc dot gnu.org> --- Hmm, I don't see what binary-combine helper would help here? It might be a good thing to have such a abstract-representation for doing logical optimizations of comparison chains. Nevertheless this seems to me being not the solution for the given issue here. The issue - described in this problem - is more related to simple pattern-matching. So normalization in such cases seems to be the way to go.
