From: <ams AT ludd DOT luth DOT se>
Message-Id: <200308171026.h7HAQoYw001950@speedy.ludd.luth.se>
Subject: tests/libc/c99/math/t-fpclas.c
To: DJGPP-WORKERS <djgpp-workers AT delorie DOT com>
Date: Sun, 17 Aug 2003 12:26:50 +0200 (CEST)
X-Mailer: ELM [version 2.4ME+ PL78 (25)]
MIME-Version: 1.0
Content-Transfer-Encoding: 7bit
Content-Type: text/plain; charset=US-ASCII
X-MailScanner: Found to be clean
Reply-To: djgpp-workers AT delorie DOT com

Hello.

Finally here's the test program for fpclassify().

/*
 * File t-fpclas.c (8.3 of t-fpclassify.c).
 *
 * Copyright (C) 2003 Martin Str@"omberg <ams AT ludd DOT luth DOT se>.
 *
 * This software may be used freely so long as this copyright notice is
 * left intact. There is no warranty on this software.
 *
 */

#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <libc/ieee.h>

typedef struct { 
  float_t number; 	/* Number to test. */
  int class; 		/* Which class. */
} test_float_t;

static const test_float_t tests_float[] = 
{ 
  /* Zeros. */
  { { 0, 0, 0 }, FP_ZERO }, /* 0.0 */
  { { 0, 0, 1 }, FP_ZERO }, /* -0.0 */

  /* Subnormals aka denormals. */
  { { 1, 1, 0 }, FP_SUBNORMAL }, /* Small number. */
  { { 1, 1, 1 }, FP_SUBNORMAL }, /* Small -number. */

  /* Normals. */
  { { 0xff, 0xfe, 0 }, FP_NORMAL }, /* Big number. */
  { { 0xff, 0xfe, 1 }, FP_NORMAL }, /* Big -number. */

  /* Infs. */
  { { 0, 0xff, 0 }, FP_INFINITE }, /* Inf */
  { { 0, 0xff, 1 }, FP_INFINITE }, /* -Inf */

  /* NaNs. */
  { { 1, 0xff, 0 }, FP_NAN }, /* SNaN */
  { { 1, 0xff, 1 }, FP_NAN }, /* -SNaN */
  { { 0x7fffff, 0xff, 0 }, FP_NAN }, /* QNaN */
  { { 0x7fffff, 0xff, 1 }, FP_NAN }, /* -QNaN */
};

static const size_t n_tests_float = sizeof(tests_float) / sizeof(tests_float[0]);

typedef struct { 
  double_t number; 	/* Number to test. */
  int class; 		/* Which class. */
} test_double_t;

static const test_double_t tests_double[] =
{ 
  /* Zeros. */
  { { 0, 0, 0, 0 }, FP_ZERO }, /* 0.0 */
  { { 0, 0, 0, 1 }, FP_ZERO }, /* -0.0 */

  /* Subnormals aka denormals. */
  { { 1, 0, 1, 0 }, FP_SUBNORMAL }, /* Small number. */
  { { 1, 0, 1, 1 }, FP_SUBNORMAL }, /* Small -number. */

  /* Normals. */
  { { 0xffffffff, 0x7ffff, 0x7fe, 0 }, FP_NORMAL }, /* Big number. */
  { { 0xffffffff, 0x7ffff, 0x7fe, 1 }, FP_NORMAL }, /* Big -number. */

  /* Infs. */
  { { 0, 0, 0x7ff, 0 }, FP_INFINITE }, /* Inf */
  { { 0, 0, 0x7ff, 1 }, FP_INFINITE }, /* -Inf */

  /* NaNs. */
  { { 1, 0, 0x7ff, 0 }, FP_NAN }, /* SNaN */
  { { 1, 0, 0x7ff, 1 }, FP_NAN }, /* -SNaN */
  { { 0, 0xfffff, 0x7ff, 0 }, FP_NAN }, /* QNaN */
  { { 0, 0xfffff, 0x7ff, 1 }, FP_NAN }, /* -QNaN */
};

static const size_t n_tests_double = sizeof(tests_double) / sizeof(tests_double[0]);

typedef struct { 
  long_double_t number; /* Number to test. */
  int class; 		/* Which class. */
} test_long_double_t;

