https://gcc.gnu.org/bugzilla/show_bug.cgi?id=97213
--- Comment #3 from Jakub Jelinek <jakub at gcc dot gnu.org> --- Note, I think significant speedup is in tail recursion optimization which will be prevented even with mergeable task. Computing fibonacci this way is not efficient.
