2 * Copyright (c) 1986, 1993
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * $FreeBSD: src/lib/libipx/ipx_addr.c,v 1.2.8.1 2001/03/05 06:21:40 kris Exp $
37 * $DragonFly: src/lib/libipx/ipx_addr.c,v 1.2 2003/06/17 04:26:49 dillon Exp $
42 #include <sys/param.h>
43 #include <netipx/ipx.h>
47 static struct ipx_addr addr, zero_addr;
49 static void Field(), cvtbase();
56 char *hostname, *socketname, *cp;
59 (void)strncpy(buf, name, sizeof(buf) - 1);
60 buf[sizeof(buf) - 1] = '\0';
63 * First, figure out what he intends as a field separator.
64 * Despite the way this routine is written, the preferred
65 * form 2-272.AA001234H.01777, i.e. XDE standard.
66 * Great efforts are made to ensure backwards compatibility.
68 if ( (hostname = strchr(buf, '#')) )
71 hostname = strchr(buf, '.');
72 if ((cp = strchr(buf, ':')) &&
73 ((hostname && cp < hostname) || (hostname == 0))) {
83 Field(buf, addr.x_net.c_net, 4);
85 return (addr); /* No separator means net only */
87 socketname = strchr(hostname, separator);
90 Field(socketname, (u_char *)&addr.x_port, 2);
93 Field(hostname, addr.x_host.c_host, 6);
104 register char *bp = buf;
105 int i, ibase, base16 = 0, base10 = 0, clen = 0;
110 * first try 2-273#2-852-151-014#socket
113 (1 < (i = sscanf(buf, "%d-%d-%d-%d-%d",
114 &hb[0], &hb[1], &hb[2], &hb[3], &hb[4])))) {
115 cvtbase(1000L, 256, hb, i, out, len);
119 * try form 8E1#0.0.AA.0.5E.E6#socket
121 if (1 < (i = sscanf(buf,"%x.%x.%x.%x.%x.%x",
122 &hb[0], &hb[1], &hb[2], &hb[3], &hb[4], &hb[5]))) {
123 cvtbase(256L, 256, hb, i, out, len);
127 * try form 8E1#0:0:AA:0:5E:E6#socket
129 if (1 < (i = sscanf(buf,"%x:%x:%x:%x:%x:%x",
130 &hb[0], &hb[1], &hb[2], &hb[3], &hb[4], &hb[5]))) {
131 cvtbase(256L, 256, hb, i, out, len);
135 * This is REALLY stretching it but there was a
136 * comma notation separating shorts -- definitely non-standard
138 if (1 < (i = sscanf(buf,"%x,%x,%x",
139 &hb[0], &hb[1], &hb[2]))) {
140 hb[0] = htons(hb[0]); hb[1] = htons(hb[1]);
141 hb[2] = htons(hb[2]);
142 cvtbase(65536L, 256, hb, i, out, len);
146 /* Need to decide if base 10, 16 or 8 */
147 while (*bp) switch (*bp++) {
149 case '0': case '1': case '2': case '3': case '4': case '5':
150 case '6': case '7': case '-':
157 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
158 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
172 *--bp = 0; /* Ends Loop */
177 } else if (base10 == 0 && *buf == '0') {
185 for (bp = buf; *bp++; ) clen++;
186 if (clen == 0) clen++;
187 if (clen > 18) clen = 18;
188 i = ((clen - 1) / 3) + 1;
193 (void)sscanf(bp, fmt, hp);
198 (void)sscanf(buf, fmt, hp);
199 cvtbase((long)ibase, 256, hb, i, out, len);
203 cvtbase(oldbase,newbase,input,inlen,result,reslen)
208 unsigned char result[];
215 while (e > 0 && reslen > 0) {
216 d = 0; e = 0; sum = 0;
217 /* long division: input=input/newbase */
219 sum = sum*oldbase + (long) input[d];
221 input[d++] = sum / newbase;
224 result[--reslen] = sum; /* accumulate remainder */
226 for (d=0; d < reslen; d++)