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>
66 #include <sys/socket.h>
67 #include <sys/sysctl.h>
69 #include <sys/ucred.h>
72 #include <net/if_var.h>
74 #include <net/route.h>
76 #include <net/pfvar.h>
77 #include <net/if_pfsync.h>
78 #include <net/if_pflog.h>
80 #include <netinet/in.h>
81 #include <netinet/ip.h>
82 #include <netinet/ip_var.h>
83 #include <netinet6/ip6_var.h>
84 #include <netinet/ip_icmp.h>
87 #include <netinet/ip6.h>
91 #include <net/altq/altq.h>
94 static struct pf_pool *pf_get_pool(char *, u_int32_t, u_int8_t, u_int32_t,
95 u_int8_t, u_int8_t, u_int8_t);
97 static void pf_mv_pool(struct pf_palist *, struct pf_palist *);
98 static void pf_empty_pool(struct pf_palist *);
99 static int pfioctl(struct cdev *, u_long, caddr_t, int,
102 static int pf_begin_altq(u_int32_t *);
103 static int pf_rollback_altq(u_int32_t);
104 static int pf_commit_altq(u_int32_t);
105 static int pf_enable_altq(struct pf_altq *);
106 static int pf_disable_altq(struct pf_altq *);
107 static u_int32_t pf_qname2qid(char *);
108 static void pf_qid_unref(u_int32_t);
110 static int pf_begin_rules(u_int32_t *, int, const char *);
111 static int pf_rollback_rules(u_int32_t, int, char *);
112 static int pf_setup_pfsync_matching(struct pf_ruleset *);
113 static void pf_hash_rule(MD5_CTX *, struct pf_rule *);
114 static void pf_hash_rule_addr(MD5_CTX *, struct pf_rule_addr *);
115 static int pf_commit_rules(u_int32_t, int, char *);
116 static int pf_addr_setup(struct pf_ruleset *,
117 struct pf_addr_wrap *, sa_family_t);
118 static void pf_addr_copyout(struct pf_addr_wrap *);
120 static int pf_export_kaltq(struct pf_altq *,
121 struct pfioc_altq_v1 *, size_t);
122 static int pf_import_kaltq(struct pfioc_altq_v1 *,
123 struct pf_altq *, size_t);
126 VNET_DEFINE(struct pf_rule, pf_default_rule);
129 VNET_DEFINE_STATIC(int, pf_altq_running);
130 #define V_pf_altq_running VNET(pf_altq_running)
133 #define TAGID_MAX 50000
135 TAILQ_ENTRY(pf_tagname) namehash_entries;
136 TAILQ_ENTRY(pf_tagname) taghash_entries;
137 char name[PF_TAG_NAME_SIZE];
143 TAILQ_HEAD(, pf_tagname) *namehash;
144 TAILQ_HEAD(, pf_tagname) *taghash;
147 BITSET_DEFINE(, TAGID_MAX) avail;
150 VNET_DEFINE(struct pf_tagset, pf_tags);
151 #define V_pf_tags VNET(pf_tags)
152 static unsigned int pf_rule_tag_hashsize;
153 #define PF_RULE_TAG_HASH_SIZE_DEFAULT 128
154 SYSCTL_UINT(_net_pf, OID_AUTO, rule_tag_hashsize, CTLFLAG_RDTUN,
155 &pf_rule_tag_hashsize, PF_RULE_TAG_HASH_SIZE_DEFAULT,
156 "Size of pf(4) rule tag hashtable");
159 VNET_DEFINE(struct pf_tagset, pf_qids);
160 #define V_pf_qids VNET(pf_qids)
161 static unsigned int pf_queue_tag_hashsize;
162 #define PF_QUEUE_TAG_HASH_SIZE_DEFAULT 128
163 SYSCTL_UINT(_net_pf, OID_AUTO, queue_tag_hashsize, CTLFLAG_RDTUN,
164 &pf_queue_tag_hashsize, PF_QUEUE_TAG_HASH_SIZE_DEFAULT,
165 "Size of pf(4) queue tag hashtable");
167 VNET_DEFINE(uma_zone_t, pf_tag_z);
168 #define V_pf_tag_z VNET(pf_tag_z)
169 static MALLOC_DEFINE(M_PFALTQ, "pf_altq", "pf(4) altq configuration db");
170 static MALLOC_DEFINE(M_PFRULE, "pf_rule", "pf(4) rules");
172 #if (PF_QNAME_SIZE != PF_TAG_NAME_SIZE)
173 #error PF_QNAME_SIZE must be equal to PF_TAG_NAME_SIZE
176 static void pf_init_tagset(struct pf_tagset *, unsigned int *,
178 static void pf_cleanup_tagset(struct pf_tagset *);
179 static uint16_t tagname2hashindex(const struct pf_tagset *, const char *);
180 static uint16_t tag2hashindex(const struct pf_tagset *, uint16_t);
181 static u_int16_t tagname2tag(struct pf_tagset *, char *);
182 static u_int16_t pf_tagname2tag(char *);
183 static void tag_unref(struct pf_tagset *, u_int16_t);
185 #define DPFPRINTF(n, x) if (V_pf_status.debug >= (n)) printf x
190 * XXX - These are new and need to be checked when moveing to a new version
192 static void pf_clear_states(void);
193 static int pf_clear_tables(void);
194 static void pf_clear_srcnodes(struct pf_src_node *);
195 static void pf_kill_srcnodes(struct pfioc_src_node_kill *);
196 static void pf_tbladdr_copyout(struct pf_addr_wrap *);
199 * Wrapper functions for pfil(9) hooks
202 static pfil_return_t pf_check_in(struct mbuf **m, struct ifnet *ifp,
203 int flags, void *ruleset __unused, struct inpcb *inp);
204 static pfil_return_t pf_check_out(struct mbuf **m, struct ifnet *ifp,
205 int flags, void *ruleset __unused, struct inpcb *inp);
208 static pfil_return_t pf_check6_in(struct mbuf **m, struct ifnet *ifp,
209 int flags, void *ruleset __unused, struct inpcb *inp);
210 static pfil_return_t pf_check6_out(struct mbuf **m, struct ifnet *ifp,
211 int flags, void *ruleset __unused, struct inpcb *inp);
214 static int hook_pf(void);
215 static int dehook_pf(void);
216 static int shutdown_pf(void);
217 static int pf_load(void);
218 static void pf_unload(void);
220 static struct cdevsw pf_cdevsw = {
223 .d_version = D_VERSION,
226 volatile VNET_DEFINE_STATIC(int, pf_pfil_hooked);
227 #define V_pf_pfil_hooked VNET(pf_pfil_hooked)
230 * We need a flag that is neither hooked nor running to know when
231 * the VNET is "valid". We primarily need this to control (global)
232 * external event, e.g., eventhandlers.
234 VNET_DEFINE(int, pf_vnet_active);
235 #define V_pf_vnet_active VNET(pf_vnet_active)
238 struct proc *pf_purge_proc;
240 struct rmlock pf_rules_lock;
241 struct sx pf_ioctl_lock;
242 struct sx pf_end_lock;
245 VNET_DEFINE(pfsync_state_import_t *, pfsync_state_import_ptr);
246 VNET_DEFINE(pfsync_insert_state_t *, pfsync_insert_state_ptr);
247 VNET_DEFINE(pfsync_update_state_t *, pfsync_update_state_ptr);
248 VNET_DEFINE(pfsync_delete_state_t *, pfsync_delete_state_ptr);
249 VNET_DEFINE(pfsync_clear_states_t *, pfsync_clear_states_ptr);
250 VNET_DEFINE(pfsync_defer_t *, pfsync_defer_ptr);
251 pfsync_detach_ifnet_t *pfsync_detach_ifnet_ptr;
254 pflog_packet_t *pflog_packet_ptr = NULL;
256 extern u_long pf_ioctl_maxcount;
261 u_int32_t *my_timeout = V_pf_default_rule.timeout;
265 pfi_initialize_vnet();
268 V_pf_limits[PF_LIMIT_STATES].limit = PFSTATE_HIWAT;
269 V_pf_limits[PF_LIMIT_SRC_NODES].limit = PFSNODE_HIWAT;
271 RB_INIT(&V_pf_anchors);
272 pf_init_ruleset(&pf_main_ruleset);
274 /* default rule should never be garbage collected */
275 V_pf_default_rule.entries.tqe_prev = &V_pf_default_rule.entries.tqe_next;
276 #ifdef PF_DEFAULT_TO_DROP
277 V_pf_default_rule.action = PF_DROP;
279 V_pf_default_rule.action = PF_PASS;
281 V_pf_default_rule.nr = -1;
282 V_pf_default_rule.rtableid = -1;
284 V_pf_default_rule.states_cur = counter_u64_alloc(M_WAITOK);
285 V_pf_default_rule.states_tot = counter_u64_alloc(M_WAITOK);
286 V_pf_default_rule.src_nodes = counter_u64_alloc(M_WAITOK);
288 /* initialize default timeouts */
289 my_timeout[PFTM_TCP_FIRST_PACKET] = PFTM_TCP_FIRST_PACKET_VAL;
290 my_timeout[PFTM_TCP_OPENING] = PFTM_TCP_OPENING_VAL;
291 my_timeout[PFTM_TCP_ESTABLISHED] = PFTM_TCP_ESTABLISHED_VAL;
292 my_timeout[PFTM_TCP_CLOSING] = PFTM_TCP_CLOSING_VAL;
293 my_timeout[PFTM_TCP_FIN_WAIT] = PFTM_TCP_FIN_WAIT_VAL;
294 my_timeout[PFTM_TCP_CLOSED] = PFTM_TCP_CLOSED_VAL;
295 my_timeout[PFTM_UDP_FIRST_PACKET] = PFTM_UDP_FIRST_PACKET_VAL;
296 my_timeout[PFTM_UDP_SINGLE] = PFTM_UDP_SINGLE_VAL;
297 my_timeout[PFTM_UDP_MULTIPLE] = PFTM_UDP_MULTIPLE_VAL;
298 my_timeout[PFTM_ICMP_FIRST_PACKET] = PFTM_ICMP_FIRST_PACKET_VAL;
299 my_timeout[PFTM_ICMP_ERROR_REPLY] = PFTM_ICMP_ERROR_REPLY_VAL;
300 my_timeout[PFTM_OTHER_FIRST_PACKET] = PFTM_OTHER_FIRST_PACKET_VAL;
301 my_timeout[PFTM_OTHER_SINGLE] = PFTM_OTHER_SINGLE_VAL;
302 my_timeout[PFTM_OTHER_MULTIPLE] = PFTM_OTHER_MULTIPLE_VAL;
303 my_timeout[PFTM_FRAG] = PFTM_FRAG_VAL;
304 my_timeout[PFTM_INTERVAL] = PFTM_INTERVAL_VAL;
305 my_timeout[PFTM_SRC_NODE] = PFTM_SRC_NODE_VAL;
306 my_timeout[PFTM_TS_DIFF] = PFTM_TS_DIFF_VAL;
307 my_timeout[PFTM_ADAPTIVE_START] = PFSTATE_ADAPT_START;
308 my_timeout[PFTM_ADAPTIVE_END] = PFSTATE_ADAPT_END;
310 bzero(&V_pf_status, sizeof(V_pf_status));
311 V_pf_status.debug = PF_DEBUG_URGENT;
313 V_pf_pfil_hooked = 0;
315 /* XXX do our best to avoid a conflict */
316 V_pf_status.hostid = arc4random();
318 for (int i = 0; i < PFRES_MAX; i++)
319 V_pf_status.counters[i] = counter_u64_alloc(M_WAITOK);
320 for (int i = 0; i < LCNT_MAX; i++)
321 V_pf_status.lcounters[i] = counter_u64_alloc(M_WAITOK);
322 for (int i = 0; i < FCNT_MAX; i++)
323 V_pf_status.fcounters[i] = counter_u64_alloc(M_WAITOK);
324 for (int i = 0; i < SCNT_MAX; i++)
325 V_pf_status.scounters[i] = counter_u64_alloc(M_WAITOK);
327 if (swi_add(NULL, "pf send", pf_intr, curvnet, SWI_NET,
328 INTR_MPSAFE, &V_pf_swi_cookie) != 0)
329 /* XXXGL: leaked all above. */
334 static struct pf_pool *
335 pf_get_pool(char *anchor, u_int32_t ticket, u_int8_t rule_action,
336 u_int32_t rule_number, u_int8_t r_last, u_int8_t active,
337 u_int8_t check_ticket)
339 struct pf_ruleset *ruleset;
340 struct pf_rule *rule;
343 ruleset = pf_find_ruleset(anchor);
346 rs_num = pf_get_ruleset_number(rule_action);
347 if (rs_num >= PF_RULESET_MAX)
350 if (check_ticket && ticket !=
351 ruleset->rules[rs_num].active.ticket)
354 rule = TAILQ_LAST(ruleset->rules[rs_num].active.ptr,
357 rule = TAILQ_FIRST(ruleset->rules[rs_num].active.ptr);
359 if (check_ticket && ticket !=
360 ruleset->rules[rs_num].inactive.ticket)
363 rule = TAILQ_LAST(ruleset->rules[rs_num].inactive.ptr,
366 rule = TAILQ_FIRST(ruleset->rules[rs_num].inactive.ptr);
369 while ((rule != NULL) && (rule->nr != rule_number))
370 rule = TAILQ_NEXT(rule, entries);
375 return (&rule->rpool);
379 pf_mv_pool(struct pf_palist *poola, struct pf_palist *poolb)
381 struct pf_pooladdr *mv_pool_pa;
383 while ((mv_pool_pa = TAILQ_FIRST(poola)) != NULL) {
384 TAILQ_REMOVE(poola, mv_pool_pa, entries);
385 TAILQ_INSERT_TAIL(poolb, mv_pool_pa, entries);
390 pf_empty_pool(struct pf_palist *poola)
392 struct pf_pooladdr *pa;
394 while ((pa = TAILQ_FIRST(poola)) != NULL) {
395 switch (pa->addr.type) {
396 case PF_ADDR_DYNIFTL:
397 pfi_dynaddr_remove(pa->addr.p.dyn);
400 /* XXX: this could be unfinished pooladdr on pabuf */
401 if (pa->addr.p.tbl != NULL)
402 pfr_detach_table(pa->addr.p.tbl);
406 pfi_kif_unref(pa->kif);
407 TAILQ_REMOVE(poola, pa, entries);
413 pf_unlink_rule(struct pf_rulequeue *rulequeue, struct pf_rule *rule)
418 TAILQ_REMOVE(rulequeue, rule, entries);
420 PF_UNLNKDRULES_LOCK();
421 rule->rule_flag |= PFRULE_REFS;
422 TAILQ_INSERT_TAIL(&V_pf_unlinked_rules, rule, entries);
423 PF_UNLNKDRULES_UNLOCK();
427 pf_free_rule(struct pf_rule *rule)
433 tag_unref(&V_pf_tags, rule->tag);
435 tag_unref(&V_pf_tags, rule->match_tag);
437 if (rule->pqid != rule->qid)
438 pf_qid_unref(rule->pqid);
439 pf_qid_unref(rule->qid);
441 switch (rule->src.addr.type) {
442 case PF_ADDR_DYNIFTL:
443 pfi_dynaddr_remove(rule->src.addr.p.dyn);
446 pfr_detach_table(rule->src.addr.p.tbl);
449 switch (rule->dst.addr.type) {
450 case PF_ADDR_DYNIFTL:
451 pfi_dynaddr_remove(rule->dst.addr.p.dyn);
454 pfr_detach_table(rule->dst.addr.p.tbl);
457 if (rule->overload_tbl)
458 pfr_detach_table(rule->overload_tbl);
460 pfi_kif_unref(rule->kif);
461 pf_anchor_remove(rule);
462 pf_empty_pool(&rule->rpool.list);
463 counter_u64_free(rule->states_cur);
464 counter_u64_free(rule->states_tot);
465 counter_u64_free(rule->src_nodes);
466 free(rule, M_PFRULE);
470 pf_init_tagset(struct pf_tagset *ts, unsigned int *tunable_size,
471 unsigned int default_size)
474 unsigned int hashsize;
476 if (*tunable_size == 0 || !powerof2(*tunable_size))
477 *tunable_size = default_size;
479 hashsize = *tunable_size;
480 ts->namehash = mallocarray(hashsize, sizeof(*ts->namehash), M_PFHASH,
482 ts->taghash = mallocarray(hashsize, sizeof(*ts->taghash), M_PFHASH,
484 ts->mask = hashsize - 1;
485 ts->seed = arc4random();
486 for (i = 0; i < hashsize; i++) {
487 TAILQ_INIT(&ts->namehash[i]);
488 TAILQ_INIT(&ts->taghash[i]);
490 BIT_FILL(TAGID_MAX, &ts->avail);
494 pf_cleanup_tagset(struct pf_tagset *ts)
497 unsigned int hashsize;
498 struct pf_tagname *t, *tmp;
501 * Only need to clean up one of the hashes as each tag is hashed
504 hashsize = ts->mask + 1;
505 for (i = 0; i < hashsize; i++)
506 TAILQ_FOREACH_SAFE(t, &ts->namehash[i], namehash_entries, tmp)
507 uma_zfree(V_pf_tag_z, t);
509 free(ts->namehash, M_PFHASH);
510 free(ts->taghash, M_PFHASH);
514 tagname2hashindex(const struct pf_tagset *ts, const char *tagname)
517 return (murmur3_32_hash(tagname, strlen(tagname), ts->seed) & ts->mask);
521 tag2hashindex(const struct pf_tagset *ts, uint16_t tag)
524 return (tag & ts->mask);
528 tagname2tag(struct pf_tagset *ts, char *tagname)
530 struct pf_tagname *tag;
536 index = tagname2hashindex(ts, tagname);
537 TAILQ_FOREACH(tag, &ts->namehash[index], namehash_entries)
538 if (strcmp(tagname, tag->name) == 0) {
546 * to avoid fragmentation, we do a linear search from the beginning
547 * and take the first free slot we find.
549 new_tagid = BIT_FFS(TAGID_MAX, &ts->avail);
551 * Tags are 1-based, with valid tags in the range [1..TAGID_MAX].
552 * BIT_FFS() returns a 1-based bit number, with 0 indicating no bits
553 * set. It may also return a bit number greater than TAGID_MAX due
554 * to rounding of the number of bits in the vector up to a multiple
555 * of the vector word size at declaration/allocation time.
557 if ((new_tagid == 0) || (new_tagid > TAGID_MAX))
560 /* Mark the tag as in use. Bits are 0-based for BIT_CLR() */
561 BIT_CLR(TAGID_MAX, new_tagid - 1, &ts->avail);
563 /* allocate and fill new struct pf_tagname */
564 tag = uma_zalloc(V_pf_tag_z, M_NOWAIT);
567 strlcpy(tag->name, tagname, sizeof(tag->name));
568 tag->tag = new_tagid;
571 /* Insert into namehash */
572 TAILQ_INSERT_TAIL(&ts->namehash[index], tag, namehash_entries);
574 /* Insert into taghash */
575 index = tag2hashindex(ts, new_tagid);
576 TAILQ_INSERT_TAIL(&ts->taghash[index], tag, taghash_entries);
582 tag_unref(struct pf_tagset *ts, u_int16_t tag)
584 struct pf_tagname *t;
589 index = tag2hashindex(ts, tag);
590 TAILQ_FOREACH(t, &ts->taghash[index], taghash_entries)
593 TAILQ_REMOVE(&ts->taghash[index], t,
595 index = tagname2hashindex(ts, t->name);
596 TAILQ_REMOVE(&ts->namehash[index], t,
598 /* Bits are 0-based for BIT_SET() */
599 BIT_SET(TAGID_MAX, tag - 1, &ts->avail);
600 uma_zfree(V_pf_tag_z, t);
607 pf_tagname2tag(char *tagname)
609 return (tagname2tag(&V_pf_tags, tagname));
614 pf_qname2qid(char *qname)
616 return ((u_int32_t)tagname2tag(&V_pf_qids, qname));
620 pf_qid_unref(u_int32_t qid)
622 tag_unref(&V_pf_qids, (u_int16_t)qid);
626 pf_begin_altq(u_int32_t *ticket)
628 struct pf_altq *altq, *tmp;
633 /* Purge the old altq lists */
634 TAILQ_FOREACH_SAFE(altq, V_pf_altq_ifs_inactive, entries, tmp) {
635 if ((altq->local_flags & PFALTQ_FLAG_IF_REMOVED) == 0) {
636 /* detach and destroy the discipline */
637 error = altq_remove(altq);
639 free(altq, M_PFALTQ);
641 TAILQ_INIT(V_pf_altq_ifs_inactive);
642 TAILQ_FOREACH_SAFE(altq, V_pf_altqs_inactive, entries, tmp) {
643 pf_qid_unref(altq->qid);
644 free(altq, M_PFALTQ);
646 TAILQ_INIT(V_pf_altqs_inactive);
649 *ticket = ++V_ticket_altqs_inactive;
650 V_altqs_inactive_open = 1;
655 pf_rollback_altq(u_int32_t ticket)
657 struct pf_altq *altq, *tmp;
662 if (!V_altqs_inactive_open || ticket != V_ticket_altqs_inactive)
664 /* Purge the old altq lists */
665 TAILQ_FOREACH_SAFE(altq, V_pf_altq_ifs_inactive, entries, tmp) {
666 if ((altq->local_flags & PFALTQ_FLAG_IF_REMOVED) == 0) {
667 /* detach and destroy the discipline */
668 error = altq_remove(altq);
670 free(altq, M_PFALTQ);
672 TAILQ_INIT(V_pf_altq_ifs_inactive);
673 TAILQ_FOREACH_SAFE(altq, V_pf_altqs_inactive, entries, tmp) {
674 pf_qid_unref(altq->qid);
675 free(altq, M_PFALTQ);
677 TAILQ_INIT(V_pf_altqs_inactive);
678 V_altqs_inactive_open = 0;
683 pf_commit_altq(u_int32_t ticket)
685 struct pf_altqqueue *old_altqs, *old_altq_ifs;
686 struct pf_altq *altq, *tmp;
691 if (!V_altqs_inactive_open || ticket != V_ticket_altqs_inactive)
694 /* swap altqs, keep the old. */
695 old_altqs = V_pf_altqs_active;
696 old_altq_ifs = V_pf_altq_ifs_active;
697 V_pf_altqs_active = V_pf_altqs_inactive;
698 V_pf_altq_ifs_active = V_pf_altq_ifs_inactive;
699 V_pf_altqs_inactive = old_altqs;
700 V_pf_altq_ifs_inactive = old_altq_ifs;
701 V_ticket_altqs_active = V_ticket_altqs_inactive;
703 /* Attach new disciplines */
704 TAILQ_FOREACH(altq, V_pf_altq_ifs_active, entries) {
705 if ((altq->local_flags & PFALTQ_FLAG_IF_REMOVED) == 0) {
706 /* attach the discipline */
707 error = altq_pfattach(altq);
708 if (error == 0 && V_pf_altq_running)
709 error = pf_enable_altq(altq);
715 /* Purge the old altq lists */
716 TAILQ_FOREACH_SAFE(altq, V_pf_altq_ifs_inactive, entries, tmp) {
717 if ((altq->local_flags & PFALTQ_FLAG_IF_REMOVED) == 0) {
718 /* detach and destroy the discipline */
719 if (V_pf_altq_running)
720 error = pf_disable_altq(altq);
721 err = altq_pfdetach(altq);
722 if (err != 0 && error == 0)
724 err = altq_remove(altq);
725 if (err != 0 && error == 0)
728 free(altq, M_PFALTQ);
730 TAILQ_INIT(V_pf_altq_ifs_inactive);
731 TAILQ_FOREACH_SAFE(altq, V_pf_altqs_inactive, entries, tmp) {
732 pf_qid_unref(altq->qid);
733 free(altq, M_PFALTQ);
735 TAILQ_INIT(V_pf_altqs_inactive);
737 V_altqs_inactive_open = 0;
742 pf_enable_altq(struct pf_altq *altq)
745 struct tb_profile tb;
748 if ((ifp = ifunit(altq->ifname)) == NULL)
751 if (ifp->if_snd.altq_type != ALTQT_NONE)
752 error = altq_enable(&ifp->if_snd);
754 /* set tokenbucket regulator */
755 if (error == 0 && ifp != NULL && ALTQ_IS_ENABLED(&ifp->if_snd)) {
756 tb.rate = altq->ifbandwidth;
757 tb.depth = altq->tbrsize;
758 error = tbr_set(&ifp->if_snd, &tb);
765 pf_disable_altq(struct pf_altq *altq)
768 struct tb_profile tb;
771 if ((ifp = ifunit(altq->ifname)) == NULL)
775 * when the discipline is no longer referenced, it was overridden
776 * by a new one. if so, just return.
778 if (altq->altq_disc != ifp->if_snd.altq_disc)
781 error = altq_disable(&ifp->if_snd);
784 /* clear tokenbucket regulator */
786 error = tbr_set(&ifp->if_snd, &tb);
793 pf_altq_ifnet_event_add(struct ifnet *ifp, int remove, u_int32_t ticket,
794 struct pf_altq *altq)
799 /* Deactivate the interface in question */
800 altq->local_flags &= ~PFALTQ_FLAG_IF_REMOVED;
801 if ((ifp1 = ifunit(altq->ifname)) == NULL ||
802 (remove && ifp1 == ifp)) {
803 altq->local_flags |= PFALTQ_FLAG_IF_REMOVED;
805 error = altq_add(ifp1, altq);
807 if (ticket != V_ticket_altqs_inactive)
811 free(altq, M_PFALTQ);
818 pf_altq_ifnet_event(struct ifnet *ifp, int remove)
820 struct pf_altq *a1, *a2, *a3;
825 * No need to re-evaluate the configuration for events on interfaces
826 * that do not support ALTQ, as it's not possible for such
827 * interfaces to be part of the configuration.
829 if (!ALTQ_IS_READY(&ifp->if_snd))
832 /* Interrupt userland queue modifications */
833 if (V_altqs_inactive_open)
834 pf_rollback_altq(V_ticket_altqs_inactive);
836 /* Start new altq ruleset */
837 if (pf_begin_altq(&ticket))
840 /* Copy the current active set */
841 TAILQ_FOREACH(a1, V_pf_altq_ifs_active, entries) {
842 a2 = malloc(sizeof(*a2), M_PFALTQ, M_NOWAIT);
847 bcopy(a1, a2, sizeof(struct pf_altq));
849 error = pf_altq_ifnet_event_add(ifp, remove, ticket, a2);
853 TAILQ_INSERT_TAIL(V_pf_altq_ifs_inactive, a2, entries);
857 TAILQ_FOREACH(a1, V_pf_altqs_active, entries) {
858 a2 = malloc(sizeof(*a2), M_PFALTQ, M_NOWAIT);
863 bcopy(a1, a2, sizeof(struct pf_altq));
865 if ((a2->qid = pf_qname2qid(a2->qname)) == 0) {
870 a2->altq_disc = NULL;
871 TAILQ_FOREACH(a3, V_pf_altq_ifs_inactive, entries) {
872 if (strncmp(a3->ifname, a2->ifname,
874 a2->altq_disc = a3->altq_disc;
878 error = pf_altq_ifnet_event_add(ifp, remove, ticket, a2);
882 TAILQ_INSERT_TAIL(V_pf_altqs_inactive, a2, entries);
887 pf_rollback_altq(ticket);
889 pf_commit_altq(ticket);
894 pf_begin_rules(u_int32_t *ticket, int rs_num, const char *anchor)
896 struct pf_ruleset *rs;
897 struct pf_rule *rule;
901 if (rs_num < 0 || rs_num >= PF_RULESET_MAX)
903 rs = pf_find_or_create_ruleset(anchor);
906 while ((rule = TAILQ_FIRST(rs->rules[rs_num].inactive.ptr)) != NULL) {
907 pf_unlink_rule(rs->rules[rs_num].inactive.ptr, rule);
908 rs->rules[rs_num].inactive.rcount--;
910 *ticket = ++rs->rules[rs_num].inactive.ticket;
911 rs->rules[rs_num].inactive.open = 1;
916 pf_rollback_rules(u_int32_t ticket, int rs_num, char *anchor)
918 struct pf_ruleset *rs;
919 struct pf_rule *rule;
923 if (rs_num < 0 || rs_num >= PF_RULESET_MAX)
925 rs = pf_find_ruleset(anchor);
926 if (rs == NULL || !rs->rules[rs_num].inactive.open ||
927 rs->rules[rs_num].inactive.ticket != ticket)
929 while ((rule = TAILQ_FIRST(rs->rules[rs_num].inactive.ptr)) != NULL) {
930 pf_unlink_rule(rs->rules[rs_num].inactive.ptr, rule);
931 rs->rules[rs_num].inactive.rcount--;
933 rs->rules[rs_num].inactive.open = 0;
937 #define PF_MD5_UPD(st, elm) \
938 MD5Update(ctx, (u_int8_t *) &(st)->elm, sizeof((st)->elm))
940 #define PF_MD5_UPD_STR(st, elm) \
941 MD5Update(ctx, (u_int8_t *) (st)->elm, strlen((st)->elm))
943 #define PF_MD5_UPD_HTONL(st, elm, stor) do { \
944 (stor) = htonl((st)->elm); \
945 MD5Update(ctx, (u_int8_t *) &(stor), sizeof(u_int32_t));\
948 #define PF_MD5_UPD_HTONS(st, elm, stor) do { \
949 (stor) = htons((st)->elm); \
950 MD5Update(ctx, (u_int8_t *) &(stor), sizeof(u_int16_t));\
954 pf_hash_rule_addr(MD5_CTX *ctx, struct pf_rule_addr *pfr)
956 PF_MD5_UPD(pfr, addr.type);
957 switch (pfr->addr.type) {
958 case PF_ADDR_DYNIFTL:
959 PF_MD5_UPD(pfr, addr.v.ifname);
960 PF_MD5_UPD(pfr, addr.iflags);
963 PF_MD5_UPD(pfr, addr.v.tblname);
965 case PF_ADDR_ADDRMASK:
967 PF_MD5_UPD(pfr, addr.v.a.addr.addr32);
968 PF_MD5_UPD(pfr, addr.v.a.mask.addr32);
972 PF_MD5_UPD(pfr, port[0]);
973 PF_MD5_UPD(pfr, port[1]);
974 PF_MD5_UPD(pfr, neg);
975 PF_MD5_UPD(pfr, port_op);
979 pf_hash_rule(MD5_CTX *ctx, struct pf_rule *rule)
984 pf_hash_rule_addr(ctx, &rule->src);
985 pf_hash_rule_addr(ctx, &rule->dst);
986 PF_MD5_UPD_STR(rule, label);
987 PF_MD5_UPD_STR(rule, ifname);
988 PF_MD5_UPD_STR(rule, match_tagname);
989 PF_MD5_UPD_HTONS(rule, match_tag, x); /* dup? */
990 PF_MD5_UPD_HTONL(rule, os_fingerprint, y);
991 PF_MD5_UPD_HTONL(rule, prob, y);
992 PF_MD5_UPD_HTONL(rule, uid.uid[0], y);
993 PF_MD5_UPD_HTONL(rule, uid.uid[1], y);
994 PF_MD5_UPD(rule, uid.op);
995 PF_MD5_UPD_HTONL(rule, gid.gid[0], y);
996 PF_MD5_UPD_HTONL(rule, gid.gid[1], y);
997 PF_MD5_UPD(rule, gid.op);
998 PF_MD5_UPD_HTONL(rule, rule_flag, y);
999 PF_MD5_UPD(rule, action);
1000 PF_MD5_UPD(rule, direction);
1001 PF_MD5_UPD(rule, af);
1002 PF_MD5_UPD(rule, quick);
1003 PF_MD5_UPD(rule, ifnot);
1004 PF_MD5_UPD(rule, match_tag_not);
1005 PF_MD5_UPD(rule, natpass);
1006 PF_MD5_UPD(rule, keep_state);
1007 PF_MD5_UPD(rule, proto);
1008 PF_MD5_UPD(rule, type);
1009 PF_MD5_UPD(rule, code);
1010 PF_MD5_UPD(rule, flags);
1011 PF_MD5_UPD(rule, flagset);
1012 PF_MD5_UPD(rule, allow_opts);
1013 PF_MD5_UPD(rule, rt);
1014 PF_MD5_UPD(rule, tos);
1018 pf_commit_rules(u_int32_t ticket, int rs_num, char *anchor)
1020 struct pf_ruleset *rs;
1021 struct pf_rule *rule, **old_array;
1022 struct pf_rulequeue *old_rules;
1024 u_int32_t old_rcount;
1028 if (rs_num < 0 || rs_num >= PF_RULESET_MAX)
1030 rs = pf_find_ruleset(anchor);
1031 if (rs == NULL || !rs->rules[rs_num].inactive.open ||
1032 ticket != rs->rules[rs_num].inactive.ticket)
1035 /* Calculate checksum for the main ruleset */
1036 if (rs == &pf_main_ruleset) {
1037 error = pf_setup_pfsync_matching(rs);
1042 /* Swap rules, keep the old. */
1043 old_rules = rs->rules[rs_num].active.ptr;
1044 old_rcount = rs->rules[rs_num].active.rcount;
1045 old_array = rs->rules[rs_num].active.ptr_array;
1047 rs->rules[rs_num].active.ptr =
1048 rs->rules[rs_num].inactive.ptr;
1049 rs->rules[rs_num].active.ptr_array =
1050 rs->rules[rs_num].inactive.ptr_array;
1051 rs->rules[rs_num].active.rcount =
1052 rs->rules[rs_num].inactive.rcount;
1053 rs->rules[rs_num].inactive.ptr = old_rules;
1054 rs->rules[rs_num].inactive.ptr_array = old_array;
1055 rs->rules[rs_num].inactive.rcount = old_rcount;
1057 rs->rules[rs_num].active.ticket =
1058 rs->rules[rs_num].inactive.ticket;
1059 pf_calc_skip_steps(rs->rules[rs_num].active.ptr);
1062 /* Purge the old rule list. */
1063 while ((rule = TAILQ_FIRST(old_rules)) != NULL)
1064 pf_unlink_rule(old_rules, rule);
1065 if (rs->rules[rs_num].inactive.ptr_array)
1066 free(rs->rules[rs_num].inactive.ptr_array, M_TEMP);
1067 rs->rules[rs_num].inactive.ptr_array = NULL;
1068 rs->rules[rs_num].inactive.rcount = 0;
1069 rs->rules[rs_num].inactive.open = 0;
1070 pf_remove_if_empty_ruleset(rs);
1076 pf_setup_pfsync_matching(struct pf_ruleset *rs)
1079 struct pf_rule *rule;
1081 u_int8_t digest[PF_MD5_DIGEST_LENGTH];
1084 for (rs_cnt = 0; rs_cnt < PF_RULESET_MAX; rs_cnt++) {
1085 /* XXX PF_RULESET_SCRUB as well? */
1086 if (rs_cnt == PF_RULESET_SCRUB)
1089 if (rs->rules[rs_cnt].inactive.ptr_array)
1090 free(rs->rules[rs_cnt].inactive.ptr_array, M_TEMP);
1091 rs->rules[rs_cnt].inactive.ptr_array = NULL;
1093 if (rs->rules[rs_cnt].inactive.rcount) {
1094 rs->rules[rs_cnt].inactive.ptr_array =
1095 malloc(sizeof(caddr_t) *
1096 rs->rules[rs_cnt].inactive.rcount,
1099 if (!rs->rules[rs_cnt].inactive.ptr_array)
1103 TAILQ_FOREACH(rule, rs->rules[rs_cnt].inactive.ptr,
1105 pf_hash_rule(&ctx, rule);
1106 (rs->rules[rs_cnt].inactive.ptr_array)[rule->nr] = rule;
1110 MD5Final(digest, &ctx);
1111 memcpy(V_pf_status.pf_chksum, digest, sizeof(V_pf_status.pf_chksum));
1116 pf_addr_setup(struct pf_ruleset *ruleset, struct pf_addr_wrap *addr,
1121 switch (addr->type) {
1123 addr->p.tbl = pfr_attach_table(ruleset, addr->v.tblname);
1124 if (addr->p.tbl == NULL)
1127 case PF_ADDR_DYNIFTL:
1128 error = pfi_dynaddr_setup(addr, af);
1136 pf_addr_copyout(struct pf_addr_wrap *addr)
1139 switch (addr->type) {
1140 case PF_ADDR_DYNIFTL:
1141 pfi_dynaddr_copyout(addr);
1144 pf_tbladdr_copyout(addr);
1151 * Handle export of struct pf_kaltq to user binaries that may be using any
1152 * version of struct pf_altq.
1155 pf_export_kaltq(struct pf_altq *q, struct pfioc_altq_v1 *pa, size_t ioc_size)
1159 if (ioc_size == sizeof(struct pfioc_altq_v0))
1162 version = pa->version;
1164 if (version > PFIOC_ALTQ_VERSION)
1167 #define ASSIGN(x) exported_q->x = q->x
1169 bcopy(&q->x, &exported_q->x, min(sizeof(q->x), sizeof(exported_q->x)))
1170 #define SATU16(x) (u_int32_t)uqmin((x), USHRT_MAX)
1171 #define SATU32(x) (u_int32_t)uqmin((x), UINT_MAX)
1175 struct pf_altq_v0 *exported_q =
1176 &((struct pfioc_altq_v0 *)pa)->altq;
1182 exported_q->tbrsize = SATU16(q->tbrsize);
1183 exported_q->ifbandwidth = SATU32(q->ifbandwidth);
1188 exported_q->bandwidth = SATU32(q->bandwidth);
1190 ASSIGN(local_flags);
1195 if (q->scheduler == ALTQT_HFSC) {
1196 #define ASSIGN_OPT(x) exported_q->pq_u.hfsc_opts.x = q->pq_u.hfsc_opts.x
1197 #define ASSIGN_OPT_SATU32(x) exported_q->pq_u.hfsc_opts.x = \
1198 SATU32(q->pq_u.hfsc_opts.x)
1200 ASSIGN_OPT_SATU32(rtsc_m1);
1202 ASSIGN_OPT_SATU32(rtsc_m2);
1204 ASSIGN_OPT_SATU32(lssc_m1);
1206 ASSIGN_OPT_SATU32(lssc_m2);
1208 ASSIGN_OPT_SATU32(ulsc_m1);
1210 ASSIGN_OPT_SATU32(ulsc_m2);
1215 #undef ASSIGN_OPT_SATU32
1223 struct pf_altq_v1 *exported_q =
1224 &((struct pfioc_altq_v1 *)pa)->altq;
1230 ASSIGN(ifbandwidth);
1237 ASSIGN(local_flags);
1247 panic("%s: unhandled struct pfioc_altq version", __func__);
1260 * Handle import to struct pf_kaltq of struct pf_altq from user binaries
1261 * that may be using any version of it.
1264 pf_import_kaltq(struct pfioc_altq_v1 *pa, struct pf_altq *q, size_t ioc_size)
1268 if (ioc_size == sizeof(struct pfioc_altq_v0))
1271 version = pa->version;
1273 if (version > PFIOC_ALTQ_VERSION)
1276 #define ASSIGN(x) q->x = imported_q->x
1278 bcopy(&imported_q->x, &q->x, min(sizeof(imported_q->x), sizeof(q->x)))
1282 struct pf_altq_v0 *imported_q =
1283 &((struct pfioc_altq_v0 *)pa)->altq;
1288 ASSIGN(tbrsize); /* 16-bit -> 32-bit */
1289 ASSIGN(ifbandwidth); /* 32-bit -> 64-bit */
1294 ASSIGN(bandwidth); /* 32-bit -> 64-bit */
1296 ASSIGN(local_flags);
1301 if (imported_q->scheduler == ALTQT_HFSC) {
1302 #define ASSIGN_OPT(x) q->pq_u.hfsc_opts.x = imported_q->pq_u.hfsc_opts.x
1305 * The m1 and m2 parameters are being copied from
1308 ASSIGN_OPT(rtsc_m1);
1310 ASSIGN_OPT(rtsc_m2);
1312 ASSIGN_OPT(lssc_m1);
1314 ASSIGN_OPT(lssc_m2);
1316 ASSIGN_OPT(ulsc_m1);
1318 ASSIGN_OPT(ulsc_m2);
1330 struct pf_altq_v1 *imported_q =
1331 &((struct pfioc_altq_v1 *)pa)->altq;
1337 ASSIGN(ifbandwidth);
1344 ASSIGN(local_flags);
1354 panic("%s: unhandled struct pfioc_altq version", __func__);
1364 static struct pf_altq *
1365 pf_altq_get_nth_active(u_int32_t n)
1367 struct pf_altq *altq;
1371 TAILQ_FOREACH(altq, V_pf_altq_ifs_active, entries) {
1377 TAILQ_FOREACH(altq, V_pf_altqs_active, entries) {
1388 pfioctl(struct cdev *dev, u_long cmd, caddr_t addr, int flags, struct thread *td)
1391 PF_RULES_RLOCK_TRACKER;
1393 /* XXX keep in sync with switch() below */
1394 if (securelevel_gt(td->td_ucred, 2))
1401 case DIOCSETSTATUSIF:
1407 case DIOCGETTIMEOUT:
1408 case DIOCCLRRULECTRS:
1410 case DIOCGETALTQSV0:
1411 case DIOCGETALTQSV1:
1414 case DIOCGETQSTATSV0:
1415 case DIOCGETQSTATSV1:
1416 case DIOCGETRULESETS:
1417 case DIOCGETRULESET:
1418 case DIOCRGETTABLES:
1419 case DIOCRGETTSTATS:
1420 case DIOCRCLRTSTATS:
1426 case DIOCRGETASTATS:
1427 case DIOCRCLRASTATS:
1430 case DIOCGETSRCNODES:
1431 case DIOCCLRSRCNODES:
1432 case DIOCIGETIFACES:
1433 case DIOCGIFSPEEDV0:
1434 case DIOCGIFSPEEDV1:
1438 case DIOCRCLRTABLES:
1439 case DIOCRADDTABLES:
1440 case DIOCRDELTABLES:
1441 case DIOCRSETTFLAGS:
1442 if (((struct pfioc_table *)addr)->pfrio_flags &
1444 break; /* dummy operation ok */
1450 if (!(flags & FWRITE))
1458 case DIOCGETTIMEOUT:
1460 case DIOCGETALTQSV0:
1461 case DIOCGETALTQSV1:
1464 case DIOCGETQSTATSV0:
1465 case DIOCGETQSTATSV1:
1466 case DIOCGETRULESETS:
1467 case DIOCGETRULESET:
1469 case DIOCRGETTABLES:
1470 case DIOCRGETTSTATS:
1472 case DIOCRGETASTATS:
1475 case DIOCGETSRCNODES:
1476 case DIOCIGETIFACES:
1477 case DIOCGIFSPEEDV1:
1478 case DIOCGIFSPEEDV0:
1480 case DIOCRCLRTABLES:
1481 case DIOCRADDTABLES:
1482 case DIOCRDELTABLES:
1483 case DIOCRCLRTSTATS:
1488 case DIOCRSETTFLAGS:
1489 if (((struct pfioc_table *)addr)->pfrio_flags &
1491 flags |= FWRITE; /* need write lock for dummy */
1492 break; /* dummy operation ok */
1496 if (((struct pfioc_rule *)addr)->action ==
1504 CURVNET_SET(TD_TO_VNET(td));
1508 sx_xlock(&pf_ioctl_lock);
1509 if (V_pf_status.running)
1516 DPFPRINTF(PF_DEBUG_MISC,
1517 ("pf: pfil registration failed\n"));
1520 V_pf_status.running = 1;
1521 V_pf_status.since = time_second;
1524 V_pf_stateid[cpu] = time_second;
1526 DPFPRINTF(PF_DEBUG_MISC, ("pf: started\n"));
1531 sx_xlock(&pf_ioctl_lock);
1532 if (!V_pf_status.running)
1535 V_pf_status.running = 0;
1536 error = dehook_pf();
1538 V_pf_status.running = 1;
1539 DPFPRINTF(PF_DEBUG_MISC,
1540 ("pf: pfil unregistration failed\n"));
1542 V_pf_status.since = time_second;
1543 DPFPRINTF(PF_DEBUG_MISC, ("pf: stopped\n"));
1548 struct pfioc_rule *pr = (struct pfioc_rule *)addr;
1549 struct pf_ruleset *ruleset;
1550 struct pf_rule *rule, *tail;
1551 struct pf_pooladdr *pa;
1552 struct pfi_kif *kif = NULL;
1555 if (pr->rule.return_icmp >> 8 > ICMP_MAXTYPE) {
1560 if (pr->rule.af == AF_INET) {
1561 error = EAFNOSUPPORT;
1566 if (pr->rule.af == AF_INET6) {
1567 error = EAFNOSUPPORT;
1572 rule = malloc(sizeof(*rule), M_PFRULE, M_WAITOK);
1573 bcopy(&pr->rule, rule, sizeof(struct pf_rule));
1574 if (rule->ifname[0])
1575 kif = malloc(sizeof(*kif), PFI_MTYPE, M_WAITOK);
1576 rule->states_cur = counter_u64_alloc(M_WAITOK);
1577 rule->states_tot = counter_u64_alloc(M_WAITOK);
1578 rule->src_nodes = counter_u64_alloc(M_WAITOK);
1579 rule->cuid = td->td_ucred->cr_ruid;
1580 rule->cpid = td->td_proc ? td->td_proc->p_pid : 0;
1581 TAILQ_INIT(&rule->rpool.list);
1583 #define ERROUT(x) { error = (x); goto DIOCADDRULE_error; }
1586 pr->anchor[sizeof(pr->anchor) - 1] = 0;
1587 ruleset = pf_find_ruleset(pr->anchor);
1588 if (ruleset == NULL)
1590 rs_num = pf_get_ruleset_number(pr->rule.action);
1591 if (rs_num >= PF_RULESET_MAX)
1593 if (pr->ticket != ruleset->rules[rs_num].inactive.ticket) {
1594 DPFPRINTF(PF_DEBUG_MISC,
1595 ("ticket: %d != [%d]%d\n", pr->ticket, rs_num,
1596 ruleset->rules[rs_num].inactive.ticket));
1599 if (pr->pool_ticket != V_ticket_pabuf) {
1600 DPFPRINTF(PF_DEBUG_MISC,
1601 ("pool_ticket: %d != %d\n", pr->pool_ticket,
1606 tail = TAILQ_LAST(ruleset->rules[rs_num].inactive.ptr,
1609 rule->nr = tail->nr + 1;
1612 if (rule->ifname[0]) {
1613 rule->kif = pfi_kif_attach(kif, rule->ifname);
1614 pfi_kif_ref(rule->kif);
1618 if (rule->rtableid > 0 && rule->rtableid >= rt_numfibs)
1623 if (rule->qname[0] != 0) {
1624 if ((rule->qid = pf_qname2qid(rule->qname)) == 0)
1626 else if (rule->pqname[0] != 0) {
1628 pf_qname2qid(rule->pqname)) == 0)
1631 rule->pqid = rule->qid;
1634 if (rule->tagname[0])
1635 if ((rule->tag = pf_tagname2tag(rule->tagname)) == 0)
1637 if (rule->match_tagname[0])
1638 if ((rule->match_tag =
1639 pf_tagname2tag(rule->match_tagname)) == 0)
1641 if (rule->rt && !rule->direction)
1645 if (rule->logif >= PFLOGIFS_MAX)
1647 if (pf_addr_setup(ruleset, &rule->src.addr, rule->af))
1649 if (pf_addr_setup(ruleset, &rule->dst.addr, rule->af))
1651 if (pf_anchor_setup(rule, ruleset, pr->anchor_call))
1653 if (rule->scrub_flags & PFSTATE_SETPRIO &&
1654 (rule->set_prio[0] > PF_PRIO_MAX ||
1655 rule->set_prio[1] > PF_PRIO_MAX))
1657 TAILQ_FOREACH(pa, &V_pf_pabuf, entries)
1658 if (pa->addr.type == PF_ADDR_TABLE) {
1659 pa->addr.p.tbl = pfr_attach_table(ruleset,
1660 pa->addr.v.tblname);
1661 if (pa->addr.p.tbl == NULL)
1665 rule->overload_tbl = NULL;
1666 if (rule->overload_tblname[0]) {
1667 if ((rule->overload_tbl = pfr_attach_table(ruleset,
1668 rule->overload_tblname)) == NULL)
1671 rule->overload_tbl->pfrkt_flags |=
1675 pf_mv_pool(&V_pf_pabuf, &rule->rpool.list);
1676 if (((((rule->action == PF_NAT) || (rule->action == PF_RDR) ||
1677 (rule->action == PF_BINAT)) && rule->anchor == NULL) ||
1678 (rule->rt > PF_NOPFROUTE)) &&
1679 (TAILQ_FIRST(&rule->rpool.list) == NULL))
1688 rule->rpool.cur = TAILQ_FIRST(&rule->rpool.list);
1689 rule->evaluations = rule->packets[0] = rule->packets[1] =
1690 rule->bytes[0] = rule->bytes[1] = 0;
1691 TAILQ_INSERT_TAIL(ruleset->rules[rs_num].inactive.ptr,
1693 ruleset->rules[rs_num].inactive.rcount++;
1700 counter_u64_free(rule->states_cur);
1701 counter_u64_free(rule->states_tot);
1702 counter_u64_free(rule->src_nodes);
1703 free(rule, M_PFRULE);
1705 free(kif, PFI_MTYPE);
1709 case DIOCGETRULES: {
1710 struct pfioc_rule *pr = (struct pfioc_rule *)addr;
1711 struct pf_ruleset *ruleset;
1712 struct pf_rule *tail;
1716 pr->anchor[sizeof(pr->anchor) - 1] = 0;
1717 ruleset = pf_find_ruleset(pr->anchor);
1718 if (ruleset == NULL) {
1723 rs_num = pf_get_ruleset_number(pr->rule.action);
1724 if (rs_num >= PF_RULESET_MAX) {
1729 tail = TAILQ_LAST(ruleset->rules[rs_num].active.ptr,
1732 pr->nr = tail->nr + 1;
1735 pr->ticket = ruleset->rules[rs_num].active.ticket;
1741 struct pfioc_rule *pr = (struct pfioc_rule *)addr;
1742 struct pf_ruleset *ruleset;
1743 struct pf_rule *rule;
1747 pr->anchor[sizeof(pr->anchor) - 1] = 0;
1748 ruleset = pf_find_ruleset(pr->anchor);
1749 if (ruleset == NULL) {
1754 rs_num = pf_get_ruleset_number(pr->rule.action);
1755 if (rs_num >= PF_RULESET_MAX) {
1760 if (pr->ticket != ruleset->rules[rs_num].active.ticket) {
1765 rule = TAILQ_FIRST(ruleset->rules[rs_num].active.ptr);
1766 while ((rule != NULL) && (rule->nr != pr->nr))
1767 rule = TAILQ_NEXT(rule, entries);
1773 bcopy(rule, &pr->rule, sizeof(struct pf_rule));
1774 pr->rule.u_states_cur = counter_u64_fetch(rule->states_cur);
1775 pr->rule.u_states_tot = counter_u64_fetch(rule->states_tot);
1776 pr->rule.u_src_nodes = counter_u64_fetch(rule->src_nodes);
1777 if (pf_anchor_copyout(ruleset, rule, pr)) {
1782 pf_addr_copyout(&pr->rule.src.addr);
1783 pf_addr_copyout(&pr->rule.dst.addr);
1784 for (i = 0; i < PF_SKIP_COUNT; ++i)
1785 if (rule->skip[i].ptr == NULL)
1786 pr->rule.skip[i].nr = -1;
1788 pr->rule.skip[i].nr =
1789 rule->skip[i].ptr->nr;
1791 if (pr->action == PF_GET_CLR_CNTR) {
1792 rule->evaluations = 0;
1793 rule->packets[0] = rule->packets[1] = 0;
1794 rule->bytes[0] = rule->bytes[1] = 0;
1795 counter_u64_zero(rule->states_tot);
1801 case DIOCCHANGERULE: {
1802 struct pfioc_rule *pcr = (struct pfioc_rule *)addr;
1803 struct pf_ruleset *ruleset;
1804 struct pf_rule *oldrule = NULL, *newrule = NULL;
1805 struct pfi_kif *kif = NULL;
1806 struct pf_pooladdr *pa;
1810 if (pcr->action < PF_CHANGE_ADD_HEAD ||
1811 pcr->action > PF_CHANGE_GET_TICKET) {
1815 if (pcr->rule.return_icmp >> 8 > ICMP_MAXTYPE) {
1820 if (pcr->action != PF_CHANGE_REMOVE) {
1822 if (pcr->rule.af == AF_INET) {
1823 error = EAFNOSUPPORT;
1828 if (pcr->rule.af == AF_INET6) {
1829 error = EAFNOSUPPORT;
1833 newrule = malloc(sizeof(*newrule), M_PFRULE, M_WAITOK);
1834 bcopy(&pcr->rule, newrule, sizeof(struct pf_rule));
1835 if (newrule->ifname[0])
1836 kif = malloc(sizeof(*kif), PFI_MTYPE, M_WAITOK);
1837 newrule->states_cur = counter_u64_alloc(M_WAITOK);
1838 newrule->states_tot = counter_u64_alloc(M_WAITOK);
1839 newrule->src_nodes = counter_u64_alloc(M_WAITOK);
1840 newrule->cuid = td->td_ucred->cr_ruid;
1841 newrule->cpid = td->td_proc ? td->td_proc->p_pid : 0;
1842 TAILQ_INIT(&newrule->rpool.list);
1845 #define ERROUT(x) { error = (x); goto DIOCCHANGERULE_error; }
1848 if (!(pcr->action == PF_CHANGE_REMOVE ||
1849 pcr->action == PF_CHANGE_GET_TICKET) &&
1850 pcr->pool_ticket != V_ticket_pabuf)
1853 ruleset = pf_find_ruleset(pcr->anchor);
1854 if (ruleset == NULL)
1857 rs_num = pf_get_ruleset_number(pcr->rule.action);
1858 if (rs_num >= PF_RULESET_MAX)
1861 if (pcr->action == PF_CHANGE_GET_TICKET) {
1862 pcr->ticket = ++ruleset->rules[rs_num].active.ticket;
1864 } else if (pcr->ticket !=
1865 ruleset->rules[rs_num].active.ticket)
1868 if (pcr->action != PF_CHANGE_REMOVE) {
1869 if (newrule->ifname[0]) {
1870 newrule->kif = pfi_kif_attach(kif,
1872 pfi_kif_ref(newrule->kif);
1874 newrule->kif = NULL;
1876 if (newrule->rtableid > 0 &&
1877 newrule->rtableid >= rt_numfibs)
1882 if (newrule->qname[0] != 0) {
1884 pf_qname2qid(newrule->qname)) == 0)
1886 else if (newrule->pqname[0] != 0) {
1887 if ((newrule->pqid =
1888 pf_qname2qid(newrule->pqname)) == 0)
1891 newrule->pqid = newrule->qid;
1894 if (newrule->tagname[0])
1896 pf_tagname2tag(newrule->tagname)) == 0)
1898 if (newrule->match_tagname[0])
1899 if ((newrule->match_tag = pf_tagname2tag(
1900 newrule->match_tagname)) == 0)
1902 if (newrule->rt && !newrule->direction)
1906 if (newrule->logif >= PFLOGIFS_MAX)
1908 if (pf_addr_setup(ruleset, &newrule->src.addr, newrule->af))
1910 if (pf_addr_setup(ruleset, &newrule->dst.addr, newrule->af))
1912 if (pf_anchor_setup(newrule, ruleset, pcr->anchor_call))
1914 TAILQ_FOREACH(pa, &V_pf_pabuf, entries)
1915 if (pa->addr.type == PF_ADDR_TABLE) {
1917 pfr_attach_table(ruleset,
1918 pa->addr.v.tblname);
1919 if (pa->addr.p.tbl == NULL)
1923 newrule->overload_tbl = NULL;
1924 if (newrule->overload_tblname[0]) {
1925 if ((newrule->overload_tbl = pfr_attach_table(
1926 ruleset, newrule->overload_tblname)) ==
1930 newrule->overload_tbl->pfrkt_flags |=
1934 pf_mv_pool(&V_pf_pabuf, &newrule->rpool.list);
1935 if (((((newrule->action == PF_NAT) ||
1936 (newrule->action == PF_RDR) ||
1937 (newrule->action == PF_BINAT) ||
1938 (newrule->rt > PF_NOPFROUTE)) &&
1939 !newrule->anchor)) &&
1940 (TAILQ_FIRST(&newrule->rpool.list) == NULL))
1944 pf_free_rule(newrule);
1949 newrule->rpool.cur = TAILQ_FIRST(&newrule->rpool.list);
1950 newrule->evaluations = 0;
1951 newrule->packets[0] = newrule->packets[1] = 0;
1952 newrule->bytes[0] = newrule->bytes[1] = 0;
1954 pf_empty_pool(&V_pf_pabuf);
1956 if (pcr->action == PF_CHANGE_ADD_HEAD)
1957 oldrule = TAILQ_FIRST(
1958 ruleset->rules[rs_num].active.ptr);
1959 else if (pcr->action == PF_CHANGE_ADD_TAIL)
1960 oldrule = TAILQ_LAST(
1961 ruleset->rules[rs_num].active.ptr, pf_rulequeue);
1963 oldrule = TAILQ_FIRST(
1964 ruleset->rules[rs_num].active.ptr);
1965 while ((oldrule != NULL) && (oldrule->nr != pcr->nr))
1966 oldrule = TAILQ_NEXT(oldrule, entries);
1967 if (oldrule == NULL) {
1968 if (newrule != NULL)
1969 pf_free_rule(newrule);
1976 if (pcr->action == PF_CHANGE_REMOVE) {
1977 pf_unlink_rule(ruleset->rules[rs_num].active.ptr,
1979 ruleset->rules[rs_num].active.rcount--;
1981 if (oldrule == NULL)
1983 ruleset->rules[rs_num].active.ptr,
1985 else if (pcr->action == PF_CHANGE_ADD_HEAD ||
1986 pcr->action == PF_CHANGE_ADD_BEFORE)
1987 TAILQ_INSERT_BEFORE(oldrule, newrule, entries);
1990 ruleset->rules[rs_num].active.ptr,
1991 oldrule, newrule, entries);
1992 ruleset->rules[rs_num].active.rcount++;
1996 TAILQ_FOREACH(oldrule,
1997 ruleset->rules[rs_num].active.ptr, entries)
2000 ruleset->rules[rs_num].active.ticket++;
2002 pf_calc_skip_steps(ruleset->rules[rs_num].active.ptr);
2003 pf_remove_if_empty_ruleset(ruleset);
2009 DIOCCHANGERULE_error:
2011 if (newrule != NULL) {
2012 counter_u64_free(newrule->states_cur);
2013 counter_u64_free(newrule->states_tot);
2014 counter_u64_free(newrule->src_nodes);
2015 free(newrule, M_PFRULE);
2018 free(kif, PFI_MTYPE);
2022 case DIOCCLRSTATES: {
2024 struct pfioc_state_kill *psk = (struct pfioc_state_kill *)addr;
2025 u_int i, killed = 0;
2027 for (i = 0; i <= pf_hashmask; i++) {
2028 struct pf_idhash *ih = &V_pf_idhash[i];
2030 relock_DIOCCLRSTATES:
2031 PF_HASHROW_LOCK(ih);
2032 LIST_FOREACH(s, &ih->states, entry)
2033 if (!psk->psk_ifname[0] ||
2034 !strcmp(psk->psk_ifname,
2035 s->kif->pfik_name)) {
2037 * Don't send out individual
2040 s->state_flags |= PFSTATE_NOSYNC;
2041 pf_unlink_state(s, PF_ENTER_LOCKED);
2043 goto relock_DIOCCLRSTATES;
2045 PF_HASHROW_UNLOCK(ih);
2047 psk->psk_killed = killed;
2048 if (V_pfsync_clear_states_ptr != NULL)
2049 V_pfsync_clear_states_ptr(V_pf_status.hostid, psk->psk_ifname);
2053 case DIOCKILLSTATES: {
2055 struct pf_state_key *sk;
2056 struct pf_addr *srcaddr, *dstaddr;
2057 u_int16_t srcport, dstport;
2058 struct pfioc_state_kill *psk = (struct pfioc_state_kill *)addr;
2059 u_int i, killed = 0;
2061 if (psk->psk_pfcmp.id) {
2062 if (psk->psk_pfcmp.creatorid == 0)
2063 psk->psk_pfcmp.creatorid = V_pf_status.hostid;
2064 if ((s = pf_find_state_byid(psk->psk_pfcmp.id,
2065 psk->psk_pfcmp.creatorid))) {
2066 pf_unlink_state(s, PF_ENTER_LOCKED);
2067 psk->psk_killed = 1;
2072 for (i = 0; i <= pf_hashmask; i++) {
2073 struct pf_idhash *ih = &V_pf_idhash[i];
2075 relock_DIOCKILLSTATES:
2076 PF_HASHROW_LOCK(ih);
2077 LIST_FOREACH(s, &ih->states, entry) {
2078 sk = s->key[PF_SK_WIRE];
2079 if (s->direction == PF_OUT) {
2080 srcaddr = &sk->addr[1];
2081 dstaddr = &sk->addr[0];
2082 srcport = sk->port[1];
2083 dstport = sk->port[0];
2085 srcaddr = &sk->addr[0];
2086 dstaddr = &sk->addr[1];
2087 srcport = sk->port[0];
2088 dstport = sk->port[1];
2091 if ((!psk->psk_af || sk->af == psk->psk_af)
2092 && (!psk->psk_proto || psk->psk_proto ==
2094 PF_MATCHA(psk->psk_src.neg,
2095 &psk->psk_src.addr.v.a.addr,
2096 &psk->psk_src.addr.v.a.mask,
2098 PF_MATCHA(psk->psk_dst.neg,
2099 &psk->psk_dst.addr.v.a.addr,
2100 &psk->psk_dst.addr.v.a.mask,
2102 (psk->psk_src.port_op == 0 ||
2103 pf_match_port(psk->psk_src.port_op,
2104 psk->psk_src.port[0], psk->psk_src.port[1],
2106 (psk->psk_dst.port_op == 0 ||
2107 pf_match_port(psk->psk_dst.port_op,
2108 psk->psk_dst.port[0], psk->psk_dst.port[1],
2110 (!psk->psk_label[0] ||
2111 (s->rule.ptr->label[0] &&
2112 !strcmp(psk->psk_label,
2113 s->rule.ptr->label))) &&
2114 (!psk->psk_ifname[0] ||
2115 !strcmp(psk->psk_ifname,
2116 s->kif->pfik_name))) {
2117 pf_unlink_state(s, PF_ENTER_LOCKED);
2119 goto relock_DIOCKILLSTATES;
2122 PF_HASHROW_UNLOCK(ih);
2124 psk->psk_killed = killed;
2128 case DIOCADDSTATE: {
2129 struct pfioc_state *ps = (struct pfioc_state *)addr;
2130 struct pfsync_state *sp = &ps->state;
2132 if (sp->timeout >= PFTM_MAX) {
2136 if (V_pfsync_state_import_ptr != NULL) {
2138 error = V_pfsync_state_import_ptr(sp, PFSYNC_SI_IOCTL);
2145 case DIOCGETSTATE: {
2146 struct pfioc_state *ps = (struct pfioc_state *)addr;
2149 s = pf_find_state_byid(ps->state.id, ps->state.creatorid);
2155 pfsync_state_export(&ps->state, s);
2160 case DIOCGETSTATES: {
2161 struct pfioc_states *ps = (struct pfioc_states *)addr;
2163 struct pfsync_state *pstore, *p;
2166 if (ps->ps_len == 0) {
2167 nr = uma_zone_get_cur(V_pf_state_z);
2168 ps->ps_len = sizeof(struct pfsync_state) * nr;
2172 p = pstore = malloc(ps->ps_len, M_TEMP, M_WAITOK);
2175 for (i = 0; i <= pf_hashmask; i++) {
2176 struct pf_idhash *ih = &V_pf_idhash[i];
2178 PF_HASHROW_LOCK(ih);
2179 LIST_FOREACH(s, &ih->states, entry) {
2181 if (s->timeout == PFTM_UNLINKED)
2184 if ((nr+1) * sizeof(*p) > ps->ps_len) {
2185 PF_HASHROW_UNLOCK(ih);
2186 goto DIOCGETSTATES_full;
2188 pfsync_state_export(p, s);
2192 PF_HASHROW_UNLOCK(ih);
2195 error = copyout(pstore, ps->ps_states,
2196 sizeof(struct pfsync_state) * nr);
2198 free(pstore, M_TEMP);
2201 ps->ps_len = sizeof(struct pfsync_state) * nr;
2202 free(pstore, M_TEMP);
2207 case DIOCGETSTATUS: {
2208 struct pf_status *s = (struct pf_status *)addr;
2211 s->running = V_pf_status.running;
2212 s->since = V_pf_status.since;
2213 s->debug = V_pf_status.debug;
2214 s->hostid = V_pf_status.hostid;
2215 s->states = V_pf_status.states;
2216 s->src_nodes = V_pf_status.src_nodes;
2218 for (int i = 0; i < PFRES_MAX; i++)
2220 counter_u64_fetch(V_pf_status.counters[i]);
2221 for (int i = 0; i < LCNT_MAX; i++)
2223 counter_u64_fetch(V_pf_status.lcounters[i]);
2224 for (int i = 0; i < FCNT_MAX; i++)
2226 counter_u64_fetch(V_pf_status.fcounters[i]);
2227 for (int i = 0; i < SCNT_MAX; i++)
2229 counter_u64_fetch(V_pf_status.scounters[i]);
2231 bcopy(V_pf_status.ifname, s->ifname, IFNAMSIZ);
2232 bcopy(V_pf_status.pf_chksum, s->pf_chksum,
2233 PF_MD5_DIGEST_LENGTH);
2235 pfi_update_status(s->ifname, s);
2240 case DIOCSETSTATUSIF: {
2241 struct pfioc_if *pi = (struct pfioc_if *)addr;
2243 if (pi->ifname[0] == 0) {
2244 bzero(V_pf_status.ifname, IFNAMSIZ);
2248 strlcpy(V_pf_status.ifname, pi->ifname, IFNAMSIZ);
2253 case DIOCCLRSTATUS: {
2255 for (int i = 0; i < PFRES_MAX; i++)
2256 counter_u64_zero(V_pf_status.counters[i]);
2257 for (int i = 0; i < FCNT_MAX; i++)
2258 counter_u64_zero(V_pf_status.fcounters[i]);
2259 for (int i = 0; i < SCNT_MAX; i++)
2260 counter_u64_zero(V_pf_status.scounters[i]);
2261 for (int i = 0; i < LCNT_MAX; i++)
2262 counter_u64_zero(V_pf_status.lcounters[i]);
2263 V_pf_status.since = time_second;
2264 if (*V_pf_status.ifname)
2265 pfi_update_status(V_pf_status.ifname, NULL);
2271 struct pfioc_natlook *pnl = (struct pfioc_natlook *)addr;
2272 struct pf_state_key *sk;
2273 struct pf_state *state;
2274 struct pf_state_key_cmp key;
2275 int m = 0, direction = pnl->direction;
2278 /* NATLOOK src and dst are reversed, so reverse sidx/didx */
2279 sidx = (direction == PF_IN) ? 1 : 0;
2280 didx = (direction == PF_IN) ? 0 : 1;
2283 PF_AZERO(&pnl->saddr, pnl->af) ||
2284 PF_AZERO(&pnl->daddr, pnl->af) ||
2285 ((pnl->proto == IPPROTO_TCP ||
2286 pnl->proto == IPPROTO_UDP) &&
2287 (!pnl->dport || !pnl->sport)))
2290 bzero(&key, sizeof(key));
2292 key.proto = pnl->proto;
2293 PF_ACPY(&key.addr[sidx], &pnl->saddr, pnl->af);
2294 key.port[sidx] = pnl->sport;
2295 PF_ACPY(&key.addr[didx], &pnl->daddr, pnl->af);
2296 key.port[didx] = pnl->dport;
2298 state = pf_find_state_all(&key, direction, &m);
2301 error = E2BIG; /* more than one state */
2302 else if (state != NULL) {
2303 /* XXXGL: not locked read */
2304 sk = state->key[sidx];
2305 PF_ACPY(&pnl->rsaddr, &sk->addr[sidx], sk->af);
2306 pnl->rsport = sk->port[sidx];
2307 PF_ACPY(&pnl->rdaddr, &sk->addr[didx], sk->af);
2308 pnl->rdport = sk->port[didx];
2315 case DIOCSETTIMEOUT: {
2316 struct pfioc_tm *pt = (struct pfioc_tm *)addr;
2319 if (pt->timeout < 0 || pt->timeout >= PFTM_MAX ||
2325 old = V_pf_default_rule.timeout[pt->timeout];
2326 if (pt->timeout == PFTM_INTERVAL && pt->seconds == 0)
2328 V_pf_default_rule.timeout[pt->timeout] = pt->seconds;
2329 if (pt->timeout == PFTM_INTERVAL && pt->seconds < old)
2330 wakeup(pf_purge_thread);
2336 case DIOCGETTIMEOUT: {
2337 struct pfioc_tm *pt = (struct pfioc_tm *)addr;
2339 if (pt->timeout < 0 || pt->timeout >= PFTM_MAX) {
2344 pt->seconds = V_pf_default_rule.timeout[pt->timeout];
2349 case DIOCGETLIMIT: {
2350 struct pfioc_limit *pl = (struct pfioc_limit *)addr;
2352 if (pl->index < 0 || pl->index >= PF_LIMIT_MAX) {
2357 pl->limit = V_pf_limits[pl->index].limit;
2362 case DIOCSETLIMIT: {
2363 struct pfioc_limit *pl = (struct pfioc_limit *)addr;
2367 if (pl->index < 0 || pl->index >= PF_LIMIT_MAX ||
2368 V_pf_limits[pl->index].zone == NULL) {
2373 uma_zone_set_max(V_pf_limits[pl->index].zone, pl->limit);
2374 old_limit = V_pf_limits[pl->index].limit;
2375 V_pf_limits[pl->index].limit = pl->limit;
2376 pl->limit = old_limit;
2381 case DIOCSETDEBUG: {
2382 u_int32_t *level = (u_int32_t *)addr;
2385 V_pf_status.debug = *level;
2390 case DIOCCLRRULECTRS: {
2391 /* obsoleted by DIOCGETRULE with action=PF_GET_CLR_CNTR */
2392 struct pf_ruleset *ruleset = &pf_main_ruleset;
2393 struct pf_rule *rule;
2397 ruleset->rules[PF_RULESET_FILTER].active.ptr, entries) {
2398 rule->evaluations = 0;
2399 rule->packets[0] = rule->packets[1] = 0;
2400 rule->bytes[0] = rule->bytes[1] = 0;
2406 case DIOCGIFSPEEDV0:
2407 case DIOCGIFSPEEDV1: {
2408 struct pf_ifspeed_v1 *psp = (struct pf_ifspeed_v1 *)addr;
2409 struct pf_ifspeed_v1 ps;
2412 if (psp->ifname[0] != 0) {
2413 /* Can we completely trust user-land? */
2414 strlcpy(ps.ifname, psp->ifname, IFNAMSIZ);
2415 ifp = ifunit(ps.ifname);
2418 (u_int32_t)uqmin(ifp->if_baudrate, UINT_MAX);
2419 if (cmd == DIOCGIFSPEEDV1)
2420 psp->baudrate = ifp->if_baudrate;
2429 case DIOCSTARTALTQ: {
2430 struct pf_altq *altq;
2433 /* enable all altq interfaces on active list */
2434 TAILQ_FOREACH(altq, V_pf_altq_ifs_active, entries) {
2435 if ((altq->local_flags & PFALTQ_FLAG_IF_REMOVED) == 0) {
2436 error = pf_enable_altq(altq);
2442 V_pf_altq_running = 1;
2444 DPFPRINTF(PF_DEBUG_MISC, ("altq: started\n"));
2448 case DIOCSTOPALTQ: {
2449 struct pf_altq *altq;
2452 /* disable all altq interfaces on active list */
2453 TAILQ_FOREACH(altq, V_pf_altq_ifs_active, entries) {
2454 if ((altq->local_flags & PFALTQ_FLAG_IF_REMOVED) == 0) {
2455 error = pf_disable_altq(altq);
2461 V_pf_altq_running = 0;
2463 DPFPRINTF(PF_DEBUG_MISC, ("altq: stopped\n"));
2468 case DIOCADDALTQV1: {
2469 struct pfioc_altq_v1 *pa = (struct pfioc_altq_v1 *)addr;
2470 struct pf_altq *altq, *a;
2473 altq = malloc(sizeof(*altq), M_PFALTQ, M_WAITOK | M_ZERO);
2474 error = pf_import_kaltq(pa, altq, IOCPARM_LEN(cmd));
2477 altq->local_flags = 0;
2480 if (pa->ticket != V_ticket_altqs_inactive) {
2482 free(altq, M_PFALTQ);
2488 * if this is for a queue, find the discipline and
2489 * copy the necessary fields
2491 if (altq->qname[0] != 0) {
2492 if ((altq->qid = pf_qname2qid(altq->qname)) == 0) {
2495 free(altq, M_PFALTQ);
2498 altq->altq_disc = NULL;
2499 TAILQ_FOREACH(a, V_pf_altq_ifs_inactive, entries) {
2500 if (strncmp(a->ifname, altq->ifname,
2502 altq->altq_disc = a->altq_disc;
2508 if ((ifp = ifunit(altq->ifname)) == NULL)
2509 altq->local_flags |= PFALTQ_FLAG_IF_REMOVED;
2511 error = altq_add(ifp, altq);
2515 free(altq, M_PFALTQ);
2519 if (altq->qname[0] != 0)
2520 TAILQ_INSERT_TAIL(V_pf_altqs_inactive, altq, entries);
2522 TAILQ_INSERT_TAIL(V_pf_altq_ifs_inactive, altq, entries);
2523 /* version error check done on import above */
2524 pf_export_kaltq(altq, pa, IOCPARM_LEN(cmd));
2529 case DIOCGETALTQSV0:
2530 case DIOCGETALTQSV1: {
2531 struct pfioc_altq_v1 *pa = (struct pfioc_altq_v1 *)addr;
2532 struct pf_altq *altq;
2536 TAILQ_FOREACH(altq, V_pf_altq_ifs_active, entries)
2538 TAILQ_FOREACH(altq, V_pf_altqs_active, entries)
2540 pa->ticket = V_ticket_altqs_active;
2546 case DIOCGETALTQV1: {
2547 struct pfioc_altq_v1 *pa = (struct pfioc_altq_v1 *)addr;
2548 struct pf_altq *altq;
2551 if (pa->ticket != V_ticket_altqs_active) {
2556 altq = pf_altq_get_nth_active(pa->nr);
2562 pf_export_kaltq(altq, pa, IOCPARM_LEN(cmd));
2567 case DIOCCHANGEALTQV0:
2568 case DIOCCHANGEALTQV1:
2569 /* CHANGEALTQ not supported yet! */
2573 case DIOCGETQSTATSV0:
2574 case DIOCGETQSTATSV1: {
2575 struct pfioc_qstats_v1 *pq = (struct pfioc_qstats_v1 *)addr;
2576 struct pf_altq *altq;
2581 if (pq->ticket != V_ticket_altqs_active) {
2586 nbytes = pq->nbytes;
2587 altq = pf_altq_get_nth_active(pq->nr);
2594 if ((altq->local_flags & PFALTQ_FLAG_IF_REMOVED) != 0) {
2600 if (cmd == DIOCGETQSTATSV0)
2601 version = 0; /* DIOCGETQSTATSV0 means stats struct v0 */
2603 version = pq->version;
2604 error = altq_getqstats(altq, pq->buf, &nbytes, version);
2606 pq->scheduler = altq->scheduler;
2607 pq->nbytes = nbytes;
2613 case DIOCBEGINADDRS: {
2614 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr;
2617 pf_empty_pool(&V_pf_pabuf);
2618 pp->ticket = ++V_ticket_pabuf;
2624 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr;
2625 struct pf_pooladdr *pa;
2626 struct pfi_kif *kif = NULL;
2629 if (pp->af == AF_INET) {
2630 error = EAFNOSUPPORT;
2635 if (pp->af == AF_INET6) {
2636 error = EAFNOSUPPORT;
2640 if (pp->addr.addr.type != PF_ADDR_ADDRMASK &&
2641 pp->addr.addr.type != PF_ADDR_DYNIFTL &&
2642 pp->addr.addr.type != PF_ADDR_TABLE) {
2646 pa = malloc(sizeof(*pa), M_PFRULE, M_WAITOK);
2647 bcopy(&pp->addr, pa, sizeof(struct pf_pooladdr));
2649 kif = malloc(sizeof(*kif), PFI_MTYPE, M_WAITOK);
2651 if (pp->ticket != V_ticket_pabuf) {
2654 free(kif, PFI_MTYPE);
2659 if (pa->ifname[0]) {
2660 pa->kif = pfi_kif_attach(kif, pa->ifname);
2661 pfi_kif_ref(pa->kif);
2664 if (pa->addr.type == PF_ADDR_DYNIFTL && ((error =
2665 pfi_dynaddr_setup(&pa->addr, pp->af)) != 0)) {
2667 pfi_kif_unref(pa->kif);
2672 TAILQ_INSERT_TAIL(&V_pf_pabuf, pa, entries);
2677 case DIOCGETADDRS: {
2678 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr;
2679 struct pf_pool *pool;
2680 struct pf_pooladdr *pa;
2684 pool = pf_get_pool(pp->anchor, pp->ticket, pp->r_action,
2685 pp->r_num, 0, 1, 0);
2691 TAILQ_FOREACH(pa, &pool->list, entries)
2698 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr;
2699 struct pf_pool *pool;
2700 struct pf_pooladdr *pa;
2704 pool = pf_get_pool(pp->anchor, pp->ticket, pp->r_action,
2705 pp->r_num, 0, 1, 1);
2711 pa = TAILQ_FIRST(&pool->list);
2712 while ((pa != NULL) && (nr < pp->nr)) {
2713 pa = TAILQ_NEXT(pa, entries);
2721 bcopy(pa, &pp->addr, sizeof(struct pf_pooladdr));
2722 pf_addr_copyout(&pp->addr.addr);
2727 case DIOCCHANGEADDR: {
2728 struct pfioc_pooladdr *pca = (struct pfioc_pooladdr *)addr;
2729 struct pf_pool *pool;
2730 struct pf_pooladdr *oldpa = NULL, *newpa = NULL;
2731 struct pf_ruleset *ruleset;
2732 struct pfi_kif *kif = NULL;
2734 if (pca->action < PF_CHANGE_ADD_HEAD ||
2735 pca->action > PF_CHANGE_REMOVE) {
2739 if (pca->addr.addr.type != PF_ADDR_ADDRMASK &&
2740 pca->addr.addr.type != PF_ADDR_DYNIFTL &&
2741 pca->addr.addr.type != PF_ADDR_TABLE) {
2746 if (pca->action != PF_CHANGE_REMOVE) {
2748 if (pca->af == AF_INET) {
2749 error = EAFNOSUPPORT;
2754 if (pca->af == AF_INET6) {
2755 error = EAFNOSUPPORT;
2759 newpa = malloc(sizeof(*newpa), M_PFRULE, M_WAITOK);
2760 bcopy(&pca->addr, newpa, sizeof(struct pf_pooladdr));
2761 if (newpa->ifname[0])
2762 kif = malloc(sizeof(*kif), PFI_MTYPE, M_WAITOK);
2766 #define ERROUT(x) { error = (x); goto DIOCCHANGEADDR_error; }
2768 ruleset = pf_find_ruleset(pca->anchor);
2769 if (ruleset == NULL)
2772 pool = pf_get_pool(pca->anchor, pca->ticket, pca->r_action,
2773 pca->r_num, pca->r_last, 1, 1);
2777 if (pca->action != PF_CHANGE_REMOVE) {
2778 if (newpa->ifname[0]) {
2779 newpa->kif = pfi_kif_attach(kif, newpa->ifname);
2780 pfi_kif_ref(newpa->kif);
2784 switch (newpa->addr.type) {
2785 case PF_ADDR_DYNIFTL:
2786 error = pfi_dynaddr_setup(&newpa->addr,
2790 newpa->addr.p.tbl = pfr_attach_table(ruleset,
2791 newpa->addr.v.tblname);
2792 if (newpa->addr.p.tbl == NULL)
2797 goto DIOCCHANGEADDR_error;
2800 switch (pca->action) {
2801 case PF_CHANGE_ADD_HEAD:
2802 oldpa = TAILQ_FIRST(&pool->list);
2804 case PF_CHANGE_ADD_TAIL:
2805 oldpa = TAILQ_LAST(&pool->list, pf_palist);
2808 oldpa = TAILQ_FIRST(&pool->list);
2809 for (int i = 0; oldpa && i < pca->nr; i++)
2810 oldpa = TAILQ_NEXT(oldpa, entries);
2816 if (pca->action == PF_CHANGE_REMOVE) {
2817 TAILQ_REMOVE(&pool->list, oldpa, entries);
2818 switch (oldpa->addr.type) {
2819 case PF_ADDR_DYNIFTL:
2820 pfi_dynaddr_remove(oldpa->addr.p.dyn);
2823 pfr_detach_table(oldpa->addr.p.tbl);
2827 pfi_kif_unref(oldpa->kif);
2828 free(oldpa, M_PFRULE);
2831 TAILQ_INSERT_TAIL(&pool->list, newpa, entries);
2832 else if (pca->action == PF_CHANGE_ADD_HEAD ||
2833 pca->action == PF_CHANGE_ADD_BEFORE)
2834 TAILQ_INSERT_BEFORE(oldpa, newpa, entries);
2836 TAILQ_INSERT_AFTER(&pool->list, oldpa,
2840 pool->cur = TAILQ_FIRST(&pool->list);
2841 PF_ACPY(&pool->counter, &pool->cur->addr.v.a.addr, pca->af);
2846 DIOCCHANGEADDR_error:
2847 if (newpa != NULL) {
2849 pfi_kif_unref(newpa->kif);
2850 free(newpa, M_PFRULE);
2854 free(kif, PFI_MTYPE);
2858 case DIOCGETRULESETS: {
2859 struct pfioc_ruleset *pr = (struct pfioc_ruleset *)addr;
2860 struct pf_ruleset *ruleset;
2861 struct pf_anchor *anchor;
2864 pr->path[sizeof(pr->path) - 1] = 0;
2865 if ((ruleset = pf_find_ruleset(pr->path)) == NULL) {
2871 if (ruleset->anchor == NULL) {
2872 /* XXX kludge for pf_main_ruleset */
2873 RB_FOREACH(anchor, pf_anchor_global, &V_pf_anchors)
2874 if (anchor->parent == NULL)
2877 RB_FOREACH(anchor, pf_anchor_node,
2878 &ruleset->anchor->children)
2885 case DIOCGETRULESET: {
2886 struct pfioc_ruleset *pr = (struct pfioc_ruleset *)addr;
2887 struct pf_ruleset *ruleset;
2888 struct pf_anchor *anchor;
2892 pr->path[sizeof(pr->path) - 1] = 0;
2893 if ((ruleset = pf_find_ruleset(pr->path)) == NULL) {
2899 if (ruleset->anchor == NULL) {
2900 /* XXX kludge for pf_main_ruleset */
2901 RB_FOREACH(anchor, pf_anchor_global, &V_pf_anchors)
2902 if (anchor->parent == NULL && nr++ == pr->nr) {
2903 strlcpy(pr->name, anchor->name,
2908 RB_FOREACH(anchor, pf_anchor_node,
2909 &ruleset->anchor->children)
2910 if (nr++ == pr->nr) {
2911 strlcpy(pr->name, anchor->name,
2922 case DIOCRCLRTABLES: {
2923 struct pfioc_table *io = (struct pfioc_table *)addr;
2925 if (io->pfrio_esize != 0) {
2930 error = pfr_clr_tables(&io->pfrio_table, &io->pfrio_ndel,
2931 io->pfrio_flags | PFR_FLAG_USERIOCTL);
2936 case DIOCRADDTABLES: {
2937 struct pfioc_table *io = (struct pfioc_table *)addr;
2938 struct pfr_table *pfrts;
2941 if (io->pfrio_esize != sizeof(struct pfr_table)) {
2946 if (io->pfrio_size < 0 || io->pfrio_size > pf_ioctl_maxcount ||
2947 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_table))) {
2952 totlen = io->pfrio_size * sizeof(struct pfr_table);
2953 pfrts = mallocarray(io->pfrio_size, sizeof(struct pfr_table),
2955 error = copyin(io->pfrio_buffer, pfrts, totlen);
2957 free(pfrts, M_TEMP);
2961 error = pfr_add_tables(pfrts, io->pfrio_size,
2962 &io->pfrio_nadd, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2964 free(pfrts, M_TEMP);
2968 case DIOCRDELTABLES: {
2969 struct pfioc_table *io = (struct pfioc_table *)addr;
2970 struct pfr_table *pfrts;
2973 if (io->pfrio_esize != sizeof(struct pfr_table)) {
2978 if (io->pfrio_size < 0 || io->pfrio_size > pf_ioctl_maxcount ||
2979 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_table))) {
2984 totlen = io->pfrio_size * sizeof(struct pfr_table);
2985 pfrts = mallocarray(io->pfrio_size, sizeof(struct pfr_table),
2987 error = copyin(io->pfrio_buffer, pfrts, totlen);
2989 free(pfrts, M_TEMP);
2993 error = pfr_del_tables(pfrts, io->pfrio_size,
2994 &io->pfrio_ndel, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2996 free(pfrts, M_TEMP);
3000 case DIOCRGETTABLES: {
3001 struct pfioc_table *io = (struct pfioc_table *)addr;
3002 struct pfr_table *pfrts;
3005 if (io->pfrio_esize != sizeof(struct pfr_table)) {
3010 n = pfr_table_count(&io->pfrio_table, io->pfrio_flags);
3011 io->pfrio_size = min(io->pfrio_size, n);
3013 totlen = io->pfrio_size * sizeof(struct pfr_table);
3015 pfrts = mallocarray(io->pfrio_size, sizeof(struct pfr_table),
3017 if (pfrts == NULL) {
3022 error = pfr_get_tables(&io->pfrio_table, pfrts,
3023 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL);
3026 error = copyout(pfrts, io->pfrio_buffer, totlen);
3027 free(pfrts, M_TEMP);
3031 case DIOCRGETTSTATS: {
3032 struct pfioc_table *io = (struct pfioc_table *)addr;
3033 struct pfr_tstats *pfrtstats;
3036 if (io->pfrio_esize != sizeof(struct pfr_tstats)) {
3041 n = pfr_table_count(&io->pfrio_table, io->pfrio_flags);
3042 io->pfrio_size = min(io->pfrio_size, n);
3044 totlen = io->pfrio_size * sizeof(struct pfr_tstats);
3045 pfrtstats = mallocarray(io->pfrio_size,
3046 sizeof(struct pfr_tstats), M_TEMP, M_NOWAIT);
3047 if (pfrtstats == NULL) {
3052 error = pfr_get_tstats(&io->pfrio_table, pfrtstats,
3053 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL);
3056 error = copyout(pfrtstats, io->pfrio_buffer, totlen);
3057 free(pfrtstats, M_TEMP);
3061 case DIOCRCLRTSTATS: {
3062 struct pfioc_table *io = (struct pfioc_table *)addr;
3063 struct pfr_table *pfrts;
3066 if (io->pfrio_esize != sizeof(struct pfr_table)) {
3072 n = pfr_table_count(&io->pfrio_table, io->pfrio_flags);
3073 io->pfrio_size = min(io->pfrio_size, n);
3075 totlen = io->pfrio_size * sizeof(struct pfr_table);
3076 pfrts = mallocarray(io->pfrio_size, sizeof(struct pfr_table),
3078 if (pfrts == NULL) {
3083 error = copyin(io->pfrio_buffer, pfrts, totlen);
3085 free(pfrts, M_TEMP);
3089 error = pfr_clr_tstats(pfrts, io->pfrio_size,
3090 &io->pfrio_nzero, io->pfrio_flags | PFR_FLAG_USERIOCTL);
3092 free(pfrts, M_TEMP);
3096 case DIOCRSETTFLAGS: {
3097 struct pfioc_table *io = (struct pfioc_table *)addr;
3098 struct pfr_table *pfrts;
3101 if (io->pfrio_esize != sizeof(struct pfr_table)) {
3107 n = pfr_table_count(&io->pfrio_table, io->pfrio_flags);
3108 io->pfrio_size = min(io->pfrio_size, n);
3111 totlen = io->pfrio_size * sizeof(struct pfr_table);
3112 pfrts = mallocarray(io->pfrio_size, sizeof(struct pfr_table),
3114 if (pfrts == NULL) {
3118 error = copyin(io->pfrio_buffer, pfrts, totlen);
3120 free(pfrts, M_TEMP);
3124 error = pfr_set_tflags(pfrts, io->pfrio_size,
3125 io->pfrio_setflag, io->pfrio_clrflag, &io->pfrio_nchange,
3126 &io->pfrio_ndel, io->pfrio_flags | PFR_FLAG_USERIOCTL);
3128 free(pfrts, M_TEMP);
3132 case DIOCRCLRADDRS: {
3133 struct pfioc_table *io = (struct pfioc_table *)addr;
3135 if (io->pfrio_esize != 0) {
3140 error = pfr_clr_addrs(&io->pfrio_table, &io->pfrio_ndel,
3141 io->pfrio_flags | PFR_FLAG_USERIOCTL);
3146 case DIOCRADDADDRS: {
3147 struct pfioc_table *io = (struct pfioc_table *)addr;
3148 struct pfr_addr *pfras;
3151 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
3155 if (io->pfrio_size < 0 ||
3156 io->pfrio_size > pf_ioctl_maxcount ||
3157 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_addr))) {
3161 totlen = io->pfrio_size * sizeof(struct pfr_addr);
3162 pfras = mallocarray(io->pfrio_size, sizeof(struct pfr_addr),
3168 error = copyin(io->pfrio_buffer, pfras, totlen);
3170 free(pfras, M_TEMP);
3174 error = pfr_add_addrs(&io->pfrio_table, pfras,
3175 io->pfrio_size, &io->pfrio_nadd, io->pfrio_flags |
3176 PFR_FLAG_USERIOCTL);
3178 if (error == 0 && io->pfrio_flags & PFR_FLAG_FEEDBACK)
3179 error = copyout(pfras, io->pfrio_buffer, totlen);
3180 free(pfras, M_TEMP);
3184 case DIOCRDELADDRS: {
3185 struct pfioc_table *io = (struct pfioc_table *)addr;
3186 struct pfr_addr *pfras;
3189 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
3193 if (io->pfrio_size < 0 ||
3194 io->pfrio_size > pf_ioctl_maxcount ||
3195 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_addr))) {
3199 totlen = io->pfrio_size * sizeof(struct pfr_addr);
3200 pfras = mallocarray(io->pfrio_size, sizeof(struct pfr_addr),
3206 error = copyin(io->pfrio_buffer, pfras, totlen);
3208 free(pfras, M_TEMP);
3212 error = pfr_del_addrs(&io->pfrio_table, pfras,
3213 io->pfrio_size, &io->pfrio_ndel, io->pfrio_flags |
3214 PFR_FLAG_USERIOCTL);
3216 if (error == 0 && io->pfrio_flags & PFR_FLAG_FEEDBACK)
3217 error = copyout(pfras, io->pfrio_buffer, totlen);
3218 free(pfras, M_TEMP);
3222 case DIOCRSETADDRS: {
3223 struct pfioc_table *io = (struct pfioc_table *)addr;
3224 struct pfr_addr *pfras;
3225 size_t totlen, count;
3227 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
3231 if (io->pfrio_size < 0 || io->pfrio_size2 < 0) {
3235 count = max(io->pfrio_size, io->pfrio_size2);
3236 if (count > pf_ioctl_maxcount ||
3237 WOULD_OVERFLOW(count, sizeof(struct pfr_addr))) {
3241 totlen = count * sizeof(struct pfr_addr);
3242 pfras = mallocarray(count, sizeof(struct pfr_addr), M_TEMP,
3248 error = copyin(io->pfrio_buffer, pfras, totlen);
3250 free(pfras, M_TEMP);
3254 error = pfr_set_addrs(&io->pfrio_table, pfras,
3255 io->pfrio_size, &io->pfrio_size2, &io->pfrio_nadd,
3256 &io->pfrio_ndel, &io->pfrio_nchange, io->pfrio_flags |
3257 PFR_FLAG_USERIOCTL, 0);
3259 if (error == 0 && io->pfrio_flags & PFR_FLAG_FEEDBACK)
3260 error = copyout(pfras, io->pfrio_buffer, totlen);
3261 free(pfras, M_TEMP);
3265 case DIOCRGETADDRS: {
3266 struct pfioc_table *io = (struct pfioc_table *)addr;
3267 struct pfr_addr *pfras;
3270 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
3274 if (io->pfrio_size < 0 ||
3275 io->pfrio_size > pf_ioctl_maxcount ||
3276 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_addr))) {
3280 totlen = io->pfrio_size * sizeof(struct pfr_addr);
3281 pfras = mallocarray(io->pfrio_size, sizeof(struct pfr_addr),
3288 error = pfr_get_addrs(&io->pfrio_table, pfras,
3289 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL);
3292 error = copyout(pfras, io->pfrio_buffer, totlen);
3293 free(pfras, M_TEMP);
3297 case DIOCRGETASTATS: {
3298 struct pfioc_table *io = (struct pfioc_table *)addr;
3299 struct pfr_astats *pfrastats;
3302 if (io->pfrio_esize != sizeof(struct pfr_astats)) {
3306 if (io->pfrio_size < 0 ||
3307 io->pfrio_size > pf_ioctl_maxcount ||
3308 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_astats))) {
3312 totlen = io->pfrio_size * sizeof(struct pfr_astats);
3313 pfrastats = mallocarray(io->pfrio_size,
3314 sizeof(struct pfr_astats), M_TEMP, M_NOWAIT);
3320 error = pfr_get_astats(&io->pfrio_table, pfrastats,
3321 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL);
3324 error = copyout(pfrastats, io->pfrio_buffer, totlen);
3325 free(pfrastats, M_TEMP);
3329 case DIOCRCLRASTATS: {
3330 struct pfioc_table *io = (struct pfioc_table *)addr;
3331 struct pfr_addr *pfras;
3334 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
3338 if (io->pfrio_size < 0 ||
3339 io->pfrio_size > pf_ioctl_maxcount ||
3340 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_addr))) {
3344 totlen = io->pfrio_size * sizeof(struct pfr_addr);
3345 pfras = mallocarray(io->pfrio_size, sizeof(struct pfr_addr),
3351 error = copyin(io->pfrio_buffer, pfras, totlen);
3353 free(pfras, M_TEMP);
3357 error = pfr_clr_astats(&io->pfrio_table, pfras,
3358 io->pfrio_size, &io->pfrio_nzero, io->pfrio_flags |
3359 PFR_FLAG_USERIOCTL);
3361 if (error == 0 && io->pfrio_flags & PFR_FLAG_FEEDBACK)
3362 error = copyout(pfras, io->pfrio_buffer, totlen);
3363 free(pfras, M_TEMP);
3367 case DIOCRTSTADDRS: {
3368 struct pfioc_table *io = (struct pfioc_table *)addr;
3369 struct pfr_addr *pfras;
3372 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
3376 if (io->pfrio_size < 0 ||
3377 io->pfrio_size > pf_ioctl_maxcount ||
3378 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_addr))) {
3382 totlen = io->pfrio_size * sizeof(struct pfr_addr);
3383 pfras = mallocarray(io->pfrio_size, sizeof(struct pfr_addr),
3389 error = copyin(io->pfrio_buffer, pfras, totlen);
3391 free(pfras, M_TEMP);
3395 error = pfr_tst_addrs(&io->pfrio_table, pfras,
3396 io->pfrio_size, &io->pfrio_nmatch, io->pfrio_flags |
3397 PFR_FLAG_USERIOCTL);
3400 error = copyout(pfras, io->pfrio_buffer, totlen);
3401 free(pfras, M_TEMP);
3405 case DIOCRINADEFINE: {
3406 struct pfioc_table *io = (struct pfioc_table *)addr;
3407 struct pfr_addr *pfras;
3410 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
3414 if (io->pfrio_size < 0 ||
3415 io->pfrio_size > pf_ioctl_maxcount ||
3416 WOULD_OVERFLOW(io->pfrio_size, sizeof(struct pfr_addr))) {
3420 totlen = io->pfrio_size * sizeof(struct pfr_addr);
3421 pfras = mallocarray(io->pfrio_size, sizeof(struct pfr_addr),
3427 error = copyin(io->pfrio_buffer, pfras, totlen);
3429 free(pfras, M_TEMP);
3433 error = pfr_ina_define(&io->pfrio_table, pfras,
3434 io->pfrio_size, &io->pfrio_nadd, &io->pfrio_naddr,
3435 io->pfrio_ticket, io->pfrio_flags | PFR_FLAG_USERIOCTL);
3437 free(pfras, M_TEMP);
3442 struct pf_osfp_ioctl *io = (struct pf_osfp_ioctl *)addr;
3444 error = pf_osfp_add(io);
3450 struct pf_osfp_ioctl *io = (struct pf_osfp_ioctl *)addr;
3452 error = pf_osfp_get(io);
3458 struct pfioc_trans *io = (struct pfioc_trans *)addr;
3459 struct pfioc_trans_e *ioes, *ioe;
3463 if (io->esize != sizeof(*ioe)) {
3468 io->size > pf_ioctl_maxcount ||
3469 WOULD_OVERFLOW(io->size, sizeof(struct pfioc_trans_e))) {
3473 totlen = sizeof(struct pfioc_trans_e) * io->size;
3474 ioes = mallocarray(io->size, sizeof(struct pfioc_trans_e),
3480 error = copyin(io->array, ioes, totlen);
3486 for (i = 0, ioe = ioes; i < io->size; i++, ioe++) {
3487 switch (ioe->rs_num) {
3489 case PF_RULESET_ALTQ:
3490 if (ioe->anchor[0]) {
3496 if ((error = pf_begin_altq(&ioe->ticket))) {
3503 case PF_RULESET_TABLE:
3505 struct pfr_table table;
3507 bzero(&table, sizeof(table));
3508 strlcpy(table.pfrt_anchor, ioe->anchor,
3509 sizeof(table.pfrt_anchor));
3510 if ((error = pfr_ina_begin(&table,
3511 &ioe->ticket, NULL, 0))) {
3519 if ((error = pf_begin_rules(&ioe->ticket,
3520 ioe->rs_num, ioe->anchor))) {
3529 error = copyout(ioes, io->array, totlen);
3534 case DIOCXROLLBACK: {
3535 struct pfioc_trans *io = (struct pfioc_trans *)addr;
3536 struct pfioc_trans_e *ioe, *ioes;
3540 if (io->esize != sizeof(*ioe)) {
3545 io->size > pf_ioctl_maxcount ||
3546 WOULD_OVERFLOW(io->size, sizeof(struct pfioc_trans_e))) {
3550 totlen = sizeof(struct pfioc_trans_e) * io->size;
3551 ioes = mallocarray(io->size, sizeof(struct pfioc_trans_e),
3557 error = copyin(io->array, ioes, totlen);
3563 for (i = 0, ioe = ioes; i < io->size; i++, ioe++) {
3564 switch (ioe->rs_num) {
3566 case PF_RULESET_ALTQ:
3567 if (ioe->anchor[0]) {
3573 if ((error = pf_rollback_altq(ioe->ticket))) {
3576 goto fail; /* really bad */
3580 case PF_RULESET_TABLE:
3582 struct pfr_table table;
3584 bzero(&table, sizeof(table));
3585 strlcpy(table.pfrt_anchor, ioe->anchor,
3586 sizeof(table.pfrt_anchor));
3587 if ((error = pfr_ina_rollback(&table,
3588 ioe->ticket, NULL, 0))) {
3591 goto fail; /* really bad */
3596 if ((error = pf_rollback_rules(ioe->ticket,
3597 ioe->rs_num, ioe->anchor))) {
3600 goto fail; /* really bad */
3611 struct pfioc_trans *io = (struct pfioc_trans *)addr;
3612 struct pfioc_trans_e *ioe, *ioes;
3613 struct pf_ruleset *rs;
3617 if (io->esize != sizeof(*ioe)) {
3623 io->size > pf_ioctl_maxcount ||
3624 WOULD_OVERFLOW(io->size, sizeof(struct pfioc_trans_e))) {
3629 totlen = sizeof(struct pfioc_trans_e) * io->size;
3630 ioes = mallocarray(io->size, sizeof(struct pfioc_trans_e),
3636 error = copyin(io->array, ioes, totlen);
3642 /* First makes sure everything will succeed. */
3643 for (i = 0, ioe = ioes; i < io->size; i++, ioe++) {
3644 switch (ioe->rs_num) {
3646 case PF_RULESET_ALTQ:
3647 if (ioe->anchor[0]) {
3653 if (!V_altqs_inactive_open || ioe->ticket !=
3654 V_ticket_altqs_inactive) {
3662 case PF_RULESET_TABLE:
3663 rs = pf_find_ruleset(ioe->anchor);
3664 if (rs == NULL || !rs->topen || ioe->ticket !=
3673 if (ioe->rs_num < 0 || ioe->rs_num >=
3680 rs = pf_find_ruleset(ioe->anchor);
3682 !rs->rules[ioe->rs_num].inactive.open ||
3683 rs->rules[ioe->rs_num].inactive.ticket !=
3693 /* Now do the commit - no errors should happen here. */
3694 for (i = 0, ioe = ioes; i < io->size; i++, ioe++) {
3695 switch (ioe->rs_num) {
3697 case PF_RULESET_ALTQ:
3698 if ((error = pf_commit_altq(ioe->ticket))) {
3701 goto fail; /* really bad */
3705 case PF_RULESET_TABLE:
3707 struct pfr_table table;
3709 bzero(&table, sizeof(table));
3710 strlcpy(table.pfrt_anchor, ioe->anchor,
3711 sizeof(table.pfrt_anchor));
3712 if ((error = pfr_ina_commit(&table,
3713 ioe->ticket, NULL, NULL, 0))) {
3716 goto fail; /* really bad */
3721 if ((error = pf_commit_rules(ioe->ticket,
3722 ioe->rs_num, ioe->anchor))) {
3725 goto fail; /* really bad */
3735 case DIOCGETSRCNODES: {
3736 struct pfioc_src_nodes *psn = (struct pfioc_src_nodes *)addr;
3737 struct pf_srchash *sh;
3738 struct pf_src_node *n, *p, *pstore;
3741 for (i = 0, sh = V_pf_srchash; i <= pf_srchashmask;
3743 PF_HASHROW_LOCK(sh);
3744 LIST_FOREACH(n, &sh->nodes, entry)
3746 PF_HASHROW_UNLOCK(sh);
3749 psn->psn_len = min(psn->psn_len,
3750 sizeof(struct pf_src_node) * nr);
3752 if (psn->psn_len == 0) {
3753 psn->psn_len = sizeof(struct pf_src_node) * nr;
3759 p = pstore = malloc(psn->psn_len, M_TEMP, M_WAITOK);
3760 for (i = 0, sh = V_pf_srchash; i <= pf_srchashmask;
3762 PF_HASHROW_LOCK(sh);
3763 LIST_FOREACH(n, &sh->nodes, entry) {
3764 int secs = time_uptime, diff;
3766 if ((nr + 1) * sizeof(*p) > (unsigned)psn->psn_len)
3769 bcopy(n, p, sizeof(struct pf_src_node));
3770 if (n->rule.ptr != NULL)
3771 p->rule.nr = n->rule.ptr->nr;
3772 p->creation = secs - p->creation;
3773 if (p->expire > secs)
3778 /* Adjust the connection rate estimate. */
3779 diff = secs - n->conn_rate.last;
3780 if (diff >= n->conn_rate.seconds)
3781 p->conn_rate.count = 0;
3783 p->conn_rate.count -=
3784 n->conn_rate.count * diff /
3785 n->conn_rate.seconds;
3789 PF_HASHROW_UNLOCK(sh);
3791 error = copyout(pstore, psn->psn_src_nodes,
3792 sizeof(struct pf_src_node) * nr);
3794 free(pstore, M_TEMP);
3797 psn->psn_len = sizeof(struct pf_src_node) * nr;
3798 free(pstore, M_TEMP);
3802 case DIOCCLRSRCNODES: {
3804 pf_clear_srcnodes(NULL);
3805 pf_purge_expired_src_nodes();
3809 case DIOCKILLSRCNODES:
3810 pf_kill_srcnodes((struct pfioc_src_node_kill *)addr);
3813 case DIOCSETHOSTID: {
3814 u_int32_t *hostid = (u_int32_t *)addr;
3818 V_pf_status.hostid = arc4random();
3820 V_pf_status.hostid = *hostid;
3831 case DIOCIGETIFACES: {
3832 struct pfioc_iface *io = (struct pfioc_iface *)addr;
3833 struct pfi_kif *ifstore;
3836 if (io->pfiio_esize != sizeof(struct pfi_kif)) {
3841 if (io->pfiio_size < 0 ||
3842 io->pfiio_size > pf_ioctl_maxcount ||
3843 WOULD_OVERFLOW(io->pfiio_size, sizeof(struct pfi_kif))) {
3848 bufsiz = io->pfiio_size * sizeof(struct pfi_kif);
3849 ifstore = mallocarray(io->pfiio_size, sizeof(struct pfi_kif),
3851 if (ifstore == NULL) {
3857 pfi_get_ifaces(io->pfiio_name, ifstore, &io->pfiio_size);
3859 error = copyout(ifstore, io->pfiio_buffer, bufsiz);
3860 free(ifstore, M_TEMP);
3864 case DIOCSETIFFLAG: {
3865 struct pfioc_iface *io = (struct pfioc_iface *)addr;
3868 error = pfi_set_flags(io->pfiio_name, io->pfiio_flags);
3873 case DIOCCLRIFFLAG: {
3874 struct pfioc_iface *io = (struct pfioc_iface *)addr;
3877 error = pfi_clear_flags(io->pfiio_name, io->pfiio_flags);
3887 if (sx_xlocked(&pf_ioctl_lock))
3888 sx_xunlock(&pf_ioctl_lock);
3895 pfsync_state_export(struct pfsync_state *sp, struct pf_state *st)
3897 bzero(sp, sizeof(struct pfsync_state));
3899 /* copy from state key */
3900 sp->key[PF_SK_WIRE].addr[0] = st->key[PF_SK_WIRE]->addr[0];
3901 sp->key[PF_SK_WIRE].addr[1] = st->key[PF_SK_WIRE]->addr[1];
3902 sp->key[PF_SK_WIRE].port[0] = st->key[PF_SK_WIRE]->port[0];
3903 sp->key[PF_SK_WIRE].port[1] = st->key[PF_SK_WIRE]->port[1];
3904 sp->key[PF_SK_STACK].addr[0] = st->key[PF_SK_STACK]->addr[0];
3905 sp->key[PF_SK_STACK].addr[1] = st->key[PF_SK_STACK]->addr[1];
3906 sp->key[PF_SK_STACK].port[0] = st->key[PF_SK_STACK]->port[0];
3907 sp->key[PF_SK_STACK].port[1] = st->key[PF_SK_STACK]->port[1];
3908 sp->proto = st->key[PF_SK_WIRE]->proto;
3909 sp->af = st->key[PF_SK_WIRE]->af;
3911 /* copy from state */
3912 strlcpy(sp->ifname, st->kif->pfik_name, sizeof(sp->ifname));
3913 bcopy(&st->rt_addr, &sp->rt_addr, sizeof(sp->rt_addr));
3914 sp->creation = htonl(time_uptime - st->creation);
3915 sp->expire = pf_state_expires(st);
3916 if (sp->expire <= time_uptime)
3917 sp->expire = htonl(0);
3919 sp->expire = htonl(sp->expire - time_uptime);
3921 sp->direction = st->direction;
3923 sp->timeout = st->timeout;
3924 sp->state_flags = st->state_flags;
3926 sp->sync_flags |= PFSYNC_FLAG_SRCNODE;
3927 if (st->nat_src_node)
3928 sp->sync_flags |= PFSYNC_FLAG_NATSRCNODE;
3931 sp->creatorid = st->creatorid;
3932 pf_state_peer_hton(&st->src, &sp->src);
3933 pf_state_peer_hton(&st->dst, &sp->dst);
3935 if (st->rule.ptr == NULL)
3936 sp->rule = htonl(-1);
3938 sp->rule = htonl(st->rule.ptr->nr);
3939 if (st->anchor.ptr == NULL)
3940 sp->anchor = htonl(-1);
3942 sp->anchor = htonl(st->anchor.ptr->nr);
3943 if (st->nat_rule.ptr == NULL)
3944 sp->nat_rule = htonl(-1);
3946 sp->nat_rule = htonl(st->nat_rule.ptr->nr);
3948 pf_state_counter_hton(st->packets[0], sp->packets[0]);
3949 pf_state_counter_hton(st->packets[1], sp->packets[1]);
3950 pf_state_counter_hton(st->bytes[0], sp->bytes[0]);
3951 pf_state_counter_hton(st->bytes[1], sp->bytes[1]);
3956 pf_tbladdr_copyout(struct pf_addr_wrap *aw)
3958 struct pfr_ktable *kt;
3960 KASSERT(aw->type == PF_ADDR_TABLE, ("%s: type %u", __func__, aw->type));
3963 if (!(kt->pfrkt_flags & PFR_TFLAG_ACTIVE) && kt->pfrkt_root != NULL)
3964 kt = kt->pfrkt_root;
3966 aw->p.tblcnt = (kt->pfrkt_flags & PFR_TFLAG_ACTIVE) ?
3971 * XXX - Check for version missmatch!!!
3974 pf_clear_states(void)
3979 for (i = 0; i <= pf_hashmask; i++) {
3980 struct pf_idhash *ih = &V_pf_idhash[i];
3982 PF_HASHROW_LOCK(ih);
3983 LIST_FOREACH(s, &ih->states, entry) {
3984 s->timeout = PFTM_PURGE;
3985 /* Don't send out individual delete messages. */
3986 s->state_flags |= PFSTATE_NOSYNC;
3987 pf_unlink_state(s, PF_ENTER_LOCKED);
3990 PF_HASHROW_UNLOCK(ih);
3995 pf_clear_tables(void)
3997 struct pfioc_table io;
4000 bzero(&io, sizeof(io));
4002 error = pfr_clr_tables(&io.pfrio_table, &io.pfrio_ndel,
4009 pf_clear_srcnodes(struct pf_src_node *n)
4014 for (i = 0; i <= pf_hashmask; i++) {
4015 struct pf_idhash *ih = &V_pf_idhash[i];
4017 PF_HASHROW_LOCK(ih);
4018 LIST_FOREACH(s, &ih->states, entry) {
4019 if (n == NULL || n == s->src_node)
4021 if (n == NULL || n == s->nat_src_node)
4022 s->nat_src_node = NULL;
4024 PF_HASHROW_UNLOCK(ih);
4028 struct pf_srchash *sh;
4030 for (i = 0, sh = V_pf_srchash; i <= pf_srchashmask;
4032 PF_HASHROW_LOCK(sh);
4033 LIST_FOREACH(n, &sh->nodes, entry) {
4037 PF_HASHROW_UNLOCK(sh);
4040 /* XXX: hash slot should already be locked here. */
4047 pf_kill_srcnodes(struct pfioc_src_node_kill *psnk)
4049 struct pf_src_node_list kill;
4052 for (int i = 0; i <= pf_srchashmask; i++) {
4053 struct pf_srchash *sh = &V_pf_srchash[i];
4054 struct pf_src_node *sn, *tmp;
4056 PF_HASHROW_LOCK(sh);
4057 LIST_FOREACH_SAFE(sn, &sh->nodes, entry, tmp)
4058 if (PF_MATCHA(psnk->psnk_src.neg,
4059 &psnk->psnk_src.addr.v.a.addr,
4060 &psnk->psnk_src.addr.v.a.mask,
4061 &sn->addr, sn->af) &&
4062 PF_MATCHA(psnk->psnk_dst.neg,
4063 &psnk->psnk_dst.addr.v.a.addr,
4064 &psnk->psnk_dst.addr.v.a.mask,
4065 &sn->raddr, sn->af)) {
4066 pf_unlink_src_node(sn);
4067 LIST_INSERT_HEAD(&kill, sn, entry);
4070 PF_HASHROW_UNLOCK(sh);
4073 for (int i = 0; i <= pf_hashmask; i++) {
4074 struct pf_idhash *ih = &V_pf_idhash[i];
4077 PF_HASHROW_LOCK(ih);
4078 LIST_FOREACH(s, &ih->states, entry) {
4079 if (s->src_node && s->src_node->expire == 1)
4081 if (s->nat_src_node && s->nat_src_node->expire == 1)
4082 s->nat_src_node = NULL;
4084 PF_HASHROW_UNLOCK(ih);
4087 psnk->psnk_killed = pf_free_src_nodes(&kill);
4091 * XXX - Check for version missmatch!!!
4095 * Duplicate pfctl -Fa operation to get rid of as much as we can.
4105 if ((error = pf_begin_rules(&t[0], PF_RULESET_SCRUB, &nn))
4107 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: SCRUB\n"));
4110 if ((error = pf_begin_rules(&t[1], PF_RULESET_FILTER, &nn))
4112 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: FILTER\n"));
4113 break; /* XXX: rollback? */
4115 if ((error = pf_begin_rules(&t[2], PF_RULESET_NAT, &nn))
4117 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: NAT\n"));
4118 break; /* XXX: rollback? */
4120 if ((error = pf_begin_rules(&t[3], PF_RULESET_BINAT, &nn))
4122 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: BINAT\n"));
4123 break; /* XXX: rollback? */
4125 if ((error = pf_begin_rules(&t[4], PF_RULESET_RDR, &nn))
4127 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: RDR\n"));
4128 break; /* XXX: rollback? */
4131 /* XXX: these should always succeed here */
4132 pf_commit_rules(t[0], PF_RULESET_SCRUB, &nn);
4133 pf_commit_rules(t[1], PF_RULESET_FILTER, &nn);
4134 pf_commit_rules(t[2], PF_RULESET_NAT, &nn);
4135 pf_commit_rules(t[3], PF_RULESET_BINAT, &nn);
4136 pf_commit_rules(t[4], PF_RULESET_RDR, &nn);
4138 if ((error = pf_clear_tables()) != 0)
4142 if ((error = pf_begin_altq(&t[0])) != 0) {
4143 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: ALTQ\n"));
4146 pf_commit_altq(t[0]);
4151 pf_clear_srcnodes(NULL);
4153 /* status does not use malloced mem so no need to cleanup */
4154 /* fingerprints and interfaces have their own cleanup code */
4160 static pfil_return_t
4161 pf_check_return(int chk, struct mbuf **m)
4167 return (PFIL_CONSUMED);
4176 return (PFIL_DROPPED);
4181 static pfil_return_t
4182 pf_check_in(struct mbuf **m, struct ifnet *ifp, int flags,
4183 void *ruleset __unused, struct inpcb *inp)
4187 chk = pf_test(PF_IN, flags, ifp, m, inp);
4189 return (pf_check_return(chk, m));
4192 static pfil_return_t
4193 pf_check_out(struct mbuf **m, struct ifnet *ifp, int flags,
4194 void *ruleset __unused, struct inpcb *inp)
4198 chk = pf_test(PF_OUT, flags, ifp, m, inp);
4200 return (pf_check_return(chk, m));
4205 static pfil_return_t
4206 pf_check6_in(struct mbuf **m, struct ifnet *ifp, int flags,
4207 void *ruleset __unused, struct inpcb *inp)
4212 * In case of loopback traffic IPv6 uses the real interface in
4213 * order to support scoped addresses. In order to support stateful
4214 * filtering we have change this to lo0 as it is the case in IPv4.
4216 CURVNET_SET(ifp->if_vnet);
4217 chk = pf_test6(PF_IN, flags, (*m)->m_flags & M_LOOP ? V_loif : ifp, m, inp);
4220 return (pf_check_return(chk, m));
4223 static pfil_return_t
4224 pf_check6_out(struct mbuf **m, struct ifnet *ifp, int flags,
4225 void *ruleset __unused, struct inpcb *inp)
4229 CURVNET_SET(ifp->if_vnet);
4230 chk = pf_test6(PF_OUT, flags, ifp, m, inp);
4233 return (pf_check_return(chk, m));
4238 VNET_DEFINE_STATIC(pfil_hook_t, pf_ip4_in_hook);
4239 VNET_DEFINE_STATIC(pfil_hook_t, pf_ip4_out_hook);
4240 #define V_pf_ip4_in_hook VNET(pf_ip4_in_hook)
4241 #define V_pf_ip4_out_hook VNET(pf_ip4_out_hook)
4244 VNET_DEFINE_STATIC(pfil_hook_t, pf_ip6_in_hook);
4245 VNET_DEFINE_STATIC(pfil_hook_t, pf_ip6_out_hook);
4246 #define V_pf_ip6_in_hook VNET(pf_ip6_in_hook)
4247 #define V_pf_ip6_out_hook VNET(pf_ip6_out_hook)
4253 struct pfil_hook_args pha;
4254 struct pfil_link_args pla;
4256 if (V_pf_pfil_hooked)
4259 pha.pa_version = PFIL_VERSION;
4260 pha.pa_modname = "pf";
4261 pha.pa_ruleset = NULL;
4263 pla.pa_version = PFIL_VERSION;
4266 pha.pa_type = PFIL_TYPE_IP4;
4267 pha.pa_func = pf_check_in;
4268 pha.pa_flags = PFIL_IN;
4269 pha.pa_rulname = "default-in";
4270 V_pf_ip4_in_hook = pfil_add_hook(&pha);
4271 pla.pa_flags = PFIL_IN | PFIL_HEADPTR | PFIL_HOOKPTR;
4272 pla.pa_head = V_inet_pfil_head;
4273 pla.pa_hook = V_pf_ip4_in_hook;
4274 (void)pfil_link(&pla);
4275 pha.pa_func = pf_check_out;
4276 pha.pa_flags = PFIL_OUT;
4277 pha.pa_rulname = "default-out";
4278 V_pf_ip4_out_hook = pfil_add_hook(&pha);
4279 pla.pa_flags = PFIL_OUT | PFIL_HEADPTR | PFIL_HOOKPTR;
4280 pla.pa_head = V_inet_pfil_head;
4281 pla.pa_hook = V_pf_ip4_out_hook;
4282 (void)pfil_link(&pla);
4285 pha.pa_type = PFIL_TYPE_IP6;
4286 pha.pa_func = pf_check6_in;
4287 pha.pa_flags = PFIL_IN;
4288 pha.pa_rulname = "default-in6";
4289 V_pf_ip6_in_hook = pfil_add_hook(&pha);
4290 pla.pa_flags = PFIL_IN | PFIL_HEADPTR | PFIL_HOOKPTR;
4291 pla.pa_head = V_inet6_pfil_head;
4292 pla.pa_hook = V_pf_ip6_in_hook;
4293 (void)pfil_link(&pla);
4294 pha.pa_func = pf_check6_out;
4295 pha.pa_rulname = "default-out6";
4296 pha.pa_flags = PFIL_OUT;
4297 V_pf_ip6_out_hook = pfil_add_hook(&pha);
4298 pla.pa_flags = PFIL_OUT | PFIL_HEADPTR | PFIL_HOOKPTR;
4299 pla.pa_head = V_inet6_pfil_head;
4300 pla.pa_hook = V_pf_ip6_out_hook;
4301 (void)pfil_link(&pla);
4304 V_pf_pfil_hooked = 1;
4312 if (V_pf_pfil_hooked == 0)
4316 pfil_remove_hook(V_pf_ip4_in_hook);
4317 pfil_remove_hook(V_pf_ip4_out_hook);
4320 pfil_remove_hook(V_pf_ip6_in_hook);
4321 pfil_remove_hook(V_pf_ip6_out_hook);
4324 V_pf_pfil_hooked = 0;
4331 V_pf_tag_z = uma_zcreate("pf tags", sizeof(struct pf_tagname),
4332 NULL, NULL, NULL, NULL, UMA_ALIGN_PTR, 0);
4334 pf_init_tagset(&V_pf_tags, &pf_rule_tag_hashsize,
4335 PF_RULE_TAG_HASH_SIZE_DEFAULT);
4337 pf_init_tagset(&V_pf_qids, &pf_queue_tag_hashsize,
4338 PF_QUEUE_TAG_HASH_SIZE_DEFAULT);
4342 V_pf_vnet_active = 1;
4350 rm_init(&pf_rules_lock, "pf rulesets");
4351 sx_init(&pf_ioctl_lock, "pf ioctl");
4352 sx_init(&pf_end_lock, "pf end thread");
4354 pf_mtag_initialize();
4356 pf_dev = make_dev(&pf_cdevsw, 0, UID_ROOT, GID_WHEEL, 0600, PF_NAME);
4361 error = kproc_create(pf_purge_thread, NULL, &pf_purge_proc, 0, 0, "pf purge");
4371 pf_unload_vnet(void)
4375 V_pf_vnet_active = 0;
4376 V_pf_status.running = 0;
4377 error = dehook_pf();
4380 * Should not happen!
4381 * XXX Due to error code ESRCH, kldunload will show
4382 * a message like 'No such process'.
4384 printf("%s : pfil unregisteration fail\n", __FUNCTION__);
4392 swi_remove(V_pf_swi_cookie);
4394 pf_unload_vnet_purge();
4396 pf_normalize_cleanup();
4403 if (IS_DEFAULT_VNET(curvnet))
4406 pf_cleanup_tagset(&V_pf_tags);
4408 pf_cleanup_tagset(&V_pf_qids);
4410 uma_zdestroy(V_pf_tag_z);
4412 /* Free counters last as we updated them during shutdown. */
4413 counter_u64_free(V_pf_default_rule.states_cur);
4414 counter_u64_free(V_pf_default_rule.states_tot);
4415 counter_u64_free(V_pf_default_rule.src_nodes);
4417 for (int i = 0; i < PFRES_MAX; i++)
4418 counter_u64_free(V_pf_status.counters[i]);
4419 for (int i = 0; i < LCNT_MAX; i++)
4420 counter_u64_free(V_pf_status.lcounters[i]);
4421 for (int i = 0; i < FCNT_MAX; i++)
4422 counter_u64_free(V_pf_status.fcounters[i]);
4423 for (int i = 0; i < SCNT_MAX; i++)
4424 counter_u64_free(V_pf_status.scounters[i]);
4431 sx_xlock(&pf_end_lock);
4433 while (pf_end_threads < 2) {
4434 wakeup_one(pf_purge_thread);
4435 sx_sleep(pf_purge_proc, &pf_end_lock, 0, "pftmo", 0);
4437 sx_xunlock(&pf_end_lock);
4440 destroy_dev(pf_dev);
4444 rm_destroy(&pf_rules_lock);
4445 sx_destroy(&pf_ioctl_lock);
4446 sx_destroy(&pf_end_lock);
4450 vnet_pf_init(void *unused __unused)
4455 VNET_SYSINIT(vnet_pf_init, SI_SUB_PROTO_FIREWALL, SI_ORDER_THIRD,
4456 vnet_pf_init, NULL);
4459 vnet_pf_uninit(const void *unused __unused)
4464 SYSUNINIT(pf_unload, SI_SUB_PROTO_FIREWALL, SI_ORDER_SECOND, pf_unload, NULL);
4465 VNET_SYSUNINIT(vnet_pf_uninit, SI_SUB_PROTO_FIREWALL, SI_ORDER_THIRD,
4466 vnet_pf_uninit, NULL);
4470 pf_modevent(module_t mod, int type, void *data)
4479 /* Handled in SYSUNINIT(pf_unload) to ensure it's done after
4480 * the vnet_pf_uninit()s */
4490 static moduledata_t pf_mod = {
4496 DECLARE_MODULE(pf, pf_mod, SI_SUB_PROTO_FIREWALL, SI_ORDER_SECOND);
4497 MODULE_VERSION(pf, PF_MODVER);