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