1 /*- 2 * Copyright (c) 1982, 1986, 1991, 1993 3 * The Regents of the University of California. All rights reserved. 4 * Copyright (C) 2001 WIDE Project. 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 * 4. Neither the name of the University nor the names of its contributors 15 * may be used to endorse or promote products derived from this software 16 * without specific prior written permission. 17 * 18 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 19 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 20 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 21 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 22 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 23 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 24 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 25 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 26 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 27 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 28 * SUCH DAMAGE. 29 * 30 * @(#)in.c 8.4 (Berkeley) 1/9/95 31 */ 32 33 #include <sys/cdefs.h> 34 __FBSDID("$FreeBSD$"); 35 36 #include "opt_mpath.h" 37 38 #include <sys/param.h> 39 #include <sys/eventhandler.h> 40 #include <sys/systm.h> 41 #include <sys/sockio.h> 42 #include <sys/malloc.h> 43 #include <sys/priv.h> 44 #include <sys/socket.h> 45 #include <sys/jail.h> 46 #include <sys/kernel.h> 47 #include <sys/lock.h> 48 #include <sys/proc.h> 49 #include <sys/rmlock.h> 50 #include <sys/sysctl.h> 51 #include <sys/syslog.h> 52 #include <sys/sx.h> 53 54 #include <net/if.h> 55 #include <net/if_var.h> 56 #include <net/if_arp.h> 57 #include <net/if_dl.h> 58 #include <net/if_llatbl.h> 59 #include <net/if_types.h> 60 #include <net/route.h> 61 #include <net/vnet.h> 62 63 #include <netinet/if_ether.h> 64 #include <netinet/in.h> 65 #include <netinet/in_var.h> 66 #include <netinet/in_pcb.h> 67 #include <netinet/ip_var.h> 68 #include <netinet/ip_carp.h> 69 #include <netinet/igmp_var.h> 70 #include <netinet/udp.h> 71 #include <netinet/udp_var.h> 72 73 static int in_aifaddr_ioctl(u_long, caddr_t, struct ifnet *, struct thread *); 74 static int in_difaddr_ioctl(caddr_t, struct ifnet *, struct thread *); 75 76 static void in_socktrim(struct sockaddr_in *); 77 static void in_purgemaddrs(struct ifnet *); 78 79 static VNET_DEFINE(int, nosameprefix); 80 #define V_nosameprefix VNET(nosameprefix) 81 SYSCTL_INT(_net_inet_ip, OID_AUTO, no_same_prefix, CTLFLAG_VNET | CTLFLAG_RW, 82 &VNET_NAME(nosameprefix), 0, 83 "Refuse to create same prefixes on different interfaces"); 84 85 VNET_DECLARE(struct inpcbinfo, ripcbinfo); 86 #define V_ripcbinfo VNET(ripcbinfo) 87 88 static struct sx in_control_sx; 89 SX_SYSINIT(in_control_sx, &in_control_sx, "in_control"); 90 91 /* 92 * Return 1 if an internet address is for a ``local'' host 93 * (one to which we have a connection). 94 */ 95 int 96 in_localaddr(struct in_addr in) 97 { 98 struct rm_priotracker in_ifa_tracker; 99 register u_long i = ntohl(in.s_addr); 100 register struct in_ifaddr *ia; 101 102 IN_IFADDR_RLOCK(&in_ifa_tracker); 103 TAILQ_FOREACH(ia, &V_in_ifaddrhead, ia_link) { 104 if ((i & ia->ia_subnetmask) == ia->ia_subnet) { 105 IN_IFADDR_RUNLOCK(&in_ifa_tracker); 106 return (1); 107 } 108 } 109 IN_IFADDR_RUNLOCK(&in_ifa_tracker); 110 return (0); 111 } 112 113 /* 114 * Return 1 if an internet address is for the local host and configured 115 * on one of its interfaces. 116 */ 117 int 118 in_localip(struct in_addr in) 119 { 120 struct rm_priotracker in_ifa_tracker; 121 struct in_ifaddr *ia; 122 123 IN_IFADDR_RLOCK(&in_ifa_tracker); 124 LIST_FOREACH(ia, INADDR_HASH(in.s_addr), ia_hash) { 125 if (IA_SIN(ia)->sin_addr.s_addr == in.s_addr) { 126 IN_IFADDR_RUNLOCK(&in_ifa_tracker); 127 return (1); 128 } 129 } 130 IN_IFADDR_RUNLOCK(&in_ifa_tracker); 131 return (0); 132 } 133 134 /* 135 * Return 1 if an internet address is configured on an interface. 136 */ 137 int 138 in_ifhasaddr(struct ifnet *ifp, struct in_addr in) 139 { 140 struct ifaddr *ifa; 141 struct in_ifaddr *ia; 142 143 IF_ADDR_RLOCK(ifp); 144 TAILQ_FOREACH(ifa, &ifp->if_addrhead, ifa_link) { 145 if (ifa->ifa_addr->sa_family != AF_INET) 146 continue; 147 ia = (struct in_ifaddr *)ifa; 148 if (ia->ia_addr.sin_addr.s_addr == in.s_addr) { 149 IF_ADDR_RUNLOCK(ifp); 150 return (1); 151 } 152 } 153 IF_ADDR_RUNLOCK(ifp); 154 155 return (0); 156 } 157 158 /* 159 * Return a reference to the interface address which is different to 160 * the supplied one but with same IP address value. 161 */ 162 static struct in_ifaddr * 163 in_localip_more(struct in_ifaddr *ia) 164 { 165 struct rm_priotracker in_ifa_tracker; 166 in_addr_t in = IA_SIN(ia)->sin_addr.s_addr; 167 struct in_ifaddr *it; 168 169 IN_IFADDR_RLOCK(&in_ifa_tracker); 170 LIST_FOREACH(it, INADDR_HASH(in), ia_hash) { 171 if (it != ia && IA_SIN(it)->sin_addr.s_addr == in) { 172 ifa_ref(&it->ia_ifa); 173 IN_IFADDR_RUNLOCK(&in_ifa_tracker); 174 return (it); 175 } 176 } 177 IN_IFADDR_RUNLOCK(&in_ifa_tracker); 178 179 return (NULL); 180 } 181 182 /* 183 * Determine whether an IP address is in a reserved set of addresses 184 * that may not be forwarded, or whether datagrams to that destination 185 * may be forwarded. 186 */ 187 int 188 in_canforward(struct in_addr in) 189 { 190 register u_long i = ntohl(in.s_addr); 191 register u_long net; 192 193 if (IN_EXPERIMENTAL(i) || IN_MULTICAST(i) || IN_LINKLOCAL(i)) 194 return (0); 195 if (IN_CLASSA(i)) { 196 net = i & IN_CLASSA_NET; 197 if (net == 0 || net == (IN_LOOPBACKNET << IN_CLASSA_NSHIFT)) 198 return (0); 199 } 200 return (1); 201 } 202 203 /* 204 * Trim a mask in a sockaddr 205 */ 206 static void 207 in_socktrim(struct sockaddr_in *ap) 208 { 209 register char *cplim = (char *) &ap->sin_addr; 210 register char *cp = (char *) (&ap->sin_addr + 1); 211 212 ap->sin_len = 0; 213 while (--cp >= cplim) 214 if (*cp) { 215 (ap)->sin_len = cp - (char *) (ap) + 1; 216 break; 217 } 218 } 219 220 /* 221 * Generic internet control operations (ioctl's). 222 */ 223 int 224 in_control(struct socket *so, u_long cmd, caddr_t data, struct ifnet *ifp, 225 struct thread *td) 226 { 227 struct ifreq *ifr = (struct ifreq *)data; 228 struct sockaddr_in *addr = (struct sockaddr_in *)&ifr->ifr_addr; 229 struct ifaddr *ifa; 230 struct in_ifaddr *ia; 231 int error; 232 233 if (ifp == NULL) 234 return (EADDRNOTAVAIL); 235 236 /* 237 * Filter out 4 ioctls we implement directly. Forward the rest 238 * to specific functions and ifp->if_ioctl(). 239 */ 240 switch (cmd) { 241 case SIOCGIFADDR: 242 case SIOCGIFBRDADDR: 243 case SIOCGIFDSTADDR: 244 case SIOCGIFNETMASK: 245 break; 246 case SIOCDIFADDR: 247 sx_xlock(&in_control_sx); 248 error = in_difaddr_ioctl(data, ifp, td); 249 sx_xunlock(&in_control_sx); 250 return (error); 251 case OSIOCAIFADDR: /* 9.x compat */ 252 case SIOCAIFADDR: 253 sx_xlock(&in_control_sx); 254 error = in_aifaddr_ioctl(cmd, data, ifp, td); 255 sx_xunlock(&in_control_sx); 256 return (error); 257 case SIOCSIFADDR: 258 case SIOCSIFBRDADDR: 259 case SIOCSIFDSTADDR: 260 case SIOCSIFNETMASK: 261 /* We no longer support that old commands. */ 262 return (EINVAL); 263 default: 264 if (ifp->if_ioctl == NULL) 265 return (EOPNOTSUPP); 266 return ((*ifp->if_ioctl)(ifp, cmd, data)); 267 } 268 269 if (addr->sin_addr.s_addr != INADDR_ANY && 270 prison_check_ip4(td->td_ucred, &addr->sin_addr) != 0) 271 return (EADDRNOTAVAIL); 272 273 /* 274 * Find address for this interface, if it exists. If an 275 * address was specified, find that one instead of the 276 * first one on the interface, if possible. 277 */ 278 IF_ADDR_RLOCK(ifp); 279 TAILQ_FOREACH(ifa, &ifp->if_addrhead, ifa_link) { 280 if (ifa->ifa_addr->sa_family != AF_INET) 281 continue; 282 ia = (struct in_ifaddr *)ifa; 283 if (ia->ia_addr.sin_addr.s_addr == addr->sin_addr.s_addr) 284 break; 285 } 286 if (ifa == NULL) 287 TAILQ_FOREACH(ifa, &ifp->if_addrhead, ifa_link) 288 if (ifa->ifa_addr->sa_family == AF_INET) { 289 ia = (struct in_ifaddr *)ifa; 290 if (prison_check_ip4(td->td_ucred, 291 &ia->ia_addr.sin_addr) == 0) 292 break; 293 } 294 295 if (ifa == NULL) { 296 IF_ADDR_RUNLOCK(ifp); 297 return (EADDRNOTAVAIL); 298 } 299 300 error = 0; 301 switch (cmd) { 302 case SIOCGIFADDR: 303 *addr = ia->ia_addr; 304 break; 305 306 case SIOCGIFBRDADDR: 307 if ((ifp->if_flags & IFF_BROADCAST) == 0) { 308 error = EINVAL; 309 break; 310 } 311 *addr = ia->ia_broadaddr; 312 break; 313 314 case SIOCGIFDSTADDR: 315 if ((ifp->if_flags & IFF_POINTOPOINT) == 0) { 316 error = EINVAL; 317 break; 318 } 319 *addr = ia->ia_dstaddr; 320 break; 321 322 case SIOCGIFNETMASK: 323 *addr = ia->ia_sockmask; 324 break; 325 } 326 327 IF_ADDR_RUNLOCK(ifp); 328 329 return (error); 330 } 331 332 static int 333 in_aifaddr_ioctl(u_long cmd, caddr_t data, struct ifnet *ifp, struct thread *td) 334 { 335 const struct in_aliasreq *ifra = (struct in_aliasreq *)data; 336 const struct sockaddr_in *addr = &ifra->ifra_addr; 337 const struct sockaddr_in *broadaddr = &ifra->ifra_broadaddr; 338 const struct sockaddr_in *mask = &ifra->ifra_mask; 339 const struct sockaddr_in *dstaddr = &ifra->ifra_dstaddr; 340 const int vhid = (cmd == SIOCAIFADDR) ? ifra->ifra_vhid : 0; 341 struct ifaddr *ifa; 342 struct in_ifaddr *ia; 343 bool iaIsFirst; 344 int error = 0; 345 346 error = priv_check(td, PRIV_NET_ADDIFADDR); 347 if (error) 348 return (error); 349 350 /* 351 * ifra_addr must be present and be of INET family. 352 * ifra_broadaddr/ifra_dstaddr and ifra_mask are optional. 353 */ 354 if (addr->sin_len != sizeof(struct sockaddr_in) || 355 addr->sin_family != AF_INET) 356 return (EINVAL); 357 if (broadaddr->sin_len != 0 && 358 (broadaddr->sin_len != sizeof(struct sockaddr_in) || 359 broadaddr->sin_family != AF_INET)) 360 return (EINVAL); 361 if (mask->sin_len != 0 && 362 (mask->sin_len != sizeof(struct sockaddr_in) || 363 mask->sin_family != AF_INET)) 364 return (EINVAL); 365 if ((ifp->if_flags & IFF_POINTOPOINT) && 366 (dstaddr->sin_len != sizeof(struct sockaddr_in) || 367 dstaddr->sin_addr.s_addr == INADDR_ANY)) 368 return (EDESTADDRREQ); 369 if (vhid > 0 && carp_attach_p == NULL) 370 return (EPROTONOSUPPORT); 371 372 /* 373 * See whether address already exist. 374 */ 375 iaIsFirst = true; 376 ia = NULL; 377 IF_ADDR_RLOCK(ifp); 378 TAILQ_FOREACH(ifa, &ifp->if_addrhead, ifa_link) { 379 struct in_ifaddr *it; 380 381 if (ifa->ifa_addr->sa_family != AF_INET) 382 continue; 383 384 it = (struct in_ifaddr *)ifa; 385 iaIsFirst = false; 386 if (it->ia_addr.sin_addr.s_addr == addr->sin_addr.s_addr && 387 prison_check_ip4(td->td_ucred, &addr->sin_addr) == 0) 388 ia = it; 389 } 390 IF_ADDR_RUNLOCK(ifp); 391 392 if (ia != NULL) 393 (void )in_difaddr_ioctl(data, ifp, td); 394 395 ifa = ifa_alloc(sizeof(struct in_ifaddr), M_WAITOK); 396 ia = (struct in_ifaddr *)ifa; 397 ifa->ifa_addr = (struct sockaddr *)&ia->ia_addr; 398 ifa->ifa_dstaddr = (struct sockaddr *)&ia->ia_dstaddr; 399 ifa->ifa_netmask = (struct sockaddr *)&ia->ia_sockmask; 400 401 ia->ia_ifp = ifp; 402 ia->ia_addr = *addr; 403 if (mask->sin_len != 0) { 404 ia->ia_sockmask = *mask; 405 ia->ia_subnetmask = ntohl(ia->ia_sockmask.sin_addr.s_addr); 406 } else { 407 in_addr_t i = ntohl(addr->sin_addr.s_addr); 408 409 /* 410 * Be compatible with network classes, if netmask isn't 411 * supplied, guess it based on classes. 412 */ 413 if (IN_CLASSA(i)) 414 ia->ia_subnetmask = IN_CLASSA_NET; 415 else if (IN_CLASSB(i)) 416 ia->ia_subnetmask = IN_CLASSB_NET; 417 else 418 ia->ia_subnetmask = IN_CLASSC_NET; 419 ia->ia_sockmask.sin_addr.s_addr = htonl(ia->ia_subnetmask); 420 } 421 ia->ia_subnet = ntohl(addr->sin_addr.s_addr) & ia->ia_subnetmask; 422 in_socktrim(&ia->ia_sockmask); 423 424 if (ifp->if_flags & IFF_BROADCAST) { 425 if (broadaddr->sin_len != 0) { 426 ia->ia_broadaddr = *broadaddr; 427 } else if (ia->ia_subnetmask == IN_RFC3021_MASK) { 428 ia->ia_broadaddr.sin_addr.s_addr = INADDR_BROADCAST; 429 ia->ia_broadaddr.sin_len = sizeof(struct sockaddr_in); 430 ia->ia_broadaddr.sin_family = AF_INET; 431 } else { 432 ia->ia_broadaddr.sin_addr.s_addr = 433 htonl(ia->ia_subnet | ~ia->ia_subnetmask); 434 ia->ia_broadaddr.sin_len = sizeof(struct sockaddr_in); 435 ia->ia_broadaddr.sin_family = AF_INET; 436 } 437 } 438 439 if (ifp->if_flags & IFF_POINTOPOINT) 440 ia->ia_dstaddr = *dstaddr; 441 442 /* XXXGL: rtinit() needs this strange assignment. */ 443 if (ifp->if_flags & IFF_LOOPBACK) 444 ia->ia_dstaddr = ia->ia_addr; 445 446 if (vhid != 0) { 447 error = (*carp_attach_p)(&ia->ia_ifa, vhid); 448 if (error) 449 return (error); 450 } 451 452 /* if_addrhead is already referenced by ifa_alloc() */ 453 IF_ADDR_WLOCK(ifp); 454 TAILQ_INSERT_TAIL(&ifp->if_addrhead, ifa, ifa_link); 455 IF_ADDR_WUNLOCK(ifp); 456 457 ifa_ref(ifa); /* in_ifaddrhead */ 458 IN_IFADDR_WLOCK(); 459 TAILQ_INSERT_TAIL(&V_in_ifaddrhead, ia, ia_link); 460 LIST_INSERT_HEAD(INADDR_HASH(ia->ia_addr.sin_addr.s_addr), ia, ia_hash); 461 IN_IFADDR_WUNLOCK(); 462 463 /* 464 * Give the interface a chance to initialize 465 * if this is its first address, 466 * and to validate the address if necessary. 467 */ 468 if (ifp->if_ioctl != NULL) { 469 error = (*ifp->if_ioctl)(ifp, SIOCSIFADDR, (caddr_t)ia); 470 if (error) 471 goto fail1; 472 } 473 474 /* 475 * Add route for the network. 476 */ 477 if (vhid == 0) { 478 int flags = RTF_UP; 479 480 if (ifp->if_flags & (IFF_LOOPBACK|IFF_POINTOPOINT)) 481 flags |= RTF_HOST; 482 483 error = in_addprefix(ia, flags); 484 if (error) 485 goto fail1; 486 } 487 488 /* 489 * Add a loopback route to self. 490 */ 491 if (vhid == 0 && (ifp->if_flags & IFF_LOOPBACK) == 0 && 492 ia->ia_addr.sin_addr.s_addr != INADDR_ANY && 493 !((ifp->if_flags & IFF_POINTOPOINT) && 494 ia->ia_dstaddr.sin_addr.s_addr == ia->ia_addr.sin_addr.s_addr)) { 495 struct in_ifaddr *eia; 496 497 eia = in_localip_more(ia); 498 499 if (eia == NULL) { 500 error = ifa_add_loopback_route((struct ifaddr *)ia, 501 (struct sockaddr *)&ia->ia_addr); 502 if (error) 503 goto fail2; 504 } else 505 ifa_free(&eia->ia_ifa); 506 } 507 508 if (iaIsFirst && (ifp->if_flags & IFF_MULTICAST)) { 509 struct in_addr allhosts_addr; 510 struct in_ifinfo *ii; 511 512 ii = ((struct in_ifinfo *)ifp->if_afdata[AF_INET]); 513 allhosts_addr.s_addr = htonl(INADDR_ALLHOSTS_GROUP); 514 515 error = in_joingroup(ifp, &allhosts_addr, NULL, 516 &ii->ii_allhosts); 517 } 518 519 EVENTHANDLER_INVOKE(ifaddr_event, ifp); 520 521 return (error); 522 523 fail2: 524 if (vhid == 0) 525 (void )in_scrubprefix(ia, LLE_STATIC); 526 527 fail1: 528 if (ia->ia_ifa.ifa_carp) 529 (*carp_detach_p)(&ia->ia_ifa); 530 531 IF_ADDR_WLOCK(ifp); 532 TAILQ_REMOVE(&ifp->if_addrhead, &ia->ia_ifa, ifa_link); 533 IF_ADDR_WUNLOCK(ifp); 534 ifa_free(&ia->ia_ifa); /* if_addrhead */ 535 536 IN_IFADDR_WLOCK(); 537 TAILQ_REMOVE(&V_in_ifaddrhead, ia, ia_link); 538 LIST_REMOVE(ia, ia_hash); 539 IN_IFADDR_WUNLOCK(); 540 ifa_free(&ia->ia_ifa); /* in_ifaddrhead */ 541 542 return (error); 543 } 544 545 static int 546 in_difaddr_ioctl(caddr_t data, struct ifnet *ifp, struct thread *td) 547 { 548 const struct ifreq *ifr = (struct ifreq *)data; 549 const struct sockaddr_in *addr = (const struct sockaddr_in *) 550 &ifr->ifr_addr; 551 struct ifaddr *ifa; 552 struct in_ifaddr *ia; 553 bool deleteAny, iaIsLast; 554 int error; 555 556 if (td != NULL) { 557 error = priv_check(td, PRIV_NET_DELIFADDR); 558 if (error) 559 return (error); 560 } 561 562 if (addr->sin_len != sizeof(struct sockaddr_in) || 563 addr->sin_family != AF_INET) 564 deleteAny = true; 565 else 566 deleteAny = false; 567 568 iaIsLast = true; 569 ia = NULL; 570 IF_ADDR_WLOCK(ifp); 571 TAILQ_FOREACH(ifa, &ifp->if_addrhead, ifa_link) { 572 struct in_ifaddr *it; 573 574 if (ifa->ifa_addr->sa_family != AF_INET) 575 continue; 576 577 it = (struct in_ifaddr *)ifa; 578 if (deleteAny && ia == NULL && (td == NULL || 579 prison_check_ip4(td->td_ucred, &it->ia_addr.sin_addr) == 0)) 580 ia = it; 581 582 if (it->ia_addr.sin_addr.s_addr == addr->sin_addr.s_addr && 583 (td == NULL || prison_check_ip4(td->td_ucred, 584 &addr->sin_addr) == 0)) 585 ia = it; 586 587 if (it != ia) 588 iaIsLast = false; 589 } 590 591 if (ia == NULL) { 592 IF_ADDR_WUNLOCK(ifp); 593 return (EADDRNOTAVAIL); 594 } 595 596 TAILQ_REMOVE(&ifp->if_addrhead, &ia->ia_ifa, ifa_link); 597 IF_ADDR_WUNLOCK(ifp); 598 ifa_free(&ia->ia_ifa); /* if_addrhead */ 599 600 IN_IFADDR_WLOCK(); 601 TAILQ_REMOVE(&V_in_ifaddrhead, ia, ia_link); 602 LIST_REMOVE(ia, ia_hash); 603 IN_IFADDR_WUNLOCK(); 604 605 /* 606 * in_scrubprefix() kills the interface route. 607 */ 608 in_scrubprefix(ia, LLE_STATIC); 609 610 /* 611 * in_ifadown gets rid of all the rest of 612 * the routes. This is not quite the right 613 * thing to do, but at least if we are running 614 * a routing process they will come back. 615 */ 616 in_ifadown(&ia->ia_ifa, 1); 617 618 if (ia->ia_ifa.ifa_carp) 619 (*carp_detach_p)(&ia->ia_ifa); 620 621 /* 622 * If this is the last IPv4 address configured on this 623 * interface, leave the all-hosts group. 624 * No state-change report need be transmitted. 625 */ 626 if (iaIsLast && (ifp->if_flags & IFF_MULTICAST)) { 627 struct in_ifinfo *ii; 628 629 ii = ((struct in_ifinfo *)ifp->if_afdata[AF_INET]); 630 IN_MULTI_LOCK(); 631 if (ii->ii_allhosts) { 632 (void)in_leavegroup_locked(ii->ii_allhosts, NULL); 633 ii->ii_allhosts = NULL; 634 } 635 IN_MULTI_UNLOCK(); 636 } 637 638 EVENTHANDLER_INVOKE(ifaddr_event, ifp); 639 ifa_free(&ia->ia_ifa); /* in_ifaddrhead */ 640 641 return (0); 642 } 643 644 #define rtinitflags(x) \ 645 ((((x)->ia_ifp->if_flags & (IFF_LOOPBACK | IFF_POINTOPOINT)) != 0) \ 646 ? RTF_HOST : 0) 647 648 /* 649 * Check if we have a route for the given prefix already or add one accordingly. 650 */ 651 int 652 in_addprefix(struct in_ifaddr *target, int flags) 653 { 654 struct rm_priotracker in_ifa_tracker; 655 struct in_ifaddr *ia; 656 struct in_addr prefix, mask, p, m; 657 int error; 658 659 if ((flags & RTF_HOST) != 0) { 660 prefix = target->ia_dstaddr.sin_addr; 661 mask.s_addr = 0; 662 } else { 663 prefix = target->ia_addr.sin_addr; 664 mask = target->ia_sockmask.sin_addr; 665 prefix.s_addr &= mask.s_addr; 666 } 667 668 IN_IFADDR_RLOCK(&in_ifa_tracker); 669 /* Look for an existing address with the same prefix, mask, and fib */ 670 TAILQ_FOREACH(ia, &V_in_ifaddrhead, ia_link) { 671 if (rtinitflags(ia)) { 672 p = ia->ia_dstaddr.sin_addr; 673 674 if (prefix.s_addr != p.s_addr) 675 continue; 676 } else { 677 p = ia->ia_addr.sin_addr; 678 m = ia->ia_sockmask.sin_addr; 679 p.s_addr &= m.s_addr; 680 681 if (prefix.s_addr != p.s_addr || 682 mask.s_addr != m.s_addr) 683 continue; 684 } 685 if (target->ia_ifp->if_fib != ia->ia_ifp->if_fib) 686 continue; 687 688 /* 689 * If we got a matching prefix route inserted by other 690 * interface address, we are done here. 691 */ 692 if (ia->ia_flags & IFA_ROUTE) { 693 #ifdef RADIX_MPATH 694 if (ia->ia_addr.sin_addr.s_addr == 695 target->ia_addr.sin_addr.s_addr) { 696 IN_IFADDR_RUNLOCK(&in_ifa_tracker); 697 return (EEXIST); 698 } else 699 break; 700 #endif 701 if (V_nosameprefix) { 702 IN_IFADDR_RUNLOCK(&in_ifa_tracker); 703 return (EEXIST); 704 } else { 705 int fibnum; 706 707 fibnum = V_rt_add_addr_allfibs ? RT_ALL_FIBS : 708 target->ia_ifp->if_fib; 709 rt_addrmsg(RTM_ADD, &target->ia_ifa, fibnum); 710 IN_IFADDR_RUNLOCK(&in_ifa_tracker); 711 return (0); 712 } 713 } 714 } 715 IN_IFADDR_RUNLOCK(&in_ifa_tracker); 716 717 /* 718 * No-one seem to have this prefix route, so we try to insert it. 719 */ 720 error = rtinit(&target->ia_ifa, (int)RTM_ADD, flags); 721 if (!error) 722 target->ia_flags |= IFA_ROUTE; 723 return (error); 724 } 725 726 /* 727 * Removes either all lle entries for given @ia, or lle 728 * corresponding to @ia address. 729 */ 730 static void 731 in_scrubprefixlle(struct in_ifaddr *ia, int all, u_int flags) 732 { 733 struct sockaddr_in addr, mask; 734 struct sockaddr *saddr, *smask; 735 struct ifnet *ifp; 736 737 /* 738 * remove all L2 entries on the given prefix 739 */ 740 saddr = (struct sockaddr *)&addr; 741 bzero(&addr, sizeof(addr)); 742 addr.sin_len = sizeof(addr); 743 addr.sin_family = AF_INET; 744 addr.sin_addr.s_addr = ntohl(ia->ia_addr.sin_addr.s_addr); 745 smask = (struct sockaddr *)&mask; 746 bzero(&mask, sizeof(mask)); 747 mask.sin_len = sizeof(mask); 748 mask.sin_family = AF_INET; 749 mask.sin_addr.s_addr = ia->ia_subnetmask; 750 ifp = ia->ia_ifp; 751 752 if (all) 753 lltable_prefix_free(AF_INET, saddr, smask, flags); 754 else 755 lltable_delete_addr(LLTABLE(ifp), LLE_IFADDR, saddr); 756 } 757 758 /* 759 * If there is no other address in the system that can serve a route to the 760 * same prefix, remove the route. Hand over the route to the new address 761 * otherwise. 762 */ 763 int 764 in_scrubprefix(struct in_ifaddr *target, u_int flags) 765 { 766 struct rm_priotracker in_ifa_tracker; 767 struct in_ifaddr *ia; 768 struct in_addr prefix, mask, p, m; 769 int error = 0; 770 771 /* 772 * Remove the loopback route to the interface address. 773 */ 774 if ((target->ia_addr.sin_addr.s_addr != INADDR_ANY) && 775 !(target->ia_ifp->if_flags & IFF_LOOPBACK) && 776 (flags & LLE_STATIC)) { 777 struct in_ifaddr *eia; 778 779 /* 780 * XXXME: add fib-aware in_localip. 781 * We definitely don't want to switch between 782 * prefixes in different fibs. 783 */ 784 eia = in_localip_more(target); 785 786 if (eia != NULL) { 787 error = ifa_switch_loopback_route((struct ifaddr *)eia, 788 (struct sockaddr *)&target->ia_addr); 789 ifa_free(&eia->ia_ifa); 790 } else { 791 error = ifa_del_loopback_route((struct ifaddr *)target, 792 (struct sockaddr *)&target->ia_addr); 793 } 794 } 795 796 if (rtinitflags(target)) { 797 prefix = target->ia_dstaddr.sin_addr; 798 mask.s_addr = 0; 799 } else { 800 prefix = target->ia_addr.sin_addr; 801 mask = target->ia_sockmask.sin_addr; 802 prefix.s_addr &= mask.s_addr; 803 } 804 805 if ((target->ia_flags & IFA_ROUTE) == 0) { 806 int fibnum; 807 808 fibnum = V_rt_add_addr_allfibs ? RT_ALL_FIBS : 809 target->ia_ifp->if_fib; 810 rt_addrmsg(RTM_DELETE, &target->ia_ifa, fibnum); 811 return (0); 812 } 813 814 IN_IFADDR_RLOCK(&in_ifa_tracker); 815 TAILQ_FOREACH(ia, &V_in_ifaddrhead, ia_link) { 816 if (rtinitflags(ia)) { 817 p = ia->ia_dstaddr.sin_addr; 818 819 if (prefix.s_addr != p.s_addr) 820 continue; 821 } else { 822 p = ia->ia_addr.sin_addr; 823 m = ia->ia_sockmask.sin_addr; 824 p.s_addr &= m.s_addr; 825 826 if (prefix.s_addr != p.s_addr || 827 mask.s_addr != m.s_addr) 828 continue; 829 } 830 831 if ((ia->ia_ifp->if_flags & IFF_UP) == 0) 832 continue; 833 834 /* 835 * If we got a matching prefix address, move IFA_ROUTE and 836 * the route itself to it. Make sure that routing daemons 837 * get a heads-up. 838 */ 839 if ((ia->ia_flags & IFA_ROUTE) == 0) { 840 ifa_ref(&ia->ia_ifa); 841 IN_IFADDR_RUNLOCK(&in_ifa_tracker); 842 error = rtinit(&(target->ia_ifa), (int)RTM_DELETE, 843 rtinitflags(target)); 844 if (error == 0) 845 target->ia_flags &= ~IFA_ROUTE; 846 else 847 log(LOG_INFO, "in_scrubprefix: err=%d, old prefix delete failed\n", 848 error); 849 /* Scrub all entries IFF interface is different */ 850 in_scrubprefixlle(target, target->ia_ifp != ia->ia_ifp, 851 flags); 852 error = rtinit(&ia->ia_ifa, (int)RTM_ADD, 853 rtinitflags(ia) | RTF_UP); 854 if (error == 0) 855 ia->ia_flags |= IFA_ROUTE; 856 else 857 log(LOG_INFO, "in_scrubprefix: err=%d, new prefix add failed\n", 858 error); 859 ifa_free(&ia->ia_ifa); 860 return (error); 861 } 862 } 863 IN_IFADDR_RUNLOCK(&in_ifa_tracker); 864 865 /* 866 * remove all L2 entries on the given prefix 867 */ 868 in_scrubprefixlle(target, 1, flags); 869 870 /* 871 * As no-one seem to have this prefix, we can remove the route. 872 */ 873 error = rtinit(&(target->ia_ifa), (int)RTM_DELETE, rtinitflags(target)); 874 if (error == 0) 875 target->ia_flags &= ~IFA_ROUTE; 876 else 877 log(LOG_INFO, "in_scrubprefix: err=%d, prefix delete failed\n", error); 878 return (error); 879 } 880 881 #undef rtinitflags 882 883 /* 884 * Return 1 if the address might be a local broadcast address. 885 */ 886 int 887 in_broadcast(struct in_addr in, struct ifnet *ifp) 888 { 889 register struct ifaddr *ifa; 890 u_long t; 891 892 if (in.s_addr == INADDR_BROADCAST || 893 in.s_addr == INADDR_ANY) 894 return (1); 895 if ((ifp->if_flags & IFF_BROADCAST) == 0) 896 return (0); 897 t = ntohl(in.s_addr); 898 /* 899 * Look through the list of addresses for a match 900 * with a broadcast address. 901 */ 902 #define ia ((struct in_ifaddr *)ifa) 903 TAILQ_FOREACH(ifa, &ifp->if_addrhead, ifa_link) 904 if (ifa->ifa_addr->sa_family == AF_INET && 905 (in.s_addr == ia->ia_broadaddr.sin_addr.s_addr || 906 /* 907 * Check for old-style (host 0) broadcast, but 908 * taking into account that RFC 3021 obsoletes it. 909 */ 910 (ia->ia_subnetmask != IN_RFC3021_MASK && 911 t == ia->ia_subnet)) && 912 /* 913 * Check for an all one subnetmask. These 914 * only exist when an interface gets a secondary 915 * address. 916 */ 917 ia->ia_subnetmask != (u_long)0xffffffff) 918 return (1); 919 return (0); 920 #undef ia 921 } 922 923 /* 924 * On interface removal, clean up IPv4 data structures hung off of the ifnet. 925 */ 926 void 927 in_ifdetach(struct ifnet *ifp) 928 { 929 930 in_pcbpurgeif0(&V_ripcbinfo, ifp); 931 in_pcbpurgeif0(&V_udbinfo, ifp); 932 in_pcbpurgeif0(&V_ulitecbinfo, ifp); 933 in_purgemaddrs(ifp); 934 } 935 936 /* 937 * Delete all IPv4 multicast address records, and associated link-layer 938 * multicast address records, associated with ifp. 939 * XXX It looks like domifdetach runs AFTER the link layer cleanup. 940 * XXX This should not race with ifma_protospec being set during 941 * a new allocation, if it does, we have bigger problems. 942 */ 943 static void 944 in_purgemaddrs(struct ifnet *ifp) 945 { 946 LIST_HEAD(,in_multi) purgeinms; 947 struct in_multi *inm, *tinm; 948 struct ifmultiaddr *ifma; 949 950 LIST_INIT(&purgeinms); 951 IN_MULTI_LOCK(); 952 953 /* 954 * Extract list of in_multi associated with the detaching ifp 955 * which the PF_INET layer is about to release. 956 * We need to do this as IF_ADDR_LOCK() may be re-acquired 957 * by code further down. 958 */ 959 IF_ADDR_RLOCK(ifp); 960 TAILQ_FOREACH(ifma, &ifp->if_multiaddrs, ifma_link) { 961 if (ifma->ifma_addr->sa_family != AF_INET || 962 ifma->ifma_protospec == NULL) 963 continue; 964 #if 0 965 KASSERT(ifma->ifma_protospec != NULL, 966 ("%s: ifma_protospec is NULL", __func__)); 967 #endif 968 inm = (struct in_multi *)ifma->ifma_protospec; 969 LIST_INSERT_HEAD(&purgeinms, inm, inm_link); 970 } 971 IF_ADDR_RUNLOCK(ifp); 972 973 LIST_FOREACH_SAFE(inm, &purgeinms, inm_link, tinm) { 974 LIST_REMOVE(inm, inm_link); 975 inm_release_locked(inm); 976 } 977 igmp_ifdetach(ifp); 978 979 IN_MULTI_UNLOCK(); 980 } 981 982 struct in_llentry { 983 struct llentry base; 984 }; 985 986 #define IN_LLTBL_DEFAULT_HSIZE 32 987 #define IN_LLTBL_HASH(k, h) \ 988 (((((((k >> 8) ^ k) >> 8) ^ k) >> 8) ^ k) & ((h) - 1)) 989 990 /* 991 * Do actual deallocation of @lle. 992 * Called by LLE_FREE_LOCKED when number of references 993 * drops to zero. 994 */ 995 static void 996 in_lltable_destroy_lle(struct llentry *lle) 997 { 998 999 LLE_WUNLOCK(lle); 1000 LLE_LOCK_DESTROY(lle); 1001 free(lle, M_LLTABLE); 1002 } 1003 1004 static struct llentry * 1005 in_lltable_new(struct in_addr addr4, u_int flags) 1006 { 1007 struct in_llentry *lle; 1008 1009 lle = malloc(sizeof(struct in_llentry), M_LLTABLE, M_NOWAIT | M_ZERO); 1010 if (lle == NULL) /* NB: caller generates msg */ 1011 return NULL; 1012 1013 /* 1014 * For IPv4 this will trigger "arpresolve" to generate 1015 * an ARP request. 1016 */ 1017 lle->base.la_expire = time_uptime; /* mark expired */ 1018 lle->base.r_l3addr.addr4 = addr4; 1019 lle->base.lle_refcnt = 1; 1020 lle->base.lle_free = in_lltable_destroy_lle; 1021 LLE_LOCK_INIT(&lle->base); 1022 callout_init(&lle->base.lle_timer, 1); 1023 1024 return (&lle->base); 1025 } 1026 1027 #define IN_ARE_MASKED_ADDR_EQUAL(d, a, m) ( \ 1028 ((((d).s_addr ^ (a).s_addr) & (m).s_addr)) == 0 ) 1029 1030 static int 1031 in_lltable_match_prefix(const struct sockaddr *saddr, 1032 const struct sockaddr *smask, u_int flags, struct llentry *lle) 1033 { 1034 struct in_addr addr, mask, lle_addr; 1035 1036 addr = ((const struct sockaddr_in *)saddr)->sin_addr; 1037 mask = ((const struct sockaddr_in *)smask)->sin_addr; 1038 lle_addr.s_addr = ntohl(lle->r_l3addr.addr4.s_addr); 1039 1040 if (IN_ARE_MASKED_ADDR_EQUAL(lle_addr, addr, mask) == 0) 1041 return (0); 1042 1043 if (lle->la_flags & LLE_IFADDR) { 1044 1045 /* 1046 * Delete LLE_IFADDR records IFF address & flag matches. 1047 * Note that addr is the interface address within prefix 1048 * being matched. 1049 * Note also we should handle 'ifdown' cases without removing 1050 * ifaddr macs. 1051 */ 1052 if (addr.s_addr == lle_addr.s_addr && (flags & LLE_STATIC) != 0) 1053 return (1); 1054 return (0); 1055 } 1056 1057 /* flags & LLE_STATIC means deleting both dynamic and static entries */ 1058 if ((flags & LLE_STATIC) || !(lle->la_flags & LLE_STATIC)) 1059 return (1); 1060 1061 return (0); 1062 } 1063 1064 static void 1065 in_lltable_free_entry(struct lltable *llt, struct llentry *lle) 1066 { 1067 struct ifnet *ifp; 1068 size_t pkts_dropped; 1069 1070 LLE_WLOCK_ASSERT(lle); 1071 KASSERT(llt != NULL, ("lltable is NULL")); 1072 1073 /* Unlink entry from table if not already */ 1074 if ((lle->la_flags & LLE_LINKED) != 0) { 1075 ifp = llt->llt_ifp; 1076 IF_AFDATA_WLOCK_ASSERT(ifp); 1077 lltable_unlink_entry(llt, lle); 1078 } 1079 1080 /* cancel timer */ 1081 if (callout_stop(&lle->lle_timer)) 1082 LLE_REMREF(lle); 1083 1084 /* Drop hold queue */ 1085 pkts_dropped = llentry_free(lle); 1086 ARPSTAT_ADD(dropped, pkts_dropped); 1087 } 1088 1089 static int 1090 in_lltable_rtcheck(struct ifnet *ifp, u_int flags, const struct sockaddr *l3addr) 1091 { 1092 struct rtentry *rt; 1093 1094 KASSERT(l3addr->sa_family == AF_INET, 1095 ("sin_family %d", l3addr->sa_family)); 1096 1097 /* XXX rtalloc1_fib should take a const param */ 1098 rt = rtalloc1_fib(__DECONST(struct sockaddr *, l3addr), 0, 0, 1099 ifp->if_fib); 1100 1101 if (rt == NULL) 1102 return (EINVAL); 1103 1104 /* 1105 * If the gateway for an existing host route matches the target L3 1106 * address, which is a special route inserted by some implementation 1107 * such as MANET, and the interface is of the correct type, then 1108 * allow for ARP to proceed. 1109 */ 1110 if (rt->rt_flags & RTF_GATEWAY) { 1111 if (!(rt->rt_flags & RTF_HOST) || !rt->rt_ifp || 1112 rt->rt_ifp->if_type != IFT_ETHER || 1113 (rt->rt_ifp->if_flags & (IFF_NOARP | IFF_STATICARP)) != 0 || 1114 memcmp(rt->rt_gateway->sa_data, l3addr->sa_data, 1115 sizeof(in_addr_t)) != 0) { 1116 RTFREE_LOCKED(rt); 1117 return (EINVAL); 1118 } 1119 } 1120 1121 /* 1122 * Make sure that at least the destination address is covered 1123 * by the route. This is for handling the case where 2 or more 1124 * interfaces have the same prefix. An incoming packet arrives 1125 * on one interface and the corresponding outgoing packet leaves 1126 * another interface. 1127 */ 1128 if (!(rt->rt_flags & RTF_HOST) && rt->rt_ifp != ifp) { 1129 const char *sa, *mask, *addr, *lim; 1130 int len; 1131 1132 mask = (const char *)rt_mask(rt); 1133 /* 1134 * Just being extra cautious to avoid some custom 1135 * code getting into trouble. 1136 */ 1137 if (mask == NULL) { 1138 RTFREE_LOCKED(rt); 1139 return (EINVAL); 1140 } 1141 1142 sa = (const char *)rt_key(rt); 1143 addr = (const char *)l3addr; 1144 len = ((const struct sockaddr_in *)l3addr)->sin_len; 1145 lim = addr + len; 1146 1147 for ( ; addr < lim; sa++, mask++, addr++) { 1148 if ((*sa ^ *addr) & *mask) { 1149 #ifdef DIAGNOSTIC 1150 log(LOG_INFO, "IPv4 address: \"%s\" is not on the network\n", 1151 inet_ntoa(((const struct sockaddr_in *)l3addr)->sin_addr)); 1152 #endif 1153 RTFREE_LOCKED(rt); 1154 return (EINVAL); 1155 } 1156 } 1157 } 1158 1159 RTFREE_LOCKED(rt); 1160 return (0); 1161 } 1162 1163 static inline uint32_t 1164 in_lltable_hash_dst(const struct in_addr dst, uint32_t hsize) 1165 { 1166 1167 return (IN_LLTBL_HASH(dst.s_addr, hsize)); 1168 } 1169 1170 static uint32_t 1171 in_lltable_hash(const struct llentry *lle, uint32_t hsize) 1172 { 1173 1174 return (in_lltable_hash_dst(lle->r_l3addr.addr4, hsize)); 1175 } 1176 1177 static void 1178 in_lltable_fill_sa_entry(const struct llentry *lle, struct sockaddr *sa) 1179 { 1180 struct sockaddr_in *sin; 1181 1182 sin = (struct sockaddr_in *)sa; 1183 bzero(sin, sizeof(*sin)); 1184 sin->sin_family = AF_INET; 1185 sin->sin_len = sizeof(*sin); 1186 sin->sin_addr = lle->r_l3addr.addr4; 1187 } 1188 1189 static inline struct llentry * 1190 in_lltable_find_dst(struct lltable *llt, struct in_addr dst) 1191 { 1192 struct llentry *lle; 1193 struct llentries *lleh; 1194 u_int hashidx; 1195 1196 hashidx = in_lltable_hash_dst(dst, llt->llt_hsize); 1197 lleh = &llt->lle_head[hashidx]; 1198 LIST_FOREACH(lle, lleh, lle_next) { 1199 if (lle->la_flags & LLE_DELETED) 1200 continue; 1201 if (lle->r_l3addr.addr4.s_addr == dst.s_addr) 1202 break; 1203 } 1204 1205 return (lle); 1206 } 1207 1208 static void 1209 in_lltable_delete_entry(struct lltable *llt, struct llentry *lle) 1210 { 1211 1212 lle->la_flags |= LLE_DELETED; 1213 EVENTHANDLER_INVOKE(lle_event, lle, LLENTRY_DELETED); 1214 #ifdef DIAGNOSTIC 1215 log(LOG_INFO, "ifaddr cache = %p is deleted\n", lle); 1216 #endif 1217 llentry_free(lle); 1218 } 1219 1220 static struct llentry * 1221 in_lltable_alloc(struct lltable *llt, u_int flags, const struct sockaddr *l3addr) 1222 { 1223 const struct sockaddr_in *sin = (const struct sockaddr_in *)l3addr; 1224 struct ifnet *ifp = llt->llt_ifp; 1225 struct llentry *lle; 1226 1227 KASSERT(l3addr->sa_family == AF_INET, 1228 ("sin_family %d", l3addr->sa_family)); 1229 1230 /* 1231 * A route that covers the given address must have 1232 * been installed 1st because we are doing a resolution, 1233 * verify this. 1234 */ 1235 if (!(flags & LLE_IFADDR) && 1236 in_lltable_rtcheck(ifp, flags, l3addr) != 0) 1237 return (NULL); 1238 1239 lle = in_lltable_new(sin->sin_addr, flags); 1240 if (lle == NULL) { 1241 log(LOG_INFO, "lla_lookup: new lle malloc failed\n"); 1242 return (NULL); 1243 } 1244 lle->la_flags = flags; 1245 if ((flags & LLE_IFADDR) == LLE_IFADDR) { 1246 bcopy(IF_LLADDR(ifp), &lle->ll_addr, ifp->if_addrlen); 1247 lle->la_flags |= (LLE_VALID | LLE_STATIC); 1248 } 1249 1250 return (lle); 1251 } 1252 1253 /* 1254 * Return NULL if not found or marked for deletion. 1255 * If found return lle read locked. 1256 */ 1257 static struct llentry * 1258 in_lltable_lookup(struct lltable *llt, u_int flags, const struct sockaddr *l3addr) 1259 { 1260 const struct sockaddr_in *sin = (const struct sockaddr_in *)l3addr; 1261 struct llentry *lle; 1262 1263 IF_AFDATA_LOCK_ASSERT(llt->llt_ifp); 1264 KASSERT(l3addr->sa_family == AF_INET, 1265 ("sin_family %d", l3addr->sa_family)); 1266 lle = in_lltable_find_dst(llt, sin->sin_addr); 1267 1268 if (lle == NULL) 1269 return (NULL); 1270 1271 if (flags & LLE_EXCLUSIVE) 1272 LLE_WLOCK(lle); 1273 else 1274 LLE_RLOCK(lle); 1275 1276 return (lle); 1277 } 1278 1279 static int 1280 in_lltable_dump_entry(struct lltable *llt, struct llentry *lle, 1281 struct sysctl_req *wr) 1282 { 1283 struct ifnet *ifp = llt->llt_ifp; 1284 /* XXX stack use */ 1285 struct { 1286 struct rt_msghdr rtm; 1287 struct sockaddr_in sin; 1288 struct sockaddr_dl sdl; 1289 } arpc; 1290 struct sockaddr_dl *sdl; 1291 int error; 1292 1293 bzero(&arpc, sizeof(arpc)); 1294 /* skip deleted entries */ 1295 if ((lle->la_flags & LLE_DELETED) == LLE_DELETED) 1296 return (0); 1297 /* Skip if jailed and not a valid IP of the prison. */ 1298 lltable_fill_sa_entry(lle,(struct sockaddr *)&arpc.sin); 1299 if (prison_if(wr->td->td_ucred, 1300 (struct sockaddr *)&arpc.sin) != 0) 1301 return (0); 1302 /* 1303 * produce a msg made of: 1304 * struct rt_msghdr; 1305 * struct sockaddr_in; (IPv4) 1306 * struct sockaddr_dl; 1307 */ 1308 arpc.rtm.rtm_msglen = sizeof(arpc); 1309 arpc.rtm.rtm_version = RTM_VERSION; 1310 arpc.rtm.rtm_type = RTM_GET; 1311 arpc.rtm.rtm_flags = RTF_UP; 1312 arpc.rtm.rtm_addrs = RTA_DST | RTA_GATEWAY; 1313 1314 /* publish */ 1315 if (lle->la_flags & LLE_PUB) 1316 arpc.rtm.rtm_flags |= RTF_ANNOUNCE; 1317 1318 sdl = &arpc.sdl; 1319 sdl->sdl_family = AF_LINK; 1320 sdl->sdl_len = sizeof(*sdl); 1321 sdl->sdl_index = ifp->if_index; 1322 sdl->sdl_type = ifp->if_type; 1323 if ((lle->la_flags & LLE_VALID) == LLE_VALID) { 1324 sdl->sdl_alen = ifp->if_addrlen; 1325 bcopy(&lle->ll_addr, LLADDR(sdl), ifp->if_addrlen); 1326 } else { 1327 sdl->sdl_alen = 0; 1328 bzero(LLADDR(sdl), ifp->if_addrlen); 1329 } 1330 1331 arpc.rtm.rtm_rmx.rmx_expire = 1332 lle->la_flags & LLE_STATIC ? 0 : lle->la_expire; 1333 arpc.rtm.rtm_flags |= (RTF_HOST | RTF_LLDATA); 1334 if (lle->la_flags & LLE_STATIC) 1335 arpc.rtm.rtm_flags |= RTF_STATIC; 1336 arpc.rtm.rtm_index = ifp->if_index; 1337 error = SYSCTL_OUT(wr, &arpc, sizeof(arpc)); 1338 1339 return (error); 1340 } 1341 1342 static struct lltable * 1343 in_lltattach(struct ifnet *ifp) 1344 { 1345 struct lltable *llt; 1346 1347 llt = lltable_allocate_htbl(IN_LLTBL_DEFAULT_HSIZE); 1348 llt->llt_af = AF_INET; 1349 llt->llt_ifp = ifp; 1350 1351 llt->llt_lookup = in_lltable_lookup; 1352 llt->llt_alloc_entry = in_lltable_alloc; 1353 llt->llt_delete_entry = in_lltable_delete_entry; 1354 llt->llt_dump_entry = in_lltable_dump_entry; 1355 llt->llt_hash = in_lltable_hash; 1356 llt->llt_fill_sa_entry = in_lltable_fill_sa_entry; 1357 llt->llt_free_entry = in_lltable_free_entry; 1358 llt->llt_match_prefix = in_lltable_match_prefix; 1359 lltable_link(llt); 1360 1361 return (llt); 1362 } 1363 1364 void * 1365 in_domifattach(struct ifnet *ifp) 1366 { 1367 struct in_ifinfo *ii; 1368 1369 ii = malloc(sizeof(struct in_ifinfo), M_IFADDR, M_WAITOK|M_ZERO); 1370 1371 ii->ii_llt = in_lltattach(ifp); 1372 ii->ii_igmp = igmp_domifattach(ifp); 1373 1374 return (ii); 1375 } 1376 1377 void 1378 in_domifdetach(struct ifnet *ifp, void *aux) 1379 { 1380 struct in_ifinfo *ii = (struct in_ifinfo *)aux; 1381 1382 igmp_domifdetach(ifp); 1383 lltable_free(ii->ii_llt); 1384 free(ii, M_IFADDR); 1385 } 1386