https://gcc.gnu.org/bugzilla/show_bug.cgi?id=117091
--- Comment #15 from andi at firstfloor dot org --- An upper limit has the problem that very large switches may never get the bitmasks or the jump clusters. Would be good to have a heuristic that still works for them. Bit clustering always works on words so you have a fallback that just looks at aligned regions in value space without trying to find optimal clusters. I guess jump clustering could do something similar although it doesn't have natural alignment. Also there must be a better data structure for the search. Some kind of augmented tree perhaps. That would be a lot more effort though And the code has a lot of hard coded constants. Some params are probably a good idea.
