2 * SPDX-License-Identifier: BSD-2-Clause
4 * Copyright (c) 2001 Daniel Hartmeier
5 * Copyright (c) 2002,2003 Henning Brauer
6 * Copyright (c) 2012 Gleb Smirnoff <glebius@FreeBSD.org>
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
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.
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.
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.
37 * $OpenBSD: pf_ioctl.c,v 1.213 2009/02/15 21:46:12 mbalmer Exp $
40 #include <sys/cdefs.h>
41 __FBSDID("$FreeBSD$");
44 #include "opt_inet6.h"
48 #include <sys/param.h>
49 #include <sys/_bitset.h>
50 #include <sys/bitset.h>
53 #include <sys/endian.h>
54 #include <sys/fcntl.h>
55 #include <sys/filio.h>
57 #include <sys/interrupt.h>
59 #include <sys/kernel.h>
60 #include <sys/kthread.h>
63 #include <sys/module.h>
68 #include <sys/socket.h>
69 #include <sys/sysctl.h>
71 #include <sys/ucred.h>
74 #include <net/if_var.h>
75 #include <net/if_private.h>
77 #include <net/route.h>
79 #include <net/pfvar.h>
80 #include <net/if_pfsync.h>
81 #include <net/if_pflog.h>
83 #include <netinet/in.h>
84 #include <netinet/ip.h>
85 #include <netinet/ip_var.h>
86 #include <netinet6/ip6_var.h>
87 #include <netinet/ip_icmp.h>
88 #include <netpfil/pf/pf_nv.h>
91 #include <netinet/ip6.h>
95 #include <net/altq/altq.h>
98 SDT_PROBE_DEFINE3(pf, ioctl, ioctl, error, "int", "int", "int");
99 SDT_PROBE_DEFINE3(pf, ioctl, function, error, "char *", "int", "int");
100 SDT_PROBE_DEFINE2(pf, ioctl, addrule, error, "int", "int");
101 SDT_PROBE_DEFINE2(pf, ioctl, nvchk, error, "int", "int");
103 static struct pf_kpool *pf_get_kpool(const char *, u_int32_t, u_int8_t,
104 u_int32_t, u_int8_t, u_int8_t, u_int8_t);
106 static void pf_mv_kpool(struct pf_kpalist *, struct pf_kpalist *);
107 static void pf_empty_kpool(struct pf_kpalist *);
108 static int pfioctl(struct cdev *, u_long, caddr_t, int,
110 static int pf_begin_eth(uint32_t *, const char *);
111 static void pf_rollback_eth_cb(struct epoch_context *);
112 static int pf_rollback_eth(uint32_t, const char *);
113 static int pf_commit_eth(uint32_t, const char *);
114 static void pf_free_eth_rule(struct pf_keth_rule *);
116 static int pf_begin_altq(u_int32_t *);
117 static int pf_rollback_altq(u_int32_t);
118 static int pf_commit_altq(u_int32_t);
119 static int pf_enable_altq(struct pf_altq *);
120 static int pf_disable_altq(struct pf_altq *);
121 static uint16_t pf_qname2qid(const char *);
122 static void pf_qid_unref(uint16_t);
124 static int pf_begin_rules(u_int32_t *, int, const char *);
125 static int pf_rollback_rules(u_int32_t, int, char *);
126 static int pf_setup_pfsync_matching(struct pf_kruleset *);
127 static void pf_hash_rule_rolling(MD5_CTX *, struct pf_krule *);
128 static void pf_hash_rule(struct pf_krule *);
129 static void pf_hash_rule_addr(MD5_CTX *, struct pf_rule_addr *);
130 static int pf_commit_rules(u_int32_t, int, char *);
131 static int pf_addr_setup(struct pf_kruleset *,
132 struct pf_addr_wrap *, sa_family_t);
133 static void pf_addr_copyout(struct pf_addr_wrap *);
134 static void pf_src_node_copy(const struct pf_ksrc_node *,
135 struct pf_src_node *);
137 static int pf_export_kaltq(struct pf_altq *,
138 struct pfioc_altq_v1 *, size_t);
139 static int pf_import_kaltq(struct pfioc_altq_v1 *,
140 struct pf_altq *, size_t);
143 VNET_DEFINE(struct pf_krule, pf_default_rule);
145 static __inline int pf_krule_compare(struct pf_krule *,
148 RB_GENERATE(pf_krule_global, pf_krule, entry_global, pf_krule_compare);
151 VNET_DEFINE_STATIC(int, pf_altq_running);
152 #define V_pf_altq_running VNET(pf_altq_running)
155 #define TAGID_MAX 50000
157 TAILQ_ENTRY(pf_tagname) namehash_entries;
158 TAILQ_ENTRY(pf_tagname) taghash_entries;
159 char name[PF_TAG_NAME_SIZE];
165 TAILQ_HEAD(, pf_tagname) *namehash;
166 TAILQ_HEAD(, pf_tagname) *taghash;
169 BITSET_DEFINE(, TAGID_MAX) avail;
172 VNET_DEFINE(struct pf_tagset, pf_tags);
173 #define V_pf_tags VNET(pf_tags)
174 static unsigned int pf_rule_tag_hashsize;
175 #define PF_RULE_TAG_HASH_SIZE_DEFAULT 128
176 SYSCTL_UINT(_net_pf, OID_AUTO, rule_tag_hashsize, CTLFLAG_RDTUN,
177 &pf_rule_tag_hashsize, PF_RULE_TAG_HASH_SIZE_DEFAULT,
178 "Size of pf(4) rule tag hashtable");
181 VNET_DEFINE(struct pf_tagset, pf_qids);
182 #define V_pf_qids VNET(pf_qids)
183 static unsigned int pf_queue_tag_hashsize;
184 #define PF_QUEUE_TAG_HASH_SIZE_DEFAULT 128
185 SYSCTL_UINT(_net_pf, OID_AUTO, queue_tag_hashsize, CTLFLAG_RDTUN,
186 &pf_queue_tag_hashsize, PF_QUEUE_TAG_HASH_SIZE_DEFAULT,
187 "Size of pf(4) queue tag hashtable");
189 VNET_DEFINE(uma_zone_t, pf_tag_z);
190 #define V_pf_tag_z VNET(pf_tag_z)
191 static MALLOC_DEFINE(M_PFALTQ, "pf_altq", "pf(4) altq configuration db");
192 static MALLOC_DEFINE(M_PFRULE, "pf_rule", "pf(4) rules");
194 #if (PF_QNAME_SIZE != PF_TAG_NAME_SIZE)
195 #error PF_QNAME_SIZE must be equal to PF_TAG_NAME_SIZE
198 VNET_DEFINE_STATIC(bool, pf_filter_local) = false;
199 #define V_pf_filter_local VNET(pf_filter_local)
200 SYSCTL_BOOL(_net_pf, OID_AUTO, filter_local, CTLFLAG_VNET | CTLFLAG_RW,
201 &VNET_NAME(pf_filter_local), false,
202 "Enable filtering for packets delivered to local network stack");
204 static void pf_init_tagset(struct pf_tagset *, unsigned int *,
206 static void pf_cleanup_tagset(struct pf_tagset *);
207 static uint16_t tagname2hashindex(const struct pf_tagset *, const char *);
208 static uint16_t tag2hashindex(const struct pf_tagset *, uint16_t);
209 static u_int16_t tagname2tag(struct pf_tagset *, const char *);
210 static u_int16_t pf_tagname2tag(const char *);
211 static void tag_unref(struct pf_tagset *, u_int16_t);
213 #define DPFPRINTF(n, x) if (V_pf_status.debug >= (n)) printf x
218 * XXX - These are new and need to be checked when moveing to a new version
220 static void pf_clear_all_states(void);
221 static unsigned int pf_clear_states(const struct pf_kstate_kill *);
222 static void pf_killstates(struct pf_kstate_kill *,
224 static int pf_killstates_row(struct pf_kstate_kill *,
226 static int pf_killstates_nv(struct pfioc_nv *);
227 static int pf_clearstates_nv(struct pfioc_nv *);
228 static int pf_getstate(struct pfioc_nv *);
229 static int pf_getstatus(struct pfioc_nv *);
230 static int pf_clear_tables(void);
231 static void pf_clear_srcnodes(struct pf_ksrc_node *);
232 static void pf_kill_srcnodes(struct pfioc_src_node_kill *);
233 static int pf_keepcounters(struct pfioc_nv *);
234 static void pf_tbladdr_copyout(struct pf_addr_wrap *);
237 * Wrapper functions for pfil(9) hooks
239 static pfil_return_t pf_eth_check_in(struct mbuf **m, struct ifnet *ifp,
240 int flags, void *ruleset __unused, struct inpcb *inp);
241 static pfil_return_t pf_eth_check_out(struct mbuf **m, struct ifnet *ifp,
242 int flags, void *ruleset __unused, struct inpcb *inp);
244 static pfil_return_t pf_check_in(struct mbuf **m, struct ifnet *ifp,
245 int flags, void *ruleset __unused, struct inpcb *inp);
246 static pfil_return_t pf_check_out(struct mbuf **m, struct ifnet *ifp,
247 int flags, void *ruleset __unused, struct inpcb *inp);
250 static pfil_return_t pf_check6_in(struct mbuf **m, struct ifnet *ifp,
251 int flags, void *ruleset __unused, struct inpcb *inp);
252 static pfil_return_t pf_check6_out(struct mbuf **m, struct ifnet *ifp,
253 int flags, void *ruleset __unused, struct inpcb *inp);
256 static void hook_pf_eth(void);
257 static void hook_pf(void);
258 static void dehook_pf_eth(void);
259 static void dehook_pf(void);
260 static int shutdown_pf(void);
261 static int pf_load(void);
262 static void pf_unload(void);
264 static struct cdevsw pf_cdevsw = {
267 .d_version = D_VERSION,
270 VNET_DEFINE_STATIC(bool, pf_pfil_hooked);
271 #define V_pf_pfil_hooked VNET(pf_pfil_hooked)
272 VNET_DEFINE_STATIC(bool, pf_pfil_eth_hooked);
273 #define V_pf_pfil_eth_hooked VNET(pf_pfil_eth_hooked)
276 * We need a flag that is neither hooked nor running to know when
277 * the VNET is "valid". We primarily need this to control (global)
278 * external event, e.g., eventhandlers.
280 VNET_DEFINE(int, pf_vnet_active);
281 #define V_pf_vnet_active VNET(pf_vnet_active)
284 struct proc *pf_purge_proc;
286 VNET_DEFINE(struct rmlock, pf_rules_lock);
287 VNET_DEFINE_STATIC(struct sx, pf_ioctl_lock);
288 #define V_pf_ioctl_lock VNET(pf_ioctl_lock)
289 struct sx pf_end_lock;
292 VNET_DEFINE(pfsync_state_import_t *, pfsync_state_import_ptr);
293 VNET_DEFINE(pfsync_insert_state_t *, pfsync_insert_state_ptr);
294 VNET_DEFINE(pfsync_update_state_t *, pfsync_update_state_ptr);
295 VNET_DEFINE(pfsync_delete_state_t *, pfsync_delete_state_ptr);
296 VNET_DEFINE(pfsync_clear_states_t *, pfsync_clear_states_ptr);
297 VNET_DEFINE(pfsync_defer_t *, pfsync_defer_ptr);
298 pfsync_detach_ifnet_t *pfsync_detach_ifnet_ptr;
301 pflog_packet_t *pflog_packet_ptr = NULL;
304 * Copy a user-provided string, returning an error if truncation would occur.
305 * Avoid scanning past "sz" bytes in the source string since there's no
306 * guarantee that it's nul-terminated.
309 pf_user_strcpy(char *dst, const char *src, size_t sz)
311 if (strnlen(src, sz) == sz)
313 (void)strlcpy(dst, src, sz);
320 u_int32_t *my_timeout = V_pf_default_rule.timeout;
322 bzero(&V_pf_status, sizeof(V_pf_status));
326 pfi_initialize_vnet();
328 pf_syncookies_init();
330 V_pf_limits[PF_LIMIT_STATES].limit = PFSTATE_HIWAT;
331 V_pf_limits[PF_LIMIT_SRC_NODES].limit = PFSNODE_HIWAT;
333 RB_INIT(&V_pf_anchors);
334 pf_init_kruleset(&pf_main_ruleset);
336 pf_init_keth(V_pf_keth);
338 /* default rule should never be garbage collected */
339 V_pf_default_rule.entries.tqe_prev = &V_pf_default_rule.entries.tqe_next;
340 #ifdef PF_DEFAULT_TO_DROP
341 V_pf_default_rule.action = PF_DROP;
343 V_pf_default_rule.action = PF_PASS;
345 V_pf_default_rule.nr = -1;
346 V_pf_default_rule.rtableid = -1;
348 pf_counter_u64_init(&V_pf_default_rule.evaluations, M_WAITOK);
349 for (int i = 0; i < 2; i++) {
350 pf_counter_u64_init(&V_pf_default_rule.packets[i], M_WAITOK);
351 pf_counter_u64_init(&V_pf_default_rule.bytes[i], M_WAITOK);
353 V_pf_default_rule.states_cur = counter_u64_alloc(M_WAITOK);
354 V_pf_default_rule.states_tot = counter_u64_alloc(M_WAITOK);
355 V_pf_default_rule.src_nodes = counter_u64_alloc(M_WAITOK);
357 V_pf_default_rule.timestamp = uma_zalloc_pcpu(pf_timestamp_pcpu_zone,
360 #ifdef PF_WANT_32_TO_64_COUNTER
361 V_pf_kifmarker = malloc(sizeof(*V_pf_kifmarker), PFI_MTYPE, M_WAITOK | M_ZERO);
362 V_pf_rulemarker = malloc(sizeof(*V_pf_rulemarker), M_PFRULE, M_WAITOK | M_ZERO);
364 LIST_INSERT_HEAD(&V_pf_allkiflist, V_pf_kifmarker, pfik_allkiflist);
365 LIST_INSERT_HEAD(&V_pf_allrulelist, &V_pf_default_rule, allrulelist);
367 LIST_INSERT_HEAD(&V_pf_allrulelist, V_pf_rulemarker, allrulelist);
371 /* initialize default timeouts */
372 my_timeout[PFTM_TCP_FIRST_PACKET] = PFTM_TCP_FIRST_PACKET_VAL;
373 my_timeout[PFTM_TCP_OPENING] = PFTM_TCP_OPENING_VAL;
374 my_timeout[PFTM_TCP_ESTABLISHED] = PFTM_TCP_ESTABLISHED_VAL;
375 my_timeout[PFTM_TCP_CLOSING] = PFTM_TCP_CLOSING_VAL;
376 my_timeout[PFTM_TCP_FIN_WAIT] = PFTM_TCP_FIN_WAIT_VAL;
377 my_timeout[PFTM_TCP_CLOSED] = PFTM_TCP_CLOSED_VAL;
378 my_timeout[PFTM_UDP_FIRST_PACKET] = PFTM_UDP_FIRST_PACKET_VAL;
379 my_timeout[PFTM_UDP_SINGLE] = PFTM_UDP_SINGLE_VAL;
380 my_timeout[PFTM_UDP_MULTIPLE] = PFTM_UDP_MULTIPLE_VAL;
381 my_timeout[PFTM_ICMP_FIRST_PACKET] = PFTM_ICMP_FIRST_PACKET_VAL;
382 my_timeout[PFTM_ICMP_ERROR_REPLY] = PFTM_ICMP_ERROR_REPLY_VAL;
383 my_timeout[PFTM_OTHER_FIRST_PACKET] = PFTM_OTHER_FIRST_PACKET_VAL;
384 my_timeout[PFTM_OTHER_SINGLE] = PFTM_OTHER_SINGLE_VAL;
385 my_timeout[PFTM_OTHER_MULTIPLE] = PFTM_OTHER_MULTIPLE_VAL;
386 my_timeout[PFTM_FRAG] = PFTM_FRAG_VAL;
387 my_timeout[PFTM_INTERVAL] = PFTM_INTERVAL_VAL;
388 my_timeout[PFTM_SRC_NODE] = PFTM_SRC_NODE_VAL;
389 my_timeout[PFTM_TS_DIFF] = PFTM_TS_DIFF_VAL;
390 my_timeout[PFTM_ADAPTIVE_START] = PFSTATE_ADAPT_START;
391 my_timeout[PFTM_ADAPTIVE_END] = PFSTATE_ADAPT_END;
393 V_pf_status.debug = PF_DEBUG_URGENT;
395 * XXX This is different than in OpenBSD where reassembly is enabled by
396 * defult. In FreeBSD we expect people to still use scrub rules and
397 * switch to the new syntax later. Only when they switch they must
398 * explicitly enable reassemle. We could change the default once the
399 * scrub rule functionality is hopefully removed some day in future.
401 V_pf_status.reass = 0;
403 V_pf_pfil_hooked = false;
404 V_pf_pfil_eth_hooked = false;
406 /* XXX do our best to avoid a conflict */
407 V_pf_status.hostid = arc4random();
409 for (int i = 0; i < PFRES_MAX; i++)
410 V_pf_status.counters[i] = counter_u64_alloc(M_WAITOK);
411 for (int i = 0; i < KLCNT_MAX; i++)
412 V_pf_status.lcounters[i] = counter_u64_alloc(M_WAITOK);
413 for (int i = 0; i < FCNT_MAX; i++)
414 pf_counter_u64_init(&V_pf_status.fcounters[i], M_WAITOK);
415 for (int i = 0; i < SCNT_MAX; i++)
416 V_pf_status.scounters[i] = counter_u64_alloc(M_WAITOK);
418 if (swi_add(&V_pf_swi_ie, "pf send", pf_intr, curvnet, SWI_NET,
419 INTR_MPSAFE, &V_pf_swi_cookie) != 0)
420 /* XXXGL: leaked all above. */
424 static struct pf_kpool *
425 pf_get_kpool(const char *anchor, u_int32_t ticket, u_int8_t rule_action,
426 u_int32_t rule_number, u_int8_t r_last, u_int8_t active,
427 u_int8_t check_ticket)
429 struct pf_kruleset *ruleset;
430 struct pf_krule *rule;
433 ruleset = pf_find_kruleset(anchor);
436 rs_num = pf_get_ruleset_number(rule_action);
437 if (rs_num >= PF_RULESET_MAX)
440 if (check_ticket && ticket !=
441 ruleset->rules[rs_num].active.ticket)
444 rule = TAILQ_LAST(ruleset->rules[rs_num].active.ptr,
447 rule = TAILQ_FIRST(ruleset->rules[rs_num].active.ptr);
449 if (check_ticket && ticket !=
450 ruleset->rules[rs_num].inactive.ticket)
453 rule = TAILQ_LAST(ruleset->rules[rs_num].inactive.ptr,
456 rule = TAILQ_FIRST(ruleset->rules[rs_num].inactive.ptr);
459 while ((rule != NULL) && (rule->nr != rule_number))
460 rule = TAILQ_NEXT(rule, entries);
465 return (&rule->rpool);
469 pf_mv_kpool(struct pf_kpalist *poola, struct pf_kpalist *poolb)
471 struct pf_kpooladdr *mv_pool_pa;
473 while ((mv_pool_pa = TAILQ_FIRST(poola)) != NULL) {
474 TAILQ_REMOVE(poola, mv_pool_pa, entries);
475 TAILQ_INSERT_TAIL(poolb, mv_pool_pa, entries);
480 pf_empty_kpool(struct pf_kpalist *poola)
482 struct pf_kpooladdr *pa;
484 while ((pa = TAILQ_FIRST(poola)) != NULL) {
485 switch (pa->addr.type) {
486 case PF_ADDR_DYNIFTL:
487 pfi_dynaddr_remove(pa->addr.p.dyn);
490 /* XXX: this could be unfinished pooladdr on pabuf */
491 if (pa->addr.p.tbl != NULL)
492 pfr_detach_table(pa->addr.p.tbl);
496 pfi_kkif_unref(pa->kif);
497 TAILQ_REMOVE(poola, pa, entries);
503 pf_unlink_rule_locked(struct pf_krulequeue *rulequeue, struct pf_krule *rule)
507 PF_UNLNKDRULES_ASSERT();
509 TAILQ_REMOVE(rulequeue, rule, entries);
511 rule->rule_ref |= PFRULE_REFS;
512 TAILQ_INSERT_TAIL(&V_pf_unlinked_rules, rule, entries);
516 pf_unlink_rule(struct pf_krulequeue *rulequeue, struct pf_krule *rule)
521 PF_UNLNKDRULES_LOCK();
522 pf_unlink_rule_locked(rulequeue, rule);
523 PF_UNLNKDRULES_UNLOCK();
527 pf_free_eth_rule(struct pf_keth_rule *rule)
535 tag_unref(&V_pf_tags, rule->tag);
537 tag_unref(&V_pf_tags, rule->match_tag);
539 pf_qid_unref(rule->qid);
543 pfi_kkif_unref(rule->bridge_to);
545 pfi_kkif_unref(rule->kif);
547 if (rule->ipsrc.addr.type == PF_ADDR_TABLE)
548 pfr_detach_table(rule->ipsrc.addr.p.tbl);
549 if (rule->ipdst.addr.type == PF_ADDR_TABLE)
550 pfr_detach_table(rule->ipdst.addr.p.tbl);
552 counter_u64_free(rule->evaluations);
553 for (int i = 0; i < 2; i++) {
554 counter_u64_free(rule->packets[i]);
555 counter_u64_free(rule->bytes[i]);
557 uma_zfree_pcpu(pf_timestamp_pcpu_zone, rule->timestamp);
558 pf_keth_anchor_remove(rule);
560 free(rule, M_PFRULE);
564 pf_free_rule(struct pf_krule *rule)
571 tag_unref(&V_pf_tags, rule->tag);
573 tag_unref(&V_pf_tags, rule->match_tag);
575 if (rule->pqid != rule->qid)
576 pf_qid_unref(rule->pqid);
577 pf_qid_unref(rule->qid);
579 switch (rule->src.addr.type) {
580 case PF_ADDR_DYNIFTL:
581 pfi_dynaddr_remove(rule->src.addr.p.dyn);
584 pfr_detach_table(rule->src.addr.p.tbl);
587 switch (rule->dst.addr.type) {
588 case PF_ADDR_DYNIFTL:
589 pfi_dynaddr_remove(rule->dst.addr.p.dyn);
592 pfr_detach_table(rule->dst.addr.p.tbl);
595 if (rule->overload_tbl)
596 pfr_detach_table(rule->overload_tbl);
598 pfi_kkif_unref(rule->kif);
599 pf_kanchor_remove(rule);
600 pf_empty_kpool(&rule->rpool.list);
606 pf_init_tagset(struct pf_tagset *ts, unsigned int *tunable_size,
607 unsigned int default_size)
610 unsigned int hashsize;
612 if (*tunable_size == 0 || !powerof2(*tunable_size))
613 *tunable_size = default_size;
615 hashsize = *tunable_size;
616 ts->namehash = mallocarray(hashsize, sizeof(*ts->namehash), M_PFHASH,
618 ts->taghash = mallocarray(hashsize, sizeof(*ts->taghash), M_PFHASH,
620 ts->mask = hashsize - 1;
621 ts->seed = arc4random();
622 for (i = 0; i < hashsize; i++) {
623 TAILQ_INIT(&ts->namehash[i]);
624 TAILQ_INIT(&ts->taghash[i]);
626 BIT_FILL(TAGID_MAX, &ts->avail);
630 pf_cleanup_tagset(struct pf_tagset *ts)
633 unsigned int hashsize;
634 struct pf_tagname *t, *tmp;
637 * Only need to clean up one of the hashes as each tag is hashed
640 hashsize = ts->mask + 1;
641 for (i = 0; i < hashsize; i++)
642 TAILQ_FOREACH_SAFE(t, &ts->namehash[i], namehash_entries, tmp)
643 uma_zfree(V_pf_tag_z, t);
645 free(ts->namehash, M_PFHASH);
646 free(ts->taghash, M_PFHASH);
650 tagname2hashindex(const struct pf_tagset *ts, const char *tagname)
654 len = strnlen(tagname, PF_TAG_NAME_SIZE - 1);
655 return (murmur3_32_hash(tagname, len, ts->seed) & ts->mask);
659 tag2hashindex(const struct pf_tagset *ts, uint16_t tag)
662 return (tag & ts->mask);
666 tagname2tag(struct pf_tagset *ts, const char *tagname)
668 struct pf_tagname *tag;
674 index = tagname2hashindex(ts, tagname);
675 TAILQ_FOREACH(tag, &ts->namehash[index], namehash_entries)
676 if (strcmp(tagname, tag->name) == 0) {
684 * to avoid fragmentation, we do a linear search from the beginning
685 * and take the first free slot we find.
687 new_tagid = BIT_FFS(TAGID_MAX, &ts->avail);
689 * Tags are 1-based, with valid tags in the range [1..TAGID_MAX].
690 * BIT_FFS() returns a 1-based bit number, with 0 indicating no bits
691 * set. It may also return a bit number greater than TAGID_MAX due
692 * to rounding of the number of bits in the vector up to a multiple
693 * of the vector word size at declaration/allocation time.
695 if ((new_tagid == 0) || (new_tagid > TAGID_MAX))
698 /* Mark the tag as in use. Bits are 0-based for BIT_CLR() */
699 BIT_CLR(TAGID_MAX, new_tagid - 1, &ts->avail);
701 /* allocate and fill new struct pf_tagname */
702 tag = uma_zalloc(V_pf_tag_z, M_NOWAIT);
705 strlcpy(tag->name, tagname, sizeof(tag->name));
706 tag->tag = new_tagid;
709 /* Insert into namehash */
710 TAILQ_INSERT_TAIL(&ts->namehash[index], tag, namehash_entries);
712 /* Insert into taghash */
713 index = tag2hashindex(ts, new_tagid);
714 TAILQ_INSERT_TAIL(&ts->taghash[index], tag, taghash_entries);
720 tag_unref(struct pf_tagset *ts, u_int16_t tag)
722 struct pf_tagname *t;
727 index = tag2hashindex(ts, tag);
728 TAILQ_FOREACH(t, &ts->taghash[index], taghash_entries)
731 TAILQ_REMOVE(&ts->taghash[index], t,
733 index = tagname2hashindex(ts, t->name);
734 TAILQ_REMOVE(&ts->namehash[index], t,
736 /* Bits are 0-based for BIT_SET() */
737 BIT_SET(TAGID_MAX, tag - 1, &ts->avail);
738 uma_zfree(V_pf_tag_z, t);
745 pf_tagname2tag(const char *tagname)
747 return (tagname2tag(&V_pf_tags, tagname));
751 pf_begin_eth(uint32_t *ticket, const char *anchor)
753 struct pf_keth_rule *rule, *tmp;
754 struct pf_keth_ruleset *rs;
758 rs = pf_find_or_create_keth_ruleset(anchor);
762 /* Purge old inactive rules. */
763 TAILQ_FOREACH_SAFE(rule, rs->inactive.rules, entries,
765 TAILQ_REMOVE(rs->inactive.rules, rule,
767 pf_free_eth_rule(rule);
770 *ticket = ++rs->inactive.ticket;
771 rs->inactive.open = 1;
777 pf_rollback_eth_cb(struct epoch_context *ctx)
779 struct pf_keth_ruleset *rs;
781 rs = __containerof(ctx, struct pf_keth_ruleset, epoch_ctx);
783 CURVNET_SET(rs->vnet);
786 pf_rollback_eth(rs->inactive.ticket,
787 rs->anchor ? rs->anchor->path : "");
794 pf_rollback_eth(uint32_t ticket, const char *anchor)
796 struct pf_keth_rule *rule, *tmp;
797 struct pf_keth_ruleset *rs;
801 rs = pf_find_keth_ruleset(anchor);
805 if (!rs->inactive.open ||
806 ticket != rs->inactive.ticket)
809 /* Purge old inactive rules. */
810 TAILQ_FOREACH_SAFE(rule, rs->inactive.rules, entries,
812 TAILQ_REMOVE(rs->inactive.rules, rule, entries);
813 pf_free_eth_rule(rule);
816 rs->inactive.open = 0;
818 pf_remove_if_empty_keth_ruleset(rs);
823 #define PF_SET_SKIP_STEPS(i) \
825 while (head[i] != cur) { \
826 head[i]->skip[i].ptr = cur; \
827 head[i] = TAILQ_NEXT(head[i], entries); \
832 pf_eth_calc_skip_steps(struct pf_keth_ruleq *rules)
834 struct pf_keth_rule *cur, *prev, *head[PFE_SKIP_COUNT];
837 cur = TAILQ_FIRST(rules);
839 for (i = 0; i < PFE_SKIP_COUNT; ++i)
841 while (cur != NULL) {
842 if (cur->kif != prev->kif || cur->ifnot != prev->ifnot)
843 PF_SET_SKIP_STEPS(PFE_SKIP_IFP);
844 if (cur->direction != prev->direction)
845 PF_SET_SKIP_STEPS(PFE_SKIP_DIR);
846 if (cur->proto != prev->proto)
847 PF_SET_SKIP_STEPS(PFE_SKIP_PROTO);
848 if (memcmp(&cur->src, &prev->src, sizeof(cur->src)) != 0)
849 PF_SET_SKIP_STEPS(PFE_SKIP_SRC_ADDR);
850 if (memcmp(&cur->dst, &prev->dst, sizeof(cur->dst)) != 0)
851 PF_SET_SKIP_STEPS(PFE_SKIP_DST_ADDR);
852 if (cur->ipsrc.neg != prev->ipsrc.neg ||
853 pf_addr_wrap_neq(&cur->ipsrc.addr, &prev->ipsrc.addr))
854 PF_SET_SKIP_STEPS(PFE_SKIP_SRC_IP_ADDR);
855 if (cur->ipdst.neg != prev->ipdst.neg ||
856 pf_addr_wrap_neq(&cur->ipdst.addr, &prev->ipdst.addr))
857 PF_SET_SKIP_STEPS(PFE_SKIP_DST_IP_ADDR);
860 cur = TAILQ_NEXT(cur, entries);
862 for (i = 0; i < PFE_SKIP_COUNT; ++i)
863 PF_SET_SKIP_STEPS(i);
867 pf_commit_eth(uint32_t ticket, const char *anchor)
869 struct pf_keth_ruleq *rules;
870 struct pf_keth_ruleset *rs;
872 rs = pf_find_keth_ruleset(anchor);
877 if (!rs->inactive.open ||
878 ticket != rs->inactive.ticket)
883 pf_eth_calc_skip_steps(rs->inactive.rules);
885 rules = rs->active.rules;
886 ck_pr_store_ptr(&rs->active.rules, rs->inactive.rules);
887 rs->inactive.rules = rules;
888 rs->inactive.ticket = rs->active.ticket;
890 /* Clean up inactive rules (i.e. previously active rules), only when
891 * we're sure they're no longer used. */
892 NET_EPOCH_CALL(pf_rollback_eth_cb, &rs->epoch_ctx);
899 pf_qname2qid(const char *qname)
901 return (tagname2tag(&V_pf_qids, qname));
905 pf_qid_unref(uint16_t qid)
907 tag_unref(&V_pf_qids, qid);
911 pf_begin_altq(u_int32_t *ticket)
913 struct pf_altq *altq, *tmp;
918 /* Purge the old altq lists */
919 TAILQ_FOREACH_SAFE(altq, V_pf_altq_ifs_inactive, entries, tmp) {
920 if ((altq->local_flags & PFALTQ_FLAG_IF_REMOVED) == 0) {
921 /* detach and destroy the discipline */
922 error = altq_remove(altq);
924 free(altq, M_PFALTQ);
926 TAILQ_INIT(V_pf_altq_ifs_inactive);
927 TAILQ_FOREACH_SAFE(altq, V_pf_altqs_inactive, entries, tmp) {
928 pf_qid_unref(altq->qid);
929 free(altq, M_PFALTQ);
931 TAILQ_INIT(V_pf_altqs_inactive);
934 *ticket = ++V_ticket_altqs_inactive;
935 V_altqs_inactive_open = 1;
940 pf_rollback_altq(u_int32_t ticket)
942 struct pf_altq *altq, *tmp;
947 if (!V_altqs_inactive_open || ticket != V_ticket_altqs_inactive)
949 /* Purge the old altq lists */
950 TAILQ_FOREACH_SAFE(altq, V_pf_altq_ifs_inactive, entries, tmp) {
951 if ((altq->local_flags & PFALTQ_FLAG_IF_REMOVED) == 0) {
952 /* detach and destroy the discipline */
953 error = altq_remove(altq);
955 free(altq, M_PFALTQ);
957 TAILQ_INIT(V_pf_altq_ifs_inactive);
958 TAILQ_FOREACH_SAFE(altq, V_pf_altqs_inactive, entries, tmp) {
959 pf_qid_unref(altq->qid);
960 free(altq, M_PFALTQ);
962 TAILQ_INIT(V_pf_altqs_inactive);
963 V_altqs_inactive_open = 0;
968 pf_commit_altq(u_int32_t ticket)
970 struct pf_altqqueue *old_altqs, *old_altq_ifs;
971 struct pf_altq *altq, *tmp;
976 if (!V_altqs_inactive_open || ticket != V_ticket_altqs_inactive)
979 /* swap altqs, keep the old. */
980 old_altqs = V_pf_altqs_active;
981 old_altq_ifs = V_pf_altq_ifs_active;
982 V_pf_altqs_active = V_pf_altqs_inactive;
983 V_pf_altq_ifs_active = V_pf_altq_ifs_inactive;
984 V_pf_altqs_inactive = old_altqs;
985 V_pf_altq_ifs_inactive = old_altq_ifs;
986 V_ticket_altqs_active = V_ticket_altqs_inactive;
988 /* Attach new disciplines */
989 TAILQ_FOREACH(altq, V_pf_altq_ifs_active, entries) {
990 if ((altq->local_flags & PFALTQ_FLAG_IF_REMOVED) == 0) {
991 /* attach the discipline */
992 error = altq_pfattach(altq);
993 if (error == 0 && V_pf_altq_running)
994 error = pf_enable_altq(altq);
1000 /* Purge the old altq lists */
1001 TAILQ_FOREACH_SAFE(altq, V_pf_altq_ifs_inactive, entries, tmp) {
1002 if ((altq->local_flags & PFALTQ_FLAG_IF_REMOVED) == 0) {
1003 /* detach and destroy the discipline */
1004 if (V_pf_altq_running)
1005 error = pf_disable_altq(altq);
1006 err = altq_pfdetach(altq);
1007 if (err != 0 && error == 0)
1009 err = altq_remove(altq);
1010 if (err != 0 && error == 0)
1013 free(altq, M_PFALTQ);
1015 TAILQ_INIT(V_pf_altq_ifs_inactive);
1016 TAILQ_FOREACH_SAFE(altq, V_pf_altqs_inactive, entries, tmp) {
1017 pf_qid_unref(altq->qid);
1018 free(altq, M_PFALTQ);
1020 TAILQ_INIT(V_pf_altqs_inactive);
1022 V_altqs_inactive_open = 0;
1027 pf_enable_altq(struct pf_altq *altq)
1030 struct tb_profile tb;
1033 if ((ifp = ifunit(altq->ifname)) == NULL)
1036 if (ifp->if_snd.altq_type != ALTQT_NONE)
1037 error = altq_enable(&ifp->if_snd);
1039 /* set tokenbucket regulator */
1040 if (error == 0 && ifp != NULL && ALTQ_IS_ENABLED(&ifp->if_snd)) {
1041 tb.rate = altq->ifbandwidth;
1042 tb.depth = altq->tbrsize;
1043 error = tbr_set(&ifp->if_snd, &tb);
1050 pf_disable_altq(struct pf_altq *altq)
1053 struct tb_profile tb;
1056 if ((ifp = ifunit(altq->ifname)) == NULL)
1060 * when the discipline is no longer referenced, it was overridden
1061 * by a new one. if so, just return.
1063 if (altq->altq_disc != ifp->if_snd.altq_disc)
1066 error = altq_disable(&ifp->if_snd);
1069 /* clear tokenbucket regulator */
1071 error = tbr_set(&ifp->if_snd, &tb);
1078 pf_altq_ifnet_event_add(struct ifnet *ifp, int remove, u_int32_t ticket,
1079 struct pf_altq *altq)
1084 /* Deactivate the interface in question */
1085 altq->local_flags &= ~PFALTQ_FLAG_IF_REMOVED;
1086 if ((ifp1 = ifunit(altq->ifname)) == NULL ||
1087 (remove && ifp1 == ifp)) {
1088 altq->local_flags |= PFALTQ_FLAG_IF_REMOVED;
1090 error = altq_add(ifp1, altq);
1092 if (ticket != V_ticket_altqs_inactive)
1096 free(altq, M_PFALTQ);
1103 pf_altq_ifnet_event(struct ifnet *ifp, int remove)
1105 struct pf_altq *a1, *a2, *a3;
1110 * No need to re-evaluate the configuration for events on interfaces
1111 * that do not support ALTQ, as it's not possible for such
1112 * interfaces to be part of the configuration.
1114 if (!ALTQ_IS_READY(&ifp->if_snd))
1117 /* Interrupt userland queue modifications */
1118 if (V_altqs_inactive_open)
1119 pf_rollback_altq(V_ticket_altqs_inactive);
1121 /* Start new altq ruleset */
1122 if (pf_begin_altq(&ticket))
1125 /* Copy the current active set */
1126 TAILQ_FOREACH(a1, V_pf_altq_ifs_active, entries) {
1127 a2 = malloc(sizeof(*a2), M_PFALTQ, M_NOWAIT);
1132 bcopy(a1, a2, sizeof(struct pf_altq));
1134 error = pf_altq_ifnet_event_add(ifp, remove, ticket, a2);
1138 TAILQ_INSERT_TAIL(V_pf_altq_ifs_inactive, a2, entries);
1142 TAILQ_FOREACH(a1, V_pf_altqs_active, entries) {
1143 a2 = malloc(sizeof(*a2), M_PFALTQ, M_NOWAIT);
1148 bcopy(a1, a2, sizeof(struct pf_altq));
1150 if ((a2->qid = pf_qname2qid(a2->qname)) == 0) {
1155 a2->altq_disc = NULL;
1156 TAILQ_FOREACH(a3, V_pf_altq_ifs_inactive, entries) {
1157 if (strncmp(a3->ifname, a2->ifname,
1159 a2->altq_disc = a3->altq_disc;
1163 error = pf_altq_ifnet_event_add(ifp, remove, ticket, a2);
1167 TAILQ_INSERT_TAIL(V_pf_altqs_inactive, a2, entries);
1172 pf_rollback_altq(ticket);
1174 pf_commit_altq(ticket);
1178 static struct pf_krule_global *
1179 pf_rule_tree_alloc(int flags)
1181 struct pf_krule_global *tree;
1183 tree = malloc(sizeof(struct pf_krule_global), M_TEMP, flags);
1191 pf_rule_tree_free(struct pf_krule_global *tree)
1198 pf_begin_rules(u_int32_t *ticket, int rs_num, const char *anchor)
1200 struct pf_krule_global *tree;
1201 struct pf_kruleset *rs;
1202 struct pf_krule *rule;
1206 if (rs_num < 0 || rs_num >= PF_RULESET_MAX)
1208 tree = pf_rule_tree_alloc(M_NOWAIT);
1211 rs = pf_find_or_create_kruleset(anchor);
1216 pf_rule_tree_free(rs->rules[rs_num].inactive.tree);
1217 rs->rules[rs_num].inactive.tree = tree;
1219 while ((rule = TAILQ_FIRST(rs->rules[rs_num].inactive.ptr)) != NULL) {
1220 pf_unlink_rule(rs->rules[rs_num].inactive.ptr, rule);
1221 rs->rules[rs_num].inactive.rcount--;
1223 *ticket = ++rs->rules[rs_num].inactive.ticket;
1224 rs->rules[rs_num].inactive.open = 1;
1229 pf_rollback_rules(u_int32_t ticket, int rs_num, char *anchor)
1231 struct pf_kruleset *rs;
1232 struct pf_krule *rule;
1236 if (rs_num < 0 || rs_num >= PF_RULESET_MAX)
1238 rs = pf_find_kruleset(anchor);
1239 if (rs == NULL || !rs->rules[rs_num].inactive.open ||
1240 rs->rules[rs_num].inactive.ticket != ticket)
1242 while ((rule = TAILQ_FIRST(rs->rules[rs_num].inactive.ptr)) != NULL) {
1243 pf_unlink_rule(rs->rules[rs_num].inactive.ptr, rule);
1244 rs->rules[rs_num].inactive.rcount--;
1246 rs->rules[rs_num].inactive.open = 0;
1250 #define PF_MD5_UPD(st, elm) \
1251 MD5Update(ctx, (u_int8_t *) &(st)->elm, sizeof((st)->elm))
1253 #define PF_MD5_UPD_STR(st, elm) \
1254 MD5Update(ctx, (u_int8_t *) (st)->elm, strlen((st)->elm))
1256 #define PF_MD5_UPD_HTONL(st, elm, stor) do { \
1257 (stor) = htonl((st)->elm); \
1258 MD5Update(ctx, (u_int8_t *) &(stor), sizeof(u_int32_t));\
1261 #define PF_MD5_UPD_HTONS(st, elm, stor) do { \
1262 (stor) = htons((st)->elm); \
1263 MD5Update(ctx, (u_int8_t *) &(stor), sizeof(u_int16_t));\
1267 pf_hash_rule_addr(MD5_CTX *ctx, struct pf_rule_addr *pfr)
1269 PF_MD5_UPD(pfr, addr.type);
1270 switch (pfr->addr.type) {
1271 case PF_ADDR_DYNIFTL:
1272 PF_MD5_UPD(pfr, addr.v.ifname);
1273 PF_MD5_UPD(pfr, addr.iflags);
1276 PF_MD5_UPD(pfr, addr.v.tblname);
1278 case PF_ADDR_ADDRMASK:
1279 /* XXX ignore af? */
1280 PF_MD5_UPD(pfr, addr.v.a.addr.addr32);
1281 PF_MD5_UPD(pfr, addr.v.a.mask.addr32);
1285 PF_MD5_UPD(pfr, port[0]);
1286 PF_MD5_UPD(pfr, port[1]);
1287 PF_MD5_UPD(pfr, neg);
1288 PF_MD5_UPD(pfr, port_op);
1292 pf_hash_rule_rolling(MD5_CTX *ctx, struct pf_krule *rule)
1297 pf_hash_rule_addr(ctx, &rule->src);
1298 pf_hash_rule_addr(ctx, &rule->dst);
1299 for (int i = 0; i < PF_RULE_MAX_LABEL_COUNT; i++)
1300 PF_MD5_UPD_STR(rule, label[i]);
1301 PF_MD5_UPD_STR(rule, ifname);
1302 PF_MD5_UPD_STR(rule, match_tagname);
1303 PF_MD5_UPD_HTONS(rule, match_tag, x); /* dup? */
1304 PF_MD5_UPD_HTONL(rule, os_fingerprint, y);
1305 PF_MD5_UPD_HTONL(rule, prob, y);
1306 PF_MD5_UPD_HTONL(rule, uid.uid[0], y);
1307 PF_MD5_UPD_HTONL(rule, uid.uid[1], y);
1308 PF_MD5_UPD(rule, uid.op);
1309 PF_MD5_UPD_HTONL(rule, gid.gid[0], y);
1310 PF_MD5_UPD_HTONL(rule, gid.gid[1], y);
1311 PF_MD5_UPD(rule, gid.op);
1312 PF_MD5_UPD_HTONL(rule, rule_flag, y);
1313 PF_MD5_UPD(rule, action);
1314 PF_MD5_UPD(rule, direction);
1315 PF_MD5_UPD(rule, af);
1316 PF_MD5_UPD(rule, quick);
1317 PF_MD5_UPD(rule, ifnot);
1318 PF_MD5_UPD(rule, match_tag_not);
1319 PF_MD5_UPD(rule, natpass);
1320 PF_MD5_UPD(rule, keep_state);
1321 PF_MD5_UPD(rule, proto);
1322 PF_MD5_UPD(rule, type);
1323 PF_MD5_UPD(rule, code);
1324 PF_MD5_UPD(rule, flags);
1325 PF_MD5_UPD(rule, flagset);
1326 PF_MD5_UPD(rule, allow_opts);
1327 PF_MD5_UPD(rule, rt);
1328 PF_MD5_UPD(rule, tos);
1329 PF_MD5_UPD(rule, scrub_flags);
1330 PF_MD5_UPD(rule, min_ttl);
1331 PF_MD5_UPD(rule, set_tos);
1332 if (rule->anchor != NULL)
1333 PF_MD5_UPD_STR(rule, anchor->path);
1337 pf_hash_rule(struct pf_krule *rule)
1342 pf_hash_rule_rolling(&ctx, rule);
1343 MD5Final(rule->md5sum, &ctx);
1347 pf_krule_compare(struct pf_krule *a, struct pf_krule *b)
1350 return (memcmp(a->md5sum, b->md5sum, PF_MD5_DIGEST_LENGTH));
1354 pf_commit_rules(u_int32_t ticket, int rs_num, char *anchor)
1356 struct pf_kruleset *rs;
1357 struct pf_krule *rule, **old_array, *old_rule;
1358 struct pf_krulequeue *old_rules;
1359 struct pf_krule_global *old_tree;
1361 u_int32_t old_rcount;
1365 if (rs_num < 0 || rs_num >= PF_RULESET_MAX)
1367 rs = pf_find_kruleset(anchor);
1368 if (rs == NULL || !rs->rules[rs_num].inactive.open ||
1369 ticket != rs->rules[rs_num].inactive.ticket)
1372 /* Calculate checksum for the main ruleset */
1373 if (rs == &pf_main_ruleset) {
1374 error = pf_setup_pfsync_matching(rs);
1379 /* Swap rules, keep the old. */
1380 old_rules = rs->rules[rs_num].active.ptr;
1381 old_rcount = rs->rules[rs_num].active.rcount;
1382 old_array = rs->rules[rs_num].active.ptr_array;
1383 old_tree = rs->rules[rs_num].active.tree;
1385 rs->rules[rs_num].active.ptr =
1386 rs->rules[rs_num].inactive.ptr;
1387 rs->rules[rs_num].active.ptr_array =
1388 rs->rules[rs_num].inactive.ptr_array;
1389 rs->rules[rs_num].active.tree =
1390 rs->rules[rs_num].inactive.tree;
1391 rs->rules[rs_num].active.rcount =
1392 rs->rules[rs_num].inactive.rcount;
1394 /* Attempt to preserve counter information. */
1395 if (V_pf_status.keep_counters && old_tree != NULL) {
1396 TAILQ_FOREACH(rule, rs->rules[rs_num].active.ptr,
1398 old_rule = RB_FIND(pf_krule_global, old_tree, rule);
1399 if (old_rule == NULL) {
1402 pf_counter_u64_critical_enter();
1403 pf_counter_u64_add_protected(&rule->evaluations,
1404 pf_counter_u64_fetch(&old_rule->evaluations));
1405 pf_counter_u64_add_protected(&rule->packets[0],
1406 pf_counter_u64_fetch(&old_rule->packets[0]));
1407 pf_counter_u64_add_protected(&rule->packets[1],
1408 pf_counter_u64_fetch(&old_rule->packets[1]));
1409 pf_counter_u64_add_protected(&rule->bytes[0],
1410 pf_counter_u64_fetch(&old_rule->bytes[0]));
1411 pf_counter_u64_add_protected(&rule->bytes[1],
1412 pf_counter_u64_fetch(&old_rule->bytes[1]));
1413 pf_counter_u64_critical_exit();
1417 rs->rules[rs_num].inactive.ptr = old_rules;
1418 rs->rules[rs_num].inactive.ptr_array = old_array;
1419 rs->rules[rs_num].inactive.tree = NULL; /* important for pf_ioctl_addrule */
1420 rs->rules[rs_num].inactive.rcount = old_rcount;
1422 rs->rules[rs_num].active.ticket =
1423 rs->rules[rs_num].inactive.ticket;
1424 pf_calc_skip_steps(rs->rules[rs_num].active.ptr);
1426 /* Purge the old rule list. */
1427 PF_UNLNKDRULES_LOCK();
1428 while ((rule = TAILQ_FIRST(old_rules)) != NULL)
1429 pf_unlink_rule_locked(old_rules, rule);
1430 PF_UNLNKDRULES_UNLOCK();
1431 if (rs->rules[rs_num].inactive.ptr_array)
1432 free(rs->rules[rs_num].inactive.ptr_array, M_TEMP);
1433 rs->rules[rs_num].inactive.ptr_array = NULL;
1434 rs->rules[rs_num].inactive.rcount = 0;
1435 rs->rules[rs_num].inactive.open = 0;
1436 pf_remove_if_empty_kruleset(rs);
1437 free(old_tree, M_TEMP);
1443 pf_setup_pfsync_matching(struct pf_kruleset *rs)
1446 struct pf_krule *rule;
1448 u_int8_t digest[PF_MD5_DIGEST_LENGTH];
1451 for (rs_cnt = 0; rs_cnt < PF_RULESET_MAX; rs_cnt++) {
1452 /* XXX PF_RULESET_SCRUB as well? */
1453 if (rs_cnt == PF_RULESET_SCRUB)
1456 if (rs->rules[rs_cnt].inactive.ptr_array)
1457 free(rs->rules[rs_cnt].inactive.ptr_array, M_TEMP);
1458 rs->rules[rs_cnt].inactive.ptr_array = NULL;
1460 if (rs->rules[rs_cnt].inactive.rcount) {
1461 rs->rules[rs_cnt].inactive.ptr_array =
1462 mallocarray(rs->rules[rs_cnt].inactive.rcount,
1463 sizeof(struct pf_rule **),
1466 if (!rs->rules[rs_cnt].inactive.ptr_array)
1470 TAILQ_FOREACH(rule, rs->rules[rs_cnt].inactive.ptr,
1472 pf_hash_rule_rolling(&ctx, rule);
1473 (rs->rules[rs_cnt].inactive.ptr_array)[rule->nr] = rule;
1477 MD5Final(digest, &ctx);
1478 memcpy(V_pf_status.pf_chksum, digest, sizeof(V_pf_status.pf_chksum));
1483 pf_eth_addr_setup(struct pf_keth_ruleset *ruleset, struct pf_addr_wrap *addr)
1487 switch (addr->type) {
1489 addr->p.tbl = pfr_eth_attach_table(ruleset, addr->v.tblname);
1490 if (addr->p.tbl == NULL)
1501 pf_addr_setup(struct pf_kruleset *ruleset, struct pf_addr_wrap *addr,
1506 switch (addr->type) {
1508 addr->p.tbl = pfr_attach_table(ruleset, addr->v.tblname);
1509 if (addr->p.tbl == NULL)
1512 case PF_ADDR_DYNIFTL:
1513 error = pfi_dynaddr_setup(addr, af);
1521 pf_addr_copyout(struct pf_addr_wrap *addr)
1524 switch (addr->type) {
1525 case PF_ADDR_DYNIFTL:
1526 pfi_dynaddr_copyout(addr);
1529 pf_tbladdr_copyout(addr);
1535 pf_src_node_copy(const struct pf_ksrc_node *in, struct pf_src_node *out)
1537 int secs = time_uptime, diff;
1539 bzero(out, sizeof(struct pf_src_node));
1541 bcopy(&in->addr, &out->addr, sizeof(struct pf_addr));
1542 bcopy(&in->raddr, &out->raddr, sizeof(struct pf_addr));
1544 if (in->rule.ptr != NULL)
1545 out->rule.nr = in->rule.ptr->nr;
1547 for (int i = 0; i < 2; i++) {
1548 out->bytes[i] = counter_u64_fetch(in->bytes[i]);
1549 out->packets[i] = counter_u64_fetch(in->packets[i]);
1552 out->states = in->states;
1553 out->conn = in->conn;
1555 out->ruletype = in->ruletype;
1557 out->creation = secs - in->creation;
1558 if (out->expire > secs)
1559 out->expire -= secs;
1563 /* Adjust the connection rate estimate. */
1564 diff = secs - in->conn_rate.last;
1565 if (diff >= in->conn_rate.seconds)
1566 out->conn_rate.count = 0;
1568 out->conn_rate.count -=
1569 in->conn_rate.count * diff /
1570 in->conn_rate.seconds;
1575 * Handle export of struct pf_kaltq to user binaries that may be using any
1576 * version of struct pf_altq.
1579 pf_export_kaltq(struct pf_altq *q, struct pfioc_altq_v1 *pa, size_t ioc_size)
1583 if (ioc_size == sizeof(struct pfioc_altq_v0))
1586 version = pa->version;
1588 if (version > PFIOC_ALTQ_VERSION)
1591 #define ASSIGN(x) exported_q->x = q->x
1593 bcopy(&q->x, &exported_q->x, min(sizeof(q->x), sizeof(exported_q->x)))
1594 #define SATU16(x) (u_int32_t)uqmin((x), USHRT_MAX)
1595 #define SATU32(x) (u_int32_t)uqmin((x), UINT_MAX)
1599 struct pf_altq_v0 *exported_q =
1600 &((struct pfioc_altq_v0 *)pa)->altq;
1606 exported_q->tbrsize = SATU16(q->tbrsize);
1607 exported_q->ifbandwidth = SATU32(q->ifbandwidth);
1612 exported_q->bandwidth = SATU32(q->bandwidth);
1614 ASSIGN(local_flags);
1619 if (q->scheduler == ALTQT_HFSC) {
1620 #define ASSIGN_OPT(x) exported_q->pq_u.hfsc_opts.x = q->pq_u.hfsc_opts.x
1621 #define ASSIGN_OPT_SATU32(x) exported_q->pq_u.hfsc_opts.x = \
1622 SATU32(q->pq_u.hfsc_opts.x)
1624 ASSIGN_OPT_SATU32(rtsc_m1);
1626 ASSIGN_OPT_SATU32(rtsc_m2);
1628 ASSIGN_OPT_SATU32(lssc_m1);
1630 ASSIGN_OPT_SATU32(lssc_m2);
1632 ASSIGN_OPT_SATU32(ulsc_m1);
1634 ASSIGN_OPT_SATU32(ulsc_m2);
1639 #undef ASSIGN_OPT_SATU32
1647 struct pf_altq_v1 *exported_q =
1648 &((struct pfioc_altq_v1 *)pa)->altq;
1654 ASSIGN(ifbandwidth);
1661 ASSIGN(local_flags);
1671 panic("%s: unhandled struct pfioc_altq version", __func__);
1684 * Handle import to struct pf_kaltq of struct pf_altq from user binaries
1685 * that may be using any version of it.
1688 pf_import_kaltq(struct pfioc_altq_v1 *pa, struct pf_altq *q, size_t ioc_size)
1692 if (ioc_size == sizeof(struct pfioc_altq_v0))
1695 version = pa->version;
1697 if (version > PFIOC_ALTQ_VERSION)
1700 #define ASSIGN(x) q->x = imported_q->x
1702 bcopy(&imported_q->x, &q->x, min(sizeof(imported_q->x), sizeof(q->x)))
1706 struct pf_altq_v0 *imported_q =
1707 &((struct pfioc_altq_v0 *)pa)->altq;
1712 ASSIGN(tbrsize); /* 16-bit -> 32-bit */
1713 ASSIGN(ifbandwidth); /* 32-bit -> 64-bit */
1718 ASSIGN(bandwidth); /* 32-bit -> 64-bit */
1720 ASSIGN(local_flags);
1725 if (imported_q->scheduler == ALTQT_HFSC) {
1726 #define ASSIGN_OPT(x) q->pq_u.hfsc_opts.x = imported_q->pq_u.hfsc_opts.x
1729 * The m1 and m2 parameters are being copied from
1732 ASSIGN_OPT(rtsc_m1);
1734 ASSIGN_OPT(rtsc_m2);
1736 ASSIGN_OPT(lssc_m1);
1738 ASSIGN_OPT(lssc_m2);
1740 ASSIGN_OPT(ulsc_m1);
1742 ASSIGN_OPT(ulsc_m2);
1754 struct pf_altq_v1 *imported_q =
1755 &((struct pfioc_altq_v1 *)pa)->altq;
1761 ASSIGN(ifbandwidth);
1768 ASSIGN(local_flags);
1778 panic("%s: unhandled struct pfioc_altq version", __func__);
1788 static struct pf_altq *
1789 pf_altq_get_nth_active(u_int32_t n)
1791 struct pf_altq *altq;
1795 TAILQ_FOREACH(altq, V_pf_altq_ifs_active, entries) {
1801 TAILQ_FOREACH(altq, V_pf_altqs_active, entries) {
1812 pf_krule_alloc(void)
1814 struct pf_krule *rule;
1816 rule = malloc(sizeof(struct pf_krule), M_PFRULE, M_WAITOK | M_ZERO);
1817 mtx_init(&rule->rpool.mtx, "pf_krule_pool", NULL, MTX_DEF);
1818 rule->timestamp = uma_zalloc_pcpu(pf_timestamp_pcpu_zone,
1824 pf_krule_free(struct pf_krule *rule)
1826 #ifdef PF_WANT_32_TO_64_COUNTER
1833 #ifdef PF_WANT_32_TO_64_COUNTER
1834 if (rule->allrulelinked) {
1835 wowned = PF_RULES_WOWNED();
1838 LIST_REMOVE(rule, allrulelist);
1839 V_pf_allrulecount--;
1845 pf_counter_u64_deinit(&rule->evaluations);
1846 for (int i = 0; i < 2; i++) {
1847 pf_counter_u64_deinit(&rule->packets[i]);
1848 pf_counter_u64_deinit(&rule->bytes[i]);
1850 counter_u64_free(rule->states_cur);
1851 counter_u64_free(rule->states_tot);
1852 counter_u64_free(rule->src_nodes);
1853 uma_zfree_pcpu(pf_timestamp_pcpu_zone, rule->timestamp);
1855 mtx_destroy(&rule->rpool.mtx);
1856 free(rule, M_PFRULE);
1860 pf_kpooladdr_to_pooladdr(const struct pf_kpooladdr *kpool,
1861 struct pf_pooladdr *pool)
1864 bzero(pool, sizeof(*pool));
1865 bcopy(&kpool->addr, &pool->addr, sizeof(pool->addr));
1866 strlcpy(pool->ifname, kpool->ifname, sizeof(pool->ifname));
1870 pf_pooladdr_to_kpooladdr(const struct pf_pooladdr *pool,
1871 struct pf_kpooladdr *kpool)
1875 bzero(kpool, sizeof(*kpool));
1876 bcopy(&pool->addr, &kpool->addr, sizeof(kpool->addr));
1877 ret = pf_user_strcpy(kpool->ifname, pool->ifname,
1878 sizeof(kpool->ifname));
1883 pf_kpool_to_pool(const struct pf_kpool *kpool, struct pf_pool *pool)
1885 bzero(pool, sizeof(*pool));
1887 bcopy(&kpool->key, &pool->key, sizeof(pool->key));
1888 bcopy(&kpool->counter, &pool->counter, sizeof(pool->counter));
1890 pool->tblidx = kpool->tblidx;
1891 pool->proxy_port[0] = kpool->proxy_port[0];
1892 pool->proxy_port[1] = kpool->proxy_port[1];
1893 pool->opts = kpool->opts;
1897 pf_pool_to_kpool(const struct pf_pool *pool, struct pf_kpool *kpool)
1899 _Static_assert(sizeof(pool->key) == sizeof(kpool->key), "");
1900 _Static_assert(sizeof(pool->counter) == sizeof(kpool->counter), "");
1902 bcopy(&pool->key, &kpool->key, sizeof(kpool->key));
1903 bcopy(&pool->counter, &kpool->counter, sizeof(kpool->counter));
1905 kpool->tblidx = pool->tblidx;
1906 kpool->proxy_port[0] = pool->proxy_port[0];
1907 kpool->proxy_port[1] = pool->proxy_port[1];
1908 kpool->opts = pool->opts;
1912 pf_krule_to_rule(const struct pf_krule *krule, struct pf_rule *rule)
1915 bzero(rule, sizeof(*rule));
1917 bcopy(&krule->src, &rule->src, sizeof(rule->src));
1918 bcopy(&krule->dst, &rule->dst, sizeof(rule->dst));
1920 for (int i = 0; i < PF_SKIP_COUNT; ++i) {
1921 if (rule->skip[i].ptr == NULL)
1922 rule->skip[i].nr = -1;
1924 rule->skip[i].nr = krule->skip[i].ptr->nr;
1927 strlcpy(rule->label, krule->label[0], sizeof(rule->label));
1928 strlcpy(rule->ifname, krule->ifname, sizeof(rule->ifname));
1929 strlcpy(rule->qname, krule->qname, sizeof(rule->qname));
1930 strlcpy(rule->pqname, krule->pqname, sizeof(rule->pqname));
1931 strlcpy(rule->tagname, krule->tagname, sizeof(rule->tagname));
1932 strlcpy(rule->match_tagname, krule->match_tagname,
1933 sizeof(rule->match_tagname));
1934 strlcpy(rule->overload_tblname, krule->overload_tblname,
1935 sizeof(rule->overload_tblname));
1937 pf_kpool_to_pool(&krule->rpool, &rule->rpool);
1939 rule->evaluations = pf_counter_u64_fetch(&krule->evaluations);
1940 for (int i = 0; i < 2; i++) {
1941 rule->packets[i] = pf_counter_u64_fetch(&krule->packets[i]);
1942 rule->bytes[i] = pf_counter_u64_fetch(&krule->bytes[i]);
1945 /* kif, anchor, overload_tbl are not copied over. */
1947 rule->os_fingerprint = krule->os_fingerprint;
1949 rule->rtableid = krule->rtableid;
1950 bcopy(krule->timeout, rule->timeout, sizeof(krule->timeout));
1951 rule->max_states = krule->max_states;
1952 rule->max_src_nodes = krule->max_src_nodes;
1953 rule->max_src_states = krule->max_src_states;
1954 rule->max_src_conn = krule->max_src_conn;
1955 rule->max_src_conn_rate.limit = krule->max_src_conn_rate.limit;
1956 rule->max_src_conn_rate.seconds = krule->max_src_conn_rate.seconds;
1957 rule->qid = krule->qid;
1958 rule->pqid = krule->pqid;
1959 rule->nr = krule->nr;
1960 rule->prob = krule->prob;
1961 rule->cuid = krule->cuid;
1962 rule->cpid = krule->cpid;
1964 rule->return_icmp = krule->return_icmp;
1965 rule->return_icmp6 = krule->return_icmp6;
1966 rule->max_mss = krule->max_mss;
1967 rule->tag = krule->tag;
1968 rule->match_tag = krule->match_tag;
1969 rule->scrub_flags = krule->scrub_flags;
1971 bcopy(&krule->uid, &rule->uid, sizeof(krule->uid));
1972 bcopy(&krule->gid, &rule->gid, sizeof(krule->gid));
1974 rule->rule_flag = krule->rule_flag;
1975 rule->action = krule->action;
1976 rule->direction = krule->direction;
1977 rule->log = krule->log;
1978 rule->logif = krule->logif;
1979 rule->quick = krule->quick;
1980 rule->ifnot = krule->ifnot;
1981 rule->match_tag_not = krule->match_tag_not;
1982 rule->natpass = krule->natpass;
1984 rule->keep_state = krule->keep_state;
1985 rule->af = krule->af;
1986 rule->proto = krule->proto;
1987 rule->type = krule->type;
1988 rule->code = krule->code;
1989 rule->flags = krule->flags;
1990 rule->flagset = krule->flagset;
1991 rule->min_ttl = krule->min_ttl;
1992 rule->allow_opts = krule->allow_opts;
1993 rule->rt = krule->rt;
1994 rule->return_ttl = krule->return_ttl;
1995 rule->tos = krule->tos;
1996 rule->set_tos = krule->set_tos;
1997 rule->anchor_relative = krule->anchor_relative;
1998 rule->anchor_wildcard = krule->anchor_wildcard;
2000 rule->flush = krule->flush;
2001 rule->prio = krule->prio;
2002 rule->set_prio[0] = krule->set_prio[0];
2003 rule->set_prio[1] = krule->set_prio[1];
2005 bcopy(&krule->divert, &rule->divert, sizeof(krule->divert));
2007 rule->u_states_cur = counter_u64_fetch(krule->states_cur);
2008 rule->u_states_tot = counter_u64_fetch(krule->states_tot);
2009 rule->u_src_nodes = counter_u64_fetch(krule->src_nodes);
2013 pf_rule_to_krule(const struct pf_rule *rule, struct pf_krule *krule)
2018 if (rule->af == AF_INET) {
2019 return (EAFNOSUPPORT);
2023 if (rule->af == AF_INET6) {
2024 return (EAFNOSUPPORT);
2028 ret = pf_check_rule_addr(&rule->src);
2031 ret = pf_check_rule_addr(&rule->dst);
2035 bcopy(&rule->src, &krule->src, sizeof(rule->src));
2036 bcopy(&rule->dst, &krule->dst, sizeof(rule->dst));
2038 ret = pf_user_strcpy(krule->label[0], rule->label, sizeof(rule->label));
2041 ret = pf_user_strcpy(krule->ifname, rule->ifname, sizeof(rule->ifname));
2044 ret = pf_user_strcpy(krule->qname, rule->qname, sizeof(rule->qname));
2047 ret = pf_user_strcpy(krule->pqname, rule->pqname, sizeof(rule->pqname));
2050 ret = pf_user_strcpy(krule->tagname, rule->tagname,
2051 sizeof(rule->tagname));
2054 ret = pf_user_strcpy(krule->match_tagname, rule->match_tagname,
2055 sizeof(rule->match_tagname));
2058 ret = pf_user_strcpy(krule->overload_tblname, rule->overload_tblname,
2059 sizeof(rule->overload_tblname));
2063 pf_pool_to_kpool(&rule->rpool, &krule->rpool);
2065 /* Don't allow userspace to set evaluations, packets or bytes. */
2066 /* kif, anchor, overload_tbl are not copied over. */
2068 krule->os_fingerprint = rule->os_fingerprint;
2070 krule->rtableid = rule->rtableid;
2071 bcopy(rule->timeout, krule->timeout, sizeof(krule->timeout));
2072 krule->max_states = rule->max_states;
2073 krule->max_src_nodes = rule->max_src_nodes;
2074 krule->max_src_states = rule->max_src_states;
2075 krule->max_src_conn = rule->max_src_conn;
2076 krule->max_src_conn_rate.limit = rule->max_src_conn_rate.limit;
2077 krule->max_src_conn_rate.seconds = rule->max_src_conn_rate.seconds;
2078 krule->qid = rule->qid;
2079 krule->pqid = rule->pqid;
2080 krule->nr = rule->nr;
2081 krule->prob = rule->prob;
2082 krule->cuid = rule->cuid;
2083 krule->cpid = rule->cpid;
2085 krule->return_icmp = rule->return_icmp;
2086 krule->return_icmp6 = rule->return_icmp6;
2087 krule->max_mss = rule->max_mss;
2088 krule->tag = rule->tag;
2089 krule->match_tag = rule->match_tag;
2090 krule->scrub_flags = rule->scrub_flags;
2092 bcopy(&rule->uid, &krule->uid, sizeof(krule->uid));
2093 bcopy(&rule->gid, &krule->gid, sizeof(krule->gid));
2095 krule->rule_flag = rule->rule_flag;
2096 krule->action = rule->action;
2097 krule->direction = rule->direction;
2098 krule->log = rule->log;
2099 krule->logif = rule->logif;
2100 krule->quick = rule->quick;
2101 krule->ifnot = rule->ifnot;
2102 krule->match_tag_not = rule->match_tag_not;
2103 krule->natpass = rule->natpass;
2105 krule->keep_state = rule->keep_state;
2106 krule->af = rule->af;
2107 krule->proto = rule->proto;
2108 krule->type = rule->type;
2109 krule->code = rule->code;
2110 krule->flags = rule->flags;
2111 krule->flagset = rule->flagset;
2112 krule->min_ttl = rule->min_ttl;
2113 krule->allow_opts = rule->allow_opts;
2114 krule->rt = rule->rt;
2115 krule->return_ttl = rule->return_ttl;
2116 krule->tos = rule->tos;
2117 krule->set_tos = rule->set_tos;
2119 krule->flush = rule->flush;
2120 krule->prio = rule->prio;
2121 krule->set_prio[0] = rule->set_prio[0];
2122 krule->set_prio[1] = rule->set_prio[1];
2124 bcopy(&rule->divert, &krule->divert, sizeof(krule->divert));
2130 pf_state_kill_to_kstate_kill(const struct pfioc_state_kill *psk,
2131 struct pf_kstate_kill *kill)
2135 bzero(kill, sizeof(*kill));
2137 bcopy(&psk->psk_pfcmp, &kill->psk_pfcmp, sizeof(kill->psk_pfcmp));
2138 kill->psk_af = psk->psk_af;
2139 kill->psk_proto = psk->psk_proto;
2140 bcopy(&psk->psk_src, &kill->psk_src, sizeof(kill->psk_src));
2141 bcopy(&psk->psk_dst, &kill->psk_dst, sizeof(kill->psk_dst));
2142 ret = pf_user_strcpy(kill->psk_ifname, psk->psk_ifname,
2143 sizeof(kill->psk_ifname));
2146 ret = pf_user_strcpy(kill->psk_label, psk->psk_label,
2147 sizeof(kill->psk_label));
2155 pf_ioctl_addrule(struct pf_krule *rule, uint32_t ticket,
2156 uint32_t pool_ticket, const char *anchor, const char *anchor_call,
2159 struct pf_kruleset *ruleset;
2160 struct pf_krule *tail;
2161 struct pf_kpooladdr *pa;
2162 struct pfi_kkif *kif = NULL;
2166 if ((rule->return_icmp >> 8) > ICMP_MAXTYPE) {
2168 goto errout_unlocked;
2171 #define ERROUT(x) ERROUT_FUNCTION(errout, x)
2173 if (rule->ifname[0])
2174 kif = pf_kkif_create(M_WAITOK);
2175 pf_counter_u64_init(&rule->evaluations, M_WAITOK);
2176 for (int i = 0; i < 2; i++) {
2177 pf_counter_u64_init(&rule->packets[i], M_WAITOK);
2178 pf_counter_u64_init(&rule->bytes[i], M_WAITOK);
2180 rule->states_cur = counter_u64_alloc(M_WAITOK);
2181 rule->states_tot = counter_u64_alloc(M_WAITOK);
2182 rule->src_nodes = counter_u64_alloc(M_WAITOK);
2183 rule->cuid = td->td_ucred->cr_ruid;
2184 rule->cpid = td->td_proc ? td->td_proc->p_pid : 0;
2185 TAILQ_INIT(&rule->rpool.list);
2189 #ifdef PF_WANT_32_TO_64_COUNTER
2190 LIST_INSERT_HEAD(&V_pf_allrulelist, rule, allrulelist);
2191 MPASS(!rule->allrulelinked);
2192 rule->allrulelinked = true;
2193 V_pf_allrulecount++;
2195 ruleset = pf_find_kruleset(anchor);
2196 if (ruleset == NULL)
2198 rs_num = pf_get_ruleset_number(rule->action);
2199 if (rs_num >= PF_RULESET_MAX)
2201 if (ticket != ruleset->rules[rs_num].inactive.ticket) {
2202 DPFPRINTF(PF_DEBUG_MISC,
2203 ("ticket: %d != [%d]%d\n", ticket, rs_num,
2204 ruleset->rules[rs_num].inactive.ticket));
2207 if (pool_ticket != V_ticket_pabuf) {
2208 DPFPRINTF(PF_DEBUG_MISC,
2209 ("pool_ticket: %d != %d\n", pool_ticket,
2214 * XXXMJG hack: there is no mechanism to ensure they started the
2215 * transaction. Ticket checked above may happen to match by accident,
2216 * even if nobody called DIOCXBEGIN, let alone this process.
2217 * Partially work around it by checking if the RB tree got allocated,
2218 * see pf_begin_rules.
2220 if (ruleset->rules[rs_num].inactive.tree == NULL) {
2224 tail = TAILQ_LAST(ruleset->rules[rs_num].inactive.ptr,
2227 rule->nr = tail->nr + 1;
2230 if (rule->ifname[0]) {
2231 rule->kif = pfi_kkif_attach(kif, rule->ifname);
2233 pfi_kkif_ref(rule->kif);
2237 if (rule->rtableid > 0 && rule->rtableid >= rt_numfibs)
2242 if (rule->qname[0] != 0) {
2243 if ((rule->qid = pf_qname2qid(rule->qname)) == 0)
2245 else if (rule->pqname[0] != 0) {
2247 pf_qname2qid(rule->pqname)) == 0)
2250 rule->pqid = rule->qid;
2253 if (rule->tagname[0])
2254 if ((rule->tag = pf_tagname2tag(rule->tagname)) == 0)
2256 if (rule->match_tagname[0])
2257 if ((rule->match_tag =
2258 pf_tagname2tag(rule->match_tagname)) == 0)
2260 if (rule->rt && !rule->direction)
2264 if (rule->logif >= PFLOGIFS_MAX)
2266 if (pf_addr_setup(ruleset, &rule->src.addr, rule->af))
2268 if (pf_addr_setup(ruleset, &rule->dst.addr, rule->af))
2270 if (pf_kanchor_setup(rule, ruleset, anchor_call))
2272 if (rule->scrub_flags & PFSTATE_SETPRIO &&
2273 (rule->set_prio[0] > PF_PRIO_MAX ||
2274 rule->set_prio[1] > PF_PRIO_MAX))
2276 TAILQ_FOREACH(pa, &V_pf_pabuf, entries)
2277 if (pa->addr.type == PF_ADDR_TABLE) {
2278 pa->addr.p.tbl = pfr_attach_table(ruleset,
2279 pa->addr.v.tblname);
2280 if (pa->addr.p.tbl == NULL)
2284 rule->overload_tbl = NULL;
2285 if (rule->overload_tblname[0]) {
2286 if ((rule->overload_tbl = pfr_attach_table(ruleset,
2287 rule->overload_tblname)) == NULL)
2290 rule->overload_tbl->pfrkt_flags |=
2294 pf_mv_kpool(&V_pf_pabuf, &rule->rpool.list);
2295 if (((((rule->action == PF_NAT) || (rule->action == PF_RDR) ||
2296 (rule->action == PF_BINAT)) && rule->anchor == NULL) ||
2297 (rule->rt > PF_NOPFROUTE)) &&
2298 (TAILQ_FIRST(&rule->rpool.list) == NULL))
2307 rule->rpool.cur = TAILQ_FIRST(&rule->rpool.list);
2308 TAILQ_INSERT_TAIL(ruleset->rules[rs_num].inactive.ptr,
2310 ruleset->rules[rs_num].inactive.rcount++;
2314 if (RB_INSERT(pf_krule_global, ruleset->rules[rs_num].inactive.tree, rule) != NULL) {
2316 TAILQ_REMOVE(ruleset->rules[rs_num].inactive.ptr, rule, entries);
2317 ruleset->rules[rs_num].inactive.rcount--;
2332 pf_krule_free(rule);
2337 pf_label_match(const struct pf_krule *rule, const char *label)
2341 while (*rule->label[i]) {
2342 if (strcmp(rule->label[i], label) == 0)
2351 pf_kill_matching_state(struct pf_state_key_cmp *key, int dir)
2353 struct pf_kstate *s;
2356 s = pf_find_state_all(key, dir, &more);
2370 pf_killstates_row(struct pf_kstate_kill *psk, struct pf_idhash *ih)
2372 struct pf_kstate *s;
2373 struct pf_state_key *sk;
2374 struct pf_addr *srcaddr, *dstaddr;
2375 struct pf_state_key_cmp match_key;
2376 int idx, killed = 0;
2378 u_int16_t srcport, dstport;
2379 struct pfi_kkif *kif;
2381 relock_DIOCKILLSTATES:
2382 PF_HASHROW_LOCK(ih);
2383 LIST_FOREACH(s, &ih->states, entry) {
2384 /* For floating states look at the original kif. */
2385 kif = s->kif == V_pfi_all ? s->orig_kif : s->kif;
2387 sk = s->key[PF_SK_WIRE];
2388 if (s->direction == PF_OUT) {
2389 srcaddr = &sk->addr[1];
2390 dstaddr = &sk->addr[0];
2391 srcport = sk->port[1];
2392 dstport = sk->port[0];
2394 srcaddr = &sk->addr[0];
2395 dstaddr = &sk->addr[1];
2396 srcport = sk->port[0];
2397 dstport = sk->port[1];
2400 if (psk->psk_af && sk->af != psk->psk_af)
2403 if (psk->psk_proto && psk->psk_proto != sk->proto)
2406 if (! PF_MATCHA(psk->psk_src.neg, &psk->psk_src.addr.v.a.addr,
2407 &psk->psk_src.addr.v.a.mask, srcaddr, sk->af))
2410 if (! PF_MATCHA(psk->psk_dst.neg, &psk->psk_dst.addr.v.a.addr,
2411 &psk->psk_dst.addr.v.a.mask, dstaddr, sk->af))
2414 if (! PF_MATCHA(psk->psk_rt_addr.neg,
2415 &psk->psk_rt_addr.addr.v.a.addr,
2416 &psk->psk_rt_addr.addr.v.a.mask,
2417 &s->rt_addr, sk->af))
2420 if (psk->psk_src.port_op != 0 &&
2421 ! pf_match_port(psk->psk_src.port_op,
2422 psk->psk_src.port[0], psk->psk_src.port[1], srcport))
2425 if (psk->psk_dst.port_op != 0 &&
2426 ! pf_match_port(psk->psk_dst.port_op,
2427 psk->psk_dst.port[0], psk->psk_dst.port[1], dstport))
2430 if (psk->psk_label[0] &&
2431 ! pf_label_match(s->rule.ptr, psk->psk_label))
2434 if (psk->psk_ifname[0] && strcmp(psk->psk_ifname,
2438 if (psk->psk_kill_match) {
2439 /* Create the key to find matching states, with lock
2442 bzero(&match_key, sizeof(match_key));
2444 if (s->direction == PF_OUT) {
2452 match_key.af = s->key[idx]->af;
2453 match_key.proto = s->key[idx]->proto;
2454 PF_ACPY(&match_key.addr[0],
2455 &s->key[idx]->addr[1], match_key.af);
2456 match_key.port[0] = s->key[idx]->port[1];
2457 PF_ACPY(&match_key.addr[1],
2458 &s->key[idx]->addr[0], match_key.af);
2459 match_key.port[1] = s->key[idx]->port[0];
2465 if (psk->psk_kill_match)
2466 killed += pf_kill_matching_state(&match_key, dir);
2468 goto relock_DIOCKILLSTATES;
2470 PF_HASHROW_UNLOCK(ih);
2476 pfioctl(struct cdev *dev, u_long cmd, caddr_t addr, int flags, struct thread *td)
2479 PF_RULES_RLOCK_TRACKER;
2481 #define ERROUT_IOCTL(target, x) \
2484 SDT_PROBE3(pf, ioctl, ioctl, error, cmd, error, __LINE__); \
2489 /* XXX keep in sync with switch() below */
2490 if (securelevel_gt(td->td_ucred, 2))
2498 case DIOCGETSTATENV:
2499 case DIOCSETSTATUSIF:
2501 case DIOCGETSTATUSNV:
2506 case DIOCGETSTATESV2:
2507 case DIOCGETTIMEOUT:
2508 case DIOCCLRRULECTRS:
2510 case DIOCGETALTQSV0:
2511 case DIOCGETALTQSV1:
2514 case DIOCGETQSTATSV0:
2515 case DIOCGETQSTATSV1:
2516 case DIOCGETRULESETS:
2517 case DIOCGETRULESET:
2518 case DIOCRGETTABLES:
2519 case DIOCRGETTSTATS:
2520 case DIOCRCLRTSTATS:
2526 case DIOCRGETASTATS:
2527 case DIOCRCLRASTATS:
2530 case DIOCGETSRCNODES:
2531 case DIOCCLRSRCNODES:
2532 case DIOCGETSYNCOOKIES:
2533 case DIOCIGETIFACES:
2534 case DIOCGIFSPEEDV0:
2535 case DIOCGIFSPEEDV1:
2538 case DIOCGETETHRULES:
2539 case DIOCGETETHRULE:
2540 case DIOCGETETHRULESETS:
2541 case DIOCGETETHRULESET:
2543 case DIOCRCLRTABLES:
2544 case DIOCRADDTABLES:
2545 case DIOCRDELTABLES:
2546 case DIOCRSETTFLAGS:
2547 if (((struct pfioc_table *)addr)->pfrio_flags &
2549 break; /* dummy operation ok */
2555 if (!(flags & FWRITE))
2561 case DIOCGETSTATENV:
2563 case DIOCGETSTATUSNV:
2565 case DIOCGETSTATESV2:
2566 case DIOCGETTIMEOUT:
2568 case DIOCGETALTQSV0:
2569 case DIOCGETALTQSV1:
2572 case DIOCGETQSTATSV0:
2573 case DIOCGETQSTATSV1:
2574 case DIOCGETRULESETS:
2575 case DIOCGETRULESET:
2577 case DIOCRGETTABLES:
2578 case DIOCRGETTSTATS:
2580 case DIOCRGETASTATS:
2583 case DIOCGETSRCNODES:
2584 case DIOCGETSYNCOOKIES:
2585 case DIOCIGETIFACES:
2586 case DIOCGIFSPEEDV1:
2587 case DIOCGIFSPEEDV0:
2589 case DIOCGETETHRULES:
2590 case DIOCGETETHRULE:
2591 case DIOCGETETHRULESETS:
2592 case DIOCGETETHRULESET:
2594 case DIOCRCLRTABLES:
2595 case DIOCRADDTABLES:
2596 case DIOCRDELTABLES:
2597 case DIOCRCLRTSTATS:
2602 case DIOCRSETTFLAGS:
2603 if (((struct pfioc_table *)addr)->pfrio_flags &
2605 flags |= FWRITE; /* need write lock for dummy */
2606 break; /* dummy operation ok */
2610 if (((struct pfioc_rule *)addr)->action ==
2618 CURVNET_SET(TD_TO_VNET(td));
2622 sx_xlock(&V_pf_ioctl_lock);
2623 if (V_pf_status.running)
2627 if (! TAILQ_EMPTY(V_pf_keth->active.rules))
2629 V_pf_status.running = 1;
2630 V_pf_status.since = time_second;
2631 new_unrhdr64(&V_pf_stateid, time_second);
2633 DPFPRINTF(PF_DEBUG_MISC, ("pf: started\n"));
2638 sx_xlock(&V_pf_ioctl_lock);
2639 if (!V_pf_status.running)
2642 V_pf_status.running = 0;
2645 V_pf_status.since = time_second;
2646 DPFPRINTF(PF_DEBUG_MISC, ("pf: stopped\n"));
2650 case DIOCGETETHRULES: {
2651 struct pfioc_nv *nv = (struct pfioc_nv *)addr;
2654 struct pf_keth_rule *tail;
2655 struct pf_keth_ruleset *rs;
2656 u_int32_t ticket, nr;
2657 const char *anchor = "";
2662 #define ERROUT(x) ERROUT_IOCTL(DIOCGETETHRULES_error, x)
2664 if (nv->len > pf_ioctl_maxcount)
2667 /* Copy the request in */
2668 packed = malloc(nv->len, M_NVLIST, M_WAITOK);
2672 error = copyin(nv->data, packed, nv->len);
2676 nvl = nvlist_unpack(packed, nv->len, 0);
2680 if (! nvlist_exists_string(nvl, "anchor"))
2683 anchor = nvlist_get_string(nvl, "anchor");
2685 rs = pf_find_keth_ruleset(anchor);
2687 nvlist_destroy(nvl);
2689 free(packed, M_NVLIST);
2696 nvl = nvlist_create(0);
2702 ticket = rs->active.ticket;
2703 tail = TAILQ_LAST(rs->active.rules, pf_keth_ruleq);
2711 nvlist_add_number(nvl, "ticket", ticket);
2712 nvlist_add_number(nvl, "nr", nr);
2714 packed = nvlist_pack(nvl, &nv->len);
2720 else if (nv->size < nv->len)
2723 error = copyout(packed, nv->data, nv->len);
2726 DIOCGETETHRULES_error:
2727 free(packed, M_NVLIST);
2728 nvlist_destroy(nvl);
2732 case DIOCGETETHRULE: {
2733 struct epoch_tracker et;
2734 struct pfioc_nv *nv = (struct pfioc_nv *)addr;
2735 nvlist_t *nvl = NULL;
2736 void *nvlpacked = NULL;
2737 struct pf_keth_rule *rule = NULL;
2738 struct pf_keth_ruleset *rs;
2739 u_int32_t ticket, nr;
2743 #define ERROUT(x) ERROUT_IOCTL(DIOCGETETHRULE_error, x)
2745 if (nv->len > pf_ioctl_maxcount)
2748 nvlpacked = malloc(nv->len, M_NVLIST, M_WAITOK);
2749 if (nvlpacked == NULL)
2752 error = copyin(nv->data, nvlpacked, nv->len);
2756 nvl = nvlist_unpack(nvlpacked, nv->len, 0);
2759 if (! nvlist_exists_number(nvl, "ticket"))
2761 ticket = nvlist_get_number(nvl, "ticket");
2762 if (! nvlist_exists_string(nvl, "anchor"))
2764 anchor = nvlist_get_string(nvl, "anchor");
2766 if (nvlist_exists_bool(nvl, "clear"))
2767 clear = nvlist_get_bool(nvl, "clear");
2769 if (clear && !(flags & FWRITE))
2772 if (! nvlist_exists_number(nvl, "nr"))
2774 nr = nvlist_get_number(nvl, "nr");
2777 rs = pf_find_keth_ruleset(anchor);
2782 if (ticket != rs->active.ticket) {
2787 nvlist_destroy(nvl);
2789 free(nvlpacked, M_NVLIST);
2792 rule = TAILQ_FIRST(rs->active.rules);
2793 while ((rule != NULL) && (rule->nr != nr))
2794 rule = TAILQ_NEXT(rule, entries);
2799 /* Make sure rule can't go away. */
2800 NET_EPOCH_ENTER(et);
2802 nvl = pf_keth_rule_to_nveth_rule(rule);
2803 if (pf_keth_anchor_nvcopyout(rs, rule, nvl))
2809 nvlpacked = nvlist_pack(nvl, &nv->len);
2810 if (nvlpacked == NULL)
2815 else if (nv->size < nv->len)
2818 error = copyout(nvlpacked, nv->data, nv->len);
2819 if (error == 0 && clear) {
2820 counter_u64_zero(rule->evaluations);
2821 for (int i = 0; i < 2; i++) {
2822 counter_u64_zero(rule->packets[i]);
2823 counter_u64_zero(rule->bytes[i]);
2828 DIOCGETETHRULE_error:
2829 free(nvlpacked, M_NVLIST);
2830 nvlist_destroy(nvl);
2834 case DIOCADDETHRULE: {
2835 struct pfioc_nv *nv = (struct pfioc_nv *)addr;
2836 nvlist_t *nvl = NULL;
2837 void *nvlpacked = NULL;
2838 struct pf_keth_rule *rule = NULL, *tail = NULL;
2839 struct pf_keth_ruleset *ruleset = NULL;
2840 struct pfi_kkif *kif = NULL, *bridge_to_kif = NULL;
2841 const char *anchor = "", *anchor_call = "";
2843 #define ERROUT(x) ERROUT_IOCTL(DIOCADDETHRULE_error, x)
2845 if (nv->len > pf_ioctl_maxcount)
2848 nvlpacked = malloc(nv->len, M_NVLIST, M_WAITOK);
2849 if (nvlpacked == NULL)
2852 error = copyin(nv->data, nvlpacked, nv->len);
2856 nvl = nvlist_unpack(nvlpacked, nv->len, 0);
2860 if (! nvlist_exists_number(nvl, "ticket"))
2863 if (nvlist_exists_string(nvl, "anchor"))
2864 anchor = nvlist_get_string(nvl, "anchor");
2865 if (nvlist_exists_string(nvl, "anchor_call"))
2866 anchor_call = nvlist_get_string(nvl, "anchor_call");
2868 ruleset = pf_find_keth_ruleset(anchor);
2869 if (ruleset == NULL)
2872 if (nvlist_get_number(nvl, "ticket") !=
2873 ruleset->inactive.ticket) {
2874 DPFPRINTF(PF_DEBUG_MISC,
2875 ("ticket: %d != %d\n",
2876 (u_int32_t)nvlist_get_number(nvl, "ticket"),
2877 ruleset->inactive.ticket));
2881 rule = malloc(sizeof(*rule), M_PFRULE, M_WAITOK);
2884 rule->timestamp = NULL;
2886 error = pf_nveth_rule_to_keth_rule(nvl, rule);
2890 if (rule->ifname[0])
2891 kif = pf_kkif_create(M_WAITOK);
2892 if (rule->bridge_to_name[0])
2893 bridge_to_kif = pf_kkif_create(M_WAITOK);
2894 rule->evaluations = counter_u64_alloc(M_WAITOK);
2895 for (int i = 0; i < 2; i++) {
2896 rule->packets[i] = counter_u64_alloc(M_WAITOK);
2897 rule->bytes[i] = counter_u64_alloc(M_WAITOK);
2899 rule->timestamp = uma_zalloc_pcpu(pf_timestamp_pcpu_zone,
2904 if (rule->ifname[0]) {
2905 rule->kif = pfi_kkif_attach(kif, rule->ifname);
2906 pfi_kkif_ref(rule->kif);
2909 if (rule->bridge_to_name[0]) {
2910 rule->bridge_to = pfi_kkif_attach(bridge_to_kif,
2911 rule->bridge_to_name);
2912 pfi_kkif_ref(rule->bridge_to);
2914 rule->bridge_to = NULL;
2918 if (rule->qname[0] != 0) {
2919 if ((rule->qid = pf_qname2qid(rule->qname)) == 0)
2922 rule->qid = rule->qid;
2925 if (rule->tagname[0])
2926 if ((rule->tag = pf_tagname2tag(rule->tagname)) == 0)
2928 if (rule->match_tagname[0])
2929 if ((rule->match_tag = pf_tagname2tag(
2930 rule->match_tagname)) == 0)
2933 if (error == 0 && rule->ipdst.addr.type == PF_ADDR_TABLE)
2934 error = pf_eth_addr_setup(ruleset, &rule->ipdst.addr);
2935 if (error == 0 && rule->ipsrc.addr.type == PF_ADDR_TABLE)
2936 error = pf_eth_addr_setup(ruleset, &rule->ipsrc.addr);
2939 pf_free_eth_rule(rule);
2944 if (pf_keth_anchor_setup(rule, ruleset, anchor_call)) {
2945 pf_free_eth_rule(rule);
2950 tail = TAILQ_LAST(ruleset->inactive.rules, pf_keth_ruleq);
2952 rule->nr = tail->nr + 1;
2956 TAILQ_INSERT_TAIL(ruleset->inactive.rules, rule, entries);
2961 DIOCADDETHRULE_error:
2962 nvlist_destroy(nvl);
2963 free(nvlpacked, M_NVLIST);
2967 case DIOCGETETHRULESETS: {
2968 struct epoch_tracker et;
2969 struct pfioc_nv *nv = (struct pfioc_nv *)addr;
2970 nvlist_t *nvl = NULL;
2971 void *nvlpacked = NULL;
2972 struct pf_keth_ruleset *ruleset;
2973 struct pf_keth_anchor *anchor;
2976 #define ERROUT(x) ERROUT_IOCTL(DIOCGETETHRULESETS_error, x)
2978 if (nv->len > pf_ioctl_maxcount)
2981 nvlpacked = malloc(nv->len, M_NVLIST, M_WAITOK);
2982 if (nvlpacked == NULL)
2985 error = copyin(nv->data, nvlpacked, nv->len);
2989 nvl = nvlist_unpack(nvlpacked, nv->len, 0);
2992 if (! nvlist_exists_string(nvl, "path"))
2995 NET_EPOCH_ENTER(et);
2997 if ((ruleset = pf_find_keth_ruleset(
2998 nvlist_get_string(nvl, "path"))) == NULL) {
3003 if (ruleset->anchor == NULL) {
3004 RB_FOREACH(anchor, pf_keth_anchor_global, &V_pf_keth_anchors)
3005 if (anchor->parent == NULL)
3008 RB_FOREACH(anchor, pf_keth_anchor_node,
3009 &ruleset->anchor->children)
3015 nvlist_destroy(nvl);
3017 free(nvlpacked, M_NVLIST);
3020 nvl = nvlist_create(0);
3024 nvlist_add_number(nvl, "nr", nr);
3026 nvlpacked = nvlist_pack(nvl, &nv->len);
3027 if (nvlpacked == NULL)
3032 else if (nv->size < nv->len)
3035 error = copyout(nvlpacked, nv->data, nv->len);
3038 DIOCGETETHRULESETS_error:
3039 free(nvlpacked, M_NVLIST);
3040 nvlist_destroy(nvl);
3044 case DIOCGETETHRULESET: {
3045 struct epoch_tracker et;
3046 struct pfioc_nv *nv = (struct pfioc_nv *)addr;
3047 nvlist_t *nvl = NULL;
3048 void *nvlpacked = NULL;
3049 struct pf_keth_ruleset *ruleset;
3050 struct pf_keth_anchor *anchor;
3051 int nr = 0, req_nr = 0;
3054 #define ERROUT(x) ERROUT_IOCTL(DIOCGETETHRULESET_error, x)
3056 if (nv->len > pf_ioctl_maxcount)
3059 nvlpacked = malloc(nv->len, M_NVLIST, M_WAITOK);
3060 if (nvlpacked == NULL)
3063 error = copyin(nv->data, nvlpacked, nv->len);
3067 nvl = nvlist_unpack(nvlpacked, nv->len, 0);
3070 if (! nvlist_exists_string(nvl, "path"))
3072 if (! nvlist_exists_number(nvl, "nr"))
3075 req_nr = nvlist_get_number(nvl, "nr");
3077 NET_EPOCH_ENTER(et);
3079 if ((ruleset = pf_find_keth_ruleset(
3080 nvlist_get_string(nvl, "path"))) == NULL) {
3085 nvlist_destroy(nvl);
3087 free(nvlpacked, M_NVLIST);
3090 nvl = nvlist_create(0);
3096 if (ruleset->anchor == NULL) {
3097 RB_FOREACH(anchor, pf_keth_anchor_global,
3098 &V_pf_keth_anchors) {
3099 if (anchor->parent == NULL && nr++ == req_nr) {
3105 RB_FOREACH(anchor, pf_keth_anchor_node,
3106 &ruleset->anchor->children) {
3107 if (nr++ == req_nr) {
3116 nvlist_add_number(nvl, "nr", nr);
3117 nvlist_add_string(nvl, "name", anchor->name);
3118 if (ruleset->anchor)
3119 nvlist_add_string(nvl, "path",
3120 ruleset->anchor->path);
3122 nvlist_add_string(nvl, "path", "");
3127 nvlpacked = nvlist_pack(nvl, &nv->len);
3128 if (nvlpacked == NULL)
3133 else if (nv->size < nv->len)
3136 error = copyout(nvlpacked, nv->data, nv->len);
3139 DIOCGETETHRULESET_error:
3140 free(nvlpacked, M_NVLIST);
3141 nvlist_destroy(nvl);
3145 case DIOCADDRULENV: {
3146 struct pfioc_nv *nv = (struct pfioc_nv *)addr;
3147 nvlist_t *nvl = NULL;
3148 void *nvlpacked = NULL;
3149 struct pf_krule *rule = NULL;
3150 const char *anchor = "", *anchor_call = "";
3151 uint32_t ticket = 0, pool_ticket = 0;
3153 #define ERROUT(x) ERROUT_IOCTL(DIOCADDRULENV_error, x)
3155 if (nv->len > pf_ioctl_maxcount)
3158 nvlpacked = malloc(nv->len, M_NVLIST, M_WAITOK);
3159 error = copyin(nv->data, nvlpacked, nv->len);
3163 nvl = nvlist_unpack(nvlpacked, nv->len, 0);
3167 if (! nvlist_exists_number(nvl, "ticket"))
3169 ticket = nvlist_get_number(nvl, "ticket");
3171 if (! nvlist_exists_number(nvl, "pool_ticket"))
3173 pool_ticket = nvlist_get_number(nvl, "pool_ticket");
3175 if (! nvlist_exists_nvlist(nvl, "rule"))
3178 rule = pf_krule_alloc();
3179 error = pf_nvrule_to_krule(nvlist_get_nvlist(nvl, "rule"),
3184 if (nvlist_exists_string(nvl, "anchor"))
3185 anchor = nvlist_get_string(nvl, "anchor");
3186 if (nvlist_exists_string(nvl, "anchor_call"))
3187 anchor_call = nvlist_get_string(nvl, "anchor_call");
3189 if ((error = nvlist_error(nvl)))
3192 /* Frees rule on error */
3193 error = pf_ioctl_addrule(rule, ticket, pool_ticket, anchor,
3196 nvlist_destroy(nvl);
3197 free(nvlpacked, M_NVLIST);
3200 DIOCADDRULENV_error:
3201 pf_krule_free(rule);
3202 nvlist_destroy(nvl);
3203 free(nvlpacked, M_NVLIST);
3208 struct pfioc_rule *pr = (struct pfioc_rule *)addr;
3209 struct pf_krule *rule;
3211 rule = pf_krule_alloc();
3212 error = pf_rule_to_krule(&pr->rule, rule);
3214 pf_krule_free(rule);
3218 pr->anchor[sizeof(pr->anchor) - 1] = 0;
3220 /* Frees rule on error */
3221 error = pf_ioctl_addrule(rule, pr->ticket, pr->pool_ticket,
3222 pr->anchor, pr->anchor_call, td);
3226 case DIOCGETRULES: {
3227 struct pfioc_rule *pr = (struct pfioc_rule *)addr;
3228 struct pf_kruleset *ruleset;
3229 struct pf_krule *tail;
3232 pr->anchor[sizeof(pr->anchor) - 1] = 0;
3235 ruleset = pf_find_kruleset(pr->anchor);
3236 if (ruleset == NULL) {
3241 rs_num = pf_get_ruleset_number(pr->rule.action);
3242 if (rs_num >= PF_RULESET_MAX) {
3247 tail = TAILQ_LAST(ruleset->rules[rs_num].active.ptr,
3250 pr->nr = tail->nr + 1;
3253 pr->ticket = ruleset->rules[rs_num].active.ticket;
3259 struct pfioc_rule *pr = (struct pfioc_rule *)addr;
3260 struct pf_kruleset *ruleset;
3261 struct pf_krule *rule;
3264 pr->anchor[sizeof(pr->anchor) - 1] = 0;
3267 ruleset = pf_find_kruleset(pr->anchor);
3268 if (ruleset == NULL) {
3273 rs_num = pf_get_ruleset_number(pr->rule.action);
3274 if (rs_num >= PF_RULESET_MAX) {
3279 if (pr->ticket != ruleset->rules[rs_num].active.ticket) {
3284 rule = TAILQ_FIRST(ruleset->rules[rs_num].active.ptr);
3285 while ((rule != NULL) && (rule->nr != pr->nr))
3286 rule = TAILQ_NEXT(rule, entries);
3293 pf_krule_to_rule(rule, &pr->rule);
3295 if (pf_kanchor_copyout(ruleset, rule, pr)) {
3300 pf_addr_copyout(&pr->rule.src.addr);
3301 pf_addr_copyout(&pr->rule.dst.addr);
3303 if (pr->action == PF_GET_CLR_CNTR) {
3304 pf_counter_u64_zero(&rule->evaluations);
3305 for (int i = 0; i < 2; i++) {
3306 pf_counter_u64_zero(&rule->packets[i]);
3307 pf_counter_u64_zero(&rule->bytes[i]);
3309 counter_u64_zero(rule->states_tot);
3315 case DIOCGETRULENV: {
3316 struct pfioc_nv *nv = (struct pfioc_nv *)addr;
3317 nvlist_t *nvrule = NULL;
3318 nvlist_t *nvl = NULL;
3319 struct pf_kruleset *ruleset;
3320 struct pf_krule *rule;
3321 void *nvlpacked = NULL;
3323 bool clear_counter = false;
3325 #define ERROUT(x) ERROUT_IOCTL(DIOCGETRULENV_error, x)
3327 if (nv->len > pf_ioctl_maxcount)
3330 /* Copy the request in */
3331 nvlpacked = malloc(nv->len, M_NVLIST, M_WAITOK);
3332 if (nvlpacked == NULL)
3335 error = copyin(nv->data, nvlpacked, nv->len);
3339 nvl = nvlist_unpack(nvlpacked, nv->len, 0);
3343 if (! nvlist_exists_string(nvl, "anchor"))
3345 if (! nvlist_exists_number(nvl, "ruleset"))
3347 if (! nvlist_exists_number(nvl, "ticket"))
3349 if (! nvlist_exists_number(nvl, "nr"))
3352 if (nvlist_exists_bool(nvl, "clear_counter"))
3353 clear_counter = nvlist_get_bool(nvl, "clear_counter");
3355 if (clear_counter && !(flags & FWRITE))
3358 nr = nvlist_get_number(nvl, "nr");
3361 ruleset = pf_find_kruleset(nvlist_get_string(nvl, "anchor"));
3362 if (ruleset == NULL) {
3367 rs_num = pf_get_ruleset_number(nvlist_get_number(nvl, "ruleset"));
3368 if (rs_num >= PF_RULESET_MAX) {
3373 if (nvlist_get_number(nvl, "ticket") !=
3374 ruleset->rules[rs_num].active.ticket) {
3379 if ((error = nvlist_error(nvl))) {
3384 rule = TAILQ_FIRST(ruleset->rules[rs_num].active.ptr);
3385 while ((rule != NULL) && (rule->nr != nr))
3386 rule = TAILQ_NEXT(rule, entries);
3392 nvrule = pf_krule_to_nvrule(rule);
3394 nvlist_destroy(nvl);
3395 nvl = nvlist_create(0);
3400 nvlist_add_number(nvl, "nr", nr);
3401 nvlist_add_nvlist(nvl, "rule", nvrule);
3402 nvlist_destroy(nvrule);
3404 if (pf_kanchor_nvcopyout(ruleset, rule, nvl)) {
3409 free(nvlpacked, M_NVLIST);
3410 nvlpacked = nvlist_pack(nvl, &nv->len);
3411 if (nvlpacked == NULL) {
3416 if (nv->size == 0) {
3420 else if (nv->size < nv->len) {
3425 if (clear_counter) {
3426 pf_counter_u64_zero(&rule->evaluations);
3427 for (int i = 0; i < 2; i++) {
3428 pf_counter_u64_zero(&rule->packets[i]);
3429 pf_counter_u64_zero(&rule->bytes[i]);
3431 counter_u64_zero(rule->states_tot);
3435 error = copyout(nvlpacked, nv->data, nv->len);
3438 DIOCGETRULENV_error:
3439 free(nvlpacked, M_NVLIST);
3440 nvlist_destroy(nvrule);
3441 nvlist_destroy(nvl);
3446 case DIOCCHANGERULE: {
3447 struct pfioc_rule *pcr = (struct pfioc_rule *)addr;
3448 struct pf_kruleset *ruleset;
3449 struct pf_krule *oldrule = NULL, *newrule = NULL;
3450 struct pfi_kkif *kif = NULL;
3451 struct pf_kpooladdr *pa;
3455 pcr->anchor[sizeof(pcr->anchor) - 1] = 0;
3457 if (pcr->action < PF_CHANGE_ADD_HEAD ||
3458 pcr->action > PF_CHANGE_GET_TICKET) {
3462 if (pcr->rule.return_icmp >> 8 > ICMP_MAXTYPE) {
3467 if (pcr->action != PF_CHANGE_REMOVE) {
3468 newrule = pf_krule_alloc();
3469 error = pf_rule_to_krule(&pcr->rule, newrule);
3471 pf_krule_free(newrule);
3475 if (newrule->ifname[0])
3476 kif = pf_kkif_create(M_WAITOK);
3477 pf_counter_u64_init(&newrule->evaluations, M_WAITOK);
3478 for (int i = 0; i < 2; i++) {
3479 pf_counter_u64_init(&newrule->packets[i], M_WAITOK);
3480 pf_counter_u64_init(&newrule->bytes[i], M_WAITOK);
3482 newrule->states_cur = counter_u64_alloc(M_WAITOK);
3483 newrule->states_tot = counter_u64_alloc(M_WAITOK);
3484 newrule->src_nodes = counter_u64_alloc(M_WAITOK);
3485 newrule->cuid = td->td_ucred->cr_ruid;
3486 newrule->cpid = td->td_proc ? td->td_proc->p_pid : 0;
3487 TAILQ_INIT(&newrule->rpool.list);
3489 #define ERROUT(x) ERROUT_IOCTL(DIOCCHANGERULE_error, x)
3493 #ifdef PF_WANT_32_TO_64_COUNTER
3494 if (newrule != NULL) {
3495 LIST_INSERT_HEAD(&V_pf_allrulelist, newrule, allrulelist);
3496 newrule->allrulelinked = true;
3497 V_pf_allrulecount++;
3501 if (!(pcr->action == PF_CHANGE_REMOVE ||
3502 pcr->action == PF_CHANGE_GET_TICKET) &&
3503 pcr->pool_ticket != V_ticket_pabuf)
3506 ruleset = pf_find_kruleset(pcr->anchor);
3507 if (ruleset == NULL)
3510 rs_num = pf_get_ruleset_number(pcr->rule.action);
3511 if (rs_num >= PF_RULESET_MAX)
3515 * XXXMJG: there is no guarantee that the ruleset was
3516 * created by the usual route of calling DIOCXBEGIN.
3517 * As a result it is possible the rule tree will not
3518 * be allocated yet. Hack around it by doing it here.
3519 * Note it is fine to let the tree persist in case of
3520 * error as it will be freed down the road on future
3521 * updates (if need be).
3523 if (ruleset->rules[rs_num].active.tree == NULL) {
3524 ruleset->rules[rs_num].active.tree = pf_rule_tree_alloc(M_NOWAIT);
3525 if (ruleset->rules[rs_num].active.tree == NULL) {
3530 if (pcr->action == PF_CHANGE_GET_TICKET) {
3531 pcr->ticket = ++ruleset->rules[rs_num].active.ticket;
3533 } else if (pcr->ticket !=
3534 ruleset->rules[rs_num].active.ticket)
3537 if (pcr->action != PF_CHANGE_REMOVE) {
3538 if (newrule->ifname[0]) {
3539 newrule->kif = pfi_kkif_attach(kif,
3542 pfi_kkif_ref(newrule->kif);
3544 newrule->kif = NULL;
3546 if (newrule->rtableid > 0 &&
3547 newrule->rtableid >= rt_numfibs)
3552 if (newrule->qname[0] != 0) {
3554 pf_qname2qid(newrule->qname)) == 0)
3556 else if (newrule->pqname[0] != 0) {
3557 if ((newrule->pqid =
3558 pf_qname2qid(newrule->pqname)) == 0)
3561 newrule->pqid = newrule->qid;
3564 if (newrule->tagname[0])
3566 pf_tagname2tag(newrule->tagname)) == 0)
3568 if (newrule->match_tagname[0])
3569 if ((newrule->match_tag = pf_tagname2tag(
3570 newrule->match_tagname)) == 0)
3572 if (newrule->rt && !newrule->direction)
3576 if (newrule->logif >= PFLOGIFS_MAX)
3578 if (pf_addr_setup(ruleset, &newrule->src.addr, newrule->af))
3580 if (pf_addr_setup(ruleset, &newrule->dst.addr, newrule->af))
3582 if (pf_kanchor_setup(newrule, ruleset, pcr->anchor_call))
3584 TAILQ_FOREACH(pa, &V_pf_pabuf, entries)
3585 if (pa->addr.type == PF_ADDR_TABLE) {
3587 pfr_attach_table(ruleset,
3588 pa->addr.v.tblname);
3589 if (pa->addr.p.tbl == NULL)
3593 newrule->overload_tbl = NULL;
3594 if (newrule->overload_tblname[0]) {
3595 if ((newrule->overload_tbl = pfr_attach_table(
3596 ruleset, newrule->overload_tblname)) ==
3600 newrule->overload_tbl->pfrkt_flags |=
3604 pf_mv_kpool(&V_pf_pabuf, &newrule->rpool.list);
3605 if (((((newrule->action == PF_NAT) ||
3606 (newrule->action == PF_RDR) ||
3607 (newrule->action == PF_BINAT) ||
3608 (newrule->rt > PF_NOPFROUTE)) &&
3609 !newrule->anchor)) &&
3610 (TAILQ_FIRST(&newrule->rpool.list) == NULL))
3614 pf_free_rule(newrule);
3620 newrule->rpool.cur = TAILQ_FIRST(&newrule->rpool.list);
3622 pf_empty_kpool(&V_pf_pabuf);
3624 if (pcr->action == PF_CHANGE_ADD_HEAD)
3625 oldrule = TAILQ_FIRST(
3626 ruleset->rules[rs_num].active.ptr);
3627 else if (pcr->action == PF_CHANGE_ADD_TAIL)
3628 oldrule = TAILQ_LAST(
3629 ruleset->rules[rs_num].active.ptr, pf_krulequeue);
3631 oldrule = TAILQ_FIRST(
3632 ruleset->rules[rs_num].active.ptr);
3633 while ((oldrule != NULL) && (oldrule->nr != pcr->nr))
3634 oldrule = TAILQ_NEXT(oldrule, entries);
3635 if (oldrule == NULL) {
3636 if (newrule != NULL)
3637 pf_free_rule(newrule);
3645 if (pcr->action == PF_CHANGE_REMOVE) {
3646 pf_unlink_rule(ruleset->rules[rs_num].active.ptr,
3648 RB_REMOVE(pf_krule_global,
3649 ruleset->rules[rs_num].active.tree, oldrule);
3650 ruleset->rules[rs_num].active.rcount--;
3652 pf_hash_rule(newrule);
3653 if (RB_INSERT(pf_krule_global,
3654 ruleset->rules[rs_num].active.tree, newrule) != NULL) {
3655 pf_free_rule(newrule);
3662 if (oldrule == NULL)
3664 ruleset->rules[rs_num].active.ptr,
3666 else if (pcr->action == PF_CHANGE_ADD_HEAD ||
3667 pcr->action == PF_CHANGE_ADD_BEFORE)
3668 TAILQ_INSERT_BEFORE(oldrule, newrule, entries);
3671 ruleset->rules[rs_num].active.ptr,
3672 oldrule, newrule, entries);
3673 ruleset->rules[rs_num].active.rcount++;
3677 TAILQ_FOREACH(oldrule,
3678 ruleset->rules[rs_num].active.ptr, entries)
3681 ruleset->rules[rs_num].active.ticket++;
3683 pf_calc_skip_steps(ruleset->rules[rs_num].active.ptr);
3684 pf_remove_if_empty_kruleset(ruleset);
3691 DIOCCHANGERULE_error:
3694 pf_krule_free(newrule);
3699 case DIOCCLRSTATES: {
3700 struct pfioc_state_kill *psk = (struct pfioc_state_kill *)addr;
3701 struct pf_kstate_kill kill;
3703 error = pf_state_kill_to_kstate_kill(psk, &kill);
3707 psk->psk_killed = pf_clear_states(&kill);
3711 case DIOCCLRSTATESNV: {
3712 error = pf_clearstates_nv((struct pfioc_nv *)addr);
3716 case DIOCKILLSTATES: {
3717 struct pfioc_state_kill *psk = (struct pfioc_state_kill *)addr;
3718 struct pf_kstate_kill kill;
3720 error = pf_state_kill_to_kstate_kill(psk, &kill);
3724 psk->psk_killed = 0;
3725 pf_killstates(&kill, &psk->psk_killed);
3729 case DIOCKILLSTATESNV: {
3730 error = pf_killstates_nv((struct pfioc_nv *)addr);
3734 case DIOCADDSTATE: {
3735 struct pfioc_state *ps = (struct pfioc_state *)addr;
3736 struct pfsync_state_1301 *sp = &ps->state;
3738 if (sp->timeout >= PFTM_MAX) {
3742 if (V_pfsync_state_import_ptr != NULL) {
3744 error = V_pfsync_state_import_ptr(
3745 (union pfsync_state_union *)sp, PFSYNC_SI_IOCTL,
3746 PFSYNC_MSG_VERSION_1301);
3753 case DIOCGETSTATE: {
3754 struct pfioc_state *ps = (struct pfioc_state *)addr;
3755 struct pf_kstate *s;
3757 s = pf_find_state_byid(ps->state.id, ps->state.creatorid);
3763 pfsync_state_export((union pfsync_state_union*)&ps->state,
3764 s, PFSYNC_MSG_VERSION_1301);
3769 case DIOCGETSTATENV: {
3770 error = pf_getstate((struct pfioc_nv *)addr);
3774 case DIOCGETSTATES: {
3775 struct pfioc_states *ps = (struct pfioc_states *)addr;
3776 struct pf_kstate *s;
3777 struct pfsync_state_1301 *pstore, *p;
3779 size_t slice_count = 16, count;
3782 if (ps->ps_len <= 0) {
3783 nr = uma_zone_get_cur(V_pf_state_z);
3784 ps->ps_len = sizeof(struct pfsync_state_1301) * nr;
3788 out = ps->ps_states;
3789 pstore = mallocarray(slice_count,
3790 sizeof(struct pfsync_state_1301), M_TEMP, M_WAITOK | M_ZERO);
3793 for (i = 0; i <= pf_hashmask; i++) {
3794 struct pf_idhash *ih = &V_pf_idhash[i];
3796 DIOCGETSTATES_retry:
3799 if (LIST_EMPTY(&ih->states))
3802 PF_HASHROW_LOCK(ih);
3804 LIST_FOREACH(s, &ih->states, entry) {
3805 if (s->timeout == PFTM_UNLINKED)
3810 if (count > slice_count) {
3811 PF_HASHROW_UNLOCK(ih);
3812 free(pstore, M_TEMP);
3813 slice_count = count * 2;
3814 pstore = mallocarray(slice_count,
3815 sizeof(struct pfsync_state_1301), M_TEMP,
3817 goto DIOCGETSTATES_retry;
3820 if ((nr+count) * sizeof(*p) > ps->ps_len) {
3821 PF_HASHROW_UNLOCK(ih);
3822 goto DIOCGETSTATES_full;
3825 LIST_FOREACH(s, &ih->states, entry) {
3826 if (s->timeout == PFTM_UNLINKED)
3829 pfsync_state_export((union pfsync_state_union*)p,
3830 s, PFSYNC_MSG_VERSION_1301);
3834 PF_HASHROW_UNLOCK(ih);
3835 error = copyout(pstore, out,
3836 sizeof(struct pfsync_state_1301) * count);
3839 out = ps->ps_states + nr;
3842 ps->ps_len = sizeof(struct pfsync_state_1301) * nr;
3843 free(pstore, M_TEMP);
3848 case DIOCGETSTATESV2: {
3849 struct pfioc_states_v2 *ps = (struct pfioc_states_v2 *)addr;
3850 struct pf_kstate *s;
3851 struct pf_state_export *pstore, *p;
3853 size_t slice_count = 16, count;
3856 if (ps->ps_req_version > PF_STATE_VERSION) {
3861 if (ps->ps_len <= 0) {
3862 nr = uma_zone_get_cur(V_pf_state_z);
3863 ps->ps_len = sizeof(struct pf_state_export) * nr;
3867 out = ps->ps_states;
3868 pstore = mallocarray(slice_count,
3869 sizeof(struct pf_state_export), M_TEMP, M_WAITOK | M_ZERO);
3872 for (i = 0; i <= pf_hashmask; i++) {
3873 struct pf_idhash *ih = &V_pf_idhash[i];
3875 DIOCGETSTATESV2_retry:
3878 if (LIST_EMPTY(&ih->states))
3881 PF_HASHROW_LOCK(ih);
3883 LIST_FOREACH(s, &ih->states, entry) {
3884 if (s->timeout == PFTM_UNLINKED)
3889 if (count > slice_count) {
3890 PF_HASHROW_UNLOCK(ih);
3891 free(pstore, M_TEMP);
3892 slice_count = count * 2;
3893 pstore = mallocarray(slice_count,
3894 sizeof(struct pf_state_export), M_TEMP,
3896 goto DIOCGETSTATESV2_retry;
3899 if ((nr+count) * sizeof(*p) > ps->ps_len) {
3900 PF_HASHROW_UNLOCK(ih);
3901 goto DIOCGETSTATESV2_full;
3904 LIST_FOREACH(s, &ih->states, entry) {
3905 if (s->timeout == PFTM_UNLINKED)
3908 pf_state_export(p, s);
3912 PF_HASHROW_UNLOCK(ih);
3913 error = copyout(pstore, out,
3914 sizeof(struct pf_state_export) * count);
3917 out = ps->ps_states + nr;
3919 DIOCGETSTATESV2_full:
3920 ps->ps_len = nr * sizeof(struct pf_state_export);
3921 free(pstore, M_TEMP);
3926 case DIOCGETSTATUS: {
3927 struct pf_status *s = (struct pf_status *)addr;
3930 s->running = V_pf_status.running;
3931 s->since = V_pf_status.since;
3932 s->debug = V_pf_status.debug;
3933 s->hostid = V_pf_status.hostid;
3934 s->states = V_pf_status.states;
3935 s->src_nodes = V_pf_status.src_nodes;
3937 for (int i = 0; i < PFRES_MAX; i++)
3939 counter_u64_fetch(V_pf_status.counters[i]);
3940 for (int i = 0; i < LCNT_MAX; i++)
3942 counter_u64_fetch(V_pf_status.lcounters[i]);
3943 for (int i = 0; i < FCNT_MAX; i++)
3945 pf_counter_u64_fetch(&V_pf_status.fcounters[i]);
3946 for (int i = 0; i < SCNT_MAX; i++)
3948 counter_u64_fetch(V_pf_status.scounters[i]);
3950 bcopy(V_pf_status.ifname, s->ifname, IFNAMSIZ);
3951 bcopy(V_pf_status.pf_chksum, s->pf_chksum,
3952 PF_MD5_DIGEST_LENGTH);
3954 pfi_update_status(s->ifname, s);
3959 case DIOCGETSTATUSNV: {
3960 error = pf_getstatus((struct pfioc_nv *)addr);
3964 case DIOCSETSTATUSIF: {
3965 struct pfioc_if *pi = (struct pfioc_if *)addr;
3967 if (pi->ifname[0] == 0) {
3968 bzero(V_pf_status.ifname, IFNAMSIZ);
3972 error = pf_user_strcpy(V_pf_status.ifname, pi->ifname, IFNAMSIZ);
3977 case DIOCCLRSTATUS: {
3979 for (int i = 0; i < PFRES_MAX; i++)
3980 counter_u64_zero(V_pf_status.counters[i]);
3981 for (int i = 0; i < FCNT_MAX; i++)
3982 pf_counter_u64_zero(&V_pf_status.fcounters[i]);
3983 for (int i = 0; i < SCNT_MAX; i++)
3984 counter_u64_zero(V_pf_status.scounters[i]);
3985 for (int i = 0; i < KLCNT_MAX; i++)
3986 counter_u64_zero(V_pf_status.lcounters[i]);
3987 V_pf_status.since = time_second;
3988 if (*V_pf_status.ifname)
3989 pfi_update_status(V_pf_status.ifname, NULL);
3995 struct pfioc_natlook *pnl = (struct pfioc_natlook *)addr;
3996 struct pf_state_key *sk;
3997 struct pf_kstate *state;
3998 struct pf_state_key_cmp key;
3999 int m = 0, direction = pnl->direction;
4002 /* NATLOOK src and dst are reversed, so reverse sidx/didx */
4003 sidx = (direction == PF_IN) ? 1 : 0;
4004 didx = (direction == PF_IN) ? 0 : 1;
4007 PF_AZERO(&pnl->saddr, pnl->af) ||
4008 PF_AZERO(&pnl->daddr, pnl->af) ||
4009 ((pnl->proto == IPPROTO_TCP ||
4010 pnl->proto == IPPROTO_UDP) &&
4011 (!pnl->dport || !pnl->sport)))
4014 bzero(&key, sizeof(key));
4016 key.proto = pnl->proto;
4017 PF_ACPY(&key.addr[sidx], &pnl->saddr, pnl->af);
4018 key.port[sidx] = pnl->sport;
4019 PF_ACPY(&key.addr[didx], &pnl->daddr, pnl->af);
4020 key.port[didx] = pnl->dport;
4022 state = pf_find_state_all(&key, direction, &m);
4023 if (state == NULL) {
4027 PF_STATE_UNLOCK(state);
4028 error = E2BIG; /* more than one state */
4030 sk = state->key[sidx];
4031 PF_ACPY(&pnl->rsaddr, &sk->addr[sidx], sk->af);
4032 pnl->rsport = sk->port[sidx];
4033 PF_ACPY(&pnl->rdaddr, &sk->addr[didx], sk->af);
4034 pnl->rdport = sk->port[didx];
4035 PF_STATE_UNLOCK(state);
4042 case DIOCSETTIMEOUT: {
4043 struct pfioc_tm *pt = (struct pfioc_tm *)addr;
4046 if (pt->timeout < 0 || pt->timeout >= PFTM_MAX ||
4052 old = V_pf_default_rule.timeout[pt->timeout];
4053 if (pt->timeout == PFTM_INTERVAL && pt->seconds == 0)
4055 V_pf_default_rule.timeout[pt->timeout] = pt->seconds;
4056 if (pt->timeout == PFTM_INTERVAL && pt->seconds < old)
4057 wakeup(pf_purge_thread);
4063 case DIOCGETTIMEOUT: {
4064 struct pfioc_tm *pt = (struct pfioc_tm *)addr;
4066 if (pt->timeout < 0 || pt->timeout >= PFTM_MAX) {
4071 pt->seconds = V_pf_default_rule.timeout[pt->timeout];
4076 case DIOCGETLIMIT: {
4077 struct pfioc_limit *pl = (struct pfioc_limit *)addr;
4079 if (pl->index < 0 || pl->index >= PF_LIMIT_MAX) {
4084 pl->limit = V_pf_limits[pl->index].limit;
4089 case DIOCSETLIMIT: {
4090 struct pfioc_limit *pl = (struct pfioc_limit *)addr;
4094 if (pl->index < 0 || pl->index >= PF_LIMIT_MAX ||
4095 V_pf_limits[pl->index].zone == NULL) {
4100 uma_zone_set_max(V_pf_limits[pl->index].zone, pl->limit);
4101 old_limit = V_pf_limits[pl->index].limit;
4102 V_pf_limits[pl->index].limit = pl->limit;
4103 pl->limit = old_limit;
4108 case DIOCSETDEBUG: {
4109 u_int32_t *level = (u_int32_t *)addr;
4112 V_pf_status.debug = *level;
4117 case DIOCCLRRULECTRS: {
4118 /* obsoleted by DIOCGETRULE with action=PF_GET_CLR_CNTR */
4119 struct pf_kruleset *ruleset = &pf_main_ruleset;
4120 struct pf_krule *rule;
4124 ruleset->rules[PF_RULESET_FILTER].active.ptr, entries) {
4125 pf_counter_u64_zero(&rule->evaluations);
4126 for (int i = 0; i < 2; i++) {
4127 pf_counter_u64_zero(&rule->packets[i]);
4128 pf_counter_u64_zero(&rule->bytes[i]);
4135 case DIOCGIFSPEEDV0:
4136 case DIOCGIFSPEEDV1: {
4137 struct pf_ifspeed_v1 *psp = (struct pf_ifspeed_v1 *)addr;
4138 struct pf_ifspeed_v1 ps;
4141 if (psp->ifname[0] == '\0') {
4146 error = pf_user_strcpy(ps.ifname, psp->ifname, IFNAMSIZ);
4149 ifp = ifunit(ps.ifname);
4152 (u_int32_t)uqmin(ifp->if_baudrate, UINT_MAX);
4153 if (cmd == DIOCGIFSPEEDV1)
4154 psp->baudrate = ifp->if_baudrate;
4162 case DIOCSTARTALTQ: {
4163 struct pf_altq *altq;
4166 /* enable all altq interfaces on active list */
4167 TAILQ_FOREACH(altq, V_pf_altq_ifs_active, entries) {
4168 if ((altq->local_flags & PFALTQ_FLAG_IF_REMOVED) == 0) {
4169 error = pf_enable_altq(altq);
4175 V_pf_altq_running = 1;
4177 DPFPRINTF(PF_DEBUG_MISC, ("altq: started\n"));
4181 case DIOCSTOPALTQ: {
4182 struct pf_altq *altq;
4185 /* disable all altq interfaces on active list */
4186 TAILQ_FOREACH(altq, V_pf_altq_ifs_active, entries) {
4187 if ((altq->local_flags & PFALTQ_FLAG_IF_REMOVED) == 0) {
4188 error = pf_disable_altq(altq);
4194 V_pf_altq_running = 0;
4196 DPFPRINTF(PF_DEBUG_MISC, ("altq: stopped\n"));
4201 case DIOCADDALTQV1: {
4202 struct pfioc_altq_v1 *pa = (struct pfioc_altq_v1 *)addr;
4203 struct pf_altq *altq, *a;
4206 altq = malloc(sizeof(*altq), M_PFALTQ, M_WAITOK | M_ZERO);
4207 error = pf_import_kaltq(pa, altq, IOCPARM_LEN(cmd));
4210 altq->local_flags = 0;
4213 if (pa->ticket != V_ticket_altqs_inactive) {
4215 free(altq, M_PFALTQ);
4221 * if this is for a queue, find the discipline and
4222 * copy the necessary fields
4224 if (altq->qname[0] != 0) {
4225 if ((altq->qid = pf_qname2qid(altq->qname)) == 0) {
4228 free(altq, M_PFALTQ);
4231 altq->altq_disc = NULL;
4232 TAILQ_FOREACH(a, V_pf_altq_ifs_inactive, entries) {
4233 if (strncmp(a->ifname, altq->ifname,
4235 altq->altq_disc = a->altq_disc;
4241 if ((ifp = ifunit(altq->ifname)) == NULL)
4242 altq->local_flags |= PFALTQ_FLAG_IF_REMOVED;
4244 error = altq_add(ifp, altq);
4248 free(altq, M_PFALTQ);
4252 if (altq->qname[0] != 0)
4253 TAILQ_INSERT_TAIL(V_pf_altqs_inactive, altq, entries);
4255 TAILQ_INSERT_TAIL(V_pf_altq_ifs_inactive, altq, entries);
4256 /* version error check done on import above */
4257 pf_export_kaltq(altq, pa, IOCPARM_LEN(cmd));
4262 case DIOCGETALTQSV0:
4263 case DIOCGETALTQSV1: {
4264 struct pfioc_altq_v1 *pa = (struct pfioc_altq_v1 *)addr;
4265 struct pf_altq *altq;
4269 TAILQ_FOREACH(altq, V_pf_altq_ifs_active, entries)
4271 TAILQ_FOREACH(altq, V_pf_altqs_active, entries)
4273 pa->ticket = V_ticket_altqs_active;
4279 case DIOCGETALTQV1: {
4280 struct pfioc_altq_v1 *pa = (struct pfioc_altq_v1 *)addr;
4281 struct pf_altq *altq;
4284 if (pa->ticket != V_ticket_altqs_active) {
4289 altq = pf_altq_get_nth_active(pa->nr);
4295 pf_export_kaltq(altq, pa, IOCPARM_LEN(cmd));
4300 case DIOCCHANGEALTQV0:
4301 case DIOCCHANGEALTQV1:
4302 /* CHANGEALTQ not supported yet! */
4306 case DIOCGETQSTATSV0:
4307 case DIOCGETQSTATSV1: {
4308 struct pfioc_qstats_v1 *pq = (struct pfioc_qstats_v1 *)addr;
4309 struct pf_altq *altq;
4314 if (pq->ticket != V_ticket_altqs_active) {
4319 nbytes = pq->nbytes;
4320 altq = pf_altq_get_nth_active(pq->nr);
4327 if ((altq->local_flags & PFALTQ_FLAG_IF_REMOVED) != 0) {
4333 if (cmd == DIOCGETQSTATSV0)
4334 version = 0; /* DIOCGETQSTATSV0 means stats struct v0 */
4336 version = pq->version;
4337 error = altq_getqstats(altq, pq->buf, &nbytes, version);
4339 pq->scheduler = altq->scheduler;
4340 pq->nbytes = nbytes;
4346 case DIOCBEGINADDRS: {
4347 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr;
4350 pf_empty_kpool(&V_pf_pabuf);
4351 pp->ticket = ++V_ticket_pabuf;
4357 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr;
4358 struct pf_kpooladdr *pa;
4359 struct pfi_kkif *kif = NULL;
4362 if (pp->af == AF_INET) {
4363 error = EAFNOSUPPORT;
4368 if (pp->af == AF_INET6) {
4369 error = EAFNOSUPPORT;
4373 if (pp->addr.addr.type != PF_ADDR_ADDRMASK &&
4374 pp->addr.addr.type != PF_ADDR_DYNIFTL &&
4375 pp->addr.addr.type != PF_ADDR_TABLE) {
4379 if (pp->addr.addr.p.dyn != NULL) {
4383 pa = malloc(sizeof(*pa), M_PFRULE, M_WAITOK);
4384 error = pf_pooladdr_to_kpooladdr(&pp->addr, pa);
4388 kif = pf_kkif_create(M_WAITOK);
4390 if (pp->ticket != V_ticket_pabuf) {
4398 if (pa->ifname[0]) {
4399 pa->kif = pfi_kkif_attach(kif, pa->ifname);
4401 pfi_kkif_ref(pa->kif);
4404 if (pa->addr.type == PF_ADDR_DYNIFTL && ((error =
4405 pfi_dynaddr_setup(&pa->addr, pp->af)) != 0)) {
4407 pfi_kkif_unref(pa->kif);
4412 TAILQ_INSERT_TAIL(&V_pf_pabuf, pa, entries);
4417 case DIOCGETADDRS: {
4418 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr;
4419 struct pf_kpool *pool;
4420 struct pf_kpooladdr *pa;
4422 pp->anchor[sizeof(pp->anchor) - 1] = 0;
4426 pool = pf_get_kpool(pp->anchor, pp->ticket, pp->r_action,
4427 pp->r_num, 0, 1, 0);
4433 TAILQ_FOREACH(pa, &pool->list, entries)
4440 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr;
4441 struct pf_kpool *pool;
4442 struct pf_kpooladdr *pa;
4445 pp->anchor[sizeof(pp->anchor) - 1] = 0;
4448 pool = pf_get_kpool(pp->anchor, pp->ticket, pp->r_action,
4449 pp->r_num, 0, 1, 1);
4455 pa = TAILQ_FIRST(&pool->list);
4456 while ((pa != NULL) && (nr < pp->nr)) {
4457 pa = TAILQ_NEXT(pa, entries);
4465 pf_kpooladdr_to_pooladdr(pa, &pp->addr);
4466 pf_addr_copyout(&pp->addr.addr);
4471 case DIOCCHANGEADDR: {
4472 struct pfioc_pooladdr *pca = (struct pfioc_pooladdr *)addr;
4473 struct pf_kpool *pool;
4474 struct pf_kpooladdr *oldpa = NULL, *newpa = NULL;
4475 struct pf_kruleset *ruleset;
4476 struct pfi_kkif *kif = NULL;
4478 pca->anchor[sizeof(pca->anchor) - 1] = 0;
4480 if (pca->action < PF_CHANGE_ADD_HEAD ||
4481 pca->action > PF_CHANGE_REMOVE) {
4485 if (pca->addr.addr.type != PF_ADDR_ADDRMASK &&
4486 pca->addr.addr.type != PF_ADDR_DYNIFTL &&
4487 pca->addr.addr.type != PF_ADDR_TABLE) {
4491 if (pca->addr.addr.p.dyn != NULL) {
4496 if (pca->action != PF_CHANGE_REMOVE) {
4498 if (pca->af == AF_INET) {
4499 error = EAFNOSUPPORT;
4504 if (pca->af == AF_INET6) {
4505 error = EAFNOSUPPORT;
4509 newpa = malloc(sizeof(*newpa), M_PFRULE, M_WAITOK);
4510 bcopy(&pca->addr, newpa, sizeof(struct pf_pooladdr));
4511 if (newpa->ifname[0])
4512 kif = pf_kkif_create(M_WAITOK);
4515 #define ERROUT(x) ERROUT_IOCTL(DIOCCHANGEADDR_error, x)
4517 ruleset = pf_find_kruleset(pca->anchor);
4518 if (ruleset == NULL)
4521 pool = pf_get_kpool(pca->anchor, pca->ticket, pca->r_action,
4522 pca->r_num, pca->r_last, 1, 1);
4526 if (pca->action != PF_CHANGE_REMOVE) {
4527 if (newpa->ifname[0]) {
4528 newpa->kif = pfi_kkif_attach(kif, newpa->ifname);
4529 pfi_kkif_ref(newpa->kif);
4533 switch (newpa->addr.type) {
4534 case PF_ADDR_DYNIFTL:
4535 error = pfi_dynaddr_setup(&newpa->addr,
4539 newpa->addr.p.tbl = pfr_attach_table(ruleset,
4540 newpa->addr.v.tblname);
4541 if (newpa->addr.p.tbl == NULL)
4546 goto DIOCCHANGEADDR_error;
4549 switch (pca->action) {
4550 case PF_CHANGE_ADD_HEAD:
4551 oldpa = TAILQ_FIRST(&pool->list);
4553 case PF_CHANGE_ADD_TAIL:
4554 oldpa = TAILQ_LAST(&pool->list, pf_kpalist);
4557 oldpa = TAILQ_FIRST(&pool->list);
4558 for (int i = 0; oldpa && i < pca->nr; i++)
4559 oldpa = TAILQ_NEXT(oldpa, entries);
4565 if (pca->action == PF_CHANGE_REMOVE) {
4566 TAILQ_REMOVE(&pool->list, oldpa, entries);
4567 switch (oldpa->addr.type) {
4568 case PF_ADDR_DYNIFTL:
4569 pfi_dynaddr_remove(oldpa->addr.p.dyn);
4572 pfr_detach_table(oldpa->addr.p.tbl);
4576 pfi_kkif_unref(oldpa->kif);
4577 free(oldpa, M_PFRULE);
4580 TAILQ_INSERT_TAIL(&pool->list, newpa, entries);
4581 else if (pca->action == PF_CHANGE_ADD_HEAD ||
4582 pca->action == PF_CHANGE_ADD_BEFORE)
4583 TAILQ_INSERT_BEFORE(oldpa, newpa, entries);
4585 TAILQ_INSERT_AFTER(&pool->list, oldpa,
4589 pool->cur = TAILQ_FIRST(&pool->list);
4590 PF_ACPY(&pool->counter, &pool->cur->addr.v.a.addr, pca->af);
4595 DIOCCHANGEADDR_error:
4596 if (newpa != NULL) {
4598 pfi_kkif_unref(newpa->kif);
4599 free(newpa, M_PFRULE);
4606 case DIOCGETRULESETS: {
4607 struct pfioc_ruleset *pr = (struct pfioc_ruleset *)addr;
4608 struct pf_kruleset *ruleset;
4609 struct pf_kanchor *anchor;
4611 pr->path[sizeof(pr->path) - 1] = 0;
4614 if ((ruleset = pf_find_kruleset(pr->path)) == NULL) {
4620 if (ruleset->anchor == NULL) {
4621 /* XXX kludge for pf_main_ruleset */
4622 RB_FOREACH(anchor, pf_kanchor_global, &V_pf_anchors)
4623 if (anchor->parent == NULL)
4626 RB_FOREACH(anchor, pf_kanchor_node,
4627 &ruleset->anchor->children)
4634 case DIOCGETRULESET: {
4635 struct pfioc_ruleset *pr = (struct pfioc_ruleset *)addr;
4636 struct pf_kruleset *ruleset;
4637 struct pf_kanchor *anchor;
4640 pr->path[sizeof(pr->path) - 1] = 0;
4643 if ((ruleset = pf_find_kruleset(pr->path)) == NULL) {
4649 if (ruleset->anchor == NULL) {
4650 /* XXX kludge for pf_main_ruleset */
4651 RB_FOREACH(anchor, pf_kanchor_global, &V_pf_anchors)
4652 if (anchor->parent == NULL && nr++ == pr->nr) {
4653 strlcpy(pr->name, anchor->name,
4658 RB_FOREACH(anchor, pf_kanchor_node,
4659 &ruleset->anchor->children)
4660 if (nr++ == pr->nr) {
4661 strlcpy(pr->name, anchor->name,
4672 case DIOCRCLRTABLES: {
4673 struct pfioc_table *io = (struct pfioc_table *)addr;
4675 if (io->pfrio_esize != 0) {
4680 error = pfr_clr_tables(&io->pfrio_table, &io->pfrio_ndel,
4681 io->pfrio_flags | PFR_FLAG_USERIOCTL);
4686 case DIOCRADDTABLES: {
4687 struct pfioc_table *io = (struct pfioc_table *)addr;
4688 struct pfr_table *pfrts;
4691 if (io->pfrio_esize != sizeof(struct pfr_table)) {
4696 if (io->pfrio_size < 0 || io->pfrio_size > pf_ioctl_maxcount ||
4697 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_table))) {
4702 totlen = io->pfrio_size * sizeof(struct pfr_table);
4703 pfrts = mallocarray(io->pfrio_size, sizeof(struct pfr_table),
4705 error = copyin(io->pfrio_buffer, pfrts, totlen);
4707 free(pfrts, M_TEMP);
4711 error = pfr_add_tables(pfrts, io->pfrio_size,
4712 &io->pfrio_nadd, io->pfrio_flags | PFR_FLAG_USERIOCTL);
4714 free(pfrts, M_TEMP);
4718 case DIOCRDELTABLES: {
4719 struct pfioc_table *io = (struct pfioc_table *)addr;
4720 struct pfr_table *pfrts;
4723 if (io->pfrio_esize != sizeof(struct pfr_table)) {
4728 if (io->pfrio_size < 0 || io->pfrio_size > pf_ioctl_maxcount ||
4729 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_table))) {
4734 totlen = io->pfrio_size * sizeof(struct pfr_table);
4735 pfrts = mallocarray(io->pfrio_size, sizeof(struct pfr_table),
4737 error = copyin(io->pfrio_buffer, pfrts, totlen);
4739 free(pfrts, M_TEMP);
4743 error = pfr_del_tables(pfrts, io->pfrio_size,
4744 &io->pfrio_ndel, io->pfrio_flags | PFR_FLAG_USERIOCTL);
4746 free(pfrts, M_TEMP);
4750 case DIOCRGETTABLES: {
4751 struct pfioc_table *io = (struct pfioc_table *)addr;
4752 struct pfr_table *pfrts;
4756 if (io->pfrio_esize != sizeof(struct pfr_table)) {
4761 n = pfr_table_count(&io->pfrio_table, io->pfrio_flags);
4767 io->pfrio_size = min(io->pfrio_size, n);
4769 totlen = io->pfrio_size * sizeof(struct pfr_table);
4771 pfrts = mallocarray(io->pfrio_size, sizeof(struct pfr_table),
4772 M_TEMP, M_NOWAIT | M_ZERO);
4773 if (pfrts == NULL) {
4778 error = pfr_get_tables(&io->pfrio_table, pfrts,
4779 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL);
4782 error = copyout(pfrts, io->pfrio_buffer, totlen);
4783 free(pfrts, M_TEMP);
4787 case DIOCRGETTSTATS: {
4788 struct pfioc_table *io = (struct pfioc_table *)addr;
4789 struct pfr_tstats *pfrtstats;
4793 if (io->pfrio_esize != sizeof(struct pfr_tstats)) {
4797 PF_TABLE_STATS_LOCK();
4799 n = pfr_table_count(&io->pfrio_table, io->pfrio_flags);
4802 PF_TABLE_STATS_UNLOCK();
4806 io->pfrio_size = min(io->pfrio_size, n);
4808 totlen = io->pfrio_size * sizeof(struct pfr_tstats);
4809 pfrtstats = mallocarray(io->pfrio_size,
4810 sizeof(struct pfr_tstats), M_TEMP, M_NOWAIT | M_ZERO);
4811 if (pfrtstats == NULL) {
4814 PF_TABLE_STATS_UNLOCK();
4817 error = pfr_get_tstats(&io->pfrio_table, pfrtstats,
4818 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL);
4820 PF_TABLE_STATS_UNLOCK();
4822 error = copyout(pfrtstats, io->pfrio_buffer, totlen);
4823 free(pfrtstats, M_TEMP);
4827 case DIOCRCLRTSTATS: {
4828 struct pfioc_table *io = (struct pfioc_table *)addr;
4829 struct pfr_table *pfrts;
4832 if (io->pfrio_esize != sizeof(struct pfr_table)) {
4837 if (io->pfrio_size < 0 || io->pfrio_size > pf_ioctl_maxcount ||
4838 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_table))) {
4839 /* We used to count tables and use the minimum required
4840 * size, so we didn't fail on overly large requests.
4842 io->pfrio_size = pf_ioctl_maxcount;
4846 totlen = io->pfrio_size * sizeof(struct pfr_table);
4847 pfrts = mallocarray(io->pfrio_size, sizeof(struct pfr_table),
4849 error = copyin(io->pfrio_buffer, pfrts, totlen);
4851 free(pfrts, M_TEMP);
4855 PF_TABLE_STATS_LOCK();
4857 error = pfr_clr_tstats(pfrts, io->pfrio_size,
4858 &io->pfrio_nzero, io->pfrio_flags | PFR_FLAG_USERIOCTL);
4860 PF_TABLE_STATS_UNLOCK();
4861 free(pfrts, M_TEMP);
4865 case DIOCRSETTFLAGS: {
4866 struct pfioc_table *io = (struct pfioc_table *)addr;
4867 struct pfr_table *pfrts;
4871 if (io->pfrio_esize != sizeof(struct pfr_table)) {
4877 n = pfr_table_count(&io->pfrio_table, io->pfrio_flags);
4884 io->pfrio_size = min(io->pfrio_size, n);
4887 totlen = io->pfrio_size * sizeof(struct pfr_table);
4888 pfrts = mallocarray(io->pfrio_size, sizeof(struct pfr_table),
4890 error = copyin(io->pfrio_buffer, pfrts, totlen);
4892 free(pfrts, M_TEMP);
4896 error = pfr_set_tflags(pfrts, io->pfrio_size,
4897 io->pfrio_setflag, io->pfrio_clrflag, &io->pfrio_nchange,
4898 &io->pfrio_ndel, io->pfrio_flags | PFR_FLAG_USERIOCTL);
4900 free(pfrts, M_TEMP);
4904 case DIOCRCLRADDRS: {
4905 struct pfioc_table *io = (struct pfioc_table *)addr;
4907 if (io->pfrio_esize != 0) {
4912 error = pfr_clr_addrs(&io->pfrio_table, &io->pfrio_ndel,
4913 io->pfrio_flags | PFR_FLAG_USERIOCTL);
4918 case DIOCRADDADDRS: {
4919 struct pfioc_table *io = (struct pfioc_table *)addr;
4920 struct pfr_addr *pfras;
4923 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
4927 if (io->pfrio_size < 0 ||
4928 io->pfrio_size > pf_ioctl_maxcount ||
4929 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_addr))) {
4933 totlen = io->pfrio_size * sizeof(struct pfr_addr);
4934 pfras = mallocarray(io->pfrio_size, sizeof(struct pfr_addr),
4936 error = copyin(io->pfrio_buffer, pfras, totlen);
4938 free(pfras, M_TEMP);
4942 error = pfr_add_addrs(&io->pfrio_table, pfras,
4943 io->pfrio_size, &io->pfrio_nadd, io->pfrio_flags |
4944 PFR_FLAG_USERIOCTL);
4946 if (error == 0 && io->pfrio_flags & PFR_FLAG_FEEDBACK)
4947 error = copyout(pfras, io->pfrio_buffer, totlen);
4948 free(pfras, M_TEMP);
4952 case DIOCRDELADDRS: {
4953 struct pfioc_table *io = (struct pfioc_table *)addr;
4954 struct pfr_addr *pfras;
4957 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
4961 if (io->pfrio_size < 0 ||
4962 io->pfrio_size > pf_ioctl_maxcount ||
4963 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_addr))) {
4967 totlen = io->pfrio_size * sizeof(struct pfr_addr);
4968 pfras = mallocarray(io->pfrio_size, sizeof(struct pfr_addr),
4970 error = copyin(io->pfrio_buffer, pfras, totlen);
4972 free(pfras, M_TEMP);
4976 error = pfr_del_addrs(&io->pfrio_table, pfras,
4977 io->pfrio_size, &io->pfrio_ndel, io->pfrio_flags |
4978 PFR_FLAG_USERIOCTL);
4980 if (error == 0 && io->pfrio_flags & PFR_FLAG_FEEDBACK)
4981 error = copyout(pfras, io->pfrio_buffer, totlen);
4982 free(pfras, M_TEMP);
4986 case DIOCRSETADDRS: {
4987 struct pfioc_table *io = (struct pfioc_table *)addr;
4988 struct pfr_addr *pfras;
4989 size_t totlen, count;
4991 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
4995 if (io->pfrio_size < 0 || io->pfrio_size2 < 0) {
4999 count = max(io->pfrio_size, io->pfrio_size2);
5000 if (count > pf_ioctl_maxcount ||
5001 WOULD_OVERFLOW(count, sizeof(struct pfr_addr))) {
5005 totlen = count * sizeof(struct pfr_addr);
5006 pfras = mallocarray(count, sizeof(struct pfr_addr), M_TEMP,
5008 error = copyin(io->pfrio_buffer, pfras, totlen);
5010 free(pfras, M_TEMP);
5014 error = pfr_set_addrs(&io->pfrio_table, pfras,
5015 io->pfrio_size, &io->pfrio_size2, &io->pfrio_nadd,
5016 &io->pfrio_ndel, &io->pfrio_nchange, io->pfrio_flags |
5017 PFR_FLAG_USERIOCTL, 0);
5019 if (error == 0 && io->pfrio_flags & PFR_FLAG_FEEDBACK)
5020 error = copyout(pfras, io->pfrio_buffer, totlen);
5021 free(pfras, M_TEMP);
5025 case DIOCRGETADDRS: {
5026 struct pfioc_table *io = (struct pfioc_table *)addr;
5027 struct pfr_addr *pfras;
5030 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
5034 if (io->pfrio_size < 0 ||
5035 io->pfrio_size > pf_ioctl_maxcount ||
5036 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_addr))) {
5040 totlen = io->pfrio_size * sizeof(struct pfr_addr);
5041 pfras = mallocarray(io->pfrio_size, sizeof(struct pfr_addr),
5042 M_TEMP, M_WAITOK | M_ZERO);
5044 error = pfr_get_addrs(&io->pfrio_table, pfras,
5045 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL);
5048 error = copyout(pfras, io->pfrio_buffer, totlen);
5049 free(pfras, M_TEMP);
5053 case DIOCRGETASTATS: {
5054 struct pfioc_table *io = (struct pfioc_table *)addr;
5055 struct pfr_astats *pfrastats;
5058 if (io->pfrio_esize != sizeof(struct pfr_astats)) {
5062 if (io->pfrio_size < 0 ||
5063 io->pfrio_size > pf_ioctl_maxcount ||
5064 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_astats))) {
5068 totlen = io->pfrio_size * sizeof(struct pfr_astats);
5069 pfrastats = mallocarray(io->pfrio_size,
5070 sizeof(struct pfr_astats), M_TEMP, M_WAITOK | M_ZERO);
5072 error = pfr_get_astats(&io->pfrio_table, pfrastats,
5073 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL);
5076 error = copyout(pfrastats, io->pfrio_buffer, totlen);
5077 free(pfrastats, M_TEMP);
5081 case DIOCRCLRASTATS: {
5082 struct pfioc_table *io = (struct pfioc_table *)addr;
5083 struct pfr_addr *pfras;
5086 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
5090 if (io->pfrio_size < 0 ||
5091 io->pfrio_size > pf_ioctl_maxcount ||
5092 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_addr))) {
5096 totlen = io->pfrio_size * sizeof(struct pfr_addr);
5097 pfras = mallocarray(io->pfrio_size, sizeof(struct pfr_addr),
5099 error = copyin(io->pfrio_buffer, pfras, totlen);
5101 free(pfras, M_TEMP);
5105 error = pfr_clr_astats(&io->pfrio_table, pfras,
5106 io->pfrio_size, &io->pfrio_nzero, io->pfrio_flags |
5107 PFR_FLAG_USERIOCTL);
5109 if (error == 0 && io->pfrio_flags & PFR_FLAG_FEEDBACK)
5110 error = copyout(pfras, io->pfrio_buffer, totlen);
5111 free(pfras, M_TEMP);
5115 case DIOCRTSTADDRS: {
5116 struct pfioc_table *io = (struct pfioc_table *)addr;
5117 struct pfr_addr *pfras;
5120 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
5124 if (io->pfrio_size < 0 ||
5125 io->pfrio_size > pf_ioctl_maxcount ||
5126 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_addr))) {
5130 totlen = io->pfrio_size * sizeof(struct pfr_addr);
5131 pfras = mallocarray(io->pfrio_size, sizeof(struct pfr_addr),
5133 error = copyin(io->pfrio_buffer, pfras, totlen);
5135 free(pfras, M_TEMP);
5139 error = pfr_tst_addrs(&io->pfrio_table, pfras,
5140 io->pfrio_size, &io->pfrio_nmatch, io->pfrio_flags |
5141 PFR_FLAG_USERIOCTL);
5144 error = copyout(pfras, io->pfrio_buffer, totlen);
5145 free(pfras, M_TEMP);
5149 case DIOCRINADEFINE: {
5150 struct pfioc_table *io = (struct pfioc_table *)addr;
5151 struct pfr_addr *pfras;
5154 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
5158 if (io->pfrio_size < 0 ||
5159 io->pfrio_size > pf_ioctl_maxcount ||
5160 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_addr))) {
5164 totlen = io->pfrio_size * sizeof(struct pfr_addr);
5165 pfras = mallocarray(io->pfrio_size, sizeof(struct pfr_addr),
5167 error = copyin(io->pfrio_buffer, pfras, totlen);
5169 free(pfras, M_TEMP);
5173 error = pfr_ina_define(&io->pfrio_table, pfras,
5174 io->pfrio_size, &io->pfrio_nadd, &io->pfrio_naddr,
5175 io->pfrio_ticket, io->pfrio_flags | PFR_FLAG_USERIOCTL);
5177 free(pfras, M_TEMP);
5182 struct pf_osfp_ioctl *io = (struct pf_osfp_ioctl *)addr;
5184 error = pf_osfp_add(io);
5190 struct pf_osfp_ioctl *io = (struct pf_osfp_ioctl *)addr;
5192 error = pf_osfp_get(io);
5198 struct pfioc_trans *io = (struct pfioc_trans *)addr;
5199 struct pfioc_trans_e *ioes, *ioe;
5203 if (io->esize != sizeof(*ioe)) {
5208 io->size > pf_ioctl_maxcount ||
5209 WOULD_OVERFLOW(io->size, sizeof(struct pfioc_trans_e))) {
5213 totlen = sizeof(struct pfioc_trans_e) * io->size;
5214 ioes = mallocarray(io->size, sizeof(struct pfioc_trans_e),
5216 error = copyin(io->array, ioes, totlen);
5221 /* Ensure there's no more ethernet rules to clean up. */
5222 NET_EPOCH_DRAIN_CALLBACKS();
5224 for (i = 0, ioe = ioes; i < io->size; i++, ioe++) {
5225 ioe->anchor[sizeof(ioe->anchor) - 1] = '\0';
5226 switch (ioe->rs_num) {
5227 case PF_RULESET_ETH:
5228 if ((error = pf_begin_eth(&ioe->ticket, ioe->anchor))) {
5235 case PF_RULESET_ALTQ:
5236 if (ioe->anchor[0]) {
5242 if ((error = pf_begin_altq(&ioe->ticket))) {
5249 case PF_RULESET_TABLE:
5251 struct pfr_table table;
5253 bzero(&table, sizeof(table));
5254 strlcpy(table.pfrt_anchor, ioe->anchor,
5255 sizeof(table.pfrt_anchor));
5256 if ((error = pfr_ina_begin(&table,
5257 &ioe->ticket, NULL, 0))) {
5265 if ((error = pf_begin_rules(&ioe->ticket,
5266 ioe->rs_num, ioe->anchor))) {
5275 error = copyout(ioes, io->array, totlen);
5280 case DIOCXROLLBACK: {
5281 struct pfioc_trans *io = (struct pfioc_trans *)addr;
5282 struct pfioc_trans_e *ioe, *ioes;
5286 if (io->esize != sizeof(*ioe)) {
5291 io->size > pf_ioctl_maxcount ||
5292 WOULD_OVERFLOW(io->size, sizeof(struct pfioc_trans_e))) {
5296 totlen = sizeof(struct pfioc_trans_e) * io->size;
5297 ioes = mallocarray(io->size, sizeof(struct pfioc_trans_e),
5299 error = copyin(io->array, ioes, totlen);
5305 for (i = 0, ioe = ioes; i < io->size; i++, ioe++) {
5306 ioe->anchor[sizeof(ioe->anchor) - 1] = '\0';
5307 switch (ioe->rs_num) {
5308 case PF_RULESET_ETH:
5309 if ((error = pf_rollback_eth(ioe->ticket,
5313 goto fail; /* really bad */
5317 case PF_RULESET_ALTQ:
5318 if (ioe->anchor[0]) {
5324 if ((error = pf_rollback_altq(ioe->ticket))) {
5327 goto fail; /* really bad */
5331 case PF_RULESET_TABLE:
5333 struct pfr_table table;
5335 bzero(&table, sizeof(table));
5336 strlcpy(table.pfrt_anchor, ioe->anchor,
5337 sizeof(table.pfrt_anchor));
5338 if ((error = pfr_ina_rollback(&table,
5339 ioe->ticket, NULL, 0))) {
5342 goto fail; /* really bad */
5347 if ((error = pf_rollback_rules(ioe->ticket,
5348 ioe->rs_num, ioe->anchor))) {
5351 goto fail; /* really bad */
5362 struct pfioc_trans *io = (struct pfioc_trans *)addr;
5363 struct pfioc_trans_e *ioe, *ioes;
5364 struct pf_kruleset *rs;
5365 struct pf_keth_ruleset *ers;
5369 if (io->esize != sizeof(*ioe)) {
5375 io->size > pf_ioctl_maxcount ||
5376 WOULD_OVERFLOW(io->size, sizeof(struct pfioc_trans_e))) {
5381 totlen = sizeof(struct pfioc_trans_e) * io->size;
5382 ioes = mallocarray(io->size, sizeof(struct pfioc_trans_e),
5384 error = copyin(io->array, ioes, totlen);
5390 /* First makes sure everything will succeed. */
5391 for (i = 0, ioe = ioes; i < io->size; i++, ioe++) {
5392 ioe->anchor[sizeof(ioe->anchor) - 1] = 0;
5393 switch (ioe->rs_num) {
5394 case PF_RULESET_ETH:
5395 ers = pf_find_keth_ruleset(ioe->anchor);
5396 if (ers == NULL || ioe->ticket == 0 ||
5397 ioe->ticket != ers->inactive.ticket) {
5405 case PF_RULESET_ALTQ:
5406 if (ioe->anchor[0]) {
5412 if (!V_altqs_inactive_open || ioe->ticket !=
5413 V_ticket_altqs_inactive) {
5421 case PF_RULESET_TABLE:
5422 rs = pf_find_kruleset(ioe->anchor);
5423 if (rs == NULL || !rs->topen || ioe->ticket !=
5432 if (ioe->rs_num < 0 || ioe->rs_num >=
5439 rs = pf_find_kruleset(ioe->anchor);
5441 !rs->rules[ioe->rs_num].inactive.open ||
5442 rs->rules[ioe->rs_num].inactive.ticket !=
5452 /* Now do the commit - no errors should happen here. */
5453 for (i = 0, ioe = ioes; i < io->size; i++, ioe++) {
5454 switch (ioe->rs_num) {
5455 case PF_RULESET_ETH:
5456 if ((error = pf_commit_eth(ioe->ticket, ioe->anchor))) {
5459 goto fail; /* really bad */
5463 case PF_RULESET_ALTQ:
5464 if ((error = pf_commit_altq(ioe->ticket))) {
5467 goto fail; /* really bad */
5471 case PF_RULESET_TABLE:
5473 struct pfr_table table;
5475 bzero(&table, sizeof(table));
5476 (void)strlcpy(table.pfrt_anchor, ioe->anchor,
5477 sizeof(table.pfrt_anchor));
5478 if ((error = pfr_ina_commit(&table,
5479 ioe->ticket, NULL, NULL, 0))) {
5482 goto fail; /* really bad */
5487 if ((error = pf_commit_rules(ioe->ticket,
5488 ioe->rs_num, ioe->anchor))) {
5491 goto fail; /* really bad */
5498 /* Only hook into EtherNet taffic if we've got rules for it. */
5499 if (! TAILQ_EMPTY(V_pf_keth->active.rules))
5508 case DIOCGETSRCNODES: {
5509 struct pfioc_src_nodes *psn = (struct pfioc_src_nodes *)addr;
5510 struct pf_srchash *sh;
5511 struct pf_ksrc_node *n;
5512 struct pf_src_node *p, *pstore;
5515 for (i = 0, sh = V_pf_srchash; i <= pf_srchashmask;
5517 PF_HASHROW_LOCK(sh);
5518 LIST_FOREACH(n, &sh->nodes, entry)
5520 PF_HASHROW_UNLOCK(sh);
5523 psn->psn_len = min(psn->psn_len,
5524 sizeof(struct pf_src_node) * nr);
5526 if (psn->psn_len == 0) {
5527 psn->psn_len = sizeof(struct pf_src_node) * nr;
5533 p = pstore = malloc(psn->psn_len, M_TEMP, M_WAITOK | M_ZERO);
5534 for (i = 0, sh = V_pf_srchash; i <= pf_srchashmask;
5536 PF_HASHROW_LOCK(sh);
5537 LIST_FOREACH(n, &sh->nodes, entry) {
5539 if ((nr + 1) * sizeof(*p) > (unsigned)psn->psn_len)
5542 pf_src_node_copy(n, p);
5547 PF_HASHROW_UNLOCK(sh);
5549 error = copyout(pstore, psn->psn_src_nodes,
5550 sizeof(struct pf_src_node) * nr);
5552 free(pstore, M_TEMP);
5555 psn->psn_len = sizeof(struct pf_src_node) * nr;
5556 free(pstore, M_TEMP);
5560 case DIOCCLRSRCNODES: {
5561 pf_clear_srcnodes(NULL);
5562 pf_purge_expired_src_nodes();
5566 case DIOCKILLSRCNODES:
5567 pf_kill_srcnodes((struct pfioc_src_node_kill *)addr);
5570 #ifdef COMPAT_FREEBSD13
5571 case DIOCKEEPCOUNTERS_FREEBSD13:
5573 case DIOCKEEPCOUNTERS:
5574 error = pf_keepcounters((struct pfioc_nv *)addr);
5577 case DIOCGETSYNCOOKIES:
5578 error = pf_get_syncookies((struct pfioc_nv *)addr);
5581 case DIOCSETSYNCOOKIES:
5582 error = pf_set_syncookies((struct pfioc_nv *)addr);
5585 case DIOCSETHOSTID: {
5586 u_int32_t *hostid = (u_int32_t *)addr;
5590 V_pf_status.hostid = arc4random();
5592 V_pf_status.hostid = *hostid;
5603 case DIOCIGETIFACES: {
5604 struct pfioc_iface *io = (struct pfioc_iface *)addr;
5605 struct pfi_kif *ifstore;
5608 if (io->pfiio_esize != sizeof(struct pfi_kif)) {
5613 if (io->pfiio_size < 0 ||
5614 io->pfiio_size > pf_ioctl_maxcount ||
5615 WOULD_OVERFLOW(io->pfiio_size, sizeof(struct pfi_kif))) {
5620 io->pfiio_name[sizeof(io->pfiio_name) - 1] = '\0';
5622 bufsiz = io->pfiio_size * sizeof(struct pfi_kif);
5623 ifstore = mallocarray(io->pfiio_size, sizeof(struct pfi_kif),
5624 M_TEMP, M_WAITOK | M_ZERO);
5627 pfi_get_ifaces(io->pfiio_name, ifstore, &io->pfiio_size);
5629 error = copyout(ifstore, io->pfiio_buffer, bufsiz);
5630 free(ifstore, M_TEMP);
5634 case DIOCSETIFFLAG: {
5635 struct pfioc_iface *io = (struct pfioc_iface *)addr;
5637 io->pfiio_name[sizeof(io->pfiio_name) - 1] = '\0';
5640 error = pfi_set_flags(io->pfiio_name, io->pfiio_flags);
5645 case DIOCCLRIFFLAG: {
5646 struct pfioc_iface *io = (struct pfioc_iface *)addr;
5648 io->pfiio_name[sizeof(io->pfiio_name) - 1] = '\0';
5651 error = pfi_clear_flags(io->pfiio_name, io->pfiio_flags);
5656 case DIOCSETREASS: {
5657 u_int32_t *reass = (u_int32_t *)addr;
5659 V_pf_status.reass = *reass & (PF_REASS_ENABLED|PF_REASS_NODF);
5660 /* Removal of DF flag without reassembly enabled is not a
5661 * valid combination. Disable reassembly in such case. */
5662 if (!(V_pf_status.reass & PF_REASS_ENABLED))
5663 V_pf_status.reass = 0;
5672 if (sx_xlocked(&V_pf_ioctl_lock))
5673 sx_xunlock(&V_pf_ioctl_lock);
5682 pfsync_state_export(union pfsync_state_union *sp, struct pf_kstate *st, int msg_version)
5684 bzero(sp, sizeof(union pfsync_state_union));
5686 /* copy from state key */
5687 sp->pfs_1301.key[PF_SK_WIRE].addr[0] = st->key[PF_SK_WIRE]->addr[0];
5688 sp->pfs_1301.key[PF_SK_WIRE].addr[1] = st->key[PF_SK_WIRE]->addr[1];
5689 sp->pfs_1301.key[PF_SK_WIRE].port[0] = st->key[PF_SK_WIRE]->port[0];
5690 sp->pfs_1301.key[PF_SK_WIRE].port[1] = st->key[PF_SK_WIRE]->port[1];
5691 sp->pfs_1301.key[PF_SK_STACK].addr[0] = st->key[PF_SK_STACK]->addr[0];
5692 sp->pfs_1301.key[PF_SK_STACK].addr[1] = st->key[PF_SK_STACK]->addr[1];
5693 sp->pfs_1301.key[PF_SK_STACK].port[0] = st->key[PF_SK_STACK]->port[0];
5694 sp->pfs_1301.key[PF_SK_STACK].port[1] = st->key[PF_SK_STACK]->port[1];
5695 sp->pfs_1301.proto = st->key[PF_SK_WIRE]->proto;
5696 sp->pfs_1301.af = st->key[PF_SK_WIRE]->af;
5698 /* copy from state */
5699 strlcpy(sp->pfs_1301.ifname, st->kif->pfik_name, sizeof(sp->pfs_1301.ifname));
5700 bcopy(&st->rt_addr, &sp->pfs_1301.rt_addr, sizeof(sp->pfs_1301.rt_addr));
5701 sp->pfs_1301.creation = htonl(time_uptime - st->creation);
5702 sp->pfs_1301.expire = pf_state_expires(st);
5703 if (sp->pfs_1301.expire <= time_uptime)
5704 sp->pfs_1301.expire = htonl(0);
5706 sp->pfs_1301.expire = htonl(sp->pfs_1301.expire - time_uptime);
5708 sp->pfs_1301.direction = st->direction;
5709 sp->pfs_1301.log = st->log;
5710 sp->pfs_1301.timeout = st->timeout;
5712 switch (msg_version) {
5713 case PFSYNC_MSG_VERSION_1301:
5714 sp->pfs_1301.state_flags = st->state_flags;
5716 case PFSYNC_MSG_VERSION_1400:
5717 sp->pfs_1400.state_flags = htons(st->state_flags);
5718 sp->pfs_1400.qid = htons(st->qid);
5719 sp->pfs_1400.pqid = htons(st->pqid);
5720 sp->pfs_1400.dnpipe = htons(st->dnpipe);
5721 sp->pfs_1400.dnrpipe = htons(st->dnrpipe);
5722 sp->pfs_1400.rtableid = htonl(st->rtableid);
5723 sp->pfs_1400.min_ttl = st->min_ttl;
5724 sp->pfs_1400.set_tos = st->set_tos;
5725 sp->pfs_1400.max_mss = htons(st->max_mss);
5726 sp->pfs_1400.set_prio[0] = st->set_prio[0];
5727 sp->pfs_1400.set_prio[1] = st->set_prio[1];
5728 sp->pfs_1400.rt = st->rt;
5730 strlcpy(sp->pfs_1400.rt_ifname,
5731 st->rt_kif->pfik_name,
5732 sizeof(sp->pfs_1400.rt_ifname));
5735 panic("%s: Unsupported pfsync_msg_version %d",
5736 __func__, msg_version);
5740 sp->pfs_1301.sync_flags |= PFSYNC_FLAG_SRCNODE;
5741 if (st->nat_src_node)
5742 sp->pfs_1301.sync_flags |= PFSYNC_FLAG_NATSRCNODE;
5744 sp->pfs_1301.id = st->id;
5745 sp->pfs_1301.creatorid = st->creatorid;
5746 pf_state_peer_hton(&st->src, &sp->pfs_1301.src);
5747 pf_state_peer_hton(&st->dst, &sp->pfs_1301.dst);
5749 if (st->rule.ptr == NULL)
5750 sp->pfs_1301.rule = htonl(-1);
5752 sp->pfs_1301.rule = htonl(st->rule.ptr->nr);
5753 if (st->anchor.ptr == NULL)
5754 sp->pfs_1301.anchor = htonl(-1);
5756 sp->pfs_1301.anchor = htonl(st->anchor.ptr->nr);
5757 if (st->nat_rule.ptr == NULL)
5758 sp->pfs_1301.nat_rule = htonl(-1);
5760 sp->pfs_1301.nat_rule = htonl(st->nat_rule.ptr->nr);
5762 pf_state_counter_hton(st->packets[0], sp->pfs_1301.packets[0]);
5763 pf_state_counter_hton(st->packets[1], sp->pfs_1301.packets[1]);
5764 pf_state_counter_hton(st->bytes[0], sp->pfs_1301.bytes[0]);
5765 pf_state_counter_hton(st->bytes[1], sp->pfs_1301.bytes[1]);
5769 pf_state_export(struct pf_state_export *sp, struct pf_kstate *st)
5771 bzero(sp, sizeof(*sp));
5773 sp->version = PF_STATE_VERSION;
5775 /* copy from state key */
5776 sp->key[PF_SK_WIRE].addr[0] = st->key[PF_SK_WIRE]->addr[0];
5777 sp->key[PF_SK_WIRE].addr[1] = st->key[PF_SK_WIRE]->addr[1];
5778 sp->key[PF_SK_WIRE].port[0] = st->key[PF_SK_WIRE]->port[0];
5779 sp->key[PF_SK_WIRE].port[1] = st->key[PF_SK_WIRE]->port[1];
5780 sp->key[PF_SK_STACK].addr[0] = st->key[PF_SK_STACK]->addr[0];
5781 sp->key[PF_SK_STACK].addr[1] = st->key[PF_SK_STACK]->addr[1];
5782 sp->key[PF_SK_STACK].port[0] = st->key[PF_SK_STACK]->port[0];
5783 sp->key[PF_SK_STACK].port[1] = st->key[PF_SK_STACK]->port[1];
5784 sp->proto = st->key[PF_SK_WIRE]->proto;
5785 sp->af = st->key[PF_SK_WIRE]->af;
5787 /* copy from state */
5788 strlcpy(sp->ifname, st->kif->pfik_name, sizeof(sp->ifname));
5789 strlcpy(sp->orig_ifname, st->orig_kif->pfik_name,
5790 sizeof(sp->orig_ifname));
5791 bcopy(&st->rt_addr, &sp->rt_addr, sizeof(sp->rt_addr));
5792 sp->creation = htonl(time_uptime - st->creation);
5793 sp->expire = pf_state_expires(st);
5794 if (sp->expire <= time_uptime)
5795 sp->expire = htonl(0);
5797 sp->expire = htonl(sp->expire - time_uptime);
5799 sp->direction = st->direction;
5801 sp->timeout = st->timeout;
5802 /* 8 bits for the old libpfctl, 16 bits for the new libpfctl */
5803 sp->state_flags_compat = st->state_flags;
5804 sp->state_flags = htons(st->state_flags);
5806 sp->sync_flags |= PFSYNC_FLAG_SRCNODE;
5807 if (st->nat_src_node)
5808 sp->sync_flags |= PFSYNC_FLAG_NATSRCNODE;
5811 sp->creatorid = st->creatorid;
5812 pf_state_peer_hton(&st->src, &sp->src);
5813 pf_state_peer_hton(&st->dst, &sp->dst);
5815 if (st->rule.ptr == NULL)
5816 sp->rule = htonl(-1);
5818 sp->rule = htonl(st->rule.ptr->nr);
5819 if (st->anchor.ptr == NULL)
5820 sp->anchor = htonl(-1);
5822 sp->anchor = htonl(st->anchor.ptr->nr);
5823 if (st->nat_rule.ptr == NULL)
5824 sp->nat_rule = htonl(-1);
5826 sp->nat_rule = htonl(st->nat_rule.ptr->nr);
5828 sp->packets[0] = st->packets[0];
5829 sp->packets[1] = st->packets[1];
5830 sp->bytes[0] = st->bytes[0];
5831 sp->bytes[1] = st->bytes[1];
5833 sp->qid = htons(st->qid);
5834 sp->pqid = htons(st->pqid);
5835 sp->dnpipe = htons(st->dnpipe);
5836 sp->dnrpipe = htons(st->dnrpipe);
5837 sp->rtableid = htonl(st->rtableid);
5838 sp->min_ttl = st->min_ttl;
5839 sp->set_tos = st->set_tos;
5840 sp->max_mss = htons(st->max_mss);
5843 strlcpy(sp->rt_ifname, st->rt_kif->pfik_name,
5844 sizeof(sp->rt_ifname));
5845 sp->set_prio[0] = st->set_prio[0];
5846 sp->set_prio[1] = st->set_prio[1];
5851 pf_tbladdr_copyout(struct pf_addr_wrap *aw)
5853 struct pfr_ktable *kt;
5855 KASSERT(aw->type == PF_ADDR_TABLE, ("%s: type %u", __func__, aw->type));
5858 if (!(kt->pfrkt_flags & PFR_TFLAG_ACTIVE) && kt->pfrkt_root != NULL)
5859 kt = kt->pfrkt_root;
5861 aw->p.tblcnt = (kt->pfrkt_flags & PFR_TFLAG_ACTIVE) ?
5866 pf_add_status_counters(nvlist_t *nvl, const char *name, counter_u64_t *counters,
5867 size_t number, char **names)
5871 nvc = nvlist_create(0);
5875 for (int i = 0; i < number; i++) {
5876 nvlist_append_number_array(nvc, "counters",
5877 counter_u64_fetch(counters[i]));
5878 nvlist_append_string_array(nvc, "names",
5880 nvlist_append_number_array(nvc, "ids",
5883 nvlist_add_nvlist(nvl, name, nvc);
5884 nvlist_destroy(nvc);
5890 pf_getstatus(struct pfioc_nv *nv)
5892 nvlist_t *nvl = NULL, *nvc = NULL;
5893 void *nvlpacked = NULL;
5896 char *pf_reasons[PFRES_MAX+1] = PFRES_NAMES;
5897 char *pf_lcounter[KLCNT_MAX+1] = KLCNT_NAMES;
5898 char *pf_fcounter[FCNT_MAX+1] = FCNT_NAMES;
5899 PF_RULES_RLOCK_TRACKER;
5901 #define ERROUT(x) ERROUT_FUNCTION(errout, x)
5905 nvl = nvlist_create(0);
5909 nvlist_add_bool(nvl, "running", V_pf_status.running);
5910 nvlist_add_number(nvl, "since", V_pf_status.since);
5911 nvlist_add_number(nvl, "debug", V_pf_status.debug);
5912 nvlist_add_number(nvl, "hostid", V_pf_status.hostid);
5913 nvlist_add_number(nvl, "states", V_pf_status.states);
5914 nvlist_add_number(nvl, "src_nodes", V_pf_status.src_nodes);
5915 nvlist_add_number(nvl, "reass", V_pf_status.reass);
5916 nvlist_add_bool(nvl, "syncookies_active",
5917 V_pf_status.syncookies_active);
5920 error = pf_add_status_counters(nvl, "counters", V_pf_status.counters,
5921 PFRES_MAX, pf_reasons);
5926 error = pf_add_status_counters(nvl, "lcounters", V_pf_status.lcounters,
5927 KLCNT_MAX, pf_lcounter);
5932 nvc = nvlist_create(0);
5936 for (int i = 0; i < FCNT_MAX; i++) {
5937 nvlist_append_number_array(nvc, "counters",
5938 pf_counter_u64_fetch(&V_pf_status.fcounters[i]));
5939 nvlist_append_string_array(nvc, "names",
5941 nvlist_append_number_array(nvc, "ids",
5944 nvlist_add_nvlist(nvl, "fcounters", nvc);
5945 nvlist_destroy(nvc);
5949 error = pf_add_status_counters(nvl, "scounters", V_pf_status.scounters,
5950 SCNT_MAX, pf_fcounter);
5954 nvlist_add_string(nvl, "ifname", V_pf_status.ifname);
5955 nvlist_add_binary(nvl, "chksum", V_pf_status.pf_chksum,
5956 PF_MD5_DIGEST_LENGTH);
5958 pfi_update_status(V_pf_status.ifname, &s);
5960 /* pcounters / bcounters */
5961 for (int i = 0; i < 2; i++) {
5962 for (int j = 0; j < 2; j++) {
5963 for (int k = 0; k < 2; k++) {
5964 nvlist_append_number_array(nvl, "pcounters",
5965 s.pcounters[i][j][k]);
5967 nvlist_append_number_array(nvl, "bcounters",
5972 nvlpacked = nvlist_pack(nvl, &nv->len);
5973 if (nvlpacked == NULL)
5978 else if (nv->size < nv->len)
5982 error = copyout(nvlpacked, nv->data, nv->len);
5989 free(nvlpacked, M_NVLIST);
5990 nvlist_destroy(nvc);
5991 nvlist_destroy(nvl);
5997 * XXX - Check for version mismatch!!!
6000 pf_clear_all_states(void)
6002 struct pf_kstate *s;
6005 for (i = 0; i <= pf_hashmask; i++) {
6006 struct pf_idhash *ih = &V_pf_idhash[i];
6008 PF_HASHROW_LOCK(ih);
6009 LIST_FOREACH(s, &ih->states, entry) {
6010 s->timeout = PFTM_PURGE;
6011 /* Don't send out individual delete messages. */
6012 s->state_flags |= PFSTATE_NOSYNC;
6016 PF_HASHROW_UNLOCK(ih);
6021 pf_clear_tables(void)
6023 struct pfioc_table io;
6026 bzero(&io, sizeof(io));
6028 error = pfr_clr_tables(&io.pfrio_table, &io.pfrio_ndel,
6035 pf_clear_srcnodes(struct pf_ksrc_node *n)
6037 struct pf_kstate *s;
6040 for (i = 0; i <= pf_hashmask; i++) {
6041 struct pf_idhash *ih = &V_pf_idhash[i];
6043 PF_HASHROW_LOCK(ih);
6044 LIST_FOREACH(s, &ih->states, entry) {
6045 if (n == NULL || n == s->src_node)
6047 if (n == NULL || n == s->nat_src_node)
6048 s->nat_src_node = NULL;
6050 PF_HASHROW_UNLOCK(ih);
6054 struct pf_srchash *sh;
6056 for (i = 0, sh = V_pf_srchash; i <= pf_srchashmask;
6058 PF_HASHROW_LOCK(sh);
6059 LIST_FOREACH(n, &sh->nodes, entry) {
6063 PF_HASHROW_UNLOCK(sh);
6066 /* XXX: hash slot should already be locked here. */
6073 pf_kill_srcnodes(struct pfioc_src_node_kill *psnk)
6075 struct pf_ksrc_node_list kill;
6078 for (int i = 0; i <= pf_srchashmask; i++) {
6079 struct pf_srchash *sh = &V_pf_srchash[i];
6080 struct pf_ksrc_node *sn, *tmp;
6082 PF_HASHROW_LOCK(sh);
6083 LIST_FOREACH_SAFE(sn, &sh->nodes, entry, tmp)
6084 if (PF_MATCHA(psnk->psnk_src.neg,
6085 &psnk->psnk_src.addr.v.a.addr,
6086 &psnk->psnk_src.addr.v.a.mask,
6087 &sn->addr, sn->af) &&
6088 PF_MATCHA(psnk->psnk_dst.neg,
6089 &psnk->psnk_dst.addr.v.a.addr,
6090 &psnk->psnk_dst.addr.v.a.mask,
6091 &sn->raddr, sn->af)) {
6092 pf_unlink_src_node(sn);
6093 LIST_INSERT_HEAD(&kill, sn, entry);
6096 PF_HASHROW_UNLOCK(sh);
6099 for (int i = 0; i <= pf_hashmask; i++) {
6100 struct pf_idhash *ih = &V_pf_idhash[i];
6101 struct pf_kstate *s;
6103 PF_HASHROW_LOCK(ih);
6104 LIST_FOREACH(s, &ih->states, entry) {
6105 if (s->src_node && s->src_node->expire == 1)
6107 if (s->nat_src_node && s->nat_src_node->expire == 1)
6108 s->nat_src_node = NULL;
6110 PF_HASHROW_UNLOCK(ih);
6113 psnk->psnk_killed = pf_free_src_nodes(&kill);
6117 pf_keepcounters(struct pfioc_nv *nv)
6119 nvlist_t *nvl = NULL;
6120 void *nvlpacked = NULL;
6123 #define ERROUT(x) ERROUT_FUNCTION(on_error, x)
6125 if (nv->len > pf_ioctl_maxcount)
6128 nvlpacked = malloc(nv->len, M_NVLIST, M_WAITOK);
6129 if (nvlpacked == NULL)
6132 error = copyin(nv->data, nvlpacked, nv->len);
6136 nvl = nvlist_unpack(nvlpacked, nv->len, 0);
6140 if (! nvlist_exists_bool(nvl, "keep_counters"))
6143 V_pf_status.keep_counters = nvlist_get_bool(nvl, "keep_counters");
6146 nvlist_destroy(nvl);
6147 free(nvlpacked, M_NVLIST);
6152 pf_clear_states(const struct pf_kstate_kill *kill)
6154 struct pf_state_key_cmp match_key;
6155 struct pf_kstate *s;
6156 struct pfi_kkif *kif;
6158 unsigned int killed = 0, dir;
6160 for (unsigned int i = 0; i <= pf_hashmask; i++) {
6161 struct pf_idhash *ih = &V_pf_idhash[i];
6163 relock_DIOCCLRSTATES:
6164 PF_HASHROW_LOCK(ih);
6165 LIST_FOREACH(s, &ih->states, entry) {
6166 /* For floating states look at the original kif. */
6167 kif = s->kif == V_pfi_all ? s->orig_kif : s->kif;
6169 if (kill->psk_ifname[0] &&
6170 strcmp(kill->psk_ifname,
6174 if (kill->psk_kill_match) {
6175 bzero(&match_key, sizeof(match_key));
6177 if (s->direction == PF_OUT) {
6185 match_key.af = s->key[idx]->af;
6186 match_key.proto = s->key[idx]->proto;
6187 PF_ACPY(&match_key.addr[0],
6188 &s->key[idx]->addr[1], match_key.af);
6189 match_key.port[0] = s->key[idx]->port[1];
6190 PF_ACPY(&match_key.addr[1],
6191 &s->key[idx]->addr[0], match_key.af);
6192 match_key.port[1] = s->key[idx]->port[0];
6196 * Don't send out individual
6199 s->state_flags |= PFSTATE_NOSYNC;
6203 if (kill->psk_kill_match)
6204 killed += pf_kill_matching_state(&match_key,
6207 goto relock_DIOCCLRSTATES;
6209 PF_HASHROW_UNLOCK(ih);
6212 if (V_pfsync_clear_states_ptr != NULL)
6213 V_pfsync_clear_states_ptr(V_pf_status.hostid, kill->psk_ifname);
6219 pf_killstates(struct pf_kstate_kill *kill, unsigned int *killed)
6221 struct pf_kstate *s;
6223 if (kill->psk_pfcmp.id) {
6224 if (kill->psk_pfcmp.creatorid == 0)
6225 kill->psk_pfcmp.creatorid = V_pf_status.hostid;
6226 if ((s = pf_find_state_byid(kill->psk_pfcmp.id,
6227 kill->psk_pfcmp.creatorid))) {
6234 for (unsigned int i = 0; i <= pf_hashmask; i++)
6235 *killed += pf_killstates_row(kill, &V_pf_idhash[i]);
6241 pf_killstates_nv(struct pfioc_nv *nv)
6243 struct pf_kstate_kill kill;
6244 nvlist_t *nvl = NULL;
6245 void *nvlpacked = NULL;
6247 unsigned int killed = 0;
6249 #define ERROUT(x) ERROUT_FUNCTION(on_error, x)
6251 if (nv->len > pf_ioctl_maxcount)
6254 nvlpacked = malloc(nv->len, M_NVLIST, M_WAITOK);
6255 if (nvlpacked == NULL)
6258 error = copyin(nv->data, nvlpacked, nv->len);
6262 nvl = nvlist_unpack(nvlpacked, nv->len, 0);
6266 error = pf_nvstate_kill_to_kstate_kill(nvl, &kill);
6270 pf_killstates(&kill, &killed);
6272 free(nvlpacked, M_NVLIST);
6274 nvlist_destroy(nvl);
6275 nvl = nvlist_create(0);
6279 nvlist_add_number(nvl, "killed", killed);
6281 nvlpacked = nvlist_pack(nvl, &nv->len);
6282 if (nvlpacked == NULL)
6287 else if (nv->size < nv->len)
6290 error = copyout(nvlpacked, nv->data, nv->len);
6293 nvlist_destroy(nvl);
6294 free(nvlpacked, M_NVLIST);
6299 pf_clearstates_nv(struct pfioc_nv *nv)
6301 struct pf_kstate_kill kill;
6302 nvlist_t *nvl = NULL;
6303 void *nvlpacked = NULL;
6305 unsigned int killed;
6307 #define ERROUT(x) ERROUT_FUNCTION(on_error, x)
6309 if (nv->len > pf_ioctl_maxcount)
6312 nvlpacked = malloc(nv->len, M_NVLIST, M_WAITOK);
6313 if (nvlpacked == NULL)
6316 error = copyin(nv->data, nvlpacked, nv->len);
6320 nvl = nvlist_unpack(nvlpacked, nv->len, 0);
6324 error = pf_nvstate_kill_to_kstate_kill(nvl, &kill);
6328 killed = pf_clear_states(&kill);
6330 free(nvlpacked, M_NVLIST);
6332 nvlist_destroy(nvl);
6333 nvl = nvlist_create(0);
6337 nvlist_add_number(nvl, "killed", killed);
6339 nvlpacked = nvlist_pack(nvl, &nv->len);
6340 if (nvlpacked == NULL)
6345 else if (nv->size < nv->len)
6348 error = copyout(nvlpacked, nv->data, nv->len);
6352 nvlist_destroy(nvl);
6353 free(nvlpacked, M_NVLIST);
6358 pf_getstate(struct pfioc_nv *nv)
6360 nvlist_t *nvl = NULL, *nvls;
6361 void *nvlpacked = NULL;
6362 struct pf_kstate *s = NULL;
6364 uint64_t id, creatorid;
6366 #define ERROUT(x) ERROUT_FUNCTION(errout, x)
6368 if (nv->len > pf_ioctl_maxcount)
6371 nvlpacked = malloc(nv->len, M_NVLIST, M_WAITOK);
6372 if (nvlpacked == NULL)
6375 error = copyin(nv->data, nvlpacked, nv->len);
6379 nvl = nvlist_unpack(nvlpacked, nv->len, 0);
6383 PFNV_CHK(pf_nvuint64(nvl, "id", &id));
6384 PFNV_CHK(pf_nvuint64(nvl, "creatorid", &creatorid));
6386 s = pf_find_state_byid(id, creatorid);
6390 free(nvlpacked, M_NVLIST);
6392 nvlist_destroy(nvl);
6393 nvl = nvlist_create(0);
6397 nvls = pf_state_to_nvstate(s);
6401 nvlist_add_nvlist(nvl, "state", nvls);
6402 nvlist_destroy(nvls);
6404 nvlpacked = nvlist_pack(nvl, &nv->len);
6405 if (nvlpacked == NULL)
6410 else if (nv->size < nv->len)
6413 error = copyout(nvlpacked, nv->data, nv->len);
6419 free(nvlpacked, M_NVLIST);
6420 nvlist_destroy(nvl);
6425 * XXX - Check for version mismatch!!!
6429 * Duplicate pfctl -Fa operation to get rid of as much as we can.
6439 if ((error = pf_begin_rules(&t[0], PF_RULESET_SCRUB, &nn))
6441 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: SCRUB\n"));
6444 if ((error = pf_begin_rules(&t[1], PF_RULESET_FILTER, &nn))
6446 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: FILTER\n"));
6447 break; /* XXX: rollback? */
6449 if ((error = pf_begin_rules(&t[2], PF_RULESET_NAT, &nn))
6451 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: NAT\n"));
6452 break; /* XXX: rollback? */
6454 if ((error = pf_begin_rules(&t[3], PF_RULESET_BINAT, &nn))
6456 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: BINAT\n"));
6457 break; /* XXX: rollback? */
6459 if ((error = pf_begin_rules(&t[4], PF_RULESET_RDR, &nn))
6461 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: RDR\n"));
6462 break; /* XXX: rollback? */
6465 /* XXX: these should always succeed here */
6466 pf_commit_rules(t[0], PF_RULESET_SCRUB, &nn);
6467 pf_commit_rules(t[1], PF_RULESET_FILTER, &nn);
6468 pf_commit_rules(t[2], PF_RULESET_NAT, &nn);
6469 pf_commit_rules(t[3], PF_RULESET_BINAT, &nn);
6470 pf_commit_rules(t[4], PF_RULESET_RDR, &nn);
6472 if ((error = pf_clear_tables()) != 0)
6475 if ((error = pf_begin_eth(&t[0], &nn)) != 0) {
6476 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: eth\n"));
6479 pf_commit_eth(t[0], &nn);
6482 if ((error = pf_begin_altq(&t[0])) != 0) {
6483 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: ALTQ\n"));
6486 pf_commit_altq(t[0]);
6489 pf_clear_all_states();
6491 pf_clear_srcnodes(NULL);
6493 /* status does not use malloced mem so no need to cleanup */
6494 /* fingerprints and interfaces have their own cleanup code */
6500 static pfil_return_t
6501 pf_check_return(int chk, struct mbuf **m)
6507 return (PFIL_CONSUMED);
6516 return (PFIL_DROPPED);
6520 static pfil_return_t
6521 pf_eth_check_in(struct mbuf **m, struct ifnet *ifp, int flags,
6522 void *ruleset __unused, struct inpcb *inp)
6526 chk = pf_test_eth(PF_IN, flags, ifp, m, inp);
6528 return (pf_check_return(chk, m));
6531 static pfil_return_t
6532 pf_eth_check_out(struct mbuf **m, struct ifnet *ifp, int flags,
6533 void *ruleset __unused, struct inpcb *inp)
6537 chk = pf_test_eth(PF_OUT, flags, ifp, m, inp);
6539 return (pf_check_return(chk, m));
6543 static pfil_return_t
6544 pf_check_in(struct mbuf **m, struct ifnet *ifp, int flags,
6545 void *ruleset __unused, struct inpcb *inp)
6549 chk = pf_test(PF_IN, flags, ifp, m, inp, NULL);
6551 return (pf_check_return(chk, m));
6554 static pfil_return_t
6555 pf_check_out(struct mbuf **m, struct ifnet *ifp, int flags,
6556 void *ruleset __unused, struct inpcb *inp)
6560 chk = pf_test(PF_OUT, flags, ifp, m, inp, NULL);
6562 return (pf_check_return(chk, m));
6567 static pfil_return_t
6568 pf_check6_in(struct mbuf **m, struct ifnet *ifp, int flags,
6569 void *ruleset __unused, struct inpcb *inp)
6574 * In case of loopback traffic IPv6 uses the real interface in
6575 * order to support scoped addresses. In order to support stateful
6576 * filtering we have change this to lo0 as it is the case in IPv4.
6578 CURVNET_SET(ifp->if_vnet);
6579 chk = pf_test6(PF_IN, flags, (*m)->m_flags & M_LOOP ? V_loif : ifp,
6583 return (pf_check_return(chk, m));
6586 static pfil_return_t
6587 pf_check6_out(struct mbuf **m, struct ifnet *ifp, int flags,
6588 void *ruleset __unused, struct inpcb *inp)
6592 CURVNET_SET(ifp->if_vnet);
6593 chk = pf_test6(PF_OUT, flags, ifp, m, inp, NULL);
6596 return (pf_check_return(chk, m));
6600 VNET_DEFINE_STATIC(pfil_hook_t, pf_eth_in_hook);
6601 VNET_DEFINE_STATIC(pfil_hook_t, pf_eth_out_hook);
6602 #define V_pf_eth_in_hook VNET(pf_eth_in_hook)
6603 #define V_pf_eth_out_hook VNET(pf_eth_out_hook)
6606 VNET_DEFINE_STATIC(pfil_hook_t, pf_ip4_in_hook);
6607 VNET_DEFINE_STATIC(pfil_hook_t, pf_ip4_out_hook);
6608 #define V_pf_ip4_in_hook VNET(pf_ip4_in_hook)
6609 #define V_pf_ip4_out_hook VNET(pf_ip4_out_hook)
6612 VNET_DEFINE_STATIC(pfil_hook_t, pf_ip6_in_hook);
6613 VNET_DEFINE_STATIC(pfil_hook_t, pf_ip6_out_hook);
6614 #define V_pf_ip6_in_hook VNET(pf_ip6_in_hook)
6615 #define V_pf_ip6_out_hook VNET(pf_ip6_out_hook)
6621 struct pfil_hook_args pha = {
6622 .pa_version = PFIL_VERSION,
6624 .pa_type = PFIL_TYPE_ETHERNET,
6626 struct pfil_link_args pla = {
6627 .pa_version = PFIL_VERSION,
6631 if (atomic_load_bool(&V_pf_pfil_eth_hooked))
6634 pha.pa_mbuf_chk = pf_eth_check_in;
6635 pha.pa_flags = PFIL_IN;
6636 pha.pa_rulname = "eth-in";
6637 V_pf_eth_in_hook = pfil_add_hook(&pha);
6638 pla.pa_flags = PFIL_IN | PFIL_HEADPTR | PFIL_HOOKPTR;
6639 pla.pa_head = V_link_pfil_head;
6640 pla.pa_hook = V_pf_eth_in_hook;
6641 ret = pfil_link(&pla);
6643 pha.pa_mbuf_chk = pf_eth_check_out;
6644 pha.pa_flags = PFIL_OUT;
6645 pha.pa_rulname = "eth-out";
6646 V_pf_eth_out_hook = pfil_add_hook(&pha);
6647 pla.pa_flags = PFIL_OUT | PFIL_HEADPTR | PFIL_HOOKPTR;
6648 pla.pa_head = V_link_pfil_head;
6649 pla.pa_hook = V_pf_eth_out_hook;
6650 ret = pfil_link(&pla);
6653 atomic_store_bool(&V_pf_pfil_eth_hooked, true);
6659 struct pfil_hook_args pha = {
6660 .pa_version = PFIL_VERSION,
6663 struct pfil_link_args pla = {
6664 .pa_version = PFIL_VERSION,
6668 if (atomic_load_bool(&V_pf_pfil_hooked))
6672 pha.pa_type = PFIL_TYPE_IP4;
6673 pha.pa_mbuf_chk = pf_check_in;
6674 pha.pa_flags = PFIL_IN;
6675 pha.pa_rulname = "default-in";
6676 V_pf_ip4_in_hook = pfil_add_hook(&pha);
6677 pla.pa_flags = PFIL_IN | PFIL_HEADPTR | PFIL_HOOKPTR;
6678 pla.pa_head = V_inet_pfil_head;
6679 pla.pa_hook = V_pf_ip4_in_hook;
6680 ret = pfil_link(&pla);
6682 pha.pa_mbuf_chk = pf_check_out;
6683 pha.pa_flags = PFIL_OUT;
6684 pha.pa_rulname = "default-out";
6685 V_pf_ip4_out_hook = pfil_add_hook(&pha);
6686 pla.pa_flags = PFIL_OUT | PFIL_HEADPTR | PFIL_HOOKPTR;
6687 pla.pa_head = V_inet_pfil_head;
6688 pla.pa_hook = V_pf_ip4_out_hook;
6689 ret = pfil_link(&pla);
6691 if (V_pf_filter_local) {
6692 pla.pa_flags = PFIL_OUT | PFIL_HEADPTR | PFIL_HOOKPTR;
6693 pla.pa_head = V_inet_local_pfil_head;
6694 pla.pa_hook = V_pf_ip4_out_hook;
6695 ret = pfil_link(&pla);
6700 pha.pa_type = PFIL_TYPE_IP6;
6701 pha.pa_mbuf_chk = pf_check6_in;
6702 pha.pa_flags = PFIL_IN;
6703 pha.pa_rulname = "default-in6";
6704 V_pf_ip6_in_hook = pfil_add_hook(&pha);
6705 pla.pa_flags = PFIL_IN | PFIL_HEADPTR | PFIL_HOOKPTR;
6706 pla.pa_head = V_inet6_pfil_head;
6707 pla.pa_hook = V_pf_ip6_in_hook;
6708 ret = pfil_link(&pla);
6710 pha.pa_mbuf_chk = pf_check6_out;
6711 pha.pa_rulname = "default-out6";
6712 pha.pa_flags = PFIL_OUT;
6713 V_pf_ip6_out_hook = pfil_add_hook(&pha);
6714 pla.pa_flags = PFIL_OUT | PFIL_HEADPTR | PFIL_HOOKPTR;
6715 pla.pa_head = V_inet6_pfil_head;
6716 pla.pa_hook = V_pf_ip6_out_hook;
6717 ret = pfil_link(&pla);
6719 if (V_pf_filter_local) {
6720 pla.pa_flags = PFIL_OUT | PFIL_HEADPTR | PFIL_HOOKPTR;
6721 pla.pa_head = V_inet6_local_pfil_head;
6722 pla.pa_hook = V_pf_ip6_out_hook;
6723 ret = pfil_link(&pla);
6728 atomic_store_bool(&V_pf_pfil_hooked, true);
6735 if (!atomic_load_bool(&V_pf_pfil_eth_hooked))
6738 pfil_remove_hook(V_pf_eth_in_hook);
6739 pfil_remove_hook(V_pf_eth_out_hook);
6741 atomic_store_bool(&V_pf_pfil_eth_hooked, false);
6748 if (!atomic_load_bool(&V_pf_pfil_hooked))
6752 pfil_remove_hook(V_pf_ip4_in_hook);
6753 pfil_remove_hook(V_pf_ip4_out_hook);
6756 pfil_remove_hook(V_pf_ip6_in_hook);
6757 pfil_remove_hook(V_pf_ip6_out_hook);
6760 atomic_store_bool(&V_pf_pfil_hooked, false);
6766 V_pf_tag_z = uma_zcreate("pf tags", sizeof(struct pf_tagname),
6767 NULL, NULL, NULL, NULL, UMA_ALIGN_PTR, 0);
6769 rm_init_flags(&V_pf_rules_lock, "pf rulesets", RM_RECURSE);
6770 sx_init(&V_pf_ioctl_lock, "pf ioctl");
6772 pf_init_tagset(&V_pf_tags, &pf_rule_tag_hashsize,
6773 PF_RULE_TAG_HASH_SIZE_DEFAULT);
6775 pf_init_tagset(&V_pf_qids, &pf_queue_tag_hashsize,
6776 PF_QUEUE_TAG_HASH_SIZE_DEFAULT);
6779 V_pf_keth = &V_pf_main_keth_anchor.ruleset;
6782 V_pf_vnet_active = 1;
6790 sx_init(&pf_end_lock, "pf end thread");
6792 pf_mtag_initialize();
6794 pf_dev = make_dev(&pf_cdevsw, 0, UID_ROOT, GID_WHEEL, 0600, PF_NAME);
6799 error = kproc_create(pf_purge_thread, NULL, &pf_purge_proc, 0, 0, "pf purge");
6809 pf_unload_vnet(void)
6813 V_pf_vnet_active = 0;
6814 V_pf_status.running = 0;
6819 pf_syncookies_cleanup();
6823 /* Make sure we've cleaned up ethernet rules before we continue. */
6824 NET_EPOCH_DRAIN_CALLBACKS();
6826 ret = swi_remove(V_pf_swi_cookie);
6828 ret = intr_event_destroy(V_pf_swi_ie);
6831 pf_unload_vnet_purge();
6833 pf_normalize_cleanup();
6840 if (IS_DEFAULT_VNET(curvnet))
6843 pf_cleanup_tagset(&V_pf_tags);
6845 pf_cleanup_tagset(&V_pf_qids);
6847 uma_zdestroy(V_pf_tag_z);
6849 #ifdef PF_WANT_32_TO_64_COUNTER
6851 LIST_REMOVE(V_pf_kifmarker, pfik_allkiflist);
6853 MPASS(LIST_EMPTY(&V_pf_allkiflist));
6854 MPASS(V_pf_allkifcount == 0);
6856 LIST_REMOVE(&V_pf_default_rule, allrulelist);
6857 V_pf_allrulecount--;
6858 LIST_REMOVE(V_pf_rulemarker, allrulelist);
6861 * There are known pf rule leaks when running the test suite.
6864 MPASS(LIST_EMPTY(&V_pf_allrulelist));
6865 MPASS(V_pf_allrulecount == 0);
6870 free(V_pf_kifmarker, PFI_MTYPE);
6871 free(V_pf_rulemarker, M_PFRULE);
6874 /* Free counters last as we updated them during shutdown. */
6875 pf_counter_u64_deinit(&V_pf_default_rule.evaluations);
6876 for (int i = 0; i < 2; i++) {
6877 pf_counter_u64_deinit(&V_pf_default_rule.packets[i]);
6878 pf_counter_u64_deinit(&V_pf_default_rule.bytes[i]);
6880 counter_u64_free(V_pf_default_rule.states_cur);
6881 counter_u64_free(V_pf_default_rule.states_tot);
6882 counter_u64_free(V_pf_default_rule.src_nodes);
6883 uma_zfree_pcpu(pf_timestamp_pcpu_zone, V_pf_default_rule.timestamp);
6885 for (int i = 0; i < PFRES_MAX; i++)
6886 counter_u64_free(V_pf_status.counters[i]);
6887 for (int i = 0; i < KLCNT_MAX; i++)
6888 counter_u64_free(V_pf_status.lcounters[i]);
6889 for (int i = 0; i < FCNT_MAX; i++)
6890 pf_counter_u64_deinit(&V_pf_status.fcounters[i]);
6891 for (int i = 0; i < SCNT_MAX; i++)
6892 counter_u64_free(V_pf_status.scounters[i]);
6894 rm_destroy(&V_pf_rules_lock);
6895 sx_destroy(&V_pf_ioctl_lock);
6902 sx_xlock(&pf_end_lock);
6904 while (pf_end_threads < 2) {
6905 wakeup_one(pf_purge_thread);
6906 sx_sleep(pf_purge_proc, &pf_end_lock, 0, "pftmo", 0);
6908 sx_xunlock(&pf_end_lock);
6911 destroy_dev(pf_dev);
6915 sx_destroy(&pf_end_lock);
6919 vnet_pf_init(void *unused __unused)
6924 VNET_SYSINIT(vnet_pf_init, SI_SUB_PROTO_FIREWALL, SI_ORDER_THIRD,
6925 vnet_pf_init, NULL);
6928 vnet_pf_uninit(const void *unused __unused)
6933 SYSUNINIT(pf_unload, SI_SUB_PROTO_FIREWALL, SI_ORDER_SECOND, pf_unload, NULL);
6934 VNET_SYSUNINIT(vnet_pf_uninit, SI_SUB_PROTO_FIREWALL, SI_ORDER_THIRD,
6935 vnet_pf_uninit, NULL);
6938 pf_modevent(module_t mod, int type, void *data)
6947 /* Handled in SYSUNINIT(pf_unload) to ensure it's done after
6948 * the vnet_pf_uninit()s */
6958 static moduledata_t pf_mod = {
6964 DECLARE_MODULE(pf, pf_mod, SI_SUB_PROTO_FIREWALL, SI_ORDER_SECOND);
6965 MODULE_VERSION(pf, PF_MODVER);