1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397
|
/*
* Copyright (c) 1994 Cygnus Support.
* All rights reserved.
*
* Redistribution and use in source and binary forms are permitted
* provided that the above copyright notice and this paragraph are
* duplicated in all such forms and that any documentation,
* and/or other materials related to such
* distribution and use acknowledge that the software was developed
* at Cygnus Support, Inc. Cygnus Support, Inc. may not be used to
* endorse or promote products derived from this software without
* specific prior written permission.
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
*/
#include <signal.h>
#include "test.h"
#include <math.h>
#include <string.h>
#include <stdint.h>
#include <malloc.h>
int verbose;
static int count;
int inacc;
int redo = 0;
extern int calc;
#ifdef MALLOC_DEBUG
extern char **environ;
extern int _malloc_test_fail;
#endif
int
main (int ac,
char **av, char **en)
{
#ifdef MALLOC_DEBUG
environ = en;
#endif
int i;
int math2 = 1;
int string= 1;
int is = 1;
int math= 1;
int cvt = 1;
#ifdef HAVE_IEEEFP_FUNCS
int ieee= 1;
#endif
int vector=0;
for (i = 1; i < ac; i++)
{
if (strcmp(av[i],"-v")==0)
verbose ++;
if (strcmp(av[i],"-nomath2") == 0)
math2 = 0;
if (strcmp(av[i],"-nostrin") == 0)
string= 0;
if (strcmp(av[i],"-nois") == 0)
is = 0;
if (strcmp(av[i],"-nomath") == 0)
math= 0;
if (strcmp(av[i],"-nocvt") == 0)
cvt = 0;
#ifdef HAVE_IEEEFP_FUNCS
if (strcmp(av[i],"-noiee") == 0)
ieee= 0;
#endif
if (strcmp(av[i],"-generate") == 0) {
vector = 1;
calc = 1;
}
}
if (cvt)
test_cvt();
if (math2)
test_math2();
if (string)
test_string();
if (math)
test_math(vector);
if (is)
test_is();
#ifdef HAVE_IEEEFP_FUNCS
if (ieee)
test_ieee();
#endif
printf("Tested %d functions, %d errors detected\n", count, inacc);
return inacc != 0;
}
static const char *iname = "foo";
void newfunc (const char *string)
{
if (strcmp(iname, string))
{
#ifdef MALLOC_DEBUG
char *memcheck = getenv("CHECK_NAME");
if (memcheck && !strcmp(string, memcheck))
_malloc_test_fail = atoi(getenv("CHECK_COUNT"));
if (memcheck && !strcmp(iname, memcheck)) {
if (_malloc_test_fail) {
printf("malloc test fail remain %d\n", _malloc_test_fail);
_malloc_test_fail = 0;
}
}
#endif
printf("testing %s\n", string);
fflush(stdout);
iname = string;
}
}
static int theline;
void line(li)
int li;
{
if (verbose)
{
printf(" %d\n", li);
}
theline = li;
count++;
}
int reduce = 0;
int strtod_vector = 0;
int
bigger (__ieee_double_shape_type *a,
__ieee_double_shape_type *b)
{
if (a->parts.msw > b->parts.msw)
{
return 1;
}
else if (a->parts.msw == b->parts.msw)
{
if (a->parts.lsw > b->parts.lsw)
{
return 1;
}
}
return 0;
}
int
fbigger (__ieee_float_shape_type *a,
__ieee_float_shape_type *b)
{
if (a->p1 > b->p1)
{
return 1;
}
return 0;
}
/* Return the first bit different between two double numbers */
int
mag_of_error (double is,
double shouldbe)
{
__ieee_double_shape_type a,b;
int i;
int a_big;
unsigned int mask;
unsigned long int __x;
unsigned long int msw, lsw;
a.value = is;
b.value = shouldbe;
if (a.parts.msw == b.parts.msw
&& a.parts.lsw== b.parts.lsw) return 64;
/* Subtract the larger from the smaller number */
a_big = bigger(&a, &b);
if (!a_big) {
int t;
t = a.parts.msw;
a.parts.msw = b.parts.msw;
b.parts.msw = t;
t = a.parts.lsw;
a.parts.lsw = b.parts.lsw;
b.parts.lsw = t;
}
__x = (a.parts.lsw) - (b.parts.lsw);
msw = (a.parts.msw) - (b.parts.msw) - (__x > (a.parts.lsw));
lsw = __x;
/* Find out which bit the difference is in */
mask = 0x80000000;
for (i = 0; i < 32; i++)
{
if (((msw) & mask)!=0) return i;
mask >>=1;
}
mask = 0x80000000;
for (i = 0; i < 32; i++)
{
if (((lsw) & mask)!=0) return i+32;
mask >>=1;
}
return 64;
}
/* Return the first bit different between two double numbers */
int
fmag_of_error (float is,
float shouldbe)
{
__ieee_float_shape_type a,b;
int i;
int a_big;
unsigned int mask;
uint32_t sw;
a.value = is;
b.value = shouldbe;
if (a.p1 == b.p1) return 32;
/* Subtract the larger from the smaller number */
a_big = fbigger(&a, &b);
if (!a_big) {
uint32_t t;
t = a.p1;
a.p1 = b.p1;
b.p1 = t;
}
sw = (a.p1) - (b.p1);
mask = 0x80000000;
for (i = 0; i < 32; i++)
{
if (((sw) & mask)!=0) return i;
mask >>=1;
}
return 32;
}
int ok_mag;
void
test_sok (char *is,
char *shouldbe)
{
if (strcmp(is,shouldbe))
{
printf("%s:%d, inacurate answer: (%s should be %s)\n",
iname,
theline,
is, shouldbe);
inacc++;
}
}
void
test_iok (int is,
int shouldbe)
{
if (is != shouldbe){
printf("%s:%d, inacurate answer: (%08x should be %08x)\n",
iname,
theline,
is, shouldbe);
inacc++;
}
}
/* Compare counted strings upto a certain length - useful to test single
prec float conversions against double results
*/
void
test_scok (char *is,
char *shouldbe,
int count)
{
if (strncmp(is,shouldbe, count))
{
printf("%s:%d, inacurate answer: (%s should be %s)\n",
iname,
theline,
is, shouldbe);
inacc++;
}
}
/* Compare counted strings upto a certain length, allowing two forms - useful to test single
prec float conversions against double results
*/
void
test_scok2 (char *is,
char *maybe1,
char *maybe2,
int count)
{
if (strncmp(is,maybe1, count) && (maybe2 == NULL || strncmp(is,maybe2,count)))
{
printf("%s:%d, inacurate answer: (%s may be %s or %s)\n",
iname,
theline,
is, maybe1, maybe2 ? maybe2 : "(nothing)");
inacc++;
}
}
void
test_eok (int is,
int shouldbe)
{
if (is != shouldbe){
printf("%s:%d, bad errno answer: (%d should be %d)\n",
iname,
theline,
is, shouldbe);
inacc++;
}
}
void
test_mok (double value,
double shouldbe,
int okmag)
{
__ieee_double_shape_type a,b;
int mag = mag_of_error(value, shouldbe);
if (mag == 0)
{
/* error in the first bit is ok if the numbers are both 0 */
if (value == 0.0 && shouldbe == 0.0)
return;
}
a.value = shouldbe;
b.value = value;
if (mag < okmag)
{
printf("%s:%d, wrong answer: bit %d ",
iname,
theline,
mag);
printf("%08lx%08lx %08lx%08lx) ",
(unsigned long) a.parts.msw, (unsigned long) a.parts.lsw,
(unsigned long) b.parts.msw, (unsigned long) b.parts.lsw);
printf("(%g %g)\n", a.value, b.value);
inacc++;
}
}
#ifdef __PCCNECV70__
kill() {}
getpid() {}
#endif
void bt(){
double f1,f2;
f1 = 0.0;
f2 = 0.0/f1;
printf("(%g)\n", f2);
}
|