Print this page
11210 libm should be cstyle(1ONBLD) clean

Split Close
Expand all
Collapse all
          --- old/usr/src/lib/libm/common/Q/sinl.c
          +++ new/usr/src/lib/libm/common/Q/sinl.c
↓ open down ↓ 14 lines elided ↑ open up ↑
  15   15   * If applicable, add the following below this CDDL HEADER, with the
  16   16   * fields enclosed by brackets "[]" replaced with your own identifying
  17   17   * information: Portions Copyright [yyyy] [name of copyright owner]
  18   18   *
  19   19   * CDDL HEADER END
  20   20   */
  21   21  
  22   22  /*
  23   23   * Copyright 2011 Nexenta Systems, Inc.  All rights reserved.
  24   24   */
       25 +
  25   26  /*
  26   27   * Copyright 2006 Sun Microsystems, Inc.  All rights reserved.
  27   28   * Use is subject to license terms.
  28   29   */
  29   30  
  30   31  /*
  31   32   * sinl(x)
  32   33   * Table look-up algorithm by K.C. Ng, November, 1989.
  33   34   *
  34   35   * kernel function:
↓ open down ↓ 23 lines elided ↑ open up ↑
  58   59   * Accuracy:
  59   60   *      computer TRIG(x) returns trig(x) nearly rounded.
  60   61   */
  61   62  
  62   63  #pragma weak __sinl = sinl
  63   64  
  64   65  #include "libm.h"
  65   66  #include "longdouble.h"
  66   67  
  67   68  long double
  68      -sinl(long double x) {
       69 +sinl(long double x)
       70 +{
  69   71          long double y[2], z = 0.0L;
  70   72          int n, ix;
  71   73  
  72      -        ix = *(int *) &x;               /* High word of x */
       74 +        ix = *(int *)&x;                /* High word of x */
  73   75          ix &= 0x7fffffff;
  74      -        if (ix <= 0x3ffe9220)           /* |x| ~< pi/4 */
       76 +
       77 +        if (ix <= 0x3ffe9220) {         /* |x| ~< pi/4 */
  75   78                  return (__k_sinl(x, z));
  76      -        else if (ix >= 0x7fff0000)      /* sin(Inf or NaN) is NaN */
       79 +        } else if (ix >= 0x7fff0000) {  /* sin(Inf or NaN) is NaN */
  77   80                  return (x - x);
  78      -        else {                          /* argument reduction needed */
       81 +        } else {                        /* argument reduction needed */
  79   82                  n = __rem_pio2l(x, y);
       83 +
  80   84                  switch (n & 3) {
  81      -                        case 0:
  82      -                                return (__k_sinl(y[0], y[1]));
  83      -                        case 1:
  84      -                                return (__k_cosl(y[0], y[1]));
  85      -                        case 2:
  86      -                                return (-__k_sinl(y[0], y[1]));
  87      -                        case 3:
  88      -                                return (-__k_cosl(y[0], y[1]));
       85 +                case 0:
       86 +                        return (__k_sinl(y[0], y[1]));
       87 +                case 1:
       88 +                        return (__k_cosl(y[0], y[1]));
       89 +                case 2:
       90 +                        return (-__k_sinl(y[0], y[1]));
       91 +                case 3:
       92 +                        return (-__k_cosl(y[0], y[1]));
  89   93                  }
  90   94          }
       95 +
  91   96          /* NOTREACHED */
  92      -    return 0.0L;
       97 +        return (0.0L);
  93   98  }
    
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX