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 SLIST_HEAD_INITIALIZER(lltables);
67 #define V_lltables VNET(lltables)
69 struct rwlock lltable_rwlock;
70 RW_SYSINIT(lltable_rwlock, &lltable_rwlock, "lltable_rwlock");
73 * Dump arp state for a specific address family.
76 lltable_sysctl_dumparp(int af, struct sysctl_req *wr)
82 SLIST_FOREACH(llt, &V_lltables, llt_link) {
83 if (llt->llt_af == af) {
84 error = llt->llt_dump(llt, wr);
95 * Deletes an address from the address table.
96 * This function is called by the timer functions
97 * such as arptimer() and nd6_llinfo_timer(), and
98 * the caller does the locking.
100 * Returns the number of held packets, if any, that were dropped.
103 llentry_free(struct llentry *lle)
108 IF_AFDATA_WLOCK_ASSERT(lle->lle_tbl->llt_ifp);
109 LLE_WLOCK_ASSERT(lle);
111 LIST_REMOVE(lle, lle_next);
112 lle->la_flags &= ~(LLE_VALID | LLE_LINKED);
115 while ((lle->la_numheld > 0) && (lle->la_hold != NULL)) {
116 next = lle->la_hold->m_nextpkt;
117 m_freem(lle->la_hold);
123 KASSERT(lle->la_numheld == 0,
124 ("%s: la_numheld %d > 0, pkts_droped %zd", __func__,
125 lle->la_numheld, pkts_dropped));
127 LLE_FREE_LOCKED(lle);
129 return (pkts_dropped);
133 * (al)locate an llentry for address dst (equivalent to rtalloc for new-arp).
135 * If found the llentry * is returned referenced and unlocked.
138 llentry_alloc(struct ifnet *ifp, struct lltable *lt,
139 struct sockaddr_storage *dst)
143 IF_AFDATA_RLOCK(ifp);
144 la = lla_lookup(lt, LLE_EXCLUSIVE, (struct sockaddr *)dst);
145 IF_AFDATA_RUNLOCK(ifp);
147 (ifp->if_flags & (IFF_NOARP | IFF_STATICARP)) == 0) {
148 IF_AFDATA_WLOCK(ifp);
149 la = lla_lookup(lt, (LLE_CREATE | LLE_EXCLUSIVE),
150 (struct sockaddr *)dst);
151 IF_AFDATA_WUNLOCK(ifp);
163 * Free all entries from given table and free itself.
166 lltable_free(struct lltable *llt)
168 struct llentry *lle, *next;
171 KASSERT(llt != NULL, ("%s: llt is NULL", __func__));
174 SLIST_REMOVE(&V_lltables, llt, lltable, llt_link);
177 IF_AFDATA_WLOCK(llt->llt_ifp);
178 for (i = 0; i < LLTBL_HASHTBL_SIZE; i++) {
179 LIST_FOREACH_SAFE(lle, &llt->lle_head[i], lle_next, next) {
181 if (callout_stop(&lle->la_timer))
186 IF_AFDATA_WUNLOCK(llt->llt_ifp);
188 free(llt, M_LLTABLE);
193 lltable_drain(int af)
200 SLIST_FOREACH(llt, &V_lltables, llt_link) {
201 if (llt->llt_af != af)
204 for (i=0; i < LLTBL_HASHTBL_SIZE; i++) {
205 LIST_FOREACH(lle, &llt->lle_head[i], lle_next) {
208 m_freem(lle->la_hold);
220 lltable_prefix_free(int af, struct sockaddr *prefix, struct sockaddr *mask,
226 SLIST_FOREACH(llt, &V_lltables, llt_link) {
227 if (llt->llt_af != af)
230 llt->llt_prefix_free(llt, prefix, mask, flags);
238 * Create a new lltable.
241 lltable_init(struct ifnet *ifp, int af)
246 llt = malloc(sizeof(struct lltable), M_LLTABLE, M_WAITOK);
250 for (i = 0; i < LLTBL_HASHTBL_SIZE; i++)
251 LIST_INIT(&llt->lle_head[i]);
254 SLIST_INSERT_HEAD(&V_lltables, llt, llt_link);
261 * Called in route_output when adding/deleting a route to an interface.
264 lla_rt_output(struct rt_msghdr *rtm, struct rt_addrinfo *info)
266 struct sockaddr_dl *dl =
267 (struct sockaddr_dl *)info->rti_info[RTAX_GATEWAY];
268 struct sockaddr *dst = (struct sockaddr *)info->rti_info[RTAX_DST];
272 u_int laflags = 0, flags = 0;
275 KASSERT(dl != NULL && dl->sdl_family == AF_LINK,
276 ("%s: invalid dl\n", __func__));
278 ifp = ifnet_byindex(dl->sdl_index);
280 log(LOG_INFO, "%s: invalid ifp (sdl_index %d)\n",
281 __func__, dl->sdl_index);
285 switch (rtm->rtm_type) {
287 if (rtm->rtm_flags & RTF_ANNOUNCE)
300 return EINVAL; /* XXX not implemented yet */
303 /* XXX linked list may be too expensive */
305 SLIST_FOREACH(llt, &V_lltables, llt_link) {
306 if (llt->llt_af == dst->sa_family &&
311 KASSERT(llt != NULL, ("Yep, ugly hacks are bad\n"));
313 if (flags & LLE_CREATE)
314 flags |= LLE_EXCLUSIVE;
317 lle = lla_lookup(llt, flags, dst);
318 IF_AFDATA_UNLOCK(ifp);
319 if (LLE_IS_VALID(lle)) {
320 if (flags & LLE_CREATE) {
322 * If we delay the delete, then a subsequent
323 * "arp add" should look up this entry, reset the
324 * LLE_DELETED flag, and reset the expiration timer
326 bcopy(LLADDR(dl), &lle->ll_addr, ifp->if_addrlen);
327 lle->la_flags |= (flags & LLE_PUB);
328 lle->la_flags |= LLE_VALID;
329 lle->la_flags &= ~LLE_DELETED;
334 if (dst->sa_family == AF_INET6)
335 lle->ln_state = ND6_LLINFO_REACHABLE;
338 * NB: arp and ndp always set (RTF_STATIC | RTF_HOST)
341 if (rtm->rtm_rmx.rmx_expire == 0) {
342 lle->la_flags |= LLE_STATIC;
345 lle->la_expire = rtm->rtm_rmx.rmx_expire;
346 laflags = lle->la_flags;
350 if ((laflags & LLE_PUB) && dst->sa_family == AF_INET)
352 &((struct sockaddr_in *)dst)->sin_addr,
353 &((struct sockaddr_in *)dst)->sin_addr,
354 (u_char *)LLADDR(dl));
357 if (flags & LLE_EXCLUSIVE)
362 } else if ((lle == NULL) && (flags & LLE_DELETE))
372 struct sockaddr l3_addr;
376 llatbl_lle_show(struct llentry_sa *la)
382 db_printf("lle=%p\n", lle);
383 db_printf(" lle_next=%p\n", lle->lle_next.le_next);
384 db_printf(" lle_lock=%p\n", &lle->lle_lock);
385 db_printf(" lle_tbl=%p\n", lle->lle_tbl);
386 db_printf(" lle_head=%p\n", lle->lle_head);
387 db_printf(" la_hold=%p\n", lle->la_hold);
388 db_printf(" la_numheld=%d\n", lle->la_numheld);
389 db_printf(" la_expire=%ju\n", (uintmax_t)lle->la_expire);
390 db_printf(" la_flags=0x%04x\n", lle->la_flags);
391 db_printf(" la_asked=%u\n", lle->la_asked);
392 db_printf(" la_preempt=%u\n", lle->la_preempt);
393 db_printf(" ln_byhint=%u\n", lle->ln_byhint);
394 db_printf(" ln_state=%d\n", lle->ln_state);
395 db_printf(" ln_router=%u\n", lle->ln_router);
396 db_printf(" ln_ntick=%ju\n", (uintmax_t)lle->ln_ntick);
397 db_printf(" lle_refcnt=%d\n", lle->lle_refcnt);
398 bcopy(&lle->ll_addr.mac16, octet, sizeof(octet));
399 db_printf(" ll_addr=%02x:%02x:%02x:%02x:%02x:%02x\n",
400 octet[0], octet[1], octet[2], octet[3], octet[4], octet[5]);
401 db_printf(" la_timer=%p\n", &lle->la_timer);
403 switch (la->l3_addr.sa_family) {
407 struct sockaddr_in *sin;
408 char l3s[INET_ADDRSTRLEN];
410 sin = (struct sockaddr_in *)&la->l3_addr;
411 inet_ntoa_r(sin->sin_addr, l3s);
412 db_printf(" l3_addr=%s\n", l3s);
419 struct sockaddr_in6 *sin6;
420 char l3s[INET6_ADDRSTRLEN];
422 sin6 = (struct sockaddr_in6 *)&la->l3_addr;
423 ip6_sprintf(l3s, &sin6->sin6_addr);
424 db_printf(" l3_addr=%s\n", l3s);
429 db_printf(" l3_addr=N/A (af=%d)\n", la->l3_addr.sa_family);
434 DB_SHOW_COMMAND(llentry, db_show_llentry)
438 db_printf("usage: show llentry <struct llentry *>\n");
442 llatbl_lle_show((struct llentry_sa *)addr);
446 llatbl_llt_show(struct lltable *llt)
451 db_printf("llt=%p llt_af=%d llt_ifp=%p\n",
452 llt, llt->llt_af, llt->llt_ifp);
454 for (i = 0; i < LLTBL_HASHTBL_SIZE; i++) {
455 LIST_FOREACH(lle, &llt->lle_head[i], lle_next) {
457 llatbl_lle_show((struct llentry_sa *)lle);
464 DB_SHOW_COMMAND(lltable, db_show_lltable)
468 db_printf("usage: show lltable <struct lltable *>\n");
472 llatbl_llt_show((struct lltable *)addr);
475 DB_SHOW_ALL_COMMAND(lltables, db_show_all_lltables)
477 VNET_ITERATOR_DECL(vnet_iter);
480 VNET_FOREACH(vnet_iter) {
481 CURVNET_SET_QUIET(vnet_iter);
483 db_printf("vnet=%p\n", curvnet);
485 SLIST_FOREACH(llt, &V_lltables, llt_link) {
486 db_printf("llt=%p llt_af=%d llt_ifp=%p(%s)\n",
487 llt, llt->llt_af, llt->llt_ifp,
488 (llt->llt_ifp != NULL) ?
489 llt->llt_ifp->if_xname : "?");
490 if (have_addr && addr != 0) /* verbose */
491 llatbl_llt_show(llt);