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