static const test_long_double_t tests_long_double[] =
{ 
  /* Zeros. */
  { { 0, 0, 0, 0 }, FP_ZERO }, /* 0.0. */
  { { 0, 0, 0, 1 }, FP_ZERO }, /* -0.0. */

  /* Subnormals aka denormals. */
  { { 1, 0x80000000, 0, 0 }, FP_SUBNORMAL }, /* Subnormal, smallest possible > 0. */
  { { 1, 0x80000000, 0, 1 }, FP_SUBNORMAL }, /* Subnormal, biggest possible < 0. */

  /* Unnormals. */
  { { 1, 0, 1, 0 }, FP_UNNORMAL }, /* Unnormal, smallest possible > 0. */
  { { 1, 0, 1, 1 }, FP_UNNORMAL }, /* Unnormal, biggest possible < 0. */
  { { 0, 0, 0x7fff, 0 }, FP_UNNORMAL }, /* Inf with missing 1. */
  { { 0, 0, 0x7fff, 1 }, FP_UNNORMAL }, /* -Inf with missing 1. */
  { { 1, 0, 0x7fff, 0 }, FP_UNNORMAL }, /* SNaN with missing 1 */
  { { 1, 0, 0x7fff, 1 }, FP_UNNORMAL }, /* -SNaN with missing 1 */
  { { 0, 0x7fffffff, 0x7fff, 0 }, FP_UNNORMAL }, /* QNaN with missing 1 */
  { { 0, 0x7fffffff, 0x7fff, 1 }, FP_UNNORMAL }, /* -QNaN with missing 1 */

  /* Normals. */
  { { 0xffffffff, 0xffffffff, 0x7ffe, 0 }, FP_NORMAL }, /* Big number. */
  { { 0xffffffff, 0xffffffff, 0x7ffe, 1 }, FP_NORMAL }, /* Big -number. */
  { { 0xffffffff, 0x7fffffff, 0x7ffe, 0 }, FP_NORMAL }, /* Big number with missing 1. */
  { { 0xffffffff, 0x7fffffff, 0x7ffe, 1 }, FP_NORMAL }, /* Big -number with missing 1. */

  /* Infs. */
  { { 0, 0x80000000, 0x7fff, 0 }, FP_INFINITE }, /* Inf. */
  { { 0, 0x80000000, 0x7fff, 1 }, FP_INFINITE }, /* -Inf. */

  /* NaNs. */
  { { 1, 0x80000000, 0x7fff, 0 }, FP_NAN }, /* SNaN */
  { { 1, 0x80000000, 0x7fff, 1 }, FP_NAN }, /* -SNaN */
  { { 0, 0xffffffff, 0x7fff, 0 }, FP_NAN }, /* QNaN */
  { { 0, 0xffffffff, 0x7fff, 1 }, FP_NAN }, /* -QNaN */
};

static const size_t n_tests_long_double = sizeof(tests_long_double) / sizeof(tests_long_double[0]);

int
main(void)
{
  int result;
  size_t i;

  printf("FP_ZERO=0x%x, FP_SUBNORMAL=0x%x, FP_NORMAL=0x%x, FP_INFINITE=0x%d,\n"
	 "FP_NAN=0x%x, FP_UNNORMAL=0x%x\n\n", 
	 FP_ZERO, FP_SUBNORMAL, FP_NORMAL, FP_INFINITE, 
	 FP_NAN, FP_UNNORMAL);

  puts("Float tests:");
  for(i = 0; i < n_tests_float; i++)
  {
    result = fpclassify(*(const float *)(&(tests_float[i].number)));
    printf("\t%G -> 0x%x: ", *(const float *)(&(tests_float[i].number)), result);
    if( !result == !tests_float[i].class )
    {
      puts("Ok.");
    }
    else
    {
      puts("Fail.");
    }
  }

  puts("Double tests:");
  for(i = 0; i < n_tests_double; i++)
  {
    result = fpclassify(*(const double *)(&(tests_double[i].number)));
    printf("\t%G -> 0x%x: ", *(const double *)(&(tests_double[i].number)), result);
    if( !result == !tests_double[i].class )
    {
      puts("Ok.");
    }
    else
    {
      puts("Fail.");
    }
  }

  puts("Long double tests:");
  for(i = 0; i < n_tests_long_double; i++)
  {
    result = fpclassify(*(const long double *)(&(tests_long_double[i].number)));
    printf("\t%LG -> 0x%x: ", *(const long double *)(&(tests_long_double[i].number)), result);
    if( !result == !tests_long_double[i].class )
    {
      puts("Ok.");
    }
    else
    {
      puts("Fail.");
    }
  }

  return(EXIT_SUCCESS);
}


Right,

						MartinS