9 * or http://www.opensolaris.org/os/licensing.
10 * See the License for the specific language governing permissions
11 * and limitations under the License.
12 *
13 * When distributing Covered Code, include this CDDL HEADER in each
14 * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
15 * If applicable, add the following below this CDDL HEADER, with the
16 * fields enclosed by brackets "[]" replaced with your own identifying
17 * information: Portions Copyright [yyyy] [name of copyright owner]
18 *
19 * CDDL HEADER END
20 */
21 /*
22 * Copyright 2011 Nexenta Systems, Inc. All rights reserved.
23 */
24 /*
25 * Copyright 2006 Sun Microsystems, Inc. All rights reserved.
26 * Use is subject to license terms.
27 */
28
29 #pragma weak remainder = __remainder
30
31 /*
32 * remainder(x,p)
33 * Code originated from 4.3bsd.
34 * Modified by K.C. Ng for SUN 4.0 libm.
35 * Return :
36 * returns x REM p = x - [x/p]*p as if in infinite precise arithmetic,
37 * where [x/p] is the (inifinite bit) integer nearest x/p (in half way
38 * case choose the even one).
39 * Method :
40 * Based on fmod() return x-[x/p]chopped*p exactly.
41 */
42
43 #include "libm.h"
44
45 static const double zero = 0.0, half = 0.5;
46
47 double
48 remainder(double x, double p) {
49 double halfp;
|
9 * or http://www.opensolaris.org/os/licensing.
10 * See the License for the specific language governing permissions
11 * and limitations under the License.
12 *
13 * When distributing Covered Code, include this CDDL HEADER in each
14 * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
15 * If applicable, add the following below this CDDL HEADER, with the
16 * fields enclosed by brackets "[]" replaced with your own identifying
17 * information: Portions Copyright [yyyy] [name of copyright owner]
18 *
19 * CDDL HEADER END
20 */
21 /*
22 * Copyright 2011 Nexenta Systems, Inc. All rights reserved.
23 */
24 /*
25 * Copyright 2006 Sun Microsystems, Inc. All rights reserved.
26 * Use is subject to license terms.
27 */
28
29 #pragma weak __remainder = remainder
30
31 /*
32 * remainder(x,p)
33 * Code originated from 4.3bsd.
34 * Modified by K.C. Ng for SUN 4.0 libm.
35 * Return :
36 * returns x REM p = x - [x/p]*p as if in infinite precise arithmetic,
37 * where [x/p] is the (inifinite bit) integer nearest x/p (in half way
38 * case choose the even one).
39 * Method :
40 * Based on fmod() return x-[x/p]chopped*p exactly.
41 */
42
43 #include "libm.h"
44
45 static const double zero = 0.0, half = 0.5;
46
47 double
48 remainder(double x, double p) {
49 double halfp;
|