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