1 /* $FreeBSD: src/sys/contrib/pf/net/pf_ioctl.c,v 1.12 2004/08/12 14:15:42 mlaier Exp $ */
2 /* $OpenBSD: pf_ioctl.c,v 1.112.2.2 2004/07/24 18:28:12 brad Exp $ */
3 /* $OpenBSD: pf_ioctl.c,v 1.175 2007/02/26 22:47:43 deraadt Exp $ */
6 * Copyright (c) 2010 The DragonFly Project. All rights reserved.
8 * Copyright (c) 2001 Daniel Hartmeier
9 * Copyright (c) 2002,2003 Henning Brauer
10 * All rights reserved.
12 * Redistribution and use in source and binary forms, with or without
13 * modification, are permitted provided that the following conditions
16 * - Redistributions of source code must retain the above copyright
17 * notice, this list of conditions and the following disclaimer.
18 * - Redistributions in binary form must reproduce the above
19 * copyright notice, this list of conditions and the following
20 * disclaimer in the documentation and/or other materials provided
21 * with the distribution.
23 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
24 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
25 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
26 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
27 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
28 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
29 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
30 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
31 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
33 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
34 * POSSIBILITY OF SUCH DAMAGE.
36 * Effort sponsored in part by the Defense Advanced Research Projects
37 * Agency (DARPA) and Air Force Research Laboratory, Air Force
38 * Materiel Command, USAF, under agreement number F30602-01-2-0537.
43 #include "opt_inet6.h"
44 #include "use_pfsync.h"
46 #include <sys/param.h>
47 #include <sys/systm.h>
49 #include <sys/device.h>
51 #include <sys/filio.h>
52 #include <sys/fcntl.h>
53 #include <sys/socket.h>
54 #include <sys/socketvar.h>
55 #include <sys/kernel.h>
56 #include <sys/kthread.h>
57 #include <sys/thread2.h>
60 #include <sys/malloc.h>
61 #include <sys/module.h>
62 #include <vm/vm_zone.h>
66 #include <net/if_types.h>
67 #include <net/route.h>
69 #include <netinet/in.h>
70 #include <netinet/in_var.h>
71 #include <netinet/in_systm.h>
72 #include <netinet/ip.h>
73 #include <netinet/ip_var.h>
74 #include <netinet/ip_icmp.h>
76 #include <net/pf/pfvar.h>
78 #include <net/pf/pfvar.h>
81 #include <net/pf/if_pfsync.h>
82 #endif /* NPFSYNC > 0 */
85 #include <net/if_pflog.h>
86 #endif /* NPFLOG > 0 */
89 #include <netinet/ip6.h>
90 #include <netinet/in_pcb.h>
94 #include <net/altq/altq.h>
97 #include <machine/limits.h>
99 #include <sys/mutex.h>
101 u_int rt_numfibs = RT_NUMFIBS;
103 void init_zone_var(void);
104 void cleanup_pf_zone(void);
106 void pf_thread_create(void *);
107 struct pf_pool *pf_get_pool(char *, u_int32_t, u_int8_t, u_int32_t,
108 u_int8_t, u_int8_t, u_int8_t);
110 void pf_mv_pool(struct pf_palist *, struct pf_palist *);
111 void pf_empty_pool(struct pf_palist *);
113 int pf_begin_altq(u_int32_t *);
114 int pf_rollback_altq(u_int32_t);
115 int pf_commit_altq(u_int32_t);
116 int pf_enable_altq(struct pf_altq *);
117 int pf_disable_altq(struct pf_altq *);
119 int pf_begin_rules(u_int32_t *, int, const char *);
120 int pf_rollback_rules(u_int32_t, int, char *);
121 int pf_setup_pfsync_matching(struct pf_ruleset *);
122 void pf_hash_rule(MD5_CTX *, struct pf_rule *);
123 void pf_hash_rule_addr(MD5_CTX *, struct pf_rule_addr *);
124 int pf_commit_rules(u_int32_t, int, char *);
126 struct pf_rule pf_default_rule;
127 struct lock pf_consistency_lock;
129 static int pf_altq_running;
132 #define TAGID_MAX 50000
133 TAILQ_HEAD(pf_tags, pf_tagname) pf_tags = TAILQ_HEAD_INITIALIZER(pf_tags),
134 pf_qids = TAILQ_HEAD_INITIALIZER(pf_qids);
136 #if (PF_QNAME_SIZE != PF_TAG_NAME_SIZE)
137 #error PF_QNAME_SIZE must be equal to PF_TAG_NAME_SIZE
139 u_int16_t tagname2tag(struct pf_tags *, char *);
140 void tag2tagname(struct pf_tags *, u_int16_t, char *);
141 void tag_unref(struct pf_tags *, u_int16_t);
142 int pf_rtlabel_add(struct pf_addr_wrap *);
143 void pf_rtlabel_remove(struct pf_addr_wrap *);
144 void pf_rtlabel_copyout(struct pf_addr_wrap *);
146 #define DPFPRINTF(n, x) if (pf_status.debug >= (n)) kprintf x
148 static cdev_t pf_dev;
151 * XXX - These are new and need to be checked when moveing to a new version
153 static void pf_clear_states(void);
154 static int pf_clear_tables(void);
155 static void pf_clear_srcnodes(void);
157 * XXX - These are new and need to be checked when moveing to a new version
161 * Wrapper functions for pfil(9) hooks
163 static int pf_check_in(void *arg, struct mbuf **m, struct ifnet *ifp,
165 static int pf_check_out(void *arg, struct mbuf **m, struct ifnet *ifp,
168 static int pf_check6_in(void *arg, struct mbuf **m, struct ifnet *ifp,
170 static int pf_check6_out(void *arg, struct mbuf **m, struct ifnet *ifp,
174 static int hook_pf(void);
175 static int dehook_pf(void);
176 static int shutdown_pf(void);
177 static int pf_load(void);
178 static int pf_unload(void);
184 static struct dev_ops pf_ops = { /* XXX convert to port model */
191 static volatile int pf_pfil_hooked = 0;
192 int pf_end_threads = 0;
193 struct lock pf_task_lck;
195 int debug_pfugidhack = 0;
196 SYSCTL_INT(_debug, OID_AUTO, pfugidhack, CTLFLAG_RW, &debug_pfugidhack, 0,
197 "Enable/disable pf user/group rules mpsafe hack");
203 lockinit(&pf_task_lck, "pf task lck", 0, LK_CANRECURSE);
209 lockuninit(&pf_task_lck);
215 pf_src_tree_pl = pf_rule_pl = NULL;
216 pf_state_pl = pf_altq_pl = pf_pooladdr_pl = NULL;
217 pf_frent_pl = pf_frag_pl = pf_cache_pl = pf_cent_pl = NULL;
218 pf_state_scrub_pl = NULL;
219 pfr_ktable_pl = pfr_kentry_pl = NULL;
223 cleanup_pf_zone(void)
225 ZONE_DESTROY(pf_src_tree_pl);
226 ZONE_DESTROY(pf_rule_pl);
227 ZONE_DESTROY(pf_state_pl);
228 ZONE_DESTROY(pf_altq_pl);
229 ZONE_DESTROY(pf_pooladdr_pl);
230 ZONE_DESTROY(pf_frent_pl);
231 ZONE_DESTROY(pf_frag_pl);
232 ZONE_DESTROY(pf_cache_pl);
233 ZONE_DESTROY(pf_cent_pl);
234 ZONE_DESTROY(pfr_ktable_pl);
235 ZONE_DESTROY(pfr_kentry_pl);
236 ZONE_DESTROY(pf_state_scrub_pl);
237 ZONE_DESTROY(pfi_addr_pl);
243 u_int32_t *my_timeout = pf_default_rule.timeout;
247 ZONE_CREATE(pf_src_tree_pl,struct pf_src_node, "pfsrctrpl");
248 ZONE_CREATE(pf_rule_pl, struct pf_rule, "pfrulepl");
249 ZONE_CREATE(pf_state_pl, struct pf_state, "pfstatepl");
250 ZONE_CREATE(pf_altq_pl, struct pf_altq, "pfaltqpl");
251 ZONE_CREATE(pf_pooladdr_pl,struct pf_pooladdr, "pfpooladdrpl");
252 ZONE_CREATE(pfr_ktable_pl, struct pfr_ktable, "pfrktable");
253 ZONE_CREATE(pfr_kentry_pl, struct pfr_kentry, "pfrkentry");
254 ZONE_CREATE(pf_frent_pl, struct pf_frent, "pffrent");
255 ZONE_CREATE(pf_frag_pl, struct pf_fragment, "pffrag");
256 ZONE_CREATE(pf_cache_pl, struct pf_fragment, "pffrcache");
257 ZONE_CREATE(pf_cent_pl, struct pf_frcache, "pffrcent");
258 ZONE_CREATE(pf_state_scrub_pl, struct pf_state_scrub,
260 ZONE_CREATE(pfi_addr_pl, struct pfi_dynaddr, "pfiaddrpl");
269 error = pf_osfp_initialize();
276 pf_pool_limits[PF_LIMIT_STATES].pp = pf_state_pl;
277 pf_pool_limits[PF_LIMIT_STATES].limit = PFSTATE_HIWAT;
278 pf_pool_limits[PF_LIMIT_FRAGS].pp = pf_frent_pl;
279 pf_pool_limits[PF_LIMIT_FRAGS].limit = PFFRAG_FRENT_HIWAT;
280 /* XXX uma_zone_set_max(pf_pool_limits[PF_LIMIT_STATES].pp,
281 pf_pool_limits[PF_LIMIT_STATES].limit);
283 if (ctob(physmem) <= 100*1024*1024)
284 pf_pool_limits[PF_LIMIT_TABLE_ENTRIES].limit =
285 PFR_KENTRY_HIWAT_SMALL;
286 RB_INIT(&tree_src_tracking);
287 RB_INIT(&pf_anchors);
288 pf_init_ruleset(&pf_main_ruleset);
289 TAILQ_INIT(&pf_altqs[0]);
290 TAILQ_INIT(&pf_altqs[1]);
291 TAILQ_INIT(&pf_pabuf);
292 pf_altqs_active = &pf_altqs[0];
293 pf_altqs_inactive = &pf_altqs[1];
294 TAILQ_INIT(&state_list);
296 /* default rule should never be garbage collected */
297 pf_default_rule.entries.tqe_prev = &pf_default_rule.entries.tqe_next;
298 pf_default_rule.action = PF_PASS;
299 pf_default_rule.nr = (uint32_t)(-1);
300 pf_default_rule.rtableid = -1;
302 /* initialize default timeouts */
303 my_timeout[PFTM_TCP_FIRST_PACKET] = 120; /* First TCP packet */
304 my_timeout[PFTM_TCP_OPENING] = 30; /* No response yet */
305 my_timeout[PFTM_TCP_ESTABLISHED] = 24*60*60; /* Established */
306 my_timeout[PFTM_TCP_CLOSING] = 15 * 60; /* Half closed */
307 my_timeout[PFTM_TCP_FIN_WAIT] = 45; /* Got both FINs */
308 my_timeout[PFTM_TCP_CLOSED] = 90; /* Got a RST */
309 my_timeout[PFTM_UDP_FIRST_PACKET] = 60; /* First UDP packet */
310 my_timeout[PFTM_UDP_SINGLE] = 30; /* Unidirectional */
311 my_timeout[PFTM_UDP_MULTIPLE] = 60; /* Bidirectional */
312 my_timeout[PFTM_ICMP_FIRST_PACKET] = 20; /* First ICMP packet */
313 my_timeout[PFTM_ICMP_ERROR_REPLY] = 10; /* Got error response */
314 my_timeout[PFTM_OTHER_FIRST_PACKET] = 60; /* First packet */
315 my_timeout[PFTM_OTHER_SINGLE] = 30; /* Unidirectional */
316 my_timeout[PFTM_OTHER_MULTIPLE] = 60; /* Bidirectional */
317 my_timeout[PFTM_FRAG] = 30; /* Fragment expire */
318 my_timeout[PFTM_INTERVAL] = 10; /* Expire interval */
319 my_timeout[PFTM_SRC_NODE] = 0; /* Source Tracking */
320 my_timeout[PFTM_TS_DIFF] = 30; /* Allowed TS diff */
321 my_timeout[PFTM_ADAPTIVE_START] = PFSTATE_ADAPT_START;
322 my_timeout[PFTM_ADAPTIVE_END] = PFSTATE_ADAPT_END;
325 bzero(&pf_status, sizeof(pf_status));
326 pf_status.debug = PF_DEBUG_URGENT;
328 /* XXX do our best to avoid a conflict */
329 pf_status.hostid = karc4random();
331 /* require process context to purge states, so perform in a thread */
332 kthread_create(pf_thread_create, NULL, NULL, "dummy");
338 pf_thread_create(void *v)
340 if (kthread_create(pf_purge_thread, NULL, NULL, "pfpurge"))
341 panic("pfpurge thread");
345 pfopen(struct dev_open_args *ap)
347 cdev_t dev = ap->a_head.a_dev;
354 pfclose(struct dev_close_args *ap)
356 cdev_t dev = ap->a_head.a_dev;
363 pf_get_pool(char *anchor, u_int32_t ticket, u_int8_t rule_action,
364 u_int32_t rule_number, u_int8_t r_last, u_int8_t active,
365 u_int8_t check_ticket)
367 struct pf_ruleset *ruleset;
368 struct pf_rule *rule;
371 ruleset = pf_find_ruleset(anchor);
374 rs_num = pf_get_ruleset_number(rule_action);
375 if (rs_num >= PF_RULESET_MAX)
378 if (check_ticket && ticket !=
379 ruleset->rules[rs_num].active.ticket)
382 rule = TAILQ_LAST(ruleset->rules[rs_num].active.ptr,
385 rule = TAILQ_FIRST(ruleset->rules[rs_num].active.ptr);
387 if (check_ticket && ticket !=
388 ruleset->rules[rs_num].inactive.ticket)
391 rule = TAILQ_LAST(ruleset->rules[rs_num].inactive.ptr,
394 rule = TAILQ_FIRST(ruleset->rules[rs_num].inactive.ptr);
397 while ((rule != NULL) && (rule->nr != rule_number))
398 rule = TAILQ_NEXT(rule, entries);
403 return (&rule->rpool);
407 pf_mv_pool(struct pf_palist *poola, struct pf_palist *poolb)
409 struct pf_pooladdr *mv_pool_pa;
411 while ((mv_pool_pa = TAILQ_FIRST(poola)) != NULL) {
412 TAILQ_REMOVE(poola, mv_pool_pa, entries);
413 TAILQ_INSERT_TAIL(poolb, mv_pool_pa, entries);
418 pf_empty_pool(struct pf_palist *poola)
420 struct pf_pooladdr *empty_pool_pa;
422 while ((empty_pool_pa = TAILQ_FIRST(poola)) != NULL) {
423 pfi_dynaddr_remove(&empty_pool_pa->addr);
424 pf_tbladdr_remove(&empty_pool_pa->addr);
425 pfi_kif_unref(empty_pool_pa->kif, PFI_KIF_REF_RULE);
426 TAILQ_REMOVE(poola, empty_pool_pa, entries);
427 pool_put(&pf_pooladdr_pl, empty_pool_pa);
432 pf_rm_rule(struct pf_rulequeue *rulequeue, struct pf_rule *rule)
434 if (rulequeue != NULL) {
435 if (rule->states <= 0) {
437 * XXX - we need to remove the table *before* detaching
438 * the rule to make sure the table code does not delete
439 * the anchor under our feet.
441 pf_tbladdr_remove(&rule->src.addr);
442 pf_tbladdr_remove(&rule->dst.addr);
443 if (rule->overload_tbl)
444 pfr_detach_table(rule->overload_tbl);
446 TAILQ_REMOVE(rulequeue, rule, entries);
447 rule->entries.tqe_prev = NULL;
451 if (rule->states > 0 || rule->src_nodes > 0 ||
452 rule->entries.tqe_prev != NULL)
454 pf_tag_unref(rule->tag);
455 pf_tag_unref(rule->match_tag);
457 if (rule->pqid != rule->qid)
458 pf_qid_unref(rule->pqid);
459 pf_qid_unref(rule->qid);
461 pf_rtlabel_remove(&rule->src.addr);
462 pf_rtlabel_remove(&rule->dst.addr);
463 pfi_dynaddr_remove(&rule->src.addr);
464 pfi_dynaddr_remove(&rule->dst.addr);
465 if (rulequeue == NULL) {
466 pf_tbladdr_remove(&rule->src.addr);
467 pf_tbladdr_remove(&rule->dst.addr);
468 if (rule->overload_tbl)
469 pfr_detach_table(rule->overload_tbl);
471 pfi_kif_unref(rule->kif, PFI_KIF_REF_RULE);
472 pf_anchor_remove(rule);
473 pf_empty_pool(&rule->rpool.list);
474 pool_put(&pf_rule_pl, rule);
478 tagname2tag(struct pf_tags *head, char *tagname)
480 struct pf_tagname *tag, *p = NULL;
481 u_int16_t new_tagid = 1;
483 TAILQ_FOREACH(tag, head, entries)
484 if (strcmp(tagname, tag->name) == 0) {
490 * to avoid fragmentation, we do a linear search from the beginning
491 * and take the first free slot we find. if there is none or the list
492 * is empty, append a new entry at the end.
496 if (!TAILQ_EMPTY(head))
497 for (p = TAILQ_FIRST(head); p != NULL &&
498 p->tag == new_tagid; p = TAILQ_NEXT(p, entries))
499 new_tagid = p->tag + 1;
501 if (new_tagid > TAGID_MAX)
504 /* allocate and fill new struct pf_tagname */
505 tag = kmalloc(sizeof(struct pf_tagname), M_TEMP, M_WAITOK);
508 bzero(tag, sizeof(struct pf_tagname));
509 strlcpy(tag->name, tagname, sizeof(tag->name));
510 tag->tag = new_tagid;
513 if (p != NULL) /* insert new entry before p */
514 TAILQ_INSERT_BEFORE(p, tag, entries);
515 else /* either list empty or no free slot in between */
516 TAILQ_INSERT_TAIL(head, tag, entries);
522 tag2tagname(struct pf_tags *head, u_int16_t tagid, char *p)
524 struct pf_tagname *tag;
526 TAILQ_FOREACH(tag, head, entries)
527 if (tag->tag == tagid) {
528 strlcpy(p, tag->name, PF_TAG_NAME_SIZE);
534 tag_unref(struct pf_tags *head, u_int16_t tag)
536 struct pf_tagname *p, *next;
541 for (p = TAILQ_FIRST(head); p != NULL; p = next) {
542 next = TAILQ_NEXT(p, entries);
545 TAILQ_REMOVE(head, p, entries);
554 pf_tagname2tag(char *tagname)
556 return (tagname2tag(&pf_tags, tagname));
560 pf_tag2tagname(u_int16_t tagid, char *p)
562 tag2tagname(&pf_tags, tagid, p);
566 pf_tag_ref(u_int16_t tag)
568 struct pf_tagname *t;
570 TAILQ_FOREACH(t, &pf_tags, entries)
578 pf_tag_unref(u_int16_t tag)
580 tag_unref(&pf_tags, tag);
584 pf_rtlabel_add(struct pf_addr_wrap *a)
590 pf_rtlabel_remove(struct pf_addr_wrap *a)
595 pf_rtlabel_copyout(struct pf_addr_wrap *a)
597 if (a->type == PF_ADDR_RTLABEL && a->v.rtlabel)
598 strlcpy(a->v.rtlabelname, "?", sizeof(a->v.rtlabelname));
603 pf_qname2qid(char *qname)
605 return ((u_int32_t)tagname2tag(&pf_qids, qname));
609 pf_qid2qname(u_int32_t qid, char *p)
611 tag2tagname(&pf_qids, (u_int16_t)qid, p);
615 pf_qid_unref(u_int32_t qid)
617 tag_unref(&pf_qids, (u_int16_t)qid);
621 pf_begin_altq(u_int32_t *ticket)
623 struct pf_altq *altq;
626 /* Purge the old altq list */
627 while ((altq = TAILQ_FIRST(pf_altqs_inactive)) != NULL) {
628 TAILQ_REMOVE(pf_altqs_inactive, altq, entries);
629 if (altq->qname[0] == 0) {
630 /* detach and destroy the discipline */
631 error = altq_remove(altq);
633 pf_qid_unref(altq->qid);
634 pool_put(&pf_altq_pl, altq);
638 *ticket = ++ticket_altqs_inactive;
639 altqs_inactive_open = 1;
644 pf_rollback_altq(u_int32_t ticket)
646 struct pf_altq *altq;
649 if (!altqs_inactive_open || ticket != ticket_altqs_inactive)
651 /* Purge the old altq list */
652 while ((altq = TAILQ_FIRST(pf_altqs_inactive)) != NULL) {
653 TAILQ_REMOVE(pf_altqs_inactive, altq, entries);
654 if (altq->qname[0] == 0) {
655 /* detach and destroy the discipline */
656 error = altq_remove(altq);
658 pf_qid_unref(altq->qid);
659 pool_put(&pf_altq_pl, altq);
661 altqs_inactive_open = 0;
666 pf_commit_altq(u_int32_t ticket)
668 struct pf_altqqueue *old_altqs;
669 struct pf_altq *altq;
672 if (!altqs_inactive_open || ticket != ticket_altqs_inactive)
675 /* swap altqs, keep the old. */
677 old_altqs = pf_altqs_active;
678 pf_altqs_active = pf_altqs_inactive;
679 pf_altqs_inactive = old_altqs;
680 ticket_altqs_active = ticket_altqs_inactive;
682 /* Attach new disciplines */
683 TAILQ_FOREACH(altq, pf_altqs_active, entries) {
684 if (altq->qname[0] == 0) {
685 /* attach the discipline */
686 error = altq_pfattach(altq);
694 /* Purge the old altq list */
695 while ((altq = TAILQ_FIRST(pf_altqs_inactive)) != NULL) {
696 TAILQ_REMOVE(pf_altqs_inactive, altq, entries);
697 if (altq->qname[0] == 0) {
698 /* detach and destroy the discipline */
700 error = pf_disable_altq(altq);
701 err = altq_pfdetach(altq);
702 if (err != 0 && error == 0)
704 err = altq_remove(altq);
705 if (err != 0 && error == 0)
708 pf_qid_unref(altq->qid);
709 pool_put(&pf_altq_pl, altq);
713 altqs_inactive_open = 0;
718 pf_enable_altq(struct pf_altq *altq)
721 struct tb_profile tb;
724 if ((ifp = ifunit(altq->ifname)) == NULL)
727 if (ifp->if_snd.altq_type != ALTQT_NONE)
728 error = altq_enable(&ifp->if_snd);
730 /* set tokenbucket regulator */
731 if (error == 0 && ifp != NULL && ALTQ_IS_ENABLED(&ifp->if_snd)) {
732 tb.rate = altq->ifbandwidth;
733 tb.depth = altq->tbrsize;
735 error = tbr_set(&ifp->if_snd, &tb);
743 pf_disable_altq(struct pf_altq *altq)
746 struct tb_profile tb;
749 if ((ifp = ifunit(altq->ifname)) == NULL)
753 * when the discipline is no longer referenced, it was overridden
754 * by a new one. if so, just return.
756 if (altq->altq_disc != ifp->if_snd.altq_disc)
759 error = altq_disable(&ifp->if_snd);
762 /* clear tokenbucket regulator */
765 error = tbr_set(&ifp->if_snd, &tb);
774 pf_begin_rules(u_int32_t *ticket, int rs_num, const char *anchor)
776 struct pf_ruleset *rs;
777 struct pf_rule *rule;
779 if (rs_num < 0 || rs_num >= PF_RULESET_MAX)
781 rs = pf_find_or_create_ruleset(anchor);
784 while ((rule = TAILQ_FIRST(rs->rules[rs_num].inactive.ptr)) != NULL) {
785 pf_rm_rule(rs->rules[rs_num].inactive.ptr, rule);
786 rs->rules[rs_num].inactive.rcount--;
788 *ticket = ++rs->rules[rs_num].inactive.ticket;
789 rs->rules[rs_num].inactive.open = 1;
794 pf_rollback_rules(u_int32_t ticket, int rs_num, char *anchor)
796 struct pf_ruleset *rs;
797 struct pf_rule *rule;
799 if (rs_num < 0 || rs_num >= PF_RULESET_MAX)
801 rs = pf_find_ruleset(anchor);
802 if (rs == NULL || !rs->rules[rs_num].inactive.open ||
803 rs->rules[rs_num].inactive.ticket != ticket)
805 while ((rule = TAILQ_FIRST(rs->rules[rs_num].inactive.ptr)) != NULL) {
806 pf_rm_rule(rs->rules[rs_num].inactive.ptr, rule);
807 rs->rules[rs_num].inactive.rcount--;
809 rs->rules[rs_num].inactive.open = 0;
813 #define PF_MD5_UPD(st, elm) \
814 MD5Update(ctx, (u_int8_t *) &(st)->elm, sizeof((st)->elm))
816 #define PF_MD5_UPD_STR(st, elm) \
817 MD5Update(ctx, (u_int8_t *) (st)->elm, strlen((st)->elm))
819 #define PF_MD5_UPD_HTONL(st, elm, stor) do { \
820 (stor) = htonl((st)->elm); \
821 MD5Update(ctx, (u_int8_t *) &(stor), sizeof(u_int32_t));\
824 #define PF_MD5_UPD_HTONS(st, elm, stor) do { \
825 (stor) = htons((st)->elm); \
826 MD5Update(ctx, (u_int8_t *) &(stor), sizeof(u_int16_t));\
830 pf_hash_rule_addr(MD5_CTX *ctx, struct pf_rule_addr *pfr)
832 PF_MD5_UPD(pfr, addr.type);
833 switch (pfr->addr.type) {
834 case PF_ADDR_DYNIFTL:
835 PF_MD5_UPD(pfr, addr.v.ifname);
836 PF_MD5_UPD(pfr, addr.iflags);
839 PF_MD5_UPD(pfr, addr.v.tblname);
841 case PF_ADDR_ADDRMASK:
843 PF_MD5_UPD(pfr, addr.v.a.addr.addr32);
844 PF_MD5_UPD(pfr, addr.v.a.mask.addr32);
846 case PF_ADDR_RTLABEL:
847 PF_MD5_UPD(pfr, addr.v.rtlabelname);
851 PF_MD5_UPD(pfr, port[0]);
852 PF_MD5_UPD(pfr, port[1]);
853 PF_MD5_UPD(pfr, neg);
854 PF_MD5_UPD(pfr, port_op);
858 pf_hash_rule(MD5_CTX *ctx, struct pf_rule *rule)
863 pf_hash_rule_addr(ctx, &rule->src);
864 pf_hash_rule_addr(ctx, &rule->dst);
865 PF_MD5_UPD_STR(rule, label);
866 PF_MD5_UPD_STR(rule, ifname);
867 PF_MD5_UPD_STR(rule, match_tagname);
868 PF_MD5_UPD_HTONS(rule, match_tag, x); /* dup? */
869 PF_MD5_UPD_HTONL(rule, os_fingerprint, y);
870 PF_MD5_UPD_HTONL(rule, prob, y);
871 PF_MD5_UPD_HTONL(rule, uid.uid[0], y);
872 PF_MD5_UPD_HTONL(rule, uid.uid[1], y);
873 PF_MD5_UPD(rule, uid.op);
874 PF_MD5_UPD_HTONL(rule, gid.gid[0], y);
875 PF_MD5_UPD_HTONL(rule, gid.gid[1], y);
876 PF_MD5_UPD(rule, gid.op);
877 PF_MD5_UPD_HTONL(rule, rule_flag, y);
878 PF_MD5_UPD(rule, action);
879 PF_MD5_UPD(rule, direction);
880 PF_MD5_UPD(rule, af);
881 PF_MD5_UPD(rule, quick);
882 PF_MD5_UPD(rule, ifnot);
883 PF_MD5_UPD(rule, match_tag_not);
884 PF_MD5_UPD(rule, natpass);
885 PF_MD5_UPD(rule, keep_state);
886 PF_MD5_UPD(rule, proto);
887 PF_MD5_UPD(rule, type);
888 PF_MD5_UPD(rule, code);
889 PF_MD5_UPD(rule, flags);
890 PF_MD5_UPD(rule, flagset);
891 PF_MD5_UPD(rule, allow_opts);
892 PF_MD5_UPD(rule, rt);
893 PF_MD5_UPD(rule, tos);
897 pf_commit_rules(u_int32_t ticket, int rs_num, char *anchor)
899 struct pf_ruleset *rs;
900 struct pf_rule *rule, **old_array;
901 struct pf_rulequeue *old_rules;
903 u_int32_t old_rcount;
905 if (rs_num < 0 || rs_num >= PF_RULESET_MAX)
907 rs = pf_find_ruleset(anchor);
908 if (rs == NULL || !rs->rules[rs_num].inactive.open ||
909 ticket != rs->rules[rs_num].inactive.ticket)
912 /* Calculate checksum for the main ruleset */
913 if (rs == &pf_main_ruleset) {
914 error = pf_setup_pfsync_matching(rs);
919 /* Swap rules, keep the old. */
921 old_rules = rs->rules[rs_num].active.ptr;
922 old_rcount = rs->rules[rs_num].active.rcount;
923 old_array = rs->rules[rs_num].active.ptr_array;
925 rs->rules[rs_num].active.ptr =
926 rs->rules[rs_num].inactive.ptr;
927 rs->rules[rs_num].active.ptr_array =
928 rs->rules[rs_num].inactive.ptr_array;
929 rs->rules[rs_num].active.rcount =
930 rs->rules[rs_num].inactive.rcount;
931 rs->rules[rs_num].inactive.ptr = old_rules;
932 rs->rules[rs_num].inactive.ptr_array = old_array;
933 rs->rules[rs_num].inactive.rcount = old_rcount;
935 rs->rules[rs_num].active.ticket =
936 rs->rules[rs_num].inactive.ticket;
937 pf_calc_skip_steps(rs->rules[rs_num].active.ptr);
940 /* Purge the old rule list. */
941 while ((rule = TAILQ_FIRST(old_rules)) != NULL)
942 pf_rm_rule(old_rules, rule);
943 if (rs->rules[rs_num].inactive.ptr_array)
944 kfree(rs->rules[rs_num].inactive.ptr_array, M_TEMP);
945 rs->rules[rs_num].inactive.ptr_array = NULL;
946 rs->rules[rs_num].inactive.rcount = 0;
947 rs->rules[rs_num].inactive.open = 0;
948 pf_remove_if_empty_ruleset(rs);
954 pf_setup_pfsync_matching(struct pf_ruleset *rs)
957 struct pf_rule *rule;
959 u_int8_t digest[PF_MD5_DIGEST_LENGTH];
962 for (rs_cnt = 0; rs_cnt < PF_RULESET_MAX; rs_cnt++) {
963 /* XXX PF_RULESET_SCRUB as well? */
964 if (rs_cnt == PF_RULESET_SCRUB)
967 if (rs->rules[rs_cnt].inactive.ptr_array)
968 kfree(rs->rules[rs_cnt].inactive.ptr_array, M_TEMP);
969 rs->rules[rs_cnt].inactive.ptr_array = NULL;
971 if (rs->rules[rs_cnt].inactive.rcount) {
972 rs->rules[rs_cnt].inactive.ptr_array =
973 kmalloc(sizeof(caddr_t) *
974 rs->rules[rs_cnt].inactive.rcount,
977 if (!rs->rules[rs_cnt].inactive.ptr_array)
981 TAILQ_FOREACH(rule, rs->rules[rs_cnt].inactive.ptr,
983 pf_hash_rule(&ctx, rule);
984 (rs->rules[rs_cnt].inactive.ptr_array)[rule->nr] = rule;
988 MD5Final(digest, &ctx);
989 memcpy(pf_status.pf_chksum, digest, sizeof(pf_status.pf_chksum));
994 pfioctl(struct dev_ioctl_args *ap)
996 u_long cmd = ap->a_cmd;
997 caddr_t addr = ap->a_data;
998 struct pf_pooladdr *pa = NULL;
999 struct pf_pool *pool = NULL;
1002 /* XXX keep in sync with switch() below */
1003 if (securelevel > 1)
1010 case DIOCSETSTATUSIF:
1016 case DIOCGETTIMEOUT:
1017 case DIOCCLRRULECTRS:
1022 case DIOCGETRULESETS:
1023 case DIOCGETRULESET:
1024 case DIOCRGETTABLES:
1025 case DIOCRGETTSTATS:
1026 case DIOCRCLRTSTATS:
1032 case DIOCRGETASTATS:
1033 case DIOCRCLRASTATS:
1036 case DIOCGETSRCNODES:
1037 case DIOCCLRSRCNODES:
1038 case DIOCIGETIFACES:
1043 case DIOCRCLRTABLES:
1044 case DIOCRADDTABLES:
1045 case DIOCRDELTABLES:
1046 case DIOCRSETTFLAGS:
1047 if (((struct pfioc_table *)addr)->pfrio_flags &
1049 break; /* dummy operation ok */
1055 if (!(ap->a_fflag & FWRITE))
1063 case DIOCGETTIMEOUT:
1068 case DIOCGETRULESETS:
1069 case DIOCGETRULESET:
1071 case DIOCRGETTABLES:
1072 case DIOCRGETTSTATS:
1074 case DIOCRGETASTATS:
1077 case DIOCGETSRCNODES:
1078 case DIOCIGETIFACES:
1081 case DIOCRCLRTABLES:
1082 case DIOCRADDTABLES:
1083 case DIOCRDELTABLES:
1084 case DIOCRCLRTSTATS:
1089 case DIOCRSETTFLAGS:
1090 if (((struct pfioc_table *)addr)->pfrio_flags &
1092 break; /* dummy operation ok */
1095 if (((struct pfioc_rule *)addr)->action == PF_GET_CLR_CNTR)
1105 if (pf_status.running)
1110 DPFPRINTF(PF_DEBUG_MISC,
1111 ("pf: pfil registration fail\n"));
1114 pf_status.running = 1;
1115 pf_status.since = time_second;
1116 if (pf_status.stateid == 0) {
1117 pf_status.stateid = time_second;
1118 pf_status.stateid = pf_status.stateid << 32;
1120 DPFPRINTF(PF_DEBUG_MISC, ("pf: started\n"));
1125 if (!pf_status.running)
1128 pf_status.running = 0;
1129 error = dehook_pf();
1131 pf_status.running = 1;
1132 DPFPRINTF(PF_DEBUG_MISC,
1133 ("pf: pfil unregistration failed\n"));
1135 pf_status.since = time_second;
1136 DPFPRINTF(PF_DEBUG_MISC, ("pf: stopped\n"));
1141 struct pfioc_rule *pr = (struct pfioc_rule *)addr;
1142 struct pf_ruleset *ruleset;
1143 struct pf_rule *rule, *tail;
1144 struct pf_pooladdr *pa;
1147 pr->anchor[sizeof(pr->anchor) - 1] = 0;
1148 ruleset = pf_find_ruleset(pr->anchor);
1149 if (ruleset == NULL) {
1153 rs_num = pf_get_ruleset_number(pr->rule.action);
1154 if (rs_num >= PF_RULESET_MAX) {
1158 if (pr->rule.return_icmp >> 8 > ICMP_MAXTYPE) {
1162 if (pr->ticket != ruleset->rules[rs_num].inactive.ticket) {
1166 if (pr->pool_ticket != ticket_pabuf) {
1170 rule = pool_get(&pf_rule_pl, PR_NOWAIT);
1175 bcopy(&pr->rule, rule, sizeof(struct pf_rule));
1176 rule->cuid = ap->a_cred->cr_ruid;
1177 rule->cpid = (int)NULL;
1178 rule->anchor = NULL;
1180 TAILQ_INIT(&rule->rpool.list);
1181 /* initialize refcounting */
1183 rule->src_nodes = 0;
1184 rule->entries.tqe_prev = NULL;
1186 if (rule->af == AF_INET) {
1187 pool_put(&pf_rule_pl, rule);
1188 error = EAFNOSUPPORT;
1193 if (rule->af == AF_INET6) {
1194 pool_put(&pf_rule_pl, rule);
1195 error = EAFNOSUPPORT;
1199 tail = TAILQ_LAST(ruleset->rules[rs_num].inactive.ptr,
1202 rule->nr = tail->nr + 1;
1205 if (rule->ifname[0]) {
1206 rule->kif = pfi_kif_get(rule->ifname);
1207 if (rule->kif == NULL) {
1208 pool_put(&pf_rule_pl, rule);
1212 pfi_kif_ref(rule->kif, PFI_KIF_REF_RULE);
1215 if (rule->rtableid > 0 && rule->rtableid > rt_numfibs)
1220 if (rule->qname[0] != 0) {
1221 if ((rule->qid = pf_qname2qid(rule->qname)) == 0)
1223 else if (rule->pqname[0] != 0) {
1225 pf_qname2qid(rule->pqname)) == 0)
1228 rule->pqid = rule->qid;
1231 if (rule->tagname[0])
1232 if ((rule->tag = pf_tagname2tag(rule->tagname)) == 0)
1234 if (rule->match_tagname[0])
1235 if ((rule->match_tag =
1236 pf_tagname2tag(rule->match_tagname)) == 0)
1238 if (rule->rt && !rule->direction)
1241 if (rule->logif >= PFLOGIFS_MAX)
1244 if (pf_rtlabel_add(&rule->src.addr) ||
1245 pf_rtlabel_add(&rule->dst.addr))
1247 if (pfi_dynaddr_setup(&rule->src.addr, rule->af))
1249 if (pfi_dynaddr_setup(&rule->dst.addr, rule->af))
1251 if (pf_tbladdr_setup(ruleset, &rule->src.addr))
1253 if (pf_tbladdr_setup(ruleset, &rule->dst.addr))
1255 if (pf_anchor_setup(rule, ruleset, pr->anchor_call))
1257 TAILQ_FOREACH(pa, &pf_pabuf, entries)
1258 if (pf_tbladdr_setup(ruleset, &pa->addr))
1261 if (rule->overload_tblname[0]) {
1262 if ((rule->overload_tbl = pfr_attach_table(ruleset,
1263 rule->overload_tblname)) == NULL)
1266 rule->overload_tbl->pfrkt_flags |=
1270 pf_mv_pool(&pf_pabuf, &rule->rpool.list);
1271 if (((((rule->action == PF_NAT) || (rule->action == PF_RDR) ||
1272 (rule->action == PF_BINAT)) && rule->anchor == NULL) ||
1273 (rule->rt > PF_FASTROUTE)) &&
1274 (TAILQ_FIRST(&rule->rpool.list) == NULL))
1278 pf_rm_rule(NULL, rule);
1281 rule->rpool.cur = TAILQ_FIRST(&rule->rpool.list);
1282 rule->evaluations = rule->packets[0] = rule->packets[1] =
1283 rule->bytes[0] = rule->bytes[1] = 0;
1284 TAILQ_INSERT_TAIL(ruleset->rules[rs_num].inactive.ptr,
1286 ruleset->rules[rs_num].inactive.rcount++;
1290 case DIOCGETRULES: {
1291 struct pfioc_rule *pr = (struct pfioc_rule *)addr;
1292 struct pf_ruleset *ruleset;
1293 struct pf_rule *tail;
1296 pr->anchor[sizeof(pr->anchor) - 1] = 0;
1297 ruleset = pf_find_ruleset(pr->anchor);
1298 if (ruleset == NULL) {
1302 rs_num = pf_get_ruleset_number(pr->rule.action);
1303 if (rs_num >= PF_RULESET_MAX) {
1307 tail = TAILQ_LAST(ruleset->rules[rs_num].active.ptr,
1310 pr->nr = tail->nr + 1;
1313 pr->ticket = ruleset->rules[rs_num].active.ticket;
1318 struct pfioc_rule *pr = (struct pfioc_rule *)addr;
1319 struct pf_ruleset *ruleset;
1320 struct pf_rule *rule;
1323 pr->anchor[sizeof(pr->anchor) - 1] = 0;
1324 ruleset = pf_find_ruleset(pr->anchor);
1325 if (ruleset == NULL) {
1329 rs_num = pf_get_ruleset_number(pr->rule.action);
1330 if (rs_num >= PF_RULESET_MAX) {
1334 if (pr->ticket != ruleset->rules[rs_num].active.ticket) {
1338 rule = TAILQ_FIRST(ruleset->rules[rs_num].active.ptr);
1339 while ((rule != NULL) && (rule->nr != pr->nr))
1340 rule = TAILQ_NEXT(rule, entries);
1345 bcopy(rule, &pr->rule, sizeof(struct pf_rule));
1346 if (pf_anchor_copyout(ruleset, rule, pr)) {
1350 pfi_dynaddr_copyout(&pr->rule.src.addr);
1351 pfi_dynaddr_copyout(&pr->rule.dst.addr);
1352 pf_tbladdr_copyout(&pr->rule.src.addr);
1353 pf_tbladdr_copyout(&pr->rule.dst.addr);
1354 pf_rtlabel_copyout(&pr->rule.src.addr);
1355 pf_rtlabel_copyout(&pr->rule.dst.addr);
1356 for (i = 0; i < PF_SKIP_COUNT; ++i)
1357 if (rule->skip[i].ptr == NULL)
1358 pr->rule.skip[i].nr = (uint32_t)(-1);
1360 pr->rule.skip[i].nr =
1361 rule->skip[i].ptr->nr;
1363 if (pr->action == PF_GET_CLR_CNTR) {
1364 rule->evaluations = 0;
1365 rule->packets[0] = rule->packets[1] = 0;
1366 rule->bytes[0] = rule->bytes[1] = 0;
1371 case DIOCCHANGERULE: {
1372 struct pfioc_rule *pcr = (struct pfioc_rule *)addr;
1373 struct pf_ruleset *ruleset;
1374 struct pf_rule *oldrule = NULL, *newrule = NULL;
1378 if (!(pcr->action == PF_CHANGE_REMOVE ||
1379 pcr->action == PF_CHANGE_GET_TICKET) &&
1380 pcr->pool_ticket != ticket_pabuf) {
1385 if (pcr->action < PF_CHANGE_ADD_HEAD ||
1386 pcr->action > PF_CHANGE_GET_TICKET) {
1390 ruleset = pf_find_ruleset(pcr->anchor);
1391 if (ruleset == NULL) {
1395 rs_num = pf_get_ruleset_number(pcr->rule.action);
1396 if (rs_num >= PF_RULESET_MAX) {
1401 if (pcr->action == PF_CHANGE_GET_TICKET) {
1402 pcr->ticket = ++ruleset->rules[rs_num].active.ticket;
1406 ruleset->rules[rs_num].active.ticket) {
1410 if (pcr->rule.return_icmp >> 8 > ICMP_MAXTYPE) {
1416 if (pcr->action != PF_CHANGE_REMOVE) {
1417 newrule = pool_get(&pf_rule_pl, PR_NOWAIT);
1418 if (newrule == NULL) {
1422 bcopy(&pcr->rule, newrule, sizeof(struct pf_rule));
1423 newrule->cuid = ap->a_cred->cr_ruid;
1424 newrule->cpid = (int)NULL;
1425 TAILQ_INIT(&newrule->rpool.list);
1426 /* initialize refcounting */
1427 newrule->states = 0;
1428 newrule->entries.tqe_prev = NULL;
1430 if (newrule->af == AF_INET) {
1431 pool_put(&pf_rule_pl, newrule);
1432 error = EAFNOSUPPORT;
1437 if (newrule->af == AF_INET6) {
1438 pool_put(&pf_rule_pl, newrule);
1439 error = EAFNOSUPPORT;
1443 if (newrule->ifname[0]) {
1444 newrule->kif = pfi_kif_get(newrule->ifname);
1445 if (newrule->kif == NULL) {
1446 pool_put(&pf_rule_pl, newrule);
1450 pfi_kif_ref(newrule->kif, PFI_KIF_REF_RULE);
1452 newrule->kif = NULL;
1454 if (newrule->rtableid > 0 &&
1455 newrule->rtableid > rt_numfibs)
1460 if (newrule->qname[0] != 0) {
1462 pf_qname2qid(newrule->qname)) == 0)
1464 else if (newrule->pqname[0] != 0) {
1465 if ((newrule->pqid =
1466 pf_qname2qid(newrule->pqname)) == 0)
1469 newrule->pqid = newrule->qid;
1472 if (newrule->tagname[0])
1474 pf_tagname2tag(newrule->tagname)) == 0)
1476 if (newrule->match_tagname[0])
1477 if ((newrule->match_tag = pf_tagname2tag(
1478 newrule->match_tagname)) == 0)
1480 if (newrule->rt && !newrule->direction)
1482 if (pf_rtlabel_add(&newrule->src.addr) ||
1483 pf_rtlabel_add(&newrule->dst.addr))
1485 if (pfi_dynaddr_setup(&newrule->src.addr, newrule->af))
1487 if (pfi_dynaddr_setup(&newrule->dst.addr, newrule->af))
1489 if (pf_tbladdr_setup(ruleset, &newrule->src.addr))
1491 if (pf_tbladdr_setup(ruleset, &newrule->dst.addr))
1493 if (pf_anchor_setup(newrule, ruleset, pcr->anchor_call))
1495 TAILQ_FOREACH(pa, &pf_pabuf, entries)
1496 if (pf_tbladdr_setup(ruleset, &pa->addr))
1499 if (newrule->overload_tblname[0]) {
1500 if ((newrule->overload_tbl = pfr_attach_table(
1501 ruleset, newrule->overload_tblname)) ==
1505 newrule->overload_tbl->pfrkt_flags |=
1509 pf_mv_pool(&pf_pabuf, &newrule->rpool.list);
1510 if (((((newrule->action == PF_NAT) ||
1511 (newrule->action == PF_RDR) ||
1512 (newrule->action == PF_BINAT) ||
1513 (newrule->rt > PF_FASTROUTE)) &&
1514 !newrule->anchor)) &&
1515 (TAILQ_FIRST(&newrule->rpool.list) == NULL))
1519 pf_rm_rule(NULL, newrule);
1522 newrule->rpool.cur = TAILQ_FIRST(&newrule->rpool.list);
1523 newrule->evaluations = 0;
1524 newrule->packets[0] = newrule->packets[1] = 0;
1525 newrule->bytes[0] = newrule->bytes[1] = 0;
1527 pf_empty_pool(&pf_pabuf);
1529 if (pcr->action == PF_CHANGE_ADD_HEAD)
1530 oldrule = TAILQ_FIRST(
1531 ruleset->rules[rs_num].active.ptr);
1532 else if (pcr->action == PF_CHANGE_ADD_TAIL)
1533 oldrule = TAILQ_LAST(
1534 ruleset->rules[rs_num].active.ptr, pf_rulequeue);
1536 oldrule = TAILQ_FIRST(
1537 ruleset->rules[rs_num].active.ptr);
1538 while ((oldrule != NULL) && (oldrule->nr != pcr->nr))
1539 oldrule = TAILQ_NEXT(oldrule, entries);
1540 if (oldrule == NULL) {
1541 if (newrule != NULL)
1542 pf_rm_rule(NULL, newrule);
1548 if (pcr->action == PF_CHANGE_REMOVE) {
1549 pf_rm_rule(ruleset->rules[rs_num].active.ptr, oldrule);
1550 ruleset->rules[rs_num].active.rcount--;
1552 if (oldrule == NULL)
1554 ruleset->rules[rs_num].active.ptr,
1556 else if (pcr->action == PF_CHANGE_ADD_HEAD ||
1557 pcr->action == PF_CHANGE_ADD_BEFORE)
1558 TAILQ_INSERT_BEFORE(oldrule, newrule, entries);
1561 ruleset->rules[rs_num].active.ptr,
1562 oldrule, newrule, entries);
1563 ruleset->rules[rs_num].active.rcount++;
1567 TAILQ_FOREACH(oldrule,
1568 ruleset->rules[rs_num].active.ptr, entries)
1571 ruleset->rules[rs_num].active.ticket++;
1573 pf_calc_skip_steps(ruleset->rules[rs_num].active.ptr);
1574 pf_remove_if_empty_ruleset(ruleset);
1579 case DIOCCLRSTATES: {
1580 struct pf_state *state, *nexts;
1581 struct pfioc_state_kill *psk = (struct pfioc_state_kill *)addr;
1584 for (state = RB_MIN(pf_state_tree_id, &tree_id); state;
1586 nexts = RB_NEXT(pf_state_tree_id, &tree_id, state);
1588 if (!psk->psk_ifname[0] || !strcmp(psk->psk_ifname,
1589 state->u.s.kif->pfik_name)) {
1591 /* don't send out individual delete messages */
1592 state->sync_flags = PFSTATE_NOSYNC;
1594 pf_unlink_state(state);
1598 psk->psk_af = killed;
1600 pfsync_clear_states(pf_status.hostid, psk->psk_ifname);
1605 case DIOCKILLSTATES: {
1606 struct pf_state *state, *nexts;
1607 struct pf_state_host *src, *dst;
1608 struct pfioc_state_kill *psk = (struct pfioc_state_kill *)addr;
1611 for (state = RB_MIN(pf_state_tree_id, &tree_id); state;
1613 nexts = RB_NEXT(pf_state_tree_id, &tree_id, state);
1615 if (state->direction == PF_OUT) {
1622 if ((!psk->psk_af || state->af == psk->psk_af)
1623 && (!psk->psk_proto || psk->psk_proto ==
1625 PF_MATCHA(psk->psk_src.neg,
1626 &psk->psk_src.addr.v.a.addr,
1627 &psk->psk_src.addr.v.a.mask,
1628 &src->addr, state->af) &&
1629 PF_MATCHA(psk->psk_dst.neg,
1630 &psk->psk_dst.addr.v.a.addr,
1631 &psk->psk_dst.addr.v.a.mask,
1632 &dst->addr, state->af) &&
1633 (psk->psk_src.port_op == 0 ||
1634 pf_match_port(psk->psk_src.port_op,
1635 psk->psk_src.port[0], psk->psk_src.port[1],
1637 (psk->psk_dst.port_op == 0 ||
1638 pf_match_port(psk->psk_dst.port_op,
1639 psk->psk_dst.port[0], psk->psk_dst.port[1],
1641 (!psk->psk_ifname[0] || !strcmp(psk->psk_ifname,
1642 state->u.s.kif->pfik_name))) {
1644 /* send immediate delete of state */
1645 pfsync_delete_state(state);
1646 state->sync_flags |= PFSTATE_NOSYNC;
1648 pf_unlink_state(state);
1652 psk->psk_af = killed;
1656 case DIOCADDSTATE: {
1657 struct pfioc_state *ps = (struct pfioc_state *)addr;
1658 struct pf_state *state;
1659 struct pfi_kif *kif;
1661 if (ps->state.timeout >= PFTM_MAX &&
1662 ps->state.timeout != PFTM_UNTIL_PACKET) {
1666 state = pool_get(&pf_state_pl, PR_NOWAIT);
1667 if (state == NULL) {
1671 kif = pfi_kif_get(ps->state.u.ifname);
1673 pool_put(&pf_state_pl, state);
1677 bcopy(&ps->state, state, sizeof(struct pf_state));
1678 bzero(&state->u, sizeof(state->u));
1679 state->rule.ptr = &pf_default_rule;
1680 state->nat_rule.ptr = NULL;
1681 state->anchor.ptr = NULL;
1682 state->rt_kif = NULL;
1683 state->creation = time_second;
1684 state->pfsync_time = 0;
1685 state->packets[0] = state->packets[1] = 0;
1686 state->bytes[0] = state->bytes[1] = 0;
1687 state->hash = pf_state_hash(state);
1689 if (pf_insert_state(kif, state)) {
1690 pfi_kif_unref(kif, PFI_KIF_REF_NONE);
1691 pool_put(&pf_state_pl, state);
1697 case DIOCGETSTATE: {
1698 struct pfioc_state *ps = (struct pfioc_state *)addr;
1699 struct pf_state *state;
1704 RB_FOREACH(state, pf_state_tree_id, &tree_id) {
1709 if (state == NULL) {
1714 bcopy(state, &ps->state, sizeof(ps->state));
1715 strlcpy(ps->state.u.ifname, state->u.s.kif->pfik_name,
1716 sizeof(ps->state.u.ifname));
1717 ps->state.rule.nr = state->rule.ptr->nr;
1718 ps->state.nat_rule.nr = (state->nat_rule.ptr == NULL) ?
1719 (uint32_t)(-1) : state->nat_rule.ptr->nr;
1720 ps->state.anchor.nr = (state->anchor.ptr == NULL) ?
1721 -1 : state->anchor.ptr->nr;
1722 ps->state.creation = secs - ps->state.creation;
1723 ps->state.expire = pf_state_expires(state);
1724 if (ps->state.expire > secs)
1725 ps->state.expire -= secs;
1727 ps->state.expire = 0;
1731 case DIOCGETSTATES: {
1732 struct pfioc_states *ps = (struct pfioc_states *)addr;
1733 struct pf_state *state;
1734 struct pf_state *p, *pstore;
1736 int space = ps->ps_len;
1739 nr = pf_status.states;
1740 ps->ps_len = sizeof(struct pf_state) * nr;
1744 pstore = kmalloc(sizeof(*pstore), M_TEMP, M_WAITOK);
1748 state = TAILQ_FIRST(&state_list);
1750 if (state->timeout != PFTM_UNLINKED) {
1751 int secs = time_second;
1753 if ((nr+1) * sizeof(*p) > (unsigned)ps->ps_len)
1756 bcopy(state, pstore, sizeof(*pstore));
1757 strlcpy(pstore->u.ifname,
1758 state->u.s.kif->pfik_name,
1759 sizeof(pstore->u.ifname));
1760 pstore->rule.nr = state->rule.ptr->nr;
1761 pstore->nat_rule.nr = (state->nat_rule.ptr ==
1762 NULL) ? -1 : state->nat_rule.ptr->nr;
1763 pstore->anchor.nr = (state->anchor.ptr ==
1764 NULL) ? -1 : state->anchor.ptr->nr;
1765 pstore->creation = secs - pstore->creation;
1766 pstore->expire = pf_state_expires(state);
1767 if (pstore->expire > secs)
1768 pstore->expire -= secs;
1771 error = copyout(pstore, p, sizeof(*p));
1773 kfree(pstore, M_TEMP);
1779 state = TAILQ_NEXT(state, u.s.entry_list);
1782 ps->ps_len = sizeof(struct pf_state) * nr;
1784 kfree(pstore, M_TEMP);
1788 case DIOCGETSTATUS: {
1789 struct pf_status *s = (struct pf_status *)addr;
1790 bcopy(&pf_status, s, sizeof(struct pf_status));
1791 pfi_fill_oldstatus(s);
1795 case DIOCSETSTATUSIF: {
1796 struct pfioc_if *pi = (struct pfioc_if *)addr;
1798 if (pi->ifname[0] == 0) {
1799 bzero(pf_status.ifname, IFNAMSIZ);
1802 if (ifunit(pi->ifname) == NULL) {
1806 strlcpy(pf_status.ifname, pi->ifname, IFNAMSIZ);
1810 case DIOCCLRSTATUS: {
1811 bzero(pf_status.counters, sizeof(pf_status.counters));
1812 bzero(pf_status.fcounters, sizeof(pf_status.fcounters));
1813 bzero(pf_status.scounters, sizeof(pf_status.scounters));
1814 pf_status.since = time_second;
1815 if (*pf_status.ifname)
1816 pfi_clr_istats(pf_status.ifname);
1821 struct pfioc_natlook *pnl = (struct pfioc_natlook *)addr;
1822 struct pf_state *state;
1823 struct pf_state_cmp key;
1824 int m = 0, direction = pnl->direction;
1827 key.proto = pnl->proto;
1830 PF_AZERO(&pnl->saddr, pnl->af) ||
1831 PF_AZERO(&pnl->daddr, pnl->af) ||
1832 ((pnl->proto == IPPROTO_TCP ||
1833 pnl->proto == IPPROTO_UDP) &&
1834 (!pnl->dport || !pnl->sport)))
1838 * userland gives us source and dest of connection,
1839 * reverse the lookup so we ask for what happens with
1840 * the return traffic, enabling us to find it in the
1843 if (direction == PF_IN) {
1844 PF_ACPY(&key.ext.addr, &pnl->daddr, pnl->af);
1845 key.ext.port = pnl->dport;
1846 PF_ACPY(&key.gwy.addr, &pnl->saddr, pnl->af);
1847 key.gwy.port = pnl->sport;
1848 state = pf_find_state_all(&key, PF_EXT_GWY, &m);
1850 PF_ACPY(&key.lan.addr, &pnl->daddr, pnl->af);
1851 key.lan.port = pnl->dport;
1852 PF_ACPY(&key.ext.addr, &pnl->saddr, pnl->af);
1853 key.ext.port = pnl->sport;
1854 state = pf_find_state_all(&key, PF_LAN_EXT, &m);
1857 error = E2BIG; /* more than one state */
1858 else if (state != NULL) {
1859 if (direction == PF_IN) {
1860 PF_ACPY(&pnl->rsaddr, &state->lan.addr,
1862 pnl->rsport = state->lan.port;
1863 PF_ACPY(&pnl->rdaddr, &pnl->daddr,
1865 pnl->rdport = pnl->dport;
1867 PF_ACPY(&pnl->rdaddr, &state->gwy.addr,
1869 pnl->rdport = state->gwy.port;
1870 PF_ACPY(&pnl->rsaddr, &pnl->saddr,
1872 pnl->rsport = pnl->sport;
1880 case DIOCSETTIMEOUT: {
1881 struct pfioc_tm *pt = (struct pfioc_tm *)addr;
1884 if (pt->timeout < 0 || pt->timeout >= PFTM_MAX ||
1889 old = pf_default_rule.timeout[pt->timeout];
1890 if (pt->timeout == PFTM_INTERVAL && pt->seconds == 0)
1892 pf_default_rule.timeout[pt->timeout] = pt->seconds;
1893 if (pt->timeout == PFTM_INTERVAL && pt->seconds < old)
1894 wakeup(pf_purge_thread);
1899 case DIOCGETTIMEOUT: {
1900 struct pfioc_tm *pt = (struct pfioc_tm *)addr;
1902 if (pt->timeout < 0 || pt->timeout >= PFTM_MAX) {
1906 pt->seconds = pf_default_rule.timeout[pt->timeout];
1910 case DIOCGETLIMIT: {
1911 struct pfioc_limit *pl = (struct pfioc_limit *)addr;
1913 if (pl->index < 0 || pl->index >= PF_LIMIT_MAX) {
1917 pl->limit = pf_pool_limits[pl->index].limit;
1921 case DIOCSETLIMIT: {
1922 struct pfioc_limit *pl = (struct pfioc_limit *)addr;
1925 if (pl->index < 0 || pl->index >= PF_LIMIT_MAX ||
1926 pf_pool_limits[pl->index].pp == NULL) {
1931 /* XXX Get an API to set limits on the zone/pool */
1932 old_limit = pf_pool_limits[pl->index].limit;
1933 pf_pool_limits[pl->index].limit = pl->limit;
1934 pl->limit = old_limit;
1938 case DIOCSETDEBUG: {
1939 u_int32_t *level = (u_int32_t *)addr;
1941 pf_status.debug = *level;
1945 case DIOCCLRRULECTRS: {
1946 /* obsoleted by DIOCGETRULE with action=PF_GET_CLR_CNTR */
1947 struct pf_ruleset *ruleset = &pf_main_ruleset;
1948 struct pf_rule *rule;
1951 ruleset->rules[PF_RULESET_FILTER].active.ptr, entries) {
1952 rule->evaluations = 0;
1953 rule->packets[0] = rule->packets[1] = 0;
1954 rule->bytes[0] = rule->bytes[1] = 0;
1959 case DIOCGIFSPEED: {
1960 struct pf_ifspeed *psp = (struct pf_ifspeed *)addr;
1961 struct pf_ifspeed ps;
1964 if (psp->ifname[0] != 0) {
1965 /* Can we completely trust user-land? */
1966 strlcpy(ps.ifname, psp->ifname, IFNAMSIZ);
1967 ifp = ifunit(ps.ifname);
1969 psp->baudrate = ifp->if_baudrate;
1977 case DIOCSTARTALTQ: {
1978 struct pf_altq *altq;
1980 /* enable all altq interfaces on active list */
1981 TAILQ_FOREACH(altq, pf_altqs_active, entries) {
1982 if (altq->qname[0] == 0) {
1983 error = pf_enable_altq(altq);
1989 pf_altq_running = 1;
1990 DPFPRINTF(PF_DEBUG_MISC, ("altq: started\n"));
1994 case DIOCSTOPALTQ: {
1995 struct pf_altq *altq;
1997 /* disable all altq interfaces on active list */
1998 TAILQ_FOREACH(altq, pf_altqs_active, entries) {
1999 if (altq->qname[0] == 0) {
2000 error = pf_disable_altq(altq);
2006 pf_altq_running = 0;
2007 DPFPRINTF(PF_DEBUG_MISC, ("altq: stopped\n"));
2012 struct pfioc_altq *pa = (struct pfioc_altq *)addr;
2013 struct pf_altq *altq, *a;
2015 if (pa->ticket != ticket_altqs_inactive) {
2019 altq = pool_get(&pf_altq_pl, PR_NOWAIT);
2024 bcopy(&pa->altq, altq, sizeof(struct pf_altq));
2027 * if this is for a queue, find the discipline and
2028 * copy the necessary fields
2030 if (altq->qname[0] != 0) {
2031 if ((altq->qid = pf_qname2qid(altq->qname)) == 0) {
2033 pool_put(&pf_altq_pl, altq);
2036 TAILQ_FOREACH(a, pf_altqs_inactive, entries) {
2037 if (strncmp(a->ifname, altq->ifname,
2038 IFNAMSIZ) == 0 && a->qname[0] == 0) {
2039 altq->altq_disc = a->altq_disc;
2045 error = altq_add(altq);
2047 pool_put(&pf_altq_pl, altq);
2051 TAILQ_INSERT_TAIL(pf_altqs_inactive, altq, entries);
2052 bcopy(altq, &pa->altq, sizeof(struct pf_altq));
2056 case DIOCGETALTQS: {
2057 struct pfioc_altq *pa = (struct pfioc_altq *)addr;
2058 struct pf_altq *altq;
2061 TAILQ_FOREACH(altq, pf_altqs_active, entries)
2063 pa->ticket = ticket_altqs_active;
2068 struct pfioc_altq *pa = (struct pfioc_altq *)addr;
2069 struct pf_altq *altq;
2072 if (pa->ticket != ticket_altqs_active) {
2077 altq = TAILQ_FIRST(pf_altqs_active);
2078 while ((altq != NULL) && (nr < pa->nr)) {
2079 altq = TAILQ_NEXT(altq, entries);
2086 bcopy(altq, &pa->altq, sizeof(struct pf_altq));
2090 case DIOCCHANGEALTQ:
2091 /* CHANGEALTQ not supported yet! */
2095 case DIOCGETQSTATS: {
2096 struct pfioc_qstats *pq = (struct pfioc_qstats *)addr;
2097 struct pf_altq *altq;
2101 if (pq->ticket != ticket_altqs_active) {
2105 nbytes = pq->nbytes;
2107 altq = TAILQ_FIRST(pf_altqs_active);
2108 while ((altq != NULL) && (nr < pq->nr)) {
2109 altq = TAILQ_NEXT(altq, entries);
2116 error = altq_getqstats(altq, pq->buf, &nbytes);
2118 pq->scheduler = altq->scheduler;
2119 pq->nbytes = nbytes;
2125 case DIOCBEGINADDRS: {
2126 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr;
2128 pf_empty_pool(&pf_pabuf);
2129 pp->ticket = ++ticket_pabuf;
2134 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr;
2136 if (pp->ticket != ticket_pabuf) {
2141 if (pp->af == AF_INET) {
2142 error = EAFNOSUPPORT;
2147 if (pp->af == AF_INET6) {
2148 error = EAFNOSUPPORT;
2152 if (pp->addr.addr.type != PF_ADDR_ADDRMASK &&
2153 pp->addr.addr.type != PF_ADDR_DYNIFTL &&
2154 pp->addr.addr.type != PF_ADDR_TABLE) {
2158 pa = pool_get(&pf_pooladdr_pl, PR_NOWAIT);
2163 bcopy(&pp->addr, pa, sizeof(struct pf_pooladdr));
2164 if (pa->ifname[0]) {
2165 pa->kif = pfi_kif_get(pa->ifname);
2166 if (pa->kif == NULL) {
2167 pool_put(&pf_pooladdr_pl, pa);
2171 pfi_kif_ref(pa->kif, PFI_KIF_REF_RULE);
2173 if (pfi_dynaddr_setup(&pa->addr, pp->af)) {
2174 pfi_dynaddr_remove(&pa->addr);
2175 pfi_kif_unref(pa->kif, PFI_KIF_REF_RULE);
2176 pool_put(&pf_pooladdr_pl, pa);
2180 TAILQ_INSERT_TAIL(&pf_pabuf, pa, entries);
2184 case DIOCGETADDRS: {
2185 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr;
2188 pool = pf_get_pool(pp->anchor, pp->ticket, pp->r_action,
2189 pp->r_num, 0, 1, 0);
2194 TAILQ_FOREACH(pa, &pool->list, entries)
2200 struct pfioc_pooladdr *pp = (struct pfioc_pooladdr *)addr;
2203 pool = pf_get_pool(pp->anchor, pp->ticket, pp->r_action,
2204 pp->r_num, 0, 1, 1);
2209 pa = TAILQ_FIRST(&pool->list);
2210 while ((pa != NULL) && (nr < pp->nr)) {
2211 pa = TAILQ_NEXT(pa, entries);
2218 bcopy(pa, &pp->addr, sizeof(struct pf_pooladdr));
2219 pfi_dynaddr_copyout(&pp->addr.addr);
2220 pf_tbladdr_copyout(&pp->addr.addr);
2221 pf_rtlabel_copyout(&pp->addr.addr);
2225 case DIOCCHANGEADDR: {
2226 struct pfioc_pooladdr *pca = (struct pfioc_pooladdr *)addr;
2227 struct pf_pooladdr *oldpa = NULL, *newpa = NULL;
2228 struct pf_ruleset *ruleset;
2230 if (pca->action < PF_CHANGE_ADD_HEAD ||
2231 pca->action > PF_CHANGE_REMOVE) {
2235 if (pca->addr.addr.type != PF_ADDR_ADDRMASK &&
2236 pca->addr.addr.type != PF_ADDR_DYNIFTL &&
2237 pca->addr.addr.type != PF_ADDR_TABLE) {
2242 ruleset = pf_find_ruleset(pca->anchor);
2243 if (ruleset == NULL) {
2247 pool = pf_get_pool(pca->anchor, pca->ticket, pca->r_action,
2248 pca->r_num, pca->r_last, 1, 1);
2253 if (pca->action != PF_CHANGE_REMOVE) {
2254 newpa = pool_get(&pf_pooladdr_pl, PR_NOWAIT);
2255 if (newpa == NULL) {
2259 bcopy(&pca->addr, newpa, sizeof(struct pf_pooladdr));
2261 if (pca->af == AF_INET) {
2262 pool_put(&pf_pooladdr_pl, newpa);
2263 error = EAFNOSUPPORT;
2268 if (pca->af == AF_INET6) {
2269 pool_put(&pf_pooladdr_pl, newpa);
2270 error = EAFNOSUPPORT;
2274 if (newpa->ifname[0]) {
2275 newpa->kif = pfi_kif_get(newpa->ifname);
2276 if (newpa->kif == NULL) {
2277 pool_put(&pf_pooladdr_pl, newpa);
2281 pfi_kif_ref(newpa->kif, PFI_KIF_REF_RULE);
2284 if (pfi_dynaddr_setup(&newpa->addr, pca->af) ||
2285 pf_tbladdr_setup(ruleset, &newpa->addr)) {
2286 pfi_dynaddr_remove(&newpa->addr);
2287 pfi_kif_unref(newpa->kif, PFI_KIF_REF_RULE);
2288 pool_put(&pf_pooladdr_pl, newpa);
2294 if (pca->action == PF_CHANGE_ADD_HEAD)
2295 oldpa = TAILQ_FIRST(&pool->list);
2296 else if (pca->action == PF_CHANGE_ADD_TAIL)
2297 oldpa = TAILQ_LAST(&pool->list, pf_palist);
2301 oldpa = TAILQ_FIRST(&pool->list);
2302 while ((oldpa != NULL) && (i < pca->nr)) {
2303 oldpa = TAILQ_NEXT(oldpa, entries);
2306 if (oldpa == NULL) {
2312 if (pca->action == PF_CHANGE_REMOVE) {
2313 TAILQ_REMOVE(&pool->list, oldpa, entries);
2314 pfi_dynaddr_remove(&oldpa->addr);
2315 pf_tbladdr_remove(&oldpa->addr);
2316 pfi_kif_unref(oldpa->kif, PFI_KIF_REF_RULE);
2317 pool_put(&pf_pooladdr_pl, oldpa);
2320 TAILQ_INSERT_TAIL(&pool->list, newpa, entries);
2321 else if (pca->action == PF_CHANGE_ADD_HEAD ||
2322 pca->action == PF_CHANGE_ADD_BEFORE)
2323 TAILQ_INSERT_BEFORE(oldpa, newpa, entries);
2325 TAILQ_INSERT_AFTER(&pool->list, oldpa,
2329 pool->cur = TAILQ_FIRST(&pool->list);
2330 PF_ACPY(&pool->counter, &pool->cur->addr.v.a.addr,
2335 case DIOCGETRULESETS: {
2336 struct pfioc_ruleset *pr = (struct pfioc_ruleset *)addr;
2337 struct pf_ruleset *ruleset;
2338 struct pf_anchor *anchor;
2340 pr->path[sizeof(pr->path) - 1] = 0;
2341 if ((ruleset = pf_find_ruleset(pr->path)) == NULL) {
2346 if (ruleset->anchor == NULL) {
2347 /* XXX kludge for pf_main_ruleset */
2348 RB_FOREACH(anchor, pf_anchor_global, &pf_anchors)
2349 if (anchor->parent == NULL)
2352 RB_FOREACH(anchor, pf_anchor_node,
2353 &ruleset->anchor->children)
2359 case DIOCGETRULESET: {
2360 struct pfioc_ruleset *pr = (struct pfioc_ruleset *)addr;
2361 struct pf_ruleset *ruleset;
2362 struct pf_anchor *anchor;
2365 pr->path[sizeof(pr->path) - 1] = 0;
2366 if ((ruleset = pf_find_ruleset(pr->path)) == NULL) {
2371 if (ruleset->anchor == NULL) {
2372 /* XXX kludge for pf_main_ruleset */
2373 RB_FOREACH(anchor, pf_anchor_global, &pf_anchors)
2374 if (anchor->parent == NULL && nr++ == pr->nr) {
2375 strlcpy(pr->name, anchor->name,
2380 RB_FOREACH(anchor, pf_anchor_node,
2381 &ruleset->anchor->children)
2382 if (nr++ == pr->nr) {
2383 strlcpy(pr->name, anchor->name,
2393 case DIOCRCLRTABLES: {
2394 struct pfioc_table *io = (struct pfioc_table *)addr;
2396 if (io->pfrio_esize != 0) {
2400 error = pfr_clr_tables(&io->pfrio_table, &io->pfrio_ndel,
2401 io->pfrio_flags | PFR_FLAG_USERIOCTL);
2405 case DIOCRADDTABLES: {
2406 struct pfioc_table *io = (struct pfioc_table *)addr;
2408 if (io->pfrio_esize != sizeof(struct pfr_table)) {
2412 error = pfr_add_tables(io->pfrio_buffer, io->pfrio_size,
2413 &io->pfrio_nadd, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2417 case DIOCRDELTABLES: {
2418 struct pfioc_table *io = (struct pfioc_table *)addr;
2420 if (io->pfrio_esize != sizeof(struct pfr_table)) {
2424 error = pfr_del_tables(io->pfrio_buffer, io->pfrio_size,
2425 &io->pfrio_ndel, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2429 case DIOCRGETTABLES: {
2430 struct pfioc_table *io = (struct pfioc_table *)addr;
2432 if (io->pfrio_esize != sizeof(struct pfr_table)) {
2436 error = pfr_get_tables(&io->pfrio_table, io->pfrio_buffer,
2437 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2441 case DIOCRGETTSTATS: {
2442 struct pfioc_table *io = (struct pfioc_table *)addr;
2444 if (io->pfrio_esize != sizeof(struct pfr_tstats)) {
2448 error = pfr_get_tstats(&io->pfrio_table, io->pfrio_buffer,
2449 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2453 case DIOCRCLRTSTATS: {
2454 struct pfioc_table *io = (struct pfioc_table *)addr;
2456 if (io->pfrio_esize != sizeof(struct pfr_table)) {
2460 error = pfr_clr_tstats(io->pfrio_buffer, io->pfrio_size,
2461 &io->pfrio_nzero, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2465 case DIOCRSETTFLAGS: {
2466 struct pfioc_table *io = (struct pfioc_table *)addr;
2468 if (io->pfrio_esize != sizeof(struct pfr_table)) {
2472 error = pfr_set_tflags(io->pfrio_buffer, io->pfrio_size,
2473 io->pfrio_setflag, io->pfrio_clrflag, &io->pfrio_nchange,
2474 &io->pfrio_ndel, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2478 case DIOCRCLRADDRS: {
2479 struct pfioc_table *io = (struct pfioc_table *)addr;
2481 if (io->pfrio_esize != 0) {
2485 error = pfr_clr_addrs(&io->pfrio_table, &io->pfrio_ndel,
2486 io->pfrio_flags | PFR_FLAG_USERIOCTL);
2490 case DIOCRADDADDRS: {
2491 struct pfioc_table *io = (struct pfioc_table *)addr;
2493 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
2497 error = pfr_add_addrs(&io->pfrio_table, io->pfrio_buffer,
2498 io->pfrio_size, &io->pfrio_nadd, io->pfrio_flags |
2499 PFR_FLAG_USERIOCTL);
2503 case DIOCRDELADDRS: {
2504 struct pfioc_table *io = (struct pfioc_table *)addr;
2506 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
2510 error = pfr_del_addrs(&io->pfrio_table, io->pfrio_buffer,
2511 io->pfrio_size, &io->pfrio_ndel, io->pfrio_flags |
2512 PFR_FLAG_USERIOCTL);
2516 case DIOCRSETADDRS: {
2517 struct pfioc_table *io = (struct pfioc_table *)addr;
2519 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
2523 error = pfr_set_addrs(&io->pfrio_table, io->pfrio_buffer,
2524 io->pfrio_size, &io->pfrio_size2, &io->pfrio_nadd,
2525 &io->pfrio_ndel, &io->pfrio_nchange, io->pfrio_flags |
2526 PFR_FLAG_USERIOCTL, 0);
2530 case DIOCRGETADDRS: {
2531 struct pfioc_table *io = (struct pfioc_table *)addr;
2533 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
2537 error = pfr_get_addrs(&io->pfrio_table, io->pfrio_buffer,
2538 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2542 case DIOCRGETASTATS: {
2543 struct pfioc_table *io = (struct pfioc_table *)addr;
2545 if (io->pfrio_esize != sizeof(struct pfr_astats)) {
2549 error = pfr_get_astats(&io->pfrio_table, io->pfrio_buffer,
2550 &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2554 case DIOCRCLRASTATS: {
2555 struct pfioc_table *io = (struct pfioc_table *)addr;
2557 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
2561 error = pfr_clr_astats(&io->pfrio_table, io->pfrio_buffer,
2562 io->pfrio_size, &io->pfrio_nzero, io->pfrio_flags |
2563 PFR_FLAG_USERIOCTL);
2567 case DIOCRTSTADDRS: {
2568 struct pfioc_table *io = (struct pfioc_table *)addr;
2570 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
2574 error = pfr_tst_addrs(&io->pfrio_table, io->pfrio_buffer,
2575 io->pfrio_size, &io->pfrio_nmatch, io->pfrio_flags |
2576 PFR_FLAG_USERIOCTL);
2580 case DIOCRINADEFINE: {
2581 struct pfioc_table *io = (struct pfioc_table *)addr;
2583 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
2587 error = pfr_ina_define(&io->pfrio_table, io->pfrio_buffer,
2588 io->pfrio_size, &io->pfrio_nadd, &io->pfrio_naddr,
2589 io->pfrio_ticket, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2594 struct pf_osfp_ioctl *io = (struct pf_osfp_ioctl *)addr;
2595 error = pf_osfp_add(io);
2600 struct pf_osfp_ioctl *io = (struct pf_osfp_ioctl *)addr;
2601 error = pf_osfp_get(io);
2606 struct pfioc_trans *io = (struct pfioc_trans *)addr;
2607 struct pfioc_trans_e *ioe;
2608 struct pfr_table *table;
2611 if (io->esize != sizeof(*ioe)) {
2615 ioe = (struct pfioc_trans_e *)kmalloc(sizeof(*ioe),
2617 table = (struct pfr_table *)kmalloc(sizeof(*table),
2619 for (i = 0; i < io->size; i++) {
2620 if (copyin(io->array+i, ioe, sizeof(*ioe))) {
2621 kfree(table, M_TEMP);
2626 switch (ioe->rs_num) {
2628 case PF_RULESET_ALTQ:
2629 if (ioe->anchor[0]) {
2630 kfree(table, M_TEMP);
2635 if ((error = pf_begin_altq(&ioe->ticket))) {
2636 kfree(table, M_TEMP);
2642 case PF_RULESET_TABLE:
2643 bzero(table, sizeof(*table));
2644 strlcpy(table->pfrt_anchor, ioe->anchor,
2645 sizeof(table->pfrt_anchor));
2646 if ((error = pfr_ina_begin(table,
2647 &ioe->ticket, NULL, 0))) {
2648 kfree(table, M_TEMP);
2654 if ((error = pf_begin_rules(&ioe->ticket,
2655 ioe->rs_num, ioe->anchor))) {
2656 kfree(table, M_TEMP);
2662 if (copyout(ioe, io->array+i, sizeof(io->array[i]))) {
2663 kfree(table, M_TEMP);
2669 kfree(table, M_TEMP);
2674 case DIOCXROLLBACK: {
2675 struct pfioc_trans *io = (struct pfioc_trans *)addr;
2676 struct pfioc_trans_e *ioe;
2677 struct pfr_table *table;
2680 if (io->esize != sizeof(*ioe)) {
2684 ioe = (struct pfioc_trans_e *)kmalloc(sizeof(*ioe),
2686 table = (struct pfr_table *)kmalloc(sizeof(*table),
2688 for (i = 0; i < io->size; i++) {
2689 if (copyin(io->array+i, ioe, sizeof(*ioe))) {
2690 kfree(table, M_TEMP);
2695 switch (ioe->rs_num) {
2697 case PF_RULESET_ALTQ:
2698 if (ioe->anchor[0]) {
2699 kfree(table, M_TEMP);
2704 if ((error = pf_rollback_altq(ioe->ticket))) {
2705 kfree(table, M_TEMP);
2707 goto fail; /* really bad */
2711 case PF_RULESET_TABLE:
2712 bzero(table, sizeof(*table));
2713 strlcpy(table->pfrt_anchor, ioe->anchor,
2714 sizeof(table->pfrt_anchor));
2715 if ((error = pfr_ina_rollback(table,
2716 ioe->ticket, NULL, 0))) {
2717 kfree(table, M_TEMP);
2719 goto fail; /* really bad */
2723 if ((error = pf_rollback_rules(ioe->ticket,
2724 ioe->rs_num, ioe->anchor))) {
2725 kfree(table, M_TEMP);
2727 goto fail; /* really bad */
2732 kfree(table, M_TEMP);
2738 struct pfioc_trans *io = (struct pfioc_trans *)addr;
2739 struct pfioc_trans_e *ioe;
2740 struct pfr_table *table;
2741 struct pf_ruleset *rs;
2744 if (io->esize != sizeof(*ioe)) {
2748 ioe = (struct pfioc_trans_e *)kmalloc(sizeof(*ioe),
2750 table = (struct pfr_table *)kmalloc(sizeof(*table),
2752 /* first makes sure everything will succeed */
2753 for (i = 0; i < io->size; i++) {
2754 if (copyin(io->array+i, ioe, sizeof(*ioe))) {
2755 kfree(table, M_TEMP);
2760 switch (ioe->rs_num) {
2762 case PF_RULESET_ALTQ:
2763 if (ioe->anchor[0]) {
2764 kfree(table, M_TEMP);
2769 if (!altqs_inactive_open || ioe->ticket !=
2770 ticket_altqs_inactive) {
2771 kfree(table, M_TEMP);
2778 case PF_RULESET_TABLE:
2779 rs = pf_find_ruleset(ioe->anchor);
2780 if (rs == NULL || !rs->topen || ioe->ticket !=
2782 kfree(table, M_TEMP);
2789 if (ioe->rs_num < 0 || ioe->rs_num >=
2791 kfree(table, M_TEMP);
2796 rs = pf_find_ruleset(ioe->anchor);
2798 !rs->rules[ioe->rs_num].inactive.open ||
2799 rs->rules[ioe->rs_num].inactive.ticket !=
2801 kfree(table, M_TEMP);
2809 /* now do the commit - no errors should happen here */
2810 for (i = 0; i < io->size; i++) {
2811 if (copyin(io->array+i, ioe, sizeof(*ioe))) {
2812 kfree(table, M_TEMP);
2817 switch (ioe->rs_num) {
2819 case PF_RULESET_ALTQ:
2820 if ((error = pf_commit_altq(ioe->ticket))) {
2821 kfree(table, M_TEMP);
2823 goto fail; /* really bad */
2827 case PF_RULESET_TABLE:
2828 bzero(table, sizeof(*table));
2829 strlcpy(table->pfrt_anchor, ioe->anchor,
2830 sizeof(table->pfrt_anchor));
2831 if ((error = pfr_ina_commit(table, ioe->ticket,
2833 kfree(table, M_TEMP);
2835 goto fail; /* really bad */
2839 if ((error = pf_commit_rules(ioe->ticket,
2840 ioe->rs_num, ioe->anchor))) {
2841 kfree(table, M_TEMP);
2843 goto fail; /* really bad */
2848 kfree(table, M_TEMP);
2853 case DIOCGETSRCNODES: {
2854 struct pfioc_src_nodes *psn = (struct pfioc_src_nodes *)addr;
2855 struct pf_src_node *n, *p, *pstore;
2857 int space = psn->psn_len;
2860 RB_FOREACH(n, pf_src_tree, &tree_src_tracking)
2862 psn->psn_len = sizeof(struct pf_src_node) * nr;
2866 pstore = kmalloc(sizeof(*pstore), M_TEMP, M_WAITOK);
2868 p = psn->psn_src_nodes;
2869 RB_FOREACH(n, pf_src_tree, &tree_src_tracking) {
2870 int secs = time_second, diff;
2872 if ((nr + 1) * sizeof(*p) > (unsigned)psn->psn_len)
2875 bcopy(n, pstore, sizeof(*pstore));
2876 if (n->rule.ptr != NULL)
2877 pstore->rule.nr = n->rule.ptr->nr;
2878 pstore->creation = secs - pstore->creation;
2879 if (pstore->expire > secs)
2880 pstore->expire -= secs;
2884 /* adjust the connection rate estimate */
2885 diff = secs - n->conn_rate.last;
2886 if (diff >= n->conn_rate.seconds)
2887 pstore->conn_rate.count = 0;
2889 pstore->conn_rate.count -=
2890 n->conn_rate.count * diff /
2891 n->conn_rate.seconds;
2893 error = copyout(pstore, p, sizeof(*p));
2895 kfree(pstore, M_TEMP);
2901 psn->psn_len = sizeof(struct pf_src_node) * nr;
2903 kfree(pstore, M_TEMP);
2907 case DIOCCLRSRCNODES: {
2908 struct pf_src_node *n;
2909 struct pf_state *state;
2911 RB_FOREACH(state, pf_state_tree_id, &tree_id) {
2912 state->src_node = NULL;
2913 state->nat_src_node = NULL;
2915 RB_FOREACH(n, pf_src_tree, &tree_src_tracking) {
2919 pf_purge_expired_src_nodes(1);
2920 pf_status.src_nodes = 0;
2924 case DIOCKILLSRCNODES: {
2925 struct pf_src_node *sn;
2927 struct pfioc_src_node_kill *psnk = \
2928 (struct pfioc_src_node_kill *) addr;
2931 RB_FOREACH(sn, pf_src_tree, &tree_src_tracking) {
2932 if (PF_MATCHA(psnk->psnk_src.neg, \
2933 &psnk->psnk_src.addr.v.a.addr, \
2934 &psnk->psnk_src.addr.v.a.mask, \
2935 &sn->addr, sn->af) &&
2936 PF_MATCHA(psnk->psnk_dst.neg, \
2937 &psnk->psnk_dst.addr.v.a.addr, \
2938 &psnk->psnk_dst.addr.v.a.mask, \
2939 &sn->raddr, sn->af)) {
2940 /* Handle state to src_node linkage */
2941 if (sn->states != 0) {
2942 RB_FOREACH(s, pf_state_tree_id,
2944 if (s->src_node == sn)
2946 if (s->nat_src_node == sn)
2947 s->nat_src_node = NULL;
2957 pf_purge_expired_src_nodes(1);
2959 psnk->psnk_af = killed;
2963 case DIOCSETHOSTID: {
2964 u_int32_t *hostid = (u_int32_t *)addr;
2967 pf_status.hostid = karc4random();
2969 pf_status.hostid = *hostid;
2979 case DIOCIGETIFACES: {
2980 struct pfioc_iface *io = (struct pfioc_iface *)addr;
2982 if (io->pfiio_esize != sizeof(struct pfi_kif)) {
2986 error = pfi_get_ifaces(io->pfiio_name, io->pfiio_buffer,
2991 case DIOCSETIFFLAG: {
2992 struct pfioc_iface *io = (struct pfioc_iface *)addr;
2994 error = pfi_set_flags(io->pfiio_name, io->pfiio_flags);
2998 case DIOCCLRIFFLAG: {
2999 struct pfioc_iface *io = (struct pfioc_iface *)addr;
3001 error = pfi_clear_flags(io->pfiio_name, io->pfiio_flags);
3014 * XXX - Check for version missmatch!!!
3017 pf_clear_states(void)
3019 struct pf_state *state;
3021 RB_FOREACH(state, pf_state_tree_id, &tree_id) {
3022 state->timeout = PFTM_PURGE;
3024 /* don't send out individual delete messages */
3025 state->sync_flags = PFSTATE_NOSYNC;
3027 pf_unlink_state(state);
3029 pf_status.states = 0;
3032 * XXX This is called on module unload, we do not want to sync that over? */
3034 pfsync_clear_states(pf_status.hostid, psk->psk_ifname);
3039 pf_clear_tables(void)
3041 struct pfioc_table io;
3044 bzero(&io, sizeof(io));
3046 error = pfr_clr_tables(&io.pfrio_table, &io.pfrio_ndel,
3053 pf_clear_srcnodes(void)
3055 struct pf_src_node *n;
3056 struct pf_state *state;
3058 RB_FOREACH(state, pf_state_tree_id, &tree_id) {
3059 state->src_node = NULL;
3060 state->nat_src_node = NULL;
3062 RB_FOREACH(n, pf_src_tree, &tree_src_tracking) {
3066 pf_purge_expired_src_nodes(0);
3067 pf_status.src_nodes = 0;
3070 * XXX - Check for version missmatch!!!
3074 * Duplicate pfctl -Fa operation to get rid of as much as we can.
3083 pf_status.running = 0;
3085 if ((error = pf_begin_rules(&t[0], PF_RULESET_SCRUB, &nn)) != 0) {
3086 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: SCRUB\n"));
3089 if ((error = pf_begin_rules(&t[1], PF_RULESET_FILTER, &nn)) != 0) {
3090 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: FILTER\n"));
3091 break; /* XXX: rollback? */
3093 if ((error = pf_begin_rules(&t[2], PF_RULESET_NAT, &nn)) != 0) {
3094 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: NAT\n"));
3095 break; /* XXX: rollback? */
3097 if ((error = pf_begin_rules(&t[3], PF_RULESET_BINAT, &nn))
3099 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: BINAT\n"));
3100 break; /* XXX: rollback? */
3102 if ((error = pf_begin_rules(&t[4], PF_RULESET_RDR, &nn))
3104 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: RDR\n"));
3105 break; /* XXX: rollback? */
3108 /* XXX: these should always succeed here */
3109 pf_commit_rules(t[0], PF_RULESET_SCRUB, &nn);
3110 pf_commit_rules(t[1], PF_RULESET_FILTER, &nn);
3111 pf_commit_rules(t[2], PF_RULESET_NAT, &nn);
3112 pf_commit_rules(t[3], PF_RULESET_BINAT, &nn);
3113 pf_commit_rules(t[4], PF_RULESET_RDR, &nn);
3115 if ((error = pf_clear_tables()) != 0)
3119 if ((error = pf_begin_altq(&t[0])) != 0) {
3120 DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: ALTQ\n"));
3123 pf_commit_altq(t[0]);
3128 pf_clear_srcnodes();
3130 /* status does not use malloced mem so no need to cleanup */
3131 /* fingerprints and interfaces have their own cleanup code */
3138 pf_check_in(void *arg, struct mbuf **m, struct ifnet *ifp, int dir)
3141 * DragonFly's version of pf uses FreeBSD's native host byte ordering
3142 * for ip_len/ip_off. This is why we don't have to change byte order
3143 * like the FreeBSD-5 version does.
3147 chk = pf_test(PF_IN, ifp, m, NULL, NULL);
3156 pf_check_out(void *arg, struct mbuf **m, struct ifnet *ifp, int dir)
3159 * DragonFly's version of pf uses FreeBSD's native host byte ordering
3160 * for ip_len/ip_off. This is why we don't have to change byte order
3161 * like the FreeBSD-5 version does.
3165 /* We need a proper CSUM befor we start (s. OpenBSD ip_output) */
3166 if ((*m)->m_pkthdr.csum_flags & CSUM_DELAY_DATA) {
3167 in_delayed_cksum(*m);
3168 (*m)->m_pkthdr.csum_flags &= ~CSUM_DELAY_DATA;
3170 chk = pf_test(PF_OUT, ifp, m, NULL, NULL);
3180 pf_check6_in(void *arg, struct mbuf **m, struct ifnet *ifp, int dir)
3183 * IPv6 is not affected by ip_len/ip_off byte order changes.
3187 chk = pf_test6(PF_IN, ifp, m, NULL, NULL);
3196 pf_check6_out(void *arg, struct mbuf **m, struct ifnet *ifp, int dir)
3199 * IPv6 is not affected by ip_len/ip_off byte order changes.
3203 /* We need a proper CSUM befor we start (s. OpenBSD ip_output) */
3204 if ((*m)->m_pkthdr.csum_flags & CSUM_DELAY_DATA) {
3205 in_delayed_cksum(*m);
3206 (*m)->m_pkthdr.csum_flags &= ~CSUM_DELAY_DATA;
3208 chk = pf_test6(PF_OUT, ifp, m, NULL, NULL);
3220 struct pfil_head *pfh_inet;
3222 struct pfil_head *pfh_inet6;
3228 pfh_inet = pfil_head_get(PFIL_TYPE_AF, AF_INET);
3229 if (pfh_inet == NULL)
3231 pfil_add_hook(pf_check_in, NULL, PFIL_IN, pfh_inet);
3232 pfil_add_hook(pf_check_out, NULL, PFIL_OUT, pfh_inet);
3234 pfh_inet6 = pfil_head_get(PFIL_TYPE_AF, AF_INET6);
3235 if (pfh_inet6 == NULL) {
3236 pfil_remove_hook(pf_check_in, NULL, PFIL_IN, pfh_inet);
3237 pfil_remove_hook(pf_check_out, NULL, PFIL_OUT, pfh_inet);
3240 pfil_add_hook(pf_check6_in, NULL, PFIL_IN, pfh_inet6);
3241 pfil_add_hook(pf_check6_out, NULL, PFIL_OUT, pfh_inet6);
3251 struct pfil_head *pfh_inet;
3253 struct pfil_head *pfh_inet6;
3256 if (pf_pfil_hooked == 0)
3259 pfh_inet = pfil_head_get(PFIL_TYPE_AF, AF_INET);
3260 if (pfh_inet == NULL)
3262 pfil_remove_hook(pf_check_in, NULL, PFIL_IN, pfh_inet);
3263 pfil_remove_hook(pf_check_out, NULL, PFIL_OUT, pfh_inet);
3265 pfh_inet6 = pfil_head_get(PFIL_TYPE_AF, AF_INET6);
3266 if (pfh_inet6 == NULL)
3268 pfil_remove_hook(pf_check6_in, NULL, PFIL_IN, pfh_inet6);
3269 pfil_remove_hook(pf_check6_out, NULL, PFIL_OUT, pfh_inet6);
3283 kprintf("pf_load() p1\n"); /*XXX*/
3284 pf_dev = make_dev(&pf_ops, 0, 0, 0, 0600, PF_NAME);
3285 kprintf("pf_load() p2\n"); /*XXX*/
3287 kprintf("pf_load() p3\n"); /*XXX*/
3289 dev_ops_remove_all(&pf_ops);
3293 lockinit(&pf_consistency_lock, "pfconslck", 0, LK_CANRECURSE);
3294 kprintf("pf_load() p4\n"); /*XXX*/
3303 pf_status.running = 0;
3304 error = dehook_pf();
3307 * Should not happen!
3308 * XXX Due to error code ESRCH, kldunload will show
3309 * a message like 'No such process'.
3311 kprintf("pfil unregistration fail\n");
3316 while (pf_end_threads < 2) {
3317 wakeup_one(pf_purge_thread);
3318 lksleep(pf_purge_thread, &pf_task_lck, 0, "pftmo", hz);
3325 dev_ops_remove_all(&pf_ops);
3326 lockuninit(&pf_consistency_lock);
3332 pf_modevent(module_t mod, int type, void *data)
3342 error = pf_unload();
3351 static moduledata_t pf_mod = {
3356 DECLARE_MODULE(pf, pf_mod, SI_SUB_PSEUDO, SI_ORDER_FIRST);
3357 MODULE_VERSION(pf, PF_MODVER);