lib/libipx/ipx_addr.c

   1 /*
   2  * Copyright (c) 1986, 1993
   3  *      The Regents of the University of California.  All rights reserved.
   4  *
   5  * This code is derived from software contributed to Berkeley by
   6  * J.Q. Johnson.
   7  *
   8  * Redistribution and use in source and binary forms, with or without
   9  * modification, are permitted provided that the following conditions
  10  * are met:
  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.
  23  *
  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
  34  * SUCH DAMAGE.
  35  *
  36  * $FreeBSD: src/lib/libipx/ipx_addr.c,v 1.2.8.1 2001/03/05 06:21:40 kris Exp $
  37  *
  38  * @(#)ipx_addr.c
  39  */
  40
  41 #include <sys/param.h>
  42 #include <netipx/ipx.h>
  43 #include <stdio.h>
  44 #include <string.h>
  45
  46 static struct ipx_addr addr, zero_addr;
  47
  48 static void Field(), cvtbase();
  49
  50 struct ipx_addr
  51 ipx_addr(const char *name)
  52 {
  53         char separator;
  54         char *hostname, *socketname, *cp;
  55         char buf[50];
  56
  57         (void)strncpy(buf, name, sizeof(buf) - 1);
  58         buf[sizeof(buf) - 1] = '\0';
  59
  60         /*
  61          * First, figure out what he intends as a field separator.
  62          * Despite the way this routine is written, the preferred
  63          * form  2-272.AA001234H.01777, i.e. XDE standard.
  64          * Great efforts are made to ensure backwards compatibility.
  65          */
  66         if ( (hostname = strchr(buf, '#')) )
  67                 separator = '#';
  68         else {
  69                 hostname = strchr(buf, '.');
  70                 if ((cp = strchr(buf, ':')) &&
  71                     ((hostname && cp < hostname) || (hostname == NULL))) {
  72                         hostname = cp;
  73                         separator = ':';
  74                 } else
  75                         separator = '.';
  76         }
  77         if (hostname)
  78                 *hostname++ = 0;
  79
  80         addr = zero_addr;
  81         Field(buf, addr.x_net.c_net, 4);
  82         if (hostname == NULL)
  83                 return (addr);  /* No separator means net only */
  84
  85         socketname = strchr(hostname, separator);
  86         if (socketname) {
  87                 *socketname++ = 0;
  88                 Field(socketname, (u_char *)&addr.x_port, 2);
  89         }
  90
  91         Field(hostname, addr.x_host.c_host, 6);
  92
  93         return (addr);
  94 }
  95
  96 static void
  97 Field(char *buf, u_char *out, int len)
  98 {
  99         char *bp = buf;
 100         int i, ibase, base16 = 0, base10 = 0, clen = 0;
 101         int hb[6], *hp;
 102         char *fmt;
 103
 104         /*
 105          * first try 2-273#2-852-151-014#socket
 106          */
 107         if ((*buf != '-') &&
 108             (1 < (i = sscanf(buf, "%d-%d-%d-%d-%d",
 109                         &hb[0], &hb[1], &hb[2], &hb[3], &hb[4])))) {
 110                 cvtbase(1000L, 256, hb, i, out, len);
 111                 return;
 112         }
 113         /*
 114          * try form 8E1#0.0.AA.0.5E.E6#socket
 115          */
 116         if (1 < (i = sscanf(buf,"%x.%x.%x.%x.%x.%x",
 117                         &hb[0], &hb[1], &hb[2], &hb[3], &hb[4], &hb[5]))) {
 118                 cvtbase(256L, 256, hb, i, out, len);
 119                 return;
 120         }
 121         /*
 122          * try form 8E1#0:0:AA:0:5E:E6#socket
 123          */
 124         if (1 < (i = sscanf(buf,"%x:%x:%x:%x:%x:%x",
 125                         &hb[0], &hb[1], &hb[2], &hb[3], &hb[4], &hb[5]))) {
 126                 cvtbase(256L, 256, hb, i, out, len);
 127                 return;
 128         }
 129         /*
 130          * This is REALLY stretching it but there was a
 131          * comma notation separating shorts -- definitely non-standard
 132          */
 133         if (1 < (i = sscanf(buf,"%x,%x,%x",
 134                         &hb[0], &hb[1], &hb[2]))) {
 135                 hb[0] = htons(hb[0]); hb[1] = htons(hb[1]);
 136                 hb[2] = htons(hb[2]);
 137                 cvtbase(65536L, 256, hb, i, out, len);
 138                 return;
 139         }
 140
 141         /* Need to decide if base 10, 16 or 8 */
 142         while (*bp) switch (*bp++) {
 143
 144         case '0': case '1': case '2': case '3': case '4': case '5':
 145         case '6': case '7': case '-':
 146                 break;
 147
 148         case '8': case '9':
 149                 base10 = 1;
 150                 break;
 151
 152         case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
 153         case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
 154                 base16 = 1;
 155                 break;
 156
 157         case 'x': case 'X':
 158                 *--bp = '0';
 159                 base16 = 1;
 160                 break;
 161
 162         case 'h': case 'H':
 163                 base16 = 1;
 164                 /* fall into */
 165
 166         default:
 167                 *--bp = 0; /* Ends Loop */
 168         }
 169         if (base16) {
 170                 fmt = "%3x";
 171                 ibase = 4096;
 172         } else if (base10 == 0 && *buf == '0') {
 173                 fmt = "%3o";
 174                 ibase = 512;
 175         } else {
 176                 fmt = "%3d";
 177                 ibase = 1000;
 178         }
 179
 180         for (bp = buf; *bp++; ) clen++;
 181         if (clen == 0) clen++;
 182         if (clen > 18) clen = 18;
 183         i = ((clen - 1) / 3) + 1;
 184         bp = clen + buf - 3;
 185         hp = hb + i - 1;
 186
 187         while (hp > hb) {
 188                 (void)sscanf(bp, fmt, hp);
 189                 bp[0] = 0;
 190                 hp--;
 191                 bp -= 3;
 192         }
 193         (void)sscanf(buf, fmt, hp);
 194         cvtbase((long)ibase, 256, hb, i, out, len);
 195 }
 196
 197 static void
 198 cvtbase(long oldbase, int newbase, int input[], int inlen,
 199         unsigned char result[], int reslen)
 200 {
 201         int d, e;
 202         long sum;
 203
 204         e = 1;
 205         while (e > 0 && reslen > 0) {
 206                 d = 0; e = 0; sum = 0;
 207                 /* long division: input=input/newbase */
 208                 while (d < inlen) {
 209                         sum = sum*oldbase + (long) input[d];
 210                         e += (sum > 0);
 211                         input[d++] = sum / newbase;
 212                         sum %= newbase;
 213                 }
 214                 result[--reslen] = sum; /* accumulate remainder */
 215         }
 216         for (d=0; d < reslen; d++)
 217                 result[d] = 0;
 218 }