]> git.saurik.com Git - apple/libc.git/blame - net.subproj/ns_ntoa.c
Libc-166.tar.gz
[apple/libc.git] / net.subproj / ns_ntoa.c
CommitLineData
e9ce8d39
A
1/*
2 * Copyright (c) 1999 Apple Computer, Inc. All rights reserved.
3 *
4 * @APPLE_LICENSE_HEADER_START@
5 *
6 * The contents of this file constitute Original Code as defined in and
7 * are subject to the Apple Public Source License Version 1.1 (the
8 * "License"). You may not use this file except in compliance with the
9 * License. Please obtain a copy of the License at
10 * http://www.apple.com/publicsource and read it before using this file.
11 *
12 * This Original Code and all software distributed under the License are
13 * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
14 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
15 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
16 * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the
17 * License for the specific language governing rights and limitations
18 * under the License.
19 *
20 * @APPLE_LICENSE_HEADER_END@
21 */
22/*
23 * Copyright (c) 1986, 1993
24 * The Regents of the University of California. All rights reserved.
25 *
26 * Redistribution and use in source and binary forms, with or without
27 * modification, are permitted provided that the following conditions
28 * are met:
29 * 1. Redistributions of source code must retain the above copyright
30 * notice, this list of conditions and the following disclaimer.
31 * 2. Redistributions in binary form must reproduce the above copyright
32 * notice, this list of conditions and the following disclaimer in the
33 * documentation and/or other materials provided with the distribution.
34 * 3. All advertising materials mentioning features or use of this software
35 * must display the following acknowledgement:
36 * This product includes software developed by the University of
37 * California, Berkeley and its contributors.
38 * 4. Neither the name of the University nor the names of its contributors
39 * may be used to endorse or promote products derived from this software
40 * without specific prior written permission.
41 *
42 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
43 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
44 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
45 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
46 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
47 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
48 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
49 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
50 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
51 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
52 * SUCH DAMAGE.
53 */
54
55
56#include <sys/param.h>
57#include <netns/ns.h>
58#include <stdio.h>
59
60char *
61ns_ntoa(addr)
62 struct ns_addr addr;
63{
64 static char obuf[40];
65 union { union ns_net net_e; u_long long_e; } net;
66 u_short port = htons(addr.x_port);
67 register char *cp;
68 char *cp2;
69 register u_char *up = addr.x_host.c_host;
70 u_char *uplim = up + 6;
71 static char *spectHex();
72
73 net.net_e = addr.x_net;
74 sprintf(obuf, "%lx", ntohl(net.long_e));
75 cp = spectHex(obuf);
76 cp2 = cp + 1;
77 while (*up==0 && up < uplim) up++;
78 if (up == uplim) {
79 if (port) {
80 sprintf(cp, ".0");
81 cp += 2;
82 }
83 } else {
84 sprintf(cp, ".%x", *up++);
85 while (up < uplim) {
86 while (*cp) cp++;
87 sprintf(cp, "%02x", *up++);
88 }
89 cp = spectHex(cp2);
90 }
91 if (port) {
92 sprintf(cp, ".%x", port);
93 spectHex(cp + 1);
94 }
95 return (obuf);
96}
97
98static char *
99spectHex(p0)
100 char *p0;
101{
102 int ok = 0;
103 int nonzero = 0;
104 register char *p = p0;
105 for (; *p; p++) switch (*p) {
106
107 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
108 *p += ('A' - 'a');
109 /* fall into . . . */
110 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
111 ok = 1;
112 case '1': case '2': case '3': case '4': case '5':
113 case '6': case '7': case '8': case '9':
114 nonzero = 1;
115 }
116 if (nonzero && !ok) { *p++ = 'H'; *p = 0; }
117 return (p);
118}