]> CyberLeo.Net >> Repos - FreeBSD/stable/10.git/blob - sys/netpfil/pf/pf_ioctl.c
Merge several fixlets from head:
[FreeBSD/stable/10.git] / sys / netpfil / pf / pf_ioctl.c
1 /*-
2  * Copyright (c) 2001 Daniel Hartmeier
3  * Copyright (c) 2002,2003 Henning Brauer
4  * Copyright (c) 2012 Gleb Smirnoff <glebius@FreeBSD.org>
5  * All rights reserved.
6  *
7  * Redistribution and use in source and binary forms, with or without
8  * modification, are permitted provided that the following conditions
9  * are met:
10  *
11  *    - Redistributions of source code must retain the above copyright
12  *      notice, this list of conditions and the following disclaimer.
13  *    - Redistributions in binary form must reproduce the above
14  *      copyright notice, this list of conditions and the following
15  *      disclaimer in the documentation and/or other materials provided
16  *      with the distribution.
17  *
18  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
19  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
20  * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
21  * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
22  * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
23  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
24  * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
25  * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
26  * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
28  * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29  * POSSIBILITY OF SUCH DAMAGE.
30  *
31  * Effort sponsored in part by the Defense Advanced Research Projects
32  * Agency (DARPA) and Air Force Research Laboratory, Air Force
33  * Materiel Command, USAF, under agreement number F30602-01-2-0537.
34  *
35  *      $OpenBSD: pf_ioctl.c,v 1.213 2009/02/15 21:46:12 mbalmer Exp $
36  */
37
38 #include <sys/cdefs.h>
39 __FBSDID("$FreeBSD$");
40
41 #include "opt_inet.h"
42 #include "opt_inet6.h"
43 #include "opt_bpf.h"
44 #include "opt_pf.h"
45
46 #include <sys/param.h>
47 #include <sys/bus.h>
48 #include <sys/conf.h>
49 #include <sys/endian.h>
50 #include <sys/fcntl.h>
51 #include <sys/filio.h>
52 #include <sys/interrupt.h>
53 #include <sys/jail.h>
54 #include <sys/kernel.h>
55 #include <sys/kthread.h>
56 #include <sys/mbuf.h>
57 #include <sys/module.h>
58 #include <sys/proc.h>
59 #include <sys/smp.h>
60 #include <sys/socket.h>
61 #include <sys/sysctl.h>
62 #include <sys/md5.h>
63 #include <sys/ucred.h>
64
65 #include <net/if.h>
66 #include <net/route.h>
67 #include <net/pfil.h>
68 #include <net/pfvar.h>
69 #include <net/if_pfsync.h>
70 #include <net/if_pflog.h>
71
72 #include <netinet/in.h>
73 #include <netinet/ip.h>
74 #include <netinet/ip_var.h>
75 #include <netinet/ip_icmp.h>
76
77 #ifdef INET6
78 #include <netinet/ip6.h>
79 #endif /* INET6 */
80
81 #ifdef ALTQ
82 #include <altq/altq.h>
83 #endif
84
85 static int               pfattach(void);
86 static struct pf_pool   *pf_get_pool(char *, u_int32_t, u_int8_t, u_int32_t,
87                             u_int8_t, u_int8_t, u_int8_t);
88
89 static void              pf_mv_pool(struct pf_palist *, struct pf_palist *);
90 static void              pf_empty_pool(struct pf_palist *);
91 static int               pfioctl(struct cdev *, u_long, caddr_t, int,
92                             struct thread *);
93 #ifdef ALTQ
94 static int               pf_begin_altq(u_int32_t *);
95 static int               pf_rollback_altq(u_int32_t);
96 static int               pf_commit_altq(u_int32_t);
97 static int               pf_enable_altq(struct pf_altq *);
98 static int               pf_disable_altq(struct pf_altq *);
99 static u_int32_t         pf_qname2qid(char *);
100 static void              pf_qid_unref(u_int32_t);
101 #endif /* ALTQ */
102 static int               pf_begin_rules(u_int32_t *, int, const char *);
103 static int               pf_rollback_rules(u_int32_t, int, char *);
104 static int               pf_setup_pfsync_matching(struct pf_ruleset *);
105 static void              pf_hash_rule(MD5_CTX *, struct pf_rule *);
106 static void              pf_hash_rule_addr(MD5_CTX *, struct pf_rule_addr *);
107 static int               pf_commit_rules(u_int32_t, int, char *);
108 static int               pf_addr_setup(struct pf_ruleset *,
109                             struct pf_addr_wrap *, sa_family_t);
110 static void              pf_addr_copyout(struct pf_addr_wrap *);
111
112 VNET_DEFINE(struct pf_rule,     pf_default_rule);
113
114 #ifdef ALTQ
115 static VNET_DEFINE(int,         pf_altq_running);
116 #define V_pf_altq_running       VNET(pf_altq_running)
117 #endif
118
119 #define TAGID_MAX        50000
120 struct pf_tagname {
121         TAILQ_ENTRY(pf_tagname) entries;
122         char                    name[PF_TAG_NAME_SIZE];
123         uint16_t                tag;
124         int                     ref;
125 };
126
127 TAILQ_HEAD(pf_tags, pf_tagname);
128 #define V_pf_tags               VNET(pf_tags)
129 VNET_DEFINE(struct pf_tags, pf_tags);
130 #define V_pf_qids               VNET(pf_qids)
131 VNET_DEFINE(struct pf_tags, pf_qids);
132 static MALLOC_DEFINE(M_PFTAG, "pf_tag", "pf(4) tag names");
133 static MALLOC_DEFINE(M_PFALTQ, "pf_altq", "pf(4) altq configuration db");
134 static MALLOC_DEFINE(M_PFRULE, "pf_rule", "pf(4) rules");
135
136 #if (PF_QNAME_SIZE != PF_TAG_NAME_SIZE)
137 #error PF_QNAME_SIZE must be equal to PF_TAG_NAME_SIZE
138 #endif
139
140 static u_int16_t         tagname2tag(struct pf_tags *, char *);
141 static u_int16_t         pf_tagname2tag(char *);
142 static void              tag_unref(struct pf_tags *, u_int16_t);
143
144 #define DPFPRINTF(n, x) if (V_pf_status.debug >= (n)) printf x
145
146 struct cdev *pf_dev;
147
148 /*
149  * XXX - These are new and need to be checked when moveing to a new version
150  */
151 static void              pf_clear_states(void);
152 static int               pf_clear_tables(void);
153 static void              pf_clear_srcnodes(struct pf_src_node *);
154 static void              pf_tbladdr_copyout(struct pf_addr_wrap *);
155
156 /*
157  * Wrapper functions for pfil(9) hooks
158  */
159 #ifdef INET
160 static int pf_check_in(void *arg, struct mbuf **m, struct ifnet *ifp,
161     int dir, struct inpcb *inp);
162 static int pf_check_out(void *arg, struct mbuf **m, struct ifnet *ifp,
163     int dir, struct inpcb *inp);
164 #endif
165 #ifdef INET6
166 static int pf_check6_in(void *arg, struct mbuf **m, struct ifnet *ifp,
167     int dir, struct inpcb *inp);
168 static int pf_check6_out(void *arg, struct mbuf **m, struct ifnet *ifp,
169     int dir, struct inpcb *inp);
170 #endif
171
172 static int              hook_pf(void);
173 static int              dehook_pf(void);
174 static int              shutdown_pf(void);
175 static int              pf_load(void);
176 static int              pf_unload(void);
177
178 static struct cdevsw pf_cdevsw = {
179         .d_ioctl =      pfioctl,
180         .d_name =       PF_NAME,
181         .d_version =    D_VERSION,
182 };
183
184 static volatile VNET_DEFINE(int, pf_pfil_hooked);
185 #define V_pf_pfil_hooked        VNET(pf_pfil_hooked)
186 VNET_DEFINE(int,                pf_end_threads);
187
188 struct rwlock                   pf_rules_lock;
189
190 /* pfsync */
191 pfsync_state_import_t           *pfsync_state_import_ptr = NULL;
192 pfsync_insert_state_t           *pfsync_insert_state_ptr = NULL;
193 pfsync_update_state_t           *pfsync_update_state_ptr = NULL;
194 pfsync_delete_state_t           *pfsync_delete_state_ptr = NULL;
195 pfsync_clear_states_t           *pfsync_clear_states_ptr = NULL;
196 pfsync_defer_t                  *pfsync_defer_ptr = NULL;
197 /* pflog */
198 pflog_packet_t                  *pflog_packet_ptr = NULL;
199
200 static int
201 pfattach(void)
202 {
203         u_int32_t *my_timeout = V_pf_default_rule.timeout;
204         int error;
205
206         pf_initialize();
207         pfr_initialize();
208         pfi_initialize();
209         pf_normalize_init();
210
211         V_pf_limits[PF_LIMIT_STATES].limit = PFSTATE_HIWAT;
212         V_pf_limits[PF_LIMIT_SRC_NODES].limit = PFSNODE_HIWAT;
213
214         RB_INIT(&V_pf_anchors);
215         pf_init_ruleset(&pf_main_ruleset);
216
217         /* default rule should never be garbage collected */
218         V_pf_default_rule.entries.tqe_prev = &V_pf_default_rule.entries.tqe_next;
219 #ifdef PF_DEFAULT_TO_DROP
220         V_pf_default_rule.action = PF_DROP;
221 #else
222         V_pf_default_rule.action = PF_PASS;
223 #endif
224         V_pf_default_rule.nr = -1;
225         V_pf_default_rule.rtableid = -1;
226
227         /* initialize default timeouts */
228         my_timeout[PFTM_TCP_FIRST_PACKET] = PFTM_TCP_FIRST_PACKET_VAL;
229         my_timeout[PFTM_TCP_OPENING] = PFTM_TCP_OPENING_VAL;
230         my_timeout[PFTM_TCP_ESTABLISHED] = PFTM_TCP_ESTABLISHED_VAL;
231         my_timeout[PFTM_TCP_CLOSING] = PFTM_TCP_CLOSING_VAL;
232         my_timeout[PFTM_TCP_FIN_WAIT] = PFTM_TCP_FIN_WAIT_VAL;
233         my_timeout[PFTM_TCP_CLOSED] = PFTM_TCP_CLOSED_VAL;
234         my_timeout[PFTM_UDP_FIRST_PACKET] = PFTM_UDP_FIRST_PACKET_VAL;
235         my_timeout[PFTM_UDP_SINGLE] = PFTM_UDP_SINGLE_VAL;
236         my_timeout[PFTM_UDP_MULTIPLE] = PFTM_UDP_MULTIPLE_VAL;
237         my_timeout[PFTM_ICMP_FIRST_PACKET] = PFTM_ICMP_FIRST_PACKET_VAL;
238         my_timeout[PFTM_ICMP_ERROR_REPLY] = PFTM_ICMP_ERROR_REPLY_VAL;
239         my_timeout[PFTM_OTHER_FIRST_PACKET] = PFTM_OTHER_FIRST_PACKET_VAL;
240         my_timeout[PFTM_OTHER_SINGLE] = PFTM_OTHER_SINGLE_VAL;
241         my_timeout[PFTM_OTHER_MULTIPLE] = PFTM_OTHER_MULTIPLE_VAL;
242         my_timeout[PFTM_FRAG] = PFTM_FRAG_VAL;
243         my_timeout[PFTM_INTERVAL] = PFTM_INTERVAL_VAL;
244         my_timeout[PFTM_SRC_NODE] = PFTM_SRC_NODE_VAL;
245         my_timeout[PFTM_TS_DIFF] = PFTM_TS_DIFF_VAL;
246         my_timeout[PFTM_ADAPTIVE_START] = PFSTATE_ADAPT_START;
247         my_timeout[PFTM_ADAPTIVE_END] = PFSTATE_ADAPT_END;
248
249         bzero(&V_pf_status, sizeof(V_pf_status));
250         V_pf_status.debug = PF_DEBUG_URGENT;
251
252         V_pf_pfil_hooked = 0;
253
254         /* XXX do our best to avoid a conflict */
255         V_pf_status.hostid = arc4random();
256
257         if ((error = kproc_create(pf_purge_thread, curvnet, NULL, 0, 0,
258             "pf purge")) != 0)
259                 /* XXXGL: leaked all above. */
260                 return (error);
261         if ((error = swi_add(NULL, "pf send", pf_intr, curvnet, SWI_NET,
262             INTR_MPSAFE, &V_pf_swi_cookie)) != 0)
263                 /* XXXGL: leaked all above. */
264                 return (error);
265
266         return (0);
267 }
268
269 static struct pf_pool *
270 pf_get_pool(char *anchor, u_int32_t ticket, u_int8_t rule_action,
271     u_int32_t rule_number, u_int8_t r_last, u_int8_t active,
272     u_int8_t check_ticket)
273 {
274         struct pf_ruleset       *ruleset;
275         struct pf_rule          *rule;
276         int                      rs_num;
277
278         ruleset = pf_find_ruleset(anchor);
279         if (ruleset == NULL)
280                 return (NULL);
281         rs_num = pf_get_ruleset_number(rule_action);
282         if (rs_num >= PF_RULESET_MAX)
283                 return (NULL);
284         if (active) {
285                 if (check_ticket && ticket !=
286                     ruleset->rules[rs_num].active.ticket)
287                         return (NULL);
288                 if (r_last)
289                         rule = TAILQ_LAST(ruleset->rules[rs_num].active.ptr,
290                             pf_rulequeue);
291                 else
292                         rule = TAILQ_FIRST(ruleset->rules[rs_num].active.ptr);
293         } else {
294                 if (check_ticket && ticket !=
295                     ruleset->rules[rs_num].inactive.ticket)
296                         return (NULL);
297                 if (r_last)
298                         rule = TAILQ_LAST(ruleset->rules[rs_num].inactive.ptr,
299                             pf_rulequeue);
300                 else
301                         rule = TAILQ_FIRST(ruleset->rules[rs_num].inactive.ptr);
302         }
303         if (!r_last) {
304                 while ((rule != NULL) && (rule->nr != rule_number))
305                         rule = TAILQ_NEXT(rule, entries);
306         }
307         if (rule == NULL)
308                 return (NULL);
309
310         return (&rule->rpool);
311 }
312
313 static void
314 pf_mv_pool(struct pf_palist *poola, struct pf_palist *poolb)
315 {
316         struct pf_pooladdr      *mv_pool_pa;
317
318         while ((mv_pool_pa = TAILQ_FIRST(poola)) != NULL) {
319                 TAILQ_REMOVE(poola, mv_pool_pa, entries);
320                 TAILQ_INSERT_TAIL(poolb, mv_pool_pa, entries);
321         }
322 }
323
324 static void
325 pf_empty_pool(struct pf_palist *poola)
326 {
327         struct pf_pooladdr *pa;
328
329         while ((pa = TAILQ_FIRST(poola)) != NULL) {
330                 switch (pa->addr.type) {
331                 case PF_ADDR_DYNIFTL:
332                         pfi_dynaddr_remove(pa->addr.p.dyn);
333                         break;
334                 case PF_ADDR_TABLE:
335                         pfr_detach_table(pa->addr.p.tbl);
336                         break;
337                 }
338                 if (pa->kif)
339                         pfi_kif_unref(pa->kif);
340                 TAILQ_REMOVE(poola, pa, entries);
341                 free(pa, M_PFRULE);
342         }
343 }
344
345 static void
346 pf_unlink_rule(struct pf_rulequeue *rulequeue, struct pf_rule *rule)
347 {
348
349         PF_RULES_WASSERT();
350
351         TAILQ_REMOVE(rulequeue, rule, entries);
352
353         PF_UNLNKDRULES_LOCK();
354         rule->rule_flag |= PFRULE_REFS;
355         TAILQ_INSERT_TAIL(&V_pf_unlinked_rules, rule, entries);
356         PF_UNLNKDRULES_UNLOCK();
357 }
358
359 void
360 pf_free_rule(struct pf_rule *rule)
361 {
362
363         PF_RULES_WASSERT();
364
365         if (rule->tag)
366                 tag_unref(&V_pf_tags, rule->tag);
367         if (rule->match_tag)
368                 tag_unref(&V_pf_tags, rule->match_tag);
369 #ifdef ALTQ
370         if (rule->pqid != rule->qid)
371                 pf_qid_unref(rule->pqid);
372         pf_qid_unref(rule->qid);
373 #endif
374         switch (rule->src.addr.type) {
375         case PF_ADDR_DYNIFTL:
376                 pfi_dynaddr_remove(rule->src.addr.p.dyn);
377                 break;
378         case PF_ADDR_TABLE:
379                 pfr_detach_table(rule->src.addr.p.tbl);
380                 break;
381         }
382         switch (rule->dst.addr.type) {
383         case PF_ADDR_DYNIFTL:
384                 pfi_dynaddr_remove(rule->dst.addr.p.dyn);
385                 break;
386         case PF_ADDR_TABLE:
387                 pfr_detach_table(rule->dst.addr.p.tbl);
388                 break;
389         }
390         if (rule->overload_tbl)
391                 pfr_detach_table(rule->overload_tbl);
392         if (rule->kif)
393                 pfi_kif_unref(rule->kif);
394         pf_anchor_remove(rule);
395         pf_empty_pool(&rule->rpool.list);
396         free(rule, M_PFRULE);
397 }
398
399 static u_int16_t
400 tagname2tag(struct pf_tags *head, char *tagname)
401 {
402         struct pf_tagname       *tag, *p = NULL;
403         u_int16_t                new_tagid = 1;
404
405         PF_RULES_WASSERT();
406
407         TAILQ_FOREACH(tag, head, entries)
408                 if (strcmp(tagname, tag->name) == 0) {
409                         tag->ref++;
410                         return (tag->tag);
411                 }
412
413         /*
414          * to avoid fragmentation, we do a linear search from the beginning
415          * and take the first free slot we find. if there is none or the list
416          * is empty, append a new entry at the end.
417          */
418
419         /* new entry */
420         if (!TAILQ_EMPTY(head))
421                 for (p = TAILQ_FIRST(head); p != NULL &&
422                     p->tag == new_tagid; p = TAILQ_NEXT(p, entries))
423                         new_tagid = p->tag + 1;
424
425         if (new_tagid > TAGID_MAX)
426                 return (0);
427
428         /* allocate and fill new struct pf_tagname */
429         tag = malloc(sizeof(*tag), M_PFTAG, M_NOWAIT|M_ZERO);
430         if (tag == NULL)
431                 return (0);
432         strlcpy(tag->name, tagname, sizeof(tag->name));
433         tag->tag = new_tagid;
434         tag->ref++;
435
436         if (p != NULL)  /* insert new entry before p */
437                 TAILQ_INSERT_BEFORE(p, tag, entries);
438         else    /* either list empty or no free slot in between */
439                 TAILQ_INSERT_TAIL(head, tag, entries);
440
441         return (tag->tag);
442 }
443
444 static void
445 tag_unref(struct pf_tags *head, u_int16_t tag)
446 {
447         struct pf_tagname       *p, *next;
448
449         PF_RULES_WASSERT();
450
451         for (p = TAILQ_FIRST(head); p != NULL; p = next) {
452                 next = TAILQ_NEXT(p, entries);
453                 if (tag == p->tag) {
454                         if (--p->ref == 0) {
455                                 TAILQ_REMOVE(head, p, entries);
456                                 free(p, M_PFTAG);
457                         }
458                         break;
459                 }
460         }
461 }
462
463 static u_int16_t
464 pf_tagname2tag(char *tagname)
465 {
466         return (tagname2tag(&V_pf_tags, tagname));
467 }
468
469 #ifdef ALTQ
470 static u_int32_t
471 pf_qname2qid(char *qname)
472 {
473         return ((u_int32_t)tagname2tag(&V_pf_qids, qname));
474 }
475
476 static void
477 pf_qid_unref(u_int32_t qid)
478 {
479         tag_unref(&V_pf_qids, (u_int16_t)qid);
480 }
481
482 static int
483 pf_begin_altq(u_int32_t *ticket)
484 {
485         struct pf_altq  *altq;
486         int              error = 0;
487
488         PF_RULES_WASSERT();
489
490         /* Purge the old altq list */
491         while ((altq = TAILQ_FIRST(V_pf_altqs_inactive)) != NULL) {
492                 TAILQ_REMOVE(V_pf_altqs_inactive, altq, entries);
493                 if (altq->qname[0] == 0 &&
494                     (altq->local_flags & PFALTQ_FLAG_IF_REMOVED) == 0) {
495                         /* detach and destroy the discipline */
496                         error = altq_remove(altq);
497                 } else
498                         pf_qid_unref(altq->qid);
499                 free(altq, M_PFALTQ);
500         }
501         if (error)
502                 return (error);
503         *ticket = ++V_ticket_altqs_inactive;
504         V_altqs_inactive_open = 1;
505         return (0);
506 }
507
508 static int
509 pf_rollback_altq(u_int32_t ticket)
510 {
511         struct pf_altq  *altq;
512         int              error = 0;
513
514         PF_RULES_WASSERT();
515
516         if (!V_altqs_inactive_open || ticket != V_ticket_altqs_inactive)
517                 return (0);
518         /* Purge the old altq list */
519         while ((altq = TAILQ_FIRST(V_pf_altqs_inactive)) != NULL) {
520                 TAILQ_REMOVE(V_pf_altqs_inactive, altq, entries);
521                 if (altq->qname[0] == 0 &&
522                    (altq->local_flags & PFALTQ_FLAG_IF_REMOVED) == 0) {
523                         /* detach and destroy the discipline */
524                         error = altq_remove(altq);
525                 } else
526                         pf_qid_unref(altq->qid);
527                 free(altq, M_PFALTQ);
528         }
529         V_altqs_inactive_open = 0;
530         return (error);
531 }
532
533 static int
534 pf_commit_altq(u_int32_t ticket)
535 {
536         struct pf_altqqueue     *old_altqs;
537         struct pf_altq          *altq;
538         int                      err, error = 0;
539
540         PF_RULES_WASSERT();
541
542         if (!V_altqs_inactive_open || ticket != V_ticket_altqs_inactive)
543                 return (EBUSY);
544
545         /* swap altqs, keep the old. */
546         old_altqs = V_pf_altqs_active;
547         V_pf_altqs_active = V_pf_altqs_inactive;
548         V_pf_altqs_inactive = old_altqs;
549         V_ticket_altqs_active = V_ticket_altqs_inactive;
550
551         /* Attach new disciplines */
552         TAILQ_FOREACH(altq, V_pf_altqs_active, entries) {
553         if (altq->qname[0] == 0 &&
554            (altq->local_flags & PFALTQ_FLAG_IF_REMOVED) == 0) {
555                         /* attach the discipline */
556                         error = altq_pfattach(altq);
557                         if (error == 0 && V_pf_altq_running)
558                                 error = pf_enable_altq(altq);
559                         if (error != 0)
560                                 return (error);
561                 }
562         }
563
564         /* Purge the old altq list */
565         while ((altq = TAILQ_FIRST(V_pf_altqs_inactive)) != NULL) {
566                 TAILQ_REMOVE(V_pf_altqs_inactive, altq, entries);
567                 if (altq->qname[0] == 0 &&
568                     (altq->local_flags & PFALTQ_FLAG_IF_REMOVED) == 0) {
569                         /* detach and destroy the discipline */
570                         if (V_pf_altq_running)
571                                 error = pf_disable_altq(altq);
572                         err = altq_pfdetach(altq);
573                         if (err != 0 && error == 0)
574                                 error = err;
575                         err = altq_remove(altq);
576                         if (err != 0 && error == 0)
577                                 error = err;
578                 } else
579                         pf_qid_unref(altq->qid);
580                 free(altq, M_PFALTQ);
581         }
582
583         V_altqs_inactive_open = 0;
584         return (error);
585 }
586
587 static int
588 pf_enable_altq(struct pf_altq *altq)
589 {
590         struct ifnet            *ifp;
591         struct tb_profile        tb;
592         int                      error = 0;
593
594         if ((ifp = ifunit(altq->ifname)) == NULL)
595                 return (EINVAL);
596
597         if (ifp->if_snd.altq_type != ALTQT_NONE)
598                 error = altq_enable(&ifp->if_snd);
599
600         /* set tokenbucket regulator */
601         if (error == 0 && ifp != NULL && ALTQ_IS_ENABLED(&ifp->if_snd)) {
602                 tb.rate = altq->ifbandwidth;
603                 tb.depth = altq->tbrsize;
604                 error = tbr_set(&ifp->if_snd, &tb);
605         }
606
607         return (error);
608 }
609
610 static int
611 pf_disable_altq(struct pf_altq *altq)
612 {
613         struct ifnet            *ifp;
614         struct tb_profile        tb;
615         int                      error;
616
617         if ((ifp = ifunit(altq->ifname)) == NULL)
618                 return (EINVAL);
619
620         /*
621          * when the discipline is no longer referenced, it was overridden
622          * by a new one.  if so, just return.
623          */
624         if (altq->altq_disc != ifp->if_snd.altq_disc)
625                 return (0);
626
627         error = altq_disable(&ifp->if_snd);
628
629         if (error == 0) {
630                 /* clear tokenbucket regulator */
631                 tb.rate = 0;
632                 error = tbr_set(&ifp->if_snd, &tb);
633         }
634
635         return (error);
636 }
637
638 void
639 pf_altq_ifnet_event(struct ifnet *ifp, int remove)
640 {
641         struct ifnet    *ifp1;
642         struct pf_altq  *a1, *a2, *a3;
643         u_int32_t        ticket;
644         int              error = 0;
645
646         /* Interrupt userland queue modifications */
647         if (V_altqs_inactive_open)
648                 pf_rollback_altq(V_ticket_altqs_inactive);
649
650         /* Start new altq ruleset */
651         if (pf_begin_altq(&ticket))
652                 return;
653
654         /* Copy the current active set */
655         TAILQ_FOREACH(a1, V_pf_altqs_active, entries) {
656                 a2 = malloc(sizeof(*a2), M_PFALTQ, M_NOWAIT);
657                 if (a2 == NULL) {
658                         error = ENOMEM;
659                         break;
660                 }
661                 bcopy(a1, a2, sizeof(struct pf_altq));
662
663                 if (a2->qname[0] != 0) {
664                         if ((a2->qid = pf_qname2qid(a2->qname)) == 0) {
665                                 error = EBUSY;
666                                 free(a2, M_PFALTQ);
667                                 break;
668                         }
669                         a2->altq_disc = NULL;
670                         TAILQ_FOREACH(a3, V_pf_altqs_inactive, entries) {
671                                 if (strncmp(a3->ifname, a2->ifname,
672                                     IFNAMSIZ) == 0 && a3->qname[0] == 0) {
673                                         a2->altq_disc = a3->altq_disc;
674                                         break;
675                                 }
676                         }
677                 }
678                 /* Deactivate the interface in question */
679                 a2->local_flags &= ~PFALTQ_FLAG_IF_REMOVED;
680                 if ((ifp1 = ifunit(a2->ifname)) == NULL ||
681                     (remove && ifp1 == ifp)) {
682                         a2->local_flags |= PFALTQ_FLAG_IF_REMOVED;
683                 } else {
684                         error = altq_add(a2);
685
686                         if (ticket != V_ticket_altqs_inactive)
687                                 error = EBUSY;
688
689                         if (error) {
690                                 free(a2, M_PFALTQ);
691                                 break;
692                         }
693                 }
694
695                 TAILQ_INSERT_TAIL(V_pf_altqs_inactive, a2, entries);
696         }
697
698         if (error != 0)
699                 pf_rollback_altq(ticket);
700         else
701                 pf_commit_altq(ticket);
702 }
703 #endif /* ALTQ */
704
705 static int
706 pf_begin_rules(u_int32_t *ticket, int rs_num, const char *anchor)
707 {
708         struct pf_ruleset       *rs;
709         struct pf_rule          *rule;
710
711         PF_RULES_WASSERT();
712
713         if (rs_num < 0 || rs_num >= PF_RULESET_MAX)
714                 return (EINVAL);
715         rs = pf_find_or_create_ruleset(anchor);
716         if (rs == NULL)
717                 return (EINVAL);
718         while ((rule = TAILQ_FIRST(rs->rules[rs_num].inactive.ptr)) != NULL) {
719                 pf_unlink_rule(rs->rules[rs_num].inactive.ptr, rule);
720                 rs->rules[rs_num].inactive.rcount--;
721         }
722         *ticket = ++rs->rules[rs_num].inactive.ticket;
723         rs->rules[rs_num].inactive.open = 1;
724         return (0);
725 }
726
727 static int
728 pf_rollback_rules(u_int32_t ticket, int rs_num, char *anchor)
729 {
730         struct pf_ruleset       *rs;
731         struct pf_rule          *rule;
732
733         PF_RULES_WASSERT();
734
735         if (rs_num < 0 || rs_num >= PF_RULESET_MAX)
736                 return (EINVAL);
737         rs = pf_find_ruleset(anchor);
738         if (rs == NULL || !rs->rules[rs_num].inactive.open ||
739             rs->rules[rs_num].inactive.ticket != ticket)
740                 return (0);
741         while ((rule = TAILQ_FIRST(rs->rules[rs_num].inactive.ptr)) != NULL) {
742                 pf_unlink_rule(rs->rules[rs_num].inactive.ptr, rule);
743                 rs->rules[rs_num].inactive.rcount--;
744         }
745         rs->rules[rs_num].inactive.open = 0;
746         return (0);
747 }
748
749 #define PF_MD5_UPD(st, elm)                                             \
750                 MD5Update(ctx, (u_int8_t *) &(st)->elm, sizeof((st)->elm))
751
752 #define PF_MD5_UPD_STR(st, elm)                                         \
753                 MD5Update(ctx, (u_int8_t *) (st)->elm, strlen((st)->elm))
754
755 #define PF_MD5_UPD_HTONL(st, elm, stor) do {                            \
756                 (stor) = htonl((st)->elm);                              \
757                 MD5Update(ctx, (u_int8_t *) &(stor), sizeof(u_int32_t));\
758 } while (0)
759
760 #define PF_MD5_UPD_HTONS(st, elm, stor) do {                            \
761                 (stor) = htons((st)->elm);                              \
762                 MD5Update(ctx, (u_int8_t *) &(stor), sizeof(u_int16_t));\
763 } while (0)
764
765 static void
766 pf_hash_rule_addr(MD5_CTX *ctx, struct pf_rule_addr *pfr)
767 {
768         PF_MD5_UPD(pfr, addr.type);
769         switch (pfr->addr.type) {
770                 case PF_ADDR_DYNIFTL:
771                         PF_MD5_UPD(pfr, addr.v.ifname);
772                         PF_MD5_UPD(pfr, addr.iflags);
773                         break;
774                 case PF_ADDR_TABLE:
775                         PF_MD5_UPD(pfr, addr.v.tblname);
776                         break;
777                 case PF_ADDR_ADDRMASK:
778                         /* XXX ignore af? */
779                         PF_MD5_UPD(pfr, addr.v.a.addr.addr32);
780                         PF_MD5_UPD(pfr, addr.v.a.mask.addr32);
781                         break;
782         }
783
784         PF_MD5_UPD(pfr, port[0]);
785         PF_MD5_UPD(pfr, port[1]);
786         PF_MD5_UPD(pfr, neg);
787         PF_MD5_UPD(pfr, port_op);
788 }
789
790 static void
791 pf_hash_rule(MD5_CTX *ctx, struct pf_rule *rule)
792 {
793         u_int16_t x;
794         u_int32_t y;
795
796         pf_hash_rule_addr(ctx, &rule->src);
797         pf_hash_rule_addr(ctx, &rule->dst);
798         PF_MD5_UPD_STR(rule, label);
799         PF_MD5_UPD_STR(rule, ifname);
800         PF_MD5_UPD_STR(rule, match_tagname);
801         PF_MD5_UPD_HTONS(rule, match_tag, x); /* dup? */
802         PF_MD5_UPD_HTONL(rule, os_fingerprint, y);
803         PF_MD5_UPD_HTONL(rule, prob, y);
804         PF_MD5_UPD_HTONL(rule, uid.uid[0], y);
805         PF_MD5_UPD_HTONL(rule, uid.uid[1], y);
806         PF_MD5_UPD(rule, uid.op);
807         PF_MD5_UPD_HTONL(rule, gid.gid[0], y);
808         PF_MD5_UPD_HTONL(rule, gid.gid[1], y);
809         PF_MD5_UPD(rule, gid.op);
810         PF_MD5_UPD_HTONL(rule, rule_flag, y);
811         PF_MD5_UPD(rule, action);
812         PF_MD5_UPD(rule, direction);
813         PF_MD5_UPD(rule, af);
814         PF_MD5_UPD(rule, quick);
815         PF_MD5_UPD(rule, ifnot);
816         PF_MD5_UPD(rule, match_tag_not);
817         PF_MD5_UPD(rule, natpass);
818         PF_MD5_UPD(rule, keep_state);
819         PF_MD5_UPD(rule, proto);
820         PF_MD5_UPD(rule, type);
821         PF_MD5_UPD(rule, code);
822         PF_MD5_UPD(rule, flags);
823         PF_MD5_UPD(rule, flagset);
824         PF_MD5_UPD(rule, allow_opts);
825         PF_MD5_UPD(rule, rt);
826         PF_MD5_UPD(rule, tos);
827 }
828
829 static int
830 pf_commit_rules(u_int32_t ticket, int rs_num, char *anchor)
831 {
832         struct pf_ruleset       *rs;
833         struct pf_rule          *rule, **old_array;
834         struct pf_rulequeue     *old_rules;
835         int                      error;
836         u_int32_t                old_rcount;
837
838         PF_RULES_WASSERT();
839
840         if (rs_num < 0 || rs_num >= PF_RULESET_MAX)
841                 return (EINVAL);
842         rs = pf_find_ruleset(anchor);
843         if (rs == NULL || !rs->rules[rs_num].inactive.open ||
844             ticket != rs->rules[rs_num].inactive.ticket)
845                 return (EBUSY);
846
847         /* Calculate checksum for the main ruleset */
848         if (rs == &pf_main_ruleset) {
849                 error = pf_setup_pfsync_matching(rs);
850                 if (error != 0)
851                         return (error);
852         }
853
854         /* Swap rules, keep the old. */
855         old_rules = rs->rules[rs_num].active.ptr;
856         old_rcount = rs->rules[rs_num].active.rcount;
857         old_array = rs->rules[rs_num].active.ptr_array;
858
859         rs->rules[rs_num].active.ptr =
860             rs->rules[rs_num].inactive.ptr;
861         rs->rules[rs_num].active.ptr_array =
862             rs->rules[rs_num].inactive.ptr_array;
863         rs->rules[rs_num].active.rcount =
864             rs->rules[rs_num].inactive.rcount;
865         rs->rules[rs_num].inactive.ptr = old_rules;
866         rs->rules[rs_num].inactive.ptr_array = old_array;
867         rs->rules[rs_num].inactive.rcount = old_rcount;
868
869         rs->rules[rs_num].active.ticket =
870             rs->rules[rs_num].inactive.ticket;
871         pf_calc_skip_steps(rs->rules[rs_num].active.ptr);
872
873
874         /* Purge the old rule list. */
875         while ((rule = TAILQ_FIRST(old_rules)) != NULL)
876                 pf_unlink_rule(old_rules, rule);
877         if (rs->rules[rs_num].inactive.ptr_array)
878                 free(rs->rules[rs_num].inactive.ptr_array, M_TEMP);
879         rs->rules[rs_num].inactive.ptr_array = NULL;
880         rs->rules[rs_num].inactive.rcount = 0;
881         rs->rules[rs_num].inactive.open = 0;
882         pf_remove_if_empty_ruleset(rs);
883
884         return (0);
885 }
886
887 static int
888 pf_setup_pfsync_matching(struct pf_ruleset *rs)
889 {
890         MD5_CTX                  ctx;
891         struct pf_rule          *rule;
892         int                      rs_cnt;
893         u_int8_t                 digest[PF_MD5_DIGEST_LENGTH];
894
895         MD5Init(&ctx);
896         for (rs_cnt = 0; rs_cnt < PF_RULESET_MAX; rs_cnt++) {
897                 /* XXX PF_RULESET_SCRUB as well? */
898                 if (rs_cnt == PF_RULESET_SCRUB)
899                         continue;
900
901                 if (rs->rules[rs_cnt].inactive.ptr_array)
902                         free(rs->rules[rs_cnt].inactive.ptr_array, M_TEMP);
903                 rs->rules[rs_cnt].inactive.ptr_array = NULL;
904
905                 if (rs->rules[rs_cnt].inactive.rcount) {
906                         rs->rules[rs_cnt].inactive.ptr_array =
907                             malloc(sizeof(caddr_t) *
908                             rs->rules[rs_cnt].inactive.rcount,
909                             M_TEMP, M_NOWAIT);
910
911                         if (!rs->rules[rs_cnt].inactive.ptr_array)
912                                 return (ENOMEM);
913                 }
914
915                 TAILQ_FOREACH(rule, rs->rules[rs_cnt].inactive.ptr,
916                     entries) {
917                         pf_hash_rule(&ctx, rule);
918                         (rs->rules[rs_cnt].inactive.ptr_array)[rule->nr] = rule;
919                 }
920         }
921
922         MD5Final(digest, &ctx);
923         memcpy(V_pf_status.pf_chksum, digest, sizeof(V_pf_status.pf_chksum));
924         return (0);
925 }
926
927 static int
928 pf_addr_setup(struct pf_ruleset *ruleset, struct pf_addr_wrap *addr,
929     sa_family_t af)
930 {
931         int error = 0;
932
933         switch (addr->type) {
934         case PF_ADDR_TABLE:
935                 addr->p.tbl = pfr_attach_table(ruleset, addr->v.tblname);
936                 if (addr->p.tbl == NULL)
937                         error = ENOMEM;
938                 break;
939         case PF_ADDR_DYNIFTL:
940                 error = pfi_dynaddr_setup(addr, af);
941                 break;
942         }
943
944         return (error);
945 }
946
947 static void
948 pf_addr_copyout(struct pf_addr_wrap *addr)
949 {
950
951         switch (addr->type) {
952         case PF_ADDR_DYNIFTL:
953                 pfi_dynaddr_copyout(addr);
954                 break;
955         case PF_ADDR_TABLE:
956                 pf_tbladdr_copyout(addr);
957                 break;
958         }
959 }
960
961 static int
962 pfioctl(struct cdev *dev, u_long cmd, caddr_t addr, int flags, struct thread *td)
963 {
964         int                      error = 0;
965
966         /* XXX keep in sync with switch() below */
967         if (securelevel_gt(td->td_ucred, 2))
968                 switch (cmd) {
969                 case DIOCGETRULES:
970                 case DIOCGETRULE:
971                 case DIOCGETADDRS:
972                 case DIOCGETADDR:
973                 case DIOCGETSTATE:
974                 case DIOCSETSTATUSIF:
975                 case DIOCGETSTATUS:
976                 case DIOCCLRSTATUS:
977                 case DIOCNATLOOK:
978                 case DIOCSETDEBUG:
979                 case DIOCGETSTATES:
980                 case DIOCGETTIMEOUT:
981                 case DIOCCLRRULECTRS:
982                 case DIOCGETLIMIT:
983                 case DIOCGETALTQS:
984                 case DIOCGETALTQ:
985                 case DIOCGETQSTATS:
986                 case DIOCGETRULESETS:
987                 case DIOCGETRULESET:
988                 case DIOCRGETTABLES:
989                 case DIOCRGETTSTATS:
990                 case DIOCRCLRTSTATS:
991                 case DIOCRCLRADDRS:
992                 case DIOCRADDADDRS:
993                 case DIOCRDELADDRS:
994                 case DIOCRSETADDRS:
995                 case DIOCRGETADDRS:
996                 case DIOCRGETASTATS:
997                 case DIOCRCLRASTATS:
998                 case DIOCRTSTADDRS:
999                 case DIOCOSFPGET:
1000                 case DIOCGETSRCNODES:
1001                 case DIOCCLRSRCNODES:
1002                 case DIOCIGETIFACES:
1003                 case DIOCGIFSPEED:
1004                 case DIOCSETIFFLAG:
1005                 case DIOCCLRIFFLAG:
1006                         break;
1007                 case DIOCRCLRTABLES:
1008                 case DIOCRADDTABLES:
1009                 case DIOCRDELTABLES:
1010                 case DIOCRSETTFLAGS:
1011                         if (((struct pfioc_table *)addr)->pfrio_flags &
1012                             PFR_FLAG_DUMMY)
1013                                 break; /* dummy operation ok */
1014                         return (EPERM);
1015                 default:
1016                         return (EPERM);
1017                 }
1018
1019         if (!(flags & FWRITE))
1020                 switch (cmd) {
1021                 case DIOCGETRULES:
1022                 case DIOCGETADDRS:
1023                 case DIOCGETADDR:
1024                 case DIOCGETSTATE:
1025                 case DIOCGETSTATUS:
1026                 case DIOCGETSTATES:
1027                 case DIOCGETTIMEOUT:
1028                 case DIOCGETLIMIT:
1029                 case DIOCGETALTQS:
1030                 case DIOCGETALTQ:
1031                 case DIOCGETQSTATS:
1032                 case DIOCGETRULESETS:
1033                 case DIOCGETRULESET:
1034                 case DIOCNATLOOK:
1035                 case DIOCRGETTABLES:
1036                 case DIOCRGETTSTATS:
1037                 case DIOCRGETADDRS:
1038                 case DIOCRGETASTATS:
1039                 case DIOCRTSTADDRS:
1040                 case DIOCOSFPGET:
1041                 case DIOCGETSRCNODES:
1042                 case DIOCIGETIFACES:
1043                 case DIOCGIFSPEED:
1044                         break;
1045                 case DIOCRCLRTABLES:
1046                 case DIOCRADDTABLES:
1047                 case DIOCRDELTABLES:
1048                 case DIOCRCLRTSTATS:
1049                 case DIOCRCLRADDRS:
1050                 case DIOCRADDADDRS:
1051                 case DIOCRDELADDRS:
1052                 case DIOCRSETADDRS:
1053                 case DIOCRSETTFLAGS:
1054                         if (((struct pfioc_table *)addr)->pfrio_flags &
1055                             PFR_FLAG_DUMMY) {
1056                                 flags |= FWRITE; /* need write lock for dummy */
1057                                 break; /* dummy operation ok */
1058                         }
1059                         return (EACCES);
1060                 case DIOCGETRULE:
1061                         if (((struct pfioc_rule *)addr)->action ==
1062                             PF_GET_CLR_CNTR)
1063                                 return (EACCES);
1064                         break;
1065                 default:
1066                         return (EACCES);
1067                 }
1068
1069         CURVNET_SET(TD_TO_VNET(td));
1070
1071         switch (cmd) {
1072         case DIOCSTART:
1073                 PF_RULES_WLOCK();
1074                 if (V_pf_status.running)
1075                         error = EEXIST;
1076                 else {
1077                         int cpu;
1078
1079                         PF_RULES_WUNLOCK();
1080                         error = hook_pf();
1081                         if (error) {
1082                                 DPFPRINTF(PF_DEBUG_MISC,
1083                                     ("pf: pfil registration failed\n"));
1084                                 break;
1085                         }
1086                         PF_RULES_WLOCK();
1087                         V_pf_status.running = 1;
1088                         V_pf_status.since = time_second;
1089
1090                         CPU_FOREACH(cpu)
1091                                 V_pf_stateid[cpu] = time_second;
1092
1093                         DPFPRINTF(PF_DEBUG_MISC, ("pf: started\n"));
1094                 }
1095                 PF_RULES_WUNLOCK();
1096                 break;
1097
1098         case DIOCSTOP:
1099                 PF_RULES_WLOCK();
1100                 if (!V_pf_status.running)
1101                         error = ENOENT;
1102                 else {
1103                         V_pf_status.running = 0;
1104                         PF_RULES_WUNLOCK();
1105                         error = dehook_pf();
1106                         if (error) {
1107                                 V_pf_status.running = 1;
1108                                 DPFPRINTF(PF_DEBUG_MISC,
1109                                     ("pf: pfil unregistration failed\n"));
1110                         }
1111                         PF_RULES_WLOCK();
1112                         V_pf_status.since = time_second;
1113                         DPFPRINTF(PF_DEBUG_MISC, ("pf: stopped\n"));
1114                 }
1115                 PF_RULES_WUNLOCK();
1116                 break;
1117
1118         case DIOCADDRULE: {
1119                 struct pfioc_rule       *pr = (struct pfioc_rule *)addr;
1120                 struct pf_ruleset       *ruleset;
1121                 struct pf_rule          *rule, *tail;
1122                 struct pf_pooladdr      *pa;
1123                 struct pfi_kif          *kif = NULL;
1124                 int                      rs_num;
1125
1126                 if (pr->rule.return_icmp >> 8 > ICMP_MAXTYPE) {
1127                         error = EINVAL;
1128                         break;
1129                 }
1130 #ifndef INET
1131                 if (pr->rule.af == AF_INET) {
1132                         error = EAFNOSUPPORT;
1133                         break;
1134                 }
1135 #endif /* INET */
1136 #ifndef INET6
1137                 if (pr->rule.af == AF_INET6) {
1138                         error = EAFNOSUPPORT;
1139                         break;
1140                 }
1141 #endif /* INET6 */
1142
1143                 rule = malloc(sizeof(*rule), M_PFRULE, M_WAITOK);
1144                 bcopy(&pr->rule, rule, sizeof(struct pf_rule));
1145                 if (rule->ifname[0])
1146                         kif = malloc(sizeof(*kif), PFI_MTYPE, M_WAITOK);
1147                 rule->cuid = td->td_ucred->cr_ruid;
1148                 rule->cpid = td->td_proc ? td->td_proc->p_pid : 0;
1149                 TAILQ_INIT(&rule->rpool.list);
1150
1151 #define ERROUT(x)       { error = (x); goto DIOCADDRULE_error; }
1152
1153                 PF_RULES_WLOCK();
1154                 pr->anchor[sizeof(pr->anchor) - 1] = 0;
1155                 ruleset = pf_find_ruleset(pr->anchor);
1156                 if (ruleset == NULL)
1157                         ERROUT(EINVAL);
1158                 rs_num = pf_get_ruleset_number(pr->rule.action);
1159                 if (rs_num >= PF_RULESET_MAX)
1160                         ERROUT(EINVAL);
1161                 if (pr->ticket != ruleset->rules[rs_num].inactive.ticket) {
1162                         DPFPRINTF(PF_DEBUG_MISC,
1163                             ("ticket: %d != [%d]%d\n", pr->ticket, rs_num,
1164                             ruleset->rules[rs_num].inactive.ticket));
1165                         ERROUT(EBUSY);
1166                 }
1167                 if (pr->pool_ticket != V_ticket_pabuf) {
1168                         DPFPRINTF(PF_DEBUG_MISC,
1169                             ("pool_ticket: %d != %d\n", pr->pool_ticket,
1170                             V_ticket_pabuf));
1171                         ERROUT(EBUSY);
1172                 }
1173
1174                 tail = TAILQ_LAST(ruleset->rules[rs_num].inactive.ptr,
1175                     pf_rulequeue);
1176                 if (tail)
1177                         rule->nr = tail->nr + 1;
1178                 else
1179                         rule->nr = 0;
1180                 if (rule->ifname[0]) {
1181                         rule->kif = pfi_kif_attach(kif, rule->ifname);
1182                         pfi_kif_ref(rule->kif);
1183                 } else
1184                         rule->kif = NULL;
1185
1186                 if (rule->rtableid > 0 && rule->rtableid >= rt_numfibs)
1187                         error = EBUSY;
1188
1189 #ifdef ALTQ
1190                 /* set queue IDs */
1191                 if (rule->qname[0] != 0) {
1192                         if ((rule->qid = pf_qname2qid(rule->qname)) == 0)
1193                                 error = EBUSY;
1194                         else if (rule->pqname[0] != 0) {
1195                                 if ((rule->pqid =
1196                                     pf_qname2qid(rule->pqname)) == 0)
1197                                         error = EBUSY;
1198                         } else
1199                                 rule->pqid = rule->qid;
1200                 }
1201 #endif
1202                 if (rule->tagname[0])
1203                         if ((rule->tag = pf_tagname2tag(rule->tagname)) == 0)
1204                                 error = EBUSY;
1205                 if (rule->match_tagname[0])
1206                         if ((rule->match_tag =
1207                             pf_tagname2tag(rule->match_tagname)) == 0)
1208                                 error = EBUSY;
1209                 if (rule->rt && !rule->direction)
1210                         error = EINVAL;
1211                 if (!rule->log)
1212                         rule->logif = 0;
1213                 if (rule->logif >= PFLOGIFS_MAX)
1214                         error = EINVAL;
1215                 if (pf_addr_setup(ruleset, &rule->src.addr, rule->af))
1216                         error = ENOMEM;
1217                 if (pf_addr_setup(ruleset, &rule->dst.addr, rule->af))
1218                         error = ENOMEM;
1219                 if (pf_anchor_setup(rule, ruleset, pr->anchor_call))
1220                         error = EINVAL;
1221                 TAILQ_FOREACH(pa, &V_pf_pabuf, entries)
1222                         if (pa->addr.type == PF_ADDR_TABLE) {
1223                                 pa->addr.p.tbl = pfr_attach_table(ruleset,
1224                                     pa->addr.v.tblname);
1225                                 if (pa->addr.p.tbl == NULL)
1226                                         error = ENOMEM;
1227                         }
1228
1229                 if (rule->overload_tblname[0]) {
1230                         if ((rule->overload_tbl = pfr_attach_table(ruleset,
1231                             rule->overload_tblname)) == NULL)
1232                                 error = EINVAL;
1233                         else
1234                                 rule->overload_tbl->pfrkt_flags |=
1235                                     PFR_TFLAG_ACTIVE;
1236                 }
1237
1238                 pf_mv_pool(&V_pf_pabuf, &rule->rpool.list);
1239                 if (((((rule->action == PF_NAT) || (rule->action == PF_RDR) ||
1240                     (rule->action == PF_BINAT)) && rule->anchor == NULL) ||
1241                     (rule->rt > PF_FASTROUTE)) &&
1242                     (TAILQ_FIRST(&rule->rpool.list) == NULL))
1243                         error = EINVAL;
1244
1245                 if (error) {
1246                         pf_free_rule(rule);
1247                         PF_RULES_WUNLOCK();
1248                         break;
1249                 }
1250
1251                 rule->rpool.cur = TAILQ_FIRST(&rule->rpool.list);
1252                 rule->evaluations = rule->packets[0] = rule->packets[1] =
1253                     rule->bytes[0] = rule->bytes[1] = 0;
1254                 TAILQ_INSERT_TAIL(ruleset->rules[rs_num].inactive.ptr,
1255                     rule, entries);
1256                 ruleset->rules[rs_num].inactive.rcount++;
1257                 PF_RULES_WUNLOCK();
1258                 break;
1259
1260 #undef ERROUT
1261 DIOCADDRULE_error:
1262                 PF_RULES_WUNLOCK();
1263                 free(rule, M_PFRULE);
1264                 if (kif)
1265                         free(kif, PFI_MTYPE);
1266                 break;
1267         }
1268
1269         case DIOCGETRULES: {
1270                 struct pfioc_rule       *pr = (struct pfioc_rule *)addr;
1271                 struct pf_ruleset       *ruleset;
1272                 struct pf_rule          *tail;
1273                 int                      rs_num;
1274
1275                 PF_RULES_WLOCK();
1276                 pr->anchor[sizeof(pr->anchor) - 1] = 0;
1277                 ruleset = pf_find_ruleset(pr->anchor);
1278                 if (ruleset == NULL) {
1279                         PF_RULES_WUNLOCK();
1280                         error = EINVAL;
1281                         break;
1282                 }
1283                 rs_num = pf_get_ruleset_number(pr->rule.action);
1284                 if (rs_num >= PF_RULESET_MAX) {
1285                         PF_RULES_WUNLOCK();
1286                         error = EINVAL;
1287                         break;
1288                 }
1289                 tail = TAILQ_LAST(ruleset->rules[rs_num].active.ptr,
1290                     pf_rulequeue);
1291                 if (tail)
1292                         pr->nr = tail->nr + 1;
1293                 else
1294                         pr->nr = 0;
1295                 pr->ticket = ruleset->rules[rs_num].active.ticket;
1296                 PF_RULES_WUNLOCK();
1297                 break;
1298         }
1299
1300         case DIOCGETRULE: {
1301                 struct pfioc_rule       *pr = (struct pfioc_rule *)addr;
1302                 struct pf_ruleset       *ruleset;
1303                 struct pf_rule          *rule;
1304                 int                      rs_num, i;
1305
1306                 PF_RULES_WLOCK();
1307                 pr->anchor[sizeof(pr->anchor) - 1] = 0;
1308                 ruleset = pf_find_ruleset(pr->anchor);
1309                 if (ruleset == NULL) {
1310                         PF_RULES_WUNLOCK();
1311                         error = EINVAL;
1312                         break;
1313                 }
1314                 rs_num = pf_get_ruleset_number(pr->rule.action);
1315                 if (rs_num >= PF_RULESET_MAX) {
1316                         PF_RULES_WUNLOCK();
1317                         error = EINVAL;
1318                         break;
1319                 }
1320                 if (pr->ticket != ruleset->rules[rs_num].active.ticket) {
1321                         PF_RULES_WUNLOCK();
1322                         error = EBUSY;
1323                         break;
1324                 }
1325                 rule = TAILQ_FIRST(ruleset->rules[rs_num].active.ptr);
1326                 while ((rule != NULL) && (rule->nr != pr->nr))
1327                         rule = TAILQ_NEXT(rule, entries);
1328                 if (rule == NULL) {
1329                         PF_RULES_WUNLOCK();
1330                         error = EBUSY;
1331                         break;
1332                 }
1333                 bcopy(rule, &pr->rule, sizeof(struct pf_rule));
1334                 if (pf_anchor_copyout(ruleset, rule, pr)) {
1335                         PF_RULES_WUNLOCK();
1336                         error = EBUSY;
1337                         break;
1338                 }
1339                 pf_addr_copyout(&pr->rule.src.addr);
1340                 pf_addr_copyout(&pr->rule.dst.addr);
1341                 for (i = 0; i < PF_SKIP_COUNT; ++i)
1342                         if (rule->skip[i].ptr == NULL)
1343                                 pr->rule.skip[i].nr = -1;
1344                         else
1345                                 pr->rule.skip[i].nr =
1346                                     rule->skip[i].ptr->nr;
1347
1348                 if (pr->action == PF_GET_CLR_CNTR) {
1349                         rule->evaluations = 0;
1350                         rule->packets[0] = rule->packets[1] = 0;
1351                         rule->bytes[0] = rule->bytes[1] = 0;
1352                         rule->states_tot = 0;
1353                 }
1354                 PF_RULES_WUNLOCK();
1355                 break;
1356         }
1357
1358         case DIOCCHANGERULE: {
1359                 struct pfioc_rule       *pcr = (struct pfioc_rule *)addr;
1360                 struct pf_ruleset       *ruleset;
1361                 struct pf_rule          *oldrule = NULL, *newrule = NULL;
1362                 struct pfi_kif          *kif = NULL;
1363                 struct pf_pooladdr      *pa;
1364                 u_int32_t                nr = 0;
1365                 int                      rs_num;
1366
1367                 if (pcr->action < PF_CHANGE_ADD_HEAD ||
1368                     pcr->action > PF_CHANGE_GET_TICKET) {
1369                         error = EINVAL;
1370                         break;
1371                 }
1372                 if (pcr->rule.return_icmp >> 8 > ICMP_MAXTYPE) {
1373                         error = EINVAL;
1374                         break;
1375                 }
1376
1377                 if (pcr->action != PF_CHANGE_REMOVE) {
1378 #ifndef INET
1379                         if (pcr->rule.af == AF_INET) {
1380                                 error = EAFNOSUPPORT;
1381                                 break;
1382                         }
1383 #endif /* INET */
1384 #ifndef INET6
1385                         if (pcr->rule.af == AF_INET6) {
1386                                 error = EAFNOSUPPORT;
1387                                 break;
1388                         }
1389 #endif /* INET6 */
1390                         newrule = malloc(sizeof(*newrule), M_PFRULE, M_WAITOK);
1391                         bcopy(&pcr->rule, newrule, sizeof(struct pf_rule));
1392                         newrule->cuid = td->td_ucred->cr_ruid;
1393                         newrule->cpid = td->td_proc ? td->td_proc->p_pid : 0;
1394                         TAILQ_INIT(&newrule->rpool.list);
1395                         /* Initialize refcounting. */
1396                         newrule->states_cur = 0;
1397                         newrule->entries.tqe_prev = NULL;
1398
1399                         if (newrule->ifname[0])
1400                                 kif = malloc(sizeof(*kif), PFI_MTYPE, M_WAITOK);
1401                 }
1402
1403 #define ERROUT(x)       { error = (x); goto DIOCCHANGERULE_error; }
1404
1405                 PF_RULES_WLOCK();
1406                 if (!(pcr->action == PF_CHANGE_REMOVE ||
1407                     pcr->action == PF_CHANGE_GET_TICKET) &&
1408                     pcr->pool_ticket != V_ticket_pabuf)
1409                         ERROUT(EBUSY);
1410
1411                 ruleset = pf_find_ruleset(pcr->anchor);
1412                 if (ruleset == NULL)
1413                         ERROUT(EINVAL);
1414
1415                 rs_num = pf_get_ruleset_number(pcr->rule.action);
1416                 if (rs_num >= PF_RULESET_MAX)
1417                         ERROUT(EINVAL);
1418
1419                 if (pcr->action == PF_CHANGE_GET_TICKET) {
1420                         pcr->ticket = ++ruleset->rules[rs_num].active.ticket;
1421                         ERROUT(0);
1422                 } else if (pcr->ticket !=
1423                             ruleset->rules[rs_num].active.ticket)
1424                                 ERROUT(EINVAL);
1425
1426                 if (pcr->action != PF_CHANGE_REMOVE) {
1427                         if (newrule->ifname[0]) {
1428                                 newrule->kif = pfi_kif_attach(kif,
1429                                     newrule->ifname);
1430                                 pfi_kif_ref(newrule->kif);
1431                         } else
1432                                 newrule->kif = NULL;
1433
1434                         if (newrule->rtableid > 0 &&
1435                             newrule->rtableid >= rt_numfibs)
1436                                 error = EBUSY;
1437
1438 #ifdef ALTQ
1439                         /* set queue IDs */
1440                         if (newrule->qname[0] != 0) {
1441                                 if ((newrule->qid =
1442                                     pf_qname2qid(newrule->qname)) == 0)
1443                                         error = EBUSY;
1444                                 else if (newrule->pqname[0] != 0) {
1445                                         if ((newrule->pqid =
1446                                             pf_qname2qid(newrule->pqname)) == 0)
1447                                                 error = EBUSY;
1448                                 } else
1449                                         newrule->pqid = newrule->qid;
1450                         }
1451 #endif /* ALTQ */
1452                         if (newrule->tagname[0])
1453                                 if ((newrule->tag =
1454                                     pf_tagname2tag(newrule->tagname)) == 0)
1455                                         error = EBUSY;
1456                         if (newrule->match_tagname[0])
1457                                 if ((newrule->match_tag = pf_tagname2tag(
1458                                     newrule->match_tagname)) == 0)
1459                                         error = EBUSY;
1460                         if (newrule->rt && !newrule->direction)
1461                                 error = EINVAL;
1462                         if (!newrule->log)
1463                                 newrule->logif = 0;
1464                         if (newrule->logif >= PFLOGIFS_MAX)
1465                                 error = EINVAL;
1466                         if (pf_addr_setup(ruleset, &newrule->src.addr, newrule->af))
1467                                 error = ENOMEM;
1468                         if (pf_addr_setup(ruleset, &newrule->dst.addr, newrule->af))
1469                                 error = ENOMEM;
1470                         if (pf_anchor_setup(newrule, ruleset, pcr->anchor_call))
1471                                 error = EINVAL;
1472                         TAILQ_FOREACH(pa, &V_pf_pabuf, entries)
1473                                 if (pa->addr.type == PF_ADDR_TABLE) {
1474                                         pa->addr.p.tbl =
1475                                             pfr_attach_table(ruleset,
1476                                             pa->addr.v.tblname);
1477                                         if (pa->addr.p.tbl == NULL)
1478                                                 error = ENOMEM;
1479                                 }
1480
1481                         if (newrule->overload_tblname[0]) {
1482                                 if ((newrule->overload_tbl = pfr_attach_table(
1483                                     ruleset, newrule->overload_tblname)) ==
1484                                     NULL)
1485                                         error = EINVAL;
1486                                 else
1487                                         newrule->overload_tbl->pfrkt_flags |=
1488                                             PFR_TFLAG_ACTIVE;
1489                         }
1490
1491                         pf_mv_pool(&V_pf_pabuf, &newrule->rpool.list);
1492                         if (((((newrule->action == PF_NAT) ||
1493                             (newrule->action == PF_RDR) ||
1494                             (newrule->action == PF_BINAT) ||
1495                             (newrule->rt > PF_FASTROUTE)) &&
1496                             !newrule->anchor)) &&
1497                             (TAILQ_FIRST(&newrule->rpool.list) == NULL))
1498                                 error = EINVAL;
1499
1500                         if (error) {
1501                                 pf_free_rule(newrule);
1502                                 PF_RULES_WUNLOCK();
1503                                 break;
1504                         }
1505
1506                         newrule->rpool.cur = TAILQ_FIRST(&newrule->rpool.list);
1507                         newrule->evaluations = 0;
1508                         newrule->packets[0] = newrule->packets[1] = 0;
1509                         newrule->bytes[0] = newrule->bytes[1] = 0;
1510                 }
1511                 pf_empty_pool(&V_pf_pabuf);
1512
1513                 if (pcr->action == PF_CHANGE_ADD_HEAD)
1514                         oldrule = TAILQ_FIRST(
1515                             ruleset->rules[rs_num].active.ptr);
1516                 else if (pcr->action == PF_CHANGE_ADD_TAIL)
1517                         oldrule = TAILQ_LAST(
1518                             ruleset->rules[rs_num].active.ptr, pf_rulequeue);
1519                 else {
1520                         oldrule = TAILQ_FIRST(
1521                             ruleset->rules[rs_num].active.ptr);
1522                         while ((oldrule != NULL) && (oldrule->nr != pcr->nr))
1523                                 oldrule = TAILQ_NEXT(oldrule, entries);
1524                         if (oldrule == NULL) {
1525                                 if (newrule != NULL)
1526                                         pf_free_rule(newrule);
1527                                 PF_RULES_WUNLOCK();
1528                                 error = EINVAL;
1529                                 break;
1530                         }
1531                 }
1532
1533                 if (pcr->action == PF_CHANGE_REMOVE) {
1534                         pf_unlink_rule(ruleset->rules[rs_num].active.ptr,
1535                             oldrule);
1536                         ruleset->rules[rs_num].active.rcount--;
1537                 } else {
1538                         if (oldrule == NULL)
1539                                 TAILQ_INSERT_TAIL(
1540                                     ruleset->rules[rs_num].active.ptr,
1541                                     newrule, entries);
1542                         else if (pcr->action == PF_CHANGE_ADD_HEAD ||
1543                             pcr->action == PF_CHANGE_ADD_BEFORE)
1544                                 TAILQ_INSERT_BEFORE(oldrule, newrule, entries);
1545                         else
1546                                 TAILQ_INSERT_AFTER(
1547                                     ruleset->rules[rs_num].active.ptr,
1548                                     oldrule, newrule, entries);
1549                         ruleset->rules[rs_num].active.rcount++;
1550                 }
1551
1552                 nr = 0;
1553                 TAILQ_FOREACH(oldrule,
1554                     ruleset->rules[rs_num].active.ptr, entries)
1555                         oldrule->nr = nr++;
1556
1557                 ruleset->rules[rs_num].active.ticket++;
1558
1559                 pf_calc_skip_steps(ruleset->rules[rs_num].active.ptr);
1560                 pf_remove_if_empty_ruleset(ruleset);
1561
1562                 PF_RULES_WUNLOCK();
1563                 break;
1564
1565 #undef ERROUT
1566 DIOCCHANGERULE_error:
1567                 PF_RULES_WUNLOCK();
1568                 if (newrule != NULL)
1569                         free(newrule, M_PFRULE);
1570                 if (kif != NULL)
1571                         free(kif, PFI_MTYPE);
1572                 break;
1573         }
1574
1575         case DIOCCLRSTATES: {
1576                 struct pf_state         *s;
1577                 struct pfioc_state_kill *psk = (struct pfioc_state_kill *)addr;
1578                 u_int                    i, killed = 0;
1579
1580                 for (i = 0; i <= V_pf_hashmask; i++) {
1581                         struct pf_idhash *ih = &V_pf_idhash[i];
1582
1583 relock_DIOCCLRSTATES:
1584                         PF_HASHROW_LOCK(ih);
1585                         LIST_FOREACH(s, &ih->states, entry)
1586                                 if (!psk->psk_ifname[0] ||
1587                                     !strcmp(psk->psk_ifname,
1588                                     s->kif->pfik_name)) {
1589                                         /*
1590                                          * Don't send out individual
1591                                          * delete messages.
1592                                          */
1593                                         s->state_flags |= PFSTATE_NOSYNC;
1594                                         pf_unlink_state(s, PF_ENTER_LOCKED);
1595                                         killed++;
1596                                         goto relock_DIOCCLRSTATES;
1597                                 }
1598                         PF_HASHROW_UNLOCK(ih);
1599                 }
1600                 psk->psk_killed = killed;
1601                 if (pfsync_clear_states_ptr != NULL)
1602                         pfsync_clear_states_ptr(V_pf_status.hostid, psk->psk_ifname);
1603                 break;
1604         }
1605
1606         case DIOCKILLSTATES: {
1607                 struct pf_state         *s;
1608                 struct pf_state_key     *sk;
1609                 struct pf_addr          *srcaddr, *dstaddr;
1610                 u_int16_t                srcport, dstport;
1611                 struct pfioc_state_kill *psk = (struct pfioc_state_kill *)addr;
1612                 u_int                    i, killed = 0;
1613
1614                 if (psk->psk_pfcmp.id) {
1615                         if (psk->psk_pfcmp.creatorid == 0)
1616                                 psk->psk_pfcmp.creatorid = V_pf_status.hostid;
1617                         if ((s = pf_find_state_byid(psk->psk_pfcmp.id,
1618                             psk->psk_pfcmp.creatorid))) {
1619                                 pf_unlink_state(s, PF_ENTER_LOCKED);
1620                                 psk->psk_killed = 1;
1621                         }
1622                         break;
1623                 }
1624
1625                 for (i = 0; i <= V_pf_hashmask; i++) {
1626                         struct pf_idhash *ih = &V_pf_idhash[i];
1627
1628 relock_DIOCKILLSTATES:
1629                         PF_HASHROW_LOCK(ih);
1630                         LIST_FOREACH(s, &ih->states, entry) {
1631                                 sk = s->key[PF_SK_WIRE];
1632                                 if (s->direction == PF_OUT) {
1633                                         srcaddr = &sk->addr[1];
1634                                         dstaddr = &sk->addr[0];
1635                                         srcport = sk->port[0];
1636                                         dstport = sk->port[0];
1637                                 } else {
1638                                         srcaddr = &sk->addr[0];
1639                                         dstaddr = &sk->addr[1];
1640                                         srcport = sk->port[0];
1641                                         dstport = sk->port[0];
1642                                 }
1643
1644                                 if ((!psk->psk_af || sk->af == psk->psk_af)
1645                                     && (!psk->psk_proto || psk->psk_proto ==
1646                                     sk->proto) &&
1647                                     PF_MATCHA(psk->psk_src.neg,
1648                                     &psk->psk_src.addr.v.a.addr,
1649                                     &psk->psk_src.addr.v.a.mask,
1650                                     srcaddr, sk->af) &&
1651                                     PF_MATCHA(psk->psk_dst.neg,
1652                                     &psk->psk_dst.addr.v.a.addr,
1653                                     &psk->psk_dst.addr.v.a.mask,
1654                                     dstaddr, sk->af) &&
1655                                     (psk->psk_src.port_op == 0 ||
1656                                     pf_match_port(psk->psk_src.port_op,
1657                                     psk->psk_src.port[0], psk->psk_src.port[1],
1658                                     srcport)) &&
1659                                     (psk->psk_dst.port_op == 0 ||
1660                                     pf_match_port(psk->psk_dst.port_op,
1661                                     psk->psk_dst.port[0], psk->psk_dst.port[1],
1662                                     dstport)) &&
1663                                     (!psk->psk_label[0] ||
1664                                     (s->rule.ptr->label[0] &&
1665                                     !strcmp(psk->psk_label,
1666                                     s->rule.ptr->label))) &&
1667                                     (!psk->psk_ifname[0] ||
1668                                     !strcmp(psk->psk_ifname,
1669                                     s->kif->pfik_name))) {
1670                                         pf_unlink_state(s, PF_ENTER_LOCKED);
1671                                         killed++;
1672                                         goto relock_DIOCKILLSTATES;
1673                                 }
1674                         }
1675                         PF_HASHROW_UNLOCK(ih);
1676                 }
1677                 psk->psk_killed = killed;
1678                 break;
1679         }
1680
1681         case DIOCADDSTATE: {
1682                 struct pfioc_state      *ps = (struct pfioc_state *)addr;
1683                 struct pfsync_state     *sp = &ps->state;
1684
1685                 if (sp->timeout >= PFTM_MAX) {
1686                         error = EINVAL;
1687                         break;
1688                 }
1689                 if (pfsync_state_import_ptr != NULL) {
1690                         PF_RULES_RLOCK();
1691                         error = pfsync_state_import_ptr(sp, PFSYNC_SI_IOCTL);
1692                         PF_RULES_RUNLOCK();
1693                 } else
1694                         error = EOPNOTSUPP;
1695                 break;
1696         }
1697
1698         case DIOCGETSTATE: {
1699                 struct pfioc_state      *ps = (struct pfioc_state *)addr;
1700                 struct pf_state         *s;
1701
1702                 s = pf_find_state_byid(ps->state.id, ps->state.creatorid);
1703                 if (s == NULL) {
1704                         error = ENOENT;
1705                         break;
1706                 }
1707
1708                 pfsync_state_export(&ps->state, s);
1709                 PF_STATE_UNLOCK(s);
1710                 break;
1711         }
1712
1713         case DIOCGETSTATES: {
1714                 struct pfioc_states     *ps = (struct pfioc_states *)addr;
1715                 struct pf_state         *s;
1716                 struct pfsync_state     *pstore, *p;
1717                 int i, nr;
1718
1719                 if (ps->ps_len == 0) {
1720                         nr = uma_zone_get_cur(V_pf_state_z);
1721                         ps->ps_len = sizeof(struct pfsync_state) * nr;
1722                         break;
1723                 }
1724
1725                 p = pstore = malloc(ps->ps_len, M_TEMP, M_WAITOK);
1726                 nr = 0;
1727
1728                 for (i = 0; i <= V_pf_hashmask; i++) {
1729                         struct pf_idhash *ih = &V_pf_idhash[i];
1730
1731                         PF_HASHROW_LOCK(ih);
1732                         LIST_FOREACH(s, &ih->states, entry) {
1733
1734                                 if (s->timeout == PFTM_UNLINKED)
1735                                         continue;
1736
1737                                 if ((nr+1) * sizeof(*p) > ps->ps_len) {
1738                                         PF_HASHROW_UNLOCK(ih);
1739                                         goto DIOCGETSTATES_full;
1740                                 }
1741                                 pfsync_state_export(p, s);
1742                                 p++;
1743                                 nr++;
1744                         }
1745                         PF_HASHROW_UNLOCK(ih);
1746                 }
1747 DIOCGETSTATES_full:
1748                 error = copyout(pstore, ps->ps_states,
1749                     sizeof(struct pfsync_state) * nr);
1750                 if (error) {
1751                         free(pstore, M_TEMP);
1752                         break;
1753                 }
1754                 ps->ps_len = sizeof(struct pfsync_state) * nr;
1755                 free(pstore, M_TEMP);
1756
1757                 break;
1758         }
1759
1760         case DIOCGETSTATUS: {
1761                 struct pf_status *s = (struct pf_status *)addr;
1762                 PF_RULES_RLOCK();
1763                 bcopy(&V_pf_status, s, sizeof(struct pf_status));
1764                 pfi_update_status(s->ifname, s);
1765                 PF_RULES_RUNLOCK();
1766                 break;
1767         }
1768
1769         case DIOCSETSTATUSIF: {
1770                 struct pfioc_if *pi = (struct pfioc_if *)addr;
1771
1772                 if (pi->ifname[0] == 0) {
1773                         bzero(V_pf_status.ifname, IFNAMSIZ);
1774                         break;
1775                 }
1776                 PF_RULES_WLOCK();
1777                 strlcpy(V_pf_status.ifname, pi->ifname, IFNAMSIZ);
1778                 PF_RULES_WUNLOCK();
1779                 break;
1780         }
1781
1782         case DIOCCLRSTATUS: {
1783                 PF_RULES_WLOCK();
1784                 bzero(V_pf_status.counters, sizeof(V_pf_status.counters));
1785                 bzero(V_pf_status.fcounters, sizeof(V_pf_status.fcounters));
1786                 bzero(V_pf_status.scounters, sizeof(V_pf_status.scounters));
1787                 V_pf_status.since = time_second;
1788                 if (*V_pf_status.ifname)
1789                         pfi_update_status(V_pf_status.ifname, NULL);
1790                 PF_RULES_WUNLOCK();
1791                 break;
1792         }
1793
1794         case DIOCNATLOOK: {
1795                 struct pfioc_natlook    *pnl = (struct pfioc_natlook *)addr;
1796                 struct pf_state_key     *sk;
1797                 struct pf_state         *state;
1798                 struct pf_state_key_cmp  key;
1799                 int                      m = 0, direction = pnl->direction;
1800                 int                      sidx, didx;
1801
1802                 /* NATLOOK src and dst are reversed, so reverse sidx/didx */
1803                 sidx = (direction == PF_IN) ? 1 : 0;
1804                 didx = (direction == PF_IN) ? 0 : 1;
1805
1806                 if (!pnl->proto ||
1807                     PF_AZERO(&pnl->saddr, pnl->af) ||
1808                     PF_AZERO(&pnl->daddr, pnl->af) ||
1809                     ((pnl->proto == IPPROTO_TCP ||
1810                     pnl->proto == IPPROTO_UDP) &&
1811                     (!pnl->dport || !pnl->sport)))
1812                         error = EINVAL;
1813                 else {
1814                         bzero(&key, sizeof(key));
1815                         key.af = pnl->af;
1816                         key.proto = pnl->proto;
1817                         PF_ACPY(&key.addr[sidx], &pnl->saddr, pnl->af);
1818                         key.port[sidx] = pnl->sport;
1819                         PF_ACPY(&key.addr[didx], &pnl->daddr, pnl->af);
1820                         key.port[didx] = pnl->dport;
1821
1822                         state = pf_find_state_all(&key, direction, &m);
1823
1824                         if (m > 1)
1825                                 error = E2BIG;  /* more than one state */
1826                         else if (state != NULL) {
1827                                 /* XXXGL: not locked read */
1828                                 sk = state->key[sidx];
1829                                 PF_ACPY(&pnl->rsaddr, &sk->addr[sidx], sk->af);
1830                                 pnl->rsport = sk->port[sidx];
1831                                 PF_ACPY(&pnl->rdaddr, &sk->addr[didx], sk->af);
1832                                 pnl->rdport = sk->port[didx];
1833                         } else
1834                                 error = ENOENT;
1835                 }
1836                 break;
1837         }
1838
1839         case DIOCSETTIMEOUT: {
1840                 struct pfioc_tm *pt = (struct pfioc_tm *)addr;
1841                 int              old;
1842
1843                 if (pt->timeout < 0 || pt->timeout >= PFTM_MAX ||
1844                     pt->seconds < 0) {
1845                         error = EINVAL;
1846                         break;
1847                 }
1848                 PF_RULES_WLOCK();
1849                 old = V_pf_default_rule.timeout[pt->timeout];
1850                 if (pt->timeout == PFTM_INTERVAL && pt->seconds == 0)
1851                         pt->seconds = 1;
1852                 V_pf_default_rule.timeout[pt->timeout] = pt->seconds;
1853                 if (pt->timeout == PFTM_INTERVAL && pt->seconds < old)
1854                         wakeup(pf_purge_thread);
1855                 pt->seconds = old;
1856                 PF_RULES_WUNLOCK();
1857                 break;
1858         }
1859
1860         case DIOCGETTIMEOUT: {
1861                 struct pfioc_tm *pt = (struct pfioc_tm *)addr;
1862
1863                 if (pt->timeout < 0 || pt->timeout >= PFTM_MAX) {
1864                         error = EINVAL;
1865                         break;
1866                 }
1867                 PF_RULES_RLOCK();
1868                 pt->seconds = V_pf_default_rule.timeout[pt->timeout];
1869                 PF_RULES_RUNLOCK();
1870                 break;
1871         }
1872
1873         case DIOCGETLIMIT: {
1874                 struct pfioc_limit      *pl = (struct pfioc_limit *)addr;
1875
1876                 if (pl->index < 0 || pl->index >= PF_LIMIT_MAX) {
1877                         error = EINVAL;
1878                         break;
1879                 }
1880                 PF_RULES_RLOCK();
1881                 pl->limit = V_pf_limits[pl->index].limit;
1882                 PF_RULES_RUNLOCK();
1883                 break;
1884         }
1885
1886         case DIOCSETLIMIT: {
1887                 struct pfioc_limit      *pl = (struct pfioc_limit *)addr;
1888                 int                      old_limit;
1889
1890                 PF_RULES_WLOCK();
1891                 if (pl->index < 0 || pl->index >= PF_LIMIT_MAX ||
1892                     V_pf_limits[pl->index].zone == NULL) {
1893                         PF_RULES_WUNLOCK();
1894                         error = EINVAL;
1895                         break;
1896                 }
1897                 uma_zone_set_max(V_pf_limits[pl->index].zone, pl->limit);
1898                 old_limit = V_pf_limits[pl->index].limit;
1899                 V_pf_limits[pl->index].limit = pl->limit;
1900                 pl->limit = old_limit;
1901                 PF_RULES_WUNLOCK();
1902                 break;
1903         }
1904
1905         case DIOCSETDEBUG: {
1906                 u_int32_t       *level = (u_int32_t *)addr;
1907
1908                 PF_RULES_WLOCK();
1909                 V_pf_status.debug = *level;
1910                 PF_RULES_WUNLOCK();
1911                 break;
1912         }
1913
1914         case DIOCCLRRULECTRS: {
1915                 /* obsoleted by DIOCGETRULE with action=PF_GET_CLR_CNTR */
1916                 struct pf_ruleset       *ruleset = &pf_main_ruleset;
1917                 struct pf_rule          *rule;
1918
1919                 PF_RULES_WLOCK();
1920                 TAILQ_FOREACH(rule,
1921                     ruleset->rules[PF_RULESET_FILTER].active.ptr, entries) {
1922                         rule->evaluations = 0;
1923                         rule->packets[0] = rule->packets[1] = 0;
1924                         rule->bytes[0] = rule->bytes[1] = 0;
1925                 }
1926                 PF_RULES_WUNLOCK();
1927                 break;
1928         }
1929
1930         case DIOCGIFSPEED: {
1931                 struct pf_ifspeed       *psp = (struct pf_ifspeed *)addr;
1932                 struct pf_ifspeed       ps;
1933                 struct ifnet            *ifp;
1934
1935                 if (psp->ifname[0] != 0) {
1936                         /* Can we completely trust user-land? */
1937                         strlcpy(ps.ifname, psp->ifname, IFNAMSIZ);
1938                         ifp = ifunit(ps.ifname);
1939                         if (ifp != NULL)
1940                                 psp->baudrate = ifp->if_baudrate;
1941                         else
1942                                 error = EINVAL;
1943                 } else
1944                         error = EINVAL;
1945                 break;
1946         }
1947
1948 #ifdef ALTQ
1949         case DIOCSTARTALTQ: {
1950                 struct pf_altq          *altq;
1951
1952                 PF_RULES_WLOCK();
1953                 /* enable all altq interfaces on active list */
1954                 TAILQ_FOREACH(altq, V_pf_altqs_active, entries) {
1955                         if (altq->qname[0] == 0 && (altq->local_flags &
1956                             PFALTQ_FLAG_IF_REMOVED) == 0) {
1957                                 error = pf_enable_altq(altq);
1958                                 if (error != 0)
1959                                         break;
1960                         }
1961                 }
1962                 if (error == 0)
1963                         V_pf_altq_running = 1;
1964                 PF_RULES_WUNLOCK();
1965                 DPFPRINTF(PF_DEBUG_MISC, ("altq: started\n"));
1966                 break;
1967         }
1968
1969         case DIOCSTOPALTQ: {
1970                 struct pf_altq          *altq;
1971
1972                 PF_RULES_WLOCK();
1973                 /* disable all altq interfaces on active list */
1974                 TAILQ_FOREACH(altq, V_pf_altqs_active, entries) {
1975                         if (altq->qname[0] == 0 && (altq->local_flags &
1976                             PFALTQ_FLAG_IF_REMOVED) == 0) {
1977                                 error = pf_disable_altq(altq);
1978                                 if (error != 0)
1979                                         break;
1980                         }
1981                 }
1982                 if (error == 0)
1983                         V_pf_altq_running = 0;
1984                 PF_RULES_WUNLOCK();
1985                 DPFPRINTF(PF_DEBUG_MISC, ("altq: stopped\n"));
1986                 break;
1987         }
1988
1989         case DIOCADDALTQ: {
1990                 struct pfioc_altq       *pa = (struct pfioc_altq *)addr;
1991                 struct pf_altq          *altq, *a;
1992                 struct ifnet            *ifp;
1993
1994                 altq = malloc(sizeof(*altq), M_PFALTQ, M_WAITOK);
1995                 bcopy(&pa->altq, altq, sizeof(struct pf_altq));
1996                 altq->local_flags = 0;
1997
1998                 PF_RULES_WLOCK();
1999                 if (pa->ticket != V_ticket_altqs_inactive) {
2000                         PF_RULES_WUNLOCK();
2001                         free(altq, M_PFALTQ);
2002                         error = EBUSY;
2003                         break;
2004                 }
2005
2006                 /*
2007                  * if this is for a queue, find the discipline and
2008                  * copy the necessary fields
2009                  */
2010                 if (altq->qname[0] != 0) {
2011                         if ((altq->qid = pf_qname2qid(altq->qname)) == 0) {
2012                                 PF_RULES_WUNLOCK();
2013                                 error = EBUSY;
2014                                 free(altq, M_PFALTQ);
2015                                 break;
2016                         }
2017                         altq->altq_disc = NULL;
2018                         TAILQ_FOREACH(a, V_pf_altqs_inactive, entries) {
2019                                 if (strncmp(a->ifname, altq->ifname,
2020                                     IFNAMSIZ) == 0 && a->qname[0] == 0) {
2021                                         altq->altq_disc = a->altq_disc;
2022                                         break;
2023                                 }
2024                         }
2025                 }
2026
2027                 if ((ifp = ifunit(altq->ifname)) == NULL)
2028                         altq->local_flags |= PFALTQ_FLAG_IF_REMOVED;
2029                 else
2030                         error = altq_add(altq);
2031
2032                 if (error) {
2033                         PF_RULES_WUNLOCK();
2034                         free(altq, M_PFALTQ);
2035                         break;
2036                 }
2037
2038                 TAILQ_INSERT_TAIL(V_pf_altqs_inactive, altq, entries);
2039                 bcopy(altq, &pa->altq, sizeof(struct pf_altq));
2040                 PF_RULES_WUNLOCK();
2041                 break;
2042         }
2043
2044         case DIOCGETALTQS: {
2045                 struct pfioc_altq       *pa = (struct pfioc_altq *)addr;
2046                 struct pf_altq          *altq;
2047
2048                 PF_RULES_RLOCK();
2049                 pa->nr = 0;
2050                 TAILQ_FOREACH(altq, V_pf_altqs_active, entries)
2051                         pa->nr++;
2052                 pa->ticket = V_ticket_altqs_active;
2053                 PF_RULES_RUNLOCK();
2054                 break;
2055         }
2056
2057         case DIOCGETALTQ: {
2058                 struct pfioc_altq       *pa = (struct pfioc_altq *)addr;
2059                 struct pf_altq          *altq;
2060                 u_int32_t                nr;
2061
2062                 PF_RULES_RLOCK();
2063                 if (pa->ticket != V_ticket_altqs_active) {
2064                         PF_RULES_RUNLOCK();
2065                         error = EBUSY;
2066                         break;
2067                 }
2068                 nr = 0;
2069                 altq = TAILQ_FIRST(V_pf_altqs_active);
2070                 while ((altq != NULL) && (nr < pa->nr)) {
2071                         altq = TAILQ_NEXT(altq, entries);
2072                         nr++;
2073                 }
2074                 if (altq == NULL) {
2075                         PF_RULES_RUNLOCK();
2076                         error = EBUSY;
2077                         break;
2078                 }
2079                 bcopy(altq, &pa->altq, sizeof(struct pf_altq));
2080                 PF_RULES_RUNLOCK();
2081                 break;
2082         }
2083
2084         case DIOCCHANGEALTQ:
2085                 /* CHANGEALTQ not supported yet! */
2086                 error = ENODEV;
2087                 break;
2088
2089         case DIOCGETQSTATS: {
2090                 struct pfioc_qstats     *pq = (struct pfioc_qstats *)addr;
2091                 struct pf_altq          *altq;
2092                 u_int32_t                nr;
2093                 int                      nbytes;
2094
2095                 PF_RULES_RLOCK();
2096                 if (pq->ticket != V_ticket_altqs_active) {
2097                         PF_RULES_RUNLOCK();
2098                         error = EBUSY;
2099                         break;
2100                 }
2101                 nbytes = pq->nbytes;
2102                 nr = 0;
2103                 altq = TAILQ_FIRST(V_pf_altqs_active);
2104                 while ((altq != NULL) && (nr < pq->nr)) {
2105                         altq = TAILQ_NEXT(altq, entries);
2106                         nr++;
2107                 }
2108                 if (altq == NULL) {
2109                         PF_RULES_RUNLOCK();
2110                         error = EBUSY;
2111                         break;
2112                 }
2113
2114                 if ((altq->local_flags & PFALTQ_FLAG_IF_REMOVED) != 0) {
2115                         PF_RULES_RUNLOCK();
2116                         error = ENXIO;
2117                         break;
2118                 }
2119                 PF_RULES_RUNLOCK();
2120                 error = altq_getqstats(altq, pq->buf, &nbytes);
2121                 if (error == 0) {
2122                         pq->scheduler = altq->scheduler;
2123                         pq->nbytes = nbytes;
2124                 }
2125                 break;
2126         }
2127 #endif /* ALTQ */
2128
2129         case DIOCBEGINADDRS: {
2130                 struct pfioc_pooladdr   *pp = (struct pfioc_pooladdr *)addr;
2131
2132                 PF_RULES_WLOCK();
2133                 pf_empty_pool(&V_pf_pabuf);
2134                 pp->ticket = ++V_ticket_pabuf;
2135                 PF_RULES_WUNLOCK();
2136                 break;
2137         }
2138
2139         case DIOCADDADDR: {
2140                 struct pfioc_pooladdr   *pp = (struct pfioc_pooladdr *)addr;
2141                 struct pf_pooladdr      *pa;
2142                 struct pfi_kif          *kif = NULL;
2143
2144 #ifndef INET
2145                 if (pp->af == AF_INET) {
2146                         error = EAFNOSUPPORT;
2147                         break;
2148                 }
2149 #endif /* INET */
2150 #ifndef INET6
2151                 if (pp->af == AF_INET6) {
2152                         error = EAFNOSUPPORT;
2153                         break;
2154                 }
2155 #endif /* INET6 */
2156                 if (pp->addr.addr.type != PF_ADDR_ADDRMASK &&
2157                     pp->addr.addr.type != PF_ADDR_DYNIFTL &&
2158                     pp->addr.addr.type != PF_ADDR_TABLE) {
2159                         error = EINVAL;
2160                         break;
2161                 }
2162                 pa = malloc(sizeof(*pa), M_PFRULE, M_WAITOK);
2163                 bcopy(&pp->addr, pa, sizeof(struct pf_pooladdr));
2164                 if (pa->ifname[0])
2165                         kif = malloc(sizeof(*kif), PFI_MTYPE, M_WAITOK);
2166                 PF_RULES_WLOCK();
2167                 if (pp->ticket != V_ticket_pabuf) {
2168                         PF_RULES_WUNLOCK();
2169                         if (pa->ifname[0])
2170                                 free(kif, PFI_MTYPE);
2171                         free(pa, M_PFRULE);
2172                         error = EBUSY;
2173                         break;
2174                 }
2175                 if (pa->ifname[0]) {
2176                         pa->kif = pfi_kif_attach(kif, pa->ifname);
2177                         pfi_kif_ref(pa->kif);
2178                 } else
2179                         pa->kif = NULL;
2180                 if (pa->addr.type == PF_ADDR_DYNIFTL && ((error =
2181                     pfi_dynaddr_setup(&pa->addr, pp->af)) != 0)) {
2182                         if (pa->ifname[0])
2183                                 pfi_kif_unref(pa->kif);
2184                         PF_RULES_WUNLOCK();
2185                         free(pa, M_PFRULE);
2186                         break;
2187                 }
2188                 TAILQ_INSERT_TAIL(&V_pf_pabuf, pa, entries);
2189                 PF_RULES_WUNLOCK();
2190                 break;
2191         }
2192
2193         case DIOCGETADDRS: {
2194                 struct pfioc_pooladdr   *pp = (struct pfioc_pooladdr *)addr;
2195                 struct pf_pool          *pool;
2196                 struct pf_pooladdr      *pa;
2197
2198                 PF_RULES_RLOCK();
2199                 pp->nr = 0;
2200                 pool = pf_get_pool(pp->anchor, pp->ticket, pp->r_action,
2201                     pp->r_num, 0, 1, 0);
2202                 if (pool == NULL) {
2203                         PF_RULES_RUNLOCK();
2204                         error = EBUSY;
2205                         break;
2206                 }
2207                 TAILQ_FOREACH(pa, &pool->list, entries)
2208                         pp->nr++;
2209                 PF_RULES_RUNLOCK();
2210                 break;
2211         }
2212
2213         case DIOCGETADDR: {
2214                 struct pfioc_pooladdr   *pp = (struct pfioc_pooladdr *)addr;
2215                 struct pf_pool          *pool;
2216                 struct pf_pooladdr      *pa;
2217                 u_int32_t                nr = 0;
2218
2219                 PF_RULES_RLOCK();
2220                 pool = pf_get_pool(pp->anchor, pp->ticket, pp->r_action,
2221                     pp->r_num, 0, 1, 1);
2222                 if (pool == NULL) {
2223                         PF_RULES_RUNLOCK();
2224                         error = EBUSY;
2225                         break;
2226                 }
2227                 pa = TAILQ_FIRST(&pool->list);
2228                 while ((pa != NULL) && (nr < pp->nr)) {
2229                         pa = TAILQ_NEXT(pa, entries);
2230                         nr++;
2231                 }
2232                 if (pa == NULL) {
2233                         PF_RULES_RUNLOCK();
2234                         error = EBUSY;
2235                         break;
2236                 }
2237                 bcopy(pa, &pp->addr, sizeof(struct pf_pooladdr));
2238                 pf_addr_copyout(&pp->addr.addr);
2239                 PF_RULES_RUNLOCK();
2240                 break;
2241         }
2242
2243         case DIOCCHANGEADDR: {
2244                 struct pfioc_pooladdr   *pca = (struct pfioc_pooladdr *)addr;
2245                 struct pf_pool          *pool;
2246                 struct pf_pooladdr      *oldpa = NULL, *newpa = NULL;
2247                 struct pf_ruleset       *ruleset;
2248                 struct pfi_kif          *kif = NULL;
2249
2250                 if (pca->action < PF_CHANGE_ADD_HEAD ||
2251                     pca->action > PF_CHANGE_REMOVE) {
2252                         error = EINVAL;
2253                         break;
2254                 }
2255                 if (pca->addr.addr.type != PF_ADDR_ADDRMASK &&
2256                     pca->addr.addr.type != PF_ADDR_DYNIFTL &&
2257                     pca->addr.addr.type != PF_ADDR_TABLE) {
2258                         error = EINVAL;
2259                         break;
2260                 }
2261
2262                 if (pca->action != PF_CHANGE_REMOVE) {
2263 #ifndef INET
2264                         if (pca->af == AF_INET) {
2265                                 error = EAFNOSUPPORT;
2266                                 break;
2267                         }
2268 #endif /* INET */
2269 #ifndef INET6
2270                         if (pca->af == AF_INET6) {
2271                                 error = EAFNOSUPPORT;
2272                                 break;
2273                         }
2274 #endif /* INET6 */
2275                         newpa = malloc(sizeof(*newpa), M_PFRULE, M_WAITOK);
2276                         bcopy(&pca->addr, newpa, sizeof(struct pf_pooladdr));
2277                         if (newpa->ifname[0])
2278                                 kif = malloc(sizeof(*kif), PFI_MTYPE, M_WAITOK);
2279                 }
2280
2281 #define ERROUT(x)       { error = (x); goto DIOCCHANGEADDR_error; }
2282                 PF_RULES_WLOCK();
2283                 ruleset = pf_find_ruleset(pca->anchor);
2284                 if (ruleset == NULL)
2285                         ERROUT(EBUSY);
2286
2287                 pool = pf_get_pool(pca->anchor, pca->ticket, pca->r_action,
2288                     pca->r_num, pca->r_last, 1, 1);
2289                 if (pool == NULL)
2290                         ERROUT(EBUSY);
2291
2292                 if (pca->action != PF_CHANGE_REMOVE) {
2293                         if (newpa->ifname[0]) {
2294                                 newpa->kif = pfi_kif_attach(kif, newpa->ifname);
2295                                 pfi_kif_ref(newpa->kif);
2296                         } else
2297                                 newpa->kif = NULL;
2298
2299                         switch (newpa->addr.type) {
2300                         case PF_ADDR_DYNIFTL:
2301                                 error = pfi_dynaddr_setup(&newpa->addr,
2302                                     pca->af);
2303                                 break;
2304                         case PF_ADDR_TABLE:
2305                                 newpa->addr.p.tbl = pfr_attach_table(ruleset,
2306                                     newpa->addr.v.tblname);
2307                                 if (newpa->addr.p.tbl == NULL)
2308                                         error = ENOMEM;
2309                                 break;
2310                         }
2311                         if (error) {
2312                                 if (newpa->kif)
2313                                         pfi_kif_unref(newpa->kif);
2314                                 PF_RULES_WUNLOCK();
2315                                 free(newpa, M_PFRULE);
2316                                 break;
2317                         }
2318                 }
2319
2320                 if (pca->action == PF_CHANGE_ADD_HEAD)
2321                         oldpa = TAILQ_FIRST(&pool->list);
2322                 else if (pca->action == PF_CHANGE_ADD_TAIL)
2323                         oldpa = TAILQ_LAST(&pool->list, pf_palist);
2324                 else {
2325                         int     i = 0;
2326
2327                         oldpa = TAILQ_FIRST(&pool->list);
2328                         while ((oldpa != NULL) && (i < pca->nr)) {
2329                                 oldpa = TAILQ_NEXT(oldpa, entries);
2330                                 i++;
2331                         }
2332                         if (oldpa == NULL) {
2333                                 PF_RULES_WUNLOCK();
2334                                 error = EINVAL;
2335                                 break;
2336                         }
2337                 }
2338
2339                 if (pca->action == PF_CHANGE_REMOVE) {
2340                         TAILQ_REMOVE(&pool->list, oldpa, entries);
2341                         switch (oldpa->addr.type) {
2342                         case PF_ADDR_DYNIFTL:
2343                                 pfi_dynaddr_remove(oldpa->addr.p.dyn);
2344                                 break;
2345                         case PF_ADDR_TABLE:
2346                                 pfr_detach_table(oldpa->addr.p.tbl);
2347                                 break;
2348                         }
2349                         if (oldpa->kif)
2350                                 pfi_kif_unref(oldpa->kif);
2351                         free(oldpa, M_PFRULE);
2352                 } else {
2353                         if (oldpa == NULL)
2354                                 TAILQ_INSERT_TAIL(&pool->list, newpa, entries);
2355                         else if (pca->action == PF_CHANGE_ADD_HEAD ||
2356                             pca->action == PF_CHANGE_ADD_BEFORE)
2357                                 TAILQ_INSERT_BEFORE(oldpa, newpa, entries);
2358                         else
2359                                 TAILQ_INSERT_AFTER(&pool->list, oldpa,
2360                                     newpa, entries);
2361                 }
2362
2363                 pool->cur = TAILQ_FIRST(&pool->list);
2364                 PF_ACPY(&pool->counter, &pool->cur->addr.v.a.addr,
2365                     pca->af);
2366                 PF_RULES_WUNLOCK();
2367                 break;
2368
2369 #undef ERROUT
2370 DIOCCHANGEADDR_error:
2371                 PF_RULES_WUNLOCK();
2372                 if (newpa != NULL)
2373                         free(newpa, M_PFRULE);
2374                 if (kif != NULL)
2375                         free(kif, PFI_MTYPE);
2376                 break;
2377         }
2378
2379         case DIOCGETRULESETS: {
2380                 struct pfioc_ruleset    *pr = (struct pfioc_ruleset *)addr;
2381                 struct pf_ruleset       *ruleset;
2382                 struct pf_anchor        *anchor;
2383
2384                 PF_RULES_RLOCK();
2385                 pr->path[sizeof(pr->path) - 1] = 0;
2386                 if ((ruleset = pf_find_ruleset(pr->path)) == NULL) {
2387                         PF_RULES_RUNLOCK();
2388                         error = ENOENT;
2389                         break;
2390                 }
2391                 pr->nr = 0;
2392                 if (ruleset->anchor == NULL) {
2393                         /* XXX kludge for pf_main_ruleset */
2394                         RB_FOREACH(anchor, pf_anchor_global, &V_pf_anchors)
2395                                 if (anchor->parent == NULL)
2396                                         pr->nr++;
2397                 } else {
2398                         RB_FOREACH(anchor, pf_anchor_node,
2399                             &ruleset->anchor->children)
2400                                 pr->nr++;
2401                 }
2402                 PF_RULES_RUNLOCK();
2403                 break;
2404         }
2405
2406         case DIOCGETRULESET: {
2407                 struct pfioc_ruleset    *pr = (struct pfioc_ruleset *)addr;
2408                 struct pf_ruleset       *ruleset;
2409                 struct pf_anchor        *anchor;
2410                 u_int32_t                nr = 0;
2411
2412                 PF_RULES_RLOCK();
2413                 pr->path[sizeof(pr->path) - 1] = 0;
2414                 if ((ruleset = pf_find_ruleset(pr->path)) == NULL) {
2415                         PF_RULES_RUNLOCK();
2416                         error = ENOENT;
2417                         break;
2418                 }
2419                 pr->name[0] = 0;
2420                 if (ruleset->anchor == NULL) {
2421                         /* XXX kludge for pf_main_ruleset */
2422                         RB_FOREACH(anchor, pf_anchor_global, &V_pf_anchors)
2423                                 if (anchor->parent == NULL && nr++ == pr->nr) {
2424                                         strlcpy(pr->name, anchor->name,
2425                                             sizeof(pr->name));
2426                                         break;
2427                                 }
2428                 } else {
2429                         RB_FOREACH(anchor, pf_anchor_node,
2430                             &ruleset->anchor->children)
2431                                 if (nr++ == pr->nr) {
2432                                         strlcpy(pr->name, anchor->name,
2433                                             sizeof(pr->name));
2434                                         break;
2435                                 }
2436                 }
2437                 if (!pr->name[0])
2438                         error = EBUSY;
2439                 PF_RULES_RUNLOCK();
2440                 break;
2441         }
2442
2443         case DIOCRCLRTABLES: {
2444                 struct pfioc_table *io = (struct pfioc_table *)addr;
2445
2446                 if (io->pfrio_esize != 0) {
2447                         error = ENODEV;
2448                         break;
2449                 }
2450                 PF_RULES_WLOCK();
2451                 error = pfr_clr_tables(&io->pfrio_table, &io->pfrio_ndel,
2452                     io->pfrio_flags | PFR_FLAG_USERIOCTL);
2453                 PF_RULES_WUNLOCK();
2454                 break;
2455         }
2456
2457         case DIOCRADDTABLES: {
2458                 struct pfioc_table *io = (struct pfioc_table *)addr;
2459                 struct pfr_table *pfrts;
2460                 size_t totlen;
2461
2462                 if (io->pfrio_esize != sizeof(struct pfr_table)) {
2463                         error = ENODEV;
2464                         break;
2465                 }
2466                 totlen = io->pfrio_size * sizeof(struct pfr_table);
2467                 pfrts = malloc(totlen, M_TEMP, M_WAITOK);
2468                 error = copyin(io->pfrio_buffer, pfrts, totlen);
2469                 if (error) {
2470                         free(pfrts, M_TEMP);
2471                         break;
2472                 }
2473                 PF_RULES_WLOCK();
2474                 error = pfr_add_tables(pfrts, io->pfrio_size,
2475                     &io->pfrio_nadd, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2476                 PF_RULES_WUNLOCK();
2477                 free(pfrts, M_TEMP);
2478                 break;
2479         }
2480
2481         case DIOCRDELTABLES: {
2482                 struct pfioc_table *io = (struct pfioc_table *)addr;
2483                 struct pfr_table *pfrts;
2484                 size_t totlen;
2485
2486                 if (io->pfrio_esize != sizeof(struct pfr_table)) {
2487                         error = ENODEV;
2488                         break;
2489                 }
2490                 totlen = io->pfrio_size * sizeof(struct pfr_table);
2491                 pfrts = malloc(totlen, M_TEMP, M_WAITOK);
2492                 error = copyin(io->pfrio_buffer, pfrts, totlen);
2493                 if (error) {
2494                         free(pfrts, M_TEMP);
2495                         break;
2496                 }
2497                 PF_RULES_WLOCK();
2498                 error = pfr_del_tables(pfrts, io->pfrio_size,
2499                     &io->pfrio_ndel, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2500                 PF_RULES_WUNLOCK();
2501                 free(pfrts, M_TEMP);
2502                 break;
2503         }
2504
2505         case DIOCRGETTABLES: {
2506                 struct pfioc_table *io = (struct pfioc_table *)addr;
2507                 struct pfr_table *pfrts;
2508                 size_t totlen;
2509
2510                 if (io->pfrio_esize != sizeof(struct pfr_table)) {
2511                         error = ENODEV;
2512                         break;
2513                 }
2514                 totlen = io->pfrio_size * sizeof(struct pfr_table);
2515                 pfrts = malloc(totlen, M_TEMP, M_WAITOK);
2516                 PF_RULES_RLOCK();
2517                 error = pfr_get_tables(&io->pfrio_table, pfrts,
2518                     &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2519                 PF_RULES_RUNLOCK();
2520                 if (error == 0)
2521                         error = copyout(pfrts, io->pfrio_buffer, totlen);
2522                 free(pfrts, M_TEMP);
2523                 break;
2524         }
2525
2526         case DIOCRGETTSTATS: {
2527                 struct pfioc_table *io = (struct pfioc_table *)addr;
2528                 struct pfr_tstats *pfrtstats;
2529                 size_t totlen;
2530
2531                 if (io->pfrio_esize != sizeof(struct pfr_tstats)) {
2532                         error = ENODEV;
2533                         break;
2534                 }
2535                 totlen = io->pfrio_size * sizeof(struct pfr_tstats);
2536                 pfrtstats = malloc(totlen, M_TEMP, M_WAITOK);
2537                 PF_RULES_WLOCK();
2538                 error = pfr_get_tstats(&io->pfrio_table, pfrtstats,
2539                     &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2540                 PF_RULES_WUNLOCK();
2541                 if (error == 0)
2542                         error = copyout(pfrtstats, io->pfrio_buffer, totlen);
2543                 free(pfrtstats, M_TEMP);
2544                 break;
2545         }
2546
2547         case DIOCRCLRTSTATS: {
2548                 struct pfioc_table *io = (struct pfioc_table *)addr;
2549                 struct pfr_table *pfrts;
2550                 size_t totlen;
2551
2552                 if (io->pfrio_esize != sizeof(struct pfr_table)) {
2553                         error = ENODEV;
2554                         break;
2555                 }
2556                 totlen = io->pfrio_size * sizeof(struct pfr_table);
2557                 pfrts = malloc(totlen, M_TEMP, M_WAITOK);
2558                 error = copyin(io->pfrio_buffer, pfrts, totlen);
2559                 if (error) {
2560                         free(pfrts, M_TEMP);
2561                         break;
2562                 }
2563                 PF_RULES_WLOCK();
2564                 error = pfr_clr_tstats(pfrts, io->pfrio_size,
2565                     &io->pfrio_nzero, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2566                 PF_RULES_WUNLOCK();
2567                 free(pfrts, M_TEMP);
2568                 break;
2569         }
2570
2571         case DIOCRSETTFLAGS: {
2572                 struct pfioc_table *io = (struct pfioc_table *)addr;
2573                 struct pfr_table *pfrts;
2574                 size_t totlen;
2575
2576                 if (io->pfrio_esize != sizeof(struct pfr_table)) {
2577                         error = ENODEV;
2578                         break;
2579                 }
2580                 totlen = io->pfrio_size * sizeof(struct pfr_table);
2581                 pfrts = malloc(totlen, M_TEMP, M_WAITOK);
2582                 error = copyin(io->pfrio_buffer, pfrts, totlen);
2583                 if (error) {
2584                         free(pfrts, M_TEMP);
2585                         break;
2586                 }
2587                 PF_RULES_WLOCK();
2588                 error = pfr_set_tflags(pfrts, io->pfrio_size,
2589                     io->pfrio_setflag, io->pfrio_clrflag, &io->pfrio_nchange,
2590                     &io->pfrio_ndel, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2591                 PF_RULES_WUNLOCK();
2592                 free(pfrts, M_TEMP);
2593                 break;
2594         }
2595
2596         case DIOCRCLRADDRS: {
2597                 struct pfioc_table *io = (struct pfioc_table *)addr;
2598
2599                 if (io->pfrio_esize != 0) {
2600                         error = ENODEV;
2601                         break;
2602                 }
2603                 PF_RULES_WLOCK();
2604                 error = pfr_clr_addrs(&io->pfrio_table, &io->pfrio_ndel,
2605                     io->pfrio_flags | PFR_FLAG_USERIOCTL);
2606                 PF_RULES_WUNLOCK();
2607                 break;
2608         }
2609
2610         case DIOCRADDADDRS: {
2611                 struct pfioc_table *io = (struct pfioc_table *)addr;
2612                 struct pfr_addr *pfras;
2613                 size_t totlen;
2614
2615                 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
2616                         error = ENODEV;
2617                         break;
2618                 }
2619                 totlen = io->pfrio_size * sizeof(struct pfr_addr);
2620                 pfras = malloc(totlen, M_TEMP, M_WAITOK);
2621                 error = copyin(io->pfrio_buffer, pfras, totlen);
2622                 if (error) {
2623                         free(pfras, M_TEMP);
2624                         break;
2625                 }
2626                 PF_RULES_WLOCK();
2627                 error = pfr_add_addrs(&io->pfrio_table, pfras,
2628                     io->pfrio_size, &io->pfrio_nadd, io->pfrio_flags |
2629                     PFR_FLAG_USERIOCTL);
2630                 PF_RULES_WUNLOCK();
2631                 if (error == 0 && io->pfrio_flags & PFR_FLAG_FEEDBACK)
2632                         error = copyout(pfras, io->pfrio_buffer, totlen);
2633                 free(pfras, M_TEMP);
2634                 break;
2635         }
2636
2637         case DIOCRDELADDRS: {
2638                 struct pfioc_table *io = (struct pfioc_table *)addr;
2639                 struct pfr_addr *pfras;
2640                 size_t totlen;
2641
2642                 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
2643                         error = ENODEV;
2644                         break;
2645                 }
2646                 totlen = io->pfrio_size * sizeof(struct pfr_addr);
2647                 pfras = malloc(totlen, M_TEMP, M_WAITOK);
2648                 error = copyin(io->pfrio_buffer, pfras, totlen);
2649                 if (error) {
2650                         free(pfras, M_TEMP);
2651                         break;
2652                 }
2653                 PF_RULES_WLOCK();
2654                 error = pfr_del_addrs(&io->pfrio_table, pfras,
2655                     io->pfrio_size, &io->pfrio_ndel, io->pfrio_flags |
2656                     PFR_FLAG_USERIOCTL);
2657                 PF_RULES_WUNLOCK();
2658                 if (error == 0 && io->pfrio_flags & PFR_FLAG_FEEDBACK)
2659                         error = copyout(pfras, io->pfrio_buffer, totlen);
2660                 free(pfras, M_TEMP);
2661                 break;
2662         }
2663
2664         case DIOCRSETADDRS: {
2665                 struct pfioc_table *io = (struct pfioc_table *)addr;
2666                 struct pfr_addr *pfras;
2667                 size_t totlen;
2668
2669                 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
2670                         error = ENODEV;
2671                         break;
2672                 }
2673                 totlen = (io->pfrio_size + io->pfrio_size2) *
2674                     sizeof(struct pfr_addr);
2675                 pfras = malloc(totlen, M_TEMP, M_WAITOK);
2676                 error = copyin(io->pfrio_buffer, pfras, totlen);
2677                 if (error) {
2678                         free(pfras, M_TEMP);
2679                         break;
2680                 }
2681                 PF_RULES_WLOCK();
2682                 error = pfr_set_addrs(&io->pfrio_table, pfras,
2683                     io->pfrio_size, &io->pfrio_size2, &io->pfrio_nadd,
2684                     &io->pfrio_ndel, &io->pfrio_nchange, io->pfrio_flags |
2685                     PFR_FLAG_USERIOCTL, 0);
2686                 PF_RULES_WUNLOCK();
2687                 if (error == 0 && io->pfrio_flags & PFR_FLAG_FEEDBACK)
2688                         error = copyout(pfras, io->pfrio_buffer, totlen);
2689                 free(pfras, M_TEMP);
2690                 break;
2691         }
2692
2693         case DIOCRGETADDRS: {
2694                 struct pfioc_table *io = (struct pfioc_table *)addr;
2695                 struct pfr_addr *pfras;
2696                 size_t totlen;
2697
2698                 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
2699                         error = ENODEV;
2700                         break;
2701                 }
2702                 totlen = io->pfrio_size * sizeof(struct pfr_addr);
2703                 pfras = malloc(totlen, M_TEMP, M_WAITOK);
2704                 PF_RULES_RLOCK();
2705                 error = pfr_get_addrs(&io->pfrio_table, pfras,
2706                     &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2707                 PF_RULES_RUNLOCK();
2708                 if (error == 0)
2709                         error = copyout(pfras, io->pfrio_buffer, totlen);
2710                 free(pfras, M_TEMP);
2711                 break;
2712         }
2713
2714         case DIOCRGETASTATS: {
2715                 struct pfioc_table *io = (struct pfioc_table *)addr;
2716                 struct pfr_astats *pfrastats;
2717                 size_t totlen;
2718
2719                 if (io->pfrio_esize != sizeof(struct pfr_astats)) {
2720                         error = ENODEV;
2721                         break;
2722                 }
2723                 totlen = io->pfrio_size * sizeof(struct pfr_astats);
2724                 pfrastats = malloc(totlen, M_TEMP, M_WAITOK);
2725                 PF_RULES_RLOCK();
2726                 error = pfr_get_astats(&io->pfrio_table, pfrastats,
2727                     &io->pfrio_size, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2728                 PF_RULES_RUNLOCK();
2729                 if (error == 0)
2730                         error = copyout(pfrastats, io->pfrio_buffer, totlen);
2731                 free(pfrastats, M_TEMP);
2732                 break;
2733         }
2734
2735         case DIOCRCLRASTATS: {
2736                 struct pfioc_table *io = (struct pfioc_table *)addr;
2737                 struct pfr_addr *pfras;
2738                 size_t totlen;
2739
2740                 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
2741                         error = ENODEV;
2742                         break;
2743                 }
2744                 totlen = io->pfrio_size * sizeof(struct pfr_addr);
2745                 pfras = malloc(totlen, M_TEMP, M_WAITOK);
2746                 error = copyin(io->pfrio_buffer, pfras, totlen);
2747                 if (error) {
2748                         free(pfras, M_TEMP);
2749                         break;
2750                 }
2751                 PF_RULES_WLOCK();
2752                 error = pfr_clr_astats(&io->pfrio_table, pfras,
2753                     io->pfrio_size, &io->pfrio_nzero, io->pfrio_flags |
2754                     PFR_FLAG_USERIOCTL);
2755                 PF_RULES_WUNLOCK();
2756                 if (error == 0 && io->pfrio_flags & PFR_FLAG_FEEDBACK)
2757                         error = copyout(pfras, io->pfrio_buffer, totlen);
2758                 free(pfras, M_TEMP);
2759                 break;
2760         }
2761
2762         case DIOCRTSTADDRS: {
2763                 struct pfioc_table *io = (struct pfioc_table *)addr;
2764                 struct pfr_addr *pfras;
2765                 size_t totlen;
2766
2767                 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
2768                         error = ENODEV;
2769                         break;
2770                 }
2771                 totlen = io->pfrio_size * sizeof(struct pfr_addr);
2772                 pfras = malloc(totlen, M_TEMP, M_WAITOK);
2773                 error = copyin(io->pfrio_buffer, pfras, totlen);
2774                 if (error) {
2775                         free(pfras, M_TEMP);
2776                         break;
2777                 }
2778                 PF_RULES_RLOCK();
2779                 error = pfr_tst_addrs(&io->pfrio_table, pfras,
2780                     io->pfrio_size, &io->pfrio_nmatch, io->pfrio_flags |
2781                     PFR_FLAG_USERIOCTL);
2782                 PF_RULES_RUNLOCK();
2783                 if (error == 0)
2784                         error = copyout(pfras, io->pfrio_buffer, totlen);
2785                 free(pfras, M_TEMP);
2786                 break;
2787         }
2788
2789         case DIOCRINADEFINE: {
2790                 struct pfioc_table *io = (struct pfioc_table *)addr;
2791                 struct pfr_addr *pfras;
2792                 size_t totlen;
2793
2794                 if (io->pfrio_esize != sizeof(struct pfr_addr)) {
2795                         error = ENODEV;
2796                         break;
2797                 }
2798                 totlen = io->pfrio_size * sizeof(struct pfr_addr);
2799                 pfras = malloc(totlen, M_TEMP, M_WAITOK);
2800                 error = copyin(io->pfrio_buffer, pfras, totlen);
2801                 if (error) {
2802                         free(pfras, M_TEMP);
2803                         break;
2804                 }
2805                 PF_RULES_WLOCK();
2806                 error = pfr_ina_define(&io->pfrio_table, pfras,
2807                     io->pfrio_size, &io->pfrio_nadd, &io->pfrio_naddr,
2808                     io->pfrio_ticket, io->pfrio_flags | PFR_FLAG_USERIOCTL);
2809                 PF_RULES_WUNLOCK();
2810                 free(pfras, M_TEMP);
2811                 break;
2812         }
2813
2814         case DIOCOSFPADD: {
2815                 struct pf_osfp_ioctl *io = (struct pf_osfp_ioctl *)addr;
2816                 PF_RULES_WLOCK();
2817                 error = pf_osfp_add(io);
2818                 PF_RULES_WUNLOCK();
2819                 break;
2820         }
2821
2822         case DIOCOSFPGET: {
2823                 struct pf_osfp_ioctl *io = (struct pf_osfp_ioctl *)addr;
2824                 PF_RULES_RLOCK();
2825                 error = pf_osfp_get(io);
2826                 PF_RULES_RUNLOCK();
2827                 break;
2828         }
2829
2830         case DIOCXBEGIN: {
2831                 struct pfioc_trans      *io = (struct pfioc_trans *)addr;
2832                 struct pfioc_trans_e    *ioes, *ioe;
2833                 size_t                   totlen;
2834                 int                      i;
2835
2836                 if (io->esize != sizeof(*ioe)) {
2837                         error = ENODEV;
2838                         break;
2839                 }
2840                 totlen = sizeof(struct pfioc_trans_e) * io->size;
2841                 ioes = malloc(totlen, M_TEMP, M_WAITOK);
2842                 error = copyin(io->array, ioes, totlen);
2843                 if (error) {
2844                         free(ioes, M_TEMP);
2845                         break;
2846                 }
2847                 PF_RULES_WLOCK();
2848                 for (i = 0, ioe = ioes; i < io->size; i++, ioe++) {
2849                         switch (ioe->rs_num) {
2850 #ifdef ALTQ
2851                         case PF_RULESET_ALTQ:
2852                                 if (ioe->anchor[0]) {
2853                                         PF_RULES_WUNLOCK();
2854                                         free(ioes, M_TEMP);
2855                                         error = EINVAL;
2856                                         goto fail;
2857                                 }
2858                                 if ((error = pf_begin_altq(&ioe->ticket))) {
2859                                         PF_RULES_WUNLOCK();
2860                                         free(ioes, M_TEMP);
2861                                         goto fail;
2862                                 }
2863                                 break;
2864 #endif /* ALTQ */
2865                         case PF_RULESET_TABLE:
2866                             {
2867                                 struct pfr_table table;
2868
2869                                 bzero(&table, sizeof(table));
2870                                 strlcpy(table.pfrt_anchor, ioe->anchor,
2871                                     sizeof(table.pfrt_anchor));
2872                                 if ((error = pfr_ina_begin(&table,
2873                                     &ioe->ticket, NULL, 0))) {
2874                                         PF_RULES_WUNLOCK();
2875                                         free(ioes, M_TEMP);
2876                                         goto fail;
2877                                 }
2878                                 break;
2879                             }
2880                         default:
2881                                 if ((error = pf_begin_rules(&ioe->ticket,
2882                                     ioe->rs_num, ioe->anchor))) {
2883                                         PF_RULES_WUNLOCK();
2884                                         free(ioes, M_TEMP);
2885                                         goto fail;
2886                                 }
2887                                 break;
2888                         }
2889                 }
2890                 PF_RULES_WUNLOCK();
2891                 error = copyout(ioes, io->array, totlen);
2892                 free(ioes, M_TEMP);
2893                 break;
2894         }
2895
2896         case DIOCXROLLBACK: {
2897                 struct pfioc_trans      *io = (struct pfioc_trans *)addr;
2898                 struct pfioc_trans_e    *ioe, *ioes;
2899                 size_t                   totlen;
2900                 int                      i;
2901
2902                 if (io->esize != sizeof(*ioe)) {
2903                         error = ENODEV;
2904                         break;
2905                 }
2906                 totlen = sizeof(struct pfioc_trans_e) * io->size;
2907                 ioes = malloc(totlen, M_TEMP, M_WAITOK);
2908                 error = copyin(io->array, ioes, totlen);
2909                 if (error) {
2910                         free(ioes, M_TEMP);
2911                         break;
2912                 }
2913                 PF_RULES_WLOCK();
2914                 for (i = 0, ioe = ioes; i < io->size; i++, ioe++) {
2915                         switch (ioe->rs_num) {
2916 #ifdef ALTQ
2917                         case PF_RULESET_ALTQ:
2918                                 if (ioe->anchor[0]) {
2919                                         PF_RULES_WUNLOCK();
2920                                         free(ioes, M_TEMP);
2921                                         error = EINVAL;
2922                                         goto fail;
2923                                 }
2924                                 if ((error = pf_rollback_altq(ioe->ticket))) {
2925                                         PF_RULES_WUNLOCK();
2926                                         free(ioes, M_TEMP);
2927                                         goto fail; /* really bad */
2928                                 }
2929                                 break;
2930 #endif /* ALTQ */
2931                         case PF_RULESET_TABLE:
2932                             {
2933                                 struct pfr_table table;
2934
2935                                 bzero(&table, sizeof(table));
2936                                 strlcpy(table.pfrt_anchor, ioe->anchor,
2937                                     sizeof(table.pfrt_anchor));
2938                                 if ((error = pfr_ina_rollback(&table,
2939                                     ioe->ticket, NULL, 0))) {
2940                                         PF_RULES_WUNLOCK();
2941                                         free(ioes, M_TEMP);
2942                                         goto fail; /* really bad */
2943                                 }
2944                                 break;
2945                             }
2946                         default:
2947                                 if ((error = pf_rollback_rules(ioe->ticket,
2948                                     ioe->rs_num, ioe->anchor))) {
2949                                         PF_RULES_WUNLOCK();
2950                                         free(ioes, M_TEMP);
2951                                         goto fail; /* really bad */
2952                                 }
2953                                 break;
2954                         }
2955                 }
2956                 PF_RULES_WUNLOCK();
2957                 free(ioes, M_TEMP);
2958                 break;
2959         }
2960
2961         case DIOCXCOMMIT: {
2962                 struct pfioc_trans      *io = (struct pfioc_trans *)addr;
2963                 struct pfioc_trans_e    *ioe, *ioes;
2964                 struct pf_ruleset       *rs;
2965                 size_t                   totlen;
2966                 int                      i;
2967
2968                 if (io->esize != sizeof(*ioe)) {
2969                         error = ENODEV;
2970                         break;
2971                 }
2972                 totlen = sizeof(struct pfioc_trans_e) * io->size;
2973                 ioes = malloc(totlen, M_TEMP, M_WAITOK);
2974                 error = copyin(io->array, ioes, totlen);
2975                 if (error) {
2976                         free(ioes, M_TEMP);
2977                         break;
2978                 }
2979                 PF_RULES_WLOCK();
2980                 /* First makes sure everything will succeed. */
2981                 for (i = 0, ioe = ioes; i < io->size; i++, ioe++) {
2982                         switch (ioe->rs_num) {
2983 #ifdef ALTQ
2984                         case PF_RULESET_ALTQ:
2985                                 if (ioe->anchor[0]) {
2986                                         PF_RULES_WUNLOCK();
2987                                         free(ioes, M_TEMP);
2988                                         error = EINVAL;
2989                                         goto fail;
2990                                 }
2991                                 if (!V_altqs_inactive_open || ioe->ticket !=
2992                                     V_ticket_altqs_inactive) {
2993                                         PF_RULES_WUNLOCK();
2994                                         free(ioes, M_TEMP);
2995                                         error = EBUSY;
2996                                         goto fail;
2997                                 }
2998                                 break;
2999 #endif /* ALTQ */
3000                         case PF_RULESET_TABLE:
3001                                 rs = pf_find_ruleset(ioe->anchor);
3002                                 if (rs == NULL || !rs->topen || ioe->ticket !=
3003                                     rs->tticket) {
3004                                         PF_RULES_WUNLOCK();
3005                                         free(ioes, M_TEMP);
3006                                         error = EBUSY;
3007                                         goto fail;
3008                                 }
3009                                 break;
3010                         default:
3011                                 if (ioe->rs_num < 0 || ioe->rs_num >=
3012                                     PF_RULESET_MAX) {
3013                                         PF_RULES_WUNLOCK();
3014                                         free(ioes, M_TEMP);
3015                                         error = EINVAL;
3016                                         goto fail;
3017                                 }
3018                                 rs = pf_find_ruleset(ioe->anchor);
3019                                 if (rs == NULL ||
3020                                     !rs->rules[ioe->rs_num].inactive.open ||
3021                                     rs->rules[ioe->rs_num].inactive.ticket !=
3022                                     ioe->ticket) {
3023                                         PF_RULES_WUNLOCK();
3024                                         free(ioes, M_TEMP);
3025                                         error = EBUSY;
3026                                         goto fail;
3027                                 }
3028                                 break;
3029                         }
3030                 }
3031                 /* Now do the commit - no errors should happen here. */
3032                 for (i = 0, ioe = ioes; i < io->size; i++, ioe++) {
3033                         switch (ioe->rs_num) {
3034 #ifdef ALTQ
3035                         case PF_RULESET_ALTQ:
3036                                 if ((error = pf_commit_altq(ioe->ticket))) {
3037                                         PF_RULES_WUNLOCK();
3038                                         free(ioes, M_TEMP);
3039                                         goto fail; /* really bad */
3040                                 }
3041                                 break;
3042 #endif /* ALTQ */
3043                         case PF_RULESET_TABLE:
3044                             {
3045                                 struct pfr_table table;
3046
3047                                 bzero(&table, sizeof(table));
3048                                 strlcpy(table.pfrt_anchor, ioe->anchor,
3049                                     sizeof(table.pfrt_anchor));
3050                                 if ((error = pfr_ina_commit(&table,
3051                                     ioe->ticket, NULL, NULL, 0))) {
3052                                         PF_RULES_WUNLOCK();
3053                                         free(ioes, M_TEMP);
3054                                         goto fail; /* really bad */
3055                                 }
3056                                 break;
3057                             }
3058                         default:
3059                                 if ((error = pf_commit_rules(ioe->ticket,
3060                                     ioe->rs_num, ioe->anchor))) {
3061                                         PF_RULES_WUNLOCK();
3062                                         free(ioes, M_TEMP);
3063                                         goto fail; /* really bad */
3064                                 }
3065                                 break;
3066                         }
3067                 }
3068                 PF_RULES_WUNLOCK();
3069                 free(ioes, M_TEMP);
3070                 break;
3071         }
3072
3073         case DIOCGETSRCNODES: {
3074                 struct pfioc_src_nodes  *psn = (struct pfioc_src_nodes *)addr;
3075                 struct pf_srchash       *sh;
3076                 struct pf_src_node      *n, *p, *pstore;
3077                 uint32_t                 i, nr = 0;
3078
3079                 if (psn->psn_len == 0) {
3080                         for (i = 0, sh = V_pf_srchash; i <= V_pf_srchashmask;
3081                             i++, sh++) {
3082                                 PF_HASHROW_LOCK(sh);
3083                                 LIST_FOREACH(n, &sh->nodes, entry)
3084                                         nr++;
3085                                 PF_HASHROW_UNLOCK(sh);
3086                         }
3087                         psn->psn_len = sizeof(struct pf_src_node) * nr;
3088                         break;
3089                 }
3090
3091                 p = pstore = malloc(psn->psn_len, M_TEMP, M_WAITOK);
3092                 for (i = 0, sh = V_pf_srchash; i <= V_pf_srchashmask;
3093                     i++, sh++) {
3094                     PF_HASHROW_LOCK(sh);
3095                     LIST_FOREACH(n, &sh->nodes, entry) {
3096                         int     secs = time_uptime, diff;
3097
3098                         if ((nr + 1) * sizeof(*p) > (unsigned)psn->psn_len)
3099                                 break;
3100
3101                         bcopy(n, p, sizeof(struct pf_src_node));
3102                         if (n->rule.ptr != NULL)
3103                                 p->rule.nr = n->rule.ptr->nr;
3104                         p->creation = secs - p->creation;
3105                         if (p->expire > secs)
3106                                 p->expire -= secs;
3107                         else
3108                                 p->expire = 0;
3109
3110                         /* Adjust the connection rate estimate. */
3111                         diff = secs - n->conn_rate.last;
3112                         if (diff >= n->conn_rate.seconds)
3113                                 p->conn_rate.count = 0;
3114                         else
3115                                 p->conn_rate.count -=
3116                                     n->conn_rate.count * diff /
3117                                     n->conn_rate.seconds;
3118                         p++;
3119                         nr++;
3120                     }
3121                     PF_HASHROW_UNLOCK(sh);
3122                 }
3123                 error = copyout(pstore, psn->psn_src_nodes,
3124                     sizeof(struct pf_src_node) * nr);
3125                 if (error) {
3126                         free(pstore, M_TEMP);
3127                         break;
3128                 }
3129                 psn->psn_len = sizeof(struct pf_src_node) * nr;
3130                 free(pstore, M_TEMP);
3131                 break;
3132         }
3133
3134         case DIOCCLRSRCNODES: {
3135
3136                 pf_clear_srcnodes(NULL);
3137                 pf_purge_expired_src_nodes();
3138                 V_pf_status.src_nodes = 0;
3139                 break;
3140         }
3141
3142         case DIOCKILLSRCNODES: {
3143                 struct pfioc_src_node_kill *psnk =
3144                     (struct pfioc_src_node_kill *)addr;
3145                 struct pf_srchash       *sh;
3146                 struct pf_src_node      *sn;
3147                 u_int                   i, killed = 0;
3148
3149                 for (i = 0, sh = V_pf_srchash; i < V_pf_srchashmask;
3150                     i++, sh++) {
3151                     /*
3152                      * XXXGL: we don't ever acquire sources hash lock
3153                      * but if we ever do, the below call to pf_clear_srcnodes()
3154                      * would lead to a LOR.
3155                      */
3156                     PF_HASHROW_LOCK(sh);
3157                     LIST_FOREACH(sn, &sh->nodes, entry)
3158                         if (PF_MATCHA(psnk->psnk_src.neg,
3159                                 &psnk->psnk_src.addr.v.a.addr,
3160                                 &psnk->psnk_src.addr.v.a.mask,
3161                                 &sn->addr, sn->af) &&
3162                             PF_MATCHA(psnk->psnk_dst.neg,
3163                                 &psnk->psnk_dst.addr.v.a.addr,
3164                                 &psnk->psnk_dst.addr.v.a.mask,
3165                                 &sn->raddr, sn->af)) {
3166                                 /* Handle state to src_node linkage */
3167                                 if (sn->states != 0)
3168                                         pf_clear_srcnodes(sn);
3169                                 sn->expire = 1;
3170                                 killed++;
3171                         }
3172                     PF_HASHROW_UNLOCK(sh);
3173                 }
3174
3175                 if (killed > 0)
3176                         pf_purge_expired_src_nodes();
3177
3178                 psnk->psnk_killed = killed;
3179                 break;
3180         }
3181
3182         case DIOCSETHOSTID: {
3183                 u_int32_t       *hostid = (u_int32_t *)addr;
3184
3185                 PF_RULES_WLOCK();
3186                 if (*hostid == 0)
3187                         V_pf_status.hostid = arc4random();
3188                 else
3189                         V_pf_status.hostid = *hostid;
3190                 PF_RULES_WUNLOCK();
3191                 break;
3192         }
3193
3194         case DIOCOSFPFLUSH:
3195                 PF_RULES_WLOCK();
3196                 pf_osfp_flush();
3197                 PF_RULES_WUNLOCK();
3198                 break;
3199
3200         case DIOCIGETIFACES: {
3201                 struct pfioc_iface *io = (struct pfioc_iface *)addr;
3202                 struct pfi_kif *ifstore;
3203                 size_t bufsiz;
3204
3205                 if (io->pfiio_esize != sizeof(struct pfi_kif)) {
3206                         error = ENODEV;
3207                         break;
3208                 }
3209
3210                 bufsiz = io->pfiio_size * sizeof(struct pfi_kif);
3211                 ifstore = malloc(bufsiz, M_TEMP, M_WAITOK);
3212                 PF_RULES_RLOCK();
3213                 pfi_get_ifaces(io->pfiio_name, ifstore, &io->pfiio_size);
3214                 PF_RULES_RUNLOCK();
3215                 error = copyout(ifstore, io->pfiio_buffer, bufsiz);
3216                 free(ifstore, M_TEMP);
3217                 break;
3218         }
3219
3220         case DIOCSETIFFLAG: {
3221                 struct pfioc_iface *io = (struct pfioc_iface *)addr;
3222
3223                 PF_RULES_WLOCK();
3224                 error = pfi_set_flags(io->pfiio_name, io->pfiio_flags);
3225                 PF_RULES_WUNLOCK();
3226                 break;
3227         }
3228
3229         case DIOCCLRIFFLAG: {
3230                 struct pfioc_iface *io = (struct pfioc_iface *)addr;
3231
3232                 PF_RULES_WLOCK();
3233                 error = pfi_clear_flags(io->pfiio_name, io->pfiio_flags);
3234                 PF_RULES_WUNLOCK();
3235                 break;
3236         }
3237
3238         default:
3239                 error = ENODEV;
3240                 break;
3241         }
3242 fail:
3243         CURVNET_RESTORE();
3244
3245         return (error);
3246 }
3247
3248 void
3249 pfsync_state_export(struct pfsync_state *sp, struct pf_state *st)
3250 {
3251         bzero(sp, sizeof(struct pfsync_state));
3252
3253         /* copy from state key */
3254         sp->key[PF_SK_WIRE].addr[0] = st->key[PF_SK_WIRE]->addr[0];
3255         sp->key[PF_SK_WIRE].addr[1] = st->key[PF_SK_WIRE]->addr[1];
3256         sp->key[PF_SK_WIRE].port[0] = st->key[PF_SK_WIRE]->port[0];
3257         sp->key[PF_SK_WIRE].port[1] = st->key[PF_SK_WIRE]->port[1];
3258         sp->key[PF_SK_STACK].addr[0] = st->key[PF_SK_STACK]->addr[0];
3259         sp->key[PF_SK_STACK].addr[1] = st->key[PF_SK_STACK]->addr[1];
3260         sp->key[PF_SK_STACK].port[0] = st->key[PF_SK_STACK]->port[0];
3261         sp->key[PF_SK_STACK].port[1] = st->key[PF_SK_STACK]->port[1];
3262         sp->proto = st->key[PF_SK_WIRE]->proto;
3263         sp->af = st->key[PF_SK_WIRE]->af;
3264
3265         /* copy from state */
3266         strlcpy(sp->ifname, st->kif->pfik_name, sizeof(sp->ifname));
3267         bcopy(&st->rt_addr, &sp->rt_addr, sizeof(sp->rt_addr));
3268         sp->creation = htonl(time_uptime - st->creation);
3269         sp->expire = pf_state_expires(st);
3270         if (sp->expire <= time_uptime)
3271                 sp->expire = htonl(0);
3272         else
3273                 sp->expire = htonl(sp->expire - time_uptime);
3274
3275         sp->direction = st->direction;
3276         sp->log = st->log;
3277         sp->timeout = st->timeout;
3278         sp->state_flags = st->state_flags;
3279         if (st->src_node)
3280                 sp->sync_flags |= PFSYNC_FLAG_SRCNODE;
3281         if (st->nat_src_node)
3282                 sp->sync_flags |= PFSYNC_FLAG_NATSRCNODE;
3283
3284         sp->id = st->id;
3285         sp->creatorid = st->creatorid;
3286         pf_state_peer_hton(&st->src, &sp->src);
3287         pf_state_peer_hton(&st->dst, &sp->dst);
3288
3289         if (st->rule.ptr == NULL)
3290                 sp->rule = htonl(-1);
3291         else
3292                 sp->rule = htonl(st->rule.ptr->nr);
3293         if (st->anchor.ptr == NULL)
3294                 sp->anchor = htonl(-1);
3295         else
3296                 sp->anchor = htonl(st->anchor.ptr->nr);
3297         if (st->nat_rule.ptr == NULL)
3298                 sp->nat_rule = htonl(-1);
3299         else
3300                 sp->nat_rule = htonl(st->nat_rule.ptr->nr);
3301
3302         pf_state_counter_hton(st->packets[0], sp->packets[0]);
3303         pf_state_counter_hton(st->packets[1], sp->packets[1]);
3304         pf_state_counter_hton(st->bytes[0], sp->bytes[0]);
3305         pf_state_counter_hton(st->bytes[1], sp->bytes[1]);
3306
3307 }
3308
3309 static void
3310 pf_tbladdr_copyout(struct pf_addr_wrap *aw)
3311 {
3312         struct pfr_ktable *kt;
3313
3314         KASSERT(aw->type == PF_ADDR_TABLE, ("%s: type %u", __func__, aw->type));
3315
3316         kt = aw->p.tbl;
3317         if (!(kt->pfrkt_flags & PFR_TFLAG_ACTIVE) && kt->pfrkt_root != NULL)
3318                 kt = kt->pfrkt_root;
3319         aw->p.tbl = NULL;
3320         aw->p.tblcnt = (kt->pfrkt_flags & PFR_TFLAG_ACTIVE) ?
3321                 kt->pfrkt_cnt : -1;
3322 }
3323
3324 /*
3325  * XXX - Check for version missmatch!!!
3326  */
3327 static void
3328 pf_clear_states(void)
3329 {
3330         struct pf_state *s;
3331         u_int i;
3332
3333         for (i = 0; i <= V_pf_hashmask; i++) {
3334                 struct pf_idhash *ih = &V_pf_idhash[i];
3335 relock:
3336                 PF_HASHROW_LOCK(ih);
3337                 LIST_FOREACH(s, &ih->states, entry) {
3338                         s->timeout = PFTM_PURGE;
3339                         /* Don't send out individual delete messages. */
3340                         s->sync_state = PFSTATE_NOSYNC;
3341                         pf_unlink_state(s, PF_ENTER_LOCKED);
3342                         goto relock;
3343                 }
3344                 PF_HASHROW_UNLOCK(ih);
3345         }
3346 }
3347
3348 static int
3349 pf_clear_tables(void)
3350 {
3351         struct pfioc_table io;
3352         int error;
3353
3354         bzero(&io, sizeof(io));
3355
3356         error = pfr_clr_tables(&io.pfrio_table, &io.pfrio_ndel,
3357             io.pfrio_flags);
3358
3359         return (error);
3360 }
3361
3362 static void
3363 pf_clear_srcnodes(struct pf_src_node *n)
3364 {
3365         struct pf_state *s;
3366         int i;
3367
3368         for (i = 0; i <= V_pf_hashmask; i++) {
3369                 struct pf_idhash *ih = &V_pf_idhash[i];
3370
3371                 PF_HASHROW_LOCK(ih);
3372                 LIST_FOREACH(s, &ih->states, entry) {
3373                         if (n == NULL || n == s->src_node)
3374                                 s->src_node = NULL;
3375                         if (n == NULL || n == s->nat_src_node)
3376                                 s->nat_src_node = NULL;
3377                 }
3378                 PF_HASHROW_UNLOCK(ih);
3379         }
3380
3381         if (n == NULL) {
3382                 struct pf_srchash *sh;
3383
3384                 for (i = 0, sh = V_pf_srchash; i <= V_pf_srchashmask;
3385                     i++, sh++) {
3386                         PF_HASHROW_LOCK(sh);
3387                         LIST_FOREACH(n, &sh->nodes, entry) {
3388                                 n->expire = 1;
3389                                 n->states = 0;
3390                         }
3391                         PF_HASHROW_UNLOCK(sh);
3392                 }
3393         } else {
3394                 /* XXX: hash slot should already be locked here. */
3395                 n->expire = 1;
3396                 n->states = 0;
3397         }
3398 }
3399 /*
3400  * XXX - Check for version missmatch!!!
3401  */
3402
3403 /*
3404  * Duplicate pfctl -Fa operation to get rid of as much as we can.
3405  */
3406 static int
3407 shutdown_pf(void)
3408 {
3409         int error = 0;
3410         u_int32_t t[5];
3411         char nn = '\0';
3412
3413         V_pf_status.running = 0;
3414         do {
3415                 if ((error = pf_begin_rules(&t[0], PF_RULESET_SCRUB, &nn))
3416                     != 0) {
3417                         DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: SCRUB\n"));
3418                         break;
3419                 }
3420                 if ((error = pf_begin_rules(&t[1], PF_RULESET_FILTER, &nn))
3421                     != 0) {
3422                         DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: FILTER\n"));
3423                         break;          /* XXX: rollback? */
3424                 }
3425                 if ((error = pf_begin_rules(&t[2], PF_RULESET_NAT, &nn))
3426                     != 0) {
3427                         DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: NAT\n"));
3428                         break;          /* XXX: rollback? */
3429                 }
3430                 if ((error = pf_begin_rules(&t[3], PF_RULESET_BINAT, &nn))
3431                     != 0) {
3432                         DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: BINAT\n"));
3433                         break;          /* XXX: rollback? */
3434                 }
3435                 if ((error = pf_begin_rules(&t[4], PF_RULESET_RDR, &nn))
3436                     != 0) {
3437                         DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: RDR\n"));
3438                         break;          /* XXX: rollback? */
3439                 }
3440
3441                 /* XXX: these should always succeed here */
3442                 pf_commit_rules(t[0], PF_RULESET_SCRUB, &nn);
3443                 pf_commit_rules(t[1], PF_RULESET_FILTER, &nn);
3444                 pf_commit_rules(t[2], PF_RULESET_NAT, &nn);
3445                 pf_commit_rules(t[3], PF_RULESET_BINAT, &nn);
3446                 pf_commit_rules(t[4], PF_RULESET_RDR, &nn);
3447
3448                 if ((error = pf_clear_tables()) != 0)
3449                         break;
3450
3451 #ifdef ALTQ
3452                 if ((error = pf_begin_altq(&t[0])) != 0) {
3453                         DPFPRINTF(PF_DEBUG_MISC, ("shutdown_pf: ALTQ\n"));
3454                         break;
3455                 }
3456                 pf_commit_altq(t[0]);
3457 #endif
3458
3459                 pf_clear_states();
3460
3461                 pf_clear_srcnodes(NULL);
3462
3463                 /* status does not use malloced mem so no need to cleanup */
3464                 /* fingerprints and interfaces have thier own cleanup code */
3465         } while(0);
3466
3467         return (error);
3468 }
3469
3470 #ifdef INET
3471 static int
3472 pf_check_in(void *arg, struct mbuf **m, struct ifnet *ifp, int dir,
3473     struct inpcb *inp)
3474 {
3475         int chk;
3476
3477         chk = pf_test(PF_IN, ifp, m, inp);
3478         if (chk && *m) {
3479                 m_freem(*m);
3480                 *m = NULL;
3481         }
3482
3483         return (chk);
3484 }
3485
3486 static int
3487 pf_check_out(void *arg, struct mbuf **m, struct ifnet *ifp, int dir,
3488     struct inpcb *inp)
3489 {
3490         int chk;
3491
3492         /* We need a proper CSUM befor we start (s. OpenBSD ip_output) */
3493         if ((*m)->m_pkthdr.csum_flags & CSUM_DELAY_DATA) {
3494                 in_delayed_cksum(*m);
3495                 (*m)->m_pkthdr.csum_flags &= ~CSUM_DELAY_DATA;
3496         }
3497
3498         chk = pf_test(PF_OUT, ifp, m, inp);
3499         if (chk && *m) {
3500                 m_freem(*m);
3501                 *m = NULL;
3502         }
3503
3504         return (chk);
3505 }
3506 #endif
3507
3508 #ifdef INET6
3509 static int
3510 pf_check6_in(void *arg, struct mbuf **m, struct ifnet *ifp, int dir,
3511     struct inpcb *inp)
3512 {
3513         int chk;
3514
3515         /*
3516          * In case of loopback traffic IPv6 uses the real interface in
3517          * order to support scoped addresses. In order to support stateful
3518          * filtering we have change this to lo0 as it is the case in IPv4.
3519          */
3520         CURVNET_SET(ifp->if_vnet);
3521         chk = pf_test6(PF_IN, (*m)->m_flags & M_LOOP ? V_loif : ifp, m, inp);
3522         CURVNET_RESTORE();
3523         if (chk && *m) {
3524                 m_freem(*m);
3525                 *m = NULL;
3526         }
3527         return chk;
3528 }
3529
3530 static int
3531 pf_check6_out(void *arg, struct mbuf **m, struct ifnet *ifp, int dir,
3532     struct inpcb *inp)
3533 {
3534         int chk;
3535
3536         /* We need a proper CSUM before we start (s. OpenBSD ip_output) */
3537         if ((*m)->m_pkthdr.csum_flags & CSUM_DELAY_DATA) {
3538 #ifdef INET
3539                 /* XXX-BZ copy&paste error from r126261? */
3540                 in_delayed_cksum(*m);
3541 #endif
3542                 (*m)->m_pkthdr.csum_flags &= ~CSUM_DELAY_DATA;
3543         }
3544         CURVNET_SET(ifp->if_vnet);
3545         chk = pf_test6(PF_OUT, ifp, m, inp);
3546         CURVNET_RESTORE();
3547         if (chk && *m) {
3548                 m_freem(*m);
3549                 *m = NULL;
3550         }
3551         return chk;
3552 }
3553 #endif /* INET6 */
3554
3555 static int
3556 hook_pf(void)
3557 {
3558 #ifdef INET
3559         struct pfil_head *pfh_inet;
3560 #endif
3561 #ifdef INET6
3562         struct pfil_head *pfh_inet6;
3563 #endif
3564
3565         if (V_pf_pfil_hooked)
3566                 return (0);
3567
3568 #ifdef INET
3569         pfh_inet = pfil_head_get(PFIL_TYPE_AF, AF_INET);
3570         if (pfh_inet == NULL)
3571                 return (ESRCH); /* XXX */
3572         pfil_add_hook(pf_check_in, NULL, PFIL_IN | PFIL_WAITOK, pfh_inet);
3573         pfil_add_hook(pf_check_out, NULL, PFIL_OUT | PFIL_WAITOK, pfh_inet);
3574 #endif
3575 #ifdef INET6
3576         pfh_inet6 = pfil_head_get(PFIL_TYPE_AF, AF_INET6);
3577         if (pfh_inet6 == NULL) {
3578 #ifdef INET
3579                 pfil_remove_hook(pf_check_in, NULL, PFIL_IN | PFIL_WAITOK,
3580                     pfh_inet);
3581                 pfil_remove_hook(pf_check_out, NULL, PFIL_OUT | PFIL_WAITOK,
3582                     pfh_inet);
3583 #endif
3584                 return (ESRCH); /* XXX */
3585         }
3586         pfil_add_hook(pf_check6_in, NULL, PFIL_IN | PFIL_WAITOK, pfh_inet6);
3587         pfil_add_hook(pf_check6_out, NULL, PFIL_OUT | PFIL_WAITOK, pfh_inet6);
3588 #endif
3589
3590         V_pf_pfil_hooked = 1;
3591         return (0);
3592 }
3593
3594 static int
3595 dehook_pf(void)
3596 {
3597 #ifdef INET
3598         struct pfil_head *pfh_inet;
3599 #endif
3600 #ifdef INET6
3601         struct pfil_head *pfh_inet6;
3602 #endif
3603
3604         if (V_pf_pfil_hooked == 0)
3605                 return (0);
3606
3607 #ifdef INET
3608         pfh_inet = pfil_head_get(PFIL_TYPE_AF, AF_INET);
3609         if (pfh_inet == NULL)
3610                 return (ESRCH); /* XXX */
3611         pfil_remove_hook(pf_check_in, NULL, PFIL_IN | PFIL_WAITOK,
3612             pfh_inet);
3613         pfil_remove_hook(pf_check_out, NULL, PFIL_OUT | PFIL_WAITOK,
3614             pfh_inet);
3615 #endif
3616 #ifdef INET6
3617         pfh_inet6 = pfil_head_get(PFIL_TYPE_AF, AF_INET6);
3618         if (pfh_inet6 == NULL)
3619                 return (ESRCH); /* XXX */
3620         pfil_remove_hook(pf_check6_in, NULL, PFIL_IN | PFIL_WAITOK,
3621             pfh_inet6);
3622         pfil_remove_hook(pf_check6_out, NULL, PFIL_OUT | PFIL_WAITOK,
3623             pfh_inet6);
3624 #endif
3625
3626         V_pf_pfil_hooked = 0;
3627         return (0);
3628 }
3629
3630 static int
3631 pf_load(void)
3632 {
3633         int error;
3634
3635         VNET_ITERATOR_DECL(vnet_iter);
3636
3637         VNET_LIST_RLOCK();
3638         VNET_FOREACH(vnet_iter) {
3639                 CURVNET_SET(vnet_iter);
3640                 V_pf_pfil_hooked = 0;
3641                 V_pf_end_threads = 0;
3642                 TAILQ_INIT(&V_pf_tags);
3643                 TAILQ_INIT(&V_pf_qids);
3644                 CURVNET_RESTORE();
3645         }
3646         VNET_LIST_RUNLOCK();
3647
3648         rw_init(&pf_rules_lock, "pf rulesets");
3649
3650         pf_dev = make_dev(&pf_cdevsw, 0, 0, 0, 0600, PF_NAME);
3651         if ((error = pfattach()) != 0)
3652                 return (error);
3653
3654         return (0);
3655 }
3656
3657 static int
3658 pf_unload(void)
3659 {
3660         int error = 0;
3661
3662         PF_RULES_WLOCK();
3663         V_pf_status.running = 0;
3664         PF_RULES_WUNLOCK();
3665         swi_remove(V_pf_swi_cookie);
3666         error = dehook_pf();
3667         if (error) {
3668                 /*
3669                  * Should not happen!
3670                  * XXX Due to error code ESRCH, kldunload will show
3671                  * a message like 'No such process'.
3672                  */
3673                 printf("%s : pfil unregisteration fail\n", __FUNCTION__);
3674                 return error;
3675         }
3676         PF_RULES_WLOCK();
3677         shutdown_pf();
3678         V_pf_end_threads = 1;
3679         while (V_pf_end_threads < 2) {
3680                 wakeup_one(pf_purge_thread);
3681                 rw_sleep(pf_purge_thread, &pf_rules_lock, 0, "pftmo", 0);
3682         }
3683         pf_normalize_cleanup();
3684         pfi_cleanup();
3685         pfr_cleanup();
3686         pf_osfp_flush();
3687         pf_cleanup();
3688         PF_RULES_WUNLOCK();
3689         destroy_dev(pf_dev);
3690         rw_destroy(&pf_rules_lock);
3691
3692         return (error);
3693 }
3694
3695 static int
3696 pf_modevent(module_t mod, int type, void *data)
3697 {
3698         int error = 0;
3699
3700         switch(type) {
3701         case MOD_LOAD:
3702                 error = pf_load();
3703                 break;
3704         case MOD_QUIESCE:
3705                 /*
3706                  * Module should not be unloaded due to race conditions.
3707                  */
3708                 error = EBUSY;
3709                 break;
3710         case MOD_UNLOAD:
3711                 error = pf_unload();
3712                 break;
3713         default:
3714                 error = EINVAL;
3715                 break;
3716         }
3717
3718         return (error);
3719 }
3720
3721 static moduledata_t pf_mod = {
3722         "pf",
3723         pf_modevent,
3724         0
3725 };
3726
3727 DECLARE_MODULE(pf, pf_mod, SI_SUB_PSEUDO, SI_ORDER_FIRST);
3728 MODULE_VERSION(pf, PF_MODVER);