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