2 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
4 * Copyright (c) 2004 Luigi Rizzo, Alessandro Cerri. All rights reserved.
5 * Copyright (c) 2004-2008 Qing Li. All rights reserved.
6 * Copyright (c) 2008 Kip Macy. All rights reserved.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * THIS SOFTWARE IS PROVIDED BY AUTHOR AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL AUTHOR OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 #include <sys/cdefs.h>
30 __FBSDID("$FreeBSD$");
34 #include "opt_inet6.h"
36 #include <sys/param.h>
37 #include <sys/systm.h>
38 #include <sys/malloc.h>
40 #include <sys/syslog.h>
41 #include <sys/sysctl.h>
42 #include <sys/socket.h>
43 #include <sys/kernel.h>
45 #include <sys/mutex.h>
46 #include <sys/rwlock.h>
54 #include <netinet/in.h>
55 #include <net/if_llatbl.h>
57 #include <net/if_dl.h>
58 #include <net/if_var.h>
59 #include <net/route.h>
61 #include <netinet/if_ether.h>
62 #include <netinet6/in6_var.h>
63 #include <netinet6/nd6.h>
65 MALLOC_DEFINE(M_LLTABLE, "lltable", "link level address tables");
67 VNET_DEFINE_STATIC(SLIST_HEAD(, lltable), lltables) =
68 SLIST_HEAD_INITIALIZER(lltables);
69 #define V_lltables VNET(lltables)
71 static struct rwlock lltable_list_lock;
72 RW_SYSINIT(lltable_list_lock, &lltable_list_lock, "lltable_list_lock");
73 #define LLTABLE_LIST_RLOCK() rw_rlock(&lltable_list_lock)
74 #define LLTABLE_LIST_RUNLOCK() rw_runlock(&lltable_list_lock)
75 #define LLTABLE_LIST_WLOCK() rw_wlock(&lltable_list_lock)
76 #define LLTABLE_LIST_WUNLOCK() rw_wunlock(&lltable_list_lock)
77 #define LLTABLE_LIST_LOCK_ASSERT() rw_assert(&lltable_list_lock, RA_LOCKED)
79 static void lltable_unlink(struct lltable *llt);
80 static void llentries_unlink(struct lltable *llt, struct llentries *head);
83 * Dump lle state for a specific address family.
86 lltable_dump_af(struct lltable *llt, struct sysctl_req *wr)
90 LLTABLE_LIST_LOCK_ASSERT();
92 if (llt->llt_ifp->if_flags & IFF_LOOPBACK)
96 IF_AFDATA_RLOCK(llt->llt_ifp);
97 error = lltable_foreach_lle(llt,
98 (llt_foreach_cb_t *)llt->llt_dump_entry, wr);
99 IF_AFDATA_RUNLOCK(llt->llt_ifp);
105 * Dump arp state for a specific address family.
108 lltable_sysctl_dumparp(int af, struct sysctl_req *wr)
113 LLTABLE_LIST_RLOCK();
114 SLIST_FOREACH(llt, &V_lltables, llt_link) {
115 if (llt->llt_af == af) {
116 error = lltable_dump_af(llt, wr);
122 LLTABLE_LIST_RUNLOCK();
127 * Common function helpers for chained hash table.
131 * Runs specified callback for each entry in @llt.
132 * Caller does the locking.
136 htable_foreach_lle(struct lltable *llt, llt_foreach_cb_t *f, void *farg)
138 struct llentry *lle, *next;
143 for (i = 0; i < llt->llt_hsize; i++) {
144 CK_LIST_FOREACH_SAFE(lle, &llt->lle_head[i], lle_next, next) {
145 error = f(llt, lle, farg);
155 htable_link_entry(struct lltable *llt, struct llentry *lle)
157 struct llentries *lleh;
160 if ((lle->la_flags & LLE_LINKED) != 0)
163 IF_AFDATA_WLOCK_ASSERT(llt->llt_ifp);
165 hashidx = llt->llt_hash(lle, llt->llt_hsize);
166 lleh = &llt->lle_head[hashidx];
169 lle->lle_head = lleh;
170 lle->la_flags |= LLE_LINKED;
171 CK_LIST_INSERT_HEAD(lleh, lle, lle_next);
175 htable_unlink_entry(struct llentry *lle)
178 if ((lle->la_flags & LLE_LINKED) == 0)
181 IF_AFDATA_WLOCK_ASSERT(lle->lle_tbl->llt_ifp);
182 CK_LIST_REMOVE(lle, lle_next);
183 lle->la_flags &= ~(LLE_VALID | LLE_LINKED);
186 lle->lle_head = NULL;
190 struct prefix_match_data {
191 const struct sockaddr *addr;
192 const struct sockaddr *mask;
193 struct llentries dchain;
198 htable_prefix_free_cb(struct lltable *llt, struct llentry *lle, void *farg)
200 struct prefix_match_data *pmd;
202 pmd = (struct prefix_match_data *)farg;
204 if (llt->llt_match_prefix(pmd->addr, pmd->mask, pmd->flags, lle)) {
206 CK_LIST_INSERT_HEAD(&pmd->dchain, lle, lle_chain);
213 htable_prefix_free(struct lltable *llt, const struct sockaddr *addr,
214 const struct sockaddr *mask, u_int flags)
216 struct llentry *lle, *next;
217 struct prefix_match_data pmd;
219 bzero(&pmd, sizeof(pmd));
223 CK_LIST_INIT(&pmd.dchain);
225 IF_AFDATA_WLOCK(llt->llt_ifp);
226 /* Push matching lles to chain */
227 lltable_foreach_lle(llt, htable_prefix_free_cb, &pmd);
229 llentries_unlink(llt, &pmd.dchain);
230 IF_AFDATA_WUNLOCK(llt->llt_ifp);
232 CK_LIST_FOREACH_SAFE(lle, &pmd.dchain, lle_chain, next)
233 lltable_free_entry(llt, lle);
237 htable_free_tbl(struct lltable *llt)
240 free(llt->lle_head, M_LLTABLE);
241 free(llt, M_LLTABLE);
245 llentries_unlink(struct lltable *llt, struct llentries *head)
247 struct llentry *lle, *next;
249 CK_LIST_FOREACH_SAFE(lle, head, lle_chain, next)
250 llt->llt_unlink_entry(lle);
254 * Helper function used to drop all mbufs in hold queue.
256 * Returns the number of held packets, if any, that were dropped.
259 lltable_drop_entry_queue(struct llentry *lle)
264 LLE_WLOCK_ASSERT(lle);
267 while ((lle->la_numheld > 0) && (lle->la_hold != NULL)) {
268 next = lle->la_hold->m_nextpkt;
269 m_freem(lle->la_hold);
275 KASSERT(lle->la_numheld == 0,
276 ("%s: la_numheld %d > 0, pkts_droped %zd", __func__,
277 lle->la_numheld, pkts_dropped));
279 return (pkts_dropped);
283 lltable_set_entry_addr(struct ifnet *ifp, struct llentry *lle,
284 const char *linkhdr, size_t linkhdrsize, int lladdr_off)
287 memcpy(lle->r_linkdata, linkhdr, linkhdrsize);
288 lle->r_hdrlen = linkhdrsize;
289 lle->ll_addr = &lle->r_linkdata[lladdr_off];
290 lle->la_flags |= LLE_VALID;
291 lle->r_flags |= RLLE_VALID;
295 * Tries to update @lle link-level address.
296 * Since update requires AFDATA WLOCK, function
297 * drops @lle lock, acquires AFDATA lock and then acquires
298 * @lle lock to maintain lock order.
300 * Returns 1 on success.
303 lltable_try_set_entry_addr(struct ifnet *ifp, struct llentry *lle,
304 const char *linkhdr, size_t linkhdrsize, int lladdr_off)
307 /* Perform real LLE update */
308 /* use afdata WLOCK to update fields */
309 LLE_WLOCK_ASSERT(lle);
312 IF_AFDATA_WLOCK(ifp);
316 * Since we droppped LLE lock, other thread might have deleted
317 * this lle. Check and return
319 if ((lle->la_flags & LLE_DELETED) != 0) {
320 IF_AFDATA_WUNLOCK(ifp);
321 LLE_FREE_LOCKED(lle);
326 lltable_set_entry_addr(ifp, lle, linkhdr, linkhdrsize, lladdr_off);
328 IF_AFDATA_WUNLOCK(ifp);
336 * Helper function used to pre-compute full/partial link-layer
337 * header data suitable for feeding into if_output().
340 lltable_calc_llheader(struct ifnet *ifp, int family, char *lladdr,
341 char *buf, size_t *bufsize, int *lladdr_off)
343 struct if_encap_req ereq;
346 bzero(buf, *bufsize);
347 bzero(&ereq, sizeof(ereq));
349 ereq.bufsize = *bufsize;
350 ereq.rtype = IFENCAP_LL;
351 ereq.family = family;
352 ereq.lladdr = lladdr;
353 ereq.lladdr_len = ifp->if_addrlen;
354 error = ifp->if_requestencap(ifp, &ereq);
356 *bufsize = ereq.bufsize;
357 *lladdr_off = ereq.lladdr_off;
364 * Update link-layer header for given @lle after
365 * interface lladdr was changed.
368 llentry_update_ifaddr(struct lltable *llt, struct llentry *lle, void *farg)
371 u_char linkhdr[LLE_MAX_LINKHDR];
376 ifp = (struct ifnet *)farg;
378 lladdr = lle->ll_addr;
381 if ((lle->la_flags & LLE_VALID) == 0) {
386 if ((lle->la_flags & LLE_IFADDR) != 0)
387 lladdr = IF_LLADDR(ifp);
389 linkhdrsize = sizeof(linkhdr);
390 lltable_calc_llheader(ifp, llt->llt_af, lladdr, linkhdr, &linkhdrsize,
392 memcpy(lle->r_linkdata, linkhdr, linkhdrsize);
399 * Update all calculated headers for given @llt
402 lltable_update_ifaddr(struct lltable *llt)
405 if (llt->llt_ifp->if_flags & IFF_LOOPBACK)
408 IF_AFDATA_WLOCK(llt->llt_ifp);
409 lltable_foreach_lle(llt, llentry_update_ifaddr, llt->llt_ifp);
410 IF_AFDATA_WUNLOCK(llt->llt_ifp);
415 * Performs generic cleanup routines and frees lle.
417 * Called for non-linked entries, with callouts and
418 * other AF-specific cleanups performed.
420 * @lle must be passed WLOCK'ed
422 * Returns the number of held packets, if any, that were dropped.
425 llentry_free(struct llentry *lle)
429 LLE_WLOCK_ASSERT(lle);
431 KASSERT((lle->la_flags & LLE_LINKED) == 0, ("freeing linked lle"));
433 pkts_dropped = lltable_drop_entry_queue(lle);
436 if (callout_stop(&lle->lle_timer) > 0)
438 LLE_FREE_LOCKED(lle);
440 return (pkts_dropped);
444 * (al)locate an llentry for address dst (equivalent to rtalloc for new-arp).
446 * If found the llentry * is returned referenced and unlocked.
449 llentry_alloc(struct ifnet *ifp, struct lltable *lt,
450 struct sockaddr_storage *dst)
452 struct llentry *la, *la_tmp;
454 IF_AFDATA_RLOCK(ifp);
455 la = lla_lookup(lt, LLE_EXCLUSIVE, (struct sockaddr *)dst);
456 IF_AFDATA_RUNLOCK(ifp);
464 if ((ifp->if_flags & (IFF_NOARP | IFF_STATICARP)) == 0) {
465 la = lltable_alloc_entry(lt, 0, (struct sockaddr *)dst);
468 IF_AFDATA_WLOCK(ifp);
470 /* Prefer any existing LLE over newly-created one */
471 la_tmp = lla_lookup(lt, LLE_EXCLUSIVE, (struct sockaddr *)dst);
473 lltable_link_entry(lt, la);
474 IF_AFDATA_WUNLOCK(ifp);
475 if (la_tmp != NULL) {
476 lltable_free_entry(lt, la);
487 * Free all entries from given table and free itself.
491 lltable_free_cb(struct lltable *llt, struct llentry *lle, void *farg)
493 struct llentries *dchain;
495 dchain = (struct llentries *)farg;
498 CK_LIST_INSERT_HEAD(dchain, lle, lle_chain);
504 * Free all entries from given table and free itself.
507 lltable_free(struct lltable *llt)
509 struct llentry *lle, *next;
510 struct llentries dchain;
512 KASSERT(llt != NULL, ("%s: llt is NULL", __func__));
516 CK_LIST_INIT(&dchain);
517 IF_AFDATA_WLOCK(llt->llt_ifp);
518 /* Push all lles to @dchain */
519 lltable_foreach_lle(llt, lltable_free_cb, &dchain);
520 llentries_unlink(llt, &dchain);
521 IF_AFDATA_WUNLOCK(llt->llt_ifp);
523 CK_LIST_FOREACH_SAFE(lle, &dchain, lle_chain, next) {
527 llt->llt_free_tbl(llt);
532 lltable_drain(int af)
538 LLTABLE_LIST_RLOCK();
539 SLIST_FOREACH(llt, &V_lltables, llt_link) {
540 if (llt->llt_af != af)
543 for (i=0; i < llt->llt_hsize; i++) {
544 CK_LIST_FOREACH(lle, &llt->lle_head[i], lle_next) {
547 m_freem(lle->la_hold);
554 LLTABLE_LIST_RUNLOCK();
559 * Deletes an address from given lltable.
560 * Used for userland interaction to remove
561 * individual entries. Skips entries added by OS.
564 lltable_delete_addr(struct lltable *llt, u_int flags,
565 const struct sockaddr *l3addr)
571 IF_AFDATA_WLOCK(ifp);
572 lle = lla_lookup(llt, LLE_EXCLUSIVE, l3addr);
575 IF_AFDATA_WUNLOCK(ifp);
578 if ((lle->la_flags & LLE_IFADDR) != 0 && (flags & LLE_IFADDR) == 0) {
579 IF_AFDATA_WUNLOCK(ifp);
584 lltable_unlink_entry(llt, lle);
585 IF_AFDATA_WUNLOCK(ifp);
587 llt->llt_delete_entry(llt, lle);
593 lltable_prefix_free(int af, struct sockaddr *addr, struct sockaddr *mask,
598 LLTABLE_LIST_RLOCK();
599 SLIST_FOREACH(llt, &V_lltables, llt_link) {
600 if (llt->llt_af != af)
603 llt->llt_prefix_free(llt, addr, mask, flags);
605 LLTABLE_LIST_RUNLOCK();
609 lltable_allocate_htbl(uint32_t hsize)
614 llt = malloc(sizeof(struct lltable), M_LLTABLE, M_WAITOK | M_ZERO);
615 llt->llt_hsize = hsize;
616 llt->lle_head = malloc(sizeof(struct llentries) * hsize,
617 M_LLTABLE, M_WAITOK | M_ZERO);
619 for (i = 0; i < llt->llt_hsize; i++)
620 CK_LIST_INIT(&llt->lle_head[i]);
622 /* Set some default callbacks */
623 llt->llt_link_entry = htable_link_entry;
624 llt->llt_unlink_entry = htable_unlink_entry;
625 llt->llt_prefix_free = htable_prefix_free;
626 llt->llt_foreach_entry = htable_foreach_lle;
627 llt->llt_free_tbl = htable_free_tbl;
633 * Links lltable to global llt list.
636 lltable_link(struct lltable *llt)
639 LLTABLE_LIST_WLOCK();
640 SLIST_INSERT_HEAD(&V_lltables, llt, llt_link);
641 LLTABLE_LIST_WUNLOCK();
645 lltable_unlink(struct lltable *llt)
648 LLTABLE_LIST_WLOCK();
649 SLIST_REMOVE(&V_lltables, llt, lltable, llt_link);
650 LLTABLE_LIST_WUNLOCK();
655 * External methods used by lltable consumers
659 lltable_foreach_lle(struct lltable *llt, llt_foreach_cb_t *f, void *farg)
662 return (llt->llt_foreach_entry(llt, f, farg));
666 lltable_alloc_entry(struct lltable *llt, u_int flags,
667 const struct sockaddr *l3addr)
670 return (llt->llt_alloc_entry(llt, flags, l3addr));
674 lltable_free_entry(struct lltable *llt, struct llentry *lle)
677 llt->llt_free_entry(llt, lle);
681 lltable_link_entry(struct lltable *llt, struct llentry *lle)
684 llt->llt_link_entry(llt, lle);
688 lltable_unlink_entry(struct lltable *llt, struct llentry *lle)
691 llt->llt_unlink_entry(lle);
695 lltable_fill_sa_entry(const struct llentry *lle, struct sockaddr *sa)
700 llt->llt_fill_sa_entry(lle, sa);
704 lltable_get_ifp(const struct lltable *llt)
707 return (llt->llt_ifp);
711 lltable_get_af(const struct lltable *llt)
714 return (llt->llt_af);
718 * Called in route_output when rtm_flags contains RTF_LLDATA.
721 lla_rt_output(struct rt_msghdr *rtm, struct rt_addrinfo *info)
723 struct sockaddr_dl *dl =
724 (struct sockaddr_dl *)info->rti_info[RTAX_GATEWAY];
725 struct sockaddr *dst = (struct sockaddr *)info->rti_info[RTAX_DST];
728 struct llentry *lle, *lle_tmp;
729 uint8_t linkhdr[LLE_MAX_LINKHDR];
735 KASSERT(dl != NULL && dl->sdl_family == AF_LINK,
736 ("%s: invalid dl\n", __func__));
738 ifp = ifnet_byindex(dl->sdl_index);
740 log(LOG_INFO, "%s: invalid ifp (sdl_index %d)\n",
741 __func__, dl->sdl_index);
745 /* XXX linked list may be too expensive */
746 LLTABLE_LIST_RLOCK();
747 SLIST_FOREACH(llt, &V_lltables, llt_link) {
748 if (llt->llt_af == dst->sa_family &&
752 LLTABLE_LIST_RUNLOCK();
753 KASSERT(llt != NULL, ("Yep, ugly hacks are bad\n"));
757 switch (rtm->rtm_type) {
761 if (rtm->rtm_rmx.rmx_expire == 0)
762 laflags = LLE_STATIC;
763 lle = lltable_alloc_entry(llt, laflags, dst);
767 linkhdrsize = sizeof(linkhdr);
768 if (lltable_calc_llheader(ifp, dst->sa_family, LLADDR(dl),
769 linkhdr, &linkhdrsize, &lladdr_off) != 0)
771 lltable_set_entry_addr(ifp, lle, linkhdr, linkhdrsize,
773 if ((rtm->rtm_flags & RTF_ANNOUNCE))
774 lle->la_flags |= LLE_PUB;
775 lle->la_expire = rtm->rtm_rmx.rmx_expire;
777 laflags = lle->la_flags;
779 /* Try to link new entry */
781 IF_AFDATA_WLOCK(ifp);
783 lle_tmp = lla_lookup(llt, LLE_EXCLUSIVE, dst);
784 if (lle_tmp != NULL) {
785 /* Check if we are trying to replace immutable entry */
786 if ((lle_tmp->la_flags & LLE_IFADDR) != 0) {
787 IF_AFDATA_WUNLOCK(ifp);
788 LLE_WUNLOCK(lle_tmp);
789 lltable_free_entry(llt, lle);
792 /* Unlink existing entry from table */
793 lltable_unlink_entry(llt, lle_tmp);
795 lltable_link_entry(llt, lle);
796 IF_AFDATA_WUNLOCK(ifp);
798 if (lle_tmp != NULL) {
799 EVENTHANDLER_INVOKE(lle_event, lle_tmp,LLENTRY_EXPIRED);
800 lltable_free_entry(llt, lle_tmp);
804 * By invoking LLE handler here we might get
805 * two events on static LLE entry insertion
806 * in routing socket. However, since we might have
807 * other subscribers we need to generate this event.
809 EVENTHANDLER_INVOKE(lle_event, lle, LLENTRY_RESOLVED);
813 if ((laflags & LLE_PUB) && dst->sa_family == AF_INET)
815 &((struct sockaddr_in *)dst)->sin_addr,
816 &((struct sockaddr_in *)dst)->sin_addr,
817 (u_char *)LLADDR(dl));
823 return (lltable_delete_addr(llt, 0, dst));
835 struct sockaddr l3_addr;
839 llatbl_lle_show(struct llentry_sa *la)
845 db_printf("lle=%p\n", lle);
846 db_printf(" lle_next=%p\n", lle->lle_next.cle_next);
847 db_printf(" lle_lock=%p\n", &lle->lle_lock);
848 db_printf(" lle_tbl=%p\n", lle->lle_tbl);
849 db_printf(" lle_head=%p\n", lle->lle_head);
850 db_printf(" la_hold=%p\n", lle->la_hold);
851 db_printf(" la_numheld=%d\n", lle->la_numheld);
852 db_printf(" la_expire=%ju\n", (uintmax_t)lle->la_expire);
853 db_printf(" la_flags=0x%04x\n", lle->la_flags);
854 db_printf(" la_asked=%u\n", lle->la_asked);
855 db_printf(" la_preempt=%u\n", lle->la_preempt);
856 db_printf(" ln_state=%d\n", lle->ln_state);
857 db_printf(" ln_router=%u\n", lle->ln_router);
858 db_printf(" ln_ntick=%ju\n", (uintmax_t)lle->ln_ntick);
859 db_printf(" lle_refcnt=%d\n", lle->lle_refcnt);
860 bcopy(lle->ll_addr, octet, sizeof(octet));
861 db_printf(" ll_addr=%02x:%02x:%02x:%02x:%02x:%02x\n",
862 octet[0], octet[1], octet[2], octet[3], octet[4], octet[5]);
863 db_printf(" lle_timer=%p\n", &lle->lle_timer);
865 switch (la->l3_addr.sa_family) {
869 struct sockaddr_in *sin;
870 char l3s[INET_ADDRSTRLEN];
872 sin = (struct sockaddr_in *)&la->l3_addr;
873 inet_ntoa_r(sin->sin_addr, l3s);
874 db_printf(" l3_addr=%s\n", l3s);
881 struct sockaddr_in6 *sin6;
882 char l3s[INET6_ADDRSTRLEN];
884 sin6 = (struct sockaddr_in6 *)&la->l3_addr;
885 ip6_sprintf(l3s, &sin6->sin6_addr);
886 db_printf(" l3_addr=%s\n", l3s);
891 db_printf(" l3_addr=N/A (af=%d)\n", la->l3_addr.sa_family);
896 DB_SHOW_COMMAND(llentry, db_show_llentry)
900 db_printf("usage: show llentry <struct llentry *>\n");
904 llatbl_lle_show((struct llentry_sa *)addr);
908 llatbl_llt_show(struct lltable *llt)
913 db_printf("llt=%p llt_af=%d llt_ifp=%p\n",
914 llt, llt->llt_af, llt->llt_ifp);
916 for (i = 0; i < llt->llt_hsize; i++) {
917 CK_LIST_FOREACH(lle, &llt->lle_head[i], lle_next) {
919 llatbl_lle_show((struct llentry_sa *)lle);
926 DB_SHOW_COMMAND(lltable, db_show_lltable)
930 db_printf("usage: show lltable <struct lltable *>\n");
934 llatbl_llt_show((struct lltable *)addr);
937 DB_SHOW_ALL_COMMAND(lltables, db_show_all_lltables)
939 VNET_ITERATOR_DECL(vnet_iter);
942 VNET_FOREACH(vnet_iter) {
943 CURVNET_SET_QUIET(vnet_iter);
945 db_printf("vnet=%p\n", curvnet);
947 SLIST_FOREACH(llt, &V_lltables, llt_link) {
948 db_printf("llt=%p llt_af=%d llt_ifp=%p(%s)\n",
949 llt, llt->llt_af, llt->llt_ifp,
950 (llt->llt_ifp != NULL) ?
951 llt->llt_ifp->if_xname : "?");
952 if (have_addr && addr != 0) /* verbose */
953 llatbl_llt_show(llt);