https://gcc.gnu.org/bugzilla/show_bug.cgi?id=91858
--- Comment #12 from Vincent Lefèvre <vincent-gcc at vinc17 dot net> --- (In reply to Vincent Lefèvre from comment #11) > (In reply to Vincent Lefèvre from comment #10) > > Paul Zimmermann says that this bug is fixed in the MPC development version. > > I could check that the bug is actually fixed, but the does not solve the GCC > issue, as the time complexity is too large. With 10000000 instead of 10000, > you'll still notice that it takes too much time. But as Paul says, keeping the exponent range reduced as above allows an immediate answer. So the solution will be to upgrade to the next MPC version (not released yet) and do not increase the exponent range (this allows early underflow/overflow checking, thus may avoid costly computations in some domains).
