linkaddr.c revision 1.6 1 1.6 christos /* $NetBSD: linkaddr.c,v 1.6 1997/07/13 19:57:52 christos Exp $ */
2 1.5 cgd
3 1.1 cgd /*-
4 1.5 cgd * Copyright (c) 1990, 1993
5 1.5 cgd * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.1 cgd * 3. All advertising materials mentioning features or use of this software
16 1.1 cgd * must display the following acknowledgement:
17 1.1 cgd * This product includes software developed by the University of
18 1.1 cgd * California, Berkeley and its contributors.
19 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
20 1.1 cgd * may be used to endorse or promote products derived from this software
21 1.1 cgd * without specific prior written permission.
22 1.1 cgd *
23 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 1.1 cgd * SUCH DAMAGE.
34 1.1 cgd */
35 1.1 cgd
36 1.6 christos #include <sys/cdefs.h>
37 1.1 cgd #if defined(LIBC_SCCS) && !defined(lint)
38 1.5 cgd #if 0
39 1.5 cgd static char sccsid[] = "@(#)linkaddr.c 8.1 (Berkeley) 6/4/93";
40 1.5 cgd #else
41 1.6 christos __RCSID("$NetBSD: linkaddr.c,v 1.6 1997/07/13 19:57:52 christos Exp $");
42 1.5 cgd #endif
43 1.1 cgd #endif /* LIBC_SCCS and not lint */
44 1.1 cgd
45 1.1 cgd #include <sys/types.h>
46 1.1 cgd #include <sys/socket.h>
47 1.1 cgd #include <net/if_dl.h>
48 1.1 cgd #include <string.h>
49 1.1 cgd
50 1.1 cgd /* States*/
51 1.1 cgd #define NAMING 0
52 1.1 cgd #define GOTONE 1
53 1.1 cgd #define GOTTWO 2
54 1.1 cgd #define RESET 3
55 1.1 cgd /* Inputs */
56 1.1 cgd #define DIGIT (4*0)
57 1.1 cgd #define END (4*1)
58 1.1 cgd #define DELIM (4*2)
59 1.1 cgd #define LETTER (4*3)
60 1.1 cgd
61 1.1 cgd void
62 1.1 cgd link_addr(addr, sdl)
63 1.1 cgd register const char *addr;
64 1.1 cgd register struct sockaddr_dl *sdl;
65 1.1 cgd {
66 1.1 cgd register char *cp = sdl->sdl_data;
67 1.1 cgd char *cplim = sdl->sdl_len + (char *)sdl;
68 1.6 christos register int byte = 0, state = NAMING;
69 1.6 christos register int newaddr = 0; /* pacify gcc */
70 1.1 cgd
71 1.1 cgd bzero((char *)&sdl->sdl_family, sdl->sdl_len - 1);
72 1.1 cgd sdl->sdl_family = AF_LINK;
73 1.1 cgd do {
74 1.1 cgd state &= ~LETTER;
75 1.1 cgd if ((*addr >= '0') && (*addr <= '9')) {
76 1.6 christos newaddr = *addr - '0';
77 1.1 cgd } else if ((*addr >= 'a') && (*addr <= 'f')) {
78 1.6 christos newaddr = *addr - 'a' + 10;
79 1.1 cgd } else if ((*addr >= 'A') && (*addr <= 'F')) {
80 1.6 christos newaddr = *addr - 'A' + 10;
81 1.1 cgd } else if (*addr == 0) {
82 1.1 cgd state |= END;
83 1.1 cgd } else if (state == NAMING &&
84 1.1 cgd (((*addr >= 'A') && (*addr <= 'Z')) ||
85 1.1 cgd ((*addr >= 'a') && (*addr <= 'z'))))
86 1.1 cgd state |= LETTER;
87 1.1 cgd else
88 1.1 cgd state |= DELIM;
89 1.1 cgd addr++;
90 1.1 cgd switch (state /* | INPUT */) {
91 1.1 cgd case NAMING | DIGIT:
92 1.1 cgd case NAMING | LETTER:
93 1.5 cgd *cp++ = addr[-1];
94 1.5 cgd continue;
95 1.1 cgd case NAMING | DELIM:
96 1.5 cgd state = RESET;
97 1.5 cgd sdl->sdl_nlen = cp - sdl->sdl_data;
98 1.5 cgd continue;
99 1.1 cgd case GOTTWO | DIGIT:
100 1.5 cgd *cp++ = byte;
101 1.5 cgd /* FALLTHROUGH */
102 1.1 cgd case RESET | DIGIT:
103 1.5 cgd state = GOTONE;
104 1.6 christos byte = newaddr;
105 1.5 cgd continue;
106 1.1 cgd case GOTONE | DIGIT:
107 1.5 cgd state = GOTTWO;
108 1.6 christos byte = newaddr + (byte << 4);
109 1.5 cgd continue;
110 1.1 cgd default: /* | DELIM */
111 1.5 cgd state = RESET;
112 1.5 cgd *cp++ = byte;
113 1.5 cgd byte = 0;
114 1.5 cgd continue;
115 1.1 cgd case GOTONE | END:
116 1.1 cgd case GOTTWO | END:
117 1.5 cgd *cp++ = byte;
118 1.5 cgd /* FALLTHROUGH */
119 1.1 cgd case RESET | END:
120 1.1 cgd break;
121 1.1 cgd }
122 1.1 cgd break;
123 1.1 cgd } while (cp < cplim);
124 1.1 cgd sdl->sdl_alen = cp - LLADDR(sdl);
125 1.6 christos newaddr = cp - (char *)sdl;
126 1.6 christos if (newaddr > sizeof(*sdl))
127 1.6 christos sdl->sdl_len = newaddr;
128 1.1 cgd return;
129 1.1 cgd }
130 1.1 cgd
131 1.1 cgd static char hexlist[] = "0123456789abcdef";
132 1.1 cgd
133 1.1 cgd char *
134 1.1 cgd link_ntoa(sdl)
135 1.1 cgd register const struct sockaddr_dl *sdl;
136 1.1 cgd {
137 1.1 cgd static char obuf[64];
138 1.1 cgd register char *out = obuf;
139 1.1 cgd register int i;
140 1.1 cgd register u_char *in = (u_char *)LLADDR(sdl);
141 1.5 cgd u_char *inlim = in + sdl->sdl_alen;
142 1.1 cgd int firsttime = 1;
143 1.1 cgd
144 1.1 cgd if (sdl->sdl_nlen) {
145 1.1 cgd bcopy(sdl->sdl_data, obuf, sdl->sdl_nlen);
146 1.1 cgd out += sdl->sdl_nlen;
147 1.5 cgd if (sdl->sdl_alen)
148 1.5 cgd *out++ = ':';
149 1.1 cgd }
150 1.1 cgd while (in < inlim) {
151 1.5 cgd if (firsttime)
152 1.5 cgd firsttime = 0;
153 1.5 cgd else
154 1.5 cgd *out++ = '.';
155 1.1 cgd i = *in++;
156 1.1 cgd if (i > 0xf) {
157 1.1 cgd out[1] = hexlist[i & 0xf];
158 1.1 cgd i >>= 4;
159 1.1 cgd out[0] = hexlist[i];
160 1.1 cgd out += 2;
161 1.1 cgd } else
162 1.1 cgd *out++ = hexlist[i];
163 1.1 cgd }
164 1.1 cgd *out = 0;
165 1.5 cgd return (obuf);
166 1.1 cgd }
167