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 static VNET_DEFINE(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)
95 LLTABLE_LIST_LOCK_ASSERT();
97 if (llt->llt_ifp->if_flags & IFF_LOOPBACK)
101 IF_AFDATA_RLOCK(llt->llt_ifp);
102 error = lltable_foreach_lle(llt,
103 (llt_foreach_cb_t *)llt->llt_dump_entry, wr);
104 IF_AFDATA_RUNLOCK(llt->llt_ifp);
110 * Dump arp state for a specific address family.
113 lltable_sysctl_dumparp(int af, struct sysctl_req *wr)
118 LLTABLE_LIST_RLOCK();
119 SLIST_FOREACH(llt, &V_lltables, llt_link) {
120 if (llt->llt_af == af) {
121 error = lltable_dump_af(llt, wr);
127 LLTABLE_LIST_RUNLOCK();
132 * Common function helpers for chained hash table.
136 * Runs specified callback for each entry in @llt.
137 * Caller does the locking.
141 htable_foreach_lle(struct lltable *llt, llt_foreach_cb_t *f, void *farg)
143 struct llentry *lle, *next;
148 for (i = 0; i < llt->llt_hsize; i++) {
149 CK_LIST_FOREACH_SAFE(lle, &llt->lle_head[i], lle_next, next) {
150 error = f(llt, lle, farg);
160 htable_link_entry(struct lltable *llt, struct llentry *lle)
162 struct llentries *lleh;
165 if ((lle->la_flags & LLE_LINKED) != 0)
168 IF_AFDATA_WLOCK_ASSERT(llt->llt_ifp);
170 hashidx = llt->llt_hash(lle, llt->llt_hsize);
171 lleh = &llt->lle_head[hashidx];
174 lle->lle_head = lleh;
175 lle->la_flags |= LLE_LINKED;
176 CK_LIST_INSERT_HEAD(lleh, lle, lle_next);
180 htable_unlink_entry(struct llentry *lle)
183 if ((lle->la_flags & LLE_LINKED) != 0) {
184 IF_AFDATA_WLOCK_ASSERT(lle->lle_tbl->llt_ifp);
185 CK_LIST_REMOVE(lle, lle_next);
186 lle->la_flags &= ~(LLE_VALID | LLE_LINKED);
189 lle->lle_head = NULL;
194 struct prefix_match_data {
195 const struct sockaddr *addr;
196 const struct sockaddr *mask;
197 struct llentries dchain;
202 htable_prefix_free_cb(struct lltable *llt, struct llentry *lle, void *farg)
204 struct prefix_match_data *pmd;
206 pmd = (struct prefix_match_data *)farg;
208 if (llt->llt_match_prefix(pmd->addr, pmd->mask, pmd->flags, lle)) {
210 CK_LIST_INSERT_HEAD(&pmd->dchain, lle, lle_chain);
217 htable_prefix_free(struct lltable *llt, const struct sockaddr *addr,
218 const struct sockaddr *mask, u_int flags)
220 struct llentry *lle, *next;
221 struct prefix_match_data pmd;
223 bzero(&pmd, sizeof(pmd));
227 CK_LIST_INIT(&pmd.dchain);
229 IF_AFDATA_WLOCK(llt->llt_ifp);
230 /* Push matching lles to chain */
231 lltable_foreach_lle(llt, htable_prefix_free_cb, &pmd);
233 llentries_unlink(llt, &pmd.dchain);
234 IF_AFDATA_WUNLOCK(llt->llt_ifp);
236 CK_LIST_FOREACH_SAFE(lle, &pmd.dchain, lle_chain, next)
237 lltable_free_entry(llt, lle);
241 htable_free_tbl(struct lltable *llt)
244 free(llt->lle_head, M_LLTABLE);
245 free(llt, M_LLTABLE);
249 llentries_unlink(struct lltable *llt, struct llentries *head)
251 struct llentry *lle, *next;
253 CK_LIST_FOREACH_SAFE(lle, head, lle_chain, next)
254 llt->llt_unlink_entry(lle);
258 * Helper function used to drop all mbufs in hold queue.
260 * Returns the number of held packets, if any, that were dropped.
263 lltable_drop_entry_queue(struct llentry *lle)
268 LLE_WLOCK_ASSERT(lle);
271 while ((lle->la_numheld > 0) && (lle->la_hold != NULL)) {
272 next = lle->la_hold->m_nextpkt;
273 m_freem(lle->la_hold);
279 KASSERT(lle->la_numheld == 0,
280 ("%s: la_numheld %d > 0, pkts_droped %zd", __func__,
281 lle->la_numheld, pkts_dropped));
283 return (pkts_dropped);
287 lltable_set_entry_addr(struct ifnet *ifp, struct llentry *lle,
288 const char *linkhdr, size_t linkhdrsize, int lladdr_off)
291 memcpy(lle->r_linkdata, linkhdr, linkhdrsize);
292 lle->r_hdrlen = linkhdrsize;
293 lle->ll_addr = &lle->r_linkdata[lladdr_off];
294 lle->la_flags |= LLE_VALID;
295 lle->r_flags |= RLLE_VALID;
299 * Tries to update @lle link-level address.
300 * Since update requires AFDATA WLOCK, function
301 * drops @lle lock, acquires AFDATA lock and then acquires
302 * @lle lock to maintain lock order.
304 * Returns 1 on success.
307 lltable_try_set_entry_addr(struct ifnet *ifp, struct llentry *lle,
308 const char *linkhdr, size_t linkhdrsize, int lladdr_off)
311 /* Perform real LLE update */
312 /* use afdata WLOCK to update fields */
313 LLE_WLOCK_ASSERT(lle);
316 IF_AFDATA_WLOCK(ifp);
320 * Since we droppped LLE lock, other thread might have deleted
321 * this lle. Check and return
323 if ((lle->la_flags & LLE_DELETED) != 0) {
324 IF_AFDATA_WUNLOCK(ifp);
325 LLE_FREE_LOCKED(lle);
330 lltable_set_entry_addr(ifp, lle, linkhdr, linkhdrsize, lladdr_off);
332 IF_AFDATA_WUNLOCK(ifp);
340 * Helper function used to pre-compute full/partial link-layer
341 * header data suitable for feeding into if_output().
344 lltable_calc_llheader(struct ifnet *ifp, int family, char *lladdr,
345 char *buf, size_t *bufsize, int *lladdr_off)
347 struct if_encap_req ereq;
350 bzero(buf, *bufsize);
351 bzero(&ereq, sizeof(ereq));
353 ereq.bufsize = *bufsize;
354 ereq.rtype = IFENCAP_LL;
355 ereq.family = family;
356 ereq.lladdr = lladdr;
357 ereq.lladdr_len = ifp->if_addrlen;
358 error = ifp->if_requestencap(ifp, &ereq);
360 *bufsize = ereq.bufsize;
361 *lladdr_off = ereq.lladdr_off;
368 * Update link-layer header for given @lle after
369 * interface lladdr was changed.
372 llentry_update_ifaddr(struct lltable *llt, struct llentry *lle, void *farg)
375 u_char linkhdr[LLE_MAX_LINKHDR];
380 ifp = (struct ifnet *)farg;
382 lladdr = lle->ll_addr;
385 if ((lle->la_flags & LLE_VALID) == 0) {
390 if ((lle->la_flags & LLE_IFADDR) != 0)
391 lladdr = IF_LLADDR(ifp);
393 linkhdrsize = sizeof(linkhdr);
394 lltable_calc_llheader(ifp, llt->llt_af, lladdr, linkhdr, &linkhdrsize,
396 memcpy(lle->r_linkdata, linkhdr, linkhdrsize);
403 * Update all calculated headers for given @llt
406 lltable_update_ifaddr(struct lltable *llt)
409 if (llt->llt_ifp->if_flags & IFF_LOOPBACK)
412 IF_AFDATA_WLOCK(llt->llt_ifp);
413 lltable_foreach_lle(llt, llentry_update_ifaddr, llt->llt_ifp);
414 IF_AFDATA_WUNLOCK(llt->llt_ifp);
419 * Performs generic cleanup routines and frees lle.
421 * Called for non-linked entries, with callouts and
422 * other AF-specific cleanups performed.
424 * @lle must be passed WLOCK'ed
426 * Returns the number of held packets, if any, that were dropped.
429 llentry_free(struct llentry *lle)
433 LLE_WLOCK_ASSERT(lle);
435 KASSERT((lle->la_flags & LLE_LINKED) == 0, ("freeing linked lle"));
437 pkts_dropped = lltable_drop_entry_queue(lle);
439 LLE_FREE_LOCKED(lle);
441 return (pkts_dropped);
445 * (al)locate an llentry for address dst (equivalent to rtalloc for new-arp).
447 * If found the llentry * is returned referenced and unlocked.
450 llentry_alloc(struct ifnet *ifp, struct lltable *lt,
451 struct sockaddr_storage *dst)
453 struct llentry *la, *la_tmp;
455 IF_AFDATA_RLOCK(ifp);
456 la = lla_lookup(lt, LLE_EXCLUSIVE, (struct sockaddr *)dst);
457 IF_AFDATA_RUNLOCK(ifp);
465 if ((ifp->if_flags & (IFF_NOARP | IFF_STATICARP)) == 0) {
466 la = lltable_alloc_entry(lt, 0, (struct sockaddr *)dst);
469 IF_AFDATA_WLOCK(ifp);
471 /* Prefer any existing LLE over newly-created one */
472 la_tmp = lla_lookup(lt, LLE_EXCLUSIVE, (struct sockaddr *)dst);
474 lltable_link_entry(lt, la);
475 IF_AFDATA_WUNLOCK(ifp);
476 if (la_tmp != NULL) {
477 lltable_free_entry(lt, la);
488 * Free all entries from given table and free itself.
492 lltable_free_cb(struct lltable *llt, struct llentry *lle, void *farg)
494 struct llentries *dchain;
496 dchain = (struct llentries *)farg;
499 CK_LIST_INSERT_HEAD(dchain, lle, lle_chain);
505 * Free all entries from given table and free itself.
508 lltable_free(struct lltable *llt)
510 struct llentry *lle, *next;
511 struct llentries dchain;
513 KASSERT(llt != NULL, ("%s: llt is NULL", __func__));
517 CK_LIST_INIT(&dchain);
518 IF_AFDATA_WLOCK(llt->llt_ifp);
519 /* Push all lles to @dchain */
520 lltable_foreach_lle(llt, lltable_free_cb, &dchain);
521 llentries_unlink(llt, &dchain);
522 IF_AFDATA_WUNLOCK(llt->llt_ifp);
524 CK_LIST_FOREACH_SAFE(lle, &dchain, lle_chain, next) {
525 if (callout_stop(&lle->lle_timer) > 0)
530 llt->llt_free_tbl(llt);
535 lltable_drain(int af)
541 LLTABLE_LIST_RLOCK();
542 SLIST_FOREACH(llt, &V_lltables, llt_link) {
543 if (llt->llt_af != af)
546 for (i=0; i < llt->llt_hsize; i++) {
547 CK_LIST_FOREACH(lle, &llt->lle_head[i], lle_next) {
550 m_freem(lle->la_hold);
557 LLTABLE_LIST_RUNLOCK();
562 * Deletes an address from given lltable.
563 * Used for userland interaction to remove
564 * individual entries. Skips entries added by OS.
567 lltable_delete_addr(struct lltable *llt, u_int flags,
568 const struct sockaddr *l3addr)
574 IF_AFDATA_WLOCK(ifp);
575 lle = lla_lookup(llt, LLE_EXCLUSIVE, l3addr);
578 IF_AFDATA_WUNLOCK(ifp);
581 if ((lle->la_flags & LLE_IFADDR) != 0 && (flags & LLE_IFADDR) == 0) {
582 IF_AFDATA_WUNLOCK(ifp);
587 lltable_unlink_entry(llt, lle);
588 IF_AFDATA_WUNLOCK(ifp);
590 llt->llt_delete_entry(llt, lle);
596 lltable_prefix_free(int af, struct sockaddr *addr, struct sockaddr *mask,
601 LLTABLE_LIST_RLOCK();
602 SLIST_FOREACH(llt, &V_lltables, llt_link) {
603 if (llt->llt_af != af)
606 llt->llt_prefix_free(llt, addr, mask, flags);
608 LLTABLE_LIST_RUNLOCK();
612 lltable_allocate_htbl(uint32_t hsize)
617 llt = malloc(sizeof(struct lltable), M_LLTABLE, M_WAITOK | M_ZERO);
618 llt->llt_hsize = hsize;
619 llt->lle_head = malloc(sizeof(struct llentries) * hsize,
620 M_LLTABLE, M_WAITOK | M_ZERO);
622 for (i = 0; i < llt->llt_hsize; i++)
623 CK_LIST_INIT(&llt->lle_head[i]);
625 /* Set some default callbacks */
626 llt->llt_link_entry = htable_link_entry;
627 llt->llt_unlink_entry = htable_unlink_entry;
628 llt->llt_prefix_free = htable_prefix_free;
629 llt->llt_foreach_entry = htable_foreach_lle;
630 llt->llt_free_tbl = htable_free_tbl;
636 * Links lltable to global llt list.
639 lltable_link(struct lltable *llt)
642 LLTABLE_LIST_WLOCK();
643 SLIST_INSERT_HEAD(&V_lltables, llt, llt_link);
644 LLTABLE_LIST_WUNLOCK();
648 lltable_unlink(struct lltable *llt)
651 LLTABLE_LIST_WLOCK();
652 SLIST_REMOVE(&V_lltables, llt, lltable, llt_link);
653 LLTABLE_LIST_WUNLOCK();
658 * External methods used by lltable consumers
662 lltable_foreach_lle(struct lltable *llt, llt_foreach_cb_t *f, void *farg)
665 return (llt->llt_foreach_entry(llt, f, farg));
669 lltable_alloc_entry(struct lltable *llt, u_int flags,
670 const struct sockaddr *l3addr)
673 return (llt->llt_alloc_entry(llt, flags, l3addr));
677 lltable_free_entry(struct lltable *llt, struct llentry *lle)
680 llt->llt_free_entry(llt, lle);
684 lltable_link_entry(struct lltable *llt, struct llentry *lle)
687 llt->llt_link_entry(llt, lle);
691 lltable_unlink_entry(struct lltable *llt, struct llentry *lle)
694 llt->llt_unlink_entry(lle);
698 lltable_fill_sa_entry(const struct llentry *lle, struct sockaddr *sa)
703 llt->llt_fill_sa_entry(lle, sa);
707 lltable_get_ifp(const struct lltable *llt)
710 return (llt->llt_ifp);
714 lltable_get_af(const struct lltable *llt)
717 return (llt->llt_af);
721 * Called in route_output when rtm_flags contains RTF_LLDATA.
724 lla_rt_output(struct rt_msghdr *rtm, struct rt_addrinfo *info)
726 struct sockaddr_dl *dl =
727 (struct sockaddr_dl *)info->rti_info[RTAX_GATEWAY];
728 struct sockaddr *dst = (struct sockaddr *)info->rti_info[RTAX_DST];
731 struct llentry *lle, *lle_tmp;
732 uint8_t linkhdr[LLE_MAX_LINKHDR];
738 KASSERT(dl != NULL && dl->sdl_family == AF_LINK,
739 ("%s: invalid dl\n", __func__));
741 ifp = ifnet_byindex(dl->sdl_index);
743 log(LOG_INFO, "%s: invalid ifp (sdl_index %d)\n",
744 __func__, dl->sdl_index);
748 /* XXX linked list may be too expensive */
749 LLTABLE_LIST_RLOCK();
750 SLIST_FOREACH(llt, &V_lltables, llt_link) {
751 if (llt->llt_af == dst->sa_family &&
755 LLTABLE_LIST_RUNLOCK();
756 KASSERT(llt != NULL, ("Yep, ugly hacks are bad\n"));
760 switch (rtm->rtm_type) {
764 if (rtm->rtm_rmx.rmx_expire == 0)
765 laflags = LLE_STATIC;
766 lle = lltable_alloc_entry(llt, laflags, dst);
770 linkhdrsize = sizeof(linkhdr);
771 if (lltable_calc_llheader(ifp, dst->sa_family, LLADDR(dl),
772 linkhdr, &linkhdrsize, &lladdr_off) != 0)
774 lltable_set_entry_addr(ifp, lle, linkhdr, linkhdrsize,
776 if ((rtm->rtm_flags & RTF_ANNOUNCE))
777 lle->la_flags |= LLE_PUB;
778 lle->la_expire = rtm->rtm_rmx.rmx_expire;
780 laflags = lle->la_flags;
782 /* Try to link new entry */
784 IF_AFDATA_WLOCK(ifp);
786 lle_tmp = lla_lookup(llt, LLE_EXCLUSIVE, dst);
787 if (lle_tmp != NULL) {
788 /* Check if we are trying to replace immutable entry */
789 if ((lle_tmp->la_flags & LLE_IFADDR) != 0) {
790 IF_AFDATA_WUNLOCK(ifp);
791 LLE_WUNLOCK(lle_tmp);
792 lltable_free_entry(llt, lle);
795 /* Unlink existing entry from table */
796 lltable_unlink_entry(llt, lle_tmp);
798 lltable_link_entry(llt, lle);
799 IF_AFDATA_WUNLOCK(ifp);
801 if (lle_tmp != NULL) {
802 EVENTHANDLER_INVOKE(lle_event, lle_tmp,LLENTRY_EXPIRED);
803 lltable_free_entry(llt, lle_tmp);
807 * By invoking LLE handler here we might get
808 * two events on static LLE entry insertion
809 * in routing socket. However, since we might have
810 * other subscribers we need to generate this event.
812 EVENTHANDLER_INVOKE(lle_event, lle, LLENTRY_RESOLVED);
816 if ((laflags & LLE_PUB) && dst->sa_family == AF_INET)
818 &((struct sockaddr_in *)dst)->sin_addr,
819 &((struct sockaddr_in *)dst)->sin_addr,
820 (u_char *)LLADDR(dl));
826 return (lltable_delete_addr(llt, 0, dst));
838 struct sockaddr l3_addr;
842 llatbl_lle_show(struct llentry_sa *la)
848 db_printf("lle=%p\n", lle);
849 db_printf(" lle_next=%p\n", lle->lle_next.cle_next);
850 db_printf(" lle_lock=%p\n", &lle->lle_lock);
851 db_printf(" lle_tbl=%p\n", lle->lle_tbl);
852 db_printf(" lle_head=%p\n", lle->lle_head);
853 db_printf(" la_hold=%p\n", lle->la_hold);
854 db_printf(" la_numheld=%d\n", lle->la_numheld);
855 db_printf(" la_expire=%ju\n", (uintmax_t)lle->la_expire);
856 db_printf(" la_flags=0x%04x\n", lle->la_flags);
857 db_printf(" la_asked=%u\n", lle->la_asked);
858 db_printf(" la_preempt=%u\n", lle->la_preempt);
859 db_printf(" ln_state=%d\n", lle->ln_state);
860 db_printf(" ln_router=%u\n", lle->ln_router);
861 db_printf(" ln_ntick=%ju\n", (uintmax_t)lle->ln_ntick);
862 db_printf(" lle_refcnt=%d\n", lle->lle_refcnt);
863 bcopy(lle->ll_addr, octet, sizeof(octet));
864 db_printf(" ll_addr=%02x:%02x:%02x:%02x:%02x:%02x\n",
865 octet[0], octet[1], octet[2], octet[3], octet[4], octet[5]);
866 db_printf(" lle_timer=%p\n", &lle->lle_timer);
868 switch (la->l3_addr.sa_family) {
872 struct sockaddr_in *sin;
873 char l3s[INET_ADDRSTRLEN];
875 sin = (struct sockaddr_in *)&la->l3_addr;
876 inet_ntoa_r(sin->sin_addr, l3s);
877 db_printf(" l3_addr=%s\n", l3s);
884 struct sockaddr_in6 *sin6;
885 char l3s[INET6_ADDRSTRLEN];
887 sin6 = (struct sockaddr_in6 *)&la->l3_addr;
888 ip6_sprintf(l3s, &sin6->sin6_addr);
889 db_printf(" l3_addr=%s\n", l3s);
894 db_printf(" l3_addr=N/A (af=%d)\n", la->l3_addr.sa_family);
899 DB_SHOW_COMMAND(llentry, db_show_llentry)
903 db_printf("usage: show llentry <struct llentry *>\n");
907 llatbl_lle_show((struct llentry_sa *)addr);
911 llatbl_llt_show(struct lltable *llt)
916 db_printf("llt=%p llt_af=%d llt_ifp=%p\n",
917 llt, llt->llt_af, llt->llt_ifp);
919 for (i = 0; i < llt->llt_hsize; i++) {
920 CK_LIST_FOREACH(lle, &llt->lle_head[i], lle_next) {
922 llatbl_lle_show((struct llentry_sa *)lle);
929 DB_SHOW_COMMAND(lltable, db_show_lltable)
933 db_printf("usage: show lltable <struct lltable *>\n");
937 llatbl_llt_show((struct lltable *)addr);
940 DB_SHOW_ALL_COMMAND(lltables, db_show_all_lltables)
942 VNET_ITERATOR_DECL(vnet_iter);
945 VNET_FOREACH(vnet_iter) {
946 CURVNET_SET_QUIET(vnet_iter);
948 db_printf("vnet=%p\n", curvnet);
950 SLIST_FOREACH(llt, &V_lltables, llt_link) {
951 db_printf("llt=%p llt_af=%d llt_ifp=%p(%s)\n",
952 llt, llt->llt_af, llt->llt_ifp,
953 (llt->llt_ifp != NULL) ?
954 llt->llt_ifp->if_xname : "?");
955 if (have_addr && addr != 0) /* verbose */
956 llatbl_llt_show(llt);