11210 libm should be cstyle(1ONBLD) clean

          --- old/usr/src/lib/libm/common/LD/__poly_libmq.c
          +++ new/usr/src/lib/libm/common/LD/__poly_libmq.c

   1    1  /*
   2    2   * CDDL HEADER START
   3    3   *
   4    4   * The contents of this file are subject to the terms of the
   5    5   * Common Development and Distribution License (the "License").
   6    6   * You may not use this file except in compliance with the License.
   7    7   *
   8    8   * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
   9    9   * or http://www.opensolaris.org/os/licensing.
  10   10   * See the License for the specific language governing permissions
  11   11   * and limitations under the License.
  12   12   *
  13   13   * When distributing Covered Code, include this CDDL HEADER in each
  14   14   * file and include the License file at usr/src/OPENSOLARIS.LICENSE.

  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  #include "libm.h"
  31   32  
  32      -long double __poly_libmq(x,n,p)
  33      -long double x,p[];
  34      -int n;
       33 +long double
       34 +__poly_libmq(long double x, int n, long double p[])
  35   35  {
  36      -        long double t; int i;
  37      -        t = p[n-1];
  38      -        for(i=n-2;i>=0;i--) t = p[i] + x*t;
  39      -        return t;
       36 +        long double t;
       37 +        int i;
       38 +
       39 +        t = p[n - 1];
       40 +
       41 +        for (i = n - 2; i >= 0; i--)
       42 +                t = p[i] + x * t;
       43 +
       44 +        return (t);
  40   45  }
    

XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX