1 |
30 |
unneback |
/*
|
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 |
|
|
* $Id: ns_ntoa.c,v 1.2 2001-09-27 12:01:53 chris Exp $
|
34 |
|
|
*/
|
35 |
|
|
|
36 |
|
|
#if defined(LIBC_SCCS) && !defined(lint)
|
37 |
|
|
static char sccsid[] = "@(#)ns_ntoa.c 8.1 (Berkeley) 6/4/93";
|
38 |
|
|
#endif /* LIBC_SCCS and not lint */
|
39 |
|
|
|
40 |
|
|
#include <sys/param.h>
|
41 |
|
|
#include <netns/ns.h>
|
42 |
|
|
#include <stdio.h>
|
43 |
|
|
|
44 |
|
|
char *
|
45 |
|
|
ns_ntoa(addr)
|
46 |
|
|
struct ns_addr addr;
|
47 |
|
|
{
|
48 |
|
|
static char obuf[40];
|
49 |
|
|
union { union ns_net net_e; u_long long_e; } net;
|
50 |
|
|
u_short port = htons(addr.x_port);
|
51 |
|
|
register char *cp;
|
52 |
|
|
char *cp2;
|
53 |
|
|
register u_char *up = addr.x_host.c_host;
|
54 |
|
|
u_char *uplim = up + 6;
|
55 |
|
|
static char *spectHex();
|
56 |
|
|
|
57 |
|
|
net.net_e = addr.x_net;
|
58 |
|
|
sprintf(obuf, "%lx", (u_long)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(p0)
|
84 |
|
|
char *p0;
|
85 |
|
|
{
|
86 |
|
|
int ok = 0;
|
87 |
|
|
int nonzero = 0;
|
88 |
|
|
register char *p = p0;
|
89 |
|
|
for (; *p; p++) switch (*p) {
|
90 |
|
|
|
91 |
|
|
case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
|
92 |
|
|
*p += ('A' - 'a');
|
93 |
|
|
/* fall into . . . */
|
94 |
|
|
case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
|
95 |
|
|
ok = 1;
|
96 |
|
|
case '1': case '2': case '3': case '4': case '5':
|
97 |
|
|
case '6': case '7': case '8': case '9':
|
98 |
|
|
nonzero = 1;
|
99 |
|
|
}
|
100 |
|
|
if (nonzero && !ok) { *p++ = 'H'; *p = 0; }
|
101 |
|
|
return (p);
|
102 |
|
|
}
|