2 * Copyright (c) 2004 Luigi Rizzo, Alessandro Cerri. All rights reserved.
3 * Copyright (c) 2004-2008 Qing Li. All rights reserved.
4 * Copyright (c) 2008 Kip Macy. All rights reserved.
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
15 * THIS SOFTWARE IS PROVIDED BY AUTHOR AND CONTRIBUTORS ``AS IS'' AND
16 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
18 * ARE DISCLAIMED. IN NO EVENT SHALL AUTHOR OR CONTRIBUTORS BE LIABLE
19 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
20 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
21 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
22 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
23 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
24 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27 #include <sys/cdefs.h>
28 __FBSDID("$FreeBSD$");
32 #include "opt_inet6.h"
34 #include <sys/param.h>
35 #include <sys/systm.h>
36 #include <sys/malloc.h>
38 #include <sys/syslog.h>
39 #include <sys/sysctl.h>
40 #include <sys/socket.h>
41 #include <sys/kernel.h>
43 #include <sys/mutex.h>
44 #include <sys/rwlock.h>
52 #include <netinet/in.h>
53 #include <net/if_llatbl.h>
55 #include <net/if_dl.h>
56 #include <net/if_var.h>
57 #include <net/route.h>
59 #include <netinet/if_ether.h>
60 #include <netinet6/in6_var.h>
61 #include <netinet6/nd6.h>
63 MALLOC_DEFINE(M_LLTABLE, "lltable", "link level address tables");
65 static VNET_DEFINE(SLIST_HEAD(, lltable), lltables);
66 #define V_lltables VNET(lltables)
68 extern void arprequest(struct ifnet *, struct in_addr *, struct in_addr *,
71 static void vnet_lltable_init(void);
73 struct rwlock lltable_rwlock;
74 RW_SYSINIT(lltable_rwlock, &lltable_rwlock, "lltable_rwlock");
77 * Dump arp state for a specific address family.
80 lltable_sysctl_dumparp(int af, struct sysctl_req *wr)
86 SLIST_FOREACH(llt, &V_lltables, llt_link) {
87 if (llt->llt_af == af) {
88 error = llt->llt_dump(llt, wr);
99 * Deletes an address from the address table.
100 * This function is called by the timer functions
101 * such as arptimer() and nd6_llinfo_timer(), and
102 * the caller does the locking.
104 * Returns the number of held packets, if any, that were dropped.
107 llentry_free(struct llentry *lle)
112 IF_AFDATA_WLOCK_ASSERT(lle->lle_tbl->llt_ifp);
113 LLE_WLOCK_ASSERT(lle);
115 /* XXX: guard against race with other llentry_free(). */
116 if (!(lle->la_flags & LLE_LINKED)) {
117 LLE_FREE_LOCKED(lle);
121 LIST_REMOVE(lle, lle_next);
122 lle->la_flags &= ~(LLE_VALID | LLE_LINKED);
125 while ((lle->la_numheld > 0) && (lle->la_hold != NULL)) {
126 next = lle->la_hold->m_nextpkt;
127 m_freem(lle->la_hold);
133 KASSERT(lle->la_numheld == 0,
134 ("%s: la_numheld %d > 0, pkts_droped %zd", __func__,
135 lle->la_numheld, pkts_dropped));
137 LLE_FREE_LOCKED(lle);
139 return (pkts_dropped);
143 * (al)locate an llentry for address dst (equivalent to rtalloc for new-arp).
145 * If found the llentry * is returned referenced and unlocked.
148 llentry_alloc(struct ifnet *ifp, struct lltable *lt,
149 struct sockaddr_storage *dst)
153 IF_AFDATA_RLOCK(ifp);
154 la = lla_lookup(lt, LLE_EXCLUSIVE, (struct sockaddr *)dst);
155 IF_AFDATA_RUNLOCK(ifp);
157 (ifp->if_flags & (IFF_NOARP | IFF_STATICARP)) == 0) {
158 IF_AFDATA_WLOCK(ifp);
159 la = lla_lookup(lt, (LLE_CREATE | LLE_EXCLUSIVE),
160 (struct sockaddr *)dst);
161 IF_AFDATA_WUNLOCK(ifp);
173 * Free all entries from given table and free itself.
176 lltable_free(struct lltable *llt)
178 struct llentry *lle, *next;
181 KASSERT(llt != NULL, ("%s: llt is NULL", __func__));
184 SLIST_REMOVE(&V_lltables, llt, lltable, llt_link);
187 IF_AFDATA_WLOCK(llt->llt_ifp);
188 for (i = 0; i < LLTBL_HASHTBL_SIZE; i++) {
189 LIST_FOREACH_SAFE(lle, &llt->lle_head[i], lle_next, next) {
191 if (callout_stop(&lle->la_timer))
196 IF_AFDATA_WUNLOCK(llt->llt_ifp);
198 free(llt, M_LLTABLE);
203 lltable_drain(int af)
210 SLIST_FOREACH(llt, &V_lltables, llt_link) {
211 if (llt->llt_af != af)
214 for (i=0; i < LLTBL_HASHTBL_SIZE; i++) {
215 LIST_FOREACH(lle, &llt->lle_head[i], lle_next) {
218 m_freem(lle->la_hold);
230 lltable_prefix_free(int af, struct sockaddr *prefix, struct sockaddr *mask,
236 SLIST_FOREACH(llt, &V_lltables, llt_link) {
237 if (llt->llt_af != af)
240 llt->llt_prefix_free(llt, prefix, mask, flags);
248 * Create a new lltable.
251 lltable_init(struct ifnet *ifp, int af)
256 llt = malloc(sizeof(struct lltable), M_LLTABLE, M_WAITOK);
260 for (i = 0; i < LLTBL_HASHTBL_SIZE; i++)
261 LIST_INIT(&llt->lle_head[i]);
264 SLIST_INSERT_HEAD(&V_lltables, llt, llt_link);
271 * Called in route_output when adding/deleting a route to an interface.
274 lla_rt_output(struct rt_msghdr *rtm, struct rt_addrinfo *info)
276 struct sockaddr_dl *dl =
277 (struct sockaddr_dl *)info->rti_info[RTAX_GATEWAY];
278 struct sockaddr *dst = (struct sockaddr *)info->rti_info[RTAX_DST];
282 u_int laflags = 0, flags = 0;
285 if (dl == NULL || dl->sdl_family != AF_LINK) {
286 log(LOG_INFO, "%s: invalid dl\n", __func__);
289 ifp = ifnet_byindex(dl->sdl_index);
291 log(LOG_INFO, "%s: invalid ifp (sdl_index %d)\n",
292 __func__, dl->sdl_index);
296 switch (rtm->rtm_type) {
298 if (rtm->rtm_flags & RTF_ANNOUNCE) {
301 if (dst->sa_family == AF_INET &&
302 ((struct sockaddr_inarp *)dst)->sin_other != 0) {
304 ((struct sockaddr_inarp *)dst)->sin_other = 0;
305 rt = rtalloc1(dst, 0, 0);
306 if (rt == NULL || !(rt->rt_flags & RTF_HOST)) {
307 log(LOG_INFO, "%s: RTM_ADD publish "
308 "(proxy only) is invalid\n",
331 return EINVAL; /* XXX not implemented yet */
334 /* XXX linked list may be too expensive */
336 SLIST_FOREACH(llt, &V_lltables, llt_link) {
337 if (llt->llt_af == dst->sa_family &&
342 KASSERT(llt != NULL, ("Yep, ugly hacks are bad\n"));
344 if (flags & LLE_CREATE)
345 flags |= LLE_EXCLUSIVE;
348 lle = lla_lookup(llt, flags, dst);
349 IF_AFDATA_UNLOCK(ifp);
350 if (LLE_IS_VALID(lle)) {
351 if (flags & LLE_CREATE) {
353 * If we delay the delete, then a subsequent
354 * "arp add" should look up this entry, reset the
355 * LLE_DELETED flag, and reset the expiration timer
357 bcopy(LLADDR(dl), &lle->ll_addr, ifp->if_addrlen);
358 lle->la_flags |= (flags & (LLE_PUB | LLE_PROXY));
359 lle->la_flags |= LLE_VALID;
360 lle->la_flags &= ~LLE_DELETED;
365 if (dst->sa_family == AF_INET6)
366 lle->ln_state = ND6_LLINFO_REACHABLE;
369 * NB: arp and ndp always set (RTF_STATIC | RTF_HOST)
372 if (rtm->rtm_rmx.rmx_expire == 0) {
373 lle->la_flags |= LLE_STATIC;
376 lle->la_expire = rtm->rtm_rmx.rmx_expire;
377 laflags = lle->la_flags;
381 if ((laflags & LLE_PUB) && dst->sa_family == AF_INET) {
383 &((struct sockaddr_in *)dst)->sin_addr,
384 &((struct sockaddr_in *)dst)->sin_addr,
385 ((laflags & LLE_PROXY) ?
386 (u_char *)IF_LLADDR(ifp) :
387 (u_char *)LLADDR(dl)));
391 if (flags & LLE_EXCLUSIVE)
396 } else if ((lle == NULL) && (flags & LLE_DELETE))
407 SLIST_INIT(&V_lltables);
409 VNET_SYSINIT(vnet_lltable_init, SI_SUB_PSEUDO, SI_ORDER_FIRST,
410 vnet_lltable_init, NULL);
415 struct sockaddr l3_addr;
419 llatbl_lle_show(struct llentry_sa *la)
425 db_printf("lle=%p\n", lle);
426 db_printf(" lle_next=%p\n", lle->lle_next.le_next);
427 db_printf(" lle_lock=%p\n", &lle->lle_lock);
428 db_printf(" lle_tbl=%p\n", lle->lle_tbl);
429 db_printf(" lle_head=%p\n", lle->lle_head);
430 db_printf(" la_hold=%p\n", lle->la_hold);
431 db_printf(" la_numheld=%d\n", lle->la_numheld);
432 db_printf(" la_expire=%ju\n", (uintmax_t)lle->la_expire);
433 db_printf(" la_flags=0x%04x\n", lle->la_flags);
434 db_printf(" la_asked=%u\n", lle->la_asked);
435 db_printf(" la_preempt=%u\n", lle->la_preempt);
436 db_printf(" ln_byhint=%u\n", lle->ln_byhint);
437 db_printf(" ln_state=%d\n", lle->ln_state);
438 db_printf(" ln_router=%u\n", lle->ln_router);
439 db_printf(" ln_ntick=%ju\n", (uintmax_t)lle->ln_ntick);
440 db_printf(" lle_refcnt=%d\n", lle->lle_refcnt);
441 bcopy(&lle->ll_addr.mac16, octet, sizeof(octet));
442 db_printf(" ll_addr=%02x:%02x:%02x:%02x:%02x:%02x\n",
443 octet[0], octet[1], octet[2], octet[3], octet[4], octet[5]);
444 db_printf(" la_timer=%p\n", &lle->la_timer);
446 switch (la->l3_addr.sa_family) {
450 struct sockaddr_in *sin;
451 char l3s[INET_ADDRSTRLEN];
453 sin = (struct sockaddr_in *)&la->l3_addr;
454 inet_ntoa_r(sin->sin_addr, l3s);
455 db_printf(" l3_addr=%s\n", l3s);
462 struct sockaddr_in6 *sin6;
463 char l3s[INET6_ADDRSTRLEN];
465 sin6 = (struct sockaddr_in6 *)&la->l3_addr;
466 ip6_sprintf(l3s, &sin6->sin6_addr);
467 db_printf(" l3_addr=%s\n", l3s);
472 db_printf(" l3_addr=N/A (af=%d)\n", la->l3_addr.sa_family);
477 DB_SHOW_COMMAND(llentry, db_show_llentry)
481 db_printf("usage: show llentry <struct llentry *>\n");
485 llatbl_lle_show((struct llentry_sa *)addr);
489 llatbl_llt_show(struct lltable *llt)
494 db_printf("llt=%p llt_af=%d llt_ifp=%p\n",
495 llt, llt->llt_af, llt->llt_ifp);
497 for (i = 0; i < LLTBL_HASHTBL_SIZE; i++) {
498 LIST_FOREACH(lle, &llt->lle_head[i], lle_next) {
500 llatbl_lle_show((struct llentry_sa *)lle);
507 DB_SHOW_COMMAND(lltable, db_show_lltable)
511 db_printf("usage: show lltable <struct lltable *>\n");
515 llatbl_llt_show((struct lltable *)addr);
518 DB_SHOW_ALL_COMMAND(lltables, db_show_all_lltables)
520 VNET_ITERATOR_DECL(vnet_iter);
523 VNET_FOREACH(vnet_iter) {
524 CURVNET_SET_QUIET(vnet_iter);
526 db_printf("vnet=%p\n", curvnet);
528 SLIST_FOREACH(llt, &V_lltables, llt_link) {
529 db_printf("llt=%p llt_af=%d llt_ifp=%p(%s)\n",
530 llt, llt->llt_af, llt->llt_ifp,
531 (llt->llt_ifp != NULL) ?
532 llt->llt_ifp->if_xname : "?");
533 if (have_addr && addr != 0) /* verbose */
534 llatbl_llt_show(llt);