diff options
Diffstat (limited to 'src/lib/libc/net/ns_ntoa.c')
| -rw-r--r-- | src/lib/libc/net/ns_ntoa.c | 104 |
1 files changed, 104 insertions, 0 deletions
diff --git a/src/lib/libc/net/ns_ntoa.c b/src/lib/libc/net/ns_ntoa.c new file mode 100644 index 0000000000..5ff410e28a --- /dev/null +++ b/src/lib/libc/net/ns_ntoa.c | |||
| @@ -0,0 +1,104 @@ | |||
| 1 | /* | ||
| 2 | * Copyright (c) 1986, 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 | |||
| 34 | #if defined(LIBC_SCCS) && !defined(lint) | ||
| 35 | static char rcsid[] = "$OpenBSD: ns_ntoa.c,v 1.10 2002/07/25 21:12:47 deraadt Exp $"; | ||
| 36 | #endif /* LIBC_SCCS and not lint */ | ||
| 37 | |||
| 38 | #include <sys/param.h> | ||
| 39 | #include <netns/ns.h> | ||
| 40 | #include <stdio.h> | ||
| 41 | |||
| 42 | static char *spectHex(char *); | ||
| 43 | |||
| 44 | char * | ||
| 45 | ns_ntoa(struct ns_addr addr) | ||
| 46 | { | ||
| 47 | static char obuf[40]; | ||
| 48 | union { union ns_net net_e; u_int32_t long_e; } net; | ||
| 49 | in_port_t port = htons(addr.x_port); | ||
| 50 | char *cp, *cp2; | ||
| 51 | u_char *up = addr.x_host.c_host; | ||
| 52 | u_char *uplim = up + 6; | ||
| 53 | |||
| 54 | net.net_e = addr.x_net; | ||
| 55 | snprintf(obuf, sizeof obuf, "%x", ntohl(net.long_e)); | ||
| 56 | cp = spectHex(obuf); | ||
| 57 | cp2 = cp + 1; | ||
| 58 | while (*up==0 && up < uplim) | ||
| 59 | up++; | ||
| 60 | if (up == uplim) { | ||
| 61 | if (port) { | ||
| 62 | sprintf(cp, ".0"); | ||
| 63 | cp += 2; | ||
| 64 | } | ||
| 65 | } else { | ||
| 66 | sprintf(cp, ".%x", *up++); | ||
| 67 | while (up < uplim) { | ||
| 68 | while (*cp) | ||
| 69 | cp++; | ||
| 70 | sprintf(cp, "%02x", *up++); | ||
| 71 | } | ||
| 72 | cp = spectHex(cp2); | ||
| 73 | } | ||
| 74 | if (port) { | ||
| 75 | sprintf(cp, ".%x", port); | ||
| 76 | spectHex(cp + 1); | ||
| 77 | } | ||
| 78 | return (obuf); | ||
| 79 | } | ||
| 80 | |||
| 81 | static char * | ||
| 82 | spectHex(char *p0) | ||
| 83 | { | ||
| 84 | int ok = 0, nonzero = 0; | ||
| 85 | char *p = p0; | ||
| 86 | |||
| 87 | for (; *p; p++) { | ||
| 88 | switch (*p) { | ||
| 89 | case 'a': case 'b': case 'c': case 'd': case 'e': case 'f': | ||
| 90 | *p += ('A' - 'a'); | ||
| 91 | /* fall into . . . */ | ||
| 92 | case 'A': case 'B': case 'C': case 'D': case 'E': case 'F': | ||
| 93 | ok = 1; | ||
| 94 | case '1': case '2': case '3': case '4': case '5': | ||
| 95 | case '6': case '7': case '8': case '9': | ||
| 96 | nonzero = 1; | ||
| 97 | } | ||
| 98 | } | ||
| 99 | if (nonzero && !ok) { | ||
| 100 | *p++ = 'H'; | ||
| 101 | *p = 0; | ||
| 102 | } | ||
| 103 | return (p); | ||
| 104 | } | ||
