On Wed, 31 Jan 2024, Jakub Jelinek wrote: > Hi! > > On Sat, Jan 27, 2024 at 08:53:42AM +0100, Jakub Jelinek wrote: > > The following testcase ends up with SIGFPE in __divmodbitint4. > > The problem is a thinko in my attempt to implement Knuth's algorithm. > > Here is an updated version of the patch, the libgcc part is the same, > but I've added a new testcase which tests the behavior of all the changed > cases, so it has a case where uv1:uv0 / vv1 is 1:1, where it is > 1:0 and rhat + vv1 overflows and where it is 1:0 and rhat + vv1 does not > overflow, and includes tests also from Zdenek's other failing tests. > > Previously successfully bootstrapped/regtested on x86_64-linux and > i686-linux, the new version has been retested with > make check-gcc GCC_TEST_RUN_EXPENSIVE=1 > RUNTESTFLAGS="GCC_TEST_RUN_EXPENSIVE=1 dg-torture.exp='bitint-53.c > bitint-55.c'" > Ok for trunk?
OK. -- Joseph S. Myers josmy...@redhat.com
