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