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 static struct rwlock lltable_list_lock;
70 RW_SYSINIT(lltable_list_lock, &lltable_list_lock, "lltable_list_lock");
71 #define LLTABLE_LIST_RLOCK() rw_rlock(&lltable_list_lock)
72 #define LLTABLE_LIST_RUNLOCK() rw_runlock(&lltable_list_lock)
73 #define LLTABLE_LIST_WLOCK() rw_wlock(&lltable_list_lock)
74 #define LLTABLE_LIST_WUNLOCK() rw_wunlock(&lltable_list_lock)
75 #define LLTABLE_LIST_LOCK_ASSERT() rw_assert(&lltable_list_lock, RA_LOCKED)
77 static void lltable_unlink(struct lltable *llt);
78 static void llentries_unlink(struct lltable *llt, struct llentries *head);
80 static void htable_unlink_entry(struct llentry *lle);
81 static void htable_link_entry(struct lltable *llt, struct llentry *lle);
82 static int htable_foreach_lle(struct lltable *llt, llt_foreach_cb_t *f,
86 * Dump lle state for a specific address family.
89 lltable_dump_af(struct lltable *llt, struct sysctl_req *wr)
93 LLTABLE_LIST_LOCK_ASSERT();
95 if (llt->llt_ifp->if_flags & IFF_LOOPBACK)
99 IF_AFDATA_RLOCK(llt->llt_ifp);
100 error = lltable_foreach_lle(llt,
101 (llt_foreach_cb_t *)llt->llt_dump_entry, wr);
102 IF_AFDATA_RUNLOCK(llt->llt_ifp);
108 * Dump arp state for a specific address family.
111 lltable_sysctl_dumparp(int af, struct sysctl_req *wr)
116 LLTABLE_LIST_RLOCK();
117 SLIST_FOREACH(llt, &V_lltables, llt_link) {
118 if (llt->llt_af == af) {
119 error = lltable_dump_af(llt, wr);
125 LLTABLE_LIST_RUNLOCK();
130 * Common function helpers for chained hash table.
134 * Runs specified callback for each entry in @llt.
135 * Caller does the locking.
139 htable_foreach_lle(struct lltable *llt, llt_foreach_cb_t *f, void *farg)
141 struct llentry *lle, *next;
146 for (i = 0; i < llt->llt_hsize; i++) {
147 LIST_FOREACH_SAFE(lle, &llt->lle_head[i], lle_next, next) {
148 error = f(llt, lle, farg);
158 htable_link_entry(struct lltable *llt, struct llentry *lle)
160 struct llentries *lleh;
163 if ((lle->la_flags & LLE_LINKED) != 0)
166 IF_AFDATA_WLOCK_ASSERT(llt->llt_ifp);
168 hashidx = llt->llt_hash(lle, llt->llt_hsize);
169 lleh = &llt->lle_head[hashidx];
172 lle->lle_head = lleh;
173 lle->la_flags |= LLE_LINKED;
174 LIST_INSERT_HEAD(lleh, lle, lle_next);
178 htable_unlink_entry(struct llentry *lle)
181 if ((lle->la_flags & LLE_LINKED) != 0) {
182 IF_AFDATA_WLOCK_ASSERT(lle->lle_tbl->llt_ifp);
183 LIST_REMOVE(lle, lle_next);
184 lle->la_flags &= ~(LLE_VALID | LLE_LINKED);
187 lle->lle_head = NULL;
192 struct prefix_match_data {
193 const struct sockaddr *addr;
194 const struct sockaddr *mask;
195 struct llentries dchain;
200 htable_prefix_free_cb(struct lltable *llt, struct llentry *lle, void *farg)
202 struct prefix_match_data *pmd;
204 pmd = (struct prefix_match_data *)farg;
206 if (llt->llt_match_prefix(pmd->addr, pmd->mask, pmd->flags, lle)) {
208 LIST_INSERT_HEAD(&pmd->dchain, lle, lle_chain);
215 htable_prefix_free(struct lltable *llt, const struct sockaddr *addr,
216 const struct sockaddr *mask, u_int flags)
218 struct llentry *lle, *next;
219 struct prefix_match_data pmd;
221 bzero(&pmd, sizeof(pmd));
225 LIST_INIT(&pmd.dchain);
227 IF_AFDATA_WLOCK(llt->llt_ifp);
228 /* Push matching lles to chain */
229 lltable_foreach_lle(llt, htable_prefix_free_cb, &pmd);
231 llentries_unlink(llt, &pmd.dchain);
232 IF_AFDATA_WUNLOCK(llt->llt_ifp);
234 LIST_FOREACH_SAFE(lle, &pmd.dchain, lle_chain, next)
235 lltable_free_entry(llt, lle);
239 htable_free_tbl(struct lltable *llt)
242 free(llt->lle_head, M_LLTABLE);
243 free(llt, M_LLTABLE);
247 llentries_unlink(struct lltable *llt, struct llentries *head)
249 struct llentry *lle, *next;
251 LIST_FOREACH_SAFE(lle, head, lle_chain, next)
252 llt->llt_unlink_entry(lle);
256 * Helper function used to drop all mbufs in hold queue.
258 * Returns the number of held packets, if any, that were dropped.
261 lltable_drop_entry_queue(struct llentry *lle)
266 LLE_WLOCK_ASSERT(lle);
269 while ((lle->la_numheld > 0) && (lle->la_hold != NULL)) {
270 next = lle->la_hold->m_nextpkt;
271 m_freem(lle->la_hold);
277 KASSERT(lle->la_numheld == 0,
278 ("%s: la_numheld %d > 0, pkts_droped %zd", __func__,
279 lle->la_numheld, pkts_dropped));
281 return (pkts_dropped);
285 lltable_set_entry_addr(struct ifnet *ifp, struct llentry *lle,
286 const char *linkhdr, size_t linkhdrsize, int lladdr_off)
289 memcpy(lle->r_linkdata, linkhdr, linkhdrsize);
290 lle->r_hdrlen = linkhdrsize;
291 lle->ll_addr = &lle->r_linkdata[lladdr_off];
292 lle->la_flags |= LLE_VALID;
293 lle->r_flags |= RLLE_VALID;
297 * Tries to update @lle link-level address.
298 * Since update requires AFDATA WLOCK, function
299 * drops @lle lock, acquires AFDATA lock and then acquires
300 * @lle lock to maintain lock order.
302 * Returns 1 on success.
305 lltable_try_set_entry_addr(struct ifnet *ifp, struct llentry *lle,
306 const char *linkhdr, size_t linkhdrsize, int lladdr_off)
309 /* Perform real LLE update */
310 /* use afdata WLOCK to update fields */
311 LLE_WLOCK_ASSERT(lle);
314 IF_AFDATA_WLOCK(ifp);
318 * Since we droppped LLE lock, other thread might have deleted
319 * this lle. Check and return
321 if ((lle->la_flags & LLE_DELETED) != 0) {
322 IF_AFDATA_WUNLOCK(ifp);
323 LLE_FREE_LOCKED(lle);
328 lltable_set_entry_addr(ifp, lle, linkhdr, linkhdrsize, lladdr_off);
330 IF_AFDATA_WUNLOCK(ifp);
338 * Helper function used to pre-compute full/partial link-layer
339 * header data suitable for feeding into if_output().
342 lltable_calc_llheader(struct ifnet *ifp, int family, char *lladdr,
343 char *buf, size_t *bufsize, int *lladdr_off)
345 struct if_encap_req ereq;
348 bzero(buf, *bufsize);
349 bzero(&ereq, sizeof(ereq));
351 ereq.bufsize = *bufsize;
352 ereq.rtype = IFENCAP_LL;
353 ereq.family = family;
354 ereq.lladdr = lladdr;
355 ereq.lladdr_len = ifp->if_addrlen;
356 error = ifp->if_requestencap(ifp, &ereq);
358 *bufsize = ereq.bufsize;
359 *lladdr_off = ereq.lladdr_off;
366 * Update link-layer header for given @lle after
367 * interface lladdr was changed.
370 llentry_update_ifaddr(struct lltable *llt, struct llentry *lle, void *farg)
373 u_char linkhdr[LLE_MAX_LINKHDR];
378 ifp = (struct ifnet *)farg;
380 lladdr = lle->ll_addr;
383 if ((lle->la_flags & LLE_VALID) == 0) {
388 if ((lle->la_flags & LLE_IFADDR) != 0)
389 lladdr = IF_LLADDR(ifp);
391 linkhdrsize = sizeof(linkhdr);
392 lltable_calc_llheader(ifp, llt->llt_af, lladdr, linkhdr, &linkhdrsize,
394 memcpy(lle->r_linkdata, linkhdr, linkhdrsize);
401 * Update all calculated headers for given @llt
404 lltable_update_ifaddr(struct lltable *llt)
407 if (llt->llt_ifp->if_flags & IFF_LOOPBACK)
410 IF_AFDATA_WLOCK(llt->llt_ifp);
411 lltable_foreach_lle(llt, llentry_update_ifaddr, llt->llt_ifp);
412 IF_AFDATA_WUNLOCK(llt->llt_ifp);
417 * Performs generic cleanup routines and frees lle.
419 * Called for non-linked entries, with callouts and
420 * other AF-specific cleanups performed.
422 * @lle must be passed WLOCK'ed
424 * Returns the number of held packets, if any, that were dropped.
427 llentry_free(struct llentry *lle)
431 LLE_WLOCK_ASSERT(lle);
433 KASSERT((lle->la_flags & LLE_LINKED) == 0, ("freeing linked lle"));
435 pkts_dropped = lltable_drop_entry_queue(lle);
437 LLE_FREE_LOCKED(lle);
439 return (pkts_dropped);
443 * (al)locate an llentry for address dst (equivalent to rtalloc for new-arp).
445 * If found the llentry * is returned referenced and unlocked.
448 llentry_alloc(struct ifnet *ifp, struct lltable *lt,
449 struct sockaddr_storage *dst)
451 struct llentry *la, *la_tmp;
453 IF_AFDATA_RLOCK(ifp);
454 la = lla_lookup(lt, LLE_EXCLUSIVE, (struct sockaddr *)dst);
455 IF_AFDATA_RUNLOCK(ifp);
463 if ((ifp->if_flags & (IFF_NOARP | IFF_STATICARP)) == 0) {
464 la = lltable_alloc_entry(lt, 0, (struct sockaddr *)dst);
467 IF_AFDATA_WLOCK(ifp);
469 /* Prefer any existing LLE over newly-created one */
470 la_tmp = lla_lookup(lt, LLE_EXCLUSIVE, (struct sockaddr *)dst);
472 lltable_link_entry(lt, la);
473 IF_AFDATA_WUNLOCK(ifp);
474 if (la_tmp != NULL) {
475 lltable_free_entry(lt, la);
486 * Free all entries from given table and free itself.
490 lltable_free_cb(struct lltable *llt, struct llentry *lle, void *farg)
492 struct llentries *dchain;
494 dchain = (struct llentries *)farg;
497 LIST_INSERT_HEAD(dchain, lle, lle_chain);
503 * Free all entries from given table and free itself.
506 lltable_free(struct lltable *llt)
508 struct llentry *lle, *next;
509 struct llentries dchain;
511 KASSERT(llt != NULL, ("%s: llt is NULL", __func__));
516 IF_AFDATA_WLOCK(llt->llt_ifp);
517 /* Push all lles to @dchain */
518 lltable_foreach_lle(llt, lltable_free_cb, &dchain);
519 llentries_unlink(llt, &dchain);
520 IF_AFDATA_WUNLOCK(llt->llt_ifp);
522 LIST_FOREACH_SAFE(lle, &dchain, lle_chain, next) {
523 if (callout_stop(&lle->lle_timer) > 0)
528 llt->llt_free_tbl(llt);
533 lltable_drain(int af)
539 LLTABLE_LIST_RLOCK();
540 SLIST_FOREACH(llt, &V_lltables, llt_link) {
541 if (llt->llt_af != af)
544 for (i=0; i < llt->llt_hsize; i++) {
545 LIST_FOREACH(lle, &llt->lle_head[i], lle_next) {
548 m_freem(lle->la_hold);
555 LLTABLE_LIST_RUNLOCK();
560 * Deletes an address from given lltable.
561 * Used for userland interaction to remove
562 * individual entries. Skips entries added by OS.
565 lltable_delete_addr(struct lltable *llt, u_int flags,
566 const struct sockaddr *l3addr)
572 IF_AFDATA_WLOCK(ifp);
573 lle = lla_lookup(llt, LLE_EXCLUSIVE, l3addr);
576 IF_AFDATA_WUNLOCK(ifp);
579 if ((lle->la_flags & LLE_IFADDR) != 0 && (flags & LLE_IFADDR) == 0) {
580 IF_AFDATA_WUNLOCK(ifp);
585 lltable_unlink_entry(llt, lle);
586 IF_AFDATA_WUNLOCK(ifp);
588 llt->llt_delete_entry(llt, lle);
594 lltable_prefix_free(int af, struct sockaddr *addr, struct sockaddr *mask,
599 LLTABLE_LIST_RLOCK();
600 SLIST_FOREACH(llt, &V_lltables, llt_link) {
601 if (llt->llt_af != af)
604 llt->llt_prefix_free(llt, addr, mask, flags);
606 LLTABLE_LIST_RUNLOCK();
610 lltable_allocate_htbl(uint32_t hsize)
615 llt = malloc(sizeof(struct lltable), M_LLTABLE, M_WAITOK | M_ZERO);
616 llt->llt_hsize = hsize;
617 llt->lle_head = malloc(sizeof(struct llentries) * hsize,
618 M_LLTABLE, M_WAITOK | M_ZERO);
620 for (i = 0; i < llt->llt_hsize; i++)
621 LIST_INIT(&llt->lle_head[i]);
623 /* Set some default callbacks */
624 llt->llt_link_entry = htable_link_entry;
625 llt->llt_unlink_entry = htable_unlink_entry;
626 llt->llt_prefix_free = htable_prefix_free;
627 llt->llt_foreach_entry = htable_foreach_lle;
628 llt->llt_free_tbl = htable_free_tbl;
634 * Links lltable to global llt list.
637 lltable_link(struct lltable *llt)
640 LLTABLE_LIST_WLOCK();
641 SLIST_INSERT_HEAD(&V_lltables, llt, llt_link);
642 LLTABLE_LIST_WUNLOCK();
646 lltable_unlink(struct lltable *llt)
649 LLTABLE_LIST_WLOCK();
650 SLIST_REMOVE(&V_lltables, llt, lltable, llt_link);
651 LLTABLE_LIST_WUNLOCK();
656 * External methods used by lltable consumers
660 lltable_foreach_lle(struct lltable *llt, llt_foreach_cb_t *f, void *farg)
663 return (llt->llt_foreach_entry(llt, f, farg));
667 lltable_alloc_entry(struct lltable *llt, u_int flags,
668 const struct sockaddr *l3addr)
671 return (llt->llt_alloc_entry(llt, flags, l3addr));
675 lltable_free_entry(struct lltable *llt, struct llentry *lle)
678 llt->llt_free_entry(llt, lle);
682 lltable_link_entry(struct lltable *llt, struct llentry *lle)
685 llt->llt_link_entry(llt, lle);
689 lltable_unlink_entry(struct lltable *llt, struct llentry *lle)
692 llt->llt_unlink_entry(lle);
696 lltable_fill_sa_entry(const struct llentry *lle, struct sockaddr *sa)
701 llt->llt_fill_sa_entry(lle, sa);
705 lltable_get_ifp(const struct lltable *llt)
708 return (llt->llt_ifp);
712 lltable_get_af(const struct lltable *llt)
715 return (llt->llt_af);
719 * Called in route_output when rtm_flags contains RTF_LLDATA.
722 lla_rt_output(struct rt_msghdr *rtm, struct rt_addrinfo *info)
724 struct sockaddr_dl *dl =
725 (struct sockaddr_dl *)info->rti_info[RTAX_GATEWAY];
726 struct sockaddr *dst = (struct sockaddr *)info->rti_info[RTAX_DST];
729 struct llentry *lle, *lle_tmp;
730 uint8_t linkhdr[LLE_MAX_LINKHDR];
736 KASSERT(dl != NULL && dl->sdl_family == AF_LINK,
737 ("%s: invalid dl\n", __func__));
739 ifp = ifnet_byindex(dl->sdl_index);
741 log(LOG_INFO, "%s: invalid ifp (sdl_index %d)\n",
742 __func__, dl->sdl_index);
746 /* XXX linked list may be too expensive */
747 LLTABLE_LIST_RLOCK();
748 SLIST_FOREACH(llt, &V_lltables, llt_link) {
749 if (llt->llt_af == dst->sa_family &&
753 LLTABLE_LIST_RUNLOCK();
754 KASSERT(llt != NULL, ("Yep, ugly hacks are bad\n"));
758 switch (rtm->rtm_type) {
762 if (rtm->rtm_rmx.rmx_expire == 0)
763 laflags = LLE_STATIC;
764 lle = lltable_alloc_entry(llt, laflags, dst);
768 linkhdrsize = sizeof(linkhdr);
769 if (lltable_calc_llheader(ifp, dst->sa_family, LLADDR(dl),
770 linkhdr, &linkhdrsize, &lladdr_off) != 0)
772 lltable_set_entry_addr(ifp, lle, linkhdr, linkhdrsize,
774 if ((rtm->rtm_flags & RTF_ANNOUNCE))
775 lle->la_flags |= LLE_PUB;
776 lle->la_expire = rtm->rtm_rmx.rmx_expire;
778 laflags = lle->la_flags;
780 /* Try to link new entry */
782 IF_AFDATA_WLOCK(ifp);
784 lle_tmp = lla_lookup(llt, LLE_EXCLUSIVE, dst);
785 if (lle_tmp != NULL) {
786 /* Check if we are trying to replace immutable entry */
787 if ((lle_tmp->la_flags & LLE_IFADDR) != 0) {
788 IF_AFDATA_WUNLOCK(ifp);
789 LLE_WUNLOCK(lle_tmp);
790 lltable_free_entry(llt, lle);
793 /* Unlink existing entry from table */
794 lltable_unlink_entry(llt, lle_tmp);
796 lltable_link_entry(llt, lle);
797 IF_AFDATA_WUNLOCK(ifp);
799 if (lle_tmp != NULL) {
800 EVENTHANDLER_INVOKE(lle_event, lle_tmp,LLENTRY_EXPIRED);
801 lltable_free_entry(llt, lle_tmp);
805 * By invoking LLE handler here we might get
806 * two events on static LLE entry insertion
807 * in routing socket. However, since we might have
808 * other subscribers we need to generate this event.
810 EVENTHANDLER_INVOKE(lle_event, lle, LLENTRY_RESOLVED);
814 if ((laflags & LLE_PUB) && dst->sa_family == AF_INET)
816 &((struct sockaddr_in *)dst)->sin_addr,
817 &((struct sockaddr_in *)dst)->sin_addr,
818 (u_char *)LLADDR(dl));
824 return (lltable_delete_addr(llt, 0, dst));
836 struct sockaddr l3_addr;
840 llatbl_lle_show(struct llentry_sa *la)
846 db_printf("lle=%p\n", lle);
847 db_printf(" lle_next=%p\n", lle->lle_next.le_next);
848 db_printf(" lle_lock=%p\n", &lle->lle_lock);
849 db_printf(" lle_tbl=%p\n", lle->lle_tbl);
850 db_printf(" lle_head=%p\n", lle->lle_head);
851 db_printf(" la_hold=%p\n", lle->la_hold);
852 db_printf(" la_numheld=%d\n", lle->la_numheld);
853 db_printf(" la_expire=%ju\n", (uintmax_t)lle->la_expire);
854 db_printf(" la_flags=0x%04x\n", lle->la_flags);
855 db_printf(" la_asked=%u\n", lle->la_asked);
856 db_printf(" la_preempt=%u\n", lle->la_preempt);
857 db_printf(" ln_state=%d\n", lle->ln_state);
858 db_printf(" ln_router=%u\n", lle->ln_router);
859 db_printf(" ln_ntick=%ju\n", (uintmax_t)lle->ln_ntick);
860 db_printf(" lle_refcnt=%d\n", lle->lle_refcnt);
861 bcopy(lle->ll_addr, octet, sizeof(octet));
862 db_printf(" ll_addr=%02x:%02x:%02x:%02x:%02x:%02x\n",
863 octet[0], octet[1], octet[2], octet[3], octet[4], octet[5]);
864 db_printf(" lle_timer=%p\n", &lle->lle_timer);
866 switch (la->l3_addr.sa_family) {
870 struct sockaddr_in *sin;
871 char l3s[INET_ADDRSTRLEN];
873 sin = (struct sockaddr_in *)&la->l3_addr;
874 inet_ntoa_r(sin->sin_addr, l3s);
875 db_printf(" l3_addr=%s\n", l3s);
882 struct sockaddr_in6 *sin6;
883 char l3s[INET6_ADDRSTRLEN];
885 sin6 = (struct sockaddr_in6 *)&la->l3_addr;
886 ip6_sprintf(l3s, &sin6->sin6_addr);
887 db_printf(" l3_addr=%s\n", l3s);
892 db_printf(" l3_addr=N/A (af=%d)\n", la->l3_addr.sa_family);
897 DB_SHOW_COMMAND(llentry, db_show_llentry)
901 db_printf("usage: show llentry <struct llentry *>\n");
905 llatbl_lle_show((struct llentry_sa *)addr);
909 llatbl_llt_show(struct lltable *llt)
914 db_printf("llt=%p llt_af=%d llt_ifp=%p\n",
915 llt, llt->llt_af, llt->llt_ifp);
917 for (i = 0; i < llt->llt_hsize; i++) {
918 LIST_FOREACH(lle, &llt->lle_head[i], lle_next) {
920 llatbl_lle_show((struct llentry_sa *)lle);
927 DB_SHOW_COMMAND(lltable, db_show_lltable)
931 db_printf("usage: show lltable <struct lltable *>\n");
935 llatbl_llt_show((struct lltable *)addr);
938 DB_SHOW_ALL_COMMAND(lltables, db_show_all_lltables)
940 VNET_ITERATOR_DECL(vnet_iter);
943 VNET_FOREACH(vnet_iter) {
944 CURVNET_SET_QUIET(vnet_iter);
946 db_printf("vnet=%p\n", curvnet);
948 SLIST_FOREACH(llt, &V_lltables, llt_link) {
949 db_printf("llt=%p llt_af=%d llt_ifp=%p(%s)\n",
950 llt, llt->llt_af, llt->llt_ifp,
951 (llt->llt_ifp != NULL) ?
952 llt->llt_ifp->if_xname : "?");
953 if (have_addr && addr != 0) /* verbose */
954 llatbl_llt_show(llt);