https://gcc.gnu.org/bugzilla/show_bug.cgi?id=96044
Richard Biener <rguenth at gcc dot gnu.org> changed:
What |Removed |Added
----------------------------------------------------------------------------
Status|WAITING |NEW
--- Comment #5 from Richard Biener <rguenth at gcc dot gnu.org> ---
I can confirm that with the updated testcase and my versions of mpfr/gmp it
takes longer than I'm willing to wait. Possibly evaluating bessel functions
cannot be done faster though which means the reasonable way to handle them
would be not
constant folding any of them?
Vincent, any guidance on that? I guess the actual runtime implementation in
glibc may be "fast" because it's not accurate (evaluating takes 0.00s with
glibc 2.26 ...)
