pf_ioctl.c revision 1.1
1 /* $OpenBSD: pf_ioctl.c,v 1.112 2004/03/22 04:54:18 mcbride Exp $ */ 2 3 /* 4 * Copyright (c) 2001 Daniel Hartmeier 5 * Copyright (c) 2002,2003 Henning Brauer 6 * All rights reserved. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 11 * 12 * - Redistributions of source code must retain the above copyright 13 * notice, this list of conditions and the following disclaimer. 14 * - Redistributions in binary form must reproduce the above 15 * copyright notice, this list of conditions and the following 16 * disclaimer in the documentation and/or other materials provided 17 * with the distribution. 18 * 19 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 20 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 21 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS 22 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE 23 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, 24 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, 25 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; 26 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER 27 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN 29 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 30 * POSSIBILITY OF SUCH DAMAGE. 31 * 32 * Effort sponsored in part by the Defense Advanced Research Projects 33 * Agency (DARPA) and Air Force Research Laboratory, Air Force 34 * Materiel Command, USAF, under agreement number F30602-01-2-0537. 35 * 36 */ 37 38 #include "pfsync.h" 39 40 #include <sys/param.h> 41 #include <sys/systm.h> 42 #include <sys/mbuf.h> 43 #include <sys/filio.h> 44 #include <sys/fcntl.h> 45 #include <sys/socket.h> 46 #include <sys/socketvar.h> 47 #include <sys/kernel.h> 48 #include <sys/time.h> 49 #include <sys/timeout.h> 50 #include <sys/pool.h> 51 #include <sys/malloc.h> 52 53 #include <net/if.h> 54 #include <net/if_types.h> 55 #include <net/route.h> 56 57 #include <netinet/in.h> 58 #include <netinet/in_var.h> 59 #include <netinet/in_systm.h> 60 #include <netinet/ip.h> 61 #include <netinet/ip_var.h> 62 #include <netinet/ip_icmp.h> 63 64 #include <dev/rndvar.h> 65 #include <net/pfvar.h> 66 67 #if NPFSYNC > 0 68 #include <net/if_pfsync.h> 69 #endif /* NPFSYNC > 0 */ 70 71 #ifdef INET6 72 #include <netinet/ip6.h> 73 #include <netinet/in_pcb.h> 74 #endif /* INET6 */ 75 76 #ifdef ALTQ 77 #include <altq/altq.h> 78 #endif 79 80 void pfattach(int); 81 int pfopen(dev_t, int, int, struct proc *); 82 int pfclose(dev_t, int, int, struct proc *); 83 struct pf_pool *pf_get_pool(char *, char *, u_int32_t, 84 u_int8_t, u_int8_t, u_int8_t, u_int8_t, u_int8_t); 85 int pf_get_ruleset_number(u_int8_t); 86 void pf_init_ruleset(struct pf_ruleset *); 87 void pf_mv_pool(struct pf_palist *, struct pf_palist *); 88 void pf_empty_pool(struct pf_palist *); 89 int pfioctl(dev_t, u_long, caddr_t, int, struct proc *); 90 #ifdef ALTQ 91 int pf_begin_altq(u_int32_t *); 92 int pf_rollback_altq(u_int32_t); 93 int pf_commit_altq(u_int32_t); 94 #endif /* ALTQ */ 95 int pf_begin_rules(u_int32_t *, int, char *, char *); 96 int pf_rollback_rules(u_int32_t, int, char *, char *); 97 int pf_commit_rules(u_int32_t, int, char *, char *); 98 99 extern struct timeout pf_expire_to; 100 101 struct pf_rule pf_default_rule; 102 103 #define TAGID_MAX 50000 104 TAILQ_HEAD(pf_tags, pf_tagname) pf_tags = TAILQ_HEAD_INITIALIZER(pf_tags), 105 pf_qids = TAILQ_HEAD_INITIALIZER(pf_qids); 106 107 #if (PF_QNAME_SIZE != PF_TAG_NAME_SIZE) 108 #error PF_QNAME_SIZE must be equal to PF_TAG_NAME_SIZE 109 #endif 110 static u_int16_t tagname2tag(struct pf_tags *, char *); 111 static void tag2tagname(struct pf_tags *, u_int16_t, char *); 112 static void tag_unref(struct pf_tags *, u_int16_t); 113 114 #define DPFPRINTF(n, x) if (pf_status.debug >= (n)) printf x 115 116 void 117 pfattach(int num) 118 { 119 u_int32_t *timeout = pf_default_rule.timeout; 120 121 pool_init(&pf_rule_pl, sizeof(struct pf_rule), 0, 0, 0, "pfrulepl", 122 &pool_allocator_nointr); 123 pool_init(&pf_src_tree_pl, sizeof(struct pf_src_node), 0, 0, 0, 124 "pfsrctrpl", NULL); 125 pool_init(&pf_state_pl, sizeof(struct pf_state), 0, 0, 0, "pfstatepl", 126 NULL); 127 pool_init(&pf_altq_pl, sizeof(struct pf_altq), 0, 0, 0, "pfaltqpl", 128 NULL); 129 pool_init(&pf_pooladdr_pl, sizeof(struct pf_pooladdr), 0, 0, 0, 130 "pfpooladdrpl", NULL); 131 pfr_initialize(); 132 pfi_initialize(); 133 pf_osfp_initialize(); 134 135 pool_sethardlimit(pf_pool_limits[PF_LIMIT_STATES].pp, 136 pf_pool_limits[PF_LIMIT_STATES].limit, NULL, 0); 137 138 RB_INIT(&tree_src_tracking); 139 TAILQ_INIT(&pf_anchors); 140 pf_init_ruleset(&pf_main_ruleset); 141 TAILQ_INIT(&pf_altqs[0]); 142 TAILQ_INIT(&pf_altqs[1]); 143 TAILQ_INIT(&pf_pabuf); 144 pf_altqs_active = &pf_altqs[0]; 145 pf_altqs_inactive = &pf_altqs[1]; 146 TAILQ_INIT(&state_updates); 147 148 /* default rule should never be garbage collected */ 149 pf_default_rule.entries.tqe_prev = &pf_default_rule.entries.tqe_next; 150 pf_default_rule.action = PF_PASS; 151 pf_default_rule.nr = -1; 152 153 /* initialize default timeouts */ 154 timeout[PFTM_TCP_FIRST_PACKET] = 120; /* First TCP packet */ 155 timeout[PFTM_TCP_OPENING] = 30; /* No response yet */ 156 timeout[PFTM_TCP_ESTABLISHED] = 24*60*60; /* Established */ 157 timeout[PFTM_TCP_CLOSING] = 15 * 60; /* Half closed */ 158 timeout[PFTM_TCP_FIN_WAIT] = 45; /* Got both FINs */ 159 timeout[PFTM_TCP_CLOSED] = 90; /* Got a RST */ 160 timeout[PFTM_UDP_FIRST_PACKET] = 60; /* First UDP packet */ 161 timeout[PFTM_UDP_SINGLE] = 30; /* Unidirectional */ 162 timeout[PFTM_UDP_MULTIPLE] = 60; /* Bidirectional */ 163 timeout[PFTM_ICMP_FIRST_PACKET] = 20; /* First ICMP packet */ 164 timeout[PFTM_ICMP_ERROR_REPLY] = 10; /* Got error response */ 165 timeout[PFTM_OTHER_FIRST_PACKET] = 60; /* First packet */ 166 timeout[PFTM_OTHER_SINGLE] = 30; /* Unidirectional */ 167 timeout[PFTM_OTHER_MULTIPLE] = 60; /* Bidirectional */ 168 timeout[PFTM_FRAG] = 30; /* Fragment expire */ 169 timeout[PFTM_INTERVAL] = 10; /* Expire interval */ 170 timeout[PFTM_SRC_NODE] = 0; /* Source tracking */ 171 172 timeout_set(&pf_expire_to, pf_purge_timeout, &pf_expire_to); 173 timeout_add(&pf_expire_to, timeout[PFTM_INTERVAL] * hz); 174 175 pf_normalize_init(); 176 bzero(&pf_status, sizeof(pf_status)); 177 pf_status.debug = PF_DEBUG_URGENT; 178 179 /* XXX do our best to avoid a conflict */ 180 pf_status.hostid = arc4random(); 181 } 182 183 int 184 pfopen(dev_t dev, int flags, int fmt, struct proc *p) 185 { 186 if (minor(dev) >= 1) 187 return (ENXIO); 188 return (0); 189 } 190 191 int 192 pfclose(dev_t dev, int flags, int fmt, struct proc *p) 193 { 194 if (minor(dev) >= 1) 195 return (ENXIO); 196 return (0); 197 } 198 199 struct pf_pool * 200 pf_get_pool(char *anchorname, char *rulesetname, u_int32_t ticket, 201 u_int8_t rule_action, u_int8_t rule_number, u_int8_t r_last, 202 u_int8_t active, u_int8_t check_ticket) 203 { 204 struct pf_ruleset *ruleset; 205 struct pf_rule *rule; 206 int rs_num; 207 208 ruleset = pf_find_ruleset(anchorname, rulesetname); 209 if (ruleset == NULL) 210 return (NULL); 211 rs_num = pf_get_ruleset_number(rule_action); 212 if (rs_num >= PF_RULESET_MAX) 213 return (NULL); 214 if (active) { 215 if (check_ticket && ticket != 216 ruleset->rules[rs_num].active.ticket) 217 return (NULL); 218 if (r_last) 219 rule = TAILQ_LAST(ruleset->rules[rs_num].active.ptr, 220 pf_rulequeue); 221 else 222 rule = TAILQ_FIRST(ruleset->rules[rs_num].active.ptr); 223 } else { 224 if (check_ticket && ticket != 225 ruleset->rules[rs_num].inactive.ticket) 226 return (NULL); 227 if (r_last) 228 rule = TAILQ_LAST(ruleset->rules[rs_num].inactive.ptr, 229 pf_rulequeue); 230 else 231 rule = TAILQ_FIRST(ruleset->rules[rs_num].inactive.ptr); 232 } 233 if (!r_last) { 234 while ((rule != NULL) && (rule->nr != rule_number)) 235 rule = TAILQ_NEXT(rule, entries); 236 } 237 if (rule == NULL) 238 return (NULL); 239 240 return (&rule->rpool); 241 } 242 243 int 244 pf_get_ruleset_number(u_int8_t action) 245 { 246 switch (action) { 247 case PF_SCRUB: 248 return (PF_RULESET_SCRUB); 249 break; 250 case PF_PASS: 251 case PF_DROP: 252 return (PF_RULESET_FILTER); 253 break; 254 case PF_NAT: 255 case PF_NONAT: 256 return (PF_RULESET_NAT); 257 break; 258 case PF_BINAT: 259 case PF_NOBINAT: 260 return (PF_RULESET_BINAT); 261 break; 262 case PF_RDR: 263 case PF_NORDR: 264 return (PF_RULESET_RDR); 265 break; 266 default: 267 return (PF_RULESET_MAX); 268 break; 269 } 270 } 271 272 void 273 pf_init_ruleset(struct pf_ruleset *ruleset) 274 { 275 int i; 276 277 memset(ruleset, 0, sizeof(struct pf_ruleset)); 278 for (i = 0; i < PF_RULESET_MAX; i++) { 279 TAILQ_INIT(&ruleset->rules[i].queues[0]); 280 TAILQ_INIT(&ruleset->rules[i].queues[1]); 281 ruleset->rules[i].active.ptr = &ruleset->rules[i].queues[0]; 282 ruleset->rules[i].inactive.ptr = &ruleset->rules[i].queues[1]; 283 } 284 } 285 286 struct pf_anchor * 287 pf_find_anchor(const char *anchorname) 288 { 289 struct pf_anchor *anchor; 290 int n = -1; 291 292 anchor = TAILQ_FIRST(&pf_anchors); 293 while (anchor != NULL && (n = strcmp(anchor->name, anchorname)) < 0) 294 anchor = TAILQ_NEXT(anchor, entries); 295 if (n == 0) 296 return (anchor); 297 else 298 return (NULL); 299 } 300 301 struct pf_ruleset * 302 pf_find_ruleset(char *anchorname, char *rulesetname) 303 { 304 struct pf_anchor *anchor; 305 struct pf_ruleset *ruleset; 306 307 if (!anchorname[0] && !rulesetname[0]) 308 return (&pf_main_ruleset); 309 if (!anchorname[0] || !rulesetname[0]) 310 return (NULL); 311 anchorname[PF_ANCHOR_NAME_SIZE-1] = 0; 312 rulesetname[PF_RULESET_NAME_SIZE-1] = 0; 313 anchor = pf_find_anchor(anchorname); 314 if (anchor == NULL) 315 return (NULL); 316 ruleset = TAILQ_FIRST(&anchor->rulesets); 317 while (ruleset != NULL && strcmp(ruleset->name, rulesetname) < 0) 318 ruleset = TAILQ_NEXT(ruleset, entries); 319 if (ruleset != NULL && !strcmp(ruleset->name, rulesetname)) 320 return (ruleset); 321 else 322 return (NULL); 323 } 324 325 struct pf_ruleset * 326 pf_find_or_create_ruleset(char anchorname[PF_ANCHOR_NAME_SIZE], 327 char rulesetname[PF_RULESET_NAME_SIZE]) 328 { 329 struct pf_anchor *anchor, *a; 330 struct pf_ruleset *ruleset, *r; 331 332 if (!anchorname[0] && !rulesetname[0]) 333 return (&pf_main_ruleset); 334 if (!anchorname[0] || !rulesetname[0]) 335 return (NULL); 336 anchorname[PF_ANCHOR_NAME_SIZE-1] = 0; 337 rulesetname[PF_RULESET_NAME_SIZE-1] = 0; 338 a = TAILQ_FIRST(&pf_anchors); 339 while (a != NULL && strcmp(a->name, anchorname) < 0) 340 a = TAILQ_NEXT(a, entries); 341 if (a != NULL && !strcmp(a->name, anchorname)) 342 anchor = a; 343 else { 344 anchor = (struct pf_anchor *)malloc(sizeof(struct pf_anchor), 345 M_TEMP, M_NOWAIT); 346 if (anchor == NULL) 347 return (NULL); 348 memset(anchor, 0, sizeof(struct pf_anchor)); 349 bcopy(anchorname, anchor->name, sizeof(anchor->name)); 350 TAILQ_INIT(&anchor->rulesets); 351 if (a != NULL) 352 TAILQ_INSERT_BEFORE(a, anchor, entries); 353 else 354 TAILQ_INSERT_TAIL(&pf_anchors, anchor, entries); 355 } 356 r = TAILQ_FIRST(&anchor->rulesets); 357 while (r != NULL && strcmp(r->name, rulesetname) < 0) 358 r = TAILQ_NEXT(r, entries); 359 if (r != NULL && !strcmp(r->name, rulesetname)) 360 return (r); 361 ruleset = (struct pf_ruleset *)malloc(sizeof(struct pf_ruleset), 362 M_TEMP, M_NOWAIT); 363 if (ruleset != NULL) { 364 pf_init_ruleset(ruleset); 365 bcopy(rulesetname, ruleset->name, sizeof(ruleset->name)); 366 ruleset->anchor = anchor; 367 if (r != NULL) 368 TAILQ_INSERT_BEFORE(r, ruleset, entries); 369 else 370 TAILQ_INSERT_TAIL(&anchor->rulesets, ruleset, entries); 371 } 372 return (ruleset); 373 } 374 375 void 376 pf_remove_if_empty_ruleset(struct pf_ruleset *ruleset) 377 { 378 struct pf_anchor *anchor; 379 int i; 380 381 if (ruleset == NULL || ruleset->anchor == NULL || ruleset->tables > 0 || 382 ruleset->topen) 383 return; 384 for (i = 0; i < PF_RULESET_MAX; ++i) 385 if (!TAILQ_EMPTY(ruleset->rules[i].active.ptr) || 386 !TAILQ_EMPTY(ruleset->rules[i].inactive.ptr) || 387 ruleset->rules[i].inactive.open) 388 return; 389 390 anchor = ruleset->anchor; 391 TAILQ_REMOVE(&anchor->rulesets, ruleset, entries); 392 free(ruleset, M_TEMP); 393 394 if (TAILQ_EMPTY(&anchor->rulesets)) { 395 TAILQ_REMOVE(&pf_anchors, anchor, entries); 396 free(anchor, M_TEMP); 397 pf_update_anchor_rules(); 398 } 399 } 400 401 void 402 pf_mv_pool(struct pf_palist *poola, struct pf_palist *poolb) 403 { 404 struct pf_pooladdr *mv_pool_pa; 405 406 while ((mv_pool_pa = TAILQ_FIRST(poola)) != NULL) { 407 TAILQ_REMOVE(poola, mv_pool_pa, entries); 408 TAILQ_INSERT_TAIL(poolb, mv_pool_pa, entries); 409 } 410 } 411 412 void 413 pf_empty_pool(struct pf_palist *poola) 414 { 415 struct pf_pooladdr *empty_pool_pa; 416 417 while ((empty_pool_pa = TAILQ_FIRST(poola)) != NULL) { 418 pfi_dynaddr_remove(&empty_pool_pa->addr); 419 pf_tbladdr_remove(&empty_pool_pa->addr); 420 pfi_detach_rule(empty_pool_pa->kif); 421 TAILQ_REMOVE(poola, empty_pool_pa, entries); 422 pool_put(&pf_pooladdr_pl, empty_pool_pa); 423 } 424 } 425 426 void 427 pf_rm_rule(struct pf_rulequeue *rulequeue, struct pf_rule *rule) 428 { 429 if (rulequeue != NULL) { 430 if (rule->states <= 0) { 431 /* 432 * XXX - we need to remove the table *before* detaching 433 * the rule to make sure the table code does not delete 434 * the anchor under our feet. 435 */ 436 pf_tbladdr_remove(&rule->src.addr); 437 pf_tbladdr_remove(&rule->dst.addr); 438 } 439 TAILQ_REMOVE(rulequeue, rule, entries); 440 rule->entries.tqe_prev = NULL; 441 rule->nr = -1; 442 } 443 444 if (rule->states > 0 || rule->src_nodes > 0 || 445 rule->entries.tqe_prev != NULL) 446 return; 447 pf_tag_unref(rule->tag); 448 pf_tag_unref(rule->match_tag); 449 #ifdef ALTQ 450 if (rule->pqid != rule->qid) 451 pf_qid_unref(rule->pqid); 452 pf_qid_unref(rule->qid); 453 #endif 454 pfi_dynaddr_remove(&rule->src.addr); 455 pfi_dynaddr_remove(&rule->dst.addr); 456 if (rulequeue == NULL) { 457 pf_tbladdr_remove(&rule->src.addr); 458 pf_tbladdr_remove(&rule->dst.addr); 459 } 460 pfi_detach_rule(rule->kif); 461 pf_empty_pool(&rule->rpool.list); 462 pool_put(&pf_rule_pl, rule); 463 } 464 465 static u_int16_t 466 tagname2tag(struct pf_tags *head, char *tagname) 467 { 468 struct pf_tagname *tag, *p = NULL; 469 u_int16_t new_tagid = 1; 470 471 TAILQ_FOREACH(tag, head, entries) 472 if (strcmp(tagname, tag->name) == 0) { 473 tag->ref++; 474 return (tag->tag); 475 } 476 477 /* 478 * to avoid fragmentation, we do a linear search from the beginning 479 * and take the first free slot we find. if there is none or the list 480 * is empty, append a new entry at the end. 481 */ 482 483 /* new entry */ 484 if (!TAILQ_EMPTY(head)) 485 for (p = TAILQ_FIRST(head); p != NULL && 486 p->tag == new_tagid; p = TAILQ_NEXT(p, entries)) 487 new_tagid = p->tag + 1; 488 489 if (new_tagid > TAGID_MAX) 490 return (0); 491 492 /* allocate and fill new struct pf_tagname */ 493 tag = (struct pf_tagname *)malloc(sizeof(struct pf_tagname), 494 M_TEMP, M_NOWAIT); 495 if (tag == NULL) 496 return (0); 497 bzero(tag, sizeof(struct pf_tagname)); 498 strlcpy(tag->name, tagname, sizeof(tag->name)); 499 tag->tag = new_tagid; 500 tag->ref++; 501 502 if (p != NULL) /* insert new entry before p */ 503 TAILQ_INSERT_BEFORE(p, tag, entries); 504 else /* either list empty or no free slot in between */ 505 TAILQ_INSERT_TAIL(head, tag, entries); 506 507 return (tag->tag); 508 } 509 510 static void 511 tag2tagname(struct pf_tags *head, u_int16_t tagid, char *p) 512 { 513 struct pf_tagname *tag; 514 515 TAILQ_FOREACH(tag, head, entries) 516 if (tag->tag == tagid) { 517 strlcpy(p, tag->name, PF_TAG_NAME_SIZE); 518 return; 519 } 520 } 521 522 static void 523 tag_unref(struct pf_tags *head, u_int16_t tag) 524 { 525 struct pf_tagname *p, *next; 526 527 if (tag == 0) 528 return; 529 530 for (p = TAILQ_FIRST(head); p != NULL; p = next) { 531 next = TAILQ_NEXT(p, entries); 532 if (tag == p->tag) { 533 if (--p->ref == 0) { 534 TAILQ_REMOVE(head, p, entries); 535 free(p, M_TEMP); 536 } 537 break; 538 } 539 } 540 } 541 542 u_int16_t 543 pf_tagname2tag(char *tagname) 544 { 545 return (tagname2tag(&pf_tags, tagname)); 546 } 547 548 void 549 pf_tag2tagname(u_int16_t tagid, char *p) 550 { 551 return (tag2tagname(&pf_tags, tagid, p)); 552 } 553 554 void 555 pf_tag_unref(u_int16_t tag) 556 { 557 return (tag_unref(&pf_tags, tag)); 558 } 559 560 #ifdef ALTQ 561 u_int32_t 562 pf_qname2qid(char *qname) 563 { 564 return ((u_int32_t)tagname2tag(&pf_qids, qname)); 565 } 566 567 void 568 pf_qid2qname(u_int32_t qid, char *p) 569 { 570 return (tag2tagname(&pf_qids, (u_int16_t)qid, p)); 571 } 572 573 void 574 pf_qid_unref(u_int32_t qid) 575 { 576 return (tag_unref(&pf_qids, (u_int16_t)qid)); 577 } 578 579 int 580 pf_begin_altq(u_int32_t *ticket) 581 { 582 struct pf_altq *altq; 583 int error = 0; 584 585 /* Purge the old altq list */ 586 while ((altq = TAILQ_FIRST(pf_altqs_inactive)) != NULL) { 587 TAILQ_REMOVE(pf_altqs_inactive, altq, entries); 588 if (altq->qname[0] == 0) { 589 /* detach and destroy the discipline */ 590 error = altq_remove(altq); 591 } else 592 pf_qid_unref(altq->qid); 593 pool_put(&pf_altq_pl, altq); 594 } 595 if (error) 596 return (error); 597 *ticket = ++ticket_altqs_inactive; 598 altqs_inactive_open = 1; 599 return (0); 600 } 601 602 int 603 pf_rollback_altq(u_int32_t ticket) 604 { 605 struct pf_altq *altq; 606 int error = 0; 607 608 if (!altqs_inactive_open || ticket != ticket_altqs_inactive) 609 return (0); 610 /* Purge the old altq list */ 611 while ((altq = TAILQ_FIRST(pf_altqs_inactive)) != NULL) { 612 TAILQ_REMOVE(pf_altqs_inactive, altq, entries); 613 if (altq->qname[0] == 0) { 614 /* detach and destroy the discipline */ 615 error = altq_remove(altq); 616 } else 617 pf_qid_unref(altq->qid); 618 pool_put(&pf_altq_pl, altq); 619 } 620 altqs_inactive_open = 0; 621 return (error); 622 } 623 624 int 625 pf_commit_altq(u_int32_t ticket) 626 { 627 struct pf_altqqueue *old_altqs; 628 struct pf_altq *altq; 629 int s, err, error = 0; 630 631 if (!altqs_inactive_open || ticket != ticket_altqs_inactive) 632 return (EBUSY); 633 634 /* swap altqs, keep the old. */ 635 s = splsoftnet(); 636 old_altqs = pf_altqs_active; 637 pf_altqs_active = pf_altqs_inactive; 638 pf_altqs_inactive = old_altqs; 639 ticket_altqs_active = ticket_altqs_inactive; 640 641 /* Attach new disciplines */ 642 TAILQ_FOREACH(altq, pf_altqs_active, entries) { 643 if (altq->qname[0] == 0) { 644 /* attach the discipline */ 645 error = altq_pfattach(altq); 646 if (error) { 647 splx(s); 648 return (error); 649 } 650 } 651 } 652 653 /* Purge the old altq list */ 654 while ((altq = TAILQ_FIRST(pf_altqs_inactive)) != NULL) { 655 TAILQ_REMOVE(pf_altqs_inactive, altq, entries); 656 if (altq->qname[0] == 0) { 657 /* detach and destroy the discipline */ 658 err = altq_pfdetach(altq); 659 if (err != 0 && error == 0) 660 error = err; 661 err = altq_remove(altq); 662 if (err != 0 && error == 0) 663 error = err; 664 } else 665 pf_qid_unref(altq->qid); 666 pool_put(&pf_altq_pl, altq); 667 } 668 splx(s); 669 670 altqs_inactive_open = 0; 671 return (error); 672 } 673 #endif /* ALTQ */ 674 675 int 676 pf_begin_rules(u_int32_t *ticket, int rs_num, char *anchor, char *ruleset) 677 { 678 struct pf_ruleset *rs; 679 struct pf_rule *rule; 680 681 if (rs_num < 0 || rs_num >= PF_RULESET_MAX) 682 return (EINVAL); 683 rs = pf_find_or_create_ruleset(anchor, ruleset); 684 if (rs == NULL) 685 return (EINVAL); 686 while ((rule = TAILQ_FIRST(rs->rules[rs_num].inactive.ptr)) != NULL) 687 pf_rm_rule(rs->rules[rs_num].inactive.ptr, rule); 688 *ticket = ++rs->rules[rs_num].inactive.ticket; 689 rs->rules[rs_num].inactive.open = 1; 690 return (0); 691 } 692 693 int 694 pf_rollback_rules(u_int32_t ticket, int rs_num, char *anchor, char *ruleset) 695 { 696 struct pf_ruleset *rs; 697 struct pf_rule *rule; 698 699 if (rs_num < 0 || rs_num >= PF_RULESET_MAX) 700 return (EINVAL); 701 rs = pf_find_ruleset(anchor, ruleset); 702 if (rs == NULL || !rs->rules[rs_num].inactive.open || 703 rs->rules[rs_num].inactive.ticket != ticket) 704 return (0); 705 while ((rule = TAILQ_FIRST(rs->rules[rs_num].inactive.ptr)) != NULL) 706 pf_rm_rule(rs->rules[rs_num].inactive.ptr, rule); 707 rs->rules[rs_num].inactive.open = 0; 708 return (0); 709 } 710 711 int 712 pf_commit_rules(u_int32_t ticket, int rs_num, char *anchor, char *ruleset) 713 { 714 struct pf_ruleset *rs; 715 struct pf_rule *rule; 716 struct pf_rulequeue *old_rules; 717 int s; 718 719 if (rs_num < 0 || rs_num >= PF_RULESET_MAX) 720 return (EINVAL); 721 rs = pf_find_ruleset(anchor, ruleset); 722 if (rs == NULL || !rs->rules[rs_num].inactive.open || 723 ticket != rs->rules[rs_num].inactive.ticket) 724 return (EBUSY); 725 726 /* Swap rules, keep the old. */ 727 s = splsoftnet(); 728 old_rules = rs->rules[rs_num].active.ptr; 729 rs->rules[rs_num].active.ptr = 730 rs->rules[rs_num].inactive.ptr; 731 rs->rules[rs_num].inactive.ptr = old_rules; 732 rs->rules[rs_num].active.ticket = 733 rs->rules[rs_num].inactive.ticket; 734 pf_calc_skip_steps(rs->rules[rs_num].active.ptr); 735 736 /* Purge the old rule list. */ 737 while ((rule = TAILQ_FIRST(old_rules)) != NULL) 738 pf_rm_rule(old_rules, rule); 739 rs->rules[rs_num].inactive.open = 0; 740 pf_remove_if_empty_ruleset(rs); 741 pf_update_anchor_rules(); 742 splx(s); 743 return (0); 744 } 745 746 int 747 pfioctl(dev_t dev, u_long cmd, caddr_t addr, int flags, struct proc *p) 748 { 749 struct pf_pooladdr *pa = NULL; 750 struct pf_pool *pool = NULL; 751 int s; 752 int error = 0; 753 754 /* XXX keep in sync with switch() below */ 755 if (securelevel > 1) 756 switch (cmd) { 757 case DIOCGETRULES: 758 case DIOCGETRULE: 759 case DIOCGETADDRS: 760 case DIOCGETADDR: 761 case DIOCGETSTATE: 762 case DIOCSETSTATUSIF: 763 case DIOCGETSTATUS: 764 case DIOCCLRSTATUS: 765 case DIOCNATLOOK: 766 case DIOCSETDEBUG: 767 case DIOCGETSTATES: 768 case DIOCGETTIMEOUT: 769 case DIOCCLRRULECTRS: 770 case DIOCGETLIMIT: 771 case DIOCGETALTQS: 772 case DIOCGETALTQ: 773 case DIOCGETQSTATS: 774 case DIOCGETANCHORS: 775 case DIOCGETANCHOR: 776 case DIOCGETRULESETS: 777 case DIOCGETRULESET: 778 case DIOCRGETTABLES: 779 case DIOCRGETTSTATS: 780 case DIOCRCLRTSTATS: 781 case DIOCRCLRADDRS: 782 case DIOCRADDADDRS: 783 case DIOCRDELADDRS: 784 case DIOCRSETADDRS: 785 case DIOCRGETADDRS: 786 case DIOCRGETASTATS: 787 case DIOCRCLRASTATS: 788 case DIOCRTSTADDRS: 789 case DIOCOSFPGET: 790 case DIOCGETSRCNODES: 791 case DIOCCLRSRCNODES: 792 case DIOCIGETIFACES: 793 case DIOCICLRISTATS: 794 break; 795 case DIOCRCLRTABLES: 796 case DIOCRADDTABLES: 797 case DIOCRDELTABLES: 798 case DIOCRSETTFLAGS: 799 if (((struct pfioc_table *)addr)->pfrio_flags & 800 PFR_FLAG_DUMMY) 801 break; /* dummy operation ok */ 802 return (EPERM); 803 default: 804 return (EPERM); 805 } 806 807 if (!(flags & FWRITE)) 808 switch (cmd) { 809 case DIOCGETRULES: 810 case DIOCGETRULE: 811 case DIOCGETADDRS: 812 case DIOCGETADDR: 813 case DIOCGETSTATE: 814 case DIOCGETSTATUS: 815 case DIOCGETSTATES: 816 case DIOCGETTIMEOUT: 817 case DIOCGETLIMIT: 818 case DIOCGETALTQS: 819 case DIOCGETALTQ: 820 case DIOCGETQSTATS: 821 case DIOCGETANCHORS: 822 case DIOCGETANCHOR: 823 case DIOCGETRULESETS: 824 case DIOCGETRULESET: 825 case DIOCRGETTABLES: 826 case DIOCRGETTSTATS: 827 case DIOCRGETADDRS: 828 case DIOCRGETASTATS: 829 case DIOCRTSTADDRS: 830 case DIOCOSFPGET: 831 case DIOCGETSRCNODES: 832 case DIOCIGETIFACES: 833 break; 834 case DIOCRCLRTABLES: 835 case DIOCRADDTABLES: 836 case DIOCRDELTABLES: 837 case DIOCRCLRTSTATS: 838 case DIOCRCLRADDRS: 839 case DIOCRADDADDRS: 840 case DIOCRDELADDRS: 841 case DIOCRSETADDRS: 842 case DIOCRSETTFLAGS: 843 if (((struct pfioc_table *)addr)->pfrio_flags & 844 PFR_FLAG_DUMMY) 845 break; /* dummy operation ok */ 846 return (EACCES); 847 default: 848 return (EACCES); 849 } 850 851 switch (cmd) { 852 853 case DIOCSTART: 854 if (pf_status.running) 855 error = EEXIST; 856 else { 857 pf_status.running = 1; 858 pf_status.since = time.tv_sec; 859 if (pf_status.stateid == 0) { 860 pf_status.stateid = time.tv_sec; 861 pf_status.stateid = pf_status.stateid << 32; 862 } 863 DPFPRINTF(PF_DEBUG_MISC, ("pf: started\n")); 864 } 865 break; 866 867 case DIOCSTOP: 868 if (!pf_status.running) 869 error = ENOENT; 870 else { 871 pf_status.running = 0; 872 pf_status.since = time.tv_sec; 873 DPFPRINTF(PF_DEBUG_MISC, ("pf: stopped\n")); 874 } 875 break; 876 877 case DIOCBEGINRULES: { 878 struct pfioc_rule *pr = (struct pfioc_rule *)addr; 879 880 error = pf_begin_rules(&pr->ticket, pf_get_ruleset_number( 881 pr->rule.action), pr->anchor, pr->ruleset); 882 break; 883 } 884 885 case DIOCADDRULE: { 886 struct pfioc_rule *pr = (struct pfioc_rule *)addr; 887 struct pf_ruleset *ruleset; 888 struct pf_rule *rule, *tail; 889 struct pf_pooladdr *pa; 890 int rs_num; 891 892 ruleset = pf_find_ruleset(pr->anchor, pr->ruleset); 893 if (ruleset == NULL) { 894 error = EINVAL; 895 break; 896 } 897 rs_num = pf_get_ruleset_number(pr->rule.action); 898 if (rs_num >= PF_RULESET_MAX) { 899 error = EINVAL; 900 break; 901 } 902 if (pr->rule.anchorname[0] && ruleset != &pf_main_ruleset) { 903 error = EINVAL; 904 break; 905 } 906 if (pr->rule.return_icmp >> 8 > ICMP_MAXTYPE) { 907 error = EINVAL; 908 break; 909 } 910 if (pr->ticket != ruleset->rules[rs_num].inactive.ticket) { 911 error = EBUSY; 912 break; 913 } 914 if (pr->pool_ticket != ticket_pabuf) { 915 error = EBUSY; 916 break; 917 } 918 rule = pool_get(&pf_rule_pl, PR_NOWAIT); 919 if (rule == NULL) { 920 error = ENOMEM; 921 break; 922 } 923 bcopy(&pr->rule, rule, sizeof(struct pf_rule)); 924 rule->anchor = NULL; 925 rule->kif = NULL; 926 TAILQ_INIT(&rule->rpool.list); 927 /* initialize refcounting */ 928 rule->states = 0; 929 rule->src_nodes = 0; 930 rule->entries.tqe_prev = NULL; 931 #ifndef INET 932 if (rule->af == AF_INET) { 933 pool_put(&pf_rule_pl, rule); 934 error = EAFNOSUPPORT; 935 break; 936 } 937 #endif /* INET */ 938 #ifndef INET6 939 if (rule->af == AF_INET6) { 940 pool_put(&pf_rule_pl, rule); 941 error = EAFNOSUPPORT; 942 break; 943 } 944 #endif /* INET6 */ 945 tail = TAILQ_LAST(ruleset->rules[rs_num].inactive.ptr, 946 pf_rulequeue); 947 if (tail) 948 rule->nr = tail->nr + 1; 949 else 950 rule->nr = 0; 951 if (rule->ifname[0]) { 952 rule->kif = pfi_attach_rule(rule->ifname); 953 if (rule->kif == NULL) { 954 pool_put(&pf_rule_pl, rule); 955 error = EINVAL; 956 break; 957 } 958 } 959 960 #ifdef ALTQ 961 /* set queue IDs */ 962 if (rule->qname[0] != 0) { 963 if ((rule->qid = pf_qname2qid(rule->qname)) == 0) 964 error = EBUSY; 965 else if (rule->pqname[0] != 0) { 966 if ((rule->pqid = 967 pf_qname2qid(rule->pqname)) == 0) 968 error = EBUSY; 969 } else 970 rule->pqid = rule->qid; 971 } 972 #endif 973 if (rule->tagname[0]) 974 if ((rule->tag = pf_tagname2tag(rule->tagname)) == 0) 975 error = EBUSY; 976 if (rule->match_tagname[0]) 977 if ((rule->match_tag = 978 pf_tagname2tag(rule->match_tagname)) == 0) 979 error = EBUSY; 980 if (rule->rt && !rule->direction) 981 error = EINVAL; 982 if (pfi_dynaddr_setup(&rule->src.addr, rule->af)) 983 error = EINVAL; 984 if (pfi_dynaddr_setup(&rule->dst.addr, rule->af)) 985 error = EINVAL; 986 if (pf_tbladdr_setup(ruleset, &rule->src.addr)) 987 error = EINVAL; 988 if (pf_tbladdr_setup(ruleset, &rule->dst.addr)) 989 error = EINVAL; 990 TAILQ_FOREACH(pa, &pf_pabuf, entries) 991 if (pf_tbladdr_setup(ruleset, &pa->addr)) 992 error = EINVAL; 993 994 pf_mv_pool(&pf_pabuf, &rule->rpool.list); 995 if (((((rule->action == PF_NAT) || (rule->action == PF_RDR) || 996 (rule->action == PF_BINAT)) && !rule->anchorname[0]) || 997 (rule->rt > PF_FASTROUTE)) && 998 (TAILQ_FIRST(&rule->rpool.list) == NULL)) 999 error = EINVAL; 1000 1001 if (error) { 1002 pf_rm_rule(NULL, rule); 1003 break; 1004 } 1005 rule->rpool.cur = TAILQ_FIRST(&rule->rpool.list); 1006 rule->evaluations = rule->packets = rule->bytes = 0; 1007 TAILQ_INSERT_TAIL(ruleset->rules[rs_num].inactive.ptr, 1008 rule, entries); 1009 break; 1010 } 1011 1012 case DIOCCOMMITRULES: { 1013 struct pfioc_rule *pr = (struct pfioc_rule *)addr; 1014 1015 error = pf_commit_rules(pr->ticket, pf_get_ruleset_number( 1016 pr->rule.action), pr->anchor, pr->ruleset); 1017 break; 1018 } 1019 1020 case DIOCGETRULES: { 1021 struct pfioc_rule *pr = (struct pfioc_rule *)addr; 1022 struct pf_ruleset *ruleset; 1023 struct pf_rule *tail; 1024 int rs_num; 1025 1026 ruleset = pf_find_ruleset(pr->anchor, pr->ruleset); 1027 if (ruleset == NULL) { 1028 error = EINVAL; 1029 break; 1030 } 1031 rs_num = pf_get_ruleset_number(pr->rule.action); 1032 if (rs_num >= PF_RULESET_MAX) { 1033 error = EINVAL; 1034 break; 1035 } 1036 s = splsoftnet(); 1037 tail = TAILQ_LAST(ruleset->rules[rs_num].active.ptr, 1038 pf_rulequeue); 1039 if (tail) 1040 pr->nr = tail->nr + 1; 1041 else 1042 pr->nr = 0; 1043 pr->ticket = ruleset->rules[rs_num].active.ticket; 1044 splx(s); 1045 break; 1046 } 1047 1048 case DIOCGETRULE: { 1049 struct pfioc_rule *pr = (struct pfioc_rule *)addr; 1050 struct pf_ruleset *ruleset; 1051 struct pf_rule *rule; 1052 int rs_num, i; 1053 1054 ruleset = pf_find_ruleset(pr->anchor, pr->ruleset); 1055 if (ruleset == NULL) { 1056 error = EINVAL; 1057 break; 1058 } 1059 rs_num = pf_get_ruleset_number(pr->rule.action); 1060 if (rs_num >= PF_RULESET_MAX) { 1061 error = EINVAL; 1062 break; 1063 } 1064 if (pr->ticket != ruleset->rules[rs_num].active.ticket) { 1065 error = EBUSY; 1066 break; 1067 } 1068 s = splsoftnet(); 1069 rule = TAILQ_FIRST(ruleset->rules[rs_num].active.ptr); 1070 while ((rule != NULL) && (rule->nr != pr->nr)) 1071 rule = TAILQ_NEXT(rule, entries); 1072 if (rule == NULL) { 1073 error = EBUSY; 1074 splx(s); 1075 break; 1076 } 1077 bcopy(rule, &pr->rule, sizeof(struct pf_rule)); 1078 pfi_dynaddr_copyout(&pr->rule.src.addr); 1079 pfi_dynaddr_copyout(&pr->rule.dst.addr); 1080 pf_tbladdr_copyout(&pr->rule.src.addr); 1081 pf_tbladdr_copyout(&pr->rule.dst.addr); 1082 for (i = 0; i < PF_SKIP_COUNT; ++i) 1083 if (rule->skip[i].ptr == NULL) 1084 pr->rule.skip[i].nr = -1; 1085 else 1086 pr->rule.skip[i].nr = 1087 rule->skip[i].ptr->nr; 1088 splx(s); 1089 break; 1090 } 1091 1092 case DIOCCHANGERULE: { 1093 struct pfioc_rule *pcr = (struct pfioc_rule *)addr; 1094 struct pf_ruleset *ruleset; 1095 struct pf_rule *oldrule = NULL, *newrule = NULL; 1096 u_int32_t nr = 0; 1097 int rs_num; 1098 1099 if (!(pcr->action == PF_CHANGE_REMOVE || 1100 pcr->action == PF_CHANGE_GET_TICKET) && 1101 pcr->pool_ticket != ticket_pabuf) { 1102 error = EBUSY; 1103 break; 1104 } 1105 1106 if (pcr->action < PF_CHANGE_ADD_HEAD || 1107 pcr->action > PF_CHANGE_GET_TICKET) { 1108 error = EINVAL; 1109 break; 1110 } 1111 ruleset = pf_find_ruleset(pcr->anchor, pcr->ruleset); 1112 if (ruleset == NULL) { 1113 error = EINVAL; 1114 break; 1115 } 1116 rs_num = pf_get_ruleset_number(pcr->rule.action); 1117 if (rs_num >= PF_RULESET_MAX) { 1118 error = EINVAL; 1119 break; 1120 } 1121 1122 if (pcr->action == PF_CHANGE_GET_TICKET) { 1123 pcr->ticket = ++ruleset->rules[rs_num].active.ticket; 1124 break; 1125 } else { 1126 if (pcr->ticket != 1127 ruleset->rules[rs_num].active.ticket) { 1128 error = EINVAL; 1129 break; 1130 } 1131 if (pcr->rule.return_icmp >> 8 > ICMP_MAXTYPE) { 1132 error = EINVAL; 1133 break; 1134 } 1135 } 1136 1137 if (pcr->action != PF_CHANGE_REMOVE) { 1138 newrule = pool_get(&pf_rule_pl, PR_NOWAIT); 1139 if (newrule == NULL) { 1140 error = ENOMEM; 1141 break; 1142 } 1143 bcopy(&pcr->rule, newrule, sizeof(struct pf_rule)); 1144 TAILQ_INIT(&newrule->rpool.list); 1145 /* initialize refcounting */ 1146 newrule->states = 0; 1147 newrule->entries.tqe_prev = NULL; 1148 #ifndef INET 1149 if (newrule->af == AF_INET) { 1150 pool_put(&pf_rule_pl, newrule); 1151 error = EAFNOSUPPORT; 1152 break; 1153 } 1154 #endif /* INET */ 1155 #ifndef INET6 1156 if (newrule->af == AF_INET6) { 1157 pool_put(&pf_rule_pl, newrule); 1158 error = EAFNOSUPPORT; 1159 break; 1160 } 1161 #endif /* INET6 */ 1162 if (newrule->ifname[0]) { 1163 newrule->kif = pfi_attach_rule(newrule->ifname); 1164 if (newrule->kif == NULL) { 1165 pool_put(&pf_rule_pl, newrule); 1166 error = EINVAL; 1167 break; 1168 } 1169 } else 1170 newrule->kif = NULL; 1171 1172 #ifdef ALTQ 1173 /* set queue IDs */ 1174 if (newrule->qname[0] != 0) { 1175 if ((newrule->qid = 1176 pf_qname2qid(newrule->qname)) == 0) 1177 error = EBUSY; 1178 else if (newrule->pqname[0] != 0) { 1179 if ((newrule->pqid = 1180 pf_qname2qid(newrule->pqname)) == 0) 1181 error = EBUSY; 1182 } else 1183 newrule->pqid = newrule->qid; 1184 } 1185 #endif 1186 if (newrule->tagname[0]) 1187 if ((newrule->tag = 1188 pf_tagname2tag(newrule->tagname)) == 0) 1189 error = EBUSY; 1190 if (newrule->match_tagname[0]) 1191 if ((newrule->match_tag = pf_tagname2tag( 1192 newrule->match_tagname)) == 0) 1193 error = EBUSY; 1194 1195 if (newrule->rt && !newrule->direction) 1196 error = EINVAL; 1197 if (pfi_dynaddr_setup(&newrule->src.addr, newrule->af)) 1198 error = EINVAL; 1199 if (pfi_dynaddr_setup(&newrule->dst.addr, newrule->af)) 1200 error = EINVAL; 1201 if (pf_tbladdr_setup(ruleset, &newrule->src.addr)) 1202 error = EINVAL; 1203 if (pf_tbladdr_setup(ruleset, &newrule->dst.addr)) 1204 error = EINVAL; 1205 1206 pf_mv_pool(&pf_pabuf, &newrule->rpool.list); 1207 if (((((newrule->action == PF_NAT) || 1208 (newrule->action == PF_RDR) || 1209 (newrule->action == PF_BINAT) || 1210 (newrule->rt > PF_FASTROUTE)) && 1211 !newrule->anchorname[0])) && 1212 (TAILQ_FIRST(&newrule->rpool.list) == NULL)) 1213 error = EINVAL; 1214 1215 if (error) { 1216 pf_rm_rule(NULL, newrule); 1217 break; 1218 } 1219 newrule->rpool.cur = TAILQ_FIRST(&newrule->rpool.list); 1220 newrule->evaluations = newrule->packets = 0; 1221 newrule->bytes = 0; 1222 } 1223 pf_empty_pool(&pf_pabuf); 1224 1225 s = splsoftnet(); 1226 1227 if (pcr->action == PF_CHANGE_ADD_HEAD) 1228 oldrule = TAILQ_FIRST( 1229 ruleset->rules[rs_num].active.ptr); 1230 else if (pcr->action == PF_CHANGE_ADD_TAIL) 1231 oldrule = TAILQ_LAST( 1232 ruleset->rules[rs_num].active.ptr, pf_rulequeue); 1233 else { 1234 oldrule = TAILQ_FIRST( 1235 ruleset->rules[rs_num].active.ptr); 1236 while ((oldrule != NULL) && (oldrule->nr != pcr->nr)) 1237 oldrule = TAILQ_NEXT(oldrule, entries); 1238 if (oldrule == NULL) { 1239 pf_rm_rule(NULL, newrule); 1240 error = EINVAL; 1241 splx(s); 1242 break; 1243 } 1244 } 1245 1246 if (pcr->action == PF_CHANGE_REMOVE) 1247 pf_rm_rule(ruleset->rules[rs_num].active.ptr, oldrule); 1248 else { 1249 if (oldrule == NULL) 1250 TAILQ_INSERT_TAIL( 1251 ruleset->rules[rs_num].active.ptr, 1252 newrule, entries); 1253 else if (pcr->action == PF_CHANGE_ADD_HEAD || 1254 pcr->action == PF_CHANGE_ADD_BEFORE) 1255 TAILQ_INSERT_BEFORE(oldrule, newrule, entries); 1256 else 1257 TAILQ_INSERT_AFTER( 1258 ruleset->rules[rs_num].active.ptr, 1259 oldrule, newrule, entries); 1260 } 1261 1262 nr = 0; 1263 TAILQ_FOREACH(oldrule, 1264 ruleset->rules[rs_num].active.ptr, entries) 1265 oldrule->nr = nr++; 1266 1267 pf_calc_skip_steps(ruleset->rules[rs_num].active.ptr); 1268 pf_remove_if_empty_ruleset(ruleset); 1269 pf_update_anchor_rules(); 1270 1271 ruleset->rules[rs_num].active.ticket++; 1272 splx(s); 1273 break; 1274 } 1275 1276 case DIOCCLRSTATES: { 1277 struct pf_state *state; 1278 struct pfioc_state_kill *psk = (struct pfioc_state_kill *)addr; 1279 int killed = 0; 1280 1281 s = splsoftnet(); 1282 RB_FOREACH(state, pf_state_tree_id, &tree_id) { 1283 if (!psk->psk_ifname[0] || !strcmp(psk->psk_ifname, 1284 state->u.s.kif->pfik_name)) { 1285 state->timeout = PFTM_PURGE; 1286 #if NPFSYNC 1287 /* don't send out individual delete messages */ 1288 state->sync_flags = PFSTATE_NOSYNC; 1289 #endif 1290 killed++; 1291 } 1292 } 1293 pf_purge_expired_states(); 1294 pf_status.states = 0; 1295 psk->psk_af = killed; 1296 #if NPFSYNC 1297 pfsync_clear_states(pf_status.hostid, psk->psk_ifname); 1298 #endif 1299 splx(s); 1300 break; 1301 } 1302 1303 case DIOCKILLSTATES: { 1304 struct pf_state *state; 1305 struct pfioc_state_kill *psk = (struct pfioc_state_kill *)addr; 1306 int killed = 0; 1307 1308 s = splsoftnet(); 1309 RB_FOREACH(state, pf_state_tree_id, &tree_id) { 1310 if ((!psk->psk_af || state->af == psk->psk_af) 1311 && (!psk->psk_proto || psk->psk_proto == 1312 state->proto) && 1313 PF_MATCHA(psk->psk_src.not, 1314 &psk->psk_src.addr.v.a.addr, 1315 &psk->psk_src.addr.v.a.mask, 1316 &state->lan.addr, state->af) && 1317 PF_MATCHA(psk->psk_dst.not, 1318 &psk->psk_dst.addr.v.a.addr, 1319 &psk->psk_dst.addr.v.a.mask, 1320 &state->ext.addr, state->af) && 1321 (psk->psk_src.port_op == 0 || 1322 pf_match_port(psk->psk_src.port_op, 1323 psk->psk_src.port[0], psk->psk_src.port[1], 1324 state->lan.port)) && 1325 (psk->psk_dst.port_op == 0 || 1326 pf_match_port(psk->psk_dst.port_op, 1327 psk->psk_dst.port[0], psk->psk_dst.port[1], 1328 state->ext.port)) && 1329 (!psk->psk_ifname[0] || !strcmp(psk->psk_ifname, 1330 state->u.s.kif->pfik_name))) { 1331 state->timeout = PFTM_PURGE; 1332 killed++; 1333 } 1334 } 1335 pf_purge_expired_states(); 1336 splx(s); 1337 psk->psk_af = killed; 1338 break; 1339 } 1340 1341 case DIOCADDSTATE: { 1342 struct pfioc_state *ps = (struct pfioc_state *)addr; 1343 struct pf_state *state; 1344 struct pfi_kif *kif; 1345 1346 if (ps->state.timeout >= PFTM_MAX && 1347 ps->state.timeout != PFTM_UNTIL_PACKET) { 1348 error = EINVAL; 1349 break; 1350 } 1351 state = pool_get(&pf_state_pl, PR_NOWAIT); 1352 if (state == NULL) { 1353 error = ENOMEM; 1354 break; 1355 } 1356 s = splsoftnet(); 1357 kif = pfi_lookup_create(ps->state.u.ifname); 1358 if (kif == NULL) { 1359 pool_put(&pf_state_pl, state); 1360 error = ENOENT; 1361 splx(s); 1362 break; 1363 } 1364 bcopy(&ps->state, state, sizeof(struct pf_state)); 1365 bzero(&state->u, sizeof(state->u)); 1366 state->rule.ptr = &pf_default_rule; 1367 state->nat_rule.ptr = NULL; 1368 state->anchor.ptr = NULL; 1369 state->rt_kif = NULL; 1370 state->creation = time.tv_sec; 1371 state->pfsync_time = 0; 1372 state->packets[0] = state->packets[1] = 0; 1373 state->bytes[0] = state->bytes[1] = 0; 1374 1375 if (pf_insert_state(kif, state)) { 1376 pfi_maybe_destroy(kif); 1377 pool_put(&pf_state_pl, state); 1378 error = ENOMEM; 1379 } 1380 splx(s); 1381 break; 1382 } 1383 1384 case DIOCGETSTATE: { 1385 struct pfioc_state *ps = (struct pfioc_state *)addr; 1386 struct pf_state *state; 1387 u_int32_t nr; 1388 1389 nr = 0; 1390 s = splsoftnet(); 1391 RB_FOREACH(state, pf_state_tree_id, &tree_id) { 1392 if (nr >= ps->nr) 1393 break; 1394 nr++; 1395 } 1396 if (state == NULL) { 1397 error = EBUSY; 1398 splx(s); 1399 break; 1400 } 1401 bcopy(state, &ps->state, sizeof(struct pf_state)); 1402 ps->state.rule.nr = state->rule.ptr->nr; 1403 ps->state.nat_rule.nr = (state->nat_rule.ptr == NULL) ? 1404 -1 : state->nat_rule.ptr->nr; 1405 ps->state.anchor.nr = (state->anchor.ptr == NULL) ? 1406 -1 : state->anchor.ptr->nr; 1407 splx(s); 1408 ps->state.expire = pf_state_expires(state); 1409 if (ps->state.expire > time.tv_sec) 1410 ps->state.expire -= time.tv_sec; 1411 else 1412 ps->state.expire = 0; 1413 break; 1414 } 1415 1416 case DIOCGETSTATES: { 1417 struct pfioc_states *ps = (struct pfioc_states *)addr; 1418 struct pf_state *state; 1419 struct pf_state *p, pstore; 1420 struct pfi_kif *kif; 1421 u_int32_t nr = 0; 1422 int space = ps->ps_len; 1423 1424 if (space == 0) { 1425 s = splsoftnet(); 1426 TAILQ_FOREACH(kif, &pfi_statehead, pfik_w_states) 1427 nr += kif->pfik_states; 1428 splx(s); 1429 ps->ps_len = sizeof(struct pf_state) * nr; 1430 return (0); 1431 } 1432 1433 s = splsoftnet(); 1434 p = ps->ps_states; 1435 TAILQ_FOREACH(kif, &pfi_statehead, pfik_w_states) 1436 RB_FOREACH(state, pf_state_tree_ext_gwy, 1437 &kif->pfik_ext_gwy) { 1438 int secs = time.tv_sec; 1439 1440 if ((nr+1) * sizeof(*p) > (unsigned)ps->ps_len) 1441 break; 1442 1443 bcopy(state, &pstore, sizeof(pstore)); 1444 strlcpy(pstore.u.ifname, kif->pfik_name, 1445 sizeof(pstore.u.ifname)); 1446 pstore.rule.nr = state->rule.ptr->nr; 1447 pstore.nat_rule.nr = (state->nat_rule.ptr == 1448 NULL) ? -1 : state->nat_rule.ptr->nr; 1449 pstore.anchor.nr = (state->anchor.ptr == 1450 NULL) ? -1 : state->anchor.ptr->nr; 1451 pstore.creation = secs - pstore.creation; 1452 pstore.expire = pf_state_expires(state); 1453 if (pstore.expire > secs) 1454 pstore.expire -= secs; 1455 else 1456 pstore.expire = 0; 1457 error = copyout(&pstore, p, sizeof(*p)); 1458 if (error) { 1459 splx(s); 1460 goto fail; 1461 } 1462 p++; 1463 nr++; 1464 } 1465 ps->ps_len = sizeof(struct pf_state) * nr; 1466 splx(s); 1467 break; 1468 } 1469 1470 case DIOCGETSTATUS: { 1471 struct pf_status *s = (struct pf_status *)addr; 1472 bcopy(&pf_status, s, sizeof(struct pf_status)); 1473 pfi_fill_oldstatus(s); 1474 break; 1475 } 1476 1477 case DIOCSETSTATUSIF: { 1478 struct pfioc_if *pi = (struct pfioc_if *)addr; 1479 1480 if (pi->ifname[0] == 0) { 1481 bzero(pf_status.ifname, IFNAMSIZ); 1482 break; 1483 } 1484 if (ifunit(pi->ifname) == NULL) { 1485 error = EINVAL; 1486 break; 1487 } 1488 strlcpy(pf_status.ifname, pi->ifname, IFNAMSIZ); 1489 break; 1490 } 1491 1492 case DIOCCLRSTATUS: { 1493 bzero(pf_status.counters, sizeof(pf_status.counters)); 1494 bzero(pf_status.fcounters, sizeof(pf_status.fcounters)); 1495 bzero(pf_status.scounters, sizeof(pf_status.scounters)); 1496 if (*pf_status.ifname) 1497 pfi_clr_istats(pf_status.ifname, NULL, 1498 PFI_FLAG_INSTANCE); 1499 break; 1500 } 1501 1502 case DIOCNATLOOK: { 1503 struct pfioc_natlook *pnl = (struct pfioc_natlook *)addr; 1504 struct pf_state *state; 1505 struct pf_state key; 1506 int m = 0, direction = pnl->direction; 1507 1508 key.af = pnl->af; 1509 key.proto = pnl->proto; 1510 1511 if (!pnl->proto || 1512 PF_AZERO(&pnl->saddr, pnl->af) || 1513 PF_AZERO(&pnl->daddr, pnl->af) || 1514 !pnl->dport || !pnl->sport) 1515 error = EINVAL; 1516 else { 1517 s = splsoftnet(); 1518 1519 /* 1520 * userland gives us source and dest of connection, 1521 * reverse the lookup so we ask for what happens with 1522 * the return traffic, enabling us to find it in the 1523 * state tree. 1524 */ 1525 if (direction == PF_IN) { 1526 PF_ACPY(&key.ext.addr, &pnl->daddr, pnl->af); 1527 key.ext.port = pnl->dport; 1528 PF_ACPY(&key.gwy.addr, &pnl->saddr, pnl->af); 1529 key.gwy.port = pnl->sport; 1530 state = pf_find_state_all(&key, PF_EXT_GWY, &m); 1531 } else { 1532 PF_ACPY(&key.lan.addr, &pnl->daddr, pnl->af); 1533 key.lan.port = pnl->dport; 1534 PF_ACPY(&key.ext.addr, &pnl->saddr, pnl->af); 1535 key.ext.port = pnl->sport; 1536 state = pf_find_state_all(&key, PF_LAN_EXT, &m); 1537 } 1538 if (m > 1) 1539 error = E2BIG; /* more than one state */ 1540 else if (state != NULL) { 1541 if (direction == PF_IN) { 1542 PF_ACPY(&pnl->rsaddr, &state->lan.addr, 1543 state->af); 1544 pnl->rsport = state->lan.port; 1545 PF_ACPY(&pnl->rdaddr, &pnl->daddr, 1546 pnl->af); 1547 pnl->rdport = pnl->dport; 1548 } else { 1549 PF_ACPY(&pnl->rdaddr, &state->gwy.addr, 1550 state->af); 1551 pnl->rdport = state->gwy.port; 1552 PF_ACPY(&pnl->rsaddr, &pnl->saddr, 1553 pnl->af); 1554 pnl->rsport = pnl->sport; 1555 } 1556 } else 1557 error = ENOENT; 1558 splx(s); 1559 } 1560 break; 1561 } 1562 1563 case DIOCSETTIMEOUT: { 1564 struct pfioc_tm *pt = (struct pfioc_tm *)addr; 1565 int old; 1566 1567 if (pt->timeout < 0 || pt->timeout >= PFTM_MAX || 1568 pt->seconds < 0) { 1569 error = EINVAL; 1570 goto fail; 1571 } 1572 old = pf_default_rule.timeout[pt->timeout]; 1573 pf_default_rule.timeout[pt->timeout] = pt->seconds; 1574 pt->seconds = old; 1575 break; 1576 } 1577 1578 case DIOCGETTIMEOUT: { 1579 struct pfioc_tm *pt = (struct pfioc_tm *)addr; 1580 1581 if (pt->timeout < 0 || pt->timeout >= PFTM_MAX) { 1582 error = EINVAL; 1583 goto fail; 1584 } 1585 pt->seconds = pf_default_rule.timeout[pt->timeout]; 1586 break; 1587 } 1588 1589 case DIOCGETLIMIT: { 1590 struct pfioc_limit *pl = (struct pfioc_limit *)addr; 1591 1592 if (pl->index < 0 || pl->index >= PF_LIMIT_MAX) { 1593 error = EINVAL; 1594 goto fail; 1595 } 1596 pl->limit = pf_pool_limits[pl->index].limit; 1597 break; 1598 } 1599 1600 case DIOCSETLIMIT: { 1601 struct pfioc_limit *pl = (struct pfioc_limit *)addr; 1602 int old_limit; 1603 1604 if (pl->index < 0 || pl->index >= PF_LIMIT_MAX || 1605 pf_pool_limits[pl->index].pp == NULL) { 1606 error = EINVAL; 1607 goto fail; 1608 } 1609 if (pool_sethardlimit(pf_pool_limits[pl->index].pp, 1610 pl->limit, NULL, 0) != 0) { 1611 error = EBUSY; 1612 goto fail; 1613 } 1614 old_limit = pf_pool_limits[pl->index].limit; 1615 pf_pool_limits[pl->index].limit = pl->limit; 1616 pl->limit = old_limit; 1617 break; 1618 } 1619 1620 case DIOCSETDEBUG: { 1621 u_int32_t *level = (u_int32_t *)addr; 1622 1623 pf_status.debug = *level; 1624 break; 1625 } 1626 1627 case DIOCCLRRULECTRS: { 1628 struct pf_ruleset *ruleset = &pf_main_ruleset; 1629 struct pf_rule *rule; 1630 1631 s = splsoftnet(); 1632 TAILQ_FOREACH(rule, 1633 ruleset->rules[PF_RULESET_FILTER].active.ptr, entries) 1634 rule->evaluations = rule->packets = 1635 rule->bytes = 0; 1636 splx(s); 1637 break; 1638 } 1639 1640 #ifdef ALTQ 1641 case DIOCSTARTALTQ: { 1642 struct pf_altq *altq; 1643 struct ifnet *ifp; 1644 struct tb_profile tb; 1645 1646 /* enable all altq interfaces on active list */ 1647 s = splsoftnet(); 1648 TAILQ_FOREACH(altq, pf_altqs_active, entries) { 1649 if (altq->qname[0] == 0) { 1650 if ((ifp = ifunit(altq->ifname)) == NULL) { 1651 error = EINVAL; 1652 break; 1653 } 1654 if (ifp->if_snd.altq_type != ALTQT_NONE) 1655 error = altq_enable(&ifp->if_snd); 1656 if (error != 0) 1657 break; 1658 /* set tokenbucket regulator */ 1659 tb.rate = altq->ifbandwidth; 1660 tb.depth = altq->tbrsize; 1661 error = tbr_set(&ifp->if_snd, &tb); 1662 if (error != 0) 1663 break; 1664 } 1665 } 1666 if (error == 0) 1667 pfaltq_running = 1; 1668 splx(s); 1669 DPFPRINTF(PF_DEBUG_MISC, ("altq: started\n")); 1670 break; 1671 } 1672 1673 case DIOCSTOPALTQ: { 1674 struct pf_altq *altq; 1675 struct ifnet *ifp; 1676 struct tb_profile tb; 1677 int err; 1678 1679 /* disable all altq interfaces on active list */ 1680 s = splsoftnet(); 1681 TAILQ_FOREACH(altq, pf_altqs_active, entries) { 1682 if (altq->qname[0] == 0) { 1683 if ((ifp = ifunit(altq->ifname)) == NULL) { 1684 error = EINVAL; 1685 break; 1686 } 1687 if (ifp->if_snd.altq_type != ALTQT_NONE) { 1688 err = altq_disable(&ifp->if_snd); 1689 if (err != 0 && error == 0) 1690 error = err; 1691 } 1692 /* clear tokenbucket regulator */ 1693 tb.rate = 0; 1694 err = tbr_set(&ifp->if_snd, &tb); 1695 if (err != 0 && error == 0) 1696 error = err; 1697 } 1698 } 1699 if (error == 0) 1700 pfaltq_running = 0; 1701 splx(s); 1702 DPFPRINTF(PF_DEBUG_MISC, ("altq: stopped\n")); 1703 break; 1704 } 1705 1706 case DIOCBEGINALTQS: { 1707 u_int32_t *ticket = (u_int32_t *)addr; 1708 1709 error = pf_begin_altq(ticket); 1710 break; 1711 } 1712 1713 case DIOCADDALTQ: { 1714 struct pfioc_altq *pa = (struct pfioc_altq *)addr; 1715 struct pf_altq *altq, *a; 1716 1717 if (pa->ticket != ticket_altqs_inactive) { 1718 error = EBUSY; 1719 break; 1720 } 1721 altq = pool_get(&pf_altq_pl, PR_NOWAIT); 1722 if (altq == NULL) { 1723 error = ENOMEM; 1724 break; 1725 } 1726 bcopy(&pa->altq, altq, sizeof(struct pf_altq)); 1727 1728 /* 1729 * if this is for a queue, find the discipline and 1730 * copy the necessary fields 1731 */ 1732 if (altq->qname[0] != 0) { 1733 if ((altq->qid = pf_qname2qid(altq->qname)) == 0) { 1734 error = EBUSY; 1735 pool_put(&pf_altq_pl, altq); 1736 break; 1737 } 1738 TAILQ_FOREACH(a, pf_altqs_inactive, entries) { 1739 if (strncmp(a->ifname, altq->ifname, 1740 IFNAMSIZ) == 0 && a->qname[0] == 0) { 1741 altq->altq_disc = a->altq_disc; 1742 break; 1743 } 1744 } 1745 } 1746 1747 error = altq_add(altq); 1748 if (error) { 1749 pool_put(&pf_altq_pl, altq); 1750 break; 1751 } 1752 1753 TAILQ_INSERT_TAIL(pf_altqs_inactive, altq, entries); 1754 bcopy(altq, &pa->altq, sizeof(struct pf_altq)); 1755 break; 1756 } 1757 1758 case DIOCCOMMITALTQS: { 1759 u_int32_t ticket = *(u_int32_t *)addr; 1760 1761 error = pf_commit_altq(ticket); 1762 break; 1763 } 1764 1765 case DIOCGETALTQS: { 1766 struct pfioc_altq *pa = (struct pfioc_altq *)addr; 1767 struct pf_altq *altq; 1768 1769 pa->nr = 0; 1770 s = splsoftnet(); 1771 TAILQ_FOREACH(altq, pf_altqs_active, entries) 1772 pa->nr++; 1773 pa->ticket = ticket_altqs_active; 1774 splx(s); 1775 break; 1776 } 1777 1778 case DIOCGETALTQ: { 1779 struct pfioc_altq *pa = (struct pfioc_altq *)addr; 1780 struct pf_altq *altq; 1781 u_int32_t nr; 1782 1783 if (pa->ticket != ticket_altqs_active) { 1784 error = EBUSY; 1785 break; 1786 } 1787 nr = 0; 1788 s = splsoftnet(); 1789 altq = TAILQ_FIRST(pf_altqs_active); 1790 while ((altq != NULL) && (nr < pa->nr)) { 1791 altq = TAILQ_NEXT(altq, entries); 1792 nr++; 1793 } 1794 if (altq == NULL) { 1795 error = EBUSY; 1796 splx(s); 1797 break; 1798 } 1799 bcopy(altq, &pa->altq, sizeof(struct pf_altq)); 1800 splx(s); 1801 break; 1802 } 1803 1804 case DIOCCHANGEALTQ: 1805 /* CHANGEALTQ not supported yet! */ 1806 error = ENODEV; 1807 break; 1808 1809 case DIOCGETQSTATS: { 1810 struct pfioc_qstats *pq = (struct pfioc_qstats *)addr; 1811 struct pf_altq *altq; 1812 u_int32_t nr; 1813 int nbytes; 1814 1815 if (pq->ticket != ticket_altqs_active) { 1816 error = EBUSY; 1817 break; 1818 } 1819 nbytes = pq->nbytes; 1820 nr = 0; 1821 s = splsoftnet(); 1822 altq = TAILQ_FIRST(pf_altqs_active); 1823 while ((altq != NULL) && (nr < pq->nr)) { 1824 altq = TAILQ_NEXT(altq, entries); 1825 nr++; 1826 } 1827 if (altq == NULL) { 1828 error = EBUSY; 1829 splx(s); 1830 break; 1831 } 1832 error = altq_getqstats(altq, pq->buf, &nbytes); 1833 splx(s); 1834 if (error == 0) { 1835 pq->scheduler = altq->scheduler; 1836 pq->nbytes = nbytes; 1837 } 1838 break; 1839 } 1840 #endif /* ALTQ */ 1841 1842 case DIOCBEGINADDRS: { 1843 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr; 1844 1845 pf_empty_pool(&pf_pabuf); 1846 pp->ticket = ++ticket_pabuf; 1847 break; 1848 } 1849 1850 case DIOCADDADDR: { 1851 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr; 1852 1853 #ifndef INET 1854 if (pp->af == AF_INET) { 1855 error = EAFNOSUPPORT; 1856 break; 1857 } 1858 #endif /* INET */ 1859 #ifndef INET6 1860 if (pp->af == AF_INET6) { 1861 error = EAFNOSUPPORT; 1862 break; 1863 } 1864 #endif /* INET6 */ 1865 if (pp->addr.addr.type != PF_ADDR_ADDRMASK && 1866 pp->addr.addr.type != PF_ADDR_DYNIFTL && 1867 pp->addr.addr.type != PF_ADDR_TABLE) { 1868 error = EINVAL; 1869 break; 1870 } 1871 pa = pool_get(&pf_pooladdr_pl, PR_NOWAIT); 1872 if (pa == NULL) { 1873 error = ENOMEM; 1874 break; 1875 } 1876 bcopy(&pp->addr, pa, sizeof(struct pf_pooladdr)); 1877 if (pa->ifname[0]) { 1878 pa->kif = pfi_attach_rule(pa->ifname); 1879 if (pa->kif == NULL) { 1880 pool_put(&pf_pooladdr_pl, pa); 1881 error = EINVAL; 1882 break; 1883 } 1884 } 1885 if (pfi_dynaddr_setup(&pa->addr, pp->af)) { 1886 pfi_dynaddr_remove(&pa->addr); 1887 pfi_detach_rule(pa->kif); 1888 pool_put(&pf_pooladdr_pl, pa); 1889 error = EINVAL; 1890 break; 1891 } 1892 TAILQ_INSERT_TAIL(&pf_pabuf, pa, entries); 1893 break; 1894 } 1895 1896 case DIOCGETADDRS: { 1897 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr; 1898 1899 pp->nr = 0; 1900 s = splsoftnet(); 1901 pool = pf_get_pool(pp->anchor, pp->ruleset, pp->ticket, 1902 pp->r_action, pp->r_num, 0, 1, 0); 1903 if (pool == NULL) { 1904 error = EBUSY; 1905 splx(s); 1906 break; 1907 } 1908 TAILQ_FOREACH(pa, &pool->list, entries) 1909 pp->nr++; 1910 splx(s); 1911 break; 1912 } 1913 1914 case DIOCGETADDR: { 1915 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr; 1916 u_int32_t nr = 0; 1917 1918 s = splsoftnet(); 1919 pool = pf_get_pool(pp->anchor, pp->ruleset, pp->ticket, 1920 pp->r_action, pp->r_num, 0, 1, 1); 1921 if (pool == NULL) { 1922 error = EBUSY; 1923 splx(s); 1924 break; 1925 } 1926 pa = TAILQ_FIRST(&pool->list); 1927 while ((pa != NULL) && (nr < pp->nr)) { 1928 pa = TAILQ_NEXT(pa, entries); 1929 nr++; 1930 } 1931 if (pa == NULL) { 1932 error = EBUSY; 1933 splx(s); 1934 break; 1935 } 1936 bcopy(pa, &pp->addr, sizeof(struct pf_pooladdr)); 1937 pfi_dynaddr_copyout(&pp->addr.addr); 1938 pf_tbladdr_copyout(&pp->addr.addr); 1939 splx(s); 1940 break; 1941 } 1942 1943 case DIOCCHANGEADDR: { 1944 struct pfioc_pooladdr *pca = (struct pfioc_pooladdr *)addr; 1945 struct pf_pooladdr *oldpa = NULL, *newpa = NULL; 1946 struct pf_ruleset *ruleset; 1947 1948 if (pca->action < PF_CHANGE_ADD_HEAD || 1949 pca->action > PF_CHANGE_REMOVE) { 1950 error = EINVAL; 1951 break; 1952 } 1953 if (pca->addr.addr.type != PF_ADDR_ADDRMASK && 1954 pca->addr.addr.type != PF_ADDR_DYNIFTL && 1955 pca->addr.addr.type != PF_ADDR_TABLE) { 1956 error = EINVAL; 1957 break; 1958 } 1959 1960 ruleset = pf_find_ruleset(pca->anchor, pca->ruleset); 1961 if (ruleset == NULL) { 1962 error = EBUSY; 1963 break; 1964 } 1965 pool = pf_get_pool(pca->anchor, pca->ruleset, pca->ticket, 1966 pca->r_action, pca->r_num, pca->r_last, 1, 1); 1967 if (pool == NULL) { 1968 error = EBUSY; 1969 break; 1970 } 1971 if (pca->action != PF_CHANGE_REMOVE) { 1972 newpa = pool_get(&pf_pooladdr_pl, PR_NOWAIT); 1973 if (newpa == NULL) { 1974 error = ENOMEM; 1975 break; 1976 } 1977 bcopy(&pca->addr, newpa, sizeof(struct pf_pooladdr)); 1978 #ifndef INET 1979 if (pca->af == AF_INET) { 1980 pool_put(&pf_pooladdr_pl, newpa); 1981 error = EAFNOSUPPORT; 1982 break; 1983 } 1984 #endif /* INET */ 1985 #ifndef INET6 1986 if (pca->af == AF_INET6) { 1987 pool_put(&pf_pooladdr_pl, newpa); 1988 error = EAFNOSUPPORT; 1989 break; 1990 } 1991 #endif /* INET6 */ 1992 if (newpa->ifname[0]) { 1993 newpa->kif = pfi_attach_rule(newpa->ifname); 1994 if (newpa->kif == NULL) { 1995 pool_put(&pf_pooladdr_pl, newpa); 1996 error = EINVAL; 1997 break; 1998 } 1999 } else 2000 newpa->kif = NULL; 2001 if (pfi_dynaddr_setup(&newpa->addr, pca->af) || 2002 pf_tbladdr_setup(ruleset, &newpa->addr)) { 2003 pfi_dynaddr_remove(&newpa->addr); 2004 pfi_detach_rule(newpa->kif); 2005 pool_put(&pf_pooladdr_pl, newpa); 2006 error = EINVAL; 2007 break; 2008 } 2009 } 2010 2011 s = splsoftnet(); 2012 2013 if (pca->action == PF_CHANGE_ADD_HEAD) 2014 oldpa = TAILQ_FIRST(&pool->list); 2015 else if (pca->action == PF_CHANGE_ADD_TAIL) 2016 oldpa = TAILQ_LAST(&pool->list, pf_palist); 2017 else { 2018 int i = 0; 2019 2020 oldpa = TAILQ_FIRST(&pool->list); 2021 while ((oldpa != NULL) && (i < pca->nr)) { 2022 oldpa = TAILQ_NEXT(oldpa, entries); 2023 i++; 2024 } 2025 if (oldpa == NULL) { 2026 error = EINVAL; 2027 splx(s); 2028 break; 2029 } 2030 } 2031 2032 if (pca->action == PF_CHANGE_REMOVE) { 2033 TAILQ_REMOVE(&pool->list, oldpa, entries); 2034 pfi_dynaddr_remove(&oldpa->addr); 2035 pf_tbladdr_remove(&oldpa->addr); 2036 pfi_detach_rule(oldpa->kif); 2037 pool_put(&pf_pooladdr_pl, oldpa); 2038 } else { 2039 if (oldpa == NULL) 2040 TAILQ_INSERT_TAIL(&pool->list, newpa, entries); 2041 else if (pca->action == PF_CHANGE_ADD_HEAD || 2042 pca->action == PF_CHANGE_ADD_BEFORE) 2043 TAILQ_INSERT_BEFORE(oldpa, newpa, entries); 2044 else 2045 TAILQ_INSERT_AFTER(&pool->list, oldpa, 2046 newpa, entries); 2047 } 2048 2049 pool->cur = TAILQ_FIRST(&pool->list); 2050 PF_ACPY(&pool->counter, &pool->cur->addr.v.a.addr, 2051 pca->af); 2052 splx(s); 2053 break; 2054 } 2055 2056 case DIOCGETANCHORS: { 2057 struct pfioc_anchor *pa = (struct pfioc_anchor *)addr; 2058 struct pf_anchor *anchor; 2059 2060 pa->nr = 0; 2061 TAILQ_FOREACH(anchor, &pf_anchors, entries) 2062 pa->nr++; 2063 break; 2064 } 2065 2066 case DIOCGETANCHOR: { 2067 struct pfioc_anchor *pa = (struct pfioc_anchor *)addr; 2068 struct pf_anchor *anchor; 2069 u_int32_t nr = 0; 2070 2071 anchor = TAILQ_FIRST(&pf_anchors); 2072 while (anchor != NULL && nr < pa->nr) { 2073 anchor = TAILQ_NEXT(anchor, entries); 2074 nr++; 2075 } 2076 if (anchor == NULL) 2077 error = EBUSY; 2078 else 2079 bcopy(anchor->name, pa->name, sizeof(pa->name)); 2080 break; 2081 } 2082 2083 case DIOCGETRULESETS: { 2084 struct pfioc_ruleset *pr = (struct pfioc_ruleset *)addr; 2085 struct pf_anchor *anchor; 2086 struct pf_ruleset *ruleset; 2087 2088 pr->anchor[PF_ANCHOR_NAME_SIZE-1] = 0; 2089 if ((anchor = pf_find_anchor(pr->anchor)) == NULL) { 2090 error = EINVAL; 2091 break; 2092 } 2093 pr->nr = 0; 2094 TAILQ_FOREACH(ruleset, &anchor->rulesets, entries) 2095 pr->nr++; 2096 break; 2097 } 2098 2099 case DIOCGETRULESET: { 2100 struct pfioc_ruleset *pr = (struct pfioc_ruleset *)addr; 2101 struct pf_anchor *anchor; 2102 struct pf_ruleset *ruleset; 2103 u_int32_t nr = 0; 2104 2105 if ((anchor = pf_find_anchor(pr->anchor)) == NULL) { 2106 error = EINVAL; 2107 break; 2108 } 2109 ruleset = TAILQ_FIRST(&anchor->rulesets); 2110 while (ruleset != NULL && nr < pr->nr) { 2111 ruleset = TAILQ_NEXT(ruleset, entries); 2112 nr++; 2113 } 2114 if (ruleset == NULL) 2115 error = EBUSY; 2116 else 2117 bcopy(ruleset->name, pr->name, sizeof(pr->name)); 2118 break; 2119 } 2120 2121 case DIOCRCLRTABLES: { 2122 struct pfioc_table *io = (struct pfioc_table *)addr; 2123 2124 if (io->pfrio_esize != 0) { 2125 error = ENODEV; 2126 break; 2127 } 2128 error = pfr_clr_tables(&io->pfrio_table, &io->pfrio_ndel, 2129 io->pfrio_flags | PFR_FLAG_USERIOCTL); 2130 break; 2131 } 2132 2133 case DIOCRADDTABLES: { 2134 struct pfioc_table *io = (struct pfioc_table *)addr; 2135 2136 if (io->pfrio_esize != sizeof(struct pfr_table)) { 2137 error = ENODEV; 2138 break; 2139 } 2140 error = pfr_add_tables(io->pfrio_buffer, io->pfrio_size, 2141 &io->pfrio_nadd, io->pfrio_flags | PFR_FLAG_USERIOCTL); 2142 break; 2143 } 2144 2145 case DIOCRDELTABLES: { 2146 struct pfioc_table *io = (struct pfioc_table *)addr; 2147 2148 if (io->pfrio_esize != sizeof(struct pfr_table)) { 2149 error = ENODEV; 2150 break; 2151 } 2152 error = pfr_del_tables(io->pfrio_buffer, io->pfrio_size, 2153 &io->pfrio_ndel, io->pfrio_flags | PFR_FLAG_USERIOCTL); 2154 break; 2155 } 2156 2157 case DIOCRGETTABLES: { 2158 struct pfioc_table *io = (struct pfioc_table *)addr; 2159 2160 if (io->pfrio_esize != sizeof(struct pfr_table)) { 2161 error = ENODEV; 2162 break; 2163 } 2164 error = pfr_get_tables(&io->pfrio_table, io->pfrio_buffer, 2165 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL); 2166 break; 2167 } 2168 2169 case DIOCRGETTSTATS: { 2170 struct pfioc_table *io = (struct pfioc_table *)addr; 2171 2172 if (io->pfrio_esize != sizeof(struct pfr_tstats)) { 2173 error = ENODEV; 2174 break; 2175 } 2176 error = pfr_get_tstats(&io->pfrio_table, io->pfrio_buffer, 2177 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL); 2178 break; 2179 } 2180 2181 case DIOCRCLRTSTATS: { 2182 struct pfioc_table *io = (struct pfioc_table *)addr; 2183 2184 if (io->pfrio_esize != sizeof(struct pfr_table)) { 2185 error = ENODEV; 2186 break; 2187 } 2188 error = pfr_clr_tstats(io->pfrio_buffer, io->pfrio_size, 2189 &io->pfrio_nzero, io->pfrio_flags | PFR_FLAG_USERIOCTL); 2190 break; 2191 } 2192 2193 case DIOCRSETTFLAGS: { 2194 struct pfioc_table *io = (struct pfioc_table *)addr; 2195 2196 if (io->pfrio_esize != sizeof(struct pfr_table)) { 2197 error = ENODEV; 2198 break; 2199 } 2200 error = pfr_set_tflags(io->pfrio_buffer, io->pfrio_size, 2201 io->pfrio_setflag, io->pfrio_clrflag, &io->pfrio_nchange, 2202 &io->pfrio_ndel, io->pfrio_flags | PFR_FLAG_USERIOCTL); 2203 break; 2204 } 2205 2206 case DIOCRCLRADDRS: { 2207 struct pfioc_table *io = (struct pfioc_table *)addr; 2208 2209 if (io->pfrio_esize != 0) { 2210 error = ENODEV; 2211 break; 2212 } 2213 error = pfr_clr_addrs(&io->pfrio_table, &io->pfrio_ndel, 2214 io->pfrio_flags | PFR_FLAG_USERIOCTL); 2215 break; 2216 } 2217 2218 case DIOCRADDADDRS: { 2219 struct pfioc_table *io = (struct pfioc_table *)addr; 2220 2221 if (io->pfrio_esize != sizeof(struct pfr_addr)) { 2222 error = ENODEV; 2223 break; 2224 } 2225 error = pfr_add_addrs(&io->pfrio_table, io->pfrio_buffer, 2226 io->pfrio_size, &io->pfrio_nadd, io->pfrio_flags | 2227 PFR_FLAG_USERIOCTL); 2228 break; 2229 } 2230 2231 case DIOCRDELADDRS: { 2232 struct pfioc_table *io = (struct pfioc_table *)addr; 2233 2234 if (io->pfrio_esize != sizeof(struct pfr_addr)) { 2235 error = ENODEV; 2236 break; 2237 } 2238 error = pfr_del_addrs(&io->pfrio_table, io->pfrio_buffer, 2239 io->pfrio_size, &io->pfrio_ndel, io->pfrio_flags | 2240 PFR_FLAG_USERIOCTL); 2241 break; 2242 } 2243 2244 case DIOCRSETADDRS: { 2245 struct pfioc_table *io = (struct pfioc_table *)addr; 2246 2247 if (io->pfrio_esize != sizeof(struct pfr_addr)) { 2248 error = ENODEV; 2249 break; 2250 } 2251 error = pfr_set_addrs(&io->pfrio_table, io->pfrio_buffer, 2252 io->pfrio_size, &io->pfrio_size2, &io->pfrio_nadd, 2253 &io->pfrio_ndel, &io->pfrio_nchange, io->pfrio_flags | 2254 PFR_FLAG_USERIOCTL); 2255 break; 2256 } 2257 2258 case DIOCRGETADDRS: { 2259 struct pfioc_table *io = (struct pfioc_table *)addr; 2260 2261 if (io->pfrio_esize != sizeof(struct pfr_addr)) { 2262 error = ENODEV; 2263 break; 2264 } 2265 error = pfr_get_addrs(&io->pfrio_table, io->pfrio_buffer, 2266 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL); 2267 break; 2268 } 2269 2270 case DIOCRGETASTATS: { 2271 struct pfioc_table *io = (struct pfioc_table *)addr; 2272 2273 if (io->pfrio_esize != sizeof(struct pfr_astats)) { 2274 error = ENODEV; 2275 break; 2276 } 2277 error = pfr_get_astats(&io->pfrio_table, io->pfrio_buffer, 2278 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL); 2279 break; 2280 } 2281 2282 case DIOCRCLRASTATS: { 2283 struct pfioc_table *io = (struct pfioc_table *)addr; 2284 2285 if (io->pfrio_esize != sizeof(struct pfr_addr)) { 2286 error = ENODEV; 2287 break; 2288 } 2289 error = pfr_clr_astats(&io->pfrio_table, io->pfrio_buffer, 2290 io->pfrio_size, &io->pfrio_nzero, io->pfrio_flags | 2291 PFR_FLAG_USERIOCTL); 2292 break; 2293 } 2294 2295 case DIOCRTSTADDRS: { 2296 struct pfioc_table *io = (struct pfioc_table *)addr; 2297 2298 if (io->pfrio_esize != sizeof(struct pfr_addr)) { 2299 error = ENODEV; 2300 break; 2301 } 2302 error = pfr_tst_addrs(&io->pfrio_table, io->pfrio_buffer, 2303 io->pfrio_size, &io->pfrio_nmatch, io->pfrio_flags | 2304 PFR_FLAG_USERIOCTL); 2305 break; 2306 } 2307 2308 case DIOCRINABEGIN: { 2309 struct pfioc_table *io = (struct pfioc_table *)addr; 2310 2311 if (io->pfrio_esize != 0) { 2312 error = ENODEV; 2313 break; 2314 } 2315 error = pfr_ina_begin(&io->pfrio_table, &io->pfrio_ticket, 2316 &io->pfrio_ndel, io->pfrio_flags | PFR_FLAG_USERIOCTL); 2317 break; 2318 } 2319 2320 case DIOCRINACOMMIT: { 2321 struct pfioc_table *io = (struct pfioc_table *)addr; 2322 2323 if (io->pfrio_esize != 0) { 2324 error = ENODEV; 2325 break; 2326 } 2327 error = pfr_ina_commit(&io->pfrio_table, io->pfrio_ticket, 2328 &io->pfrio_nadd, &io->pfrio_nchange, io->pfrio_flags | 2329 PFR_FLAG_USERIOCTL); 2330 break; 2331 } 2332 2333 case DIOCRINADEFINE: { 2334 struct pfioc_table *io = (struct pfioc_table *)addr; 2335 2336 if (io->pfrio_esize != sizeof(struct pfr_addr)) { 2337 error = ENODEV; 2338 break; 2339 } 2340 error = pfr_ina_define(&io->pfrio_table, io->pfrio_buffer, 2341 io->pfrio_size, &io->pfrio_nadd, &io->pfrio_naddr, 2342 io->pfrio_ticket, io->pfrio_flags | PFR_FLAG_USERIOCTL); 2343 break; 2344 } 2345 2346 case DIOCOSFPADD: { 2347 struct pf_osfp_ioctl *io = (struct pf_osfp_ioctl *)addr; 2348 s = splsoftnet(); 2349 error = pf_osfp_add(io); 2350 splx(s); 2351 break; 2352 } 2353 2354 case DIOCOSFPGET: { 2355 struct pf_osfp_ioctl *io = (struct pf_osfp_ioctl *)addr; 2356 s = splsoftnet(); 2357 error = pf_osfp_get(io); 2358 splx(s); 2359 break; 2360 } 2361 2362 case DIOCXBEGIN: { 2363 struct pfioc_trans *io = (struct pfioc_trans *)addr; 2364 struct pfioc_trans_e ioe; 2365 struct pfr_table table; 2366 int i; 2367 2368 if (io->esize != sizeof(ioe)) { 2369 error = ENODEV; 2370 goto fail; 2371 } 2372 for (i = 0; i < io->size; i++) { 2373 if (copyin(io->array+i, &ioe, sizeof(ioe))) { 2374 error = EFAULT; 2375 goto fail; 2376 } 2377 switch (ioe.rs_num) { 2378 #ifdef ALTQ 2379 case PF_RULESET_ALTQ: 2380 if (ioe.anchor[0] || ioe.ruleset[0]) { 2381 error = EINVAL; 2382 goto fail; 2383 } 2384 if ((error = pf_begin_altq(&ioe.ticket))) 2385 goto fail; 2386 break; 2387 #endif /* ALTQ */ 2388 case PF_RULESET_TABLE: 2389 bzero(&table, sizeof(table)); 2390 strlcpy(table.pfrt_anchor, ioe.anchor, 2391 sizeof(table.pfrt_anchor)); 2392 strlcpy(table.pfrt_ruleset, ioe.ruleset, 2393 sizeof(table.pfrt_ruleset)); 2394 if ((error = pfr_ina_begin(&table, 2395 &ioe.ticket, NULL, 0))) 2396 goto fail; 2397 break; 2398 default: 2399 if ((error = pf_begin_rules(&ioe.ticket, 2400 ioe.rs_num, ioe.anchor, ioe.ruleset))) 2401 goto fail; 2402 break; 2403 } 2404 if (copyout(&ioe, io->array+i, sizeof(io->array[i]))) { 2405 error = EFAULT; 2406 goto fail; 2407 } 2408 } 2409 break; 2410 } 2411 2412 case DIOCXROLLBACK: { 2413 struct pfioc_trans *io = (struct pfioc_trans *)addr; 2414 struct pfioc_trans_e ioe; 2415 struct pfr_table table; 2416 int i; 2417 2418 if (io->esize != sizeof(ioe)) { 2419 error = ENODEV; 2420 goto fail; 2421 } 2422 for (i = 0; i < io->size; i++) { 2423 if (copyin(io->array+i, &ioe, sizeof(ioe))) { 2424 error = EFAULT; 2425 goto fail; 2426 } 2427 switch (ioe.rs_num) { 2428 #ifdef ALTQ 2429 case PF_RULESET_ALTQ: 2430 if (ioe.anchor[0] || ioe.ruleset[0]) { 2431 error = EINVAL; 2432 goto fail; 2433 } 2434 if ((error = pf_rollback_altq(ioe.ticket))) 2435 goto fail; /* really bad */ 2436 break; 2437 #endif /* ALTQ */ 2438 case PF_RULESET_TABLE: 2439 bzero(&table, sizeof(table)); 2440 strlcpy(table.pfrt_anchor, ioe.anchor, 2441 sizeof(table.pfrt_anchor)); 2442 strlcpy(table.pfrt_ruleset, ioe.ruleset, 2443 sizeof(table.pfrt_ruleset)); 2444 if ((error = pfr_ina_rollback(&table, 2445 ioe.ticket, NULL, 0))) 2446 goto fail; /* really bad */ 2447 break; 2448 default: 2449 if ((error = pf_rollback_rules(ioe.ticket, 2450 ioe.rs_num, ioe.anchor, ioe.ruleset))) 2451 goto fail; /* really bad */ 2452 break; 2453 } 2454 } 2455 break; 2456 } 2457 2458 case DIOCXCOMMIT: { 2459 struct pfioc_trans *io = (struct pfioc_trans *)addr; 2460 struct pfioc_trans_e ioe; 2461 struct pfr_table table; 2462 struct pf_ruleset *rs; 2463 int i; 2464 2465 if (io->esize != sizeof(ioe)) { 2466 error = ENODEV; 2467 goto fail; 2468 } 2469 /* first makes sure everything will succeed */ 2470 for (i = 0; i < io->size; i++) { 2471 if (copyin(io->array+i, &ioe, sizeof(ioe))) { 2472 error = EFAULT; 2473 goto fail; 2474 } 2475 switch (ioe.rs_num) { 2476 #ifdef ALTQ 2477 case PF_RULESET_ALTQ: 2478 if (ioe.anchor[0] || ioe.ruleset[0]) { 2479 error = EINVAL; 2480 goto fail; 2481 } 2482 if (!altqs_inactive_open || ioe.ticket != 2483 ticket_altqs_inactive) { 2484 error = EBUSY; 2485 goto fail; 2486 } 2487 break; 2488 #endif /* ALTQ */ 2489 case PF_RULESET_TABLE: 2490 rs = pf_find_ruleset(ioe.anchor, ioe.ruleset); 2491 if (rs == NULL || !rs->topen || ioe.ticket != 2492 rs->tticket) { 2493 error = EBUSY; 2494 goto fail; 2495 } 2496 break; 2497 default: 2498 if (ioe.rs_num < 0 || ioe.rs_num >= 2499 PF_RULESET_MAX) { 2500 error = EINVAL; 2501 goto fail; 2502 } 2503 rs = pf_find_ruleset(ioe.anchor, ioe.ruleset); 2504 if (rs == NULL || 2505 !rs->rules[ioe.rs_num].inactive.open || 2506 rs->rules[ioe.rs_num].inactive.ticket != 2507 ioe.ticket) { 2508 error = EBUSY; 2509 goto fail; 2510 } 2511 break; 2512 } 2513 } 2514 /* now do the commit - no errors should happen here */ 2515 for (i = 0; i < io->size; i++) { 2516 if (copyin(io->array+i, &ioe, sizeof(ioe))) { 2517 error = EFAULT; 2518 goto fail; 2519 } 2520 switch (ioe.rs_num) { 2521 #ifdef ALTQ 2522 case PF_RULESET_ALTQ: 2523 if ((error = pf_commit_altq(ioe.ticket))) 2524 goto fail; /* really bad */ 2525 break; 2526 #endif /* ALTQ */ 2527 case PF_RULESET_TABLE: 2528 bzero(&table, sizeof(table)); 2529 strlcpy(table.pfrt_anchor, ioe.anchor, 2530 sizeof(table.pfrt_anchor)); 2531 strlcpy(table.pfrt_ruleset, ioe.ruleset, 2532 sizeof(table.pfrt_ruleset)); 2533 if ((error = pfr_ina_commit(&table, ioe.ticket, 2534 NULL, NULL, 0))) 2535 goto fail; /* really bad */ 2536 break; 2537 default: 2538 if ((error = pf_commit_rules(ioe.ticket, 2539 ioe.rs_num, ioe.anchor, ioe.ruleset))) 2540 goto fail; /* really bad */ 2541 break; 2542 } 2543 } 2544 break; 2545 } 2546 2547 case DIOCGETSRCNODES: { 2548 struct pfioc_src_nodes *psn = (struct pfioc_src_nodes *)addr; 2549 struct pf_src_node *n; 2550 struct pf_src_node *p, pstore; 2551 u_int32_t nr = 0; 2552 int space = psn->psn_len; 2553 2554 if (space == 0) { 2555 s = splsoftnet(); 2556 RB_FOREACH(n, pf_src_tree, &tree_src_tracking) 2557 nr++; 2558 splx(s); 2559 psn->psn_len = sizeof(struct pf_src_node) * nr; 2560 return (0); 2561 } 2562 2563 s = splsoftnet(); 2564 p = psn->psn_src_nodes; 2565 RB_FOREACH(n, pf_src_tree, &tree_src_tracking) { 2566 int secs = time.tv_sec; 2567 2568 if ((nr + 1) * sizeof(*p) > (unsigned)psn->psn_len) 2569 break; 2570 2571 bcopy(n, &pstore, sizeof(pstore)); 2572 if (n->rule.ptr != NULL) 2573 pstore.rule.nr = n->rule.ptr->nr; 2574 pstore.creation = secs - pstore.creation; 2575 if (pstore.expire > secs) 2576 pstore.expire -= secs; 2577 else 2578 pstore.expire = 0; 2579 error = copyout(&pstore, p, sizeof(*p)); 2580 if (error) { 2581 splx(s); 2582 goto fail; 2583 } 2584 p++; 2585 nr++; 2586 } 2587 psn->psn_len = sizeof(struct pf_src_node) * nr; 2588 splx(s); 2589 break; 2590 } 2591 2592 case DIOCCLRSRCNODES: { 2593 struct pf_src_node *n; 2594 struct pf_state *state; 2595 2596 s = splsoftnet(); 2597 RB_FOREACH(state, pf_state_tree_id, &tree_id) { 2598 state->src_node = NULL; 2599 state->nat_src_node = NULL; 2600 } 2601 RB_FOREACH(n, pf_src_tree, &tree_src_tracking) { 2602 n->expire = 1; 2603 n->states = 0; 2604 } 2605 pf_purge_expired_src_nodes(); 2606 pf_status.src_nodes = 0; 2607 splx(s); 2608 break; 2609 } 2610 2611 case DIOCSETHOSTID: { 2612 u_int32_t *hostid = (u_int32_t *)addr; 2613 2614 if (*hostid == 0) { 2615 error = EINVAL; 2616 goto fail; 2617 } 2618 pf_status.hostid = *hostid; 2619 break; 2620 } 2621 2622 case DIOCOSFPFLUSH: 2623 s = splsoftnet(); 2624 pf_osfp_flush(); 2625 splx(s); 2626 break; 2627 2628 case DIOCIGETIFACES: { 2629 struct pfioc_iface *io = (struct pfioc_iface *)addr; 2630 2631 if (io->pfiio_esize != sizeof(struct pfi_if)) { 2632 error = ENODEV; 2633 break; 2634 } 2635 error = pfi_get_ifaces(io->pfiio_name, io->pfiio_buffer, 2636 &io->pfiio_size, io->pfiio_flags); 2637 break; 2638 } 2639 2640 case DIOCICLRISTATS: { 2641 struct pfioc_iface *io = (struct pfioc_iface *)addr; 2642 2643 error = pfi_clr_istats(io->pfiio_name, &io->pfiio_nzero, 2644 io->pfiio_flags); 2645 break; 2646 } 2647 2648 default: 2649 error = ENODEV; 2650 break; 2651 } 2652 fail: 2653 2654 return (error); 2655 } 2656
Indexes created Thu Sep 25 16:09:42 GMT 2025