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