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);
82 static void htable_unlink_entry(struct llentry *lle);
83 static void htable_link_entry(struct lltable *llt, struct llentry *lle);
84 static int htable_foreach_lle(struct lltable *llt, llt_foreach_cb_t *f,
88 * Dump lle state for a specific address family.
91 lltable_dump_af(struct lltable *llt, struct sysctl_req *wr)
93 struct epoch_tracker et;
96 LLTABLE_LIST_LOCK_ASSERT();
98 if (llt->llt_ifp->if_flags & IFF_LOOPBACK)
103 error = lltable_foreach_lle(llt,
104 (llt_foreach_cb_t *)llt->llt_dump_entry, wr);
111 * Dump arp state for a specific address family.
114 lltable_sysctl_dumparp(int af, struct sysctl_req *wr)
119 LLTABLE_LIST_RLOCK();
120 SLIST_FOREACH(llt, &V_lltables, llt_link) {
121 if (llt->llt_af == af) {
122 error = lltable_dump_af(llt, wr);
128 LLTABLE_LIST_RUNLOCK();
133 * Common function helpers for chained hash table.
137 * Runs specified callback for each entry in @llt.
138 * Caller does the locking.
142 htable_foreach_lle(struct lltable *llt, llt_foreach_cb_t *f, void *farg)
144 struct llentry *lle, *next;
149 for (i = 0; i < llt->llt_hsize; i++) {
150 CK_LIST_FOREACH_SAFE(lle, &llt->lle_head[i], lle_next, next) {
151 error = f(llt, lle, farg);
161 htable_link_entry(struct lltable *llt, struct llentry *lle)
163 struct llentries *lleh;
166 if ((lle->la_flags & LLE_LINKED) != 0)
169 IF_AFDATA_WLOCK_ASSERT(llt->llt_ifp);
171 hashidx = llt->llt_hash(lle, llt->llt_hsize);
172 lleh = &llt->lle_head[hashidx];
175 lle->lle_head = lleh;
176 lle->la_flags |= LLE_LINKED;
177 CK_LIST_INSERT_HEAD(lleh, lle, lle_next);
181 htable_unlink_entry(struct llentry *lle)
184 if ((lle->la_flags & LLE_LINKED) != 0) {
185 IF_AFDATA_WLOCK_ASSERT(lle->lle_tbl->llt_ifp);
186 CK_LIST_REMOVE(lle, lle_next);
187 lle->la_flags &= ~(LLE_VALID | LLE_LINKED);
190 lle->lle_head = NULL;
195 struct prefix_match_data {
196 const struct sockaddr *addr;
197 const struct sockaddr *mask;
198 struct llentries dchain;
203 htable_prefix_free_cb(struct lltable *llt, struct llentry *lle, void *farg)
205 struct prefix_match_data *pmd;
207 pmd = (struct prefix_match_data *)farg;
209 if (llt->llt_match_prefix(pmd->addr, pmd->mask, pmd->flags, lle)) {
211 CK_LIST_INSERT_HEAD(&pmd->dchain, lle, lle_chain);
218 htable_prefix_free(struct lltable *llt, const struct sockaddr *addr,
219 const struct sockaddr *mask, u_int flags)
221 struct llentry *lle, *next;
222 struct prefix_match_data pmd;
224 bzero(&pmd, sizeof(pmd));
228 CK_LIST_INIT(&pmd.dchain);
230 IF_AFDATA_WLOCK(llt->llt_ifp);
231 /* Push matching lles to chain */
232 lltable_foreach_lle(llt, htable_prefix_free_cb, &pmd);
234 llentries_unlink(llt, &pmd.dchain);
235 IF_AFDATA_WUNLOCK(llt->llt_ifp);
237 CK_LIST_FOREACH_SAFE(lle, &pmd.dchain, lle_chain, next)
238 lltable_free_entry(llt, lle);
242 htable_free_tbl(struct lltable *llt)
245 free(llt->lle_head, M_LLTABLE);
246 free(llt, M_LLTABLE);
250 llentries_unlink(struct lltable *llt, struct llentries *head)
252 struct llentry *lle, *next;
254 CK_LIST_FOREACH_SAFE(lle, head, lle_chain, next)
255 llt->llt_unlink_entry(lle);
259 * Helper function used to drop all mbufs in hold queue.
261 * Returns the number of held packets, if any, that were dropped.
264 lltable_drop_entry_queue(struct llentry *lle)
269 LLE_WLOCK_ASSERT(lle);
272 while ((lle->la_numheld > 0) && (lle->la_hold != NULL)) {
273 next = lle->la_hold->m_nextpkt;
274 m_freem(lle->la_hold);
280 KASSERT(lle->la_numheld == 0,
281 ("%s: la_numheld %d > 0, pkts_droped %zd", __func__,
282 lle->la_numheld, pkts_dropped));
284 return (pkts_dropped);
288 lltable_set_entry_addr(struct ifnet *ifp, struct llentry *lle,
289 const char *linkhdr, size_t linkhdrsize, int lladdr_off)
292 memcpy(lle->r_linkdata, linkhdr, linkhdrsize);
293 lle->r_hdrlen = linkhdrsize;
294 lle->ll_addr = &lle->r_linkdata[lladdr_off];
295 lle->la_flags |= LLE_VALID;
296 lle->r_flags |= RLLE_VALID;
300 * Tries to update @lle link-level address.
301 * Since update requires AFDATA WLOCK, function
302 * drops @lle lock, acquires AFDATA lock and then acquires
303 * @lle lock to maintain lock order.
305 * Returns 1 on success.
308 lltable_try_set_entry_addr(struct ifnet *ifp, struct llentry *lle,
309 const char *linkhdr, size_t linkhdrsize, int lladdr_off)
312 /* Perform real LLE update */
313 /* use afdata WLOCK to update fields */
314 LLE_WLOCK_ASSERT(lle);
317 IF_AFDATA_WLOCK(ifp);
321 * Since we droppped LLE lock, other thread might have deleted
322 * this lle. Check and return
324 if ((lle->la_flags & LLE_DELETED) != 0) {
325 IF_AFDATA_WUNLOCK(ifp);
326 LLE_FREE_LOCKED(lle);
331 lltable_set_entry_addr(ifp, lle, linkhdr, linkhdrsize, lladdr_off);
333 IF_AFDATA_WUNLOCK(ifp);
341 * Helper function used to pre-compute full/partial link-layer
342 * header data suitable for feeding into if_output().
345 lltable_calc_llheader(struct ifnet *ifp, int family, char *lladdr,
346 char *buf, size_t *bufsize, int *lladdr_off)
348 struct if_encap_req ereq;
351 bzero(buf, *bufsize);
352 bzero(&ereq, sizeof(ereq));
354 ereq.bufsize = *bufsize;
355 ereq.rtype = IFENCAP_LL;
356 ereq.family = family;
357 ereq.lladdr = lladdr;
358 ereq.lladdr_len = ifp->if_addrlen;
359 error = ifp->if_requestencap(ifp, &ereq);
361 *bufsize = ereq.bufsize;
362 *lladdr_off = ereq.lladdr_off;
369 * Update link-layer header for given @lle after
370 * interface lladdr was changed.
373 llentry_update_ifaddr(struct lltable *llt, struct llentry *lle, void *farg)
376 u_char linkhdr[LLE_MAX_LINKHDR];
381 ifp = (struct ifnet *)farg;
383 lladdr = lle->ll_addr;
386 if ((lle->la_flags & LLE_VALID) == 0) {
391 if ((lle->la_flags & LLE_IFADDR) != 0)
392 lladdr = IF_LLADDR(ifp);
394 linkhdrsize = sizeof(linkhdr);
395 lltable_calc_llheader(ifp, llt->llt_af, lladdr, linkhdr, &linkhdrsize,
397 memcpy(lle->r_linkdata, linkhdr, linkhdrsize);
404 * Update all calculated headers for given @llt
407 lltable_update_ifaddr(struct lltable *llt)
410 if (llt->llt_ifp->if_flags & IFF_LOOPBACK)
413 IF_AFDATA_WLOCK(llt->llt_ifp);
414 lltable_foreach_lle(llt, llentry_update_ifaddr, llt->llt_ifp);
415 IF_AFDATA_WUNLOCK(llt->llt_ifp);
420 * Performs generic cleanup routines and frees lle.
422 * Called for non-linked entries, with callouts and
423 * other AF-specific cleanups performed.
425 * @lle must be passed WLOCK'ed
427 * Returns the number of held packets, if any, that were dropped.
430 llentry_free(struct llentry *lle)
434 LLE_WLOCK_ASSERT(lle);
436 KASSERT((lle->la_flags & LLE_LINKED) == 0, ("freeing linked lle"));
438 pkts_dropped = lltable_drop_entry_queue(lle);
441 if (callout_stop(&lle->lle_timer) > 0)
443 LLE_FREE_LOCKED(lle);
445 return (pkts_dropped);
449 * (al)locate an llentry for address dst (equivalent to rtalloc for new-arp).
451 * If found the llentry * is returned referenced and unlocked.
454 llentry_alloc(struct ifnet *ifp, struct lltable *lt,
455 struct sockaddr_storage *dst)
457 struct epoch_tracker et;
458 struct llentry *la, *la_tmp;
461 la = lla_lookup(lt, LLE_EXCLUSIVE, (struct sockaddr *)dst);
470 if ((ifp->if_flags & (IFF_NOARP | IFF_STATICARP)) == 0) {
471 la = lltable_alloc_entry(lt, 0, (struct sockaddr *)dst);
474 IF_AFDATA_WLOCK(ifp);
476 /* Prefer any existing LLE over newly-created one */
477 la_tmp = lla_lookup(lt, LLE_EXCLUSIVE, (struct sockaddr *)dst);
479 lltable_link_entry(lt, la);
480 IF_AFDATA_WUNLOCK(ifp);
481 if (la_tmp != NULL) {
482 lltable_free_entry(lt, la);
493 * Free all entries from given table and free itself.
497 lltable_free_cb(struct lltable *llt, struct llentry *lle, void *farg)
499 struct llentries *dchain;
501 dchain = (struct llentries *)farg;
504 CK_LIST_INSERT_HEAD(dchain, lle, lle_chain);
510 * Free all entries from given table and free itself.
513 lltable_free(struct lltable *llt)
515 struct llentry *lle, *next;
516 struct llentries dchain;
518 KASSERT(llt != NULL, ("%s: llt is NULL", __func__));
522 CK_LIST_INIT(&dchain);
523 IF_AFDATA_WLOCK(llt->llt_ifp);
524 /* Push all lles to @dchain */
525 lltable_foreach_lle(llt, lltable_free_cb, &dchain);
526 llentries_unlink(llt, &dchain);
527 IF_AFDATA_WUNLOCK(llt->llt_ifp);
529 CK_LIST_FOREACH_SAFE(lle, &dchain, lle_chain, next) {
533 llt->llt_free_tbl(llt);
538 lltable_drain(int af)
544 LLTABLE_LIST_RLOCK();
545 SLIST_FOREACH(llt, &V_lltables, llt_link) {
546 if (llt->llt_af != af)
549 for (i=0; i < llt->llt_hsize; i++) {
550 CK_LIST_FOREACH(lle, &llt->lle_head[i], lle_next) {
553 m_freem(lle->la_hold);
560 LLTABLE_LIST_RUNLOCK();
565 * Deletes an address from given lltable.
566 * Used for userland interaction to remove
567 * individual entries. Skips entries added by OS.
570 lltable_delete_addr(struct lltable *llt, u_int flags,
571 const struct sockaddr *l3addr)
577 IF_AFDATA_WLOCK(ifp);
578 lle = lla_lookup(llt, LLE_EXCLUSIVE, l3addr);
581 IF_AFDATA_WUNLOCK(ifp);
584 if ((lle->la_flags & LLE_IFADDR) != 0 && (flags & LLE_IFADDR) == 0) {
585 IF_AFDATA_WUNLOCK(ifp);
590 lltable_unlink_entry(llt, lle);
591 IF_AFDATA_WUNLOCK(ifp);
593 llt->llt_delete_entry(llt, lle);
599 lltable_prefix_free(int af, struct sockaddr *addr, struct sockaddr *mask,
604 LLTABLE_LIST_RLOCK();
605 SLIST_FOREACH(llt, &V_lltables, llt_link) {
606 if (llt->llt_af != af)
609 llt->llt_prefix_free(llt, addr, mask, flags);
611 LLTABLE_LIST_RUNLOCK();
615 lltable_allocate_htbl(uint32_t hsize)
620 llt = malloc(sizeof(struct lltable), M_LLTABLE, M_WAITOK | M_ZERO);
621 llt->llt_hsize = hsize;
622 llt->lle_head = malloc(sizeof(struct llentries) * hsize,
623 M_LLTABLE, M_WAITOK | M_ZERO);
625 for (i = 0; i < llt->llt_hsize; i++)
626 CK_LIST_INIT(&llt->lle_head[i]);
628 /* Set some default callbacks */
629 llt->llt_link_entry = htable_link_entry;
630 llt->llt_unlink_entry = htable_unlink_entry;
631 llt->llt_prefix_free = htable_prefix_free;
632 llt->llt_foreach_entry = htable_foreach_lle;
633 llt->llt_free_tbl = htable_free_tbl;
639 * Links lltable to global llt list.
642 lltable_link(struct lltable *llt)
645 LLTABLE_LIST_WLOCK();
646 SLIST_INSERT_HEAD(&V_lltables, llt, llt_link);
647 LLTABLE_LIST_WUNLOCK();
651 lltable_unlink(struct lltable *llt)
654 LLTABLE_LIST_WLOCK();
655 SLIST_REMOVE(&V_lltables, llt, lltable, llt_link);
656 LLTABLE_LIST_WUNLOCK();
661 * External methods used by lltable consumers
665 lltable_foreach_lle(struct lltable *llt, llt_foreach_cb_t *f, void *farg)
668 return (llt->llt_foreach_entry(llt, f, farg));
672 lltable_alloc_entry(struct lltable *llt, u_int flags,
673 const struct sockaddr *l3addr)
676 return (llt->llt_alloc_entry(llt, flags, l3addr));
680 lltable_free_entry(struct lltable *llt, struct llentry *lle)
683 llt->llt_free_entry(llt, lle);
687 lltable_link_entry(struct lltable *llt, struct llentry *lle)
690 llt->llt_link_entry(llt, lle);
694 lltable_unlink_entry(struct lltable *llt, struct llentry *lle)
697 llt->llt_unlink_entry(lle);
701 lltable_fill_sa_entry(const struct llentry *lle, struct sockaddr *sa)
706 llt->llt_fill_sa_entry(lle, sa);
710 lltable_get_ifp(const struct lltable *llt)
713 return (llt->llt_ifp);
717 lltable_get_af(const struct lltable *llt)
720 return (llt->llt_af);
724 * Called in route_output when rtm_flags contains RTF_LLDATA.
727 lla_rt_output(struct rt_msghdr *rtm, struct rt_addrinfo *info)
729 struct sockaddr_dl *dl =
730 (struct sockaddr_dl *)info->rti_info[RTAX_GATEWAY];
731 struct sockaddr *dst = (struct sockaddr *)info->rti_info[RTAX_DST];
734 struct llentry *lle, *lle_tmp;
735 uint8_t linkhdr[LLE_MAX_LINKHDR];
741 KASSERT(dl != NULL && dl->sdl_family == AF_LINK,
742 ("%s: invalid dl\n", __func__));
744 ifp = ifnet_byindex(dl->sdl_index);
746 log(LOG_INFO, "%s: invalid ifp (sdl_index %d)\n",
747 __func__, dl->sdl_index);
751 /* XXX linked list may be too expensive */
752 LLTABLE_LIST_RLOCK();
753 SLIST_FOREACH(llt, &V_lltables, llt_link) {
754 if (llt->llt_af == dst->sa_family &&
758 LLTABLE_LIST_RUNLOCK();
759 KASSERT(llt != NULL, ("Yep, ugly hacks are bad\n"));
763 switch (rtm->rtm_type) {
767 if (rtm->rtm_rmx.rmx_expire == 0)
768 laflags = LLE_STATIC;
769 lle = lltable_alloc_entry(llt, laflags, dst);
773 linkhdrsize = sizeof(linkhdr);
774 if (lltable_calc_llheader(ifp, dst->sa_family, LLADDR(dl),
775 linkhdr, &linkhdrsize, &lladdr_off) != 0)
777 lltable_set_entry_addr(ifp, lle, linkhdr, linkhdrsize,
779 if ((rtm->rtm_flags & RTF_ANNOUNCE))
780 lle->la_flags |= LLE_PUB;
781 lle->la_expire = rtm->rtm_rmx.rmx_expire;
783 laflags = lle->la_flags;
785 /* Try to link new entry */
787 IF_AFDATA_WLOCK(ifp);
789 lle_tmp = lla_lookup(llt, LLE_EXCLUSIVE, dst);
790 if (lle_tmp != NULL) {
791 /* Check if we are trying to replace immutable entry */
792 if ((lle_tmp->la_flags & LLE_IFADDR) != 0) {
793 IF_AFDATA_WUNLOCK(ifp);
794 LLE_WUNLOCK(lle_tmp);
795 lltable_free_entry(llt, lle);
798 /* Unlink existing entry from table */
799 lltable_unlink_entry(llt, lle_tmp);
801 lltable_link_entry(llt, lle);
802 IF_AFDATA_WUNLOCK(ifp);
804 if (lle_tmp != NULL) {
805 EVENTHANDLER_INVOKE(lle_event, lle_tmp,LLENTRY_EXPIRED);
806 lltable_free_entry(llt, lle_tmp);
810 * By invoking LLE handler here we might get
811 * two events on static LLE entry insertion
812 * in routing socket. However, since we might have
813 * other subscribers we need to generate this event.
815 EVENTHANDLER_INVOKE(lle_event, lle, LLENTRY_RESOLVED);
819 if ((laflags & LLE_PUB) && dst->sa_family == AF_INET)
821 &((struct sockaddr_in *)dst)->sin_addr,
822 &((struct sockaddr_in *)dst)->sin_addr,
823 (u_char *)LLADDR(dl));
829 return (lltable_delete_addr(llt, 0, dst));
841 struct sockaddr l3_addr;
845 llatbl_lle_show(struct llentry_sa *la)
851 db_printf("lle=%p\n", lle);
852 db_printf(" lle_next=%p\n", lle->lle_next.cle_next);
853 db_printf(" lle_lock=%p\n", &lle->lle_lock);
854 db_printf(" lle_tbl=%p\n", lle->lle_tbl);
855 db_printf(" lle_head=%p\n", lle->lle_head);
856 db_printf(" la_hold=%p\n", lle->la_hold);
857 db_printf(" la_numheld=%d\n", lle->la_numheld);
858 db_printf(" la_expire=%ju\n", (uintmax_t)lle->la_expire);
859 db_printf(" la_flags=0x%04x\n", lle->la_flags);
860 db_printf(" la_asked=%u\n", lle->la_asked);
861 db_printf(" la_preempt=%u\n", lle->la_preempt);
862 db_printf(" ln_state=%d\n", lle->ln_state);
863 db_printf(" ln_router=%u\n", lle->ln_router);
864 db_printf(" ln_ntick=%ju\n", (uintmax_t)lle->ln_ntick);
865 db_printf(" lle_refcnt=%d\n", lle->lle_refcnt);
866 bcopy(lle->ll_addr, octet, sizeof(octet));
867 db_printf(" ll_addr=%02x:%02x:%02x:%02x:%02x:%02x\n",
868 octet[0], octet[1], octet[2], octet[3], octet[4], octet[5]);
869 db_printf(" lle_timer=%p\n", &lle->lle_timer);
871 switch (la->l3_addr.sa_family) {
875 struct sockaddr_in *sin;
876 char l3s[INET_ADDRSTRLEN];
878 sin = (struct sockaddr_in *)&la->l3_addr;
879 inet_ntoa_r(sin->sin_addr, l3s);
880 db_printf(" l3_addr=%s\n", l3s);
887 struct sockaddr_in6 *sin6;
888 char l3s[INET6_ADDRSTRLEN];
890 sin6 = (struct sockaddr_in6 *)&la->l3_addr;
891 ip6_sprintf(l3s, &sin6->sin6_addr);
892 db_printf(" l3_addr=%s\n", l3s);
897 db_printf(" l3_addr=N/A (af=%d)\n", la->l3_addr.sa_family);
902 DB_SHOW_COMMAND(llentry, db_show_llentry)
906 db_printf("usage: show llentry <struct llentry *>\n");
910 llatbl_lle_show((struct llentry_sa *)addr);
914 llatbl_llt_show(struct lltable *llt)
919 db_printf("llt=%p llt_af=%d llt_ifp=%p\n",
920 llt, llt->llt_af, llt->llt_ifp);
922 for (i = 0; i < llt->llt_hsize; i++) {
923 CK_LIST_FOREACH(lle, &llt->lle_head[i], lle_next) {
925 llatbl_lle_show((struct llentry_sa *)lle);
932 DB_SHOW_COMMAND(lltable, db_show_lltable)
936 db_printf("usage: show lltable <struct lltable *>\n");
940 llatbl_llt_show((struct lltable *)addr);
943 DB_SHOW_ALL_COMMAND(lltables, db_show_all_lltables)
945 VNET_ITERATOR_DECL(vnet_iter);
948 VNET_FOREACH(vnet_iter) {
949 CURVNET_SET_QUIET(vnet_iter);
951 db_printf("vnet=%p\n", curvnet);
953 SLIST_FOREACH(llt, &V_lltables, llt_link) {
954 db_printf("llt=%p llt_af=%d llt_ifp=%p(%s)\n",
955 llt, llt->llt_af, llt->llt_ifp,
956 (llt->llt_ifp != NULL) ?
957 llt->llt_ifp->if_xname : "?");
958 if (have_addr && addr != 0) /* verbose */
959 llatbl_llt_show(llt);