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

  /src/tests/lib/libm/
t_log.c 130 static const long double logl_invalid[] = { variable in typeref:typename:const long double[]
206 for (i = 0; i < __arraycount(logl_invalid); i++) {
207 CHECKL_NAN(i, log10l, logl_invalid[i]);
509 for (i = 0; i < __arraycount(logl_invalid); i++) {
510 CHECKL_NAN(i, log2l, logl_invalid[i]);
650 for (i = 0; i < __arraycount(logl_invalid); i++) {
651 CHECKL_NAN(i, logl, logl_invalid[i]);
t_log.c 130 static const long double logl_invalid[] = { variable in typeref:typename:const long double[]
206 for (i = 0; i < __arraycount(logl_invalid); i++) {
207 CHECKL_NAN(i, log10l, logl_invalid[i]);
509 for (i = 0; i < __arraycount(logl_invalid); i++) {
510 CHECKL_NAN(i, log2l, logl_invalid[i]);
650 for (i = 0; i < __arraycount(logl_invalid); i++) {
651 CHECKL_NAN(i, logl, logl_invalid[i]);
t_log.c 130 static const long double logl_invalid[] = { variable in typeref:typename:const long double[]
206 for (i = 0; i < __arraycount(logl_invalid); i++) {
207 CHECKL_NAN(i, log10l, logl_invalid[i]);
509 for (i = 0; i < __arraycount(logl_invalid); i++) {
510 CHECKL_NAN(i, log2l, logl_invalid[i]);
650 for (i = 0; i < __arraycount(logl_invalid); i++) {
651 CHECKL_NAN(i, logl, logl_invalid[i]);
t_log.c 130 static const long double logl_invalid[] = { variable in typeref:typename:const long double[]
206 for (i = 0; i < __arraycount(logl_invalid); i++) {
207 CHECKL_NAN(i, log10l, logl_invalid[i]);
509 for (i = 0; i < __arraycount(logl_invalid); i++) {
510 CHECKL_NAN(i, log2l, logl_invalid[i]);
650 for (i = 0; i < __arraycount(logl_invalid); i++) {
651 CHECKL_NAN(i, logl, logl_invalid[i]);

Completed in 45 milliseconds