1 /* $OpenBSD: pf_ioctl.c,v 1.209 2008/06/29 08:42:15 mcbride Exp $ */
2 /*add $OpenBSD: pf_ioctl.c,v 1.212 2009/02/15 20:42:33 mbalmer Exp $ */
5 * Copyright (c) 2010 The DragonFly Project. All rights reserved.
7 * Copyright (c) 2001 Daniel Hartmeier
8 * Copyright (c) 2002,2003 Henning Brauer
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
15 * - Redistributions of source code must retain the above copyright
16 * notice, this list of conditions and the following disclaimer.
17 * - Redistributions in binary form must reproduce the above
18 * copyright notice, this list of conditions and the following
19 * disclaimer in the documentation and/or other materials provided
20 * with the distribution.
22 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
23 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
24 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
25 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
26 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
27 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
28 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
29 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
30 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
32 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
33 * POSSIBILITY OF SUCH DAMAGE.
35 * Effort sponsored in part by the Defense Advanced Research Projects
36 * Agency (DARPA) and Air Force Research Laboratory, Air Force
37 * Materiel Command, USAF, under agreement number F30602-01-2-0537.
42 #include "opt_inet6.h"
44 #include <sys/param.h>
45 #include <sys/systm.h>
47 #include <sys/device.h>
49 #include <sys/filio.h>
50 #include <sys/fcntl.h>
51 #include <sys/socket.h>
52 #include <sys/socketvar.h>
53 #include <sys/kernel.h>
54 #include <sys/kthread.h>
57 #include <sys/malloc.h>
58 #include <sys/module.h>
61 #include <sys/thread2.h>
64 #include <net/if_types.h>
65 #include <net/route.h>
67 #include <netinet/in.h>
68 #include <netinet/in_var.h>
69 #include <netinet/in_systm.h>
70 #include <netinet/ip.h>
71 #include <netinet/ip_var.h>
72 #include <netinet/ip_icmp.h>
74 #include <net/pf/pfvar.h>
76 #include <net/pf/pfvar.h>
78 #include <net/pf/if_pfsync.h>
81 #include <net/if_pflog.h>
82 #endif /* NPFLOG > 0 */
85 #include <netinet/ip6.h>
86 #include <netinet/in_pcb.h>
90 #include <net/altq/altq.h>
93 #include <machine/limits.h>
95 #include <sys/mutex.h>
97 u_int rt_numfibs = RT_NUMFIBS;
100 struct pf_pool *pf_get_pool(char *, u_int32_t, u_int8_t, u_int32_t,
101 u_int8_t, u_int8_t, u_int8_t);
103 void pf_mv_pool(struct pf_palist *, struct pf_palist *);
104 void pf_empty_pool(struct pf_palist *);
106 int pf_begin_altq(u_int32_t *);
107 int pf_rollback_altq(u_int32_t);
108 int pf_commit_altq(u_int32_t);
109 int pf_enable_altq(struct pf_altq *);
110 int pf_disable_altq(struct pf_altq *);
112 int pf_begin_rules(u_int32_t *, int, const char *);
113 int pf_rollback_rules(u_int32_t, int, char *);
114 int pf_setup_pfsync_matching(struct pf_ruleset *);
115 void pf_hash_rule(MD5_CTX *, struct pf_rule *);
116 void pf_hash_rule_addr(MD5_CTX *, struct pf_rule_addr *);
117 int pf_commit_rules(u_int32_t, int, char *);
118 int pf_addr_setup(struct pf_ruleset *,
119 struct pf_addr_wrap *, sa_family_t);
120 void pf_addr_copyout(struct pf_addr_wrap *);
122 struct pf_rule pf_default_rule;
123 struct lock pf_consistency_lock;
125 static int pf_altq_running;
128 #define TAGID_MAX 50000
129 TAILQ_HEAD(pf_tags, pf_tagname) pf_tags = TAILQ_HEAD_INITIALIZER(pf_tags),
130 pf_qids = TAILQ_HEAD_INITIALIZER(pf_qids);
132 #if (PF_QNAME_SIZE != PF_TAG_NAME_SIZE)
133 #error PF_QNAME_SIZE must be equal to PF_TAG_NAME_SIZE
135 u_int16_t tagname2tag(struct pf_tags *, char *);
136 void tag2tagname(struct pf_tags *, u_int16_t, char *);
137 void tag_unref(struct pf_tags *, u_int16_t);
138 int pf_rtlabel_add(struct pf_addr_wrap *);
139 void pf_rtlabel_remove(struct pf_addr_wrap *);
140 void pf_rtlabel_copyout(struct pf_addr_wrap *);
142 #define DPFPRINTF(n, x) if (pf_status.debug >= (n)) kprintf x
144 static cdev_t pf_dev;
146 static MALLOC_DEFINE(M_PFRULEPL, "pfrulepl", "pf rule pool list");
147 static MALLOC_DEFINE(M_PFALTQPL, "pfaltqpl", "pf altq pool list");
148 static MALLOC_DEFINE(M_PFPOOLADDRPL, "pfpooladdrpl", "pf pool address pool list");
149 static MALLOC_DEFINE(M_PFFRENTPL, "pffrent", "pf frent pool list");
153 * XXX - These are new and need to be checked when moveing to a new version
155 static void pf_clear_states(void);
156 static int pf_clear_tables(void);
157 static void pf_clear_srcnodes(void);
159 * XXX - These are new and need to be checked when moveing to a new version
163 * Wrapper functions for pfil(9) hooks
165 static int pf_check_in(void *arg, struct mbuf **m, struct ifnet *ifp,
167 static int pf_check_out(void *arg, struct mbuf **m, struct ifnet *ifp,
170 static int pf_check6_in(void *arg, struct mbuf **m, struct ifnet *ifp,
172 static int pf_check6_out(void *arg, struct mbuf **m, struct ifnet *ifp,
176 static int hook_pf(void);
177 static int dehook_pf(void);
178 static int shutdown_pf(void);
179 static int pf_load(void);
180 static int pf_unload(void);
186 static struct dev_ops pf_ops = { /* XXX convert to port model */
193 static volatile int pf_pfil_hooked = 0;
194 int pf_end_threads = 0;
195 struct lock pf_mod_lck;
197 int debug_pfugidhack = 0;
198 SYSCTL_INT(_debug, OID_AUTO, pfugidhack, CTLFLAG_RW, &debug_pfugidhack, 0,
199 "Enable/disable pf user/group rules mpsafe hack");
204 u_int32_t *my_timeout = pf_default_rule.timeout;
207 if (!rn_inithead((void **)&pf_maskhead, NULL, 0)) {
208 kprintf("pf mask radix tree create failed\n");
211 kmalloc_create(&pf_state_pl, "pf state pool list");
212 kmalloc_raise_limit(pf_state_pl, 0);
213 kmalloc_create(&pf_frent_pl, "pf fragment pool list");
214 kmalloc_raise_limit(pf_frent_pl, 0);
215 kmalloc_create(&pf_cent_pl, "pf cent pool list");
216 kmalloc_raise_limit(pf_cent_pl, 0);
220 pf_osfp_initialize();
222 pf_pool_limits[PF_LIMIT_STATES].pp = pf_state_pl;
223 pf_pool_limits[PF_LIMIT_STATES].limit = PFSTATE_HIWAT;
224 pf_pool_limits[PF_LIMIT_FRAGS].pp = pf_frent_pl;
225 pf_pool_limits[PF_LIMIT_FRAGS].limit = PFFRAG_FRENT_HIWAT;
226 if (ctob(physmem) <= 100*1024*1024)
227 pf_pool_limits[PF_LIMIT_TABLE_ENTRIES].limit =
228 PFR_KENTRY_HIWAT_SMALL;
230 RB_INIT(&tree_src_tracking);
231 RB_INIT(&pf_anchors);
232 pf_init_ruleset(&pf_main_ruleset);
233 TAILQ_INIT(&pf_altqs[0]);
234 TAILQ_INIT(&pf_altqs[1]);
235 TAILQ_INIT(&pf_pabuf);
236 pf_altqs_active = &pf_altqs[0];
237 pf_altqs_inactive = &pf_altqs[1];
238 TAILQ_INIT(&state_list);
240 /* default rule should never be garbage collected */
241 pf_default_rule.entries.tqe_prev = &pf_default_rule.entries.tqe_next;
242 pf_default_rule.action = PF_PASS;
243 pf_default_rule.nr = (uint32_t)(-1);
244 pf_default_rule.rtableid = -1;
246 /* initialize default timeouts */
247 my_timeout[PFTM_TCP_FIRST_PACKET] = 120; /* First TCP packet */
248 my_timeout[PFTM_TCP_OPENING] = 30; /* No response yet */
249 my_timeout[PFTM_TCP_ESTABLISHED] = 24*60*60; /* Established */
250 my_timeout[PFTM_TCP_CLOSING] = 15 * 60; /* Half closed */
251 my_timeout[PFTM_TCP_FIN_WAIT] = 45; /* Got both FINs */
252 my_timeout[PFTM_TCP_CLOSED] = 90; /* Got a RST */
253 my_timeout[PFTM_UDP_FIRST_PACKET] = 60; /* First UDP packet */
254 my_timeout[PFTM_UDP_SINGLE] = 30; /* Unidirectional */
255 my_timeout[PFTM_UDP_MULTIPLE] = 60; /* Bidirectional */
256 my_timeout[PFTM_ICMP_FIRST_PACKET] = 20; /* First ICMP packet */
257 my_timeout[PFTM_ICMP_ERROR_REPLY] = 10; /* Got error response */
258 my_timeout[PFTM_OTHER_FIRST_PACKET] = 60; /* First packet */
259 my_timeout[PFTM_OTHER_SINGLE] = 30; /* Unidirectional */
260 my_timeout[PFTM_OTHER_MULTIPLE] = 60; /* Bidirectional */
261 my_timeout[PFTM_FRAG] = 30; /* Fragment expire */
262 my_timeout[PFTM_INTERVAL] = 10; /* Expire interval */
263 my_timeout[PFTM_SRC_NODE] = 0; /* Source Tracking */
264 my_timeout[PFTM_TS_DIFF] = 30; /* Allowed TS diff */
265 my_timeout[PFTM_ADAPTIVE_START] = PFSTATE_ADAPT_START;
266 my_timeout[PFTM_ADAPTIVE_END] = PFSTATE_ADAPT_END;
269 bzero(&pf_status, sizeof(pf_status));
270 pf_status.debug = PF_DEBUG_URGENT;
271 /* XXX do our best to avoid a conflict */
272 pf_status.hostid = karc4random();
274 if (kthread_create(pf_purge_thread, NULL, NULL, "pfpurge"))
275 panic("pfpurge thread");
279 pfopen(struct dev_open_args *ap)
281 lwkt_gettoken(&pf_token);
282 cdev_t dev = ap->a_head.a_dev;
283 if (minor(dev) >= 1) {
284 lwkt_reltoken(&pf_token);
287 lwkt_reltoken(&pf_token);
292 pfclose(struct dev_close_args *ap)
294 lwkt_gettoken(&pf_token);
295 cdev_t dev = ap->a_head.a_dev;
296 if (minor(dev) >= 1) {
297 lwkt_reltoken(&pf_token);
300 lwkt_reltoken(&pf_token);
305 pf_get_pool(char *anchor, u_int32_t ticket, u_int8_t rule_action,
306 u_int32_t rule_number, u_int8_t r_last, u_int8_t active,
307 u_int8_t check_ticket)
309 struct pf_ruleset *ruleset;
310 struct pf_rule *rule;
313 ruleset = pf_find_ruleset(anchor);
316 rs_num = pf_get_ruleset_number(rule_action);
317 if (rs_num >= PF_RULESET_MAX)
320 if (check_ticket && ticket !=
321 ruleset->rules[rs_num].active.ticket)
324 rule = TAILQ_LAST(ruleset->rules[rs_num].active.ptr,
327 rule = TAILQ_FIRST(ruleset->rules[rs_num].active.ptr);
329 if (check_ticket && ticket !=
330 ruleset->rules[rs_num].inactive.ticket)
333 rule = TAILQ_LAST(ruleset->rules[rs_num].inactive.ptr,
336 rule = TAILQ_FIRST(ruleset->rules[rs_num].inactive.ptr);
339 while ((rule != NULL) && (rule->nr != rule_number))
340 rule = TAILQ_NEXT(rule, entries);
345 return (&rule->rpool);
349 pf_mv_pool(struct pf_palist *poola, struct pf_palist *poolb)
351 struct pf_pooladdr *mv_pool_pa;
353 while ((mv_pool_pa = TAILQ_FIRST(poola)) != NULL) {
354 TAILQ_REMOVE(poola, mv_pool_pa, entries);
355 TAILQ_INSERT_TAIL(poolb, mv_pool_pa, entries);
360 pf_empty_pool(struct pf_palist *poola)
362 struct pf_pooladdr *empty_pool_pa;
364 while ((empty_pool_pa = TAILQ_FIRST(poola)) != NULL) {
365 pfi_dynaddr_remove(&empty_pool_pa->addr);
366 pf_tbladdr_remove(&empty_pool_pa->addr);
367 pfi_kif_unref(empty_pool_pa->kif, PFI_KIF_REF_RULE);
368 TAILQ_REMOVE(poola, empty_pool_pa, entries);
369 kfree(empty_pool_pa, M_PFPOOLADDRPL);
374 pf_rm_rule(struct pf_rulequeue *rulequeue, struct pf_rule *rule)
376 if (rulequeue != NULL) {
377 if (rule->states_cur <= 0) {
379 * XXX - we need to remove the table *before* detaching
380 * the rule to make sure the table code does not delete
381 * the anchor under our feet.
383 pf_tbladdr_remove(&rule->src.addr);
384 pf_tbladdr_remove(&rule->dst.addr);
385 if (rule->overload_tbl)
386 pfr_detach_table(rule->overload_tbl);
388 TAILQ_REMOVE(rulequeue, rule, entries);
389 rule->entries.tqe_prev = NULL;
393 if (rule->states_cur > 0 || rule->src_nodes > 0 ||
394 rule->entries.tqe_prev != NULL)
396 pf_tag_unref(rule->tag);
397 pf_tag_unref(rule->match_tag);
399 if (rule->pqid != rule->qid)
400 pf_qid_unref(rule->pqid);
401 pf_qid_unref(rule->qid);
403 pf_rtlabel_remove(&rule->src.addr);
404 pf_rtlabel_remove(&rule->dst.addr);
405 pfi_dynaddr_remove(&rule->src.addr);
406 pfi_dynaddr_remove(&rule->dst.addr);
407 if (rulequeue == NULL) {
408 pf_tbladdr_remove(&rule->src.addr);
409 pf_tbladdr_remove(&rule->dst.addr);
410 if (rule->overload_tbl)
411 pfr_detach_table(rule->overload_tbl);
413 pfi_kif_unref(rule->kif, PFI_KIF_REF_RULE);
414 pf_anchor_remove(rule);
415 pf_empty_pool(&rule->rpool.list);
416 kfree(rule, M_PFRULEPL);
420 tagname2tag(struct pf_tags *head, char *tagname)
422 struct pf_tagname *tag, *p = NULL;
423 u_int16_t new_tagid = 1;
425 TAILQ_FOREACH(tag, head, entries)
426 if (strcmp(tagname, tag->name) == 0) {
432 * to avoid fragmentation, we do a linear search from the beginning
433 * and take the first free slot we find. if there is none or the list
434 * is empty, append a new entry at the end.
438 if (!TAILQ_EMPTY(head))
439 for (p = TAILQ_FIRST(head); p != NULL &&
440 p->tag == new_tagid; p = TAILQ_NEXT(p, entries))
441 new_tagid = p->tag + 1;
443 if (new_tagid > TAGID_MAX)
446 /* allocate and fill new struct pf_tagname */
447 tag = kmalloc(sizeof(*tag), M_TEMP, M_WAITOK);
450 strlcpy(tag->name, tagname, sizeof(tag->name));
451 tag->tag = new_tagid;
454 if (p != NULL) /* insert new entry before p */
455 TAILQ_INSERT_BEFORE(p, tag, entries);
456 else /* either list empty or no free slot in between */
457 TAILQ_INSERT_TAIL(head, tag, entries);
463 tag2tagname(struct pf_tags *head, u_int16_t tagid, char *p)
465 struct pf_tagname *tag;
467 TAILQ_FOREACH(tag, head, entries)
468 if (tag->tag == tagid) {
469 strlcpy(p, tag->name, PF_TAG_NAME_SIZE);
475 tag_unref(struct pf_tags *head, u_int16_t tag)
477 struct pf_tagname *p, *next;
482 for (p = TAILQ_FIRST(head); p != NULL; p = next) {
483 next = TAILQ_NEXT(p, entries);
486 TAILQ_REMOVE(head, p, entries);
495 pf_tagname2tag(char *tagname)
497 return (tagname2tag(&pf_tags, tagname));
501 pf_tag2tagname(u_int16_t tagid, char *p)
503 tag2tagname(&pf_tags, tagid, p);
507 pf_tag_ref(u_int16_t tag)
509 struct pf_tagname *t;
511 TAILQ_FOREACH(t, &pf_tags, entries)
519 pf_tag_unref(u_int16_t tag)
521 tag_unref(&pf_tags, tag);
525 pf_rtlabel_add(struct pf_addr_wrap *a)
531 pf_rtlabel_remove(struct pf_addr_wrap *a)
536 pf_rtlabel_copyout(struct pf_addr_wrap *a)
538 if (a->type == PF_ADDR_RTLABEL && a->v.rtlabel)
539 strlcpy(a->v.rtlabelname, "?", sizeof(a->v.rtlabelname));
544 pf_qname2qid(char *qname)
546 return ((u_int32_t)tagname2tag(&pf_qids, qname));
550 pf_qid2qname(u_int32_t qid, char *p)
552 tag2tagname(&pf_qids, (u_int16_t)qid, p);
556 pf_qid_unref(u_int32_t qid)
558 tag_unref(&pf_qids, (u_int16_t)qid);
562 pf_begin_altq(u_int32_t *ticket)
564 struct pf_altq *altq;
567 /* Purge the old altq list */
568 while ((altq = TAILQ_FIRST(pf_altqs_inactive)) != NULL) {
569 TAILQ_REMOVE(pf_altqs_inactive, altq, entries);
570 if (altq->qname[0] == 0) {
571 /* detach and destroy the discipline */
572 error = altq_remove(altq);
574 pf_qid_unref(altq->qid);
575 kfree(altq, M_PFALTQPL);
579 *ticket = ++ticket_altqs_inactive;
580 altqs_inactive_open = 1;
585 pf_rollback_altq(u_int32_t ticket)
587 struct pf_altq *altq;
590 if (!altqs_inactive_open || ticket != ticket_altqs_inactive)
592 /* Purge the old altq list */
593 while ((altq = TAILQ_FIRST(pf_altqs_inactive)) != NULL) {
594 TAILQ_REMOVE(pf_altqs_inactive, altq, entries);
595 if (altq->qname[0] == 0) {
596 /* detach and destroy the discipline */
597 error = altq_remove(altq);
599 pf_qid_unref(altq->qid);
600 kfree(altq, M_PFALTQPL);
602 altqs_inactive_open = 0;
607 pf_commit_altq(u_int32_t ticket)
609 struct pf_altqqueue *old_altqs;
610 struct pf_altq *altq;
613 if (!altqs_inactive_open || ticket != ticket_altqs_inactive)
616 /* swap altqs, keep the old. */
618 old_altqs = pf_altqs_active;
619 pf_altqs_active = pf_altqs_inactive;
620 pf_altqs_inactive = old_altqs;
621 ticket_altqs_active = ticket_altqs_inactive;
623 /* Attach new disciplines */
624 TAILQ_FOREACH(altq, pf_altqs_active, entries) {
625 if (altq->qname[0] == 0) {
626 /* attach the discipline */
627 error = altq_pfattach(altq);
635 /* Purge the old altq list */
636 while ((altq = TAILQ_FIRST(pf_altqs_inactive)) != NULL) {
637 TAILQ_REMOVE(pf_altqs_inactive, altq, entries);
638 if (altq->qname[0] == 0) {
639 /* detach and destroy the discipline */
641 error = pf_disable_altq(altq);
642 err = altq_pfdetach(altq);
643 if (err != 0 && error == 0)
645 err = altq_remove(altq);
646 if (err != 0 && error == 0)
649 pf_qid_unref(altq->qid);
650 kfree(altq, M_PFALTQPL);
654 altqs_inactive_open = 0;
659 pf_enable_altq(struct pf_altq *altq)
662 struct tb_profile tb;
665 if ((ifp = ifunit(altq->ifname)) == NULL)
668 if (ifp->if_snd.altq_type != ALTQT_NONE)
669 error = altq_enable(&ifp->if_snd);
671 /* set tokenbucket regulator */
672 if (error == 0 && ifp != NULL && ALTQ_IS_ENABLED(&ifp->if_snd)) {
673 tb.rate = altq->ifbandwidth;
674 tb.depth = altq->tbrsize;
676 error = tbr_set(&ifp->if_snd, &tb);
684 pf_disable_altq(struct pf_altq *altq)
687 struct tb_profile tb;
690 if ((ifp = ifunit(altq->ifname)) == NULL)
694 * when the discipline is no longer referenced, it was overridden
695 * by a new one. if so, just return.
697 if (altq->altq_disc != ifp->if_snd.altq_disc)
700 error = altq_disable(&ifp->if_snd);
703 /* clear tokenbucket regulator */
706 error = tbr_set(&ifp->if_snd, &tb);
715 pf_begin_rules(u_int32_t *ticket, int rs_num, const char *anchor)
717 struct pf_ruleset *rs;
718 struct pf_rule *rule;
720 if (rs_num < 0 || rs_num >= PF_RULESET_MAX)
722 rs = pf_find_or_create_ruleset(anchor);
725 while ((rule = TAILQ_FIRST(rs->rules[rs_num].inactive.ptr)) != NULL) {
726 pf_rm_rule(rs->rules[rs_num].inactive.ptr, rule);
727 rs->rules[rs_num].inactive.rcount--;
729 *ticket = ++rs->rules[rs_num].inactive.ticket;
730 rs->rules[rs_num].inactive.open = 1;
735 pf_rollback_rules(u_int32_t ticket, int rs_num, char *anchor)
737 struct pf_ruleset *rs;
738 struct pf_rule *rule;
740 if (rs_num < 0 || rs_num >= PF_RULESET_MAX)
742 rs = pf_find_ruleset(anchor);
743 if (rs == NULL || !rs->rules[rs_num].inactive.open ||
744 rs->rules[rs_num].inactive.ticket != ticket)
746 while ((rule = TAILQ_FIRST(rs->rules[rs_num].inactive.ptr)) != NULL) {
747 pf_rm_rule(rs->rules[rs_num].inactive.ptr, rule);
748 rs->rules[rs_num].inactive.rcount--;
750 rs->rules[rs_num].inactive.open = 0;
754 #define PF_MD5_UPD(st, elm) \
755 MD5Update(ctx, (u_int8_t *) &(st)->elm, sizeof((st)->elm))
757 #define PF_MD5_UPD_STR(st, elm) \
758 MD5Update(ctx, (u_int8_t *) (st)->elm, strlen((st)->elm))
760 #define PF_MD5_UPD_HTONL(st, elm, stor) do { \
761 (stor) = htonl((st)->elm); \
762 MD5Update(ctx, (u_int8_t *) &(stor), sizeof(u_int32_t));\
765 #define PF_MD5_UPD_HTONS(st, elm, stor) do { \
766 (stor) = htons((st)->elm); \
767 MD5Update(ctx, (u_int8_t *) &(stor), sizeof(u_int16_t));\
771 pf_hash_rule_addr(MD5_CTX *ctx, struct pf_rule_addr *pfr)
773 PF_MD5_UPD(pfr, addr.type);
774 switch (pfr->addr.type) {
775 case PF_ADDR_DYNIFTL:
776 PF_MD5_UPD(pfr, addr.v.ifname);
777 PF_MD5_UPD(pfr, addr.iflags);
780 PF_MD5_UPD(pfr, addr.v.tblname);
782 case PF_ADDR_ADDRMASK:
784 PF_MD5_UPD(pfr, addr.v.a.addr.addr32);
785 PF_MD5_UPD(pfr, addr.v.a.mask.addr32);
787 case PF_ADDR_RTLABEL:
788 PF_MD5_UPD(pfr, addr.v.rtlabelname);
792 PF_MD5_UPD(pfr, port[0]);
793 PF_MD5_UPD(pfr, port[1]);
794 PF_MD5_UPD(pfr, neg);
795 PF_MD5_UPD(pfr, port_op);
799 pf_hash_rule(MD5_CTX *ctx, struct pf_rule *rule)
804 pf_hash_rule_addr(ctx, &rule->src);
805 pf_hash_rule_addr(ctx, &rule->dst);
806 PF_MD5_UPD_STR(rule, label);
807 PF_MD5_UPD_STR(rule, ifname);
808 PF_MD5_UPD_STR(rule, match_tagname);
809 PF_MD5_UPD_HTONS(rule, match_tag, x); /* dup? */
810 PF_MD5_UPD_HTONL(rule, os_fingerprint, y);
811 PF_MD5_UPD_HTONL(rule, prob, y);
812 PF_MD5_UPD_HTONL(rule, uid.uid[0], y);
813 PF_MD5_UPD_HTONL(rule, uid.uid[1], y);
814 PF_MD5_UPD(rule, uid.op);
815 PF_MD5_UPD_HTONL(rule, gid.gid[0], y);
816 PF_MD5_UPD_HTONL(rule, gid.gid[1], y);
817 PF_MD5_UPD(rule, gid.op);
818 PF_MD5_UPD_HTONL(rule, rule_flag, y);
819 PF_MD5_UPD(rule, action);
820 PF_MD5_UPD(rule, direction);
821 PF_MD5_UPD(rule, af);
822 PF_MD5_UPD(rule, quick);
823 PF_MD5_UPD(rule, ifnot);
824 PF_MD5_UPD(rule, match_tag_not);
825 PF_MD5_UPD(rule, natpass);
826 PF_MD5_UPD(rule, keep_state);
827 PF_MD5_UPD(rule, proto);
828 PF_MD5_UPD(rule, type);
829 PF_MD5_UPD(rule, code);
830 PF_MD5_UPD(rule, flags);
831 PF_MD5_UPD(rule, flagset);
832 PF_MD5_UPD(rule, allow_opts);
833 PF_MD5_UPD(rule, rt);
834 PF_MD5_UPD(rule, tos);
838 pf_commit_rules(u_int32_t ticket, int rs_num, char *anchor)
840 struct pf_ruleset *rs;
841 struct pf_rule *rule, **old_array;
842 struct pf_rulequeue *old_rules;
844 u_int32_t old_rcount;
846 if (rs_num < 0 || rs_num >= PF_RULESET_MAX)
848 rs = pf_find_ruleset(anchor);
849 if (rs == NULL || !rs->rules[rs_num].inactive.open ||
850 ticket != rs->rules[rs_num].inactive.ticket)
853 /* Calculate checksum for the main ruleset */
854 if (rs == &pf_main_ruleset) {
855 error = pf_setup_pfsync_matching(rs);
860 /* Swap rules, keep the old. */
862 old_rules = rs->rules[rs_num].active.ptr;
863 old_rcount = rs->rules[rs_num].active.rcount;
864 old_array = rs->rules[rs_num].active.ptr_array;
866 rs->rules[rs_num].active.ptr =
867 rs->rules[rs_num].inactive.ptr;
868 rs->rules[rs_num].active.ptr_array =
869 rs->rules[rs_num].inactive.ptr_array;
870 rs->rules[rs_num].active.rcount =
871 rs->rules[rs_num].inactive.rcount;
872 rs->rules[rs_num].inactive.ptr = old_rules;
873 rs->rules[rs_num].inactive.ptr_array = old_array;
874 rs->rules[rs_num].inactive.rcount = old_rcount;
876 rs->rules[rs_num].active.ticket =
877 rs->rules[rs_num].inactive.ticket;
878 pf_calc_skip_steps(rs->rules[rs_num].active.ptr);
881 /* Purge the old rule list. */
882 while ((rule = TAILQ_FIRST(old_rules)) != NULL)
883 pf_rm_rule(old_rules, rule);
884 if (rs->rules[rs_num].inactive.ptr_array)
885 kfree(rs->rules[rs_num].inactive.ptr_array, M_TEMP);
886 rs->rules[rs_num].inactive.ptr_array = NULL;
887 rs->rules[rs_num].inactive.rcount = 0;
888 rs->rules[rs_num].inactive.open = 0;
889 pf_remove_if_empty_ruleset(rs);
895 pf_setup_pfsync_matching(struct pf_ruleset *rs)
898 struct pf_rule *rule;
900 u_int8_t digest[PF_MD5_DIGEST_LENGTH];
903 for (rs_cnt = 0; rs_cnt < PF_RULESET_MAX; rs_cnt++) {
904 /* XXX PF_RULESET_SCRUB as well? */
905 if (rs_cnt == PF_RULESET_SCRUB)
908 if (rs->rules[rs_cnt].inactive.ptr_array)
909 kfree(rs->rules[rs_cnt].inactive.ptr_array, M_TEMP);
910 rs->rules[rs_cnt].inactive.ptr_array = NULL;
912 if (rs->rules[rs_cnt].inactive.rcount) {
913 rs->rules[rs_cnt].inactive.ptr_array =
914 kmalloc(sizeof(caddr_t) *
915 rs->rules[rs_cnt].inactive.rcount,
918 if (!rs->rules[rs_cnt].inactive.ptr_array)
922 TAILQ_FOREACH(rule, rs->rules[rs_cnt].inactive.ptr,
924 pf_hash_rule(&ctx, rule);
925 (rs->rules[rs_cnt].inactive.ptr_array)[rule->nr] = rule;
929 MD5Final(digest, &ctx);
930 memcpy(pf_status.pf_chksum, digest, sizeof(pf_status.pf_chksum));
935 pf_addr_setup(struct pf_ruleset *ruleset, struct pf_addr_wrap *addr,
938 if (pfi_dynaddr_setup(addr, af) ||
939 pf_tbladdr_setup(ruleset, addr))
946 pf_addr_copyout(struct pf_addr_wrap *addr)
948 pfi_dynaddr_copyout(addr);
949 pf_tbladdr_copyout(addr);
950 pf_rtlabel_copyout(addr);
954 pfioctl(struct dev_ioctl_args *ap)
956 u_long cmd = ap->a_cmd;
957 caddr_t addr = ap->a_data;
958 struct pf_pooladdr *pa = NULL;
959 struct pf_pool *pool = NULL;
962 lwkt_gettoken(&pf_token);
964 /* XXX keep in sync with switch() below */
972 case DIOCSETSTATUSIF:
979 case DIOCCLRRULECTRS:
984 case DIOCGETRULESETS:
998 case DIOCGETSRCNODES:
999 case DIOCCLRSRCNODES:
1000 case DIOCIGETIFACES:
1005 case DIOCRCLRTABLES:
1006 case DIOCRADDTABLES:
1007 case DIOCRDELTABLES:
1008 case DIOCRSETTFLAGS:
1009 if (((struct pfioc_table *)addr)->pfrio_flags &
1011 break; /* dummy operation ok */
1012 lwkt_reltoken(&pf_token);
1015 lwkt_reltoken(&pf_token);
1019 if (!(ap->a_fflag & FWRITE))
1027 case DIOCGETTIMEOUT:
1032 case DIOCGETRULESETS:
1033 case DIOCGETRULESET:
1035 case DIOCRGETTABLES:
1036 case DIOCRGETTSTATS:
1038 case DIOCRGETASTATS:
1041 case DIOCGETSRCNODES:
1042 case DIOCIGETIFACES:
1045 case DIOCRCLRTABLES:
1046 case DIOCRADDTABLES:
1047 case DIOCRDELTABLES:
1048 case DIOCRCLRTSTATS:
1053 case DIOCRSETTFLAGS:
1054 if (((struct pfioc_table *)addr)->pfrio_flags &
1056 break; /* dummy operation ok */
1057 lwkt_reltoken(&pf_token);
1060 if (((struct pfioc_rule *)addr)->action ==
1062 lwkt_reltoken(&pf_token);
1067 lwkt_reltoken(&pf_token);
1074 if (pf_status.running)
1079 DPFPRINTF(PF_DEBUG_MISC,
1080 ("pf: pfil registration fail\n"));
1083 pf_status.running = 1;
1084 pf_status.since = time_second;
1085 if (pf_status.stateid == 0) {
1086 pf_status.stateid = time_second;
1087 pf_status.stateid = pf_status.stateid << 32;
1089 DPFPRINTF(PF_DEBUG_MISC, ("pf: started\n"));
1094 if (!pf_status.running)
1097 pf_status.running = 0;
1098 error = dehook_pf();
1100 pf_status.running = 1;
1101 DPFPRINTF(PF_DEBUG_MISC,
1102 ("pf: pfil unregistration failed\n"));
1104 pf_status.since = time_second;
1105 DPFPRINTF(PF_DEBUG_MISC, ("pf: stopped\n"));
1110 struct pfioc_rule *pr = (struct pfioc_rule *)addr;
1111 struct pf_ruleset *ruleset;
1112 struct pf_rule *rule, *tail;
1113 struct pf_pooladdr *pa;
1116 pr->anchor[sizeof(pr->anchor) - 1] = 0;
1117 ruleset = pf_find_ruleset(pr->anchor);
1118 if (ruleset == NULL) {
1122 rs_num = pf_get_ruleset_number(pr->rule.action);
1123 if (rs_num >= PF_RULESET_MAX) {
1127 if (pr->rule.return_icmp >> 8 > ICMP_MAXTYPE) {
1131 if (pr->ticket != ruleset->rules[rs_num].inactive.ticket) {
1135 if (pr->pool_ticket != ticket_pabuf) {
1139 rule = kmalloc(sizeof(struct pf_rule), M_PFRULEPL,M_WAITOK);
1144 bcopy(&pr->rule, rule, sizeof(struct pf_rule));
1145 rule->cuid = ap->a_cred->cr_ruid;
1147 rule->anchor = NULL;
1149 TAILQ_INIT(&rule->rpool.list);
1150 /* initialize refcounting */
1151 rule->states_cur = 0;
1152 rule->src_nodes = 0;
1153 rule->entries.tqe_prev = NULL;
1155 if (rule->af == AF_INET) {
1156 kfree(rule, M_PFRULEPL);
1157 error = EAFNOSUPPORT;
1162 if (rule->af == AF_INET6) {
1163 kfree(rule, M_PFRULEPL);
1164 error = EAFNOSUPPORT;
1168 tail = TAILQ_LAST(ruleset->rules[rs_num].inactive.ptr,
1171 rule->nr = tail->nr + 1;
1174 if (rule->ifname[0]) {
1175 rule->kif = pfi_kif_get(rule->ifname);
1176 if (rule->kif == NULL) {
1177 kfree(rule, M_PFRULEPL);
1181 pfi_kif_ref(rule->kif, PFI_KIF_REF_RULE);
1184 if (rule->rtableid > 0 && rule->rtableid > rt_numfibs)
1189 if (rule->qname[0] != 0) {
1190 if ((rule->qid = pf_qname2qid(rule->qname)) == 0)
1192 else if (rule->pqname[0] != 0) {
1194 pf_qname2qid(rule->pqname)) == 0)
1197 rule->pqid = rule->qid;
1200 if (rule->tagname[0])
1201 if ((rule->tag = pf_tagname2tag(rule->tagname)) == 0)
1203 if (rule->match_tagname[0])
1204 if ((rule->match_tag =
1205 pf_tagname2tag(rule->match_tagname)) == 0)
1207 if (rule->rt && !rule->direction)
1212 if (rule->logif >= PFLOGIFS_MAX)
1215 if (pf_rtlabel_add(&rule->src.addr) ||
1216 pf_rtlabel_add(&rule->dst.addr))
1218 if (pf_addr_setup(ruleset, &rule->src.addr, rule->af))
1220 if (pf_addr_setup(ruleset, &rule->dst.addr, rule->af))
1222 if (pf_anchor_setup(rule, ruleset, pr->anchor_call))
1224 TAILQ_FOREACH(pa, &pf_pabuf, entries)
1225 if (pf_tbladdr_setup(ruleset, &pa->addr))
1228 if (rule->overload_tblname[0]) {
1229 if ((rule->overload_tbl = pfr_attach_table(ruleset,
1230 rule->overload_tblname)) == NULL)
1233 rule->overload_tbl->pfrkt_flags |=
1237 pf_mv_pool(&pf_pabuf, &rule->rpool.list);
1238 if (((((rule->action == PF_NAT) || (rule->action == PF_RDR) ||
1239 (rule->action == PF_BINAT)) && rule->anchor == NULL) ||
1240 (rule->rt > PF_FASTROUTE)) &&
1241 (TAILQ_FIRST(&rule->rpool.list) == NULL))
1245 pf_rm_rule(NULL, rule);
1248 rule->rpool.cur = TAILQ_FIRST(&rule->rpool.list);
1249 rule->evaluations = rule->packets[0] = rule->packets[1] =
1250 rule->bytes[0] = rule->bytes[1] = 0;
1251 TAILQ_INSERT_TAIL(ruleset->rules[rs_num].inactive.ptr,
1253 ruleset->rules[rs_num].inactive.rcount++;
1257 case DIOCGETRULES: {
1258 struct pfioc_rule *pr = (struct pfioc_rule *)addr;
1259 struct pf_ruleset *ruleset;
1260 struct pf_rule *tail;
1263 pr->anchor[sizeof(pr->anchor) - 1] = 0;
1264 ruleset = pf_find_ruleset(pr->anchor);
1265 if (ruleset == NULL) {
1269 rs_num = pf_get_ruleset_number(pr->rule.action);
1270 if (rs_num >= PF_RULESET_MAX) {
1274 tail = TAILQ_LAST(ruleset->rules[rs_num].active.ptr,
1277 pr->nr = tail->nr + 1;
1280 pr->ticket = ruleset->rules[rs_num].active.ticket;
1285 struct pfioc_rule *pr = (struct pfioc_rule *)addr;
1286 struct pf_ruleset *ruleset;
1287 struct pf_rule *rule;
1290 pr->anchor[sizeof(pr->anchor) - 1] = 0;
1291 ruleset = pf_find_ruleset(pr->anchor);
1292 if (ruleset == NULL) {
1296 rs_num = pf_get_ruleset_number(pr->rule.action);
1297 if (rs_num >= PF_RULESET_MAX) {
1301 if (pr->ticket != ruleset->rules[rs_num].active.ticket) {
1305 rule = TAILQ_FIRST(ruleset->rules[rs_num].active.ptr);
1306 while ((rule != NULL) && (rule->nr != pr->nr))
1307 rule = TAILQ_NEXT(rule, entries);
1312 bcopy(rule, &pr->rule, sizeof(struct pf_rule));
1313 if (pf_anchor_copyout(ruleset, rule, pr)) {
1317 pf_addr_copyout(&pr->rule.src.addr);
1318 pf_addr_copyout(&pr->rule.dst.addr);
1319 for (i = 0; i < PF_SKIP_COUNT; ++i)
1320 if (rule->skip[i].ptr == NULL)
1321 pr->rule.skip[i].nr = (uint32_t)(-1);
1323 pr->rule.skip[i].nr =
1324 rule->skip[i].ptr->nr;
1326 if (pr->action == PF_GET_CLR_CNTR) {
1327 rule->evaluations = 0;
1328 rule->packets[0] = rule->packets[1] = 0;
1329 rule->bytes[0] = rule->bytes[1] = 0;
1330 rule->states_tot = 0;
1335 case DIOCCHANGERULE: {
1336 struct pfioc_rule *pcr = (struct pfioc_rule *)addr;
1337 struct pf_ruleset *ruleset;
1338 struct pf_rule *oldrule = NULL, *newrule = NULL;
1342 if (!(pcr->action == PF_CHANGE_REMOVE ||
1343 pcr->action == PF_CHANGE_GET_TICKET) &&
1344 pcr->pool_ticket != ticket_pabuf) {
1349 if (pcr->action < PF_CHANGE_ADD_HEAD ||
1350 pcr->action > PF_CHANGE_GET_TICKET) {
1354 ruleset = pf_find_ruleset(pcr->anchor);
1355 if (ruleset == NULL) {
1359 rs_num = pf_get_ruleset_number(pcr->rule.action);
1360 if (rs_num >= PF_RULESET_MAX) {
1365 if (pcr->action == PF_CHANGE_GET_TICKET) {
1366 pcr->ticket = ++ruleset->rules[rs_num].active.ticket;
1370 ruleset->rules[rs_num].active.ticket) {
1374 if (pcr->rule.return_icmp >> 8 > ICMP_MAXTYPE) {
1380 if (pcr->action != PF_CHANGE_REMOVE) {
1381 newrule = kmalloc(sizeof(struct pf_rule), M_PFRULEPL, M_WAITOK|M_NULLOK);
1382 if (newrule == NULL) {
1386 bcopy(&pcr->rule, newrule, sizeof(struct pf_rule));
1387 newrule->cuid = ap->a_cred->cr_ruid;
1389 TAILQ_INIT(&newrule->rpool.list);
1390 /* initialize refcounting */
1391 newrule->states_cur = 0;
1392 newrule->entries.tqe_prev = NULL;
1394 if (newrule->af == AF_INET) {
1395 kfree(newrule, M_PFRULEPL);
1396 error = EAFNOSUPPORT;
1401 if (newrule->af == AF_INET6) {
1402 kfree(newrule, M_PFRULEPL);
1403 error = EAFNOSUPPORT;
1407 if (newrule->ifname[0]) {
1408 newrule->kif = pfi_kif_get(newrule->ifname);
1409 if (newrule->kif == NULL) {
1410 kfree(newrule, M_PFRULEPL);
1414 pfi_kif_ref(newrule->kif, PFI_KIF_REF_RULE);
1416 newrule->kif = NULL;
1418 if (newrule->rtableid > 0 &&
1419 newrule->rtableid > rt_numfibs)
1424 if (newrule->qname[0] != 0) {
1426 pf_qname2qid(newrule->qname)) == 0)
1428 else if (newrule->pqname[0] != 0) {
1429 if ((newrule->pqid =
1430 pf_qname2qid(newrule->pqname)) == 0)
1433 newrule->pqid = newrule->qid;
1436 if (newrule->tagname[0])
1438 pf_tagname2tag(newrule->tagname)) == 0)
1440 if (newrule->match_tagname[0])
1441 if ((newrule->match_tag = pf_tagname2tag(
1442 newrule->match_tagname)) == 0)
1444 if (newrule->rt && !newrule->direction)
1449 if (newrule->logif >= PFLOGIFS_MAX)
1452 if (pf_rtlabel_add(&newrule->src.addr) ||
1453 pf_rtlabel_add(&newrule->dst.addr))
1455 if (pf_addr_setup(ruleset, &newrule->src.addr, newrule->af))
1457 if (pf_addr_setup(ruleset, &newrule->dst.addr, newrule->af))
1459 if (pf_anchor_setup(newrule, ruleset, pcr->anchor_call))
1461 TAILQ_FOREACH(pa, &pf_pabuf, entries)
1462 if (pf_tbladdr_setup(ruleset, &pa->addr))
1465 if (newrule->overload_tblname[0]) {
1466 if ((newrule->overload_tbl = pfr_attach_table(
1467 ruleset, newrule->overload_tblname)) ==
1471 newrule->overload_tbl->pfrkt_flags |=
1475 pf_mv_pool(&pf_pabuf, &newrule->rpool.list);
1476 if (((((newrule->action == PF_NAT) ||
1477 (newrule->action == PF_RDR) ||
1478 (newrule->action == PF_BINAT) ||
1479 (newrule->rt > PF_FASTROUTE)) &&
1480 !newrule->anchor)) &&
1481 (TAILQ_FIRST(&newrule->rpool.list) == NULL))
1485 pf_rm_rule(NULL, newrule);
1488 newrule->rpool.cur = TAILQ_FIRST(&newrule->rpool.list);
1489 newrule->evaluations = 0;
1490 newrule->packets[0] = newrule->packets[1] = 0;
1491 newrule->bytes[0] = newrule->bytes[1] = 0;
1493 pf_empty_pool(&pf_pabuf);
1495 if (pcr->action == PF_CHANGE_ADD_HEAD)
1496 oldrule = TAILQ_FIRST(
1497 ruleset->rules[rs_num].active.ptr);
1498 else if (pcr->action == PF_CHANGE_ADD_TAIL)
1499 oldrule = TAILQ_LAST(
1500 ruleset->rules[rs_num].active.ptr, pf_rulequeue);
1502 oldrule = TAILQ_FIRST(
1503 ruleset->rules[rs_num].active.ptr);
1504 while ((oldrule != NULL) && (oldrule->nr != pcr->nr))
1505 oldrule = TAILQ_NEXT(oldrule, entries);
1506 if (oldrule == NULL) {
1507 if (newrule != NULL)
1508 pf_rm_rule(NULL, newrule);
1514 if (pcr->action == PF_CHANGE_REMOVE) {
1515 pf_rm_rule(ruleset->rules[rs_num].active.ptr, oldrule);
1516 ruleset->rules[rs_num].active.rcount--;
1518 if (oldrule == NULL)
1520 ruleset->rules[rs_num].active.ptr,
1522 else if (pcr->action == PF_CHANGE_ADD_HEAD ||
1523 pcr->action == PF_CHANGE_ADD_BEFORE)
1524 TAILQ_INSERT_BEFORE(oldrule, newrule, entries);
1527 ruleset->rules[rs_num].active.ptr,
1528 oldrule, newrule, entries);
1529 ruleset->rules[rs_num].active.rcount++;
1533 TAILQ_FOREACH(oldrule,
1534 ruleset->rules[rs_num].active.ptr, entries)
1537 ruleset->rules[rs_num].active.ticket++;
1539 pf_calc_skip_steps(ruleset->rules[rs_num].active.ptr);
1540 pf_remove_if_empty_ruleset(ruleset);
1545 case DIOCCLRSTATES: {
1546 struct pf_state *s, *nexts;
1547 struct pfioc_state_kill *psk = (struct pfioc_state_kill *)addr;
1550 for (s = RB_MIN(pf_state_tree_id, &tree_id); s; s = nexts) {
1551 nexts = RB_NEXT(pf_state_tree_id, &tree_id, s);
1553 if (!psk->psk_ifname[0] || !strcmp(psk->psk_ifname,
1554 s->kif->pfik_name)) {
1555 /* don't send out individual delete messages */
1556 s->sync_flags = PFSTATE_NOSYNC;
1561 psk->psk_killed = killed;
1562 pfsync_clear_states(pf_status.hostid, psk->psk_ifname);
1566 case DIOCKILLSTATES: {
1567 struct pf_state *s, *nexts;
1568 struct pf_state_key *sk;
1569 struct pf_addr *srcaddr, *dstaddr;
1570 u_int16_t srcport, dstport;
1571 struct pfioc_state_kill *psk = (struct pfioc_state_kill *)addr;
1574 if (psk->psk_pfcmp.id) {
1575 if (psk->psk_pfcmp.creatorid == 0)
1576 psk->psk_pfcmp.creatorid = pf_status.hostid;
1577 if ((s = pf_find_state_byid(&psk->psk_pfcmp))) {
1578 /* send immediate delete of state */
1579 pfsync_delete_state(s);
1580 s->sync_flags |= PFSTATE_NOSYNC;
1582 psk->psk_killed = 1;
1587 for (s = RB_MIN(pf_state_tree_id, &tree_id); s;
1589 nexts = RB_NEXT(pf_state_tree_id, &tree_id, s);
1590 sk = s->key[PF_SK_WIRE];
1592 if (s->direction == PF_OUT) {
1593 srcaddr = &sk->addr[1];
1594 dstaddr = &sk->addr[0];
1595 srcport = sk->port[0];
1596 dstport = sk->port[0];
1598 srcaddr = &sk->addr[0];
1599 dstaddr = &sk->addr[1];
1600 srcport = sk->port[0];
1601 dstport = sk->port[0];
1603 if ((!psk->psk_af || sk->af == psk->psk_af)
1604 && (!psk->psk_proto || psk->psk_proto ==
1606 PF_MATCHA(psk->psk_src.neg,
1607 &psk->psk_src.addr.v.a.addr,
1608 &psk->psk_src.addr.v.a.mask,
1610 PF_MATCHA(psk->psk_dst.neg,
1611 &psk->psk_dst.addr.v.a.addr,
1612 &psk->psk_dst.addr.v.a.mask,
1614 (psk->psk_src.port_op == 0 ||
1615 pf_match_port(psk->psk_src.port_op,
1616 psk->psk_src.port[0], psk->psk_src.port[1],
1618 (psk->psk_dst.port_op == 0 ||
1619 pf_match_port(psk->psk_dst.port_op,
1620 psk->psk_dst.port[0], psk->psk_dst.port[1],
1622 (!psk->psk_label[0] || (s->rule.ptr->label[0] &&
1623 !strcmp(psk->psk_label, s->rule.ptr->label))) &&
1624 (!psk->psk_ifname[0] || !strcmp(psk->psk_ifname,
1625 s->kif->pfik_name))) {
1626 /* send immediate delete of state */
1627 pfsync_delete_state(s);
1628 s->sync_flags |= PFSTATE_NOSYNC;
1633 psk->psk_killed = killed;
1637 case DIOCADDSTATE: {
1638 struct pfioc_state *ps = (struct pfioc_state *)addr;
1639 struct pfsync_state *sp = &ps->state;
1641 if (sp->timeout >= PFTM_MAX &&
1642 sp->timeout != PFTM_UNTIL_PACKET) {
1646 error = pfsync_state_import(sp, PFSYNC_SI_IOCTL);
1650 case DIOCGETSTATE: {
1651 struct pfioc_state *ps = (struct pfioc_state *)addr;
1653 struct pf_state_cmp id_key;
1655 bcopy(ps->state.id, &id_key.id, sizeof(id_key.id));
1656 id_key.creatorid = ps->state.creatorid;
1658 s = pf_find_state_byid(&id_key);
1663 pfsync_state_export(&ps->state, s);
1667 case DIOCGETSTATES: {
1668 struct pfioc_states *ps = (struct pfioc_states *)addr;
1669 struct pf_state *state;
1670 struct pfsync_state *p, *pstore;
1673 if (ps->ps_len == 0) {
1674 nr = pf_status.states;
1675 ps->ps_len = sizeof(struct pfsync_state) * nr;
1679 pstore = kmalloc(sizeof(*pstore), M_TEMP, M_WAITOK);
1683 state = TAILQ_FIRST(&state_list);
1685 if (state->timeout != PFTM_UNLINKED) {
1686 if ((nr+1) * sizeof(*p) > (unsigned)ps->ps_len)
1688 pfsync_state_export(pstore, state);
1689 error = copyout(pstore, p, sizeof(*p));
1691 kfree(pstore, M_TEMP);
1697 state = TAILQ_NEXT(state, entry_list);
1700 ps->ps_len = sizeof(struct pfsync_state) * nr;
1702 kfree(pstore, M_TEMP);
1706 case DIOCGETSTATUS: {
1707 struct pf_status *s = (struct pf_status *)addr;
1708 bcopy(&pf_status, s, sizeof(struct pf_status));
1709 pfi_update_status(s->ifname, s);
1713 case DIOCSETSTATUSIF: {
1714 struct pfioc_if *pi = (struct pfioc_if *)addr;
1716 if (pi->ifname[0] == 0) {
1717 bzero(pf_status.ifname, IFNAMSIZ);
1720 strlcpy(pf_status.ifname, pi->ifname, IFNAMSIZ);
1724 case DIOCCLRSTATUS: {
1725 bzero(pf_status.counters, sizeof(pf_status.counters));
1726 bzero(pf_status.fcounters, sizeof(pf_status.fcounters));
1727 bzero(pf_status.scounters, sizeof(pf_status.scounters));
1728 pf_status.since = time_second;
1729 if (*pf_status.ifname)
1730 pfi_update_status(pf_status.ifname, NULL);
1735 struct pfioc_natlook *pnl = (struct pfioc_natlook *)addr;
1736 struct pf_state_key *sk;
1737 struct pf_state *state;
1738 struct pf_state_key_cmp key;
1739 int m = 0, direction = pnl->direction;
1742 /* NATLOOK src and dst are reversed, so reverse sidx/didx */
1743 sidx = (direction == PF_IN) ? 1 : 0;
1744 didx = (direction == PF_IN) ? 0 : 1;
1747 PF_AZERO(&pnl->saddr, pnl->af) ||
1748 PF_AZERO(&pnl->daddr, pnl->af) ||
1749 ((pnl->proto == IPPROTO_TCP ||
1750 pnl->proto == IPPROTO_UDP) &&
1751 (!pnl->dport || !pnl->sport)))
1755 key.proto = pnl->proto;
1756 PF_ACPY(&key.addr[sidx], &pnl->saddr, pnl->af);
1757 key.port[sidx] = pnl->sport;
1758 PF_ACPY(&key.addr[didx], &pnl->daddr, pnl->af);
1759 key.port[didx] = pnl->dport;
1761 state = pf_find_state_all(&key, direction, &m);
1764 error = E2BIG; /* more than one state */
1765 else if (state != NULL) {
1766 sk = state->key[sidx];
1767 PF_ACPY(&pnl->rsaddr, &sk->addr[sidx], sk->af);
1768 pnl->rsport = sk->port[sidx];
1769 PF_ACPY(&pnl->rdaddr, &sk->addr[didx], sk->af);
1770 pnl->rdport = sk->port[didx];
1777 case DIOCSETTIMEOUT: {
1778 struct pfioc_tm *pt = (struct pfioc_tm *)addr;
1781 if (pt->timeout < 0 || pt->timeout >= PFTM_MAX ||
1786 old = pf_default_rule.timeout[pt->timeout];
1787 if (pt->timeout == PFTM_INTERVAL && pt->seconds == 0)
1789 pf_default_rule.timeout[pt->timeout] = pt->seconds;
1790 if (pt->timeout == PFTM_INTERVAL && pt->seconds < old)
1791 wakeup(pf_purge_thread);
1796 case DIOCGETTIMEOUT: {
1797 struct pfioc_tm *pt = (struct pfioc_tm *)addr;
1799 if (pt->timeout < 0 || pt->timeout >= PFTM_MAX) {
1803 pt->seconds = pf_default_rule.timeout[pt->timeout];
1807 case DIOCGETLIMIT: {
1808 struct pfioc_limit *pl = (struct pfioc_limit *)addr;
1810 if (pl->index < 0 || pl->index >= PF_LIMIT_MAX) {
1814 pl->limit = pf_pool_limits[pl->index].limit;
1818 case DIOCSETLIMIT: {
1819 struct pfioc_limit *pl = (struct pfioc_limit *)addr;
1822 if (pl->index < 0 || pl->index >= PF_LIMIT_MAX ||
1823 pf_pool_limits[pl->index].pp == NULL) {
1828 /* XXX Get an API to set limits on the zone/pool */
1829 old_limit = pf_pool_limits[pl->index].limit;
1830 pf_pool_limits[pl->index].limit = pl->limit;
1831 pl->limit = old_limit;
1835 case DIOCSETDEBUG: {
1836 u_int32_t *level = (u_int32_t *)addr;
1838 pf_status.debug = *level;
1842 case DIOCCLRRULECTRS: {
1843 /* obsoleted by DIOCGETRULE with action=PF_GET_CLR_CNTR */
1844 struct pf_ruleset *ruleset = &pf_main_ruleset;
1845 struct pf_rule *rule;
1848 ruleset->rules[PF_RULESET_FILTER].active.ptr, entries) {
1849 rule->evaluations = 0;
1850 rule->packets[0] = rule->packets[1] = 0;
1851 rule->bytes[0] = rule->bytes[1] = 0;
1856 case DIOCGIFSPEED: {
1857 struct pf_ifspeed *psp = (struct pf_ifspeed *)addr;
1858 struct pf_ifspeed ps;
1861 if (psp->ifname[0] != 0) {
1862 /* Can we completely trust user-land? */
1863 strlcpy(ps.ifname, psp->ifname, IFNAMSIZ);
1864 ifp = ifunit(ps.ifname);
1866 psp->baudrate = ifp->if_baudrate;
1874 case DIOCSTARTALTQ: {
1875 struct pf_altq *altq;
1877 /* enable all altq interfaces on active list */
1878 TAILQ_FOREACH(altq, pf_altqs_active, entries) {
1879 if (altq->qname[0] == 0) {
1880 error = pf_enable_altq(altq);
1886 pf_altq_running = 1;
1887 DPFPRINTF(PF_DEBUG_MISC, ("altq: started\n"));
1891 case DIOCSTOPALTQ: {
1892 struct pf_altq *altq;
1894 /* disable all altq interfaces on active list */
1895 TAILQ_FOREACH(altq, pf_altqs_active, entries) {
1896 if (altq->qname[0] == 0) {
1897 error = pf_disable_altq(altq);
1903 pf_altq_running = 0;
1904 DPFPRINTF(PF_DEBUG_MISC, ("altq: stopped\n"));
1909 struct pfioc_altq *pa = (struct pfioc_altq *)addr;
1910 struct pf_altq *altq, *a;
1912 if (pa->ticket != ticket_altqs_inactive) {
1916 altq = kmalloc(sizeof(struct pf_altq), M_PFALTQPL, M_WAITOK|M_NULLOK);
1921 bcopy(&pa->altq, altq, sizeof(struct pf_altq));
1924 * if this is for a queue, find the discipline and
1925 * copy the necessary fields
1927 if (altq->qname[0] != 0) {
1928 if ((altq->qid = pf_qname2qid(altq->qname)) == 0) {
1930 kfree(altq, M_PFALTQPL);
1933 altq->altq_disc = NULL;
1934 TAILQ_FOREACH(a, pf_altqs_inactive, entries) {
1935 if (strncmp(a->ifname, altq->ifname,
1936 IFNAMSIZ) == 0 && a->qname[0] == 0) {
1937 altq->altq_disc = a->altq_disc;
1943 error = altq_add(altq);
1945 kfree(altq, M_PFALTQPL);
1949 TAILQ_INSERT_TAIL(pf_altqs_inactive, altq, entries);
1950 bcopy(altq, &pa->altq, sizeof(struct pf_altq));
1954 case DIOCGETALTQS: {
1955 struct pfioc_altq *pa = (struct pfioc_altq *)addr;
1956 struct pf_altq *altq;
1959 TAILQ_FOREACH(altq, pf_altqs_active, entries)
1961 pa->ticket = ticket_altqs_active;
1966 struct pfioc_altq *pa = (struct pfioc_altq *)addr;
1967 struct pf_altq *altq;
1970 if (pa->ticket != ticket_altqs_active) {
1975 altq = TAILQ_FIRST(pf_altqs_active);
1976 while ((altq != NULL) && (nr < pa->nr)) {
1977 altq = TAILQ_NEXT(altq, entries);
1984 bcopy(altq, &pa->altq, sizeof(struct pf_altq));
1988 case DIOCCHANGEALTQ:
1989 /* CHANGEALTQ not supported yet! */
1993 case DIOCGETQSTATS: {
1994 struct pfioc_qstats *pq = (struct pfioc_qstats *)addr;
1995 struct pf_altq *altq;
1999 if (pq->ticket != ticket_altqs_active) {
2003 nbytes = pq->nbytes;
2005 altq = TAILQ_FIRST(pf_altqs_active);
2006 while ((altq != NULL) && (nr < pq->nr)) {
2007 altq = TAILQ_NEXT(altq, entries);
2014 error = altq_getqstats(altq, pq->buf, &nbytes);
2016 pq->scheduler = altq->scheduler;
2017 pq->nbytes = nbytes;
2023 case DIOCBEGINADDRS: {
2024 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr;
2026 pf_empty_pool(&pf_pabuf);
2027 pp->ticket = ++ticket_pabuf;
2032 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr;
2034 if (pp->ticket != ticket_pabuf) {
2039 if (pp->af == AF_INET) {
2040 error = EAFNOSUPPORT;
2045 if (pp->af == AF_INET6) {
2046 error = EAFNOSUPPORT;
2050 if (pp->addr.addr.type != PF_ADDR_ADDRMASK &&
2051 pp->addr.addr.type != PF_ADDR_DYNIFTL &&
2052 pp->addr.addr.type != PF_ADDR_TABLE) {
2056 pa = kmalloc(sizeof(struct pf_altq), M_PFPOOLADDRPL, M_WAITOK|M_NULLOK);
2061 bcopy(&pp->addr, pa, sizeof(struct pf_pooladdr));
2062 if (pa->ifname[0]) {
2063 pa->kif = pfi_kif_get(pa->ifname);
2064 if (pa->kif == NULL) {
2065 kfree(ap, M_PFPOOLADDRPL);
2069 pfi_kif_ref(pa->kif, PFI_KIF_REF_RULE);
2071 if (pfi_dynaddr_setup(&pa->addr, pp->af)) {
2072 pfi_dynaddr_remove(&pa->addr);
2073 pfi_kif_unref(pa->kif, PFI_KIF_REF_RULE);
2074 kfree(pa, M_PFPOOLADDRPL);
2078 TAILQ_INSERT_TAIL(&pf_pabuf, pa, entries);
2082 case DIOCGETADDRS: {
2083 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr;
2086 pool = pf_get_pool(pp->anchor, pp->ticket, pp->r_action,
2087 pp->r_num, 0, 1, 0);
2092 TAILQ_FOREACH(pa, &pool->list, entries)
2098 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr;
2101 pool = pf_get_pool(pp->anchor, pp->ticket, pp->r_action,
2102 pp->r_num, 0, 1, 1);
2107 pa = TAILQ_FIRST(&pool->list);
2108 while ((pa != NULL) && (nr < pp->nr)) {
2109 pa = TAILQ_NEXT(pa, entries);
2116 bcopy(pa, &pp->addr, sizeof(struct pf_pooladdr));
2117 pf_addr_copyout(&pp->addr.addr);
2121 case DIOCCHANGEADDR: {
2122 struct pfioc_pooladdr *pca = (struct pfioc_pooladdr *)addr;
2123 struct pf_pooladdr *oldpa = NULL, *newpa = NULL;
2124 struct pf_ruleset *ruleset;
2126 if (pca->action < PF_CHANGE_ADD_HEAD ||
2127 pca->action > PF_CHANGE_REMOVE) {
2131 if (pca->addr.addr.type != PF_ADDR_ADDRMASK &&
2132 pca->addr.addr.type != PF_ADDR_DYNIFTL &&
2133 pca->addr.addr.type != PF_ADDR_TABLE) {
2138 ruleset = pf_find_ruleset(pca->anchor);
2139 if (ruleset == NULL) {
2143 pool = pf_get_pool(pca->anchor, pca->ticket, pca->r_action,
2144 pca->r_num, pca->r_last, 1, 1);
2149 if (pca->action != PF_CHANGE_REMOVE) {
2150 newpa = kmalloc(sizeof(struct pf_pooladdr),
2151 M_PFPOOLADDRPL, M_WAITOK|M_NULLOK);
2152 if (newpa == NULL) {
2156 bcopy(&pca->addr, newpa, sizeof(struct pf_pooladdr));
2158 if (pca->af == AF_INET) {
2159 kfree(newpa, M_PFPOOLADDRPL);
2160 error = EAFNOSUPPORT;
2165 if (pca->af == AF_INET6) {
2166 kfree(newpa, M_PFPOOLADDRPL);
2167 error = EAFNOSUPPORT;
2171 if (newpa->ifname[0]) {
2172 newpa->kif = pfi_kif_get(newpa->ifname);
2173 if (newpa->kif == NULL) {
2174 kfree(newpa, M_PFPOOLADDRPL);
2178 pfi_kif_ref(newpa->kif, PFI_KIF_REF_RULE);
2181 if (pfi_dynaddr_setup(&newpa->addr, pca->af) ||
2182 pf_tbladdr_setup(ruleset, &newpa->addr)) {
2183 pfi_dynaddr_remove(&newpa->addr);
2184 pfi_kif_unref(newpa->kif, PFI_KIF_REF_RULE);
2185 kfree(newpa, M_PFPOOLADDRPL);
2191 if (pca->action == PF_CHANGE_ADD_HEAD)
2192 oldpa = TAILQ_FIRST(&pool->list);
2193 else if (pca->action == PF_CHANGE_ADD_TAIL)
2194 oldpa = TAILQ_LAST(&pool->list, pf_palist);
2198 oldpa = TAILQ_FIRST(&pool->list);
2199 while ((oldpa != NULL) && (i < pca->nr)) {
2200 oldpa = TAILQ_NEXT(oldpa, entries);
2203 if (oldpa == NULL) {
2209 if (pca->action == PF_CHANGE_REMOVE) {
2210 TAILQ_REMOVE(&pool->list, oldpa, entries);
2211 pfi_dynaddr_remove(&oldpa->addr);
2212 pf_tbladdr_remove(&oldpa->addr);
2213 pfi_kif_unref(oldpa->kif, PFI_KIF_REF_RULE);
2214 kfree(oldpa, M_PFPOOLADDRPL);
2217 TAILQ_INSERT_TAIL(&pool->list, newpa, entries);
2218 else if (pca->action == PF_CHANGE_ADD_HEAD ||
2219 pca->action == PF_CHANGE_ADD_BEFORE)
2220 TAILQ_INSERT_BEFORE(oldpa, newpa, entries);
2222 TAILQ_INSERT_AFTER(&pool->list, oldpa,
2226 pool->cur = TAILQ_FIRST(&pool->list);
2227 PF_ACPY(&pool->counter, &pool->cur->addr.v.a.addr,
2232 case DIOCGETRULESETS: {
2233 struct pfioc_ruleset *pr = (struct pfioc_ruleset *)addr;
2234 struct pf_ruleset *ruleset;
2235 struct pf_anchor *anchor;
2237 pr->path[sizeof(pr->path) - 1] = 0;
2238 if ((ruleset = pf_find_ruleset(pr->path)) == NULL) {
2243 if (ruleset->anchor == NULL) {
2244 /* XXX kludge for pf_main_ruleset */
2245 RB_FOREACH(anchor, pf_anchor_global, &pf_anchors)
2246 if (anchor->parent == NULL)
2249 RB_FOREACH(anchor, pf_anchor_node,
2250 &ruleset->anchor->children)
2256 case DIOCGETRULESET: {
2257 struct pfioc_ruleset *pr = (struct pfioc_ruleset *)addr;
2258 struct pf_ruleset *ruleset;
2259 struct pf_anchor *anchor;
2262 pr->path[sizeof(pr->path) - 1] = 0;
2263 if ((ruleset = pf_find_ruleset(pr->path)) == NULL) {
2268 if (ruleset->anchor == NULL) {
2269 /* XXX kludge for pf_main_ruleset */
2270 RB_FOREACH(anchor, pf_anchor_global, &pf_anchors)
2271 if (anchor->parent == NULL && nr++ == pr->nr) {
2272 strlcpy(pr->name, anchor->name,
2277 RB_FOREACH(anchor, pf_anchor_node,
2278 &ruleset->anchor->children)
2279 if (nr++ == pr->nr) {
2280 strlcpy(pr->name, anchor->name,
2290 case DIOCRCLRTABLES: {
2291 struct pfioc_table *io = (struct pfioc_table *)addr;
2293 if (io->pfrio_esize != 0) {
2297 error = pfr_clr_tables(&io->pfrio_table, &io->pfrio_ndel,
2298 io->pfrio_flags | PFR_FLAG_USERIOCTL);
2302 case DIOCRADDTABLES: {
2303 struct pfioc_table *io = (struct pfioc_table *)addr;
2305 if (io->pfrio_esize != sizeof(struct pfr_table)) {
2309 error = pfr_add_tables(io->pfrio_buffer, io->pfrio_size,
2310 &io->pfrio_nadd, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2314 case DIOCRDELTABLES: {
2315 struct pfioc_table *io = (struct pfioc_table *)addr;
2317 if (io->pfrio_esize != sizeof(struct pfr_table)) {
2321 error = pfr_del_tables(io->pfrio_buffer, io->pfrio_size,
2322 &io->pfrio_ndel, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2326 case DIOCRGETTABLES: {
2327 struct pfioc_table *io = (struct pfioc_table *)addr;
2329 if (io->pfrio_esize != sizeof(struct pfr_table)) {
2333 error = pfr_get_tables(&io->pfrio_table, io->pfrio_buffer,
2334 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2338 case DIOCRGETTSTATS: {
2339 struct pfioc_table *io = (struct pfioc_table *)addr;
2341 if (io->pfrio_esize != sizeof(struct pfr_tstats)) {
2345 error = pfr_get_tstats(&io->pfrio_table, io->pfrio_buffer,
2346 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2350 case DIOCRCLRTSTATS: {
2351 struct pfioc_table *io = (struct pfioc_table *)addr;
2353 if (io->pfrio_esize != sizeof(struct pfr_table)) {
2357 error = pfr_clr_tstats(io->pfrio_buffer, io->pfrio_size,
2358 &io->pfrio_nzero, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2362 case DIOCRSETTFLAGS: {
2363 struct pfioc_table *io = (struct pfioc_table *)addr;
2365 if (io->pfrio_esize != sizeof(struct pfr_table)) {
2369 error = pfr_set_tflags(io->pfrio_buffer, io->pfrio_size,
2370 io->pfrio_setflag, io->pfrio_clrflag, &io->pfrio_nchange,
2371 &io->pfrio_ndel, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2375 case DIOCRCLRADDRS: {
2376 struct pfioc_table *io = (struct pfioc_table *)addr;
2378 if (io->pfrio_esize != 0) {
2382 error = pfr_clr_addrs(&io->pfrio_table, &io->pfrio_ndel,
2383 io->pfrio_flags | PFR_FLAG_USERIOCTL);
2387 case DIOCRADDADDRS: {
2388 struct pfioc_table *io = (struct pfioc_table *)addr;
2390 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
2394 error = pfr_add_addrs(&io->pfrio_table, io->pfrio_buffer,
2395 io->pfrio_size, &io->pfrio_nadd, io->pfrio_flags |
2396 PFR_FLAG_USERIOCTL);
2400 case DIOCRDELADDRS: {
2401 struct pfioc_table *io = (struct pfioc_table *)addr;
2403 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
2407 error = pfr_del_addrs(&io->pfrio_table, io->pfrio_buffer,
2408 io->pfrio_size, &io->pfrio_ndel, io->pfrio_flags |
2409 PFR_FLAG_USERIOCTL);
2413 case DIOCRSETADDRS: {
2414 struct pfioc_table *io = (struct pfioc_table *)addr;
2416 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
2420 error = pfr_set_addrs(&io->pfrio_table, io->pfrio_buffer,
2421 io->pfrio_size, &io->pfrio_size2, &io->pfrio_nadd,
2422 &io->pfrio_ndel, &io->pfrio_nchange, io->pfrio_flags |
2423 PFR_FLAG_USERIOCTL, 0);
2427 case DIOCRGETADDRS: {
2428 struct pfioc_table *io = (struct pfioc_table *)addr;
2430 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
2434 error = pfr_get_addrs(&io->pfrio_table, io->pfrio_buffer,
2435 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2439 case DIOCRGETASTATS: {
2440 struct pfioc_table *io = (struct pfioc_table *)addr;
2442 if (io->pfrio_esize != sizeof(struct pfr_astats)) {
2446 error = pfr_get_astats(&io->pfrio_table, io->pfrio_buffer,
2447 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2451 case DIOCRCLRASTATS: {
2452 struct pfioc_table *io = (struct pfioc_table *)addr;
2454 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
2458 error = pfr_clr_astats(&io->pfrio_table, io->pfrio_buffer,
2459 io->pfrio_size, &io->pfrio_nzero, io->pfrio_flags |
2460 PFR_FLAG_USERIOCTL);
2464 case DIOCRTSTADDRS: {
2465 struct pfioc_table *io = (struct pfioc_table *)addr;
2467 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
2471 error = pfr_tst_addrs(&io->pfrio_table, io->pfrio_buffer,
2472 io->pfrio_size, &io->pfrio_nmatch, io->pfrio_flags |
2473 PFR_FLAG_USERIOCTL);
2477 case DIOCRINADEFINE: {
2478 struct pfioc_table *io = (struct pfioc_table *)addr;
2480 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
2484 error = pfr_ina_define(&io->pfrio_table, io->pfrio_buffer,
2485 io->pfrio_size, &io->pfrio_nadd, &io->pfrio_naddr,
2486 io->pfrio_ticket, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2491 struct pf_osfp_ioctl *io = (struct pf_osfp_ioctl *)addr;
2492 error = pf_osfp_add(io);
2497 struct pf_osfp_ioctl *io = (struct pf_osfp_ioctl *)addr;
2498 error = pf_osfp_get(io);
2503 struct pfioc_trans *io = (struct pfioc_trans *)addr;
2504 struct pfioc_trans_e *ioe;
2505 struct pfr_table *table;
2508 if (io->esize != sizeof(*ioe)) {
2512 ioe = kmalloc(sizeof(*ioe), M_TEMP, M_WAITOK);
2513 table = kmalloc(sizeof(*table), M_TEMP, M_WAITOK);
2514 for (i = 0; i < io->size; i++) {
2515 if (copyin(io->array+i, ioe, sizeof(*ioe))) {
2516 kfree(table, M_TEMP);
2521 switch (ioe->rs_num) {
2523 case PF_RULESET_ALTQ:
2524 if (ioe->anchor[0]) {
2525 kfree(table, M_TEMP);
2530 if ((error = pf_begin_altq(&ioe->ticket))) {
2531 kfree(table, M_TEMP);
2537 case PF_RULESET_TABLE:
2538 bzero(table, sizeof(*table));
2539 strlcpy(table->pfrt_anchor, ioe->anchor,
2540 sizeof(table->pfrt_anchor));
2541 if ((error = pfr_ina_begin(table,
2542 &ioe->ticket, NULL, 0))) {
2543 kfree(table, M_TEMP);
2549 if ((error = pf_begin_rules(&ioe->ticket,
2550 ioe->rs_num, ioe->anchor))) {
2551 kfree(table, M_TEMP);
2557 if (copyout(ioe, io->array+i, sizeof(io->array[i]))) {
2558 kfree(table, M_TEMP);
2564 kfree(table, M_TEMP);
2569 case DIOCXROLLBACK: {
2570 struct pfioc_trans *io = (struct pfioc_trans *)addr;
2571 struct pfioc_trans_e *ioe;
2572 struct pfr_table *table;
2575 if (io->esize != sizeof(*ioe)) {
2579 ioe = kmalloc(sizeof(*ioe), M_TEMP, M_WAITOK);
2580 table = kmalloc(sizeof(*table), M_TEMP, M_WAITOK);
2581 for (i = 0; i < io->size; i++) {
2582 if (copyin(io->array+i, ioe, sizeof(*ioe))) {
2583 kfree(table, M_TEMP);
2588 switch (ioe->rs_num) {
2590 case PF_RULESET_ALTQ:
2591 if (ioe->anchor[0]) {
2592 kfree(table, M_TEMP);
2597 if ((error = pf_rollback_altq(ioe->ticket))) {
2598 kfree(table, M_TEMP);
2600 goto fail; /* really bad */
2604 case PF_RULESET_TABLE:
2605 bzero(table, sizeof(*table));
2606 strlcpy(table->pfrt_anchor, ioe->anchor,
2607 sizeof(table->pfrt_anchor));
2608 if ((error = pfr_ina_rollback(table,
2609 ioe->ticket, NULL, 0))) {
2610 kfree(table, M_TEMP);
2612 goto fail; /* really bad */
2616 if ((error = pf_rollback_rules(ioe->ticket,
2617 ioe->rs_num, ioe->anchor))) {
2618 kfree(table, M_TEMP);
2620 goto fail; /* really bad */
2625 kfree(table, M_TEMP);
2631 struct pfioc_trans *io = (struct pfioc_trans *)addr;
2632 struct pfioc_trans_e *ioe;
2633 struct pfr_table *table;
2634 struct pf_ruleset *rs;
2637 if (io->esize != sizeof(*ioe)) {
2641 ioe = kmalloc(sizeof(*ioe), M_TEMP, M_WAITOK);
2642 table = kmalloc(sizeof(*table), M_TEMP, M_WAITOK);
2643 /* first makes sure everything will succeed */
2644 for (i = 0; i < io->size; i++) {
2645 if (copyin(io->array+i, ioe, sizeof(*ioe))) {
2646 kfree(table, M_TEMP);
2651 switch (ioe->rs_num) {
2653 case PF_RULESET_ALTQ:
2654 if (ioe->anchor[0]) {
2655 kfree(table, M_TEMP);
2660 if (!altqs_inactive_open || ioe->ticket !=
2661 ticket_altqs_inactive) {
2662 kfree(table, M_TEMP);
2669 case PF_RULESET_TABLE:
2670 rs = pf_find_ruleset(ioe->anchor);
2671 if (rs == NULL || !rs->topen || ioe->ticket !=
2673 kfree(table, M_TEMP);
2680 if (ioe->rs_num < 0 || ioe->rs_num >=
2682 kfree(table, M_TEMP);
2687 rs = pf_find_ruleset(ioe->anchor);
2689 !rs->rules[ioe->rs_num].inactive.open ||
2690 rs->rules[ioe->rs_num].inactive.ticket !=
2692 kfree(table, M_TEMP);
2700 /* now do the commit - no errors should happen here */
2701 for (i = 0; i < io->size; i++) {
2702 if (copyin(io->array+i, ioe, sizeof(*ioe))) {
2703 kfree(table, M_TEMP);
2708 switch (ioe->rs_num) {
2710 case PF_RULESET_ALTQ:
2711 if ((error = pf_commit_altq(ioe->ticket))) {
2712 kfree(table, M_TEMP);
2714 goto fail; /* really bad */
2718 case PF_RULESET_TABLE:
2719 bzero(table, sizeof(*table));
2720 strlcpy(table->pfrt_anchor, ioe->anchor,
2721 sizeof(table->pfrt_anchor));
2722 if ((error = pfr_ina_commit(table, ioe->ticket,
2724 kfree(table, M_TEMP);
2726 goto fail; /* really bad */
2730 if ((error = pf_commit_rules(ioe->ticket,
2731 ioe->rs_num, ioe->anchor))) {
2732 kfree(table, M_TEMP);
2734 goto fail; /* really bad */
2739 kfree(table, M_TEMP);
2744 case DIOCGETSRCNODES: {
2745 struct pfioc_src_nodes *psn = (struct pfioc_src_nodes *)addr;
2746 struct pf_src_node *n, *p, *pstore;
2748 int space = psn->psn_len;
2751 RB_FOREACH(n, pf_src_tree, &tree_src_tracking)
2753 psn->psn_len = sizeof(struct pf_src_node) * nr;
2757 pstore = kmalloc(sizeof(*pstore), M_TEMP, M_WAITOK);
2759 p = psn->psn_src_nodes;
2760 RB_FOREACH(n, pf_src_tree, &tree_src_tracking) {
2761 int secs = time_second, diff;
2763 if ((nr + 1) * sizeof(*p) > (unsigned)psn->psn_len)
2766 bcopy(n, pstore, sizeof(*pstore));
2767 if (n->rule.ptr != NULL)
2768 pstore->rule.nr = n->rule.ptr->nr;
2769 pstore->creation = secs - pstore->creation;
2770 if (pstore->expire > secs)
2771 pstore->expire -= secs;
2775 /* adjust the connection rate estimate */
2776 diff = secs - n->conn_rate.last;
2777 if (diff >= n->conn_rate.seconds)
2778 pstore->conn_rate.count = 0;
2780 pstore->conn_rate.count -=
2781 n->conn_rate.count * diff /
2782 n->conn_rate.seconds;
2784 error = copyout(pstore, p, sizeof(*p));
2786 kfree(pstore, M_TEMP);
2792 psn->psn_len = sizeof(struct pf_src_node) * nr;
2794 kfree(pstore, M_TEMP);
2798 case DIOCCLRSRCNODES: {
2799 struct pf_src_node *n;
2800 struct pf_state *state;
2802 RB_FOREACH(state, pf_state_tree_id, &tree_id) {
2803 state->src_node = NULL;
2804 state->nat_src_node = NULL;
2806 RB_FOREACH(n, pf_src_tree, &tree_src_tracking) {
2810 pf_purge_expired_src_nodes(1);
2811 pf_status.src_nodes = 0;
2815 case DIOCKILLSRCNODES: {
2816 struct pf_src_node *sn;
2818 struct pfioc_src_node_kill *psnk =
2819 (struct pfioc_src_node_kill *)addr;
2822 RB_FOREACH(sn, pf_src_tree, &tree_src_tracking) {
2823 if (PF_MATCHA(psnk->psnk_src.neg,
2824 &psnk->psnk_src.addr.v.a.addr,
2825 &psnk->psnk_src.addr.v.a.mask,
2826 &sn->addr, sn->af) &&
2827 PF_MATCHA(psnk->psnk_dst.neg,
2828 &psnk->psnk_dst.addr.v.a.addr,
2829 &psnk->psnk_dst.addr.v.a.mask,
2830 &sn->raddr, sn->af)) {
2831 /* Handle state to src_node linkage */
2832 if (sn->states != 0) {
2833 RB_FOREACH(s, pf_state_tree_id,
2835 if (s->src_node == sn)
2837 if (s->nat_src_node == sn)
2838 s->nat_src_node = NULL;
2848 pf_purge_expired_src_nodes(1);
2850 psnk->psnk_killed = killed;
2854 case DIOCSETHOSTID: {
2855 u_int32_t *hostid = (u_int32_t *)addr;
2858 pf_status.hostid = karc4random();
2860 pf_status.hostid = *hostid;
2870 case DIOCIGETIFACES: {
2871 struct pfioc_iface *io = (struct pfioc_iface *)addr;
2873 if (io->pfiio_esize != sizeof(struct pfi_kif)) {
2877 error = pfi_get_ifaces(io->pfiio_name, io->pfiio_buffer,
2882 case DIOCSETIFFLAG: {
2883 struct pfioc_iface *io = (struct pfioc_iface *)addr;
2885 error = pfi_set_flags(io->pfiio_name, io->pfiio_flags);
2889 case DIOCCLRIFFLAG: {
2890 struct pfioc_iface *io = (struct pfioc_iface *)addr;
2892 error = pfi_clear_flags(io->pfiio_name, io->pfiio_flags);
2901 lwkt_reltoken(&pf_token);
2906 * XXX - Check for version missmatch!!!
2909 pf_clear_states(void)
2911 struct pf_state *s, *nexts;
2914 for (s = RB_MIN(pf_state_tree_id, &tree_id); s; s = nexts) {
2915 nexts = RB_NEXT(pf_state_tree_id, &tree_id, s);
2917 /* don't send out individual delete messages */
2918 s->sync_flags = PFSTATE_NOSYNC;
2926 * XXX This is called on module unload, we do not want to sync that over? */
2928 pfsync_clear_states(pf_status.hostid, psk->psk_ifname);
2933 pf_clear_tables(void)
2935 struct pfioc_table io;
2938 bzero(&io, sizeof(io));
2940 error = pfr_clr_tables(&io.pfrio_table, &io.pfrio_ndel,
2947 pf_clear_srcnodes(void)
2949 struct pf_src_node *n;
2950 struct pf_state *state;
2952 RB_FOREACH(state, pf_state_tree_id, &tree_id) {
2953 state->src_node = NULL;
2954 state->nat_src_node = NULL;
2956 RB_FOREACH(n, pf_src_tree, &tree_src_tracking) {
2960 pf_purge_expired_src_nodes(0);
2961 pf_status.src_nodes = 0;
2965 * XXX - Check for version missmatch!!!
2969 * Duplicate pfctl -Fa operation to get rid of as much as we can.
2979 pf_status.running = 0;
2980 error = dehook_pf();
2982 pf_status.running = 1;
2983 DPFPRINTF(PF_DEBUG_MISC,
2984 ("pf: pfil unregistration failed\n"));
2988 if ((error = pf_begin_rules(&t[0], PF_RULESET_SCRUB, &nn)) != 0) {
2989 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: SCRUB\n"));
2992 if ((error = pf_begin_rules(&t[1], PF_RULESET_FILTER, &nn)) != 0) {
2993 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: FILTER\n"));
2994 break; /* XXX: rollback? */
2996 if ((error = pf_begin_rules(&t[2], PF_RULESET_NAT, &nn)) != 0) {
2997 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: NAT\n"));
2998 break; /* XXX: rollback? */
3000 if ((error = pf_begin_rules(&t[3], PF_RULESET_BINAT, &nn))
3002 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: BINAT\n"));
3003 break; /* XXX: rollback? */
3005 if ((error = pf_begin_rules(&t[4], PF_RULESET_RDR, &nn))
3007 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: RDR\n"));
3008 break; /* XXX: rollback? */
3011 /* XXX: these should always succeed here */
3012 pf_commit_rules(t[0], PF_RULESET_SCRUB, &nn);
3013 pf_commit_rules(t[1], PF_RULESET_FILTER, &nn);
3014 pf_commit_rules(t[2], PF_RULESET_NAT, &nn);
3015 pf_commit_rules(t[3], PF_RULESET_BINAT, &nn);
3016 pf_commit_rules(t[4], PF_RULESET_RDR, &nn);
3018 if ((error = pf_clear_tables()) != 0)
3021 if ((error = pf_begin_altq(&t[0])) != 0) {
3022 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: ALTQ\n"));
3025 pf_commit_altq(t[0]);
3028 pf_clear_srcnodes();
3030 /* status does not use malloced mem so no need to cleanup */
3031 /* fingerprints and interfaces have their own cleanup code */
3037 pf_check_in(void *arg, struct mbuf **m, struct ifnet *ifp, int dir)
3040 * DragonFly's version of pf uses FreeBSD's native host byte ordering
3041 * for ip_len/ip_off. This is why we don't have to change byte order
3042 * like the FreeBSD-5 version does.
3046 lwkt_gettoken(&pf_token);
3048 chk = pf_test(PF_IN, ifp, m, NULL, NULL);
3053 lwkt_reltoken(&pf_token);
3058 pf_check_out(void *arg, struct mbuf **m, struct ifnet *ifp, int dir)
3061 * DragonFly's version of pf uses FreeBSD's native host byte ordering
3062 * for ip_len/ip_off. This is why we don't have to change byte order
3063 * like the FreeBSD-5 version does.
3067 lwkt_gettoken(&pf_token);
3069 /* We need a proper CSUM befor we start (s. OpenBSD ip_output) */
3070 if ((*m)->m_pkthdr.csum_flags & CSUM_DELAY_DATA) {
3071 in_delayed_cksum(*m);
3072 (*m)->m_pkthdr.csum_flags &= ~CSUM_DELAY_DATA;
3074 chk = pf_test(PF_OUT, ifp, m, NULL, NULL);
3079 lwkt_reltoken(&pf_token);
3085 pf_check6_in(void *arg, struct mbuf **m, struct ifnet *ifp, int dir)
3088 * IPv6 is not affected by ip_len/ip_off byte order changes.
3092 lwkt_gettoken(&pf_token);
3094 chk = pf_test6(PF_IN, ifp, m, NULL, NULL);
3099 lwkt_reltoken(&pf_token);
3104 pf_check6_out(void *arg, struct mbuf **m, struct ifnet *ifp, int dir)
3107 * IPv6 is not affected by ip_len/ip_off byte order changes.
3111 lwkt_gettoken(&pf_token);
3113 /* We need a proper CSUM befor we start (s. OpenBSD ip_output) */
3114 if ((*m)->m_pkthdr.csum_flags & CSUM_DELAY_DATA) {
3115 in_delayed_cksum(*m);
3116 (*m)->m_pkthdr.csum_flags &= ~CSUM_DELAY_DATA;
3118 chk = pf_test6(PF_OUT, ifp, m, NULL, NULL);
3123 lwkt_reltoken(&pf_token);
3131 struct pfil_head *pfh_inet;
3133 struct pfil_head *pfh_inet6;
3136 lwkt_gettoken(&pf_token);
3138 if (pf_pfil_hooked) {
3139 lwkt_reltoken(&pf_token);
3143 pfh_inet = pfil_head_get(PFIL_TYPE_AF, AF_INET);
3144 if (pfh_inet == NULL) {
3145 lwkt_reltoken(&pf_token);
3148 pfil_add_hook(pf_check_in, NULL, PFIL_IN | PFIL_MPSAFE, pfh_inet);
3149 pfil_add_hook(pf_check_out, NULL, PFIL_OUT | PFIL_MPSAFE, pfh_inet);
3151 pfh_inet6 = pfil_head_get(PFIL_TYPE_AF, AF_INET6);
3152 if (pfh_inet6 == NULL) {
3153 pfil_remove_hook(pf_check_in, NULL, PFIL_IN, pfh_inet);
3154 pfil_remove_hook(pf_check_out, NULL, PFIL_OUT, pfh_inet);
3155 lwkt_reltoken(&pf_token);
3158 pfil_add_hook(pf_check6_in, NULL, PFIL_IN | PFIL_MPSAFE, pfh_inet6);
3159 pfil_add_hook(pf_check6_out, NULL, PFIL_OUT | PFIL_MPSAFE, pfh_inet6);
3163 lwkt_reltoken(&pf_token);
3170 struct pfil_head *pfh_inet;
3172 struct pfil_head *pfh_inet6;
3175 lwkt_gettoken(&pf_token);
3177 if (pf_pfil_hooked == 0) {
3178 lwkt_reltoken(&pf_token);
3182 pfh_inet = pfil_head_get(PFIL_TYPE_AF, AF_INET);
3183 if (pfh_inet == NULL) {
3184 lwkt_reltoken(&pf_token);
3187 pfil_remove_hook(pf_check_in, NULL, PFIL_IN, pfh_inet);
3188 pfil_remove_hook(pf_check_out, NULL, PFIL_OUT, pfh_inet);
3190 pfh_inet6 = pfil_head_get(PFIL_TYPE_AF, AF_INET6);
3191 if (pfh_inet6 == NULL) {
3192 lwkt_reltoken(&pf_token);
3195 pfil_remove_hook(pf_check6_in, NULL, PFIL_IN, pfh_inet6);
3196 pfil_remove_hook(pf_check6_out, NULL, PFIL_OUT, pfh_inet6);
3200 lwkt_reltoken(&pf_token);
3209 lwkt_gettoken(&pf_token);
3211 lockinit(&pf_mod_lck, "pf task lck", 0, LK_CANRECURSE);
3212 pf_dev = make_dev(&pf_ops, 0, 0, 0, 0600, PF_NAME);
3214 lockinit(&pf_consistency_lock, "pfconslck", 0, LK_CANRECURSE);
3215 lwkt_reltoken(&pf_token);
3220 pf_mask_del(struct radix_node *rn, void *arg)
3222 struct radix_node_head *rnh = arg;
3224 rnh->rnh_deladdr(rn->rn_key, rn->rn_mask, rnh);
3233 pf_status.running = 0;
3235 lwkt_gettoken(&pf_token);
3237 error = dehook_pf();
3240 * Should not happen!
3241 * XXX Due to error code ESRCH, kldunload will show
3242 * a message like 'No such process'.
3244 kprintf("pfil unregistration fail\n");
3245 lwkt_reltoken(&pf_token);
3250 while (pf_end_threads < 2) {
3251 wakeup_one(pf_purge_thread);
3252 lksleep(pf_purge_thread, &pf_mod_lck, 0, "pftmo", hz);
3257 dev_ops_remove_all(&pf_ops);
3258 lockuninit(&pf_consistency_lock);
3259 lockuninit(&pf_mod_lck);
3260 lwkt_reltoken(&pf_token);
3262 if (pf_maskhead != NULL) {
3263 pf_maskhead->rnh_walktree(pf_maskhead,
3264 pf_mask_del, pf_maskhead);
3268 kmalloc_destroy(&pf_state_pl);
3269 kmalloc_destroy(&pf_frent_pl);
3270 kmalloc_destroy(&pf_cent_pl);
3275 pf_modevent(module_t mod, int type, void *data)
3279 lwkt_gettoken(&pf_token);
3287 error = pf_unload();
3293 lwkt_reltoken(&pf_token);
3297 static moduledata_t pf_mod = {
3302 DECLARE_MODULE(pf, pf_mod, SI_SUB_PSEUDO, SI_ORDER_FIRST);
3303 MODULE_VERSION(pf, PF_MODVER);