--- /dev/null
+/* from NetBSD: inet_ntop.c,v 1.9 2000/01/22 22:19:16 mycroft Exp */\r
+\r
+/* Copyright (c) 1996 by Internet Software Consortium.\r
+ *\r
+ * Permission to use, copy, modify, and distribute this software for any\r
+ * purpose with or without fee is hereby granted, provided that the above\r
+ * copyright notice and this permission notice appear in all copies.\r
+ *\r
+ * THE SOFTWARE IS PROVIDED "AS IS" AND INTERNET SOFTWARE CONSORTIUM DISCLAIMS\r
+ * ALL WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES\r
+ * OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL INTERNET SOFTWARE\r
+ * CONSORTIUM BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL\r
+ * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR\r
+ * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS\r
+ * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS\r
+ * SOFTWARE.\r
+ */\r
+\r
+#define ENOSPC 28\r
+#define EAFNOSUPPORT 52\r
+\r
+#ifndef IN6ADDRSZ\r
+#define IN6ADDRSZ 16\r
+#endif\r
+\r
+#ifndef INT16SZ\r
+#define INT16SZ 2\r
+#endif\r
+\r
+#ifdef SPRINTF_CHAR\r
+# define SPRINTF(x) strlen(sprintf/**/x)\r
+#else\r
+# define SPRINTF(x) ((size_t)sprintf x)\r
+#endif\r
+\r
+/*\r
+ * WARNING: Don't even consider trying to compile this on a system where\r
+ * sizeof(int) < 4. sizeof(int) > 4 is fine; all the world's not a VAX.\r
+ */\r
+\r
+static const char *inet_ntop4(const u_char *src, char *dst, size_t size);\r
+static const char *inet_ntop6(const u_char *src, char *dst, size_t size);\r
+\r
+/* char *\r
+ * inet_ntop(af, src, dst, size)\r
+ * convert a network format address to presentation format.\r
+ * return:\r
+ * pointer to presentation format address (`dst'), or NULL (see errno).\r
+ * author:\r
+ * Paul Vixie, 1996.\r
+ */\r
+const char *\r
+inet_ntop(int af, const void *src, char *dst, size_t size)\r
+{\r
+\r
+ switch (af) {\r
+ case AF_INET:\r
+ return (inet_ntop4(src, dst, size));\r
+#ifdef INET6\r
+ case AF_INET6:\r
+ return (inet_ntop6(src, dst, size));\r
+#endif\r
+ default:\r
+ errno = EAFNOSUPPORT;\r
+ return (NULL);\r
+ }\r
+ /* NOTREACHED */\r
+}\r
+\r
+/* const char *\r
+ * inet_ntop4(src, dst, size)\r
+ * format an IPv4 address, more or less like inet_ntoa()\r
+ * return:\r
+ * `dst' (as a const)\r
+ * notes:\r
+ * (1) uses no statics\r
+ * (2) takes a u_char* not an in_addr as input\r
+ * author:\r
+ * Paul Vixie, 1996.\r
+ */\r
+static const char *\r
+inet_ntop4(const u_char *src, char *dst, size_t size)\r
+{\r
+ static const char fmt[] = "%u.%u.%u.%u";\r
+ char tmp[sizeof "255.255.255.255"];\r
+\r
+ if (SPRINTF((tmp, fmt, src[0], src[1], src[2], src[3])) > size) {\r
+ errno = ENOSPC;\r
+ return (NULL);\r
+ }\r
+ strcpy(dst, tmp);\r
+ return (dst);\r
+}\r
+\r
+#ifdef INET6\r
+/* const char *\r
+ * inet_ntop6(src, dst, size)\r
+ * convert IPv6 binary address into presentation (printable) format\r
+ * author:\r
+ * Paul Vixie, 1996.\r
+ */\r
+static const char *\r
+inet_ntop6(const u_char *src, char *dst, size_t size)\r
+{\r
+ /*\r
+ * Note that int32_t and int16_t need only be "at least" large enough\r
+ * to contain a value of the specified size. On some systems, like\r
+ * Crays, there is no such thing as an integer variable with 16 bits.\r
+ * Keep this in mind if you think this function should have been coded\r
+ * to use pointer overlays. All the world's not a VAX.\r
+ */\r
+ char tmp[sizeof "ffff:ffff:ffff:ffff:ffff:ffff:255.255.255.255"], *tp;\r
+ struct { int base, len; } best, cur;\r
+ u_int words[IN6ADDRSZ / INT16SZ];\r
+ int i;\r
+\r
+ /*\r
+ * Preprocess:\r
+ * Copy the input (bytewise) array into a wordwise array.\r
+ * Find the longest run of 0x00's in src[] for :: shorthanding.\r
+ */\r
+ memset(words, '\0', sizeof words);\r
+ for (i = 0; i < IN6ADDRSZ; i++)\r
+ words[i / 2] |= (src[i] << ((1 - (i % 2)) << 3));\r
+ best.base = -1;\r
+ cur.base = -1;\r
+ for (i = 0; i < (IN6ADDRSZ / INT16SZ); i++) {\r
+ if (words[i] == 0) {\r
+ if (cur.base == -1)\r
+ cur.base = i, cur.len = 1;\r
+ else\r
+ cur.len++;\r
+ } else {\r
+ if (cur.base != -1) {\r
+ if (best.base == -1 || cur.len > best.len)\r
+ best = cur;\r
+ cur.base = -1;\r
+ }\r
+ }\r
+ }\r
+ if (cur.base != -1) {\r
+ if (best.base == -1 || cur.len > best.len)\r
+ best = cur;\r
+ }\r
+ if (best.base != -1 && best.len < 2)\r
+ best.base = -1;\r
+\r
+ /*\r
+ * Format the result.\r
+ */\r
+ tp = tmp;\r
+ for (i = 0; i < (IN6ADDRSZ / INT16SZ); i++) {\r
+ /* Are we inside the best run of 0x00's? */\r
+ if (best.base != -1 && i >= best.base &&\r
+ i < (best.base + best.len)) {\r
+ if (i == best.base)\r
+ *tp++ = ':';\r
+ continue;\r
+ }\r
+ /* Are we following an initial run of 0x00s or any real hex? */\r
+ if (i != 0)\r
+ *tp++ = ':';\r
+ /* Is this address an encapsulated IPv4? */\r
+ if (i == 6 && best.base == 0 &&\r
+ (best.len == 6 || (best.len == 5 && words[5] == 0xffff))) {\r
+ if (!inet_ntop4(src+12, tp, sizeof tmp - (tp - tmp)))\r
+ return (NULL);\r
+ tp += strlen(tp);\r
+ break;\r
+ }\r
+ tp += SPRINTF((tp, "%x", words[i]));\r
+ }\r
+ /* Was it a trailing run of 0x00's? */\r
+ if (best.base != -1 && (best.base + best.len) == (IN6ADDRSZ / INT16SZ))\r
+ *tp++ = ':';\r
+ *tp++ = '\0';\r
+\r
+ /*\r
+ * Check for overflow, copy, and we're done.\r
+ */\r
+ if ((size_t)(tp - tmp) > size) {\r
+ errno = ENOSPC;\r
+ return (NULL);\r
+ }\r
+ strcpy(dst, tmp);\r
+ return (dst);\r
+}\r
+#endif\r
+\r
projects / reactos.git / commitdiff