1 /*-
2 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
3 *
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.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
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.
16 *
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
27 * SUCH DAMAGE.
28 */
29 #include <sys/cdefs.h>
30 __FBSDID("$FreeBSD$");
31
32 #include "opt_ddb.h"
33 #include "opt_inet.h"
34 #include "opt_inet6.h"
35
36 #include <sys/param.h>
37 #include <sys/systm.h>
38 #include <sys/malloc.h>
39 #include <sys/mbuf.h>
40 #include <sys/syslog.h>
41 #include <sys/sysctl.h>
42 #include <sys/socket.h>
43 #include <sys/kernel.h>
44 #include <sys/lock.h>
45 #include <sys/mutex.h>
46 #include <sys/rwlock.h>
47
48 #ifdef DDB
49 #include <ddb/ddb.h>
50 #endif
51
52 #include <vm/uma.h>
53
54 #include <netinet/in.h>
55 #include <net/if_llatbl.h>
56 #include <net/if.h>
57 #include <net/if_dl.h>
58 #include <net/if_var.h>
59 #include <net/route.h>
60 #include <net/vnet.h>
61 #include <netinet/if_ether.h>
62 #include <netinet6/in6_var.h>
63 #include <netinet6/nd6.h>
64
65 MALLOC_DEFINE(M_LLTABLE, "lltable", "link level address tables");
66
67 VNET_DEFINE_STATIC(SLIST_HEAD(, lltable), lltables) =
68 SLIST_HEAD_INITIALIZER(lltables);
69 #define V_lltables VNET(lltables)
70
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)
78
79 static void lltable_unlink(struct lltable *llt);
80 static void llentries_unlink(struct lltable *llt, struct llentries *head);
81
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,
85 void *farg);
86
87 /*
88 * Dump lle state for a specific address family.
89 */
90 static int
lltable_dump_af(struct lltable * llt,struct sysctl_req * wr)91 lltable_dump_af(struct lltable *llt, struct sysctl_req *wr)
92 {
93 int error;
94
95 LLTABLE_LIST_LOCK_ASSERT();
96
97 if (llt->llt_ifp->if_flags & IFF_LOOPBACK)
98 return (0);
99 error = 0;
100
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);
105
106 return (error);
107 }
108
109 /*
110 * Dump arp state for a specific address family.
111 */
112 int
lltable_sysctl_dumparp(int af,struct sysctl_req * wr)113 lltable_sysctl_dumparp(int af, struct sysctl_req *wr)
114 {
115 struct lltable *llt;
116 int error = 0;
117
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);
122 if (error != 0)
123 goto done;
124 }
125 }
126 done:
127 LLTABLE_LIST_RUNLOCK();
128 return (error);
129 }
130
131 /*
132 * Common function helpers for chained hash table.
133 */
134
135 /*
136 * Runs specified callback for each entry in @llt.
137 * Caller does the locking.
138 *
139 */
140 static int
htable_foreach_lle(struct lltable * llt,llt_foreach_cb_t * f,void * farg)141 htable_foreach_lle(struct lltable *llt, llt_foreach_cb_t *f, void *farg)
142 {
143 struct llentry *lle, *next;
144 int i, error;
145
146 error = 0;
147
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);
151 if (error != 0)
152 break;
153 }
154 }
155
156 return (error);
157 }
158
159 static void
htable_link_entry(struct lltable * llt,struct llentry * lle)160 htable_link_entry(struct lltable *llt, struct llentry *lle)
161 {
162 struct llentries *lleh;
163 uint32_t hashidx;
164
165 if ((lle->la_flags & LLE_LINKED) != 0)
166 return;
167
168 IF_AFDATA_WLOCK_ASSERT(llt->llt_ifp);
169
170 hashidx = llt->llt_hash(lle, llt->llt_hsize);
171 lleh = &llt->lle_head[hashidx];
172
173 lle->lle_tbl = llt;
174 lle->lle_head = lleh;
175 lle->la_flags |= LLE_LINKED;
176 CK_LIST_INSERT_HEAD(lleh, lle, lle_next);
177 }
178
179 static void
htable_unlink_entry(struct llentry * lle)180 htable_unlink_entry(struct llentry *lle)
181 {
182
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);
187 #if 0
188 lle->lle_tbl = NULL;
189 lle->lle_head = NULL;
190 #endif
191 }
192 }
193
194 struct prefix_match_data {
195 const struct sockaddr *addr;
196 const struct sockaddr *mask;
197 struct llentries dchain;
198 u_int flags;
199 };
200
201 static int
htable_prefix_free_cb(struct lltable * llt,struct llentry * lle,void * farg)202 htable_prefix_free_cb(struct lltable *llt, struct llentry *lle, void *farg)
203 {
204 struct prefix_match_data *pmd;
205
206 pmd = (struct prefix_match_data *)farg;
207
208 if (llt->llt_match_prefix(pmd->addr, pmd->mask, pmd->flags, lle)) {
209 LLE_WLOCK(lle);
210 CK_LIST_INSERT_HEAD(&pmd->dchain, lle, lle_chain);
211 }
212
213 return (0);
214 }
215
216 static void
htable_prefix_free(struct lltable * llt,const struct sockaddr * addr,const struct sockaddr * mask,u_int flags)217 htable_prefix_free(struct lltable *llt, const struct sockaddr *addr,
218 const struct sockaddr *mask, u_int flags)
219 {
220 struct llentry *lle, *next;
221 struct prefix_match_data pmd;
222
223 bzero(&pmd, sizeof(pmd));
224 pmd.addr = addr;
225 pmd.mask = mask;
226 pmd.flags = flags;
227 CK_LIST_INIT(&pmd.dchain);
228
229 IF_AFDATA_WLOCK(llt->llt_ifp);
230 /* Push matching lles to chain */
231 lltable_foreach_lle(llt, htable_prefix_free_cb, &pmd);
232
233 llentries_unlink(llt, &pmd.dchain);
234 IF_AFDATA_WUNLOCK(llt->llt_ifp);
235
236 CK_LIST_FOREACH_SAFE(lle, &pmd.dchain, lle_chain, next)
237 lltable_free_entry(llt, lle);
238 }
239
240 static void
htable_free_tbl(struct lltable * llt)241 htable_free_tbl(struct lltable *llt)
242 {
243
244 free(llt->lle_head, M_LLTABLE);
245 free(llt, M_LLTABLE);
246 }
247
248 static void
llentries_unlink(struct lltable * llt,struct llentries * head)249 llentries_unlink(struct lltable *llt, struct llentries *head)
250 {
251 struct llentry *lle, *next;
252
253 CK_LIST_FOREACH_SAFE(lle, head, lle_chain, next)
254 llt->llt_unlink_entry(lle);
255 }
256
257 /*
258 * Helper function used to drop all mbufs in hold queue.
259 *
260 * Returns the number of held packets, if any, that were dropped.
261 */
262 size_t
lltable_drop_entry_queue(struct llentry * lle)263 lltable_drop_entry_queue(struct llentry *lle)
264 {
265 size_t pkts_dropped;
266 struct mbuf *next;
267
268 LLE_WLOCK_ASSERT(lle);
269
270 pkts_dropped = 0;
271 while ((lle->la_numheld > 0) && (lle->la_hold != NULL)) {
272 next = lle->la_hold->m_nextpkt;
273 m_freem(lle->la_hold);
274 lle->la_hold = next;
275 lle->la_numheld--;
276 pkts_dropped++;
277 }
278
279 KASSERT(lle->la_numheld == 0,
280 ("%s: la_numheld %d > 0, pkts_droped %zd", __func__,
281 lle->la_numheld, pkts_dropped));
282
283 return (pkts_dropped);
284 }
285
286 void
lltable_set_entry_addr(struct ifnet * ifp,struct llentry * lle,const char * linkhdr,size_t linkhdrsize,int lladdr_off)287 lltable_set_entry_addr(struct ifnet *ifp, struct llentry *lle,
288 const char *linkhdr, size_t linkhdrsize, int lladdr_off)
289 {
290
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;
296 }
297
298 /*
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.
303 *
304 * Returns 1 on success.
305 */
306 int
lltable_try_set_entry_addr(struct ifnet * ifp,struct llentry * lle,const char * linkhdr,size_t linkhdrsize,int lladdr_off)307 lltable_try_set_entry_addr(struct ifnet *ifp, struct llentry *lle,
308 const char *linkhdr, size_t linkhdrsize, int lladdr_off)
309 {
310
311 /* Perform real LLE update */
312 /* use afdata WLOCK to update fields */
313 LLE_WLOCK_ASSERT(lle);
314 LLE_ADDREF(lle);
315 LLE_WUNLOCK(lle);
316 IF_AFDATA_WLOCK(ifp);
317 LLE_WLOCK(lle);
318
319 /*
320 * Since we droppped LLE lock, other thread might have deleted
321 * this lle. Check and return
322 */
323 if ((lle->la_flags & LLE_DELETED) != 0) {
324 IF_AFDATA_WUNLOCK(ifp);
325 LLE_FREE_LOCKED(lle);
326 return (0);
327 }
328
329 /* Update data */
330 lltable_set_entry_addr(ifp, lle, linkhdr, linkhdrsize, lladdr_off);
331
332 IF_AFDATA_WUNLOCK(ifp);
333
334 LLE_REMREF(lle);
335
336 return (1);
337 }
338
339 /*
340 * Helper function used to pre-compute full/partial link-layer
341 * header data suitable for feeding into if_output().
342 */
343 int
lltable_calc_llheader(struct ifnet * ifp,int family,char * lladdr,char * buf,size_t * bufsize,int * lladdr_off)344 lltable_calc_llheader(struct ifnet *ifp, int family, char *lladdr,
345 char *buf, size_t *bufsize, int *lladdr_off)
346 {
347 struct if_encap_req ereq;
348 int error;
349
350 bzero(buf, *bufsize);
351 bzero(&ereq, sizeof(ereq));
352 ereq.buf = buf;
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);
359 if (error == 0) {
360 *bufsize = ereq.bufsize;
361 *lladdr_off = ereq.lladdr_off;
362 }
363
364 return (error);
365 }
366
367 /*
368 * Update link-layer header for given @lle after
369 * interface lladdr was changed.
370 */
371 static int
llentry_update_ifaddr(struct lltable * llt,struct llentry * lle,void * farg)372 llentry_update_ifaddr(struct lltable *llt, struct llentry *lle, void *farg)
373 {
374 struct ifnet *ifp;
375 u_char linkhdr[LLE_MAX_LINKHDR];
376 size_t linkhdrsize;
377 u_char *lladdr;
378 int lladdr_off;
379
380 ifp = (struct ifnet *)farg;
381
382 lladdr = lle->ll_addr;
383
384 LLE_WLOCK(lle);
385 if ((lle->la_flags & LLE_VALID) == 0) {
386 LLE_WUNLOCK(lle);
387 return (0);
388 }
389
390 if ((lle->la_flags & LLE_IFADDR) != 0)
391 lladdr = IF_LLADDR(ifp);
392
393 linkhdrsize = sizeof(linkhdr);
394 lltable_calc_llheader(ifp, llt->llt_af, lladdr, linkhdr, &linkhdrsize,
395 &lladdr_off);
396 memcpy(lle->r_linkdata, linkhdr, linkhdrsize);
397 LLE_WUNLOCK(lle);
398
399 return (0);
400 }
401
402 /*
403 * Update all calculated headers for given @llt
404 */
405 void
lltable_update_ifaddr(struct lltable * llt)406 lltable_update_ifaddr(struct lltable *llt)
407 {
408
409 if (llt->llt_ifp->if_flags & IFF_LOOPBACK)
410 return;
411
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);
415 }
416
417 /*
418 *
419 * Performs generic cleanup routines and frees lle.
420 *
421 * Called for non-linked entries, with callouts and
422 * other AF-specific cleanups performed.
423 *
424 * @lle must be passed WLOCK'ed
425 *
426 * Returns the number of held packets, if any, that were dropped.
427 */
428 size_t
llentry_free(struct llentry * lle)429 llentry_free(struct llentry *lle)
430 {
431 size_t pkts_dropped;
432
433 LLE_WLOCK_ASSERT(lle);
434
435 KASSERT((lle->la_flags & LLE_LINKED) == 0, ("freeing linked lle"));
436
437 pkts_dropped = lltable_drop_entry_queue(lle);
438
439 /* cancel timer */
440 if (callout_stop(&lle->lle_timer) > 0)
441 LLE_REMREF(lle);
442 LLE_FREE_LOCKED(lle);
443
444 return (pkts_dropped);
445 }
446
447 /*
448 * (al)locate an llentry for address dst (equivalent to rtalloc for new-arp).
449 *
450 * If found the llentry * is returned referenced and unlocked.
451 */
452 struct llentry *
llentry_alloc(struct ifnet * ifp,struct lltable * lt,struct sockaddr_storage * dst)453 llentry_alloc(struct ifnet *ifp, struct lltable *lt,
454 struct sockaddr_storage *dst)
455 {
456 struct llentry *la, *la_tmp;
457
458 IF_AFDATA_RLOCK(ifp);
459 la = lla_lookup(lt, LLE_EXCLUSIVE, (struct sockaddr *)dst);
460 IF_AFDATA_RUNLOCK(ifp);
461
462 if (la != NULL) {
463 LLE_ADDREF(la);
464 LLE_WUNLOCK(la);
465 return (la);
466 }
467
468 if ((ifp->if_flags & (IFF_NOARP | IFF_STATICARP)) == 0) {
469 la = lltable_alloc_entry(lt, 0, (struct sockaddr *)dst);
470 if (la == NULL)
471 return (NULL);
472 IF_AFDATA_WLOCK(ifp);
473 LLE_WLOCK(la);
474 /* Prefer any existing LLE over newly-created one */
475 la_tmp = lla_lookup(lt, LLE_EXCLUSIVE, (struct sockaddr *)dst);
476 if (la_tmp == NULL)
477 lltable_link_entry(lt, la);
478 IF_AFDATA_WUNLOCK(ifp);
479 if (la_tmp != NULL) {
480 lltable_free_entry(lt, la);
481 la = la_tmp;
482 }
483 LLE_ADDREF(la);
484 LLE_WUNLOCK(la);
485 }
486
487 return (la);
488 }
489
490 /*
491 * Free all entries from given table and free itself.
492 */
493
494 static int
lltable_free_cb(struct lltable * llt,struct llentry * lle,void * farg)495 lltable_free_cb(struct lltable *llt, struct llentry *lle, void *farg)
496 {
497 struct llentries *dchain;
498
499 dchain = (struct llentries *)farg;
500
501 LLE_WLOCK(lle);
502 CK_LIST_INSERT_HEAD(dchain, lle, lle_chain);
503
504 return (0);
505 }
506
507 /*
508 * Free all entries from given table and free itself.
509 */
510 void
lltable_free(struct lltable * llt)511 lltable_free(struct lltable *llt)
512 {
513 struct llentry *lle, *next;
514 struct llentries dchain;
515
516 KASSERT(llt != NULL, ("%s: llt is NULL", __func__));
517
518 lltable_unlink(llt);
519
520 CK_LIST_INIT(&dchain);
521 IF_AFDATA_WLOCK(llt->llt_ifp);
522 /* Push all lles to @dchain */
523 lltable_foreach_lle(llt, lltable_free_cb, &dchain);
524 llentries_unlink(llt, &dchain);
525 IF_AFDATA_WUNLOCK(llt->llt_ifp);
526
527 CK_LIST_FOREACH_SAFE(lle, &dchain, lle_chain, next) {
528 llentry_free(lle);
529 }
530
531 llt->llt_free_tbl(llt);
532 }
533
534 #if 0
535 void
536 lltable_drain(int af)
537 {
538 struct lltable *llt;
539 struct llentry *lle;
540 int i;
541
542 LLTABLE_LIST_RLOCK();
543 SLIST_FOREACH(llt, &V_lltables, llt_link) {
544 if (llt->llt_af != af)
545 continue;
546
547 for (i=0; i < llt->llt_hsize; i++) {
548 CK_LIST_FOREACH(lle, &llt->lle_head[i], lle_next) {
549 LLE_WLOCK(lle);
550 if (lle->la_hold) {
551 m_freem(lle->la_hold);
552 lle->la_hold = NULL;
553 }
554 LLE_WUNLOCK(lle);
555 }
556 }
557 }
558 LLTABLE_LIST_RUNLOCK();
559 }
560 #endif
561
562 /*
563 * Deletes an address from given lltable.
564 * Used for userland interaction to remove
565 * individual entries. Skips entries added by OS.
566 */
567 int
lltable_delete_addr(struct lltable * llt,u_int flags,const struct sockaddr * l3addr)568 lltable_delete_addr(struct lltable *llt, u_int flags,
569 const struct sockaddr *l3addr)
570 {
571 struct llentry *lle;
572 struct ifnet *ifp;
573
574 ifp = llt->llt_ifp;
575 IF_AFDATA_WLOCK(ifp);
576 lle = lla_lookup(llt, LLE_EXCLUSIVE, l3addr);
577
578 if (lle == NULL) {
579 IF_AFDATA_WUNLOCK(ifp);
580 return (ENOENT);
581 }
582 if ((lle->la_flags & LLE_IFADDR) != 0 && (flags & LLE_IFADDR) == 0) {
583 IF_AFDATA_WUNLOCK(ifp);
584 LLE_WUNLOCK(lle);
585 return (EPERM);
586 }
587
588 lltable_unlink_entry(llt, lle);
589 IF_AFDATA_WUNLOCK(ifp);
590
591 llt->llt_delete_entry(llt, lle);
592
593 return (0);
594 }
595
596 void
lltable_prefix_free(int af,struct sockaddr * addr,struct sockaddr * mask,u_int flags)597 lltable_prefix_free(int af, struct sockaddr *addr, struct sockaddr *mask,
598 u_int flags)
599 {
600 struct lltable *llt;
601
602 LLTABLE_LIST_RLOCK();
603 SLIST_FOREACH(llt, &V_lltables, llt_link) {
604 if (llt->llt_af != af)
605 continue;
606
607 llt->llt_prefix_free(llt, addr, mask, flags);
608 }
609 LLTABLE_LIST_RUNLOCK();
610 }
611
612 struct lltable *
lltable_allocate_htbl(uint32_t hsize)613 lltable_allocate_htbl(uint32_t hsize)
614 {
615 struct lltable *llt;
616 int i;
617
618 llt = malloc(sizeof(struct lltable), M_LLTABLE, M_WAITOK | M_ZERO);
619 llt->llt_hsize = hsize;
620 llt->lle_head = malloc(sizeof(struct llentries) * hsize,
621 M_LLTABLE, M_WAITOK | M_ZERO);
622
623 for (i = 0; i < llt->llt_hsize; i++)
624 CK_LIST_INIT(&llt->lle_head[i]);
625
626 /* Set some default callbacks */
627 llt->llt_link_entry = htable_link_entry;
628 llt->llt_unlink_entry = htable_unlink_entry;
629 llt->llt_prefix_free = htable_prefix_free;
630 llt->llt_foreach_entry = htable_foreach_lle;
631 llt->llt_free_tbl = htable_free_tbl;
632
633 return (llt);
634 }
635
636 /*
637 * Links lltable to global llt list.
638 */
639 void
lltable_link(struct lltable * llt)640 lltable_link(struct lltable *llt)
641 {
642
643 LLTABLE_LIST_WLOCK();
644 SLIST_INSERT_HEAD(&V_lltables, llt, llt_link);
645 LLTABLE_LIST_WUNLOCK();
646 }
647
648 static void
lltable_unlink(struct lltable * llt)649 lltable_unlink(struct lltable *llt)
650 {
651
652 LLTABLE_LIST_WLOCK();
653 SLIST_REMOVE(&V_lltables, llt, lltable, llt_link);
654 LLTABLE_LIST_WUNLOCK();
655
656 }
657
658 /*
659 * External methods used by lltable consumers
660 */
661
662 int
lltable_foreach_lle(struct lltable * llt,llt_foreach_cb_t * f,void * farg)663 lltable_foreach_lle(struct lltable *llt, llt_foreach_cb_t *f, void *farg)
664 {
665
666 return (llt->llt_foreach_entry(llt, f, farg));
667 }
668
669 struct llentry *
lltable_alloc_entry(struct lltable * llt,u_int flags,const struct sockaddr * l3addr)670 lltable_alloc_entry(struct lltable *llt, u_int flags,
671 const struct sockaddr *l3addr)
672 {
673
674 return (llt->llt_alloc_entry(llt, flags, l3addr));
675 }
676
677 void
lltable_free_entry(struct lltable * llt,struct llentry * lle)678 lltable_free_entry(struct lltable *llt, struct llentry *lle)
679 {
680
681 llt->llt_free_entry(llt, lle);
682 }
683
684 void
lltable_link_entry(struct lltable * llt,struct llentry * lle)685 lltable_link_entry(struct lltable *llt, struct llentry *lle)
686 {
687
688 llt->llt_link_entry(llt, lle);
689 }
690
691 void
lltable_unlink_entry(struct lltable * llt,struct llentry * lle)692 lltable_unlink_entry(struct lltable *llt, struct llentry *lle)
693 {
694
695 llt->llt_unlink_entry(lle);
696 }
697
698 void
lltable_fill_sa_entry(const struct llentry * lle,struct sockaddr * sa)699 lltable_fill_sa_entry(const struct llentry *lle, struct sockaddr *sa)
700 {
701 struct lltable *llt;
702
703 llt = lle->lle_tbl;
704 llt->llt_fill_sa_entry(lle, sa);
705 }
706
707 struct ifnet *
lltable_get_ifp(const struct lltable * llt)708 lltable_get_ifp(const struct lltable *llt)
709 {
710
711 return (llt->llt_ifp);
712 }
713
714 int
lltable_get_af(const struct lltable * llt)715 lltable_get_af(const struct lltable *llt)
716 {
717
718 return (llt->llt_af);
719 }
720
721 /*
722 * Called in route_output when rtm_flags contains RTF_LLDATA.
723 */
724 int
lla_rt_output(struct rt_msghdr * rtm,struct rt_addrinfo * info)725 lla_rt_output(struct rt_msghdr *rtm, struct rt_addrinfo *info)
726 {
727 struct sockaddr_dl *dl =
728 (struct sockaddr_dl *)info->rti_info[RTAX_GATEWAY];
729 struct sockaddr *dst = (struct sockaddr *)info->rti_info[RTAX_DST];
730 struct ifnet *ifp;
731 struct lltable *llt;
732 struct llentry *lle, *lle_tmp;
733 uint8_t linkhdr[LLE_MAX_LINKHDR];
734 size_t linkhdrsize;
735 int lladdr_off;
736 u_int laflags = 0;
737 int error;
738
739 KASSERT(dl != NULL && dl->sdl_family == AF_LINK,
740 ("%s: invalid dl\n", __func__));
741
742 ifp = ifnet_byindex(dl->sdl_index);
743 if (ifp == NULL) {
744 log(LOG_INFO, "%s: invalid ifp (sdl_index %d)\n",
745 __func__, dl->sdl_index);
746 return EINVAL;
747 }
748
749 /* XXX linked list may be too expensive */
750 LLTABLE_LIST_RLOCK();
751 SLIST_FOREACH(llt, &V_lltables, llt_link) {
752 if (llt->llt_af == dst->sa_family &&
753 llt->llt_ifp == ifp)
754 break;
755 }
756 LLTABLE_LIST_RUNLOCK();
757 KASSERT(llt != NULL, ("Yep, ugly hacks are bad\n"));
758
759 error = 0;
760
761 switch (rtm->rtm_type) {
762 case RTM_ADD:
763 /* Add static LLE */
764 laflags = 0;
765 if (rtm->rtm_rmx.rmx_expire == 0)
766 laflags = LLE_STATIC;
767 lle = lltable_alloc_entry(llt, laflags, dst);
768 if (lle == NULL)
769 return (ENOMEM);
770
771 linkhdrsize = sizeof(linkhdr);
772 if (lltable_calc_llheader(ifp, dst->sa_family, LLADDR(dl),
773 linkhdr, &linkhdrsize, &lladdr_off) != 0)
774 return (EINVAL);
775 lltable_set_entry_addr(ifp, lle, linkhdr, linkhdrsize,
776 lladdr_off);
777 if ((rtm->rtm_flags & RTF_ANNOUNCE))
778 lle->la_flags |= LLE_PUB;
779 lle->la_expire = rtm->rtm_rmx.rmx_expire;
780
781 laflags = lle->la_flags;
782
783 /* Try to link new entry */
784 lle_tmp = NULL;
785 IF_AFDATA_WLOCK(ifp);
786 LLE_WLOCK(lle);
787 lle_tmp = lla_lookup(llt, LLE_EXCLUSIVE, dst);
788 if (lle_tmp != NULL) {
789 /* Check if we are trying to replace immutable entry */
790 if ((lle_tmp->la_flags & LLE_IFADDR) != 0) {
791 IF_AFDATA_WUNLOCK(ifp);
792 LLE_WUNLOCK(lle_tmp);
793 lltable_free_entry(llt, lle);
794 return (EPERM);
795 }
796 /* Unlink existing entry from table */
797 lltable_unlink_entry(llt, lle_tmp);
798 }
799 lltable_link_entry(llt, lle);
800 IF_AFDATA_WUNLOCK(ifp);
801
802 if (lle_tmp != NULL) {
803 EVENTHANDLER_INVOKE(lle_event, lle_tmp,LLENTRY_EXPIRED);
804 lltable_free_entry(llt, lle_tmp);
805 }
806
807 /*
808 * By invoking LLE handler here we might get
809 * two events on static LLE entry insertion
810 * in routing socket. However, since we might have
811 * other subscribers we need to generate this event.
812 */
813 EVENTHANDLER_INVOKE(lle_event, lle, LLENTRY_RESOLVED);
814 LLE_WUNLOCK(lle);
815 #ifdef INET
816 /* gratuitous ARP */
817 if ((laflags & LLE_PUB) && dst->sa_family == AF_INET)
818 arprequest(ifp,
819 &((struct sockaddr_in *)dst)->sin_addr,
820 &((struct sockaddr_in *)dst)->sin_addr,
821 (u_char *)LLADDR(dl));
822 #endif
823
824 break;
825
826 case RTM_DELETE:
827 return (lltable_delete_addr(llt, 0, dst));
828
829 default:
830 error = EINVAL;
831 }
832
833 return (error);
834 }
835
836 #ifdef DDB
837 struct llentry_sa {
838 struct llentry base;
839 struct sockaddr l3_addr;
840 };
841
842 static void
llatbl_lle_show(struct llentry_sa * la)843 llatbl_lle_show(struct llentry_sa *la)
844 {
845 struct llentry *lle;
846 uint8_t octet[6];
847
848 lle = &la->base;
849 db_printf("lle=%p\n", lle);
850 db_printf(" lle_next=%p\n", lle->lle_next.cle_next);
851 db_printf(" lle_lock=%p\n", &lle->lle_lock);
852 db_printf(" lle_tbl=%p\n", lle->lle_tbl);
853 db_printf(" lle_head=%p\n", lle->lle_head);
854 db_printf(" la_hold=%p\n", lle->la_hold);
855 db_printf(" la_numheld=%d\n", lle->la_numheld);
856 db_printf(" la_expire=%ju\n", (uintmax_t)lle->la_expire);
857 db_printf(" la_flags=0x%04x\n", lle->la_flags);
858 db_printf(" la_asked=%u\n", lle->la_asked);
859 db_printf(" la_preempt=%u\n", lle->la_preempt);
860 db_printf(" ln_state=%d\n", lle->ln_state);
861 db_printf(" ln_router=%u\n", lle->ln_router);
862 db_printf(" ln_ntick=%ju\n", (uintmax_t)lle->ln_ntick);
863 db_printf(" lle_refcnt=%d\n", lle->lle_refcnt);
864 bcopy(lle->ll_addr, octet, sizeof(octet));
865 db_printf(" ll_addr=%02x:%02x:%02x:%02x:%02x:%02x\n",
866 octet[0], octet[1], octet[2], octet[3], octet[4], octet[5]);
867 db_printf(" lle_timer=%p\n", &lle->lle_timer);
868
869 switch (la->l3_addr.sa_family) {
870 #ifdef INET
871 case AF_INET:
872 {
873 struct sockaddr_in *sin;
874 char l3s[INET_ADDRSTRLEN];
875
876 sin = (struct sockaddr_in *)&la->l3_addr;
877 inet_ntoa_r(sin->sin_addr, l3s);
878 db_printf(" l3_addr=%s\n", l3s);
879 break;
880 }
881 #endif
882 #ifdef INET6
883 case AF_INET6:
884 {
885 struct sockaddr_in6 *sin6;
886 char l3s[INET6_ADDRSTRLEN];
887
888 sin6 = (struct sockaddr_in6 *)&la->l3_addr;
889 ip6_sprintf(l3s, &sin6->sin6_addr);
890 db_printf(" l3_addr=%s\n", l3s);
891 break;
892 }
893 #endif
894 default:
895 db_printf(" l3_addr=N/A (af=%d)\n", la->l3_addr.sa_family);
896 break;
897 }
898 }
899
DB_SHOW_COMMAND(llentry,db_show_llentry)900 DB_SHOW_COMMAND(llentry, db_show_llentry)
901 {
902
903 if (!have_addr) {
904 db_printf("usage: show llentry <struct llentry *>\n");
905 return;
906 }
907
908 llatbl_lle_show((struct llentry_sa *)addr);
909 }
910
911 static void
llatbl_llt_show(struct lltable * llt)912 llatbl_llt_show(struct lltable *llt)
913 {
914 int i;
915 struct llentry *lle;
916
917 db_printf("llt=%p llt_af=%d llt_ifp=%p\n",
918 llt, llt->llt_af, llt->llt_ifp);
919
920 for (i = 0; i < llt->llt_hsize; i++) {
921 CK_LIST_FOREACH(lle, &llt->lle_head[i], lle_next) {
922
923 llatbl_lle_show((struct llentry_sa *)lle);
924 if (db_pager_quit)
925 return;
926 }
927 }
928 }
929
DB_SHOW_COMMAND(lltable,db_show_lltable)930 DB_SHOW_COMMAND(lltable, db_show_lltable)
931 {
932
933 if (!have_addr) {
934 db_printf("usage: show lltable <struct lltable *>\n");
935 return;
936 }
937
938 llatbl_llt_show((struct lltable *)addr);
939 }
940
DB_SHOW_ALL_COMMAND(lltables,db_show_all_lltables)941 DB_SHOW_ALL_COMMAND(lltables, db_show_all_lltables)
942 {
943 VNET_ITERATOR_DECL(vnet_iter);
944 struct lltable *llt;
945
946 VNET_FOREACH(vnet_iter) {
947 CURVNET_SET_QUIET(vnet_iter);
948 #ifdef VIMAGE
949 db_printf("vnet=%p\n", curvnet);
950 #endif
951 SLIST_FOREACH(llt, &V_lltables, llt_link) {
952 db_printf("llt=%p llt_af=%d llt_ifp=%p(%s)\n",
953 llt, llt->llt_af, llt->llt_ifp,
954 (llt->llt_ifp != NULL) ?
955 llt->llt_ifp->if_xname : "?");
956 if (have_addr && addr != 0) /* verbose */
957 llatbl_llt_show(llt);
958 if (db_pager_quit) {
959 CURVNET_RESTORE();
960 return;
961 }
962 }
963 CURVNET_RESTORE();
964 }
965 }
966 #endif
967