linkaddr.c revision 1.12 1 1.12 thorpej /* $NetBSD: linkaddr.c,v 1.12 2002/11/11 18:07:52 thorpej 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.12 thorpej __RCSID("$NetBSD: linkaddr.c,v 1.12 2002/11/11 18:07:52 thorpej 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.10 lukem
49 1.10 lukem #include <assert.h>
50 1.1 cgd #include <string.h>
51 1.1 cgd
52 1.1 cgd /* States*/
53 1.1 cgd #define NAMING 0
54 1.1 cgd #define GOTONE 1
55 1.1 cgd #define GOTTWO 2
56 1.1 cgd #define RESET 3
57 1.1 cgd /* Inputs */
58 1.1 cgd #define DIGIT (4*0)
59 1.1 cgd #define END (4*1)
60 1.1 cgd #define DELIM (4*2)
61 1.1 cgd #define LETTER (4*3)
62 1.1 cgd
63 1.1 cgd void
64 1.1 cgd link_addr(addr, sdl)
65 1.1 cgd register const char *addr;
66 1.1 cgd register struct sockaddr_dl *sdl;
67 1.1 cgd {
68 1.1 cgd register char *cp = sdl->sdl_data;
69 1.9 christos char *cplim = sdl->sdl_len + (char *)(void *)sdl;
70 1.6 christos register int byte = 0, state = NAMING;
71 1.6 christos register int newaddr = 0; /* pacify gcc */
72 1.1 cgd
73 1.10 lukem _DIAGASSERT(addr != NULL);
74 1.10 lukem _DIAGASSERT(sdl != NULL);
75 1.10 lukem
76 1.8 kleink (void)memset(&sdl->sdl_family, 0, (size_t)sdl->sdl_len - 1);
77 1.1 cgd sdl->sdl_family = AF_LINK;
78 1.1 cgd do {
79 1.1 cgd state &= ~LETTER;
80 1.1 cgd if ((*addr >= '0') && (*addr <= '9')) {
81 1.6 christos newaddr = *addr - '0';
82 1.1 cgd } else if ((*addr >= 'a') && (*addr <= 'f')) {
83 1.6 christos newaddr = *addr - 'a' + 10;
84 1.1 cgd } else if ((*addr >= 'A') && (*addr <= 'F')) {
85 1.6 christos newaddr = *addr - 'A' + 10;
86 1.1 cgd } else if (*addr == 0) {
87 1.1 cgd state |= END;
88 1.1 cgd } else if (state == NAMING &&
89 1.1 cgd (((*addr >= 'A') && (*addr <= 'Z')) ||
90 1.1 cgd ((*addr >= 'a') && (*addr <= 'z'))))
91 1.1 cgd state |= LETTER;
92 1.1 cgd else
93 1.1 cgd state |= DELIM;
94 1.1 cgd addr++;
95 1.1 cgd switch (state /* | INPUT */) {
96 1.1 cgd case NAMING | DIGIT:
97 1.1 cgd case NAMING | LETTER:
98 1.5 cgd *cp++ = addr[-1];
99 1.5 cgd continue;
100 1.1 cgd case NAMING | DELIM:
101 1.5 cgd state = RESET;
102 1.5 cgd sdl->sdl_nlen = cp - sdl->sdl_data;
103 1.5 cgd continue;
104 1.1 cgd case GOTTWO | DIGIT:
105 1.5 cgd *cp++ = byte;
106 1.5 cgd /* FALLTHROUGH */
107 1.1 cgd case RESET | DIGIT:
108 1.5 cgd state = GOTONE;
109 1.6 christos byte = newaddr;
110 1.5 cgd continue;
111 1.1 cgd case GOTONE | DIGIT:
112 1.5 cgd state = GOTTWO;
113 1.6 christos byte = newaddr + (byte << 4);
114 1.5 cgd continue;
115 1.1 cgd default: /* | DELIM */
116 1.5 cgd state = RESET;
117 1.5 cgd *cp++ = byte;
118 1.5 cgd byte = 0;
119 1.5 cgd continue;
120 1.1 cgd case GOTONE | END:
121 1.1 cgd case GOTTWO | END:
122 1.5 cgd *cp++ = byte;
123 1.5 cgd /* FALLTHROUGH */
124 1.1 cgd case RESET | END:
125 1.1 cgd break;
126 1.1 cgd }
127 1.1 cgd break;
128 1.1 cgd } while (cp < cplim);
129 1.1 cgd sdl->sdl_alen = cp - LLADDR(sdl);
130 1.9 christos newaddr = cp - (char *)(void *)sdl;
131 1.12 thorpej if ((size_t) newaddr > sizeof(*sdl))
132 1.6 christos sdl->sdl_len = newaddr;
133 1.1 cgd return;
134 1.1 cgd }
135 1.1 cgd
136 1.7 mycroft static const char hexlist[16] = "0123456789abcdef";
137 1.1 cgd
138 1.1 cgd char *
139 1.1 cgd link_ntoa(sdl)
140 1.1 cgd register const struct sockaddr_dl *sdl;
141 1.1 cgd {
142 1.1 cgd static char obuf[64];
143 1.1 cgd register char *out = obuf;
144 1.9 christos register size_t i;
145 1.1 cgd register u_char *in = (u_char *)LLADDR(sdl);
146 1.5 cgd u_char *inlim = in + sdl->sdl_alen;
147 1.1 cgd int firsttime = 1;
148 1.10 lukem
149 1.10 lukem _DIAGASSERT(sdl != NULL);
150 1.1 cgd
151 1.1 cgd if (sdl->sdl_nlen) {
152 1.8 kleink (void)memcpy(obuf, sdl->sdl_data, (size_t)sdl->sdl_nlen);
153 1.1 cgd out += sdl->sdl_nlen;
154 1.5 cgd if (sdl->sdl_alen)
155 1.5 cgd *out++ = ':';
156 1.1 cgd }
157 1.1 cgd while (in < inlim) {
158 1.5 cgd if (firsttime)
159 1.5 cgd firsttime = 0;
160 1.5 cgd else
161 1.5 cgd *out++ = '.';
162 1.1 cgd i = *in++;
163 1.1 cgd if (i > 0xf) {
164 1.1 cgd out[1] = hexlist[i & 0xf];
165 1.1 cgd i >>= 4;
166 1.1 cgd out[0] = hexlist[i];
167 1.1 cgd out += 2;
168 1.1 cgd } else
169 1.1 cgd *out++ = hexlist[i];
170 1.1 cgd }
171 1.1 cgd *out = 0;
172 1.5 cgd return (obuf);
173 1.1 cgd }
174