Home | History | Annotate | Line # | Download | only in net
link_proto.c revision 1.3
      1  1.3  dyoung /*	$NetBSD: link_proto.c,v 1.3 2007/08/30 02:17:35 dyoung Exp $	*/
      2  1.1  dyoung 
      3  1.1  dyoung /*-
      4  1.1  dyoung  * Copyright (c) 1982, 1986, 1993
      5  1.1  dyoung  *	The Regents of the University of California.  All rights reserved.
      6  1.1  dyoung  *
      7  1.1  dyoung  * Redistribution and use in source and binary forms, with or without
      8  1.1  dyoung  * modification, are permitted provided that the following conditions
      9  1.1  dyoung  * are met:
     10  1.1  dyoung  * 1. Redistributions of source code must retain the above copyright
     11  1.1  dyoung  *    notice, this list of conditions and the following disclaimer.
     12  1.1  dyoung  * 2. Redistributions in binary form must reproduce the above copyright
     13  1.1  dyoung  *    notice, this list of conditions and the following disclaimer in the
     14  1.1  dyoung  *    documentation and/or other materials provided with the distribution.
     15  1.1  dyoung  * 3. Neither the name of the University nor the names of its contributors
     16  1.1  dyoung  *    may be used to endorse or promote products derived from this software
     17  1.1  dyoung  *    without specific prior written permission.
     18  1.1  dyoung  *
     19  1.1  dyoung  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     20  1.1  dyoung  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     21  1.1  dyoung  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     22  1.1  dyoung  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     23  1.1  dyoung  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     24  1.1  dyoung  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     25  1.1  dyoung  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     26  1.1  dyoung  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     27  1.1  dyoung  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     28  1.1  dyoung  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     29  1.1  dyoung  * SUCH DAMAGE.
     30  1.1  dyoung  *
     31  1.1  dyoung  *	@(#)uipc_proto.c	8.2 (Berkeley) 2/14/95
     32  1.1  dyoung  */
     33  1.1  dyoung 
     34  1.1  dyoung #include <sys/cdefs.h>
     35  1.3  dyoung __KERNEL_RCSID(0, "$NetBSD: link_proto.c,v 1.3 2007/08/30 02:17:35 dyoung Exp $");
     36  1.1  dyoung 
     37  1.1  dyoung #include <sys/param.h>
     38  1.1  dyoung #include <sys/socket.h>
     39  1.1  dyoung #include <sys/protosw.h>
     40  1.1  dyoung #include <sys/domain.h>
     41  1.1  dyoung #include <sys/mbuf.h>
     42  1.1  dyoung #include <sys/un.h>
     43  1.1  dyoung #include <sys/socketvar.h>
     44  1.1  dyoung 
     45  1.1  dyoung #include <net/if.h>
     46  1.1  dyoung #include <net/if_dl.h>
     47  1.1  dyoung #include <net/raw_cb.h>
     48  1.1  dyoung 
     49  1.1  dyoung static int sockaddr_dl_cmp(const struct sockaddr *, const struct sockaddr *);
     50  1.1  dyoung 
     51  1.1  dyoung /*
     52  1.1  dyoung  * Definitions of protocols supported in the link-layer domain.
     53  1.1  dyoung  */
     54  1.1  dyoung 
     55  1.1  dyoung DOMAIN_DEFINE(linkdomain);	/* forward define and add to link set */
     56  1.1  dyoung 
     57  1.1  dyoung struct domain linkdomain = {
     58  1.1  dyoung 	.dom_family = AF_LINK,
     59  1.1  dyoung 	.dom_name = "link",
     60  1.1  dyoung 	.dom_externalize = NULL,
     61  1.1  dyoung 	.dom_dispose = NULL,
     62  1.1  dyoung 	.dom_protosw = NULL,
     63  1.1  dyoung 	.dom_protoswNPROTOSW = NULL,
     64  1.1  dyoung 	.dom_sockaddr_cmp = sockaddr_dl_cmp
     65  1.1  dyoung };
     66  1.1  dyoung 
     67  1.1  dyoung /* Compare the field at byte offsets [fieldstart, fieldend) in
     68  1.1  dyoung  * two memory regions, [l, l + llen) and [r, r + llen).
     69  1.1  dyoung  */
     70  1.1  dyoung static inline int
     71  1.1  dyoung submemcmp(const void *l, const void *r,
     72  1.1  dyoung     const uint_fast8_t llen, const uint_fast8_t rlen,
     73  1.1  dyoung     const uint_fast8_t fieldstart, const uint_fast8_t fieldend)
     74  1.1  dyoung {
     75  1.1  dyoung 	uint_fast8_t cmpend, minlen;
     76  1.1  dyoung 	const uint8_t *lb = l, *rb = r;
     77  1.1  dyoung 	int rc;
     78  1.1  dyoung 
     79  1.1  dyoung 	minlen = MIN(llen, rlen);
     80  1.1  dyoung 
     81  1.1  dyoung 	/* The field is missing from one region.  The shorter region is the
     82  1.1  dyoung 	 * lesser region.
     83  1.1  dyoung 	 */
     84  1.1  dyoung 	if (fieldstart >= minlen)
     85  1.1  dyoung 		return llen - rlen;
     86  1.1  dyoung 
     87  1.1  dyoung 	/* Two empty, present fields are always equal. */
     88  1.1  dyoung 	if (fieldstart > fieldend)
     89  1.1  dyoung 		return 0;
     90  1.1  dyoung 
     91  1.1  dyoung 	cmpend = MIN(fieldend, minlen);
     92  1.1  dyoung 
     93  1.1  dyoung 	rc = memcmp(&lb[fieldstart], &rb[fieldstart], cmpend - fieldstart);
     94  1.1  dyoung 
     95  1.1  dyoung 	if (rc != 0)
     96  1.1  dyoung 		return rc;
     97  1.1  dyoung 	/* If one or both fields are truncated, then the shorter is the lesser
     98  1.1  dyoung 	 * field.
     99  1.1  dyoung 	 */
    100  1.1  dyoung 	if (minlen < fieldend)
    101  1.1  dyoung 		return llen - rlen;
    102  1.1  dyoung 	/* Fields are full-length and equal.  The fields are equal. */
    103  1.1  dyoung 	return 0;
    104  1.1  dyoung }
    105  1.1  dyoung 
    106  1.2  dyoung uint8_t
    107  1.2  dyoung sockaddr_dl_measure(uint8_t namelen, uint8_t addrlen)
    108  1.2  dyoung {
    109  1.2  dyoung 	return offsetof(struct sockaddr_dl, sdl_data[namelen + addrlen]);
    110  1.2  dyoung }
    111  1.2  dyoung 
    112  1.3  dyoung struct sockaddr *
    113  1.3  dyoung sockaddr_dl_alloc(uint16_t ifindex, uint8_t type,
    114  1.3  dyoung     const void *name, uint8_t namelen, const void *addr, uint8_t addrlen,
    115  1.3  dyoung     int flags)
    116  1.3  dyoung {
    117  1.3  dyoung 	struct sockaddr *sa;
    118  1.3  dyoung 	socklen_t len;
    119  1.3  dyoung 
    120  1.3  dyoung 	len = sockaddr_dl_measure(namelen, addrlen);
    121  1.3  dyoung 	sa = sockaddr_alloc(AF_LINK, len, flags);
    122  1.3  dyoung 
    123  1.3  dyoung 	if (sa == NULL)
    124  1.3  dyoung 		return NULL;
    125  1.3  dyoung 
    126  1.3  dyoung 	if (sockaddr_dl_init(satosdl(sa), len, ifindex, type, name, namelen,
    127  1.3  dyoung 	    addr, addrlen) == NULL) {
    128  1.3  dyoung 		sockaddr_free(sa);
    129  1.3  dyoung 		return NULL;
    130  1.3  dyoung 	}
    131  1.3  dyoung 
    132  1.3  dyoung 	return sa;
    133  1.3  dyoung }
    134  1.3  dyoung 
    135  1.3  dyoung struct sockaddr_dl *
    136  1.3  dyoung sockaddr_dl_init(struct sockaddr_dl *sdl, socklen_t socklen, uint16_t ifindex,
    137  1.3  dyoung     uint8_t type, const void *name, uint8_t namelen, const void *addr,
    138  1.3  dyoung     uint8_t addrlen)
    139  1.2  dyoung {
    140  1.3  dyoung 	socklen_t len;
    141  1.3  dyoung 
    142  1.2  dyoung 	sdl->sdl_family = AF_LINK;
    143  1.2  dyoung 	sdl->sdl_slen = 0;
    144  1.3  dyoung 	len = sockaddr_dl_measure(namelen, addrlen);
    145  1.3  dyoung 	if (len > socklen) {
    146  1.3  dyoung 		sdl->sdl_len = socklen;
    147  1.3  dyoung #ifdef DIAGNOSTIC
    148  1.3  dyoung 		printf("%s: too long: %" PRIu8 " > %" PRIu8 "\n", __func__, len,
    149  1.3  dyoung 		    socklen);
    150  1.3  dyoung #endif
    151  1.3  dyoung 		return NULL;
    152  1.3  dyoung 	}
    153  1.3  dyoung 	sdl->sdl_len = len;
    154  1.2  dyoung 	sdl->sdl_index = ifindex;
    155  1.2  dyoung 	sdl->sdl_type = type;
    156  1.3  dyoung 	memset(&sdl->sdl_data[0], 0, namelen + addrlen);
    157  1.3  dyoung 	if (name != NULL) {
    158  1.2  dyoung 		memcpy(&sdl->sdl_data[0], name, namelen);
    159  1.3  dyoung 		sdl->sdl_nlen = namelen;
    160  1.3  dyoung 	} else
    161  1.3  dyoung 		sdl->sdl_nlen = 0;
    162  1.3  dyoung 	if (addr != NULL) {
    163  1.2  dyoung 		memcpy(&sdl->sdl_data[sdl->sdl_nlen], addr, addrlen);
    164  1.3  dyoung 		sdl->sdl_alen = addrlen;
    165  1.3  dyoung 	} else
    166  1.3  dyoung 		sdl->sdl_alen = 0;
    167  1.3  dyoung 	return sdl;
    168  1.2  dyoung }
    169  1.2  dyoung 
    170  1.1  dyoung static int
    171  1.1  dyoung sockaddr_dl_cmp(const struct sockaddr *sa1, const struct sockaddr *sa2)
    172  1.1  dyoung {
    173  1.1  dyoung 	int rc;
    174  1.1  dyoung 	const uint_fast8_t indexofs = offsetof(struct sockaddr_dl, sdl_index);
    175  1.1  dyoung 	const uint_fast8_t nlenofs = offsetof(struct sockaddr_dl, sdl_nlen);
    176  1.1  dyoung 	uint_fast8_t dataofs = offsetof(struct sockaddr_dl, sdl_data[0]);
    177  1.1  dyoung 	const struct sockaddr_dl *sdl1, *sdl2;
    178  1.1  dyoung 
    179  1.1  dyoung 	sdl1 = satocsdl(sa1);
    180  1.1  dyoung 	sdl2 = satocsdl(sa2);
    181  1.1  dyoung 
    182  1.1  dyoung 	rc = submemcmp(sdl1, sdl2, sdl1->sdl_len, sdl2->sdl_len,
    183  1.1  dyoung 	    indexofs, nlenofs);
    184  1.1  dyoung 
    185  1.1  dyoung 	if (rc != 0)
    186  1.1  dyoung 		return rc;
    187  1.1  dyoung 
    188  1.1  dyoung 	rc = submemcmp(sdl1, sdl2, sdl1->sdl_len, sdl2->sdl_len,
    189  1.1  dyoung 	    dataofs, dataofs + MIN(sdl1->sdl_nlen, sdl2->sdl_nlen));
    190  1.1  dyoung 
    191  1.1  dyoung 	if (rc != 0)
    192  1.1  dyoung 		return rc;
    193  1.1  dyoung 
    194  1.1  dyoung 	if (sdl1->sdl_nlen != sdl2->sdl_nlen)
    195  1.1  dyoung 		return sdl1->sdl_nlen - sdl2->sdl_nlen;
    196  1.1  dyoung 
    197  1.1  dyoung 	dataofs += sdl1->sdl_nlen;
    198  1.1  dyoung 
    199  1.1  dyoung 	rc = submemcmp(sdl1, sdl2, sdl1->sdl_len, sdl2->sdl_len,
    200  1.1  dyoung 	    dataofs, dataofs + MIN(sdl1->sdl_alen, sdl2->sdl_alen));
    201  1.1  dyoung 
    202  1.1  dyoung 	if (rc != 0)
    203  1.1  dyoung 		return rc;
    204  1.1  dyoung 
    205  1.1  dyoung 	if (sdl1->sdl_alen != sdl2->sdl_alen)
    206  1.1  dyoung 		return sdl1->sdl_alen - sdl2->sdl_alen;
    207  1.1  dyoung 
    208  1.1  dyoung 	dataofs += sdl1->sdl_alen;
    209  1.1  dyoung 
    210  1.1  dyoung 	rc = submemcmp(sdl1, sdl2, sdl1->sdl_len, sdl2->sdl_len,
    211  1.1  dyoung 	    dataofs, dataofs + MIN(sdl1->sdl_slen, sdl2->sdl_slen));
    212  1.1  dyoung 
    213  1.1  dyoung 	if (sdl1->sdl_slen != sdl2->sdl_slen)
    214  1.1  dyoung 		return sdl1->sdl_slen - sdl2->sdl_slen;
    215  1.1  dyoung 
    216  1.1  dyoung 	return sdl1->sdl_len - sdl2->sdl_len;
    217  1.1  dyoung }
    218  1.2  dyoung 
    219  1.2  dyoung struct sockaddr_dl *
    220  1.3  dyoung sockaddr_dl_setaddr(struct sockaddr_dl *sdl, socklen_t socklen,
    221  1.3  dyoung     const void *addr, uint8_t addrlen)
    222  1.2  dyoung {
    223  1.3  dyoung 	socklen_t len;
    224  1.2  dyoung 
    225  1.3  dyoung 	len = sockaddr_dl_measure(sdl->sdl_nlen, addrlen);
    226  1.3  dyoung 	if (len > socklen) {
    227  1.3  dyoung #ifdef DIAGNOSTIC
    228  1.3  dyoung 		printf("%s: too long: %" PRIu8 " > %" PRIu8 "\n", __func__, len,
    229  1.3  dyoung 		    socklen);
    230  1.3  dyoung #endif
    231  1.2  dyoung 		return NULL;
    232  1.2  dyoung 	}
    233  1.2  dyoung 	memcpy(&sdl->sdl_data[sdl->sdl_nlen], addr, addrlen);
    234  1.2  dyoung 	sdl->sdl_alen = addrlen;
    235  1.3  dyoung 	sdl->sdl_len = len;
    236  1.2  dyoung 	return sdl;
    237  1.2  dyoung }
    238