2 * Copyright (c) 2001 Daniel Hartmeier
3 * Copyright (c) 2002,2003 Henning Brauer
4 * Copyright (c) 2012 Gleb Smirnoff <glebius@FreeBSD.org>
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
11 * - Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * - Redistributions in binary form must reproduce the above
14 * copyright notice, this list of conditions and the following
15 * disclaimer in the documentation and/or other materials provided
16 * with the distribution.
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
21 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
22 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
23 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
24 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
25 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
26 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
28 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 * POSSIBILITY OF SUCH DAMAGE.
31 * Effort sponsored in part by the Defense Advanced Research Projects
32 * Agency (DARPA) and Air Force Research Laboratory, Air Force
33 * Materiel Command, USAF, under agreement number F30602-01-2-0537.
35 * $OpenBSD: pf_ioctl.c,v 1.213 2009/02/15 21:46:12 mbalmer Exp $
38 #include <sys/cdefs.h>
39 __FBSDID("$FreeBSD$");
42 #include "opt_inet6.h"
46 #include <sys/param.h>
49 #include <sys/endian.h>
50 #include <sys/fcntl.h>
51 #include <sys/filio.h>
52 #include <sys/interrupt.h>
54 #include <sys/kernel.h>
55 #include <sys/kthread.h>
57 #include <sys/module.h>
60 #include <sys/socket.h>
61 #include <sys/sysctl.h>
63 #include <sys/ucred.h>
66 #include <net/route.h>
68 #include <net/pfvar.h>
69 #include <net/if_pfsync.h>
70 #include <net/if_pflog.h>
72 #include <netinet/in.h>
73 #include <netinet/ip.h>
74 #include <netinet/ip_var.h>
75 #include <netinet6/ip6_var.h>
76 #include <netinet/ip_icmp.h>
79 #include <netinet/ip6.h>
83 #include <altq/altq.h>
86 static int pfattach(void);
87 static struct pf_pool *pf_get_pool(char *, u_int32_t, u_int8_t, u_int32_t,
88 u_int8_t, u_int8_t, u_int8_t);
90 static void pf_mv_pool(struct pf_palist *, struct pf_palist *);
91 static void pf_empty_pool(struct pf_palist *);
92 static int pfioctl(struct cdev *, u_long, caddr_t, int,
95 static int pf_begin_altq(u_int32_t *);
96 static int pf_rollback_altq(u_int32_t);
97 static int pf_commit_altq(u_int32_t);
98 static int pf_enable_altq(struct pf_altq *);
99 static int pf_disable_altq(struct pf_altq *);
100 static u_int32_t pf_qname2qid(char *);
101 static void pf_qid_unref(u_int32_t);
103 static int pf_begin_rules(u_int32_t *, int, const char *);
104 static int pf_rollback_rules(u_int32_t, int, char *);
105 static int pf_setup_pfsync_matching(struct pf_ruleset *);
106 static void pf_hash_rule(MD5_CTX *, struct pf_rule *);
107 static void pf_hash_rule_addr(MD5_CTX *, struct pf_rule_addr *);
108 static int pf_commit_rules(u_int32_t, int, char *);
109 static int pf_addr_setup(struct pf_ruleset *,
110 struct pf_addr_wrap *, sa_family_t);
111 static void pf_addr_copyout(struct pf_addr_wrap *);
113 VNET_DEFINE(struct pf_rule, pf_default_rule);
116 static VNET_DEFINE(int, pf_altq_running);
117 #define V_pf_altq_running VNET(pf_altq_running)
120 #define TAGID_MAX 50000
122 TAILQ_ENTRY(pf_tagname) entries;
123 char name[PF_TAG_NAME_SIZE];
128 TAILQ_HEAD(pf_tags, pf_tagname);
129 #define V_pf_tags VNET(pf_tags)
130 VNET_DEFINE(struct pf_tags, pf_tags);
131 #define V_pf_qids VNET(pf_qids)
132 VNET_DEFINE(struct pf_tags, pf_qids);
133 static MALLOC_DEFINE(M_PFTAG, "pf_tag", "pf(4) tag names");
134 static MALLOC_DEFINE(M_PFALTQ, "pf_altq", "pf(4) altq configuration db");
135 static MALLOC_DEFINE(M_PFRULE, "pf_rule", "pf(4) rules");
137 #if (PF_QNAME_SIZE != PF_TAG_NAME_SIZE)
138 #error PF_QNAME_SIZE must be equal to PF_TAG_NAME_SIZE
141 static u_int16_t tagname2tag(struct pf_tags *, char *);
142 static u_int16_t pf_tagname2tag(char *);
143 static void tag_unref(struct pf_tags *, u_int16_t);
145 #define DPFPRINTF(n, x) if (V_pf_status.debug >= (n)) printf x
150 * XXX - These are new and need to be checked when moveing to a new version
152 static void pf_clear_states(void);
153 static int pf_clear_tables(void);
154 static void pf_clear_srcnodes(struct pf_src_node *);
155 static void pf_kill_srcnodes(struct pfioc_src_node_kill *);
156 static void pf_tbladdr_copyout(struct pf_addr_wrap *);
159 * Wrapper functions for pfil(9) hooks
162 static int pf_check_in(void *arg, struct mbuf **m, struct ifnet *ifp,
163 int dir, struct inpcb *inp);
164 static int pf_check_out(void *arg, struct mbuf **m, struct ifnet *ifp,
165 int dir, struct inpcb *inp);
168 static int pf_check6_in(void *arg, struct mbuf **m, struct ifnet *ifp,
169 int dir, struct inpcb *inp);
170 static int pf_check6_out(void *arg, struct mbuf **m, struct ifnet *ifp,
171 int dir, struct inpcb *inp);
174 static int hook_pf(void);
175 static int dehook_pf(void);
176 static int shutdown_pf(void);
177 static int pf_load(void);
178 static int pf_unload(void);
180 static struct cdevsw pf_cdevsw = {
183 .d_version = D_VERSION,
186 static volatile VNET_DEFINE(int, pf_pfil_hooked);
187 #define V_pf_pfil_hooked VNET(pf_pfil_hooked)
188 VNET_DEFINE(int, pf_end_threads);
190 struct rwlock pf_rules_lock;
191 struct sx pf_ioctl_lock;
194 pfsync_state_import_t *pfsync_state_import_ptr = NULL;
195 pfsync_insert_state_t *pfsync_insert_state_ptr = NULL;
196 pfsync_update_state_t *pfsync_update_state_ptr = NULL;
197 pfsync_delete_state_t *pfsync_delete_state_ptr = NULL;
198 pfsync_clear_states_t *pfsync_clear_states_ptr = NULL;
199 pfsync_defer_t *pfsync_defer_ptr = NULL;
201 pflog_packet_t *pflog_packet_ptr = NULL;
206 u_int32_t *my_timeout = V_pf_default_rule.timeout;
209 if (IS_DEFAULT_VNET(curvnet))
210 pf_mtag_initialize();
216 V_pf_limits[PF_LIMIT_STATES].limit = PFSTATE_HIWAT;
217 V_pf_limits[PF_LIMIT_SRC_NODES].limit = PFSNODE_HIWAT;
219 RB_INIT(&V_pf_anchors);
220 pf_init_ruleset(&pf_main_ruleset);
222 /* default rule should never be garbage collected */
223 V_pf_default_rule.entries.tqe_prev = &V_pf_default_rule.entries.tqe_next;
224 #ifdef PF_DEFAULT_TO_DROP
225 V_pf_default_rule.action = PF_DROP;
227 V_pf_default_rule.action = PF_PASS;
229 V_pf_default_rule.nr = -1;
230 V_pf_default_rule.rtableid = -1;
232 V_pf_default_rule.states_cur = counter_u64_alloc(M_WAITOK);
233 V_pf_default_rule.states_tot = counter_u64_alloc(M_WAITOK);
234 V_pf_default_rule.src_nodes = counter_u64_alloc(M_WAITOK);
236 /* initialize default timeouts */
237 my_timeout[PFTM_TCP_FIRST_PACKET] = PFTM_TCP_FIRST_PACKET_VAL;
238 my_timeout[PFTM_TCP_OPENING] = PFTM_TCP_OPENING_VAL;
239 my_timeout[PFTM_TCP_ESTABLISHED] = PFTM_TCP_ESTABLISHED_VAL;
240 my_timeout[PFTM_TCP_CLOSING] = PFTM_TCP_CLOSING_VAL;
241 my_timeout[PFTM_TCP_FIN_WAIT] = PFTM_TCP_FIN_WAIT_VAL;
242 my_timeout[PFTM_TCP_CLOSED] = PFTM_TCP_CLOSED_VAL;
243 my_timeout[PFTM_UDP_FIRST_PACKET] = PFTM_UDP_FIRST_PACKET_VAL;
244 my_timeout[PFTM_UDP_SINGLE] = PFTM_UDP_SINGLE_VAL;
245 my_timeout[PFTM_UDP_MULTIPLE] = PFTM_UDP_MULTIPLE_VAL;
246 my_timeout[PFTM_ICMP_FIRST_PACKET] = PFTM_ICMP_FIRST_PACKET_VAL;
247 my_timeout[PFTM_ICMP_ERROR_REPLY] = PFTM_ICMP_ERROR_REPLY_VAL;
248 my_timeout[PFTM_OTHER_FIRST_PACKET] = PFTM_OTHER_FIRST_PACKET_VAL;
249 my_timeout[PFTM_OTHER_SINGLE] = PFTM_OTHER_SINGLE_VAL;
250 my_timeout[PFTM_OTHER_MULTIPLE] = PFTM_OTHER_MULTIPLE_VAL;
251 my_timeout[PFTM_FRAG] = PFTM_FRAG_VAL;
252 my_timeout[PFTM_INTERVAL] = PFTM_INTERVAL_VAL;
253 my_timeout[PFTM_SRC_NODE] = PFTM_SRC_NODE_VAL;
254 my_timeout[PFTM_TS_DIFF] = PFTM_TS_DIFF_VAL;
255 my_timeout[PFTM_ADAPTIVE_START] = PFSTATE_ADAPT_START;
256 my_timeout[PFTM_ADAPTIVE_END] = PFSTATE_ADAPT_END;
258 bzero(&V_pf_status, sizeof(V_pf_status));
259 V_pf_status.debug = PF_DEBUG_URGENT;
261 V_pf_pfil_hooked = 0;
263 /* XXX do our best to avoid a conflict */
264 V_pf_status.hostid = arc4random();
266 for (int i = 0; i < PFRES_MAX; i++)
267 V_pf_status.counters[i] = counter_u64_alloc(M_WAITOK);
268 for (int i = 0; i < LCNT_MAX; i++)
269 V_pf_status.lcounters[i] = counter_u64_alloc(M_WAITOK);
270 for (int i = 0; i < FCNT_MAX; i++)
271 V_pf_status.fcounters[i] = counter_u64_alloc(M_WAITOK);
272 for (int i = 0; i < SCNT_MAX; i++)
273 V_pf_status.scounters[i] = counter_u64_alloc(M_WAITOK);
275 if ((error = kproc_create(pf_purge_thread, curvnet, NULL, 0, 0,
277 /* XXXGL: leaked all above. */
279 if ((error = swi_add(NULL, "pf send", pf_intr, curvnet, SWI_NET,
280 INTR_MPSAFE, &V_pf_swi_cookie)) != 0)
281 /* XXXGL: leaked all above. */
287 static struct pf_pool *
288 pf_get_pool(char *anchor, u_int32_t ticket, u_int8_t rule_action,
289 u_int32_t rule_number, u_int8_t r_last, u_int8_t active,
290 u_int8_t check_ticket)
292 struct pf_ruleset *ruleset;
293 struct pf_rule *rule;
296 ruleset = pf_find_ruleset(anchor);
299 rs_num = pf_get_ruleset_number(rule_action);
300 if (rs_num >= PF_RULESET_MAX)
303 if (check_ticket && ticket !=
304 ruleset->rules[rs_num].active.ticket)
307 rule = TAILQ_LAST(ruleset->rules[rs_num].active.ptr,
310 rule = TAILQ_FIRST(ruleset->rules[rs_num].active.ptr);
312 if (check_ticket && ticket !=
313 ruleset->rules[rs_num].inactive.ticket)
316 rule = TAILQ_LAST(ruleset->rules[rs_num].inactive.ptr,
319 rule = TAILQ_FIRST(ruleset->rules[rs_num].inactive.ptr);
322 while ((rule != NULL) && (rule->nr != rule_number))
323 rule = TAILQ_NEXT(rule, entries);
328 return (&rule->rpool);
332 pf_mv_pool(struct pf_palist *poola, struct pf_palist *poolb)
334 struct pf_pooladdr *mv_pool_pa;
336 while ((mv_pool_pa = TAILQ_FIRST(poola)) != NULL) {
337 TAILQ_REMOVE(poola, mv_pool_pa, entries);
338 TAILQ_INSERT_TAIL(poolb, mv_pool_pa, entries);
343 pf_empty_pool(struct pf_palist *poola)
345 struct pf_pooladdr *pa;
347 while ((pa = TAILQ_FIRST(poola)) != NULL) {
348 switch (pa->addr.type) {
349 case PF_ADDR_DYNIFTL:
350 pfi_dynaddr_remove(pa->addr.p.dyn);
353 pfr_detach_table(pa->addr.p.tbl);
357 pfi_kif_unref(pa->kif);
358 TAILQ_REMOVE(poola, pa, entries);
364 pf_unlink_rule(struct pf_rulequeue *rulequeue, struct pf_rule *rule)
369 TAILQ_REMOVE(rulequeue, rule, entries);
371 PF_UNLNKDRULES_LOCK();
372 rule->rule_flag |= PFRULE_REFS;
373 TAILQ_INSERT_TAIL(&V_pf_unlinked_rules, rule, entries);
374 PF_UNLNKDRULES_UNLOCK();
378 pf_free_rule(struct pf_rule *rule)
384 tag_unref(&V_pf_tags, rule->tag);
386 tag_unref(&V_pf_tags, rule->match_tag);
388 if (rule->pqid != rule->qid)
389 pf_qid_unref(rule->pqid);
390 pf_qid_unref(rule->qid);
392 switch (rule->src.addr.type) {
393 case PF_ADDR_DYNIFTL:
394 pfi_dynaddr_remove(rule->src.addr.p.dyn);
397 pfr_detach_table(rule->src.addr.p.tbl);
400 switch (rule->dst.addr.type) {
401 case PF_ADDR_DYNIFTL:
402 pfi_dynaddr_remove(rule->dst.addr.p.dyn);
405 pfr_detach_table(rule->dst.addr.p.tbl);
408 if (rule->overload_tbl)
409 pfr_detach_table(rule->overload_tbl);
411 pfi_kif_unref(rule->kif);
412 pf_anchor_remove(rule);
413 pf_empty_pool(&rule->rpool.list);
414 counter_u64_free(rule->states_cur);
415 counter_u64_free(rule->states_tot);
416 counter_u64_free(rule->src_nodes);
417 free(rule, M_PFRULE);
421 tagname2tag(struct pf_tags *head, char *tagname)
423 struct pf_tagname *tag, *p = NULL;
424 u_int16_t new_tagid = 1;
428 TAILQ_FOREACH(tag, head, entries)
429 if (strcmp(tagname, tag->name) == 0) {
435 * to avoid fragmentation, we do a linear search from the beginning
436 * and take the first free slot we find. if there is none or the list
437 * is empty, append a new entry at the end.
441 if (!TAILQ_EMPTY(head))
442 for (p = TAILQ_FIRST(head); p != NULL &&
443 p->tag == new_tagid; p = TAILQ_NEXT(p, entries))
444 new_tagid = p->tag + 1;
446 if (new_tagid > TAGID_MAX)
449 /* allocate and fill new struct pf_tagname */
450 tag = malloc(sizeof(*tag), M_PFTAG, M_NOWAIT|M_ZERO);
453 strlcpy(tag->name, tagname, sizeof(tag->name));
454 tag->tag = new_tagid;
457 if (p != NULL) /* insert new entry before p */
458 TAILQ_INSERT_BEFORE(p, tag, entries);
459 else /* either list empty or no free slot in between */
460 TAILQ_INSERT_TAIL(head, tag, entries);
466 tag_unref(struct pf_tags *head, u_int16_t tag)
468 struct pf_tagname *p, *next;
472 for (p = TAILQ_FIRST(head); p != NULL; p = next) {
473 next = TAILQ_NEXT(p, entries);
476 TAILQ_REMOVE(head, p, entries);
485 pf_tagname2tag(char *tagname)
487 return (tagname2tag(&V_pf_tags, tagname));
492 pf_qname2qid(char *qname)
494 return ((u_int32_t)tagname2tag(&V_pf_qids, qname));
498 pf_qid_unref(u_int32_t qid)
500 tag_unref(&V_pf_qids, (u_int16_t)qid);
504 pf_begin_altq(u_int32_t *ticket)
506 struct pf_altq *altq;
511 /* Purge the old altq list */
512 while ((altq = TAILQ_FIRST(V_pf_altqs_inactive)) != NULL) {
513 TAILQ_REMOVE(V_pf_altqs_inactive, altq, entries);
514 if (altq->qname[0] == 0 &&
515 (altq->local_flags & PFALTQ_FLAG_IF_REMOVED) == 0) {
516 /* detach and destroy the discipline */
517 error = altq_remove(altq);
519 pf_qid_unref(altq->qid);
520 free(altq, M_PFALTQ);
524 *ticket = ++V_ticket_altqs_inactive;
525 V_altqs_inactive_open = 1;
530 pf_rollback_altq(u_int32_t ticket)
532 struct pf_altq *altq;
537 if (!V_altqs_inactive_open || ticket != V_ticket_altqs_inactive)
539 /* Purge the old altq list */
540 while ((altq = TAILQ_FIRST(V_pf_altqs_inactive)) != NULL) {
541 TAILQ_REMOVE(V_pf_altqs_inactive, altq, entries);
542 if (altq->qname[0] == 0 &&
543 (altq->local_flags & PFALTQ_FLAG_IF_REMOVED) == 0) {
544 /* detach and destroy the discipline */
545 error = altq_remove(altq);
547 pf_qid_unref(altq->qid);
548 free(altq, M_PFALTQ);
550 V_altqs_inactive_open = 0;
555 pf_commit_altq(u_int32_t ticket)
557 struct pf_altqqueue *old_altqs;
558 struct pf_altq *altq;
563 if (!V_altqs_inactive_open || ticket != V_ticket_altqs_inactive)
566 /* swap altqs, keep the old. */
567 old_altqs = V_pf_altqs_active;
568 V_pf_altqs_active = V_pf_altqs_inactive;
569 V_pf_altqs_inactive = old_altqs;
570 V_ticket_altqs_active = V_ticket_altqs_inactive;
572 /* Attach new disciplines */
573 TAILQ_FOREACH(altq, V_pf_altqs_active, entries) {
574 if (altq->qname[0] == 0 &&
575 (altq->local_flags & PFALTQ_FLAG_IF_REMOVED) == 0) {
576 /* attach the discipline */
577 error = altq_pfattach(altq);
578 if (error == 0 && V_pf_altq_running)
579 error = pf_enable_altq(altq);
585 /* Purge the old altq list */
586 while ((altq = TAILQ_FIRST(V_pf_altqs_inactive)) != NULL) {
587 TAILQ_REMOVE(V_pf_altqs_inactive, altq, entries);
588 if (altq->qname[0] == 0 &&
589 (altq->local_flags & PFALTQ_FLAG_IF_REMOVED) == 0) {
590 /* detach and destroy the discipline */
591 if (V_pf_altq_running)
592 error = pf_disable_altq(altq);
593 err = altq_pfdetach(altq);
594 if (err != 0 && error == 0)
596 err = altq_remove(altq);
597 if (err != 0 && error == 0)
600 pf_qid_unref(altq->qid);
601 free(altq, M_PFALTQ);
604 V_altqs_inactive_open = 0;
609 pf_enable_altq(struct pf_altq *altq)
612 struct tb_profile tb;
615 if ((ifp = ifunit(altq->ifname)) == NULL)
618 if (ifp->if_snd.altq_type != ALTQT_NONE)
619 error = altq_enable(&ifp->if_snd);
621 /* set tokenbucket regulator */
622 if (error == 0 && ifp != NULL && ALTQ_IS_ENABLED(&ifp->if_snd)) {
623 tb.rate = altq->ifbandwidth;
624 tb.depth = altq->tbrsize;
625 error = tbr_set(&ifp->if_snd, &tb);
632 pf_disable_altq(struct pf_altq *altq)
635 struct tb_profile tb;
638 if ((ifp = ifunit(altq->ifname)) == NULL)
642 * when the discipline is no longer referenced, it was overridden
643 * by a new one. if so, just return.
645 if (altq->altq_disc != ifp->if_snd.altq_disc)
648 error = altq_disable(&ifp->if_snd);
651 /* clear tokenbucket regulator */
653 error = tbr_set(&ifp->if_snd, &tb);
660 pf_altq_ifnet_event(struct ifnet *ifp, int remove)
663 struct pf_altq *a1, *a2, *a3;
667 /* Interrupt userland queue modifications */
668 if (V_altqs_inactive_open)
669 pf_rollback_altq(V_ticket_altqs_inactive);
671 /* Start new altq ruleset */
672 if (pf_begin_altq(&ticket))
675 /* Copy the current active set */
676 TAILQ_FOREACH(a1, V_pf_altqs_active, entries) {
677 a2 = malloc(sizeof(*a2), M_PFALTQ, M_NOWAIT);
682 bcopy(a1, a2, sizeof(struct pf_altq));
684 if (a2->qname[0] != 0) {
685 if ((a2->qid = pf_qname2qid(a2->qname)) == 0) {
690 a2->altq_disc = NULL;
691 TAILQ_FOREACH(a3, V_pf_altqs_inactive, entries) {
692 if (strncmp(a3->ifname, a2->ifname,
693 IFNAMSIZ) == 0 && a3->qname[0] == 0) {
694 a2->altq_disc = a3->altq_disc;
699 /* Deactivate the interface in question */
700 a2->local_flags &= ~PFALTQ_FLAG_IF_REMOVED;
701 if ((ifp1 = ifunit(a2->ifname)) == NULL ||
702 (remove && ifp1 == ifp)) {
703 a2->local_flags |= PFALTQ_FLAG_IF_REMOVED;
705 error = altq_add(a2);
707 if (ticket != V_ticket_altqs_inactive)
716 TAILQ_INSERT_TAIL(V_pf_altqs_inactive, a2, entries);
720 pf_rollback_altq(ticket);
722 pf_commit_altq(ticket);
727 pf_begin_rules(u_int32_t *ticket, int rs_num, const char *anchor)
729 struct pf_ruleset *rs;
730 struct pf_rule *rule;
734 if (rs_num < 0 || rs_num >= PF_RULESET_MAX)
736 rs = pf_find_or_create_ruleset(anchor);
739 while ((rule = TAILQ_FIRST(rs->rules[rs_num].inactive.ptr)) != NULL) {
740 pf_unlink_rule(rs->rules[rs_num].inactive.ptr, rule);
741 rs->rules[rs_num].inactive.rcount--;
743 *ticket = ++rs->rules[rs_num].inactive.ticket;
744 rs->rules[rs_num].inactive.open = 1;
749 pf_rollback_rules(u_int32_t ticket, int rs_num, char *anchor)
751 struct pf_ruleset *rs;
752 struct pf_rule *rule;
756 if (rs_num < 0 || rs_num >= PF_RULESET_MAX)
758 rs = pf_find_ruleset(anchor);
759 if (rs == NULL || !rs->rules[rs_num].inactive.open ||
760 rs->rules[rs_num].inactive.ticket != ticket)
762 while ((rule = TAILQ_FIRST(rs->rules[rs_num].inactive.ptr)) != NULL) {
763 pf_unlink_rule(rs->rules[rs_num].inactive.ptr, rule);
764 rs->rules[rs_num].inactive.rcount--;
766 rs->rules[rs_num].inactive.open = 0;
770 #define PF_MD5_UPD(st, elm) \
771 MD5Update(ctx, (u_int8_t *) &(st)->elm, sizeof((st)->elm))
773 #define PF_MD5_UPD_STR(st, elm) \
774 MD5Update(ctx, (u_int8_t *) (st)->elm, strlen((st)->elm))
776 #define PF_MD5_UPD_HTONL(st, elm, stor) do { \
777 (stor) = htonl((st)->elm); \
778 MD5Update(ctx, (u_int8_t *) &(stor), sizeof(u_int32_t));\
781 #define PF_MD5_UPD_HTONS(st, elm, stor) do { \
782 (stor) = htons((st)->elm); \
783 MD5Update(ctx, (u_int8_t *) &(stor), sizeof(u_int16_t));\
787 pf_hash_rule_addr(MD5_CTX *ctx, struct pf_rule_addr *pfr)
789 PF_MD5_UPD(pfr, addr.type);
790 switch (pfr->addr.type) {
791 case PF_ADDR_DYNIFTL:
792 PF_MD5_UPD(pfr, addr.v.ifname);
793 PF_MD5_UPD(pfr, addr.iflags);
796 PF_MD5_UPD(pfr, addr.v.tblname);
798 case PF_ADDR_ADDRMASK:
800 PF_MD5_UPD(pfr, addr.v.a.addr.addr32);
801 PF_MD5_UPD(pfr, addr.v.a.mask.addr32);
805 PF_MD5_UPD(pfr, port[0]);
806 PF_MD5_UPD(pfr, port[1]);
807 PF_MD5_UPD(pfr, neg);
808 PF_MD5_UPD(pfr, port_op);
812 pf_hash_rule(MD5_CTX *ctx, struct pf_rule *rule)
817 pf_hash_rule_addr(ctx, &rule->src);
818 pf_hash_rule_addr(ctx, &rule->dst);
819 PF_MD5_UPD_STR(rule, label);
820 PF_MD5_UPD_STR(rule, ifname);
821 PF_MD5_UPD_STR(rule, match_tagname);
822 PF_MD5_UPD_HTONS(rule, match_tag, x); /* dup? */
823 PF_MD5_UPD_HTONL(rule, os_fingerprint, y);
824 PF_MD5_UPD_HTONL(rule, prob, y);
825 PF_MD5_UPD_HTONL(rule, uid.uid[0], y);
826 PF_MD5_UPD_HTONL(rule, uid.uid[1], y);
827 PF_MD5_UPD(rule, uid.op);
828 PF_MD5_UPD_HTONL(rule, gid.gid[0], y);
829 PF_MD5_UPD_HTONL(rule, gid.gid[1], y);
830 PF_MD5_UPD(rule, gid.op);
831 PF_MD5_UPD_HTONL(rule, rule_flag, y);
832 PF_MD5_UPD(rule, action);
833 PF_MD5_UPD(rule, direction);
834 PF_MD5_UPD(rule, af);
835 PF_MD5_UPD(rule, quick);
836 PF_MD5_UPD(rule, ifnot);
837 PF_MD5_UPD(rule, match_tag_not);
838 PF_MD5_UPD(rule, natpass);
839 PF_MD5_UPD(rule, keep_state);
840 PF_MD5_UPD(rule, proto);
841 PF_MD5_UPD(rule, type);
842 PF_MD5_UPD(rule, code);
843 PF_MD5_UPD(rule, flags);
844 PF_MD5_UPD(rule, flagset);
845 PF_MD5_UPD(rule, allow_opts);
846 PF_MD5_UPD(rule, rt);
847 PF_MD5_UPD(rule, tos);
851 pf_commit_rules(u_int32_t ticket, int rs_num, char *anchor)
853 struct pf_ruleset *rs;
854 struct pf_rule *rule, **old_array;
855 struct pf_rulequeue *old_rules;
857 u_int32_t old_rcount;
861 if (rs_num < 0 || rs_num >= PF_RULESET_MAX)
863 rs = pf_find_ruleset(anchor);
864 if (rs == NULL || !rs->rules[rs_num].inactive.open ||
865 ticket != rs->rules[rs_num].inactive.ticket)
868 /* Calculate checksum for the main ruleset */
869 if (rs == &pf_main_ruleset) {
870 error = pf_setup_pfsync_matching(rs);
875 /* Swap rules, keep the old. */
876 old_rules = rs->rules[rs_num].active.ptr;
877 old_rcount = rs->rules[rs_num].active.rcount;
878 old_array = rs->rules[rs_num].active.ptr_array;
880 rs->rules[rs_num].active.ptr =
881 rs->rules[rs_num].inactive.ptr;
882 rs->rules[rs_num].active.ptr_array =
883 rs->rules[rs_num].inactive.ptr_array;
884 rs->rules[rs_num].active.rcount =
885 rs->rules[rs_num].inactive.rcount;
886 rs->rules[rs_num].inactive.ptr = old_rules;
887 rs->rules[rs_num].inactive.ptr_array = old_array;
888 rs->rules[rs_num].inactive.rcount = old_rcount;
890 rs->rules[rs_num].active.ticket =
891 rs->rules[rs_num].inactive.ticket;
892 pf_calc_skip_steps(rs->rules[rs_num].active.ptr);
895 /* Purge the old rule list. */
896 while ((rule = TAILQ_FIRST(old_rules)) != NULL)
897 pf_unlink_rule(old_rules, rule);
898 if (rs->rules[rs_num].inactive.ptr_array)
899 free(rs->rules[rs_num].inactive.ptr_array, M_TEMP);
900 rs->rules[rs_num].inactive.ptr_array = NULL;
901 rs->rules[rs_num].inactive.rcount = 0;
902 rs->rules[rs_num].inactive.open = 0;
903 pf_remove_if_empty_ruleset(rs);
909 pf_setup_pfsync_matching(struct pf_ruleset *rs)
912 struct pf_rule *rule;
914 u_int8_t digest[PF_MD5_DIGEST_LENGTH];
917 for (rs_cnt = 0; rs_cnt < PF_RULESET_MAX; rs_cnt++) {
918 /* XXX PF_RULESET_SCRUB as well? */
919 if (rs_cnt == PF_RULESET_SCRUB)
922 if (rs->rules[rs_cnt].inactive.ptr_array)
923 free(rs->rules[rs_cnt].inactive.ptr_array, M_TEMP);
924 rs->rules[rs_cnt].inactive.ptr_array = NULL;
926 if (rs->rules[rs_cnt].inactive.rcount) {
927 rs->rules[rs_cnt].inactive.ptr_array =
928 malloc(sizeof(caddr_t) *
929 rs->rules[rs_cnt].inactive.rcount,
932 if (!rs->rules[rs_cnt].inactive.ptr_array)
936 TAILQ_FOREACH(rule, rs->rules[rs_cnt].inactive.ptr,
938 pf_hash_rule(&ctx, rule);
939 (rs->rules[rs_cnt].inactive.ptr_array)[rule->nr] = rule;
943 MD5Final(digest, &ctx);
944 memcpy(V_pf_status.pf_chksum, digest, sizeof(V_pf_status.pf_chksum));
949 pf_addr_setup(struct pf_ruleset *ruleset, struct pf_addr_wrap *addr,
954 switch (addr->type) {
956 addr->p.tbl = pfr_attach_table(ruleset, addr->v.tblname);
957 if (addr->p.tbl == NULL)
960 case PF_ADDR_DYNIFTL:
961 error = pfi_dynaddr_setup(addr, af);
969 pf_addr_copyout(struct pf_addr_wrap *addr)
972 switch (addr->type) {
973 case PF_ADDR_DYNIFTL:
974 pfi_dynaddr_copyout(addr);
977 pf_tbladdr_copyout(addr);
983 pfioctl(struct cdev *dev, u_long cmd, caddr_t addr, int flags, struct thread *td)
987 /* XXX keep in sync with switch() below */
988 if (securelevel_gt(td->td_ucred, 2))
995 case DIOCSETSTATUSIF:
1001 case DIOCGETTIMEOUT:
1002 case DIOCCLRRULECTRS:
1007 case DIOCGETRULESETS:
1008 case DIOCGETRULESET:
1009 case DIOCRGETTABLES:
1010 case DIOCRGETTSTATS:
1011 case DIOCRCLRTSTATS:
1017 case DIOCRGETASTATS:
1018 case DIOCRCLRASTATS:
1021 case DIOCGETSRCNODES:
1022 case DIOCCLRSRCNODES:
1023 case DIOCIGETIFACES:
1028 case DIOCRCLRTABLES:
1029 case DIOCRADDTABLES:
1030 case DIOCRDELTABLES:
1031 case DIOCRSETTFLAGS:
1032 if (((struct pfioc_table *)addr)->pfrio_flags &
1034 break; /* dummy operation ok */
1040 if (!(flags & FWRITE))
1048 case DIOCGETTIMEOUT:
1053 case DIOCGETRULESETS:
1054 case DIOCGETRULESET:
1056 case DIOCRGETTABLES:
1057 case DIOCRGETTSTATS:
1059 case DIOCRGETASTATS:
1062 case DIOCGETSRCNODES:
1063 case DIOCIGETIFACES:
1066 case DIOCRCLRTABLES:
1067 case DIOCRADDTABLES:
1068 case DIOCRDELTABLES:
1069 case DIOCRCLRTSTATS:
1074 case DIOCRSETTFLAGS:
1075 if (((struct pfioc_table *)addr)->pfrio_flags &
1077 flags |= FWRITE; /* need write lock for dummy */
1078 break; /* dummy operation ok */
1082 if (((struct pfioc_rule *)addr)->action ==
1090 CURVNET_SET(TD_TO_VNET(td));
1094 sx_xlock(&pf_ioctl_lock);
1095 if (V_pf_status.running)
1102 DPFPRINTF(PF_DEBUG_MISC,
1103 ("pf: pfil registration failed\n"));
1106 V_pf_status.running = 1;
1107 V_pf_status.since = time_second;
1110 V_pf_stateid[cpu] = time_second;
1112 DPFPRINTF(PF_DEBUG_MISC, ("pf: started\n"));
1117 sx_xlock(&pf_ioctl_lock);
1118 if (!V_pf_status.running)
1121 V_pf_status.running = 0;
1122 error = dehook_pf();
1124 V_pf_status.running = 1;
1125 DPFPRINTF(PF_DEBUG_MISC,
1126 ("pf: pfil unregistration failed\n"));
1128 V_pf_status.since = time_second;
1129 DPFPRINTF(PF_DEBUG_MISC, ("pf: stopped\n"));
1134 struct pfioc_rule *pr = (struct pfioc_rule *)addr;
1135 struct pf_ruleset *ruleset;
1136 struct pf_rule *rule, *tail;
1137 struct pf_pooladdr *pa;
1138 struct pfi_kif *kif = NULL;
1141 if (pr->rule.return_icmp >> 8 > ICMP_MAXTYPE) {
1146 if (pr->rule.af == AF_INET) {
1147 error = EAFNOSUPPORT;
1152 if (pr->rule.af == AF_INET6) {
1153 error = EAFNOSUPPORT;
1158 rule = malloc(sizeof(*rule), M_PFRULE, M_WAITOK);
1159 bcopy(&pr->rule, rule, sizeof(struct pf_rule));
1160 if (rule->ifname[0])
1161 kif = malloc(sizeof(*kif), PFI_MTYPE, M_WAITOK);
1162 rule->states_cur = counter_u64_alloc(M_WAITOK);
1163 rule->states_tot = counter_u64_alloc(M_WAITOK);
1164 rule->src_nodes = counter_u64_alloc(M_WAITOK);
1165 rule->cuid = td->td_ucred->cr_ruid;
1166 rule->cpid = td->td_proc ? td->td_proc->p_pid : 0;
1167 TAILQ_INIT(&rule->rpool.list);
1169 #define ERROUT(x) { error = (x); goto DIOCADDRULE_error; }
1172 pr->anchor[sizeof(pr->anchor) - 1] = 0;
1173 ruleset = pf_find_ruleset(pr->anchor);
1174 if (ruleset == NULL)
1176 rs_num = pf_get_ruleset_number(pr->rule.action);
1177 if (rs_num >= PF_RULESET_MAX)
1179 if (pr->ticket != ruleset->rules[rs_num].inactive.ticket) {
1180 DPFPRINTF(PF_DEBUG_MISC,
1181 ("ticket: %d != [%d]%d\n", pr->ticket, rs_num,
1182 ruleset->rules[rs_num].inactive.ticket));
1185 if (pr->pool_ticket != V_ticket_pabuf) {
1186 DPFPRINTF(PF_DEBUG_MISC,
1187 ("pool_ticket: %d != %d\n", pr->pool_ticket,
1192 tail = TAILQ_LAST(ruleset->rules[rs_num].inactive.ptr,
1195 rule->nr = tail->nr + 1;
1198 if (rule->ifname[0]) {
1199 rule->kif = pfi_kif_attach(kif, rule->ifname);
1200 pfi_kif_ref(rule->kif);
1204 if (rule->rtableid > 0 && rule->rtableid >= rt_numfibs)
1209 if (rule->qname[0] != 0) {
1210 if ((rule->qid = pf_qname2qid(rule->qname)) == 0)
1212 else if (rule->pqname[0] != 0) {
1214 pf_qname2qid(rule->pqname)) == 0)
1217 rule->pqid = rule->qid;
1220 if (rule->tagname[0])
1221 if ((rule->tag = pf_tagname2tag(rule->tagname)) == 0)
1223 if (rule->match_tagname[0])
1224 if ((rule->match_tag =
1225 pf_tagname2tag(rule->match_tagname)) == 0)
1227 if (rule->rt && !rule->direction)
1231 if (rule->logif >= PFLOGIFS_MAX)
1233 if (pf_addr_setup(ruleset, &rule->src.addr, rule->af))
1235 if (pf_addr_setup(ruleset, &rule->dst.addr, rule->af))
1237 if (pf_anchor_setup(rule, ruleset, pr->anchor_call))
1239 TAILQ_FOREACH(pa, &V_pf_pabuf, entries)
1240 if (pa->addr.type == PF_ADDR_TABLE) {
1241 pa->addr.p.tbl = pfr_attach_table(ruleset,
1242 pa->addr.v.tblname);
1243 if (pa->addr.p.tbl == NULL)
1247 if (rule->overload_tblname[0]) {
1248 if ((rule->overload_tbl = pfr_attach_table(ruleset,
1249 rule->overload_tblname)) == NULL)
1252 rule->overload_tbl->pfrkt_flags |=
1256 pf_mv_pool(&V_pf_pabuf, &rule->rpool.list);
1257 if (((((rule->action == PF_NAT) || (rule->action == PF_RDR) ||
1258 (rule->action == PF_BINAT)) && rule->anchor == NULL) ||
1259 (rule->rt > PF_FASTROUTE)) &&
1260 (TAILQ_FIRST(&rule->rpool.list) == NULL))
1269 rule->rpool.cur = TAILQ_FIRST(&rule->rpool.list);
1270 rule->evaluations = rule->packets[0] = rule->packets[1] =
1271 rule->bytes[0] = rule->bytes[1] = 0;
1272 TAILQ_INSERT_TAIL(ruleset->rules[rs_num].inactive.ptr,
1274 ruleset->rules[rs_num].inactive.rcount++;
1281 counter_u64_free(rule->states_cur);
1282 counter_u64_free(rule->states_tot);
1283 counter_u64_free(rule->src_nodes);
1284 free(rule, M_PFRULE);
1286 free(kif, PFI_MTYPE);
1290 case DIOCGETRULES: {
1291 struct pfioc_rule *pr = (struct pfioc_rule *)addr;
1292 struct pf_ruleset *ruleset;
1293 struct pf_rule *tail;
1297 pr->anchor[sizeof(pr->anchor) - 1] = 0;
1298 ruleset = pf_find_ruleset(pr->anchor);
1299 if (ruleset == NULL) {
1304 rs_num = pf_get_ruleset_number(pr->rule.action);
1305 if (rs_num >= PF_RULESET_MAX) {
1310 tail = TAILQ_LAST(ruleset->rules[rs_num].active.ptr,
1313 pr->nr = tail->nr + 1;
1316 pr->ticket = ruleset->rules[rs_num].active.ticket;
1322 struct pfioc_rule *pr = (struct pfioc_rule *)addr;
1323 struct pf_ruleset *ruleset;
1324 struct pf_rule *rule;
1328 pr->anchor[sizeof(pr->anchor) - 1] = 0;
1329 ruleset = pf_find_ruleset(pr->anchor);
1330 if (ruleset == NULL) {
1335 rs_num = pf_get_ruleset_number(pr->rule.action);
1336 if (rs_num >= PF_RULESET_MAX) {
1341 if (pr->ticket != ruleset->rules[rs_num].active.ticket) {
1346 rule = TAILQ_FIRST(ruleset->rules[rs_num].active.ptr);
1347 while ((rule != NULL) && (rule->nr != pr->nr))
1348 rule = TAILQ_NEXT(rule, entries);
1354 bcopy(rule, &pr->rule, sizeof(struct pf_rule));
1355 pr->rule.u_states_cur = counter_u64_fetch(rule->states_cur);
1356 pr->rule.u_states_tot = counter_u64_fetch(rule->states_tot);
1357 pr->rule.u_src_nodes = counter_u64_fetch(rule->src_nodes);
1358 if (pf_anchor_copyout(ruleset, rule, pr)) {
1363 pf_addr_copyout(&pr->rule.src.addr);
1364 pf_addr_copyout(&pr->rule.dst.addr);
1365 for (i = 0; i < PF_SKIP_COUNT; ++i)
1366 if (rule->skip[i].ptr == NULL)
1367 pr->rule.skip[i].nr = -1;
1369 pr->rule.skip[i].nr =
1370 rule->skip[i].ptr->nr;
1372 if (pr->action == PF_GET_CLR_CNTR) {
1373 rule->evaluations = 0;
1374 rule->packets[0] = rule->packets[1] = 0;
1375 rule->bytes[0] = rule->bytes[1] = 0;
1376 counter_u64_zero(rule->states_tot);
1382 case DIOCCHANGERULE: {
1383 struct pfioc_rule *pcr = (struct pfioc_rule *)addr;
1384 struct pf_ruleset *ruleset;
1385 struct pf_rule *oldrule = NULL, *newrule = NULL;
1386 struct pfi_kif *kif = NULL;
1387 struct pf_pooladdr *pa;
1391 if (pcr->action < PF_CHANGE_ADD_HEAD ||
1392 pcr->action > PF_CHANGE_GET_TICKET) {
1396 if (pcr->rule.return_icmp >> 8 > ICMP_MAXTYPE) {
1401 if (pcr->action != PF_CHANGE_REMOVE) {
1403 if (pcr->rule.af == AF_INET) {
1404 error = EAFNOSUPPORT;
1409 if (pcr->rule.af == AF_INET6) {
1410 error = EAFNOSUPPORT;
1414 newrule = malloc(sizeof(*newrule), M_PFRULE, M_WAITOK);
1415 bcopy(&pcr->rule, newrule, sizeof(struct pf_rule));
1416 if (newrule->ifname[0])
1417 kif = malloc(sizeof(*kif), PFI_MTYPE, M_WAITOK);
1418 newrule->states_cur = counter_u64_alloc(M_WAITOK);
1419 newrule->states_tot = counter_u64_alloc(M_WAITOK);
1420 newrule->src_nodes = counter_u64_alloc(M_WAITOK);
1421 newrule->cuid = td->td_ucred->cr_ruid;
1422 newrule->cpid = td->td_proc ? td->td_proc->p_pid : 0;
1423 TAILQ_INIT(&newrule->rpool.list);
1426 #define ERROUT(x) { error = (x); goto DIOCCHANGERULE_error; }
1429 if (!(pcr->action == PF_CHANGE_REMOVE ||
1430 pcr->action == PF_CHANGE_GET_TICKET) &&
1431 pcr->pool_ticket != V_ticket_pabuf)
1434 ruleset = pf_find_ruleset(pcr->anchor);
1435 if (ruleset == NULL)
1438 rs_num = pf_get_ruleset_number(pcr->rule.action);
1439 if (rs_num >= PF_RULESET_MAX)
1442 if (pcr->action == PF_CHANGE_GET_TICKET) {
1443 pcr->ticket = ++ruleset->rules[rs_num].active.ticket;
1445 } else if (pcr->ticket !=
1446 ruleset->rules[rs_num].active.ticket)
1449 if (pcr->action != PF_CHANGE_REMOVE) {
1450 if (newrule->ifname[0]) {
1451 newrule->kif = pfi_kif_attach(kif,
1453 pfi_kif_ref(newrule->kif);
1455 newrule->kif = NULL;
1457 if (newrule->rtableid > 0 &&
1458 newrule->rtableid >= rt_numfibs)
1463 if (newrule->qname[0] != 0) {
1465 pf_qname2qid(newrule->qname)) == 0)
1467 else if (newrule->pqname[0] != 0) {
1468 if ((newrule->pqid =
1469 pf_qname2qid(newrule->pqname)) == 0)
1472 newrule->pqid = newrule->qid;
1475 if (newrule->tagname[0])
1477 pf_tagname2tag(newrule->tagname)) == 0)
1479 if (newrule->match_tagname[0])
1480 if ((newrule->match_tag = pf_tagname2tag(
1481 newrule->match_tagname)) == 0)
1483 if (newrule->rt && !newrule->direction)
1487 if (newrule->logif >= PFLOGIFS_MAX)
1489 if (pf_addr_setup(ruleset, &newrule->src.addr, newrule->af))
1491 if (pf_addr_setup(ruleset, &newrule->dst.addr, newrule->af))
1493 if (pf_anchor_setup(newrule, ruleset, pcr->anchor_call))
1495 TAILQ_FOREACH(pa, &V_pf_pabuf, entries)
1496 if (pa->addr.type == PF_ADDR_TABLE) {
1498 pfr_attach_table(ruleset,
1499 pa->addr.v.tblname);
1500 if (pa->addr.p.tbl == NULL)
1504 if (newrule->overload_tblname[0]) {
1505 if ((newrule->overload_tbl = pfr_attach_table(
1506 ruleset, newrule->overload_tblname)) ==
1510 newrule->overload_tbl->pfrkt_flags |=
1514 pf_mv_pool(&V_pf_pabuf, &newrule->rpool.list);
1515 if (((((newrule->action == PF_NAT) ||
1516 (newrule->action == PF_RDR) ||
1517 (newrule->action == PF_BINAT) ||
1518 (newrule->rt > PF_FASTROUTE)) &&
1519 !newrule->anchor)) &&
1520 (TAILQ_FIRST(&newrule->rpool.list) == NULL))
1524 pf_free_rule(newrule);
1529 newrule->rpool.cur = TAILQ_FIRST(&newrule->rpool.list);
1530 newrule->evaluations = 0;
1531 newrule->packets[0] = newrule->packets[1] = 0;
1532 newrule->bytes[0] = newrule->bytes[1] = 0;
1534 pf_empty_pool(&V_pf_pabuf);
1536 if (pcr->action == PF_CHANGE_ADD_HEAD)
1537 oldrule = TAILQ_FIRST(
1538 ruleset->rules[rs_num].active.ptr);
1539 else if (pcr->action == PF_CHANGE_ADD_TAIL)
1540 oldrule = TAILQ_LAST(
1541 ruleset->rules[rs_num].active.ptr, pf_rulequeue);
1543 oldrule = TAILQ_FIRST(
1544 ruleset->rules[rs_num].active.ptr);
1545 while ((oldrule != NULL) && (oldrule->nr != pcr->nr))
1546 oldrule = TAILQ_NEXT(oldrule, entries);
1547 if (oldrule == NULL) {
1548 if (newrule != NULL)
1549 pf_free_rule(newrule);
1556 if (pcr->action == PF_CHANGE_REMOVE) {
1557 pf_unlink_rule(ruleset->rules[rs_num].active.ptr,
1559 ruleset->rules[rs_num].active.rcount--;
1561 if (oldrule == NULL)
1563 ruleset->rules[rs_num].active.ptr,
1565 else if (pcr->action == PF_CHANGE_ADD_HEAD ||
1566 pcr->action == PF_CHANGE_ADD_BEFORE)
1567 TAILQ_INSERT_BEFORE(oldrule, newrule, entries);
1570 ruleset->rules[rs_num].active.ptr,
1571 oldrule, newrule, entries);
1572 ruleset->rules[rs_num].active.rcount++;
1576 TAILQ_FOREACH(oldrule,
1577 ruleset->rules[rs_num].active.ptr, entries)
1580 ruleset->rules[rs_num].active.ticket++;
1582 pf_calc_skip_steps(ruleset->rules[rs_num].active.ptr);
1583 pf_remove_if_empty_ruleset(ruleset);
1589 DIOCCHANGERULE_error:
1591 if (newrule != NULL) {
1592 counter_u64_free(newrule->states_cur);
1593 counter_u64_free(newrule->states_tot);
1594 counter_u64_free(newrule->src_nodes);
1595 free(newrule, M_PFRULE);
1598 free(kif, PFI_MTYPE);
1602 case DIOCCLRSTATES: {
1604 struct pfioc_state_kill *psk = (struct pfioc_state_kill *)addr;
1605 u_int i, killed = 0;
1607 for (i = 0; i <= pf_hashmask; i++) {
1608 struct pf_idhash *ih = &V_pf_idhash[i];
1610 relock_DIOCCLRSTATES:
1611 PF_HASHROW_LOCK(ih);
1612 LIST_FOREACH(s, &ih->states, entry)
1613 if (!psk->psk_ifname[0] ||
1614 !strcmp(psk->psk_ifname,
1615 s->kif->pfik_name)) {
1617 * Don't send out individual
1620 s->state_flags |= PFSTATE_NOSYNC;
1621 pf_unlink_state(s, PF_ENTER_LOCKED);
1623 goto relock_DIOCCLRSTATES;
1625 PF_HASHROW_UNLOCK(ih);
1627 psk->psk_killed = killed;
1628 if (pfsync_clear_states_ptr != NULL)
1629 pfsync_clear_states_ptr(V_pf_status.hostid, psk->psk_ifname);
1633 case DIOCKILLSTATES: {
1635 struct pf_state_key *sk;
1636 struct pf_addr *srcaddr, *dstaddr;
1637 u_int16_t srcport, dstport;
1638 struct pfioc_state_kill *psk = (struct pfioc_state_kill *)addr;
1639 u_int i, killed = 0;
1641 if (psk->psk_pfcmp.id) {
1642 if (psk->psk_pfcmp.creatorid == 0)
1643 psk->psk_pfcmp.creatorid = V_pf_status.hostid;
1644 if ((s = pf_find_state_byid(psk->psk_pfcmp.id,
1645 psk->psk_pfcmp.creatorid))) {
1646 pf_unlink_state(s, PF_ENTER_LOCKED);
1647 psk->psk_killed = 1;
1652 for (i = 0; i <= pf_hashmask; i++) {
1653 struct pf_idhash *ih = &V_pf_idhash[i];
1655 relock_DIOCKILLSTATES:
1656 PF_HASHROW_LOCK(ih);
1657 LIST_FOREACH(s, &ih->states, entry) {
1658 sk = s->key[PF_SK_WIRE];
1659 if (s->direction == PF_OUT) {
1660 srcaddr = &sk->addr[1];
1661 dstaddr = &sk->addr[0];
1662 srcport = sk->port[0];
1663 dstport = sk->port[0];
1665 srcaddr = &sk->addr[0];
1666 dstaddr = &sk->addr[1];
1667 srcport = sk->port[0];
1668 dstport = sk->port[0];
1671 if ((!psk->psk_af || sk->af == psk->psk_af)
1672 && (!psk->psk_proto || psk->psk_proto ==
1674 PF_MATCHA(psk->psk_src.neg,
1675 &psk->psk_src.addr.v.a.addr,
1676 &psk->psk_src.addr.v.a.mask,
1678 PF_MATCHA(psk->psk_dst.neg,
1679 &psk->psk_dst.addr.v.a.addr,
1680 &psk->psk_dst.addr.v.a.mask,
1682 (psk->psk_src.port_op == 0 ||
1683 pf_match_port(psk->psk_src.port_op,
1684 psk->psk_src.port[0], psk->psk_src.port[1],
1686 (psk->psk_dst.port_op == 0 ||
1687 pf_match_port(psk->psk_dst.port_op,
1688 psk->psk_dst.port[0], psk->psk_dst.port[1],
1690 (!psk->psk_label[0] ||
1691 (s->rule.ptr->label[0] &&
1692 !strcmp(psk->psk_label,
1693 s->rule.ptr->label))) &&
1694 (!psk->psk_ifname[0] ||
1695 !strcmp(psk->psk_ifname,
1696 s->kif->pfik_name))) {
1697 pf_unlink_state(s, PF_ENTER_LOCKED);
1699 goto relock_DIOCKILLSTATES;
1702 PF_HASHROW_UNLOCK(ih);
1704 psk->psk_killed = killed;
1708 case DIOCADDSTATE: {
1709 struct pfioc_state *ps = (struct pfioc_state *)addr;
1710 struct pfsync_state *sp = &ps->state;
1712 if (sp->timeout >= PFTM_MAX) {
1716 if (pfsync_state_import_ptr != NULL) {
1718 error = pfsync_state_import_ptr(sp, PFSYNC_SI_IOCTL);
1725 case DIOCGETSTATE: {
1726 struct pfioc_state *ps = (struct pfioc_state *)addr;
1729 s = pf_find_state_byid(ps->state.id, ps->state.creatorid);
1735 pfsync_state_export(&ps->state, s);
1740 case DIOCGETSTATES: {
1741 struct pfioc_states *ps = (struct pfioc_states *)addr;
1743 struct pfsync_state *pstore, *p;
1746 if (ps->ps_len == 0) {
1747 nr = uma_zone_get_cur(V_pf_state_z);
1748 ps->ps_len = sizeof(struct pfsync_state) * nr;
1752 p = pstore = malloc(ps->ps_len, M_TEMP, M_WAITOK);
1755 for (i = 0; i <= pf_hashmask; i++) {
1756 struct pf_idhash *ih = &V_pf_idhash[i];
1758 PF_HASHROW_LOCK(ih);
1759 LIST_FOREACH(s, &ih->states, entry) {
1761 if (s->timeout == PFTM_UNLINKED)
1764 if ((nr+1) * sizeof(*p) > ps->ps_len) {
1765 PF_HASHROW_UNLOCK(ih);
1766 goto DIOCGETSTATES_full;
1768 pfsync_state_export(p, s);
1772 PF_HASHROW_UNLOCK(ih);
1775 error = copyout(pstore, ps->ps_states,
1776 sizeof(struct pfsync_state) * nr);
1778 free(pstore, M_TEMP);
1781 ps->ps_len = sizeof(struct pfsync_state) * nr;
1782 free(pstore, M_TEMP);
1787 case DIOCGETSTATUS: {
1788 struct pf_status *s = (struct pf_status *)addr;
1791 s->running = V_pf_status.running;
1792 s->since = V_pf_status.since;
1793 s->debug = V_pf_status.debug;
1794 s->hostid = V_pf_status.hostid;
1795 s->states = V_pf_status.states;
1796 s->src_nodes = V_pf_status.src_nodes;
1798 for (int i = 0; i < PFRES_MAX; i++)
1800 counter_u64_fetch(V_pf_status.counters[i]);
1801 for (int i = 0; i < LCNT_MAX; i++)
1803 counter_u64_fetch(V_pf_status.lcounters[i]);
1804 for (int i = 0; i < FCNT_MAX; i++)
1806 counter_u64_fetch(V_pf_status.fcounters[i]);
1807 for (int i = 0; i < SCNT_MAX; i++)
1809 counter_u64_fetch(V_pf_status.scounters[i]);
1811 bcopy(V_pf_status.ifname, s->ifname, IFNAMSIZ);
1812 bcopy(V_pf_status.pf_chksum, s->pf_chksum,
1813 PF_MD5_DIGEST_LENGTH);
1815 pfi_update_status(s->ifname, s);
1820 case DIOCSETSTATUSIF: {
1821 struct pfioc_if *pi = (struct pfioc_if *)addr;
1823 if (pi->ifname[0] == 0) {
1824 bzero(V_pf_status.ifname, IFNAMSIZ);
1828 strlcpy(V_pf_status.ifname, pi->ifname, IFNAMSIZ);
1833 case DIOCCLRSTATUS: {
1835 for (int i = 0; i < PFRES_MAX; i++)
1836 counter_u64_zero(V_pf_status.counters[i]);
1837 for (int i = 0; i < FCNT_MAX; i++)
1838 counter_u64_zero(V_pf_status.fcounters[i]);
1839 for (int i = 0; i < SCNT_MAX; i++)
1840 counter_u64_zero(V_pf_status.scounters[i]);
1841 V_pf_status.since = time_second;
1842 if (*V_pf_status.ifname)
1843 pfi_update_status(V_pf_status.ifname, NULL);
1849 struct pfioc_natlook *pnl = (struct pfioc_natlook *)addr;
1850 struct pf_state_key *sk;
1851 struct pf_state *state;
1852 struct pf_state_key_cmp key;
1853 int m = 0, direction = pnl->direction;
1856 /* NATLOOK src and dst are reversed, so reverse sidx/didx */
1857 sidx = (direction == PF_IN) ? 1 : 0;
1858 didx = (direction == PF_IN) ? 0 : 1;
1861 PF_AZERO(&pnl->saddr, pnl->af) ||
1862 PF_AZERO(&pnl->daddr, pnl->af) ||
1863 ((pnl->proto == IPPROTO_TCP ||
1864 pnl->proto == IPPROTO_UDP) &&
1865 (!pnl->dport || !pnl->sport)))
1868 bzero(&key, sizeof(key));
1870 key.proto = pnl->proto;
1871 PF_ACPY(&key.addr[sidx], &pnl->saddr, pnl->af);
1872 key.port[sidx] = pnl->sport;
1873 PF_ACPY(&key.addr[didx], &pnl->daddr, pnl->af);
1874 key.port[didx] = pnl->dport;
1876 state = pf_find_state_all(&key, direction, &m);
1879 error = E2BIG; /* more than one state */
1880 else if (state != NULL) {
1881 /* XXXGL: not locked read */
1882 sk = state->key[sidx];
1883 PF_ACPY(&pnl->rsaddr, &sk->addr[sidx], sk->af);
1884 pnl->rsport = sk->port[sidx];
1885 PF_ACPY(&pnl->rdaddr, &sk->addr[didx], sk->af);
1886 pnl->rdport = sk->port[didx];
1893 case DIOCSETTIMEOUT: {
1894 struct pfioc_tm *pt = (struct pfioc_tm *)addr;
1897 if (pt->timeout < 0 || pt->timeout >= PFTM_MAX ||
1903 old = V_pf_default_rule.timeout[pt->timeout];
1904 if (pt->timeout == PFTM_INTERVAL && pt->seconds == 0)
1906 V_pf_default_rule.timeout[pt->timeout] = pt->seconds;
1907 if (pt->timeout == PFTM_INTERVAL && pt->seconds < old)
1908 wakeup(pf_purge_thread);
1914 case DIOCGETTIMEOUT: {
1915 struct pfioc_tm *pt = (struct pfioc_tm *)addr;
1917 if (pt->timeout < 0 || pt->timeout >= PFTM_MAX) {
1922 pt->seconds = V_pf_default_rule.timeout[pt->timeout];
1927 case DIOCGETLIMIT: {
1928 struct pfioc_limit *pl = (struct pfioc_limit *)addr;
1930 if (pl->index < 0 || pl->index >= PF_LIMIT_MAX) {
1935 pl->limit = V_pf_limits[pl->index].limit;
1940 case DIOCSETLIMIT: {
1941 struct pfioc_limit *pl = (struct pfioc_limit *)addr;
1945 if (pl->index < 0 || pl->index >= PF_LIMIT_MAX ||
1946 V_pf_limits[pl->index].zone == NULL) {
1951 uma_zone_set_max(V_pf_limits[pl->index].zone, pl->limit);
1952 old_limit = V_pf_limits[pl->index].limit;
1953 V_pf_limits[pl->index].limit = pl->limit;
1954 pl->limit = old_limit;
1959 case DIOCSETDEBUG: {
1960 u_int32_t *level = (u_int32_t *)addr;
1963 V_pf_status.debug = *level;
1968 case DIOCCLRRULECTRS: {
1969 /* obsoleted by DIOCGETRULE with action=PF_GET_CLR_CNTR */
1970 struct pf_ruleset *ruleset = &pf_main_ruleset;
1971 struct pf_rule *rule;
1975 ruleset->rules[PF_RULESET_FILTER].active.ptr, entries) {
1976 rule->evaluations = 0;
1977 rule->packets[0] = rule->packets[1] = 0;
1978 rule->bytes[0] = rule->bytes[1] = 0;
1984 case DIOCGIFSPEED: {
1985 struct pf_ifspeed *psp = (struct pf_ifspeed *)addr;
1986 struct pf_ifspeed ps;
1989 if (psp->ifname[0] != 0) {
1990 /* Can we completely trust user-land? */
1991 strlcpy(ps.ifname, psp->ifname, IFNAMSIZ);
1992 ifp = ifunit(ps.ifname);
1994 psp->baudrate = ifp->if_baudrate;
2003 case DIOCSTARTALTQ: {
2004 struct pf_altq *altq;
2007 /* enable all altq interfaces on active list */
2008 TAILQ_FOREACH(altq, V_pf_altqs_active, entries) {
2009 if (altq->qname[0] == 0 && (altq->local_flags &
2010 PFALTQ_FLAG_IF_REMOVED) == 0) {
2011 error = pf_enable_altq(altq);
2017 V_pf_altq_running = 1;
2019 DPFPRINTF(PF_DEBUG_MISC, ("altq: started\n"));
2023 case DIOCSTOPALTQ: {
2024 struct pf_altq *altq;
2027 /* disable all altq interfaces on active list */
2028 TAILQ_FOREACH(altq, V_pf_altqs_active, entries) {
2029 if (altq->qname[0] == 0 && (altq->local_flags &
2030 PFALTQ_FLAG_IF_REMOVED) == 0) {
2031 error = pf_disable_altq(altq);
2037 V_pf_altq_running = 0;
2039 DPFPRINTF(PF_DEBUG_MISC, ("altq: stopped\n"));
2044 struct pfioc_altq *pa = (struct pfioc_altq *)addr;
2045 struct pf_altq *altq, *a;
2048 altq = malloc(sizeof(*altq), M_PFALTQ, M_WAITOK);
2049 bcopy(&pa->altq, altq, sizeof(struct pf_altq));
2050 altq->local_flags = 0;
2053 if (pa->ticket != V_ticket_altqs_inactive) {
2055 free(altq, M_PFALTQ);
2061 * if this is for a queue, find the discipline and
2062 * copy the necessary fields
2064 if (altq->qname[0] != 0) {
2065 if ((altq->qid = pf_qname2qid(altq->qname)) == 0) {
2068 free(altq, M_PFALTQ);
2071 altq->altq_disc = NULL;
2072 TAILQ_FOREACH(a, V_pf_altqs_inactive, entries) {
2073 if (strncmp(a->ifname, altq->ifname,
2074 IFNAMSIZ) == 0 && a->qname[0] == 0) {
2075 altq->altq_disc = a->altq_disc;
2081 if ((ifp = ifunit(altq->ifname)) == NULL)
2082 altq->local_flags |= PFALTQ_FLAG_IF_REMOVED;
2084 error = altq_add(altq);
2088 free(altq, M_PFALTQ);
2092 TAILQ_INSERT_TAIL(V_pf_altqs_inactive, altq, entries);
2093 bcopy(altq, &pa->altq, sizeof(struct pf_altq));
2098 case DIOCGETALTQS: {
2099 struct pfioc_altq *pa = (struct pfioc_altq *)addr;
2100 struct pf_altq *altq;
2104 TAILQ_FOREACH(altq, V_pf_altqs_active, entries)
2106 pa->ticket = V_ticket_altqs_active;
2112 struct pfioc_altq *pa = (struct pfioc_altq *)addr;
2113 struct pf_altq *altq;
2117 if (pa->ticket != V_ticket_altqs_active) {
2123 altq = TAILQ_FIRST(V_pf_altqs_active);
2124 while ((altq != NULL) && (nr < pa->nr)) {
2125 altq = TAILQ_NEXT(altq, entries);
2133 bcopy(altq, &pa->altq, sizeof(struct pf_altq));
2138 case DIOCCHANGEALTQ:
2139 /* CHANGEALTQ not supported yet! */
2143 case DIOCGETQSTATS: {
2144 struct pfioc_qstats *pq = (struct pfioc_qstats *)addr;
2145 struct pf_altq *altq;
2150 if (pq->ticket != V_ticket_altqs_active) {
2155 nbytes = pq->nbytes;
2157 altq = TAILQ_FIRST(V_pf_altqs_active);
2158 while ((altq != NULL) && (nr < pq->nr)) {
2159 altq = TAILQ_NEXT(altq, entries);
2168 if ((altq->local_flags & PFALTQ_FLAG_IF_REMOVED) != 0) {
2174 error = altq_getqstats(altq, pq->buf, &nbytes);
2176 pq->scheduler = altq->scheduler;
2177 pq->nbytes = nbytes;
2183 case DIOCBEGINADDRS: {
2184 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr;
2187 pf_empty_pool(&V_pf_pabuf);
2188 pp->ticket = ++V_ticket_pabuf;
2194 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr;
2195 struct pf_pooladdr *pa;
2196 struct pfi_kif *kif = NULL;
2199 if (pp->af == AF_INET) {
2200 error = EAFNOSUPPORT;
2205 if (pp->af == AF_INET6) {
2206 error = EAFNOSUPPORT;
2210 if (pp->addr.addr.type != PF_ADDR_ADDRMASK &&
2211 pp->addr.addr.type != PF_ADDR_DYNIFTL &&
2212 pp->addr.addr.type != PF_ADDR_TABLE) {
2216 pa = malloc(sizeof(*pa), M_PFRULE, M_WAITOK);
2217 bcopy(&pp->addr, pa, sizeof(struct pf_pooladdr));
2219 kif = malloc(sizeof(*kif), PFI_MTYPE, M_WAITOK);
2221 if (pp->ticket != V_ticket_pabuf) {
2224 free(kif, PFI_MTYPE);
2229 if (pa->ifname[0]) {
2230 pa->kif = pfi_kif_attach(kif, pa->ifname);
2231 pfi_kif_ref(pa->kif);
2234 if (pa->addr.type == PF_ADDR_DYNIFTL && ((error =
2235 pfi_dynaddr_setup(&pa->addr, pp->af)) != 0)) {
2237 pfi_kif_unref(pa->kif);
2242 TAILQ_INSERT_TAIL(&V_pf_pabuf, pa, entries);
2247 case DIOCGETADDRS: {
2248 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr;
2249 struct pf_pool *pool;
2250 struct pf_pooladdr *pa;
2254 pool = pf_get_pool(pp->anchor, pp->ticket, pp->r_action,
2255 pp->r_num, 0, 1, 0);
2261 TAILQ_FOREACH(pa, &pool->list, entries)
2268 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr;
2269 struct pf_pool *pool;
2270 struct pf_pooladdr *pa;
2274 pool = pf_get_pool(pp->anchor, pp->ticket, pp->r_action,
2275 pp->r_num, 0, 1, 1);
2281 pa = TAILQ_FIRST(&pool->list);
2282 while ((pa != NULL) && (nr < pp->nr)) {
2283 pa = TAILQ_NEXT(pa, entries);
2291 bcopy(pa, &pp->addr, sizeof(struct pf_pooladdr));
2292 pf_addr_copyout(&pp->addr.addr);
2297 case DIOCCHANGEADDR: {
2298 struct pfioc_pooladdr *pca = (struct pfioc_pooladdr *)addr;
2299 struct pf_pool *pool;
2300 struct pf_pooladdr *oldpa = NULL, *newpa = NULL;
2301 struct pf_ruleset *ruleset;
2302 struct pfi_kif *kif = NULL;
2304 if (pca->action < PF_CHANGE_ADD_HEAD ||
2305 pca->action > PF_CHANGE_REMOVE) {
2309 if (pca->addr.addr.type != PF_ADDR_ADDRMASK &&
2310 pca->addr.addr.type != PF_ADDR_DYNIFTL &&
2311 pca->addr.addr.type != PF_ADDR_TABLE) {
2316 if (pca->action != PF_CHANGE_REMOVE) {
2318 if (pca->af == AF_INET) {
2319 error = EAFNOSUPPORT;
2324 if (pca->af == AF_INET6) {
2325 error = EAFNOSUPPORT;
2329 newpa = malloc(sizeof(*newpa), M_PFRULE, M_WAITOK);
2330 bcopy(&pca->addr, newpa, sizeof(struct pf_pooladdr));
2331 if (newpa->ifname[0])
2332 kif = malloc(sizeof(*kif), PFI_MTYPE, M_WAITOK);
2336 #define ERROUT(x) { error = (x); goto DIOCCHANGEADDR_error; }
2338 ruleset = pf_find_ruleset(pca->anchor);
2339 if (ruleset == NULL)
2342 pool = pf_get_pool(pca->anchor, pca->ticket, pca->r_action,
2343 pca->r_num, pca->r_last, 1, 1);
2347 if (pca->action != PF_CHANGE_REMOVE) {
2348 if (newpa->ifname[0]) {
2349 newpa->kif = pfi_kif_attach(kif, newpa->ifname);
2350 pfi_kif_ref(newpa->kif);
2354 switch (newpa->addr.type) {
2355 case PF_ADDR_DYNIFTL:
2356 error = pfi_dynaddr_setup(&newpa->addr,
2360 newpa->addr.p.tbl = pfr_attach_table(ruleset,
2361 newpa->addr.v.tblname);
2362 if (newpa->addr.p.tbl == NULL)
2367 goto DIOCCHANGEADDR_error;
2370 switch (pca->action) {
2371 case PF_CHANGE_ADD_HEAD:
2372 oldpa = TAILQ_FIRST(&pool->list);
2374 case PF_CHANGE_ADD_TAIL:
2375 oldpa = TAILQ_LAST(&pool->list, pf_palist);
2378 oldpa = TAILQ_FIRST(&pool->list);
2379 for (int i = 0; oldpa && i < pca->nr; i++)
2380 oldpa = TAILQ_NEXT(oldpa, entries);
2386 if (pca->action == PF_CHANGE_REMOVE) {
2387 TAILQ_REMOVE(&pool->list, oldpa, entries);
2388 switch (oldpa->addr.type) {
2389 case PF_ADDR_DYNIFTL:
2390 pfi_dynaddr_remove(oldpa->addr.p.dyn);
2393 pfr_detach_table(oldpa->addr.p.tbl);
2397 pfi_kif_unref(oldpa->kif);
2398 free(oldpa, M_PFRULE);
2401 TAILQ_INSERT_TAIL(&pool->list, newpa, entries);
2402 else if (pca->action == PF_CHANGE_ADD_HEAD ||
2403 pca->action == PF_CHANGE_ADD_BEFORE)
2404 TAILQ_INSERT_BEFORE(oldpa, newpa, entries);
2406 TAILQ_INSERT_AFTER(&pool->list, oldpa,
2410 pool->cur = TAILQ_FIRST(&pool->list);
2411 PF_ACPY(&pool->counter, &pool->cur->addr.v.a.addr, pca->af);
2416 DIOCCHANGEADDR_error:
2418 pfi_kif_unref(newpa->kif);
2421 free(newpa, M_PFRULE);
2423 free(kif, PFI_MTYPE);
2427 case DIOCGETRULESETS: {
2428 struct pfioc_ruleset *pr = (struct pfioc_ruleset *)addr;
2429 struct pf_ruleset *ruleset;
2430 struct pf_anchor *anchor;
2433 pr->path[sizeof(pr->path) - 1] = 0;
2434 if ((ruleset = pf_find_ruleset(pr->path)) == NULL) {
2440 if (ruleset->anchor == NULL) {
2441 /* XXX kludge for pf_main_ruleset */
2442 RB_FOREACH(anchor, pf_anchor_global, &V_pf_anchors)
2443 if (anchor->parent == NULL)
2446 RB_FOREACH(anchor, pf_anchor_node,
2447 &ruleset->anchor->children)
2454 case DIOCGETRULESET: {
2455 struct pfioc_ruleset *pr = (struct pfioc_ruleset *)addr;
2456 struct pf_ruleset *ruleset;
2457 struct pf_anchor *anchor;
2461 pr->path[sizeof(pr->path) - 1] = 0;
2462 if ((ruleset = pf_find_ruleset(pr->path)) == NULL) {
2468 if (ruleset->anchor == NULL) {
2469 /* XXX kludge for pf_main_ruleset */
2470 RB_FOREACH(anchor, pf_anchor_global, &V_pf_anchors)
2471 if (anchor->parent == NULL && nr++ == pr->nr) {
2472 strlcpy(pr->name, anchor->name,
2477 RB_FOREACH(anchor, pf_anchor_node,
2478 &ruleset->anchor->children)
2479 if (nr++ == pr->nr) {
2480 strlcpy(pr->name, anchor->name,
2491 case DIOCRCLRTABLES: {
2492 struct pfioc_table *io = (struct pfioc_table *)addr;
2494 if (io->pfrio_esize != 0) {
2499 error = pfr_clr_tables(&io->pfrio_table, &io->pfrio_ndel,
2500 io->pfrio_flags | PFR_FLAG_USERIOCTL);
2505 case DIOCRADDTABLES: {
2506 struct pfioc_table *io = (struct pfioc_table *)addr;
2507 struct pfr_table *pfrts;
2510 if (io->pfrio_esize != sizeof(struct pfr_table)) {
2514 totlen = io->pfrio_size * sizeof(struct pfr_table);
2515 pfrts = malloc(totlen, M_TEMP, M_WAITOK);
2516 error = copyin(io->pfrio_buffer, pfrts, totlen);
2518 free(pfrts, M_TEMP);
2522 error = pfr_add_tables(pfrts, io->pfrio_size,
2523 &io->pfrio_nadd, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2525 free(pfrts, M_TEMP);
2529 case DIOCRDELTABLES: {
2530 struct pfioc_table *io = (struct pfioc_table *)addr;
2531 struct pfr_table *pfrts;
2534 if (io->pfrio_esize != sizeof(struct pfr_table)) {
2538 totlen = io->pfrio_size * sizeof(struct pfr_table);
2539 pfrts = malloc(totlen, M_TEMP, M_WAITOK);
2540 error = copyin(io->pfrio_buffer, pfrts, totlen);
2542 free(pfrts, M_TEMP);
2546 error = pfr_del_tables(pfrts, io->pfrio_size,
2547 &io->pfrio_ndel, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2549 free(pfrts, M_TEMP);
2553 case DIOCRGETTABLES: {
2554 struct pfioc_table *io = (struct pfioc_table *)addr;
2555 struct pfr_table *pfrts;
2558 if (io->pfrio_esize != sizeof(struct pfr_table)) {
2562 totlen = io->pfrio_size * sizeof(struct pfr_table);
2563 pfrts = malloc(totlen, M_TEMP, M_WAITOK);
2565 error = pfr_get_tables(&io->pfrio_table, pfrts,
2566 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2569 error = copyout(pfrts, io->pfrio_buffer, totlen);
2570 free(pfrts, M_TEMP);
2574 case DIOCRGETTSTATS: {
2575 struct pfioc_table *io = (struct pfioc_table *)addr;
2576 struct pfr_tstats *pfrtstats;
2579 if (io->pfrio_esize != sizeof(struct pfr_tstats)) {
2583 totlen = io->pfrio_size * sizeof(struct pfr_tstats);
2584 pfrtstats = malloc(totlen, M_TEMP, M_WAITOK);
2586 error = pfr_get_tstats(&io->pfrio_table, pfrtstats,
2587 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2590 error = copyout(pfrtstats, io->pfrio_buffer, totlen);
2591 free(pfrtstats, M_TEMP);
2595 case DIOCRCLRTSTATS: {
2596 struct pfioc_table *io = (struct pfioc_table *)addr;
2597 struct pfr_table *pfrts;
2600 if (io->pfrio_esize != sizeof(struct pfr_table)) {
2604 totlen = io->pfrio_size * sizeof(struct pfr_table);
2605 pfrts = malloc(totlen, M_TEMP, M_WAITOK);
2606 error = copyin(io->pfrio_buffer, pfrts, totlen);
2608 free(pfrts, M_TEMP);
2612 error = pfr_clr_tstats(pfrts, io->pfrio_size,
2613 &io->pfrio_nzero, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2615 free(pfrts, M_TEMP);
2619 case DIOCRSETTFLAGS: {
2620 struct pfioc_table *io = (struct pfioc_table *)addr;
2621 struct pfr_table *pfrts;
2624 if (io->pfrio_esize != sizeof(struct pfr_table)) {
2628 totlen = io->pfrio_size * sizeof(struct pfr_table);
2629 pfrts = malloc(totlen, M_TEMP, M_WAITOK);
2630 error = copyin(io->pfrio_buffer, pfrts, totlen);
2632 free(pfrts, M_TEMP);
2636 error = pfr_set_tflags(pfrts, io->pfrio_size,
2637 io->pfrio_setflag, io->pfrio_clrflag, &io->pfrio_nchange,
2638 &io->pfrio_ndel, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2640 free(pfrts, M_TEMP);
2644 case DIOCRCLRADDRS: {
2645 struct pfioc_table *io = (struct pfioc_table *)addr;
2647 if (io->pfrio_esize != 0) {
2652 error = pfr_clr_addrs(&io->pfrio_table, &io->pfrio_ndel,
2653 io->pfrio_flags | PFR_FLAG_USERIOCTL);
2658 case DIOCRADDADDRS: {
2659 struct pfioc_table *io = (struct pfioc_table *)addr;
2660 struct pfr_addr *pfras;
2663 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
2667 totlen = io->pfrio_size * sizeof(struct pfr_addr);
2668 pfras = malloc(totlen, M_TEMP, M_WAITOK);
2669 error = copyin(io->pfrio_buffer, pfras, totlen);
2671 free(pfras, M_TEMP);
2675 error = pfr_add_addrs(&io->pfrio_table, pfras,
2676 io->pfrio_size, &io->pfrio_nadd, io->pfrio_flags |
2677 PFR_FLAG_USERIOCTL);
2679 if (error == 0 && io->pfrio_flags & PFR_FLAG_FEEDBACK)
2680 error = copyout(pfras, io->pfrio_buffer, totlen);
2681 free(pfras, M_TEMP);
2685 case DIOCRDELADDRS: {
2686 struct pfioc_table *io = (struct pfioc_table *)addr;
2687 struct pfr_addr *pfras;
2690 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
2694 totlen = io->pfrio_size * sizeof(struct pfr_addr);
2695 pfras = malloc(totlen, M_TEMP, M_WAITOK);
2696 error = copyin(io->pfrio_buffer, pfras, totlen);
2698 free(pfras, M_TEMP);
2702 error = pfr_del_addrs(&io->pfrio_table, pfras,
2703 io->pfrio_size, &io->pfrio_ndel, io->pfrio_flags |
2704 PFR_FLAG_USERIOCTL);
2706 if (error == 0 && io->pfrio_flags & PFR_FLAG_FEEDBACK)
2707 error = copyout(pfras, io->pfrio_buffer, totlen);
2708 free(pfras, M_TEMP);
2712 case DIOCRSETADDRS: {
2713 struct pfioc_table *io = (struct pfioc_table *)addr;
2714 struct pfr_addr *pfras;
2717 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
2721 totlen = (io->pfrio_size + io->pfrio_size2) *
2722 sizeof(struct pfr_addr);
2723 pfras = malloc(totlen, M_TEMP, M_WAITOK);
2724 error = copyin(io->pfrio_buffer, pfras, totlen);
2726 free(pfras, M_TEMP);
2730 error = pfr_set_addrs(&io->pfrio_table, pfras,
2731 io->pfrio_size, &io->pfrio_size2, &io->pfrio_nadd,
2732 &io->pfrio_ndel, &io->pfrio_nchange, io->pfrio_flags |
2733 PFR_FLAG_USERIOCTL, 0);
2735 if (error == 0 && io->pfrio_flags & PFR_FLAG_FEEDBACK)
2736 error = copyout(pfras, io->pfrio_buffer, totlen);
2737 free(pfras, M_TEMP);
2741 case DIOCRGETADDRS: {
2742 struct pfioc_table *io = (struct pfioc_table *)addr;
2743 struct pfr_addr *pfras;
2746 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
2750 totlen = io->pfrio_size * sizeof(struct pfr_addr);
2751 pfras = malloc(totlen, M_TEMP, M_WAITOK);
2753 error = pfr_get_addrs(&io->pfrio_table, pfras,
2754 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2757 error = copyout(pfras, io->pfrio_buffer, totlen);
2758 free(pfras, M_TEMP);
2762 case DIOCRGETASTATS: {
2763 struct pfioc_table *io = (struct pfioc_table *)addr;
2764 struct pfr_astats *pfrastats;
2767 if (io->pfrio_esize != sizeof(struct pfr_astats)) {
2771 totlen = io->pfrio_size * sizeof(struct pfr_astats);
2772 pfrastats = malloc(totlen, M_TEMP, M_WAITOK);
2774 error = pfr_get_astats(&io->pfrio_table, pfrastats,
2775 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2778 error = copyout(pfrastats, io->pfrio_buffer, totlen);
2779 free(pfrastats, M_TEMP);
2783 case DIOCRCLRASTATS: {
2784 struct pfioc_table *io = (struct pfioc_table *)addr;
2785 struct pfr_addr *pfras;
2788 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
2792 totlen = io->pfrio_size * sizeof(struct pfr_addr);
2793 pfras = malloc(totlen, M_TEMP, M_WAITOK);
2794 error = copyin(io->pfrio_buffer, pfras, totlen);
2796 free(pfras, M_TEMP);
2800 error = pfr_clr_astats(&io->pfrio_table, pfras,
2801 io->pfrio_size, &io->pfrio_nzero, io->pfrio_flags |
2802 PFR_FLAG_USERIOCTL);
2804 if (error == 0 && io->pfrio_flags & PFR_FLAG_FEEDBACK)
2805 error = copyout(pfras, io->pfrio_buffer, totlen);
2806 free(pfras, M_TEMP);
2810 case DIOCRTSTADDRS: {
2811 struct pfioc_table *io = (struct pfioc_table *)addr;
2812 struct pfr_addr *pfras;
2815 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
2819 totlen = io->pfrio_size * sizeof(struct pfr_addr);
2820 pfras = malloc(totlen, M_TEMP, M_WAITOK);
2821 error = copyin(io->pfrio_buffer, pfras, totlen);
2823 free(pfras, M_TEMP);
2827 error = pfr_tst_addrs(&io->pfrio_table, pfras,
2828 io->pfrio_size, &io->pfrio_nmatch, io->pfrio_flags |
2829 PFR_FLAG_USERIOCTL);
2832 error = copyout(pfras, io->pfrio_buffer, totlen);
2833 free(pfras, M_TEMP);
2837 case DIOCRINADEFINE: {
2838 struct pfioc_table *io = (struct pfioc_table *)addr;
2839 struct pfr_addr *pfras;
2842 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
2846 totlen = io->pfrio_size * sizeof(struct pfr_addr);
2847 pfras = malloc(totlen, M_TEMP, M_WAITOK);
2848 error = copyin(io->pfrio_buffer, pfras, totlen);
2850 free(pfras, M_TEMP);
2854 error = pfr_ina_define(&io->pfrio_table, pfras,
2855 io->pfrio_size, &io->pfrio_nadd, &io->pfrio_naddr,
2856 io->pfrio_ticket, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2858 free(pfras, M_TEMP);
2863 struct pf_osfp_ioctl *io = (struct pf_osfp_ioctl *)addr;
2865 error = pf_osfp_add(io);
2871 struct pf_osfp_ioctl *io = (struct pf_osfp_ioctl *)addr;
2873 error = pf_osfp_get(io);
2879 struct pfioc_trans *io = (struct pfioc_trans *)addr;
2880 struct pfioc_trans_e *ioes, *ioe;
2884 if (io->esize != sizeof(*ioe)) {
2888 totlen = sizeof(struct pfioc_trans_e) * io->size;
2889 ioes = malloc(totlen, M_TEMP, M_WAITOK);
2890 error = copyin(io->array, ioes, totlen);
2896 for (i = 0, ioe = ioes; i < io->size; i++, ioe++) {
2897 switch (ioe->rs_num) {
2899 case PF_RULESET_ALTQ:
2900 if (ioe->anchor[0]) {
2906 if ((error = pf_begin_altq(&ioe->ticket))) {
2913 case PF_RULESET_TABLE:
2915 struct pfr_table table;
2917 bzero(&table, sizeof(table));
2918 strlcpy(table.pfrt_anchor, ioe->anchor,
2919 sizeof(table.pfrt_anchor));
2920 if ((error = pfr_ina_begin(&table,
2921 &ioe->ticket, NULL, 0))) {
2929 if ((error = pf_begin_rules(&ioe->ticket,
2930 ioe->rs_num, ioe->anchor))) {
2939 error = copyout(ioes, io->array, totlen);
2944 case DIOCXROLLBACK: {
2945 struct pfioc_trans *io = (struct pfioc_trans *)addr;
2946 struct pfioc_trans_e *ioe, *ioes;
2950 if (io->esize != sizeof(*ioe)) {
2954 totlen = sizeof(struct pfioc_trans_e) * io->size;
2955 ioes = malloc(totlen, M_TEMP, M_WAITOK);
2956 error = copyin(io->array, ioes, totlen);
2962 for (i = 0, ioe = ioes; i < io->size; i++, ioe++) {
2963 switch (ioe->rs_num) {
2965 case PF_RULESET_ALTQ:
2966 if (ioe->anchor[0]) {
2972 if ((error = pf_rollback_altq(ioe->ticket))) {
2975 goto fail; /* really bad */
2979 case PF_RULESET_TABLE:
2981 struct pfr_table table;
2983 bzero(&table, sizeof(table));
2984 strlcpy(table.pfrt_anchor, ioe->anchor,
2985 sizeof(table.pfrt_anchor));
2986 if ((error = pfr_ina_rollback(&table,
2987 ioe->ticket, NULL, 0))) {
2990 goto fail; /* really bad */
2995 if ((error = pf_rollback_rules(ioe->ticket,
2996 ioe->rs_num, ioe->anchor))) {
2999 goto fail; /* really bad */
3010 struct pfioc_trans *io = (struct pfioc_trans *)addr;
3011 struct pfioc_trans_e *ioe, *ioes;
3012 struct pf_ruleset *rs;
3016 if (io->esize != sizeof(*ioe)) {
3020 totlen = sizeof(struct pfioc_trans_e) * io->size;
3021 ioes = malloc(totlen, M_TEMP, M_WAITOK);
3022 error = copyin(io->array, ioes, totlen);
3028 /* First makes sure everything will succeed. */
3029 for (i = 0, ioe = ioes; i < io->size; i++, ioe++) {
3030 switch (ioe->rs_num) {
3032 case PF_RULESET_ALTQ:
3033 if (ioe->anchor[0]) {
3039 if (!V_altqs_inactive_open || ioe->ticket !=
3040 V_ticket_altqs_inactive) {
3048 case PF_RULESET_TABLE:
3049 rs = pf_find_ruleset(ioe->anchor);
3050 if (rs == NULL || !rs->topen || ioe->ticket !=
3059 if (ioe->rs_num < 0 || ioe->rs_num >=
3066 rs = pf_find_ruleset(ioe->anchor);
3068 !rs->rules[ioe->rs_num].inactive.open ||
3069 rs->rules[ioe->rs_num].inactive.ticket !=
3079 /* Now do the commit - no errors should happen here. */
3080 for (i = 0, ioe = ioes; i < io->size; i++, ioe++) {
3081 switch (ioe->rs_num) {
3083 case PF_RULESET_ALTQ:
3084 if ((error = pf_commit_altq(ioe->ticket))) {
3087 goto fail; /* really bad */
3091 case PF_RULESET_TABLE:
3093 struct pfr_table table;
3095 bzero(&table, sizeof(table));
3096 strlcpy(table.pfrt_anchor, ioe->anchor,
3097 sizeof(table.pfrt_anchor));
3098 if ((error = pfr_ina_commit(&table,
3099 ioe->ticket, NULL, NULL, 0))) {
3102 goto fail; /* really bad */
3107 if ((error = pf_commit_rules(ioe->ticket,
3108 ioe->rs_num, ioe->anchor))) {
3111 goto fail; /* really bad */
3121 case DIOCGETSRCNODES: {
3122 struct pfioc_src_nodes *psn = (struct pfioc_src_nodes *)addr;
3123 struct pf_srchash *sh;
3124 struct pf_src_node *n, *p, *pstore;
3127 if (psn->psn_len == 0) {
3128 for (i = 0, sh = V_pf_srchash; i <= pf_srchashmask;
3130 PF_HASHROW_LOCK(sh);
3131 LIST_FOREACH(n, &sh->nodes, entry)
3133 PF_HASHROW_UNLOCK(sh);
3135 psn->psn_len = sizeof(struct pf_src_node) * nr;
3139 p = pstore = malloc(psn->psn_len, M_TEMP, M_WAITOK);
3140 for (i = 0, sh = V_pf_srchash; i <= pf_srchashmask;
3142 PF_HASHROW_LOCK(sh);
3143 LIST_FOREACH(n, &sh->nodes, entry) {
3144 int secs = time_uptime, diff;
3146 if ((nr + 1) * sizeof(*p) > (unsigned)psn->psn_len)
3149 bcopy(n, p, sizeof(struct pf_src_node));
3150 if (n->rule.ptr != NULL)
3151 p->rule.nr = n->rule.ptr->nr;
3152 p->creation = secs - p->creation;
3153 if (p->expire > secs)
3158 /* Adjust the connection rate estimate. */
3159 diff = secs - n->conn_rate.last;
3160 if (diff >= n->conn_rate.seconds)
3161 p->conn_rate.count = 0;
3163 p->conn_rate.count -=
3164 n->conn_rate.count * diff /
3165 n->conn_rate.seconds;
3169 PF_HASHROW_UNLOCK(sh);
3171 error = copyout(pstore, psn->psn_src_nodes,
3172 sizeof(struct pf_src_node) * nr);
3174 free(pstore, M_TEMP);
3177 psn->psn_len = sizeof(struct pf_src_node) * nr;
3178 free(pstore, M_TEMP);
3182 case DIOCCLRSRCNODES: {
3184 pf_clear_srcnodes(NULL);
3185 pf_purge_expired_src_nodes();
3189 case DIOCKILLSRCNODES:
3190 pf_kill_srcnodes((struct pfioc_src_node_kill *)addr);
3193 case DIOCSETHOSTID: {
3194 u_int32_t *hostid = (u_int32_t *)addr;
3198 V_pf_status.hostid = arc4random();
3200 V_pf_status.hostid = *hostid;
3211 case DIOCIGETIFACES: {
3212 struct pfioc_iface *io = (struct pfioc_iface *)addr;
3213 struct pfi_kif *ifstore;
3216 if (io->pfiio_esize != sizeof(struct pfi_kif)) {
3221 bufsiz = io->pfiio_size * sizeof(struct pfi_kif);
3222 ifstore = malloc(bufsiz, M_TEMP, M_WAITOK);
3224 pfi_get_ifaces(io->pfiio_name, ifstore, &io->pfiio_size);
3226 error = copyout(ifstore, io->pfiio_buffer, bufsiz);
3227 free(ifstore, M_TEMP);
3231 case DIOCSETIFFLAG: {
3232 struct pfioc_iface *io = (struct pfioc_iface *)addr;
3235 error = pfi_set_flags(io->pfiio_name, io->pfiio_flags);
3240 case DIOCCLRIFFLAG: {
3241 struct pfioc_iface *io = (struct pfioc_iface *)addr;
3244 error = pfi_clear_flags(io->pfiio_name, io->pfiio_flags);
3254 if (sx_xlocked(&pf_ioctl_lock))
3255 sx_xunlock(&pf_ioctl_lock);
3262 pfsync_state_export(struct pfsync_state *sp, struct pf_state *st)
3264 bzero(sp, sizeof(struct pfsync_state));
3266 /* copy from state key */
3267 sp->key[PF_SK_WIRE].addr[0] = st->key[PF_SK_WIRE]->addr[0];
3268 sp->key[PF_SK_WIRE].addr[1] = st->key[PF_SK_WIRE]->addr[1];
3269 sp->key[PF_SK_WIRE].port[0] = st->key[PF_SK_WIRE]->port[0];
3270 sp->key[PF_SK_WIRE].port[1] = st->key[PF_SK_WIRE]->port[1];
3271 sp->key[PF_SK_STACK].addr[0] = st->key[PF_SK_STACK]->addr[0];
3272 sp->key[PF_SK_STACK].addr[1] = st->key[PF_SK_STACK]->addr[1];
3273 sp->key[PF_SK_STACK].port[0] = st->key[PF_SK_STACK]->port[0];
3274 sp->key[PF_SK_STACK].port[1] = st->key[PF_SK_STACK]->port[1];
3275 sp->proto = st->key[PF_SK_WIRE]->proto;
3276 sp->af = st->key[PF_SK_WIRE]->af;
3278 /* copy from state */
3279 strlcpy(sp->ifname, st->kif->pfik_name, sizeof(sp->ifname));
3280 bcopy(&st->rt_addr, &sp->rt_addr, sizeof(sp->rt_addr));
3281 sp->creation = htonl(time_uptime - st->creation);
3282 sp->expire = pf_state_expires(st);
3283 if (sp->expire <= time_uptime)
3284 sp->expire = htonl(0);
3286 sp->expire = htonl(sp->expire - time_uptime);
3288 sp->direction = st->direction;
3290 sp->timeout = st->timeout;
3291 sp->state_flags = st->state_flags;
3293 sp->sync_flags |= PFSYNC_FLAG_SRCNODE;
3294 if (st->nat_src_node)
3295 sp->sync_flags |= PFSYNC_FLAG_NATSRCNODE;
3298 sp->creatorid = st->creatorid;
3299 pf_state_peer_hton(&st->src, &sp->src);
3300 pf_state_peer_hton(&st->dst, &sp->dst);
3302 if (st->rule.ptr == NULL)
3303 sp->rule = htonl(-1);
3305 sp->rule = htonl(st->rule.ptr->nr);
3306 if (st->anchor.ptr == NULL)
3307 sp->anchor = htonl(-1);
3309 sp->anchor = htonl(st->anchor.ptr->nr);
3310 if (st->nat_rule.ptr == NULL)
3311 sp->nat_rule = htonl(-1);
3313 sp->nat_rule = htonl(st->nat_rule.ptr->nr);
3315 pf_state_counter_hton(st->packets[0], sp->packets[0]);
3316 pf_state_counter_hton(st->packets[1], sp->packets[1]);
3317 pf_state_counter_hton(st->bytes[0], sp->bytes[0]);
3318 pf_state_counter_hton(st->bytes[1], sp->bytes[1]);
3323 pf_tbladdr_copyout(struct pf_addr_wrap *aw)
3325 struct pfr_ktable *kt;
3327 KASSERT(aw->type == PF_ADDR_TABLE, ("%s: type %u", __func__, aw->type));
3330 if (!(kt->pfrkt_flags & PFR_TFLAG_ACTIVE) && kt->pfrkt_root != NULL)
3331 kt = kt->pfrkt_root;
3333 aw->p.tblcnt = (kt->pfrkt_flags & PFR_TFLAG_ACTIVE) ?
3338 * XXX - Check for version missmatch!!!
3341 pf_clear_states(void)
3346 for (i = 0; i <= pf_hashmask; i++) {
3347 struct pf_idhash *ih = &V_pf_idhash[i];
3349 PF_HASHROW_LOCK(ih);
3350 LIST_FOREACH(s, &ih->states, entry) {
3351 s->timeout = PFTM_PURGE;
3352 /* Don't send out individual delete messages. */
3353 s->sync_state = PFSTATE_NOSYNC;
3354 pf_unlink_state(s, PF_ENTER_LOCKED);
3357 PF_HASHROW_UNLOCK(ih);
3362 pf_clear_tables(void)
3364 struct pfioc_table io;
3367 bzero(&io, sizeof(io));
3369 error = pfr_clr_tables(&io.pfrio_table, &io.pfrio_ndel,
3376 pf_clear_srcnodes(struct pf_src_node *n)
3381 for (i = 0; i <= pf_hashmask; i++) {
3382 struct pf_idhash *ih = &V_pf_idhash[i];
3384 PF_HASHROW_LOCK(ih);
3385 LIST_FOREACH(s, &ih->states, entry) {
3386 if (n == NULL || n == s->src_node)
3388 if (n == NULL || n == s->nat_src_node)
3389 s->nat_src_node = NULL;
3391 PF_HASHROW_UNLOCK(ih);
3395 struct pf_srchash *sh;
3397 for (i = 0, sh = V_pf_srchash; i <= pf_srchashmask;
3399 PF_HASHROW_LOCK(sh);
3400 LIST_FOREACH(n, &sh->nodes, entry) {
3404 PF_HASHROW_UNLOCK(sh);
3407 /* XXX: hash slot should already be locked here. */
3414 pf_kill_srcnodes(struct pfioc_src_node_kill *psnk)
3416 struct pf_src_node_list kill;
3419 for (int i = 0; i <= pf_srchashmask; i++) {
3420 struct pf_srchash *sh = &V_pf_srchash[i];
3421 struct pf_src_node *sn, *tmp;
3423 PF_HASHROW_LOCK(sh);
3424 LIST_FOREACH_SAFE(sn, &sh->nodes, entry, tmp)
3425 if (PF_MATCHA(psnk->psnk_src.neg,
3426 &psnk->psnk_src.addr.v.a.addr,
3427 &psnk->psnk_src.addr.v.a.mask,
3428 &sn->addr, sn->af) &&
3429 PF_MATCHA(psnk->psnk_dst.neg,
3430 &psnk->psnk_dst.addr.v.a.addr,
3431 &psnk->psnk_dst.addr.v.a.mask,
3432 &sn->raddr, sn->af)) {
3433 pf_unlink_src_node(sn);
3434 LIST_INSERT_HEAD(&kill, sn, entry);
3437 PF_HASHROW_UNLOCK(sh);
3440 for (int i = 0; i <= pf_hashmask; i++) {
3441 struct pf_idhash *ih = &V_pf_idhash[i];
3444 PF_HASHROW_LOCK(ih);
3445 LIST_FOREACH(s, &ih->states, entry) {
3446 if (s->src_node && s->src_node->expire == 1)
3448 if (s->nat_src_node && s->nat_src_node->expire == 1)
3449 s->nat_src_node = NULL;
3451 PF_HASHROW_UNLOCK(ih);
3454 psnk->psnk_killed = pf_free_src_nodes(&kill);
3458 * XXX - Check for version missmatch!!!
3462 * Duplicate pfctl -Fa operation to get rid of as much as we can.
3471 V_pf_status.running = 0;
3473 counter_u64_free(V_pf_default_rule.states_cur);
3474 counter_u64_free(V_pf_default_rule.states_tot);
3475 counter_u64_free(V_pf_default_rule.src_nodes);
3477 for (int i = 0; i < PFRES_MAX; i++)
3478 counter_u64_free(V_pf_status.counters[i]);
3479 for (int i = 0; i < LCNT_MAX; i++)
3480 counter_u64_free(V_pf_status.lcounters[i]);
3481 for (int i = 0; i < FCNT_MAX; i++)
3482 counter_u64_free(V_pf_status.fcounters[i]);
3483 for (int i = 0; i < SCNT_MAX; i++)
3484 counter_u64_free(V_pf_status.scounters[i]);
3487 if ((error = pf_begin_rules(&t[0], PF_RULESET_SCRUB, &nn))
3489 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: SCRUB\n"));
3492 if ((error = pf_begin_rules(&t[1], PF_RULESET_FILTER, &nn))
3494 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: FILTER\n"));
3495 break; /* XXX: rollback? */
3497 if ((error = pf_begin_rules(&t[2], PF_RULESET_NAT, &nn))
3499 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: NAT\n"));
3500 break; /* XXX: rollback? */
3502 if ((error = pf_begin_rules(&t[3], PF_RULESET_BINAT, &nn))
3504 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: BINAT\n"));
3505 break; /* XXX: rollback? */
3507 if ((error = pf_begin_rules(&t[4], PF_RULESET_RDR, &nn))
3509 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: RDR\n"));
3510 break; /* XXX: rollback? */
3513 /* XXX: these should always succeed here */
3514 pf_commit_rules(t[0], PF_RULESET_SCRUB, &nn);
3515 pf_commit_rules(t[1], PF_RULESET_FILTER, &nn);
3516 pf_commit_rules(t[2], PF_RULESET_NAT, &nn);
3517 pf_commit_rules(t[3], PF_RULESET_BINAT, &nn);
3518 pf_commit_rules(t[4], PF_RULESET_RDR, &nn);
3520 if ((error = pf_clear_tables()) != 0)
3524 if ((error = pf_begin_altq(&t[0])) != 0) {
3525 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: ALTQ\n"));
3528 pf_commit_altq(t[0]);
3533 pf_clear_srcnodes(NULL);
3535 /* status does not use malloced mem so no need to cleanup */
3536 /* fingerprints and interfaces have thier own cleanup code */
3544 pf_check_in(void *arg, struct mbuf **m, struct ifnet *ifp, int dir,
3549 chk = pf_test(PF_IN, ifp, m, inp);
3559 pf_check_out(void *arg, struct mbuf **m, struct ifnet *ifp, int dir,
3564 /* We need a proper CSUM befor we start (s. OpenBSD ip_output) */
3565 if ((*m)->m_pkthdr.csum_flags & CSUM_DELAY_DATA) {
3566 in_delayed_cksum(*m);
3567 (*m)->m_pkthdr.csum_flags &= ~CSUM_DELAY_DATA;
3570 chk = pf_test(PF_OUT, ifp, m, inp);
3582 pf_check6_in(void *arg, struct mbuf **m, struct ifnet *ifp, int dir,
3588 * In case of loopback traffic IPv6 uses the real interface in
3589 * order to support scoped addresses. In order to support stateful
3590 * filtering we have change this to lo0 as it is the case in IPv4.
3592 CURVNET_SET(ifp->if_vnet);
3593 chk = pf_test6(PF_IN, (*m)->m_flags & M_LOOP ? V_loif : ifp, m, inp);
3603 pf_check6_out(void *arg, struct mbuf **m, struct ifnet *ifp, int dir,
3608 /* We need a proper CSUM before we start (s. OpenBSD ip_output) */
3609 if ((*m)->m_pkthdr.csum_flags & CSUM_DELAY_DATA_IPV6) {
3610 in6_delayed_cksum(*m,
3611 (*m)->m_pkthdr.len - sizeof(struct ip6_hdr),
3612 sizeof(struct ip6_hdr));
3613 (*m)->m_pkthdr.csum_flags &= ~CSUM_DELAY_DATA_IPV6;
3615 CURVNET_SET(ifp->if_vnet);
3616 chk = pf_test6(PF_OUT, ifp, m, inp);
3630 struct pfil_head *pfh_inet;
3633 struct pfil_head *pfh_inet6;
3636 if (V_pf_pfil_hooked)
3640 pfh_inet = pfil_head_get(PFIL_TYPE_AF, AF_INET);
3641 if (pfh_inet == NULL)
3642 return (ESRCH); /* XXX */
3643 pfil_add_hook(pf_check_in, NULL, PFIL_IN | PFIL_WAITOK, pfh_inet);
3644 pfil_add_hook(pf_check_out, NULL, PFIL_OUT | PFIL_WAITOK, pfh_inet);
3647 pfh_inet6 = pfil_head_get(PFIL_TYPE_AF, AF_INET6);
3648 if (pfh_inet6 == NULL) {
3650 pfil_remove_hook(pf_check_in, NULL, PFIL_IN | PFIL_WAITOK,
3652 pfil_remove_hook(pf_check_out, NULL, PFIL_OUT | PFIL_WAITOK,
3655 return (ESRCH); /* XXX */
3657 pfil_add_hook(pf_check6_in, NULL, PFIL_IN | PFIL_WAITOK, pfh_inet6);
3658 pfil_add_hook(pf_check6_out, NULL, PFIL_OUT | PFIL_WAITOK, pfh_inet6);
3661 V_pf_pfil_hooked = 1;
3669 struct pfil_head *pfh_inet;
3672 struct pfil_head *pfh_inet6;
3675 if (V_pf_pfil_hooked == 0)
3679 pfh_inet = pfil_head_get(PFIL_TYPE_AF, AF_INET);
3680 if (pfh_inet == NULL)
3681 return (ESRCH); /* XXX */
3682 pfil_remove_hook(pf_check_in, NULL, PFIL_IN | PFIL_WAITOK,
3684 pfil_remove_hook(pf_check_out, NULL, PFIL_OUT | PFIL_WAITOK,
3688 pfh_inet6 = pfil_head_get(PFIL_TYPE_AF, AF_INET6);
3689 if (pfh_inet6 == NULL)
3690 return (ESRCH); /* XXX */
3691 pfil_remove_hook(pf_check6_in, NULL, PFIL_IN | PFIL_WAITOK,
3693 pfil_remove_hook(pf_check6_out, NULL, PFIL_OUT | PFIL_WAITOK,
3697 V_pf_pfil_hooked = 0;
3706 VNET_ITERATOR_DECL(vnet_iter);
3709 VNET_FOREACH(vnet_iter) {
3710 CURVNET_SET(vnet_iter);
3711 V_pf_pfil_hooked = 0;
3712 V_pf_end_threads = 0;
3713 TAILQ_INIT(&V_pf_tags);
3714 TAILQ_INIT(&V_pf_qids);
3717 VNET_LIST_RUNLOCK();
3719 rw_init(&pf_rules_lock, "pf rulesets");
3720 sx_init(&pf_ioctl_lock, "pf ioctl");
3722 pf_dev = make_dev(&pf_cdevsw, 0, 0, 0, 0600, PF_NAME);
3723 if ((error = pfattach()) != 0)
3734 V_pf_status.running = 0;
3735 swi_remove(V_pf_swi_cookie);
3736 error = dehook_pf();
3739 * Should not happen!
3740 * XXX Due to error code ESRCH, kldunload will show
3741 * a message like 'No such process'.
3743 printf("%s : pfil unregisteration fail\n", __FUNCTION__);
3748 V_pf_end_threads = 1;
3749 while (V_pf_end_threads < 2) {
3750 wakeup_one(pf_purge_thread);
3751 rw_sleep(pf_purge_thread, &pf_rules_lock, 0, "pftmo", 0);
3754 pf_normalize_cleanup();
3759 if (IS_DEFAULT_VNET(curvnet))
3761 destroy_dev(pf_dev);
3762 rw_destroy(&pf_rules_lock);
3763 sx_destroy(&pf_ioctl_lock);
3769 pf_modevent(module_t mod, int type, void *data)
3779 * Module should not be unloaded due to race conditions.
3784 error = pf_unload();
3794 static moduledata_t pf_mod = {
3800 DECLARE_MODULE(pf, pf_mod, SI_SUB_PSEUDO, SI_ORDER_FIRST);
3801 MODULE_VERSION(pf, PF_MODVER);