/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License (the "License").
* You may not use this file except in compliance with the License.
*
* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
* See the License for the specific language governing permissions
* and limitations under the License.
*
* When distributing Covered Code, include this CDDL HEADER in each
* file and include the License file at usr/src/OPENSOLARIS.LICENSE.
* If applicable, add the following below this CDDL HEADER, with the
* fields enclosed by brackets "[]" replaced with your own identifying
* information: Portions Copyright [yyyy] [name of copyright owner]
*
* CDDL HEADER END
*/
/*
* Copyright 2011 Nexenta Systems, Inc. All rights reserved.
*/
/*
* Copyright 2006 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
#include "libm.h"
#include "longdouble.h"
/*
* remainderl(x,p)
* returns x REM p = x - [x/p]*p as if in infinite
* precise arithmetic, where [x/p] is the (inifinite bit)
* integer nearest x/p (in half way case choose the even one).
* Method :
* Based on fmodl() return x-[x/p]chopped*p exactly.
*/
static const long double
long double
remainderl(long double x, long double p) {
long double hp;
int sx;
if (isnanl(p))
return (x + p);
if (!finitel(x))
return (x - x);
p = fabsl(p);
if (p <= hfmax)
x = fmodl(x, p + p);
x = fabsl(x);
if (p < dbmin) {
if (x + x > p) {
if (x == p)
x = zero;
else
x -= p; /* avoid x-x=-0 in RM mode */
if (x + x >= p)
x -= p;
}
} else {
if (x > hp) {
if (x == p)
x = zero;
else
x -= p; /* avoid x-x=-0 in RM mode */
if (x >= hp)
x -= p;
}
}
return (sx == 0 ? x : -x);
}