1 |
30 |
unneback |
/*
|
2 |
|
|
* Copyright (c) 1989, 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: iso_addr.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[] = "@(#)iso_addr.c 8.1 (Berkeley) 6/4/93";
|
38 |
|
|
#endif /* LIBC_SCCS and not lint */
|
39 |
|
|
|
40 |
|
|
#include <sys/types.h>
|
41 |
|
|
#include <netiso/iso.h>
|
42 |
|
|
#include <string.h>
|
43 |
|
|
|
44 |
|
|
/* States*/
|
45 |
|
|
#define VIRGIN 0
|
46 |
|
|
#define GOTONE 1
|
47 |
|
|
#define GOTTWO 2
|
48 |
|
|
/* Inputs */
|
49 |
|
|
#define DIGIT (4*0)
|
50 |
|
|
#define END (4*1)
|
51 |
|
|
#define DELIM (4*2)
|
52 |
|
|
|
53 |
|
|
struct iso_addr *
|
54 |
|
|
iso_addr(addr)
|
55 |
|
|
register const char *addr;
|
56 |
|
|
{
|
57 |
|
|
static struct iso_addr out_addr;
|
58 |
|
|
register char *cp = out_addr.isoa_genaddr;
|
59 |
|
|
char *cplim = cp + sizeof(out_addr.isoa_genaddr);
|
60 |
|
|
register int byte = 0, state = VIRGIN, new;
|
61 |
|
|
|
62 |
|
|
bzero((char *)&out_addr, sizeof(out_addr));
|
63 |
|
|
do {
|
64 |
|
|
if ((*addr >= '0') && (*addr <= '9')) {
|
65 |
|
|
new = *addr - '0';
|
66 |
|
|
} else if ((*addr >= 'a') && (*addr <= 'f')) {
|
67 |
|
|
new = *addr - 'a' + 10;
|
68 |
|
|
} else if ((*addr >= 'A') && (*addr <= 'F')) {
|
69 |
|
|
new = *addr - 'A' + 10;
|
70 |
|
|
} else if (*addr == 0)
|
71 |
|
|
state |= END;
|
72 |
|
|
else
|
73 |
|
|
state |= DELIM;
|
74 |
|
|
addr++;
|
75 |
|
|
switch (state /* | INPUT */) {
|
76 |
|
|
case GOTTWO | DIGIT:
|
77 |
|
|
*cp++ = byte; /*FALLTHROUGH*/
|
78 |
|
|
case VIRGIN | DIGIT:
|
79 |
|
|
state = GOTONE; byte = new; continue;
|
80 |
|
|
case GOTONE | DIGIT:
|
81 |
|
|
state = GOTTWO; byte = new + (byte << 4); continue;
|
82 |
|
|
default: /* | DELIM */
|
83 |
|
|
state = VIRGIN; *cp++ = byte; byte = 0; continue;
|
84 |
|
|
case GOTONE | END:
|
85 |
|
|
case GOTTWO | END:
|
86 |
|
|
*cp++ = byte; /* FALLTHROUGH */
|
87 |
|
|
case VIRGIN | END:
|
88 |
|
|
break;
|
89 |
|
|
}
|
90 |
|
|
break;
|
91 |
|
|
} while (cp < cplim);
|
92 |
|
|
out_addr.isoa_len = cp - out_addr.isoa_genaddr;
|
93 |
|
|
return (&out_addr);
|
94 |
|
|
}
|
95 |
|
|
|
96 |
|
|
static char hexlist[] = "0123456789abcdef";
|
97 |
|
|
|
98 |
|
|
char *
|
99 |
|
|
iso_ntoa(isoa)
|
100 |
|
|
const struct iso_addr *isoa;
|
101 |
|
|
{
|
102 |
|
|
static char tmpbuf[sizeof(isoa->isoa_genaddr)*3];
|
103 |
|
|
const u_char *binary;
|
104 |
|
|
char *cp;
|
105 |
|
|
int i;
|
106 |
|
|
|
107 |
|
|
binary = isoa->isoa_genaddr;
|
108 |
|
|
cp = tmpbuf;
|
109 |
|
|
|
110 |
|
|
for (i = 0; i < isoa->isoa_len; i++) {
|
111 |
|
|
*cp++ = hexlist[*binary >> 4];
|
112 |
|
|
*cp++ = hexlist[*binary++ & 0xf];
|
113 |
|
|
|
114 |
|
|
if ((((i % 2) == 0) && ((i + 1) < isoa->isoa_len)))
|
115 |
|
|
*cp++ = '.';
|
116 |
|
|
}
|
117 |
|
|
*cp = '\0';
|
118 |
|
|
return tmpbuf;
|
119 |
|
|
}
|