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_pflog.h>
79 #include <net/pf/if_pfsync.h>
82 #include <netinet/ip6.h>
83 #include <netinet/in_pcb.h>
87 #include <net/altq/altq.h>
90 #include <machine/limits.h>
92 #include <sys/mutex.h>
94 u_int rt_numfibs = RT_NUMFIBS;
97 struct pf_pool *pf_get_pool(char *, u_int32_t, u_int8_t, u_int32_t,
98 u_int8_t, u_int8_t, u_int8_t);
100 void pf_mv_pool(struct pf_palist *, struct pf_palist *);
101 void pf_empty_pool(struct pf_palist *);
103 int pf_begin_altq(u_int32_t *);
104 int pf_rollback_altq(u_int32_t);
105 int pf_commit_altq(u_int32_t);
106 int pf_enable_altq(struct pf_altq *);
107 int pf_disable_altq(struct pf_altq *);
109 int pf_begin_rules(u_int32_t *, int, const char *);
110 int pf_rollback_rules(u_int32_t, int, char *);
111 int pf_setup_pfsync_matching(struct pf_ruleset *);
112 void pf_hash_rule(MD5_CTX *, struct pf_rule *);
113 void pf_hash_rule_addr(MD5_CTX *, struct pf_rule_addr *);
114 int pf_commit_rules(u_int32_t, int, char *);
115 int pf_addr_setup(struct pf_ruleset *,
116 struct pf_addr_wrap *, sa_family_t);
117 void pf_addr_copyout(struct pf_addr_wrap *);
119 struct pf_rule pf_default_rule;
120 struct lock pf_consistency_lock;
122 static int pf_altq_running;
125 #define TAGID_MAX 50000
126 TAILQ_HEAD(pf_tags, pf_tagname) pf_tags = TAILQ_HEAD_INITIALIZER(pf_tags),
127 pf_qids = TAILQ_HEAD_INITIALIZER(pf_qids);
129 #if (PF_QNAME_SIZE != PF_TAG_NAME_SIZE)
130 #error PF_QNAME_SIZE must be equal to PF_TAG_NAME_SIZE
132 u_int16_t tagname2tag(struct pf_tags *, char *);
133 void tag2tagname(struct pf_tags *, u_int16_t, char *);
134 void tag_unref(struct pf_tags *, u_int16_t);
135 int pf_rtlabel_add(struct pf_addr_wrap *);
136 void pf_rtlabel_remove(struct pf_addr_wrap *);
137 void pf_rtlabel_copyout(struct pf_addr_wrap *);
139 #define DPFPRINTF(n, x) if (pf_status.debug >= (n)) kprintf x
141 static cdev_t pf_dev;
143 static MALLOC_DEFINE(M_PFRULEPL, "pfrulepl", "pf rule pool list");
144 static MALLOC_DEFINE(M_PFALTQPL, "pfaltqpl", "pf altq pool list");
145 static MALLOC_DEFINE(M_PFPOOLADDRPL, "pfpooladdrpl", "pf pool address pool list");
146 static MALLOC_DEFINE(M_PFFRENTPL, "pffrent", "pf frent pool list");
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(void);
156 * XXX - These are new and need to be checked when moveing to a new version
160 * Wrapper functions for pfil(9) hooks
162 static int pf_check_in(void *arg, struct mbuf **m, struct ifnet *ifp,
164 static int pf_check_out(void *arg, struct mbuf **m, struct ifnet *ifp,
167 static int pf_check6_in(void *arg, struct mbuf **m, struct ifnet *ifp,
169 static int pf_check6_out(void *arg, struct mbuf **m, struct ifnet *ifp,
173 static int hook_pf(void);
174 static int dehook_pf(void);
175 static int shutdown_pf(void);
176 static int pf_load(void);
177 static int pf_unload(void);
183 static struct dev_ops pf_ops = { /* XXX convert to port model */
190 static volatile int pf_pfil_hooked = 0;
191 int pf_end_threads = 0;
193 int debug_pfugidhack = 0;
194 SYSCTL_INT(_debug, OID_AUTO, pfugidhack, CTLFLAG_RW, &debug_pfugidhack, 0,
195 "Enable/disable pf user/group rules mpsafe hack");
200 u_int32_t *my_timeout = pf_default_rule.timeout;
203 if (!rn_inithead((void **)&pf_maskhead, NULL, 0)) {
204 kprintf("pf mask radix tree create failed\n");
207 kmalloc_create(&pf_state_pl, "pf state pool list");
208 kmalloc_raise_limit(pf_state_pl, 0);
209 kmalloc_create(&pf_frent_pl, "pf fragment pool list");
210 kmalloc_raise_limit(pf_frent_pl, 0);
211 kmalloc_create(&pf_cent_pl, "pf cent pool list");
212 kmalloc_raise_limit(pf_cent_pl, 0);
216 pf_osfp_initialize();
218 pf_pool_limits[PF_LIMIT_STATES].pp = pf_state_pl;
219 pf_pool_limits[PF_LIMIT_STATES].limit = PFSTATE_HIWAT;
220 pf_pool_limits[PF_LIMIT_FRAGS].pp = pf_frent_pl;
221 pf_pool_limits[PF_LIMIT_FRAGS].limit = PFFRAG_FRENT_HIWAT;
222 if (ctob(physmem) <= 100*1024*1024)
223 pf_pool_limits[PF_LIMIT_TABLE_ENTRIES].limit =
224 PFR_KENTRY_HIWAT_SMALL;
226 RB_INIT(&tree_src_tracking);
227 RB_INIT(&pf_anchors);
228 pf_init_ruleset(&pf_main_ruleset);
229 TAILQ_INIT(&pf_altqs[0]);
230 TAILQ_INIT(&pf_altqs[1]);
231 TAILQ_INIT(&pf_pabuf);
232 pf_altqs_active = &pf_altqs[0];
233 pf_altqs_inactive = &pf_altqs[1];
234 TAILQ_INIT(&state_list);
236 /* default rule should never be garbage collected */
237 pf_default_rule.entries.tqe_prev = &pf_default_rule.entries.tqe_next;
238 pf_default_rule.action = PF_PASS;
239 pf_default_rule.nr = (uint32_t)(-1);
240 pf_default_rule.rtableid = -1;
242 /* initialize default timeouts */
243 my_timeout[PFTM_TCP_FIRST_PACKET] = 120; /* First TCP packet */
244 my_timeout[PFTM_TCP_OPENING] = 30; /* No response yet */
245 my_timeout[PFTM_TCP_ESTABLISHED] = 24*60*60; /* Established */
246 my_timeout[PFTM_TCP_CLOSING] = 15 * 60; /* Half closed */
247 my_timeout[PFTM_TCP_FIN_WAIT] = 45; /* Got both FINs */
248 my_timeout[PFTM_TCP_CLOSED] = 90; /* Got a RST */
249 my_timeout[PFTM_UDP_FIRST_PACKET] = 60; /* First UDP packet */
250 my_timeout[PFTM_UDP_SINGLE] = 30; /* Unidirectional */
251 my_timeout[PFTM_UDP_MULTIPLE] = 60; /* Bidirectional */
252 my_timeout[PFTM_ICMP_FIRST_PACKET] = 20; /* First ICMP packet */
253 my_timeout[PFTM_ICMP_ERROR_REPLY] = 10; /* Got error response */
254 my_timeout[PFTM_OTHER_FIRST_PACKET] = 60; /* First packet */
255 my_timeout[PFTM_OTHER_SINGLE] = 30; /* Unidirectional */
256 my_timeout[PFTM_OTHER_MULTIPLE] = 60; /* Bidirectional */
257 my_timeout[PFTM_FRAG] = 30; /* Fragment expire */
258 my_timeout[PFTM_INTERVAL] = 10; /* Expire interval */
259 my_timeout[PFTM_SRC_NODE] = 0; /* Source Tracking */
260 my_timeout[PFTM_TS_DIFF] = 30; /* Allowed TS diff */
261 my_timeout[PFTM_ADAPTIVE_START] = PFSTATE_ADAPT_START;
262 my_timeout[PFTM_ADAPTIVE_END] = PFSTATE_ADAPT_END;
265 bzero(&pf_status, sizeof(pf_status));
266 pf_status.debug = PF_DEBUG_URGENT;
267 /* XXX do our best to avoid a conflict */
268 pf_status.hostid = karc4random();
270 if (kthread_create(pf_purge_thread, NULL, NULL, "pfpurge"))
271 panic("pfpurge thread");
275 pfopen(struct dev_open_args *ap)
277 lwkt_gettoken(&pf_token);
278 cdev_t dev = ap->a_head.a_dev;
279 if (minor(dev) >= 1) {
280 lwkt_reltoken(&pf_token);
283 lwkt_reltoken(&pf_token);
288 pfclose(struct dev_close_args *ap)
290 lwkt_gettoken(&pf_token);
291 cdev_t dev = ap->a_head.a_dev;
292 if (minor(dev) >= 1) {
293 lwkt_reltoken(&pf_token);
296 lwkt_reltoken(&pf_token);
301 pf_get_pool(char *anchor, u_int32_t ticket, u_int8_t rule_action,
302 u_int32_t rule_number, u_int8_t r_last, u_int8_t active,
303 u_int8_t check_ticket)
305 struct pf_ruleset *ruleset;
306 struct pf_rule *rule;
309 ruleset = pf_find_ruleset(anchor);
312 rs_num = pf_get_ruleset_number(rule_action);
313 if (rs_num >= PF_RULESET_MAX)
316 if (check_ticket && ticket !=
317 ruleset->rules[rs_num].active.ticket)
320 rule = TAILQ_LAST(ruleset->rules[rs_num].active.ptr,
323 rule = TAILQ_FIRST(ruleset->rules[rs_num].active.ptr);
325 if (check_ticket && ticket !=
326 ruleset->rules[rs_num].inactive.ticket)
329 rule = TAILQ_LAST(ruleset->rules[rs_num].inactive.ptr,
332 rule = TAILQ_FIRST(ruleset->rules[rs_num].inactive.ptr);
335 while ((rule != NULL) && (rule->nr != rule_number))
336 rule = TAILQ_NEXT(rule, entries);
341 return (&rule->rpool);
345 pf_mv_pool(struct pf_palist *poola, struct pf_palist *poolb)
347 struct pf_pooladdr *mv_pool_pa;
349 while ((mv_pool_pa = TAILQ_FIRST(poola)) != NULL) {
350 TAILQ_REMOVE(poola, mv_pool_pa, entries);
351 TAILQ_INSERT_TAIL(poolb, mv_pool_pa, entries);
356 pf_empty_pool(struct pf_palist *poola)
358 struct pf_pooladdr *empty_pool_pa;
360 while ((empty_pool_pa = TAILQ_FIRST(poola)) != NULL) {
361 pfi_dynaddr_remove(&empty_pool_pa->addr);
362 pf_tbladdr_remove(&empty_pool_pa->addr);
363 pfi_kif_unref(empty_pool_pa->kif, PFI_KIF_REF_RULE);
364 TAILQ_REMOVE(poola, empty_pool_pa, entries);
365 kfree(empty_pool_pa, M_PFPOOLADDRPL);
370 pf_rm_rule(struct pf_rulequeue *rulequeue, struct pf_rule *rule)
372 if (rulequeue != NULL) {
373 if (rule->states_cur <= 0) {
375 * XXX - we need to remove the table *before* detaching
376 * the rule to make sure the table code does not delete
377 * the anchor under our feet.
379 pf_tbladdr_remove(&rule->src.addr);
380 pf_tbladdr_remove(&rule->dst.addr);
381 if (rule->overload_tbl)
382 pfr_detach_table(rule->overload_tbl);
384 TAILQ_REMOVE(rulequeue, rule, entries);
385 rule->entries.tqe_prev = NULL;
389 if (rule->states_cur > 0 || rule->src_nodes > 0 ||
390 rule->entries.tqe_prev != NULL)
392 pf_tag_unref(rule->tag);
393 pf_tag_unref(rule->match_tag);
395 if (rule->pqid != rule->qid)
396 pf_qid_unref(rule->pqid);
397 pf_qid_unref(rule->qid);
399 pf_rtlabel_remove(&rule->src.addr);
400 pf_rtlabel_remove(&rule->dst.addr);
401 pfi_dynaddr_remove(&rule->src.addr);
402 pfi_dynaddr_remove(&rule->dst.addr);
403 if (rulequeue == NULL) {
404 pf_tbladdr_remove(&rule->src.addr);
405 pf_tbladdr_remove(&rule->dst.addr);
406 if (rule->overload_tbl)
407 pfr_detach_table(rule->overload_tbl);
409 pfi_kif_unref(rule->kif, PFI_KIF_REF_RULE);
410 pf_anchor_remove(rule);
411 pf_empty_pool(&rule->rpool.list);
412 kfree(rule, M_PFRULEPL);
416 tagname2tag(struct pf_tags *head, char *tagname)
418 struct pf_tagname *tag, *p = NULL;
419 u_int16_t new_tagid = 1;
421 TAILQ_FOREACH(tag, head, entries)
422 if (strcmp(tagname, tag->name) == 0) {
428 * to avoid fragmentation, we do a linear search from the beginning
429 * and take the first free slot we find. if there is none or the list
430 * is empty, append a new entry at the end.
434 if (!TAILQ_EMPTY(head))
435 for (p = TAILQ_FIRST(head); p != NULL &&
436 p->tag == new_tagid; p = TAILQ_NEXT(p, entries))
437 new_tagid = p->tag + 1;
439 if (new_tagid > TAGID_MAX)
442 /* allocate and fill new struct pf_tagname */
443 tag = kmalloc(sizeof(*tag), M_TEMP, M_WAITOK);
444 strlcpy(tag->name, tagname, sizeof(tag->name));
445 tag->tag = new_tagid;
448 if (p != NULL) /* insert new entry before p */
449 TAILQ_INSERT_BEFORE(p, tag, entries);
450 else /* either list empty or no free slot in between */
451 TAILQ_INSERT_TAIL(head, tag, entries);
457 tag2tagname(struct pf_tags *head, u_int16_t tagid, char *p)
459 struct pf_tagname *tag;
461 TAILQ_FOREACH(tag, head, entries)
462 if (tag->tag == tagid) {
463 strlcpy(p, tag->name, PF_TAG_NAME_SIZE);
469 tag_unref(struct pf_tags *head, u_int16_t tag)
471 struct pf_tagname *p, *next;
476 for (p = TAILQ_FIRST(head); p != NULL; p = next) {
477 next = TAILQ_NEXT(p, entries);
480 TAILQ_REMOVE(head, p, entries);
489 pf_tagname2tag(char *tagname)
491 return (tagname2tag(&pf_tags, tagname));
495 pf_tag2tagname(u_int16_t tagid, char *p)
497 tag2tagname(&pf_tags, tagid, p);
501 pf_tag_ref(u_int16_t tag)
503 struct pf_tagname *t;
505 TAILQ_FOREACH(t, &pf_tags, entries)
513 pf_tag_unref(u_int16_t tag)
515 tag_unref(&pf_tags, tag);
519 pf_rtlabel_add(struct pf_addr_wrap *a)
525 pf_rtlabel_remove(struct pf_addr_wrap *a)
530 pf_rtlabel_copyout(struct pf_addr_wrap *a)
532 if (a->type == PF_ADDR_RTLABEL && a->v.rtlabel)
533 strlcpy(a->v.rtlabelname, "?", sizeof(a->v.rtlabelname));
538 pf_qname2qid(char *qname)
540 return ((u_int32_t)tagname2tag(&pf_qids, qname));
544 pf_qid2qname(u_int32_t qid, char *p)
546 tag2tagname(&pf_qids, (u_int16_t)qid, p);
550 pf_qid_unref(u_int32_t qid)
552 tag_unref(&pf_qids, (u_int16_t)qid);
556 pf_begin_altq(u_int32_t *ticket)
558 struct pf_altq *altq;
561 /* Purge the old altq list */
562 while ((altq = TAILQ_FIRST(pf_altqs_inactive)) != NULL) {
563 TAILQ_REMOVE(pf_altqs_inactive, altq, entries);
564 if (altq->qname[0] == 0) {
565 /* detach and destroy the discipline */
566 error = altq_remove(altq);
568 pf_qid_unref(altq->qid);
569 kfree(altq, M_PFALTQPL);
573 *ticket = ++ticket_altqs_inactive;
574 altqs_inactive_open = 1;
579 pf_rollback_altq(u_int32_t ticket)
581 struct pf_altq *altq;
584 if (!altqs_inactive_open || ticket != ticket_altqs_inactive)
586 /* Purge the old altq list */
587 while ((altq = TAILQ_FIRST(pf_altqs_inactive)) != NULL) {
588 TAILQ_REMOVE(pf_altqs_inactive, altq, entries);
589 if (altq->qname[0] == 0) {
590 /* detach and destroy the discipline */
591 error = altq_remove(altq);
593 pf_qid_unref(altq->qid);
594 kfree(altq, M_PFALTQPL);
596 altqs_inactive_open = 0;
601 pf_commit_altq(u_int32_t ticket)
603 struct pf_altqqueue *old_altqs;
604 struct pf_altq *altq;
607 if (!altqs_inactive_open || ticket != ticket_altqs_inactive)
610 /* swap altqs, keep the old. */
612 old_altqs = pf_altqs_active;
613 pf_altqs_active = pf_altqs_inactive;
614 pf_altqs_inactive = old_altqs;
615 ticket_altqs_active = ticket_altqs_inactive;
617 /* Attach new disciplines */
618 TAILQ_FOREACH(altq, pf_altqs_active, entries) {
619 if (altq->qname[0] == 0) {
620 /* attach the discipline */
621 error = altq_pfattach(altq);
629 /* Purge the old altq list */
630 while ((altq = TAILQ_FIRST(pf_altqs_inactive)) != NULL) {
631 TAILQ_REMOVE(pf_altqs_inactive, altq, entries);
632 if (altq->qname[0] == 0) {
633 /* detach and destroy the discipline */
635 error = pf_disable_altq(altq);
636 err = altq_pfdetach(altq);
637 if (err != 0 && error == 0)
639 err = altq_remove(altq);
640 if (err != 0 && error == 0)
643 pf_qid_unref(altq->qid);
644 kfree(altq, M_PFALTQPL);
648 altqs_inactive_open = 0;
653 pf_enable_altq(struct pf_altq *altq)
656 struct tb_profile tb;
659 if ((ifp = ifunit(altq->ifname)) == NULL)
662 if (ifp->if_snd.altq_type != ALTQT_NONE)
663 error = altq_enable(&ifp->if_snd);
665 /* set tokenbucket regulator */
666 if (error == 0 && ifp != NULL && ALTQ_IS_ENABLED(&ifp->if_snd)) {
667 tb.rate = altq->ifbandwidth;
668 tb.depth = altq->tbrsize;
670 error = tbr_set(&ifp->if_snd, &tb);
678 pf_disable_altq(struct pf_altq *altq)
681 struct tb_profile tb;
684 if ((ifp = ifunit(altq->ifname)) == NULL)
688 * when the discipline is no longer referenced, it was overridden
689 * by a new one. if so, just return.
691 if (altq->altq_disc != ifp->if_snd.altq_disc)
694 error = altq_disable(&ifp->if_snd);
697 /* clear tokenbucket regulator */
700 error = tbr_set(&ifp->if_snd, &tb);
709 pf_begin_rules(u_int32_t *ticket, int rs_num, const char *anchor)
711 struct pf_ruleset *rs;
712 struct pf_rule *rule;
714 if (rs_num < 0 || rs_num >= PF_RULESET_MAX)
716 rs = pf_find_or_create_ruleset(anchor);
719 while ((rule = TAILQ_FIRST(rs->rules[rs_num].inactive.ptr)) != NULL) {
720 pf_rm_rule(rs->rules[rs_num].inactive.ptr, rule);
721 rs->rules[rs_num].inactive.rcount--;
723 *ticket = ++rs->rules[rs_num].inactive.ticket;
724 rs->rules[rs_num].inactive.open = 1;
729 pf_rollback_rules(u_int32_t ticket, int rs_num, char *anchor)
731 struct pf_ruleset *rs;
732 struct pf_rule *rule;
734 if (rs_num < 0 || rs_num >= PF_RULESET_MAX)
736 rs = pf_find_ruleset(anchor);
737 if (rs == NULL || !rs->rules[rs_num].inactive.open ||
738 rs->rules[rs_num].inactive.ticket != ticket)
740 while ((rule = TAILQ_FIRST(rs->rules[rs_num].inactive.ptr)) != NULL) {
741 pf_rm_rule(rs->rules[rs_num].inactive.ptr, rule);
742 rs->rules[rs_num].inactive.rcount--;
744 rs->rules[rs_num].inactive.open = 0;
748 #define PF_MD5_UPD(st, elm) \
749 MD5Update(ctx, (u_int8_t *) &(st)->elm, sizeof((st)->elm))
751 #define PF_MD5_UPD_STR(st, elm) \
752 MD5Update(ctx, (u_int8_t *) (st)->elm, strlen((st)->elm))
754 #define PF_MD5_UPD_HTONL(st, elm, stor) do { \
755 (stor) = htonl((st)->elm); \
756 MD5Update(ctx, (u_int8_t *) &(stor), sizeof(u_int32_t));\
759 #define PF_MD5_UPD_HTONS(st, elm, stor) do { \
760 (stor) = htons((st)->elm); \
761 MD5Update(ctx, (u_int8_t *) &(stor), sizeof(u_int16_t));\
765 pf_hash_rule_addr(MD5_CTX *ctx, struct pf_rule_addr *pfr)
767 PF_MD5_UPD(pfr, addr.type);
768 switch (pfr->addr.type) {
769 case PF_ADDR_DYNIFTL:
770 PF_MD5_UPD(pfr, addr.v.ifname);
771 PF_MD5_UPD(pfr, addr.iflags);
774 PF_MD5_UPD(pfr, addr.v.tblname);
776 case PF_ADDR_ADDRMASK:
778 PF_MD5_UPD(pfr, addr.v.a.addr.addr32);
779 PF_MD5_UPD(pfr, addr.v.a.mask.addr32);
781 case PF_ADDR_RTLABEL:
782 PF_MD5_UPD(pfr, addr.v.rtlabelname);
786 PF_MD5_UPD(pfr, port[0]);
787 PF_MD5_UPD(pfr, port[1]);
788 PF_MD5_UPD(pfr, neg);
789 PF_MD5_UPD(pfr, port_op);
793 pf_hash_rule(MD5_CTX *ctx, struct pf_rule *rule)
798 pf_hash_rule_addr(ctx, &rule->src);
799 pf_hash_rule_addr(ctx, &rule->dst);
800 PF_MD5_UPD_STR(rule, label);
801 PF_MD5_UPD_STR(rule, ifname);
802 PF_MD5_UPD_STR(rule, match_tagname);
803 PF_MD5_UPD_HTONS(rule, match_tag, x); /* dup? */
804 PF_MD5_UPD_HTONL(rule, os_fingerprint, y);
805 PF_MD5_UPD_HTONL(rule, prob, y);
806 PF_MD5_UPD_HTONL(rule, uid.uid[0], y);
807 PF_MD5_UPD_HTONL(rule, uid.uid[1], y);
808 PF_MD5_UPD(rule, uid.op);
809 PF_MD5_UPD_HTONL(rule, gid.gid[0], y);
810 PF_MD5_UPD_HTONL(rule, gid.gid[1], y);
811 PF_MD5_UPD(rule, gid.op);
812 PF_MD5_UPD_HTONL(rule, rule_flag, y);
813 PF_MD5_UPD(rule, action);
814 PF_MD5_UPD(rule, direction);
815 PF_MD5_UPD(rule, af);
816 PF_MD5_UPD(rule, quick);
817 PF_MD5_UPD(rule, ifnot);
818 PF_MD5_UPD(rule, match_tag_not);
819 PF_MD5_UPD(rule, natpass);
820 PF_MD5_UPD(rule, keep_state);
821 PF_MD5_UPD(rule, proto);
822 PF_MD5_UPD(rule, type);
823 PF_MD5_UPD(rule, code);
824 PF_MD5_UPD(rule, flags);
825 PF_MD5_UPD(rule, flagset);
826 PF_MD5_UPD(rule, allow_opts);
827 PF_MD5_UPD(rule, rt);
828 PF_MD5_UPD(rule, tos);
832 pf_commit_rules(u_int32_t ticket, int rs_num, char *anchor)
834 struct pf_ruleset *rs;
835 struct pf_rule *rule, **old_array;
836 struct pf_rulequeue *old_rules;
838 u_int32_t old_rcount;
840 if (rs_num < 0 || rs_num >= PF_RULESET_MAX)
842 rs = pf_find_ruleset(anchor);
843 if (rs == NULL || !rs->rules[rs_num].inactive.open ||
844 ticket != rs->rules[rs_num].inactive.ticket)
847 /* Calculate checksum for the main ruleset */
848 if (rs == &pf_main_ruleset) {
849 error = pf_setup_pfsync_matching(rs);
854 /* Swap rules, keep the old. */
856 old_rules = rs->rules[rs_num].active.ptr;
857 old_rcount = rs->rules[rs_num].active.rcount;
858 old_array = rs->rules[rs_num].active.ptr_array;
860 rs->rules[rs_num].active.ptr =
861 rs->rules[rs_num].inactive.ptr;
862 rs->rules[rs_num].active.ptr_array =
863 rs->rules[rs_num].inactive.ptr_array;
864 rs->rules[rs_num].active.rcount =
865 rs->rules[rs_num].inactive.rcount;
866 rs->rules[rs_num].inactive.ptr = old_rules;
867 rs->rules[rs_num].inactive.ptr_array = old_array;
868 rs->rules[rs_num].inactive.rcount = old_rcount;
870 rs->rules[rs_num].active.ticket =
871 rs->rules[rs_num].inactive.ticket;
872 pf_calc_skip_steps(rs->rules[rs_num].active.ptr);
875 /* Purge the old rule list. */
876 while ((rule = TAILQ_FIRST(old_rules)) != NULL)
877 pf_rm_rule(old_rules, rule);
878 if (rs->rules[rs_num].inactive.ptr_array)
879 kfree(rs->rules[rs_num].inactive.ptr_array, M_TEMP);
880 rs->rules[rs_num].inactive.ptr_array = NULL;
881 rs->rules[rs_num].inactive.rcount = 0;
882 rs->rules[rs_num].inactive.open = 0;
883 pf_remove_if_empty_ruleset(rs);
889 pf_setup_pfsync_matching(struct pf_ruleset *rs)
892 struct pf_rule *rule;
894 u_int8_t digest[PF_MD5_DIGEST_LENGTH];
897 for (rs_cnt = 0; rs_cnt < PF_RULESET_MAX; rs_cnt++) {
898 /* XXX PF_RULESET_SCRUB as well? */
899 if (rs_cnt == PF_RULESET_SCRUB)
902 if (rs->rules[rs_cnt].inactive.ptr_array)
903 kfree(rs->rules[rs_cnt].inactive.ptr_array, M_TEMP);
904 rs->rules[rs_cnt].inactive.ptr_array = NULL;
906 if (rs->rules[rs_cnt].inactive.rcount) {
907 rs->rules[rs_cnt].inactive.ptr_array =
908 kmalloc(sizeof(caddr_t) *
909 rs->rules[rs_cnt].inactive.rcount,
912 if (!rs->rules[rs_cnt].inactive.ptr_array)
916 TAILQ_FOREACH(rule, rs->rules[rs_cnt].inactive.ptr,
918 pf_hash_rule(&ctx, rule);
919 (rs->rules[rs_cnt].inactive.ptr_array)[rule->nr] = rule;
923 MD5Final(digest, &ctx);
924 memcpy(pf_status.pf_chksum, digest, sizeof(pf_status.pf_chksum));
929 pf_addr_setup(struct pf_ruleset *ruleset, struct pf_addr_wrap *addr,
932 if (pfi_dynaddr_setup(addr, af) ||
933 pf_tbladdr_setup(ruleset, addr))
940 pf_addr_copyout(struct pf_addr_wrap *addr)
942 pfi_dynaddr_copyout(addr);
943 pf_tbladdr_copyout(addr);
944 pf_rtlabel_copyout(addr);
948 pfioctl(struct dev_ioctl_args *ap)
950 u_long cmd = ap->a_cmd;
951 caddr_t addr = ap->a_data;
952 struct pf_pooladdr *pa = NULL;
953 struct pf_pool *pool = NULL;
956 lwkt_gettoken(&pf_token);
958 /* XXX keep in sync with switch() below */
966 case DIOCSETSTATUSIF:
973 case DIOCCLRRULECTRS:
978 case DIOCGETRULESETS:
992 case DIOCGETSRCNODES:
993 case DIOCCLRSRCNODES:
1000 case DIOCRADDTABLES:
1001 case DIOCRDELTABLES:
1002 case DIOCRSETTFLAGS:
1003 if (((struct pfioc_table *)addr)->pfrio_flags &
1005 break; /* dummy operation ok */
1006 lwkt_reltoken(&pf_token);
1009 lwkt_reltoken(&pf_token);
1013 if (!(ap->a_fflag & FWRITE))
1021 case DIOCGETTIMEOUT:
1026 case DIOCGETRULESETS:
1027 case DIOCGETRULESET:
1029 case DIOCRGETTABLES:
1030 case DIOCRGETTSTATS:
1032 case DIOCRGETASTATS:
1035 case DIOCGETSRCNODES:
1036 case DIOCIGETIFACES:
1039 case DIOCRCLRTABLES:
1040 case DIOCRADDTABLES:
1041 case DIOCRDELTABLES:
1042 case DIOCRCLRTSTATS:
1047 case DIOCRSETTFLAGS:
1048 if (((struct pfioc_table *)addr)->pfrio_flags &
1050 break; /* dummy operation ok */
1051 lwkt_reltoken(&pf_token);
1054 if (((struct pfioc_rule *)addr)->action ==
1056 lwkt_reltoken(&pf_token);
1061 lwkt_reltoken(&pf_token);
1068 if (pf_status.running)
1073 DPFPRINTF(PF_DEBUG_MISC,
1074 ("pf: pfil registration fail\n"));
1077 pf_status.running = 1;
1078 pf_status.since = time_second;
1079 if (pf_status.stateid == 0) {
1080 pf_status.stateid = time_second;
1081 pf_status.stateid = pf_status.stateid << 32;
1083 DPFPRINTF(PF_DEBUG_MISC, ("pf: started\n"));
1088 if (!pf_status.running)
1091 pf_status.running = 0;
1092 error = dehook_pf();
1094 pf_status.running = 1;
1095 DPFPRINTF(PF_DEBUG_MISC,
1096 ("pf: pfil unregistration failed\n"));
1098 pf_status.since = time_second;
1099 DPFPRINTF(PF_DEBUG_MISC, ("pf: stopped\n"));
1104 struct pfioc_rule *pr = (struct pfioc_rule *)addr;
1105 struct pf_ruleset *ruleset;
1106 struct pf_rule *rule, *tail;
1107 struct pf_pooladdr *pa;
1110 pr->anchor[sizeof(pr->anchor) - 1] = 0;
1111 ruleset = pf_find_ruleset(pr->anchor);
1112 if (ruleset == NULL) {
1116 rs_num = pf_get_ruleset_number(pr->rule.action);
1117 if (rs_num >= PF_RULESET_MAX) {
1121 if (pr->rule.return_icmp >> 8 > ICMP_MAXTYPE) {
1125 if (pr->ticket != ruleset->rules[rs_num].inactive.ticket) {
1129 if (pr->pool_ticket != ticket_pabuf) {
1133 rule = kmalloc(sizeof(struct pf_rule), M_PFRULEPL, M_WAITOK);
1134 bcopy(&pr->rule, rule, sizeof(struct pf_rule));
1135 rule->cuid = ap->a_cred->cr_ruid;
1137 rule->anchor = NULL;
1139 TAILQ_INIT(&rule->rpool.list);
1140 /* initialize refcounting */
1141 rule->states_cur = 0;
1142 rule->src_nodes = 0;
1143 rule->entries.tqe_prev = NULL;
1145 if (rule->af == AF_INET) {
1146 kfree(rule, M_PFRULEPL);
1147 error = EAFNOSUPPORT;
1152 if (rule->af == AF_INET6) {
1153 kfree(rule, M_PFRULEPL);
1154 error = EAFNOSUPPORT;
1158 tail = TAILQ_LAST(ruleset->rules[rs_num].inactive.ptr,
1161 rule->nr = tail->nr + 1;
1164 if (rule->ifname[0]) {
1165 rule->kif = pfi_kif_get(rule->ifname);
1166 if (rule->kif == NULL) {
1167 kfree(rule, M_PFRULEPL);
1171 pfi_kif_ref(rule->kif, PFI_KIF_REF_RULE);
1174 if (rule->rtableid > 0 && rule->rtableid > rt_numfibs)
1179 if (rule->qname[0] != 0) {
1180 if ((rule->qid = pf_qname2qid(rule->qname)) == 0)
1182 else if (rule->pqname[0] != 0) {
1184 pf_qname2qid(rule->pqname)) == 0)
1187 rule->pqid = rule->qid;
1190 if (rule->tagname[0])
1191 if ((rule->tag = pf_tagname2tag(rule->tagname)) == 0)
1193 if (rule->match_tagname[0])
1194 if ((rule->match_tag =
1195 pf_tagname2tag(rule->match_tagname)) == 0)
1197 if (rule->rt && !rule->direction)
1202 if (rule->logif >= PFLOGIFS_MAX)
1205 if (pf_rtlabel_add(&rule->src.addr) ||
1206 pf_rtlabel_add(&rule->dst.addr))
1208 if (pf_addr_setup(ruleset, &rule->src.addr, rule->af))
1210 if (pf_addr_setup(ruleset, &rule->dst.addr, rule->af))
1212 if (pf_anchor_setup(rule, ruleset, pr->anchor_call))
1214 TAILQ_FOREACH(pa, &pf_pabuf, entries)
1215 if (pf_tbladdr_setup(ruleset, &pa->addr))
1218 if (rule->overload_tblname[0]) {
1219 if ((rule->overload_tbl = pfr_attach_table(ruleset,
1220 rule->overload_tblname)) == NULL)
1223 rule->overload_tbl->pfrkt_flags |=
1227 pf_mv_pool(&pf_pabuf, &rule->rpool.list);
1228 if (((((rule->action == PF_NAT) || (rule->action == PF_RDR) ||
1229 (rule->action == PF_BINAT)) && rule->anchor == NULL) ||
1230 (rule->rt > PF_FASTROUTE)) &&
1231 (TAILQ_FIRST(&rule->rpool.list) == NULL))
1235 pf_rm_rule(NULL, rule);
1238 rule->rpool.cur = TAILQ_FIRST(&rule->rpool.list);
1239 rule->evaluations = rule->packets[0] = rule->packets[1] =
1240 rule->bytes[0] = rule->bytes[1] = 0;
1241 TAILQ_INSERT_TAIL(ruleset->rules[rs_num].inactive.ptr,
1243 ruleset->rules[rs_num].inactive.rcount++;
1247 case DIOCGETRULES: {
1248 struct pfioc_rule *pr = (struct pfioc_rule *)addr;
1249 struct pf_ruleset *ruleset;
1250 struct pf_rule *tail;
1253 pr->anchor[sizeof(pr->anchor) - 1] = 0;
1254 ruleset = pf_find_ruleset(pr->anchor);
1255 if (ruleset == NULL) {
1259 rs_num = pf_get_ruleset_number(pr->rule.action);
1260 if (rs_num >= PF_RULESET_MAX) {
1264 tail = TAILQ_LAST(ruleset->rules[rs_num].active.ptr,
1267 pr->nr = tail->nr + 1;
1270 pr->ticket = ruleset->rules[rs_num].active.ticket;
1275 struct pfioc_rule *pr = (struct pfioc_rule *)addr;
1276 struct pf_ruleset *ruleset;
1277 struct pf_rule *rule;
1280 pr->anchor[sizeof(pr->anchor) - 1] = 0;
1281 ruleset = pf_find_ruleset(pr->anchor);
1282 if (ruleset == NULL) {
1286 rs_num = pf_get_ruleset_number(pr->rule.action);
1287 if (rs_num >= PF_RULESET_MAX) {
1291 if (pr->ticket != ruleset->rules[rs_num].active.ticket) {
1295 rule = TAILQ_FIRST(ruleset->rules[rs_num].active.ptr);
1296 while ((rule != NULL) && (rule->nr != pr->nr))
1297 rule = TAILQ_NEXT(rule, entries);
1302 bcopy(rule, &pr->rule, sizeof(struct pf_rule));
1303 if (pf_anchor_copyout(ruleset, rule, pr)) {
1307 pf_addr_copyout(&pr->rule.src.addr);
1308 pf_addr_copyout(&pr->rule.dst.addr);
1309 for (i = 0; i < PF_SKIP_COUNT; ++i)
1310 if (rule->skip[i].ptr == NULL)
1311 pr->rule.skip[i].nr = (uint32_t)(-1);
1313 pr->rule.skip[i].nr =
1314 rule->skip[i].ptr->nr;
1316 if (pr->action == PF_GET_CLR_CNTR) {
1317 rule->evaluations = 0;
1318 rule->packets[0] = rule->packets[1] = 0;
1319 rule->bytes[0] = rule->bytes[1] = 0;
1320 rule->states_tot = 0;
1325 case DIOCCHANGERULE: {
1326 struct pfioc_rule *pcr = (struct pfioc_rule *)addr;
1327 struct pf_ruleset *ruleset;
1328 struct pf_rule *oldrule = NULL, *newrule = NULL;
1332 if (!(pcr->action == PF_CHANGE_REMOVE ||
1333 pcr->action == PF_CHANGE_GET_TICKET) &&
1334 pcr->pool_ticket != ticket_pabuf) {
1339 if (pcr->action < PF_CHANGE_ADD_HEAD ||
1340 pcr->action > PF_CHANGE_GET_TICKET) {
1344 ruleset = pf_find_ruleset(pcr->anchor);
1345 if (ruleset == NULL) {
1349 rs_num = pf_get_ruleset_number(pcr->rule.action);
1350 if (rs_num >= PF_RULESET_MAX) {
1355 if (pcr->action == PF_CHANGE_GET_TICKET) {
1356 pcr->ticket = ++ruleset->rules[rs_num].active.ticket;
1360 ruleset->rules[rs_num].active.ticket) {
1364 if (pcr->rule.return_icmp >> 8 > ICMP_MAXTYPE) {
1370 if (pcr->action != PF_CHANGE_REMOVE) {
1371 newrule = kmalloc(sizeof(struct pf_rule), M_PFRULEPL, M_WAITOK|M_NULLOK);
1372 if (newrule == NULL) {
1376 bcopy(&pcr->rule, newrule, sizeof(struct pf_rule));
1377 newrule->cuid = ap->a_cred->cr_ruid;
1379 TAILQ_INIT(&newrule->rpool.list);
1380 /* initialize refcounting */
1381 newrule->states_cur = 0;
1382 newrule->entries.tqe_prev = NULL;
1384 if (newrule->af == AF_INET) {
1385 kfree(newrule, M_PFRULEPL);
1386 error = EAFNOSUPPORT;
1391 if (newrule->af == AF_INET6) {
1392 kfree(newrule, M_PFRULEPL);
1393 error = EAFNOSUPPORT;
1397 if (newrule->ifname[0]) {
1398 newrule->kif = pfi_kif_get(newrule->ifname);
1399 if (newrule->kif == NULL) {
1400 kfree(newrule, M_PFRULEPL);
1404 pfi_kif_ref(newrule->kif, PFI_KIF_REF_RULE);
1406 newrule->kif = NULL;
1408 if (newrule->rtableid > 0 &&
1409 newrule->rtableid > rt_numfibs)
1414 if (newrule->qname[0] != 0) {
1416 pf_qname2qid(newrule->qname)) == 0)
1418 else if (newrule->pqname[0] != 0) {
1419 if ((newrule->pqid =
1420 pf_qname2qid(newrule->pqname)) == 0)
1423 newrule->pqid = newrule->qid;
1426 if (newrule->tagname[0])
1428 pf_tagname2tag(newrule->tagname)) == 0)
1430 if (newrule->match_tagname[0])
1431 if ((newrule->match_tag = pf_tagname2tag(
1432 newrule->match_tagname)) == 0)
1434 if (newrule->rt && !newrule->direction)
1439 if (newrule->logif >= PFLOGIFS_MAX)
1442 if (pf_rtlabel_add(&newrule->src.addr) ||
1443 pf_rtlabel_add(&newrule->dst.addr))
1445 if (pf_addr_setup(ruleset, &newrule->src.addr, newrule->af))
1447 if (pf_addr_setup(ruleset, &newrule->dst.addr, newrule->af))
1449 if (pf_anchor_setup(newrule, ruleset, pcr->anchor_call))
1451 TAILQ_FOREACH(pa, &pf_pabuf, entries)
1452 if (pf_tbladdr_setup(ruleset, &pa->addr))
1455 if (newrule->overload_tblname[0]) {
1456 if ((newrule->overload_tbl = pfr_attach_table(
1457 ruleset, newrule->overload_tblname)) ==
1461 newrule->overload_tbl->pfrkt_flags |=
1465 pf_mv_pool(&pf_pabuf, &newrule->rpool.list);
1466 if (((((newrule->action == PF_NAT) ||
1467 (newrule->action == PF_RDR) ||
1468 (newrule->action == PF_BINAT) ||
1469 (newrule->rt > PF_FASTROUTE)) &&
1470 !newrule->anchor)) &&
1471 (TAILQ_FIRST(&newrule->rpool.list) == NULL))
1475 pf_rm_rule(NULL, newrule);
1478 newrule->rpool.cur = TAILQ_FIRST(&newrule->rpool.list);
1479 newrule->evaluations = 0;
1480 newrule->packets[0] = newrule->packets[1] = 0;
1481 newrule->bytes[0] = newrule->bytes[1] = 0;
1483 pf_empty_pool(&pf_pabuf);
1485 if (pcr->action == PF_CHANGE_ADD_HEAD)
1486 oldrule = TAILQ_FIRST(
1487 ruleset->rules[rs_num].active.ptr);
1488 else if (pcr->action == PF_CHANGE_ADD_TAIL)
1489 oldrule = TAILQ_LAST(
1490 ruleset->rules[rs_num].active.ptr, pf_rulequeue);
1492 oldrule = TAILQ_FIRST(
1493 ruleset->rules[rs_num].active.ptr);
1494 while ((oldrule != NULL) && (oldrule->nr != pcr->nr))
1495 oldrule = TAILQ_NEXT(oldrule, entries);
1496 if (oldrule == NULL) {
1497 if (newrule != NULL)
1498 pf_rm_rule(NULL, newrule);
1504 if (pcr->action == PF_CHANGE_REMOVE) {
1505 pf_rm_rule(ruleset->rules[rs_num].active.ptr, oldrule);
1506 ruleset->rules[rs_num].active.rcount--;
1508 if (oldrule == NULL)
1510 ruleset->rules[rs_num].active.ptr,
1512 else if (pcr->action == PF_CHANGE_ADD_HEAD ||
1513 pcr->action == PF_CHANGE_ADD_BEFORE)
1514 TAILQ_INSERT_BEFORE(oldrule, newrule, entries);
1517 ruleset->rules[rs_num].active.ptr,
1518 oldrule, newrule, entries);
1519 ruleset->rules[rs_num].active.rcount++;
1523 TAILQ_FOREACH(oldrule,
1524 ruleset->rules[rs_num].active.ptr, entries)
1527 ruleset->rules[rs_num].active.ticket++;
1529 pf_calc_skip_steps(ruleset->rules[rs_num].active.ptr);
1530 pf_remove_if_empty_ruleset(ruleset);
1535 case DIOCCLRSTATES: {
1536 struct pf_state *s, *nexts;
1537 struct pfioc_state_kill *psk = (struct pfioc_state_kill *)addr;
1540 for (s = RB_MIN(pf_state_tree_id, &tree_id); s; s = nexts) {
1541 nexts = RB_NEXT(pf_state_tree_id, &tree_id, s);
1543 if (!psk->psk_ifname[0] || !strcmp(psk->psk_ifname,
1544 s->kif->pfik_name)) {
1545 /* don't send out individual delete messages */
1546 s->sync_flags = PFSTATE_NOSYNC;
1551 psk->psk_killed = killed;
1552 pfsync_clear_states(pf_status.hostid, psk->psk_ifname);
1556 case DIOCKILLSTATES: {
1557 struct pf_state *s, *nexts;
1558 struct pf_state_key *sk;
1559 struct pf_addr *srcaddr, *dstaddr;
1560 u_int16_t srcport, dstport;
1561 struct pfioc_state_kill *psk = (struct pfioc_state_kill *)addr;
1564 if (psk->psk_pfcmp.id) {
1565 if (psk->psk_pfcmp.creatorid == 0)
1566 psk->psk_pfcmp.creatorid = pf_status.hostid;
1567 if ((s = pf_find_state_byid(&psk->psk_pfcmp))) {
1568 /* send immediate delete of state */
1569 pfsync_delete_state(s);
1570 s->sync_flags |= PFSTATE_NOSYNC;
1572 psk->psk_killed = 1;
1577 for (s = RB_MIN(pf_state_tree_id, &tree_id); s;
1579 nexts = RB_NEXT(pf_state_tree_id, &tree_id, s);
1580 sk = s->key[PF_SK_WIRE];
1582 if (s->direction == PF_OUT) {
1583 srcaddr = &sk->addr[1];
1584 dstaddr = &sk->addr[0];
1585 srcport = sk->port[0];
1586 dstport = sk->port[0];
1588 srcaddr = &sk->addr[0];
1589 dstaddr = &sk->addr[1];
1590 srcport = sk->port[0];
1591 dstport = sk->port[0];
1593 if ((!psk->psk_af || sk->af == psk->psk_af)
1594 && (!psk->psk_proto || psk->psk_proto ==
1596 PF_MATCHA(psk->psk_src.neg,
1597 &psk->psk_src.addr.v.a.addr,
1598 &psk->psk_src.addr.v.a.mask,
1600 PF_MATCHA(psk->psk_dst.neg,
1601 &psk->psk_dst.addr.v.a.addr,
1602 &psk->psk_dst.addr.v.a.mask,
1604 (psk->psk_src.port_op == 0 ||
1605 pf_match_port(psk->psk_src.port_op,
1606 psk->psk_src.port[0], psk->psk_src.port[1],
1608 (psk->psk_dst.port_op == 0 ||
1609 pf_match_port(psk->psk_dst.port_op,
1610 psk->psk_dst.port[0], psk->psk_dst.port[1],
1612 (!psk->psk_label[0] || (s->rule.ptr->label[0] &&
1613 !strcmp(psk->psk_label, s->rule.ptr->label))) &&
1614 (!psk->psk_ifname[0] || !strcmp(psk->psk_ifname,
1615 s->kif->pfik_name))) {
1616 /* send immediate delete of state */
1617 pfsync_delete_state(s);
1618 s->sync_flags |= PFSTATE_NOSYNC;
1623 psk->psk_killed = killed;
1627 case DIOCADDSTATE: {
1628 struct pfioc_state *ps = (struct pfioc_state *)addr;
1629 struct pfsync_state *sp = &ps->state;
1631 if (sp->timeout >= PFTM_MAX &&
1632 sp->timeout != PFTM_UNTIL_PACKET) {
1636 error = pfsync_state_import(sp, PFSYNC_SI_IOCTL);
1640 case DIOCGETSTATE: {
1641 struct pfioc_state *ps = (struct pfioc_state *)addr;
1643 struct pf_state_cmp id_key;
1645 bcopy(ps->state.id, &id_key.id, sizeof(id_key.id));
1646 id_key.creatorid = ps->state.creatorid;
1648 s = pf_find_state_byid(&id_key);
1653 pfsync_state_export(&ps->state, s);
1657 case DIOCGETSTATES: {
1658 struct pfioc_states *ps = (struct pfioc_states *)addr;
1659 struct pf_state *state;
1660 struct pfsync_state *p, *pstore;
1663 if (ps->ps_len == 0) {
1664 nr = pf_status.states;
1665 ps->ps_len = sizeof(struct pfsync_state) * nr;
1669 pstore = kmalloc(sizeof(*pstore), M_TEMP, M_WAITOK);
1673 state = TAILQ_FIRST(&state_list);
1675 if (state->timeout != PFTM_UNLINKED) {
1676 if ((nr+1) * sizeof(*p) > (unsigned)ps->ps_len)
1678 pfsync_state_export(pstore, state);
1679 error = copyout(pstore, p, sizeof(*p));
1681 kfree(pstore, M_TEMP);
1687 state = TAILQ_NEXT(state, entry_list);
1690 ps->ps_len = sizeof(struct pfsync_state) * nr;
1692 kfree(pstore, M_TEMP);
1696 case DIOCGETSTATUS: {
1697 struct pf_status *s = (struct pf_status *)addr;
1698 bcopy(&pf_status, s, sizeof(struct pf_status));
1699 pfi_update_status(s->ifname, s);
1703 case DIOCSETSTATUSIF: {
1704 struct pfioc_if *pi = (struct pfioc_if *)addr;
1706 if (pi->ifname[0] == 0) {
1707 bzero(pf_status.ifname, IFNAMSIZ);
1710 strlcpy(pf_status.ifname, pi->ifname, IFNAMSIZ);
1714 case DIOCCLRSTATUS: {
1715 bzero(pf_status.counters, sizeof(pf_status.counters));
1716 bzero(pf_status.fcounters, sizeof(pf_status.fcounters));
1717 bzero(pf_status.scounters, sizeof(pf_status.scounters));
1718 pf_status.since = time_second;
1719 if (*pf_status.ifname)
1720 pfi_update_status(pf_status.ifname, NULL);
1725 struct pfioc_natlook *pnl = (struct pfioc_natlook *)addr;
1726 struct pf_state_key *sk;
1727 struct pf_state *state;
1728 struct pf_state_key_cmp key;
1729 int m = 0, direction = pnl->direction;
1732 /* NATLOOK src and dst are reversed, so reverse sidx/didx */
1733 sidx = (direction == PF_IN) ? 1 : 0;
1734 didx = (direction == PF_IN) ? 0 : 1;
1737 PF_AZERO(&pnl->saddr, pnl->af) ||
1738 PF_AZERO(&pnl->daddr, pnl->af) ||
1739 ((pnl->proto == IPPROTO_TCP ||
1740 pnl->proto == IPPROTO_UDP) &&
1741 (!pnl->dport || !pnl->sport)))
1745 key.proto = pnl->proto;
1746 PF_ACPY(&key.addr[sidx], &pnl->saddr, pnl->af);
1747 key.port[sidx] = pnl->sport;
1748 PF_ACPY(&key.addr[didx], &pnl->daddr, pnl->af);
1749 key.port[didx] = pnl->dport;
1751 state = pf_find_state_all(&key, direction, &m);
1754 error = E2BIG; /* more than one state */
1755 else if (state != NULL) {
1756 sk = state->key[sidx];
1757 PF_ACPY(&pnl->rsaddr, &sk->addr[sidx], sk->af);
1758 pnl->rsport = sk->port[sidx];
1759 PF_ACPY(&pnl->rdaddr, &sk->addr[didx], sk->af);
1760 pnl->rdport = sk->port[didx];
1767 case DIOCSETTIMEOUT: {
1768 struct pfioc_tm *pt = (struct pfioc_tm *)addr;
1771 if (pt->timeout < 0 || pt->timeout >= PFTM_MAX ||
1776 old = pf_default_rule.timeout[pt->timeout];
1777 if (pt->timeout == PFTM_INTERVAL && pt->seconds == 0)
1779 pf_default_rule.timeout[pt->timeout] = pt->seconds;
1780 if (pt->timeout == PFTM_INTERVAL && pt->seconds < old)
1781 wakeup(pf_purge_thread);
1786 case DIOCGETTIMEOUT: {
1787 struct pfioc_tm *pt = (struct pfioc_tm *)addr;
1789 if (pt->timeout < 0 || pt->timeout >= PFTM_MAX) {
1793 pt->seconds = pf_default_rule.timeout[pt->timeout];
1797 case DIOCGETLIMIT: {
1798 struct pfioc_limit *pl = (struct pfioc_limit *)addr;
1800 if (pl->index < 0 || pl->index >= PF_LIMIT_MAX) {
1804 pl->limit = pf_pool_limits[pl->index].limit;
1808 case DIOCSETLIMIT: {
1809 struct pfioc_limit *pl = (struct pfioc_limit *)addr;
1812 if (pl->index < 0 || pl->index >= PF_LIMIT_MAX ||
1813 pf_pool_limits[pl->index].pp == NULL) {
1818 /* XXX Get an API to set limits on the zone/pool */
1819 old_limit = pf_pool_limits[pl->index].limit;
1820 pf_pool_limits[pl->index].limit = pl->limit;
1821 pl->limit = old_limit;
1825 case DIOCSETDEBUG: {
1826 u_int32_t *level = (u_int32_t *)addr;
1828 pf_status.debug = *level;
1832 case DIOCCLRRULECTRS: {
1833 /* obsoleted by DIOCGETRULE with action=PF_GET_CLR_CNTR */
1834 struct pf_ruleset *ruleset = &pf_main_ruleset;
1835 struct pf_rule *rule;
1838 ruleset->rules[PF_RULESET_FILTER].active.ptr, entries) {
1839 rule->evaluations = 0;
1840 rule->packets[0] = rule->packets[1] = 0;
1841 rule->bytes[0] = rule->bytes[1] = 0;
1846 case DIOCGIFSPEED: {
1847 struct pf_ifspeed *psp = (struct pf_ifspeed *)addr;
1848 struct pf_ifspeed ps;
1851 if (psp->ifname[0] != 0) {
1852 /* Can we completely trust user-land? */
1853 strlcpy(ps.ifname, psp->ifname, IFNAMSIZ);
1854 ifp = ifunit(ps.ifname);
1856 psp->baudrate = ifp->if_baudrate;
1864 case DIOCSTARTALTQ: {
1865 struct pf_altq *altq;
1867 /* enable all altq interfaces on active list */
1868 TAILQ_FOREACH(altq, pf_altqs_active, entries) {
1869 if (altq->qname[0] == 0) {
1870 error = pf_enable_altq(altq);
1876 pf_altq_running = 1;
1877 DPFPRINTF(PF_DEBUG_MISC, ("altq: started\n"));
1881 case DIOCSTOPALTQ: {
1882 struct pf_altq *altq;
1884 /* disable all altq interfaces on active list */
1885 TAILQ_FOREACH(altq, pf_altqs_active, entries) {
1886 if (altq->qname[0] == 0) {
1887 error = pf_disable_altq(altq);
1893 pf_altq_running = 0;
1894 DPFPRINTF(PF_DEBUG_MISC, ("altq: stopped\n"));
1899 struct pfioc_altq *pa = (struct pfioc_altq *)addr;
1900 struct pf_altq *altq, *a;
1902 if (pa->ticket != ticket_altqs_inactive) {
1906 altq = kmalloc(sizeof(struct pf_altq), M_PFALTQPL, M_WAITOK|M_NULLOK);
1911 bcopy(&pa->altq, altq, sizeof(struct pf_altq));
1914 * if this is for a queue, find the discipline and
1915 * copy the necessary fields
1917 if (altq->qname[0] != 0) {
1918 if ((altq->qid = pf_qname2qid(altq->qname)) == 0) {
1920 kfree(altq, M_PFALTQPL);
1923 altq->altq_disc = NULL;
1924 TAILQ_FOREACH(a, pf_altqs_inactive, entries) {
1925 if (strncmp(a->ifname, altq->ifname,
1926 IFNAMSIZ) == 0 && a->qname[0] == 0) {
1927 altq->altq_disc = a->altq_disc;
1933 error = altq_add(altq);
1935 kfree(altq, M_PFALTQPL);
1939 TAILQ_INSERT_TAIL(pf_altqs_inactive, altq, entries);
1940 bcopy(altq, &pa->altq, sizeof(struct pf_altq));
1944 case DIOCGETALTQS: {
1945 struct pfioc_altq *pa = (struct pfioc_altq *)addr;
1946 struct pf_altq *altq;
1949 TAILQ_FOREACH(altq, pf_altqs_active, entries)
1951 pa->ticket = ticket_altqs_active;
1956 struct pfioc_altq *pa = (struct pfioc_altq *)addr;
1957 struct pf_altq *altq;
1960 if (pa->ticket != ticket_altqs_active) {
1965 altq = TAILQ_FIRST(pf_altqs_active);
1966 while ((altq != NULL) && (nr < pa->nr)) {
1967 altq = TAILQ_NEXT(altq, entries);
1974 bcopy(altq, &pa->altq, sizeof(struct pf_altq));
1978 case DIOCCHANGEALTQ:
1979 /* CHANGEALTQ not supported yet! */
1983 case DIOCGETQSTATS: {
1984 struct pfioc_qstats *pq = (struct pfioc_qstats *)addr;
1985 struct pf_altq *altq;
1989 if (pq->ticket != ticket_altqs_active) {
1993 nbytes = pq->nbytes;
1995 altq = TAILQ_FIRST(pf_altqs_active);
1996 while ((altq != NULL) && (nr < pq->nr)) {
1997 altq = TAILQ_NEXT(altq, entries);
2004 error = altq_getqstats(altq, pq->buf, &nbytes);
2006 pq->scheduler = altq->scheduler;
2007 pq->nbytes = nbytes;
2013 case DIOCBEGINADDRS: {
2014 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr;
2016 pf_empty_pool(&pf_pabuf);
2017 pp->ticket = ++ticket_pabuf;
2022 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr;
2024 if (pp->ticket != ticket_pabuf) {
2029 if (pp->af == AF_INET) {
2030 error = EAFNOSUPPORT;
2035 if (pp->af == AF_INET6) {
2036 error = EAFNOSUPPORT;
2040 if (pp->addr.addr.type != PF_ADDR_ADDRMASK &&
2041 pp->addr.addr.type != PF_ADDR_DYNIFTL &&
2042 pp->addr.addr.type != PF_ADDR_TABLE) {
2046 pa = kmalloc(sizeof(struct pf_altq), M_PFPOOLADDRPL, M_WAITOK|M_NULLOK);
2051 bcopy(&pp->addr, pa, sizeof(struct pf_pooladdr));
2052 if (pa->ifname[0]) {
2053 pa->kif = pfi_kif_get(pa->ifname);
2054 if (pa->kif == NULL) {
2055 kfree(ap, M_PFPOOLADDRPL);
2059 pfi_kif_ref(pa->kif, PFI_KIF_REF_RULE);
2061 if (pfi_dynaddr_setup(&pa->addr, pp->af)) {
2062 pfi_dynaddr_remove(&pa->addr);
2063 pfi_kif_unref(pa->kif, PFI_KIF_REF_RULE);
2064 kfree(pa, M_PFPOOLADDRPL);
2068 TAILQ_INSERT_TAIL(&pf_pabuf, pa, entries);
2072 case DIOCGETADDRS: {
2073 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr;
2076 pool = pf_get_pool(pp->anchor, pp->ticket, pp->r_action,
2077 pp->r_num, 0, 1, 0);
2082 TAILQ_FOREACH(pa, &pool->list, entries)
2088 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr;
2091 pool = pf_get_pool(pp->anchor, pp->ticket, pp->r_action,
2092 pp->r_num, 0, 1, 1);
2097 pa = TAILQ_FIRST(&pool->list);
2098 while ((pa != NULL) && (nr < pp->nr)) {
2099 pa = TAILQ_NEXT(pa, entries);
2106 bcopy(pa, &pp->addr, sizeof(struct pf_pooladdr));
2107 pf_addr_copyout(&pp->addr.addr);
2111 case DIOCCHANGEADDR: {
2112 struct pfioc_pooladdr *pca = (struct pfioc_pooladdr *)addr;
2113 struct pf_pooladdr *oldpa = NULL, *newpa = NULL;
2114 struct pf_ruleset *ruleset;
2116 if (pca->action < PF_CHANGE_ADD_HEAD ||
2117 pca->action > PF_CHANGE_REMOVE) {
2121 if (pca->addr.addr.type != PF_ADDR_ADDRMASK &&
2122 pca->addr.addr.type != PF_ADDR_DYNIFTL &&
2123 pca->addr.addr.type != PF_ADDR_TABLE) {
2128 ruleset = pf_find_ruleset(pca->anchor);
2129 if (ruleset == NULL) {
2133 pool = pf_get_pool(pca->anchor, pca->ticket, pca->r_action,
2134 pca->r_num, pca->r_last, 1, 1);
2139 if (pca->action != PF_CHANGE_REMOVE) {
2140 newpa = kmalloc(sizeof(struct pf_pooladdr),
2141 M_PFPOOLADDRPL, M_WAITOK|M_NULLOK);
2142 if (newpa == NULL) {
2146 bcopy(&pca->addr, newpa, sizeof(struct pf_pooladdr));
2148 if (pca->af == AF_INET) {
2149 kfree(newpa, M_PFPOOLADDRPL);
2150 error = EAFNOSUPPORT;
2155 if (pca->af == AF_INET6) {
2156 kfree(newpa, M_PFPOOLADDRPL);
2157 error = EAFNOSUPPORT;
2161 if (newpa->ifname[0]) {
2162 newpa->kif = pfi_kif_get(newpa->ifname);
2163 if (newpa->kif == NULL) {
2164 kfree(newpa, M_PFPOOLADDRPL);
2168 pfi_kif_ref(newpa->kif, PFI_KIF_REF_RULE);
2171 if (pfi_dynaddr_setup(&newpa->addr, pca->af) ||
2172 pf_tbladdr_setup(ruleset, &newpa->addr)) {
2173 pfi_dynaddr_remove(&newpa->addr);
2174 pfi_kif_unref(newpa->kif, PFI_KIF_REF_RULE);
2175 kfree(newpa, M_PFPOOLADDRPL);
2181 if (pca->action == PF_CHANGE_ADD_HEAD)
2182 oldpa = TAILQ_FIRST(&pool->list);
2183 else if (pca->action == PF_CHANGE_ADD_TAIL)
2184 oldpa = TAILQ_LAST(&pool->list, pf_palist);
2188 oldpa = TAILQ_FIRST(&pool->list);
2189 while ((oldpa != NULL) && (i < pca->nr)) {
2190 oldpa = TAILQ_NEXT(oldpa, entries);
2193 if (oldpa == NULL) {
2199 if (pca->action == PF_CHANGE_REMOVE) {
2200 TAILQ_REMOVE(&pool->list, oldpa, entries);
2201 pfi_dynaddr_remove(&oldpa->addr);
2202 pf_tbladdr_remove(&oldpa->addr);
2203 pfi_kif_unref(oldpa->kif, PFI_KIF_REF_RULE);
2204 kfree(oldpa, M_PFPOOLADDRPL);
2207 TAILQ_INSERT_TAIL(&pool->list, newpa, entries);
2208 else if (pca->action == PF_CHANGE_ADD_HEAD ||
2209 pca->action == PF_CHANGE_ADD_BEFORE)
2210 TAILQ_INSERT_BEFORE(oldpa, newpa, entries);
2212 TAILQ_INSERT_AFTER(&pool->list, oldpa,
2216 pool->cur = TAILQ_FIRST(&pool->list);
2217 PF_ACPY(&pool->counter, &pool->cur->addr.v.a.addr,
2222 case DIOCGETRULESETS: {
2223 struct pfioc_ruleset *pr = (struct pfioc_ruleset *)addr;
2224 struct pf_ruleset *ruleset;
2225 struct pf_anchor *anchor;
2227 pr->path[sizeof(pr->path) - 1] = 0;
2228 if ((ruleset = pf_find_ruleset(pr->path)) == NULL) {
2233 if (ruleset->anchor == NULL) {
2234 /* XXX kludge for pf_main_ruleset */
2235 RB_FOREACH(anchor, pf_anchor_global, &pf_anchors)
2236 if (anchor->parent == NULL)
2239 RB_FOREACH(anchor, pf_anchor_node,
2240 &ruleset->anchor->children)
2246 case DIOCGETRULESET: {
2247 struct pfioc_ruleset *pr = (struct pfioc_ruleset *)addr;
2248 struct pf_ruleset *ruleset;
2249 struct pf_anchor *anchor;
2252 pr->path[sizeof(pr->path) - 1] = 0;
2253 if ((ruleset = pf_find_ruleset(pr->path)) == NULL) {
2258 if (ruleset->anchor == NULL) {
2259 /* XXX kludge for pf_main_ruleset */
2260 RB_FOREACH(anchor, pf_anchor_global, &pf_anchors)
2261 if (anchor->parent == NULL && nr++ == pr->nr) {
2262 strlcpy(pr->name, anchor->name,
2267 RB_FOREACH(anchor, pf_anchor_node,
2268 &ruleset->anchor->children)
2269 if (nr++ == pr->nr) {
2270 strlcpy(pr->name, anchor->name,
2280 case DIOCRCLRTABLES: {
2281 struct pfioc_table *io = (struct pfioc_table *)addr;
2283 if (io->pfrio_esize != 0) {
2287 error = pfr_clr_tables(&io->pfrio_table, &io->pfrio_ndel,
2288 io->pfrio_flags | PFR_FLAG_USERIOCTL);
2292 case DIOCRADDTABLES: {
2293 struct pfioc_table *io = (struct pfioc_table *)addr;
2295 if (io->pfrio_esize != sizeof(struct pfr_table)) {
2299 error = pfr_add_tables(io->pfrio_buffer, io->pfrio_size,
2300 &io->pfrio_nadd, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2304 case DIOCRDELTABLES: {
2305 struct pfioc_table *io = (struct pfioc_table *)addr;
2307 if (io->pfrio_esize != sizeof(struct pfr_table)) {
2311 error = pfr_del_tables(io->pfrio_buffer, io->pfrio_size,
2312 &io->pfrio_ndel, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2316 case DIOCRGETTABLES: {
2317 struct pfioc_table *io = (struct pfioc_table *)addr;
2319 if (io->pfrio_esize != sizeof(struct pfr_table)) {
2323 error = pfr_get_tables(&io->pfrio_table, io->pfrio_buffer,
2324 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2328 case DIOCRGETTSTATS: {
2329 struct pfioc_table *io = (struct pfioc_table *)addr;
2331 if (io->pfrio_esize != sizeof(struct pfr_tstats)) {
2335 error = pfr_get_tstats(&io->pfrio_table, io->pfrio_buffer,
2336 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2340 case DIOCRCLRTSTATS: {
2341 struct pfioc_table *io = (struct pfioc_table *)addr;
2343 if (io->pfrio_esize != sizeof(struct pfr_table)) {
2347 error = pfr_clr_tstats(io->pfrio_buffer, io->pfrio_size,
2348 &io->pfrio_nzero, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2352 case DIOCRSETTFLAGS: {
2353 struct pfioc_table *io = (struct pfioc_table *)addr;
2355 if (io->pfrio_esize != sizeof(struct pfr_table)) {
2359 error = pfr_set_tflags(io->pfrio_buffer, io->pfrio_size,
2360 io->pfrio_setflag, io->pfrio_clrflag, &io->pfrio_nchange,
2361 &io->pfrio_ndel, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2365 case DIOCRCLRADDRS: {
2366 struct pfioc_table *io = (struct pfioc_table *)addr;
2368 if (io->pfrio_esize != 0) {
2372 error = pfr_clr_addrs(&io->pfrio_table, &io->pfrio_ndel,
2373 io->pfrio_flags | PFR_FLAG_USERIOCTL);
2377 case DIOCRADDADDRS: {
2378 struct pfioc_table *io = (struct pfioc_table *)addr;
2380 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
2384 error = pfr_add_addrs(&io->pfrio_table, io->pfrio_buffer,
2385 io->pfrio_size, &io->pfrio_nadd, io->pfrio_flags |
2386 PFR_FLAG_USERIOCTL);
2390 case DIOCRDELADDRS: {
2391 struct pfioc_table *io = (struct pfioc_table *)addr;
2393 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
2397 error = pfr_del_addrs(&io->pfrio_table, io->pfrio_buffer,
2398 io->pfrio_size, &io->pfrio_ndel, io->pfrio_flags |
2399 PFR_FLAG_USERIOCTL);
2403 case DIOCRSETADDRS: {
2404 struct pfioc_table *io = (struct pfioc_table *)addr;
2406 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
2410 error = pfr_set_addrs(&io->pfrio_table, io->pfrio_buffer,
2411 io->pfrio_size, &io->pfrio_size2, &io->pfrio_nadd,
2412 &io->pfrio_ndel, &io->pfrio_nchange, io->pfrio_flags |
2413 PFR_FLAG_USERIOCTL, 0);
2417 case DIOCRGETADDRS: {
2418 struct pfioc_table *io = (struct pfioc_table *)addr;
2420 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
2424 error = pfr_get_addrs(&io->pfrio_table, io->pfrio_buffer,
2425 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2429 case DIOCRGETASTATS: {
2430 struct pfioc_table *io = (struct pfioc_table *)addr;
2432 if (io->pfrio_esize != sizeof(struct pfr_astats)) {
2436 error = pfr_get_astats(&io->pfrio_table, io->pfrio_buffer,
2437 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2441 case DIOCRCLRASTATS: {
2442 struct pfioc_table *io = (struct pfioc_table *)addr;
2444 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
2448 error = pfr_clr_astats(&io->pfrio_table, io->pfrio_buffer,
2449 io->pfrio_size, &io->pfrio_nzero, io->pfrio_flags |
2450 PFR_FLAG_USERIOCTL);
2454 case DIOCRTSTADDRS: {
2455 struct pfioc_table *io = (struct pfioc_table *)addr;
2457 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
2461 error = pfr_tst_addrs(&io->pfrio_table, io->pfrio_buffer,
2462 io->pfrio_size, &io->pfrio_nmatch, io->pfrio_flags |
2463 PFR_FLAG_USERIOCTL);
2467 case DIOCRINADEFINE: {
2468 struct pfioc_table *io = (struct pfioc_table *)addr;
2470 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
2474 error = pfr_ina_define(&io->pfrio_table, io->pfrio_buffer,
2475 io->pfrio_size, &io->pfrio_nadd, &io->pfrio_naddr,
2476 io->pfrio_ticket, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2481 struct pf_osfp_ioctl *io = (struct pf_osfp_ioctl *)addr;
2482 error = pf_osfp_add(io);
2487 struct pf_osfp_ioctl *io = (struct pf_osfp_ioctl *)addr;
2488 error = pf_osfp_get(io);
2493 struct pfioc_trans *io = (struct pfioc_trans *)addr;
2494 struct pfioc_trans_e *ioe;
2495 struct pfr_table *table;
2498 if (io->esize != sizeof(*ioe)) {
2502 ioe = kmalloc(sizeof(*ioe), M_TEMP, M_WAITOK);
2503 table = kmalloc(sizeof(*table), M_TEMP, M_WAITOK);
2504 for (i = 0; i < io->size; i++) {
2505 if (copyin(io->array+i, ioe, sizeof(*ioe))) {
2506 kfree(table, M_TEMP);
2511 switch (ioe->rs_num) {
2513 case PF_RULESET_ALTQ:
2514 if (ioe->anchor[0]) {
2515 kfree(table, M_TEMP);
2520 if ((error = pf_begin_altq(&ioe->ticket))) {
2521 kfree(table, M_TEMP);
2527 case PF_RULESET_TABLE:
2528 bzero(table, sizeof(*table));
2529 strlcpy(table->pfrt_anchor, ioe->anchor,
2530 sizeof(table->pfrt_anchor));
2531 if ((error = pfr_ina_begin(table,
2532 &ioe->ticket, NULL, 0))) {
2533 kfree(table, M_TEMP);
2539 if ((error = pf_begin_rules(&ioe->ticket,
2540 ioe->rs_num, ioe->anchor))) {
2541 kfree(table, M_TEMP);
2547 if (copyout(ioe, io->array+i, sizeof(io->array[i]))) {
2548 kfree(table, M_TEMP);
2554 kfree(table, M_TEMP);
2559 case DIOCXROLLBACK: {
2560 struct pfioc_trans *io = (struct pfioc_trans *)addr;
2561 struct pfioc_trans_e *ioe;
2562 struct pfr_table *table;
2565 if (io->esize != sizeof(*ioe)) {
2569 ioe = kmalloc(sizeof(*ioe), M_TEMP, M_WAITOK);
2570 table = kmalloc(sizeof(*table), M_TEMP, M_WAITOK);
2571 for (i = 0; i < io->size; i++) {
2572 if (copyin(io->array+i, ioe, sizeof(*ioe))) {
2573 kfree(table, M_TEMP);
2578 switch (ioe->rs_num) {
2580 case PF_RULESET_ALTQ:
2581 if (ioe->anchor[0]) {
2582 kfree(table, M_TEMP);
2587 if ((error = pf_rollback_altq(ioe->ticket))) {
2588 kfree(table, M_TEMP);
2590 goto fail; /* really bad */
2594 case PF_RULESET_TABLE:
2595 bzero(table, sizeof(*table));
2596 strlcpy(table->pfrt_anchor, ioe->anchor,
2597 sizeof(table->pfrt_anchor));
2598 if ((error = pfr_ina_rollback(table,
2599 ioe->ticket, NULL, 0))) {
2600 kfree(table, M_TEMP);
2602 goto fail; /* really bad */
2606 if ((error = pf_rollback_rules(ioe->ticket,
2607 ioe->rs_num, ioe->anchor))) {
2608 kfree(table, M_TEMP);
2610 goto fail; /* really bad */
2615 kfree(table, M_TEMP);
2621 struct pfioc_trans *io = (struct pfioc_trans *)addr;
2622 struct pfioc_trans_e *ioe;
2623 struct pfr_table *table;
2624 struct pf_ruleset *rs;
2627 if (io->esize != sizeof(*ioe)) {
2631 ioe = kmalloc(sizeof(*ioe), M_TEMP, M_WAITOK);
2632 table = kmalloc(sizeof(*table), M_TEMP, M_WAITOK);
2633 /* first makes sure everything will succeed */
2634 for (i = 0; i < io->size; i++) {
2635 if (copyin(io->array+i, ioe, sizeof(*ioe))) {
2636 kfree(table, M_TEMP);
2641 switch (ioe->rs_num) {
2643 case PF_RULESET_ALTQ:
2644 if (ioe->anchor[0]) {
2645 kfree(table, M_TEMP);
2650 if (!altqs_inactive_open || ioe->ticket !=
2651 ticket_altqs_inactive) {
2652 kfree(table, M_TEMP);
2659 case PF_RULESET_TABLE:
2660 rs = pf_find_ruleset(ioe->anchor);
2661 if (rs == NULL || !rs->topen || ioe->ticket !=
2663 kfree(table, M_TEMP);
2670 if (ioe->rs_num < 0 || ioe->rs_num >=
2672 kfree(table, M_TEMP);
2677 rs = pf_find_ruleset(ioe->anchor);
2679 !rs->rules[ioe->rs_num].inactive.open ||
2680 rs->rules[ioe->rs_num].inactive.ticket !=
2682 kfree(table, M_TEMP);
2690 /* now do the commit - no errors should happen here */
2691 for (i = 0; i < io->size; i++) {
2692 if (copyin(io->array+i, ioe, sizeof(*ioe))) {
2693 kfree(table, M_TEMP);
2698 switch (ioe->rs_num) {
2700 case PF_RULESET_ALTQ:
2701 if ((error = pf_commit_altq(ioe->ticket))) {
2702 kfree(table, M_TEMP);
2704 goto fail; /* really bad */
2708 case PF_RULESET_TABLE:
2709 bzero(table, sizeof(*table));
2710 strlcpy(table->pfrt_anchor, ioe->anchor,
2711 sizeof(table->pfrt_anchor));
2712 if ((error = pfr_ina_commit(table, ioe->ticket,
2714 kfree(table, M_TEMP);
2716 goto fail; /* really bad */
2720 if ((error = pf_commit_rules(ioe->ticket,
2721 ioe->rs_num, ioe->anchor))) {
2722 kfree(table, M_TEMP);
2724 goto fail; /* really bad */
2729 kfree(table, M_TEMP);
2734 case DIOCGETSRCNODES: {
2735 struct pfioc_src_nodes *psn = (struct pfioc_src_nodes *)addr;
2736 struct pf_src_node *n, *p, *pstore;
2738 int space = psn->psn_len;
2741 RB_FOREACH(n, pf_src_tree, &tree_src_tracking)
2743 psn->psn_len = sizeof(struct pf_src_node) * nr;
2747 pstore = kmalloc(sizeof(*pstore), M_TEMP, M_WAITOK);
2749 p = psn->psn_src_nodes;
2750 RB_FOREACH(n, pf_src_tree, &tree_src_tracking) {
2751 int secs = time_second, diff;
2753 if ((nr + 1) * sizeof(*p) > (unsigned)psn->psn_len)
2756 bcopy(n, pstore, sizeof(*pstore));
2757 if (n->rule.ptr != NULL)
2758 pstore->rule.nr = n->rule.ptr->nr;
2759 pstore->creation = secs - pstore->creation;
2760 if (pstore->expire > secs)
2761 pstore->expire -= secs;
2765 /* adjust the connection rate estimate */
2766 diff = secs - n->conn_rate.last;
2767 if (diff >= n->conn_rate.seconds)
2768 pstore->conn_rate.count = 0;
2770 pstore->conn_rate.count -=
2771 n->conn_rate.count * diff /
2772 n->conn_rate.seconds;
2774 error = copyout(pstore, p, sizeof(*p));
2776 kfree(pstore, M_TEMP);
2782 psn->psn_len = sizeof(struct pf_src_node) * nr;
2784 kfree(pstore, M_TEMP);
2788 case DIOCCLRSRCNODES: {
2789 struct pf_src_node *n;
2790 struct pf_state *state;
2792 RB_FOREACH(state, pf_state_tree_id, &tree_id) {
2793 state->src_node = NULL;
2794 state->nat_src_node = NULL;
2796 RB_FOREACH(n, pf_src_tree, &tree_src_tracking) {
2800 pf_purge_expired_src_nodes(1);
2801 pf_status.src_nodes = 0;
2805 case DIOCKILLSRCNODES: {
2806 struct pf_src_node *sn;
2808 struct pfioc_src_node_kill *psnk =
2809 (struct pfioc_src_node_kill *)addr;
2812 RB_FOREACH(sn, pf_src_tree, &tree_src_tracking) {
2813 if (PF_MATCHA(psnk->psnk_src.neg,
2814 &psnk->psnk_src.addr.v.a.addr,
2815 &psnk->psnk_src.addr.v.a.mask,
2816 &sn->addr, sn->af) &&
2817 PF_MATCHA(psnk->psnk_dst.neg,
2818 &psnk->psnk_dst.addr.v.a.addr,
2819 &psnk->psnk_dst.addr.v.a.mask,
2820 &sn->raddr, sn->af)) {
2821 /* Handle state to src_node linkage */
2822 if (sn->states != 0) {
2823 RB_FOREACH(s, pf_state_tree_id,
2825 if (s->src_node == sn)
2827 if (s->nat_src_node == sn)
2828 s->nat_src_node = NULL;
2838 pf_purge_expired_src_nodes(1);
2840 psnk->psnk_killed = killed;
2844 case DIOCSETHOSTID: {
2845 u_int32_t *hostid = (u_int32_t *)addr;
2848 pf_status.hostid = karc4random();
2850 pf_status.hostid = *hostid;
2860 case DIOCIGETIFACES: {
2861 struct pfioc_iface *io = (struct pfioc_iface *)addr;
2863 if (io->pfiio_esize != sizeof(struct pfi_kif)) {
2867 error = pfi_get_ifaces(io->pfiio_name, io->pfiio_buffer,
2872 case DIOCSETIFFLAG: {
2873 struct pfioc_iface *io = (struct pfioc_iface *)addr;
2875 error = pfi_set_flags(io->pfiio_name, io->pfiio_flags);
2879 case DIOCCLRIFFLAG: {
2880 struct pfioc_iface *io = (struct pfioc_iface *)addr;
2882 error = pfi_clear_flags(io->pfiio_name, io->pfiio_flags);
2891 lwkt_reltoken(&pf_token);
2896 * XXX - Check for version missmatch!!!
2899 pf_clear_states(void)
2901 struct pf_state *s, *nexts;
2904 for (s = RB_MIN(pf_state_tree_id, &tree_id); s; s = nexts) {
2905 nexts = RB_NEXT(pf_state_tree_id, &tree_id, s);
2907 /* don't send out individual delete messages */
2908 s->sync_flags = PFSTATE_NOSYNC;
2916 * XXX This is called on module unload, we do not want to sync that over? */
2918 pfsync_clear_states(pf_status.hostid, psk->psk_ifname);
2923 pf_clear_tables(void)
2925 struct pfioc_table io;
2928 bzero(&io, sizeof(io));
2930 error = pfr_clr_tables(&io.pfrio_table, &io.pfrio_ndel,
2937 pf_clear_srcnodes(void)
2939 struct pf_src_node *n;
2940 struct pf_state *state;
2942 RB_FOREACH(state, pf_state_tree_id, &tree_id) {
2943 state->src_node = NULL;
2944 state->nat_src_node = NULL;
2946 RB_FOREACH(n, pf_src_tree, &tree_src_tracking) {
2950 pf_purge_expired_src_nodes(0);
2951 pf_status.src_nodes = 0;
2955 * XXX - Check for version missmatch!!!
2959 * Duplicate pfctl -Fa operation to get rid of as much as we can.
2969 pf_status.running = 0;
2970 error = dehook_pf();
2972 pf_status.running = 1;
2973 DPFPRINTF(PF_DEBUG_MISC,
2974 ("pf: pfil unregistration failed\n"));
2978 if ((error = pf_begin_rules(&t[0], PF_RULESET_SCRUB, &nn)) != 0) {
2979 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: SCRUB\n"));
2982 if ((error = pf_begin_rules(&t[1], PF_RULESET_FILTER, &nn)) != 0) {
2983 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: FILTER\n"));
2984 break; /* XXX: rollback? */
2986 if ((error = pf_begin_rules(&t[2], PF_RULESET_NAT, &nn)) != 0) {
2987 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: NAT\n"));
2988 break; /* XXX: rollback? */
2990 if ((error = pf_begin_rules(&t[3], PF_RULESET_BINAT, &nn))
2992 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: BINAT\n"));
2993 break; /* XXX: rollback? */
2995 if ((error = pf_begin_rules(&t[4], PF_RULESET_RDR, &nn))
2997 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: RDR\n"));
2998 break; /* XXX: rollback? */
3001 /* XXX: these should always succeed here */
3002 pf_commit_rules(t[0], PF_RULESET_SCRUB, &nn);
3003 pf_commit_rules(t[1], PF_RULESET_FILTER, &nn);
3004 pf_commit_rules(t[2], PF_RULESET_NAT, &nn);
3005 pf_commit_rules(t[3], PF_RULESET_BINAT, &nn);
3006 pf_commit_rules(t[4], PF_RULESET_RDR, &nn);
3008 if ((error = pf_clear_tables()) != 0)
3011 if ((error = pf_begin_altq(&t[0])) != 0) {
3012 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: ALTQ\n"));
3015 pf_commit_altq(t[0]);
3018 pf_clear_srcnodes();
3020 /* status does not use malloced mem so no need to cleanup */
3021 /* fingerprints and interfaces have their own cleanup code */
3027 pf_check_in(void *arg, struct mbuf **m, struct ifnet *ifp, int dir)
3030 * DragonFly's version of pf uses FreeBSD's native host byte ordering
3031 * for ip_len/ip_off. This is why we don't have to change byte order
3032 * like the FreeBSD-5 version does.
3036 lwkt_gettoken(&pf_token);
3038 chk = pf_test(PF_IN, ifp, m, NULL, NULL);
3043 lwkt_reltoken(&pf_token);
3048 pf_check_out(void *arg, struct mbuf **m, struct ifnet *ifp, int dir)
3051 * DragonFly's version of pf uses FreeBSD's native host byte ordering
3052 * for ip_len/ip_off. This is why we don't have to change byte order
3053 * like the FreeBSD-5 version does.
3057 lwkt_gettoken(&pf_token);
3059 /* We need a proper CSUM befor we start (s. OpenBSD ip_output) */
3060 if ((*m)->m_pkthdr.csum_flags & CSUM_DELAY_DATA) {
3061 in_delayed_cksum(*m);
3062 (*m)->m_pkthdr.csum_flags &= ~CSUM_DELAY_DATA;
3064 chk = pf_test(PF_OUT, ifp, m, NULL, NULL);
3069 lwkt_reltoken(&pf_token);
3075 pf_check6_in(void *arg, struct mbuf **m, struct ifnet *ifp, int dir)
3078 * IPv6 is not affected by ip_len/ip_off byte order changes.
3082 lwkt_gettoken(&pf_token);
3084 chk = pf_test6(PF_IN, ifp, m, NULL, NULL);
3089 lwkt_reltoken(&pf_token);
3094 pf_check6_out(void *arg, struct mbuf **m, struct ifnet *ifp, int dir)
3097 * IPv6 is not affected by ip_len/ip_off byte order changes.
3101 lwkt_gettoken(&pf_token);
3103 /* We need a proper CSUM befor we start (s. OpenBSD ip_output) */
3104 if ((*m)->m_pkthdr.csum_flags & CSUM_DELAY_DATA) {
3105 in_delayed_cksum(*m);
3106 (*m)->m_pkthdr.csum_flags &= ~CSUM_DELAY_DATA;
3108 chk = pf_test6(PF_OUT, ifp, m, NULL, NULL);
3113 lwkt_reltoken(&pf_token);
3121 struct pfil_head *pfh_inet;
3123 struct pfil_head *pfh_inet6;
3126 lwkt_gettoken(&pf_token);
3128 if (pf_pfil_hooked) {
3129 lwkt_reltoken(&pf_token);
3133 pfh_inet = pfil_head_get(PFIL_TYPE_AF, AF_INET);
3134 if (pfh_inet == NULL) {
3135 lwkt_reltoken(&pf_token);
3138 pfil_add_hook(pf_check_in, NULL, PFIL_IN | PFIL_MPSAFE, pfh_inet);
3139 pfil_add_hook(pf_check_out, NULL, PFIL_OUT | PFIL_MPSAFE, pfh_inet);
3141 pfh_inet6 = pfil_head_get(PFIL_TYPE_AF, AF_INET6);
3142 if (pfh_inet6 == NULL) {
3143 pfil_remove_hook(pf_check_in, NULL, PFIL_IN, pfh_inet);
3144 pfil_remove_hook(pf_check_out, NULL, PFIL_OUT, pfh_inet);
3145 lwkt_reltoken(&pf_token);
3148 pfil_add_hook(pf_check6_in, NULL, PFIL_IN | PFIL_MPSAFE, pfh_inet6);
3149 pfil_add_hook(pf_check6_out, NULL, PFIL_OUT | PFIL_MPSAFE, pfh_inet6);
3153 lwkt_reltoken(&pf_token);
3160 struct pfil_head *pfh_inet;
3162 struct pfil_head *pfh_inet6;
3165 lwkt_gettoken(&pf_token);
3167 if (pf_pfil_hooked == 0) {
3168 lwkt_reltoken(&pf_token);
3172 pfh_inet = pfil_head_get(PFIL_TYPE_AF, AF_INET);
3173 if (pfh_inet == NULL) {
3174 lwkt_reltoken(&pf_token);
3177 pfil_remove_hook(pf_check_in, NULL, PFIL_IN, pfh_inet);
3178 pfil_remove_hook(pf_check_out, NULL, PFIL_OUT, pfh_inet);
3180 pfh_inet6 = pfil_head_get(PFIL_TYPE_AF, AF_INET6);
3181 if (pfh_inet6 == NULL) {
3182 lwkt_reltoken(&pf_token);
3185 pfil_remove_hook(pf_check6_in, NULL, PFIL_IN, pfh_inet6);
3186 pfil_remove_hook(pf_check6_out, NULL, PFIL_OUT, pfh_inet6);
3190 lwkt_reltoken(&pf_token);
3197 lwkt_gettoken(&pf_token);
3199 pf_dev = make_dev(&pf_ops, 0, 0, 0, 0600, PF_NAME);
3201 lockinit(&pf_consistency_lock, "pfconslck", 0, LK_CANRECURSE);
3202 lwkt_reltoken(&pf_token);
3207 pf_mask_del(struct radix_node *rn, void *arg)
3209 struct radix_node_head *rnh = arg;
3211 rnh->rnh_deladdr(rn->rn_key, rn->rn_mask, rnh);
3220 pf_status.running = 0;
3222 lwkt_gettoken(&pf_token);
3224 error = dehook_pf();
3227 * Should not happen!
3228 * XXX Due to error code ESRCH, kldunload will show
3229 * a message like 'No such process'.
3231 kprintf("pfil unregistration fail\n");
3232 lwkt_reltoken(&pf_token);
3237 while (pf_end_threads < 2) {
3238 wakeup_one(pf_purge_thread);
3239 tsleep(pf_purge_thread, 0, "pftmo", hz);
3243 dev_ops_remove_all(&pf_ops);
3244 lockuninit(&pf_consistency_lock);
3245 lwkt_reltoken(&pf_token);
3247 if (pf_maskhead != NULL) {
3248 pf_maskhead->rnh_walktree(pf_maskhead,
3249 pf_mask_del, pf_maskhead);
3253 kmalloc_destroy(&pf_state_pl);
3254 kmalloc_destroy(&pf_frent_pl);
3255 kmalloc_destroy(&pf_cent_pl);
3260 pf_modevent(module_t mod, int type, void *data)
3264 lwkt_gettoken(&pf_token);
3272 error = pf_unload();
3278 lwkt_reltoken(&pf_token);
3282 static moduledata_t pf_mod = {
3287 DECLARE_MODULE(pf, pf_mod, SI_SUB_PSEUDO, SI_ORDER_FIRST);
3288 MODULE_VERSION(pf, PF_MODVER);