s_nan.c 3.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110
  1. /*-
  2. * Copyright (c) 2007 David Schultz
  3. * All rights reserved.
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions
  7. * are met:
  8. * 1. Redistributions of source code must retain the above copyright
  9. * notice, this list of conditions and the following disclaimer.
  10. * 2. Redistributions in binary form must reproduce the above copyright
  11. * notice, this list of conditions and the following disclaimer in the
  12. * documentation and/or other materials provided with the distribution.
  13. *
  14. * THIS SOFTWARE IS PROVIDED BY AUTHOR AND CONTRIBUTORS ``AS IS'' AND
  15. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  16. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  17. * ARE DISCLAIMED. IN NO EVENT SHALL AUTHOR OR CONTRIBUTORS BE LIABLE
  18. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  19. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  20. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  21. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  22. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  23. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  24. * SUCH DAMAGE.
  25. *
  26. * $FreeBSD: src/lib/msun/src/s_nan.c,v 1.2 2007/12/18 23:46:32 das Exp $
  27. */
  28. #include <sys/endian.h>
  29. #include <ctype.h>
  30. #include <float.h>
  31. #include "openlibm.h"
  32. #include <stdint.h>
  33. #include <strings.h>
  34. #include "math_private.h"
  35. /*
  36. * Scan a string of hexadecimal digits (the format nan(3) expects) and
  37. * make a bit array (using the local endianness). We stop when we
  38. * encounter an invalid character, NUL, etc. If we overflow, we do
  39. * the same as gcc's __builtin_nan(), namely, discard the high order bits.
  40. *
  41. * The format this routine accepts needs to be compatible with what is used
  42. * in contrib/gdtoa/hexnan.c (for strtod/scanf) and what is used in
  43. * __builtin_nan(). In fact, we're only 100% compatible for strings we
  44. * consider valid, so we might be violating the C standard. But it's
  45. * impossible to use nan(3) portably anyway, so this seems good enough.
  46. */
  47. void
  48. _scan_nan(uint32_t *words, int num_words, const char *s)
  49. {
  50. int si; /* index into s */
  51. int bitpos; /* index into words (in bits) */
  52. bzero(words, num_words * sizeof(uint32_t));
  53. /* Allow a leading '0x'. (It's expected, but redundant.) */
  54. if (s[0] == '0' && (s[1] == 'x' || s[1] == 'X'))
  55. s += 2;
  56. /* Scan forwards in the string, looking for the end of the sequence. */
  57. for (si = 0; isxdigit(s[si]); si++)
  58. ;
  59. /* Scan backwards, filling in the bits in words[] as we go. */
  60. #if _BYTE_ORDER == _LITTLE_ENDIAN
  61. for (bitpos = 0; bitpos < 32 * num_words; bitpos += 4) {
  62. #else
  63. for (bitpos = 32 * num_words - 4; bitpos >= 0; bitpos -= 4) {
  64. #endif
  65. if (--si < 0)
  66. break;
  67. words[bitpos / 32] |= digittoint(s[si]) << (bitpos % 32);
  68. }
  69. }
  70. double
  71. nan(const char *s)
  72. {
  73. union {
  74. double d;
  75. uint32_t bits[2];
  76. } u;
  77. _scan_nan(u.bits, 2, s);
  78. #if _BYTE_ORDER == _LITTLE_ENDIAN
  79. u.bits[1] |= 0x7ff80000;
  80. #else
  81. u.bits[0] |= 0x7ff80000;
  82. #endif
  83. return (u.d);
  84. }
  85. float
  86. nanf(const char *s)
  87. {
  88. union {
  89. float f;
  90. uint32_t bits[1];
  91. } u;
  92. _scan_nan(u.bits, 1, s);
  93. u.bits[0] |= 0x7fc00000;
  94. return (u.f);
  95. }
  96. #if (LDBL_MANT_DIG == 53)
  97. __weak_reference(nan, nanl);
  98. #endif