https://gcc.gnu.org/bugzilla/show_bug.cgi?id=118032
--- Comment #30 from Filip Kastl <pheeck at gcc dot gnu.org> --- (In reply to Mark Wielaard from comment #28) > I haven't tried yet, but do you mean something like the following? > - /* Note: l + 1 is the number of cases of the switch. */ > - if (l + 1 > (unsigned) param_switch_lower_slow_alg_max_cases) > - return clusters.copy (); Yes. Exactly that. (In reply to ak from comment #29) > We could also implement greedy switch clustering for jump tables I think. > Right now it's only for the switch bitmap clustering. Yes, that would be nice to have. Though maybe that can wait for Stage 1.
