summaryrefslogtreecommitdiff
path: root/src/lib/libc/net/ns_ntoa.c
diff options
context:
space:
mode:
authorderaadt <>1995-10-18 08:42:23 +0000
committerderaadt <>1995-10-18 08:42:23 +0000
commit0527d29da443886d92e9a418180c5b25a5f8d270 (patch)
tree86b3a64928451a669cefa27900e5884036b4e349 /src/lib/libc/net/ns_ntoa.c
downloadopenbsd-0527d29da443886d92e9a418180c5b25a5f8d270.tar.gz
openbsd-0527d29da443886d92e9a418180c5b25a5f8d270.tar.bz2
openbsd-0527d29da443886d92e9a418180c5b25a5f8d270.zip
initial import of NetBSD tree
Diffstat (limited to 'src/lib/libc/net/ns_ntoa.c')
-rw-r--r--src/lib/libc/net/ns_ntoa.c106
1 files changed, 106 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..ad3265399b
--- /dev/null
+++ b/src/lib/libc/net/ns_ntoa.c
@@ -0,0 +1,106 @@
1/* $NetBSD: ns_ntoa.c,v 1.4 1995/02/25 06:20:51 cgd Exp $ */
2
3/*
4 * Copyright (c) 1986, 1993
5 * The Regents of the University of California. All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. All advertising materials mentioning features or use of this software
16 * must display the following acknowledgement:
17 * This product includes software developed by the University of
18 * California, Berkeley and its contributors.
19 * 4. Neither the name of the University nor the names of its contributors
20 * may be used to endorse or promote products derived from this software
21 * without specific prior written permission.
22 *
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * SUCH DAMAGE.
34 */
35
36#if defined(LIBC_SCCS) && !defined(lint)
37#if 0
38static char sccsid[] = "@(#)ns_ntoa.c 8.1 (Berkeley) 6/4/93";
39#else
40static char rcsid[] = "$NetBSD: ns_ntoa.c,v 1.4 1995/02/25 06:20:51 cgd Exp $";
41#endif
42#endif /* LIBC_SCCS and not lint */
43
44#include <sys/param.h>
45#include <netns/ns.h>
46#include <stdio.h>
47
48char *
49ns_ntoa(addr)
50 struct ns_addr addr;
51{
52 static char obuf[40];
53 union { union ns_net net_e; u_long long_e; } net;
54 u_short port = htons(addr.x_port);
55 register char *cp;
56 char *cp2;
57 register u_char *up = addr.x_host.c_host;
58 u_char *uplim = up + 6;
59 static char *spectHex();
60
61 net.net_e = addr.x_net;
62 sprintf(obuf, "%lx", ntohl(net.long_e));
63 cp = spectHex(obuf);
64 cp2 = cp + 1;
65 while (*up==0 && up < uplim) up++;
66 if (up == uplim) {
67 if (port) {
68 sprintf(cp, ".0");
69 cp += 2;
70 }
71 } else {
72 sprintf(cp, ".%x", *up++);
73 while (up < uplim) {
74 while (*cp) cp++;
75 sprintf(cp, "%02x", *up++);
76 }
77 cp = spectHex(cp2);
78 }
79 if (port) {
80 sprintf(cp, ".%x", port);
81 spectHex(cp + 1);
82 }
83 return (obuf);
84}
85
86static char *
87spectHex(p0)
88 char *p0;
89{
90 int ok = 0;
91 int nonzero = 0;
92 register char *p = p0;
93 for (; *p; p++) switch (*p) {
94
95 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
96 *p += ('A' - 'a');
97 /* fall into . . . */
98 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
99 ok = 1;
100 case '1': case '2': case '3': case '4': case '5':
101 case '6': case '7': case '8': case '9':
102 nonzero = 1;
103 }
104 if (nonzero && !ok) { *p++ = 'H'; *p = 0; }
105 return (p);
106}