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