inet_aton.c 4.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175
  1. /*
  2. * Copyright (c) 1983, 1990, 1993
  3. * The Regents of the University of California. 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. * 3. All advertising materials mentioning features or use of this software
  14. * must display the following acknowledgement:
  15. * This product includes software developed by the University of
  16. * California, Berkeley and its contributors.
  17. * 4. Neither the name of the University nor the names of its contributors
  18. * may be used to endorse or promote products derived from this software
  19. * without specific prior written permission.
  20. *
  21. * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  22. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  23. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  24. * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  25. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  26. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  27. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  28. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  29. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  30. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  31. * SUCH DAMAGE.
  32. */
  33. #ifdef HAVE_CONFIG_H
  34. # include <config.h>
  35. #endif
  36. #if defined(LIBC_SCCS) && !defined(lint)
  37. static char sccsid[] = "@(#)inet_addr.c 8.1 (Berkeley) 6/17/93";
  38. #endif /* LIBC_SCCS and not lint */
  39. #include <ctype.h>
  40. #ifdef __MINGW32__
  41. /* Include for MinGW only. Cygwin will have the latter. */
  42. #include <winsock2.h>
  43. #else
  44. #include <sys/param.h>
  45. #include <netinet/in.h>
  46. #include <arpa/inet.h>
  47. #endif
  48. #if 0
  49. /*
  50. * Ascii internet address interpretation routine.
  51. * The value returned is in network order.
  52. */
  53. u_long
  54. inet_addr(const char *cp)
  55. {
  56. struct in_addr val;
  57. if (inet_aton(cp, &val))
  58. return (val.s_addr);
  59. return (INADDR_NONE);
  60. }
  61. #endif
  62. /* We provide this prototype to avoid compiler warnings. If this ever
  63. conflicts with a declaration in a system header file, we'll find
  64. out, because we should include that header file here. */
  65. int inet_aton (const char *cp, struct in_addr *addr);
  66. /*
  67. * Check whether "cp" is a valid ascii representation
  68. * of an Internet address and convert to a binary address.
  69. * Returns 1 if the address is valid, 0 if not.
  70. * This replaces inet_addr, the return value from which
  71. * cannot distinguish between failure and a local broadcast address. */
  72. int
  73. inet_aton(const char *cp_arg, struct in_addr *addr)
  74. {
  75. register unsigned long val;
  76. register int base, n;
  77. register unsigned char c;
  78. register unsigned const char *cp = (unsigned const char *) cp_arg;
  79. unsigned int parts[4];
  80. register unsigned int *pp = parts;
  81. for (;;) {
  82. /*
  83. * Collect number up to ``.''.
  84. * Values are specified as for C:
  85. * 0x=hex, 0=octal, other=decimal.
  86. */
  87. val = 0; base = 10;
  88. if (*cp == '0') {
  89. if (*++cp == 'x' || *cp == 'X')
  90. base = 16, cp++;
  91. else
  92. base = 8;
  93. }
  94. while ((c = *cp) != '\0') {
  95. if (isascii(c) && isdigit(c)) {
  96. val = (val * base) + (c - '0');
  97. cp++;
  98. continue;
  99. }
  100. if (base == 16 && isascii(c) && isxdigit(c)) {
  101. val = (val << 4) +
  102. (c + 10 - (islower(c) ? 'a' : 'A'));
  103. cp++;
  104. continue;
  105. }
  106. break;
  107. }
  108. if (*cp == '.') {
  109. /*
  110. * Internet format:
  111. * a.b.c.d
  112. * a.b.c (with c treated as 16-bits)
  113. * a.b (with b treated as 24 bits)
  114. */
  115. if (pp >= parts + 3 || val > 0xff)
  116. return (0);
  117. *pp++ = val, cp++;
  118. } else
  119. break;
  120. }
  121. /*
  122. * Check for trailing characters.
  123. */
  124. if (*cp && (!isascii(*cp) || !isspace(*cp)))
  125. return (0);
  126. /*
  127. * Concoct the address according to
  128. * the number of parts specified.
  129. */
  130. n = pp - parts + 1;
  131. switch (n) {
  132. case 1: /* a -- 32 bits */
  133. break;
  134. case 2: /* a.b -- 8.24 bits */
  135. if (val > 0xffffff)
  136. return (0);
  137. val |= parts[0] << 24;
  138. break;
  139. case 3: /* a.b.c -- 8.8.16 bits */
  140. if (val > 0xffff)
  141. return (0);
  142. val |= (parts[0] << 24) | (parts[1] << 16);
  143. break;
  144. case 4: /* a.b.c.d -- 8.8.8.8 bits */
  145. if (val > 0xff)
  146. return (0);
  147. val |= (parts[0] << 24) | (parts[1] << 16) | (parts[2] << 8);
  148. break;
  149. }
  150. if (addr)
  151. addr->s_addr = htonl(val);
  152. return (1);
  153. }
  154. /*
  155. Local Variables:
  156. c-file-style: "gnu"
  157. End:
  158. */