2 * Copyright (c) 1990, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
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.
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
33 * @(#)linkaddr.c 8.1 (Berkeley) 6/4/93
34 * $DragonFly: src/lib/libcr/net/Attic/linkaddr.c,v 1.3 2004/10/25 19:38:25 drhodus Exp $
37 #include <sys/types.h>
38 #include <sys/socket.h>
39 #include <net/if_dl.h>
56 struct sockaddr_dl *sdl;
58 char *cp = sdl->sdl_data;
59 char *cplim = sdl->sdl_len + (char *)sdl;
60 int byte = 0, state = NAMING, new;
62 bzero((char *)&sdl->sdl_family, sdl->sdl_len - 1);
63 sdl->sdl_family = AF_LINK;
66 if ((*addr >= '0') && (*addr <= '9')) {
68 } else if ((*addr >= 'a') && (*addr <= 'f')) {
69 new = *addr - 'a' + 10;
70 } else if ((*addr >= 'A') && (*addr <= 'F')) {
71 new = *addr - 'A' + 10;
72 } else if (*addr == 0) {
74 } else if (state == NAMING &&
75 (((*addr >= 'A') && (*addr <= 'Z')) ||
76 ((*addr >= 'a') && (*addr <= 'z'))))
81 switch (state /* | INPUT */) {
88 sdl->sdl_nlen = cp - sdl->sdl_data;
99 byte = new + (byte << 4);
101 default: /* | DELIM */
114 } while (cp < cplim);
115 sdl->sdl_alen = cp - LLADDR(sdl);
116 new = cp - (char *)sdl;
117 if (new > sizeof(*sdl))
122 static char hexlist[] = "0123456789abcdef";
126 const struct sockaddr_dl *sdl;
128 static char obuf[64];
131 u_char *in = (u_char *)LLADDR(sdl);
132 u_char *inlim = in + sdl->sdl_alen;
136 bcopy(sdl->sdl_data, obuf, sdl->sdl_nlen);
137 out += sdl->sdl_nlen;
148 out[1] = hexlist[i & 0xf];