pf_ioctl.c revision 1.32.10.1
1 /* $NetBSD: pf_ioctl.c,v 1.32.10.1 2008/04/19 08:33:27 yamt Exp $ */ 2 /* $OpenBSD: pf_ioctl.c,v 1.182 2007/06/24 11:17:13 mcbride Exp $ */ 3 4 /* 5 * Copyright (c) 2001 Daniel Hartmeier 6 * Copyright (c) 2002,2003 Henning Brauer 7 * All rights reserved. 8 * 9 * Redistribution and use in source and binary forms, with or without 10 * modification, are permitted provided that the following conditions 11 * are met: 12 * 13 * - Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * - Redistributions in binary form must reproduce the above 16 * copyright notice, this list of conditions and the following 17 * disclaimer in the documentation and/or other materials provided 18 * with the distribution. 19 * 20 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 21 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 22 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS 23 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE 24 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, 25 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, 26 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; 27 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER 28 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN 30 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 31 * POSSIBILITY OF SUCH DAMAGE. 32 * 33 * Effort sponsored in part by the Defense Advanced Research Projects 34 * Agency (DARPA) and Air Force Research Laboratory, Air Force 35 * Materiel Command, USAF, under agreement number F30602-01-2-0537. 36 * 37 */ 38 39 #include <sys/cdefs.h> 40 __KERNEL_RCSID(0, "$NetBSD: pf_ioctl.c,v 1.32.10.1 2008/04/19 08:33:27 yamt Exp $"); 41 42 #ifdef _KERNEL_OPT 43 #include "opt_inet.h" 44 #include "opt_pfil_hooks.h" 45 #endif 46 47 #ifndef __NetBSD__ 48 #include "pfsync.h" 49 #else 50 #define NPFSYNC 0 51 #endif /* __NetBSD__ */ 52 53 #include <sys/param.h> 54 #include <sys/systm.h> 55 #include <sys/mbuf.h> 56 #include <sys/filio.h> 57 #include <sys/fcntl.h> 58 #include <sys/socket.h> 59 #include <sys/socketvar.h> 60 #include <sys/kernel.h> 61 #include <sys/time.h> 62 #include <sys/pool.h> 63 #include <sys/proc.h> 64 #include <sys/malloc.h> 65 #include <sys/kthread.h> 66 #include <sys/rwlock.h> 67 #include <uvm/uvm_extern.h> 68 #ifdef __NetBSD__ 69 #include <sys/conf.h> 70 #include <sys/lwp.h> 71 #include <sys/kauth.h> 72 #endif /* __NetBSD__ */ 73 74 #include <net/if.h> 75 #include <net/if_types.h> 76 #include <net/route.h> 77 78 #include <netinet/in.h> 79 #include <netinet/in_var.h> 80 #include <netinet/in_systm.h> 81 #include <netinet/ip.h> 82 #include <netinet/ip_var.h> 83 #include <netinet/ip_icmp.h> 84 85 #ifndef __NetBSD__ 86 #include <dev/rndvar.h> 87 #include <crypto/md5.h> 88 #else 89 #include <sys/md5.h> 90 #endif /* __NetBSD__ */ 91 #include <net/pfvar.h> 92 93 #if NPFSYNC > 0 94 #include <net/if_pfsync.h> 95 #endif /* NPFSYNC > 0 */ 96 97 #if NPFLOG > 0 98 #include <net/if_pflog.h> 99 #endif /* NPFLOG > 0 */ 100 101 #ifdef INET6 102 #include <netinet/ip6.h> 103 #include <netinet/in_pcb.h> 104 #endif /* INET6 */ 105 106 #ifdef ALTQ 107 #include <altq/altq.h> 108 #endif 109 110 void pfattach(int); 111 #ifdef _LKM 112 void pfdetach(void); 113 #endif /* _LKM */ 114 #ifndef __NetBSD__ 115 void pf_thread_create(void *); 116 #endif /* !__NetBSD__ */ 117 int pfopen(dev_t, int, int, struct lwp *); 118 int pfclose(dev_t, int, int, struct lwp *); 119 struct pf_pool *pf_get_pool(char *, u_int32_t, u_int8_t, u_int32_t, 120 u_int8_t, u_int8_t, u_int8_t); 121 122 void pf_mv_pool(struct pf_palist *, struct pf_palist *); 123 void pf_empty_pool(struct pf_palist *); 124 int pfioctl(dev_t, u_long, void *, int, struct lwp *); 125 #ifdef ALTQ 126 int pf_begin_altq(u_int32_t *); 127 int pf_rollback_altq(u_int32_t); 128 int pf_commit_altq(u_int32_t); 129 int pf_enable_altq(struct pf_altq *); 130 int pf_disable_altq(struct pf_altq *); 131 #endif /* ALTQ */ 132 int pf_begin_rules(u_int32_t *, int, const char *); 133 int pf_rollback_rules(u_int32_t, int, char *); 134 int pf_setup_pfsync_matching(struct pf_ruleset *); 135 void pf_hash_rule(MD5_CTX *, struct pf_rule *); 136 void pf_hash_rule_addr(MD5_CTX *, struct pf_rule_addr *); 137 int pf_commit_rules(u_int32_t, int, char *); 138 void pf_state_export(struct pfsync_state *, 139 struct pf_state_key *, struct pf_state *); 140 void pf_state_import(struct pfsync_state *, 141 struct pf_state_key *, struct pf_state *); 142 143 struct pf_rule pf_default_rule; 144 #ifdef __NetBSD__ 145 krwlock_t pf_consistency_lock; 146 #else 147 struct rwlock pf_consistency_lock = RWLOCK_INITIALIZER("pfcnslk"); 148 #endif /* __NetBSD__ */ 149 #ifdef ALTQ 150 static int pf_altq_running; 151 #endif 152 153 #define TAGID_MAX 50000 154 TAILQ_HEAD(pf_tags, pf_tagname) pf_tags = TAILQ_HEAD_INITIALIZER(pf_tags), 155 pf_qids = TAILQ_HEAD_INITIALIZER(pf_qids); 156 157 #if (PF_QNAME_SIZE != PF_TAG_NAME_SIZE) 158 #error PF_QNAME_SIZE must be equal to PF_TAG_NAME_SIZE 159 #endif 160 u_int16_t tagname2tag(struct pf_tags *, char *); 161 void tag2tagname(struct pf_tags *, u_int16_t, char *); 162 void tag_unref(struct pf_tags *, u_int16_t); 163 int pf_rtlabel_add(struct pf_addr_wrap *); 164 void pf_rtlabel_remove(struct pf_addr_wrap *); 165 void pf_rtlabel_copyout(struct pf_addr_wrap *); 166 167 #define DPFPRINTF(n, x) if (pf_status.debug >= (n)) printf x 168 169 #ifdef __NetBSD__ 170 const struct cdevsw pf_cdevsw = { 171 pfopen, pfclose, noread, nowrite, pfioctl, 172 nostop, notty, nopoll, nommap, nokqfilter, D_OTHER 173 }; 174 175 static int pfil4_wrapper(void *, struct mbuf **, struct ifnet *, int); 176 static int pfil6_wrapper(void *, struct mbuf **, struct ifnet *, int); 177 178 static int pf_pfil_attach(void); 179 static int pf_pfil_detach(void); 180 181 static int pf_pfil_attached; 182 #endif /* __NetBSD__ */ 183 184 void 185 pfattach(int num) 186 { 187 u_int32_t *timeout = pf_default_rule.timeout; 188 189 #ifdef __NetBSD__ 190 pool_init(&pf_rule_pl, sizeof(struct pf_rule), 0, 0, 0, "pfrulepl", 191 &pool_allocator_nointr, IPL_NONE); 192 pool_init(&pf_src_tree_pl, sizeof(struct pf_src_node), 0, 0, 0, 193 "pfsrctrpl", NULL, IPL_SOFTNET); 194 pool_init(&pf_state_pl, sizeof(struct pf_state), 0, 0, 0, "pfstatepl", 195 NULL, IPL_SOFTNET); 196 pool_init(&pf_state_key_pl, sizeof(struct pf_state_key), 0, 0, 0, 197 "pfstatekeypl", NULL, IPL_SOFTNET); 198 pool_init(&pf_altq_pl, sizeof(struct pf_altq), 0, 0, 0, "pfaltqpl", 199 &pool_allocator_nointr, IPL_NONE); 200 pool_init(&pf_pooladdr_pl, sizeof(struct pf_pooladdr), 0, 0, 0, 201 "pfpooladdrpl", &pool_allocator_nointr, IPL_NONE); 202 #else 203 pool_init(&pf_rule_pl, sizeof(struct pf_rule), 0, 0, 0, "pfrulepl", 204 &pool_allocator_nointr); 205 pool_init(&pf_src_tree_pl, sizeof(struct pf_src_node), 0, 0, 0, 206 "pfsrctrpl", NULL); 207 pool_init(&pf_state_pl, sizeof(struct pf_state), 0, 0, 0, "pfstatepl", 208 NULL); 209 pool_init(&pf_state_key_pl, sizeof(struct pf_state_key), 0, 0, 0, 210 "pfstatekeypl", NULL); 211 pool_init(&pf_altq_pl, sizeof(struct pf_altq), 0, 0, 0, "pfaltqpl", 212 &pool_allocator_nointr); 213 pool_init(&pf_pooladdr_pl, sizeof(struct pf_pooladdr), 0, 0, 0, 214 "pfpooladdrpl", &pool_allocator_nointr); 215 #endif /* !__NetBSD__ */ 216 217 pfr_initialize(); 218 pfi_initialize(); 219 pf_osfp_initialize(); 220 221 pool_sethardlimit(pf_pool_limits[PF_LIMIT_STATES].pp, 222 pf_pool_limits[PF_LIMIT_STATES].limit, NULL, 0); 223 224 if (ctob(physmem) <= 100*1024*1024) 225 pf_pool_limits[PF_LIMIT_TABLE_ENTRIES].limit = 226 PFR_KENTRY_HIWAT_SMALL; 227 228 RB_INIT(&tree_src_tracking); 229 RB_INIT(&pf_anchors); 230 pf_init_ruleset(&pf_main_ruleset); 231 TAILQ_INIT(&pf_altqs[0]); 232 TAILQ_INIT(&pf_altqs[1]); 233 TAILQ_INIT(&pf_pabuf); 234 pf_altqs_active = &pf_altqs[0]; 235 pf_altqs_inactive = &pf_altqs[1]; 236 TAILQ_INIT(&state_list); 237 238 #ifdef __NetBSD__ 239 rw_init(&pf_consistency_lock); 240 #endif /* __NetBSD__ */ 241 242 /* default rule should never be garbage collected */ 243 pf_default_rule.entries.tqe_prev = &pf_default_rule.entries.tqe_next; 244 pf_default_rule.action = PF_PASS; 245 pf_default_rule.nr = -1; 246 pf_default_rule.rtableid = -1; 247 248 /* initialize default timeouts */ 249 timeout[PFTM_TCP_FIRST_PACKET] = PFTM_TCP_FIRST_PACKET_VAL; 250 timeout[PFTM_TCP_OPENING] = PFTM_TCP_OPENING_VAL; 251 timeout[PFTM_TCP_ESTABLISHED] = PFTM_TCP_ESTABLISHED_VAL; 252 timeout[PFTM_TCP_CLOSING] = PFTM_TCP_CLOSING_VAL; 253 timeout[PFTM_TCP_FIN_WAIT] = PFTM_TCP_FIN_WAIT_VAL; 254 timeout[PFTM_TCP_CLOSED] = PFTM_TCP_CLOSED_VAL; 255 timeout[PFTM_UDP_FIRST_PACKET] = PFTM_UDP_FIRST_PACKET_VAL; 256 timeout[PFTM_UDP_SINGLE] = PFTM_UDP_SINGLE_VAL; 257 timeout[PFTM_UDP_MULTIPLE] = PFTM_UDP_MULTIPLE_VAL; 258 timeout[PFTM_ICMP_FIRST_PACKET] = PFTM_ICMP_FIRST_PACKET_VAL; 259 timeout[PFTM_ICMP_ERROR_REPLY] = PFTM_ICMP_ERROR_REPLY_VAL; 260 timeout[PFTM_OTHER_FIRST_PACKET] = PFTM_OTHER_FIRST_PACKET_VAL; 261 timeout[PFTM_OTHER_SINGLE] = PFTM_OTHER_SINGLE_VAL; 262 timeout[PFTM_OTHER_MULTIPLE] = PFTM_OTHER_MULTIPLE_VAL; 263 timeout[PFTM_FRAG] = PFTM_FRAG_VAL; 264 timeout[PFTM_INTERVAL] = PFTM_INTERVAL_VAL; 265 timeout[PFTM_SRC_NODE] = PFTM_SRC_NODE_VAL; 266 timeout[PFTM_TS_DIFF] = PFTM_TS_DIFF_VAL; 267 timeout[PFTM_ADAPTIVE_START] = PFSTATE_ADAPT_START; 268 timeout[PFTM_ADAPTIVE_END] = PFSTATE_ADAPT_END; 269 270 pf_normalize_init(); 271 bzero(&pf_status, sizeof(pf_status)); 272 pf_status.debug = PF_DEBUG_URGENT; 273 274 /* XXX do our best to avoid a conflict */ 275 pf_status.hostid = arc4random(); 276 277 /* require process context to purge states, so perform in a thread */ 278 #ifdef __NetBSD__ 279 if (kthread_create(PRI_NONE, 0, NULL, pf_purge_thread, NULL, NULL, 280 "pfpurge")) 281 panic("pfpurge thread"); 282 #else 283 kthread_create_deferred(pf_thread_create, NULL); 284 #endif /* !__NetBSD__ */ 285 } 286 287 #ifdef _LKM 288 void 289 pfdetach(void) 290 { 291 struct pf_anchor *anchor; 292 struct pf_state *state; 293 struct pf_src_node *node; 294 struct pfioc_table pt; 295 u_int32_t ticket; 296 int i; 297 char r = '\0'; 298 299 (void)pf_pfil_detach(); 300 301 pf_status.running = 0; 302 303 /* clear the rulesets */ 304 for (i = 0; i < PF_RULESET_MAX; i++) 305 if (pf_begin_rules(&ticket, i, &r) == 0) 306 pf_commit_rules(ticket, i, &r); 307 #ifdef ALTQ 308 if (pf_begin_altq(&ticket) == 0) 309 pf_commit_altq(ticket); 310 #endif /* ALTQ */ 311 312 /* clear states */ 313 RB_FOREACH(state, pf_state_tree_id, &tree_id) { 314 state->timeout = PFTM_PURGE; 315 #if NPFSYNC > 0 316 state->sync_flags = PFSTATE_NOSYNC; 317 #endif /* NPFSYNC > 0 */ 318 } 319 pf_purge_expired_states(); 320 #if NPFSYNC > 0 321 pfsync_clear_states(pf_status.hostid, NULL); 322 #endif /* NPFSYNC > 0 */ 323 324 /* clear source nodes */ 325 RB_FOREACH(state, pf_state_tree_id, &tree_id) { 326 state->src_node = NULL; 327 state->nat_src_node = NULL; 328 } 329 RB_FOREACH(node, pf_src_tree, &tree_src_tracking) { 330 node->expire = 1; 331 node->states = 0; 332 } 333 pf_purge_expired_src_nodes(); 334 335 /* clear tables */ 336 memset(&pt, '\0', sizeof(pt)); 337 pfr_clr_tables(&pt.pfrio_table, &pt.pfrio_ndel, pt.pfrio_flags); 338 339 /* destroy anchors */ 340 while ((anchor = RB_MIN(pf_anchor_global, &pf_anchors)) != NULL) { 341 for (i = 0; i < PF_RULESET_MAX; i++) 342 if (pf_begin_rules(&ticket, i, anchor->name) == 0) 343 pf_commit_rules(ticket, i, anchor->name); 344 } 345 346 /* destroy main ruleset */ 347 pf_remove_if_empty_ruleset(&pf_main_ruleset); 348 349 /* destroy the pools */ 350 pool_destroy(&pf_pooladdr_pl); 351 pool_destroy(&pf_altq_pl); 352 pool_destroy(&pf_state_key_pl); 353 pool_destroy(&pf_state_pl); 354 pool_destroy(&pf_rule_pl); 355 pool_destroy(&pf_src_tree_pl); 356 357 rw_destroy(&pf_consistency_lock); 358 359 /* destroy subsystems */ 360 pf_normalize_destroy(); 361 pf_osfp_destroy(); 362 pfr_destroy(); 363 pfi_destroy(); 364 } 365 #endif /* _LKM */ 366 367 #ifndef __NetBSD__ 368 void 369 pf_thread_create(void *v) 370 { 371 if (kthread_create(pf_purge_thread, NULL, NULL, "pfpurge")) 372 panic("pfpurge thread"); 373 } 374 #endif /* !__NetBSD__ */ 375 376 int 377 pfopen(dev_t dev, int flags, int fmt, struct lwp *l) 378 { 379 if (minor(dev) >= 1) 380 return (ENXIO); 381 return (0); 382 } 383 384 int 385 pfclose(dev_t dev, int flags, int fmt, struct lwp *l) 386 { 387 if (minor(dev) >= 1) 388 return (ENXIO); 389 return (0); 390 } 391 392 struct pf_pool * 393 pf_get_pool(char *anchor, u_int32_t ticket, u_int8_t rule_action, 394 u_int32_t rule_number, u_int8_t r_last, u_int8_t active, 395 u_int8_t check_ticket) 396 { 397 struct pf_ruleset *ruleset; 398 struct pf_rule *rule; 399 int rs_num; 400 401 ruleset = pf_find_ruleset(anchor); 402 if (ruleset == NULL) 403 return (NULL); 404 rs_num = pf_get_ruleset_number(rule_action); 405 if (rs_num >= PF_RULESET_MAX) 406 return (NULL); 407 if (active) { 408 if (check_ticket && ticket != 409 ruleset->rules[rs_num].active.ticket) 410 return (NULL); 411 if (r_last) 412 rule = TAILQ_LAST(ruleset->rules[rs_num].active.ptr, 413 pf_rulequeue); 414 else 415 rule = TAILQ_FIRST(ruleset->rules[rs_num].active.ptr); 416 } else { 417 if (check_ticket && ticket != 418 ruleset->rules[rs_num].inactive.ticket) 419 return (NULL); 420 if (r_last) 421 rule = TAILQ_LAST(ruleset->rules[rs_num].inactive.ptr, 422 pf_rulequeue); 423 else 424 rule = TAILQ_FIRST(ruleset->rules[rs_num].inactive.ptr); 425 } 426 if (!r_last) { 427 while ((rule != NULL) && (rule->nr != rule_number)) 428 rule = TAILQ_NEXT(rule, entries); 429 } 430 if (rule == NULL) 431 return (NULL); 432 433 return (&rule->rpool); 434 } 435 436 void 437 pf_mv_pool(struct pf_palist *poola, struct pf_palist *poolb) 438 { 439 struct pf_pooladdr *mv_pool_pa; 440 441 while ((mv_pool_pa = TAILQ_FIRST(poola)) != NULL) { 442 TAILQ_REMOVE(poola, mv_pool_pa, entries); 443 TAILQ_INSERT_TAIL(poolb, mv_pool_pa, entries); 444 } 445 } 446 447 void 448 pf_empty_pool(struct pf_palist *poola) 449 { 450 struct pf_pooladdr *empty_pool_pa; 451 452 while ((empty_pool_pa = TAILQ_FIRST(poola)) != NULL) { 453 pfi_dynaddr_remove(&empty_pool_pa->addr); 454 pf_tbladdr_remove(&empty_pool_pa->addr); 455 pfi_kif_unref(empty_pool_pa->kif, PFI_KIF_REF_RULE); 456 TAILQ_REMOVE(poola, empty_pool_pa, entries); 457 pool_put(&pf_pooladdr_pl, empty_pool_pa); 458 } 459 } 460 461 void 462 pf_rm_rule(struct pf_rulequeue *rulequeue, struct pf_rule *rule) 463 { 464 if (rulequeue != NULL) { 465 if (rule->states <= 0) { 466 /* 467 * XXX - we need to remove the table *before* detaching 468 * the rule to make sure the table code does not delete 469 * the anchor under our feet. 470 */ 471 pf_tbladdr_remove(&rule->src.addr); 472 pf_tbladdr_remove(&rule->dst.addr); 473 if (rule->overload_tbl) 474 pfr_detach_table(rule->overload_tbl); 475 } 476 TAILQ_REMOVE(rulequeue, rule, entries); 477 rule->entries.tqe_prev = NULL; 478 rule->nr = -1; 479 } 480 481 if (rule->states > 0 || rule->src_nodes > 0 || 482 rule->entries.tqe_prev != NULL) 483 return; 484 pf_tag_unref(rule->tag); 485 pf_tag_unref(rule->match_tag); 486 #ifdef ALTQ 487 if (rule->pqid != rule->qid) 488 pf_qid_unref(rule->pqid); 489 pf_qid_unref(rule->qid); 490 #endif 491 pf_rtlabel_remove(&rule->src.addr); 492 pf_rtlabel_remove(&rule->dst.addr); 493 pfi_dynaddr_remove(&rule->src.addr); 494 pfi_dynaddr_remove(&rule->dst.addr); 495 if (rulequeue == NULL) { 496 pf_tbladdr_remove(&rule->src.addr); 497 pf_tbladdr_remove(&rule->dst.addr); 498 if (rule->overload_tbl) 499 pfr_detach_table(rule->overload_tbl); 500 } 501 pfi_kif_unref(rule->kif, PFI_KIF_REF_RULE); 502 pf_anchor_remove(rule); 503 pf_empty_pool(&rule->rpool.list); 504 pool_put(&pf_rule_pl, rule); 505 } 506 507 u_int16_t 508 tagname2tag(struct pf_tags *head, char *tagname) 509 { 510 struct pf_tagname *tag, *p = NULL; 511 u_int16_t new_tagid = 1; 512 513 TAILQ_FOREACH(tag, head, entries) 514 if (strcmp(tagname, tag->name) == 0) { 515 tag->ref++; 516 return (tag->tag); 517 } 518 519 /* 520 * to avoid fragmentation, we do a linear search from the beginning 521 * and take the first free slot we find. if there is none or the list 522 * is empty, append a new entry at the end. 523 */ 524 525 /* new entry */ 526 if (!TAILQ_EMPTY(head)) 527 for (p = TAILQ_FIRST(head); p != NULL && 528 p->tag == new_tagid; p = TAILQ_NEXT(p, entries)) 529 new_tagid = p->tag + 1; 530 531 if (new_tagid > TAGID_MAX) 532 return (0); 533 534 /* allocate and fill new struct pf_tagname */ 535 tag = (struct pf_tagname *)malloc(sizeof(struct pf_tagname), 536 M_TEMP, M_NOWAIT); 537 if (tag == NULL) 538 return (0); 539 bzero(tag, sizeof(struct pf_tagname)); 540 strlcpy(tag->name, tagname, sizeof(tag->name)); 541 tag->tag = new_tagid; 542 tag->ref++; 543 544 if (p != NULL) /* insert new entry before p */ 545 TAILQ_INSERT_BEFORE(p, tag, entries); 546 else /* either list empty or no free slot in between */ 547 TAILQ_INSERT_TAIL(head, tag, entries); 548 549 return (tag->tag); 550 } 551 552 void 553 tag2tagname(struct pf_tags *head, u_int16_t tagid, char *p) 554 { 555 struct pf_tagname *tag; 556 557 TAILQ_FOREACH(tag, head, entries) 558 if (tag->tag == tagid) { 559 strlcpy(p, tag->name, PF_TAG_NAME_SIZE); 560 return; 561 } 562 } 563 564 void 565 tag_unref(struct pf_tags *head, u_int16_t tag) 566 { 567 struct pf_tagname *p, *next; 568 569 if (tag == 0) 570 return; 571 572 for (p = TAILQ_FIRST(head); p != NULL; p = next) { 573 next = TAILQ_NEXT(p, entries); 574 if (tag == p->tag) { 575 if (--p->ref == 0) { 576 TAILQ_REMOVE(head, p, entries); 577 free(p, M_TEMP); 578 } 579 break; 580 } 581 } 582 } 583 584 u_int16_t 585 pf_tagname2tag(char *tagname) 586 { 587 return (tagname2tag(&pf_tags, tagname)); 588 } 589 590 void 591 pf_tag2tagname(u_int16_t tagid, char *p) 592 { 593 tag2tagname(&pf_tags, tagid, p); 594 } 595 596 void 597 pf_tag_ref(u_int16_t tag) 598 { 599 struct pf_tagname *t; 600 601 TAILQ_FOREACH(t, &pf_tags, entries) 602 if (t->tag == tag) 603 break; 604 if (t != NULL) 605 t->ref++; 606 } 607 608 void 609 pf_tag_unref(u_int16_t tag) 610 { 611 tag_unref(&pf_tags, tag); 612 } 613 614 int 615 pf_rtlabel_add(struct pf_addr_wrap *a) 616 { 617 #ifndef __NetBSD__ 618 if (a->type == PF_ADDR_RTLABEL && 619 (a->v.rtlabel = rtlabel_name2id(a->v.rtlabelname)) == 0) 620 return (-1); 621 #endif /* !__NetBSD__ */ 622 return (0); 623 } 624 625 void 626 pf_rtlabel_remove(struct pf_addr_wrap *a) 627 { 628 #ifndef __NetBSD__ 629 if (a->type == PF_ADDR_RTLABEL) 630 rtlabel_unref(a->v.rtlabel); 631 #endif /* !__NetBSD__ */ 632 } 633 634 void 635 pf_rtlabel_copyout(struct pf_addr_wrap *a) 636 { 637 #ifndef __NetBSD__ 638 const char *name; 639 640 if (a->type == PF_ADDR_RTLABEL && a->v.rtlabel) { 641 if ((name = rtlabel_id2name(a->v.rtlabel)) == NULL) 642 strlcpy(a->v.rtlabelname, "?", 643 sizeof(a->v.rtlabelname)); 644 else 645 strlcpy(a->v.rtlabelname, name, 646 sizeof(a->v.rtlabelname)); 647 } 648 #endif /* !__NetBSD__ */ 649 } 650 651 #ifdef ALTQ 652 u_int32_t 653 pf_qname2qid(char *qname) 654 { 655 return ((u_int32_t)tagname2tag(&pf_qids, qname)); 656 } 657 658 void 659 pf_qid2qname(u_int32_t qid, char *p) 660 { 661 tag2tagname(&pf_qids, (u_int16_t)qid, p); 662 } 663 664 void 665 pf_qid_unref(u_int32_t qid) 666 { 667 tag_unref(&pf_qids, (u_int16_t)qid); 668 } 669 670 int 671 pf_begin_altq(u_int32_t *ticket) 672 { 673 struct pf_altq *altq; 674 int error = 0; 675 676 /* Purge the old altq list */ 677 while ((altq = TAILQ_FIRST(pf_altqs_inactive)) != NULL) { 678 TAILQ_REMOVE(pf_altqs_inactive, altq, entries); 679 if (altq->qname[0] == 0) { 680 /* detach and destroy the discipline */ 681 error = altq_remove(altq); 682 } else 683 pf_qid_unref(altq->qid); 684 pool_put(&pf_altq_pl, altq); 685 } 686 if (error) 687 return (error); 688 *ticket = ++ticket_altqs_inactive; 689 altqs_inactive_open = 1; 690 return (0); 691 } 692 693 int 694 pf_rollback_altq(u_int32_t ticket) 695 { 696 struct pf_altq *altq; 697 int error = 0; 698 699 if (!altqs_inactive_open || ticket != ticket_altqs_inactive) 700 return (0); 701 /* Purge the old altq list */ 702 while ((altq = TAILQ_FIRST(pf_altqs_inactive)) != NULL) { 703 TAILQ_REMOVE(pf_altqs_inactive, altq, entries); 704 if (altq->qname[0] == 0) { 705 /* detach and destroy the discipline */ 706 error = altq_remove(altq); 707 } else 708 pf_qid_unref(altq->qid); 709 pool_put(&pf_altq_pl, altq); 710 } 711 altqs_inactive_open = 0; 712 return (error); 713 } 714 715 int 716 pf_commit_altq(u_int32_t ticket) 717 { 718 struct pf_altqqueue *old_altqs; 719 struct pf_altq *altq; 720 int s, err, error = 0; 721 722 if (!altqs_inactive_open || ticket != ticket_altqs_inactive) 723 return (EBUSY); 724 725 /* swap altqs, keep the old. */ 726 s = splsoftnet(); 727 old_altqs = pf_altqs_active; 728 pf_altqs_active = pf_altqs_inactive; 729 pf_altqs_inactive = old_altqs; 730 ticket_altqs_active = ticket_altqs_inactive; 731 732 /* Attach new disciplines */ 733 TAILQ_FOREACH(altq, pf_altqs_active, entries) { 734 if (altq->qname[0] == 0) { 735 /* attach the discipline */ 736 error = altq_pfattach(altq); 737 if (error == 0 && pf_altq_running) 738 error = pf_enable_altq(altq); 739 if (error != 0) { 740 splx(s); 741 return (error); 742 } 743 } 744 } 745 746 /* Purge the old altq list */ 747 while ((altq = TAILQ_FIRST(pf_altqs_inactive)) != NULL) { 748 TAILQ_REMOVE(pf_altqs_inactive, altq, entries); 749 if (altq->qname[0] == 0) { 750 /* detach and destroy the discipline */ 751 if (pf_altq_running) 752 error = pf_disable_altq(altq); 753 err = altq_pfdetach(altq); 754 if (err != 0 && error == 0) 755 error = err; 756 err = altq_remove(altq); 757 if (err != 0 && error == 0) 758 error = err; 759 } else 760 pf_qid_unref(altq->qid); 761 pool_put(&pf_altq_pl, altq); 762 } 763 splx(s); 764 765 altqs_inactive_open = 0; 766 return (error); 767 } 768 769 int 770 pf_enable_altq(struct pf_altq *altq) 771 { 772 struct ifnet *ifp; 773 struct tb_profile tb; 774 int s, error = 0; 775 776 if ((ifp = ifunit(altq->ifname)) == NULL) 777 return (EINVAL); 778 779 if (ifp->if_snd.altq_type != ALTQT_NONE) 780 error = altq_enable(&ifp->if_snd); 781 782 /* set tokenbucket regulator */ 783 if (error == 0 && ifp != NULL && ALTQ_IS_ENABLED(&ifp->if_snd)) { 784 tb.rate = altq->ifbandwidth; 785 tb.depth = altq->tbrsize; 786 s = splnet(); 787 error = tbr_set(&ifp->if_snd, &tb); 788 splx(s); 789 } 790 791 return (error); 792 } 793 794 int 795 pf_disable_altq(struct pf_altq *altq) 796 { 797 struct ifnet *ifp; 798 struct tb_profile tb; 799 int s, error; 800 801 if ((ifp = ifunit(altq->ifname)) == NULL) 802 return (EINVAL); 803 804 /* 805 * when the discipline is no longer referenced, it was overridden 806 * by a new one. if so, just return. 807 */ 808 if (altq->altq_disc != ifp->if_snd.altq_disc) 809 return (0); 810 811 error = altq_disable(&ifp->if_snd); 812 813 if (error == 0) { 814 /* clear tokenbucket regulator */ 815 tb.rate = 0; 816 s = splnet(); 817 error = tbr_set(&ifp->if_snd, &tb); 818 splx(s); 819 } 820 821 return (error); 822 } 823 #endif /* ALTQ */ 824 825 int 826 pf_begin_rules(u_int32_t *ticket, int rs_num, const char *anchor) 827 { 828 struct pf_ruleset *rs; 829 struct pf_rule *rule; 830 831 if (rs_num < 0 || rs_num >= PF_RULESET_MAX) 832 return (EINVAL); 833 rs = pf_find_or_create_ruleset(anchor); 834 if (rs == NULL) 835 return (EINVAL); 836 while ((rule = TAILQ_FIRST(rs->rules[rs_num].inactive.ptr)) != NULL) { 837 pf_rm_rule(rs->rules[rs_num].inactive.ptr, rule); 838 rs->rules[rs_num].inactive.rcount--; 839 } 840 *ticket = ++rs->rules[rs_num].inactive.ticket; 841 rs->rules[rs_num].inactive.open = 1; 842 return (0); 843 } 844 845 int 846 pf_rollback_rules(u_int32_t ticket, int rs_num, char *anchor) 847 { 848 struct pf_ruleset *rs; 849 struct pf_rule *rule; 850 851 if (rs_num < 0 || rs_num >= PF_RULESET_MAX) 852 return (EINVAL); 853 rs = pf_find_ruleset(anchor); 854 if (rs == NULL || !rs->rules[rs_num].inactive.open || 855 rs->rules[rs_num].inactive.ticket != ticket) 856 return (0); 857 while ((rule = TAILQ_FIRST(rs->rules[rs_num].inactive.ptr)) != NULL) { 858 pf_rm_rule(rs->rules[rs_num].inactive.ptr, rule); 859 rs->rules[rs_num].inactive.rcount--; 860 } 861 rs->rules[rs_num].inactive.open = 0; 862 return (0); 863 } 864 865 #define PF_MD5_UPD(st, elm) \ 866 MD5Update(ctx, (u_int8_t *) &(st)->elm, sizeof((st)->elm)) 867 868 #define PF_MD5_UPD_STR(st, elm) \ 869 MD5Update(ctx, (u_int8_t *) (st)->elm, strlen((st)->elm)) 870 871 #define PF_MD5_UPD_HTONL(st, elm, stor) do { \ 872 (stor) = htonl((st)->elm); \ 873 MD5Update(ctx, (u_int8_t *) &(stor), sizeof(u_int32_t));\ 874 } while (0) 875 876 #define PF_MD5_UPD_HTONS(st, elm, stor) do { \ 877 (stor) = htons((st)->elm); \ 878 MD5Update(ctx, (u_int8_t *) &(stor), sizeof(u_int16_t));\ 879 } while (0) 880 881 void 882 pf_hash_rule_addr(MD5_CTX *ctx, struct pf_rule_addr *pfr) 883 { 884 PF_MD5_UPD(pfr, addr.type); 885 switch (pfr->addr.type) { 886 case PF_ADDR_DYNIFTL: 887 PF_MD5_UPD(pfr, addr.v.ifname); 888 PF_MD5_UPD(pfr, addr.iflags); 889 break; 890 case PF_ADDR_TABLE: 891 PF_MD5_UPD(pfr, addr.v.tblname); 892 break; 893 case PF_ADDR_ADDRMASK: 894 /* XXX ignore af? */ 895 PF_MD5_UPD(pfr, addr.v.a.addr.addr32); 896 PF_MD5_UPD(pfr, addr.v.a.mask.addr32); 897 break; 898 case PF_ADDR_RTLABEL: 899 PF_MD5_UPD(pfr, addr.v.rtlabelname); 900 break; 901 } 902 903 PF_MD5_UPD(pfr, port[0]); 904 PF_MD5_UPD(pfr, port[1]); 905 PF_MD5_UPD(pfr, neg); 906 PF_MD5_UPD(pfr, port_op); 907 } 908 909 void 910 pf_hash_rule(MD5_CTX *ctx, struct pf_rule *rule) 911 { 912 u_int16_t x; 913 u_int32_t y; 914 915 pf_hash_rule_addr(ctx, &rule->src); 916 pf_hash_rule_addr(ctx, &rule->dst); 917 PF_MD5_UPD_STR(rule, label); 918 PF_MD5_UPD_STR(rule, ifname); 919 PF_MD5_UPD_STR(rule, match_tagname); 920 PF_MD5_UPD_HTONS(rule, match_tag, x); /* dup? */ 921 PF_MD5_UPD_HTONL(rule, os_fingerprint, y); 922 PF_MD5_UPD_HTONL(rule, prob, y); 923 PF_MD5_UPD_HTONL(rule, uid.uid[0], y); 924 PF_MD5_UPD_HTONL(rule, uid.uid[1], y); 925 PF_MD5_UPD(rule, uid.op); 926 PF_MD5_UPD_HTONL(rule, gid.gid[0], y); 927 PF_MD5_UPD_HTONL(rule, gid.gid[1], y); 928 PF_MD5_UPD(rule, gid.op); 929 PF_MD5_UPD_HTONL(rule, rule_flag, y); 930 PF_MD5_UPD(rule, action); 931 PF_MD5_UPD(rule, direction); 932 PF_MD5_UPD(rule, af); 933 PF_MD5_UPD(rule, quick); 934 PF_MD5_UPD(rule, ifnot); 935 PF_MD5_UPD(rule, match_tag_not); 936 PF_MD5_UPD(rule, natpass); 937 PF_MD5_UPD(rule, keep_state); 938 PF_MD5_UPD(rule, proto); 939 PF_MD5_UPD(rule, type); 940 PF_MD5_UPD(rule, code); 941 PF_MD5_UPD(rule, flags); 942 PF_MD5_UPD(rule, flagset); 943 PF_MD5_UPD(rule, allow_opts); 944 PF_MD5_UPD(rule, rt); 945 PF_MD5_UPD(rule, tos); 946 } 947 948 int 949 pf_commit_rules(u_int32_t ticket, int rs_num, char *anchor) 950 { 951 struct pf_ruleset *rs; 952 struct pf_rule *rule, **old_array; 953 struct pf_rulequeue *old_rules; 954 int s, error; 955 u_int32_t old_rcount; 956 957 if (rs_num < 0 || rs_num >= PF_RULESET_MAX) 958 return (EINVAL); 959 rs = pf_find_ruleset(anchor); 960 if (rs == NULL || !rs->rules[rs_num].inactive.open || 961 ticket != rs->rules[rs_num].inactive.ticket) 962 return (EBUSY); 963 964 /* Calculate checksum for the main ruleset */ 965 if (rs == &pf_main_ruleset) { 966 error = pf_setup_pfsync_matching(rs); 967 if (error != 0) 968 return (error); 969 } 970 971 /* Swap rules, keep the old. */ 972 s = splsoftnet(); 973 old_rules = rs->rules[rs_num].active.ptr; 974 old_rcount = rs->rules[rs_num].active.rcount; 975 old_array = rs->rules[rs_num].active.ptr_array; 976 977 rs->rules[rs_num].active.ptr = 978 rs->rules[rs_num].inactive.ptr; 979 rs->rules[rs_num].active.ptr_array = 980 rs->rules[rs_num].inactive.ptr_array; 981 rs->rules[rs_num].active.rcount = 982 rs->rules[rs_num].inactive.rcount; 983 rs->rules[rs_num].inactive.ptr = old_rules; 984 rs->rules[rs_num].inactive.ptr_array = old_array; 985 rs->rules[rs_num].inactive.rcount = old_rcount; 986 987 rs->rules[rs_num].active.ticket = 988 rs->rules[rs_num].inactive.ticket; 989 pf_calc_skip_steps(rs->rules[rs_num].active.ptr); 990 991 992 /* Purge the old rule list. */ 993 while ((rule = TAILQ_FIRST(old_rules)) != NULL) 994 pf_rm_rule(old_rules, rule); 995 if (rs->rules[rs_num].inactive.ptr_array) 996 free(rs->rules[rs_num].inactive.ptr_array, M_TEMP); 997 rs->rules[rs_num].inactive.ptr_array = NULL; 998 rs->rules[rs_num].inactive.rcount = 0; 999 rs->rules[rs_num].inactive.open = 0; 1000 pf_remove_if_empty_ruleset(rs); 1001 splx(s); 1002 return (0); 1003 } 1004 1005 void 1006 pf_state_export(struct pfsync_state *sp, struct pf_state_key *sk, 1007 struct pf_state *s) 1008 { 1009 int secs = time_second; 1010 bzero(sp, sizeof(struct pfsync_state)); 1011 1012 /* copy from state key */ 1013 sp->lan.addr = sk->lan.addr; 1014 sp->lan.port = sk->lan.port; 1015 sp->gwy.addr = sk->gwy.addr; 1016 sp->gwy.port = sk->gwy.port; 1017 sp->ext.addr = sk->ext.addr; 1018 sp->ext.port = sk->ext.port; 1019 sp->proto = sk->proto; 1020 sp->af = sk->af; 1021 sp->direction = sk->direction; 1022 1023 /* copy from state */ 1024 memcpy(&sp->id, &s->id, sizeof(sp->id)); 1025 sp->creatorid = s->creatorid; 1026 strlcpy(sp->ifname, s->kif->pfik_name, sizeof(sp->ifname)); 1027 pf_state_peer_to_pfsync(&s->src, &sp->src); 1028 pf_state_peer_to_pfsync(&s->dst, &sp->dst); 1029 1030 sp->rule = s->rule.ptr->nr; 1031 sp->nat_rule = (s->nat_rule.ptr == NULL) ? -1 : s->nat_rule.ptr->nr; 1032 sp->anchor = (s->anchor.ptr == NULL) ? -1 : s->anchor.ptr->nr; 1033 1034 pf_state_counter_to_pfsync(s->bytes[0], sp->bytes[0]); 1035 pf_state_counter_to_pfsync(s->bytes[1], sp->bytes[1]); 1036 pf_state_counter_to_pfsync(s->packets[0], sp->packets[0]); 1037 pf_state_counter_to_pfsync(s->packets[1], sp->packets[1]); 1038 sp->creation = secs - s->creation; 1039 sp->expire = pf_state_expires(s); 1040 sp->log = s->log; 1041 sp->allow_opts = s->allow_opts; 1042 sp->timeout = s->timeout; 1043 1044 if (s->src_node) 1045 sp->sync_flags |= PFSYNC_FLAG_SRCNODE; 1046 if (s->nat_src_node) 1047 sp->sync_flags |= PFSYNC_FLAG_NATSRCNODE; 1048 1049 if (sp->expire > secs) 1050 sp->expire -= secs; 1051 else 1052 sp->expire = 0; 1053 1054 } 1055 1056 void 1057 pf_state_import(struct pfsync_state *sp, struct pf_state_key *sk, 1058 struct pf_state *s) 1059 { 1060 /* copy to state key */ 1061 sk->lan.addr = sp->lan.addr; 1062 sk->lan.port = sp->lan.port; 1063 sk->gwy.addr = sp->gwy.addr; 1064 sk->gwy.port = sp->gwy.port; 1065 sk->ext.addr = sp->ext.addr; 1066 sk->ext.port = sp->ext.port; 1067 sk->proto = sp->proto; 1068 sk->af = sp->af; 1069 sk->direction = sp->direction; 1070 1071 /* copy to state */ 1072 memcpy(&s->id, &sp->id, sizeof(sp->id)); 1073 s->creatorid = sp->creatorid; 1074 strlcpy(sp->ifname, s->kif->pfik_name, sizeof(sp->ifname)); 1075 pf_state_peer_from_pfsync(&sp->src, &s->src); 1076 pf_state_peer_from_pfsync(&sp->dst, &s->dst); 1077 1078 s->rule.ptr = &pf_default_rule; 1079 s->nat_rule.ptr = NULL; 1080 s->anchor.ptr = NULL; 1081 s->rt_kif = NULL; 1082 s->creation = time_second; 1083 s->pfsync_time = 0; 1084 s->packets[0] = s->packets[1] = 0; 1085 s->bytes[0] = s->bytes[1] = 0; 1086 } 1087 1088 int 1089 pf_setup_pfsync_matching(struct pf_ruleset *rs) 1090 { 1091 MD5_CTX ctx; 1092 struct pf_rule *rule; 1093 int rs_cnt; 1094 u_int8_t digest[PF_MD5_DIGEST_LENGTH]; 1095 1096 MD5Init(&ctx); 1097 for (rs_cnt = 0; rs_cnt < PF_RULESET_MAX; rs_cnt++) { 1098 /* XXX PF_RULESET_SCRUB as well? */ 1099 if (rs_cnt == PF_RULESET_SCRUB) 1100 continue; 1101 1102 if (rs->rules[rs_cnt].inactive.ptr_array) 1103 free(rs->rules[rs_cnt].inactive.ptr_array, M_TEMP); 1104 rs->rules[rs_cnt].inactive.ptr_array = NULL; 1105 1106 if (rs->rules[rs_cnt].inactive.rcount) { 1107 rs->rules[rs_cnt].inactive.ptr_array = 1108 malloc(sizeof(void *) * 1109 rs->rules[rs_cnt].inactive.rcount, 1110 M_TEMP, M_NOWAIT); 1111 1112 if (!rs->rules[rs_cnt].inactive.ptr_array) 1113 return (ENOMEM); 1114 } 1115 1116 TAILQ_FOREACH(rule, rs->rules[rs_cnt].inactive.ptr, 1117 entries) { 1118 pf_hash_rule(&ctx, rule); 1119 (rs->rules[rs_cnt].inactive.ptr_array)[rule->nr] = rule; 1120 } 1121 } 1122 1123 MD5Final(digest, &ctx); 1124 memcpy(pf_status.pf_chksum, digest, sizeof(pf_status.pf_chksum)); 1125 return (0); 1126 } 1127 1128 int 1129 pfioctl(dev_t dev, u_long cmd, void *addr, int flags, struct lwp *l) 1130 { 1131 struct pf_pooladdr *pa = NULL; 1132 struct pf_pool *pool = NULL; 1133 int s; 1134 int error = 0; 1135 1136 /* XXX keep in sync with switch() below */ 1137 if (kauth_authorize_network(l->l_cred, KAUTH_NETWORK_FIREWALL, 1138 KAUTH_REQ_NETWORK_FIREWALL_FW, NULL, NULL, NULL)) 1139 switch (cmd) { 1140 case DIOCGETRULES: 1141 case DIOCGETRULE: 1142 case DIOCGETADDRS: 1143 case DIOCGETADDR: 1144 case DIOCGETSTATE: 1145 case DIOCSETSTATUSIF: 1146 case DIOCGETSTATUS: 1147 case DIOCCLRSTATUS: 1148 case DIOCNATLOOK: 1149 case DIOCSETDEBUG: 1150 case DIOCGETSTATES: 1151 case DIOCGETTIMEOUT: 1152 case DIOCCLRRULECTRS: 1153 case DIOCGETLIMIT: 1154 case DIOCGETALTQS: 1155 case DIOCGETALTQ: 1156 case DIOCGETQSTATS: 1157 case DIOCGETRULESETS: 1158 case DIOCGETRULESET: 1159 case DIOCRGETTABLES: 1160 case DIOCRGETTSTATS: 1161 case DIOCRCLRTSTATS: 1162 case DIOCRCLRADDRS: 1163 case DIOCRADDADDRS: 1164 case DIOCRDELADDRS: 1165 case DIOCRSETADDRS: 1166 case DIOCRGETADDRS: 1167 case DIOCRGETASTATS: 1168 case DIOCRCLRASTATS: 1169 case DIOCRTSTADDRS: 1170 case DIOCOSFPGET: 1171 case DIOCGETSRCNODES: 1172 case DIOCCLRSRCNODES: 1173 case DIOCIGETIFACES: 1174 case DIOCSETIFFLAG: 1175 case DIOCCLRIFFLAG: 1176 break; 1177 case DIOCRCLRTABLES: 1178 case DIOCRADDTABLES: 1179 case DIOCRDELTABLES: 1180 case DIOCRSETTFLAGS: 1181 if (((struct pfioc_table *)addr)->pfrio_flags & 1182 PFR_FLAG_DUMMY) 1183 break; /* dummy operation ok */ 1184 return (EPERM); 1185 default: 1186 return (EPERM); 1187 } 1188 1189 if (!(flags & FWRITE)) 1190 switch (cmd) { 1191 case DIOCGETRULES: 1192 case DIOCGETADDRS: 1193 case DIOCGETADDR: 1194 case DIOCGETSTATE: 1195 case DIOCGETSTATUS: 1196 case DIOCGETSTATES: 1197 case DIOCGETTIMEOUT: 1198 case DIOCGETLIMIT: 1199 case DIOCGETALTQS: 1200 case DIOCGETALTQ: 1201 case DIOCGETQSTATS: 1202 case DIOCGETRULESETS: 1203 case DIOCGETRULESET: 1204 case DIOCNATLOOK: 1205 case DIOCRGETTABLES: 1206 case DIOCRGETTSTATS: 1207 case DIOCRGETADDRS: 1208 case DIOCRGETASTATS: 1209 case DIOCRTSTADDRS: 1210 case DIOCOSFPGET: 1211 case DIOCGETSRCNODES: 1212 case DIOCIGETIFACES: 1213 break; 1214 case DIOCRCLRTABLES: 1215 case DIOCRADDTABLES: 1216 case DIOCRDELTABLES: 1217 case DIOCRCLRTSTATS: 1218 case DIOCRCLRADDRS: 1219 case DIOCRADDADDRS: 1220 case DIOCRDELADDRS: 1221 case DIOCRSETADDRS: 1222 case DIOCRSETTFLAGS: 1223 if (((struct pfioc_table *)addr)->pfrio_flags & 1224 PFR_FLAG_DUMMY) { 1225 flags |= FWRITE; /* need write lock for dummy */ 1226 break; /* dummy operation ok */ 1227 } 1228 return (EACCES); 1229 case DIOCGETRULE: 1230 if (((struct pfioc_rule *)addr)->action == PF_GET_CLR_CNTR) 1231 return (EACCES); 1232 break; 1233 default: 1234 return (EACCES); 1235 } 1236 1237 if (flags & FWRITE) 1238 rw_enter_write(&pf_consistency_lock); 1239 else 1240 rw_enter_read(&pf_consistency_lock); 1241 1242 s = splsoftnet(); 1243 switch (cmd) { 1244 1245 case DIOCSTART: 1246 if (pf_status.running) 1247 error = EEXIST; 1248 else { 1249 #ifdef __NetBSD__ 1250 error = pf_pfil_attach(); 1251 if (error) 1252 break; 1253 #endif /* __NetBSD__ */ 1254 pf_status.running = 1; 1255 pf_status.since = time_second; 1256 if (pf_status.stateid == 0) { 1257 pf_status.stateid = time_second; 1258 pf_status.stateid = pf_status.stateid << 32; 1259 } 1260 DPFPRINTF(PF_DEBUG_MISC, ("pf: started\n")); 1261 } 1262 break; 1263 1264 case DIOCSTOP: 1265 if (!pf_status.running) 1266 error = ENOENT; 1267 else { 1268 #ifdef __NetBSD__ 1269 error = pf_pfil_detach(); 1270 if (error) 1271 break; 1272 #endif /* __NetBSD__ */ 1273 pf_status.running = 0; 1274 pf_status.since = time_second; 1275 DPFPRINTF(PF_DEBUG_MISC, ("pf: stopped\n")); 1276 } 1277 break; 1278 1279 case DIOCADDRULE: { 1280 struct pfioc_rule *pr = (struct pfioc_rule *)addr; 1281 struct pf_ruleset *ruleset; 1282 struct pf_rule *rule, *tail; 1283 struct pf_pooladdr *pa; 1284 int rs_num; 1285 1286 pr->anchor[sizeof(pr->anchor) - 1] = 0; 1287 ruleset = pf_find_ruleset(pr->anchor); 1288 if (ruleset == NULL) { 1289 error = EINVAL; 1290 break; 1291 } 1292 rs_num = pf_get_ruleset_number(pr->rule.action); 1293 if (rs_num >= PF_RULESET_MAX) { 1294 error = EINVAL; 1295 break; 1296 } 1297 if (pr->rule.return_icmp >> 8 > ICMP_MAXTYPE) { 1298 error = EINVAL; 1299 break; 1300 } 1301 if (pr->ticket != ruleset->rules[rs_num].inactive.ticket) { 1302 error = EBUSY; 1303 break; 1304 } 1305 if (pr->pool_ticket != ticket_pabuf) { 1306 error = EBUSY; 1307 break; 1308 } 1309 rule = pool_get(&pf_rule_pl, PR_NOWAIT); 1310 if (rule == NULL) { 1311 error = ENOMEM; 1312 break; 1313 } 1314 bcopy(&pr->rule, rule, sizeof(struct pf_rule)); 1315 #ifdef __NetBSD__ 1316 rule->cuid = kauth_cred_getuid(l->l_cred); 1317 rule->cpid = l->l_proc->p_pid; 1318 #else 1319 rule->cuid = p->p_cred->p_ruid; 1320 rule->cpid = p->p_pid; 1321 #endif /* !__NetBSD__ */ 1322 rule->anchor = NULL; 1323 rule->kif = NULL; 1324 TAILQ_INIT(&rule->rpool.list); 1325 /* initialize refcounting */ 1326 rule->states = 0; 1327 rule->src_nodes = 0; 1328 rule->entries.tqe_prev = NULL; 1329 #ifndef INET 1330 if (rule->af == AF_INET) { 1331 pool_put(&pf_rule_pl, rule); 1332 error = EAFNOSUPPORT; 1333 break; 1334 } 1335 #endif /* INET */ 1336 #ifndef INET6 1337 if (rule->af == AF_INET6) { 1338 pool_put(&pf_rule_pl, rule); 1339 error = EAFNOSUPPORT; 1340 break; 1341 } 1342 #endif /* INET6 */ 1343 tail = TAILQ_LAST(ruleset->rules[rs_num].inactive.ptr, 1344 pf_rulequeue); 1345 if (tail) 1346 rule->nr = tail->nr + 1; 1347 else 1348 rule->nr = 0; 1349 if (rule->ifname[0]) { 1350 rule->kif = pfi_kif_get(rule->ifname); 1351 if (rule->kif == NULL) { 1352 pool_put(&pf_rule_pl, rule); 1353 error = EINVAL; 1354 break; 1355 } 1356 pfi_kif_ref(rule->kif, PFI_KIF_REF_RULE); 1357 } 1358 1359 #ifndef __NetBSD__ 1360 if (rule->rtableid > 0 && !rtable_exists(rule->rtableid)) 1361 error = EBUSY; 1362 #endif /* !__NetBSD__ */ 1363 1364 #ifdef ALTQ 1365 /* set queue IDs */ 1366 if (rule->qname[0] != 0) { 1367 if ((rule->qid = pf_qname2qid(rule->qname)) == 0) 1368 error = EBUSY; 1369 else if (rule->pqname[0] != 0) { 1370 if ((rule->pqid = 1371 pf_qname2qid(rule->pqname)) == 0) 1372 error = EBUSY; 1373 } else 1374 rule->pqid = rule->qid; 1375 } 1376 #endif 1377 if (rule->tagname[0]) 1378 if ((rule->tag = pf_tagname2tag(rule->tagname)) == 0) 1379 error = EBUSY; 1380 if (rule->match_tagname[0]) 1381 if ((rule->match_tag = 1382 pf_tagname2tag(rule->match_tagname)) == 0) 1383 error = EBUSY; 1384 if (rule->rt && !rule->direction) 1385 error = EINVAL; 1386 #if NPFLOG > 0 1387 if (!rule->log) 1388 rule->logif = 0; 1389 if (rule->logif >= PFLOGIFS_MAX) 1390 error = EINVAL; 1391 #endif 1392 if (pf_rtlabel_add(&rule->src.addr) || 1393 pf_rtlabel_add(&rule->dst.addr)) 1394 error = EBUSY; 1395 if (pfi_dynaddr_setup(&rule->src.addr, rule->af)) 1396 error = EINVAL; 1397 if (pfi_dynaddr_setup(&rule->dst.addr, rule->af)) 1398 error = EINVAL; 1399 if (pf_tbladdr_setup(ruleset, &rule->src.addr)) 1400 error = EINVAL; 1401 if (pf_tbladdr_setup(ruleset, &rule->dst.addr)) 1402 error = EINVAL; 1403 if (pf_anchor_setup(rule, ruleset, pr->anchor_call)) 1404 error = EINVAL; 1405 TAILQ_FOREACH(pa, &pf_pabuf, entries) 1406 if (pf_tbladdr_setup(ruleset, &pa->addr)) 1407 error = EINVAL; 1408 1409 if (rule->overload_tblname[0]) { 1410 if ((rule->overload_tbl = pfr_attach_table(ruleset, 1411 rule->overload_tblname)) == NULL) 1412 error = EINVAL; 1413 else 1414 rule->overload_tbl->pfrkt_flags |= 1415 PFR_TFLAG_ACTIVE; 1416 } 1417 1418 pf_mv_pool(&pf_pabuf, &rule->rpool.list); 1419 if (((((rule->action == PF_NAT) || (rule->action == PF_RDR) || 1420 (rule->action == PF_BINAT)) && rule->anchor == NULL) || 1421 (rule->rt > PF_FASTROUTE)) && 1422 (TAILQ_FIRST(&rule->rpool.list) == NULL)) 1423 error = EINVAL; 1424 1425 if (error) { 1426 pf_rm_rule(NULL, rule); 1427 break; 1428 } 1429 rule->rpool.cur = TAILQ_FIRST(&rule->rpool.list); 1430 rule->evaluations = rule->packets[0] = rule->packets[1] = 1431 rule->bytes[0] = rule->bytes[1] = 0; 1432 TAILQ_INSERT_TAIL(ruleset->rules[rs_num].inactive.ptr, 1433 rule, entries); 1434 ruleset->rules[rs_num].inactive.rcount++; 1435 break; 1436 } 1437 1438 case DIOCGETRULES: { 1439 struct pfioc_rule *pr = (struct pfioc_rule *)addr; 1440 struct pf_ruleset *ruleset; 1441 struct pf_rule *tail; 1442 int rs_num; 1443 1444 pr->anchor[sizeof(pr->anchor) - 1] = 0; 1445 ruleset = pf_find_ruleset(pr->anchor); 1446 if (ruleset == NULL) { 1447 error = EINVAL; 1448 break; 1449 } 1450 rs_num = pf_get_ruleset_number(pr->rule.action); 1451 if (rs_num >= PF_RULESET_MAX) { 1452 error = EINVAL; 1453 break; 1454 } 1455 tail = TAILQ_LAST(ruleset->rules[rs_num].active.ptr, 1456 pf_rulequeue); 1457 if (tail) 1458 pr->nr = tail->nr + 1; 1459 else 1460 pr->nr = 0; 1461 pr->ticket = ruleset->rules[rs_num].active.ticket; 1462 break; 1463 } 1464 1465 case DIOCGETRULE: { 1466 struct pfioc_rule *pr = (struct pfioc_rule *)addr; 1467 struct pf_ruleset *ruleset; 1468 struct pf_rule *rule; 1469 int rs_num, i; 1470 1471 pr->anchor[sizeof(pr->anchor) - 1] = 0; 1472 ruleset = pf_find_ruleset(pr->anchor); 1473 if (ruleset == NULL) { 1474 error = EINVAL; 1475 break; 1476 } 1477 rs_num = pf_get_ruleset_number(pr->rule.action); 1478 if (rs_num >= PF_RULESET_MAX) { 1479 error = EINVAL; 1480 break; 1481 } 1482 if (pr->ticket != ruleset->rules[rs_num].active.ticket) { 1483 error = EBUSY; 1484 break; 1485 } 1486 rule = TAILQ_FIRST(ruleset->rules[rs_num].active.ptr); 1487 while ((rule != NULL) && (rule->nr != pr->nr)) 1488 rule = TAILQ_NEXT(rule, entries); 1489 if (rule == NULL) { 1490 error = EBUSY; 1491 break; 1492 } 1493 bcopy(rule, &pr->rule, sizeof(struct pf_rule)); 1494 if (pf_anchor_copyout(ruleset, rule, pr)) { 1495 error = EBUSY; 1496 break; 1497 } 1498 pfi_dynaddr_copyout(&pr->rule.src.addr); 1499 pfi_dynaddr_copyout(&pr->rule.dst.addr); 1500 pf_tbladdr_copyout(&pr->rule.src.addr); 1501 pf_tbladdr_copyout(&pr->rule.dst.addr); 1502 pf_rtlabel_copyout(&pr->rule.src.addr); 1503 pf_rtlabel_copyout(&pr->rule.dst.addr); 1504 for (i = 0; i < PF_SKIP_COUNT; ++i) 1505 if (rule->skip[i].ptr == NULL) 1506 pr->rule.skip[i].nr = -1; 1507 else 1508 pr->rule.skip[i].nr = 1509 rule->skip[i].ptr->nr; 1510 1511 if (pr->action == PF_GET_CLR_CNTR) { 1512 rule->evaluations = 0; 1513 rule->packets[0] = rule->packets[1] = 0; 1514 rule->bytes[0] = rule->bytes[1] = 0; 1515 } 1516 break; 1517 } 1518 1519 case DIOCCHANGERULE: { 1520 struct pfioc_rule *pcr = (struct pfioc_rule *)addr; 1521 struct pf_ruleset *ruleset; 1522 struct pf_rule *oldrule = NULL, *newrule = NULL; 1523 u_int32_t nr = 0; 1524 int rs_num; 1525 1526 if (!(pcr->action == PF_CHANGE_REMOVE || 1527 pcr->action == PF_CHANGE_GET_TICKET) && 1528 pcr->pool_ticket != ticket_pabuf) { 1529 error = EBUSY; 1530 break; 1531 } 1532 1533 if (pcr->action < PF_CHANGE_ADD_HEAD || 1534 pcr->action > PF_CHANGE_GET_TICKET) { 1535 error = EINVAL; 1536 break; 1537 } 1538 ruleset = pf_find_ruleset(pcr->anchor); 1539 if (ruleset == NULL) { 1540 error = EINVAL; 1541 break; 1542 } 1543 rs_num = pf_get_ruleset_number(pcr->rule.action); 1544 if (rs_num >= PF_RULESET_MAX) { 1545 error = EINVAL; 1546 break; 1547 } 1548 1549 if (pcr->action == PF_CHANGE_GET_TICKET) { 1550 pcr->ticket = ++ruleset->rules[rs_num].active.ticket; 1551 break; 1552 } else { 1553 if (pcr->ticket != 1554 ruleset->rules[rs_num].active.ticket) { 1555 error = EINVAL; 1556 break; 1557 } 1558 if (pcr->rule.return_icmp >> 8 > ICMP_MAXTYPE) { 1559 error = EINVAL; 1560 break; 1561 } 1562 } 1563 1564 if (pcr->action != PF_CHANGE_REMOVE) { 1565 newrule = pool_get(&pf_rule_pl, PR_NOWAIT); 1566 if (newrule == NULL) { 1567 error = ENOMEM; 1568 break; 1569 } 1570 bcopy(&pcr->rule, newrule, sizeof(struct pf_rule)); 1571 #ifdef __NetBSD__ 1572 newrule->cuid = kauth_cred_getuid(l->l_cred); 1573 newrule->cpid = l->l_proc->p_pid; 1574 #else 1575 newrule->cuid = p->p_cred->p_ruid; 1576 newrule->cpid = p->p_pid; 1577 #endif /* !__NetBSD__ */ 1578 TAILQ_INIT(&newrule->rpool.list); 1579 /* initialize refcounting */ 1580 newrule->states = 0; 1581 newrule->entries.tqe_prev = NULL; 1582 #ifndef INET 1583 if (newrule->af == AF_INET) { 1584 pool_put(&pf_rule_pl, newrule); 1585 error = EAFNOSUPPORT; 1586 break; 1587 } 1588 #endif /* INET */ 1589 #ifndef INET6 1590 if (newrule->af == AF_INET6) { 1591 pool_put(&pf_rule_pl, newrule); 1592 error = EAFNOSUPPORT; 1593 break; 1594 } 1595 #endif /* INET6 */ 1596 if (newrule->ifname[0]) { 1597 newrule->kif = pfi_kif_get(newrule->ifname); 1598 if (newrule->kif == NULL) { 1599 pool_put(&pf_rule_pl, newrule); 1600 error = EINVAL; 1601 break; 1602 } 1603 pfi_kif_ref(newrule->kif, PFI_KIF_REF_RULE); 1604 } else 1605 newrule->kif = NULL; 1606 1607 #ifndef __NetBSD__ 1608 if (newrule->rtableid > 0 && 1609 !rtable_exists(newrule->rtableid)) 1610 error = EBUSY; 1611 #endif /* !__NetBSD__ */ 1612 1613 #ifdef ALTQ 1614 /* set queue IDs */ 1615 if (newrule->qname[0] != 0) { 1616 if ((newrule->qid = 1617 pf_qname2qid(newrule->qname)) == 0) 1618 error = EBUSY; 1619 else if (newrule->pqname[0] != 0) { 1620 if ((newrule->pqid = 1621 pf_qname2qid(newrule->pqname)) == 0) 1622 error = EBUSY; 1623 } else 1624 newrule->pqid = newrule->qid; 1625 } 1626 #endif /* ALTQ */ 1627 if (newrule->tagname[0]) 1628 if ((newrule->tag = 1629 pf_tagname2tag(newrule->tagname)) == 0) 1630 error = EBUSY; 1631 if (newrule->match_tagname[0]) 1632 if ((newrule->match_tag = pf_tagname2tag( 1633 newrule->match_tagname)) == 0) 1634 error = EBUSY; 1635 if (newrule->rt && !newrule->direction) 1636 error = EINVAL; 1637 #if NPFLOG > 0 1638 if (!newrule->log) 1639 newrule->logif = 0; 1640 if (newrule->logif >= PFLOGIFS_MAX) 1641 error = EINVAL; 1642 #endif 1643 if (pf_rtlabel_add(&newrule->src.addr) || 1644 pf_rtlabel_add(&newrule->dst.addr)) 1645 error = EBUSY; 1646 if (pfi_dynaddr_setup(&newrule->src.addr, newrule->af)) 1647 error = EINVAL; 1648 if (pfi_dynaddr_setup(&newrule->dst.addr, newrule->af)) 1649 error = EINVAL; 1650 if (pf_tbladdr_setup(ruleset, &newrule->src.addr)) 1651 error = EINVAL; 1652 if (pf_tbladdr_setup(ruleset, &newrule->dst.addr)) 1653 error = EINVAL; 1654 if (pf_anchor_setup(newrule, ruleset, pcr->anchor_call)) 1655 error = EINVAL; 1656 TAILQ_FOREACH(pa, &pf_pabuf, entries) 1657 if (pf_tbladdr_setup(ruleset, &pa->addr)) 1658 error = EINVAL; 1659 1660 if (newrule->overload_tblname[0]) { 1661 if ((newrule->overload_tbl = pfr_attach_table( 1662 ruleset, newrule->overload_tblname)) == 1663 NULL) 1664 error = EINVAL; 1665 else 1666 newrule->overload_tbl->pfrkt_flags |= 1667 PFR_TFLAG_ACTIVE; 1668 } 1669 1670 pf_mv_pool(&pf_pabuf, &newrule->rpool.list); 1671 if (((((newrule->action == PF_NAT) || 1672 (newrule->action == PF_RDR) || 1673 (newrule->action == PF_BINAT) || 1674 (newrule->rt > PF_FASTROUTE)) && 1675 !newrule->anchor)) && 1676 (TAILQ_FIRST(&newrule->rpool.list) == NULL)) 1677 error = EINVAL; 1678 1679 if (error) { 1680 pf_rm_rule(NULL, newrule); 1681 break; 1682 } 1683 newrule->rpool.cur = TAILQ_FIRST(&newrule->rpool.list); 1684 newrule->evaluations = 0; 1685 newrule->packets[0] = newrule->packets[1] = 0; 1686 newrule->bytes[0] = newrule->bytes[1] = 0; 1687 } 1688 pf_empty_pool(&pf_pabuf); 1689 1690 if (pcr->action == PF_CHANGE_ADD_HEAD) 1691 oldrule = TAILQ_FIRST( 1692 ruleset->rules[rs_num].active.ptr); 1693 else if (pcr->action == PF_CHANGE_ADD_TAIL) 1694 oldrule = TAILQ_LAST( 1695 ruleset->rules[rs_num].active.ptr, pf_rulequeue); 1696 else { 1697 oldrule = TAILQ_FIRST( 1698 ruleset->rules[rs_num].active.ptr); 1699 while ((oldrule != NULL) && (oldrule->nr != pcr->nr)) 1700 oldrule = TAILQ_NEXT(oldrule, entries); 1701 if (oldrule == NULL) { 1702 if (newrule != NULL) 1703 pf_rm_rule(NULL, newrule); 1704 error = EINVAL; 1705 break; 1706 } 1707 } 1708 1709 if (pcr->action == PF_CHANGE_REMOVE) { 1710 pf_rm_rule(ruleset->rules[rs_num].active.ptr, oldrule); 1711 ruleset->rules[rs_num].active.rcount--; 1712 } else { 1713 if (oldrule == NULL) 1714 TAILQ_INSERT_TAIL( 1715 ruleset->rules[rs_num].active.ptr, 1716 newrule, entries); 1717 else if (pcr->action == PF_CHANGE_ADD_HEAD || 1718 pcr->action == PF_CHANGE_ADD_BEFORE) 1719 TAILQ_INSERT_BEFORE(oldrule, newrule, entries); 1720 else 1721 TAILQ_INSERT_AFTER( 1722 ruleset->rules[rs_num].active.ptr, 1723 oldrule, newrule, entries); 1724 ruleset->rules[rs_num].active.rcount++; 1725 } 1726 1727 nr = 0; 1728 TAILQ_FOREACH(oldrule, 1729 ruleset->rules[rs_num].active.ptr, entries) 1730 oldrule->nr = nr++; 1731 1732 ruleset->rules[rs_num].active.ticket++; 1733 1734 pf_calc_skip_steps(ruleset->rules[rs_num].active.ptr); 1735 pf_remove_if_empty_ruleset(ruleset); 1736 1737 break; 1738 } 1739 1740 case DIOCCLRSTATES: { 1741 struct pf_state *s, *nexts; 1742 struct pfioc_state_kill *psk = (struct pfioc_state_kill *)addr; 1743 int killed = 0; 1744 1745 for (s = RB_MIN(pf_state_tree_id, &tree_id); s; s = nexts) { 1746 nexts = RB_NEXT(pf_state_tree_id, &tree_id, s); 1747 1748 if (!psk->psk_ifname[0] || !strcmp(psk->psk_ifname, 1749 s->kif->pfik_name)) { 1750 #if NPFSYNC 1751 /* don't send out individual delete messages */ 1752 s->sync_flags = PFSTATE_NOSYNC; 1753 #endif 1754 pf_unlink_state(s); 1755 killed++; 1756 } 1757 } 1758 psk->psk_af = killed; 1759 #if NPFSYNC 1760 pfsync_clear_states(pf_status.hostid, psk->psk_ifname); 1761 #endif 1762 break; 1763 } 1764 1765 case DIOCKILLSTATES: { 1766 struct pf_state *s, *nexts; 1767 struct pf_state_key *sk; 1768 struct pf_state_host *src, *dst; 1769 struct pfioc_state_kill *psk = (struct pfioc_state_kill *)addr; 1770 int killed = 0; 1771 1772 for (s = RB_MIN(pf_state_tree_id, &tree_id); s; 1773 s = nexts) { 1774 nexts = RB_NEXT(pf_state_tree_id, &tree_id, s); 1775 sk = s->state_key; 1776 1777 if (sk->direction == PF_OUT) { 1778 src = &sk->lan; 1779 dst = &sk->ext; 1780 } else { 1781 src = &sk->ext; 1782 dst = &sk->lan; 1783 } 1784 if ((!psk->psk_af || sk->af == psk->psk_af) 1785 && (!psk->psk_proto || psk->psk_proto == 1786 sk->proto) && 1787 PF_MATCHA(psk->psk_src.neg, 1788 &psk->psk_src.addr.v.a.addr, 1789 &psk->psk_src.addr.v.a.mask, 1790 &src->addr, sk->af) && 1791 PF_MATCHA(psk->psk_dst.neg, 1792 &psk->psk_dst.addr.v.a.addr, 1793 &psk->psk_dst.addr.v.a.mask, 1794 &dst->addr, sk->af) && 1795 (psk->psk_src.port_op == 0 || 1796 pf_match_port(psk->psk_src.port_op, 1797 psk->psk_src.port[0], psk->psk_src.port[1], 1798 src->port)) && 1799 (psk->psk_dst.port_op == 0 || 1800 pf_match_port(psk->psk_dst.port_op, 1801 psk->psk_dst.port[0], psk->psk_dst.port[1], 1802 dst->port)) && 1803 (!psk->psk_ifname[0] || !strcmp(psk->psk_ifname, 1804 s->kif->pfik_name))) { 1805 #if NPFSYNC > 0 1806 /* send immediate delete of state */ 1807 pfsync_delete_state(s); 1808 s->sync_flags |= PFSTATE_NOSYNC; 1809 #endif 1810 pf_unlink_state(s); 1811 killed++; 1812 } 1813 } 1814 psk->psk_af = killed; 1815 break; 1816 } 1817 1818 case DIOCADDSTATE: { 1819 struct pfioc_state *ps = (struct pfioc_state *)addr; 1820 struct pfsync_state *sp = (struct pfsync_state *)ps->state; 1821 struct pf_state *s; 1822 struct pf_state_key *sk; 1823 struct pfi_kif *kif; 1824 1825 if (sp->timeout >= PFTM_MAX && 1826 sp->timeout != PFTM_UNTIL_PACKET) { 1827 error = EINVAL; 1828 break; 1829 } 1830 s = pool_get(&pf_state_pl, PR_NOWAIT); 1831 if (s == NULL) { 1832 error = ENOMEM; 1833 break; 1834 } 1835 bzero(s, sizeof(struct pf_state)); 1836 if ((sk = pf_alloc_state_key(s)) == NULL) { 1837 error = ENOMEM; 1838 break; 1839 } 1840 pf_state_import(sp, sk, s); 1841 kif = pfi_kif_get(sp->ifname); 1842 if (kif == NULL) { 1843 pool_put(&pf_state_pl, s); 1844 pool_put(&pf_state_key_pl, sk); 1845 error = ENOENT; 1846 break; 1847 } 1848 if (pf_insert_state(kif, s)) { 1849 pfi_kif_unref(kif, PFI_KIF_REF_NONE); 1850 pool_put(&pf_state_pl, s); 1851 pool_put(&pf_state_key_pl, sk); 1852 error = ENOMEM; 1853 } 1854 break; 1855 } 1856 1857 case DIOCGETSTATE: { 1858 struct pfioc_state *ps = (struct pfioc_state *)addr; 1859 struct pf_state *s; 1860 u_int32_t nr; 1861 1862 nr = 0; 1863 RB_FOREACH(s, pf_state_tree_id, &tree_id) { 1864 if (nr >= ps->nr) 1865 break; 1866 nr++; 1867 } 1868 if (s == NULL) { 1869 error = EBUSY; 1870 break; 1871 } 1872 1873 pf_state_export((struct pfsync_state *)&ps->state, 1874 s->state_key, s); 1875 break; 1876 } 1877 1878 case DIOCGETSTATES: { 1879 struct pfioc_states *ps = (struct pfioc_states *)addr; 1880 struct pf_state *state; 1881 struct pfsync_state *p, *pstore; 1882 u_int32_t nr = 0; 1883 1884 if (ps->ps_len == 0) { 1885 nr = pf_status.states; 1886 ps->ps_len = sizeof(struct pfsync_state) * nr; 1887 break; 1888 } 1889 1890 pstore = malloc(sizeof(*pstore), M_TEMP, M_WAITOK); 1891 1892 p = ps->ps_states; 1893 1894 state = TAILQ_FIRST(&state_list); 1895 while (state) { 1896 if (state->timeout != PFTM_UNLINKED) { 1897 if ((nr+1) * sizeof(*p) > (unsigned)ps->ps_len) 1898 break; 1899 1900 pf_state_export(pstore, 1901 state->state_key, state); 1902 error = copyout(pstore, p, sizeof(*p)); 1903 if (error) { 1904 free(pstore, M_TEMP); 1905 goto fail; 1906 } 1907 p++; 1908 nr++; 1909 } 1910 state = TAILQ_NEXT(state, entry_list); 1911 } 1912 1913 ps->ps_len = sizeof(struct pfsync_state) * nr; 1914 1915 free(pstore, M_TEMP); 1916 break; 1917 } 1918 1919 case DIOCGETSTATUS: { 1920 struct pf_status *s = (struct pf_status *)addr; 1921 bcopy(&pf_status, s, sizeof(struct pf_status)); 1922 pfi_fill_oldstatus(s); 1923 break; 1924 } 1925 1926 case DIOCSETSTATUSIF: { 1927 struct pfioc_if *pi = (struct pfioc_if *)addr; 1928 1929 if (pi->ifname[0] == 0) { 1930 bzero(pf_status.ifname, IFNAMSIZ); 1931 break; 1932 } 1933 if (ifunit(pi->ifname) == NULL) { 1934 error = EINVAL; 1935 break; 1936 } 1937 strlcpy(pf_status.ifname, pi->ifname, IFNAMSIZ); 1938 break; 1939 } 1940 1941 case DIOCCLRSTATUS: { 1942 bzero(pf_status.counters, sizeof(pf_status.counters)); 1943 bzero(pf_status.fcounters, sizeof(pf_status.fcounters)); 1944 bzero(pf_status.scounters, sizeof(pf_status.scounters)); 1945 pf_status.since = time_second; 1946 if (*pf_status.ifname) 1947 pfi_clr_istats(pf_status.ifname); 1948 break; 1949 } 1950 1951 case DIOCNATLOOK: { 1952 struct pfioc_natlook *pnl = (struct pfioc_natlook *)addr; 1953 struct pf_state_key *sk; 1954 struct pf_state *state; 1955 struct pf_state_key_cmp key; 1956 int m = 0, direction = pnl->direction; 1957 1958 key.af = pnl->af; 1959 key.proto = pnl->proto; 1960 1961 if (!pnl->proto || 1962 PF_AZERO(&pnl->saddr, pnl->af) || 1963 PF_AZERO(&pnl->daddr, pnl->af) || 1964 ((pnl->proto == IPPROTO_TCP || 1965 pnl->proto == IPPROTO_UDP) && 1966 (!pnl->dport || !pnl->sport))) 1967 error = EINVAL; 1968 else { 1969 /* 1970 * userland gives us source and dest of connection, 1971 * reverse the lookup so we ask for what happens with 1972 * the return traffic, enabling us to find it in the 1973 * state tree. 1974 */ 1975 if (direction == PF_IN) { 1976 PF_ACPY(&key.ext.addr, &pnl->daddr, pnl->af); 1977 key.ext.port = pnl->dport; 1978 PF_ACPY(&key.gwy.addr, &pnl->saddr, pnl->af); 1979 key.gwy.port = pnl->sport; 1980 state = pf_find_state_all(&key, PF_EXT_GWY, &m); 1981 } else { 1982 PF_ACPY(&key.lan.addr, &pnl->daddr, pnl->af); 1983 key.lan.port = pnl->dport; 1984 PF_ACPY(&key.ext.addr, &pnl->saddr, pnl->af); 1985 key.ext.port = pnl->sport; 1986 state = pf_find_state_all(&key, PF_LAN_EXT, &m); 1987 } 1988 if (m > 1) 1989 error = E2BIG; /* more than one state */ 1990 else if (state != NULL) { 1991 sk = state->state_key; 1992 if (direction == PF_IN) { 1993 PF_ACPY(&pnl->rsaddr, &sk->lan.addr, 1994 sk->af); 1995 pnl->rsport = sk->lan.port; 1996 PF_ACPY(&pnl->rdaddr, &pnl->daddr, 1997 pnl->af); 1998 pnl->rdport = pnl->dport; 1999 } else { 2000 PF_ACPY(&pnl->rdaddr, &sk->gwy.addr, 2001 sk->af); 2002 pnl->rdport = sk->gwy.port; 2003 PF_ACPY(&pnl->rsaddr, &pnl->saddr, 2004 pnl->af); 2005 pnl->rsport = pnl->sport; 2006 } 2007 } else 2008 error = ENOENT; 2009 } 2010 break; 2011 } 2012 2013 case DIOCSETTIMEOUT: { 2014 struct pfioc_tm *pt = (struct pfioc_tm *)addr; 2015 int old; 2016 2017 if (pt->timeout < 0 || pt->timeout >= PFTM_MAX || 2018 pt->seconds < 0) { 2019 error = EINVAL; 2020 goto fail; 2021 } 2022 old = pf_default_rule.timeout[pt->timeout]; 2023 if (pt->timeout == PFTM_INTERVAL && pt->seconds == 0) 2024 pt->seconds = 1; 2025 pf_default_rule.timeout[pt->timeout] = pt->seconds; 2026 if (pt->timeout == PFTM_INTERVAL && pt->seconds < old) 2027 wakeup(pf_purge_thread); 2028 pt->seconds = old; 2029 break; 2030 } 2031 2032 case DIOCGETTIMEOUT: { 2033 struct pfioc_tm *pt = (struct pfioc_tm *)addr; 2034 2035 if (pt->timeout < 0 || pt->timeout >= PFTM_MAX) { 2036 error = EINVAL; 2037 goto fail; 2038 } 2039 pt->seconds = pf_default_rule.timeout[pt->timeout]; 2040 break; 2041 } 2042 2043 case DIOCGETLIMIT: { 2044 struct pfioc_limit *pl = (struct pfioc_limit *)addr; 2045 2046 if (pl->index < 0 || pl->index >= PF_LIMIT_MAX) { 2047 error = EINVAL; 2048 goto fail; 2049 } 2050 pl->limit = pf_pool_limits[pl->index].limit; 2051 break; 2052 } 2053 2054 case DIOCSETLIMIT: { 2055 struct pfioc_limit *pl = (struct pfioc_limit *)addr; 2056 int old_limit; 2057 2058 if (pl->index < 0 || pl->index >= PF_LIMIT_MAX || 2059 pf_pool_limits[pl->index].pp == NULL) { 2060 error = EINVAL; 2061 goto fail; 2062 } 2063 #ifdef __NetBSD__ 2064 pool_sethardlimit(pf_pool_limits[pl->index].pp, 2065 pl->limit, NULL, 0); 2066 #else 2067 if (pool_sethardlimit(pf_pool_limits[pl->index].pp, 2068 pl->limit, NULL, 0) != 0) { 2069 error = EBUSY; 2070 goto fail; 2071 } 2072 #endif /* !__NetBSD__ */ 2073 old_limit = pf_pool_limits[pl->index].limit; 2074 pf_pool_limits[pl->index].limit = pl->limit; 2075 pl->limit = old_limit; 2076 break; 2077 } 2078 2079 case DIOCSETDEBUG: { 2080 u_int32_t *level = (u_int32_t *)addr; 2081 2082 pf_status.debug = *level; 2083 break; 2084 } 2085 2086 case DIOCCLRRULECTRS: { 2087 /* obsoleted by DIOCGETRULE with action=PF_GET_CLR_CNTR */ 2088 struct pf_ruleset *ruleset = &pf_main_ruleset; 2089 struct pf_rule *rule; 2090 2091 TAILQ_FOREACH(rule, 2092 ruleset->rules[PF_RULESET_FILTER].active.ptr, entries) { 2093 rule->evaluations = 0; 2094 rule->packets[0] = rule->packets[1] = 0; 2095 rule->bytes[0] = rule->bytes[1] = 0; 2096 } 2097 break; 2098 } 2099 2100 #ifdef ALTQ 2101 case DIOCSTARTALTQ: { 2102 struct pf_altq *altq; 2103 2104 /* enable all altq interfaces on active list */ 2105 TAILQ_FOREACH(altq, pf_altqs_active, entries) { 2106 if (altq->qname[0] == 0) { 2107 error = pf_enable_altq(altq); 2108 if (error != 0) 2109 break; 2110 } 2111 } 2112 if (error == 0) 2113 pf_altq_running = 1; 2114 DPFPRINTF(PF_DEBUG_MISC, ("altq: started\n")); 2115 break; 2116 } 2117 2118 case DIOCSTOPALTQ: { 2119 struct pf_altq *altq; 2120 2121 /* disable all altq interfaces on active list */ 2122 TAILQ_FOREACH(altq, pf_altqs_active, entries) { 2123 if (altq->qname[0] == 0) { 2124 error = pf_disable_altq(altq); 2125 if (error != 0) 2126 break; 2127 } 2128 } 2129 if (error == 0) 2130 pf_altq_running = 0; 2131 DPFPRINTF(PF_DEBUG_MISC, ("altq: stopped\n")); 2132 break; 2133 } 2134 2135 case DIOCADDALTQ: { 2136 struct pfioc_altq *pa = (struct pfioc_altq *)addr; 2137 struct pf_altq *altq, *a; 2138 2139 if (pa->ticket != ticket_altqs_inactive) { 2140 error = EBUSY; 2141 break; 2142 } 2143 altq = pool_get(&pf_altq_pl, PR_NOWAIT); 2144 if (altq == NULL) { 2145 error = ENOMEM; 2146 break; 2147 } 2148 bcopy(&pa->altq, altq, sizeof(struct pf_altq)); 2149 2150 /* 2151 * if this is for a queue, find the discipline and 2152 * copy the necessary fields 2153 */ 2154 if (altq->qname[0] != 0) { 2155 if ((altq->qid = pf_qname2qid(altq->qname)) == 0) { 2156 error = EBUSY; 2157 pool_put(&pf_altq_pl, altq); 2158 break; 2159 } 2160 TAILQ_FOREACH(a, pf_altqs_inactive, entries) { 2161 if (strncmp(a->ifname, altq->ifname, 2162 IFNAMSIZ) == 0 && a->qname[0] == 0) { 2163 altq->altq_disc = a->altq_disc; 2164 break; 2165 } 2166 } 2167 } 2168 2169 error = altq_add(altq); 2170 if (error) { 2171 pool_put(&pf_altq_pl, altq); 2172 break; 2173 } 2174 2175 TAILQ_INSERT_TAIL(pf_altqs_inactive, altq, entries); 2176 bcopy(altq, &pa->altq, sizeof(struct pf_altq)); 2177 break; 2178 } 2179 2180 case DIOCGETALTQS: { 2181 struct pfioc_altq *pa = (struct pfioc_altq *)addr; 2182 struct pf_altq *altq; 2183 2184 pa->nr = 0; 2185 TAILQ_FOREACH(altq, pf_altqs_active, entries) 2186 pa->nr++; 2187 pa->ticket = ticket_altqs_active; 2188 break; 2189 } 2190 2191 case DIOCGETALTQ: { 2192 struct pfioc_altq *pa = (struct pfioc_altq *)addr; 2193 struct pf_altq *altq; 2194 u_int32_t nr; 2195 2196 if (pa->ticket != ticket_altqs_active) { 2197 error = EBUSY; 2198 break; 2199 } 2200 nr = 0; 2201 altq = TAILQ_FIRST(pf_altqs_active); 2202 while ((altq != NULL) && (nr < pa->nr)) { 2203 altq = TAILQ_NEXT(altq, entries); 2204 nr++; 2205 } 2206 if (altq == NULL) { 2207 error = EBUSY; 2208 break; 2209 } 2210 bcopy(altq, &pa->altq, sizeof(struct pf_altq)); 2211 break; 2212 } 2213 2214 case DIOCCHANGEALTQ: 2215 /* CHANGEALTQ not supported yet! */ 2216 error = ENODEV; 2217 break; 2218 2219 case DIOCGETQSTATS: { 2220 struct pfioc_qstats *pq = (struct pfioc_qstats *)addr; 2221 struct pf_altq *altq; 2222 u_int32_t nr; 2223 int nbytes; 2224 2225 if (pq->ticket != ticket_altqs_active) { 2226 error = EBUSY; 2227 break; 2228 } 2229 nbytes = pq->nbytes; 2230 nr = 0; 2231 altq = TAILQ_FIRST(pf_altqs_active); 2232 while ((altq != NULL) && (nr < pq->nr)) { 2233 altq = TAILQ_NEXT(altq, entries); 2234 nr++; 2235 } 2236 if (altq == NULL) { 2237 error = EBUSY; 2238 break; 2239 } 2240 error = altq_getqstats(altq, pq->buf, &nbytes); 2241 if (error == 0) { 2242 pq->scheduler = altq->scheduler; 2243 pq->nbytes = nbytes; 2244 } 2245 break; 2246 } 2247 #endif /* ALTQ */ 2248 2249 case DIOCBEGINADDRS: { 2250 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr; 2251 2252 pf_empty_pool(&pf_pabuf); 2253 pp->ticket = ++ticket_pabuf; 2254 break; 2255 } 2256 2257 case DIOCADDADDR: { 2258 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr; 2259 2260 if (pp->ticket != ticket_pabuf) { 2261 error = EBUSY; 2262 break; 2263 } 2264 #ifndef INET 2265 if (pp->af == AF_INET) { 2266 error = EAFNOSUPPORT; 2267 break; 2268 } 2269 #endif /* INET */ 2270 #ifndef INET6 2271 if (pp->af == AF_INET6) { 2272 error = EAFNOSUPPORT; 2273 break; 2274 } 2275 #endif /* INET6 */ 2276 if (pp->addr.addr.type != PF_ADDR_ADDRMASK && 2277 pp->addr.addr.type != PF_ADDR_DYNIFTL && 2278 pp->addr.addr.type != PF_ADDR_TABLE) { 2279 error = EINVAL; 2280 break; 2281 } 2282 pa = pool_get(&pf_pooladdr_pl, PR_NOWAIT); 2283 if (pa == NULL) { 2284 error = ENOMEM; 2285 break; 2286 } 2287 bcopy(&pp->addr, pa, sizeof(struct pf_pooladdr)); 2288 if (pa->ifname[0]) { 2289 pa->kif = pfi_kif_get(pa->ifname); 2290 if (pa->kif == NULL) { 2291 pool_put(&pf_pooladdr_pl, pa); 2292 error = EINVAL; 2293 break; 2294 } 2295 pfi_kif_ref(pa->kif, PFI_KIF_REF_RULE); 2296 } 2297 if (pfi_dynaddr_setup(&pa->addr, pp->af)) { 2298 pfi_dynaddr_remove(&pa->addr); 2299 pfi_kif_unref(pa->kif, PFI_KIF_REF_RULE); 2300 pool_put(&pf_pooladdr_pl, pa); 2301 error = EINVAL; 2302 break; 2303 } 2304 TAILQ_INSERT_TAIL(&pf_pabuf, pa, entries); 2305 break; 2306 } 2307 2308 case DIOCGETADDRS: { 2309 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr; 2310 2311 pp->nr = 0; 2312 pool = pf_get_pool(pp->anchor, pp->ticket, pp->r_action, 2313 pp->r_num, 0, 1, 0); 2314 if (pool == NULL) { 2315 error = EBUSY; 2316 break; 2317 } 2318 TAILQ_FOREACH(pa, &pool->list, entries) 2319 pp->nr++; 2320 break; 2321 } 2322 2323 case DIOCGETADDR: { 2324 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr; 2325 u_int32_t nr = 0; 2326 2327 pool = pf_get_pool(pp->anchor, pp->ticket, pp->r_action, 2328 pp->r_num, 0, 1, 1); 2329 if (pool == NULL) { 2330 error = EBUSY; 2331 break; 2332 } 2333 pa = TAILQ_FIRST(&pool->list); 2334 while ((pa != NULL) && (nr < pp->nr)) { 2335 pa = TAILQ_NEXT(pa, entries); 2336 nr++; 2337 } 2338 if (pa == NULL) { 2339 error = EBUSY; 2340 break; 2341 } 2342 bcopy(pa, &pp->addr, sizeof(struct pf_pooladdr)); 2343 pfi_dynaddr_copyout(&pp->addr.addr); 2344 pf_tbladdr_copyout(&pp->addr.addr); 2345 pf_rtlabel_copyout(&pp->addr.addr); 2346 break; 2347 } 2348 2349 case DIOCCHANGEADDR: { 2350 struct pfioc_pooladdr *pca = (struct pfioc_pooladdr *)addr; 2351 struct pf_pooladdr *oldpa = NULL, *newpa = NULL; 2352 struct pf_ruleset *ruleset; 2353 2354 if (pca->action < PF_CHANGE_ADD_HEAD || 2355 pca->action > PF_CHANGE_REMOVE) { 2356 error = EINVAL; 2357 break; 2358 } 2359 if (pca->addr.addr.type != PF_ADDR_ADDRMASK && 2360 pca->addr.addr.type != PF_ADDR_DYNIFTL && 2361 pca->addr.addr.type != PF_ADDR_TABLE) { 2362 error = EINVAL; 2363 break; 2364 } 2365 2366 ruleset = pf_find_ruleset(pca->anchor); 2367 if (ruleset == NULL) { 2368 error = EBUSY; 2369 break; 2370 } 2371 pool = pf_get_pool(pca->anchor, pca->ticket, pca->r_action, 2372 pca->r_num, pca->r_last, 1, 1); 2373 if (pool == NULL) { 2374 error = EBUSY; 2375 break; 2376 } 2377 if (pca->action != PF_CHANGE_REMOVE) { 2378 newpa = pool_get(&pf_pooladdr_pl, PR_NOWAIT); 2379 if (newpa == NULL) { 2380 error = ENOMEM; 2381 break; 2382 } 2383 bcopy(&pca->addr, newpa, sizeof(struct pf_pooladdr)); 2384 #ifndef INET 2385 if (pca->af == AF_INET) { 2386 pool_put(&pf_pooladdr_pl, newpa); 2387 error = EAFNOSUPPORT; 2388 break; 2389 } 2390 #endif /* INET */ 2391 #ifndef INET6 2392 if (pca->af == AF_INET6) { 2393 pool_put(&pf_pooladdr_pl, newpa); 2394 error = EAFNOSUPPORT; 2395 break; 2396 } 2397 #endif /* INET6 */ 2398 if (newpa->ifname[0]) { 2399 newpa->kif = pfi_kif_get(newpa->ifname); 2400 if (newpa->kif == NULL) { 2401 pool_put(&pf_pooladdr_pl, newpa); 2402 error = EINVAL; 2403 break; 2404 } 2405 pfi_kif_ref(newpa->kif, PFI_KIF_REF_RULE); 2406 } else 2407 newpa->kif = NULL; 2408 if (pfi_dynaddr_setup(&newpa->addr, pca->af) || 2409 pf_tbladdr_setup(ruleset, &newpa->addr)) { 2410 pfi_dynaddr_remove(&newpa->addr); 2411 pfi_kif_unref(newpa->kif, PFI_KIF_REF_RULE); 2412 pool_put(&pf_pooladdr_pl, newpa); 2413 error = EINVAL; 2414 break; 2415 } 2416 } 2417 2418 if (pca->action == PF_CHANGE_ADD_HEAD) 2419 oldpa = TAILQ_FIRST(&pool->list); 2420 else if (pca->action == PF_CHANGE_ADD_TAIL) 2421 oldpa = TAILQ_LAST(&pool->list, pf_palist); 2422 else { 2423 int i = 0; 2424 2425 oldpa = TAILQ_FIRST(&pool->list); 2426 while ((oldpa != NULL) && (i < pca->nr)) { 2427 oldpa = TAILQ_NEXT(oldpa, entries); 2428 i++; 2429 } 2430 if (oldpa == NULL) { 2431 error = EINVAL; 2432 break; 2433 } 2434 } 2435 2436 if (pca->action == PF_CHANGE_REMOVE) { 2437 TAILQ_REMOVE(&pool->list, oldpa, entries); 2438 pfi_dynaddr_remove(&oldpa->addr); 2439 pf_tbladdr_remove(&oldpa->addr); 2440 pfi_kif_unref(oldpa->kif, PFI_KIF_REF_RULE); 2441 pool_put(&pf_pooladdr_pl, oldpa); 2442 } else { 2443 if (oldpa == NULL) 2444 TAILQ_INSERT_TAIL(&pool->list, newpa, entries); 2445 else if (pca->action == PF_CHANGE_ADD_HEAD || 2446 pca->action == PF_CHANGE_ADD_BEFORE) 2447 TAILQ_INSERT_BEFORE(oldpa, newpa, entries); 2448 else 2449 TAILQ_INSERT_AFTER(&pool->list, oldpa, 2450 newpa, entries); 2451 } 2452 2453 pool->cur = TAILQ_FIRST(&pool->list); 2454 PF_ACPY(&pool->counter, &pool->cur->addr.v.a.addr, 2455 pca->af); 2456 break; 2457 } 2458 2459 case DIOCGETRULESETS: { 2460 struct pfioc_ruleset *pr = (struct pfioc_ruleset *)addr; 2461 struct pf_ruleset *ruleset; 2462 struct pf_anchor *anchor; 2463 2464 pr->path[sizeof(pr->path) - 1] = 0; 2465 if ((ruleset = pf_find_ruleset(pr->path)) == NULL) { 2466 error = EINVAL; 2467 break; 2468 } 2469 pr->nr = 0; 2470 if (ruleset->anchor == NULL) { 2471 /* XXX kludge for pf_main_ruleset */ 2472 RB_FOREACH(anchor, pf_anchor_global, &pf_anchors) 2473 if (anchor->parent == NULL) 2474 pr->nr++; 2475 } else { 2476 RB_FOREACH(anchor, pf_anchor_node, 2477 &ruleset->anchor->children) 2478 pr->nr++; 2479 } 2480 break; 2481 } 2482 2483 case DIOCGETRULESET: { 2484 struct pfioc_ruleset *pr = (struct pfioc_ruleset *)addr; 2485 struct pf_ruleset *ruleset; 2486 struct pf_anchor *anchor; 2487 u_int32_t nr = 0; 2488 2489 pr->path[sizeof(pr->path) - 1] = 0; 2490 if ((ruleset = pf_find_ruleset(pr->path)) == NULL) { 2491 error = EINVAL; 2492 break; 2493 } 2494 pr->name[0] = 0; 2495 if (ruleset->anchor == NULL) { 2496 /* XXX kludge for pf_main_ruleset */ 2497 RB_FOREACH(anchor, pf_anchor_global, &pf_anchors) 2498 if (anchor->parent == NULL && nr++ == pr->nr) { 2499 strlcpy(pr->name, anchor->name, 2500 sizeof(pr->name)); 2501 break; 2502 } 2503 } else { 2504 RB_FOREACH(anchor, pf_anchor_node, 2505 &ruleset->anchor->children) 2506 if (nr++ == pr->nr) { 2507 strlcpy(pr->name, anchor->name, 2508 sizeof(pr->name)); 2509 break; 2510 } 2511 } 2512 if (!pr->name[0]) 2513 error = EBUSY; 2514 break; 2515 } 2516 2517 case DIOCRCLRTABLES: { 2518 struct pfioc_table *io = (struct pfioc_table *)addr; 2519 2520 if (io->pfrio_esize != 0) { 2521 error = ENODEV; 2522 break; 2523 } 2524 error = pfr_clr_tables(&io->pfrio_table, &io->pfrio_ndel, 2525 io->pfrio_flags | PFR_FLAG_USERIOCTL); 2526 break; 2527 } 2528 2529 case DIOCRADDTABLES: { 2530 struct pfioc_table *io = (struct pfioc_table *)addr; 2531 2532 if (io->pfrio_esize != sizeof(struct pfr_table)) { 2533 error = ENODEV; 2534 break; 2535 } 2536 error = pfr_add_tables(io->pfrio_buffer, io->pfrio_size, 2537 &io->pfrio_nadd, io->pfrio_flags | PFR_FLAG_USERIOCTL); 2538 break; 2539 } 2540 2541 case DIOCRDELTABLES: { 2542 struct pfioc_table *io = (struct pfioc_table *)addr; 2543 2544 if (io->pfrio_esize != sizeof(struct pfr_table)) { 2545 error = ENODEV; 2546 break; 2547 } 2548 error = pfr_del_tables(io->pfrio_buffer, io->pfrio_size, 2549 &io->pfrio_ndel, io->pfrio_flags | PFR_FLAG_USERIOCTL); 2550 break; 2551 } 2552 2553 case DIOCRGETTABLES: { 2554 struct pfioc_table *io = (struct pfioc_table *)addr; 2555 2556 if (io->pfrio_esize != sizeof(struct pfr_table)) { 2557 error = ENODEV; 2558 break; 2559 } 2560 error = pfr_get_tables(&io->pfrio_table, io->pfrio_buffer, 2561 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL); 2562 break; 2563 } 2564 2565 case DIOCRGETTSTATS: { 2566 struct pfioc_table *io = (struct pfioc_table *)addr; 2567 2568 if (io->pfrio_esize != sizeof(struct pfr_tstats)) { 2569 error = ENODEV; 2570 break; 2571 } 2572 error = pfr_get_tstats(&io->pfrio_table, io->pfrio_buffer, 2573 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL); 2574 break; 2575 } 2576 2577 case DIOCRCLRTSTATS: { 2578 struct pfioc_table *io = (struct pfioc_table *)addr; 2579 2580 if (io->pfrio_esize != sizeof(struct pfr_table)) { 2581 error = ENODEV; 2582 break; 2583 } 2584 error = pfr_clr_tstats(io->pfrio_buffer, io->pfrio_size, 2585 &io->pfrio_nzero, io->pfrio_flags | PFR_FLAG_USERIOCTL); 2586 break; 2587 } 2588 2589 case DIOCRSETTFLAGS: { 2590 struct pfioc_table *io = (struct pfioc_table *)addr; 2591 2592 if (io->pfrio_esize != sizeof(struct pfr_table)) { 2593 error = ENODEV; 2594 break; 2595 } 2596 error = pfr_set_tflags(io->pfrio_buffer, io->pfrio_size, 2597 io->pfrio_setflag, io->pfrio_clrflag, &io->pfrio_nchange, 2598 &io->pfrio_ndel, io->pfrio_flags | PFR_FLAG_USERIOCTL); 2599 break; 2600 } 2601 2602 case DIOCRCLRADDRS: { 2603 struct pfioc_table *io = (struct pfioc_table *)addr; 2604 2605 if (io->pfrio_esize != 0) { 2606 error = ENODEV; 2607 break; 2608 } 2609 error = pfr_clr_addrs(&io->pfrio_table, &io->pfrio_ndel, 2610 io->pfrio_flags | PFR_FLAG_USERIOCTL); 2611 break; 2612 } 2613 2614 case DIOCRADDADDRS: { 2615 struct pfioc_table *io = (struct pfioc_table *)addr; 2616 2617 if (io->pfrio_esize != sizeof(struct pfr_addr)) { 2618 error = ENODEV; 2619 break; 2620 } 2621 error = pfr_add_addrs(&io->pfrio_table, io->pfrio_buffer, 2622 io->pfrio_size, &io->pfrio_nadd, io->pfrio_flags | 2623 PFR_FLAG_USERIOCTL); 2624 break; 2625 } 2626 2627 case DIOCRDELADDRS: { 2628 struct pfioc_table *io = (struct pfioc_table *)addr; 2629 2630 if (io->pfrio_esize != sizeof(struct pfr_addr)) { 2631 error = ENODEV; 2632 break; 2633 } 2634 error = pfr_del_addrs(&io->pfrio_table, io->pfrio_buffer, 2635 io->pfrio_size, &io->pfrio_ndel, io->pfrio_flags | 2636 PFR_FLAG_USERIOCTL); 2637 break; 2638 } 2639 2640 case DIOCRSETADDRS: { 2641 struct pfioc_table *io = (struct pfioc_table *)addr; 2642 2643 if (io->pfrio_esize != sizeof(struct pfr_addr)) { 2644 error = ENODEV; 2645 break; 2646 } 2647 error = pfr_set_addrs(&io->pfrio_table, io->pfrio_buffer, 2648 io->pfrio_size, &io->pfrio_size2, &io->pfrio_nadd, 2649 &io->pfrio_ndel, &io->pfrio_nchange, io->pfrio_flags | 2650 PFR_FLAG_USERIOCTL, 0); 2651 break; 2652 } 2653 2654 case DIOCRGETADDRS: { 2655 struct pfioc_table *io = (struct pfioc_table *)addr; 2656 2657 if (io->pfrio_esize != sizeof(struct pfr_addr)) { 2658 error = ENODEV; 2659 break; 2660 } 2661 error = pfr_get_addrs(&io->pfrio_table, io->pfrio_buffer, 2662 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL); 2663 break; 2664 } 2665 2666 case DIOCRGETASTATS: { 2667 struct pfioc_table *io = (struct pfioc_table *)addr; 2668 2669 if (io->pfrio_esize != sizeof(struct pfr_astats)) { 2670 error = ENODEV; 2671 break; 2672 } 2673 error = pfr_get_astats(&io->pfrio_table, io->pfrio_buffer, 2674 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL); 2675 break; 2676 } 2677 2678 case DIOCRCLRASTATS: { 2679 struct pfioc_table *io = (struct pfioc_table *)addr; 2680 2681 if (io->pfrio_esize != sizeof(struct pfr_addr)) { 2682 error = ENODEV; 2683 break; 2684 } 2685 error = pfr_clr_astats(&io->pfrio_table, io->pfrio_buffer, 2686 io->pfrio_size, &io->pfrio_nzero, io->pfrio_flags | 2687 PFR_FLAG_USERIOCTL); 2688 break; 2689 } 2690 2691 case DIOCRTSTADDRS: { 2692 struct pfioc_table *io = (struct pfioc_table *)addr; 2693 2694 if (io->pfrio_esize != sizeof(struct pfr_addr)) { 2695 error = ENODEV; 2696 break; 2697 } 2698 error = pfr_tst_addrs(&io->pfrio_table, io->pfrio_buffer, 2699 io->pfrio_size, &io->pfrio_nmatch, io->pfrio_flags | 2700 PFR_FLAG_USERIOCTL); 2701 break; 2702 } 2703 2704 case DIOCRINADEFINE: { 2705 struct pfioc_table *io = (struct pfioc_table *)addr; 2706 2707 if (io->pfrio_esize != sizeof(struct pfr_addr)) { 2708 error = ENODEV; 2709 break; 2710 } 2711 error = pfr_ina_define(&io->pfrio_table, io->pfrio_buffer, 2712 io->pfrio_size, &io->pfrio_nadd, &io->pfrio_naddr, 2713 io->pfrio_ticket, io->pfrio_flags | PFR_FLAG_USERIOCTL); 2714 break; 2715 } 2716 2717 case DIOCOSFPADD: { 2718 struct pf_osfp_ioctl *io = (struct pf_osfp_ioctl *)addr; 2719 error = pf_osfp_add(io); 2720 break; 2721 } 2722 2723 case DIOCOSFPGET: { 2724 struct pf_osfp_ioctl *io = (struct pf_osfp_ioctl *)addr; 2725 error = pf_osfp_get(io); 2726 break; 2727 } 2728 2729 case DIOCXBEGIN: { 2730 struct pfioc_trans *io = (struct pfioc_trans *)addr; 2731 struct pfioc_trans_e *ioe; 2732 struct pfr_table *table; 2733 int i; 2734 2735 if (io->esize != sizeof(*ioe)) { 2736 error = ENODEV; 2737 goto fail; 2738 } 2739 ioe = (struct pfioc_trans_e *)malloc(sizeof(*ioe), 2740 M_TEMP, M_WAITOK); 2741 table = (struct pfr_table *)malloc(sizeof(*table), 2742 M_TEMP, M_WAITOK); 2743 for (i = 0; i < io->size; i++) { 2744 if (copyin(io->array+i, ioe, sizeof(*ioe))) { 2745 free(table, M_TEMP); 2746 free(ioe, M_TEMP); 2747 error = EFAULT; 2748 goto fail; 2749 } 2750 switch (ioe->rs_num) { 2751 #ifdef ALTQ 2752 case PF_RULESET_ALTQ: 2753 if (ioe->anchor[0]) { 2754 free(table, M_TEMP); 2755 free(ioe, M_TEMP); 2756 error = EINVAL; 2757 goto fail; 2758 } 2759 if ((error = pf_begin_altq(&ioe->ticket))) { 2760 free(table, M_TEMP); 2761 free(ioe, M_TEMP); 2762 goto fail; 2763 } 2764 break; 2765 #endif /* ALTQ */ 2766 case PF_RULESET_TABLE: 2767 bzero(table, sizeof(*table)); 2768 strlcpy(table->pfrt_anchor, ioe->anchor, 2769 sizeof(table->pfrt_anchor)); 2770 if ((error = pfr_ina_begin(table, 2771 &ioe->ticket, NULL, 0))) { 2772 free(table, M_TEMP); 2773 free(ioe, M_TEMP); 2774 goto fail; 2775 } 2776 break; 2777 default: 2778 if ((error = pf_begin_rules(&ioe->ticket, 2779 ioe->rs_num, ioe->anchor))) { 2780 free(table, M_TEMP); 2781 free(ioe, M_TEMP); 2782 goto fail; 2783 } 2784 break; 2785 } 2786 if (copyout(ioe, io->array+i, sizeof(io->array[i]))) { 2787 free(table, M_TEMP); 2788 free(ioe, M_TEMP); 2789 error = EFAULT; 2790 goto fail; 2791 } 2792 } 2793 free(table, M_TEMP); 2794 free(ioe, M_TEMP); 2795 break; 2796 } 2797 2798 case DIOCXROLLBACK: { 2799 struct pfioc_trans *io = (struct pfioc_trans *)addr; 2800 struct pfioc_trans_e *ioe; 2801 struct pfr_table *table; 2802 int i; 2803 2804 if (io->esize != sizeof(*ioe)) { 2805 error = ENODEV; 2806 goto fail; 2807 } 2808 ioe = (struct pfioc_trans_e *)malloc(sizeof(*ioe), 2809 M_TEMP, M_WAITOK); 2810 table = (struct pfr_table *)malloc(sizeof(*table), 2811 M_TEMP, M_WAITOK); 2812 for (i = 0; i < io->size; i++) { 2813 if (copyin(io->array+i, ioe, sizeof(*ioe))) { 2814 free(table, M_TEMP); 2815 free(ioe, M_TEMP); 2816 error = EFAULT; 2817 goto fail; 2818 } 2819 switch (ioe->rs_num) { 2820 #ifdef ALTQ 2821 case PF_RULESET_ALTQ: 2822 if (ioe->anchor[0]) { 2823 free(table, M_TEMP); 2824 free(ioe, M_TEMP); 2825 error = EINVAL; 2826 goto fail; 2827 } 2828 if ((error = pf_rollback_altq(ioe->ticket))) { 2829 free(table, M_TEMP); 2830 free(ioe, M_TEMP); 2831 goto fail; /* really bad */ 2832 } 2833 break; 2834 #endif /* ALTQ */ 2835 case PF_RULESET_TABLE: 2836 bzero(table, sizeof(*table)); 2837 strlcpy(table->pfrt_anchor, ioe->anchor, 2838 sizeof(table->pfrt_anchor)); 2839 if ((error = pfr_ina_rollback(table, 2840 ioe->ticket, NULL, 0))) { 2841 free(table, M_TEMP); 2842 free(ioe, M_TEMP); 2843 goto fail; /* really bad */ 2844 } 2845 break; 2846 default: 2847 if ((error = pf_rollback_rules(ioe->ticket, 2848 ioe->rs_num, ioe->anchor))) { 2849 free(table, M_TEMP); 2850 free(ioe, M_TEMP); 2851 goto fail; /* really bad */ 2852 } 2853 break; 2854 } 2855 } 2856 free(table, M_TEMP); 2857 free(ioe, M_TEMP); 2858 break; 2859 } 2860 2861 case DIOCXCOMMIT: { 2862 struct pfioc_trans *io = (struct pfioc_trans *)addr; 2863 struct pfioc_trans_e *ioe; 2864 struct pfr_table *table; 2865 struct pf_ruleset *rs; 2866 int i; 2867 2868 if (io->esize != sizeof(*ioe)) { 2869 error = ENODEV; 2870 goto fail; 2871 } 2872 ioe = (struct pfioc_trans_e *)malloc(sizeof(*ioe), 2873 M_TEMP, M_WAITOK); 2874 table = (struct pfr_table *)malloc(sizeof(*table), 2875 M_TEMP, M_WAITOK); 2876 /* first makes sure everything will succeed */ 2877 for (i = 0; i < io->size; i++) { 2878 if (copyin(io->array+i, ioe, sizeof(*ioe))) { 2879 free(table, M_TEMP); 2880 free(ioe, M_TEMP); 2881 error = EFAULT; 2882 goto fail; 2883 } 2884 switch (ioe->rs_num) { 2885 #ifdef ALTQ 2886 case PF_RULESET_ALTQ: 2887 if (ioe->anchor[0]) { 2888 free(table, M_TEMP); 2889 free(ioe, M_TEMP); 2890 error = EINVAL; 2891 goto fail; 2892 } 2893 if (!altqs_inactive_open || ioe->ticket != 2894 ticket_altqs_inactive) { 2895 free(table, M_TEMP); 2896 free(ioe, M_TEMP); 2897 error = EBUSY; 2898 goto fail; 2899 } 2900 break; 2901 #endif /* ALTQ */ 2902 case PF_RULESET_TABLE: 2903 rs = pf_find_ruleset(ioe->anchor); 2904 if (rs == NULL || !rs->topen || ioe->ticket != 2905 rs->tticket) { 2906 free(table, M_TEMP); 2907 free(ioe, M_TEMP); 2908 error = EBUSY; 2909 goto fail; 2910 } 2911 break; 2912 default: 2913 if (ioe->rs_num < 0 || ioe->rs_num >= 2914 PF_RULESET_MAX) { 2915 free(table, M_TEMP); 2916 free(ioe, M_TEMP); 2917 error = EINVAL; 2918 goto fail; 2919 } 2920 rs = pf_find_ruleset(ioe->anchor); 2921 if (rs == NULL || 2922 !rs->rules[ioe->rs_num].inactive.open || 2923 rs->rules[ioe->rs_num].inactive.ticket != 2924 ioe->ticket) { 2925 free(table, M_TEMP); 2926 free(ioe, M_TEMP); 2927 error = EBUSY; 2928 goto fail; 2929 } 2930 break; 2931 } 2932 } 2933 /* now do the commit - no errors should happen here */ 2934 for (i = 0; i < io->size; i++) { 2935 if (copyin(io->array+i, ioe, sizeof(*ioe))) { 2936 free(table, M_TEMP); 2937 free(ioe, M_TEMP); 2938 error = EFAULT; 2939 goto fail; 2940 } 2941 switch (ioe->rs_num) { 2942 #ifdef ALTQ 2943 case PF_RULESET_ALTQ: 2944 if ((error = pf_commit_altq(ioe->ticket))) { 2945 free(table, M_TEMP); 2946 free(ioe, M_TEMP); 2947 goto fail; /* really bad */ 2948 } 2949 break; 2950 #endif /* ALTQ */ 2951 case PF_RULESET_TABLE: 2952 bzero(table, sizeof(*table)); 2953 strlcpy(table->pfrt_anchor, ioe->anchor, 2954 sizeof(table->pfrt_anchor)); 2955 if ((error = pfr_ina_commit(table, ioe->ticket, 2956 NULL, NULL, 0))) { 2957 free(table, M_TEMP); 2958 free(ioe, M_TEMP); 2959 goto fail; /* really bad */ 2960 } 2961 break; 2962 default: 2963 if ((error = pf_commit_rules(ioe->ticket, 2964 ioe->rs_num, ioe->anchor))) { 2965 free(table, M_TEMP); 2966 free(ioe, M_TEMP); 2967 goto fail; /* really bad */ 2968 } 2969 break; 2970 } 2971 } 2972 free(table, M_TEMP); 2973 free(ioe, M_TEMP); 2974 break; 2975 } 2976 2977 case DIOCGETSRCNODES: { 2978 struct pfioc_src_nodes *psn = (struct pfioc_src_nodes *)addr; 2979 struct pf_src_node *n, *p, *pstore; 2980 u_int32_t nr = 0; 2981 int space = psn->psn_len; 2982 2983 if (space == 0) { 2984 RB_FOREACH(n, pf_src_tree, &tree_src_tracking) 2985 nr++; 2986 psn->psn_len = sizeof(struct pf_src_node) * nr; 2987 break; 2988 } 2989 2990 pstore = malloc(sizeof(*pstore), M_TEMP, M_WAITOK); 2991 2992 p = psn->psn_src_nodes; 2993 RB_FOREACH(n, pf_src_tree, &tree_src_tracking) { 2994 int secs = time_second, diff; 2995 2996 if ((nr + 1) * sizeof(*p) > (unsigned)psn->psn_len) 2997 break; 2998 2999 bcopy(n, pstore, sizeof(*pstore)); 3000 if (n->rule.ptr != NULL) 3001 pstore->rule.nr = n->rule.ptr->nr; 3002 pstore->creation = secs - pstore->creation; 3003 if (pstore->expire > secs) 3004 pstore->expire -= secs; 3005 else 3006 pstore->expire = 0; 3007 3008 /* adjust the connection rate estimate */ 3009 diff = secs - n->conn_rate.last; 3010 if (diff >= n->conn_rate.seconds) 3011 pstore->conn_rate.count = 0; 3012 else 3013 pstore->conn_rate.count -= 3014 n->conn_rate.count * diff / 3015 n->conn_rate.seconds; 3016 3017 error = copyout(pstore, p, sizeof(*p)); 3018 if (error) { 3019 free(pstore, M_TEMP); 3020 goto fail; 3021 } 3022 p++; 3023 nr++; 3024 } 3025 psn->psn_len = sizeof(struct pf_src_node) * nr; 3026 3027 free(pstore, M_TEMP); 3028 break; 3029 } 3030 3031 case DIOCCLRSRCNODES: { 3032 struct pf_src_node *n; 3033 struct pf_state *state; 3034 3035 RB_FOREACH(state, pf_state_tree_id, &tree_id) { 3036 state->src_node = NULL; 3037 state->nat_src_node = NULL; 3038 } 3039 RB_FOREACH(n, pf_src_tree, &tree_src_tracking) { 3040 n->expire = 1; 3041 n->states = 0; 3042 } 3043 pf_purge_expired_src_nodes(1); 3044 pf_status.src_nodes = 0; 3045 break; 3046 } 3047 3048 case DIOCKILLSRCNODES: { 3049 struct pf_src_node *sn; 3050 struct pf_state *s; 3051 struct pfioc_src_node_kill *psnk = \ 3052 (struct pfioc_src_node_kill *) addr; 3053 int killed = 0; 3054 3055 RB_FOREACH(sn, pf_src_tree, &tree_src_tracking) { 3056 if (PF_MATCHA(psnk->psnk_src.neg, \ 3057 &psnk->psnk_src.addr.v.a.addr, \ 3058 &psnk->psnk_src.addr.v.a.mask, \ 3059 &sn->addr, sn->af) && 3060 PF_MATCHA(psnk->psnk_dst.neg, \ 3061 &psnk->psnk_dst.addr.v.a.addr, \ 3062 &psnk->psnk_dst.addr.v.a.mask, \ 3063 &sn->raddr, sn->af)) { 3064 /* Handle state to src_node linkage */ 3065 if (sn->states != 0) { 3066 RB_FOREACH(s, pf_state_tree_id, 3067 &tree_id) { 3068 if (s->src_node == sn) 3069 s->src_node = NULL; 3070 if (s->nat_src_node == sn) 3071 s->nat_src_node = NULL; 3072 } 3073 sn->states = 0; 3074 } 3075 sn->expire = 1; 3076 killed++; 3077 } 3078 } 3079 3080 if (killed > 0) 3081 pf_purge_expired_src_nodes(1); 3082 3083 psnk->psnk_af = killed; 3084 break; 3085 } 3086 3087 case DIOCSETHOSTID: { 3088 u_int32_t *hostid = (u_int32_t *)addr; 3089 3090 if (*hostid == 0) 3091 pf_status.hostid = arc4random(); 3092 else 3093 pf_status.hostid = *hostid; 3094 break; 3095 } 3096 3097 case DIOCOSFPFLUSH: 3098 pf_osfp_flush(); 3099 break; 3100 3101 case DIOCIGETIFACES: { 3102 struct pfioc_iface *io = (struct pfioc_iface *)addr; 3103 3104 if (io->pfiio_esize != sizeof(struct pfi_kif)) { 3105 error = ENODEV; 3106 break; 3107 } 3108 error = pfi_get_ifaces(io->pfiio_name, io->pfiio_buffer, 3109 &io->pfiio_size); 3110 break; 3111 } 3112 3113 case DIOCSETIFFLAG: { 3114 struct pfioc_iface *io = (struct pfioc_iface *)addr; 3115 3116 error = pfi_set_flags(io->pfiio_name, io->pfiio_flags); 3117 break; 3118 } 3119 3120 case DIOCCLRIFFLAG: { 3121 struct pfioc_iface *io = (struct pfioc_iface *)addr; 3122 3123 error = pfi_clear_flags(io->pfiio_name, io->pfiio_flags); 3124 break; 3125 } 3126 3127 default: 3128 error = ENODEV; 3129 break; 3130 } 3131 fail: 3132 splx(s); 3133 if (flags & FWRITE) 3134 rw_exit_write(&pf_consistency_lock); 3135 else 3136 rw_exit_read(&pf_consistency_lock); 3137 return (error); 3138 } 3139 3140 #ifdef __NetBSD__ 3141 #ifdef INET 3142 static int 3143 pfil4_wrapper(void *arg, struct mbuf **mp, struct ifnet *ifp, int dir) 3144 { 3145 int error; 3146 3147 /* 3148 * ensure that mbufs are writable beforehand 3149 * as it's assumed by pf code. 3150 * ip hdr (60 bytes) + tcp hdr (60 bytes) should be enough. 3151 * XXX inefficient 3152 */ 3153 error = m_makewritable(mp, 0, 60 + 60, M_DONTWAIT); 3154 if (error) { 3155 m_freem(*mp); 3156 *mp = NULL; 3157 return error; 3158 } 3159 3160 /* 3161 * If the packet is out-bound, we can't delay checksums 3162 * here. For in-bound, the checksum has already been 3163 * validated. 3164 */ 3165 if (dir == PFIL_OUT) { 3166 if ((*mp)->m_pkthdr.csum_flags & (M_CSUM_TCPv4|M_CSUM_UDPv4)) { 3167 in_delayed_cksum(*mp); 3168 (*mp)->m_pkthdr.csum_flags &= 3169 ~(M_CSUM_TCPv4|M_CSUM_UDPv4); 3170 } 3171 } 3172 3173 if (pf_test(dir == PFIL_OUT ? PF_OUT : PF_IN, ifp, mp, NULL) 3174 != PF_PASS) { 3175 m_freem(*mp); 3176 *mp = NULL; 3177 return EHOSTUNREACH; 3178 } 3179 3180 /* 3181 * we're not compatible with fast-forward. 3182 */ 3183 3184 if (dir == PFIL_IN && *mp) { 3185 (*mp)->m_flags &= ~M_CANFASTFWD; 3186 } 3187 3188 return (0); 3189 } 3190 #endif /* INET */ 3191 3192 #ifdef INET6 3193 static int 3194 pfil6_wrapper(void *arg, struct mbuf **mp, struct ifnet *ifp, int dir) 3195 { 3196 int error; 3197 3198 /* 3199 * ensure that mbufs are writable beforehand 3200 * as it's assumed by pf code. 3201 * XXX inefficient 3202 */ 3203 error = m_makewritable(mp, 0, M_COPYALL, M_DONTWAIT); 3204 if (error) { 3205 m_freem(*mp); 3206 *mp = NULL; 3207 return error; 3208 } 3209 3210 /* 3211 * If the packet is out-bound, we can't delay checksums 3212 * here. For in-bound, the checksum has already been 3213 * validated. 3214 */ 3215 if (dir == PFIL_OUT) { 3216 if ((*mp)->m_pkthdr.csum_flags & (M_CSUM_TCPv6|M_CSUM_UDPv6)) { 3217 in6_delayed_cksum(*mp); 3218 (*mp)->m_pkthdr.csum_flags &= 3219 ~(M_CSUM_TCPv6|M_CSUM_UDPv6); 3220 } 3221 } 3222 3223 if (pf_test6(dir == PFIL_OUT ? PF_OUT : PF_IN, ifp, mp, NULL) 3224 != PF_PASS) { 3225 m_freem(*mp); 3226 *mp = NULL; 3227 return EHOSTUNREACH; 3228 } else 3229 return (0); 3230 } 3231 #endif /* INET6 */ 3232 3233 static int 3234 pf_pfil_attach(void) 3235 { 3236 struct pfil_head *ph_inet; 3237 #ifdef INET6 3238 struct pfil_head *ph_inet6; 3239 #endif /* INET6 */ 3240 int error; 3241 3242 if (pf_pfil_attached) 3243 return (EBUSY); 3244 3245 ph_inet = pfil_head_get(PFIL_TYPE_AF, AF_INET); 3246 if (ph_inet) 3247 error = pfil_add_hook((void *)pfil4_wrapper, NULL, 3248 PFIL_IN|PFIL_OUT, ph_inet); 3249 else 3250 error = ENOENT; 3251 if (error) 3252 return (error); 3253 3254 #ifdef INET6 3255 ph_inet6 = pfil_head_get(PFIL_TYPE_AF, AF_INET6); 3256 if (ph_inet6) 3257 error = pfil_add_hook((void *)pfil6_wrapper, NULL, 3258 PFIL_IN|PFIL_OUT, ph_inet6); 3259 else 3260 error = ENOENT; 3261 if (error) 3262 goto bad; 3263 #endif /* INET6 */ 3264 3265 pf_pfil_attached = 1; 3266 3267 return (0); 3268 3269 #ifdef INET6 3270 bad: 3271 pfil_remove_hook(pfil4_wrapper, NULL, PFIL_IN|PFIL_OUT, ph_inet); 3272 #endif /* INET6 */ 3273 3274 return (error); 3275 } 3276 3277 static int 3278 pf_pfil_detach(void) 3279 { 3280 struct pfil_head *ph_inet; 3281 #ifdef INET6 3282 struct pfil_head *ph_inet6; 3283 #endif /* INET6 */ 3284 3285 if (pf_pfil_attached == 0) 3286 return (EBUSY); 3287 3288 ph_inet = pfil_head_get(PFIL_TYPE_AF, AF_INET); 3289 if (ph_inet) 3290 pfil_remove_hook((void *)pfil4_wrapper, NULL, 3291 PFIL_IN|PFIL_OUT, ph_inet); 3292 #ifdef INET6 3293 ph_inet6 = pfil_head_get(PFIL_TYPE_AF, AF_INET6); 3294 if (ph_inet6) 3295 pfil_remove_hook((void *)pfil6_wrapper, NULL, 3296 PFIL_IN|PFIL_OUT, ph_inet6); 3297 #endif /* INET6 */ 3298 pf_pfil_attached = 0; 3299 3300 return (0); 3301 } 3302 #endif /* __NetBSD__ */ 3303
Indexes created Thu Oct 02 14:10:14 GMT 2025