double complex
csqrt(double complex z)
{
double complex result;
double a, b;
double t;
int scale;
a = creal(z);
b = cimag(z);
/* Handle special cases. */
if (z == 0)
return (cpack(0, b));
if (isinf(b))
return (cpack(INFINITY, b));
if (isnan(a)) {
t = (b - b) / (b - b); /* raise invalid if b is not a NaN */
return (cpack(a, t)); /* return NaN + NaN i */
}
if (isinf(a)) {
/*
* csqrt(inf + NaN i) = inf + NaN i
* csqrt(inf + y i) = inf + 0 i
* csqrt(-inf + NaN i) = NaN +- inf i
* csqrt(-inf + y i) = 0 + inf i
*/
if (signbit(a))
return (cpack(fabs(b - b), copysign(a, b)));
else
return (cpack(a, copysign(b - b, b)));
}
/*
* The remaining special case (b is NaN) is handled just fine by
* the normal code path below.
*/
/* Scale to avoid overflow. */
if (fabs(a) >= THRESH || fabs(b) >= THRESH) {
a *= 0.25;
b *= 0.25;
scale = 1;
} else {
scale = 0;
}
/* Algorithm 312, CACM vol 10, Oct 1967. */
if (a >= 0) {
t = sqrt((a + hypot(a, b)) * 0.5);
result = cpack(t, b / (2 * t));
} else {
t = sqrt((-a + hypot(a, b)) * 0.5);
result = cpack(fabs(b) / (2 * t), copysign(t, b));
}
/* Rescale. */
if (scale)
return (result * 2);
else
return (result);
}
/*
* cacos(z) = PI/2 - casin(z)
* but do the computation carefully so cacos(z) is accurate when z is
* close to 1.
*
* cacos(z) = PI/2 - z + O(z^3) as z -> 0
*
* cacos(z) = -sign(y)*I*clog(z) + O(1/z^2) as z -> infinity
* The above formula works for the real part as well, because
* Re(cacos(z)) = atan2(fabs(y), x) + O(y/z^3)
* as z -> infinity, uniformly in y
*/
double complex
cacos(double complex z)
{
double x, y, ax, ay, rx, ry, B, sqrt_A2mx2, new_x;
int sx, sy;
int B_is_usable;
double complex w;
x = creal(z);
y = cimag(z);
sx = signbit(x);
sy = signbit(y);
ax = fabs(x);
ay = fabs(y);
if (isnan(x) || isnan(y)) {
/* cacos(+-Inf + I*NaN) = NaN + I*opt(-)Inf */
if (isinf(x))
return (cpack(y + y, -INFINITY));
/* cacos(NaN + I*+-Inf) = NaN + I*-+Inf */
if (isinf(y))
return (cpack(x + x, -y));
/* cacos(0 + I*NaN) = PI/2 + I*NaN with inexact */
if (x == 0)
return (cpack(pio2_hi + pio2_lo, y + y));
/*
* All other cases involving NaN return NaN + I*NaN.
* C99 leaves it optional whether to raise invalid if one of
* the arguments is not NaN, so we opt not to raise it.
*/
return (cpack(x + 0.0L + (y + 0), x + 0.0L + (y + 0)));
}
if (ax > RECIP_EPSILON || ay > RECIP_EPSILON) {
/* clog...() will raise inexact unless x or y is infinite. */
w = clog_for_large_values(z);
rx = fabs(cimag(w));
ry = creal(w) + m_ln2;
if (sy == 0)
ry = -ry;
return (cpack(rx, ry));
}
/* Avoid spuriously raising inexact for z = 1. */
if (x == 1 && y == 0)
return (cpack(0, -y));
/* All remaining cases are inexact. */
raise_inexact();
if (ax < SQRT_6_EPSILON / 4 && ay < SQRT_6_EPSILON / 4)
return (cpack(pio2_hi - (x - pio2_lo), -y));
do_hard_work(ay, ax, &ry, &B_is_usable, &B, &sqrt_A2mx2, &new_x);
if (B_is_usable) {
if (sx == 0)
rx = acos(B);
else
rx = acos(-B);
} else {
if (sx == 0)
rx = atan2(sqrt_A2mx2, new_x);
else
rx = atan2(sqrt_A2mx2, -new_x);
}
if (sy == 0)
ry = -ry;
return (cpack(rx, ry));
}
static void
test_signbitl ()
{
/* Finite values. */
ASSERT (!signbit (3.141L));
ASSERT (!signbit (3.141e30L));
ASSERT (!signbit (3.141e-30L));
ASSERT (signbit (-2.718L));
ASSERT (signbit (-2.718e30L));
ASSERT (signbit (-2.718e-30L));
/* Zeros. */
ASSERT (!signbit (0.0L));
if (1.0L / minus_zerol < 0)
ASSERT (signbit (-0.0L));
else
ASSERT (!signbit (-0.0L));
/* Infinite values. */
ASSERT (!signbit (1.0L / 0.0L));
ASSERT (signbit (-1.0L / 0.0L));
/* Quiet NaN. */
(void) signbit (zerol / zerol);
#if defined LDBL_EXPBIT0_WORD && defined LDBL_EXPBIT0_BIT
/* Signalling NaN. */
{
#define NWORDS \
((sizeof (long double) + sizeof (unsigned int) - 1) / sizeof (unsigned int))
typedef union { long double value; unsigned int word[NWORDS]; } memory_long_double;
memory_long_double m;
m.value = zerol / zerol;
# if LDBL_EXPBIT0_BIT > 0
m.word[LDBL_EXPBIT0_WORD] ^= (unsigned int) 1 << (LDBL_EXPBIT0_BIT - 1);
# else
m.word[LDBL_EXPBIT0_WORD + (LDBL_EXPBIT0_WORD < NWORDS / 2 ? 1 : - 1)]
^= (unsigned int) 1 << (sizeof (unsigned int) * CHAR_BIT - 1);
# endif
m.word[LDBL_EXPBIT0_WORD + (LDBL_EXPBIT0_WORD < NWORDS / 2 ? 1 : - 1)]
|= (unsigned int) 1 << LDBL_EXPBIT0_BIT;
(void) signbit (m.value);
#undef NWORDS
}
#endif
}
static void
write_float (st_parameter_dt *dtp, const fnode *f, const char *source, int len)
{
GFC_REAL_LARGEST n;
int nb =0, res, save_scale_factor;
char * p, fin;
fnode *f2 = NULL;
n = extract_real (source, len);
if (f->format != FMT_B && f->format != FMT_O && f->format != FMT_Z)
{
res = isfinite (n);
if (res == 0)
{
nb = f->u.real.w;
/* If the field width is zero, the processor must select a width
not zero. 4 is chosen to allow output of '-Inf' or '+Inf' */
if (nb == 0) nb = 4;
p = write_block (dtp, nb);
if (p == NULL)
return;
if (nb < 3)
{
memset (p, '*',nb);
return;
}
memset(p, ' ', nb);
res = !isnan (n);
if (res != 0)
{
if (signbit(n))
{
/* If the sign is negative and the width is 3, there is
insufficient room to output '-Inf', so output asterisks */
if (nb == 3)
{
memset (p, '*',nb);
return;
}
/* The negative sign is mandatory */
fin = '-';
}
else
/* The positive sign is optional, but we output it for
consistency */
fin = '+';
if (nb > 8)
/* We have room, so output 'Infinity' */
memcpy(p + nb - 8, "Infinity", 8);
else
/* For the case of width equals 8, there is not enough room
for the sign and 'Infinity' so we go with 'Inf' */
memcpy(p + nb - 3, "Inf", 3);
if (nb < 9 && nb > 3)
p[nb - 4] = fin; /* Put the sign in front of Inf */
else if (nb > 8)
p[nb - 9] = fin; /* Put the sign in front of Infinity */
}
else
memcpy(p + nb - 3, "NaN", 3);
return;
}
}
if (f->format != FMT_G)
output_float (dtp, f, n);
else
{
save_scale_factor = dtp->u.p.scale_factor;
f2 = calculate_G_format (dtp, f, n, &nb);
output_float (dtp, f2, n);
dtp->u.p.scale_factor = save_scale_factor;
if (f2 != NULL)
free_mem(f2);
if (nb > 0)
{
p = write_block (dtp, nb);
if (p == NULL)
return;
memset (p, ' ', nb);
}
}
}
CFLOAT
M_DECL_FUNC (__cexp) (CFLOAT x)
{
CFLOAT retval;
int rcls = fpclassify (__real__ x);
int icls = fpclassify (__imag__ x);
if (__glibc_likely (rcls >= FP_ZERO))
{
/* Real part is finite. */
if (__glibc_likely (icls >= FP_ZERO))
{
/* Imaginary part is finite. */
const int t = (int) ((M_MAX_EXP - 1) * M_MLIT (M_LN2));
FLOAT sinix, cosix;
if (__glibc_likely (M_FABS (__imag__ x) > M_MIN))
{
M_SINCOS (__imag__ x, &sinix, &cosix);
}
else
{
sinix = __imag__ x;
cosix = 1;
}
if (__real__ x > t)
{
FLOAT exp_t = M_EXP (t);
__real__ x -= t;
sinix *= exp_t;
cosix *= exp_t;
if (__real__ x > t)
{
__real__ x -= t;
sinix *= exp_t;
cosix *= exp_t;
}
}
if (__real__ x > t)
{
/* Overflow (original real part of x > 3t). */
__real__ retval = M_MAX * cosix;
__imag__ retval = M_MAX * sinix;
}
else
{
FLOAT exp_val = M_EXP (__real__ x);
__real__ retval = exp_val * cosix;
__imag__ retval = exp_val * sinix;
}
math_check_force_underflow_complex (retval);
}
else
{
/* If the imaginary part is +-inf or NaN and the real part
is not +-inf the result is NaN + iNaN. */
__real__ retval = M_NAN;
__imag__ retval = M_NAN;
feraiseexcept (FE_INVALID);
}
}
else if (__glibc_likely (rcls == FP_INFINITE))
{
/* Real part is infinite. */
if (__glibc_likely (icls >= FP_ZERO))
{
/* Imaginary part is finite. */
FLOAT value = signbit (__real__ x) ? 0 : M_HUGE_VAL;
if (icls == FP_ZERO)
{
/* Imaginary part is 0.0. */
__real__ retval = value;
__imag__ retval = __imag__ x;
}
else
{
FLOAT sinix, cosix;
if (__glibc_likely (M_FABS (__imag__ x) > M_MIN))
{
M_SINCOS (__imag__ x, &sinix, &cosix);
}
else
{
sinix = __imag__ x;
cosix = 1;
}
__real__ retval = M_COPYSIGN (value, cosix);
__imag__ retval = M_COPYSIGN (value, sinix);
}
}
else if (signbit (__real__ x) == 0)
{
__real__ retval = M_HUGE_VAL;
__imag__ retval = __imag__ x - __imag__ x;
}
else
{
__real__ retval = 0;
__imag__ retval = M_COPYSIGN (0, __imag__ x);
}
}
else
{
/* If the real part is NaN the result is NaN + iNaN unless the
imaginary part is zero. */
__real__ retval = M_NAN;
if (icls == FP_ZERO)
__imag__ retval = __imag__ x;
else
{
__imag__ retval = M_NAN;
if (rcls != FP_NAN || icls != FP_NAN)
feraiseexcept (FE_INVALID);
}
}
return retval;
}
__complex__ float
__csinf (__complex__ float x)
{
__complex__ float retval;
int negate = signbit (__real__ x);
int rcls = fpclassify (__real__ x);
int icls = fpclassify (__imag__ x);
__real__ x = fabsf (__real__ x);
if (__builtin_expect (icls >= FP_ZERO, 1))
{
/* Imaginary part is finite. */
if (__builtin_expect (rcls >= FP_ZERO, 1))
{
/* Real part is finite. */
float sinh_val = __ieee754_sinhf (__imag__ x);
float cosh_val = __ieee754_coshf (__imag__ x);
float sinix, cosix;
__sincosf (__real__ x, &sinix, &cosix);
__real__ retval = cosh_val * sinix;
__imag__ retval = sinh_val * cosix;
if (negate)
__real__ retval = -__real__ retval;
}
else
{
if (icls == FP_ZERO)
{
/* Imaginary part is 0.0. */
__real__ retval = __nanf ("");
__imag__ retval = __imag__ x;
if (rcls == FP_INFINITE)
feraiseexcept (FE_INVALID);
}
else
{
__real__ retval = __nanf ("");
__imag__ retval = __nanf ("");
feraiseexcept (FE_INVALID);
}
}
}
else if (icls == FP_INFINITE)
{
/* Imaginary part is infinite. */
if (rcls == FP_ZERO)
{
/* Real part is 0.0. */
__real__ retval = __copysignf (0.0, negate ? -1.0 : 1.0);
__imag__ retval = __imag__ x;
}
else if (rcls > FP_ZERO)
{
/* Real part is finite. */
float sinix, cosix;
__sincosf (__real__ x, &sinix, &cosix);
__real__ retval = __copysignf (HUGE_VALF, sinix);
__imag__ retval = __copysignf (HUGE_VALF, cosix);
if (negate)
__real__ retval = -__real__ retval;
if (signbit (__imag__ x))
__imag__ retval = -__imag__ retval;
}
else
{
/* The addition raises the invalid exception. */
__real__ retval = __nanf ("");
__imag__ retval = HUGE_VALF;
if (rcls == FP_INFINITE)
feraiseexcept (FE_INVALID);
}
}
else
{
if (rcls == FP_ZERO)
__real__ retval = __copysignf (0.0, negate ? -1.0 : 1.0);
else
__real__ retval = __nanf ("");
__imag__ retval = __nanf ("");
}
return retval;
}
__complex__ double
__clog (__complex__ double x)
{
__complex__ double result;
int rcls = fpclassify (__real__ x);
int icls = fpclassify (__imag__ x);
if (__glibc_unlikely (rcls == FP_ZERO && icls == FP_ZERO))
{
/* Real and imaginary part are 0.0. */
__imag__ result = signbit (__real__ x) ? M_PI : 0.0;
__imag__ result = __copysign (__imag__ result, __imag__ x);
/* Yes, the following line raises an exception. */
__real__ result = -1.0 / fabs (__real__ x);
}
else if (__glibc_likely (rcls != FP_NAN && icls != FP_NAN))
{
/* Neither real nor imaginary part is NaN. */
double absx = fabs (__real__ x), absy = fabs (__imag__ x);
int scale = 0;
if (absx < absy)
{
double t = absx;
absx = absy;
absy = t;
}
if (absx > DBL_MAX / 2.0)
{
scale = -1;
absx = __scalbn (absx, scale);
absy = (absy >= DBL_MIN * 2.0 ? __scalbn (absy, scale) : 0.0);
}
else if (absx < DBL_MIN && absy < DBL_MIN)
{
scale = DBL_MANT_DIG;
absx = __scalbn (absx, scale);
absy = __scalbn (absy, scale);
}
if (absx == 1.0 && scale == 0)
{
__real__ result = __log1p (absy * absy) / 2.0;
math_check_force_underflow_nonneg (__real__ result);
}
else if (absx > 1.0 && absx < 2.0 && absy < 1.0 && scale == 0)
{
double d2m1 = (absx - 1.0) * (absx + 1.0);
if (absy >= DBL_EPSILON)
d2m1 += absy * absy;
__real__ result = __log1p (d2m1) / 2.0;
}
else if (absx < 1.0
&& absx >= 0.5
&& absy < DBL_EPSILON / 2.0
&& scale == 0)
{
double d2m1 = (absx - 1.0) * (absx + 1.0);
__real__ result = __log1p (d2m1) / 2.0;
}
else if (absx < 1.0
&& absx >= 0.5
&& scale == 0
&& absx * absx + absy * absy >= 0.5)
{
double d2m1 = __x2y2m1 (absx, absy);
__real__ result = __log1p (d2m1) / 2.0;
}
else
{
double d = __ieee754_hypot (absx, absy);
__real__ result = __ieee754_log (d) - scale * M_LN2;
}
__imag__ result = __ieee754_atan2 (__imag__ x, __real__ x);
}
else
{
__imag__ result = __nan ("");
if (rcls == FP_INFINITE || icls == FP_INFINITE)
/* Real or imaginary part is infinite. */
__real__ result = HUGE_VAL;
else
__real__ result = __nan ("");
}
return result;
}
__complex__ double
__cexp (__complex__ double x)
{
__complex__ double retval;
int rcls = fpclassify (__real__ x);
int icls = fpclassify (__imag__ x);
if (rcls >= FP_ZERO)
{
/* Real part is finite. */
if (icls >= FP_ZERO)
{
/* Imaginary part is finite. */
double exp_val = __ieee754_exp (__real__ x);
double sinix, cosix;
__sincos (__imag__ x, &sinix, &cosix);
if (isfinite (exp_val))
{
__real__ retval = exp_val * cosix;
__imag__ retval = exp_val * sinix;
}
else
{
__real__ retval = __copysign (exp_val, cosix);
__imag__ retval = __copysign (exp_val, sinix);
}
}
else
{
/* If the imaginary part is +-inf or NaN and the real part
is not +-inf the result is NaN + iNaN. */
__real__ retval = __nan ("");
__imag__ retval = __nan ("");
#ifdef FE_INVALID
feraiseexcept (FE_INVALID);
#endif
}
}
else if (rcls == FP_INFINITE)
{
/* Real part is infinite. */
if (icls >= FP_ZERO)
{
/* Imaginary part is finite. */
double value = signbit (__real__ x) ? 0.0 : HUGE_VAL;
if (icls == FP_ZERO)
{
/* Imaginary part is 0.0. */
__real__ retval = value;
__imag__ retval = __imag__ x;
}
else
{
double sinix, cosix;
__sincos (__imag__ x, &sinix, &cosix);
__real__ retval = __copysign (value, cosix);
__imag__ retval = __copysign (value, sinix);
}
}
else if (signbit (__real__ x) == 0)
{
__real__ retval = HUGE_VAL;
__imag__ retval = __nan ("");
#ifdef FE_INVALID
if (icls == FP_INFINITE)
feraiseexcept (FE_INVALID);
#endif
}
else
{
__real__ retval = 0.0;
__imag__ retval = __copysign (0.0, __imag__ x);
}
}
else
{
/* If the real part is NaN the result is NaN + iNaN. */
__real__ retval = __nan ("");
__imag__ retval = __nan ("");
#ifdef FE_INVALID
if (rcls != FP_NAN || icls != FP_NAN)
feraiseexcept (FE_INVALID);
#endif
}
return retval;
}
{
return 0;
}
int
main (int argc, char **argv _GL_UNUSED)
{
float (*my_floorf) (float) = argc ? floorf : dummy;
/* See IEEE 754, section 6.3:
"the sign of the result of the round floating-point number to
integral value operation is the sign of the operand. These rules
shall apply even when operands or results are zero or infinite." */
/* Zero. */
ASSERT (!signbit (my_floorf (0.0f)));
ASSERT (!!signbit (my_floorf (minus_zerof)) == !!signbit (minus_zerof));
/* Positive numbers. */
ASSERT (!signbit (my_floorf (0.3f)));
ASSERT (!signbit (my_floorf (0.7f)));
/* Negative numbers. */
ASSERT (!!signbit (my_floorf (-0.3f)) == !!signbit (minus_zerof));
ASSERT (!!signbit (my_floorf (-0.7f)) == !!signbit (minus_zerof));
/* [MX] shaded specification in POSIX. */
/* NaN. */
ASSERT (isnanf (floorf (NaNf ())));
/* Infinity. */
ASSERT (floorf (Infinityf ()) == Infinityf ());
ASSERT (floorf (- Infinityf ()) == - Infinityf ());
inline bool _Stl_is_neg_inf(double x) { return isinf(x) && signbit(x); }
inline bool _Stl_is_neg_nan(double x) { return isnan(x) && signbit(x); }
bool _Stl_is_neg_inf(double x) { return !isfinite(x) && signbit(x); }
__complex__ double
__cacosh (__complex__ double x)
{
__complex__ double res;
int rcls = fpclassify (__real__ x);
int icls = fpclassify (__imag__ x);
if (rcls <= FP_INFINITE || icls <= FP_INFINITE)
{
if (icls == FP_INFINITE)
{
__real__ res = HUGE_VAL;
if (rcls == FP_NAN)
__imag__ res = __nan ("");
else
__imag__ res = __copysign ((rcls == FP_INFINITE
? (__real__ x < 0.0
? M_PI - M_PI_4 : M_PI_4)
: M_PI_2), __imag__ x);
}
else if (rcls == FP_INFINITE)
{
__real__ res = HUGE_VAL;
if (icls >= FP_ZERO)
__imag__ res = __copysign (signbit (__real__ x) ? M_PI : 0.0,
__imag__ x);
else
__imag__ res = __nan ("");
}
else
{
__real__ res = __nan ("");
__imag__ res = __nan ("");
}
}
else if (rcls == FP_ZERO && icls == FP_ZERO)
{
__real__ res = 0.0;
__imag__ res = __copysign (M_PI_2, __imag__ x);
}
else
{
__complex__ double y;
__real__ y = (__real__ x - __imag__ x) * (__real__ x + __imag__ x) - 1.0;
__imag__ y = 2.0 * __real__ x * __imag__ x;
y = __csqrt (y);
if (__real__ x < 0.0)
y = -y;
__real__ y += __real__ x;
__imag__ y += __imag__ x;
res = __clog (y);
/* We have to use the positive branch. */
if (__real__ res < 0.0)
res = -res;
}
return res;
}
int
__printf_fphex (FILE *fp,
const struct printf_info *info,
const void *const *args)
{
/* The floating-point value to output. */
union
{
union ieee754_double dbl;
union ieee854_long_double ldbl;
}
fpnum;
/* Locale-dependent representation of decimal point. */
const char *decimal;
wchar_t decimalwc;
/* "NaN" or "Inf" for the special cases. */
const char *special = NULL;
const wchar_t *wspecial = NULL;
/* Buffer for the generated number string for the mantissa. The
maximal size for the mantissa is 128 bits. */
char numbuf[32];
char *numstr="";
char *numend;
wchar_t wnumbuf[32];
wchar_t *wnumstr=L"";
wchar_t *wnumend;
int negative;
/* The maximal exponent of two in decimal notation has 5 digits. */
char expbuf[5];
char *expstr;
wchar_t wexpbuf[5];
wchar_t *wexpstr;
int expnegative = 0;
int exponent = 0;
/* Non-zero is mantissa is zero. */
int zero_mantissa = 1;
/* The leading digit before the decimal point. */
char leading = '0';
/* Precision. */
int precision = info->prec;
/* Width. */
int width = info->width;
/* Number of characters written. */
int done = 0;
/* Nonzero if this is output on a wide character stream. */
int wide = info->wide;
/* Figure out the decimal point character. */
if (info->extra == 0)
{
decimal = _NL_CURRENT (LC_NUMERIC, DECIMAL_POINT);
decimalwc = _NL_CURRENT_WORD (LC_NUMERIC, _NL_NUMERIC_DECIMAL_POINT_WC);
}
else
{
decimal = _NL_CURRENT (LC_MONETARY, MON_DECIMAL_POINT);
decimalwc = _NL_CURRENT_WORD (LC_MONETARY,
_NL_MONETARY_DECIMAL_POINT_WC);
}
/* The decimal point character must never be zero. */
assert (*decimal != '\0' && decimalwc != L'\0');
/* Fetch the argument value. */
#ifndef __NO_LONG_DOUBLE_MATH
if (info->is_long_double && sizeof (long double) > sizeof (double))
{
fpnum.ldbl.d = *(const long double *) args[0];
/* Check for special values: not a number or infinity. */
if (__isnanl (fpnum.ldbl.d))
{
if (isupper (info->spec))
{
special = "NAN";
wspecial = L"NAN";
}
else
{
special = "nan";
wspecial = L"nan";
}
negative = 0;
}
else
{
if (__isinfl (fpnum.ldbl.d))
{
if (isupper (info->spec))
{
special = "INF";
wspecial = L"INF";
}
else
{
special = "inf";
wspecial = L"inf";
}
}
negative = signbit (fpnum.ldbl.d);
}
}
else
#endif /* no long double */
{
fpnum.dbl.d = *(const double *) args[0];
/* Check for special values: not a number or infinity. */
if (__isnan (fpnum.dbl.d))
{
if (isupper (info->spec))
{
special = "NAN";
wspecial = L"NAN";
}
else
{
special = "nan";
wspecial = L"nan";
}
negative = 0;
}
else
{
if (__isinf (fpnum.dbl.d))
{
if (isupper (info->spec))
{
special = "INF";
wspecial = L"INF";
}
else
{
special = "inf";
wspecial = L"inf";
}
}
negative = signbit (fpnum.dbl.d);
}
}
if (special)
{
int width = info->width;
if (negative || info->showsign || info->space)
--width;
width -= 3;
if (!info->left && width > 0)
PADN (' ', width);
if (negative)
outchar ('-');
else if (info->showsign)
outchar ('+');
else if (info->space)
outchar (' ');
PRINT (special, wspecial, 3);
if (info->left && width > 0)
PADN (' ', width);
return done;
}
if (info->is_long_double == 0 || sizeof (double) == sizeof (long double))
{
/* We have 52 bits of mantissa plus one implicit digit. Since
52 bits are representable without rest using hexadecimal
digits we use only the implicit digits for the number before
the decimal point. */
unsigned long long int num;
num = (((unsigned long long int) fpnum.dbl.ieee.mantissa0) << 32
| fpnum.dbl.ieee.mantissa1);
zero_mantissa = num == 0;
if (sizeof (unsigned long int) > 6)
{
wnumstr = _itowa_word (num, wnumbuf + (sizeof wnumbuf) / sizeof (wchar_t), 16,
info->spec == 'A');
numstr = _itoa_word (num, numbuf + sizeof numbuf, 16,
info->spec == 'A');
}
else
{
wnumstr = _itowa (num, wnumbuf + sizeof wnumbuf / sizeof (wchar_t), 16,
info->spec == 'A');
numstr = _itoa (num, numbuf + sizeof numbuf, 16,
info->spec == 'A');
}
/* Fill with zeroes. */
while (wnumstr > wnumbuf + (sizeof wnumbuf - 52) / sizeof (wchar_t))
{
*--wnumstr = L'0';
*--numstr = '0';
}
leading = fpnum.dbl.ieee.exponent == 0 ? '0' : '1';
exponent = fpnum.dbl.ieee.exponent;
if (exponent == 0)
{
if (zero_mantissa)
expnegative = 0;
else
{
/* This is a denormalized number. */
expnegative = 1;
exponent = IEEE754_DOUBLE_BIAS - 1;
}
}
else if (exponent >= IEEE754_DOUBLE_BIAS)
{
expnegative = 0;
exponent -= IEEE754_DOUBLE_BIAS;
}
else
{
expnegative = 1;
exponent = -(exponent - IEEE754_DOUBLE_BIAS);
}
}
#ifdef PRINT_FPHEX_LONG_DOUBLE
else
PRINT_FPHEX_LONG_DOUBLE;
#endif
/* Look for trailing zeroes. */
if (! zero_mantissa)
{
wnumend = &wnumbuf[sizeof wnumbuf / sizeof wnumbuf[0]];
numend = &numbuf[sizeof numbuf / sizeof numbuf[0]];
while (wnumend[-1] == L'0')
{
--wnumend;
--numend;
}
if (precision == -1)
precision = numend - numstr;
else if (precision < numend - numstr
&& (numstr[precision] > '8'
|| (('A' < '0' || 'a' < '0')
&& numstr[precision] < '0')
|| (numstr[precision] == '8'
&& (precision + 1 < numend - numstr
/* Round to even. */
|| (precision > 0
&& ((numstr[precision - 1] & 1)
^ (isdigit (numstr[precision - 1]) == 0)))
|| (precision == 0
&& ((leading & 1)
^ (isdigit (leading) == 0)))))))
{
/* Round up. */
int cnt = precision;
while (--cnt >= 0)
{
char ch = numstr[cnt];
/* We assume that the digits and the letters are ordered
like in ASCII. This is true for the rest of GNU, too. */
if (ch == '9')
{
wnumstr[cnt] = (wchar_t) info->spec;
numstr[cnt] = info->spec; /* This is tricky,
think about it! */
break;
}
else if (tolower (ch) < 'f')
{
++numstr[cnt];
++wnumstr[cnt];
break;
}
else
{
numstr[cnt] = '0';
wnumstr[cnt] = L'0';
}
}
if (cnt < 0)
{
/* The mantissa so far was fff...f Now increment the
leading digit. Here it is again possible that we
get an overflow. */
if (leading == '9')
leading = info->spec;
else if (tolower (leading) < 'f')
++leading;
else
{
leading = '1';
if (expnegative)
{
exponent -= 4;
if (exponent <= 0)
{
exponent = -exponent;
expnegative = 0;
}
}
else
exponent += 4;
}
}
}
}
else
{
if (precision == -1)
precision = 0;
numend = numstr;
wnumend = wnumstr;
}
/* Now we can compute the exponent string. */
expstr = _itoa_word (exponent, expbuf + sizeof expbuf, 10, 0);
wexpstr = _itowa_word (exponent,
wexpbuf + sizeof wexpbuf / sizeof (wchar_t), 10, 0);
/* Now we have all information to compute the size. */
width -= ((negative || info->showsign || info->space)
/* Sign. */
+ 2 + 1 + 0 + precision + 1 + 1
/* 0x h . hhh P ExpoSign. */
+ ((expbuf + sizeof expbuf) - expstr));
/* Exponent. */
/* Count the decimal point.
A special case when the mantissa or the precision is zero and the `#'
is not given. In this case we must not print the decimal point. */
if (precision > 0 || info->alt)
width -= wide ? 1 : strlen (decimal);
if (!info->left && info->pad != '0' && width > 0)
PADN (' ', width);
if (negative)
outchar ('-');
else if (info->showsign)
outchar ('+');
else if (info->space)
outchar (' ');
outchar ('0');
if ('X' - 'A' == 'x' - 'a')
outchar (info->spec + ('x' - 'a'));
else
outchar (info->spec == 'A' ? 'X' : 'x');
if (!info->left && info->pad == '0' && width > 0)
PADN ('0', width);
outchar (leading);
if (precision > 0 || info->alt)
{
const wchar_t *wtmp = &decimalwc;
PRINT (decimal, wtmp, wide ? 1 : strlen (decimal));
}
if (precision > 0)
{
ssize_t tofill = precision - (numend - numstr);
PRINT (numstr, wnumstr, MIN (numend - numstr, precision));
if (tofill > 0)
PADN ('0', tofill);
}
if ('P' - 'A' == 'p' - 'a')
outchar (info->spec + ('p' - 'a'));
else
outchar (info->spec == 'A' ? 'P' : 'p');
outchar (expnegative ? '-' : '+');
PRINT (expstr, wexpstr, (expbuf + sizeof expbuf) - expstr);
if (info->left && info->pad != '0' && width > 0)
PADN (info->pad, width);
return done;
}
static t_int *matrixnb_perform(t_int *w)
{
t_matrix *x = (t_matrix *)(w[1]);
int nblock = (int)(w[2]);
t_float **ivecs = x->x_ivecs;
t_float **ovecs = x->x_ovecs;
t_float **osums = x->x_osums;
int *cellp = x->x_cells;
float *gainp = x->x_gains;
float *coefp = x->x_coefs;
float *incrp = x->x_incrs;
float *bigincrp = x->x_bigincrs;
int *nleftp = x->x_remains;
int indx;
for (indx = 0; indx < x->x_numinlets; indx++){
t_float *ivec = *ivecs++;
t_float **ovecp = osums;
if (indx){
if (*x->x_signalscalars[indx] || !signbit(*x->x_signalscalars[indx]))
{
pd_error(x, "inlet: expected 'signal' but got 'float'");
*x->x_signalscalars[indx] = -0.0;
}
if (!(x->x_hasfeeders[indx])) ivec = x->x_zerovec;
}
int ondx = x->x_numoutlets;
while (ondx--){
t_float *in = ivec;
t_float *out = *ovecp;
float nleft = *nleftp;
int sndx = nblock;
if (nleft >= nblock){
float coef = *coefp;
float incr = *incrp;
if ((*nleftp -= nblock) == 0){
*coefp = (*cellp ? *gainp : 0.);
}
else{
*coefp += *bigincrp;
};
while (sndx--)
*out++ += *in++ * coef, coef += incr;
}
else if (nleft > 0){
float coef = *coefp;
float incr = *incrp;
sndx -= nleft;
do{
*out++ += *in++ * coef, coef += incr;
}while (--nleft);
if (*cellp)
{
coef = *coefp = *gainp;
while (sndx--){
*out++ += *in++ * coef;
};
}
else{
*coefp = 0.;
};
*nleftp = 0;
}
else if (*cellp)
{
float coef = *coefp;
while (sndx--){
*out++ += *in++ * coef;
};
}
cellp++;
ovecp++;
gainp++;
coefp++;
incrp++;
bigincrp++;
nleftp++;
}
}
osums = x->x_osums;
indx = x->x_numoutlets;
while (indx--)
{
t_float *in = *osums++;
t_float *out = *ovecs++;
int sndx = nblock;
while (sndx--)
{
*out++ = *in;
*in++ = 0.;
}
}
return (w + 3);
}
__complex__ double
__clog10 (__complex__ double x)
{
__complex__ double result;
int rcls = fpclassify (__real__ x);
int icls = fpclassify (__imag__ x);
if (__builtin_expect (rcls == FP_ZERO && icls == FP_ZERO, 0))
{
/* Real and imaginary part are 0.0. */
__imag__ result = signbit (__real__ x) ? M_PI : 0.0;
__imag__ result = __copysign (__imag__ result, __imag__ x);
/* Yes, the following line raises an exception. */
__real__ result = -1.0 / fabs (__real__ x);
}
else if (__builtin_expect (rcls != FP_NAN && icls != FP_NAN, 1))
{
/* Neither real nor imaginary part is NaN. */
double absx = fabs (__real__ x), absy = fabs (__imag__ x);
int scale = 0;
if (absx < absy)
{
double t = absx;
absx = absy;
absy = t;
}
if (absx > DBL_MAX / 2.0)
{
scale = -1;
absx = __scalbn (absx, scale);
absy = (absy >= DBL_MIN * 2.0 ? __scalbn (absy, scale) : 0.0);
}
else if (absx < DBL_MIN && absy < DBL_MIN)
{
scale = DBL_MANT_DIG;
absx = __scalbn (absx, scale);
absy = __scalbn (absy, scale);
}
if (absx == 1.0 && scale == 0)
{
double absy2 = absy * absy;
if (absy2 <= DBL_MIN * 2.0 * M_LN10)
{
#if __FLT_EVAL_METHOD__ == 0
__real__ result = (absy2 / 2.0 - absy2 * absy2 / 4.0) * M_LOG10E;
#else
volatile double force_underflow = absy2 * absy2 / 4.0;
__real__ result = (absy2 / 2.0 - force_underflow) * M_LOG10E;
#endif
}
else
__real__ result = __log1p (absy2) * (M_LOG10E / 2.0);
}
else if (absx > 1.0 && absx < 2.0 && absy < 1.0 && scale == 0)
{
double d2m1 = (absx - 1.0) * (absx + 1.0);
if (absy >= DBL_EPSILON)
d2m1 += absy * absy;
__real__ result = __log1p (d2m1) * (M_LOG10E / 2.0);
}
else if (absx < 1.0
&& absx >= 0.75
&& absy < DBL_EPSILON / 2.0
&& scale == 0)
{
double d2m1 = (absx - 1.0) * (absx + 1.0);
__real__ result = __log1p (d2m1) * (M_LOG10E / 2.0);
}
else if (absx < 1.0 && (absx >= 0.75 || absy >= 0.5) && scale == 0)
{
double d2m1 = __x2y2m1 (absx, absy);
__real__ result = __log1p (d2m1) * (M_LOG10E / 2.0);
}
else
{
double d = __ieee754_hypot (absx, absy);
__real__ result = __ieee754_log10 (d) - scale * M_LOG10_2;
}
__imag__ result = M_LOG10E * __ieee754_atan2 (__imag__ x, __real__ x);
}
else
{
__imag__ result = __nan ("");
if (rcls == FP_INFINITE || icls == FP_INFINITE)
/* Real or imaginary part is infinite. */
__real__ result = HUGE_VAL;
else
__real__ result = __nan ("");
}
return result;
}
double
copysign (double x, double y)
{
return (signbit (x) != signbit (y) ? - x : x);
}
__complex__ double
__ccosh (__complex__ double x)
{
__complex__ double retval;
int rcls = fpclassify (__real__ x);
int icls = fpclassify (__imag__ x);
if (__glibc_likely (rcls >= FP_ZERO))
{
/* Real part is finite. */
if (__glibc_likely (icls >= FP_ZERO))
{
/* Imaginary part is finite. */
const int t = (int) ((DBL_MAX_EXP - 1) * M_LN2);
double sinix, cosix;
if (__glibc_likely (fabs (__imag__ x) > DBL_MIN))
{
__sincos (__imag__ x, &sinix, &cosix);
}
else
{
sinix = __imag__ x;
cosix = 1.0;
}
if (fabs (__real__ x) > t)
{
double exp_t = __ieee754_exp (t);
double rx = fabs (__real__ x);
if (signbit (__real__ x))
sinix = -sinix;
rx -= t;
sinix *= exp_t / 2.0;
cosix *= exp_t / 2.0;
if (rx > t)
{
rx -= t;
sinix *= exp_t;
cosix *= exp_t;
}
if (rx > t)
{
/* Overflow (original real part of x > 3t). */
__real__ retval = DBL_MAX * cosix;
__imag__ retval = DBL_MAX * sinix;
}
else
{
double exp_val = __ieee754_exp (rx);
__real__ retval = exp_val * cosix;
__imag__ retval = exp_val * sinix;
}
}
else
{
__real__ retval = __ieee754_cosh (__real__ x) * cosix;
__imag__ retval = __ieee754_sinh (__real__ x) * sinix;
}
math_check_force_underflow_complex (retval);
}
else
{
__imag__ retval = __real__ x == 0.0 ? 0.0 : __nan ("");
__real__ retval = __nan ("") + __nan ("");
if (icls == FP_INFINITE)
feraiseexcept (FE_INVALID);
}
}
else if (rcls == FP_INFINITE)
{
/* Real part is infinite. */
if (__glibc_likely (icls > FP_ZERO))
{
/* Imaginary part is finite. */
double sinix, cosix;
if (__glibc_likely (fabs (__imag__ x) > DBL_MIN))
{
__sincos (__imag__ x, &sinix, &cosix);
}
else
{
sinix = __imag__ x;
cosix = 1.0;
}
__real__ retval = __copysign (HUGE_VAL, cosix);
__imag__ retval = (__copysign (HUGE_VAL, sinix)
* __copysign (1.0, __real__ x));
}
else if (icls == FP_ZERO)
{
/* Imaginary part is 0.0. */
__real__ retval = HUGE_VAL;
__imag__ retval = __imag__ x * __copysign (1.0, __real__ x);
}
else
{
/* The addition raises the invalid exception. */
__real__ retval = HUGE_VAL;
__imag__ retval = __nan ("") + __nan ("");
if (icls == FP_INFINITE)
feraiseexcept (FE_INVALID);
}
}
else
{
__real__ retval = __nan ("");
__imag__ retval = __imag__ x == 0.0 ? __imag__ x : __nan ("");
}
return retval;
}
void Player::resolveChunkIntersection(const Manifold& manifold, const AABBCollider& blockCollider) {
//transform.translate(manifold.seperationVector);
//std::cout << "(" << manifold.seperationVector.x << ", " << manifold.seperationVector.y << ", " << manifold.seperationVector.z << ")" << std::endl;
glm::vec3 directionOfMovement(m_currentPosition - m_lastPosition);
//std::cout << "(" << directionOfMovement.x << ", " << directionOfMovement.y << ", " << directionOfMovement.z << ")" << std::endl;
glm::vec3 seperation(manifold.seperationVector);
// Add displacement to axes that caused the collision
bool collideX = false;
if (directionOfMovement.x != 0) {
glm::vec3 playerMinPoint(m_lastPosition.x - 0.5f + directionOfMovement.x, m_lastPosition.y - 1.0f, m_lastPosition.z - 0.5f);
glm::vec3 playerMaxPoint(m_lastPosition.x + 0.5f + directionOfMovement.x, m_lastPosition.y + 1.0f, m_lastPosition.z + 0.5f);
AABBCollider playerCollider(playerMinPoint, playerMaxPoint);
if (AABBCollider::checkCollision(playerCollider, blockCollider)) {
collideX = true;
}
}
bool collideY = false;
if (directionOfMovement.y != 0) {
glm::vec3 playerMinPoint(m_lastPosition.x - 0.5f, m_lastPosition.y - 1.0f + directionOfMovement.y, m_lastPosition.z - 0.5f);
glm::vec3 playerMaxPoint(m_lastPosition.x + 0.5f, m_lastPosition.y + 1.0f + directionOfMovement.y, m_lastPosition.z + 0.5f);
AABBCollider playerCollider(playerMinPoint, playerMaxPoint);
if (AABBCollider::checkCollision(playerCollider, blockCollider)) {
collideY = true;
}
}
bool collideZ = false;
if (directionOfMovement.z != 0) {
glm::vec3 playerMinPoint(m_lastPosition.x - 0.5f, m_lastPosition.y - 1.0f, m_lastPosition.z - 0.5f + directionOfMovement.z);
glm::vec3 playerMaxPoint(m_lastPosition.x + 0.5f, m_lastPosition.y + 1.0f, m_lastPosition.z + 0.5f + directionOfMovement.z);
AABBCollider playerCollider(playerMinPoint, playerMaxPoint);
if (AABBCollider::checkCollision(playerCollider, blockCollider)) {
collideZ = true;
}
}
//// Only displace in the axes the player is moving in
//if (abs(directionOfMovement.x) == 0) {
// seperation.x = 0;
//}
//if (abs(directionOfMovement.y) == 0) {
// seperation.y = 0;
//}
//if (abs(directionOfMovement.z) == 0) {
// seperation.z = 0;
//}
// Only displace in the axes that caused the collision
if (collideX || collideY || collideZ) {
if (!collideX) {
seperation.x = 0;
}
if (!collideY) {
seperation.y = 0;
}
if (!collideZ) {
seperation.z = 0;
}
}
// Choose the minimum axis
float32 depth = 0;
int32 axis = 0;
for (int32 i = 0; i < 3; i++) {
if (depth == 0) {
depth = seperation[i];
axis = i;
}
else {
if (seperation[i] != 0 && (abs(seperation[i]) < abs(depth))) {
depth = seperation[i];
axis = i;
}
}
}
for (int32 i = 0; i < 3; i++) {
if (i == axis) {
seperation[i] = depth;
}
else {
seperation[i] = 0;
}
}
//if (abs(seperation.x) < abs(seperation.y)) {
// if (abs(seperation.x) < abs(seperation.z)) {
// // min is x
// seperation.y = 0;
// seperation.z = 0;
// }
// else {
// // min is z
// seperation.y = 0;
// seperation.x = 0;
// }
//}
//else {
// if (abs(seperation.y) < abs(seperation.z)) {
// // min is y
// seperation.x = 0;
// seperation.z = 0;
// }
// else {
// // min is z
// seperation.y = 0;
// seperation.x = 0;
// }
//}
//glm::vec3 displacement = glm::proj(seperation, -glm::normalize(directionOfMovement));
glm::vec3 displacement = seperation;
//std::cout << "(" << displacement.x << ", " << displacement.y << ", " << displacement.z << ")" << std::endl;
// And just a hint of bias
const static float32 bias = 0.0005f;
if (abs(seperation.x) > 0) {
displacement.x += signbit(seperation.x) ? -bias : bias;
}
if (abs(seperation.y) > 0) {
displacement.y += signbit(seperation.y) ? -bias : bias;
}
if (abs(seperation.z) > 0) {
displacement.z += signbit(seperation.z) ? -bias : bias;
}
//m_lastPosition = m_currentPosition;
transform.translate(displacement);
m_currentPosition = glm::vec3(transform.xPos, transform.yPos, transform.zPos);
if (displacement.y > 0) {
// Stop!
m_velocityY = 0;
//m_glueToGround = true;
// Just a hint of bias
//transform.translate(0, 0.0005f, 0);
}
// If im moving in the positive x
//if (directionOfMovement.x > 0) {
//
//}
//else if (directionOfMovement.x < 0) {
//
//}
//else {
// displacement.x = 0;
//}
//
//if (manifold.seperationVector.x == 0 && manifold.seperationVector.z == 0 && manifold.seperationVector.y > 0) {
// m_glueToGround = true;
//
// // Stop!
// m_velocityY = 0;
// transform.translate(0, 0.0005f, 0); // HACK WARNING, Adding a bias here so I can get it to work for the demo
//}
}
static int print_f(void (*printchar_handler)(struct printchar_handler_data *d, int c),
struct printchar_handler_data *printchar_data, long double r, int width,
int precision, unsigned int ops, int base, int with_exp, int is_shortened) {
char buff[PRINT_F_BUFF_SZ], *str, *end, *prefix, *postfix;
DOUBLE ip, fp, ep;
int pc, i, ch, len, prefix_len, postfix_len, pad_count, sign_count, zero_left, letter_base;
assert(printchar_handler != NULL);
assert(width >= 0);
assert(precision >= 0);
postfix = end = str = &buff[0] + sizeof buff / sizeof buff[0] - 1;
*end = '\0';
prefix = signbit(r) ? (r = -r, base == 16)
? ops & OPS_SPEC_UPPER_CASE ? "-0X" : "-0x"
: "-"
: ops & OPS_FLAG_WITH_SIGN ? base == 16
? ops & OPS_SPEC_UPPER_CASE ? "+0X" : "+0x"
: "+"
: ops & OPS_FLAG_EXTRA_SPACE ? base == 16
? ops & OPS_SPEC_UPPER_CASE ? " 0X" : " 0x"
: " "
: base == 16 ? ops & OPS_SPEC_UPPER_CASE ? "0X" : "0x"
: "";
sign_count = i = pc = 0;
prefix_len = strlen(prefix);
letter_base = ops & OPS_SPEC_UPPER_CASE ? 'A' : 'a';
precision = ops & OPS_PREC_IS_GIVEN ? is_shortened ?
max(precision, 1) : precision
: base == 16 ? 12 : PRINT_F_PREC_DEFAULT;
fp = MODF(r, &ip);
if (with_exp || is_shortened) {
ep = 0.0L;
while (ip >= base) fp = MODF((ip + fp) / base, &ip), ep += 1.0L;
if (fp != 0.0L) while (ip == 0.0L) fp = MODF((ip + fp) * base, &ip), ep -= 1.0L;
if ((ep < -4) || (ep >= precision)) with_exp = 1;
}
fp = with_exp ? fp : MODF(r, &ip);
precision -= is_shortened ? ceill(LOG10(ip)) + (ip != 0.0L) : 0;
assert(precision >= 0);
for (; (sign_count < precision) && (FMOD(fp, 1.0L) != 0.0L); ++sign_count) fp *= base;
fp = roundl(fp);
ip = precision ? fp != POW(base, sign_count)
? ip : ip + 1.0L : roundl(ip + fp);
fp = fp != POW(base, sign_count) ? fp : 0.0L;
if (with_exp && (ip >= base)) fp = MODF((ip + fp) / base, &ip), ep += 1.0L;
if (with_exp) {
do {
ch = FMOD(FABS(ep), base);
assert((ch >= 0) && (ch < base));
if (ch >= 10) ch += letter_base - 10 - '0';
*--postfix = ch + '0';
MODF(ep / base, &ep);
} while (ep != 0.0L);
if ((strlen(postfix) == 1) && (base != 16)) *--postfix = '0';
*--postfix = signbit(ep) ? '-' : '+';
*--postfix = base == 16 ? ops & OPS_SPEC_UPPER_CASE ?
'P' : 'p'
: ops & OPS_SPEC_UPPER_CASE ? 'E' : 'e';
str = end = postfix - 1;
*end = '\0';
}
for (; i < sign_count; ++i) {
ch = FMOD(fp, base);
assert((ch >= 0) && (ch < base));
if (ch >= 10) ch += letter_base - 10 - '0';
*--str = ch + '0';
MODF(fp / base, &fp);
}
if ((precision && !is_shortened) || sign_count
|| (ops & OPS_FLAG_WITH_SPEC)) {
*--str = '.';
}
do {
ch = (int)FMOD(ip, (long double)base);
assert((ch >= 0) && (ch < base));
if (ch >= 10) ch += letter_base - 10 - '0';
*--str = ch + '0';
MODF(ip / base, &ip);
} while (ip != 0.0L);
len = end - str;
postfix_len = strlen(postfix);
zero_left = is_shortened ? 0 : precision - sign_count;
pad_count = max(width - prefix_len - len - zero_left - postfix_len, 0);
if (!(ops & (OPS_FLAG_ZERO_PAD | OPS_FLAG_LEFT_ALIGN))) {
pc += pad_count;
while (pad_count--) printchar_handler(printchar_data, ' ');
}
pc += prefix_len;
while (prefix_len--) printchar_handler(printchar_data, *prefix++);
if (ops & OPS_FLAG_ZERO_PAD) {
pc += pad_count;
while (pad_count--) printchar_handler(printchar_data, '0');
}
pc += len;
while (len--) printchar_handler(printchar_data, *str++);
pc += zero_left;
while (zero_left--) printchar_handler(printchar_data, '0');
pc += postfix_len;
while (postfix_len--) printchar_handler(printchar_data, *postfix++);
if (ops & OPS_FLAG_LEFT_ALIGN) {
pc += pad_count;
while (pad_count--) printchar_handler(printchar_data, ' ');
}
return pc;
}
__EXTERN_FUNC__ int inline correctFpException(esweep_object* obj) {
int i;
Wave *wave;
Polar *polar;
Complex *cpx;
Surface *surf;
if (fetestexcept(FE_INVALID)) {
fprintf(stderr, "Invalid floating point operation occured.\n");
feclearexcept(FE_INVALID);
return 0;
}
if (fetestexcept(FE_OVERFLOW | FE_DIVBYZERO)) {
// find the errors and correct them by rounding to neares representable
switch (obj->type) {
case WAVE:
wave=(Wave*) obj->data;
for (i=0; i < obj->size; i++) {
if (isinf(wave[i])) {
if (signbit(wave[i])) {
wave[i]=-MAXREAL;
} else {
wave[i]=MAXREAL;
}
}
}
break;
case POLAR:
polar=(Polar*) obj->data;
for (i=0; i < obj->size; i++) {
if (isinf(polar[i].abs)) {
if (signbit(polar[i].abs)) {
polar[i].abs=-MAXREAL;
} else {
polar[i].abs=MAXREAL;
}
}
if (isinf(polar[i].arg)) {
if (signbit(polar[i].arg)) {
polar[i].arg=-MAXREAL;
} else {
polar[i].arg=MAXREAL;
}
}
}
break;
case COMPLEX:
cpx=(Complex*) obj->data;
for (i=0; i < obj->size; i++) {
if (isinf(cpx[i].real)) {
if (signbit(cpx[i].real)) {
cpx[i].real=-MAXREAL;
} else {
cpx[i].real=MAXREAL;
}
}
if (isinf(cpx[i].imag)) {
if (signbit(cpx[i].imag)) {
cpx[i].imag=-MAXREAL;
} else {
cpx[i].imag=MAXREAL;
}
}
}
break;
case SURFACE:
default:
break;
}
feclearexcept(FE_OVERFLOW | FE_DIVBYZERO);
}
return 1;
}
int
__APPEND (FUNC_PREFIX, ecvt_r) (FLOAT_TYPE value, int ndigit, int *decpt,
int *sign, char *buf, size_t len)
{
int exponent = 0;
if (isfinite (value) && value != 0.0)
{
/* Slow code that doesn't require -lm functions. */
FLOAT_TYPE d;
FLOAT_TYPE f = 1.0;
if (value < 0.0)
d = -value;
else
d = value;
/* For denormalized numbers the d < 1.0 case below won't work,
as f can overflow to +Inf. */
if (d < FLOAT_MIN_10_NORM)
{
value /= FLOAT_MIN_10_NORM;
if (value < 0.0)
d = -value;
else
d = value;
exponent += FLOAT_MIN_10_EXP;
}
if (d < 1.0)
{
do
{
f *= 10.0;
--exponent;
}
while (d * f < 1.0);
value *= f;
}
else if (d >= 10.0)
{
do
{
f *= 10;
++exponent;
}
while (d >= f * 10.0);
value /= f;
}
}
else if (value == 0.0)
/* SUSv2 leaves it unspecified whether *DECPT is 0 or 1 for 0.0.
This could be changed to -1 if we want to return 0. */
exponent = 0;
if (ndigit <= 0 && len > 0)
{
buf[0] = '\0';
*decpt = 1;
*sign = isfinite (value) ? signbit (value) != 0 : 0;
}
else
if (__APPEND (FUNC_PREFIX, fcvt_r) (value, MIN (ndigit, NDIGIT_MAX) - 1,
decpt, sign, buf, len))
return -1;
*decpt += exponent;
return 0;
}
__complex__ long double
__csinhl (__complex__ long double x)
{
__complex__ long double retval;
int negate = signbit (__real__ x);
int rcls = fpclassify (__real__ x);
int icls = fpclassify (__imag__ x);
__real__ x = fabsl (__real__ x);
if (__glibc_likely (rcls >= FP_ZERO))
{
/* Real part is finite. */
if (__glibc_likely (icls >= FP_ZERO))
{
/* Imaginary part is finite. */
const int t = (int) ((LDBL_MAX_EXP - 1) * M_LN2l);
long double sinix, cosix;
if (__glibc_likely (fabsl (__imag__ x) > LDBL_MIN))
{
__sincosl (__imag__ x, &sinix, &cosix);
}
else
{
sinix = __imag__ x;
cosix = 1.0;
}
if (negate)
cosix = -cosix;
if (fabsl (__real__ x) > t)
{
long double exp_t = __ieee754_expl (t);
long double rx = fabsl (__real__ x);
if (signbit (__real__ x))
cosix = -cosix;
rx -= t;
sinix *= exp_t / 2.0L;
cosix *= exp_t / 2.0L;
if (rx > t)
{
rx -= t;
sinix *= exp_t;
cosix *= exp_t;
}
if (rx > t)
{
/* Overflow (original real part of x > 3t). */
__real__ retval = LDBL_MAX * cosix;
__imag__ retval = LDBL_MAX * sinix;
}
else
{
long double exp_val = __ieee754_expl (rx);
__real__ retval = exp_val * cosix;
__imag__ retval = exp_val * sinix;
}
}
else
{
__real__ retval = __ieee754_sinhl (__real__ x) * cosix;
__imag__ retval = __ieee754_coshl (__real__ x) * sinix;
}
math_check_force_underflow_complex (retval);
}
else
{
if (rcls == FP_ZERO)
{
/* Real part is 0.0. */
__real__ retval = __copysignl (0.0, negate ? -1.0 : 1.0);
__imag__ retval = __nanl ("") + __nanl ("");
if (icls == FP_INFINITE)
feraiseexcept (FE_INVALID);
}
else
{
__real__ retval = __nanl ("");
__imag__ retval = __nanl ("");
feraiseexcept (FE_INVALID);
}
}
}
else if (__glibc_likely (rcls == FP_INFINITE))
{
/* Real part is infinite. */
if (__glibc_likely (icls > FP_ZERO))
{
/* Imaginary part is finite. */
long double sinix, cosix;
if (__glibc_likely (fabsl (__imag__ x) > LDBL_MIN))
{
__sincosl (__imag__ x, &sinix, &cosix);
}
else
{
sinix = __imag__ x;
cosix = 1.0;
}
__real__ retval = __copysignl (HUGE_VALL, cosix);
__imag__ retval = __copysignl (HUGE_VALL, sinix);
if (negate)
__real__ retval = -__real__ retval;
}
else if (icls == FP_ZERO)
{
/* Imaginary part is 0.0. */
__real__ retval = negate ? -HUGE_VALL : HUGE_VALL;
__imag__ retval = __imag__ x;
}
else
{
/* The addition raises the invalid exception. */
__real__ retval = HUGE_VALL;
__imag__ retval = __nanl ("") + __nanl ("");
#ifdef FE_INVALID
if (icls == FP_INFINITE)
feraiseexcept (FE_INVALID);
#endif
}
}
else
{
__real__ retval = __nanl ("");
__imag__ retval = __imag__ x == 0.0 ? __imag__ x : __nanl ("");
}
return retval;
}
int
__APPEND (FUNC_PREFIX, fcvt_r) (FLOAT_TYPE value, int ndigit, int *decpt,
int *sign, char *buf, size_t len)
{
ssize_t n;
ssize_t i;
int left;
if (buf == NULL)
{
__set_errno (EINVAL);
return -1;
}
left = 0;
if (isfinite (value))
{
*sign = signbit (value) != 0;
if (*sign)
value = -value;
if (ndigit < 0)
{
/* Rounding to the left of the decimal point. */
while (ndigit < 0)
{
FLOAT_TYPE new_value = value * 0.1;
if (new_value < 1.0)
{
ndigit = 0;
break;
}
value = new_value;
++left;
++ndigit;
}
}
}
else
/* Value is Inf or NaN. */
*sign = 0;
n = __snprintf (buf, len, "%.*" FLOAT_FMT_FLAG "f", MIN (ndigit, NDIGIT_MAX),
value);
/* Check for a too small buffer. */
if (n >= (ssize_t) len)
return -1;
i = 0;
while (i < n && isdigit (buf[i]))
++i;
*decpt = i;
if (i == 0)
/* Value is Inf or NaN. */
return 0;
if (i < n)
{
do
++i;
while (i < n && !isdigit (buf[i]));
if (*decpt == 1 && buf[0] == '0' && value != 0.0)
{
/* We must not have leading zeroes. Strip them all out and
adjust *DECPT if necessary. */
--*decpt;
while (i < n && buf[i] == '0')
{
--*decpt;
++i;
}
}
memmove (&buf[MAX (*decpt, 0)], &buf[i], n - i);
buf[n - (i - MAX (*decpt, 0))] = '\0';
}
if (left)
{
*decpt += left;
if ((ssize_t) --len > n)
{
while (left-- > 0 && n < (ssize_t) len)
buf[n++] = '0';
buf[n] = '\0';
}
}
return 0;
}
__complex__ long double
__cacoshl (__complex__ long double x)
{
__complex__ long double res;
int rcls = fpclassify (__real__ x);
int icls = fpclassify (__imag__ x);
if (rcls <= FP_INFINITE || icls <= FP_INFINITE)
{
if (icls == FP_INFINITE)
{
__real__ res = HUGE_VALL;
if (rcls == FP_NAN)
__imag__ res = __nanl ("");
else
__imag__ res = __copysignl ((rcls == FP_INFINITE
? (__real__ x < 0.0
? M_PIl - M_PI_4l : M_PI_4l)
: M_PI_2l), __imag__ x);
}
else if (rcls == FP_INFINITE)
{
__real__ res = HUGE_VALL;
if (icls >= FP_ZERO)
__imag__ res = __copysignl (signbit (__real__ x) ? M_PIl : 0.0,
__imag__ x);
else
__imag__ res = __nanl ("");
}
else
{
__real__ res = __nanl ("");
__imag__ res = __nanl ("");
}
}
else if (rcls == FP_ZERO && icls == FP_ZERO)
{
__real__ res = 0.0;
__imag__ res = __copysignl (M_PI_2l, __imag__ x);
}
/* The factor 16 is just a guess. */
else if (16.0L * fabsl (__imag__ x) < fabsl (__real__ x))
{
/* Kahan's formula which avoid cancellation through subtraction in
some cases. */
res = 2.0L * __clogl (__csqrtl ((x + 1.0L) / 2.0L)
+ __csqrtl ((x - 1.0L) / 2.0L));
if (signbit (__real__ res))
__real__ res = 0.0L;
}
else
{
__complex__ long double y;
__real__ y = (__real__ x - __imag__ x) * (__real__ x + __imag__ x) - 1.0;
__imag__ y = 2.0 * __real__ x * __imag__ x;
y = __csqrtl (y);
if (signbit (__real__ x))
y = -y;
__real__ y += __real__ x;
__imag__ y += __imag__ x;
res = __clogl (y);
}
return res;
}
ATF_TC_BODY(powf_zero_x, tc)
{
#ifndef __vax__
float z;
/*
* If x is +0.0 or -0.0, y > 0, and y
* is an odd integer, x is returned.
*/
z = powf(+0.0, 3.0);
if (fabsf(z) > 0.0 || signbit(z) != 0)
atf_tc_fail_nonfatal("powf(+0.0, 3.0) != +0.0");
z = powf(-0.0, 3.0);
if (fabsf(z) > 0.0 || signbit(z) == 0)
atf_tc_fail_nonfatal("powf(-0.0, 3.0) != -0.0");
/*
* If y > 0 and not an odd integer,
* if x is +0.0 or -0.0, +0.0 is returned.
*/
z = powf(+0.0, 4.0);
if (fabsf(z) > 0.0 || signbit(z) != 0)
atf_tc_fail_nonfatal("powf(+0.0, 4.0) != +0.0");
z = powf(-0.0, 4.0);
if (fabsf(z) > 0.0 || signbit(z) != 0)
atf_tc_fail_nonfatal("powf(-0.0, 4.0) != +0.0");
/*
* If y < 0 and x is +0.0 or -0.0, either +-HUGE_VAL,
* +-HUGE_VALF, or +-HUGE_VALL shall be returned.
*/
z = powf(+0.0, -4.0);
if (z != HUGE_VALF) {
atf_tc_expect_fail("PR port-amd64/45391");
atf_tc_fail_nonfatal("powf(+0.0, -4.0) != HUGE_VALF");
}
z = powf(-0.0, -4.0);
if (z != HUGE_VALF) {
atf_tc_expect_fail("PR port-amd64/45391");
atf_tc_fail_nonfatal("powf(-0.0, -4.0) != HUGE_VALF");
}
z = powf(+0.0, -5.0);
if (z != HUGE_VALF) {
atf_tc_expect_fail("PR port-amd64/45391");
atf_tc_fail_nonfatal("powf(+0.0, -5.0) != HUGE_VALF");
}
z = powf(-0.0, -5.0);
if (z != -HUGE_VALF)
atf_tc_fail_nonfatal("powf(-0.0, -5.0) != -HUGE_VALF");
#endif
}
__complex__ long double
__csinl (__complex__ long double x)
{
__complex__ long double retval;
int negate = signbit (__real__ x);
int rcls = fpclassify (__real__ x);
int icls = fpclassify (__imag__ x);
__real__ x = fabsl (__real__ x);
if (__builtin_expect (icls >= FP_ZERO, 1))
{
/* Imaginary part is finite. */
if (__builtin_expect (rcls >= FP_ZERO, 1))
{
/* Real part is finite. */
const int t = (int) ((LDBL_MAX_EXP - 1) * M_LN2l);
long double sinix, cosix;
if (__builtin_expect (rcls != FP_SUBNORMAL, 1))
{
__sincosl (__real__ x, &sinix, &cosix);
}
else
{
sinix = __real__ x;
cosix = 1.0;
}
if (fabsl (__imag__ x) > t)
{
long double exp_t = __ieee754_expl (t);
long double ix = fabsl (__imag__ x);
if (signbit (__imag__ x))
cosix = -cosix;
ix -= t;
sinix *= exp_t / 2.0L;
cosix *= exp_t / 2.0L;
if (ix > t)
{
ix -= t;
sinix *= exp_t;
cosix *= exp_t;
}
if (ix > t)
{
/* Overflow (original imaginary part of x > 3t). */
__real__ retval = LDBL_MAX * sinix;
__imag__ retval = LDBL_MAX * cosix;
}
else
{
long double exp_val = __ieee754_expl (ix);
__real__ retval = exp_val * sinix;
__imag__ retval = exp_val * cosix;
}
}
else
{
__real__ retval = __ieee754_coshl (__imag__ x) * sinix;
__imag__ retval = __ieee754_sinhl (__imag__ x) * cosix;
}
if (negate)
__real__ retval = -__real__ retval;
if (fabsl (__real__ retval) < LDBL_MIN)
{
volatile long double force_underflow
= __real__ retval * __real__ retval;
(void) force_underflow;
}
if (fabsl (__imag__ retval) < LDBL_MIN)
{
volatile long double force_underflow
= __imag__ retval * __imag__ retval;
(void) force_underflow;
}
}
else
{
if (icls == FP_ZERO)
{
/* Imaginary part is 0.0. */
__real__ retval = __nanl ("");
__imag__ retval = __imag__ x;
if (rcls == FP_INFINITE)
feraiseexcept (FE_INVALID);
}
else
{
__real__ retval = __nanl ("");
__imag__ retval = __nanl ("");
feraiseexcept (FE_INVALID);
}
}
}
else if (icls == FP_INFINITE)
{
/* Imaginary part is infinite. */
if (rcls == FP_ZERO)
{
/* Real part is 0.0. */
__real__ retval = __copysignl (0.0, negate ? -1.0 : 1.0);
__imag__ retval = __imag__ x;
}
else if (rcls > FP_ZERO)
{
/* Real part is finite. */
long double sinix, cosix;
if (__builtin_expect (rcls != FP_SUBNORMAL, 1))
{
__sincosl (__real__ x, &sinix, &cosix);
}
else
{
sinix = __real__ x;
cosix = 1.0;
}
__real__ retval = __copysignl (HUGE_VALL, sinix);
__imag__ retval = __copysignl (HUGE_VALL, cosix);
if (negate)
__real__ retval = -__real__ retval;
if (signbit (__imag__ x))
__imag__ retval = -__imag__ retval;
}
else
{
/* The addition raises the invalid exception. */
__real__ retval = __nanl ("");
__imag__ retval = HUGE_VALL;
if (rcls == FP_INFINITE)
feraiseexcept (FE_INVALID);
}
}
else
{
if (rcls == FP_ZERO)
__real__ retval = __copysignl (0.0, negate ? -1.0 : 1.0);
else
__real__ retval = __nanl ("");
__imag__ retval = __nanl ("");
}
return retval;
}
__host__ void single_precision_math_functions()
{
int iX;
float fX, fY;
acosf(1.0f);
acoshf(1.0f);
asinf(0.0f);
asinhf(0.0f);
atan2f(0.0f, 1.0f);
atanf(0.0f);
atanhf(0.0f);
cbrtf(0.0f);
ceilf(0.0f);
copysignf(1.0f, -2.0f);
cosf(0.0f);
coshf(0.0f);
//cospif(0.0f);
//cyl_bessel_i0f(0.0f);
//cyl_bessel_i1f(0.0f);
erfcf(0.0f);
//erfcinvf(2.0f);
//erfcxf(0.0f);
erff(0.0f);
//erfinvf(1.0f);
exp10f(0.0f);
exp2f(0.0f);
expf(0.0f);
expm1f(0.0f);
fabsf(1.0f);
fdimf(1.0f, 0.0f);
//fdividef(0.0f, 1.0f);
floorf(0.0f);
fmaf(1.0f, 2.0f, 3.0f);
fmaxf(0.0f, 0.0f);
fminf(0.0f, 0.0f);
fmodf(0.0f, 1.0f);
frexpf(0.0f, &iX);
hypotf(1.0f, 0.0f);
ilogbf(1.0f);
isfinite(0.0f);
isinf(0.0f);
isnan(0.0f);
///j0f(0.0f);
///j1f(0.0f);
///jnf(-1.0f, 1.0f);
ldexpf(0.0f, 0);
///lgammaf(1.0f);
///llrintf(0.0f);
///llroundf(0.0f);
log10f(1.0f);
log1pf(-1.0f);
log2f(1.0f);
logbf(1.0f);
logf(1.0f);
///lrintf(0.0f);
///lroundf(0.0f);
modff(0.0f, &fX);
///nanf("1");
nearbyintf(0.0f);
//nextafterf(0.0f);
//norm3df(1.0f, 0.0f, 0.0f);
//norm4df(1.0f, 0.0f, 0.0f, 0.0f);
//normcdff(0.0f);
//normcdfinvf(1.0f);
//fX = 1.0f; normf(1, &fX);
powf(1.0f, 0.0f);
//rcbrtf(1.0f);
remainderf(2.0f, 1.0f);
remquof(1.0f, 2.0f, &iX);
//rhypotf(0.0f, 1.0f);
///rintf(1.0f);
//rnorm3df(0.0f, 0.0f, 1.0f);
//rnorm4df(0.0f, 0.0f, 0.0f, 1.0f);
//fX = 1.0f; rnormf(1, &fX);
roundf(0.0f);
//rsqrtf(1.0f);
///scalblnf(0.0f, 1);
scalbnf(0.0f, 1);
signbit(1.0f);
sincosf(0.0f, &fX, &fY);
//sincospif(0.0f, &fX, &fY);
sinf(0.0f);
sinhf(0.0f);
//sinpif(0.0f);
sqrtf(0.0f);
tanf(0.0f);
tanhf(0.0f);
tgammaf(2.0f);
truncf(0.0f);
///y0f(1.0f);
///y1f(1.0f);
///ynf(1, 1.0f);
}
static void
test_signbitf ()
{
/* Finite values. */
ASSERT (!signbit (3.141f));
ASSERT (!signbit (3.141e30f));
ASSERT (!signbit (3.141e-30f));
ASSERT (signbit (-2.718f));
ASSERT (signbit (-2.718e30f));
ASSERT (signbit (-2.718e-30f));
/* Zeros. */
ASSERT (!signbit (0.0f));
if (1.0f / -zerof < 0)
ASSERT (signbit (-0.0f));
else
ASSERT (!signbit (-0.0f));
/* Infinite values. */
ASSERT (!signbit (1.0f / 0.0f));
ASSERT (signbit (-1.0f / 0.0f));
/* Quiet NaN. */
(void) signbit (zerof / zerof);
#if defined FLT_EXPBIT0_WORD && defined FLT_EXPBIT0_BIT
/* Signalling NaN. */
{
#define NWORDS \
((sizeof (float) + sizeof (unsigned int) - 1) / sizeof (unsigned int))
typedef union { float value; unsigned int word[NWORDS]; } memory_float;
memory_float m;
m.value = zerof / zerof;
# if FLT_EXPBIT0_BIT > 0
m.word[FLT_EXPBIT0_WORD] ^= (unsigned int) 1 << (FLT_EXPBIT0_BIT - 1);
# else
m.word[FLT_EXPBIT0_WORD + (FLT_EXPBIT0_WORD < NWORDS / 2 ? 1 : - 1)]
^= (unsigned int) 1 << (sizeof (unsigned int) * CHAR_BIT - 1);
# endif
if (FLT_EXPBIT0_WORD < NWORDS / 2)
m.word[FLT_EXPBIT0_WORD + 1] |= (unsigned int) 1 << FLT_EXPBIT0_BIT;
else
m.word[0] |= (unsigned int) 1;
(void) signbit (m.value);
#undef NWORDS
}
#endif
}
void adjacency(double * expr, int nSamples, int nGenes, int corType, int adjType, double power,
double maxPOutliers, double quick, int fallback, int cosine,
int replaceMissing,
double * adj, int * errCode, int *warn, int * nThreads, int verbose, int indent)
{
int nElems = nGenes * nGenes;
int nNA = 0;
double replacementValue = 0;
// Rprintf("Received nGenes: %d, nSamples: %d\n", nGenes, nSamples);
// Rprintf("adjacency: adjType: %d\n", adjType);
Rprintf("adjacency: replaceMissing: %d\n", replaceMissing);
int err = 0;
switch (corType)
{
case CorTypePearson :
// Rprintf("Calling cor_pairwise1...");
cor1Fast(expr, &nSamples, &nGenes, &quick, &cosine, adj, &nNA, &err, nThreads, &verbose, &indent);
// Rprintf("..done.\n");
if ((nNA > 0) && (!replaceMissing))
{
* errCode = 1;
return;
}
break;
case CorTypeBicor :
// Rprintf("Calling bicor1...");
bicor1Fast(expr, &nSamples, &nGenes, &maxPOutliers, &quick, &fallback, &cosine, adj, &nNA, &err,
warn, nThreads, &verbose, &indent);
// Rprintf("..done.\n");
if ((nNA > 0) && (!replaceMissing))
{
// Rprintf("nNA: %d\n", nNA);
* errCode = 1;
return;
}
if (err>0)
{
// Rprintf("bicor1 returned err: %d\n", err);
* errCode = 3;
return;
}
break;
default :
* errCode = 2;
return;
}
if ((*errCode==1) && replaceMissing)
{
Rprintf("Replacing missing adjacency values.\n");
*errCode = 0;
if (adjType==AdjTypeSigned) replacementValue = -1;
for (int i=0; i < nElems; i++)
if (ISNAN(adj[i])) adj[i] = replacementValue;
}
// Rprintf("ADJ 1\n");
switch (adjType)
{
case AdjTypeUnsigned :
for (int i=0; i < nElems; i++)
adj[i] = pow(fabs(adj[i]), power);
break;
case AdjTypeUnsignedKeepSign :
for (int i=0; i < nElems; i++)
adj[i] = (signbit(adj[i])? -1: 1) * pow(fabs(adj[i]), power);
break;
case AdjTypeSigned :
for (int i=0; i < nElems; i++)
adj[i] = pow((1+adj[i])/2, power);
break;
case AdjTypeHybrid :
for (int i=0; i < nElems; i++)
adj[i] = adj[i] > 0 ? pow(adj[i], power) : 0;
break;
default :
* errCode = 3;
}
}
