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 sccsid[] = "@(#)ns_ntoa.c 8.1 (Berkeley) 6/4/93";
|
---|
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();
|
---|
43 |
|
---|
44 | char *
|
---|
45 | ns_ntoa(
|
---|
46 | struct ns_addr addr
|
---|
47 | )
|
---|
48 | {
|
---|
49 | static char obuf[40];
|
---|
50 | union { union ns_net net_e; u_long long_e; } net;
|
---|
51 | u_short port = htons(addr.x_port);
|
---|
52 | register char *cp;
|
---|
53 | char *cp2;
|
---|
54 | register u_char *up = addr.x_host.c_host;
|
---|
55 | u_char *uplim = up + 6;
|
---|
56 |
|
---|
57 | net.net_e = addr.x_net;
|
---|
58 | sprintf(obuf, "%x", (UINT32)ntohl(net.long_e));
|
---|
59 | cp = spectHex(obuf);
|
---|
60 | cp2 = cp + 1;
|
---|
61 | while (*up==0 && up < uplim) up++;
|
---|
62 | if (up == uplim) {
|
---|
63 | if (port) {
|
---|
64 | sprintf(cp, ".0");
|
---|
65 | cp += 2;
|
---|
66 | }
|
---|
67 | } else {
|
---|
68 | sprintf(cp, ".%x", *up++);
|
---|
69 | while (up < uplim) {
|
---|
70 | while (*cp) cp++;
|
---|
71 | sprintf(cp, "%02x", *up++);
|
---|
72 | }
|
---|
73 | cp = spectHex(cp2);
|
---|
74 | }
|
---|
75 | if (port) {
|
---|
76 | sprintf(cp, ".%x", port);
|
---|
77 | spectHex(cp + 1);
|
---|
78 | }
|
---|
79 | return (obuf);
|
---|
80 | }
|
---|
81 |
|
---|
82 | static char *
|
---|
83 | spectHex(
|
---|
84 | char *p0
|
---|
85 | )
|
---|
86 | {
|
---|
87 | int ok = 0;
|
---|
88 | int nonzero = 0;
|
---|
89 | register char *p = p0;
|
---|
90 | for (; *p; p++) switch (*p) {
|
---|
91 |
|
---|
92 | case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
|
---|
93 | *p += ('A' - 'a');
|
---|
94 | /* fall into . . . */
|
---|
95 | case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
|
---|
96 | ok = 1;
|
---|
97 | case '1': case '2': case '3': case '4': case '5':
|
---|
98 | case '6': case '7': case '8': case '9':
|
---|
99 | nonzero = 1;
|
---|
100 | }
|
---|
101 | if (nonzero && !ok) { *p++ = 'H'; *p = 0; }
|
---|
102 | return (p);
|
---|
103 | }
|
---|