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