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 * Tries to update @lle link-level address. 322 * Since update requires AFDATA WLOCK, function 323 * drops @lle lock, acquires AFDATA lock and then acquires 324 * @lle lock to maintain lock order. 325 * 326 * Returns 1 on success. 327 */ 328 int 329 lltable_try_set_entry_addr(struct ifnet *ifp, struct llentry *lle, 330 const char *linkhdr, size_t linkhdrsize, int lladdr_off) 331 { 332 333 /* Perform real LLE update */ 334 /* use afdata WLOCK to update fields */ 335 LLE_WLOCK_ASSERT(lle); 336 LLE_ADDREF(lle); 337 LLE_WUNLOCK(lle); 338 IF_AFDATA_WLOCK(ifp); 339 LLE_WLOCK(lle); 340 341 /* 342 * Since we droppped LLE lock, other thread might have deleted 343 * this lle. Check and return 344 */ 345 if ((lle->la_flags & LLE_DELETED) != 0) { 346 IF_AFDATA_WUNLOCK(ifp); 347 LLE_FREE_LOCKED(lle); 348 return (0); 349 } 350 351 /* Update data */ 352 lltable_set_entry_addr(ifp, lle, linkhdr, linkhdrsize, lladdr_off); 353 354 IF_AFDATA_WUNLOCK(ifp); 355 356 LLE_REMREF(lle); 357 358 return (1); 359 } 360 361 /* 362 * Helper function used to pre-compute full/partial link-layer 363 * header data suitable for feeding into if_output(). 364 */ 365 int 366 lltable_calc_llheader(struct ifnet *ifp, int family, char *lladdr, 367 char *buf, size_t *bufsize, int *lladdr_off) 368 { 369 struct if_encap_req ereq; 370 int error; 371 372 bzero(buf, *bufsize); 373 bzero(&ereq, sizeof(ereq)); 374 ereq.buf = buf; 375 ereq.bufsize = *bufsize; 376 ereq.rtype = IFENCAP_LL; 377 ereq.family = family; 378 ereq.lladdr = lladdr; 379 ereq.lladdr_len = ifp->if_addrlen; 380 error = ifp->if_requestencap(ifp, &ereq); 381 if (error == 0) { 382 *bufsize = ereq.bufsize; 383 *lladdr_off = ereq.lladdr_off; 384 } 385 386 return (error); 387 } 388 389 /* 390 * Requests feedback from the datapath. 391 * First packet using @lle should result in 392 * setting r_skip_req back to 0 and updating 393 * lle_hittime to the current time_uptime. 394 */ 395 void 396 llentry_request_feedback(struct llentry *lle) 397 { 398 LLE_REQ_LOCK(lle); 399 lle->r_skip_req = 1; 400 LLE_REQ_UNLOCK(lle); 401 } 402 403 /* 404 * Updates the lle state to mark it has been used 405 * and record the time. 406 * Used by the llentry_provide_feedback() wrapper. 407 */ 408 void 409 llentry_mark_used(struct llentry *lle) 410 { 411 LLE_REQ_LOCK(lle); 412 lle->r_skip_req = 0; 413 lle->lle_hittime = time_uptime; 414 LLE_REQ_UNLOCK(lle); 415 } 416 417 /* 418 * Fetches the time when lle was used. 419 * Return 0 if the entry was not used, relevant time_uptime 420 * otherwise. 421 */ 422 time_t 423 llentry_get_hittime(struct llentry *lle) 424 { 425 time_t lle_hittime = 0; 426 427 LLE_REQ_LOCK(lle); 428 if ((lle->r_skip_req == 0) && (lle_hittime < lle->lle_hittime)) 429 lle_hittime = lle->lle_hittime; 430 LLE_REQ_UNLOCK(lle); 431 432 return (lle_hittime); 433 } 434 435 /* 436 * Update link-layer header for given @lle after 437 * interface lladdr was changed. 438 */ 439 static int 440 llentry_update_ifaddr(struct lltable *llt, struct llentry *lle, void *farg) 441 { 442 struct ifnet *ifp; 443 u_char linkhdr[LLE_MAX_LINKHDR]; 444 size_t linkhdrsize; 445 u_char *lladdr; 446 int lladdr_off; 447 448 ifp = (struct ifnet *)farg; 449 450 lladdr = lle->ll_addr; 451 452 LLE_WLOCK(lle); 453 if ((lle->la_flags & LLE_VALID) == 0) { 454 LLE_WUNLOCK(lle); 455 return (0); 456 } 457 458 if ((lle->la_flags & LLE_IFADDR) != 0) 459 lladdr = IF_LLADDR(ifp); 460 461 linkhdrsize = sizeof(linkhdr); 462 lltable_calc_llheader(ifp, llt->llt_af, lladdr, linkhdr, &linkhdrsize, 463 &lladdr_off); 464 memcpy(lle->r_linkdata, linkhdr, linkhdrsize); 465 LLE_WUNLOCK(lle); 466 467 return (0); 468 } 469 470 /* 471 * Update all calculated headers for given @llt 472 */ 473 void 474 lltable_update_ifaddr(struct lltable *llt) 475 { 476 477 if (llt->llt_ifp->if_flags & IFF_LOOPBACK) 478 return; 479 480 IF_AFDATA_WLOCK(llt->llt_ifp); 481 lltable_foreach_lle(llt, llentry_update_ifaddr, llt->llt_ifp); 482 IF_AFDATA_WUNLOCK(llt->llt_ifp); 483 } 484 485 /* 486 * 487 * Performs generic cleanup routines and frees lle. 488 * 489 * Called for non-linked entries, with callouts and 490 * other AF-specific cleanups performed. 491 * 492 * @lle must be passed WLOCK'ed 493 * 494 * Returns the number of held packets, if any, that were dropped. 495 */ 496 size_t 497 llentry_free(struct llentry *lle) 498 { 499 size_t pkts_dropped; 500 501 LLE_WLOCK_ASSERT(lle); 502 503 KASSERT((lle->la_flags & LLE_LINKED) == 0, ("freeing linked lle")); 504 505 pkts_dropped = lltable_drop_entry_queue(lle); 506 507 /* cancel timer */ 508 if (callout_stop(&lle->lle_timer) > 0) 509 LLE_REMREF(lle); 510 LLE_FREE_LOCKED(lle); 511 512 return (pkts_dropped); 513 } 514 515 /* 516 * Free all entries from given table and free itself. 517 */ 518 519 static int 520 lltable_free_cb(struct lltable *llt, struct llentry *lle, void *farg) 521 { 522 struct llentries *dchain; 523 524 dchain = (struct llentries *)farg; 525 526 LLE_WLOCK(lle); 527 CK_LIST_INSERT_HEAD(dchain, lle, lle_chain); 528 529 return (0); 530 } 531 532 /* 533 * Free all entries from given table and free itself. 534 */ 535 void 536 lltable_free(struct lltable *llt) 537 { 538 struct llentry *lle, *next; 539 struct llentries dchain; 540 541 KASSERT(llt != NULL, ("%s: llt is NULL", __func__)); 542 543 lltable_unlink(llt); 544 545 CK_LIST_INIT(&dchain); 546 IF_AFDATA_WLOCK(llt->llt_ifp); 547 /* Push all lles to @dchain */ 548 lltable_foreach_lle(llt, lltable_free_cb, &dchain); 549 llentries_unlink(llt, &dchain); 550 IF_AFDATA_WUNLOCK(llt->llt_ifp); 551 552 CK_LIST_FOREACH_SAFE(lle, &dchain, lle_chain, next) { 553 llentry_free(lle); 554 } 555 556 KASSERT(llt->llt_entries == 0, ("%s: lltable %p (%s) entires not 0: %d", 557 __func__, llt, llt->llt_ifp->if_xname, llt->llt_entries)); 558 559 llt->llt_free_tbl(llt); 560 } 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 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 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 * 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 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 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 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 * 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 678 lltable_free_entry(struct lltable *llt, struct llentry *lle) 679 { 680 681 llt->llt_free_entry(llt, lle); 682 } 683 684 int 685 lltable_link_entry(struct lltable *llt, struct llentry *lle) 686 { 687 688 return (llt->llt_link_entry(llt, lle)); 689 } 690 691 int 692 lltable_unlink_entry(struct lltable *llt, struct llentry *lle) 693 { 694 695 return (llt->llt_unlink_entry(lle)); 696 } 697 698 void 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 * 708 lltable_get_ifp(const struct lltable *llt) 709 { 710 711 return (llt->llt_ifp); 712 } 713 714 int 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 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 if (dl == NULL || dl->sdl_family != AF_LINK) 740 return (EINVAL); 741 742 /* XXX: should be ntohs() */ 743 ifp = ifnet_byindex(dl->sdl_index); 744 if (ifp == NULL) { 745 log(LOG_INFO, "%s: invalid ifp (sdl_index %d)\n", 746 __func__, dl->sdl_index); 747 return EINVAL; 748 } 749 750 /* XXX linked list may be too expensive */ 751 LLTABLE_LIST_RLOCK(); 752 SLIST_FOREACH(llt, &V_lltables, llt_link) { 753 if (llt->llt_af == dst->sa_family && 754 llt->llt_ifp == ifp) 755 break; 756 } 757 LLTABLE_LIST_RUNLOCK(); 758 if (llt == NULL) 759 return (ESRCH); 760 761 error = 0; 762 763 switch (rtm->rtm_type) { 764 case RTM_ADD: 765 /* Add static LLE */ 766 laflags = 0; 767 if (rtm->rtm_rmx.rmx_expire == 0) 768 laflags = LLE_STATIC; 769 lle = lltable_alloc_entry(llt, laflags, dst); 770 if (lle == NULL) 771 return (ENOMEM); 772 773 linkhdrsize = sizeof(linkhdr); 774 if (lltable_calc_llheader(ifp, dst->sa_family, LLADDR(dl), 775 linkhdr, &linkhdrsize, &lladdr_off) != 0) 776 return (EINVAL); 777 lltable_set_entry_addr(ifp, lle, linkhdr, linkhdrsize, 778 lladdr_off); 779 if ((rtm->rtm_flags & RTF_ANNOUNCE)) 780 lle->la_flags |= LLE_PUB; 781 lle->la_expire = rtm->rtm_rmx.rmx_expire; 782 783 laflags = lle->la_flags; 784 785 /* Try to link new entry */ 786 lle_tmp = NULL; 787 IF_AFDATA_WLOCK(ifp); 788 LLE_WLOCK(lle); 789 lle_tmp = lla_lookup(llt, LLE_EXCLUSIVE, dst); 790 if (lle_tmp != NULL) { 791 /* Check if we are trying to replace immutable entry */ 792 if ((lle_tmp->la_flags & LLE_IFADDR) != 0) { 793 IF_AFDATA_WUNLOCK(ifp); 794 LLE_WUNLOCK(lle_tmp); 795 lltable_free_entry(llt, lle); 796 return (EPERM); 797 } 798 /* Unlink existing entry from table */ 799 lltable_unlink_entry(llt, lle_tmp); 800 } 801 lltable_link_entry(llt, lle); 802 IF_AFDATA_WUNLOCK(ifp); 803 804 if (lle_tmp != NULL) { 805 EVENTHANDLER_INVOKE(lle_event, lle_tmp,LLENTRY_EXPIRED); 806 lltable_free_entry(llt, lle_tmp); 807 } 808 809 /* 810 * By invoking LLE handler here we might get 811 * two events on static LLE entry insertion 812 * in routing socket. However, since we might have 813 * other subscribers we need to generate this event. 814 */ 815 EVENTHANDLER_INVOKE(lle_event, lle, LLENTRY_RESOLVED); 816 LLE_WUNLOCK(lle); 817 #ifdef INET 818 /* gratuitous ARP */ 819 if ((laflags & LLE_PUB) && dst->sa_family == AF_INET) 820 arprequest(ifp, 821 &((struct sockaddr_in *)dst)->sin_addr, 822 &((struct sockaddr_in *)dst)->sin_addr, 823 (u_char *)LLADDR(dl)); 824 #endif 825 826 break; 827 828 case RTM_DELETE: 829 return (lltable_delete_addr(llt, 0, dst)); 830 831 default: 832 error = EINVAL; 833 } 834 835 return (error); 836 } 837 838 #ifdef DDB 839 struct llentry_sa { 840 struct llentry base; 841 struct sockaddr l3_addr; 842 }; 843 844 static void 845 llatbl_lle_show(struct llentry_sa *la) 846 { 847 struct llentry *lle; 848 uint8_t octet[6]; 849 850 lle = &la->base; 851 db_printf("lle=%p\n", lle); 852 db_printf(" lle_next=%p\n", lle->lle_next.cle_next); 853 db_printf(" lle_lock=%p\n", &lle->lle_lock); 854 db_printf(" lle_tbl=%p\n", lle->lle_tbl); 855 db_printf(" lle_head=%p\n", lle->lle_head); 856 db_printf(" la_hold=%p\n", lle->la_hold); 857 db_printf(" la_numheld=%d\n", lle->la_numheld); 858 db_printf(" la_expire=%ju\n", (uintmax_t)lle->la_expire); 859 db_printf(" la_flags=0x%04x\n", lle->la_flags); 860 db_printf(" la_asked=%u\n", lle->la_asked); 861 db_printf(" la_preempt=%u\n", lle->la_preempt); 862 db_printf(" ln_state=%d\n", lle->ln_state); 863 db_printf(" ln_router=%u\n", lle->ln_router); 864 db_printf(" ln_ntick=%ju\n", (uintmax_t)lle->ln_ntick); 865 db_printf(" lle_refcnt=%d\n", lle->lle_refcnt); 866 bcopy(lle->ll_addr, octet, sizeof(octet)); 867 db_printf(" ll_addr=%02x:%02x:%02x:%02x:%02x:%02x\n", 868 octet[0], octet[1], octet[2], octet[3], octet[4], octet[5]); 869 db_printf(" lle_timer=%p\n", &lle->lle_timer); 870 871 switch (la->l3_addr.sa_family) { 872 #ifdef INET 873 case AF_INET: 874 { 875 struct sockaddr_in *sin; 876 char l3s[INET_ADDRSTRLEN]; 877 878 sin = (struct sockaddr_in *)&la->l3_addr; 879 inet_ntoa_r(sin->sin_addr, l3s); 880 db_printf(" l3_addr=%s\n", l3s); 881 break; 882 } 883 #endif 884 #ifdef INET6 885 case AF_INET6: 886 { 887 struct sockaddr_in6 *sin6; 888 char l3s[INET6_ADDRSTRLEN]; 889 890 sin6 = (struct sockaddr_in6 *)&la->l3_addr; 891 ip6_sprintf(l3s, &sin6->sin6_addr); 892 db_printf(" l3_addr=%s\n", l3s); 893 break; 894 } 895 #endif 896 default: 897 db_printf(" l3_addr=N/A (af=%d)\n", la->l3_addr.sa_family); 898 break; 899 } 900 } 901 902 DB_SHOW_COMMAND(llentry, db_show_llentry) 903 { 904 905 if (!have_addr) { 906 db_printf("usage: show llentry <struct llentry *>\n"); 907 return; 908 } 909 910 llatbl_lle_show((struct llentry_sa *)addr); 911 } 912 913 static void 914 llatbl_llt_show(struct lltable *llt) 915 { 916 int i; 917 struct llentry *lle; 918 919 db_printf("llt=%p llt_af=%d llt_ifp=%p\n", 920 llt, llt->llt_af, llt->llt_ifp); 921 922 for (i = 0; i < llt->llt_hsize; i++) { 923 CK_LIST_FOREACH(lle, &llt->lle_head[i], lle_next) { 924 llatbl_lle_show((struct llentry_sa *)lle); 925 if (db_pager_quit) 926 return; 927 } 928 } 929 } 930 931 DB_SHOW_COMMAND(lltable, db_show_lltable) 932 { 933 934 if (!have_addr) { 935 db_printf("usage: show lltable <struct lltable *>\n"); 936 return; 937 } 938 939 llatbl_llt_show((struct lltable *)addr); 940 } 941 942 DB_SHOW_ALL_COMMAND(lltables, db_show_all_lltables) 943 { 944 VNET_ITERATOR_DECL(vnet_iter); 945 struct lltable *llt; 946 947 VNET_FOREACH(vnet_iter) { 948 CURVNET_SET_QUIET(vnet_iter); 949 #ifdef VIMAGE 950 db_printf("vnet=%p\n", curvnet); 951 #endif 952 SLIST_FOREACH(llt, &V_lltables, llt_link) { 953 db_printf("llt=%p llt_af=%d llt_ifp=%p(%s)\n", 954 llt, llt->llt_af, llt->llt_ifp, 955 (llt->llt_ifp != NULL) ? 956 llt->llt_ifp->if_xname : "?"); 957 if (have_addr && addr != 0) /* verbose */ 958 llatbl_llt_show(llt); 959 if (db_pager_quit) { 960 CURVNET_RESTORE(); 961 return; 962 } 963 } 964 CURVNET_RESTORE(); 965 } 966 } 967 #endif 968