1 /*- 2 * SPDX-License-Identifier: BSD-2-Clause 3 * 4 * Copyright (c) 2001 Daniel Hartmeier 5 * Copyright (c) 2002,2003 Henning Brauer 6 * Copyright (c) 2012 Gleb Smirnoff <glebius@FreeBSD.org> 7 * All rights reserved. 8 * 9 * Redistribution and use in source and binary forms, with or without 10 * modification, are permitted provided that the following conditions 11 * are met: 12 * 13 * - Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * - Redistributions in binary form must reproduce the above 16 * copyright notice, this list of conditions and the following 17 * disclaimer in the documentation and/or other materials provided 18 * with the distribution. 19 * 20 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 21 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 22 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS 23 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE 24 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, 25 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, 26 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; 27 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER 28 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN 30 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 31 * POSSIBILITY OF SUCH DAMAGE. 32 * 33 * Effort sponsored in part by the Defense Advanced Research Projects 34 * Agency (DARPA) and Air Force Research Laboratory, Air Force 35 * Materiel Command, USAF, under agreement number F30602-01-2-0537. 36 * 37 * $OpenBSD: pf_ioctl.c,v 1.213 2009/02/15 21:46:12 mbalmer Exp $ 38 */ 39 40 #include <sys/cdefs.h> 41 __FBSDID("$FreeBSD$"); 42 43 #include "opt_inet.h" 44 #include "opt_inet6.h" 45 #include "opt_bpf.h" 46 #include "opt_pf.h" 47 48 #include <sys/param.h> 49 #include <sys/_bitset.h> 50 #include <sys/bitset.h> 51 #include <sys/bus.h> 52 #include <sys/conf.h> 53 #include <sys/endian.h> 54 #include <sys/fcntl.h> 55 #include <sys/filio.h> 56 #include <sys/hash.h> 57 #include <sys/interrupt.h> 58 #include <sys/jail.h> 59 #include <sys/kernel.h> 60 #include <sys/kthread.h> 61 #include <sys/lock.h> 62 #include <sys/mbuf.h> 63 #include <sys/module.h> 64 #include <sys/nv.h> 65 #include <sys/proc.h> 66 #include <sys/sdt.h> 67 #include <sys/smp.h> 68 #include <sys/socket.h> 69 #include <sys/sysctl.h> 70 #include <sys/md5.h> 71 #include <sys/ucred.h> 72 73 #include <net/if.h> 74 #include <net/if_var.h> 75 #include <net/vnet.h> 76 #include <net/route.h> 77 #include <net/pfil.h> 78 #include <net/pfvar.h> 79 #include <net/if_pfsync.h> 80 #include <net/if_pflog.h> 81 82 #include <netinet/in.h> 83 #include <netinet/ip.h> 84 #include <netinet/ip_var.h> 85 #include <netinet6/ip6_var.h> 86 #include <netinet/ip_icmp.h> 87 #include <netpfil/pf/pf_nv.h> 88 89 #ifdef INET6 90 #include <netinet/ip6.h> 91 #endif /* INET6 */ 92 93 #ifdef ALTQ 94 #include <net/altq/altq.h> 95 #endif 96 97 SDT_PROBE_DEFINE3(pf, ioctl, ioctl, error, "int", "int", "int"); 98 SDT_PROBE_DEFINE3(pf, ioctl, function, error, "char *", "int", "int"); 99 SDT_PROBE_DEFINE2(pf, ioctl, addrule, error, "int", "int"); 100 SDT_PROBE_DEFINE2(pf, ioctl, nvchk, error, "int", "int"); 101 102 static struct pf_kpool *pf_get_kpool(const char *, u_int32_t, u_int8_t, 103 u_int32_t, u_int8_t, u_int8_t, u_int8_t); 104 105 static void pf_mv_kpool(struct pf_kpalist *, struct pf_kpalist *); 106 static void pf_empty_kpool(struct pf_kpalist *); 107 static int pfioctl(struct cdev *, u_long, caddr_t, int, 108 struct thread *); 109 #ifdef ALTQ 110 static int pf_begin_altq(u_int32_t *); 111 static int pf_rollback_altq(u_int32_t); 112 static int pf_commit_altq(u_int32_t); 113 static int pf_enable_altq(struct pf_altq *); 114 static int pf_disable_altq(struct pf_altq *); 115 static uint16_t pf_qname2qid(const char *); 116 static void pf_qid_unref(uint16_t); 117 #endif /* ALTQ */ 118 static int pf_begin_rules(u_int32_t *, int, const char *); 119 static int pf_rollback_rules(u_int32_t, int, char *); 120 static int pf_setup_pfsync_matching(struct pf_kruleset *); 121 static void pf_hash_rule(MD5_CTX *, struct pf_krule *); 122 static void pf_hash_rule_addr(MD5_CTX *, struct pf_rule_addr *); 123 static int pf_commit_rules(u_int32_t, int, char *); 124 static int pf_addr_setup(struct pf_kruleset *, 125 struct pf_addr_wrap *, sa_family_t); 126 static void pf_addr_copyout(struct pf_addr_wrap *); 127 static void pf_src_node_copy(const struct pf_ksrc_node *, 128 struct pf_src_node *); 129 #ifdef ALTQ 130 static int pf_export_kaltq(struct pf_altq *, 131 struct pfioc_altq_v1 *, size_t); 132 static int pf_import_kaltq(struct pfioc_altq_v1 *, 133 struct pf_altq *, size_t); 134 #endif /* ALTQ */ 135 136 VNET_DEFINE(struct pf_krule, pf_default_rule); 137 138 #ifdef ALTQ 139 VNET_DEFINE_STATIC(int, pf_altq_running); 140 #define V_pf_altq_running VNET(pf_altq_running) 141 #endif 142 143 #define TAGID_MAX 50000 144 struct pf_tagname { 145 TAILQ_ENTRY(pf_tagname) namehash_entries; 146 TAILQ_ENTRY(pf_tagname) taghash_entries; 147 char name[PF_TAG_NAME_SIZE]; 148 uint16_t tag; 149 int ref; 150 }; 151 152 struct pf_tagset { 153 TAILQ_HEAD(, pf_tagname) *namehash; 154 TAILQ_HEAD(, pf_tagname) *taghash; 155 unsigned int mask; 156 uint32_t seed; 157 BITSET_DEFINE(, TAGID_MAX) avail; 158 }; 159 160 VNET_DEFINE(struct pf_tagset, pf_tags); 161 #define V_pf_tags VNET(pf_tags) 162 static unsigned int pf_rule_tag_hashsize; 163 #define PF_RULE_TAG_HASH_SIZE_DEFAULT 128 164 SYSCTL_UINT(_net_pf, OID_AUTO, rule_tag_hashsize, CTLFLAG_RDTUN, 165 &pf_rule_tag_hashsize, PF_RULE_TAG_HASH_SIZE_DEFAULT, 166 "Size of pf(4) rule tag hashtable"); 167 168 #ifdef ALTQ 169 VNET_DEFINE(struct pf_tagset, pf_qids); 170 #define V_pf_qids VNET(pf_qids) 171 static unsigned int pf_queue_tag_hashsize; 172 #define PF_QUEUE_TAG_HASH_SIZE_DEFAULT 128 173 SYSCTL_UINT(_net_pf, OID_AUTO, queue_tag_hashsize, CTLFLAG_RDTUN, 174 &pf_queue_tag_hashsize, PF_QUEUE_TAG_HASH_SIZE_DEFAULT, 175 "Size of pf(4) queue tag hashtable"); 176 #endif 177 VNET_DEFINE(uma_zone_t, pf_tag_z); 178 #define V_pf_tag_z VNET(pf_tag_z) 179 static MALLOC_DEFINE(M_PFALTQ, "pf_altq", "pf(4) altq configuration db"); 180 static MALLOC_DEFINE(M_PFRULE, "pf_rule", "pf(4) rules"); 181 182 #if (PF_QNAME_SIZE != PF_TAG_NAME_SIZE) 183 #error PF_QNAME_SIZE must be equal to PF_TAG_NAME_SIZE 184 #endif 185 186 static void pf_init_tagset(struct pf_tagset *, unsigned int *, 187 unsigned int); 188 static void pf_cleanup_tagset(struct pf_tagset *); 189 static uint16_t tagname2hashindex(const struct pf_tagset *, const char *); 190 static uint16_t tag2hashindex(const struct pf_tagset *, uint16_t); 191 static u_int16_t tagname2tag(struct pf_tagset *, const char *); 192 static u_int16_t pf_tagname2tag(const char *); 193 static void tag_unref(struct pf_tagset *, u_int16_t); 194 195 #define DPFPRINTF(n, x) if (V_pf_status.debug >= (n)) printf x 196 197 struct cdev *pf_dev; 198 199 /* 200 * XXX - These are new and need to be checked when moveing to a new version 201 */ 202 static void pf_clear_all_states(void); 203 static unsigned int pf_clear_states(const struct pf_kstate_kill *); 204 static void pf_killstates(struct pf_kstate_kill *, 205 unsigned int *); 206 static int pf_killstates_row(struct pf_kstate_kill *, 207 struct pf_idhash *); 208 static int pf_killstates_nv(struct pfioc_nv *); 209 static int pf_clearstates_nv(struct pfioc_nv *); 210 static int pf_getstate(struct pfioc_nv *); 211 static int pf_getstatus(struct pfioc_nv *); 212 static int pf_clear_tables(void); 213 static void pf_clear_srcnodes(struct pf_ksrc_node *); 214 static void pf_kill_srcnodes(struct pfioc_src_node_kill *); 215 static int pf_keepcounters(struct pfioc_nv *); 216 static void pf_tbladdr_copyout(struct pf_addr_wrap *); 217 218 /* 219 * Wrapper functions for pfil(9) hooks 220 */ 221 #ifdef INET 222 static pfil_return_t pf_check_in(struct mbuf **m, struct ifnet *ifp, 223 int flags, void *ruleset __unused, struct inpcb *inp); 224 static pfil_return_t pf_check_out(struct mbuf **m, struct ifnet *ifp, 225 int flags, void *ruleset __unused, struct inpcb *inp); 226 #endif 227 #ifdef INET6 228 static pfil_return_t pf_check6_in(struct mbuf **m, struct ifnet *ifp, 229 int flags, void *ruleset __unused, struct inpcb *inp); 230 static pfil_return_t pf_check6_out(struct mbuf **m, struct ifnet *ifp, 231 int flags, void *ruleset __unused, struct inpcb *inp); 232 #endif 233 234 static void hook_pf(void); 235 static void dehook_pf(void); 236 static int shutdown_pf(void); 237 static int pf_load(void); 238 static void pf_unload(void); 239 240 static struct cdevsw pf_cdevsw = { 241 .d_ioctl = pfioctl, 242 .d_name = PF_NAME, 243 .d_version = D_VERSION, 244 }; 245 246 volatile VNET_DEFINE_STATIC(int, pf_pfil_hooked); 247 #define V_pf_pfil_hooked VNET(pf_pfil_hooked) 248 249 /* 250 * We need a flag that is neither hooked nor running to know when 251 * the VNET is "valid". We primarily need this to control (global) 252 * external event, e.g., eventhandlers. 253 */ 254 VNET_DEFINE(int, pf_vnet_active); 255 #define V_pf_vnet_active VNET(pf_vnet_active) 256 257 int pf_end_threads; 258 struct proc *pf_purge_proc; 259 260 struct rmlock pf_rules_lock; 261 struct sx pf_ioctl_lock; 262 struct sx pf_end_lock; 263 264 /* pfsync */ 265 VNET_DEFINE(pfsync_state_import_t *, pfsync_state_import_ptr); 266 VNET_DEFINE(pfsync_insert_state_t *, pfsync_insert_state_ptr); 267 VNET_DEFINE(pfsync_update_state_t *, pfsync_update_state_ptr); 268 VNET_DEFINE(pfsync_delete_state_t *, pfsync_delete_state_ptr); 269 VNET_DEFINE(pfsync_clear_states_t *, pfsync_clear_states_ptr); 270 VNET_DEFINE(pfsync_defer_t *, pfsync_defer_ptr); 271 pfsync_detach_ifnet_t *pfsync_detach_ifnet_ptr; 272 273 /* pflog */ 274 pflog_packet_t *pflog_packet_ptr = NULL; 275 276 /* 277 * Copy a user-provided string, returning an error if truncation would occur. 278 * Avoid scanning past "sz" bytes in the source string since there's no 279 * guarantee that it's nul-terminated. 280 */ 281 static int 282 pf_user_strcpy(char *dst, const char *src, size_t sz) 283 { 284 if (strnlen(src, sz) == sz) 285 return (EINVAL); 286 (void)strlcpy(dst, src, sz); 287 return (0); 288 } 289 290 static void 291 pfattach_vnet(void) 292 { 293 u_int32_t *my_timeout = V_pf_default_rule.timeout; 294 295 pf_initialize(); 296 pfr_initialize(); 297 pfi_initialize_vnet(); 298 pf_normalize_init(); 299 pf_syncookies_init(); 300 301 V_pf_limits[PF_LIMIT_STATES].limit = PFSTATE_HIWAT; 302 V_pf_limits[PF_LIMIT_SRC_NODES].limit = PFSNODE_HIWAT; 303 304 RB_INIT(&V_pf_anchors); 305 pf_init_kruleset(&pf_main_ruleset); 306 307 /* default rule should never be garbage collected */ 308 V_pf_default_rule.entries.tqe_prev = &V_pf_default_rule.entries.tqe_next; 309 #ifdef PF_DEFAULT_TO_DROP 310 V_pf_default_rule.action = PF_DROP; 311 #else 312 V_pf_default_rule.action = PF_PASS; 313 #endif 314 V_pf_default_rule.nr = -1; 315 V_pf_default_rule.rtableid = -1; 316 317 pf_counter_u64_init(&V_pf_default_rule.evaluations, M_WAITOK); 318 for (int i = 0; i < 2; i++) { 319 pf_counter_u64_init(&V_pf_default_rule.packets[i], M_WAITOK); 320 pf_counter_u64_init(&V_pf_default_rule.bytes[i], M_WAITOK); 321 } 322 V_pf_default_rule.states_cur = counter_u64_alloc(M_WAITOK); 323 V_pf_default_rule.states_tot = counter_u64_alloc(M_WAITOK); 324 V_pf_default_rule.src_nodes = counter_u64_alloc(M_WAITOK); 325 326 #ifdef PF_WANT_32_TO_64_COUNTER 327 V_pf_kifmarker = malloc(sizeof(*V_pf_kifmarker), PFI_MTYPE, M_WAITOK | M_ZERO); 328 V_pf_rulemarker = malloc(sizeof(*V_pf_rulemarker), M_PFRULE, M_WAITOK | M_ZERO); 329 PF_RULES_WLOCK(); 330 LIST_INSERT_HEAD(&V_pf_allkiflist, V_pf_kifmarker, pfik_allkiflist); 331 LIST_INSERT_HEAD(&V_pf_allrulelist, &V_pf_default_rule, allrulelist); 332 V_pf_allrulecount++; 333 LIST_INSERT_HEAD(&V_pf_allrulelist, V_pf_rulemarker, allrulelist); 334 PF_RULES_WUNLOCK(); 335 #endif 336 337 /* initialize default timeouts */ 338 my_timeout[PFTM_TCP_FIRST_PACKET] = PFTM_TCP_FIRST_PACKET_VAL; 339 my_timeout[PFTM_TCP_OPENING] = PFTM_TCP_OPENING_VAL; 340 my_timeout[PFTM_TCP_ESTABLISHED] = PFTM_TCP_ESTABLISHED_VAL; 341 my_timeout[PFTM_TCP_CLOSING] = PFTM_TCP_CLOSING_VAL; 342 my_timeout[PFTM_TCP_FIN_WAIT] = PFTM_TCP_FIN_WAIT_VAL; 343 my_timeout[PFTM_TCP_CLOSED] = PFTM_TCP_CLOSED_VAL; 344 my_timeout[PFTM_UDP_FIRST_PACKET] = PFTM_UDP_FIRST_PACKET_VAL; 345 my_timeout[PFTM_UDP_SINGLE] = PFTM_UDP_SINGLE_VAL; 346 my_timeout[PFTM_UDP_MULTIPLE] = PFTM_UDP_MULTIPLE_VAL; 347 my_timeout[PFTM_ICMP_FIRST_PACKET] = PFTM_ICMP_FIRST_PACKET_VAL; 348 my_timeout[PFTM_ICMP_ERROR_REPLY] = PFTM_ICMP_ERROR_REPLY_VAL; 349 my_timeout[PFTM_OTHER_FIRST_PACKET] = PFTM_OTHER_FIRST_PACKET_VAL; 350 my_timeout[PFTM_OTHER_SINGLE] = PFTM_OTHER_SINGLE_VAL; 351 my_timeout[PFTM_OTHER_MULTIPLE] = PFTM_OTHER_MULTIPLE_VAL; 352 my_timeout[PFTM_FRAG] = PFTM_FRAG_VAL; 353 my_timeout[PFTM_INTERVAL] = PFTM_INTERVAL_VAL; 354 my_timeout[PFTM_SRC_NODE] = PFTM_SRC_NODE_VAL; 355 my_timeout[PFTM_TS_DIFF] = PFTM_TS_DIFF_VAL; 356 my_timeout[PFTM_ADAPTIVE_START] = PFSTATE_ADAPT_START; 357 my_timeout[PFTM_ADAPTIVE_END] = PFSTATE_ADAPT_END; 358 359 bzero(&V_pf_status, sizeof(V_pf_status)); 360 V_pf_status.debug = PF_DEBUG_URGENT; 361 362 V_pf_pfil_hooked = 0; 363 364 /* XXX do our best to avoid a conflict */ 365 V_pf_status.hostid = arc4random(); 366 367 for (int i = 0; i < PFRES_MAX; i++) 368 V_pf_status.counters[i] = counter_u64_alloc(M_WAITOK); 369 for (int i = 0; i < KLCNT_MAX; i++) 370 V_pf_status.lcounters[i] = counter_u64_alloc(M_WAITOK); 371 for (int i = 0; i < FCNT_MAX; i++) 372 pf_counter_u64_init(&V_pf_status.fcounters[i], M_WAITOK); 373 for (int i = 0; i < SCNT_MAX; i++) 374 V_pf_status.scounters[i] = counter_u64_alloc(M_WAITOK); 375 376 if (swi_add(&V_pf_swi_ie, "pf send", pf_intr, curvnet, SWI_NET, 377 INTR_MPSAFE, &V_pf_swi_cookie) != 0) 378 /* XXXGL: leaked all above. */ 379 return; 380 } 381 382 static struct pf_kpool * 383 pf_get_kpool(const char *anchor, u_int32_t ticket, u_int8_t rule_action, 384 u_int32_t rule_number, u_int8_t r_last, u_int8_t active, 385 u_int8_t check_ticket) 386 { 387 struct pf_kruleset *ruleset; 388 struct pf_krule *rule; 389 int rs_num; 390 391 ruleset = pf_find_kruleset(anchor); 392 if (ruleset == NULL) 393 return (NULL); 394 rs_num = pf_get_ruleset_number(rule_action); 395 if (rs_num >= PF_RULESET_MAX) 396 return (NULL); 397 if (active) { 398 if (check_ticket && ticket != 399 ruleset->rules[rs_num].active.ticket) 400 return (NULL); 401 if (r_last) 402 rule = TAILQ_LAST(ruleset->rules[rs_num].active.ptr, 403 pf_krulequeue); 404 else 405 rule = TAILQ_FIRST(ruleset->rules[rs_num].active.ptr); 406 } else { 407 if (check_ticket && ticket != 408 ruleset->rules[rs_num].inactive.ticket) 409 return (NULL); 410 if (r_last) 411 rule = TAILQ_LAST(ruleset->rules[rs_num].inactive.ptr, 412 pf_krulequeue); 413 else 414 rule = TAILQ_FIRST(ruleset->rules[rs_num].inactive.ptr); 415 } 416 if (!r_last) { 417 while ((rule != NULL) && (rule->nr != rule_number)) 418 rule = TAILQ_NEXT(rule, entries); 419 } 420 if (rule == NULL) 421 return (NULL); 422 423 return (&rule->rpool); 424 } 425 426 static void 427 pf_mv_kpool(struct pf_kpalist *poola, struct pf_kpalist *poolb) 428 { 429 struct pf_kpooladdr *mv_pool_pa; 430 431 while ((mv_pool_pa = TAILQ_FIRST(poola)) != NULL) { 432 TAILQ_REMOVE(poola, mv_pool_pa, entries); 433 TAILQ_INSERT_TAIL(poolb, mv_pool_pa, entries); 434 } 435 } 436 437 static void 438 pf_empty_kpool(struct pf_kpalist *poola) 439 { 440 struct pf_kpooladdr *pa; 441 442 while ((pa = TAILQ_FIRST(poola)) != NULL) { 443 switch (pa->addr.type) { 444 case PF_ADDR_DYNIFTL: 445 pfi_dynaddr_remove(pa->addr.p.dyn); 446 break; 447 case PF_ADDR_TABLE: 448 /* XXX: this could be unfinished pooladdr on pabuf */ 449 if (pa->addr.p.tbl != NULL) 450 pfr_detach_table(pa->addr.p.tbl); 451 break; 452 } 453 if (pa->kif) 454 pfi_kkif_unref(pa->kif); 455 TAILQ_REMOVE(poola, pa, entries); 456 free(pa, M_PFRULE); 457 } 458 } 459 460 static void 461 pf_unlink_rule(struct pf_krulequeue *rulequeue, struct pf_krule *rule) 462 { 463 464 PF_RULES_WASSERT(); 465 466 TAILQ_REMOVE(rulequeue, rule, entries); 467 468 PF_UNLNKDRULES_LOCK(); 469 rule->rule_ref |= PFRULE_REFS; 470 TAILQ_INSERT_TAIL(&V_pf_unlinked_rules, rule, entries); 471 PF_UNLNKDRULES_UNLOCK(); 472 } 473 474 void 475 pf_free_rule(struct pf_krule *rule) 476 { 477 478 PF_RULES_WASSERT(); 479 480 if (rule->tag) 481 tag_unref(&V_pf_tags, rule->tag); 482 if (rule->match_tag) 483 tag_unref(&V_pf_tags, rule->match_tag); 484 #ifdef ALTQ 485 if (rule->pqid != rule->qid) 486 pf_qid_unref(rule->pqid); 487 pf_qid_unref(rule->qid); 488 #endif 489 switch (rule->src.addr.type) { 490 case PF_ADDR_DYNIFTL: 491 pfi_dynaddr_remove(rule->src.addr.p.dyn); 492 break; 493 case PF_ADDR_TABLE: 494 pfr_detach_table(rule->src.addr.p.tbl); 495 break; 496 } 497 switch (rule->dst.addr.type) { 498 case PF_ADDR_DYNIFTL: 499 pfi_dynaddr_remove(rule->dst.addr.p.dyn); 500 break; 501 case PF_ADDR_TABLE: 502 pfr_detach_table(rule->dst.addr.p.tbl); 503 break; 504 } 505 if (rule->overload_tbl) 506 pfr_detach_table(rule->overload_tbl); 507 if (rule->kif) 508 pfi_kkif_unref(rule->kif); 509 pf_kanchor_remove(rule); 510 pf_empty_kpool(&rule->rpool.list); 511 512 pf_krule_free(rule); 513 } 514 515 static void 516 pf_init_tagset(struct pf_tagset *ts, unsigned int *tunable_size, 517 unsigned int default_size) 518 { 519 unsigned int i; 520 unsigned int hashsize; 521 522 if (*tunable_size == 0 || !powerof2(*tunable_size)) 523 *tunable_size = default_size; 524 525 hashsize = *tunable_size; 526 ts->namehash = mallocarray(hashsize, sizeof(*ts->namehash), M_PFHASH, 527 M_WAITOK); 528 ts->taghash = mallocarray(hashsize, sizeof(*ts->taghash), M_PFHASH, 529 M_WAITOK); 530 ts->mask = hashsize - 1; 531 ts->seed = arc4random(); 532 for (i = 0; i < hashsize; i++) { 533 TAILQ_INIT(&ts->namehash[i]); 534 TAILQ_INIT(&ts->taghash[i]); 535 } 536 BIT_FILL(TAGID_MAX, &ts->avail); 537 } 538 539 static void 540 pf_cleanup_tagset(struct pf_tagset *ts) 541 { 542 unsigned int i; 543 unsigned int hashsize; 544 struct pf_tagname *t, *tmp; 545 546 /* 547 * Only need to clean up one of the hashes as each tag is hashed 548 * into each table. 549 */ 550 hashsize = ts->mask + 1; 551 for (i = 0; i < hashsize; i++) 552 TAILQ_FOREACH_SAFE(t, &ts->namehash[i], namehash_entries, tmp) 553 uma_zfree(V_pf_tag_z, t); 554 555 free(ts->namehash, M_PFHASH); 556 free(ts->taghash, M_PFHASH); 557 } 558 559 static uint16_t 560 tagname2hashindex(const struct pf_tagset *ts, const char *tagname) 561 { 562 size_t len; 563 564 len = strnlen(tagname, PF_TAG_NAME_SIZE - 1); 565 return (murmur3_32_hash(tagname, len, ts->seed) & ts->mask); 566 } 567 568 static uint16_t 569 tag2hashindex(const struct pf_tagset *ts, uint16_t tag) 570 { 571 572 return (tag & ts->mask); 573 } 574 575 static u_int16_t 576 tagname2tag(struct pf_tagset *ts, const char *tagname) 577 { 578 struct pf_tagname *tag; 579 u_int32_t index; 580 u_int16_t new_tagid; 581 582 PF_RULES_WASSERT(); 583 584 index = tagname2hashindex(ts, tagname); 585 TAILQ_FOREACH(tag, &ts->namehash[index], namehash_entries) 586 if (strcmp(tagname, tag->name) == 0) { 587 tag->ref++; 588 return (tag->tag); 589 } 590 591 /* 592 * new entry 593 * 594 * to avoid fragmentation, we do a linear search from the beginning 595 * and take the first free slot we find. 596 */ 597 new_tagid = BIT_FFS(TAGID_MAX, &ts->avail); 598 /* 599 * Tags are 1-based, with valid tags in the range [1..TAGID_MAX]. 600 * BIT_FFS() returns a 1-based bit number, with 0 indicating no bits 601 * set. It may also return a bit number greater than TAGID_MAX due 602 * to rounding of the number of bits in the vector up to a multiple 603 * of the vector word size at declaration/allocation time. 604 */ 605 if ((new_tagid == 0) || (new_tagid > TAGID_MAX)) 606 return (0); 607 608 /* Mark the tag as in use. Bits are 0-based for BIT_CLR() */ 609 BIT_CLR(TAGID_MAX, new_tagid - 1, &ts->avail); 610 611 /* allocate and fill new struct pf_tagname */ 612 tag = uma_zalloc(V_pf_tag_z, M_NOWAIT); 613 if (tag == NULL) 614 return (0); 615 strlcpy(tag->name, tagname, sizeof(tag->name)); 616 tag->tag = new_tagid; 617 tag->ref = 1; 618 619 /* Insert into namehash */ 620 TAILQ_INSERT_TAIL(&ts->namehash[index], tag, namehash_entries); 621 622 /* Insert into taghash */ 623 index = tag2hashindex(ts, new_tagid); 624 TAILQ_INSERT_TAIL(&ts->taghash[index], tag, taghash_entries); 625 626 return (tag->tag); 627 } 628 629 static void 630 tag_unref(struct pf_tagset *ts, u_int16_t tag) 631 { 632 struct pf_tagname *t; 633 uint16_t index; 634 635 PF_RULES_WASSERT(); 636 637 index = tag2hashindex(ts, tag); 638 TAILQ_FOREACH(t, &ts->taghash[index], taghash_entries) 639 if (tag == t->tag) { 640 if (--t->ref == 0) { 641 TAILQ_REMOVE(&ts->taghash[index], t, 642 taghash_entries); 643 index = tagname2hashindex(ts, t->name); 644 TAILQ_REMOVE(&ts->namehash[index], t, 645 namehash_entries); 646 /* Bits are 0-based for BIT_SET() */ 647 BIT_SET(TAGID_MAX, tag - 1, &ts->avail); 648 uma_zfree(V_pf_tag_z, t); 649 } 650 break; 651 } 652 } 653 654 static uint16_t 655 pf_tagname2tag(const char *tagname) 656 { 657 return (tagname2tag(&V_pf_tags, tagname)); 658 } 659 660 #ifdef ALTQ 661 static uint16_t 662 pf_qname2qid(const char *qname) 663 { 664 return (tagname2tag(&V_pf_qids, qname)); 665 } 666 667 static void 668 pf_qid_unref(uint16_t qid) 669 { 670 tag_unref(&V_pf_qids, qid); 671 } 672 673 static int 674 pf_begin_altq(u_int32_t *ticket) 675 { 676 struct pf_altq *altq, *tmp; 677 int error = 0; 678 679 PF_RULES_WASSERT(); 680 681 /* Purge the old altq lists */ 682 TAILQ_FOREACH_SAFE(altq, V_pf_altq_ifs_inactive, entries, tmp) { 683 if ((altq->local_flags & PFALTQ_FLAG_IF_REMOVED) == 0) { 684 /* detach and destroy the discipline */ 685 error = altq_remove(altq); 686 } 687 free(altq, M_PFALTQ); 688 } 689 TAILQ_INIT(V_pf_altq_ifs_inactive); 690 TAILQ_FOREACH_SAFE(altq, V_pf_altqs_inactive, entries, tmp) { 691 pf_qid_unref(altq->qid); 692 free(altq, M_PFALTQ); 693 } 694 TAILQ_INIT(V_pf_altqs_inactive); 695 if (error) 696 return (error); 697 *ticket = ++V_ticket_altqs_inactive; 698 V_altqs_inactive_open = 1; 699 return (0); 700 } 701 702 static int 703 pf_rollback_altq(u_int32_t ticket) 704 { 705 struct pf_altq *altq, *tmp; 706 int error = 0; 707 708 PF_RULES_WASSERT(); 709 710 if (!V_altqs_inactive_open || ticket != V_ticket_altqs_inactive) 711 return (0); 712 /* Purge the old altq lists */ 713 TAILQ_FOREACH_SAFE(altq, V_pf_altq_ifs_inactive, entries, tmp) { 714 if ((altq->local_flags & PFALTQ_FLAG_IF_REMOVED) == 0) { 715 /* detach and destroy the discipline */ 716 error = altq_remove(altq); 717 } 718 free(altq, M_PFALTQ); 719 } 720 TAILQ_INIT(V_pf_altq_ifs_inactive); 721 TAILQ_FOREACH_SAFE(altq, V_pf_altqs_inactive, entries, tmp) { 722 pf_qid_unref(altq->qid); 723 free(altq, M_PFALTQ); 724 } 725 TAILQ_INIT(V_pf_altqs_inactive); 726 V_altqs_inactive_open = 0; 727 return (error); 728 } 729 730 static int 731 pf_commit_altq(u_int32_t ticket) 732 { 733 struct pf_altqqueue *old_altqs, *old_altq_ifs; 734 struct pf_altq *altq, *tmp; 735 int err, error = 0; 736 737 PF_RULES_WASSERT(); 738 739 if (!V_altqs_inactive_open || ticket != V_ticket_altqs_inactive) 740 return (EBUSY); 741 742 /* swap altqs, keep the old. */ 743 old_altqs = V_pf_altqs_active; 744 old_altq_ifs = V_pf_altq_ifs_active; 745 V_pf_altqs_active = V_pf_altqs_inactive; 746 V_pf_altq_ifs_active = V_pf_altq_ifs_inactive; 747 V_pf_altqs_inactive = old_altqs; 748 V_pf_altq_ifs_inactive = old_altq_ifs; 749 V_ticket_altqs_active = V_ticket_altqs_inactive; 750 751 /* Attach new disciplines */ 752 TAILQ_FOREACH(altq, V_pf_altq_ifs_active, entries) { 753 if ((altq->local_flags & PFALTQ_FLAG_IF_REMOVED) == 0) { 754 /* attach the discipline */ 755 error = altq_pfattach(altq); 756 if (error == 0 && V_pf_altq_running) 757 error = pf_enable_altq(altq); 758 if (error != 0) 759 return (error); 760 } 761 } 762 763 /* Purge the old altq lists */ 764 TAILQ_FOREACH_SAFE(altq, V_pf_altq_ifs_inactive, entries, tmp) { 765 if ((altq->local_flags & PFALTQ_FLAG_IF_REMOVED) == 0) { 766 /* detach and destroy the discipline */ 767 if (V_pf_altq_running) 768 error = pf_disable_altq(altq); 769 err = altq_pfdetach(altq); 770 if (err != 0 && error == 0) 771 error = err; 772 err = altq_remove(altq); 773 if (err != 0 && error == 0) 774 error = err; 775 } 776 free(altq, M_PFALTQ); 777 } 778 TAILQ_INIT(V_pf_altq_ifs_inactive); 779 TAILQ_FOREACH_SAFE(altq, V_pf_altqs_inactive, entries, tmp) { 780 pf_qid_unref(altq->qid); 781 free(altq, M_PFALTQ); 782 } 783 TAILQ_INIT(V_pf_altqs_inactive); 784 785 V_altqs_inactive_open = 0; 786 return (error); 787 } 788 789 static int 790 pf_enable_altq(struct pf_altq *altq) 791 { 792 struct ifnet *ifp; 793 struct tb_profile tb; 794 int error = 0; 795 796 if ((ifp = ifunit(altq->ifname)) == NULL) 797 return (EINVAL); 798 799 if (ifp->if_snd.altq_type != ALTQT_NONE) 800 error = altq_enable(&ifp->if_snd); 801 802 /* set tokenbucket regulator */ 803 if (error == 0 && ifp != NULL && ALTQ_IS_ENABLED(&ifp->if_snd)) { 804 tb.rate = altq->ifbandwidth; 805 tb.depth = altq->tbrsize; 806 error = tbr_set(&ifp->if_snd, &tb); 807 } 808 809 return (error); 810 } 811 812 static int 813 pf_disable_altq(struct pf_altq *altq) 814 { 815 struct ifnet *ifp; 816 struct tb_profile tb; 817 int error; 818 819 if ((ifp = ifunit(altq->ifname)) == NULL) 820 return (EINVAL); 821 822 /* 823 * when the discipline is no longer referenced, it was overridden 824 * by a new one. if so, just return. 825 */ 826 if (altq->altq_disc != ifp->if_snd.altq_disc) 827 return (0); 828 829 error = altq_disable(&ifp->if_snd); 830 831 if (error == 0) { 832 /* clear tokenbucket regulator */ 833 tb.rate = 0; 834 error = tbr_set(&ifp->if_snd, &tb); 835 } 836 837 return (error); 838 } 839 840 static int 841 pf_altq_ifnet_event_add(struct ifnet *ifp, int remove, u_int32_t ticket, 842 struct pf_altq *altq) 843 { 844 struct ifnet *ifp1; 845 int error = 0; 846 847 /* Deactivate the interface in question */ 848 altq->local_flags &= ~PFALTQ_FLAG_IF_REMOVED; 849 if ((ifp1 = ifunit(altq->ifname)) == NULL || 850 (remove && ifp1 == ifp)) { 851 altq->local_flags |= PFALTQ_FLAG_IF_REMOVED; 852 } else { 853 error = altq_add(ifp1, altq); 854 855 if (ticket != V_ticket_altqs_inactive) 856 error = EBUSY; 857 858 if (error) 859 free(altq, M_PFALTQ); 860 } 861 862 return (error); 863 } 864 865 void 866 pf_altq_ifnet_event(struct ifnet *ifp, int remove) 867 { 868 struct pf_altq *a1, *a2, *a3; 869 u_int32_t ticket; 870 int error = 0; 871 872 /* 873 * No need to re-evaluate the configuration for events on interfaces 874 * that do not support ALTQ, as it's not possible for such 875 * interfaces to be part of the configuration. 876 */ 877 if (!ALTQ_IS_READY(&ifp->if_snd)) 878 return; 879 880 /* Interrupt userland queue modifications */ 881 if (V_altqs_inactive_open) 882 pf_rollback_altq(V_ticket_altqs_inactive); 883 884 /* Start new altq ruleset */ 885 if (pf_begin_altq(&ticket)) 886 return; 887 888 /* Copy the current active set */ 889 TAILQ_FOREACH(a1, V_pf_altq_ifs_active, entries) { 890 a2 = malloc(sizeof(*a2), M_PFALTQ, M_NOWAIT); 891 if (a2 == NULL) { 892 error = ENOMEM; 893 break; 894 } 895 bcopy(a1, a2, sizeof(struct pf_altq)); 896 897 error = pf_altq_ifnet_event_add(ifp, remove, ticket, a2); 898 if (error) 899 break; 900 901 TAILQ_INSERT_TAIL(V_pf_altq_ifs_inactive, a2, entries); 902 } 903 if (error) 904 goto out; 905 TAILQ_FOREACH(a1, V_pf_altqs_active, entries) { 906 a2 = malloc(sizeof(*a2), M_PFALTQ, M_NOWAIT); 907 if (a2 == NULL) { 908 error = ENOMEM; 909 break; 910 } 911 bcopy(a1, a2, sizeof(struct pf_altq)); 912 913 if ((a2->qid = pf_qname2qid(a2->qname)) == 0) { 914 error = EBUSY; 915 free(a2, M_PFALTQ); 916 break; 917 } 918 a2->altq_disc = NULL; 919 TAILQ_FOREACH(a3, V_pf_altq_ifs_inactive, entries) { 920 if (strncmp(a3->ifname, a2->ifname, 921 IFNAMSIZ) == 0) { 922 a2->altq_disc = a3->altq_disc; 923 break; 924 } 925 } 926 error = pf_altq_ifnet_event_add(ifp, remove, ticket, a2); 927 if (error) 928 break; 929 930 TAILQ_INSERT_TAIL(V_pf_altqs_inactive, a2, entries); 931 } 932 933 out: 934 if (error != 0) 935 pf_rollback_altq(ticket); 936 else 937 pf_commit_altq(ticket); 938 } 939 #endif /* ALTQ */ 940 941 static int 942 pf_begin_rules(u_int32_t *ticket, int rs_num, const char *anchor) 943 { 944 struct pf_kruleset *rs; 945 struct pf_krule *rule; 946 947 PF_RULES_WASSERT(); 948 949 if (rs_num < 0 || rs_num >= PF_RULESET_MAX) 950 return (EINVAL); 951 rs = pf_find_or_create_kruleset(anchor); 952 if (rs == NULL) 953 return (EINVAL); 954 while ((rule = TAILQ_FIRST(rs->rules[rs_num].inactive.ptr)) != NULL) { 955 pf_unlink_rule(rs->rules[rs_num].inactive.ptr, rule); 956 rs->rules[rs_num].inactive.rcount--; 957 } 958 *ticket = ++rs->rules[rs_num].inactive.ticket; 959 rs->rules[rs_num].inactive.open = 1; 960 return (0); 961 } 962 963 static int 964 pf_rollback_rules(u_int32_t ticket, int rs_num, char *anchor) 965 { 966 struct pf_kruleset *rs; 967 struct pf_krule *rule; 968 969 PF_RULES_WASSERT(); 970 971 if (rs_num < 0 || rs_num >= PF_RULESET_MAX) 972 return (EINVAL); 973 rs = pf_find_kruleset(anchor); 974 if (rs == NULL || !rs->rules[rs_num].inactive.open || 975 rs->rules[rs_num].inactive.ticket != ticket) 976 return (0); 977 while ((rule = TAILQ_FIRST(rs->rules[rs_num].inactive.ptr)) != NULL) { 978 pf_unlink_rule(rs->rules[rs_num].inactive.ptr, rule); 979 rs->rules[rs_num].inactive.rcount--; 980 } 981 rs->rules[rs_num].inactive.open = 0; 982 return (0); 983 } 984 985 #define PF_MD5_UPD(st, elm) \ 986 MD5Update(ctx, (u_int8_t *) &(st)->elm, sizeof((st)->elm)) 987 988 #define PF_MD5_UPD_STR(st, elm) \ 989 MD5Update(ctx, (u_int8_t *) (st)->elm, strlen((st)->elm)) 990 991 #define PF_MD5_UPD_HTONL(st, elm, stor) do { \ 992 (stor) = htonl((st)->elm); \ 993 MD5Update(ctx, (u_int8_t *) &(stor), sizeof(u_int32_t));\ 994 } while (0) 995 996 #define PF_MD5_UPD_HTONS(st, elm, stor) do { \ 997 (stor) = htons((st)->elm); \ 998 MD5Update(ctx, (u_int8_t *) &(stor), sizeof(u_int16_t));\ 999 } while (0) 1000 1001 static void 1002 pf_hash_rule_addr(MD5_CTX *ctx, struct pf_rule_addr *pfr) 1003 { 1004 PF_MD5_UPD(pfr, addr.type); 1005 switch (pfr->addr.type) { 1006 case PF_ADDR_DYNIFTL: 1007 PF_MD5_UPD(pfr, addr.v.ifname); 1008 PF_MD5_UPD(pfr, addr.iflags); 1009 break; 1010 case PF_ADDR_TABLE: 1011 PF_MD5_UPD(pfr, addr.v.tblname); 1012 break; 1013 case PF_ADDR_ADDRMASK: 1014 /* XXX ignore af? */ 1015 PF_MD5_UPD(pfr, addr.v.a.addr.addr32); 1016 PF_MD5_UPD(pfr, addr.v.a.mask.addr32); 1017 break; 1018 } 1019 1020 PF_MD5_UPD(pfr, port[0]); 1021 PF_MD5_UPD(pfr, port[1]); 1022 PF_MD5_UPD(pfr, neg); 1023 PF_MD5_UPD(pfr, port_op); 1024 } 1025 1026 static void 1027 pf_hash_rule(MD5_CTX *ctx, struct pf_krule *rule) 1028 { 1029 u_int16_t x; 1030 u_int32_t y; 1031 1032 pf_hash_rule_addr(ctx, &rule->src); 1033 pf_hash_rule_addr(ctx, &rule->dst); 1034 for (int i = 0; i < PF_RULE_MAX_LABEL_COUNT; i++) 1035 PF_MD5_UPD_STR(rule, label[i]); 1036 PF_MD5_UPD_STR(rule, ifname); 1037 PF_MD5_UPD_STR(rule, match_tagname); 1038 PF_MD5_UPD_HTONS(rule, match_tag, x); /* dup? */ 1039 PF_MD5_UPD_HTONL(rule, os_fingerprint, y); 1040 PF_MD5_UPD_HTONL(rule, prob, y); 1041 PF_MD5_UPD_HTONL(rule, uid.uid[0], y); 1042 PF_MD5_UPD_HTONL(rule, uid.uid[1], y); 1043 PF_MD5_UPD(rule, uid.op); 1044 PF_MD5_UPD_HTONL(rule, gid.gid[0], y); 1045 PF_MD5_UPD_HTONL(rule, gid.gid[1], y); 1046 PF_MD5_UPD(rule, gid.op); 1047 PF_MD5_UPD_HTONL(rule, rule_flag, y); 1048 PF_MD5_UPD(rule, action); 1049 PF_MD5_UPD(rule, direction); 1050 PF_MD5_UPD(rule, af); 1051 PF_MD5_UPD(rule, quick); 1052 PF_MD5_UPD(rule, ifnot); 1053 PF_MD5_UPD(rule, match_tag_not); 1054 PF_MD5_UPD(rule, natpass); 1055 PF_MD5_UPD(rule, keep_state); 1056 PF_MD5_UPD(rule, proto); 1057 PF_MD5_UPD(rule, type); 1058 PF_MD5_UPD(rule, code); 1059 PF_MD5_UPD(rule, flags); 1060 PF_MD5_UPD(rule, flagset); 1061 PF_MD5_UPD(rule, allow_opts); 1062 PF_MD5_UPD(rule, rt); 1063 PF_MD5_UPD(rule, tos); 1064 } 1065 1066 static bool 1067 pf_krule_compare(struct pf_krule *a, struct pf_krule *b) 1068 { 1069 MD5_CTX ctx[2]; 1070 u_int8_t digest[2][PF_MD5_DIGEST_LENGTH]; 1071 1072 MD5Init(&ctx[0]); 1073 MD5Init(&ctx[1]); 1074 pf_hash_rule(&ctx[0], a); 1075 pf_hash_rule(&ctx[1], b); 1076 MD5Final(digest[0], &ctx[0]); 1077 MD5Final(digest[1], &ctx[1]); 1078 1079 return (memcmp(digest[0], digest[1], PF_MD5_DIGEST_LENGTH) == 0); 1080 } 1081 1082 static int 1083 pf_commit_rules(u_int32_t ticket, int rs_num, char *anchor) 1084 { 1085 struct pf_kruleset *rs; 1086 struct pf_krule *rule, **old_array, *tail; 1087 struct pf_krulequeue *old_rules; 1088 int error; 1089 u_int32_t old_rcount; 1090 1091 PF_RULES_WASSERT(); 1092 1093 if (rs_num < 0 || rs_num >= PF_RULESET_MAX) 1094 return (EINVAL); 1095 rs = pf_find_kruleset(anchor); 1096 if (rs == NULL || !rs->rules[rs_num].inactive.open || 1097 ticket != rs->rules[rs_num].inactive.ticket) 1098 return (EBUSY); 1099 1100 /* Calculate checksum for the main ruleset */ 1101 if (rs == &pf_main_ruleset) { 1102 error = pf_setup_pfsync_matching(rs); 1103 if (error != 0) 1104 return (error); 1105 } 1106 1107 /* Swap rules, keep the old. */ 1108 old_rules = rs->rules[rs_num].active.ptr; 1109 old_rcount = rs->rules[rs_num].active.rcount; 1110 old_array = rs->rules[rs_num].active.ptr_array; 1111 1112 rs->rules[rs_num].active.ptr = 1113 rs->rules[rs_num].inactive.ptr; 1114 rs->rules[rs_num].active.ptr_array = 1115 rs->rules[rs_num].inactive.ptr_array; 1116 rs->rules[rs_num].active.rcount = 1117 rs->rules[rs_num].inactive.rcount; 1118 1119 /* Attempt to preserve counter information. */ 1120 if (V_pf_status.keep_counters) { 1121 TAILQ_FOREACH(rule, rs->rules[rs_num].active.ptr, 1122 entries) { 1123 tail = TAILQ_FIRST(old_rules); 1124 while ((tail != NULL) && ! pf_krule_compare(tail, rule)) 1125 tail = TAILQ_NEXT(tail, entries); 1126 if (tail != NULL) { 1127 pf_counter_u64_critical_enter(); 1128 pf_counter_u64_add_protected(&rule->evaluations, 1129 pf_counter_u64_fetch(&tail->evaluations)); 1130 pf_counter_u64_add_protected(&rule->packets[0], 1131 pf_counter_u64_fetch(&tail->packets[0])); 1132 pf_counter_u64_add_protected(&rule->packets[1], 1133 pf_counter_u64_fetch(&tail->packets[1])); 1134 pf_counter_u64_add_protected(&rule->bytes[0], 1135 pf_counter_u64_fetch(&tail->bytes[0])); 1136 pf_counter_u64_add_protected(&rule->bytes[1], 1137 pf_counter_u64_fetch(&tail->bytes[1])); 1138 pf_counter_u64_critical_exit(); 1139 } 1140 } 1141 } 1142 1143 rs->rules[rs_num].inactive.ptr = old_rules; 1144 rs->rules[rs_num].inactive.ptr_array = old_array; 1145 rs->rules[rs_num].inactive.rcount = old_rcount; 1146 1147 rs->rules[rs_num].active.ticket = 1148 rs->rules[rs_num].inactive.ticket; 1149 pf_calc_skip_steps(rs->rules[rs_num].active.ptr); 1150 1151 /* Purge the old rule list. */ 1152 while ((rule = TAILQ_FIRST(old_rules)) != NULL) 1153 pf_unlink_rule(old_rules, rule); 1154 if (rs->rules[rs_num].inactive.ptr_array) 1155 free(rs->rules[rs_num].inactive.ptr_array, M_TEMP); 1156 rs->rules[rs_num].inactive.ptr_array = NULL; 1157 rs->rules[rs_num].inactive.rcount = 0; 1158 rs->rules[rs_num].inactive.open = 0; 1159 pf_remove_if_empty_kruleset(rs); 1160 1161 return (0); 1162 } 1163 1164 static int 1165 pf_setup_pfsync_matching(struct pf_kruleset *rs) 1166 { 1167 MD5_CTX ctx; 1168 struct pf_krule *rule; 1169 int rs_cnt; 1170 u_int8_t digest[PF_MD5_DIGEST_LENGTH]; 1171 1172 MD5Init(&ctx); 1173 for (rs_cnt = 0; rs_cnt < PF_RULESET_MAX; rs_cnt++) { 1174 /* XXX PF_RULESET_SCRUB as well? */ 1175 if (rs_cnt == PF_RULESET_SCRUB) 1176 continue; 1177 1178 if (rs->rules[rs_cnt].inactive.ptr_array) 1179 free(rs->rules[rs_cnt].inactive.ptr_array, M_TEMP); 1180 rs->rules[rs_cnt].inactive.ptr_array = NULL; 1181 1182 if (rs->rules[rs_cnt].inactive.rcount) { 1183 rs->rules[rs_cnt].inactive.ptr_array = 1184 malloc(sizeof(caddr_t) * 1185 rs->rules[rs_cnt].inactive.rcount, 1186 M_TEMP, M_NOWAIT); 1187 1188 if (!rs->rules[rs_cnt].inactive.ptr_array) 1189 return (ENOMEM); 1190 } 1191 1192 TAILQ_FOREACH(rule, rs->rules[rs_cnt].inactive.ptr, 1193 entries) { 1194 pf_hash_rule(&ctx, rule); 1195 (rs->rules[rs_cnt].inactive.ptr_array)[rule->nr] = rule; 1196 } 1197 } 1198 1199 MD5Final(digest, &ctx); 1200 memcpy(V_pf_status.pf_chksum, digest, sizeof(V_pf_status.pf_chksum)); 1201 return (0); 1202 } 1203 1204 static int 1205 pf_addr_setup(struct pf_kruleset *ruleset, struct pf_addr_wrap *addr, 1206 sa_family_t af) 1207 { 1208 int error = 0; 1209 1210 switch (addr->type) { 1211 case PF_ADDR_TABLE: 1212 addr->p.tbl = pfr_attach_table(ruleset, addr->v.tblname); 1213 if (addr->p.tbl == NULL) 1214 error = ENOMEM; 1215 break; 1216 case PF_ADDR_DYNIFTL: 1217 error = pfi_dynaddr_setup(addr, af); 1218 break; 1219 } 1220 1221 return (error); 1222 } 1223 1224 static void 1225 pf_addr_copyout(struct pf_addr_wrap *addr) 1226 { 1227 1228 switch (addr->type) { 1229 case PF_ADDR_DYNIFTL: 1230 pfi_dynaddr_copyout(addr); 1231 break; 1232 case PF_ADDR_TABLE: 1233 pf_tbladdr_copyout(addr); 1234 break; 1235 } 1236 } 1237 1238 static void 1239 pf_src_node_copy(const struct pf_ksrc_node *in, struct pf_src_node *out) 1240 { 1241 int secs = time_uptime, diff; 1242 1243 bzero(out, sizeof(struct pf_src_node)); 1244 1245 bcopy(&in->addr, &out->addr, sizeof(struct pf_addr)); 1246 bcopy(&in->raddr, &out->raddr, sizeof(struct pf_addr)); 1247 1248 if (in->rule.ptr != NULL) 1249 out->rule.nr = in->rule.ptr->nr; 1250 1251 for (int i = 0; i < 2; i++) { 1252 out->bytes[i] = counter_u64_fetch(in->bytes[i]); 1253 out->packets[i] = counter_u64_fetch(in->packets[i]); 1254 } 1255 1256 out->states = in->states; 1257 out->conn = in->conn; 1258 out->af = in->af; 1259 out->ruletype = in->ruletype; 1260 1261 out->creation = secs - in->creation; 1262 if (out->expire > secs) 1263 out->expire -= secs; 1264 else 1265 out->expire = 0; 1266 1267 /* Adjust the connection rate estimate. */ 1268 diff = secs - in->conn_rate.last; 1269 if (diff >= in->conn_rate.seconds) 1270 out->conn_rate.count = 0; 1271 else 1272 out->conn_rate.count -= 1273 in->conn_rate.count * diff / 1274 in->conn_rate.seconds; 1275 } 1276 1277 #ifdef ALTQ 1278 /* 1279 * Handle export of struct pf_kaltq to user binaries that may be using any 1280 * version of struct pf_altq. 1281 */ 1282 static int 1283 pf_export_kaltq(struct pf_altq *q, struct pfioc_altq_v1 *pa, size_t ioc_size) 1284 { 1285 u_int32_t version; 1286 1287 if (ioc_size == sizeof(struct pfioc_altq_v0)) 1288 version = 0; 1289 else 1290 version = pa->version; 1291 1292 if (version > PFIOC_ALTQ_VERSION) 1293 return (EINVAL); 1294 1295 #define ASSIGN(x) exported_q->x = q->x 1296 #define COPY(x) \ 1297 bcopy(&q->x, &exported_q->x, min(sizeof(q->x), sizeof(exported_q->x))) 1298 #define SATU16(x) (u_int32_t)uqmin((x), USHRT_MAX) 1299 #define SATU32(x) (u_int32_t)uqmin((x), UINT_MAX) 1300 1301 switch (version) { 1302 case 0: { 1303 struct pf_altq_v0 *exported_q = 1304 &((struct pfioc_altq_v0 *)pa)->altq; 1305 1306 COPY(ifname); 1307 1308 ASSIGN(scheduler); 1309 ASSIGN(tbrsize); 1310 exported_q->tbrsize = SATU16(q->tbrsize); 1311 exported_q->ifbandwidth = SATU32(q->ifbandwidth); 1312 1313 COPY(qname); 1314 COPY(parent); 1315 ASSIGN(parent_qid); 1316 exported_q->bandwidth = SATU32(q->bandwidth); 1317 ASSIGN(priority); 1318 ASSIGN(local_flags); 1319 1320 ASSIGN(qlimit); 1321 ASSIGN(flags); 1322 1323 if (q->scheduler == ALTQT_HFSC) { 1324 #define ASSIGN_OPT(x) exported_q->pq_u.hfsc_opts.x = q->pq_u.hfsc_opts.x 1325 #define ASSIGN_OPT_SATU32(x) exported_q->pq_u.hfsc_opts.x = \ 1326 SATU32(q->pq_u.hfsc_opts.x) 1327 1328 ASSIGN_OPT_SATU32(rtsc_m1); 1329 ASSIGN_OPT(rtsc_d); 1330 ASSIGN_OPT_SATU32(rtsc_m2); 1331 1332 ASSIGN_OPT_SATU32(lssc_m1); 1333 ASSIGN_OPT(lssc_d); 1334 ASSIGN_OPT_SATU32(lssc_m2); 1335 1336 ASSIGN_OPT_SATU32(ulsc_m1); 1337 ASSIGN_OPT(ulsc_d); 1338 ASSIGN_OPT_SATU32(ulsc_m2); 1339 1340 ASSIGN_OPT(flags); 1341 1342 #undef ASSIGN_OPT 1343 #undef ASSIGN_OPT_SATU32 1344 } else 1345 COPY(pq_u); 1346 1347 ASSIGN(qid); 1348 break; 1349 } 1350 case 1: { 1351 struct pf_altq_v1 *exported_q = 1352 &((struct pfioc_altq_v1 *)pa)->altq; 1353 1354 COPY(ifname); 1355 1356 ASSIGN(scheduler); 1357 ASSIGN(tbrsize); 1358 ASSIGN(ifbandwidth); 1359 1360 COPY(qname); 1361 COPY(parent); 1362 ASSIGN(parent_qid); 1363 ASSIGN(bandwidth); 1364 ASSIGN(priority); 1365 ASSIGN(local_flags); 1366 1367 ASSIGN(qlimit); 1368 ASSIGN(flags); 1369 COPY(pq_u); 1370 1371 ASSIGN(qid); 1372 break; 1373 } 1374 default: 1375 panic("%s: unhandled struct pfioc_altq version", __func__); 1376 break; 1377 } 1378 1379 #undef ASSIGN 1380 #undef COPY 1381 #undef SATU16 1382 #undef SATU32 1383 1384 return (0); 1385 } 1386 1387 /* 1388 * Handle import to struct pf_kaltq of struct pf_altq from user binaries 1389 * that may be using any version of it. 1390 */ 1391 static int 1392 pf_import_kaltq(struct pfioc_altq_v1 *pa, struct pf_altq *q, size_t ioc_size) 1393 { 1394 u_int32_t version; 1395 1396 if (ioc_size == sizeof(struct pfioc_altq_v0)) 1397 version = 0; 1398 else 1399 version = pa->version; 1400 1401 if (version > PFIOC_ALTQ_VERSION) 1402 return (EINVAL); 1403 1404 #define ASSIGN(x) q->x = imported_q->x 1405 #define COPY(x) \ 1406 bcopy(&imported_q->x, &q->x, min(sizeof(imported_q->x), sizeof(q->x))) 1407 1408 switch (version) { 1409 case 0: { 1410 struct pf_altq_v0 *imported_q = 1411 &((struct pfioc_altq_v0 *)pa)->altq; 1412 1413 COPY(ifname); 1414 1415 ASSIGN(scheduler); 1416 ASSIGN(tbrsize); /* 16-bit -> 32-bit */ 1417 ASSIGN(ifbandwidth); /* 32-bit -> 64-bit */ 1418 1419 COPY(qname); 1420 COPY(parent); 1421 ASSIGN(parent_qid); 1422 ASSIGN(bandwidth); /* 32-bit -> 64-bit */ 1423 ASSIGN(priority); 1424 ASSIGN(local_flags); 1425 1426 ASSIGN(qlimit); 1427 ASSIGN(flags); 1428 1429 if (imported_q->scheduler == ALTQT_HFSC) { 1430 #define ASSIGN_OPT(x) q->pq_u.hfsc_opts.x = imported_q->pq_u.hfsc_opts.x 1431 1432 /* 1433 * The m1 and m2 parameters are being copied from 1434 * 32-bit to 64-bit. 1435 */ 1436 ASSIGN_OPT(rtsc_m1); 1437 ASSIGN_OPT(rtsc_d); 1438 ASSIGN_OPT(rtsc_m2); 1439 1440 ASSIGN_OPT(lssc_m1); 1441 ASSIGN_OPT(lssc_d); 1442 ASSIGN_OPT(lssc_m2); 1443 1444 ASSIGN_OPT(ulsc_m1); 1445 ASSIGN_OPT(ulsc_d); 1446 ASSIGN_OPT(ulsc_m2); 1447 1448 ASSIGN_OPT(flags); 1449 1450 #undef ASSIGN_OPT 1451 } else 1452 COPY(pq_u); 1453 1454 ASSIGN(qid); 1455 break; 1456 } 1457 case 1: { 1458 struct pf_altq_v1 *imported_q = 1459 &((struct pfioc_altq_v1 *)pa)->altq; 1460 1461 COPY(ifname); 1462 1463 ASSIGN(scheduler); 1464 ASSIGN(tbrsize); 1465 ASSIGN(ifbandwidth); 1466 1467 COPY(qname); 1468 COPY(parent); 1469 ASSIGN(parent_qid); 1470 ASSIGN(bandwidth); 1471 ASSIGN(priority); 1472 ASSIGN(local_flags); 1473 1474 ASSIGN(qlimit); 1475 ASSIGN(flags); 1476 COPY(pq_u); 1477 1478 ASSIGN(qid); 1479 break; 1480 } 1481 default: 1482 panic("%s: unhandled struct pfioc_altq version", __func__); 1483 break; 1484 } 1485 1486 #undef ASSIGN 1487 #undef COPY 1488 1489 return (0); 1490 } 1491 1492 static struct pf_altq * 1493 pf_altq_get_nth_active(u_int32_t n) 1494 { 1495 struct pf_altq *altq; 1496 u_int32_t nr; 1497 1498 nr = 0; 1499 TAILQ_FOREACH(altq, V_pf_altq_ifs_active, entries) { 1500 if (nr == n) 1501 return (altq); 1502 nr++; 1503 } 1504 1505 TAILQ_FOREACH(altq, V_pf_altqs_active, entries) { 1506 if (nr == n) 1507 return (altq); 1508 nr++; 1509 } 1510 1511 return (NULL); 1512 } 1513 #endif /* ALTQ */ 1514 1515 void 1516 pf_krule_free(struct pf_krule *rule) 1517 { 1518 #ifdef PF_WANT_32_TO_64_COUNTER 1519 bool wowned; 1520 #endif 1521 1522 if (rule == NULL) 1523 return; 1524 1525 #ifdef PF_WANT_32_TO_64_COUNTER 1526 if (rule->allrulelinked) { 1527 wowned = PF_RULES_WOWNED(); 1528 if (!wowned) 1529 PF_RULES_WLOCK(); 1530 LIST_REMOVE(rule, allrulelist); 1531 V_pf_allrulecount--; 1532 if (!wowned) 1533 PF_RULES_WUNLOCK(); 1534 } 1535 #endif 1536 1537 pf_counter_u64_deinit(&rule->evaluations); 1538 for (int i = 0; i < 2; i++) { 1539 pf_counter_u64_deinit(&rule->packets[i]); 1540 pf_counter_u64_deinit(&rule->bytes[i]); 1541 } 1542 counter_u64_free(rule->states_cur); 1543 counter_u64_free(rule->states_tot); 1544 counter_u64_free(rule->src_nodes); 1545 free(rule, M_PFRULE); 1546 } 1547 1548 static void 1549 pf_kpooladdr_to_pooladdr(const struct pf_kpooladdr *kpool, 1550 struct pf_pooladdr *pool) 1551 { 1552 1553 bzero(pool, sizeof(*pool)); 1554 bcopy(&kpool->addr, &pool->addr, sizeof(pool->addr)); 1555 strlcpy(pool->ifname, kpool->ifname, sizeof(pool->ifname)); 1556 } 1557 1558 static int 1559 pf_pooladdr_to_kpooladdr(const struct pf_pooladdr *pool, 1560 struct pf_kpooladdr *kpool) 1561 { 1562 int ret; 1563 1564 bzero(kpool, sizeof(*kpool)); 1565 bcopy(&pool->addr, &kpool->addr, sizeof(kpool->addr)); 1566 ret = pf_user_strcpy(kpool->ifname, pool->ifname, 1567 sizeof(kpool->ifname)); 1568 return (ret); 1569 } 1570 1571 static void 1572 pf_kpool_to_pool(const struct pf_kpool *kpool, struct pf_pool *pool) 1573 { 1574 bzero(pool, sizeof(*pool)); 1575 1576 bcopy(&kpool->key, &pool->key, sizeof(pool->key)); 1577 bcopy(&kpool->counter, &pool->counter, sizeof(pool->counter)); 1578 1579 pool->tblidx = kpool->tblidx; 1580 pool->proxy_port[0] = kpool->proxy_port[0]; 1581 pool->proxy_port[1] = kpool->proxy_port[1]; 1582 pool->opts = kpool->opts; 1583 } 1584 1585 static int 1586 pf_pool_to_kpool(const struct pf_pool *pool, struct pf_kpool *kpool) 1587 { 1588 _Static_assert(sizeof(pool->key) == sizeof(kpool->key), ""); 1589 _Static_assert(sizeof(pool->counter) == sizeof(kpool->counter), ""); 1590 1591 bzero(kpool, sizeof(*kpool)); 1592 1593 bcopy(&pool->key, &kpool->key, sizeof(kpool->key)); 1594 bcopy(&pool->counter, &kpool->counter, sizeof(kpool->counter)); 1595 1596 kpool->tblidx = pool->tblidx; 1597 kpool->proxy_port[0] = pool->proxy_port[0]; 1598 kpool->proxy_port[1] = pool->proxy_port[1]; 1599 kpool->opts = pool->opts; 1600 1601 return (0); 1602 } 1603 1604 static void 1605 pf_krule_to_rule(struct pf_krule *krule, struct pf_rule *rule) 1606 { 1607 1608 bzero(rule, sizeof(*rule)); 1609 1610 bcopy(&krule->src, &rule->src, sizeof(rule->src)); 1611 bcopy(&krule->dst, &rule->dst, sizeof(rule->dst)); 1612 1613 for (int i = 0; i < PF_SKIP_COUNT; ++i) { 1614 if (rule->skip[i].ptr == NULL) 1615 rule->skip[i].nr = -1; 1616 else 1617 rule->skip[i].nr = krule->skip[i].ptr->nr; 1618 } 1619 1620 strlcpy(rule->label, krule->label[0], sizeof(rule->label)); 1621 strlcpy(rule->ifname, krule->ifname, sizeof(rule->ifname)); 1622 strlcpy(rule->qname, krule->qname, sizeof(rule->qname)); 1623 strlcpy(rule->pqname, krule->pqname, sizeof(rule->pqname)); 1624 strlcpy(rule->tagname, krule->tagname, sizeof(rule->tagname)); 1625 strlcpy(rule->match_tagname, krule->match_tagname, 1626 sizeof(rule->match_tagname)); 1627 strlcpy(rule->overload_tblname, krule->overload_tblname, 1628 sizeof(rule->overload_tblname)); 1629 1630 pf_kpool_to_pool(&krule->rpool, &rule->rpool); 1631 1632 rule->evaluations = pf_counter_u64_fetch(&krule->evaluations); 1633 for (int i = 0; i < 2; i++) { 1634 rule->packets[i] = pf_counter_u64_fetch(&krule->packets[i]); 1635 rule->bytes[i] = pf_counter_u64_fetch(&krule->bytes[i]); 1636 } 1637 1638 /* kif, anchor, overload_tbl are not copied over. */ 1639 1640 rule->os_fingerprint = krule->os_fingerprint; 1641 1642 rule->rtableid = krule->rtableid; 1643 bcopy(krule->timeout, rule->timeout, sizeof(krule->timeout)); 1644 rule->max_states = krule->max_states; 1645 rule->max_src_nodes = krule->max_src_nodes; 1646 rule->max_src_states = krule->max_src_states; 1647 rule->max_src_conn = krule->max_src_conn; 1648 rule->max_src_conn_rate.limit = krule->max_src_conn_rate.limit; 1649 rule->max_src_conn_rate.seconds = krule->max_src_conn_rate.seconds; 1650 rule->qid = krule->qid; 1651 rule->pqid = krule->pqid; 1652 rule->nr = krule->nr; 1653 rule->prob = krule->prob; 1654 rule->cuid = krule->cuid; 1655 rule->cpid = krule->cpid; 1656 1657 rule->return_icmp = krule->return_icmp; 1658 rule->return_icmp6 = krule->return_icmp6; 1659 rule->max_mss = krule->max_mss; 1660 rule->tag = krule->tag; 1661 rule->match_tag = krule->match_tag; 1662 rule->scrub_flags = krule->scrub_flags; 1663 1664 bcopy(&krule->uid, &rule->uid, sizeof(krule->uid)); 1665 bcopy(&krule->gid, &rule->gid, sizeof(krule->gid)); 1666 1667 rule->rule_flag = krule->rule_flag; 1668 rule->action = krule->action; 1669 rule->direction = krule->direction; 1670 rule->log = krule->log; 1671 rule->logif = krule->logif; 1672 rule->quick = krule->quick; 1673 rule->ifnot = krule->ifnot; 1674 rule->match_tag_not = krule->match_tag_not; 1675 rule->natpass = krule->natpass; 1676 1677 rule->keep_state = krule->keep_state; 1678 rule->af = krule->af; 1679 rule->proto = krule->proto; 1680 rule->type = krule->type; 1681 rule->code = krule->code; 1682 rule->flags = krule->flags; 1683 rule->flagset = krule->flagset; 1684 rule->min_ttl = krule->min_ttl; 1685 rule->allow_opts = krule->allow_opts; 1686 rule->rt = krule->rt; 1687 rule->return_ttl = krule->return_ttl; 1688 rule->tos = krule->tos; 1689 rule->set_tos = krule->set_tos; 1690 rule->anchor_relative = krule->anchor_relative; 1691 rule->anchor_wildcard = krule->anchor_wildcard; 1692 1693 rule->flush = krule->flush; 1694 rule->prio = krule->prio; 1695 rule->set_prio[0] = krule->set_prio[0]; 1696 rule->set_prio[1] = krule->set_prio[1]; 1697 1698 bcopy(&krule->divert, &rule->divert, sizeof(krule->divert)); 1699 1700 rule->u_states_cur = counter_u64_fetch(krule->states_cur); 1701 rule->u_states_tot = counter_u64_fetch(krule->states_tot); 1702 rule->u_src_nodes = counter_u64_fetch(krule->src_nodes); 1703 } 1704 1705 static int 1706 pf_rule_to_krule(const struct pf_rule *rule, struct pf_krule *krule) 1707 { 1708 int ret; 1709 1710 #ifndef INET 1711 if (rule->af == AF_INET) { 1712 return (EAFNOSUPPORT); 1713 } 1714 #endif /* INET */ 1715 #ifndef INET6 1716 if (rule->af == AF_INET6) { 1717 return (EAFNOSUPPORT); 1718 } 1719 #endif /* INET6 */ 1720 1721 ret = pf_check_rule_addr(&rule->src); 1722 if (ret != 0) 1723 return (ret); 1724 ret = pf_check_rule_addr(&rule->dst); 1725 if (ret != 0) 1726 return (ret); 1727 1728 bzero(krule, sizeof(*krule)); 1729 1730 bcopy(&rule->src, &krule->src, sizeof(rule->src)); 1731 bcopy(&rule->dst, &krule->dst, sizeof(rule->dst)); 1732 1733 ret = pf_user_strcpy(krule->label[0], rule->label, sizeof(rule->label)); 1734 if (ret != 0) 1735 return (ret); 1736 ret = pf_user_strcpy(krule->ifname, rule->ifname, sizeof(rule->ifname)); 1737 if (ret != 0) 1738 return (ret); 1739 ret = pf_user_strcpy(krule->qname, rule->qname, sizeof(rule->qname)); 1740 if (ret != 0) 1741 return (ret); 1742 ret = pf_user_strcpy(krule->pqname, rule->pqname, sizeof(rule->pqname)); 1743 if (ret != 0) 1744 return (ret); 1745 ret = pf_user_strcpy(krule->tagname, rule->tagname, 1746 sizeof(rule->tagname)); 1747 if (ret != 0) 1748 return (ret); 1749 ret = pf_user_strcpy(krule->match_tagname, rule->match_tagname, 1750 sizeof(rule->match_tagname)); 1751 if (ret != 0) 1752 return (ret); 1753 ret = pf_user_strcpy(krule->overload_tblname, rule->overload_tblname, 1754 sizeof(rule->overload_tblname)); 1755 if (ret != 0) 1756 return (ret); 1757 1758 ret = pf_pool_to_kpool(&rule->rpool, &krule->rpool); 1759 if (ret != 0) 1760 return (ret); 1761 1762 /* Don't allow userspace to set evaulations, packets or bytes. */ 1763 /* kif, anchor, overload_tbl are not copied over. */ 1764 1765 krule->os_fingerprint = rule->os_fingerprint; 1766 1767 krule->rtableid = rule->rtableid; 1768 bcopy(rule->timeout, krule->timeout, sizeof(krule->timeout)); 1769 krule->max_states = rule->max_states; 1770 krule->max_src_nodes = rule->max_src_nodes; 1771 krule->max_src_states = rule->max_src_states; 1772 krule->max_src_conn = rule->max_src_conn; 1773 krule->max_src_conn_rate.limit = rule->max_src_conn_rate.limit; 1774 krule->max_src_conn_rate.seconds = rule->max_src_conn_rate.seconds; 1775 krule->qid = rule->qid; 1776 krule->pqid = rule->pqid; 1777 krule->nr = rule->nr; 1778 krule->prob = rule->prob; 1779 krule->cuid = rule->cuid; 1780 krule->cpid = rule->cpid; 1781 1782 krule->return_icmp = rule->return_icmp; 1783 krule->return_icmp6 = rule->return_icmp6; 1784 krule->max_mss = rule->max_mss; 1785 krule->tag = rule->tag; 1786 krule->match_tag = rule->match_tag; 1787 krule->scrub_flags = rule->scrub_flags; 1788 1789 bcopy(&rule->uid, &krule->uid, sizeof(krule->uid)); 1790 bcopy(&rule->gid, &krule->gid, sizeof(krule->gid)); 1791 1792 krule->rule_flag = rule->rule_flag; 1793 krule->action = rule->action; 1794 krule->direction = rule->direction; 1795 krule->log = rule->log; 1796 krule->logif = rule->logif; 1797 krule->quick = rule->quick; 1798 krule->ifnot = rule->ifnot; 1799 krule->match_tag_not = rule->match_tag_not; 1800 krule->natpass = rule->natpass; 1801 1802 krule->keep_state = rule->keep_state; 1803 krule->af = rule->af; 1804 krule->proto = rule->proto; 1805 krule->type = rule->type; 1806 krule->code = rule->code; 1807 krule->flags = rule->flags; 1808 krule->flagset = rule->flagset; 1809 krule->min_ttl = rule->min_ttl; 1810 krule->allow_opts = rule->allow_opts; 1811 krule->rt = rule->rt; 1812 krule->return_ttl = rule->return_ttl; 1813 krule->tos = rule->tos; 1814 krule->set_tos = rule->set_tos; 1815 krule->anchor_relative = rule->anchor_relative; 1816 krule->anchor_wildcard = rule->anchor_wildcard; 1817 1818 krule->flush = rule->flush; 1819 krule->prio = rule->prio; 1820 krule->set_prio[0] = rule->set_prio[0]; 1821 krule->set_prio[1] = rule->set_prio[1]; 1822 1823 bcopy(&rule->divert, &krule->divert, sizeof(krule->divert)); 1824 1825 return (0); 1826 } 1827 1828 static int 1829 pf_state_kill_to_kstate_kill(const struct pfioc_state_kill *psk, 1830 struct pf_kstate_kill *kill) 1831 { 1832 int ret; 1833 1834 bzero(kill, sizeof(*kill)); 1835 1836 bcopy(&psk->psk_pfcmp, &kill->psk_pfcmp, sizeof(kill->psk_pfcmp)); 1837 kill->psk_af = psk->psk_af; 1838 kill->psk_proto = psk->psk_proto; 1839 bcopy(&psk->psk_src, &kill->psk_src, sizeof(kill->psk_src)); 1840 bcopy(&psk->psk_dst, &kill->psk_dst, sizeof(kill->psk_dst)); 1841 ret = pf_user_strcpy(kill->psk_ifname, psk->psk_ifname, 1842 sizeof(kill->psk_ifname)); 1843 if (ret != 0) 1844 return (ret); 1845 ret = pf_user_strcpy(kill->psk_label, psk->psk_label, 1846 sizeof(kill->psk_label)); 1847 if (ret != 0) 1848 return (ret); 1849 1850 return (0); 1851 } 1852 1853 static int 1854 pf_ioctl_addrule(struct pf_krule *rule, uint32_t ticket, 1855 uint32_t pool_ticket, const char *anchor, const char *anchor_call, 1856 struct thread *td) 1857 { 1858 struct pf_kruleset *ruleset; 1859 struct pf_krule *tail; 1860 struct pf_kpooladdr *pa; 1861 struct pfi_kkif *kif = NULL; 1862 int rs_num; 1863 int error = 0; 1864 1865 if ((rule->return_icmp >> 8) > ICMP_MAXTYPE) { 1866 error = EINVAL; 1867 goto errout_unlocked; 1868 } 1869 1870 #define ERROUT(x) ERROUT_FUNCTION(errout, x) 1871 1872 if (rule->ifname[0]) 1873 kif = pf_kkif_create(M_WAITOK); 1874 pf_counter_u64_init(&rule->evaluations, M_WAITOK); 1875 for (int i = 0; i < 2; i++) { 1876 pf_counter_u64_init(&rule->packets[i], M_WAITOK); 1877 pf_counter_u64_init(&rule->bytes[i], M_WAITOK); 1878 } 1879 rule->states_cur = counter_u64_alloc(M_WAITOK); 1880 rule->states_tot = counter_u64_alloc(M_WAITOK); 1881 rule->src_nodes = counter_u64_alloc(M_WAITOK); 1882 rule->cuid = td->td_ucred->cr_ruid; 1883 rule->cpid = td->td_proc ? td->td_proc->p_pid : 0; 1884 TAILQ_INIT(&rule->rpool.list); 1885 1886 PF_RULES_WLOCK(); 1887 #ifdef PF_WANT_32_TO_64_COUNTER 1888 LIST_INSERT_HEAD(&V_pf_allrulelist, rule, allrulelist); 1889 MPASS(!rule->allrulelinked); 1890 rule->allrulelinked = true; 1891 V_pf_allrulecount++; 1892 #endif 1893 ruleset = pf_find_kruleset(anchor); 1894 if (ruleset == NULL) 1895 ERROUT(EINVAL); 1896 rs_num = pf_get_ruleset_number(rule->action); 1897 if (rs_num >= PF_RULESET_MAX) 1898 ERROUT(EINVAL); 1899 if (ticket != ruleset->rules[rs_num].inactive.ticket) { 1900 DPFPRINTF(PF_DEBUG_MISC, 1901 ("ticket: %d != [%d]%d\n", ticket, rs_num, 1902 ruleset->rules[rs_num].inactive.ticket)); 1903 ERROUT(EBUSY); 1904 } 1905 if (pool_ticket != V_ticket_pabuf) { 1906 DPFPRINTF(PF_DEBUG_MISC, 1907 ("pool_ticket: %d != %d\n", pool_ticket, 1908 V_ticket_pabuf)); 1909 ERROUT(EBUSY); 1910 } 1911 1912 tail = TAILQ_LAST(ruleset->rules[rs_num].inactive.ptr, 1913 pf_krulequeue); 1914 if (tail) 1915 rule->nr = tail->nr + 1; 1916 else 1917 rule->nr = 0; 1918 if (rule->ifname[0]) { 1919 rule->kif = pfi_kkif_attach(kif, rule->ifname); 1920 kif = NULL; 1921 pfi_kkif_ref(rule->kif); 1922 } else 1923 rule->kif = NULL; 1924 1925 if (rule->rtableid > 0 && rule->rtableid >= rt_numfibs) 1926 error = EBUSY; 1927 1928 #ifdef ALTQ 1929 /* set queue IDs */ 1930 if (rule->qname[0] != 0) { 1931 if ((rule->qid = pf_qname2qid(rule->qname)) == 0) 1932 error = EBUSY; 1933 else if (rule->pqname[0] != 0) { 1934 if ((rule->pqid = 1935 pf_qname2qid(rule->pqname)) == 0) 1936 error = EBUSY; 1937 } else 1938 rule->pqid = rule->qid; 1939 } 1940 #endif 1941 if (rule->tagname[0]) 1942 if ((rule->tag = pf_tagname2tag(rule->tagname)) == 0) 1943 error = EBUSY; 1944 if (rule->match_tagname[0]) 1945 if ((rule->match_tag = 1946 pf_tagname2tag(rule->match_tagname)) == 0) 1947 error = EBUSY; 1948 if (rule->rt && !rule->direction) 1949 error = EINVAL; 1950 if (!rule->log) 1951 rule->logif = 0; 1952 if (rule->logif >= PFLOGIFS_MAX) 1953 error = EINVAL; 1954 if (pf_addr_setup(ruleset, &rule->src.addr, rule->af)) 1955 error = ENOMEM; 1956 if (pf_addr_setup(ruleset, &rule->dst.addr, rule->af)) 1957 error = ENOMEM; 1958 if (pf_kanchor_setup(rule, ruleset, anchor_call)) 1959 error = EINVAL; 1960 if (rule->scrub_flags & PFSTATE_SETPRIO && 1961 (rule->set_prio[0] > PF_PRIO_MAX || 1962 rule->set_prio[1] > PF_PRIO_MAX)) 1963 error = EINVAL; 1964 TAILQ_FOREACH(pa, &V_pf_pabuf, entries) 1965 if (pa->addr.type == PF_ADDR_TABLE) { 1966 pa->addr.p.tbl = pfr_attach_table(ruleset, 1967 pa->addr.v.tblname); 1968 if (pa->addr.p.tbl == NULL) 1969 error = ENOMEM; 1970 } 1971 1972 rule->overload_tbl = NULL; 1973 if (rule->overload_tblname[0]) { 1974 if ((rule->overload_tbl = pfr_attach_table(ruleset, 1975 rule->overload_tblname)) == NULL) 1976 error = EINVAL; 1977 else 1978 rule->overload_tbl->pfrkt_flags |= 1979 PFR_TFLAG_ACTIVE; 1980 } 1981 1982 pf_mv_kpool(&V_pf_pabuf, &rule->rpool.list); 1983 if (((((rule->action == PF_NAT) || (rule->action == PF_RDR) || 1984 (rule->action == PF_BINAT)) && rule->anchor == NULL) || 1985 (rule->rt > PF_NOPFROUTE)) && 1986 (TAILQ_FIRST(&rule->rpool.list) == NULL)) 1987 error = EINVAL; 1988 1989 if (error) { 1990 pf_free_rule(rule); 1991 rule = NULL; 1992 ERROUT(error); 1993 } 1994 1995 rule->rpool.cur = TAILQ_FIRST(&rule->rpool.list); 1996 pf_counter_u64_zero(&rule->evaluations); 1997 for (int i = 0; i < 2; i++) { 1998 pf_counter_u64_zero(&rule->packets[i]); 1999 pf_counter_u64_zero(&rule->bytes[i]); 2000 } 2001 TAILQ_INSERT_TAIL(ruleset->rules[rs_num].inactive.ptr, 2002 rule, entries); 2003 ruleset->rules[rs_num].inactive.rcount++; 2004 PF_RULES_WUNLOCK(); 2005 2006 return (0); 2007 2008 #undef ERROUT 2009 errout: 2010 PF_RULES_WUNLOCK(); 2011 errout_unlocked: 2012 pf_kkif_free(kif); 2013 pf_krule_free(rule); 2014 return (error); 2015 } 2016 2017 static bool 2018 pf_label_match(const struct pf_krule *rule, const char *label) 2019 { 2020 int i = 0; 2021 2022 while (*rule->label[i]) { 2023 if (strcmp(rule->label[i], label) == 0) 2024 return (true); 2025 i++; 2026 } 2027 2028 return (false); 2029 } 2030 2031 static unsigned int 2032 pf_kill_matching_state(struct pf_state_key_cmp *key, int dir) 2033 { 2034 struct pf_kstate *match; 2035 int more = 0; 2036 unsigned int killed = 0; 2037 2038 /* Call with unlocked hashrow */ 2039 2040 match = pf_find_state_all(key, dir, &more); 2041 if (match && !more) { 2042 pf_unlink_state(match, 0); 2043 killed++; 2044 } 2045 2046 return (killed); 2047 } 2048 2049 static int 2050 pf_killstates_row(struct pf_kstate_kill *psk, struct pf_idhash *ih) 2051 { 2052 struct pf_kstate *s; 2053 struct pf_state_key *sk; 2054 struct pf_addr *srcaddr, *dstaddr; 2055 struct pf_state_key_cmp match_key; 2056 int idx, killed = 0; 2057 unsigned int dir; 2058 u_int16_t srcport, dstport; 2059 struct pfi_kkif *kif; 2060 2061 relock_DIOCKILLSTATES: 2062 PF_HASHROW_LOCK(ih); 2063 LIST_FOREACH(s, &ih->states, entry) { 2064 /* For floating states look at the original kif. */ 2065 kif = s->kif == V_pfi_all ? s->orig_kif : s->kif; 2066 2067 sk = s->key[PF_SK_WIRE]; 2068 if (s->direction == PF_OUT) { 2069 srcaddr = &sk->addr[1]; 2070 dstaddr = &sk->addr[0]; 2071 srcport = sk->port[1]; 2072 dstport = sk->port[0]; 2073 } else { 2074 srcaddr = &sk->addr[0]; 2075 dstaddr = &sk->addr[1]; 2076 srcport = sk->port[0]; 2077 dstport = sk->port[1]; 2078 } 2079 2080 if (psk->psk_af && sk->af != psk->psk_af) 2081 continue; 2082 2083 if (psk->psk_proto && psk->psk_proto != sk->proto) 2084 continue; 2085 2086 if (! PF_MATCHA(psk->psk_src.neg, &psk->psk_src.addr.v.a.addr, 2087 &psk->psk_src.addr.v.a.mask, srcaddr, sk->af)) 2088 continue; 2089 2090 if (! PF_MATCHA(psk->psk_dst.neg, &psk->psk_dst.addr.v.a.addr, 2091 &psk->psk_dst.addr.v.a.mask, dstaddr, sk->af)) 2092 continue; 2093 2094 if (! PF_MATCHA(psk->psk_rt_addr.neg, 2095 &psk->psk_rt_addr.addr.v.a.addr, 2096 &psk->psk_rt_addr.addr.v.a.mask, 2097 &s->rt_addr, sk->af)) 2098 continue; 2099 2100 if (psk->psk_src.port_op != 0 && 2101 ! pf_match_port(psk->psk_src.port_op, 2102 psk->psk_src.port[0], psk->psk_src.port[1], srcport)) 2103 continue; 2104 2105 if (psk->psk_dst.port_op != 0 && 2106 ! pf_match_port(psk->psk_dst.port_op, 2107 psk->psk_dst.port[0], psk->psk_dst.port[1], dstport)) 2108 continue; 2109 2110 if (psk->psk_label[0] && 2111 ! pf_label_match(s->rule.ptr, psk->psk_label)) 2112 continue; 2113 2114 if (psk->psk_ifname[0] && strcmp(psk->psk_ifname, 2115 kif->pfik_name)) 2116 continue; 2117 2118 if (psk->psk_kill_match) { 2119 /* Create the key to find matching states, with lock 2120 * held. */ 2121 2122 bzero(&match_key, sizeof(match_key)); 2123 2124 if (s->direction == PF_OUT) { 2125 dir = PF_IN; 2126 idx = PF_SK_STACK; 2127 } else { 2128 dir = PF_OUT; 2129 idx = PF_SK_WIRE; 2130 } 2131 2132 match_key.af = s->key[idx]->af; 2133 match_key.proto = s->key[idx]->proto; 2134 PF_ACPY(&match_key.addr[0], 2135 &s->key[idx]->addr[1], match_key.af); 2136 match_key.port[0] = s->key[idx]->port[1]; 2137 PF_ACPY(&match_key.addr[1], 2138 &s->key[idx]->addr[0], match_key.af); 2139 match_key.port[1] = s->key[idx]->port[0]; 2140 } 2141 2142 pf_unlink_state(s, PF_ENTER_LOCKED); 2143 killed++; 2144 2145 if (psk->psk_kill_match) 2146 killed += pf_kill_matching_state(&match_key, dir); 2147 2148 goto relock_DIOCKILLSTATES; 2149 } 2150 PF_HASHROW_UNLOCK(ih); 2151 2152 return (killed); 2153 } 2154 2155 static int 2156 pfioctl(struct cdev *dev, u_long cmd, caddr_t addr, int flags, struct thread *td) 2157 { 2158 int error = 0; 2159 PF_RULES_RLOCK_TRACKER; 2160 2161 #define ERROUT_IOCTL(target, x) \ 2162 do { \ 2163 error = (x); \ 2164 SDT_PROBE3(pf, ioctl, ioctl, error, cmd, error, __LINE__); \ 2165 goto target; \ 2166 } while (0) 2167 2168 2169 /* XXX keep in sync with switch() below */ 2170 if (securelevel_gt(td->td_ucred, 2)) 2171 switch (cmd) { 2172 case DIOCGETRULES: 2173 case DIOCGETRULE: 2174 case DIOCGETRULENV: 2175 case DIOCGETADDRS: 2176 case DIOCGETADDR: 2177 case DIOCGETSTATE: 2178 case DIOCGETSTATENV: 2179 case DIOCSETSTATUSIF: 2180 case DIOCGETSTATUS: 2181 case DIOCGETSTATUSNV: 2182 case DIOCCLRSTATUS: 2183 case DIOCNATLOOK: 2184 case DIOCSETDEBUG: 2185 case DIOCGETSTATES: 2186 case DIOCGETSTATESV2: 2187 case DIOCGETTIMEOUT: 2188 case DIOCCLRRULECTRS: 2189 case DIOCGETLIMIT: 2190 case DIOCGETALTQSV0: 2191 case DIOCGETALTQSV1: 2192 case DIOCGETALTQV0: 2193 case DIOCGETALTQV1: 2194 case DIOCGETQSTATSV0: 2195 case DIOCGETQSTATSV1: 2196 case DIOCGETRULESETS: 2197 case DIOCGETRULESET: 2198 case DIOCRGETTABLES: 2199 case DIOCRGETTSTATS: 2200 case DIOCRCLRTSTATS: 2201 case DIOCRCLRADDRS: 2202 case DIOCRADDADDRS: 2203 case DIOCRDELADDRS: 2204 case DIOCRSETADDRS: 2205 case DIOCRGETADDRS: 2206 case DIOCRGETASTATS: 2207 case DIOCRCLRASTATS: 2208 case DIOCRTSTADDRS: 2209 case DIOCOSFPGET: 2210 case DIOCGETSRCNODES: 2211 case DIOCCLRSRCNODES: 2212 case DIOCGETSYNCOOKIES: 2213 case DIOCIGETIFACES: 2214 case DIOCGIFSPEEDV0: 2215 case DIOCGIFSPEEDV1: 2216 case DIOCSETIFFLAG: 2217 case DIOCCLRIFFLAG: 2218 break; 2219 case DIOCRCLRTABLES: 2220 case DIOCRADDTABLES: 2221 case DIOCRDELTABLES: 2222 case DIOCRSETTFLAGS: 2223 if (((struct pfioc_table *)addr)->pfrio_flags & 2224 PFR_FLAG_DUMMY) 2225 break; /* dummy operation ok */ 2226 return (EPERM); 2227 default: 2228 return (EPERM); 2229 } 2230 2231 if (!(flags & FWRITE)) 2232 switch (cmd) { 2233 case DIOCGETRULES: 2234 case DIOCGETADDRS: 2235 case DIOCGETADDR: 2236 case DIOCGETSTATE: 2237 case DIOCGETSTATENV: 2238 case DIOCGETSTATUS: 2239 case DIOCGETSTATUSNV: 2240 case DIOCGETSTATES: 2241 case DIOCGETSTATESV2: 2242 case DIOCGETTIMEOUT: 2243 case DIOCGETLIMIT: 2244 case DIOCGETALTQSV0: 2245 case DIOCGETALTQSV1: 2246 case DIOCGETALTQV0: 2247 case DIOCGETALTQV1: 2248 case DIOCGETQSTATSV0: 2249 case DIOCGETQSTATSV1: 2250 case DIOCGETRULESETS: 2251 case DIOCGETRULESET: 2252 case DIOCNATLOOK: 2253 case DIOCRGETTABLES: 2254 case DIOCRGETTSTATS: 2255 case DIOCRGETADDRS: 2256 case DIOCRGETASTATS: 2257 case DIOCRTSTADDRS: 2258 case DIOCOSFPGET: 2259 case DIOCGETSRCNODES: 2260 case DIOCGETSYNCOOKIES: 2261 case DIOCIGETIFACES: 2262 case DIOCGIFSPEEDV1: 2263 case DIOCGIFSPEEDV0: 2264 case DIOCGETRULENV: 2265 break; 2266 case DIOCRCLRTABLES: 2267 case DIOCRADDTABLES: 2268 case DIOCRDELTABLES: 2269 case DIOCRCLRTSTATS: 2270 case DIOCRCLRADDRS: 2271 case DIOCRADDADDRS: 2272 case DIOCRDELADDRS: 2273 case DIOCRSETADDRS: 2274 case DIOCRSETTFLAGS: 2275 if (((struct pfioc_table *)addr)->pfrio_flags & 2276 PFR_FLAG_DUMMY) { 2277 flags |= FWRITE; /* need write lock for dummy */ 2278 break; /* dummy operation ok */ 2279 } 2280 return (EACCES); 2281 case DIOCGETRULE: 2282 if (((struct pfioc_rule *)addr)->action == 2283 PF_GET_CLR_CNTR) 2284 return (EACCES); 2285 break; 2286 default: 2287 return (EACCES); 2288 } 2289 2290 CURVNET_SET(TD_TO_VNET(td)); 2291 2292 switch (cmd) { 2293 case DIOCSTART: 2294 sx_xlock(&pf_ioctl_lock); 2295 if (V_pf_status.running) 2296 error = EEXIST; 2297 else { 2298 int cpu; 2299 2300 hook_pf(); 2301 V_pf_status.running = 1; 2302 V_pf_status.since = time_second; 2303 2304 CPU_FOREACH(cpu) 2305 V_pf_stateid[cpu] = time_second; 2306 2307 DPFPRINTF(PF_DEBUG_MISC, ("pf: started\n")); 2308 } 2309 break; 2310 2311 case DIOCSTOP: 2312 sx_xlock(&pf_ioctl_lock); 2313 if (!V_pf_status.running) 2314 error = ENOENT; 2315 else { 2316 V_pf_status.running = 0; 2317 dehook_pf(); 2318 V_pf_status.since = time_second; 2319 DPFPRINTF(PF_DEBUG_MISC, ("pf: stopped\n")); 2320 } 2321 break; 2322 2323 case DIOCADDRULENV: { 2324 struct pfioc_nv *nv = (struct pfioc_nv *)addr; 2325 nvlist_t *nvl = NULL; 2326 void *nvlpacked = NULL; 2327 struct pf_krule *rule = NULL; 2328 const char *anchor = "", *anchor_call = ""; 2329 uint32_t ticket = 0, pool_ticket = 0; 2330 2331 #define ERROUT(x) ERROUT_IOCTL(DIOCADDRULENV_error, x) 2332 2333 if (nv->len > pf_ioctl_maxcount) 2334 ERROUT(ENOMEM); 2335 2336 nvlpacked = malloc(nv->len, M_TEMP, M_WAITOK); 2337 error = copyin(nv->data, nvlpacked, nv->len); 2338 if (error) 2339 ERROUT(error); 2340 2341 nvl = nvlist_unpack(nvlpacked, nv->len, 0); 2342 if (nvl == NULL) 2343 ERROUT(EBADMSG); 2344 2345 if (! nvlist_exists_number(nvl, "ticket")) 2346 ERROUT(EINVAL); 2347 ticket = nvlist_get_number(nvl, "ticket"); 2348 2349 if (! nvlist_exists_number(nvl, "pool_ticket")) 2350 ERROUT(EINVAL); 2351 pool_ticket = nvlist_get_number(nvl, "pool_ticket"); 2352 2353 if (! nvlist_exists_nvlist(nvl, "rule")) 2354 ERROUT(EINVAL); 2355 2356 rule = malloc(sizeof(*rule), M_PFRULE, M_WAITOK | M_ZERO); 2357 error = pf_nvrule_to_krule(nvlist_get_nvlist(nvl, "rule"), 2358 rule); 2359 if (error) 2360 ERROUT(error); 2361 2362 if (nvlist_exists_string(nvl, "anchor")) 2363 anchor = nvlist_get_string(nvl, "anchor"); 2364 if (nvlist_exists_string(nvl, "anchor_call")) 2365 anchor_call = nvlist_get_string(nvl, "anchor_call"); 2366 2367 if ((error = nvlist_error(nvl))) 2368 ERROUT(error); 2369 2370 /* Frees rule on error */ 2371 error = pf_ioctl_addrule(rule, ticket, pool_ticket, anchor, 2372 anchor_call, td); 2373 2374 nvlist_destroy(nvl); 2375 free(nvlpacked, M_TEMP); 2376 break; 2377 #undef ERROUT 2378 DIOCADDRULENV_error: 2379 pf_krule_free(rule); 2380 nvlist_destroy(nvl); 2381 free(nvlpacked, M_TEMP); 2382 2383 break; 2384 } 2385 case DIOCADDRULE: { 2386 struct pfioc_rule *pr = (struct pfioc_rule *)addr; 2387 struct pf_krule *rule; 2388 2389 rule = malloc(sizeof(*rule), M_PFRULE, M_WAITOK | M_ZERO); 2390 error = pf_rule_to_krule(&pr->rule, rule); 2391 if (error != 0) { 2392 free(rule, M_PFRULE); 2393 break; 2394 } 2395 2396 pr->anchor[sizeof(pr->anchor) - 1] = 0; 2397 2398 /* Frees rule on error */ 2399 error = pf_ioctl_addrule(rule, pr->ticket, pr->pool_ticket, 2400 pr->anchor, pr->anchor_call, td); 2401 break; 2402 } 2403 2404 case DIOCGETRULES: { 2405 struct pfioc_rule *pr = (struct pfioc_rule *)addr; 2406 struct pf_kruleset *ruleset; 2407 struct pf_krule *tail; 2408 int rs_num; 2409 2410 pr->anchor[sizeof(pr->anchor) - 1] = 0; 2411 2412 PF_RULES_WLOCK(); 2413 ruleset = pf_find_kruleset(pr->anchor); 2414 if (ruleset == NULL) { 2415 PF_RULES_WUNLOCK(); 2416 error = EINVAL; 2417 break; 2418 } 2419 rs_num = pf_get_ruleset_number(pr->rule.action); 2420 if (rs_num >= PF_RULESET_MAX) { 2421 PF_RULES_WUNLOCK(); 2422 error = EINVAL; 2423 break; 2424 } 2425 tail = TAILQ_LAST(ruleset->rules[rs_num].active.ptr, 2426 pf_krulequeue); 2427 if (tail) 2428 pr->nr = tail->nr + 1; 2429 else 2430 pr->nr = 0; 2431 pr->ticket = ruleset->rules[rs_num].active.ticket; 2432 PF_RULES_WUNLOCK(); 2433 break; 2434 } 2435 2436 case DIOCGETRULE: { 2437 struct pfioc_rule *pr = (struct pfioc_rule *)addr; 2438 struct pf_kruleset *ruleset; 2439 struct pf_krule *rule; 2440 int rs_num; 2441 2442 pr->anchor[sizeof(pr->anchor) - 1] = 0; 2443 2444 PF_RULES_WLOCK(); 2445 ruleset = pf_find_kruleset(pr->anchor); 2446 if (ruleset == NULL) { 2447 PF_RULES_WUNLOCK(); 2448 error = EINVAL; 2449 break; 2450 } 2451 rs_num = pf_get_ruleset_number(pr->rule.action); 2452 if (rs_num >= PF_RULESET_MAX) { 2453 PF_RULES_WUNLOCK(); 2454 error = EINVAL; 2455 break; 2456 } 2457 if (pr->ticket != ruleset->rules[rs_num].active.ticket) { 2458 PF_RULES_WUNLOCK(); 2459 error = EBUSY; 2460 break; 2461 } 2462 rule = TAILQ_FIRST(ruleset->rules[rs_num].active.ptr); 2463 while ((rule != NULL) && (rule->nr != pr->nr)) 2464 rule = TAILQ_NEXT(rule, entries); 2465 if (rule == NULL) { 2466 PF_RULES_WUNLOCK(); 2467 error = EBUSY; 2468 break; 2469 } 2470 2471 pf_krule_to_rule(rule, &pr->rule); 2472 2473 if (pf_kanchor_copyout(ruleset, rule, pr)) { 2474 PF_RULES_WUNLOCK(); 2475 error = EBUSY; 2476 break; 2477 } 2478 pf_addr_copyout(&pr->rule.src.addr); 2479 pf_addr_copyout(&pr->rule.dst.addr); 2480 2481 if (pr->action == PF_GET_CLR_CNTR) { 2482 pf_counter_u64_zero(&rule->evaluations); 2483 for (int i = 0; i < 2; i++) { 2484 pf_counter_u64_zero(&rule->packets[i]); 2485 pf_counter_u64_zero(&rule->bytes[i]); 2486 } 2487 counter_u64_zero(rule->states_tot); 2488 } 2489 PF_RULES_WUNLOCK(); 2490 break; 2491 } 2492 2493 case DIOCGETRULENV: { 2494 struct pfioc_nv *nv = (struct pfioc_nv *)addr; 2495 nvlist_t *nvrule = NULL; 2496 nvlist_t *nvl = NULL; 2497 struct pf_kruleset *ruleset; 2498 struct pf_krule *rule; 2499 void *nvlpacked = NULL; 2500 int rs_num, nr; 2501 bool clear_counter = false; 2502 2503 #define ERROUT(x) ERROUT_IOCTL(DIOCGETRULENV_error, x) 2504 2505 if (nv->len > pf_ioctl_maxcount) 2506 ERROUT(ENOMEM); 2507 2508 /* Copy the request in */ 2509 nvlpacked = malloc(nv->len, M_NVLIST, M_WAITOK); 2510 if (nvlpacked == NULL) 2511 ERROUT(ENOMEM); 2512 2513 error = copyin(nv->data, nvlpacked, nv->len); 2514 if (error) 2515 ERROUT(error); 2516 2517 nvl = nvlist_unpack(nvlpacked, nv->len, 0); 2518 if (nvl == NULL) 2519 ERROUT(EBADMSG); 2520 2521 if (! nvlist_exists_string(nvl, "anchor")) 2522 ERROUT(EBADMSG); 2523 if (! nvlist_exists_number(nvl, "ruleset")) 2524 ERROUT(EBADMSG); 2525 if (! nvlist_exists_number(nvl, "ticket")) 2526 ERROUT(EBADMSG); 2527 if (! nvlist_exists_number(nvl, "nr")) 2528 ERROUT(EBADMSG); 2529 2530 if (nvlist_exists_bool(nvl, "clear_counter")) 2531 clear_counter = nvlist_get_bool(nvl, "clear_counter"); 2532 2533 if (clear_counter && !(flags & FWRITE)) 2534 ERROUT(EACCES); 2535 2536 nr = nvlist_get_number(nvl, "nr"); 2537 2538 PF_RULES_WLOCK(); 2539 ruleset = pf_find_kruleset(nvlist_get_string(nvl, "anchor")); 2540 if (ruleset == NULL) { 2541 PF_RULES_WUNLOCK(); 2542 ERROUT(ENOENT); 2543 } 2544 2545 rs_num = pf_get_ruleset_number(nvlist_get_number(nvl, "ruleset")); 2546 if (rs_num >= PF_RULESET_MAX) { 2547 PF_RULES_WUNLOCK(); 2548 ERROUT(EINVAL); 2549 } 2550 2551 if (nvlist_get_number(nvl, "ticket") != 2552 ruleset->rules[rs_num].active.ticket) { 2553 PF_RULES_WUNLOCK(); 2554 ERROUT(EBUSY); 2555 } 2556 2557 if ((error = nvlist_error(nvl))) { 2558 PF_RULES_WUNLOCK(); 2559 ERROUT(error); 2560 } 2561 2562 rule = TAILQ_FIRST(ruleset->rules[rs_num].active.ptr); 2563 while ((rule != NULL) && (rule->nr != nr)) 2564 rule = TAILQ_NEXT(rule, entries); 2565 if (rule == NULL) { 2566 PF_RULES_WUNLOCK(); 2567 ERROUT(EBUSY); 2568 } 2569 2570 nvrule = pf_krule_to_nvrule(rule); 2571 2572 nvlist_destroy(nvl); 2573 nvl = nvlist_create(0); 2574 if (nvl == NULL) { 2575 PF_RULES_WUNLOCK(); 2576 ERROUT(ENOMEM); 2577 } 2578 nvlist_add_number(nvl, "nr", nr); 2579 nvlist_add_nvlist(nvl, "rule", nvrule); 2580 nvlist_destroy(nvrule); 2581 nvrule = NULL; 2582 if (pf_kanchor_nvcopyout(ruleset, rule, nvl)) { 2583 PF_RULES_WUNLOCK(); 2584 ERROUT(EBUSY); 2585 } 2586 2587 free(nvlpacked, M_NVLIST); 2588 nvlpacked = nvlist_pack(nvl, &nv->len); 2589 if (nvlpacked == NULL) { 2590 PF_RULES_WUNLOCK(); 2591 ERROUT(ENOMEM); 2592 } 2593 2594 if (nv->size == 0) { 2595 PF_RULES_WUNLOCK(); 2596 ERROUT(0); 2597 } 2598 else if (nv->size < nv->len) { 2599 PF_RULES_WUNLOCK(); 2600 ERROUT(ENOSPC); 2601 } 2602 2603 if (clear_counter) { 2604 pf_counter_u64_zero(&rule->evaluations); 2605 for (int i = 0; i < 2; i++) { 2606 pf_counter_u64_zero(&rule->packets[i]); 2607 pf_counter_u64_zero(&rule->bytes[i]); 2608 } 2609 counter_u64_zero(rule->states_tot); 2610 } 2611 PF_RULES_WUNLOCK(); 2612 2613 error = copyout(nvlpacked, nv->data, nv->len); 2614 2615 #undef ERROUT 2616 DIOCGETRULENV_error: 2617 free(nvlpacked, M_NVLIST); 2618 nvlist_destroy(nvrule); 2619 nvlist_destroy(nvl); 2620 2621 break; 2622 } 2623 2624 case DIOCCHANGERULE: { 2625 struct pfioc_rule *pcr = (struct pfioc_rule *)addr; 2626 struct pf_kruleset *ruleset; 2627 struct pf_krule *oldrule = NULL, *newrule = NULL; 2628 struct pfi_kkif *kif = NULL; 2629 struct pf_kpooladdr *pa; 2630 u_int32_t nr = 0; 2631 int rs_num; 2632 2633 pcr->anchor[sizeof(pcr->anchor) - 1] = 0; 2634 2635 if (pcr->action < PF_CHANGE_ADD_HEAD || 2636 pcr->action > PF_CHANGE_GET_TICKET) { 2637 error = EINVAL; 2638 break; 2639 } 2640 if (pcr->rule.return_icmp >> 8 > ICMP_MAXTYPE) { 2641 error = EINVAL; 2642 break; 2643 } 2644 2645 if (pcr->action != PF_CHANGE_REMOVE) { 2646 newrule = malloc(sizeof(*newrule), M_PFRULE, M_WAITOK | M_ZERO); 2647 error = pf_rule_to_krule(&pcr->rule, newrule); 2648 if (error != 0) { 2649 free(newrule, M_PFRULE); 2650 break; 2651 } 2652 2653 if (newrule->ifname[0]) 2654 kif = pf_kkif_create(M_WAITOK); 2655 pf_counter_u64_init(&newrule->evaluations, M_WAITOK); 2656 for (int i = 0; i < 2; i++) { 2657 pf_counter_u64_init(&newrule->packets[i], M_WAITOK); 2658 pf_counter_u64_init(&newrule->bytes[i], M_WAITOK); 2659 } 2660 newrule->states_cur = counter_u64_alloc(M_WAITOK); 2661 newrule->states_tot = counter_u64_alloc(M_WAITOK); 2662 newrule->src_nodes = counter_u64_alloc(M_WAITOK); 2663 newrule->cuid = td->td_ucred->cr_ruid; 2664 newrule->cpid = td->td_proc ? td->td_proc->p_pid : 0; 2665 TAILQ_INIT(&newrule->rpool.list); 2666 } 2667 #define ERROUT(x) { error = (x); goto DIOCCHANGERULE_error; } 2668 2669 PF_RULES_WLOCK(); 2670 #ifdef PF_WANT_32_TO_64_COUNTER 2671 if (newrule != NULL) { 2672 LIST_INSERT_HEAD(&V_pf_allrulelist, newrule, allrulelist); 2673 newrule->allrulelinked = true; 2674 V_pf_allrulecount++; 2675 } 2676 #endif 2677 2678 if (!(pcr->action == PF_CHANGE_REMOVE || 2679 pcr->action == PF_CHANGE_GET_TICKET) && 2680 pcr->pool_ticket != V_ticket_pabuf) 2681 ERROUT(EBUSY); 2682 2683 ruleset = pf_find_kruleset(pcr->anchor); 2684 if (ruleset == NULL) 2685 ERROUT(EINVAL); 2686 2687 rs_num = pf_get_ruleset_number(pcr->rule.action); 2688 if (rs_num >= PF_RULESET_MAX) 2689 ERROUT(EINVAL); 2690 2691 if (pcr->action == PF_CHANGE_GET_TICKET) { 2692 pcr->ticket = ++ruleset->rules[rs_num].active.ticket; 2693 ERROUT(0); 2694 } else if (pcr->ticket != 2695 ruleset->rules[rs_num].active.ticket) 2696 ERROUT(EINVAL); 2697 2698 if (pcr->action != PF_CHANGE_REMOVE) { 2699 if (newrule->ifname[0]) { 2700 newrule->kif = pfi_kkif_attach(kif, 2701 newrule->ifname); 2702 kif = NULL; 2703 pfi_kkif_ref(newrule->kif); 2704 } else 2705 newrule->kif = NULL; 2706 2707 if (newrule->rtableid > 0 && 2708 newrule->rtableid >= rt_numfibs) 2709 error = EBUSY; 2710 2711 #ifdef ALTQ 2712 /* set queue IDs */ 2713 if (newrule->qname[0] != 0) { 2714 if ((newrule->qid = 2715 pf_qname2qid(newrule->qname)) == 0) 2716 error = EBUSY; 2717 else if (newrule->pqname[0] != 0) { 2718 if ((newrule->pqid = 2719 pf_qname2qid(newrule->pqname)) == 0) 2720 error = EBUSY; 2721 } else 2722 newrule->pqid = newrule->qid; 2723 } 2724 #endif /* ALTQ */ 2725 if (newrule->tagname[0]) 2726 if ((newrule->tag = 2727 pf_tagname2tag(newrule->tagname)) == 0) 2728 error = EBUSY; 2729 if (newrule->match_tagname[0]) 2730 if ((newrule->match_tag = pf_tagname2tag( 2731 newrule->match_tagname)) == 0) 2732 error = EBUSY; 2733 if (newrule->rt && !newrule->direction) 2734 error = EINVAL; 2735 if (!newrule->log) 2736 newrule->logif = 0; 2737 if (newrule->logif >= PFLOGIFS_MAX) 2738 error = EINVAL; 2739 if (pf_addr_setup(ruleset, &newrule->src.addr, newrule->af)) 2740 error = ENOMEM; 2741 if (pf_addr_setup(ruleset, &newrule->dst.addr, newrule->af)) 2742 error = ENOMEM; 2743 if (pf_kanchor_setup(newrule, ruleset, pcr->anchor_call)) 2744 error = EINVAL; 2745 TAILQ_FOREACH(pa, &V_pf_pabuf, entries) 2746 if (pa->addr.type == PF_ADDR_TABLE) { 2747 pa->addr.p.tbl = 2748 pfr_attach_table(ruleset, 2749 pa->addr.v.tblname); 2750 if (pa->addr.p.tbl == NULL) 2751 error = ENOMEM; 2752 } 2753 2754 newrule->overload_tbl = NULL; 2755 if (newrule->overload_tblname[0]) { 2756 if ((newrule->overload_tbl = pfr_attach_table( 2757 ruleset, newrule->overload_tblname)) == 2758 NULL) 2759 error = EINVAL; 2760 else 2761 newrule->overload_tbl->pfrkt_flags |= 2762 PFR_TFLAG_ACTIVE; 2763 } 2764 2765 pf_mv_kpool(&V_pf_pabuf, &newrule->rpool.list); 2766 if (((((newrule->action == PF_NAT) || 2767 (newrule->action == PF_RDR) || 2768 (newrule->action == PF_BINAT) || 2769 (newrule->rt > PF_NOPFROUTE)) && 2770 !newrule->anchor)) && 2771 (TAILQ_FIRST(&newrule->rpool.list) == NULL)) 2772 error = EINVAL; 2773 2774 if (error) { 2775 pf_free_rule(newrule); 2776 PF_RULES_WUNLOCK(); 2777 break; 2778 } 2779 2780 newrule->rpool.cur = TAILQ_FIRST(&newrule->rpool.list); 2781 } 2782 pf_empty_kpool(&V_pf_pabuf); 2783 2784 if (pcr->action == PF_CHANGE_ADD_HEAD) 2785 oldrule = TAILQ_FIRST( 2786 ruleset->rules[rs_num].active.ptr); 2787 else if (pcr->action == PF_CHANGE_ADD_TAIL) 2788 oldrule = TAILQ_LAST( 2789 ruleset->rules[rs_num].active.ptr, pf_krulequeue); 2790 else { 2791 oldrule = TAILQ_FIRST( 2792 ruleset->rules[rs_num].active.ptr); 2793 while ((oldrule != NULL) && (oldrule->nr != pcr->nr)) 2794 oldrule = TAILQ_NEXT(oldrule, entries); 2795 if (oldrule == NULL) { 2796 if (newrule != NULL) 2797 pf_free_rule(newrule); 2798 PF_RULES_WUNLOCK(); 2799 error = EINVAL; 2800 break; 2801 } 2802 } 2803 2804 if (pcr->action == PF_CHANGE_REMOVE) { 2805 pf_unlink_rule(ruleset->rules[rs_num].active.ptr, 2806 oldrule); 2807 ruleset->rules[rs_num].active.rcount--; 2808 } else { 2809 if (oldrule == NULL) 2810 TAILQ_INSERT_TAIL( 2811 ruleset->rules[rs_num].active.ptr, 2812 newrule, entries); 2813 else if (pcr->action == PF_CHANGE_ADD_HEAD || 2814 pcr->action == PF_CHANGE_ADD_BEFORE) 2815 TAILQ_INSERT_BEFORE(oldrule, newrule, entries); 2816 else 2817 TAILQ_INSERT_AFTER( 2818 ruleset->rules[rs_num].active.ptr, 2819 oldrule, newrule, entries); 2820 ruleset->rules[rs_num].active.rcount++; 2821 } 2822 2823 nr = 0; 2824 TAILQ_FOREACH(oldrule, 2825 ruleset->rules[rs_num].active.ptr, entries) 2826 oldrule->nr = nr++; 2827 2828 ruleset->rules[rs_num].active.ticket++; 2829 2830 pf_calc_skip_steps(ruleset->rules[rs_num].active.ptr); 2831 pf_remove_if_empty_kruleset(ruleset); 2832 2833 PF_RULES_WUNLOCK(); 2834 break; 2835 2836 #undef ERROUT 2837 DIOCCHANGERULE_error: 2838 PF_RULES_WUNLOCK(); 2839 pf_krule_free(newrule); 2840 pf_kkif_free(kif); 2841 break; 2842 } 2843 2844 case DIOCCLRSTATES: { 2845 struct pfioc_state_kill *psk = (struct pfioc_state_kill *)addr; 2846 struct pf_kstate_kill kill; 2847 2848 error = pf_state_kill_to_kstate_kill(psk, &kill); 2849 if (error) 2850 break; 2851 2852 psk->psk_killed = pf_clear_states(&kill); 2853 break; 2854 } 2855 2856 case DIOCCLRSTATESNV: { 2857 error = pf_clearstates_nv((struct pfioc_nv *)addr); 2858 break; 2859 } 2860 2861 case DIOCKILLSTATES: { 2862 struct pfioc_state_kill *psk = (struct pfioc_state_kill *)addr; 2863 struct pf_kstate_kill kill; 2864 2865 error = pf_state_kill_to_kstate_kill(psk, &kill); 2866 if (error) 2867 break; 2868 2869 psk->psk_killed = 0; 2870 pf_killstates(&kill, &psk->psk_killed); 2871 break; 2872 } 2873 2874 case DIOCKILLSTATESNV: { 2875 error = pf_killstates_nv((struct pfioc_nv *)addr); 2876 break; 2877 } 2878 2879 case DIOCADDSTATE: { 2880 struct pfioc_state *ps = (struct pfioc_state *)addr; 2881 struct pfsync_state *sp = &ps->state; 2882 2883 if (sp->timeout >= PFTM_MAX) { 2884 error = EINVAL; 2885 break; 2886 } 2887 if (V_pfsync_state_import_ptr != NULL) { 2888 PF_RULES_RLOCK(); 2889 error = V_pfsync_state_import_ptr(sp, PFSYNC_SI_IOCTL); 2890 PF_RULES_RUNLOCK(); 2891 } else 2892 error = EOPNOTSUPP; 2893 break; 2894 } 2895 2896 case DIOCGETSTATE: { 2897 struct pfioc_state *ps = (struct pfioc_state *)addr; 2898 struct pf_kstate *s; 2899 2900 s = pf_find_state_byid(ps->state.id, ps->state.creatorid); 2901 if (s == NULL) { 2902 error = ENOENT; 2903 break; 2904 } 2905 2906 pfsync_state_export(&ps->state, s); 2907 PF_STATE_UNLOCK(s); 2908 break; 2909 } 2910 2911 case DIOCGETSTATENV: { 2912 error = pf_getstate((struct pfioc_nv *)addr); 2913 break; 2914 } 2915 2916 case DIOCGETSTATES: { 2917 struct pfioc_states *ps = (struct pfioc_states *)addr; 2918 struct pf_kstate *s; 2919 struct pfsync_state *pstore, *p; 2920 int i, nr; 2921 size_t slice_count = 16, count; 2922 void *out; 2923 2924 if (ps->ps_len <= 0) { 2925 nr = uma_zone_get_cur(V_pf_state_z); 2926 ps->ps_len = sizeof(struct pfsync_state) * nr; 2927 break; 2928 } 2929 2930 out = ps->ps_states; 2931 pstore = mallocarray(slice_count, 2932 sizeof(struct pfsync_state), M_TEMP, M_WAITOK | M_ZERO); 2933 nr = 0; 2934 2935 for (i = 0; i <= pf_hashmask; i++) { 2936 struct pf_idhash *ih = &V_pf_idhash[i]; 2937 2938 DIOCGETSTATES_retry: 2939 p = pstore; 2940 2941 if (LIST_EMPTY(&ih->states)) 2942 continue; 2943 2944 PF_HASHROW_LOCK(ih); 2945 count = 0; 2946 LIST_FOREACH(s, &ih->states, entry) { 2947 if (s->timeout == PFTM_UNLINKED) 2948 continue; 2949 count++; 2950 } 2951 2952 if (count > slice_count) { 2953 PF_HASHROW_UNLOCK(ih); 2954 free(pstore, M_TEMP); 2955 slice_count = count * 2; 2956 pstore = mallocarray(slice_count, 2957 sizeof(struct pfsync_state), M_TEMP, 2958 M_WAITOK | M_ZERO); 2959 goto DIOCGETSTATES_retry; 2960 } 2961 2962 if ((nr+count) * sizeof(*p) > ps->ps_len) { 2963 PF_HASHROW_UNLOCK(ih); 2964 goto DIOCGETSTATES_full; 2965 } 2966 2967 LIST_FOREACH(s, &ih->states, entry) { 2968 if (s->timeout == PFTM_UNLINKED) 2969 continue; 2970 2971 pfsync_state_export(p, s); 2972 p++; 2973 nr++; 2974 } 2975 PF_HASHROW_UNLOCK(ih); 2976 error = copyout(pstore, out, 2977 sizeof(struct pfsync_state) * count); 2978 if (error) 2979 break; 2980 out = ps->ps_states + nr; 2981 } 2982 DIOCGETSTATES_full: 2983 ps->ps_len = sizeof(struct pfsync_state) * nr; 2984 free(pstore, M_TEMP); 2985 2986 break; 2987 } 2988 2989 case DIOCGETSTATESV2: { 2990 struct pfioc_states_v2 *ps = (struct pfioc_states_v2 *)addr; 2991 struct pf_kstate *s; 2992 struct pf_state_export *pstore, *p; 2993 int i, nr; 2994 size_t slice_count = 16, count; 2995 void *out; 2996 2997 if (ps->ps_req_version > PF_STATE_VERSION) { 2998 error = ENOTSUP; 2999 break; 3000 } 3001 3002 if (ps->ps_len <= 0) { 3003 nr = uma_zone_get_cur(V_pf_state_z); 3004 ps->ps_len = sizeof(struct pf_state_export) * nr; 3005 break; 3006 } 3007 3008 out = ps->ps_states; 3009 pstore = mallocarray(slice_count, 3010 sizeof(struct pf_state_export), M_TEMP, M_WAITOK | M_ZERO); 3011 nr = 0; 3012 3013 for (i = 0; i <= pf_hashmask; i++) { 3014 struct pf_idhash *ih = &V_pf_idhash[i]; 3015 3016 DIOCGETSTATESV2_retry: 3017 p = pstore; 3018 3019 if (LIST_EMPTY(&ih->states)) 3020 continue; 3021 3022 PF_HASHROW_LOCK(ih); 3023 count = 0; 3024 LIST_FOREACH(s, &ih->states, entry) { 3025 if (s->timeout == PFTM_UNLINKED) 3026 continue; 3027 count++; 3028 } 3029 3030 if (count > slice_count) { 3031 PF_HASHROW_UNLOCK(ih); 3032 free(pstore, M_TEMP); 3033 slice_count = count * 2; 3034 pstore = mallocarray(slice_count, 3035 sizeof(struct pf_state_export), M_TEMP, 3036 M_WAITOK | M_ZERO); 3037 goto DIOCGETSTATESV2_retry; 3038 } 3039 3040 if ((nr+count) * sizeof(*p) > ps->ps_len) { 3041 PF_HASHROW_UNLOCK(ih); 3042 goto DIOCGETSTATESV2_full; 3043 } 3044 3045 LIST_FOREACH(s, &ih->states, entry) { 3046 if (s->timeout == PFTM_UNLINKED) 3047 continue; 3048 3049 pf_state_export(p, s); 3050 p++; 3051 nr++; 3052 } 3053 PF_HASHROW_UNLOCK(ih); 3054 error = copyout(pstore, out, 3055 sizeof(struct pf_state_export) * count); 3056 if (error) 3057 break; 3058 out = ps->ps_states + nr; 3059 } 3060 DIOCGETSTATESV2_full: 3061 ps->ps_len = nr * sizeof(struct pf_state_export); 3062 free(pstore, M_TEMP); 3063 3064 break; 3065 } 3066 3067 case DIOCGETSTATUS: { 3068 struct pf_status *s = (struct pf_status *)addr; 3069 3070 PF_RULES_RLOCK(); 3071 s->running = V_pf_status.running; 3072 s->since = V_pf_status.since; 3073 s->debug = V_pf_status.debug; 3074 s->hostid = V_pf_status.hostid; 3075 s->states = V_pf_status.states; 3076 s->src_nodes = V_pf_status.src_nodes; 3077 3078 for (int i = 0; i < PFRES_MAX; i++) 3079 s->counters[i] = 3080 counter_u64_fetch(V_pf_status.counters[i]); 3081 for (int i = 0; i < LCNT_MAX; i++) 3082 s->lcounters[i] = 3083 counter_u64_fetch(V_pf_status.lcounters[i]); 3084 for (int i = 0; i < FCNT_MAX; i++) 3085 s->fcounters[i] = 3086 pf_counter_u64_fetch(&V_pf_status.fcounters[i]); 3087 for (int i = 0; i < SCNT_MAX; i++) 3088 s->scounters[i] = 3089 counter_u64_fetch(V_pf_status.scounters[i]); 3090 3091 bcopy(V_pf_status.ifname, s->ifname, IFNAMSIZ); 3092 bcopy(V_pf_status.pf_chksum, s->pf_chksum, 3093 PF_MD5_DIGEST_LENGTH); 3094 3095 pfi_update_status(s->ifname, s); 3096 PF_RULES_RUNLOCK(); 3097 break; 3098 } 3099 3100 case DIOCGETSTATUSNV: { 3101 error = pf_getstatus((struct pfioc_nv *)addr); 3102 break; 3103 } 3104 3105 case DIOCSETSTATUSIF: { 3106 struct pfioc_if *pi = (struct pfioc_if *)addr; 3107 3108 if (pi->ifname[0] == 0) { 3109 bzero(V_pf_status.ifname, IFNAMSIZ); 3110 break; 3111 } 3112 PF_RULES_WLOCK(); 3113 error = pf_user_strcpy(V_pf_status.ifname, pi->ifname, IFNAMSIZ); 3114 PF_RULES_WUNLOCK(); 3115 break; 3116 } 3117 3118 case DIOCCLRSTATUS: { 3119 PF_RULES_WLOCK(); 3120 for (int i = 0; i < PFRES_MAX; i++) 3121 counter_u64_zero(V_pf_status.counters[i]); 3122 for (int i = 0; i < FCNT_MAX; i++) 3123 pf_counter_u64_zero(&V_pf_status.fcounters[i]); 3124 for (int i = 0; i < SCNT_MAX; i++) 3125 counter_u64_zero(V_pf_status.scounters[i]); 3126 for (int i = 0; i < KLCNT_MAX; i++) 3127 counter_u64_zero(V_pf_status.lcounters[i]); 3128 V_pf_status.since = time_second; 3129 if (*V_pf_status.ifname) 3130 pfi_update_status(V_pf_status.ifname, NULL); 3131 PF_RULES_WUNLOCK(); 3132 break; 3133 } 3134 3135 case DIOCNATLOOK: { 3136 struct pfioc_natlook *pnl = (struct pfioc_natlook *)addr; 3137 struct pf_state_key *sk; 3138 struct pf_kstate *state; 3139 struct pf_state_key_cmp key; 3140 int m = 0, direction = pnl->direction; 3141 int sidx, didx; 3142 3143 /* NATLOOK src and dst are reversed, so reverse sidx/didx */ 3144 sidx = (direction == PF_IN) ? 1 : 0; 3145 didx = (direction == PF_IN) ? 0 : 1; 3146 3147 if (!pnl->proto || 3148 PF_AZERO(&pnl->saddr, pnl->af) || 3149 PF_AZERO(&pnl->daddr, pnl->af) || 3150 ((pnl->proto == IPPROTO_TCP || 3151 pnl->proto == IPPROTO_UDP) && 3152 (!pnl->dport || !pnl->sport))) 3153 error = EINVAL; 3154 else { 3155 bzero(&key, sizeof(key)); 3156 key.af = pnl->af; 3157 key.proto = pnl->proto; 3158 PF_ACPY(&key.addr[sidx], &pnl->saddr, pnl->af); 3159 key.port[sidx] = pnl->sport; 3160 PF_ACPY(&key.addr[didx], &pnl->daddr, pnl->af); 3161 key.port[didx] = pnl->dport; 3162 3163 state = pf_find_state_all(&key, direction, &m); 3164 3165 if (m > 1) 3166 error = E2BIG; /* more than one state */ 3167 else if (state != NULL) { 3168 /* XXXGL: not locked read */ 3169 sk = state->key[sidx]; 3170 PF_ACPY(&pnl->rsaddr, &sk->addr[sidx], sk->af); 3171 pnl->rsport = sk->port[sidx]; 3172 PF_ACPY(&pnl->rdaddr, &sk->addr[didx], sk->af); 3173 pnl->rdport = sk->port[didx]; 3174 } else 3175 error = ENOENT; 3176 } 3177 break; 3178 } 3179 3180 case DIOCSETTIMEOUT: { 3181 struct pfioc_tm *pt = (struct pfioc_tm *)addr; 3182 int old; 3183 3184 if (pt->timeout < 0 || pt->timeout >= PFTM_MAX || 3185 pt->seconds < 0) { 3186 error = EINVAL; 3187 break; 3188 } 3189 PF_RULES_WLOCK(); 3190 old = V_pf_default_rule.timeout[pt->timeout]; 3191 if (pt->timeout == PFTM_INTERVAL && pt->seconds == 0) 3192 pt->seconds = 1; 3193 V_pf_default_rule.timeout[pt->timeout] = pt->seconds; 3194 if (pt->timeout == PFTM_INTERVAL && pt->seconds < old) 3195 wakeup(pf_purge_thread); 3196 pt->seconds = old; 3197 PF_RULES_WUNLOCK(); 3198 break; 3199 } 3200 3201 case DIOCGETTIMEOUT: { 3202 struct pfioc_tm *pt = (struct pfioc_tm *)addr; 3203 3204 if (pt->timeout < 0 || pt->timeout >= PFTM_MAX) { 3205 error = EINVAL; 3206 break; 3207 } 3208 PF_RULES_RLOCK(); 3209 pt->seconds = V_pf_default_rule.timeout[pt->timeout]; 3210 PF_RULES_RUNLOCK(); 3211 break; 3212 } 3213 3214 case DIOCGETLIMIT: { 3215 struct pfioc_limit *pl = (struct pfioc_limit *)addr; 3216 3217 if (pl->index < 0 || pl->index >= PF_LIMIT_MAX) { 3218 error = EINVAL; 3219 break; 3220 } 3221 PF_RULES_RLOCK(); 3222 pl->limit = V_pf_limits[pl->index].limit; 3223 PF_RULES_RUNLOCK(); 3224 break; 3225 } 3226 3227 case DIOCSETLIMIT: { 3228 struct pfioc_limit *pl = (struct pfioc_limit *)addr; 3229 int old_limit; 3230 3231 PF_RULES_WLOCK(); 3232 if (pl->index < 0 || pl->index >= PF_LIMIT_MAX || 3233 V_pf_limits[pl->index].zone == NULL) { 3234 PF_RULES_WUNLOCK(); 3235 error = EINVAL; 3236 break; 3237 } 3238 uma_zone_set_max(V_pf_limits[pl->index].zone, pl->limit); 3239 old_limit = V_pf_limits[pl->index].limit; 3240 V_pf_limits[pl->index].limit = pl->limit; 3241 pl->limit = old_limit; 3242 PF_RULES_WUNLOCK(); 3243 break; 3244 } 3245 3246 case DIOCSETDEBUG: { 3247 u_int32_t *level = (u_int32_t *)addr; 3248 3249 PF_RULES_WLOCK(); 3250 V_pf_status.debug = *level; 3251 PF_RULES_WUNLOCK(); 3252 break; 3253 } 3254 3255 case DIOCCLRRULECTRS: { 3256 /* obsoleted by DIOCGETRULE with action=PF_GET_CLR_CNTR */ 3257 struct pf_kruleset *ruleset = &pf_main_ruleset; 3258 struct pf_krule *rule; 3259 3260 PF_RULES_WLOCK(); 3261 TAILQ_FOREACH(rule, 3262 ruleset->rules[PF_RULESET_FILTER].active.ptr, entries) { 3263 pf_counter_u64_zero(&rule->evaluations); 3264 for (int i = 0; i < 2; i++) { 3265 pf_counter_u64_zero(&rule->packets[i]); 3266 pf_counter_u64_zero(&rule->bytes[i]); 3267 } 3268 } 3269 PF_RULES_WUNLOCK(); 3270 break; 3271 } 3272 3273 case DIOCGIFSPEEDV0: 3274 case DIOCGIFSPEEDV1: { 3275 struct pf_ifspeed_v1 *psp = (struct pf_ifspeed_v1 *)addr; 3276 struct pf_ifspeed_v1 ps; 3277 struct ifnet *ifp; 3278 3279 if (psp->ifname[0] == '\0') { 3280 error = EINVAL; 3281 break; 3282 } 3283 3284 error = pf_user_strcpy(ps.ifname, psp->ifname, IFNAMSIZ); 3285 if (error != 0) 3286 break; 3287 ifp = ifunit(ps.ifname); 3288 if (ifp != NULL) { 3289 psp->baudrate32 = 3290 (u_int32_t)uqmin(ifp->if_baudrate, UINT_MAX); 3291 if (cmd == DIOCGIFSPEEDV1) 3292 psp->baudrate = ifp->if_baudrate; 3293 } else { 3294 error = EINVAL; 3295 } 3296 break; 3297 } 3298 3299 #ifdef ALTQ 3300 case DIOCSTARTALTQ: { 3301 struct pf_altq *altq; 3302 3303 PF_RULES_WLOCK(); 3304 /* enable all altq interfaces on active list */ 3305 TAILQ_FOREACH(altq, V_pf_altq_ifs_active, entries) { 3306 if ((altq->local_flags & PFALTQ_FLAG_IF_REMOVED) == 0) { 3307 error = pf_enable_altq(altq); 3308 if (error != 0) 3309 break; 3310 } 3311 } 3312 if (error == 0) 3313 V_pf_altq_running = 1; 3314 PF_RULES_WUNLOCK(); 3315 DPFPRINTF(PF_DEBUG_MISC, ("altq: started\n")); 3316 break; 3317 } 3318 3319 case DIOCSTOPALTQ: { 3320 struct pf_altq *altq; 3321 3322 PF_RULES_WLOCK(); 3323 /* disable all altq interfaces on active list */ 3324 TAILQ_FOREACH(altq, V_pf_altq_ifs_active, entries) { 3325 if ((altq->local_flags & PFALTQ_FLAG_IF_REMOVED) == 0) { 3326 error = pf_disable_altq(altq); 3327 if (error != 0) 3328 break; 3329 } 3330 } 3331 if (error == 0) 3332 V_pf_altq_running = 0; 3333 PF_RULES_WUNLOCK(); 3334 DPFPRINTF(PF_DEBUG_MISC, ("altq: stopped\n")); 3335 break; 3336 } 3337 3338 case DIOCADDALTQV0: 3339 case DIOCADDALTQV1: { 3340 struct pfioc_altq_v1 *pa = (struct pfioc_altq_v1 *)addr; 3341 struct pf_altq *altq, *a; 3342 struct ifnet *ifp; 3343 3344 altq = malloc(sizeof(*altq), M_PFALTQ, M_WAITOK | M_ZERO); 3345 error = pf_import_kaltq(pa, altq, IOCPARM_LEN(cmd)); 3346 if (error) 3347 break; 3348 altq->local_flags = 0; 3349 3350 PF_RULES_WLOCK(); 3351 if (pa->ticket != V_ticket_altqs_inactive) { 3352 PF_RULES_WUNLOCK(); 3353 free(altq, M_PFALTQ); 3354 error = EBUSY; 3355 break; 3356 } 3357 3358 /* 3359 * if this is for a queue, find the discipline and 3360 * copy the necessary fields 3361 */ 3362 if (altq->qname[0] != 0) { 3363 if ((altq->qid = pf_qname2qid(altq->qname)) == 0) { 3364 PF_RULES_WUNLOCK(); 3365 error = EBUSY; 3366 free(altq, M_PFALTQ); 3367 break; 3368 } 3369 altq->altq_disc = NULL; 3370 TAILQ_FOREACH(a, V_pf_altq_ifs_inactive, entries) { 3371 if (strncmp(a->ifname, altq->ifname, 3372 IFNAMSIZ) == 0) { 3373 altq->altq_disc = a->altq_disc; 3374 break; 3375 } 3376 } 3377 } 3378 3379 if ((ifp = ifunit(altq->ifname)) == NULL) 3380 altq->local_flags |= PFALTQ_FLAG_IF_REMOVED; 3381 else 3382 error = altq_add(ifp, altq); 3383 3384 if (error) { 3385 PF_RULES_WUNLOCK(); 3386 free(altq, M_PFALTQ); 3387 break; 3388 } 3389 3390 if (altq->qname[0] != 0) 3391 TAILQ_INSERT_TAIL(V_pf_altqs_inactive, altq, entries); 3392 else 3393 TAILQ_INSERT_TAIL(V_pf_altq_ifs_inactive, altq, entries); 3394 /* version error check done on import above */ 3395 pf_export_kaltq(altq, pa, IOCPARM_LEN(cmd)); 3396 PF_RULES_WUNLOCK(); 3397 break; 3398 } 3399 3400 case DIOCGETALTQSV0: 3401 case DIOCGETALTQSV1: { 3402 struct pfioc_altq_v1 *pa = (struct pfioc_altq_v1 *)addr; 3403 struct pf_altq *altq; 3404 3405 PF_RULES_RLOCK(); 3406 pa->nr = 0; 3407 TAILQ_FOREACH(altq, V_pf_altq_ifs_active, entries) 3408 pa->nr++; 3409 TAILQ_FOREACH(altq, V_pf_altqs_active, entries) 3410 pa->nr++; 3411 pa->ticket = V_ticket_altqs_active; 3412 PF_RULES_RUNLOCK(); 3413 break; 3414 } 3415 3416 case DIOCGETALTQV0: 3417 case DIOCGETALTQV1: { 3418 struct pfioc_altq_v1 *pa = (struct pfioc_altq_v1 *)addr; 3419 struct pf_altq *altq; 3420 3421 PF_RULES_RLOCK(); 3422 if (pa->ticket != V_ticket_altqs_active) { 3423 PF_RULES_RUNLOCK(); 3424 error = EBUSY; 3425 break; 3426 } 3427 altq = pf_altq_get_nth_active(pa->nr); 3428 if (altq == NULL) { 3429 PF_RULES_RUNLOCK(); 3430 error = EBUSY; 3431 break; 3432 } 3433 pf_export_kaltq(altq, pa, IOCPARM_LEN(cmd)); 3434 PF_RULES_RUNLOCK(); 3435 break; 3436 } 3437 3438 case DIOCCHANGEALTQV0: 3439 case DIOCCHANGEALTQV1: 3440 /* CHANGEALTQ not supported yet! */ 3441 error = ENODEV; 3442 break; 3443 3444 case DIOCGETQSTATSV0: 3445 case DIOCGETQSTATSV1: { 3446 struct pfioc_qstats_v1 *pq = (struct pfioc_qstats_v1 *)addr; 3447 struct pf_altq *altq; 3448 int nbytes; 3449 u_int32_t version; 3450 3451 PF_RULES_RLOCK(); 3452 if (pq->ticket != V_ticket_altqs_active) { 3453 PF_RULES_RUNLOCK(); 3454 error = EBUSY; 3455 break; 3456 } 3457 nbytes = pq->nbytes; 3458 altq = pf_altq_get_nth_active(pq->nr); 3459 if (altq == NULL) { 3460 PF_RULES_RUNLOCK(); 3461 error = EBUSY; 3462 break; 3463 } 3464 3465 if ((altq->local_flags & PFALTQ_FLAG_IF_REMOVED) != 0) { 3466 PF_RULES_RUNLOCK(); 3467 error = ENXIO; 3468 break; 3469 } 3470 PF_RULES_RUNLOCK(); 3471 if (cmd == DIOCGETQSTATSV0) 3472 version = 0; /* DIOCGETQSTATSV0 means stats struct v0 */ 3473 else 3474 version = pq->version; 3475 error = altq_getqstats(altq, pq->buf, &nbytes, version); 3476 if (error == 0) { 3477 pq->scheduler = altq->scheduler; 3478 pq->nbytes = nbytes; 3479 } 3480 break; 3481 } 3482 #endif /* ALTQ */ 3483 3484 case DIOCBEGINADDRS: { 3485 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr; 3486 3487 PF_RULES_WLOCK(); 3488 pf_empty_kpool(&V_pf_pabuf); 3489 pp->ticket = ++V_ticket_pabuf; 3490 PF_RULES_WUNLOCK(); 3491 break; 3492 } 3493 3494 case DIOCADDADDR: { 3495 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr; 3496 struct pf_kpooladdr *pa; 3497 struct pfi_kkif *kif = NULL; 3498 3499 #ifndef INET 3500 if (pp->af == AF_INET) { 3501 error = EAFNOSUPPORT; 3502 break; 3503 } 3504 #endif /* INET */ 3505 #ifndef INET6 3506 if (pp->af == AF_INET6) { 3507 error = EAFNOSUPPORT; 3508 break; 3509 } 3510 #endif /* INET6 */ 3511 if (pp->addr.addr.type != PF_ADDR_ADDRMASK && 3512 pp->addr.addr.type != PF_ADDR_DYNIFTL && 3513 pp->addr.addr.type != PF_ADDR_TABLE) { 3514 error = EINVAL; 3515 break; 3516 } 3517 if (pp->addr.addr.p.dyn != NULL) { 3518 error = EINVAL; 3519 break; 3520 } 3521 pa = malloc(sizeof(*pa), M_PFRULE, M_WAITOK); 3522 error = pf_pooladdr_to_kpooladdr(&pp->addr, pa); 3523 if (error != 0) 3524 break; 3525 if (pa->ifname[0]) 3526 kif = pf_kkif_create(M_WAITOK); 3527 PF_RULES_WLOCK(); 3528 if (pp->ticket != V_ticket_pabuf) { 3529 PF_RULES_WUNLOCK(); 3530 if (pa->ifname[0]) 3531 pf_kkif_free(kif); 3532 free(pa, M_PFRULE); 3533 error = EBUSY; 3534 break; 3535 } 3536 if (pa->ifname[0]) { 3537 pa->kif = pfi_kkif_attach(kif, pa->ifname); 3538 kif = NULL; 3539 pfi_kkif_ref(pa->kif); 3540 } else 3541 pa->kif = NULL; 3542 if (pa->addr.type == PF_ADDR_DYNIFTL && ((error = 3543 pfi_dynaddr_setup(&pa->addr, pp->af)) != 0)) { 3544 if (pa->ifname[0]) 3545 pfi_kkif_unref(pa->kif); 3546 PF_RULES_WUNLOCK(); 3547 free(pa, M_PFRULE); 3548 break; 3549 } 3550 TAILQ_INSERT_TAIL(&V_pf_pabuf, pa, entries); 3551 PF_RULES_WUNLOCK(); 3552 break; 3553 } 3554 3555 case DIOCGETADDRS: { 3556 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr; 3557 struct pf_kpool *pool; 3558 struct pf_kpooladdr *pa; 3559 3560 pp->anchor[sizeof(pp->anchor) - 1] = 0; 3561 pp->nr = 0; 3562 3563 PF_RULES_RLOCK(); 3564 pool = pf_get_kpool(pp->anchor, pp->ticket, pp->r_action, 3565 pp->r_num, 0, 1, 0); 3566 if (pool == NULL) { 3567 PF_RULES_RUNLOCK(); 3568 error = EBUSY; 3569 break; 3570 } 3571 TAILQ_FOREACH(pa, &pool->list, entries) 3572 pp->nr++; 3573 PF_RULES_RUNLOCK(); 3574 break; 3575 } 3576 3577 case DIOCGETADDR: { 3578 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr; 3579 struct pf_kpool *pool; 3580 struct pf_kpooladdr *pa; 3581 u_int32_t nr = 0; 3582 3583 pp->anchor[sizeof(pp->anchor) - 1] = 0; 3584 3585 PF_RULES_RLOCK(); 3586 pool = pf_get_kpool(pp->anchor, pp->ticket, pp->r_action, 3587 pp->r_num, 0, 1, 1); 3588 if (pool == NULL) { 3589 PF_RULES_RUNLOCK(); 3590 error = EBUSY; 3591 break; 3592 } 3593 pa = TAILQ_FIRST(&pool->list); 3594 while ((pa != NULL) && (nr < pp->nr)) { 3595 pa = TAILQ_NEXT(pa, entries); 3596 nr++; 3597 } 3598 if (pa == NULL) { 3599 PF_RULES_RUNLOCK(); 3600 error = EBUSY; 3601 break; 3602 } 3603 pf_kpooladdr_to_pooladdr(pa, &pp->addr); 3604 pf_addr_copyout(&pp->addr.addr); 3605 PF_RULES_RUNLOCK(); 3606 break; 3607 } 3608 3609 case DIOCCHANGEADDR: { 3610 struct pfioc_pooladdr *pca = (struct pfioc_pooladdr *)addr; 3611 struct pf_kpool *pool; 3612 struct pf_kpooladdr *oldpa = NULL, *newpa = NULL; 3613 struct pf_kruleset *ruleset; 3614 struct pfi_kkif *kif = NULL; 3615 3616 pca->anchor[sizeof(pca->anchor) - 1] = 0; 3617 3618 if (pca->action < PF_CHANGE_ADD_HEAD || 3619 pca->action > PF_CHANGE_REMOVE) { 3620 error = EINVAL; 3621 break; 3622 } 3623 if (pca->addr.addr.type != PF_ADDR_ADDRMASK && 3624 pca->addr.addr.type != PF_ADDR_DYNIFTL && 3625 pca->addr.addr.type != PF_ADDR_TABLE) { 3626 error = EINVAL; 3627 break; 3628 } 3629 if (pca->addr.addr.p.dyn != NULL) { 3630 error = EINVAL; 3631 break; 3632 } 3633 3634 if (pca->action != PF_CHANGE_REMOVE) { 3635 #ifndef INET 3636 if (pca->af == AF_INET) { 3637 error = EAFNOSUPPORT; 3638 break; 3639 } 3640 #endif /* INET */ 3641 #ifndef INET6 3642 if (pca->af == AF_INET6) { 3643 error = EAFNOSUPPORT; 3644 break; 3645 } 3646 #endif /* INET6 */ 3647 newpa = malloc(sizeof(*newpa), M_PFRULE, M_WAITOK); 3648 bcopy(&pca->addr, newpa, sizeof(struct pf_pooladdr)); 3649 if (newpa->ifname[0]) 3650 kif = pf_kkif_create(M_WAITOK); 3651 newpa->kif = NULL; 3652 } 3653 #define ERROUT(x) ERROUT_IOCTL(DIOCCHANGEADDR_error, x) 3654 PF_RULES_WLOCK(); 3655 ruleset = pf_find_kruleset(pca->anchor); 3656 if (ruleset == NULL) 3657 ERROUT(EBUSY); 3658 3659 pool = pf_get_kpool(pca->anchor, pca->ticket, pca->r_action, 3660 pca->r_num, pca->r_last, 1, 1); 3661 if (pool == NULL) 3662 ERROUT(EBUSY); 3663 3664 if (pca->action != PF_CHANGE_REMOVE) { 3665 if (newpa->ifname[0]) { 3666 newpa->kif = pfi_kkif_attach(kif, newpa->ifname); 3667 pfi_kkif_ref(newpa->kif); 3668 kif = NULL; 3669 } 3670 3671 switch (newpa->addr.type) { 3672 case PF_ADDR_DYNIFTL: 3673 error = pfi_dynaddr_setup(&newpa->addr, 3674 pca->af); 3675 break; 3676 case PF_ADDR_TABLE: 3677 newpa->addr.p.tbl = pfr_attach_table(ruleset, 3678 newpa->addr.v.tblname); 3679 if (newpa->addr.p.tbl == NULL) 3680 error = ENOMEM; 3681 break; 3682 } 3683 if (error) 3684 goto DIOCCHANGEADDR_error; 3685 } 3686 3687 switch (pca->action) { 3688 case PF_CHANGE_ADD_HEAD: 3689 oldpa = TAILQ_FIRST(&pool->list); 3690 break; 3691 case PF_CHANGE_ADD_TAIL: 3692 oldpa = TAILQ_LAST(&pool->list, pf_kpalist); 3693 break; 3694 default: 3695 oldpa = TAILQ_FIRST(&pool->list); 3696 for (int i = 0; oldpa && i < pca->nr; i++) 3697 oldpa = TAILQ_NEXT(oldpa, entries); 3698 3699 if (oldpa == NULL) 3700 ERROUT(EINVAL); 3701 } 3702 3703 if (pca->action == PF_CHANGE_REMOVE) { 3704 TAILQ_REMOVE(&pool->list, oldpa, entries); 3705 switch (oldpa->addr.type) { 3706 case PF_ADDR_DYNIFTL: 3707 pfi_dynaddr_remove(oldpa->addr.p.dyn); 3708 break; 3709 case PF_ADDR_TABLE: 3710 pfr_detach_table(oldpa->addr.p.tbl); 3711 break; 3712 } 3713 if (oldpa->kif) 3714 pfi_kkif_unref(oldpa->kif); 3715 free(oldpa, M_PFRULE); 3716 } else { 3717 if (oldpa == NULL) 3718 TAILQ_INSERT_TAIL(&pool->list, newpa, entries); 3719 else if (pca->action == PF_CHANGE_ADD_HEAD || 3720 pca->action == PF_CHANGE_ADD_BEFORE) 3721 TAILQ_INSERT_BEFORE(oldpa, newpa, entries); 3722 else 3723 TAILQ_INSERT_AFTER(&pool->list, oldpa, 3724 newpa, entries); 3725 } 3726 3727 pool->cur = TAILQ_FIRST(&pool->list); 3728 PF_ACPY(&pool->counter, &pool->cur->addr.v.a.addr, pca->af); 3729 PF_RULES_WUNLOCK(); 3730 break; 3731 3732 #undef ERROUT 3733 DIOCCHANGEADDR_error: 3734 if (newpa != NULL) { 3735 if (newpa->kif) 3736 pfi_kkif_unref(newpa->kif); 3737 free(newpa, M_PFRULE); 3738 } 3739 PF_RULES_WUNLOCK(); 3740 pf_kkif_free(kif); 3741 break; 3742 } 3743 3744 case DIOCGETRULESETS: { 3745 struct pfioc_ruleset *pr = (struct pfioc_ruleset *)addr; 3746 struct pf_kruleset *ruleset; 3747 struct pf_kanchor *anchor; 3748 3749 pr->path[sizeof(pr->path) - 1] = 0; 3750 3751 PF_RULES_RLOCK(); 3752 if ((ruleset = pf_find_kruleset(pr->path)) == NULL) { 3753 PF_RULES_RUNLOCK(); 3754 error = ENOENT; 3755 break; 3756 } 3757 pr->nr = 0; 3758 if (ruleset->anchor == NULL) { 3759 /* XXX kludge for pf_main_ruleset */ 3760 RB_FOREACH(anchor, pf_kanchor_global, &V_pf_anchors) 3761 if (anchor->parent == NULL) 3762 pr->nr++; 3763 } else { 3764 RB_FOREACH(anchor, pf_kanchor_node, 3765 &ruleset->anchor->children) 3766 pr->nr++; 3767 } 3768 PF_RULES_RUNLOCK(); 3769 break; 3770 } 3771 3772 case DIOCGETRULESET: { 3773 struct pfioc_ruleset *pr = (struct pfioc_ruleset *)addr; 3774 struct pf_kruleset *ruleset; 3775 struct pf_kanchor *anchor; 3776 u_int32_t nr = 0; 3777 3778 pr->path[sizeof(pr->path) - 1] = 0; 3779 3780 PF_RULES_RLOCK(); 3781 if ((ruleset = pf_find_kruleset(pr->path)) == NULL) { 3782 PF_RULES_RUNLOCK(); 3783 error = ENOENT; 3784 break; 3785 } 3786 pr->name[0] = 0; 3787 if (ruleset->anchor == NULL) { 3788 /* XXX kludge for pf_main_ruleset */ 3789 RB_FOREACH(anchor, pf_kanchor_global, &V_pf_anchors) 3790 if (anchor->parent == NULL && nr++ == pr->nr) { 3791 strlcpy(pr->name, anchor->name, 3792 sizeof(pr->name)); 3793 break; 3794 } 3795 } else { 3796 RB_FOREACH(anchor, pf_kanchor_node, 3797 &ruleset->anchor->children) 3798 if (nr++ == pr->nr) { 3799 strlcpy(pr->name, anchor->name, 3800 sizeof(pr->name)); 3801 break; 3802 } 3803 } 3804 if (!pr->name[0]) 3805 error = EBUSY; 3806 PF_RULES_RUNLOCK(); 3807 break; 3808 } 3809 3810 case DIOCRCLRTABLES: { 3811 struct pfioc_table *io = (struct pfioc_table *)addr; 3812 3813 if (io->pfrio_esize != 0) { 3814 error = ENODEV; 3815 break; 3816 } 3817 PF_RULES_WLOCK(); 3818 error = pfr_clr_tables(&io->pfrio_table, &io->pfrio_ndel, 3819 io->pfrio_flags | PFR_FLAG_USERIOCTL); 3820 PF_RULES_WUNLOCK(); 3821 break; 3822 } 3823 3824 case DIOCRADDTABLES: { 3825 struct pfioc_table *io = (struct pfioc_table *)addr; 3826 struct pfr_table *pfrts; 3827 size_t totlen; 3828 3829 if (io->pfrio_esize != sizeof(struct pfr_table)) { 3830 error = ENODEV; 3831 break; 3832 } 3833 3834 if (io->pfrio_size < 0 || io->pfrio_size > pf_ioctl_maxcount || 3835 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_table))) { 3836 error = ENOMEM; 3837 break; 3838 } 3839 3840 totlen = io->pfrio_size * sizeof(struct pfr_table); 3841 pfrts = mallocarray(io->pfrio_size, sizeof(struct pfr_table), 3842 M_TEMP, M_WAITOK); 3843 error = copyin(io->pfrio_buffer, pfrts, totlen); 3844 if (error) { 3845 free(pfrts, M_TEMP); 3846 break; 3847 } 3848 PF_RULES_WLOCK(); 3849 error = pfr_add_tables(pfrts, io->pfrio_size, 3850 &io->pfrio_nadd, io->pfrio_flags | PFR_FLAG_USERIOCTL); 3851 PF_RULES_WUNLOCK(); 3852 free(pfrts, M_TEMP); 3853 break; 3854 } 3855 3856 case DIOCRDELTABLES: { 3857 struct pfioc_table *io = (struct pfioc_table *)addr; 3858 struct pfr_table *pfrts; 3859 size_t totlen; 3860 3861 if (io->pfrio_esize != sizeof(struct pfr_table)) { 3862 error = ENODEV; 3863 break; 3864 } 3865 3866 if (io->pfrio_size < 0 || io->pfrio_size > pf_ioctl_maxcount || 3867 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_table))) { 3868 error = ENOMEM; 3869 break; 3870 } 3871 3872 totlen = io->pfrio_size * sizeof(struct pfr_table); 3873 pfrts = mallocarray(io->pfrio_size, sizeof(struct pfr_table), 3874 M_TEMP, M_WAITOK); 3875 error = copyin(io->pfrio_buffer, pfrts, totlen); 3876 if (error) { 3877 free(pfrts, M_TEMP); 3878 break; 3879 } 3880 PF_RULES_WLOCK(); 3881 error = pfr_del_tables(pfrts, io->pfrio_size, 3882 &io->pfrio_ndel, io->pfrio_flags | PFR_FLAG_USERIOCTL); 3883 PF_RULES_WUNLOCK(); 3884 free(pfrts, M_TEMP); 3885 break; 3886 } 3887 3888 case DIOCRGETTABLES: { 3889 struct pfioc_table *io = (struct pfioc_table *)addr; 3890 struct pfr_table *pfrts; 3891 size_t totlen; 3892 int n; 3893 3894 if (io->pfrio_esize != sizeof(struct pfr_table)) { 3895 error = ENODEV; 3896 break; 3897 } 3898 PF_RULES_RLOCK(); 3899 n = pfr_table_count(&io->pfrio_table, io->pfrio_flags); 3900 if (n < 0) { 3901 PF_RULES_RUNLOCK(); 3902 error = EINVAL; 3903 break; 3904 } 3905 io->pfrio_size = min(io->pfrio_size, n); 3906 3907 totlen = io->pfrio_size * sizeof(struct pfr_table); 3908 3909 pfrts = mallocarray(io->pfrio_size, sizeof(struct pfr_table), 3910 M_TEMP, M_NOWAIT | M_ZERO); 3911 if (pfrts == NULL) { 3912 error = ENOMEM; 3913 PF_RULES_RUNLOCK(); 3914 break; 3915 } 3916 error = pfr_get_tables(&io->pfrio_table, pfrts, 3917 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL); 3918 PF_RULES_RUNLOCK(); 3919 if (error == 0) 3920 error = copyout(pfrts, io->pfrio_buffer, totlen); 3921 free(pfrts, M_TEMP); 3922 break; 3923 } 3924 3925 case DIOCRGETTSTATS: { 3926 struct pfioc_table *io = (struct pfioc_table *)addr; 3927 struct pfr_tstats *pfrtstats; 3928 size_t totlen; 3929 int n; 3930 3931 if (io->pfrio_esize != sizeof(struct pfr_tstats)) { 3932 error = ENODEV; 3933 break; 3934 } 3935 PF_TABLE_STATS_LOCK(); 3936 PF_RULES_RLOCK(); 3937 n = pfr_table_count(&io->pfrio_table, io->pfrio_flags); 3938 if (n < 0) { 3939 PF_RULES_RUNLOCK(); 3940 PF_TABLE_STATS_UNLOCK(); 3941 error = EINVAL; 3942 break; 3943 } 3944 io->pfrio_size = min(io->pfrio_size, n); 3945 3946 totlen = io->pfrio_size * sizeof(struct pfr_tstats); 3947 pfrtstats = mallocarray(io->pfrio_size, 3948 sizeof(struct pfr_tstats), M_TEMP, M_NOWAIT | M_ZERO); 3949 if (pfrtstats == NULL) { 3950 error = ENOMEM; 3951 PF_RULES_RUNLOCK(); 3952 PF_TABLE_STATS_UNLOCK(); 3953 break; 3954 } 3955 error = pfr_get_tstats(&io->pfrio_table, pfrtstats, 3956 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL); 3957 PF_RULES_RUNLOCK(); 3958 PF_TABLE_STATS_UNLOCK(); 3959 if (error == 0) 3960 error = copyout(pfrtstats, io->pfrio_buffer, totlen); 3961 free(pfrtstats, M_TEMP); 3962 break; 3963 } 3964 3965 case DIOCRCLRTSTATS: { 3966 struct pfioc_table *io = (struct pfioc_table *)addr; 3967 struct pfr_table *pfrts; 3968 size_t totlen; 3969 3970 if (io->pfrio_esize != sizeof(struct pfr_table)) { 3971 error = ENODEV; 3972 break; 3973 } 3974 3975 if (io->pfrio_size < 0 || io->pfrio_size > pf_ioctl_maxcount || 3976 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_table))) { 3977 /* We used to count tables and use the minimum required 3978 * size, so we didn't fail on overly large requests. 3979 * Keep doing so. */ 3980 io->pfrio_size = pf_ioctl_maxcount; 3981 break; 3982 } 3983 3984 totlen = io->pfrio_size * sizeof(struct pfr_table); 3985 pfrts = mallocarray(io->pfrio_size, sizeof(struct pfr_table), 3986 M_TEMP, M_WAITOK); 3987 error = copyin(io->pfrio_buffer, pfrts, totlen); 3988 if (error) { 3989 free(pfrts, M_TEMP); 3990 break; 3991 } 3992 3993 PF_TABLE_STATS_LOCK(); 3994 PF_RULES_RLOCK(); 3995 error = pfr_clr_tstats(pfrts, io->pfrio_size, 3996 &io->pfrio_nzero, io->pfrio_flags | PFR_FLAG_USERIOCTL); 3997 PF_RULES_RUNLOCK(); 3998 PF_TABLE_STATS_UNLOCK(); 3999 free(pfrts, M_TEMP); 4000 break; 4001 } 4002 4003 case DIOCRSETTFLAGS: { 4004 struct pfioc_table *io = (struct pfioc_table *)addr; 4005 struct pfr_table *pfrts; 4006 size_t totlen; 4007 int n; 4008 4009 if (io->pfrio_esize != sizeof(struct pfr_table)) { 4010 error = ENODEV; 4011 break; 4012 } 4013 4014 PF_RULES_RLOCK(); 4015 n = pfr_table_count(&io->pfrio_table, io->pfrio_flags); 4016 if (n < 0) { 4017 PF_RULES_RUNLOCK(); 4018 error = EINVAL; 4019 break; 4020 } 4021 4022 io->pfrio_size = min(io->pfrio_size, n); 4023 PF_RULES_RUNLOCK(); 4024 4025 totlen = io->pfrio_size * sizeof(struct pfr_table); 4026 pfrts = mallocarray(io->pfrio_size, sizeof(struct pfr_table), 4027 M_TEMP, M_WAITOK); 4028 error = copyin(io->pfrio_buffer, pfrts, totlen); 4029 if (error) { 4030 free(pfrts, M_TEMP); 4031 break; 4032 } 4033 PF_RULES_WLOCK(); 4034 error = pfr_set_tflags(pfrts, io->pfrio_size, 4035 io->pfrio_setflag, io->pfrio_clrflag, &io->pfrio_nchange, 4036 &io->pfrio_ndel, io->pfrio_flags | PFR_FLAG_USERIOCTL); 4037 PF_RULES_WUNLOCK(); 4038 free(pfrts, M_TEMP); 4039 break; 4040 } 4041 4042 case DIOCRCLRADDRS: { 4043 struct pfioc_table *io = (struct pfioc_table *)addr; 4044 4045 if (io->pfrio_esize != 0) { 4046 error = ENODEV; 4047 break; 4048 } 4049 PF_RULES_WLOCK(); 4050 error = pfr_clr_addrs(&io->pfrio_table, &io->pfrio_ndel, 4051 io->pfrio_flags | PFR_FLAG_USERIOCTL); 4052 PF_RULES_WUNLOCK(); 4053 break; 4054 } 4055 4056 case DIOCRADDADDRS: { 4057 struct pfioc_table *io = (struct pfioc_table *)addr; 4058 struct pfr_addr *pfras; 4059 size_t totlen; 4060 4061 if (io->pfrio_esize != sizeof(struct pfr_addr)) { 4062 error = ENODEV; 4063 break; 4064 } 4065 if (io->pfrio_size < 0 || 4066 io->pfrio_size > pf_ioctl_maxcount || 4067 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_addr))) { 4068 error = EINVAL; 4069 break; 4070 } 4071 totlen = io->pfrio_size * sizeof(struct pfr_addr); 4072 pfras = mallocarray(io->pfrio_size, sizeof(struct pfr_addr), 4073 M_TEMP, M_WAITOK); 4074 error = copyin(io->pfrio_buffer, pfras, totlen); 4075 if (error) { 4076 free(pfras, M_TEMP); 4077 break; 4078 } 4079 PF_RULES_WLOCK(); 4080 error = pfr_add_addrs(&io->pfrio_table, pfras, 4081 io->pfrio_size, &io->pfrio_nadd, io->pfrio_flags | 4082 PFR_FLAG_USERIOCTL); 4083 PF_RULES_WUNLOCK(); 4084 if (error == 0 && io->pfrio_flags & PFR_FLAG_FEEDBACK) 4085 error = copyout(pfras, io->pfrio_buffer, totlen); 4086 free(pfras, M_TEMP); 4087 break; 4088 } 4089 4090 case DIOCRDELADDRS: { 4091 struct pfioc_table *io = (struct pfioc_table *)addr; 4092 struct pfr_addr *pfras; 4093 size_t totlen; 4094 4095 if (io->pfrio_esize != sizeof(struct pfr_addr)) { 4096 error = ENODEV; 4097 break; 4098 } 4099 if (io->pfrio_size < 0 || 4100 io->pfrio_size > pf_ioctl_maxcount || 4101 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_addr))) { 4102 error = EINVAL; 4103 break; 4104 } 4105 totlen = io->pfrio_size * sizeof(struct pfr_addr); 4106 pfras = mallocarray(io->pfrio_size, sizeof(struct pfr_addr), 4107 M_TEMP, M_WAITOK); 4108 error = copyin(io->pfrio_buffer, pfras, totlen); 4109 if (error) { 4110 free(pfras, M_TEMP); 4111 break; 4112 } 4113 PF_RULES_WLOCK(); 4114 error = pfr_del_addrs(&io->pfrio_table, pfras, 4115 io->pfrio_size, &io->pfrio_ndel, io->pfrio_flags | 4116 PFR_FLAG_USERIOCTL); 4117 PF_RULES_WUNLOCK(); 4118 if (error == 0 && io->pfrio_flags & PFR_FLAG_FEEDBACK) 4119 error = copyout(pfras, io->pfrio_buffer, totlen); 4120 free(pfras, M_TEMP); 4121 break; 4122 } 4123 4124 case DIOCRSETADDRS: { 4125 struct pfioc_table *io = (struct pfioc_table *)addr; 4126 struct pfr_addr *pfras; 4127 size_t totlen, count; 4128 4129 if (io->pfrio_esize != sizeof(struct pfr_addr)) { 4130 error = ENODEV; 4131 break; 4132 } 4133 if (io->pfrio_size < 0 || io->pfrio_size2 < 0) { 4134 error = EINVAL; 4135 break; 4136 } 4137 count = max(io->pfrio_size, io->pfrio_size2); 4138 if (count > pf_ioctl_maxcount || 4139 WOULD_OVERFLOW(count, sizeof(struct pfr_addr))) { 4140 error = EINVAL; 4141 break; 4142 } 4143 totlen = count * sizeof(struct pfr_addr); 4144 pfras = mallocarray(count, sizeof(struct pfr_addr), M_TEMP, 4145 M_WAITOK); 4146 error = copyin(io->pfrio_buffer, pfras, totlen); 4147 if (error) { 4148 free(pfras, M_TEMP); 4149 break; 4150 } 4151 PF_RULES_WLOCK(); 4152 error = pfr_set_addrs(&io->pfrio_table, pfras, 4153 io->pfrio_size, &io->pfrio_size2, &io->pfrio_nadd, 4154 &io->pfrio_ndel, &io->pfrio_nchange, io->pfrio_flags | 4155 PFR_FLAG_USERIOCTL, 0); 4156 PF_RULES_WUNLOCK(); 4157 if (error == 0 && io->pfrio_flags & PFR_FLAG_FEEDBACK) 4158 error = copyout(pfras, io->pfrio_buffer, totlen); 4159 free(pfras, M_TEMP); 4160 break; 4161 } 4162 4163 case DIOCRGETADDRS: { 4164 struct pfioc_table *io = (struct pfioc_table *)addr; 4165 struct pfr_addr *pfras; 4166 size_t totlen; 4167 4168 if (io->pfrio_esize != sizeof(struct pfr_addr)) { 4169 error = ENODEV; 4170 break; 4171 } 4172 if (io->pfrio_size < 0 || 4173 io->pfrio_size > pf_ioctl_maxcount || 4174 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_addr))) { 4175 error = EINVAL; 4176 break; 4177 } 4178 totlen = io->pfrio_size * sizeof(struct pfr_addr); 4179 pfras = mallocarray(io->pfrio_size, sizeof(struct pfr_addr), 4180 M_TEMP, M_WAITOK | M_ZERO); 4181 PF_RULES_RLOCK(); 4182 error = pfr_get_addrs(&io->pfrio_table, pfras, 4183 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL); 4184 PF_RULES_RUNLOCK(); 4185 if (error == 0) 4186 error = copyout(pfras, io->pfrio_buffer, totlen); 4187 free(pfras, M_TEMP); 4188 break; 4189 } 4190 4191 case DIOCRGETASTATS: { 4192 struct pfioc_table *io = (struct pfioc_table *)addr; 4193 struct pfr_astats *pfrastats; 4194 size_t totlen; 4195 4196 if (io->pfrio_esize != sizeof(struct pfr_astats)) { 4197 error = ENODEV; 4198 break; 4199 } 4200 if (io->pfrio_size < 0 || 4201 io->pfrio_size > pf_ioctl_maxcount || 4202 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_astats))) { 4203 error = EINVAL; 4204 break; 4205 } 4206 totlen = io->pfrio_size * sizeof(struct pfr_astats); 4207 pfrastats = mallocarray(io->pfrio_size, 4208 sizeof(struct pfr_astats), M_TEMP, M_WAITOK | M_ZERO); 4209 PF_RULES_RLOCK(); 4210 error = pfr_get_astats(&io->pfrio_table, pfrastats, 4211 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL); 4212 PF_RULES_RUNLOCK(); 4213 if (error == 0) 4214 error = copyout(pfrastats, io->pfrio_buffer, totlen); 4215 free(pfrastats, M_TEMP); 4216 break; 4217 } 4218 4219 case DIOCRCLRASTATS: { 4220 struct pfioc_table *io = (struct pfioc_table *)addr; 4221 struct pfr_addr *pfras; 4222 size_t totlen; 4223 4224 if (io->pfrio_esize != sizeof(struct pfr_addr)) { 4225 error = ENODEV; 4226 break; 4227 } 4228 if (io->pfrio_size < 0 || 4229 io->pfrio_size > pf_ioctl_maxcount || 4230 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_addr))) { 4231 error = EINVAL; 4232 break; 4233 } 4234 totlen = io->pfrio_size * sizeof(struct pfr_addr); 4235 pfras = mallocarray(io->pfrio_size, sizeof(struct pfr_addr), 4236 M_TEMP, M_WAITOK); 4237 error = copyin(io->pfrio_buffer, pfras, totlen); 4238 if (error) { 4239 free(pfras, M_TEMP); 4240 break; 4241 } 4242 PF_RULES_WLOCK(); 4243 error = pfr_clr_astats(&io->pfrio_table, pfras, 4244 io->pfrio_size, &io->pfrio_nzero, io->pfrio_flags | 4245 PFR_FLAG_USERIOCTL); 4246 PF_RULES_WUNLOCK(); 4247 if (error == 0 && io->pfrio_flags & PFR_FLAG_FEEDBACK) 4248 error = copyout(pfras, io->pfrio_buffer, totlen); 4249 free(pfras, M_TEMP); 4250 break; 4251 } 4252 4253 case DIOCRTSTADDRS: { 4254 struct pfioc_table *io = (struct pfioc_table *)addr; 4255 struct pfr_addr *pfras; 4256 size_t totlen; 4257 4258 if (io->pfrio_esize != sizeof(struct pfr_addr)) { 4259 error = ENODEV; 4260 break; 4261 } 4262 if (io->pfrio_size < 0 || 4263 io->pfrio_size > pf_ioctl_maxcount || 4264 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_addr))) { 4265 error = EINVAL; 4266 break; 4267 } 4268 totlen = io->pfrio_size * sizeof(struct pfr_addr); 4269 pfras = mallocarray(io->pfrio_size, sizeof(struct pfr_addr), 4270 M_TEMP, M_WAITOK); 4271 error = copyin(io->pfrio_buffer, pfras, totlen); 4272 if (error) { 4273 free(pfras, M_TEMP); 4274 break; 4275 } 4276 PF_RULES_RLOCK(); 4277 error = pfr_tst_addrs(&io->pfrio_table, pfras, 4278 io->pfrio_size, &io->pfrio_nmatch, io->pfrio_flags | 4279 PFR_FLAG_USERIOCTL); 4280 PF_RULES_RUNLOCK(); 4281 if (error == 0) 4282 error = copyout(pfras, io->pfrio_buffer, totlen); 4283 free(pfras, M_TEMP); 4284 break; 4285 } 4286 4287 case DIOCRINADEFINE: { 4288 struct pfioc_table *io = (struct pfioc_table *)addr; 4289 struct pfr_addr *pfras; 4290 size_t totlen; 4291 4292 if (io->pfrio_esize != sizeof(struct pfr_addr)) { 4293 error = ENODEV; 4294 break; 4295 } 4296 if (io->pfrio_size < 0 || 4297 io->pfrio_size > pf_ioctl_maxcount || 4298 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_addr))) { 4299 error = EINVAL; 4300 break; 4301 } 4302 totlen = io->pfrio_size * sizeof(struct pfr_addr); 4303 pfras = mallocarray(io->pfrio_size, sizeof(struct pfr_addr), 4304 M_TEMP, M_WAITOK); 4305 error = copyin(io->pfrio_buffer, pfras, totlen); 4306 if (error) { 4307 free(pfras, M_TEMP); 4308 break; 4309 } 4310 PF_RULES_WLOCK(); 4311 error = pfr_ina_define(&io->pfrio_table, pfras, 4312 io->pfrio_size, &io->pfrio_nadd, &io->pfrio_naddr, 4313 io->pfrio_ticket, io->pfrio_flags | PFR_FLAG_USERIOCTL); 4314 PF_RULES_WUNLOCK(); 4315 free(pfras, M_TEMP); 4316 break; 4317 } 4318 4319 case DIOCOSFPADD: { 4320 struct pf_osfp_ioctl *io = (struct pf_osfp_ioctl *)addr; 4321 PF_RULES_WLOCK(); 4322 error = pf_osfp_add(io); 4323 PF_RULES_WUNLOCK(); 4324 break; 4325 } 4326 4327 case DIOCOSFPGET: { 4328 struct pf_osfp_ioctl *io = (struct pf_osfp_ioctl *)addr; 4329 PF_RULES_RLOCK(); 4330 error = pf_osfp_get(io); 4331 PF_RULES_RUNLOCK(); 4332 break; 4333 } 4334 4335 case DIOCXBEGIN: { 4336 struct pfioc_trans *io = (struct pfioc_trans *)addr; 4337 struct pfioc_trans_e *ioes, *ioe; 4338 size_t totlen; 4339 int i; 4340 4341 if (io->esize != sizeof(*ioe)) { 4342 error = ENODEV; 4343 break; 4344 } 4345 if (io->size < 0 || 4346 io->size > pf_ioctl_maxcount || 4347 WOULD_OVERFLOW(io->size, sizeof(struct pfioc_trans_e))) { 4348 error = EINVAL; 4349 break; 4350 } 4351 totlen = sizeof(struct pfioc_trans_e) * io->size; 4352 ioes = mallocarray(io->size, sizeof(struct pfioc_trans_e), 4353 M_TEMP, M_WAITOK); 4354 error = copyin(io->array, ioes, totlen); 4355 if (error) { 4356 free(ioes, M_TEMP); 4357 break; 4358 } 4359 PF_RULES_WLOCK(); 4360 for (i = 0, ioe = ioes; i < io->size; i++, ioe++) { 4361 ioe->anchor[sizeof(ioe->anchor) - 1] = '\0'; 4362 switch (ioe->rs_num) { 4363 #ifdef ALTQ 4364 case PF_RULESET_ALTQ: 4365 if (ioe->anchor[0]) { 4366 PF_RULES_WUNLOCK(); 4367 free(ioes, M_TEMP); 4368 error = EINVAL; 4369 goto fail; 4370 } 4371 if ((error = pf_begin_altq(&ioe->ticket))) { 4372 PF_RULES_WUNLOCK(); 4373 free(ioes, M_TEMP); 4374 goto fail; 4375 } 4376 break; 4377 #endif /* ALTQ */ 4378 case PF_RULESET_TABLE: 4379 { 4380 struct pfr_table table; 4381 4382 bzero(&table, sizeof(table)); 4383 strlcpy(table.pfrt_anchor, ioe->anchor, 4384 sizeof(table.pfrt_anchor)); 4385 if ((error = pfr_ina_begin(&table, 4386 &ioe->ticket, NULL, 0))) { 4387 PF_RULES_WUNLOCK(); 4388 free(ioes, M_TEMP); 4389 goto fail; 4390 } 4391 break; 4392 } 4393 default: 4394 if ((error = pf_begin_rules(&ioe->ticket, 4395 ioe->rs_num, ioe->anchor))) { 4396 PF_RULES_WUNLOCK(); 4397 free(ioes, M_TEMP); 4398 goto fail; 4399 } 4400 break; 4401 } 4402 } 4403 PF_RULES_WUNLOCK(); 4404 error = copyout(ioes, io->array, totlen); 4405 free(ioes, M_TEMP); 4406 break; 4407 } 4408 4409 case DIOCXROLLBACK: { 4410 struct pfioc_trans *io = (struct pfioc_trans *)addr; 4411 struct pfioc_trans_e *ioe, *ioes; 4412 size_t totlen; 4413 int i; 4414 4415 if (io->esize != sizeof(*ioe)) { 4416 error = ENODEV; 4417 break; 4418 } 4419 if (io->size < 0 || 4420 io->size > pf_ioctl_maxcount || 4421 WOULD_OVERFLOW(io->size, sizeof(struct pfioc_trans_e))) { 4422 error = EINVAL; 4423 break; 4424 } 4425 totlen = sizeof(struct pfioc_trans_e) * io->size; 4426 ioes = mallocarray(io->size, sizeof(struct pfioc_trans_e), 4427 M_TEMP, M_WAITOK); 4428 error = copyin(io->array, ioes, totlen); 4429 if (error) { 4430 free(ioes, M_TEMP); 4431 break; 4432 } 4433 PF_RULES_WLOCK(); 4434 for (i = 0, ioe = ioes; i < io->size; i++, ioe++) { 4435 ioe->anchor[sizeof(ioe->anchor) - 1] = '\0'; 4436 switch (ioe->rs_num) { 4437 #ifdef ALTQ 4438 case PF_RULESET_ALTQ: 4439 if (ioe->anchor[0]) { 4440 PF_RULES_WUNLOCK(); 4441 free(ioes, M_TEMP); 4442 error = EINVAL; 4443 goto fail; 4444 } 4445 if ((error = pf_rollback_altq(ioe->ticket))) { 4446 PF_RULES_WUNLOCK(); 4447 free(ioes, M_TEMP); 4448 goto fail; /* really bad */ 4449 } 4450 break; 4451 #endif /* ALTQ */ 4452 case PF_RULESET_TABLE: 4453 { 4454 struct pfr_table table; 4455 4456 bzero(&table, sizeof(table)); 4457 strlcpy(table.pfrt_anchor, ioe->anchor, 4458 sizeof(table.pfrt_anchor)); 4459 if ((error = pfr_ina_rollback(&table, 4460 ioe->ticket, NULL, 0))) { 4461 PF_RULES_WUNLOCK(); 4462 free(ioes, M_TEMP); 4463 goto fail; /* really bad */ 4464 } 4465 break; 4466 } 4467 default: 4468 if ((error = pf_rollback_rules(ioe->ticket, 4469 ioe->rs_num, ioe->anchor))) { 4470 PF_RULES_WUNLOCK(); 4471 free(ioes, M_TEMP); 4472 goto fail; /* really bad */ 4473 } 4474 break; 4475 } 4476 } 4477 PF_RULES_WUNLOCK(); 4478 free(ioes, M_TEMP); 4479 break; 4480 } 4481 4482 case DIOCXCOMMIT: { 4483 struct pfioc_trans *io = (struct pfioc_trans *)addr; 4484 struct pfioc_trans_e *ioe, *ioes; 4485 struct pf_kruleset *rs; 4486 size_t totlen; 4487 int i; 4488 4489 if (io->esize != sizeof(*ioe)) { 4490 error = ENODEV; 4491 break; 4492 } 4493 4494 if (io->size < 0 || 4495 io->size > pf_ioctl_maxcount || 4496 WOULD_OVERFLOW(io->size, sizeof(struct pfioc_trans_e))) { 4497 error = EINVAL; 4498 break; 4499 } 4500 4501 totlen = sizeof(struct pfioc_trans_e) * io->size; 4502 ioes = mallocarray(io->size, sizeof(struct pfioc_trans_e), 4503 M_TEMP, M_WAITOK); 4504 error = copyin(io->array, ioes, totlen); 4505 if (error) { 4506 free(ioes, M_TEMP); 4507 break; 4508 } 4509 PF_RULES_WLOCK(); 4510 /* First makes sure everything will succeed. */ 4511 for (i = 0, ioe = ioes; i < io->size; i++, ioe++) { 4512 ioe->anchor[sizeof(ioe->anchor) - 1] = 0; 4513 switch (ioe->rs_num) { 4514 #ifdef ALTQ 4515 case PF_RULESET_ALTQ: 4516 if (ioe->anchor[0]) { 4517 PF_RULES_WUNLOCK(); 4518 free(ioes, M_TEMP); 4519 error = EINVAL; 4520 goto fail; 4521 } 4522 if (!V_altqs_inactive_open || ioe->ticket != 4523 V_ticket_altqs_inactive) { 4524 PF_RULES_WUNLOCK(); 4525 free(ioes, M_TEMP); 4526 error = EBUSY; 4527 goto fail; 4528 } 4529 break; 4530 #endif /* ALTQ */ 4531 case PF_RULESET_TABLE: 4532 rs = pf_find_kruleset(ioe->anchor); 4533 if (rs == NULL || !rs->topen || ioe->ticket != 4534 rs->tticket) { 4535 PF_RULES_WUNLOCK(); 4536 free(ioes, M_TEMP); 4537 error = EBUSY; 4538 goto fail; 4539 } 4540 break; 4541 default: 4542 if (ioe->rs_num < 0 || ioe->rs_num >= 4543 PF_RULESET_MAX) { 4544 PF_RULES_WUNLOCK(); 4545 free(ioes, M_TEMP); 4546 error = EINVAL; 4547 goto fail; 4548 } 4549 rs = pf_find_kruleset(ioe->anchor); 4550 if (rs == NULL || 4551 !rs->rules[ioe->rs_num].inactive.open || 4552 rs->rules[ioe->rs_num].inactive.ticket != 4553 ioe->ticket) { 4554 PF_RULES_WUNLOCK(); 4555 free(ioes, M_TEMP); 4556 error = EBUSY; 4557 goto fail; 4558 } 4559 break; 4560 } 4561 } 4562 /* Now do the commit - no errors should happen here. */ 4563 for (i = 0, ioe = ioes; i < io->size; i++, ioe++) { 4564 switch (ioe->rs_num) { 4565 #ifdef ALTQ 4566 case PF_RULESET_ALTQ: 4567 if ((error = pf_commit_altq(ioe->ticket))) { 4568 PF_RULES_WUNLOCK(); 4569 free(ioes, M_TEMP); 4570 goto fail; /* really bad */ 4571 } 4572 break; 4573 #endif /* ALTQ */ 4574 case PF_RULESET_TABLE: 4575 { 4576 struct pfr_table table; 4577 4578 bzero(&table, sizeof(table)); 4579 (void)strlcpy(table.pfrt_anchor, ioe->anchor, 4580 sizeof(table.pfrt_anchor)); 4581 if ((error = pfr_ina_commit(&table, 4582 ioe->ticket, NULL, NULL, 0))) { 4583 PF_RULES_WUNLOCK(); 4584 free(ioes, M_TEMP); 4585 goto fail; /* really bad */ 4586 } 4587 break; 4588 } 4589 default: 4590 if ((error = pf_commit_rules(ioe->ticket, 4591 ioe->rs_num, ioe->anchor))) { 4592 PF_RULES_WUNLOCK(); 4593 free(ioes, M_TEMP); 4594 goto fail; /* really bad */ 4595 } 4596 break; 4597 } 4598 } 4599 PF_RULES_WUNLOCK(); 4600 free(ioes, M_TEMP); 4601 break; 4602 } 4603 4604 case DIOCGETSRCNODES: { 4605 struct pfioc_src_nodes *psn = (struct pfioc_src_nodes *)addr; 4606 struct pf_srchash *sh; 4607 struct pf_ksrc_node *n; 4608 struct pf_src_node *p, *pstore; 4609 uint32_t i, nr = 0; 4610 4611 for (i = 0, sh = V_pf_srchash; i <= pf_srchashmask; 4612 i++, sh++) { 4613 PF_HASHROW_LOCK(sh); 4614 LIST_FOREACH(n, &sh->nodes, entry) 4615 nr++; 4616 PF_HASHROW_UNLOCK(sh); 4617 } 4618 4619 psn->psn_len = min(psn->psn_len, 4620 sizeof(struct pf_src_node) * nr); 4621 4622 if (psn->psn_len == 0) { 4623 psn->psn_len = sizeof(struct pf_src_node) * nr; 4624 break; 4625 } 4626 4627 nr = 0; 4628 4629 p = pstore = malloc(psn->psn_len, M_TEMP, M_WAITOK | M_ZERO); 4630 for (i = 0, sh = V_pf_srchash; i <= pf_srchashmask; 4631 i++, sh++) { 4632 PF_HASHROW_LOCK(sh); 4633 LIST_FOREACH(n, &sh->nodes, entry) { 4634 4635 if ((nr + 1) * sizeof(*p) > (unsigned)psn->psn_len) 4636 break; 4637 4638 pf_src_node_copy(n, p); 4639 4640 p++; 4641 nr++; 4642 } 4643 PF_HASHROW_UNLOCK(sh); 4644 } 4645 error = copyout(pstore, psn->psn_src_nodes, 4646 sizeof(struct pf_src_node) * nr); 4647 if (error) { 4648 free(pstore, M_TEMP); 4649 break; 4650 } 4651 psn->psn_len = sizeof(struct pf_src_node) * nr; 4652 free(pstore, M_TEMP); 4653 break; 4654 } 4655 4656 case DIOCCLRSRCNODES: { 4657 pf_clear_srcnodes(NULL); 4658 pf_purge_expired_src_nodes(); 4659 break; 4660 } 4661 4662 case DIOCKILLSRCNODES: 4663 pf_kill_srcnodes((struct pfioc_src_node_kill *)addr); 4664 break; 4665 4666 case DIOCKEEPCOUNTERS: 4667 error = pf_keepcounters((struct pfioc_nv *)addr); 4668 break; 4669 4670 case DIOCGETSYNCOOKIES: 4671 error = pf_get_syncookies((struct pfioc_nv *)addr); 4672 break; 4673 4674 case DIOCSETSYNCOOKIES: 4675 error = pf_set_syncookies((struct pfioc_nv *)addr); 4676 break; 4677 4678 case DIOCSETHOSTID: { 4679 u_int32_t *hostid = (u_int32_t *)addr; 4680 4681 PF_RULES_WLOCK(); 4682 if (*hostid == 0) 4683 V_pf_status.hostid = arc4random(); 4684 else 4685 V_pf_status.hostid = *hostid; 4686 PF_RULES_WUNLOCK(); 4687 break; 4688 } 4689 4690 case DIOCOSFPFLUSH: 4691 PF_RULES_WLOCK(); 4692 pf_osfp_flush(); 4693 PF_RULES_WUNLOCK(); 4694 break; 4695 4696 case DIOCIGETIFACES: { 4697 struct pfioc_iface *io = (struct pfioc_iface *)addr; 4698 struct pfi_kif *ifstore; 4699 size_t bufsiz; 4700 4701 if (io->pfiio_esize != sizeof(struct pfi_kif)) { 4702 error = ENODEV; 4703 break; 4704 } 4705 4706 if (io->pfiio_size < 0 || 4707 io->pfiio_size > pf_ioctl_maxcount || 4708 WOULD_OVERFLOW(io->pfiio_size, sizeof(struct pfi_kif))) { 4709 error = EINVAL; 4710 break; 4711 } 4712 4713 bufsiz = io->pfiio_size * sizeof(struct pfi_kif); 4714 ifstore = mallocarray(io->pfiio_size, sizeof(struct pfi_kif), 4715 M_TEMP, M_WAITOK | M_ZERO); 4716 4717 PF_RULES_RLOCK(); 4718 pfi_get_ifaces(io->pfiio_name, ifstore, &io->pfiio_size); 4719 PF_RULES_RUNLOCK(); 4720 error = copyout(ifstore, io->pfiio_buffer, bufsiz); 4721 free(ifstore, M_TEMP); 4722 break; 4723 } 4724 4725 case DIOCSETIFFLAG: { 4726 struct pfioc_iface *io = (struct pfioc_iface *)addr; 4727 4728 PF_RULES_WLOCK(); 4729 error = pfi_set_flags(io->pfiio_name, io->pfiio_flags); 4730 PF_RULES_WUNLOCK(); 4731 break; 4732 } 4733 4734 case DIOCCLRIFFLAG: { 4735 struct pfioc_iface *io = (struct pfioc_iface *)addr; 4736 4737 PF_RULES_WLOCK(); 4738 error = pfi_clear_flags(io->pfiio_name, io->pfiio_flags); 4739 PF_RULES_WUNLOCK(); 4740 break; 4741 } 4742 4743 default: 4744 error = ENODEV; 4745 break; 4746 } 4747 fail: 4748 if (sx_xlocked(&pf_ioctl_lock)) 4749 sx_xunlock(&pf_ioctl_lock); 4750 CURVNET_RESTORE(); 4751 4752 #undef ERROUT_IOCTL 4753 4754 return (error); 4755 } 4756 4757 void 4758 pfsync_state_export(struct pfsync_state *sp, struct pf_kstate *st) 4759 { 4760 bzero(sp, sizeof(struct pfsync_state)); 4761 4762 /* copy from state key */ 4763 sp->key[PF_SK_WIRE].addr[0] = st->key[PF_SK_WIRE]->addr[0]; 4764 sp->key[PF_SK_WIRE].addr[1] = st->key[PF_SK_WIRE]->addr[1]; 4765 sp->key[PF_SK_WIRE].port[0] = st->key[PF_SK_WIRE]->port[0]; 4766 sp->key[PF_SK_WIRE].port[1] = st->key[PF_SK_WIRE]->port[1]; 4767 sp->key[PF_SK_STACK].addr[0] = st->key[PF_SK_STACK]->addr[0]; 4768 sp->key[PF_SK_STACK].addr[1] = st->key[PF_SK_STACK]->addr[1]; 4769 sp->key[PF_SK_STACK].port[0] = st->key[PF_SK_STACK]->port[0]; 4770 sp->key[PF_SK_STACK].port[1] = st->key[PF_SK_STACK]->port[1]; 4771 sp->proto = st->key[PF_SK_WIRE]->proto; 4772 sp->af = st->key[PF_SK_WIRE]->af; 4773 4774 /* copy from state */ 4775 strlcpy(sp->ifname, st->kif->pfik_name, sizeof(sp->ifname)); 4776 bcopy(&st->rt_addr, &sp->rt_addr, sizeof(sp->rt_addr)); 4777 sp->creation = htonl(time_uptime - st->creation); 4778 sp->expire = pf_state_expires(st); 4779 if (sp->expire <= time_uptime) 4780 sp->expire = htonl(0); 4781 else 4782 sp->expire = htonl(sp->expire - time_uptime); 4783 4784 sp->direction = st->direction; 4785 sp->log = st->log; 4786 sp->timeout = st->timeout; 4787 sp->state_flags = st->state_flags; 4788 if (st->src_node) 4789 sp->sync_flags |= PFSYNC_FLAG_SRCNODE; 4790 if (st->nat_src_node) 4791 sp->sync_flags |= PFSYNC_FLAG_NATSRCNODE; 4792 4793 sp->id = st->id; 4794 sp->creatorid = st->creatorid; 4795 pf_state_peer_hton(&st->src, &sp->src); 4796 pf_state_peer_hton(&st->dst, &sp->dst); 4797 4798 if (st->rule.ptr == NULL) 4799 sp->rule = htonl(-1); 4800 else 4801 sp->rule = htonl(st->rule.ptr->nr); 4802 if (st->anchor.ptr == NULL) 4803 sp->anchor = htonl(-1); 4804 else 4805 sp->anchor = htonl(st->anchor.ptr->nr); 4806 if (st->nat_rule.ptr == NULL) 4807 sp->nat_rule = htonl(-1); 4808 else 4809 sp->nat_rule = htonl(st->nat_rule.ptr->nr); 4810 4811 pf_state_counter_hton(st->packets[0], sp->packets[0]); 4812 pf_state_counter_hton(st->packets[1], sp->packets[1]); 4813 pf_state_counter_hton(st->bytes[0], sp->bytes[0]); 4814 pf_state_counter_hton(st->bytes[1], sp->bytes[1]); 4815 } 4816 4817 void 4818 pf_state_export(struct pf_state_export *sp, struct pf_kstate *st) 4819 { 4820 bzero(sp, sizeof(*sp)); 4821 4822 sp->version = PF_STATE_VERSION; 4823 4824 /* copy from state key */ 4825 sp->key[PF_SK_WIRE].addr[0] = st->key[PF_SK_WIRE]->addr[0]; 4826 sp->key[PF_SK_WIRE].addr[1] = st->key[PF_SK_WIRE]->addr[1]; 4827 sp->key[PF_SK_WIRE].port[0] = st->key[PF_SK_WIRE]->port[0]; 4828 sp->key[PF_SK_WIRE].port[1] = st->key[PF_SK_WIRE]->port[1]; 4829 sp->key[PF_SK_STACK].addr[0] = st->key[PF_SK_STACK]->addr[0]; 4830 sp->key[PF_SK_STACK].addr[1] = st->key[PF_SK_STACK]->addr[1]; 4831 sp->key[PF_SK_STACK].port[0] = st->key[PF_SK_STACK]->port[0]; 4832 sp->key[PF_SK_STACK].port[1] = st->key[PF_SK_STACK]->port[1]; 4833 sp->proto = st->key[PF_SK_WIRE]->proto; 4834 sp->af = st->key[PF_SK_WIRE]->af; 4835 4836 /* copy from state */ 4837 strlcpy(sp->ifname, st->kif->pfik_name, sizeof(sp->ifname)); 4838 strlcpy(sp->orig_ifname, st->orig_kif->pfik_name, 4839 sizeof(sp->orig_ifname)); 4840 bcopy(&st->rt_addr, &sp->rt_addr, sizeof(sp->rt_addr)); 4841 sp->creation = htonl(time_uptime - st->creation); 4842 sp->expire = pf_state_expires(st); 4843 if (sp->expire <= time_uptime) 4844 sp->expire = htonl(0); 4845 else 4846 sp->expire = htonl(sp->expire - time_uptime); 4847 4848 sp->direction = st->direction; 4849 sp->log = st->log; 4850 sp->timeout = st->timeout; 4851 sp->state_flags = st->state_flags; 4852 if (st->src_node) 4853 sp->sync_flags |= PFSYNC_FLAG_SRCNODE; 4854 if (st->nat_src_node) 4855 sp->sync_flags |= PFSYNC_FLAG_NATSRCNODE; 4856 4857 sp->id = st->id; 4858 sp->creatorid = st->creatorid; 4859 pf_state_peer_hton(&st->src, &sp->src); 4860 pf_state_peer_hton(&st->dst, &sp->dst); 4861 4862 if (st->rule.ptr == NULL) 4863 sp->rule = htonl(-1); 4864 else 4865 sp->rule = htonl(st->rule.ptr->nr); 4866 if (st->anchor.ptr == NULL) 4867 sp->anchor = htonl(-1); 4868 else 4869 sp->anchor = htonl(st->anchor.ptr->nr); 4870 if (st->nat_rule.ptr == NULL) 4871 sp->nat_rule = htonl(-1); 4872 else 4873 sp->nat_rule = htonl(st->nat_rule.ptr->nr); 4874 4875 sp->packets[0] = st->packets[0]; 4876 sp->packets[1] = st->packets[1]; 4877 sp->bytes[0] = st->bytes[0]; 4878 sp->bytes[1] = st->bytes[1]; 4879 } 4880 4881 static void 4882 pf_tbladdr_copyout(struct pf_addr_wrap *aw) 4883 { 4884 struct pfr_ktable *kt; 4885 4886 KASSERT(aw->type == PF_ADDR_TABLE, ("%s: type %u", __func__, aw->type)); 4887 4888 kt = aw->p.tbl; 4889 if (!(kt->pfrkt_flags & PFR_TFLAG_ACTIVE) && kt->pfrkt_root != NULL) 4890 kt = kt->pfrkt_root; 4891 aw->p.tbl = NULL; 4892 aw->p.tblcnt = (kt->pfrkt_flags & PFR_TFLAG_ACTIVE) ? 4893 kt->pfrkt_cnt : -1; 4894 } 4895 4896 static int 4897 pf_add_status_counters(nvlist_t *nvl, const char *name, counter_u64_t *counters, 4898 size_t number, char **names) 4899 { 4900 nvlist_t *nvc; 4901 4902 nvc = nvlist_create(0); 4903 if (nvc == NULL) 4904 return (ENOMEM); 4905 4906 for (int i = 0; i < number; i++) { 4907 nvlist_append_number_array(nvc, "counters", 4908 counter_u64_fetch(counters[i])); 4909 nvlist_append_string_array(nvc, "names", 4910 names[i]); 4911 nvlist_append_number_array(nvc, "ids", 4912 i); 4913 } 4914 nvlist_add_nvlist(nvl, name, nvc); 4915 nvlist_destroy(nvc); 4916 4917 return (0); 4918 } 4919 4920 static int 4921 pf_getstatus(struct pfioc_nv *nv) 4922 { 4923 nvlist_t *nvl = NULL, *nvc = NULL; 4924 void *nvlpacked = NULL; 4925 int error; 4926 struct pf_status s; 4927 char *pf_reasons[PFRES_MAX+1] = PFRES_NAMES; 4928 char *pf_lcounter[KLCNT_MAX+1] = KLCNT_NAMES; 4929 char *pf_fcounter[FCNT_MAX+1] = FCNT_NAMES; 4930 PF_RULES_RLOCK_TRACKER; 4931 4932 #define ERROUT(x) ERROUT_FUNCTION(errout, x) 4933 4934 PF_RULES_RLOCK(); 4935 4936 nvl = nvlist_create(0); 4937 if (nvl == NULL) 4938 ERROUT(ENOMEM); 4939 4940 nvlist_add_bool(nvl, "running", V_pf_status.running); 4941 nvlist_add_number(nvl, "since", V_pf_status.since); 4942 nvlist_add_number(nvl, "debug", V_pf_status.debug); 4943 nvlist_add_number(nvl, "hostid", V_pf_status.hostid); 4944 nvlist_add_number(nvl, "states", V_pf_status.states); 4945 nvlist_add_number(nvl, "src_nodes", V_pf_status.src_nodes); 4946 4947 /* counters */ 4948 error = pf_add_status_counters(nvl, "counters", V_pf_status.counters, 4949 PFRES_MAX, pf_reasons); 4950 if (error != 0) 4951 ERROUT(error); 4952 4953 /* lcounters */ 4954 error = pf_add_status_counters(nvl, "lcounters", V_pf_status.lcounters, 4955 KLCNT_MAX, pf_lcounter); 4956 if (error != 0) 4957 ERROUT(error); 4958 4959 /* fcounters */ 4960 nvc = nvlist_create(0); 4961 if (nvc == NULL) 4962 ERROUT(ENOMEM); 4963 4964 for (int i = 0; i < FCNT_MAX; i++) { 4965 nvlist_append_number_array(nvc, "counters", 4966 pf_counter_u64_fetch(&V_pf_status.fcounters[i])); 4967 nvlist_append_string_array(nvc, "names", 4968 pf_fcounter[i]); 4969 nvlist_append_number_array(nvc, "ids", 4970 i); 4971 } 4972 nvlist_add_nvlist(nvl, "fcounters", nvc); 4973 nvlist_destroy(nvc); 4974 nvc = NULL; 4975 4976 /* scounters */ 4977 error = pf_add_status_counters(nvl, "scounters", V_pf_status.scounters, 4978 SCNT_MAX, pf_fcounter); 4979 if (error != 0) 4980 ERROUT(error); 4981 4982 nvlist_add_string(nvl, "ifname", V_pf_status.ifname); 4983 nvlist_add_binary(nvl, "chksum", V_pf_status.pf_chksum, 4984 PF_MD5_DIGEST_LENGTH); 4985 4986 pfi_update_status(V_pf_status.ifname, &s); 4987 4988 /* pcounters / bcounters */ 4989 for (int i = 0; i < 2; i++) { 4990 for (int j = 0; j < 2; j++) { 4991 for (int k = 0; k < 2; k++) { 4992 nvlist_append_number_array(nvl, "pcounters", 4993 s.pcounters[i][j][k]); 4994 } 4995 nvlist_append_number_array(nvl, "bcounters", 4996 s.bcounters[i][j]); 4997 } 4998 } 4999 5000 nvlpacked = nvlist_pack(nvl, &nv->len); 5001 if (nvlpacked == NULL) 5002 ERROUT(ENOMEM); 5003 5004 if (nv->size == 0) 5005 ERROUT(0); 5006 else if (nv->size < nv->len) 5007 ERROUT(ENOSPC); 5008 5009 PF_RULES_RUNLOCK(); 5010 error = copyout(nvlpacked, nv->data, nv->len); 5011 goto done; 5012 5013 #undef ERROUT 5014 errout: 5015 PF_RULES_RUNLOCK(); 5016 done: 5017 free(nvlpacked, M_NVLIST); 5018 nvlist_destroy(nvc); 5019 nvlist_destroy(nvl); 5020 5021 return (error); 5022 } 5023 5024 /* 5025 * XXX - Check for version missmatch!!! 5026 */ 5027 static void 5028 pf_clear_all_states(void) 5029 { 5030 struct pf_kstate *s; 5031 u_int i; 5032 5033 for (i = 0; i <= pf_hashmask; i++) { 5034 struct pf_idhash *ih = &V_pf_idhash[i]; 5035 relock: 5036 PF_HASHROW_LOCK(ih); 5037 LIST_FOREACH(s, &ih->states, entry) { 5038 s->timeout = PFTM_PURGE; 5039 /* Don't send out individual delete messages. */ 5040 s->state_flags |= PFSTATE_NOSYNC; 5041 pf_unlink_state(s, PF_ENTER_LOCKED); 5042 goto relock; 5043 } 5044 PF_HASHROW_UNLOCK(ih); 5045 } 5046 } 5047 5048 static int 5049 pf_clear_tables(void) 5050 { 5051 struct pfioc_table io; 5052 int error; 5053 5054 bzero(&io, sizeof(io)); 5055 5056 error = pfr_clr_tables(&io.pfrio_table, &io.pfrio_ndel, 5057 io.pfrio_flags); 5058 5059 return (error); 5060 } 5061 5062 static void 5063 pf_clear_srcnodes(struct pf_ksrc_node *n) 5064 { 5065 struct pf_kstate *s; 5066 int i; 5067 5068 for (i = 0; i <= pf_hashmask; i++) { 5069 struct pf_idhash *ih = &V_pf_idhash[i]; 5070 5071 PF_HASHROW_LOCK(ih); 5072 LIST_FOREACH(s, &ih->states, entry) { 5073 if (n == NULL || n == s->src_node) 5074 s->src_node = NULL; 5075 if (n == NULL || n == s->nat_src_node) 5076 s->nat_src_node = NULL; 5077 } 5078 PF_HASHROW_UNLOCK(ih); 5079 } 5080 5081 if (n == NULL) { 5082 struct pf_srchash *sh; 5083 5084 for (i = 0, sh = V_pf_srchash; i <= pf_srchashmask; 5085 i++, sh++) { 5086 PF_HASHROW_LOCK(sh); 5087 LIST_FOREACH(n, &sh->nodes, entry) { 5088 n->expire = 1; 5089 n->states = 0; 5090 } 5091 PF_HASHROW_UNLOCK(sh); 5092 } 5093 } else { 5094 /* XXX: hash slot should already be locked here. */ 5095 n->expire = 1; 5096 n->states = 0; 5097 } 5098 } 5099 5100 static void 5101 pf_kill_srcnodes(struct pfioc_src_node_kill *psnk) 5102 { 5103 struct pf_ksrc_node_list kill; 5104 5105 LIST_INIT(&kill); 5106 for (int i = 0; i <= pf_srchashmask; i++) { 5107 struct pf_srchash *sh = &V_pf_srchash[i]; 5108 struct pf_ksrc_node *sn, *tmp; 5109 5110 PF_HASHROW_LOCK(sh); 5111 LIST_FOREACH_SAFE(sn, &sh->nodes, entry, tmp) 5112 if (PF_MATCHA(psnk->psnk_src.neg, 5113 &psnk->psnk_src.addr.v.a.addr, 5114 &psnk->psnk_src.addr.v.a.mask, 5115 &sn->addr, sn->af) && 5116 PF_MATCHA(psnk->psnk_dst.neg, 5117 &psnk->psnk_dst.addr.v.a.addr, 5118 &psnk->psnk_dst.addr.v.a.mask, 5119 &sn->raddr, sn->af)) { 5120 pf_unlink_src_node(sn); 5121 LIST_INSERT_HEAD(&kill, sn, entry); 5122 sn->expire = 1; 5123 } 5124 PF_HASHROW_UNLOCK(sh); 5125 } 5126 5127 for (int i = 0; i <= pf_hashmask; i++) { 5128 struct pf_idhash *ih = &V_pf_idhash[i]; 5129 struct pf_kstate *s; 5130 5131 PF_HASHROW_LOCK(ih); 5132 LIST_FOREACH(s, &ih->states, entry) { 5133 if (s->src_node && s->src_node->expire == 1) 5134 s->src_node = NULL; 5135 if (s->nat_src_node && s->nat_src_node->expire == 1) 5136 s->nat_src_node = NULL; 5137 } 5138 PF_HASHROW_UNLOCK(ih); 5139 } 5140 5141 psnk->psnk_killed = pf_free_src_nodes(&kill); 5142 } 5143 5144 static int 5145 pf_keepcounters(struct pfioc_nv *nv) 5146 { 5147 nvlist_t *nvl = NULL; 5148 void *nvlpacked = NULL; 5149 int error = 0; 5150 5151 #define ERROUT(x) ERROUT_FUNCTION(on_error, x) 5152 5153 if (nv->len > pf_ioctl_maxcount) 5154 ERROUT(ENOMEM); 5155 5156 nvlpacked = malloc(nv->len, M_TEMP, M_WAITOK); 5157 if (nvlpacked == NULL) 5158 ERROUT(ENOMEM); 5159 5160 error = copyin(nv->data, nvlpacked, nv->len); 5161 if (error) 5162 ERROUT(error); 5163 5164 nvl = nvlist_unpack(nvlpacked, nv->len, 0); 5165 if (nvl == NULL) 5166 ERROUT(EBADMSG); 5167 5168 if (! nvlist_exists_bool(nvl, "keep_counters")) 5169 ERROUT(EBADMSG); 5170 5171 V_pf_status.keep_counters = nvlist_get_bool(nvl, "keep_counters"); 5172 5173 on_error: 5174 nvlist_destroy(nvl); 5175 free(nvlpacked, M_TEMP); 5176 return (error); 5177 } 5178 5179 static unsigned int 5180 pf_clear_states(const struct pf_kstate_kill *kill) 5181 { 5182 struct pf_state_key_cmp match_key; 5183 struct pf_kstate *s; 5184 struct pfi_kkif *kif; 5185 int idx; 5186 unsigned int killed = 0, dir; 5187 5188 for (unsigned int i = 0; i <= pf_hashmask; i++) { 5189 struct pf_idhash *ih = &V_pf_idhash[i]; 5190 5191 relock_DIOCCLRSTATES: 5192 PF_HASHROW_LOCK(ih); 5193 LIST_FOREACH(s, &ih->states, entry) { 5194 /* For floating states look at the original kif. */ 5195 kif = s->kif == V_pfi_all ? s->orig_kif : s->kif; 5196 5197 if (kill->psk_ifname[0] && 5198 strcmp(kill->psk_ifname, 5199 kif->pfik_name)) 5200 continue; 5201 5202 if (kill->psk_kill_match) { 5203 bzero(&match_key, sizeof(match_key)); 5204 5205 if (s->direction == PF_OUT) { 5206 dir = PF_IN; 5207 idx = PF_SK_STACK; 5208 } else { 5209 dir = PF_OUT; 5210 idx = PF_SK_WIRE; 5211 } 5212 5213 match_key.af = s->key[idx]->af; 5214 match_key.proto = s->key[idx]->proto; 5215 PF_ACPY(&match_key.addr[0], 5216 &s->key[idx]->addr[1], match_key.af); 5217 match_key.port[0] = s->key[idx]->port[1]; 5218 PF_ACPY(&match_key.addr[1], 5219 &s->key[idx]->addr[0], match_key.af); 5220 match_key.port[1] = s->key[idx]->port[0]; 5221 } 5222 5223 /* 5224 * Don't send out individual 5225 * delete messages. 5226 */ 5227 s->state_flags |= PFSTATE_NOSYNC; 5228 pf_unlink_state(s, PF_ENTER_LOCKED); 5229 killed++; 5230 5231 if (kill->psk_kill_match) 5232 killed += pf_kill_matching_state(&match_key, 5233 dir); 5234 5235 goto relock_DIOCCLRSTATES; 5236 } 5237 PF_HASHROW_UNLOCK(ih); 5238 } 5239 5240 if (V_pfsync_clear_states_ptr != NULL) 5241 V_pfsync_clear_states_ptr(V_pf_status.hostid, kill->psk_ifname); 5242 5243 return (killed); 5244 } 5245 5246 static void 5247 pf_killstates(struct pf_kstate_kill *kill, unsigned int *killed) 5248 { 5249 struct pf_kstate *s; 5250 5251 if (kill->psk_pfcmp.id) { 5252 if (kill->psk_pfcmp.creatorid == 0) 5253 kill->psk_pfcmp.creatorid = V_pf_status.hostid; 5254 if ((s = pf_find_state_byid(kill->psk_pfcmp.id, 5255 kill->psk_pfcmp.creatorid))) { 5256 pf_unlink_state(s, PF_ENTER_LOCKED); 5257 *killed = 1; 5258 } 5259 return; 5260 } 5261 5262 for (unsigned int i = 0; i <= pf_hashmask; i++) 5263 *killed += pf_killstates_row(kill, &V_pf_idhash[i]); 5264 5265 return; 5266 } 5267 5268 static int 5269 pf_killstates_nv(struct pfioc_nv *nv) 5270 { 5271 struct pf_kstate_kill kill; 5272 nvlist_t *nvl = NULL; 5273 void *nvlpacked = NULL; 5274 int error = 0; 5275 unsigned int killed = 0; 5276 5277 #define ERROUT(x) ERROUT_FUNCTION(on_error, x) 5278 5279 if (nv->len > pf_ioctl_maxcount) 5280 ERROUT(ENOMEM); 5281 5282 nvlpacked = malloc(nv->len, M_NVLIST, M_WAITOK); 5283 if (nvlpacked == NULL) 5284 ERROUT(ENOMEM); 5285 5286 error = copyin(nv->data, nvlpacked, nv->len); 5287 if (error) 5288 ERROUT(error); 5289 5290 nvl = nvlist_unpack(nvlpacked, nv->len, 0); 5291 if (nvl == NULL) 5292 ERROUT(EBADMSG); 5293 5294 error = pf_nvstate_kill_to_kstate_kill(nvl, &kill); 5295 if (error) 5296 ERROUT(error); 5297 5298 pf_killstates(&kill, &killed); 5299 5300 free(nvlpacked, M_NVLIST); 5301 nvlpacked = NULL; 5302 nvlist_destroy(nvl); 5303 nvl = nvlist_create(0); 5304 if (nvl == NULL) 5305 ERROUT(ENOMEM); 5306 5307 nvlist_add_number(nvl, "killed", killed); 5308 5309 nvlpacked = nvlist_pack(nvl, &nv->len); 5310 if (nvlpacked == NULL) 5311 ERROUT(ENOMEM); 5312 5313 if (nv->size == 0) 5314 ERROUT(0); 5315 else if (nv->size < nv->len) 5316 ERROUT(ENOSPC); 5317 5318 error = copyout(nvlpacked, nv->data, nv->len); 5319 5320 on_error: 5321 nvlist_destroy(nvl); 5322 free(nvlpacked, M_NVLIST); 5323 return (error); 5324 } 5325 5326 static int 5327 pf_clearstates_nv(struct pfioc_nv *nv) 5328 { 5329 struct pf_kstate_kill kill; 5330 nvlist_t *nvl = NULL; 5331 void *nvlpacked = NULL; 5332 int error = 0; 5333 unsigned int killed; 5334 5335 #define ERROUT(x) ERROUT_FUNCTION(on_error, x) 5336 5337 if (nv->len > pf_ioctl_maxcount) 5338 ERROUT(ENOMEM); 5339 5340 nvlpacked = malloc(nv->len, M_NVLIST, M_WAITOK); 5341 if (nvlpacked == NULL) 5342 ERROUT(ENOMEM); 5343 5344 error = copyin(nv->data, nvlpacked, nv->len); 5345 if (error) 5346 ERROUT(error); 5347 5348 nvl = nvlist_unpack(nvlpacked, nv->len, 0); 5349 if (nvl == NULL) 5350 ERROUT(EBADMSG); 5351 5352 error = pf_nvstate_kill_to_kstate_kill(nvl, &kill); 5353 if (error) 5354 ERROUT(error); 5355 5356 killed = pf_clear_states(&kill); 5357 5358 free(nvlpacked, M_NVLIST); 5359 nvlpacked = NULL; 5360 nvlist_destroy(nvl); 5361 nvl = nvlist_create(0); 5362 if (nvl == NULL) 5363 ERROUT(ENOMEM); 5364 5365 nvlist_add_number(nvl, "killed", killed); 5366 5367 nvlpacked = nvlist_pack(nvl, &nv->len); 5368 if (nvlpacked == NULL) 5369 ERROUT(ENOMEM); 5370 5371 if (nv->size == 0) 5372 ERROUT(0); 5373 else if (nv->size < nv->len) 5374 ERROUT(ENOSPC); 5375 5376 error = copyout(nvlpacked, nv->data, nv->len); 5377 5378 #undef ERROUT 5379 on_error: 5380 nvlist_destroy(nvl); 5381 free(nvlpacked, M_NVLIST); 5382 return (error); 5383 } 5384 5385 static int 5386 pf_getstate(struct pfioc_nv *nv) 5387 { 5388 nvlist_t *nvl = NULL, *nvls; 5389 void *nvlpacked = NULL; 5390 struct pf_kstate *s = NULL; 5391 int error = 0; 5392 uint64_t id, creatorid; 5393 5394 #define ERROUT(x) ERROUT_FUNCTION(errout, x) 5395 5396 if (nv->len > pf_ioctl_maxcount) 5397 ERROUT(ENOMEM); 5398 5399 nvlpacked = malloc(nv->len, M_NVLIST, M_WAITOK); 5400 if (nvlpacked == NULL) 5401 ERROUT(ENOMEM); 5402 5403 error = copyin(nv->data, nvlpacked, nv->len); 5404 if (error) 5405 ERROUT(error); 5406 5407 nvl = nvlist_unpack(nvlpacked, nv->len, 0); 5408 if (nvl == NULL) 5409 ERROUT(EBADMSG); 5410 5411 PFNV_CHK(pf_nvuint64(nvl, "id", &id)); 5412 PFNV_CHK(pf_nvuint64(nvl, "creatorid", &creatorid)); 5413 5414 s = pf_find_state_byid(id, creatorid); 5415 if (s == NULL) 5416 ERROUT(ENOENT); 5417 5418 free(nvlpacked, M_NVLIST); 5419 nvlpacked = NULL; 5420 nvlist_destroy(nvl); 5421 nvl = nvlist_create(0); 5422 if (nvl == NULL) 5423 ERROUT(ENOMEM); 5424 5425 nvls = pf_state_to_nvstate(s); 5426 if (nvls == NULL) 5427 ERROUT(ENOMEM); 5428 5429 nvlist_add_nvlist(nvl, "state", nvls); 5430 nvlist_destroy(nvls); 5431 5432 nvlpacked = nvlist_pack(nvl, &nv->len); 5433 if (nvlpacked == NULL) 5434 ERROUT(ENOMEM); 5435 5436 if (nv->size == 0) 5437 ERROUT(0); 5438 else if (nv->size < nv->len) 5439 ERROUT(ENOSPC); 5440 5441 error = copyout(nvlpacked, nv->data, nv->len); 5442 5443 #undef ERROUT 5444 errout: 5445 if (s != NULL) 5446 PF_STATE_UNLOCK(s); 5447 free(nvlpacked, M_NVLIST); 5448 nvlist_destroy(nvl); 5449 return (error); 5450 } 5451 5452 /* 5453 * XXX - Check for version missmatch!!! 5454 */ 5455 5456 /* 5457 * Duplicate pfctl -Fa operation to get rid of as much as we can. 5458 */ 5459 static int 5460 shutdown_pf(void) 5461 { 5462 int error = 0; 5463 u_int32_t t[5]; 5464 char nn = '\0'; 5465 5466 do { 5467 if ((error = pf_begin_rules(&t[0], PF_RULESET_SCRUB, &nn)) 5468 != 0) { 5469 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: SCRUB\n")); 5470 break; 5471 } 5472 if ((error = pf_begin_rules(&t[1], PF_RULESET_FILTER, &nn)) 5473 != 0) { 5474 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: FILTER\n")); 5475 break; /* XXX: rollback? */ 5476 } 5477 if ((error = pf_begin_rules(&t[2], PF_RULESET_NAT, &nn)) 5478 != 0) { 5479 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: NAT\n")); 5480 break; /* XXX: rollback? */ 5481 } 5482 if ((error = pf_begin_rules(&t[3], PF_RULESET_BINAT, &nn)) 5483 != 0) { 5484 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: BINAT\n")); 5485 break; /* XXX: rollback? */ 5486 } 5487 if ((error = pf_begin_rules(&t[4], PF_RULESET_RDR, &nn)) 5488 != 0) { 5489 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: RDR\n")); 5490 break; /* XXX: rollback? */ 5491 } 5492 5493 /* XXX: these should always succeed here */ 5494 pf_commit_rules(t[0], PF_RULESET_SCRUB, &nn); 5495 pf_commit_rules(t[1], PF_RULESET_FILTER, &nn); 5496 pf_commit_rules(t[2], PF_RULESET_NAT, &nn); 5497 pf_commit_rules(t[3], PF_RULESET_BINAT, &nn); 5498 pf_commit_rules(t[4], PF_RULESET_RDR, &nn); 5499 5500 if ((error = pf_clear_tables()) != 0) 5501 break; 5502 5503 #ifdef ALTQ 5504 if ((error = pf_begin_altq(&t[0])) != 0) { 5505 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: ALTQ\n")); 5506 break; 5507 } 5508 pf_commit_altq(t[0]); 5509 #endif 5510 5511 pf_clear_all_states(); 5512 5513 pf_clear_srcnodes(NULL); 5514 5515 /* status does not use malloced mem so no need to cleanup */ 5516 /* fingerprints and interfaces have their own cleanup code */ 5517 } while(0); 5518 5519 return (error); 5520 } 5521 5522 static pfil_return_t 5523 pf_check_return(int chk, struct mbuf **m) 5524 { 5525 5526 switch (chk) { 5527 case PF_PASS: 5528 if (*m == NULL) 5529 return (PFIL_CONSUMED); 5530 else 5531 return (PFIL_PASS); 5532 break; 5533 default: 5534 if (*m != NULL) { 5535 m_freem(*m); 5536 *m = NULL; 5537 } 5538 return (PFIL_DROPPED); 5539 } 5540 } 5541 5542 #ifdef INET 5543 static pfil_return_t 5544 pf_check_in(struct mbuf **m, struct ifnet *ifp, int flags, 5545 void *ruleset __unused, struct inpcb *inp) 5546 { 5547 int chk; 5548 5549 chk = pf_test(PF_IN, flags, ifp, m, inp); 5550 5551 return (pf_check_return(chk, m)); 5552 } 5553 5554 static pfil_return_t 5555 pf_check_out(struct mbuf **m, struct ifnet *ifp, int flags, 5556 void *ruleset __unused, struct inpcb *inp) 5557 { 5558 int chk; 5559 5560 chk = pf_test(PF_OUT, flags, ifp, m, inp); 5561 5562 return (pf_check_return(chk, m)); 5563 } 5564 #endif 5565 5566 #ifdef INET6 5567 static pfil_return_t 5568 pf_check6_in(struct mbuf **m, struct ifnet *ifp, int flags, 5569 void *ruleset __unused, struct inpcb *inp) 5570 { 5571 int chk; 5572 5573 /* 5574 * In case of loopback traffic IPv6 uses the real interface in 5575 * order to support scoped addresses. In order to support stateful 5576 * filtering we have change this to lo0 as it is the case in IPv4. 5577 */ 5578 CURVNET_SET(ifp->if_vnet); 5579 chk = pf_test6(PF_IN, flags, (*m)->m_flags & M_LOOP ? V_loif : ifp, m, inp); 5580 CURVNET_RESTORE(); 5581 5582 return (pf_check_return(chk, m)); 5583 } 5584 5585 static pfil_return_t 5586 pf_check6_out(struct mbuf **m, struct ifnet *ifp, int flags, 5587 void *ruleset __unused, struct inpcb *inp) 5588 { 5589 int chk; 5590 5591 CURVNET_SET(ifp->if_vnet); 5592 chk = pf_test6(PF_OUT, flags, ifp, m, inp); 5593 CURVNET_RESTORE(); 5594 5595 return (pf_check_return(chk, m)); 5596 } 5597 #endif /* INET6 */ 5598 5599 #ifdef INET 5600 VNET_DEFINE_STATIC(pfil_hook_t, pf_ip4_in_hook); 5601 VNET_DEFINE_STATIC(pfil_hook_t, pf_ip4_out_hook); 5602 #define V_pf_ip4_in_hook VNET(pf_ip4_in_hook) 5603 #define V_pf_ip4_out_hook VNET(pf_ip4_out_hook) 5604 #endif 5605 #ifdef INET6 5606 VNET_DEFINE_STATIC(pfil_hook_t, pf_ip6_in_hook); 5607 VNET_DEFINE_STATIC(pfil_hook_t, pf_ip6_out_hook); 5608 #define V_pf_ip6_in_hook VNET(pf_ip6_in_hook) 5609 #define V_pf_ip6_out_hook VNET(pf_ip6_out_hook) 5610 #endif 5611 5612 static void 5613 hook_pf(void) 5614 { 5615 struct pfil_hook_args pha; 5616 struct pfil_link_args pla; 5617 int ret; 5618 5619 if (V_pf_pfil_hooked) 5620 return; 5621 5622 pha.pa_version = PFIL_VERSION; 5623 pha.pa_modname = "pf"; 5624 pha.pa_ruleset = NULL; 5625 5626 pla.pa_version = PFIL_VERSION; 5627 5628 #ifdef INET 5629 pha.pa_type = PFIL_TYPE_IP4; 5630 pha.pa_func = pf_check_in; 5631 pha.pa_flags = PFIL_IN; 5632 pha.pa_rulname = "default-in"; 5633 V_pf_ip4_in_hook = pfil_add_hook(&pha); 5634 pla.pa_flags = PFIL_IN | PFIL_HEADPTR | PFIL_HOOKPTR; 5635 pla.pa_head = V_inet_pfil_head; 5636 pla.pa_hook = V_pf_ip4_in_hook; 5637 ret = pfil_link(&pla); 5638 MPASS(ret == 0); 5639 pha.pa_func = pf_check_out; 5640 pha.pa_flags = PFIL_OUT; 5641 pha.pa_rulname = "default-out"; 5642 V_pf_ip4_out_hook = pfil_add_hook(&pha); 5643 pla.pa_flags = PFIL_OUT | PFIL_HEADPTR | PFIL_HOOKPTR; 5644 pla.pa_head = V_inet_pfil_head; 5645 pla.pa_hook = V_pf_ip4_out_hook; 5646 ret = pfil_link(&pla); 5647 MPASS(ret == 0); 5648 #endif 5649 #ifdef INET6 5650 pha.pa_type = PFIL_TYPE_IP6; 5651 pha.pa_func = pf_check6_in; 5652 pha.pa_flags = PFIL_IN; 5653 pha.pa_rulname = "default-in6"; 5654 V_pf_ip6_in_hook = pfil_add_hook(&pha); 5655 pla.pa_flags = PFIL_IN | PFIL_HEADPTR | PFIL_HOOKPTR; 5656 pla.pa_head = V_inet6_pfil_head; 5657 pla.pa_hook = V_pf_ip6_in_hook; 5658 ret = pfil_link(&pla); 5659 MPASS(ret == 0); 5660 pha.pa_func = pf_check6_out; 5661 pha.pa_rulname = "default-out6"; 5662 pha.pa_flags = PFIL_OUT; 5663 V_pf_ip6_out_hook = pfil_add_hook(&pha); 5664 pla.pa_flags = PFIL_OUT | PFIL_HEADPTR | PFIL_HOOKPTR; 5665 pla.pa_head = V_inet6_pfil_head; 5666 pla.pa_hook = V_pf_ip6_out_hook; 5667 ret = pfil_link(&pla); 5668 MPASS(ret == 0); 5669 #endif 5670 5671 V_pf_pfil_hooked = 1; 5672 } 5673 5674 static void 5675 dehook_pf(void) 5676 { 5677 5678 if (V_pf_pfil_hooked == 0) 5679 return; 5680 5681 #ifdef INET 5682 pfil_remove_hook(V_pf_ip4_in_hook); 5683 pfil_remove_hook(V_pf_ip4_out_hook); 5684 #endif 5685 #ifdef INET6 5686 pfil_remove_hook(V_pf_ip6_in_hook); 5687 pfil_remove_hook(V_pf_ip6_out_hook); 5688 #endif 5689 5690 V_pf_pfil_hooked = 0; 5691 } 5692 5693 static void 5694 pf_load_vnet(void) 5695 { 5696 V_pf_tag_z = uma_zcreate("pf tags", sizeof(struct pf_tagname), 5697 NULL, NULL, NULL, NULL, UMA_ALIGN_PTR, 0); 5698 5699 pf_init_tagset(&V_pf_tags, &pf_rule_tag_hashsize, 5700 PF_RULE_TAG_HASH_SIZE_DEFAULT); 5701 #ifdef ALTQ 5702 pf_init_tagset(&V_pf_qids, &pf_queue_tag_hashsize, 5703 PF_QUEUE_TAG_HASH_SIZE_DEFAULT); 5704 #endif 5705 5706 pfattach_vnet(); 5707 V_pf_vnet_active = 1; 5708 } 5709 5710 static int 5711 pf_load(void) 5712 { 5713 int error; 5714 5715 rm_init_flags(&pf_rules_lock, "pf rulesets", RM_RECURSE); 5716 sx_init(&pf_ioctl_lock, "pf ioctl"); 5717 sx_init(&pf_end_lock, "pf end thread"); 5718 5719 pf_mtag_initialize(); 5720 5721 pf_dev = make_dev(&pf_cdevsw, 0, UID_ROOT, GID_WHEEL, 0600, PF_NAME); 5722 if (pf_dev == NULL) 5723 return (ENOMEM); 5724 5725 pf_end_threads = 0; 5726 error = kproc_create(pf_purge_thread, NULL, &pf_purge_proc, 0, 0, "pf purge"); 5727 if (error != 0) 5728 return (error); 5729 5730 pfi_initialize(); 5731 5732 return (0); 5733 } 5734 5735 static void 5736 pf_unload_vnet(void) 5737 { 5738 int ret; 5739 5740 V_pf_vnet_active = 0; 5741 V_pf_status.running = 0; 5742 dehook_pf(); 5743 5744 PF_RULES_WLOCK(); 5745 pf_syncookies_cleanup(); 5746 shutdown_pf(); 5747 PF_RULES_WUNLOCK(); 5748 5749 ret = swi_remove(V_pf_swi_cookie); 5750 MPASS(ret == 0); 5751 ret = intr_event_destroy(V_pf_swi_ie); 5752 MPASS(ret == 0); 5753 5754 pf_unload_vnet_purge(); 5755 5756 pf_normalize_cleanup(); 5757 PF_RULES_WLOCK(); 5758 pfi_cleanup_vnet(); 5759 PF_RULES_WUNLOCK(); 5760 pfr_cleanup(); 5761 pf_osfp_flush(); 5762 pf_cleanup(); 5763 if (IS_DEFAULT_VNET(curvnet)) 5764 pf_mtag_cleanup(); 5765 5766 pf_cleanup_tagset(&V_pf_tags); 5767 #ifdef ALTQ 5768 pf_cleanup_tagset(&V_pf_qids); 5769 #endif 5770 uma_zdestroy(V_pf_tag_z); 5771 5772 #ifdef PF_WANT_32_TO_64_COUNTER 5773 PF_RULES_WLOCK(); 5774 LIST_REMOVE(V_pf_kifmarker, pfik_allkiflist); 5775 5776 MPASS(LIST_EMPTY(&V_pf_allkiflist)); 5777 MPASS(V_pf_allkifcount == 0); 5778 5779 LIST_REMOVE(&V_pf_default_rule, allrulelist); 5780 V_pf_allrulecount--; 5781 LIST_REMOVE(V_pf_rulemarker, allrulelist); 5782 5783 /* 5784 * There are known pf rule leaks when running the test suite. 5785 */ 5786 #ifdef notyet 5787 MPASS(LIST_EMPTY(&V_pf_allrulelist)); 5788 MPASS(V_pf_allrulecount == 0); 5789 #endif 5790 5791 PF_RULES_WUNLOCK(); 5792 5793 free(V_pf_kifmarker, PFI_MTYPE); 5794 free(V_pf_rulemarker, M_PFRULE); 5795 #endif 5796 5797 /* Free counters last as we updated them during shutdown. */ 5798 pf_counter_u64_deinit(&V_pf_default_rule.evaluations); 5799 for (int i = 0; i < 2; i++) { 5800 pf_counter_u64_deinit(&V_pf_default_rule.packets[i]); 5801 pf_counter_u64_deinit(&V_pf_default_rule.bytes[i]); 5802 } 5803 counter_u64_free(V_pf_default_rule.states_cur); 5804 counter_u64_free(V_pf_default_rule.states_tot); 5805 counter_u64_free(V_pf_default_rule.src_nodes); 5806 5807 for (int i = 0; i < PFRES_MAX; i++) 5808 counter_u64_free(V_pf_status.counters[i]); 5809 for (int i = 0; i < KLCNT_MAX; i++) 5810 counter_u64_free(V_pf_status.lcounters[i]); 5811 for (int i = 0; i < FCNT_MAX; i++) 5812 pf_counter_u64_deinit(&V_pf_status.fcounters[i]); 5813 for (int i = 0; i < SCNT_MAX; i++) 5814 counter_u64_free(V_pf_status.scounters[i]); 5815 } 5816 5817 static void 5818 pf_unload(void) 5819 { 5820 5821 sx_xlock(&pf_end_lock); 5822 pf_end_threads = 1; 5823 while (pf_end_threads < 2) { 5824 wakeup_one(pf_purge_thread); 5825 sx_sleep(pf_purge_proc, &pf_end_lock, 0, "pftmo", 0); 5826 } 5827 sx_xunlock(&pf_end_lock); 5828 5829 if (pf_dev != NULL) 5830 destroy_dev(pf_dev); 5831 5832 pfi_cleanup(); 5833 5834 rm_destroy(&pf_rules_lock); 5835 sx_destroy(&pf_ioctl_lock); 5836 sx_destroy(&pf_end_lock); 5837 } 5838 5839 static void 5840 vnet_pf_init(void *unused __unused) 5841 { 5842 5843 pf_load_vnet(); 5844 } 5845 VNET_SYSINIT(vnet_pf_init, SI_SUB_PROTO_FIREWALL, SI_ORDER_THIRD, 5846 vnet_pf_init, NULL); 5847 5848 static void 5849 vnet_pf_uninit(const void *unused __unused) 5850 { 5851 5852 pf_unload_vnet(); 5853 } 5854 SYSUNINIT(pf_unload, SI_SUB_PROTO_FIREWALL, SI_ORDER_SECOND, pf_unload, NULL); 5855 VNET_SYSUNINIT(vnet_pf_uninit, SI_SUB_PROTO_FIREWALL, SI_ORDER_THIRD, 5856 vnet_pf_uninit, NULL); 5857 5858 static int 5859 pf_modevent(module_t mod, int type, void *data) 5860 { 5861 int error = 0; 5862 5863 switch(type) { 5864 case MOD_LOAD: 5865 error = pf_load(); 5866 break; 5867 case MOD_UNLOAD: 5868 /* Handled in SYSUNINIT(pf_unload) to ensure it's done after 5869 * the vnet_pf_uninit()s */ 5870 break; 5871 default: 5872 error = EINVAL; 5873 break; 5874 } 5875 5876 return (error); 5877 } 5878 5879 static moduledata_t pf_mod = { 5880 "pf", 5881 pf_modevent, 5882 0 5883 }; 5884 5885 DECLARE_MODULE(pf, pf_mod, SI_SUB_PROTO_FIREWALL, SI_ORDER_SECOND); 5886 MODULE_VERSION(pf, PF_MODVER); 5887