http://gcc.gnu.org/bugzilla/show_bug.cgi?id=56965
--- Comment #4 from Richard Biener <rguenth at gcc dot gnu.org> --- Created attachment 32105 --> http://gcc.gnu.org/bugzilla/attachment.cgi?id=32105&action=edit patch to make nonoverlapping_component_refs_p O (n log n) Address O(3) complexity like the attached (otherwise should behave identically other than search & find order). The function is somewhat crippled since we no longer strip ARRAY_REFs from mem-attrs MEM_EXPR, so testing coverage is probably low. Still going to test it, despite the possibly non-trivial overhead for qsort of small N (N == 1 is optimized already). insn-recog.c on x86_64 is a big contender on this function with -O2 --param max-gcse-memory=404857600
