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