2 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
4 * Copyright (c) 2002 Cedric Berger
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
11 * - Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * - Redistributions in binary form must reproduce the above
14 * copyright notice, this list of conditions and the following
15 * disclaimer in the documentation and/or other materials provided
16 * with the distribution.
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
21 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
22 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
23 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
24 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
25 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
26 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
28 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 * POSSIBILITY OF SUCH DAMAGE.
31 * $OpenBSD: pf_table.c,v 1.79 2008/10/08 06:24:50 mcbride Exp $
34 #include <sys/cdefs.h>
35 __FBSDID("$FreeBSD$");
38 #include "opt_inet6.h"
40 #include <sys/param.h>
41 #include <sys/kernel.h>
43 #include <sys/malloc.h>
45 #include <sys/mutex.h>
46 #include <sys/refcount.h>
47 #include <sys/rwlock.h>
48 #include <sys/socket.h>
53 #include <net/pfvar.h>
55 #define ACCEPT_FLAGS(flags, oklist) \
57 if ((flags & ~(oklist)) & \
62 #define FILLIN_SIN(sin, addr) \
64 (sin).sin_len = sizeof(sin); \
65 (sin).sin_family = AF_INET; \
66 (sin).sin_addr = (addr); \
69 #define FILLIN_SIN6(sin6, addr) \
71 (sin6).sin6_len = sizeof(sin6); \
72 (sin6).sin6_family = AF_INET6; \
73 (sin6).sin6_addr = (addr); \
76 #define SWAP(type, a1, a2) \
83 #define SUNION2PF(su, af) (((af)==AF_INET) ? \
84 (struct pf_addr *)&(su)->sin.sin_addr : \
85 (struct pf_addr *)&(su)->sin6.sin6_addr)
87 #define AF_BITS(af) (((af)==AF_INET)?32:128)
88 #define ADDR_NETWORK(ad) ((ad)->pfra_net < AF_BITS((ad)->pfra_af))
89 #define KENTRY_NETWORK(ke) ((ke)->pfrke_net < AF_BITS((ke)->pfrke_af))
90 #define KENTRY_RNF_ROOT(ke) \
91 ((((struct radix_node *)(ke))->rn_flags & RNF_ROOT) != 0)
93 #define NO_ADDRESSES (-1)
94 #define ENQUEUE_UNMARKED_ONLY (1)
95 #define INVERT_NEG_FLAG (1)
108 struct pfr_addr *pfrw1_addr;
109 struct pfr_astats *pfrw1_astats;
110 struct pfr_kentryworkq *pfrw1_workq;
111 struct pfr_kentry *pfrw1_kentry;
112 struct pfi_dynaddr *pfrw1_dyn;
116 #define pfrw_addr pfrw_1.pfrw1_addr
117 #define pfrw_astats pfrw_1.pfrw1_astats
118 #define pfrw_workq pfrw_1.pfrw1_workq
119 #define pfrw_kentry pfrw_1.pfrw1_kentry
120 #define pfrw_dyn pfrw_1.pfrw1_dyn
121 #define pfrw_cnt pfrw_free
123 #define senderr(e) do { rv = (e); goto _bad; } while (0)
125 static MALLOC_DEFINE(M_PFTABLE, "pf_table", "pf(4) tables structures");
126 static VNET_DEFINE(uma_zone_t, pfr_kentry_z);
127 #define V_pfr_kentry_z VNET(pfr_kentry_z)
128 static VNET_DEFINE(uma_zone_t, pfr_kcounters_z);
129 #define V_pfr_kcounters_z VNET(pfr_kcounters_z)
131 static struct pf_addr pfr_ffaddr = {
132 .addr32 = { 0xffffffff, 0xffffffff, 0xffffffff, 0xffffffff }
135 static void pfr_copyout_addr(struct pfr_addr *,
136 struct pfr_kentry *ke);
137 static int pfr_validate_addr(struct pfr_addr *);
138 static void pfr_enqueue_addrs(struct pfr_ktable *,
139 struct pfr_kentryworkq *, int *, int);
140 static void pfr_mark_addrs(struct pfr_ktable *);
141 static struct pfr_kentry
142 *pfr_lookup_addr(struct pfr_ktable *,
143 struct pfr_addr *, int);
144 static struct pfr_kentry *pfr_create_kentry(struct pfr_addr *);
145 static void pfr_destroy_kentries(struct pfr_kentryworkq *);
146 static void pfr_destroy_kentry(struct pfr_kentry *);
147 static void pfr_insert_kentries(struct pfr_ktable *,
148 struct pfr_kentryworkq *, long);
149 static void pfr_remove_kentries(struct pfr_ktable *,
150 struct pfr_kentryworkq *);
151 static void pfr_clstats_kentries(struct pfr_kentryworkq *, long,
153 static void pfr_reset_feedback(struct pfr_addr *, int);
154 static void pfr_prepare_network(union sockaddr_union *, int, int);
155 static int pfr_route_kentry(struct pfr_ktable *,
156 struct pfr_kentry *);
157 static int pfr_unroute_kentry(struct pfr_ktable *,
158 struct pfr_kentry *);
159 static int pfr_walktree(struct radix_node *, void *);
160 static int pfr_validate_table(struct pfr_table *, int, int);
161 static int pfr_fix_anchor(char *);
162 static void pfr_commit_ktable(struct pfr_ktable *, long);
163 static void pfr_insert_ktables(struct pfr_ktableworkq *);
164 static void pfr_insert_ktable(struct pfr_ktable *);
165 static void pfr_setflags_ktables(struct pfr_ktableworkq *);
166 static void pfr_setflags_ktable(struct pfr_ktable *, int);
167 static void pfr_clstats_ktables(struct pfr_ktableworkq *, long,
169 static void pfr_clstats_ktable(struct pfr_ktable *, long, int);
170 static struct pfr_ktable
171 *pfr_create_ktable(struct pfr_table *, long, int);
172 static void pfr_destroy_ktables(struct pfr_ktableworkq *, int);
173 static void pfr_destroy_ktable(struct pfr_ktable *, int);
174 static int pfr_ktable_compare(struct pfr_ktable *,
175 struct pfr_ktable *);
176 static struct pfr_ktable
177 *pfr_lookup_table(struct pfr_table *);
178 static void pfr_clean_node_mask(struct pfr_ktable *,
179 struct pfr_kentryworkq *);
180 static int pfr_table_count(struct pfr_table *, int);
181 static int pfr_skip_table(struct pfr_table *,
182 struct pfr_ktable *, int);
183 static struct pfr_kentry
184 *pfr_kentry_byidx(struct pfr_ktable *, int, int);
186 static RB_PROTOTYPE(pfr_ktablehead, pfr_ktable, pfrkt_tree, pfr_ktable_compare);
187 static RB_GENERATE(pfr_ktablehead, pfr_ktable, pfrkt_tree, pfr_ktable_compare);
189 static VNET_DEFINE(struct pfr_ktablehead, pfr_ktables);
190 #define V_pfr_ktables VNET(pfr_ktables)
192 static VNET_DEFINE(struct pfr_table, pfr_nulltable);
193 #define V_pfr_nulltable VNET(pfr_nulltable)
195 static VNET_DEFINE(int, pfr_ktable_cnt);
196 #define V_pfr_ktable_cnt VNET(pfr_ktable_cnt)
202 V_pfr_kentry_z = uma_zcreate("pf table entries",
203 sizeof(struct pfr_kentry), NULL, NULL, NULL, NULL, UMA_ALIGN_PTR,
205 V_pfr_kcounters_z = uma_zcreate("pf table counters",
206 sizeof(struct pfr_kcounters), NULL, NULL, NULL, NULL,
208 V_pf_limits[PF_LIMIT_TABLE_ENTRIES].zone = V_pfr_kentry_z;
209 V_pf_limits[PF_LIMIT_TABLE_ENTRIES].limit = PFR_KENTRY_HIWAT;
216 uma_zdestroy(V_pfr_kentry_z);
217 uma_zdestroy(V_pfr_kcounters_z);
221 pfr_clr_addrs(struct pfr_table *tbl, int *ndel, int flags)
223 struct pfr_ktable *kt;
224 struct pfr_kentryworkq workq;
228 ACCEPT_FLAGS(flags, PFR_FLAG_DUMMY);
229 if (pfr_validate_table(tbl, 0, flags & PFR_FLAG_USERIOCTL))
231 kt = pfr_lookup_table(tbl);
232 if (kt == NULL || !(kt->pfrkt_flags & PFR_TFLAG_ACTIVE))
234 if (kt->pfrkt_flags & PFR_TFLAG_CONST)
236 pfr_enqueue_addrs(kt, &workq, ndel, 0);
238 if (!(flags & PFR_FLAG_DUMMY)) {
239 pfr_remove_kentries(kt, &workq);
240 KASSERT(kt->pfrkt_cnt == 0, ("%s: non-null pfrkt_cnt", __func__));
246 pfr_add_addrs(struct pfr_table *tbl, struct pfr_addr *addr, int size,
247 int *nadd, int flags)
249 struct pfr_ktable *kt, *tmpkt;
250 struct pfr_kentryworkq workq;
251 struct pfr_kentry *p, *q;
254 long tzero = time_second;
258 ACCEPT_FLAGS(flags, PFR_FLAG_DUMMY | PFR_FLAG_FEEDBACK);
259 if (pfr_validate_table(tbl, 0, flags & PFR_FLAG_USERIOCTL))
261 kt = pfr_lookup_table(tbl);
262 if (kt == NULL || !(kt->pfrkt_flags & PFR_TFLAG_ACTIVE))
264 if (kt->pfrkt_flags & PFR_TFLAG_CONST)
266 tmpkt = pfr_create_ktable(&V_pfr_nulltable, 0, 0);
270 for (i = 0, ad = addr; i < size; i++, ad++) {
271 if (pfr_validate_addr(ad))
273 p = pfr_lookup_addr(kt, ad, 1);
274 q = pfr_lookup_addr(tmpkt, ad, 1);
275 if (flags & PFR_FLAG_FEEDBACK) {
277 ad->pfra_fback = PFR_FB_DUPLICATE;
279 ad->pfra_fback = PFR_FB_ADDED;
280 else if (p->pfrke_not != ad->pfra_not)
281 ad->pfra_fback = PFR_FB_CONFLICT;
283 ad->pfra_fback = PFR_FB_NONE;
285 if (p == NULL && q == NULL) {
286 p = pfr_create_kentry(ad);
289 if (pfr_route_kentry(tmpkt, p)) {
290 pfr_destroy_kentry(p);
291 ad->pfra_fback = PFR_FB_NONE;
293 SLIST_INSERT_HEAD(&workq, p, pfrke_workq);
298 pfr_clean_node_mask(tmpkt, &workq);
299 if (!(flags & PFR_FLAG_DUMMY))
300 pfr_insert_kentries(kt, &workq, tzero);
302 pfr_destroy_kentries(&workq);
305 pfr_destroy_ktable(tmpkt, 0);
308 pfr_clean_node_mask(tmpkt, &workq);
309 pfr_destroy_kentries(&workq);
310 if (flags & PFR_FLAG_FEEDBACK)
311 pfr_reset_feedback(addr, size);
312 pfr_destroy_ktable(tmpkt, 0);
317 pfr_del_addrs(struct pfr_table *tbl, struct pfr_addr *addr, int size,
318 int *ndel, int flags)
320 struct pfr_ktable *kt;
321 struct pfr_kentryworkq workq;
322 struct pfr_kentry *p;
324 int i, rv, xdel = 0, log = 1;
328 ACCEPT_FLAGS(flags, PFR_FLAG_DUMMY | PFR_FLAG_FEEDBACK);
329 if (pfr_validate_table(tbl, 0, flags & PFR_FLAG_USERIOCTL))
331 kt = pfr_lookup_table(tbl);
332 if (kt == NULL || !(kt->pfrkt_flags & PFR_TFLAG_ACTIVE))
334 if (kt->pfrkt_flags & PFR_TFLAG_CONST)
337 * there are two algorithms to choose from here.
339 * n: number of addresses to delete
340 * N: number of addresses in the table
342 * one is O(N) and is better for large 'n'
343 * one is O(n*LOG(N)) and is better for small 'n'
345 * following code try to decide which one is best.
347 for (i = kt->pfrkt_cnt; i > 0; i >>= 1)
349 if (size > kt->pfrkt_cnt/log) {
350 /* full table scan */
353 /* iterate over addresses to delete */
354 for (i = 0, ad = addr; i < size; i++, ad++) {
355 if (pfr_validate_addr(ad))
357 p = pfr_lookup_addr(kt, ad, 1);
363 for (i = 0, ad = addr; i < size; i++, ad++) {
364 if (pfr_validate_addr(ad))
366 p = pfr_lookup_addr(kt, ad, 1);
367 if (flags & PFR_FLAG_FEEDBACK) {
369 ad->pfra_fback = PFR_FB_NONE;
370 else if (p->pfrke_not != ad->pfra_not)
371 ad->pfra_fback = PFR_FB_CONFLICT;
372 else if (p->pfrke_mark)
373 ad->pfra_fback = PFR_FB_DUPLICATE;
375 ad->pfra_fback = PFR_FB_DELETED;
377 if (p != NULL && p->pfrke_not == ad->pfra_not &&
380 SLIST_INSERT_HEAD(&workq, p, pfrke_workq);
384 if (!(flags & PFR_FLAG_DUMMY))
385 pfr_remove_kentries(kt, &workq);
390 if (flags & PFR_FLAG_FEEDBACK)
391 pfr_reset_feedback(addr, size);
396 pfr_set_addrs(struct pfr_table *tbl, struct pfr_addr *addr, int size,
397 int *size2, int *nadd, int *ndel, int *nchange, int flags,
398 u_int32_t ignore_pfrt_flags)
400 struct pfr_ktable *kt, *tmpkt;
401 struct pfr_kentryworkq addq, delq, changeq;
402 struct pfr_kentry *p, *q;
404 int i, rv, xadd = 0, xdel = 0, xchange = 0;
405 long tzero = time_second;
409 ACCEPT_FLAGS(flags, PFR_FLAG_DUMMY | PFR_FLAG_FEEDBACK);
410 if (pfr_validate_table(tbl, ignore_pfrt_flags, flags &
413 kt = pfr_lookup_table(tbl);
414 if (kt == NULL || !(kt->pfrkt_flags & PFR_TFLAG_ACTIVE))
416 if (kt->pfrkt_flags & PFR_TFLAG_CONST)
418 tmpkt = pfr_create_ktable(&V_pfr_nulltable, 0, 0);
424 SLIST_INIT(&changeq);
425 for (i = 0; i < size; i++) {
427 * XXXGL: undertand pf_if usage of this function
428 * and make ad a moving pointer
430 bcopy(addr + i, &ad, sizeof(ad));
431 if (pfr_validate_addr(&ad))
433 ad.pfra_fback = PFR_FB_NONE;
434 p = pfr_lookup_addr(kt, &ad, 1);
437 ad.pfra_fback = PFR_FB_DUPLICATE;
441 if (p->pfrke_not != ad.pfra_not) {
442 SLIST_INSERT_HEAD(&changeq, p, pfrke_workq);
443 ad.pfra_fback = PFR_FB_CHANGED;
447 q = pfr_lookup_addr(tmpkt, &ad, 1);
449 ad.pfra_fback = PFR_FB_DUPLICATE;
452 p = pfr_create_kentry(&ad);
455 if (pfr_route_kentry(tmpkt, p)) {
456 pfr_destroy_kentry(p);
457 ad.pfra_fback = PFR_FB_NONE;
459 SLIST_INSERT_HEAD(&addq, p, pfrke_workq);
460 ad.pfra_fback = PFR_FB_ADDED;
465 if (flags & PFR_FLAG_FEEDBACK)
466 bcopy(&ad, addr + i, sizeof(ad));
468 pfr_enqueue_addrs(kt, &delq, &xdel, ENQUEUE_UNMARKED_ONLY);
469 if ((flags & PFR_FLAG_FEEDBACK) && *size2) {
470 if (*size2 < size+xdel) {
475 SLIST_FOREACH(p, &delq, pfrke_workq) {
476 pfr_copyout_addr(&ad, p);
477 ad.pfra_fback = PFR_FB_DELETED;
478 bcopy(&ad, addr + size + i, sizeof(ad));
482 pfr_clean_node_mask(tmpkt, &addq);
483 if (!(flags & PFR_FLAG_DUMMY)) {
484 pfr_insert_kentries(kt, &addq, tzero);
485 pfr_remove_kentries(kt, &delq);
486 pfr_clstats_kentries(&changeq, tzero, INVERT_NEG_FLAG);
488 pfr_destroy_kentries(&addq);
495 if ((flags & PFR_FLAG_FEEDBACK) && size2)
497 pfr_destroy_ktable(tmpkt, 0);
500 pfr_clean_node_mask(tmpkt, &addq);
501 pfr_destroy_kentries(&addq);
502 if (flags & PFR_FLAG_FEEDBACK)
503 pfr_reset_feedback(addr, size);
504 pfr_destroy_ktable(tmpkt, 0);
509 pfr_tst_addrs(struct pfr_table *tbl, struct pfr_addr *addr, int size,
510 int *nmatch, int flags)
512 struct pfr_ktable *kt;
513 struct pfr_kentry *p;
519 ACCEPT_FLAGS(flags, PFR_FLAG_REPLACE);
520 if (pfr_validate_table(tbl, 0, 0))
522 kt = pfr_lookup_table(tbl);
523 if (kt == NULL || !(kt->pfrkt_flags & PFR_TFLAG_ACTIVE))
526 for (i = 0, ad = addr; i < size; i++, ad++) {
527 if (pfr_validate_addr(ad))
529 if (ADDR_NETWORK(ad))
531 p = pfr_lookup_addr(kt, ad, 0);
532 if (flags & PFR_FLAG_REPLACE)
533 pfr_copyout_addr(ad, p);
534 ad->pfra_fback = (p == NULL) ? PFR_FB_NONE :
535 (p->pfrke_not ? PFR_FB_NOTMATCH : PFR_FB_MATCH);
536 if (p != NULL && !p->pfrke_not)
545 pfr_get_addrs(struct pfr_table *tbl, struct pfr_addr *addr, int *size,
548 struct pfr_ktable *kt;
549 struct pfr_walktree w;
554 ACCEPT_FLAGS(flags, 0);
555 if (pfr_validate_table(tbl, 0, 0))
557 kt = pfr_lookup_table(tbl);
558 if (kt == NULL || !(kt->pfrkt_flags & PFR_TFLAG_ACTIVE))
560 if (kt->pfrkt_cnt > *size) {
561 *size = kt->pfrkt_cnt;
565 bzero(&w, sizeof(w));
566 w.pfrw_op = PFRW_GET_ADDRS;
568 w.pfrw_free = kt->pfrkt_cnt;
569 rv = kt->pfrkt_ip4->rnh_walktree(&kt->pfrkt_ip4->rh, pfr_walktree, &w);
571 rv = kt->pfrkt_ip6->rnh_walktree(&kt->pfrkt_ip6->rh,
576 KASSERT(w.pfrw_free == 0, ("%s: corruption detected (%d)", __func__,
579 *size = kt->pfrkt_cnt;
584 pfr_get_astats(struct pfr_table *tbl, struct pfr_astats *addr, int *size,
587 struct pfr_ktable *kt;
588 struct pfr_walktree w;
589 struct pfr_kentryworkq workq;
591 long tzero = time_second;
595 /* XXX PFR_FLAG_CLSTATS disabled */
596 ACCEPT_FLAGS(flags, 0);
597 if (pfr_validate_table(tbl, 0, 0))
599 kt = pfr_lookup_table(tbl);
600 if (kt == NULL || !(kt->pfrkt_flags & PFR_TFLAG_ACTIVE))
602 if (kt->pfrkt_cnt > *size) {
603 *size = kt->pfrkt_cnt;
607 bzero(&w, sizeof(w));
608 w.pfrw_op = PFRW_GET_ASTATS;
609 w.pfrw_astats = addr;
610 w.pfrw_free = kt->pfrkt_cnt;
611 rv = kt->pfrkt_ip4->rnh_walktree(&kt->pfrkt_ip4->rh, pfr_walktree, &w);
613 rv = kt->pfrkt_ip6->rnh_walktree(&kt->pfrkt_ip6->rh,
615 if (!rv && (flags & PFR_FLAG_CLSTATS)) {
616 pfr_enqueue_addrs(kt, &workq, NULL, 0);
617 pfr_clstats_kentries(&workq, tzero, 0);
623 printf("pfr_get_astats: corruption detected (%d).\n",
627 *size = kt->pfrkt_cnt;
632 pfr_clr_astats(struct pfr_table *tbl, struct pfr_addr *addr, int size,
633 int *nzero, int flags)
635 struct pfr_ktable *kt;
636 struct pfr_kentryworkq workq;
637 struct pfr_kentry *p;
639 int i, rv, xzero = 0;
643 ACCEPT_FLAGS(flags, PFR_FLAG_DUMMY | PFR_FLAG_FEEDBACK);
644 if (pfr_validate_table(tbl, 0, 0))
646 kt = pfr_lookup_table(tbl);
647 if (kt == NULL || !(kt->pfrkt_flags & PFR_TFLAG_ACTIVE))
650 for (i = 0, ad = addr; i < size; i++, ad++) {
651 if (pfr_validate_addr(ad))
653 p = pfr_lookup_addr(kt, ad, 1);
654 if (flags & PFR_FLAG_FEEDBACK) {
655 ad->pfra_fback = (p != NULL) ?
656 PFR_FB_CLEARED : PFR_FB_NONE;
659 SLIST_INSERT_HEAD(&workq, p, pfrke_workq);
664 if (!(flags & PFR_FLAG_DUMMY))
665 pfr_clstats_kentries(&workq, 0, 0);
670 if (flags & PFR_FLAG_FEEDBACK)
671 pfr_reset_feedback(addr, size);
676 pfr_validate_addr(struct pfr_addr *ad)
680 switch (ad->pfra_af) {
683 if (ad->pfra_net > 32)
689 if (ad->pfra_net > 128)
696 if (ad->pfra_net < 128 &&
697 (((caddr_t)ad)[ad->pfra_net/8] & (0xFF >> (ad->pfra_net%8))))
699 for (i = (ad->pfra_net+7)/8; i < sizeof(ad->pfra_u); i++)
700 if (((caddr_t)ad)[i])
702 if (ad->pfra_not && ad->pfra_not != 1)
710 pfr_enqueue_addrs(struct pfr_ktable *kt, struct pfr_kentryworkq *workq,
711 int *naddr, int sweep)
713 struct pfr_walktree w;
716 bzero(&w, sizeof(w));
717 w.pfrw_op = sweep ? PFRW_SWEEP : PFRW_ENQUEUE;
718 w.pfrw_workq = workq;
719 if (kt->pfrkt_ip4 != NULL)
720 if (kt->pfrkt_ip4->rnh_walktree(&kt->pfrkt_ip4->rh,
722 printf("pfr_enqueue_addrs: IPv4 walktree failed.\n");
723 if (kt->pfrkt_ip6 != NULL)
724 if (kt->pfrkt_ip6->rnh_walktree(&kt->pfrkt_ip6->rh,
726 printf("pfr_enqueue_addrs: IPv6 walktree failed.\n");
732 pfr_mark_addrs(struct pfr_ktable *kt)
734 struct pfr_walktree w;
736 bzero(&w, sizeof(w));
737 w.pfrw_op = PFRW_MARK;
738 if (kt->pfrkt_ip4->rnh_walktree(&kt->pfrkt_ip4->rh, pfr_walktree, &w))
739 printf("pfr_mark_addrs: IPv4 walktree failed.\n");
740 if (kt->pfrkt_ip6->rnh_walktree(&kt->pfrkt_ip6->rh, pfr_walktree, &w))
741 printf("pfr_mark_addrs: IPv6 walktree failed.\n");
745 static struct pfr_kentry *
746 pfr_lookup_addr(struct pfr_ktable *kt, struct pfr_addr *ad, int exact)
748 union sockaddr_union sa, mask;
749 struct radix_head *head = NULL;
750 struct pfr_kentry *ke;
754 bzero(&sa, sizeof(sa));
755 if (ad->pfra_af == AF_INET) {
756 FILLIN_SIN(sa.sin, ad->pfra_ip4addr);
757 head = &kt->pfrkt_ip4->rh;
758 } else if ( ad->pfra_af == AF_INET6 ) {
759 FILLIN_SIN6(sa.sin6, ad->pfra_ip6addr);
760 head = &kt->pfrkt_ip6->rh;
762 if (ADDR_NETWORK(ad)) {
763 pfr_prepare_network(&mask, ad->pfra_af, ad->pfra_net);
764 ke = (struct pfr_kentry *)rn_lookup(&sa, &mask, head);
765 if (ke && KENTRY_RNF_ROOT(ke))
768 ke = (struct pfr_kentry *)rn_match(&sa, head);
769 if (ke && KENTRY_RNF_ROOT(ke))
771 if (exact && ke && KENTRY_NETWORK(ke))
777 static struct pfr_kentry *
778 pfr_create_kentry(struct pfr_addr *ad)
780 struct pfr_kentry *ke;
782 ke = uma_zalloc(V_pfr_kentry_z, M_NOWAIT | M_ZERO);
786 if (ad->pfra_af == AF_INET)
787 FILLIN_SIN(ke->pfrke_sa.sin, ad->pfra_ip4addr);
788 else if (ad->pfra_af == AF_INET6)
789 FILLIN_SIN6(ke->pfrke_sa.sin6, ad->pfra_ip6addr);
790 ke->pfrke_af = ad->pfra_af;
791 ke->pfrke_net = ad->pfra_net;
792 ke->pfrke_not = ad->pfra_not;
797 pfr_destroy_kentries(struct pfr_kentryworkq *workq)
799 struct pfr_kentry *p, *q;
801 for (p = SLIST_FIRST(workq); p != NULL; p = q) {
802 q = SLIST_NEXT(p, pfrke_workq);
803 pfr_destroy_kentry(p);
808 pfr_destroy_kentry(struct pfr_kentry *ke)
810 if (ke->pfrke_counters)
811 uma_zfree(V_pfr_kcounters_z, ke->pfrke_counters);
812 uma_zfree(V_pfr_kentry_z, ke);
816 pfr_insert_kentries(struct pfr_ktable *kt,
817 struct pfr_kentryworkq *workq, long tzero)
819 struct pfr_kentry *p;
822 SLIST_FOREACH(p, workq, pfrke_workq) {
823 rv = pfr_route_kentry(kt, p);
825 printf("pfr_insert_kentries: cannot route entry "
829 p->pfrke_tzero = tzero;
836 pfr_insert_kentry(struct pfr_ktable *kt, struct pfr_addr *ad, long tzero)
838 struct pfr_kentry *p;
841 p = pfr_lookup_addr(kt, ad, 1);
844 p = pfr_create_kentry(ad);
848 rv = pfr_route_kentry(kt, p);
852 p->pfrke_tzero = tzero;
859 pfr_remove_kentries(struct pfr_ktable *kt,
860 struct pfr_kentryworkq *workq)
862 struct pfr_kentry *p;
865 SLIST_FOREACH(p, workq, pfrke_workq) {
866 pfr_unroute_kentry(kt, p);
870 pfr_destroy_kentries(workq);
874 pfr_clean_node_mask(struct pfr_ktable *kt,
875 struct pfr_kentryworkq *workq)
877 struct pfr_kentry *p;
879 SLIST_FOREACH(p, workq, pfrke_workq)
880 pfr_unroute_kentry(kt, p);
884 pfr_clstats_kentries(struct pfr_kentryworkq *workq, long tzero, int negchange)
886 struct pfr_kentry *p;
888 SLIST_FOREACH(p, workq, pfrke_workq) {
890 p->pfrke_not = !p->pfrke_not;
891 if (p->pfrke_counters) {
892 uma_zfree(V_pfr_kcounters_z, p->pfrke_counters);
893 p->pfrke_counters = NULL;
895 p->pfrke_tzero = tzero;
900 pfr_reset_feedback(struct pfr_addr *addr, int size)
905 for (i = 0, ad = addr; i < size; i++, ad++)
906 ad->pfra_fback = PFR_FB_NONE;
910 pfr_prepare_network(union sockaddr_union *sa, int af, int net)
914 bzero(sa, sizeof(*sa));
916 sa->sin.sin_len = sizeof(sa->sin);
917 sa->sin.sin_family = AF_INET;
918 sa->sin.sin_addr.s_addr = net ? htonl(-1 << (32-net)) : 0;
919 } else if (af == AF_INET6) {
920 sa->sin6.sin6_len = sizeof(sa->sin6);
921 sa->sin6.sin6_family = AF_INET6;
922 for (i = 0; i < 4; i++) {
924 sa->sin6.sin6_addr.s6_addr32[i] =
925 net ? htonl(-1 << (32-net)) : 0;
928 sa->sin6.sin6_addr.s6_addr32[i] = 0xFFFFFFFF;
935 pfr_route_kentry(struct pfr_ktable *kt, struct pfr_kentry *ke)
937 union sockaddr_union mask;
938 struct radix_node *rn;
939 struct radix_head *head = NULL;
943 bzero(ke->pfrke_node, sizeof(ke->pfrke_node));
944 if (ke->pfrke_af == AF_INET)
945 head = &kt->pfrkt_ip4->rh;
946 else if (ke->pfrke_af == AF_INET6)
947 head = &kt->pfrkt_ip6->rh;
949 if (KENTRY_NETWORK(ke)) {
950 pfr_prepare_network(&mask, ke->pfrke_af, ke->pfrke_net);
951 rn = rn_addroute(&ke->pfrke_sa, &mask, head, ke->pfrke_node);
953 rn = rn_addroute(&ke->pfrke_sa, NULL, head, ke->pfrke_node);
955 return (rn == NULL ? -1 : 0);
959 pfr_unroute_kentry(struct pfr_ktable *kt, struct pfr_kentry *ke)
961 union sockaddr_union mask;
962 struct radix_node *rn;
963 struct radix_head *head = NULL;
965 if (ke->pfrke_af == AF_INET)
966 head = &kt->pfrkt_ip4->rh;
967 else if (ke->pfrke_af == AF_INET6)
968 head = &kt->pfrkt_ip6->rh;
970 if (KENTRY_NETWORK(ke)) {
971 pfr_prepare_network(&mask, ke->pfrke_af, ke->pfrke_net);
972 rn = rn_delete(&ke->pfrke_sa, &mask, head);
974 rn = rn_delete(&ke->pfrke_sa, NULL, head);
977 printf("pfr_unroute_kentry: delete failed.\n");
984 pfr_copyout_addr(struct pfr_addr *ad, struct pfr_kentry *ke)
986 bzero(ad, sizeof(*ad));
989 ad->pfra_af = ke->pfrke_af;
990 ad->pfra_net = ke->pfrke_net;
991 ad->pfra_not = ke->pfrke_not;
992 if (ad->pfra_af == AF_INET)
993 ad->pfra_ip4addr = ke->pfrke_sa.sin.sin_addr;
994 else if (ad->pfra_af == AF_INET6)
995 ad->pfra_ip6addr = ke->pfrke_sa.sin6.sin6_addr;
999 pfr_walktree(struct radix_node *rn, void *arg)
1001 struct pfr_kentry *ke = (struct pfr_kentry *)rn;
1002 struct pfr_walktree *w = arg;
1004 switch (w->pfrw_op) {
1013 SLIST_INSERT_HEAD(w->pfrw_workq, ke, pfrke_workq);
1016 case PFRW_GET_ADDRS:
1017 if (w->pfrw_free-- > 0) {
1018 pfr_copyout_addr(w->pfrw_addr, ke);
1022 case PFRW_GET_ASTATS:
1023 if (w->pfrw_free-- > 0) {
1024 struct pfr_astats as;
1026 pfr_copyout_addr(&as.pfras_a, ke);
1028 if (ke->pfrke_counters) {
1029 bcopy(ke->pfrke_counters->pfrkc_packets,
1030 as.pfras_packets, sizeof(as.pfras_packets));
1031 bcopy(ke->pfrke_counters->pfrkc_bytes,
1032 as.pfras_bytes, sizeof(as.pfras_bytes));
1034 bzero(as.pfras_packets, sizeof(as.pfras_packets));
1035 bzero(as.pfras_bytes, sizeof(as.pfras_bytes));
1036 as.pfras_a.pfra_fback = PFR_FB_NOCOUNT;
1038 as.pfras_tzero = ke->pfrke_tzero;
1040 bcopy(&as, w->pfrw_astats, sizeof(as));
1046 break; /* negative entries are ignored */
1047 if (!w->pfrw_cnt--) {
1048 w->pfrw_kentry = ke;
1049 return (1); /* finish search */
1052 case PFRW_DYNADDR_UPDATE:
1054 union sockaddr_union pfr_mask;
1056 if (ke->pfrke_af == AF_INET) {
1057 if (w->pfrw_dyn->pfid_acnt4++ > 0)
1059 pfr_prepare_network(&pfr_mask, AF_INET, ke->pfrke_net);
1060 w->pfrw_dyn->pfid_addr4 = *SUNION2PF(&ke->pfrke_sa,
1062 w->pfrw_dyn->pfid_mask4 = *SUNION2PF(&pfr_mask,
1064 } else if (ke->pfrke_af == AF_INET6){
1065 if (w->pfrw_dyn->pfid_acnt6++ > 0)
1067 pfr_prepare_network(&pfr_mask, AF_INET6, ke->pfrke_net);
1068 w->pfrw_dyn->pfid_addr6 = *SUNION2PF(&ke->pfrke_sa,
1070 w->pfrw_dyn->pfid_mask6 = *SUNION2PF(&pfr_mask,
1080 pfr_clr_tables(struct pfr_table *filter, int *ndel, int flags)
1082 struct pfr_ktableworkq workq;
1083 struct pfr_ktable *p;
1086 ACCEPT_FLAGS(flags, PFR_FLAG_DUMMY | PFR_FLAG_ALLRSETS);
1087 if (pfr_fix_anchor(filter->pfrt_anchor))
1089 if (pfr_table_count(filter, flags) < 0)
1093 RB_FOREACH(p, pfr_ktablehead, &V_pfr_ktables) {
1094 if (pfr_skip_table(filter, p, flags))
1096 if (!strcmp(p->pfrkt_anchor, PF_RESERVED_ANCHOR))
1098 if (!(p->pfrkt_flags & PFR_TFLAG_ACTIVE))
1100 p->pfrkt_nflags = p->pfrkt_flags & ~PFR_TFLAG_ACTIVE;
1101 SLIST_INSERT_HEAD(&workq, p, pfrkt_workq);
1104 if (!(flags & PFR_FLAG_DUMMY))
1105 pfr_setflags_ktables(&workq);
1112 pfr_add_tables(struct pfr_table *tbl, int size, int *nadd, int flags)
1114 struct pfr_ktableworkq addq, changeq;
1115 struct pfr_ktable *p, *q, *r, key;
1116 int i, rv, xadd = 0;
1117 long tzero = time_second;
1119 ACCEPT_FLAGS(flags, PFR_FLAG_DUMMY);
1121 SLIST_INIT(&changeq);
1122 for (i = 0; i < size; i++) {
1123 bcopy(tbl+i, &key.pfrkt_t, sizeof(key.pfrkt_t));
1124 if (pfr_validate_table(&key.pfrkt_t, PFR_TFLAG_USRMASK,
1125 flags & PFR_FLAG_USERIOCTL))
1127 key.pfrkt_flags |= PFR_TFLAG_ACTIVE;
1128 p = RB_FIND(pfr_ktablehead, &V_pfr_ktables, &key);
1130 p = pfr_create_ktable(&key.pfrkt_t, tzero, 1);
1133 SLIST_FOREACH(q, &addq, pfrkt_workq) {
1134 if (!pfr_ktable_compare(p, q))
1137 SLIST_INSERT_HEAD(&addq, p, pfrkt_workq);
1139 if (!key.pfrkt_anchor[0])
1142 /* find or create root table */
1143 bzero(key.pfrkt_anchor, sizeof(key.pfrkt_anchor));
1144 r = RB_FIND(pfr_ktablehead, &V_pfr_ktables, &key);
1149 SLIST_FOREACH(q, &addq, pfrkt_workq) {
1150 if (!pfr_ktable_compare(&key, q)) {
1155 key.pfrkt_flags = 0;
1156 r = pfr_create_ktable(&key.pfrkt_t, 0, 1);
1159 SLIST_INSERT_HEAD(&addq, r, pfrkt_workq);
1161 } else if (!(p->pfrkt_flags & PFR_TFLAG_ACTIVE)) {
1162 SLIST_FOREACH(q, &changeq, pfrkt_workq)
1163 if (!pfr_ktable_compare(&key, q))
1165 p->pfrkt_nflags = (p->pfrkt_flags &
1166 ~PFR_TFLAG_USRMASK) | key.pfrkt_flags;
1167 SLIST_INSERT_HEAD(&changeq, p, pfrkt_workq);
1173 if (!(flags & PFR_FLAG_DUMMY)) {
1174 pfr_insert_ktables(&addq);
1175 pfr_setflags_ktables(&changeq);
1177 pfr_destroy_ktables(&addq, 0);
1182 pfr_destroy_ktables(&addq, 0);
1187 pfr_del_tables(struct pfr_table *tbl, int size, int *ndel, int flags)
1189 struct pfr_ktableworkq workq;
1190 struct pfr_ktable *p, *q, key;
1193 ACCEPT_FLAGS(flags, PFR_FLAG_DUMMY);
1195 for (i = 0; i < size; i++) {
1196 bcopy(tbl+i, &key.pfrkt_t, sizeof(key.pfrkt_t));
1197 if (pfr_validate_table(&key.pfrkt_t, 0,
1198 flags & PFR_FLAG_USERIOCTL))
1200 p = RB_FIND(pfr_ktablehead, &V_pfr_ktables, &key);
1201 if (p != NULL && (p->pfrkt_flags & PFR_TFLAG_ACTIVE)) {
1202 SLIST_FOREACH(q, &workq, pfrkt_workq)
1203 if (!pfr_ktable_compare(p, q))
1205 p->pfrkt_nflags = p->pfrkt_flags & ~PFR_TFLAG_ACTIVE;
1206 SLIST_INSERT_HEAD(&workq, p, pfrkt_workq);
1213 if (!(flags & PFR_FLAG_DUMMY))
1214 pfr_setflags_ktables(&workq);
1221 pfr_get_tables(struct pfr_table *filter, struct pfr_table *tbl, int *size,
1224 struct pfr_ktable *p;
1229 ACCEPT_FLAGS(flags, PFR_FLAG_ALLRSETS);
1230 if (pfr_fix_anchor(filter->pfrt_anchor))
1232 n = nn = pfr_table_count(filter, flags);
1239 RB_FOREACH(p, pfr_ktablehead, &V_pfr_ktables) {
1240 if (pfr_skip_table(filter, p, flags))
1244 bcopy(&p->pfrkt_t, tbl++, sizeof(*tbl));
1247 KASSERT(n == 0, ("%s: corruption detected (%d)", __func__, n));
1254 pfr_get_tstats(struct pfr_table *filter, struct pfr_tstats *tbl, int *size,
1257 struct pfr_ktable *p;
1258 struct pfr_ktableworkq workq;
1260 long tzero = time_second;
1262 /* XXX PFR_FLAG_CLSTATS disabled */
1263 ACCEPT_FLAGS(flags, PFR_FLAG_ALLRSETS);
1264 if (pfr_fix_anchor(filter->pfrt_anchor))
1266 n = nn = pfr_table_count(filter, flags);
1274 RB_FOREACH(p, pfr_ktablehead, &V_pfr_ktables) {
1275 if (pfr_skip_table(filter, p, flags))
1279 bcopy(&p->pfrkt_ts, tbl++, sizeof(*tbl));
1280 SLIST_INSERT_HEAD(&workq, p, pfrkt_workq);
1282 if (flags & PFR_FLAG_CLSTATS)
1283 pfr_clstats_ktables(&workq, tzero,
1284 flags & PFR_FLAG_ADDRSTOO);
1286 KASSERT(n == 0, ("%s: corruption detected (%d)", __func__, n));
1293 pfr_clr_tstats(struct pfr_table *tbl, int size, int *nzero, int flags)
1295 struct pfr_ktableworkq workq;
1296 struct pfr_ktable *p, key;
1298 long tzero = time_second;
1300 ACCEPT_FLAGS(flags, PFR_FLAG_DUMMY | PFR_FLAG_ADDRSTOO);
1302 for (i = 0; i < size; i++) {
1303 bcopy(tbl + i, &key.pfrkt_t, sizeof(key.pfrkt_t));
1304 if (pfr_validate_table(&key.pfrkt_t, 0, 0))
1306 p = RB_FIND(pfr_ktablehead, &V_pfr_ktables, &key);
1308 SLIST_INSERT_HEAD(&workq, p, pfrkt_workq);
1312 if (!(flags & PFR_FLAG_DUMMY))
1313 pfr_clstats_ktables(&workq, tzero, flags & PFR_FLAG_ADDRSTOO);
1320 pfr_set_tflags(struct pfr_table *tbl, int size, int setflag, int clrflag,
1321 int *nchange, int *ndel, int flags)
1323 struct pfr_ktableworkq workq;
1324 struct pfr_ktable *p, *q, key;
1325 int i, xchange = 0, xdel = 0;
1327 ACCEPT_FLAGS(flags, PFR_FLAG_DUMMY);
1328 if ((setflag & ~PFR_TFLAG_USRMASK) ||
1329 (clrflag & ~PFR_TFLAG_USRMASK) ||
1330 (setflag & clrflag))
1333 for (i = 0; i < size; i++) {
1334 bcopy(tbl + i, &key.pfrkt_t, sizeof(key.pfrkt_t));
1335 if (pfr_validate_table(&key.pfrkt_t, 0,
1336 flags & PFR_FLAG_USERIOCTL))
1338 p = RB_FIND(pfr_ktablehead, &V_pfr_ktables, &key);
1339 if (p != NULL && (p->pfrkt_flags & PFR_TFLAG_ACTIVE)) {
1340 p->pfrkt_nflags = (p->pfrkt_flags | setflag) &
1342 if (p->pfrkt_nflags == p->pfrkt_flags)
1344 SLIST_FOREACH(q, &workq, pfrkt_workq)
1345 if (!pfr_ktable_compare(p, q))
1347 SLIST_INSERT_HEAD(&workq, p, pfrkt_workq);
1348 if ((p->pfrkt_flags & PFR_TFLAG_PERSIST) &&
1349 (clrflag & PFR_TFLAG_PERSIST) &&
1350 !(p->pfrkt_flags & PFR_TFLAG_REFERENCED))
1358 if (!(flags & PFR_FLAG_DUMMY))
1359 pfr_setflags_ktables(&workq);
1360 if (nchange != NULL)
1368 pfr_ina_begin(struct pfr_table *trs, u_int32_t *ticket, int *ndel, int flags)
1370 struct pfr_ktableworkq workq;
1371 struct pfr_ktable *p;
1372 struct pf_ruleset *rs;
1375 ACCEPT_FLAGS(flags, PFR_FLAG_DUMMY);
1376 rs = pf_find_or_create_ruleset(trs->pfrt_anchor);
1380 RB_FOREACH(p, pfr_ktablehead, &V_pfr_ktables) {
1381 if (!(p->pfrkt_flags & PFR_TFLAG_INACTIVE) ||
1382 pfr_skip_table(trs, p, 0))
1384 p->pfrkt_nflags = p->pfrkt_flags & ~PFR_TFLAG_INACTIVE;
1385 SLIST_INSERT_HEAD(&workq, p, pfrkt_workq);
1388 if (!(flags & PFR_FLAG_DUMMY)) {
1389 pfr_setflags_ktables(&workq);
1391 *ticket = ++rs->tticket;
1394 pf_remove_if_empty_ruleset(rs);
1401 pfr_ina_define(struct pfr_table *tbl, struct pfr_addr *addr, int size,
1402 int *nadd, int *naddr, u_int32_t ticket, int flags)
1404 struct pfr_ktableworkq tableq;
1405 struct pfr_kentryworkq addrq;
1406 struct pfr_ktable *kt, *rt, *shadow, key;
1407 struct pfr_kentry *p;
1408 struct pfr_addr *ad;
1409 struct pf_ruleset *rs;
1410 int i, rv, xadd = 0, xaddr = 0;
1414 ACCEPT_FLAGS(flags, PFR_FLAG_DUMMY | PFR_FLAG_ADDRSTOO);
1415 if (size && !(flags & PFR_FLAG_ADDRSTOO))
1417 if (pfr_validate_table(tbl, PFR_TFLAG_USRMASK,
1418 flags & PFR_FLAG_USERIOCTL))
1420 rs = pf_find_ruleset(tbl->pfrt_anchor);
1421 if (rs == NULL || !rs->topen || ticket != rs->tticket)
1423 tbl->pfrt_flags |= PFR_TFLAG_INACTIVE;
1424 SLIST_INIT(&tableq);
1425 kt = RB_FIND(pfr_ktablehead, &V_pfr_ktables, (struct pfr_ktable *)tbl);
1427 kt = pfr_create_ktable(tbl, 0, 1);
1430 SLIST_INSERT_HEAD(&tableq, kt, pfrkt_workq);
1432 if (!tbl->pfrt_anchor[0])
1435 /* find or create root table */
1436 bzero(&key, sizeof(key));
1437 strlcpy(key.pfrkt_name, tbl->pfrt_name, sizeof(key.pfrkt_name));
1438 rt = RB_FIND(pfr_ktablehead, &V_pfr_ktables, &key);
1440 kt->pfrkt_root = rt;
1443 rt = pfr_create_ktable(&key.pfrkt_t, 0, 1);
1445 pfr_destroy_ktables(&tableq, 0);
1448 SLIST_INSERT_HEAD(&tableq, rt, pfrkt_workq);
1449 kt->pfrkt_root = rt;
1450 } else if (!(kt->pfrkt_flags & PFR_TFLAG_INACTIVE))
1453 shadow = pfr_create_ktable(tbl, 0, 0);
1454 if (shadow == NULL) {
1455 pfr_destroy_ktables(&tableq, 0);
1459 for (i = 0, ad = addr; i < size; i++, ad++) {
1460 if (pfr_validate_addr(ad))
1462 if (pfr_lookup_addr(shadow, ad, 1) != NULL)
1464 p = pfr_create_kentry(ad);
1467 if (pfr_route_kentry(shadow, p)) {
1468 pfr_destroy_kentry(p);
1471 SLIST_INSERT_HEAD(&addrq, p, pfrke_workq);
1474 if (!(flags & PFR_FLAG_DUMMY)) {
1475 if (kt->pfrkt_shadow != NULL)
1476 pfr_destroy_ktable(kt->pfrkt_shadow, 1);
1477 kt->pfrkt_flags |= PFR_TFLAG_INACTIVE;
1478 pfr_insert_ktables(&tableq);
1479 shadow->pfrkt_cnt = (flags & PFR_FLAG_ADDRSTOO) ?
1480 xaddr : NO_ADDRESSES;
1481 kt->pfrkt_shadow = shadow;
1483 pfr_clean_node_mask(shadow, &addrq);
1484 pfr_destroy_ktable(shadow, 0);
1485 pfr_destroy_ktables(&tableq, 0);
1486 pfr_destroy_kentries(&addrq);
1494 pfr_destroy_ktable(shadow, 0);
1495 pfr_destroy_ktables(&tableq, 0);
1496 pfr_destroy_kentries(&addrq);
1501 pfr_ina_rollback(struct pfr_table *trs, u_int32_t ticket, int *ndel, int flags)
1503 struct pfr_ktableworkq workq;
1504 struct pfr_ktable *p;
1505 struct pf_ruleset *rs;
1510 ACCEPT_FLAGS(flags, PFR_FLAG_DUMMY);
1511 rs = pf_find_ruleset(trs->pfrt_anchor);
1512 if (rs == NULL || !rs->topen || ticket != rs->tticket)
1515 RB_FOREACH(p, pfr_ktablehead, &V_pfr_ktables) {
1516 if (!(p->pfrkt_flags & PFR_TFLAG_INACTIVE) ||
1517 pfr_skip_table(trs, p, 0))
1519 p->pfrkt_nflags = p->pfrkt_flags & ~PFR_TFLAG_INACTIVE;
1520 SLIST_INSERT_HEAD(&workq, p, pfrkt_workq);
1523 if (!(flags & PFR_FLAG_DUMMY)) {
1524 pfr_setflags_ktables(&workq);
1526 pf_remove_if_empty_ruleset(rs);
1534 pfr_ina_commit(struct pfr_table *trs, u_int32_t ticket, int *nadd,
1535 int *nchange, int flags)
1537 struct pfr_ktable *p, *q;
1538 struct pfr_ktableworkq workq;
1539 struct pf_ruleset *rs;
1540 int xadd = 0, xchange = 0;
1541 long tzero = time_second;
1545 ACCEPT_FLAGS(flags, PFR_FLAG_DUMMY);
1546 rs = pf_find_ruleset(trs->pfrt_anchor);
1547 if (rs == NULL || !rs->topen || ticket != rs->tticket)
1551 RB_FOREACH(p, pfr_ktablehead, &V_pfr_ktables) {
1552 if (!(p->pfrkt_flags & PFR_TFLAG_INACTIVE) ||
1553 pfr_skip_table(trs, p, 0))
1555 SLIST_INSERT_HEAD(&workq, p, pfrkt_workq);
1556 if (p->pfrkt_flags & PFR_TFLAG_ACTIVE)
1562 if (!(flags & PFR_FLAG_DUMMY)) {
1563 for (p = SLIST_FIRST(&workq); p != NULL; p = q) {
1564 q = SLIST_NEXT(p, pfrkt_workq);
1565 pfr_commit_ktable(p, tzero);
1568 pf_remove_if_empty_ruleset(rs);
1572 if (nchange != NULL)
1579 pfr_commit_ktable(struct pfr_ktable *kt, long tzero)
1581 struct pfr_ktable *shadow = kt->pfrkt_shadow;
1586 if (shadow->pfrkt_cnt == NO_ADDRESSES) {
1587 if (!(kt->pfrkt_flags & PFR_TFLAG_ACTIVE))
1588 pfr_clstats_ktable(kt, tzero, 1);
1589 } else if (kt->pfrkt_flags & PFR_TFLAG_ACTIVE) {
1590 /* kt might contain addresses */
1591 struct pfr_kentryworkq addrq, addq, changeq, delq, garbageq;
1592 struct pfr_kentry *p, *q, *next;
1595 pfr_enqueue_addrs(shadow, &addrq, NULL, 0);
1598 SLIST_INIT(&changeq);
1600 SLIST_INIT(&garbageq);
1601 pfr_clean_node_mask(shadow, &addrq);
1602 for (p = SLIST_FIRST(&addrq); p != NULL; p = next) {
1603 next = SLIST_NEXT(p, pfrke_workq); /* XXX */
1604 pfr_copyout_addr(&ad, p);
1605 q = pfr_lookup_addr(kt, &ad, 1);
1607 if (q->pfrke_not != p->pfrke_not)
1608 SLIST_INSERT_HEAD(&changeq, q,
1611 SLIST_INSERT_HEAD(&garbageq, p, pfrke_workq);
1613 p->pfrke_tzero = tzero;
1614 SLIST_INSERT_HEAD(&addq, p, pfrke_workq);
1617 pfr_enqueue_addrs(kt, &delq, NULL, ENQUEUE_UNMARKED_ONLY);
1618 pfr_insert_kentries(kt, &addq, tzero);
1619 pfr_remove_kentries(kt, &delq);
1620 pfr_clstats_kentries(&changeq, tzero, INVERT_NEG_FLAG);
1621 pfr_destroy_kentries(&garbageq);
1623 /* kt cannot contain addresses */
1624 SWAP(struct radix_node_head *, kt->pfrkt_ip4,
1626 SWAP(struct radix_node_head *, kt->pfrkt_ip6,
1628 SWAP(int, kt->pfrkt_cnt, shadow->pfrkt_cnt);
1629 pfr_clstats_ktable(kt, tzero, 1);
1631 nflags = ((shadow->pfrkt_flags & PFR_TFLAG_USRMASK) |
1632 (kt->pfrkt_flags & PFR_TFLAG_SETMASK) | PFR_TFLAG_ACTIVE)
1633 & ~PFR_TFLAG_INACTIVE;
1634 pfr_destroy_ktable(shadow, 0);
1635 kt->pfrkt_shadow = NULL;
1636 pfr_setflags_ktable(kt, nflags);
1640 pfr_validate_table(struct pfr_table *tbl, int allowedflags, int no_reserved)
1644 if (!tbl->pfrt_name[0])
1646 if (no_reserved && !strcmp(tbl->pfrt_anchor, PF_RESERVED_ANCHOR))
1648 if (tbl->pfrt_name[PF_TABLE_NAME_SIZE-1])
1650 for (i = strlen(tbl->pfrt_name); i < PF_TABLE_NAME_SIZE; i++)
1651 if (tbl->pfrt_name[i])
1653 if (pfr_fix_anchor(tbl->pfrt_anchor))
1655 if (tbl->pfrt_flags & ~allowedflags)
1661 * Rewrite anchors referenced by tables to remove slashes
1662 * and check for validity.
1665 pfr_fix_anchor(char *anchor)
1667 size_t siz = MAXPATHLEN;
1670 if (anchor[0] == '/') {
1676 while (*++path == '/')
1678 bcopy(path, anchor, siz - off);
1679 memset(anchor + siz - off, 0, off);
1681 if (anchor[siz - 1])
1683 for (i = strlen(anchor); i < siz; i++)
1690 pfr_table_count(struct pfr_table *filter, int flags)
1692 struct pf_ruleset *rs;
1696 if (flags & PFR_FLAG_ALLRSETS)
1697 return (V_pfr_ktable_cnt);
1698 if (filter->pfrt_anchor[0]) {
1699 rs = pf_find_ruleset(filter->pfrt_anchor);
1700 return ((rs != NULL) ? rs->tables : -1);
1702 return (pf_main_ruleset.tables);
1706 pfr_skip_table(struct pfr_table *filter, struct pfr_ktable *kt, int flags)
1708 if (flags & PFR_FLAG_ALLRSETS)
1710 if (strcmp(filter->pfrt_anchor, kt->pfrkt_anchor))
1716 pfr_insert_ktables(struct pfr_ktableworkq *workq)
1718 struct pfr_ktable *p;
1720 SLIST_FOREACH(p, workq, pfrkt_workq)
1721 pfr_insert_ktable(p);
1725 pfr_insert_ktable(struct pfr_ktable *kt)
1730 RB_INSERT(pfr_ktablehead, &V_pfr_ktables, kt);
1732 if (kt->pfrkt_root != NULL)
1733 if (!kt->pfrkt_root->pfrkt_refcnt[PFR_REFCNT_ANCHOR]++)
1734 pfr_setflags_ktable(kt->pfrkt_root,
1735 kt->pfrkt_root->pfrkt_flags|PFR_TFLAG_REFDANCHOR);
1739 pfr_setflags_ktables(struct pfr_ktableworkq *workq)
1741 struct pfr_ktable *p, *q;
1743 for (p = SLIST_FIRST(workq); p; p = q) {
1744 q = SLIST_NEXT(p, pfrkt_workq);
1745 pfr_setflags_ktable(p, p->pfrkt_nflags);
1750 pfr_setflags_ktable(struct pfr_ktable *kt, int newf)
1752 struct pfr_kentryworkq addrq;
1756 if (!(newf & PFR_TFLAG_REFERENCED) &&
1757 !(newf & PFR_TFLAG_PERSIST))
1758 newf &= ~PFR_TFLAG_ACTIVE;
1759 if (!(newf & PFR_TFLAG_ACTIVE))
1760 newf &= ~PFR_TFLAG_USRMASK;
1761 if (!(newf & PFR_TFLAG_SETMASK)) {
1762 RB_REMOVE(pfr_ktablehead, &V_pfr_ktables, kt);
1763 if (kt->pfrkt_root != NULL)
1764 if (!--kt->pfrkt_root->pfrkt_refcnt[PFR_REFCNT_ANCHOR])
1765 pfr_setflags_ktable(kt->pfrkt_root,
1766 kt->pfrkt_root->pfrkt_flags &
1767 ~PFR_TFLAG_REFDANCHOR);
1768 pfr_destroy_ktable(kt, 1);
1772 if (!(newf & PFR_TFLAG_ACTIVE) && kt->pfrkt_cnt) {
1773 pfr_enqueue_addrs(kt, &addrq, NULL, 0);
1774 pfr_remove_kentries(kt, &addrq);
1776 if (!(newf & PFR_TFLAG_INACTIVE) && kt->pfrkt_shadow != NULL) {
1777 pfr_destroy_ktable(kt->pfrkt_shadow, 1);
1778 kt->pfrkt_shadow = NULL;
1780 kt->pfrkt_flags = newf;
1784 pfr_clstats_ktables(struct pfr_ktableworkq *workq, long tzero, int recurse)
1786 struct pfr_ktable *p;
1788 SLIST_FOREACH(p, workq, pfrkt_workq)
1789 pfr_clstats_ktable(p, tzero, recurse);
1793 pfr_clstats_ktable(struct pfr_ktable *kt, long tzero, int recurse)
1795 struct pfr_kentryworkq addrq;
1798 pfr_enqueue_addrs(kt, &addrq, NULL, 0);
1799 pfr_clstats_kentries(&addrq, tzero, 0);
1801 bzero(kt->pfrkt_packets, sizeof(kt->pfrkt_packets));
1802 bzero(kt->pfrkt_bytes, sizeof(kt->pfrkt_bytes));
1803 kt->pfrkt_match = kt->pfrkt_nomatch = 0;
1804 kt->pfrkt_tzero = tzero;
1807 static struct pfr_ktable *
1808 pfr_create_ktable(struct pfr_table *tbl, long tzero, int attachruleset)
1810 struct pfr_ktable *kt;
1811 struct pf_ruleset *rs;
1815 kt = malloc(sizeof(*kt), M_PFTABLE, M_NOWAIT|M_ZERO);
1820 if (attachruleset) {
1821 rs = pf_find_or_create_ruleset(tbl->pfrt_anchor);
1823 pfr_destroy_ktable(kt, 0);
1830 if (!rn_inithead((void **)&kt->pfrkt_ip4,
1831 offsetof(struct sockaddr_in, sin_addr) * 8) ||
1832 !rn_inithead((void **)&kt->pfrkt_ip6,
1833 offsetof(struct sockaddr_in6, sin6_addr) * 8)) {
1834 pfr_destroy_ktable(kt, 0);
1837 kt->pfrkt_tzero = tzero;
1843 pfr_destroy_ktables(struct pfr_ktableworkq *workq, int flushaddr)
1845 struct pfr_ktable *p, *q;
1847 for (p = SLIST_FIRST(workq); p; p = q) {
1848 q = SLIST_NEXT(p, pfrkt_workq);
1849 pfr_destroy_ktable(p, flushaddr);
1854 pfr_destroy_ktable(struct pfr_ktable *kt, int flushaddr)
1856 struct pfr_kentryworkq addrq;
1859 pfr_enqueue_addrs(kt, &addrq, NULL, 0);
1860 pfr_clean_node_mask(kt, &addrq);
1861 pfr_destroy_kentries(&addrq);
1863 if (kt->pfrkt_ip4 != NULL)
1864 rn_detachhead((void **)&kt->pfrkt_ip4);
1865 if (kt->pfrkt_ip6 != NULL)
1866 rn_detachhead((void **)&kt->pfrkt_ip6);
1867 if (kt->pfrkt_shadow != NULL)
1868 pfr_destroy_ktable(kt->pfrkt_shadow, flushaddr);
1869 if (kt->pfrkt_rs != NULL) {
1870 kt->pfrkt_rs->tables--;
1871 pf_remove_if_empty_ruleset(kt->pfrkt_rs);
1873 free(kt, M_PFTABLE);
1877 pfr_ktable_compare(struct pfr_ktable *p, struct pfr_ktable *q)
1881 if ((d = strncmp(p->pfrkt_name, q->pfrkt_name, PF_TABLE_NAME_SIZE)))
1883 return (strcmp(p->pfrkt_anchor, q->pfrkt_anchor));
1886 static struct pfr_ktable *
1887 pfr_lookup_table(struct pfr_table *tbl)
1889 /* struct pfr_ktable start like a struct pfr_table */
1890 return (RB_FIND(pfr_ktablehead, &V_pfr_ktables,
1891 (struct pfr_ktable *)tbl));
1895 pfr_match_addr(struct pfr_ktable *kt, struct pf_addr *a, sa_family_t af)
1897 struct pfr_kentry *ke = NULL;
1902 if (!(kt->pfrkt_flags & PFR_TFLAG_ACTIVE) && kt->pfrkt_root != NULL)
1903 kt = kt->pfrkt_root;
1904 if (!(kt->pfrkt_flags & PFR_TFLAG_ACTIVE))
1911 struct sockaddr_in sin;
1913 bzero(&sin, sizeof(sin));
1914 sin.sin_len = sizeof(sin);
1915 sin.sin_family = AF_INET;
1916 sin.sin_addr.s_addr = a->addr32[0];
1917 ke = (struct pfr_kentry *)rn_match(&sin, &kt->pfrkt_ip4->rh);
1918 if (ke && KENTRY_RNF_ROOT(ke))
1926 struct sockaddr_in6 sin6;
1928 bzero(&sin6, sizeof(sin6));
1929 sin6.sin6_len = sizeof(sin6);
1930 sin6.sin6_family = AF_INET6;
1931 bcopy(a, &sin6.sin6_addr, sizeof(sin6.sin6_addr));
1932 ke = (struct pfr_kentry *)rn_match(&sin6, &kt->pfrkt_ip6->rh);
1933 if (ke && KENTRY_RNF_ROOT(ke))
1939 match = (ke && !ke->pfrke_not);
1943 kt->pfrkt_nomatch++;
1948 pfr_update_stats(struct pfr_ktable *kt, struct pf_addr *a, sa_family_t af,
1949 u_int64_t len, int dir_out, int op_pass, int notrule)
1951 struct pfr_kentry *ke = NULL;
1953 if (!(kt->pfrkt_flags & PFR_TFLAG_ACTIVE) && kt->pfrkt_root != NULL)
1954 kt = kt->pfrkt_root;
1955 if (!(kt->pfrkt_flags & PFR_TFLAG_ACTIVE))
1962 struct sockaddr_in sin;
1964 bzero(&sin, sizeof(sin));
1965 sin.sin_len = sizeof(sin);
1966 sin.sin_family = AF_INET;
1967 sin.sin_addr.s_addr = a->addr32[0];
1968 ke = (struct pfr_kentry *)rn_match(&sin, &kt->pfrkt_ip4->rh);
1969 if (ke && KENTRY_RNF_ROOT(ke))
1977 struct sockaddr_in6 sin6;
1979 bzero(&sin6, sizeof(sin6));
1980 sin6.sin6_len = sizeof(sin6);
1981 sin6.sin6_family = AF_INET6;
1982 bcopy(a, &sin6.sin6_addr, sizeof(sin6.sin6_addr));
1983 ke = (struct pfr_kentry *)rn_match(&sin6, &kt->pfrkt_ip6->rh);
1984 if (ke && KENTRY_RNF_ROOT(ke))
1990 panic("%s: unknown address family %u", __func__, af);
1992 if ((ke == NULL || ke->pfrke_not) != notrule) {
1993 if (op_pass != PFR_OP_PASS)
1994 printf("pfr_update_stats: assertion failed.\n");
1995 op_pass = PFR_OP_XPASS;
1997 kt->pfrkt_packets[dir_out][op_pass]++;
1998 kt->pfrkt_bytes[dir_out][op_pass] += len;
1999 if (ke != NULL && op_pass != PFR_OP_XPASS &&
2000 (kt->pfrkt_flags & PFR_TFLAG_COUNTERS)) {
2001 if (ke->pfrke_counters == NULL)
2002 ke->pfrke_counters = uma_zalloc(V_pfr_kcounters_z,
2004 if (ke->pfrke_counters != NULL) {
2005 ke->pfrke_counters->pfrkc_packets[dir_out][op_pass]++;
2006 ke->pfrke_counters->pfrkc_bytes[dir_out][op_pass] += len;
2012 pfr_attach_table(struct pf_ruleset *rs, char *name)
2014 struct pfr_ktable *kt, *rt;
2015 struct pfr_table tbl;
2016 struct pf_anchor *ac = rs->anchor;
2020 bzero(&tbl, sizeof(tbl));
2021 strlcpy(tbl.pfrt_name, name, sizeof(tbl.pfrt_name));
2023 strlcpy(tbl.pfrt_anchor, ac->path, sizeof(tbl.pfrt_anchor));
2024 kt = pfr_lookup_table(&tbl);
2026 kt = pfr_create_ktable(&tbl, time_second, 1);
2030 bzero(tbl.pfrt_anchor, sizeof(tbl.pfrt_anchor));
2031 rt = pfr_lookup_table(&tbl);
2033 rt = pfr_create_ktable(&tbl, 0, 1);
2035 pfr_destroy_ktable(kt, 0);
2038 pfr_insert_ktable(rt);
2040 kt->pfrkt_root = rt;
2042 pfr_insert_ktable(kt);
2044 if (!kt->pfrkt_refcnt[PFR_REFCNT_RULE]++)
2045 pfr_setflags_ktable(kt, kt->pfrkt_flags|PFR_TFLAG_REFERENCED);
2050 pfr_detach_table(struct pfr_ktable *kt)
2054 KASSERT(kt->pfrkt_refcnt[PFR_REFCNT_RULE] > 0, ("%s: refcount %d\n",
2055 __func__, kt->pfrkt_refcnt[PFR_REFCNT_RULE]));
2057 if (!--kt->pfrkt_refcnt[PFR_REFCNT_RULE])
2058 pfr_setflags_ktable(kt, kt->pfrkt_flags&~PFR_TFLAG_REFERENCED);
2062 pfr_pool_get(struct pfr_ktable *kt, int *pidx, struct pf_addr *counter,
2065 struct pf_addr *addr, *cur, *mask;
2066 union sockaddr_union uaddr, umask;
2067 struct pfr_kentry *ke, *ke2 = NULL;
2068 int idx = -1, use_counter = 0;
2072 uaddr.sin.sin_len = sizeof(struct sockaddr_in);
2073 uaddr.sin.sin_family = AF_INET;
2076 uaddr.sin6.sin6_len = sizeof(struct sockaddr_in6);
2077 uaddr.sin6.sin6_family = AF_INET6;
2080 addr = SUNION2PF(&uaddr, af);
2082 if (!(kt->pfrkt_flags & PFR_TFLAG_ACTIVE) && kt->pfrkt_root != NULL)
2083 kt = kt->pfrkt_root;
2084 if (!(kt->pfrkt_flags & PFR_TFLAG_ACTIVE))
2089 if (counter != NULL && idx >= 0)
2095 ke = pfr_kentry_byidx(kt, idx, af);
2097 kt->pfrkt_nomatch++;
2100 pfr_prepare_network(&umask, af, ke->pfrke_net);
2101 cur = SUNION2PF(&ke->pfrke_sa, af);
2102 mask = SUNION2PF(&umask, af);
2105 /* is supplied address within block? */
2106 if (!PF_MATCHA(0, cur, mask, counter, af)) {
2107 /* no, go to next block in table */
2112 PF_ACPY(addr, counter, af);
2114 /* use first address of block */
2115 PF_ACPY(addr, cur, af);
2118 if (!KENTRY_NETWORK(ke)) {
2119 /* this is a single IP address - no possible nested block */
2120 PF_ACPY(counter, addr, af);
2126 /* we don't want to use a nested block */
2129 ke2 = (struct pfr_kentry *)rn_match(&uaddr,
2130 &kt->pfrkt_ip4->rh);
2133 ke2 = (struct pfr_kentry *)rn_match(&uaddr,
2134 &kt->pfrkt_ip6->rh);
2137 /* no need to check KENTRY_RNF_ROOT() here */
2139 /* lookup return the same block - perfect */
2140 PF_ACPY(counter, addr, af);
2146 /* we need to increase the counter past the nested block */
2147 pfr_prepare_network(&umask, AF_INET, ke2->pfrke_net);
2148 PF_POOLMASK(addr, addr, SUNION2PF(&umask, af), &pfr_ffaddr, af);
2150 if (!PF_MATCHA(0, cur, mask, addr, af)) {
2151 /* ok, we reached the end of our main block */
2152 /* go to next block in table */
2160 static struct pfr_kentry *
2161 pfr_kentry_byidx(struct pfr_ktable *kt, int idx, int af)
2163 struct pfr_walktree w;
2165 bzero(&w, sizeof(w));
2166 w.pfrw_op = PFRW_POOL_GET;
2172 kt->pfrkt_ip4->rnh_walktree(&kt->pfrkt_ip4->rh, pfr_walktree, &w);
2173 return (w.pfrw_kentry);
2177 kt->pfrkt_ip6->rnh_walktree(&kt->pfrkt_ip6->rh, pfr_walktree, &w);
2178 return (w.pfrw_kentry);
2186 pfr_dynaddr_update(struct pfr_ktable *kt, struct pfi_dynaddr *dyn)
2188 struct pfr_walktree w;
2190 bzero(&w, sizeof(w));
2191 w.pfrw_op = PFRW_DYNADDR_UPDATE;
2194 dyn->pfid_acnt4 = 0;
2195 dyn->pfid_acnt6 = 0;
2196 if (!dyn->pfid_af || dyn->pfid_af == AF_INET)
2197 kt->pfrkt_ip4->rnh_walktree(&kt->pfrkt_ip4->rh, pfr_walktree, &w);
2198 if (!dyn->pfid_af || dyn->pfid_af == AF_INET6)
2199 kt->pfrkt_ip6->rnh_walktree(&kt->pfrkt_ip6->rh, pfr_walktree, &w);