1 /*- 2 * Copyright (c) 1990, 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. Neither the name of the University nor the names of its contributors 14 * may be used to endorse or promote products derived from this software 15 * without specific prior written permission. 16 * 17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 27 * SUCH DAMAGE. 28 * 29 * @(#)linkaddr.c 8.1 (Berkeley) 6/4/93 30 * $DragonFly: src/lib/libc/net/linkaddr.c,v 1.5 2005/11/13 02:04:47 swildner Exp $ 31 */ 32 33 #include <sys/types.h> 34 #include <sys/socket.h> 35 #include <net/if_dl.h> 36 #include <string.h> 37 38 /* States*/ 39 #define NAMING 0 40 #define GOTONE 1 41 #define GOTTWO 2 42 #define RESET 3 43 /* Inputs */ 44 #define DIGIT (4*0) 45 #define END (4*1) 46 #define DELIM (4*2) 47 #define LETTER (4*3) 48 49 void 50 link_addr(const char *addr, struct sockaddr_dl *sdl) 51 { 52 char *cp = sdl->sdl_data; 53 char *cplim = sdl->sdl_len + (char *)sdl; 54 int byte = 0, state = NAMING, new; 55 56 bzero((char *)&sdl->sdl_family, sdl->sdl_len - 1); 57 sdl->sdl_family = AF_LINK; 58 do { 59 state &= ~LETTER; 60 if ((*addr >= '0') && (*addr <= '9')) { 61 new = *addr - '0'; 62 } else if ((*addr >= 'a') && (*addr <= 'f')) { 63 new = *addr - 'a' + 10; 64 } else if ((*addr >= 'A') && (*addr <= 'F')) { 65 new = *addr - 'A' + 10; 66 } else if (*addr == 0) { 67 state |= END; 68 } else if (state == NAMING && 69 (((*addr >= 'A') && (*addr <= 'Z')) || 70 ((*addr >= 'a') && (*addr <= 'z')))) 71 state |= LETTER; 72 else 73 state |= DELIM; 74 addr++; 75 switch (state /* | INPUT */) { 76 case NAMING | DIGIT: 77 case NAMING | LETTER: 78 *cp++ = addr[-1]; 79 continue; 80 case NAMING | DELIM: 81 state = RESET; 82 sdl->sdl_nlen = cp - sdl->sdl_data; 83 continue; 84 case GOTTWO | DIGIT: 85 *cp++ = byte; 86 /* FALLTHROUGH */ 87 case RESET | DIGIT: 88 state = GOTONE; 89 byte = new; 90 continue; 91 case GOTONE | DIGIT: 92 state = GOTTWO; 93 byte = new + (byte << 4); 94 continue; 95 default: /* | DELIM */ 96 state = RESET; 97 *cp++ = byte; 98 byte = 0; 99 continue; 100 case GOTONE | END: 101 case GOTTWO | END: 102 *cp++ = byte; 103 /* FALLTHROUGH */ 104 case RESET | END: 105 break; 106 } 107 break; 108 } while (cp < cplim); 109 sdl->sdl_alen = cp - LLADDR(sdl); 110 new = cp - (char *)sdl; 111 if (new > sizeof(*sdl)) 112 sdl->sdl_len = new; 113 return; 114 } 115 116 static char hexlist[] = "0123456789abcdef"; 117 118 char * 119 link_ntoa(const struct sockaddr_dl *sdl) 120 { 121 static char obuf[64]; 122 char *out = obuf; 123 int i; 124 u_char *in = (u_char *)LLADDR(sdl); 125 u_char *inlim = in + sdl->sdl_alen; 126 int firsttime = 1; 127 128 if (sdl->sdl_nlen) { 129 bcopy(sdl->sdl_data, obuf, sdl->sdl_nlen); 130 out += sdl->sdl_nlen; 131 if (sdl->sdl_alen) 132 *out++ = ':'; 133 } 134 while (in < inlim) { 135 if (firsttime) 136 firsttime = 0; 137 else 138 *out++ = '.'; 139 i = *in++; 140 if (i > 0xf) { 141 out[1] = hexlist[i & 0xf]; 142 i >>= 4; 143 out[0] = hexlist[i]; 144 out += 2; 145 } else 146 *out++ = hexlist[i]; 147 } 148 *out = 0; 149 return (obuf); 150 } 151