1 /* $OpenBSD: pf_if.c,v 1.100 2020/06/24 22:03:42 cheloha 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 struct pfi_kif *pfi_all = NULL; 61 struct pool pfi_addr_pl; 62 struct pfi_ifhead pfi_ifs; 63 long pfi_update = 1; 64 struct pfr_addr *pfi_buffer; 65 int pfi_buffer_cnt; 66 int pfi_buffer_max; 67 68 void pfi_kif_update(struct pfi_kif *); 69 void pfi_dynaddr_update(struct pfi_dynaddr *dyn); 70 void pfi_table_update(struct pfr_ktable *, struct pfi_kif *, 71 u_int8_t, int); 72 void pfi_kifaddr_update(void *); 73 void pfi_instance_add(struct ifnet *, u_int8_t, int); 74 void pfi_address_add(struct sockaddr *, sa_family_t, u_int8_t); 75 int pfi_if_compare(struct pfi_kif *, struct pfi_kif *); 76 int pfi_skip_if(const char *, struct pfi_kif *); 77 int pfi_unmask(void *); 78 79 RB_PROTOTYPE(pfi_ifhead, pfi_kif, pfik_tree, pfi_if_compare); 80 RB_GENERATE(pfi_ifhead, pfi_kif, pfik_tree, pfi_if_compare); 81 82 #define PFI_BUFFER_MAX 0x10000 83 #define PFI_MTYPE M_IFADDR 84 85 void 86 pfi_initialize(void) 87 { 88 if (pfi_all != NULL) /* already initialized */ 89 return; 90 91 pool_init(&pfi_addr_pl, sizeof(struct pfi_dynaddr), 0, IPL_SOFTNET, 0, 92 "pfiaddrpl", NULL); 93 pfi_buffer_max = 64; 94 pfi_buffer = mallocarray(pfi_buffer_max, sizeof(*pfi_buffer), 95 PFI_MTYPE, M_WAITOK); 96 97 if ((pfi_all = pfi_kif_get(IFG_ALL)) == NULL) 98 panic("pfi_kif_get for pfi_all failed"); 99 } 100 101 struct pfi_kif * 102 pfi_kif_find(const char *kif_name) 103 { 104 struct pfi_kif_cmp s; 105 106 memset(&s, 0, sizeof(s)); 107 strlcpy(s.pfik_name, kif_name, sizeof(s.pfik_name)); 108 return (RB_FIND(pfi_ifhead, &pfi_ifs, (struct pfi_kif *)&s)); 109 } 110 111 struct pfi_kif * 112 pfi_kif_get(const char *kif_name) 113 { 114 struct pfi_kif *kif; 115 116 if ((kif = pfi_kif_find(kif_name))) 117 return (kif); 118 119 /* create new one */ 120 if ((kif = malloc(sizeof(*kif), PFI_MTYPE, M_NOWAIT|M_ZERO)) == NULL) 121 return (NULL); 122 123 strlcpy(kif->pfik_name, kif_name, sizeof(kif->pfik_name)); 124 kif->pfik_tzero = gettime(); 125 TAILQ_INIT(&kif->pfik_dynaddrs); 126 127 if (!strcmp(kif->pfik_name, "any")) { 128 /* both so it works in the ioctl and the regular case */ 129 kif->pfik_flags |= PFI_IFLAG_ANY; 130 kif->pfik_flags_new |= PFI_IFLAG_ANY; 131 } 132 133 RB_INSERT(pfi_ifhead, &pfi_ifs, kif); 134 return (kif); 135 } 136 137 void 138 pfi_kif_ref(struct pfi_kif *kif, enum pfi_kif_refs what) 139 { 140 switch (what) { 141 case PFI_KIF_REF_RULE: 142 kif->pfik_rules++; 143 break; 144 case PFI_KIF_REF_STATE: 145 kif->pfik_states++; 146 break; 147 case PFI_KIF_REF_ROUTE: 148 kif->pfik_routes++; 149 break; 150 case PFI_KIF_REF_SRCNODE: 151 kif->pfik_srcnodes++; 152 break; 153 default: 154 panic("pfi_kif_ref with unknown type"); 155 } 156 } 157 158 void 159 pfi_kif_unref(struct pfi_kif *kif, enum pfi_kif_refs what) 160 { 161 if (kif == NULL) 162 return; 163 164 switch (what) { 165 case PFI_KIF_REF_NONE: 166 break; 167 case PFI_KIF_REF_RULE: 168 if (kif->pfik_rules <= 0) { 169 DPFPRINTF(LOG_ERR, 170 "pfi_kif_unref: rules refcount <= 0"); 171 return; 172 } 173 kif->pfik_rules--; 174 break; 175 case PFI_KIF_REF_STATE: 176 if (kif->pfik_states <= 0) { 177 DPFPRINTF(LOG_ERR, 178 "pfi_kif_unref: state refcount <= 0"); 179 return; 180 } 181 kif->pfik_states--; 182 break; 183 case PFI_KIF_REF_ROUTE: 184 if (kif->pfik_routes <= 0) { 185 DPFPRINTF(LOG_ERR, 186 "pfi_kif_unref: route refcount <= 0"); 187 return; 188 } 189 kif->pfik_routes--; 190 break; 191 case PFI_KIF_REF_SRCNODE: 192 if (kif->pfik_srcnodes <= 0) { 193 DPFPRINTF(LOG_ERR, 194 "pfi_kif_unref: src-node refcount <= 0"); 195 return; 196 } 197 kif->pfik_srcnodes--; 198 break; 199 default: 200 panic("pfi_kif_unref with unknown type"); 201 } 202 203 if (kif->pfik_ifp != NULL || kif->pfik_group != NULL || kif == pfi_all) 204 return; 205 206 if (kif->pfik_rules || kif->pfik_states || kif->pfik_routes || 207 kif->pfik_srcnodes) 208 return; 209 210 RB_REMOVE(pfi_ifhead, &pfi_ifs, kif); 211 free(kif, PFI_MTYPE, sizeof(*kif)); 212 } 213 214 int 215 pfi_kif_match(struct pfi_kif *rule_kif, struct pfi_kif *packet_kif) 216 { 217 struct ifg_list *p; 218 219 if (rule_kif == NULL || rule_kif == packet_kif) 220 return (1); 221 222 if (rule_kif->pfik_group != NULL) 223 TAILQ_FOREACH(p, &packet_kif->pfik_ifp->if_groups, ifgl_next) 224 if (p->ifgl_group == rule_kif->pfik_group) 225 return (1); 226 227 if (rule_kif->pfik_flags & PFI_IFLAG_ANY && packet_kif->pfik_ifp && 228 !(packet_kif->pfik_ifp->if_flags & IFF_LOOPBACK)) 229 return (1); 230 231 return (0); 232 } 233 234 void 235 pfi_attach_ifnet(struct ifnet *ifp) 236 { 237 struct pfi_kif *kif; 238 struct task *t; 239 240 pfi_initialize(); 241 pfi_update++; 242 if ((kif = pfi_kif_get(ifp->if_xname)) == NULL) 243 panic("%s: pfi_kif_get failed", __func__); 244 245 kif->pfik_ifp = ifp; 246 ifp->if_pf_kif = (caddr_t)kif; 247 248 t = malloc(sizeof(*t), PFI_MTYPE, M_WAITOK); 249 task_set(t, pfi_kifaddr_update, kif); 250 if_addrhook_add(ifp, t); 251 kif->pfik_ah_cookie = t; 252 253 pfi_kif_update(kif); 254 } 255 256 void 257 pfi_detach_ifnet(struct ifnet *ifp) 258 { 259 struct pfi_kif *kif; 260 struct task *t; 261 262 if ((kif = (struct pfi_kif *)ifp->if_pf_kif) == NULL) 263 return; 264 265 pfi_update++; 266 t = kif->pfik_ah_cookie; 267 kif->pfik_ah_cookie = NULL; 268 if_addrhook_del(ifp, t); 269 free(t, PFI_MTYPE, sizeof(*t)); 270 271 pfi_kif_update(kif); 272 273 kif->pfik_ifp = NULL; 274 ifp->if_pf_kif = NULL; 275 pfi_kif_unref(kif, PFI_KIF_REF_NONE); 276 } 277 278 void 279 pfi_attach_ifgroup(struct ifg_group *ifg) 280 { 281 struct pfi_kif *kif; 282 283 pfi_initialize(); 284 pfi_update++; 285 if ((kif = pfi_kif_get(ifg->ifg_group)) == NULL) 286 panic("%s: pfi_kif_get failed", __func__); 287 288 kif->pfik_group = ifg; 289 ifg->ifg_pf_kif = (caddr_t)kif; 290 } 291 292 void 293 pfi_detach_ifgroup(struct ifg_group *ifg) 294 { 295 struct pfi_kif *kif; 296 297 if ((kif = (struct pfi_kif *)ifg->ifg_pf_kif) == NULL) 298 return; 299 300 pfi_update++; 301 302 kif->pfik_group = NULL; 303 ifg->ifg_pf_kif = NULL; 304 pfi_kif_unref(kif, PFI_KIF_REF_NONE); 305 } 306 307 void 308 pfi_group_change(const char *group) 309 { 310 struct pfi_kif *kif; 311 312 pfi_update++; 313 if ((kif = pfi_kif_get(group)) == NULL) 314 panic("%s: pfi_kif_get failed", __func__); 315 316 pfi_kif_update(kif); 317 } 318 319 void 320 pfi_group_addmember(const char *group, struct ifnet *ifp) 321 { 322 struct pfi_kif *gkif, *ikif; 323 324 if ((gkif = pfi_kif_get(group)) == NULL || 325 (ikif = pfi_kif_get(ifp->if_xname)) == NULL) 326 panic("%s: pfi_kif_get failed", __func__); 327 ikif->pfik_flags |= gkif->pfik_flags; 328 329 pfi_group_change(group); 330 } 331 332 int 333 pfi_match_addr(struct pfi_dynaddr *dyn, struct pf_addr *a, sa_family_t af) 334 { 335 switch (af) { 336 case AF_INET: 337 switch (dyn->pfid_acnt4) { 338 case 0: 339 return (0); 340 case 1: 341 return (pf_match_addr(0, &dyn->pfid_addr4, 342 &dyn->pfid_mask4, a, AF_INET)); 343 default: 344 return (pfr_match_addr(dyn->pfid_kt, a, AF_INET)); 345 } 346 break; 347 #ifdef INET6 348 case AF_INET6: 349 switch (dyn->pfid_acnt6) { 350 case 0: 351 return (0); 352 case 1: 353 return (pf_match_addr(0, &dyn->pfid_addr6, 354 &dyn->pfid_mask6, a, AF_INET6)); 355 default: 356 return (pfr_match_addr(dyn->pfid_kt, a, AF_INET6)); 357 } 358 break; 359 #endif /* INET6 */ 360 default: 361 return (0); 362 } 363 } 364 365 int 366 pfi_dynaddr_setup(struct pf_addr_wrap *aw, sa_family_t af) 367 { 368 struct pfi_dynaddr *dyn; 369 char tblname[PF_TABLE_NAME_SIZE]; 370 struct pf_ruleset *ruleset = NULL; 371 int rv = 0; 372 373 if (aw->type != PF_ADDR_DYNIFTL) 374 return (0); 375 if ((dyn = pool_get(&pfi_addr_pl, PR_WAITOK | PR_LIMITFAIL | PR_ZERO)) 376 == NULL) 377 return (1); 378 379 if (!strcmp(aw->v.ifname, "self")) 380 dyn->pfid_kif = pfi_kif_get(IFG_ALL); 381 else 382 dyn->pfid_kif = pfi_kif_get(aw->v.ifname); 383 if (dyn->pfid_kif == NULL) { 384 rv = 1; 385 goto _bad; 386 } 387 pfi_kif_ref(dyn->pfid_kif, PFI_KIF_REF_RULE); 388 389 dyn->pfid_net = pfi_unmask(&aw->v.a.mask); 390 if (af == AF_INET && dyn->pfid_net == 32) 391 dyn->pfid_net = 128; 392 strlcpy(tblname, aw->v.ifname, sizeof(tblname)); 393 if (aw->iflags & PFI_AFLAG_NETWORK) 394 strlcat(tblname, ":network", sizeof(tblname)); 395 if (aw->iflags & PFI_AFLAG_BROADCAST) 396 strlcat(tblname, ":broadcast", sizeof(tblname)); 397 if (aw->iflags & PFI_AFLAG_PEER) 398 strlcat(tblname, ":peer", sizeof(tblname)); 399 if (aw->iflags & PFI_AFLAG_NOALIAS) 400 strlcat(tblname, ":0", sizeof(tblname)); 401 if (dyn->pfid_net != 128) 402 snprintf(tblname + strlen(tblname), 403 sizeof(tblname) - strlen(tblname), "/%d", dyn->pfid_net); 404 if ((ruleset = pf_find_or_create_ruleset(PF_RESERVED_ANCHOR)) == NULL) { 405 rv = 1; 406 goto _bad; 407 } 408 409 if ((dyn->pfid_kt = pfr_attach_table(ruleset, tblname, 1)) == NULL) { 410 rv = 1; 411 goto _bad; 412 } 413 414 dyn->pfid_kt->pfrkt_flags |= PFR_TFLAG_ACTIVE; 415 dyn->pfid_iflags = aw->iflags; 416 dyn->pfid_af = af; 417 418 TAILQ_INSERT_TAIL(&dyn->pfid_kif->pfik_dynaddrs, dyn, entry); 419 aw->p.dyn = dyn; 420 pfi_kif_update(dyn->pfid_kif); 421 return (0); 422 423 _bad: 424 if (dyn->pfid_kt != NULL) 425 pfr_detach_table(dyn->pfid_kt); 426 if (ruleset != NULL) 427 pf_remove_if_empty_ruleset(ruleset); 428 if (dyn->pfid_kif != NULL) 429 pfi_kif_unref(dyn->pfid_kif, PFI_KIF_REF_RULE); 430 pool_put(&pfi_addr_pl, dyn); 431 return (rv); 432 } 433 434 void 435 pfi_kif_update(struct pfi_kif *kif) 436 { 437 struct ifg_list *ifgl; 438 struct pfi_dynaddr *p; 439 440 /* update all dynaddr */ 441 TAILQ_FOREACH(p, &kif->pfik_dynaddrs, entry) 442 pfi_dynaddr_update(p); 443 444 /* again for all groups kif is member of */ 445 if (kif->pfik_ifp != NULL) 446 TAILQ_FOREACH(ifgl, &kif->pfik_ifp->if_groups, ifgl_next) 447 pfi_kif_update((struct pfi_kif *) 448 ifgl->ifgl_group->ifg_pf_kif); 449 } 450 451 void 452 pfi_dynaddr_update(struct pfi_dynaddr *dyn) 453 { 454 struct pfi_kif *kif; 455 struct pfr_ktable *kt; 456 457 if (dyn == NULL || dyn->pfid_kif == NULL || dyn->pfid_kt == NULL) 458 panic("pfi_dynaddr_update"); 459 460 kif = dyn->pfid_kif; 461 kt = dyn->pfid_kt; 462 463 if (kt->pfrkt_larg != pfi_update) { 464 /* this table needs to be brought up-to-date */ 465 pfi_table_update(kt, kif, dyn->pfid_net, dyn->pfid_iflags); 466 kt->pfrkt_larg = pfi_update; 467 } 468 pfr_dynaddr_update(kt, dyn); 469 } 470 471 void 472 pfi_table_update(struct pfr_ktable *kt, struct pfi_kif *kif, u_int8_t net, int flags) 473 { 474 int e, size2 = 0; 475 struct ifg_member *ifgm; 476 477 pfi_buffer_cnt = 0; 478 479 if (kif->pfik_ifp != NULL) 480 pfi_instance_add(kif->pfik_ifp, net, flags); 481 else if (kif->pfik_group != NULL) 482 TAILQ_FOREACH(ifgm, &kif->pfik_group->ifg_members, ifgm_next) 483 pfi_instance_add(ifgm->ifgm_ifp, net, flags); 484 485 if ((e = pfr_set_addrs(&kt->pfrkt_t, pfi_buffer, pfi_buffer_cnt, &size2, 486 NULL, NULL, NULL, 0, PFR_TFLAG_ALLMASK))) 487 DPFPRINTF(LOG_ERR, 488 "pfi_table_update: cannot set %d new addresses " 489 "into table %s: %d", pfi_buffer_cnt, kt->pfrkt_name, e); 490 } 491 492 void 493 pfi_instance_add(struct ifnet *ifp, u_int8_t net, int flags) 494 { 495 struct ifaddr *ifa; 496 int got4 = 0, got6 = 0; 497 int net2, af; 498 499 if (ifp == NULL) 500 return; 501 TAILQ_FOREACH(ifa, &ifp->if_addrlist, ifa_list) { 502 if (ifa->ifa_addr == NULL) 503 continue; 504 af = ifa->ifa_addr->sa_family; 505 if (af != AF_INET && af != AF_INET6) 506 continue; 507 if ((flags & PFI_AFLAG_BROADCAST) && af == AF_INET6) 508 continue; 509 if ((flags & PFI_AFLAG_BROADCAST) && 510 !(ifp->if_flags & IFF_BROADCAST)) 511 continue; 512 if ((flags & PFI_AFLAG_PEER) && 513 !(ifp->if_flags & IFF_POINTOPOINT)) 514 continue; 515 if ((flags & PFI_AFLAG_NETWORK) && af == AF_INET6 && 516 IN6_IS_ADDR_LINKLOCAL( 517 &((struct sockaddr_in6 *)ifa->ifa_addr)->sin6_addr)) 518 continue; 519 if (flags & PFI_AFLAG_NOALIAS) { 520 if (af == AF_INET && got4) 521 continue; 522 if (af == AF_INET6 && got6) 523 continue; 524 } 525 if (af == AF_INET) 526 got4 = 1; 527 else if (af == AF_INET6) 528 got6 = 1; 529 net2 = net; 530 if (net2 == 128 && (flags & PFI_AFLAG_NETWORK)) { 531 if (af == AF_INET) 532 net2 = pfi_unmask(&((struct sockaddr_in *) 533 ifa->ifa_netmask)->sin_addr); 534 else if (af == AF_INET6) 535 net2 = pfi_unmask(&((struct sockaddr_in6 *) 536 ifa->ifa_netmask)->sin6_addr); 537 } 538 if (af == AF_INET && net2 > 32) 539 net2 = 32; 540 if (flags & PFI_AFLAG_BROADCAST) 541 pfi_address_add(ifa->ifa_broadaddr, af, net2); 542 else if (flags & PFI_AFLAG_PEER) 543 pfi_address_add(ifa->ifa_dstaddr, af, net2); 544 else 545 pfi_address_add(ifa->ifa_addr, af, net2); 546 } 547 } 548 549 void 550 pfi_address_add(struct sockaddr *sa, sa_family_t af, u_int8_t net) 551 { 552 struct pfr_addr *p; 553 int i; 554 555 if (pfi_buffer_cnt >= pfi_buffer_max) { 556 int new_max = pfi_buffer_max * 2; 557 558 if (new_max > PFI_BUFFER_MAX) { 559 DPFPRINTF(LOG_ERR, 560 "pfi_address_add: address buffer full (%d/%d)", 561 pfi_buffer_cnt, PFI_BUFFER_MAX); 562 return; 563 } 564 p = mallocarray(new_max, sizeof(*pfi_buffer), PFI_MTYPE, 565 M_DONTWAIT); 566 if (p == NULL) { 567 DPFPRINTF(LOG_ERR, 568 "pfi_address_add: no memory to grow buffer " 569 "(%d/%d)", pfi_buffer_cnt, PFI_BUFFER_MAX); 570 return; 571 } 572 memcpy(p, pfi_buffer, pfi_buffer_max * sizeof(*pfi_buffer)); 573 /* no need to zero buffer */ 574 free(pfi_buffer, PFI_MTYPE, pfi_buffer_max * sizeof(*pfi_buffer)); 575 pfi_buffer = p; 576 pfi_buffer_max = new_max; 577 } 578 if (af == AF_INET && net > 32) 579 net = 128; 580 p = pfi_buffer + pfi_buffer_cnt++; 581 memset(p, 0, sizeof(*p)); 582 p->pfra_af = af; 583 p->pfra_net = net; 584 if (af == AF_INET) 585 p->pfra_ip4addr = ((struct sockaddr_in *)sa)->sin_addr; 586 else if (af == AF_INET6) { 587 p->pfra_ip6addr = ((struct sockaddr_in6 *)sa)->sin6_addr; 588 if (IN6_IS_SCOPE_EMBED(&p->pfra_ip6addr)) 589 p->pfra_ip6addr.s6_addr16[1] = 0; 590 } 591 /* mask network address bits */ 592 if (net < 128) 593 ((caddr_t)p)[p->pfra_net/8] &= ~(0xFF >> (p->pfra_net%8)); 594 for (i = (p->pfra_net+7)/8; i < sizeof(p->pfra_u); i++) 595 ((caddr_t)p)[i] = 0; 596 } 597 598 void 599 pfi_dynaddr_remove(struct pf_addr_wrap *aw) 600 { 601 if (aw->type != PF_ADDR_DYNIFTL || aw->p.dyn == NULL || 602 aw->p.dyn->pfid_kif == NULL || aw->p.dyn->pfid_kt == NULL) 603 return; 604 605 TAILQ_REMOVE(&aw->p.dyn->pfid_kif->pfik_dynaddrs, aw->p.dyn, entry); 606 pfi_kif_unref(aw->p.dyn->pfid_kif, PFI_KIF_REF_RULE); 607 aw->p.dyn->pfid_kif = NULL; 608 pfr_detach_table(aw->p.dyn->pfid_kt); 609 aw->p.dyn->pfid_kt = NULL; 610 pool_put(&pfi_addr_pl, aw->p.dyn); 611 aw->p.dyn = NULL; 612 } 613 614 void 615 pfi_dynaddr_copyout(struct pf_addr_wrap *aw) 616 { 617 if (aw->type != PF_ADDR_DYNIFTL || aw->p.dyn == NULL || 618 aw->p.dyn->pfid_kif == NULL) 619 return; 620 aw->p.dyncnt = aw->p.dyn->pfid_acnt4 + aw->p.dyn->pfid_acnt6; 621 } 622 623 void 624 pfi_kifaddr_update(void *v) 625 { 626 struct pfi_kif *kif = (struct pfi_kif *)v; 627 628 NET_ASSERT_LOCKED(); 629 630 pfi_update++; 631 pfi_kif_update(kif); 632 } 633 634 int 635 pfi_if_compare(struct pfi_kif *p, struct pfi_kif *q) 636 { 637 return (strncmp(p->pfik_name, q->pfik_name, IFNAMSIZ)); 638 } 639 640 void 641 pfi_update_status(const char *name, struct pf_status *pfs) 642 { 643 struct pfi_kif *p; 644 struct pfi_kif_cmp key; 645 struct ifg_member p_member, *ifgm; 646 TAILQ_HEAD(, ifg_member) ifg_members; 647 int i, j, k; 648 649 if (*name == '\0' && pfs == NULL) { 650 RB_FOREACH(p, pfi_ifhead, &pfi_ifs) { 651 memset(p->pfik_packets, 0, sizeof(p->pfik_packets)); 652 memset(p->pfik_bytes, 0, sizeof(p->pfik_bytes)); 653 p->pfik_tzero = gettime(); 654 } 655 return; 656 } 657 658 strlcpy(key.pfik_name, name, sizeof(key.pfik_name)); 659 p = RB_FIND(pfi_ifhead, &pfi_ifs, (struct pfi_kif *)&key); 660 if (p == NULL) { 661 return; 662 } 663 if (p->pfik_group != NULL) { 664 memcpy(&ifg_members, &p->pfik_group->ifg_members, 665 sizeof(ifg_members)); 666 } else { 667 /* build a temporary list for p only */ 668 memset(&p_member, 0, sizeof(p_member)); 669 p_member.ifgm_ifp = p->pfik_ifp; 670 TAILQ_INIT(&ifg_members); 671 TAILQ_INSERT_TAIL(&ifg_members, &p_member, ifgm_next); 672 } 673 if (pfs) { 674 memset(pfs->pcounters, 0, sizeof(pfs->pcounters)); 675 memset(pfs->bcounters, 0, sizeof(pfs->bcounters)); 676 } 677 TAILQ_FOREACH(ifgm, &ifg_members, ifgm_next) { 678 if (ifgm->ifgm_ifp == NULL) 679 continue; 680 p = (struct pfi_kif *)ifgm->ifgm_ifp->if_pf_kif; 681 682 /* just clear statistics */ 683 if (pfs == NULL) { 684 memset(p->pfik_packets, 0, sizeof(p->pfik_packets)); 685 memset(p->pfik_bytes, 0, sizeof(p->pfik_bytes)); 686 p->pfik_tzero = gettime(); 687 continue; 688 } 689 for (i = 0; i < 2; i++) 690 for (j = 0; j < 2; j++) 691 for (k = 0; k < 2; k++) { 692 pfs->pcounters[i][j][k] += 693 p->pfik_packets[i][j][k]; 694 pfs->bcounters[i][j] += 695 p->pfik_bytes[i][j][k]; 696 } 697 } 698 } 699 700 int 701 pfi_get_ifaces(const char *name, struct pfi_kif *buf, int *size) 702 { 703 struct pfi_kif *p, *nextp; 704 int n = 0; 705 706 for (p = RB_MIN(pfi_ifhead, &pfi_ifs); p; p = nextp) { 707 nextp = RB_NEXT(pfi_ifhead, &pfi_ifs, p); 708 if (pfi_skip_if(name, p)) 709 continue; 710 if (*size > n++) { 711 if (!p->pfik_tzero) 712 p->pfik_tzero = gettime(); 713 pfi_kif_ref(p, PFI_KIF_REF_RULE); 714 if (copyout(p, buf++, sizeof(*buf))) { 715 pfi_kif_unref(p, PFI_KIF_REF_RULE); 716 return (EFAULT); 717 } 718 nextp = RB_NEXT(pfi_ifhead, &pfi_ifs, p); 719 pfi_kif_unref(p, PFI_KIF_REF_RULE); 720 } 721 } 722 *size = n; 723 return (0); 724 } 725 726 int 727 pfi_skip_if(const char *filter, struct pfi_kif *p) 728 { 729 struct ifg_list *i; 730 int n; 731 732 if (filter == NULL || !*filter) 733 return (0); 734 if (!strcmp(p->pfik_name, filter)) 735 return (0); /* exact match */ 736 n = strlen(filter); 737 if (n < 1 || n >= IFNAMSIZ) 738 return (1); /* sanity check */ 739 if (filter[n-1] >= '0' && filter[n-1] <= '9') 740 return (1); /* group names may not end in a digit */ 741 if (p->pfik_ifp != NULL) 742 TAILQ_FOREACH(i, &p->pfik_ifp->if_groups, ifgl_next) 743 if (!strncmp(i->ifgl_group->ifg_group, filter, IFNAMSIZ)) 744 return (0); /* iface is in group "filter" */ 745 return (1); 746 } 747 748 int 749 pfi_set_flags(const char *name, int flags) 750 { 751 struct pfi_kif *p; 752 753 RB_FOREACH(p, pfi_ifhead, &pfi_ifs) { 754 if (pfi_skip_if(name, p)) 755 continue; 756 p->pfik_flags_new = p->pfik_flags | flags; 757 } 758 return (0); 759 } 760 761 int 762 pfi_clear_flags(const char *name, int flags) 763 { 764 struct pfi_kif *p; 765 766 RB_FOREACH(p, pfi_ifhead, &pfi_ifs) { 767 if (pfi_skip_if(name, p)) 768 continue; 769 p->pfik_flags_new = p->pfik_flags & ~flags; 770 } 771 return (0); 772 } 773 774 void 775 pfi_xcommit(void) 776 { 777 struct pfi_kif *p; 778 779 RB_FOREACH(p, pfi_ifhead, &pfi_ifs) 780 p->pfik_flags = p->pfik_flags_new; 781 } 782 783 /* from pf_print_state.c */ 784 int 785 pfi_unmask(void *addr) 786 { 787 struct pf_addr *m = addr; 788 int i = 31, j = 0, b = 0; 789 u_int32_t tmp; 790 791 while (j < 4 && m->addr32[j] == 0xffffffff) { 792 b += 32; 793 j++; 794 } 795 if (j < 4) { 796 tmp = ntohl(m->addr32[j]); 797 for (i = 31; tmp & (1 << i); --i) 798 b++; 799 } 800 return (b); 801 } 802 803