Refer to C23 in place of C2X in glibc

[thirdparty/glibc.git] / math / atest-sincos.c

diff --git a/math/atest-sincos.c b/math/atest-sincos.c
index bef3521c9624e9c9f88fe22ec355bf7b35a53bb3..f6b75d84178e2d72f93773cfd2119b0b26a2601b 100644 (file)
--- a/math/atest-sincos.c
+++ b/math/atest-sincos.c
@@ -1,6 +1,5 @@
-/* Copyright (C) 1997, 1998, 2000, 2006 Free Software Foundation, Inc.
+/* Copyright (C) 1997-2024 Free Software Foundation, Inc.
    This file is part of the GNU C Library.
-   Contributed by Geoffrey Keating <Geoff.Keating@anu.edu.au>, 1997.
 
    The GNU C Library is free software; you can redistribute it and/or
    modify it under the terms of the GNU Lesser General Public
@@ -13,9 +12,8 @@
    Lesser General Public License for more details.
 
    You should have received a copy of the GNU Lesser General Public
-   License along with the GNU C Library; if not, write to the Free
-   Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
-   02111-1307 USA.  */
+   License along with the GNU C Library; if not, see
+   <https://www.gnu.org/licenses/>.  */
 
 #include <stdio.h>
 #include <math.h>
@@ -65,7 +63,6 @@ sincosx_mpn (mp1 si, mp1 co, mp1 xx, mp1 ix)
    int i;
    mp2 s[4], c[4];
    mp1 tmp, x;
-   mp_limb_t chk, round;
 
    if (ix == NULL)
      {
@@ -80,34 +77,38 @@ sincosx_mpn (mp1 si, mp1 co, mp1 xx, mp1 ix)
    for (i = 0; i < 1 << N; i++)
      {
 #define add_shift_mulh(d,x,s1,s2,sh,n) \
-       /* d = (n ? -1 : 1) * (s1 + (s2>>sh)) * x / (1>>N); */                \
       do {                                                                   \
         if (s2 != NULL) {                                                    \
            if (sh > 0) {                                                     \
               assert (sh < mpbpl);                                           \
               mpn_lshift (tmp, s1, SZ, sh);                                  \
-              chk = (n ? mpn_sub_n : mpn_add_n)(tmp,tmp,s2+FRAC/mpbpl,SZ);   \
-           } else                                                            \
-              chk = (n ? mpn_sub_n : mpn_add_n)(tmp,s1,s2+FRAC/mpbpl,SZ);    \
-           /* assert(chk == 0); */                                           \
+              if (n)                                                         \
+                mpn_sub_n (tmp,tmp,s2+FRAC/mpbpl,SZ);                        \
+              else                                                           \
+                mpn_add_n (tmp,tmp,s2+FRAC/mpbpl,SZ);                        \
+           } else {                                                          \
+              if (n)                                                         \
+                mpn_sub_n (tmp,s1,s2+FRAC/mpbpl,SZ);                         \
+              else                                                           \
+                mpn_add_n (tmp,s1,s2+FRAC/mpbpl,SZ);                         \
+           }                                                                 \
            mpn_mul_n(d,tmp,x,SZ);                                            \
         } else                                                               \
            mpn_mul_n(d,s1,x,SZ);                                             \
-        /* assert(d[SZ*2-1] == 0); */                                        \
         assert(N+sh < mpbpl);                                                \
         if (N+sh > 0) mpn_rshift(d,d,2*SZ,N+sh);                             \
       } while(0)
 #define summ(d,ss,s,n) \
-      /* d = ss +/- (s[0]+2*s[1]+2*s[2]+s[3])/6; */                          \
       do {                                                                   \
-        chk = mpn_add_n(tmp,s[1]+FRAC/mpbpl,s[2]+FRAC/mpbpl,SZ);             \
+        mpn_add_n(tmp,s[1]+FRAC/mpbpl,s[2]+FRAC/mpbpl,SZ);                   \
         mpn_lshift(tmp,tmp,SZ,1);                                            \
-        chk |= mpn_add_n(tmp,tmp,s[0]+FRAC/mpbpl,SZ);                        \
-        chk |= mpn_add_n(tmp,tmp,s[3]+FRAC/mpbpl,SZ);                        \
-        round = mpn_divmod_1(tmp,tmp,SZ,6);                                  \
-        /* chk |= mpn_add_1(tmp,tmp,SZ, (round > 3) ); */                    \
-         chk |= (n ? mpn_sub_n : mpn_add_n)(d,ss,tmp,SZ);                    \
-        /* assert(chk == 0); */                                              \
+        mpn_add_n(tmp,tmp,s[0]+FRAC/mpbpl,SZ);                               \
+        mpn_add_n(tmp,tmp,s[3]+FRAC/mpbpl,SZ);                               \
+        mpn_divmod_1(tmp,tmp,SZ,6);                                          \
+        if (n)                                                               \
+           mpn_sub_n (d,ss,tmp,SZ);                                          \
+        else                                                                 \
+           mpn_add_n (d,ss,tmp,SZ);                                          \
       } while (0)
 
       add_shift_mulh (s[0], x, co, NULL, 0, 0); /* s0 = h * c; */
@@ -139,8 +140,8 @@ mpn_bitsize (const mp_limb_t *SRC_PTR, mp_size_t SIZE)
    return i * mpbpl + j;
 }
 
-int
-main (void)
+static int
+do_test (void)
 {
   mp1 si, co, x, ox, xt, s2, c2, s3, c3;
   int i;
@@ -275,3 +276,7 @@ main (void)
 
    return (sin_failures == 0 && cos_failures == 0) ? 0 : 1;
 }
+
+#define TIMEOUT 600
+#define TEST_FUNCTION do_test ()
+#include "../test-skeleton.c"