HomeSort by: relevance | last modified time | path
    Searched defs:Q9 (Results 1 - 7 of 7) sorted by relevancy

  /src/external/gpl3/gcc/dist/libquadmath/math/
log1pq.c 79 Q9 = 9.147150349299596453976674231612674085381E3Q,
237 + Q9) * x
acosq.c 119 Q9 = -5.659156469628629327045433069052560211164E-1Q,
220 + Q9) * t
  /src/external/gpl3/gcc.old/dist/libquadmath/math/
log1pq.c 79 Q9 = 9.147150349299596453976674231612674085381E3Q,
237 + Q9) * x
acosq.c 119 Q9 = -5.659156469628629327045433069052560211164E-1Q,
220 + Q9) * t
  /src/tests/usr.bin/xlint/lint1/
queries.c 346 Q9(int x)
352 /* expect+1: parenthesized return value [Q9] */
360 /* expect+1: parenthesized return value [Q9] */
364 /* expect+1: parenthesized return value [Q9] */
373 /* expect+2: parenthesized return value [Q9] */
  /src/external/gpl3/gcc/dist/contrib/
paranoia.cc 91 G2 GDiv Q9 Z0 PseudoZero
985 FLOAT Q, Q9;
2544 Q9 = (Z + Z) / Z;
2545 printf ("What the machine gets for (Z + Z) / Z is %s .\n", Q9.str());
2546 if (FABS (Q9 - Two) < Radix * U2)
2553 if ((Q9 < One) || (Q9 > Two))
  /src/external/gpl3/gcc.old/dist/contrib/
paranoia.cc 91 G2 GDiv Q9 Z0 PseudoZero
985 FLOAT Q, Q9;
2544 Q9 = (Z + Z) / Z;
2545 printf ("What the machine gets for (Z + Z) / Z is %s .\n", Q9.str());
2546 if (FABS (Q9 - Two) < Radix * U2)
2553 if ((Q9 < One) || (Q9 > Two))

Completed in 30 milliseconds