1 /* $OpenBSD: pf_if.c,v 1.106 2022/06/26 11:37:08 mbuhl Exp $ */ 2 3 /* 4 * Copyright 2005 Henning Brauer <henning@openbsd.org> 5 * Copyright 2005 Ryan McBride <mcbride@openbsd.org> 6 * Copyright (c) 2001 Daniel Hartmeier 7 * Copyright (c) 2003 Cedric Berger 8 * All rights reserved. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 14 * - Redistributions of source code must retain the above copyright 15 * notice, this list of conditions and the following disclaimer. 16 * - Redistributions in binary form must reproduce the above 17 * copyright notice, this list of conditions and the following 18 * disclaimer in the documentation and/or other materials provided 19 * with the distribution. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 22 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 23 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS 24 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE 25 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, 26 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, 27 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; 28 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER 29 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN 31 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 32 * POSSIBILITY OF SUCH DAMAGE. 33 */ 34 35 #include <sys/param.h> 36 #include <sys/systm.h> 37 #include <sys/mbuf.h> 38 #include <sys/filio.h> 39 #include <sys/socket.h> 40 #include <sys/socketvar.h> 41 #include <sys/kernel.h> 42 #include <sys/device.h> 43 #include <sys/time.h> 44 #include <sys/pool.h> 45 #include <sys/syslog.h> 46 47 #include <net/if.h> 48 #include <net/if_var.h> 49 50 #include <netinet/in.h> 51 #include <netinet/ip.h> 52 #include <netinet/ip_var.h> 53 54 #include <net/pfvar.h> 55 56 #ifdef INET6 57 #include <netinet/ip6.h> 58 #endif /* INET6 */ 59 60 #define isupper(c) ((c) >= 'A' && (c) <= 'Z') 61 #define islower(c) ((c) >= 'a' && (c) <= 'z') 62 #define isalpha(c) (isupper(c)||islower(c)) 63 64 struct pfi_kif *pfi_all = NULL; 65 struct pool pfi_addr_pl; 66 struct pfi_ifhead pfi_ifs; 67 long pfi_update = 1; 68 struct pfr_addr *pfi_buffer; 69 int pfi_buffer_cnt; 70 int pfi_buffer_max; 71 72 void pfi_kif_update(struct pfi_kif *); 73 void pfi_dynaddr_update(struct pfi_dynaddr *dyn); 74 void pfi_table_update(struct pfr_ktable *, struct pfi_kif *, 75 u_int8_t, int); 76 void pfi_kifaddr_update(void *); 77 void pfi_instance_add(struct ifnet *, u_int8_t, int); 78 void pfi_address_add(struct sockaddr *, sa_family_t, u_int8_t); 79 int pfi_if_compare(struct pfi_kif *, struct pfi_kif *); 80 int pfi_skip_if(const char *, struct pfi_kif *); 81 int pfi_unmask(void *); 82 void pfi_group_change(const char *); 83 84 RB_PROTOTYPE(pfi_ifhead, pfi_kif, pfik_tree, pfi_if_compare); 85 RB_GENERATE(pfi_ifhead, pfi_kif, pfik_tree, pfi_if_compare); 86 87 #define PFI_BUFFER_MAX 0x10000 88 #define PFI_MTYPE M_IFADDR 89 90 struct pfi_kif * 91 pfi_kif_alloc(const char *kif_name, int mflags) 92 { 93 struct pfi_kif *kif; 94 95 kif = malloc(sizeof(*pfi_all), PFI_MTYPE, mflags|M_ZERO); 96 if (kif == NULL) 97 return (NULL); 98 strlcpy(kif->pfik_name, kif_name, sizeof(kif->pfik_name)); 99 kif->pfik_tzero = gettime(); 100 TAILQ_INIT(&kif->pfik_dynaddrs); 101 102 if (!strcmp(kif->pfik_name, "any")) { 103 /* both so it works in the ioctl and the regular case */ 104 kif->pfik_flags |= PFI_IFLAG_ANY; 105 kif->pfik_flags_new |= PFI_IFLAG_ANY; 106 } 107 108 return (kif); 109 } 110 111 void 112 pfi_kif_free(struct pfi_kif *kif) 113 { 114 if (kif == NULL) 115 return; 116 117 if (kif->pfik_rules || kif->pfik_states || kif->pfik_routes || 118 kif->pfik_srcnodes || kif->pfik_flagrefs) 119 panic("kif is still alive"); 120 121 free(kif, PFI_MTYPE, sizeof(*kif)); 122 } 123 124 void 125 pfi_initialize(void) 126 { 127 /* 128 * The first time we arrive here is during kernel boot, 129 * when if_attachsetup() for the first time. No locking 130 * is needed in this case, because it's granted there 131 * is a single thread, which sets pfi_all global var. 132 */ 133 if (pfi_all != NULL) /* already initialized */ 134 return; 135 136 pool_init(&pfi_addr_pl, sizeof(struct pfi_dynaddr), 0, IPL_SOFTNET, 0, 137 "pfiaddrpl", NULL); 138 pfi_buffer_max = 64; 139 pfi_buffer = mallocarray(pfi_buffer_max, sizeof(*pfi_buffer), 140 PFI_MTYPE, M_WAITOK); 141 142 pfi_all = pfi_kif_alloc(IFG_ALL, M_WAITOK); 143 144 if (RB_INSERT(pfi_ifhead, &pfi_ifs, pfi_all) != NULL) 145 panic("IFG_ALL kif found already"); 146 } 147 148 struct pfi_kif * 149 pfi_kif_find(const char *kif_name) 150 { 151 struct pfi_kif_cmp s; 152 153 memset(&s, 0, sizeof(s)); 154 strlcpy(s.pfik_name, kif_name, sizeof(s.pfik_name)); 155 return (RB_FIND(pfi_ifhead, &pfi_ifs, (struct pfi_kif *)&s)); 156 } 157 158 struct pfi_kif * 159 pfi_kif_get(const char *kif_name, struct pfi_kif **prealloc) 160 { 161 struct pfi_kif *kif; 162 163 if ((kif = pfi_kif_find(kif_name))) 164 return (kif); 165 166 /* create new one */ 167 if ((prealloc == NULL) || (*prealloc == NULL)) { 168 kif = pfi_kif_alloc(kif_name, M_NOWAIT); 169 if (kif == NULL) 170 return (NULL); 171 } else { 172 kif = *prealloc; 173 *prealloc = NULL; 174 } 175 176 RB_INSERT(pfi_ifhead, &pfi_ifs, kif); 177 return (kif); 178 } 179 180 void 181 pfi_kif_ref(struct pfi_kif *kif, enum pfi_kif_refs what) 182 { 183 switch (what) { 184 case PFI_KIF_REF_RULE: 185 kif->pfik_rules++; 186 break; 187 case PFI_KIF_REF_STATE: 188 kif->pfik_states++; 189 break; 190 case PFI_KIF_REF_ROUTE: 191 kif->pfik_routes++; 192 break; 193 case PFI_KIF_REF_SRCNODE: 194 kif->pfik_srcnodes++; 195 break; 196 case PFI_KIF_REF_FLAG: 197 kif->pfik_flagrefs++; 198 break; 199 default: 200 panic("pfi_kif_ref with unknown type"); 201 } 202 } 203 204 void 205 pfi_kif_unref(struct pfi_kif *kif, enum pfi_kif_refs what) 206 { 207 if (kif == NULL) 208 return; 209 210 switch (what) { 211 case PFI_KIF_REF_NONE: 212 break; 213 case PFI_KIF_REF_RULE: 214 if (kif->pfik_rules <= 0) { 215 DPFPRINTF(LOG_ERR, 216 "pfi_kif_unref (%s): rules refcount <= 0", 217 kif->pfik_name); 218 return; 219 } 220 kif->pfik_rules--; 221 break; 222 case PFI_KIF_REF_STATE: 223 if (kif->pfik_states <= 0) { 224 DPFPRINTF(LOG_ERR, 225 "pfi_kif_unref (%s): state refcount <= 0", 226 kif->pfik_name); 227 return; 228 } 229 kif->pfik_states--; 230 break; 231 case PFI_KIF_REF_ROUTE: 232 if (kif->pfik_routes <= 0) { 233 DPFPRINTF(LOG_ERR, 234 "pfi_kif_unref (%s): route refcount <= 0", 235 kif->pfik_name); 236 return; 237 } 238 kif->pfik_routes--; 239 break; 240 case PFI_KIF_REF_SRCNODE: 241 if (kif->pfik_srcnodes <= 0) { 242 DPFPRINTF(LOG_ERR, 243 "pfi_kif_unref (%s): src-node refcount <= 0", 244 kif->pfik_name); 245 return; 246 } 247 kif->pfik_srcnodes--; 248 break; 249 case PFI_KIF_REF_FLAG: 250 if (kif->pfik_flagrefs <= 0) { 251 DPFPRINTF(LOG_ERR, 252 "pfi_kif_unref (%s): flags refcount <= 0", 253 kif->pfik_name); 254 return; 255 } 256 kif->pfik_flagrefs--; 257 break; 258 default: 259 panic("pfi_kif_unref (%s) with unknown type", kif->pfik_name); 260 } 261 262 if (kif->pfik_ifp != NULL || kif->pfik_group != NULL || kif == pfi_all) 263 return; 264 265 if (kif->pfik_rules || kif->pfik_states || kif->pfik_routes || 266 kif->pfik_srcnodes || kif->pfik_flagrefs) 267 return; 268 269 RB_REMOVE(pfi_ifhead, &pfi_ifs, kif); 270 free(kif, PFI_MTYPE, sizeof(*kif)); 271 } 272 273 int 274 pfi_kif_match(struct pfi_kif *rule_kif, struct pfi_kif *packet_kif) 275 { 276 struct ifg_list *p; 277 278 if (rule_kif == NULL || rule_kif == packet_kif) 279 return (1); 280 281 if (rule_kif->pfik_group != NULL) 282 TAILQ_FOREACH(p, &packet_kif->pfik_ifp->if_groups, ifgl_next) 283 if (p->ifgl_group == rule_kif->pfik_group) 284 return (1); 285 286 if (rule_kif->pfik_flags & PFI_IFLAG_ANY && packet_kif->pfik_ifp && 287 !(packet_kif->pfik_ifp->if_flags & IFF_LOOPBACK)) 288 return (1); 289 290 return (0); 291 } 292 293 void 294 pfi_attach_ifnet(struct ifnet *ifp) 295 { 296 struct pfi_kif *kif; 297 struct task *t; 298 299 pfi_initialize(); 300 pfi_update++; 301 if ((kif = pfi_kif_get(ifp->if_xname, NULL)) == NULL) 302 panic("%s: pfi_kif_get failed", __func__); 303 304 kif->pfik_ifp = ifp; 305 ifp->if_pf_kif = (caddr_t)kif; 306 307 t = malloc(sizeof(*t), PFI_MTYPE, M_WAITOK); 308 task_set(t, pfi_kifaddr_update, kif); 309 if_addrhook_add(ifp, t); 310 kif->pfik_ah_cookie = t; 311 312 pfi_kif_update(kif); 313 } 314 315 void 316 pfi_detach_ifnet(struct ifnet *ifp) 317 { 318 struct pfi_kif *kif; 319 struct task *t; 320 321 if ((kif = (struct pfi_kif *)ifp->if_pf_kif) == NULL) 322 return; 323 324 pfi_update++; 325 t = kif->pfik_ah_cookie; 326 kif->pfik_ah_cookie = NULL; 327 if_addrhook_del(ifp, t); 328 free(t, PFI_MTYPE, sizeof(*t)); 329 330 pfi_kif_update(kif); 331 332 kif->pfik_ifp = NULL; 333 ifp->if_pf_kif = NULL; 334 pfi_kif_unref(kif, PFI_KIF_REF_NONE); 335 } 336 337 void 338 pfi_attach_ifgroup(struct ifg_group *ifg) 339 { 340 struct pfi_kif *kif; 341 342 pfi_initialize(); 343 pfi_update++; 344 if ((kif = pfi_kif_get(ifg->ifg_group, NULL)) == NULL) 345 panic("%s: pfi_kif_get failed", __func__); 346 347 kif->pfik_group = ifg; 348 ifg->ifg_pf_kif = (caddr_t)kif; 349 } 350 351 void 352 pfi_detach_ifgroup(struct ifg_group *ifg) 353 { 354 struct pfi_kif *kif; 355 356 if ((kif = (struct pfi_kif *)ifg->ifg_pf_kif) == NULL) 357 return; 358 359 pfi_update++; 360 361 kif->pfik_group = NULL; 362 ifg->ifg_pf_kif = NULL; 363 pfi_kif_unref(kif, PFI_KIF_REF_NONE); 364 } 365 366 void 367 pfi_group_change(const char *group) 368 { 369 struct pfi_kif *kif; 370 371 pfi_update++; 372 if ((kif = pfi_kif_get(group, NULL)) == NULL) 373 panic("%s: pfi_kif_get failed", __func__); 374 375 pfi_kif_update(kif); 376 } 377 378 void 379 pfi_group_delmember(const char *group) 380 { 381 pfi_group_change(group); 382 pfi_xcommit(); 383 } 384 385 void 386 pfi_group_addmember(const char *group) 387 { 388 pfi_group_change(group); 389 pfi_xcommit(); 390 } 391 392 int 393 pfi_match_addr(struct pfi_dynaddr *dyn, struct pf_addr *a, sa_family_t af) 394 { 395 switch (af) { 396 case AF_INET: 397 switch (dyn->pfid_acnt4) { 398 case 0: 399 return (0); 400 case 1: 401 return (pf_match_addr(0, &dyn->pfid_addr4, 402 &dyn->pfid_mask4, a, AF_INET)); 403 default: 404 return (pfr_match_addr(dyn->pfid_kt, a, AF_INET)); 405 } 406 break; 407 #ifdef INET6 408 case AF_INET6: 409 switch (dyn->pfid_acnt6) { 410 case 0: 411 return (0); 412 case 1: 413 return (pf_match_addr(0, &dyn->pfid_addr6, 414 &dyn->pfid_mask6, a, AF_INET6)); 415 default: 416 return (pfr_match_addr(dyn->pfid_kt, a, AF_INET6)); 417 } 418 break; 419 #endif /* INET6 */ 420 default: 421 return (0); 422 } 423 } 424 425 int 426 pfi_dynaddr_setup(struct pf_addr_wrap *aw, sa_family_t af, int wait) 427 { 428 struct pfi_dynaddr *dyn; 429 char tblname[PF_TABLE_NAME_SIZE]; 430 struct pf_ruleset *ruleset = NULL; 431 int rv = 0; 432 433 if (aw->type != PF_ADDR_DYNIFTL) 434 return (0); 435 if ((dyn = pool_get(&pfi_addr_pl, wait|PR_LIMITFAIL|PR_ZERO)) == NULL) 436 return (1); 437 438 if (!strcmp(aw->v.ifname, "self")) 439 dyn->pfid_kif = pfi_kif_get(IFG_ALL, NULL); 440 else 441 dyn->pfid_kif = pfi_kif_get(aw->v.ifname, NULL); 442 if (dyn->pfid_kif == NULL) { 443 rv = 1; 444 goto _bad; 445 } 446 pfi_kif_ref(dyn->pfid_kif, PFI_KIF_REF_RULE); 447 448 dyn->pfid_net = pfi_unmask(&aw->v.a.mask); 449 if (af == AF_INET && dyn->pfid_net == 32) 450 dyn->pfid_net = 128; 451 strlcpy(tblname, aw->v.ifname, sizeof(tblname)); 452 if (aw->iflags & PFI_AFLAG_NETWORK) 453 strlcat(tblname, ":network", sizeof(tblname)); 454 if (aw->iflags & PFI_AFLAG_BROADCAST) 455 strlcat(tblname, ":broadcast", sizeof(tblname)); 456 if (aw->iflags & PFI_AFLAG_PEER) 457 strlcat(tblname, ":peer", sizeof(tblname)); 458 if (aw->iflags & PFI_AFLAG_NOALIAS) 459 strlcat(tblname, ":0", sizeof(tblname)); 460 if (dyn->pfid_net != 128) 461 snprintf(tblname + strlen(tblname), 462 sizeof(tblname) - strlen(tblname), "/%d", dyn->pfid_net); 463 if ((ruleset = pf_find_or_create_ruleset(PF_RESERVED_ANCHOR)) == NULL) { 464 rv = 1; 465 goto _bad; 466 } 467 468 if ((dyn->pfid_kt = pfr_attach_table(ruleset, tblname, wait)) == NULL) { 469 rv = 1; 470 goto _bad; 471 } 472 473 dyn->pfid_kt->pfrkt_flags |= PFR_TFLAG_ACTIVE; 474 dyn->pfid_iflags = aw->iflags; 475 dyn->pfid_af = af; 476 477 TAILQ_INSERT_TAIL(&dyn->pfid_kif->pfik_dynaddrs, dyn, entry); 478 aw->p.dyn = dyn; 479 pfi_kif_update(dyn->pfid_kif); 480 return (0); 481 482 _bad: 483 if (dyn->pfid_kt != NULL) 484 pfr_detach_table(dyn->pfid_kt); 485 if (ruleset != NULL) 486 pf_remove_if_empty_ruleset(ruleset); 487 if (dyn->pfid_kif != NULL) 488 pfi_kif_unref(dyn->pfid_kif, PFI_KIF_REF_RULE); 489 pool_put(&pfi_addr_pl, dyn); 490 return (rv); 491 } 492 493 void 494 pfi_kif_update(struct pfi_kif *kif) 495 { 496 struct ifg_list *ifgl; 497 struct pfi_dynaddr *p; 498 499 /* update all dynaddr */ 500 TAILQ_FOREACH(p, &kif->pfik_dynaddrs, entry) 501 pfi_dynaddr_update(p); 502 503 /* again for all groups kif is member of */ 504 if (kif->pfik_ifp != NULL) 505 TAILQ_FOREACH(ifgl, &kif->pfik_ifp->if_groups, ifgl_next) 506 pfi_kif_update((struct pfi_kif *) 507 ifgl->ifgl_group->ifg_pf_kif); 508 } 509 510 void 511 pfi_dynaddr_update(struct pfi_dynaddr *dyn) 512 { 513 struct pfi_kif *kif; 514 struct pfr_ktable *kt; 515 516 if (dyn == NULL || dyn->pfid_kif == NULL || dyn->pfid_kt == NULL) 517 panic("pfi_dynaddr_update"); 518 519 kif = dyn->pfid_kif; 520 kt = dyn->pfid_kt; 521 522 if (kt->pfrkt_larg != pfi_update) { 523 /* this table needs to be brought up-to-date */ 524 pfi_table_update(kt, kif, dyn->pfid_net, dyn->pfid_iflags); 525 kt->pfrkt_larg = pfi_update; 526 } 527 pfr_dynaddr_update(kt, dyn); 528 } 529 530 void 531 pfi_table_update(struct pfr_ktable *kt, struct pfi_kif *kif, u_int8_t net, int flags) 532 { 533 int e, size2 = 0; 534 struct ifg_member *ifgm; 535 536 pfi_buffer_cnt = 0; 537 538 if (kif->pfik_ifp != NULL) 539 pfi_instance_add(kif->pfik_ifp, net, flags); 540 else if (kif->pfik_group != NULL) 541 TAILQ_FOREACH(ifgm, &kif->pfik_group->ifg_members, ifgm_next) 542 pfi_instance_add(ifgm->ifgm_ifp, net, flags); 543 544 if ((e = pfr_set_addrs(&kt->pfrkt_t, pfi_buffer, pfi_buffer_cnt, &size2, 545 NULL, NULL, NULL, 0, PFR_TFLAG_ALLMASK))) 546 DPFPRINTF(LOG_ERR, 547 "pfi_table_update: cannot set %d new addresses " 548 "into table %s: %d", pfi_buffer_cnt, kt->pfrkt_name, e); 549 } 550 551 void 552 pfi_instance_add(struct ifnet *ifp, u_int8_t net, int flags) 553 { 554 struct ifaddr *ifa; 555 int got4 = 0, got6 = 0; 556 int net2, af; 557 558 if (ifp == NULL) 559 return; 560 TAILQ_FOREACH(ifa, &ifp->if_addrlist, ifa_list) { 561 if (ifa->ifa_addr == NULL) 562 continue; 563 af = ifa->ifa_addr->sa_family; 564 if (af != AF_INET && af != AF_INET6) 565 continue; 566 if ((flags & PFI_AFLAG_BROADCAST) && af == AF_INET6) 567 continue; 568 if ((flags & PFI_AFLAG_BROADCAST) && 569 !(ifp->if_flags & IFF_BROADCAST)) 570 continue; 571 if ((flags & PFI_AFLAG_PEER) && 572 !(ifp->if_flags & IFF_POINTOPOINT)) 573 continue; 574 if ((flags & PFI_AFLAG_NETWORK) && af == AF_INET6 && 575 IN6_IS_ADDR_LINKLOCAL( 576 &((struct sockaddr_in6 *)ifa->ifa_addr)->sin6_addr)) 577 continue; 578 if (flags & PFI_AFLAG_NOALIAS) { 579 if (af == AF_INET && got4) 580 continue; 581 if (af == AF_INET6 && got6) 582 continue; 583 } 584 if (af == AF_INET) 585 got4 = 1; 586 else if (af == AF_INET6) 587 got6 = 1; 588 net2 = net; 589 if (net2 == 128 && (flags & PFI_AFLAG_NETWORK)) { 590 if (af == AF_INET) 591 net2 = pfi_unmask(&((struct sockaddr_in *) 592 ifa->ifa_netmask)->sin_addr); 593 else if (af == AF_INET6) 594 net2 = pfi_unmask(&((struct sockaddr_in6 *) 595 ifa->ifa_netmask)->sin6_addr); 596 } 597 if (af == AF_INET && net2 > 32) 598 net2 = 32; 599 if (flags & PFI_AFLAG_BROADCAST) 600 pfi_address_add(ifa->ifa_broadaddr, af, net2); 601 else if (flags & PFI_AFLAG_PEER) 602 pfi_address_add(ifa->ifa_dstaddr, af, net2); 603 else 604 pfi_address_add(ifa->ifa_addr, af, net2); 605 } 606 } 607 608 void 609 pfi_address_add(struct sockaddr *sa, sa_family_t af, u_int8_t net) 610 { 611 struct pfr_addr *p; 612 int i; 613 614 if (pfi_buffer_cnt >= pfi_buffer_max) { 615 int new_max = pfi_buffer_max * 2; 616 617 if (new_max > PFI_BUFFER_MAX) { 618 DPFPRINTF(LOG_ERR, 619 "pfi_address_add: address buffer full (%d/%d)", 620 pfi_buffer_cnt, PFI_BUFFER_MAX); 621 return; 622 } 623 p = mallocarray(new_max, sizeof(*pfi_buffer), PFI_MTYPE, 624 M_DONTWAIT); 625 if (p == NULL) { 626 DPFPRINTF(LOG_ERR, 627 "pfi_address_add: no memory to grow buffer " 628 "(%d/%d)", pfi_buffer_cnt, PFI_BUFFER_MAX); 629 return; 630 } 631 memcpy(p, pfi_buffer, pfi_buffer_max * sizeof(*pfi_buffer)); 632 /* no need to zero buffer */ 633 free(pfi_buffer, PFI_MTYPE, pfi_buffer_max * sizeof(*pfi_buffer)); 634 pfi_buffer = p; 635 pfi_buffer_max = new_max; 636 } 637 if (af == AF_INET && net > 32) 638 net = 128; 639 p = pfi_buffer + pfi_buffer_cnt++; 640 memset(p, 0, sizeof(*p)); 641 p->pfra_af = af; 642 p->pfra_net = net; 643 if (af == AF_INET) 644 p->pfra_ip4addr = ((struct sockaddr_in *)sa)->sin_addr; 645 else if (af == AF_INET6) { 646 p->pfra_ip6addr = ((struct sockaddr_in6 *)sa)->sin6_addr; 647 if (IN6_IS_SCOPE_EMBED(&p->pfra_ip6addr)) 648 p->pfra_ip6addr.s6_addr16[1] = 0; 649 } 650 /* mask network address bits */ 651 if (net < 128) 652 ((caddr_t)p)[p->pfra_net/8] &= ~(0xFF >> (p->pfra_net%8)); 653 for (i = (p->pfra_net+7)/8; i < sizeof(p->pfra_u); i++) 654 ((caddr_t)p)[i] = 0; 655 } 656 657 void 658 pfi_dynaddr_remove(struct pf_addr_wrap *aw) 659 { 660 if (aw->type != PF_ADDR_DYNIFTL || aw->p.dyn == NULL || 661 aw->p.dyn->pfid_kif == NULL || aw->p.dyn->pfid_kt == NULL) 662 return; 663 664 TAILQ_REMOVE(&aw->p.dyn->pfid_kif->pfik_dynaddrs, aw->p.dyn, entry); 665 pfi_kif_unref(aw->p.dyn->pfid_kif, PFI_KIF_REF_RULE); 666 aw->p.dyn->pfid_kif = NULL; 667 pfr_detach_table(aw->p.dyn->pfid_kt); 668 aw->p.dyn->pfid_kt = NULL; 669 pool_put(&pfi_addr_pl, aw->p.dyn); 670 aw->p.dyn = NULL; 671 } 672 673 void 674 pfi_dynaddr_copyout(struct pf_addr_wrap *aw) 675 { 676 if (aw->type != PF_ADDR_DYNIFTL || aw->p.dyn == NULL || 677 aw->p.dyn->pfid_kif == NULL) 678 return; 679 aw->p.dyncnt = aw->p.dyn->pfid_acnt4 + aw->p.dyn->pfid_acnt6; 680 } 681 682 void 683 pfi_kifaddr_update(void *v) 684 { 685 struct pfi_kif *kif = (struct pfi_kif *)v; 686 687 NET_ASSERT_LOCKED(); 688 689 pfi_update++; 690 pfi_kif_update(kif); 691 } 692 693 int 694 pfi_if_compare(struct pfi_kif *p, struct pfi_kif *q) 695 { 696 return (strncmp(p->pfik_name, q->pfik_name, IFNAMSIZ)); 697 } 698 699 void 700 pfi_update_status(const char *name, struct pf_status *pfs) 701 { 702 struct pfi_kif *p; 703 struct pfi_kif_cmp key; 704 struct ifg_member p_member, *ifgm; 705 TAILQ_HEAD(, ifg_member) ifg_members; 706 int i, j, k; 707 708 if (*name == '\0' && pfs == NULL) { 709 RB_FOREACH(p, pfi_ifhead, &pfi_ifs) { 710 memset(p->pfik_packets, 0, sizeof(p->pfik_packets)); 711 memset(p->pfik_bytes, 0, sizeof(p->pfik_bytes)); 712 p->pfik_tzero = gettime(); 713 } 714 return; 715 } 716 717 strlcpy(key.pfik_name, name, sizeof(key.pfik_name)); 718 p = RB_FIND(pfi_ifhead, &pfi_ifs, (struct pfi_kif *)&key); 719 if (p == NULL) { 720 return; 721 } 722 if (p->pfik_group != NULL) { 723 memcpy(&ifg_members, &p->pfik_group->ifg_members, 724 sizeof(ifg_members)); 725 } else { 726 /* build a temporary list for p only */ 727 memset(&p_member, 0, sizeof(p_member)); 728 p_member.ifgm_ifp = p->pfik_ifp; 729 TAILQ_INIT(&ifg_members); 730 TAILQ_INSERT_TAIL(&ifg_members, &p_member, ifgm_next); 731 } 732 if (pfs) { 733 memset(pfs->pcounters, 0, sizeof(pfs->pcounters)); 734 memset(pfs->bcounters, 0, sizeof(pfs->bcounters)); 735 } 736 TAILQ_FOREACH(ifgm, &ifg_members, ifgm_next) { 737 if (ifgm->ifgm_ifp == NULL) 738 continue; 739 p = (struct pfi_kif *)ifgm->ifgm_ifp->if_pf_kif; 740 741 /* just clear statistics */ 742 if (pfs == NULL) { 743 memset(p->pfik_packets, 0, sizeof(p->pfik_packets)); 744 memset(p->pfik_bytes, 0, sizeof(p->pfik_bytes)); 745 p->pfik_tzero = gettime(); 746 continue; 747 } 748 for (i = 0; i < 2; i++) 749 for (j = 0; j < 2; j++) 750 for (k = 0; k < 2; k++) { 751 pfs->pcounters[i][j][k] += 752 p->pfik_packets[i][j][k]; 753 pfs->bcounters[i][j] += 754 p->pfik_bytes[i][j][k]; 755 } 756 } 757 } 758 759 void 760 pfi_get_ifaces(const char *name, struct pfi_kif *buf, int *size) 761 { 762 struct pfi_kif *p, *nextp; 763 int n = 0; 764 765 for (p = RB_MIN(pfi_ifhead, &pfi_ifs); p; p = nextp) { 766 nextp = RB_NEXT(pfi_ifhead, &pfi_ifs, p); 767 if (pfi_skip_if(name, p)) 768 continue; 769 if (*size > n++) { 770 if (!p->pfik_tzero) 771 p->pfik_tzero = gettime(); 772 memcpy(buf++, p, sizeof(*buf)); 773 nextp = RB_NEXT(pfi_ifhead, &pfi_ifs, p); 774 } 775 } 776 *size = n; 777 } 778 779 int 780 pfi_skip_if(const char *filter, struct pfi_kif *p) 781 { 782 struct ifg_list *i; 783 int n; 784 785 if (filter == NULL || !*filter) 786 return (0); 787 if (!strcmp(p->pfik_name, filter)) 788 return (0); /* exact match */ 789 n = strlen(filter); 790 if (n < 1 || n >= IFNAMSIZ) 791 return (1); /* sanity check */ 792 if (filter[n-1] >= '0' && filter[n-1] <= '9') 793 return (1); /* group names may not end in a digit */ 794 if (p->pfik_ifp != NULL) 795 TAILQ_FOREACH(i, &p->pfik_ifp->if_groups, ifgl_next) 796 if (!strncmp(i->ifgl_group->ifg_group, filter, IFNAMSIZ)) 797 return (0); /* iface is in group "filter" */ 798 return (1); 799 } 800 801 int 802 pfi_set_flags(const char *name, int flags) 803 { 804 struct pfi_kif *p; 805 size_t n; 806 807 if (name != NULL && name[0] != '\0') { 808 p = pfi_kif_find(name); 809 if (p == NULL) { 810 n = strlen(name); 811 if (n < 1 || n >= IFNAMSIZ) 812 return (EINVAL); 813 814 if (!isalpha(name[0])) 815 return (EINVAL); 816 817 p = pfi_kif_get(name, NULL); 818 if (p != NULL) { 819 p->pfik_flags_new = p->pfik_flags | flags; 820 /* 821 * We use pfik_flagrefs counter as an 822 * indication whether the kif has been created 823 * on behalf of 'pfi_set_flags()' or not. 824 */ 825 KASSERT(p->pfik_flagrefs == 0); 826 if (ISSET(p->pfik_flags_new, PFI_IFLAG_SKIP)) 827 pfi_kif_ref(p, PFI_KIF_REF_FLAG); 828 } else 829 panic("%s pfi_kif_get() returned NULL\n", 830 __func__); 831 } else 832 p->pfik_flags_new = p->pfik_flags | flags; 833 } else { 834 RB_FOREACH(p, pfi_ifhead, &pfi_ifs) 835 p->pfik_flags_new = p->pfik_flags | flags; 836 } 837 838 return (0); 839 } 840 841 int 842 pfi_clear_flags(const char *name, int flags) 843 { 844 struct pfi_kif *p, *w; 845 846 if (name != NULL && name[0] != '\0') { 847 p = pfi_kif_find(name); 848 if (p != NULL) { 849 p->pfik_flags_new = p->pfik_flags & ~flags; 850 851 KASSERT((p->pfik_flagrefs == 0) || 852 (p->pfik_flagrefs == 1)); 853 854 if (!ISSET(p->pfik_flags_new, PFI_IFLAG_SKIP) && 855 (p->pfik_flagrefs == 1)) 856 pfi_kif_unref(p, PFI_KIF_REF_FLAG); 857 } else 858 return (ESRCH); 859 860 } else 861 RB_FOREACH_SAFE(p, pfi_ifhead, &pfi_ifs, w) { 862 p->pfik_flags_new = p->pfik_flags & ~flags; 863 864 KASSERT((p->pfik_flagrefs == 0) || 865 (p->pfik_flagrefs == 1)); 866 867 if (!ISSET(p->pfik_flags_new, PFI_IFLAG_SKIP) && 868 (p->pfik_flagrefs == 1)) 869 pfi_kif_unref(p, PFI_KIF_REF_FLAG); 870 } 871 872 return (0); 873 } 874 875 void 876 pfi_xcommit(void) 877 { 878 struct pfi_kif *p, *gkif; 879 struct ifg_list *g; 880 struct ifnet *ifp; 881 size_t n; 882 883 RB_FOREACH(p, pfi_ifhead, &pfi_ifs) { 884 p->pfik_flags = p->pfik_flags_new; 885 n = strlen(p->pfik_name); 886 ifp = p->pfik_ifp; 887 /* 888 * if kif is backed by existing interface, then we must use 889 * skip flags found in groups. We use pfik_flags_new, otherwise 890 * we would need to do two RB_FOREACH() passes: the first to 891 * commit group changes the second to commit flag changes for 892 * interfaces. 893 */ 894 if (ifp != NULL) 895 TAILQ_FOREACH(g, &ifp->if_groups, ifgl_next) { 896 gkif = 897 (struct pfi_kif *)g->ifgl_group->ifg_pf_kif; 898 KASSERT(gkif != NULL); 899 p->pfik_flags |= gkif->pfik_flags_new; 900 } 901 } 902 } 903 904 /* from pf_print_state.c */ 905 int 906 pfi_unmask(void *addr) 907 { 908 struct pf_addr *m = addr; 909 int i = 31, j = 0, b = 0; 910 u_int32_t tmp; 911 912 while (j < 4 && m->addr32[j] == 0xffffffff) { 913 b += 32; 914 j++; 915 } 916 if (j < 4) { 917 tmp = ntohl(m->addr32[j]); 918 for (i = 31; tmp & (1 << i); --i) 919 b++; 920 } 921 return (b); 922 } 923 924