2 * SPDX-License-Identifier: BSD-2-Clause
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/eventhandler.h>
39 #include <sys/malloc.h>
41 #include <sys/syslog.h>
42 #include <sys/sysctl.h>
43 #include <sys/socket.h>
44 #include <sys/kernel.h>
46 #include <sys/mutex.h>
47 #include <sys/rwlock.h>
55 #include <netinet/in.h>
56 #include <net/if_llatbl.h>
58 #include <net/if_dl.h>
59 #include <net/if_var.h>
60 #include <net/if_private.h>
61 #include <net/route.h>
62 #include <net/route/route_ctl.h>
63 #include <net/route/route_debug.h>
65 #include <netinet/if_ether.h>
66 #include <netinet6/in6_var.h>
67 #include <netinet6/nd6.h>
69 MALLOC_DEFINE(M_LLTABLE, "lltable", "link level address tables");
71 VNET_DEFINE_STATIC(SLIST_HEAD(, lltable), lltables) =
72 SLIST_HEAD_INITIALIZER(lltables);
73 #define V_lltables VNET(lltables)
75 static struct rwlock lltable_list_lock;
76 RW_SYSINIT(lltable_list_lock, &lltable_list_lock, "lltable_list_lock");
77 #define LLTABLE_LIST_RLOCK() rw_rlock(&lltable_list_lock)
78 #define LLTABLE_LIST_RUNLOCK() rw_runlock(&lltable_list_lock)
79 #define LLTABLE_LIST_WLOCK() rw_wlock(&lltable_list_lock)
80 #define LLTABLE_LIST_WUNLOCK() rw_wunlock(&lltable_list_lock)
81 #define LLTABLE_LIST_LOCK_ASSERT() rw_assert(&lltable_list_lock, RA_LOCKED)
83 static void lltable_unlink(struct lltable *llt);
84 static void llentries_unlink(struct lltable *llt, struct llentries *head);
87 * Dump lle state for a specific address family.
90 lltable_dump_af(struct lltable *llt, struct sysctl_req *wr)
92 struct epoch_tracker et;
95 LLTABLE_LIST_LOCK_ASSERT();
97 if (llt->llt_ifp->if_flags & IFF_LOOPBACK)
102 error = lltable_foreach_lle(llt,
103 (llt_foreach_cb_t *)llt->llt_dump_entry, wr);
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 * Adds a mbuf to hold queue. Drops old packets if the queue is full.
134 * Returns the number of held packets that were dropped.
137 lltable_append_entry_queue(struct llentry *lle, struct mbuf *m,
140 size_t pkts_dropped = 0;
142 LLE_WLOCK_ASSERT(lle);
144 while (lle->la_numheld >= maxheld && lle->la_hold != NULL) {
145 struct mbuf *next = lle->la_hold->m_nextpkt;
146 m_freem(lle->la_hold);
152 if (lle->la_hold != NULL) {
153 struct mbuf *curr = lle->la_hold;
154 while (curr->m_nextpkt != NULL)
155 curr = curr->m_nextpkt;
167 * Common function helpers for chained hash table.
171 * Runs specified callback for each entry in @llt.
172 * Caller does the locking.
176 htable_foreach_lle(struct lltable *llt, llt_foreach_cb_t *f, void *farg)
178 struct llentry *lle, *next;
183 for (i = 0; i < llt->llt_hsize; i++) {
184 CK_LIST_FOREACH_SAFE(lle, &llt->lle_head[i], lle_next, next) {
185 error = f(llt, lle, farg);
195 * The htable_[un]link_entry() functions return:
196 * 0 if the entry was (un)linked already and nothing changed,
197 * 1 if the entry was added/removed to/from the table, and
198 * -1 on error (e.g., not being able to add the entry due to limits reached).
199 * While the "unlink" operation should never error, callers of
200 * lltable_link_entry() need to check for errors and handle them.
203 htable_link_entry(struct lltable *llt, struct llentry *lle)
205 struct llentries *lleh;
208 if ((lle->la_flags & LLE_LINKED) != 0)
211 IF_AFDATA_WLOCK_ASSERT(llt->llt_ifp);
213 if (llt->llt_maxentries > 0 &&
214 llt->llt_entries >= llt->llt_maxentries)
217 hashidx = llt->llt_hash(lle, llt->llt_hsize);
218 lleh = &llt->lle_head[hashidx];
221 lle->lle_head = lleh;
222 lle->la_flags |= LLE_LINKED;
223 CK_LIST_INSERT_HEAD(lleh, lle, lle_next);
230 htable_unlink_entry(struct llentry *lle)
234 if ((lle->la_flags & LLE_LINKED) == 0)
238 IF_AFDATA_WLOCK_ASSERT(llt->llt_ifp);
239 KASSERT(llt->llt_entries > 0, ("%s: lltable %p (%s) entries %d <= 0",
240 __func__, llt, if_name(llt->llt_ifp), llt->llt_entries));
242 CK_LIST_REMOVE(lle, lle_next);
243 lle->la_flags &= ~(LLE_VALID | LLE_LINKED);
246 lle->lle_head = NULL;
253 struct prefix_match_data {
254 const struct sockaddr *addr;
255 const struct sockaddr *mask;
256 struct llentries dchain;
261 htable_prefix_free_cb(struct lltable *llt, struct llentry *lle, void *farg)
263 struct prefix_match_data *pmd;
265 pmd = (struct prefix_match_data *)farg;
267 if (llt->llt_match_prefix(pmd->addr, pmd->mask, pmd->flags, lle)) {
269 CK_LIST_INSERT_HEAD(&pmd->dchain, lle, lle_chain);
276 htable_prefix_free(struct lltable *llt, const struct sockaddr *addr,
277 const struct sockaddr *mask, u_int flags)
279 struct llentry *lle, *next;
280 struct prefix_match_data pmd;
282 bzero(&pmd, sizeof(pmd));
286 CK_LIST_INIT(&pmd.dchain);
288 IF_AFDATA_WLOCK(llt->llt_ifp);
289 /* Push matching lles to chain */
290 lltable_foreach_lle(llt, htable_prefix_free_cb, &pmd);
292 llentries_unlink(llt, &pmd.dchain);
293 IF_AFDATA_WUNLOCK(llt->llt_ifp);
295 CK_LIST_FOREACH_SAFE(lle, &pmd.dchain, lle_chain, next)
296 lltable_free_entry(llt, lle);
300 htable_free_tbl(struct lltable *llt)
303 free(llt->lle_head, M_LLTABLE);
304 free(llt, M_LLTABLE);
308 llentries_unlink(struct lltable *llt, struct llentries *head)
310 struct llentry *lle, *next;
312 CK_LIST_FOREACH_SAFE(lle, head, lle_chain, next)
313 llt->llt_unlink_entry(lle);
317 * Helper function used to drop all mbufs in hold queue.
319 * Returns the number of held packets, if any, that were dropped.
322 lltable_drop_entry_queue(struct llentry *lle)
324 size_t pkts_dropped = 0;
326 LLE_WLOCK_ASSERT(lle);
328 while (lle->la_hold != NULL) {
329 struct mbuf *next = lle->la_hold->m_nextpkt;
330 m_freem(lle->la_hold);
336 KASSERT(lle->la_numheld == 0,
337 ("%s: la_numheld %d > 0, pkts_dropped %zd", __func__,
338 lle->la_numheld, pkts_dropped));
340 return (pkts_dropped);
344 lltable_set_entry_addr(struct ifnet *ifp, struct llentry *lle,
345 const char *linkhdr, size_t linkhdrsize, int lladdr_off)
348 memcpy(lle->r_linkdata, linkhdr, linkhdrsize);
349 lle->r_hdrlen = linkhdrsize;
350 lle->ll_addr = &lle->r_linkdata[lladdr_off];
351 lle->la_flags |= LLE_VALID;
352 lle->r_flags |= RLLE_VALID;
356 * Acquires lltable write lock.
358 * Returns true on success, with both lltable and lle lock held.
359 * On failure, false is returned and lle wlock is still held.
362 lltable_acquire_wlock(struct ifnet *ifp, struct llentry *lle)
366 /* Perform real LLE update */
367 /* use afdata WLOCK to update fields */
369 IF_AFDATA_WLOCK(ifp);
373 * Since we droppped LLE lock, other thread might have deleted
374 * this lle. Check and return
376 if ((lle->la_flags & LLE_DELETED) != 0) {
377 IF_AFDATA_WUNLOCK(ifp);
385 * Tries to update @lle link-level address.
386 * Since update requires AFDATA WLOCK, function
387 * drops @lle lock, acquires AFDATA lock and then acquires
388 * @lle lock to maintain lock order.
390 * Returns 1 on success.
393 lltable_try_set_entry_addr(struct ifnet *ifp, struct llentry *lle,
394 const char *linkhdr, size_t linkhdrsize, int lladdr_off)
397 if (!lltable_acquire_wlock(ifp, lle))
401 lltable_set_entry_addr(ifp, lle, linkhdr, linkhdrsize, lladdr_off);
403 IF_AFDATA_WUNLOCK(ifp);
409 * Helper function used to pre-compute full/partial link-layer
410 * header data suitable for feeding into if_output().
413 lltable_calc_llheader(struct ifnet *ifp, int family, char *lladdr,
414 char *buf, size_t *bufsize, int *lladdr_off)
416 struct if_encap_req ereq;
419 bzero(buf, *bufsize);
420 bzero(&ereq, sizeof(ereq));
422 ereq.bufsize = *bufsize;
423 ereq.rtype = IFENCAP_LL;
424 ereq.family = family;
425 ereq.lladdr = lladdr;
426 ereq.lladdr_len = ifp->if_addrlen;
427 error = ifp->if_requestencap(ifp, &ereq);
429 *bufsize = ereq.bufsize;
430 *lladdr_off = ereq.lladdr_off;
437 * Searches for the child entry matching @family inside @lle.
438 * Returns the entry or NULL.
441 llentry_lookup_family(struct llentry *lle, int family)
443 struct llentry *child_lle;
448 CK_SLIST_FOREACH(child_lle, &lle->lle_children, lle_child_next) {
449 if (child_lle->r_family == family)
457 * Retrieves upper protocol family for the llentry.
458 * By default, all "normal" (e.g. upper_family == transport_family)
459 * llentries have r_family set to 0.
460 * Thus, use @default_family in that regard, otherwise use r_family.
462 * Returns upper protocol family
465 llentry_get_upper_family(const struct llentry *lle, int default_family)
467 return (lle->r_family == 0 ? default_family : lle->r_family);
471 * Prints llentry @lle data into provided buffer.
472 * Example: lle/inet/valid/em0/1.2.3.4
477 llentry_print_buf(const struct llentry *lle, struct ifnet *ifp, int family,
478 char *buf, size_t bufsize)
480 #if defined(INET) || defined(INET6)
481 char abuf[INET6_ADDRSTRLEN];
484 const char *valid = (lle->r_flags & RLLE_VALID) ? "valid" : "no_l2";
485 const char *upper_str = rib_print_family(llentry_get_upper_family(lle, family));
490 inet_ntop(AF_INET, &lle->r_l3addr.addr4, abuf, sizeof(abuf));
491 snprintf(buf, bufsize, "lle/%s/%s/%s/%s", upper_str,
492 valid, if_name(ifp), abuf);
497 inet_ntop(AF_INET6, &lle->r_l3addr.addr6, abuf, sizeof(abuf));
498 snprintf(buf, bufsize, "lle/%s/%s/%s/%s", upper_str,
499 valid, if_name(ifp), abuf);
503 snprintf(buf, bufsize, "lle/%s/%s/%s/????", upper_str,
504 valid, if_name(ifp));
512 llentry_print_buf_lltable(const struct llentry *lle, char *buf, size_t bufsize)
514 struct lltable *tbl = lle->lle_tbl;
516 return (llentry_print_buf(lle, lltable_get_ifp(tbl), lltable_get_af(tbl), buf, bufsize));
520 * Requests feedback from the datapath.
521 * First packet using @lle should result in
522 * setting r_skip_req back to 0 and updating
523 * lle_hittime to the current time_uptime.
526 llentry_request_feedback(struct llentry *lle)
528 struct llentry *child_lle;
534 CK_SLIST_FOREACH(child_lle, &lle->lle_children, lle_child_next) {
535 LLE_REQ_LOCK(child_lle);
536 child_lle->r_skip_req = 1;
537 LLE_REQ_UNLOCK(child_lle);
542 * Updates the lle state to mark it has been used
543 * and record the time.
544 * Used by the llentry_provide_feedback() wrapper.
547 llentry_mark_used(struct llentry *lle)
551 lle->lle_hittime = time_uptime;
556 * Fetches the time when lle was used.
557 * Return 0 if the entry was not used, relevant time_uptime
561 llentry_get_hittime_raw(struct llentry *lle)
563 time_t lle_hittime = 0;
566 if ((lle->r_skip_req == 0) && (lle_hittime < lle->lle_hittime))
567 lle_hittime = lle->lle_hittime;
570 return (lle_hittime);
574 llentry_get_hittime(struct llentry *lle)
576 time_t lle_hittime = 0;
577 struct llentry *child_lle;
579 lle_hittime = llentry_get_hittime_raw(lle);
581 CK_SLIST_FOREACH(child_lle, &lle->lle_children, lle_child_next) {
582 time_t hittime = llentry_get_hittime_raw(child_lle);
583 if (hittime > lle_hittime)
584 lle_hittime = hittime;
587 return (lle_hittime);
591 * Update link-layer header for given @lle after
592 * interface lladdr was changed.
595 llentry_update_ifaddr(struct lltable *llt, struct llentry *lle, void *farg)
598 u_char linkhdr[LLE_MAX_LINKHDR];
603 ifp = (struct ifnet *)farg;
605 lladdr = lle->ll_addr;
608 if ((lle->la_flags & LLE_VALID) == 0) {
613 if ((lle->la_flags & LLE_IFADDR) != 0)
614 lladdr = IF_LLADDR(ifp);
616 linkhdrsize = sizeof(linkhdr);
617 lltable_calc_llheader(ifp, llt->llt_af, lladdr, linkhdr, &linkhdrsize,
619 memcpy(lle->r_linkdata, linkhdr, linkhdrsize);
626 * Update all calculated headers for given @llt
629 lltable_update_ifaddr(struct lltable *llt)
632 if (llt->llt_ifp->if_flags & IFF_LOOPBACK)
635 IF_AFDATA_WLOCK(llt->llt_ifp);
636 lltable_foreach_lle(llt, llentry_update_ifaddr, llt->llt_ifp);
637 IF_AFDATA_WUNLOCK(llt->llt_ifp);
642 * Performs generic cleanup routines and frees lle.
644 * Called for non-linked entries, with callouts and
645 * other AF-specific cleanups performed.
647 * @lle must be passed WLOCK'ed
649 * Returns the number of held packets, if any, that were dropped.
652 llentry_free(struct llentry *lle)
656 LLE_WLOCK_ASSERT(lle);
658 KASSERT((lle->la_flags & LLE_LINKED) == 0, ("freeing linked lle"));
660 pkts_dropped = lltable_drop_entry_queue(lle);
663 if (callout_stop(&lle->lle_timer) > 0)
665 LLE_FREE_LOCKED(lle);
667 return (pkts_dropped);
671 * Free all entries from given table and free itself.
675 lltable_free_cb(struct lltable *llt, struct llentry *lle, void *farg)
677 struct llentries *dchain;
679 dchain = (struct llentries *)farg;
682 CK_LIST_INSERT_HEAD(dchain, lle, lle_chain);
688 * Free all entries from given table and free itself.
691 lltable_free(struct lltable *llt)
693 struct llentry *lle, *next;
694 struct llentries dchain;
696 KASSERT(llt != NULL, ("%s: llt is NULL", __func__));
700 CK_LIST_INIT(&dchain);
701 IF_AFDATA_WLOCK(llt->llt_ifp);
702 /* Push all lles to @dchain */
703 lltable_foreach_lle(llt, lltable_free_cb, &dchain);
704 llentries_unlink(llt, &dchain);
705 IF_AFDATA_WUNLOCK(llt->llt_ifp);
707 CK_LIST_FOREACH_SAFE(lle, &dchain, lle_chain, next) {
711 KASSERT(llt->llt_entries == 0, ("%s: lltable %p (%s) entires not 0: %d",
712 __func__, llt, llt->llt_ifp->if_xname, llt->llt_entries));
714 llt->llt_free_tbl(llt);
718 * Deletes an address from given lltable.
719 * Used for userland interaction to remove
720 * individual entries. Skips entries added by OS.
723 lltable_delete_addr(struct lltable *llt, u_int flags,
724 const struct sockaddr *l3addr)
730 IF_AFDATA_WLOCK(ifp);
731 lle = lla_lookup(llt, LLE_SF(l3addr->sa_family, LLE_EXCLUSIVE), l3addr);
734 IF_AFDATA_WUNLOCK(ifp);
737 if ((lle->la_flags & LLE_IFADDR) != 0 && (flags & LLE_IFADDR) == 0) {
738 IF_AFDATA_WUNLOCK(ifp);
743 lltable_unlink_entry(llt, lle);
744 IF_AFDATA_WUNLOCK(ifp);
746 llt->llt_delete_entry(llt, lle);
752 lltable_prefix_free(int af, struct sockaddr *addr, struct sockaddr *mask,
757 LLTABLE_LIST_RLOCK();
758 SLIST_FOREACH(llt, &V_lltables, llt_link) {
759 if (llt->llt_af != af)
762 llt->llt_prefix_free(llt, addr, mask, flags);
764 LLTABLE_LIST_RUNLOCK();
768 * Delete llentries that func() returns true.
770 struct lle_match_data {
771 struct llentries dchain;
772 llt_match_cb_t *func;
777 lltable_delete_conditional_cb(struct lltable *llt, struct llentry *lle,
780 struct lle_match_data *lmd;
782 lmd = (struct lle_match_data *)farg;
783 if (lmd->func(llt, lle, lmd->farg)) {
785 CK_LIST_INSERT_HEAD(&lmd->dchain, lle, lle_chain);
792 lltable_delete_conditional(struct lltable *llt, llt_match_cb_t *func,
795 struct llentry *lle, *next;
796 struct lle_match_data lmd;
798 bzero(&lmd, sizeof(lmd));
799 CK_LIST_INIT(&lmd.dchain);
803 IF_AFDATA_WLOCK(llt->llt_ifp);
804 lltable_foreach_lle(llt, lltable_delete_conditional_cb, &lmd);
805 llentries_unlink(llt, &lmd.dchain);
806 IF_AFDATA_WUNLOCK(llt->llt_ifp);
808 CK_LIST_FOREACH_SAFE(lle, &lmd.dchain, lle_chain, next)
809 llt->llt_delete_entry(llt, lle);
813 lltable_allocate_htbl(uint32_t hsize)
818 llt = malloc(sizeof(struct lltable), M_LLTABLE, M_WAITOK | M_ZERO);
819 llt->llt_hsize = hsize;
820 llt->lle_head = malloc(sizeof(struct llentries) * hsize,
821 M_LLTABLE, M_WAITOK | M_ZERO);
823 for (i = 0; i < llt->llt_hsize; i++)
824 CK_LIST_INIT(&llt->lle_head[i]);
826 /* Set some default callbacks */
827 llt->llt_link_entry = htable_link_entry;
828 llt->llt_unlink_entry = htable_unlink_entry;
829 llt->llt_prefix_free = htable_prefix_free;
830 llt->llt_foreach_entry = htable_foreach_lle;
831 llt->llt_free_tbl = htable_free_tbl;
837 * Links lltable to global llt list.
840 lltable_link(struct lltable *llt)
843 LLTABLE_LIST_WLOCK();
844 SLIST_INSERT_HEAD(&V_lltables, llt, llt_link);
845 LLTABLE_LIST_WUNLOCK();
849 lltable_unlink(struct lltable *llt)
852 LLTABLE_LIST_WLOCK();
853 SLIST_REMOVE(&V_lltables, llt, lltable, llt_link);
854 LLTABLE_LIST_WUNLOCK();
859 * Gets interface @ifp lltable for the specified @family
862 lltable_get(struct ifnet *ifp, int family)
867 return (in_lltable_get(ifp));
871 return (in6_lltable_get(ifp));
879 * External methods used by lltable consumers
883 lltable_foreach_lle(struct lltable *llt, llt_foreach_cb_t *f, void *farg)
886 return (llt->llt_foreach_entry(llt, f, farg));
890 lltable_alloc_entry(struct lltable *llt, u_int flags,
891 const struct sockaddr *l3addr)
894 return (llt->llt_alloc_entry(llt, flags, l3addr));
898 lltable_free_entry(struct lltable *llt, struct llentry *lle)
901 llt->llt_free_entry(llt, lle);
905 lltable_link_entry(struct lltable *llt, struct llentry *lle)
907 int error = llt->llt_link_entry(llt, lle);
909 if (error == 0 && (lle->la_flags & LLE_PUB) != 0)
910 llt->llt_flags |= LLT_ADDEDPROXY;
916 lltable_link_child_entry(struct llentry *lle, struct llentry *child_lle)
918 child_lle->lle_parent = lle;
919 child_lle->lle_tbl = lle->lle_tbl;
920 child_lle->la_flags |= LLE_LINKED;
921 CK_SLIST_INSERT_HEAD(&lle->lle_children, child_lle, lle_child_next);
925 lltable_unlink_child_entry(struct llentry *child_lle)
927 struct llentry *lle = child_lle->lle_parent;
929 child_lle->la_flags &= ~LLE_LINKED;
930 child_lle->lle_parent = NULL;
931 CK_SLIST_REMOVE(&lle->lle_children, child_lle, llentry, lle_child_next);
935 lltable_unlink_entry(struct lltable *llt, struct llentry *lle)
938 return (llt->llt_unlink_entry(lle));
942 lltable_fill_sa_entry(const struct llentry *lle, struct sockaddr *sa)
947 llt->llt_fill_sa_entry(lle, sa);
951 lltable_get_ifp(const struct lltable *llt)
954 return (llt->llt_ifp);
958 lltable_get_af(const struct lltable *llt)
961 return (llt->llt_af);
965 * Called in route_output when rtm_flags contains RTF_LLDATA.
968 lla_rt_output(struct rt_msghdr *rtm, struct rt_addrinfo *info)
970 struct sockaddr_dl *dl =
971 (struct sockaddr_dl *)info->rti_info[RTAX_GATEWAY];
972 struct sockaddr *dst = (struct sockaddr *)info->rti_info[RTAX_DST];
975 struct llentry *lle, *lle_tmp;
976 uint8_t linkhdr[LLE_MAX_LINKHDR];
982 if (dl == NULL || dl->sdl_family != AF_LINK)
985 /* XXX: should be ntohs() */
986 ifp = ifnet_byindex(dl->sdl_index);
988 log(LOG_INFO, "%s: invalid ifp (sdl_index %d)\n",
989 __func__, dl->sdl_index);
993 llt = lltable_get(ifp, dst->sa_family);
1000 switch (rtm->rtm_type) {
1002 /* Add static LLE */
1004 if (rtm->rtm_rmx.rmx_expire == 0)
1005 laflags = LLE_STATIC;
1006 lle = lltable_alloc_entry(llt, laflags, dst);
1010 linkhdrsize = sizeof(linkhdr);
1011 if (lltable_calc_llheader(ifp, dst->sa_family, LLADDR(dl),
1012 linkhdr, &linkhdrsize, &lladdr_off) != 0) {
1013 lltable_free_entry(llt, lle);
1016 lltable_set_entry_addr(ifp, lle, linkhdr, linkhdrsize,
1018 if ((rtm->rtm_flags & RTF_ANNOUNCE))
1019 lle->la_flags |= LLE_PUB;
1020 lle->la_expire = rtm->rtm_rmx.rmx_expire;
1022 laflags = lle->la_flags;
1024 /* Try to link new entry */
1026 IF_AFDATA_WLOCK(ifp);
1028 lle_tmp = lla_lookup(llt, LLE_EXCLUSIVE, dst);
1029 if (lle_tmp != NULL) {
1030 /* Check if we are trying to replace immutable entry */
1031 if ((lle_tmp->la_flags & LLE_IFADDR) != 0) {
1032 IF_AFDATA_WUNLOCK(ifp);
1033 LLE_WUNLOCK(lle_tmp);
1034 lltable_free_entry(llt, lle);
1037 /* Unlink existing entry from table */
1038 lltable_unlink_entry(llt, lle_tmp);
1040 lltable_link_entry(llt, lle);
1041 IF_AFDATA_WUNLOCK(ifp);
1043 if (lle_tmp != NULL) {
1044 EVENTHANDLER_INVOKE(lle_event, lle_tmp,LLENTRY_EXPIRED);
1045 lltable_free_entry(llt, lle_tmp);
1049 * By invoking LLE handler here we might get
1050 * two events on static LLE entry insertion
1051 * in routing socket. However, since we might have
1052 * other subscribers we need to generate this event.
1054 EVENTHANDLER_INVOKE(lle_event, lle, LLENTRY_RESOLVED);
1056 llt->llt_post_resolved(llt, lle);
1060 return (lltable_delete_addr(llt, 0, dst));
1071 struct llentry base;
1072 struct sockaddr l3_addr;
1076 llatbl_lle_show(struct llentry_sa *la)
1078 struct llentry *lle;
1082 db_printf("lle=%p\n", lle);
1083 db_printf(" lle_next=%p\n", lle->lle_next.cle_next);
1084 db_printf(" lle_lock=%p\n", &lle->lle_lock);
1085 db_printf(" lle_tbl=%p\n", lle->lle_tbl);
1086 db_printf(" lle_head=%p\n", lle->lle_head);
1087 db_printf(" la_hold=%p\n", lle->la_hold);
1088 db_printf(" la_numheld=%d\n", lle->la_numheld);
1089 db_printf(" la_expire=%ju\n", (uintmax_t)lle->la_expire);
1090 db_printf(" la_flags=0x%04x\n", lle->la_flags);
1091 db_printf(" la_asked=%u\n", lle->la_asked);
1092 db_printf(" la_preempt=%u\n", lle->la_preempt);
1093 db_printf(" ln_state=%d\n", lle->ln_state);
1094 db_printf(" ln_router=%u\n", lle->ln_router);
1095 db_printf(" ln_ntick=%ju\n", (uintmax_t)lle->ln_ntick);
1096 db_printf(" lle_refcnt=%d\n", lle->lle_refcnt);
1097 bcopy(lle->ll_addr, octet, sizeof(octet));
1098 db_printf(" ll_addr=%02x:%02x:%02x:%02x:%02x:%02x\n",
1099 octet[0], octet[1], octet[2], octet[3], octet[4], octet[5]);
1100 db_printf(" lle_timer=%p\n", &lle->lle_timer);
1102 switch (la->l3_addr.sa_family) {
1106 struct sockaddr_in *sin;
1107 char l3s[INET_ADDRSTRLEN];
1109 sin = (struct sockaddr_in *)&la->l3_addr;
1110 inet_ntoa_r(sin->sin_addr, l3s);
1111 db_printf(" l3_addr=%s\n", l3s);
1118 struct sockaddr_in6 *sin6;
1119 char l3s[INET6_ADDRSTRLEN];
1121 sin6 = (struct sockaddr_in6 *)&la->l3_addr;
1122 ip6_sprintf(l3s, &sin6->sin6_addr);
1123 db_printf(" l3_addr=%s\n", l3s);
1128 db_printf(" l3_addr=N/A (af=%d)\n", la->l3_addr.sa_family);
1133 DB_SHOW_COMMAND(llentry, db_show_llentry)
1137 db_printf("usage: show llentry <struct llentry *>\n");
1141 llatbl_lle_show((struct llentry_sa *)addr);
1145 llatbl_llt_show(struct lltable *llt)
1148 struct llentry *lle;
1150 db_printf("llt=%p llt_af=%d llt_ifp=%p\n",
1151 llt, llt->llt_af, llt->llt_ifp);
1153 for (i = 0; i < llt->llt_hsize; i++) {
1154 CK_LIST_FOREACH(lle, &llt->lle_head[i], lle_next) {
1155 llatbl_lle_show((struct llentry_sa *)lle);
1162 DB_SHOW_COMMAND(lltable, db_show_lltable)
1166 db_printf("usage: show lltable <struct lltable *>\n");
1170 llatbl_llt_show((struct lltable *)addr);
1173 DB_SHOW_ALL_COMMAND(lltables, db_show_all_lltables)
1175 VNET_ITERATOR_DECL(vnet_iter);
1176 struct lltable *llt;
1178 VNET_FOREACH(vnet_iter) {
1179 CURVNET_SET_QUIET(vnet_iter);
1181 db_printf("vnet=%p\n", curvnet);
1183 SLIST_FOREACH(llt, &V_lltables, llt_link) {
1184 db_printf("llt=%p llt_af=%d llt_ifp=%p(%s)\n",
1185 llt, llt->llt_af, llt->llt_ifp,
1186 (llt->llt_ifp != NULL) ?
1187 llt->llt_ifp->if_xname : "?");
1188 if (have_addr && addr != 0) /* verbose */
1189 llatbl_llt_show(llt);
1190 if (db_pager_quit) {