Lines Matching defs:out
11 static void test_rint(uint32 *in, uint32 *out,
22 out[0] = in[0];
23 out[1] = in[1];
32 out[0] = sign | (roundup ? 0x3FF00000 : 0);
33 out[1] = 0;
60 out[0] = xh;
61 out[1] = xl;
64 char *test_ceil(uint32 *in, uint32 *out) {
65 test_rint(in, out, 0, 1);
69 char *test_floor(uint32 *in, uint32 *out) {
70 test_rint(in, out, 1, 0);
74 static void test_rintf(uint32 *in, uint32 *out,
85 *out = *in;
94 *out = sign | (roundup ? 0x3F800000 : 0);
117 *out = x;
120 char *test_ceilf(uint32 *in, uint32 *out) {
121 test_rintf(in, out, 0, 1);
125 char *test_floorf(uint32 *in, uint32 *out) {
126 test_rintf(in, out, 1, 0);
130 char *test_fmod(uint32 *a, uint32 *b, uint32 *out) {
139 out[0] = 0x7ff80000;
140 out[1] = 1;
150 out[0] = 0x7ff80000;
151 out[1] = 1;
155 out[0] = 0x7ff80000;
156 out[1] = 1;
160 out[0] = a[0];
161 out[1] = a[1];
165 out[0] = a[0];
166 out[1] = a[1];
171 * OK. That's the special cases cleared out of the way. Now we
199 test_ldexp(am, (uint32 *)&aex, out);
204 char *test_fmodf(uint32 *a, uint32 *b, uint32 *out) {
213 *out = 0x7fc00001;
223 *out = 0x7fc00001;
227 *out = 0x7fc00001;
231 *out = *a;
235 *out = *a;
240 * OK. That's the special cases cleared out of the way. Now we
266 test_ldexpf(&am, (uint32 *)&aex, out);
271 char *test_ldexp(uint32 *x, uint32 *np, uint32 *out) {
279 out[0] = x[0];
280 out[1] = x[1];
284 out[0] = x[0];
285 out[1] = x[1];
292 out[0] = sign | 0x7FF00000;
293 out[1] = 0;
307 out[0] = sign; /* underflow: correctly signed zero */
308 out[1] = 0;
334 out[0] = sign | y[0];
335 out[1] = y[1];
343 out[0] = y[0] + (ex << 20);
344 out[1] = y[1];
349 char *test_ldexpf(uint32 *x, uint32 *np, uint32 *out) {
357 *out = *x;
361 *out = *x;
368 *out = sign | 0x7F800000;
382 *out = sign; /* underflow: correctly signed zero */
406 *out = sign | y;
414 *out = y + (ex << 23);
419 char *test_frexp(uint32 *x, uint32 *out, uint32 *nout) {
422 out[0] = x[0];
423 out[1] = x[1];
432 out[0] = x[0];
433 out[1] = x[1];
446 out[0] = sign | 0x3FE00000 | (xh & 0xFFFFF);
447 out[1] = xl;
451 out[0] = 0x3FE00000 | (x[0] & 0x800FFFFF);
452 out[1] = x[1];
457 char *test_frexpf(uint32 *x, uint32 *out, uint32 *nout) {
460 *out = *x;
469 *out = *x;
480 *out = sign | 0x3F000000 | (xv & 0x7FFFFF);
484 *out = 0x3F000000 | (*x & 0x807FFFFF);
557 char *test_copysign(uint32 *x, uint32 *y, uint32 *out)
562 out[0] = ysign | xhigh;
563 out[1] = x[1];
569 char *test_copysignf(uint32 *x, uint32 *y, uint32 *out)
574 out[0] = ysign | xhigh;
580 char *test_isfinite(uint32 *x, uint32 *out)
584 if ((xhigh & 0x7ff00000) == 0x7ff00000) out[0] = 0;
585 else out[0] = 1;
589 char *test_isfinitef(uint32 *x, uint32 *out)
592 if ((x[0] & 0x7f800000) == 0x7f800000) out[0] = 0;
593 else out[0] = 1;
597 char *test_isinff(uint32 *x, uint32 *out)
600 if ((x[0] & 0x7fffffff) == 0x7f800000) out[0] = 1;
601 else out[0] = 0;
605 char *test_isinf(uint32 *x, uint32 *out)
610 if (((xhigh & 0x7fffffff) == 0x7ff00000) && (xlow == 0)) out[0] = 1;
611 else out[0] = 0;
615 char *test_isnanf(uint32 *x, uint32 *out)
620 if ((exponent == 0x7f800000) && (fraction != 0)) out[0] = 1;
621 else out[0] = 0;
625 char *test_isnan(uint32 *x, uint32 *out)
631 out[0] = 1;
632 else out[0] = 0;
636 char *test_isnormalf(uint32 *x, uint32 *out)
640 if (exponent == 0x7f800000) out[0] = 0;
641 else if (exponent == 0) out[0] = 0;
642 else out[0] = 1;
646 char *test_isnormal(uint32 *x, uint32 *out)
650 if (exponent == 0x7ff00000) out[0] = 0;
651 else if (exponent == 0) out[0] = 0;
652 else out[0] = 1;
656 char *test_signbitf(uint32 *x, uint32 *out)
659 out[0] = (x[0] >> 31) & 1;
663 char *test_signbit(uint32 *x, uint32 *out)
666 out[0] = (x[0] >> 31) & 1;
670 char *test_fpclassify(uint32 *x, uint32 *out)
675 if ((exponent == 0x00) && (fraction == 0)) out[0] = 0;
676 else if ((exponent == 0x00) && (fraction != 0)) out[0] = 4;
677 else if ((exponent == 0x7ff) && (fraction == 0)) out[0] = 3;
678 else if ((exponent == 0x7ff) && (fraction != 0)) out[0] = 7;
679 else out[0] = 5;
683 char *test_fpclassifyf(uint32 *x, uint32 *out)
688 if ((exponent == 0x000) && (fraction == 0)) out[0] = 0;
689 else if ((exponent == 0x000) && (fraction != 0)) out[0] = 4;
690 else if ((exponent == 0xff) && (fraction == 0)) out[0] = 3;
691 else if ((exponent == 0xff) && (fraction != 0)) out[0] = 7;
692 else out[0] = 5;
706 * Sort out whether results are ordered or not to begin with
766 * Sort out whether results are ordered or not to begin with
811 char *test_isgreater(uint32 *x, uint32 *y, uint32 *out)
814 *out = (result == 1);
818 char *test_isgreaterequal(uint32 *x, uint32 *y, uint32 *out)
821 *out = (result >= 0);
825 char *test_isless(uint32 *x, uint32 *y, uint32 *out)
828 *out = (result == -1);
832 char *test_islessequal(uint32 *x, uint32 *y, uint32 *out)
835 *out = (result == -1) || (result == 0);
839 char *test_islessgreater(uint32 *x, uint32 *y, uint32 *out)
842 *out = (result == -1) || (result == 1);
846 char *test_isunordered(uint32 *x, uint32 *y, uint32 *out)
851 test_isnormal(x, out);
852 normal |= *out;
853 test_isnormal(y, out);
854 normal |= *out;
855 *out = (result == -2) || (result == -3);
859 char *test_isgreaterf(uint32 *x, uint32 *y, uint32 *out)
862 *out = (result == 1);
866 char *test_isgreaterequalf(uint32 *x, uint32 *y, uint32 *out)
869 *out = (result >= 0);
873 char *test_islessf(uint32 *x, uint32 *y, uint32 *out)
876 *out = (result == -1);
880 char *test_islessequalf(uint32 *x, uint32 *y, uint32 *out)
883 *out = (result == -1) || (result == 0);
887 char *test_islessgreaterf(uint32 *x, uint32 *y, uint32 *out)
890 *out = (result == -1) || (result == 1);
894 char *test_isunorderedf(uint32 *x, uint32 *y, uint32 *out)
899 test_isnormalf(x, out);
900 normal |= *out;
901 test_isnormalf(y, out);
902 normal |= *out;
903 *out = (result == -2) || (result == -3);