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