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 static void vnet_lltable_init(void);
70 struct rwlock lltable_rwlock;
71 RW_SYSINIT(lltable_rwlock, &lltable_rwlock, "lltable_rwlock");
74 * Dump arp state for a specific address family.
77 lltable_sysctl_dumparp(int af, struct sysctl_req *wr)
83 SLIST_FOREACH(llt, &V_lltables, llt_link) {
84 if (llt->llt_af == af) {
85 error = llt->llt_dump(llt, wr);
96 * Deletes an address from the address table.
97 * This function is called by the timer functions
98 * such as arptimer() and nd6_llinfo_timer(), and
99 * the caller does the locking.
101 * Returns the number of held packets, if any, that were dropped.
104 llentry_free(struct llentry *lle)
109 IF_AFDATA_WLOCK_ASSERT(lle->lle_tbl->llt_ifp);
110 LLE_WLOCK_ASSERT(lle);
112 /* XXX: guard against race with other llentry_free(). */
113 if (!(lle->la_flags & LLE_LINKED)) {
114 LLE_FREE_LOCKED(lle);
118 LIST_REMOVE(lle, lle_next);
119 lle->la_flags &= ~(LLE_VALID | LLE_LINKED);
122 while ((lle->la_numheld > 0) && (lle->la_hold != NULL)) {
123 next = lle->la_hold->m_nextpkt;
124 m_freem(lle->la_hold);
130 KASSERT(lle->la_numheld == 0,
131 ("%s: la_numheld %d > 0, pkts_droped %zd", __func__,
132 lle->la_numheld, pkts_dropped));
134 LLE_FREE_LOCKED(lle);
136 return (pkts_dropped);
140 * (al)locate an llentry for address dst (equivalent to rtalloc for new-arp).
142 * If found the llentry * is returned referenced and unlocked.
145 llentry_alloc(struct ifnet *ifp, struct lltable *lt,
146 struct sockaddr_storage *dst)
150 IF_AFDATA_RLOCK(ifp);
151 la = lla_lookup(lt, LLE_EXCLUSIVE, (struct sockaddr *)dst);
152 IF_AFDATA_RUNLOCK(ifp);
154 (ifp->if_flags & (IFF_NOARP | IFF_STATICARP)) == 0) {
155 IF_AFDATA_WLOCK(ifp);
156 la = lla_lookup(lt, (LLE_CREATE | LLE_EXCLUSIVE),
157 (struct sockaddr *)dst);
158 IF_AFDATA_WUNLOCK(ifp);
170 * Free all entries from given table and free itself.
173 lltable_free(struct lltable *llt)
175 struct llentry *lle, *next;
178 KASSERT(llt != NULL, ("%s: llt is NULL", __func__));
181 SLIST_REMOVE(&V_lltables, llt, lltable, llt_link);
184 IF_AFDATA_WLOCK(llt->llt_ifp);
185 for (i = 0; i < LLTBL_HASHTBL_SIZE; i++) {
186 LIST_FOREACH_SAFE(lle, &llt->lle_head[i], lle_next, next) {
188 if (callout_stop(&lle->la_timer))
193 IF_AFDATA_WUNLOCK(llt->llt_ifp);
195 free(llt, M_LLTABLE);
200 lltable_drain(int af)
207 SLIST_FOREACH(llt, &V_lltables, llt_link) {
208 if (llt->llt_af != af)
211 for (i=0; i < LLTBL_HASHTBL_SIZE; i++) {
212 LIST_FOREACH(lle, &llt->lle_head[i], lle_next) {
215 m_freem(lle->la_hold);
227 lltable_prefix_free(int af, struct sockaddr *prefix, struct sockaddr *mask,
233 SLIST_FOREACH(llt, &V_lltables, llt_link) {
234 if (llt->llt_af != af)
237 llt->llt_prefix_free(llt, prefix, mask, flags);
245 * Create a new lltable.
248 lltable_init(struct ifnet *ifp, int af)
253 llt = malloc(sizeof(struct lltable), M_LLTABLE, M_WAITOK);
257 for (i = 0; i < LLTBL_HASHTBL_SIZE; i++)
258 LIST_INIT(&llt->lle_head[i]);
261 SLIST_INSERT_HEAD(&V_lltables, llt, llt_link);
268 * Called in route_output when adding/deleting a route to an interface.
271 lla_rt_output(struct rt_msghdr *rtm, struct rt_addrinfo *info)
273 struct sockaddr_dl *dl =
274 (struct sockaddr_dl *)info->rti_info[RTAX_GATEWAY];
275 struct sockaddr *dst = (struct sockaddr *)info->rti_info[RTAX_DST];
279 u_int laflags = 0, flags = 0;
282 if (dl == NULL || dl->sdl_family != AF_LINK) {
283 log(LOG_INFO, "%s: invalid dl\n", __func__);
286 ifp = ifnet_byindex(dl->sdl_index);
288 log(LOG_INFO, "%s: invalid ifp (sdl_index %d)\n",
289 __func__, dl->sdl_index);
293 switch (rtm->rtm_type) {
295 if (rtm->rtm_flags & RTF_ANNOUNCE) {
298 if (dst->sa_family == AF_INET &&
299 ((struct sockaddr_inarp *)dst)->sin_other != 0) {
301 ((struct sockaddr_inarp *)dst)->sin_other = 0;
302 rt = rtalloc1(dst, 0, 0);
303 if (rt == NULL || !(rt->rt_flags & RTF_HOST)) {
304 log(LOG_INFO, "%s: RTM_ADD publish "
305 "(proxy only) is invalid\n",
328 return EINVAL; /* XXX not implemented yet */
331 /* XXX linked list may be too expensive */
333 SLIST_FOREACH(llt, &V_lltables, llt_link) {
334 if (llt->llt_af == dst->sa_family &&
339 KASSERT(llt != NULL, ("Yep, ugly hacks are bad\n"));
341 if (flags & LLE_CREATE)
342 flags |= LLE_EXCLUSIVE;
345 lle = lla_lookup(llt, flags, dst);
346 IF_AFDATA_UNLOCK(ifp);
347 if (LLE_IS_VALID(lle)) {
348 if (flags & LLE_CREATE) {
350 * If we delay the delete, then a subsequent
351 * "arp add" should look up this entry, reset the
352 * LLE_DELETED flag, and reset the expiration timer
354 bcopy(LLADDR(dl), &lle->ll_addr, ifp->if_addrlen);
355 lle->la_flags |= (flags & (LLE_PUB | LLE_PROXY));
356 lle->la_flags |= LLE_VALID;
357 lle->la_flags &= ~LLE_DELETED;
362 if (dst->sa_family == AF_INET6)
363 lle->ln_state = ND6_LLINFO_REACHABLE;
366 * NB: arp and ndp always set (RTF_STATIC | RTF_HOST)
369 if (rtm->rtm_rmx.rmx_expire == 0) {
370 lle->la_flags |= LLE_STATIC;
373 lle->la_expire = rtm->rtm_rmx.rmx_expire;
374 laflags = lle->la_flags;
378 if ((laflags & LLE_PUB) && dst->sa_family == AF_INET) {
380 &((struct sockaddr_in *)dst)->sin_addr,
381 &((struct sockaddr_in *)dst)->sin_addr,
382 ((laflags & LLE_PROXY) ?
383 (u_char *)IF_LLADDR(ifp) :
384 (u_char *)LLADDR(dl)));
388 if (flags & LLE_EXCLUSIVE)
393 } else if ((lle == NULL) && (flags & LLE_DELETE))
404 SLIST_INIT(&V_lltables);
406 VNET_SYSINIT(vnet_lltable_init, SI_SUB_PSEUDO, SI_ORDER_FIRST,
407 vnet_lltable_init, NULL);
412 struct sockaddr l3_addr;
416 llatbl_lle_show(struct llentry_sa *la)
422 db_printf("lle=%p\n", lle);
423 db_printf(" lle_next=%p\n", lle->lle_next.le_next);
424 db_printf(" lle_lock=%p\n", &lle->lle_lock);
425 db_printf(" lle_tbl=%p\n", lle->lle_tbl);
426 db_printf(" lle_head=%p\n", lle->lle_head);
427 db_printf(" la_hold=%p\n", lle->la_hold);
428 db_printf(" la_numheld=%d\n", lle->la_numheld);
429 db_printf(" la_expire=%ju\n", (uintmax_t)lle->la_expire);
430 db_printf(" la_flags=0x%04x\n", lle->la_flags);
431 db_printf(" la_asked=%u\n", lle->la_asked);
432 db_printf(" la_preempt=%u\n", lle->la_preempt);
433 db_printf(" ln_byhint=%u\n", lle->ln_byhint);
434 db_printf(" ln_state=%d\n", lle->ln_state);
435 db_printf(" ln_router=%u\n", lle->ln_router);
436 db_printf(" ln_ntick=%ju\n", (uintmax_t)lle->ln_ntick);
437 db_printf(" lle_refcnt=%d\n", lle->lle_refcnt);
438 bcopy(&lle->ll_addr.mac16, octet, sizeof(octet));
439 db_printf(" ll_addr=%02x:%02x:%02x:%02x:%02x:%02x\n",
440 octet[0], octet[1], octet[2], octet[3], octet[4], octet[5]);
441 db_printf(" la_timer=%p\n", &lle->la_timer);
443 switch (la->l3_addr.sa_family) {
447 struct sockaddr_in *sin;
448 char l3s[INET_ADDRSTRLEN];
450 sin = (struct sockaddr_in *)&la->l3_addr;
451 inet_ntoa_r(sin->sin_addr, l3s);
452 db_printf(" l3_addr=%s\n", l3s);
459 struct sockaddr_in6 *sin6;
460 char l3s[INET6_ADDRSTRLEN];
462 sin6 = (struct sockaddr_in6 *)&la->l3_addr;
463 ip6_sprintf(l3s, &sin6->sin6_addr);
464 db_printf(" l3_addr=%s\n", l3s);
469 db_printf(" l3_addr=N/A (af=%d)\n", la->l3_addr.sa_family);
474 DB_SHOW_COMMAND(llentry, db_show_llentry)
478 db_printf("usage: show llentry <struct llentry *>\n");
482 llatbl_lle_show((struct llentry_sa *)addr);
486 llatbl_llt_show(struct lltable *llt)
491 db_printf("llt=%p llt_af=%d llt_ifp=%p\n",
492 llt, llt->llt_af, llt->llt_ifp);
494 for (i = 0; i < LLTBL_HASHTBL_SIZE; i++) {
495 LIST_FOREACH(lle, &llt->lle_head[i], lle_next) {
497 llatbl_lle_show((struct llentry_sa *)lle);
504 DB_SHOW_COMMAND(lltable, db_show_lltable)
508 db_printf("usage: show lltable <struct lltable *>\n");
512 llatbl_llt_show((struct lltable *)addr);
515 DB_SHOW_ALL_COMMAND(lltables, db_show_all_lltables)
517 VNET_ITERATOR_DECL(vnet_iter);
520 VNET_FOREACH(vnet_iter) {
521 CURVNET_SET_QUIET(vnet_iter);
523 db_printf("vnet=%p\n", curvnet);
525 SLIST_FOREACH(llt, &V_lltables, llt_link) {
526 db_printf("llt=%p llt_af=%d llt_ifp=%p(%s)\n",
527 llt, llt->llt_af, llt->llt_ifp,
528 (llt->llt_ifp != NULL) ?
529 llt->llt_ifp->if_xname : "?");
530 if (have_addr && addr != 0) /* verbose */
531 llatbl_llt_show(llt);