2 * SPDX-License-Identifier: BSD-2-Clause
4 * Copyright (c) 2001 Daniel Hartmeier
5 * Copyright (c) 2002,2003 Henning Brauer
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
12 * - Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * - Redistributions in binary form must reproduce the above
15 * copyright notice, this list of conditions and the following
16 * disclaimer in the documentation and/or other materials provided
17 * with the distribution.
19 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
20 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
21 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
22 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
23 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
24 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
25 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
26 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
27 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
29 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
30 * POSSIBILITY OF SUCH DAMAGE.
32 * Effort sponsored in part by the Defense Advanced Research Projects
33 * Agency (DARPA) and Air Force Research Laboratory, Air Force
34 * Materiel Command, USAF, under agreement number F30602-01-2-0537.
36 * $OpenBSD: pf_ruleset.c,v 1.2 2008/12/18 15:31:37 dhill Exp $
39 #include <sys/cdefs.h>
40 __FBSDID("$FreeBSD$");
42 #include <sys/param.h>
43 #include <sys/socket.h>
46 #include <netinet/in.h>
47 #include <netinet/in_systm.h>
48 #include <netinet/ip.h>
49 #include <netinet/tcp.h>
53 #include <net/pfvar.h>
56 #include <netinet/ip6.h>
59 #include <arpa/inet.h>
64 #define rs_malloc(x) calloc(1, x)
65 #define rs_free(x) free(x)
68 #include <sys/stdarg.h>
69 #define DPFPRINTF(format, x...) fprintf(stderr, format , ##x)
71 #define DPFPRINTF(format, x...) ((void)0)
74 struct pf_anchor_global pf_anchors;
75 struct pf_anchor pf_main_anchor;
77 #define V_pf_anchors pf_anchors
78 #undef pf_main_ruleset
79 #define pf_main_ruleset pf_main_anchor.ruleset
81 static __inline int pf_anchor_compare(struct pf_anchor *,
83 static struct pf_anchor *pf_find_anchor(const char *);
85 RB_GENERATE(pf_anchor_global, pf_anchor, entry_global, pf_anchor_compare);
86 RB_GENERATE(pf_anchor_node, pf_anchor, entry_node, pf_anchor_compare);
89 pf_anchor_compare(struct pf_anchor *a, struct pf_anchor *b)
91 int c = strcmp(a->path, b->path);
93 return (c ? (c < 0 ? -1 : 1) : 0);
97 pf_get_ruleset_number(u_int8_t action)
102 return (PF_RULESET_SCRUB);
106 return (PF_RULESET_FILTER);
110 return (PF_RULESET_NAT);
114 return (PF_RULESET_BINAT);
118 return (PF_RULESET_RDR);
121 return (PF_RULESET_MAX);
127 pf_init_ruleset(struct pf_ruleset *ruleset)
131 memset(ruleset, 0, sizeof(struct pf_ruleset));
132 for (i = 0; i < PF_RULESET_MAX; i++) {
133 TAILQ_INIT(&ruleset->rules[i].queues[0]);
134 TAILQ_INIT(&ruleset->rules[i].queues[1]);
135 ruleset->rules[i].active.ptr = &ruleset->rules[i].queues[0];
136 ruleset->rules[i].inactive.ptr = &ruleset->rules[i].queues[1];
140 static struct pf_anchor *
141 pf_find_anchor(const char *path)
143 struct pf_anchor *key, *found;
145 key = (struct pf_anchor *)rs_malloc(sizeof(*key));
148 strlcpy(key->path, path, sizeof(key->path));
149 found = RB_FIND(pf_anchor_global, &V_pf_anchors, key);
155 pf_find_ruleset(const char *path)
157 struct pf_anchor *anchor;
162 return (&pf_main_ruleset);
163 anchor = pf_find_anchor(path);
167 return (&anchor->ruleset);
171 pf_find_or_create_ruleset(const char *path)
174 struct pf_ruleset *ruleset;
175 struct pf_anchor *anchor = NULL, *dup, *parent = NULL;
178 return (&pf_main_ruleset);
181 ruleset = pf_find_ruleset(path);
184 p = (char *)rs_malloc(MAXPATHLEN);
187 strlcpy(p, path, MAXPATHLEN);
188 while (parent == NULL && (q = strrchr(p, '/')) != NULL) {
190 if ((ruleset = pf_find_ruleset(p)) != NULL) {
191 parent = ruleset->anchor;
199 strlcpy(p, path, MAXPATHLEN);
204 while ((r = strchr(q, '/')) != NULL || *q) {
207 if (!*q || strlen(q) >= PF_ANCHOR_NAME_SIZE ||
208 (parent != NULL && strlen(parent->path) >=
209 MAXPATHLEN - PF_ANCHOR_NAME_SIZE - 1)) {
213 anchor = (struct pf_anchor *)rs_malloc(sizeof(*anchor));
214 if (anchor == NULL) {
218 RB_INIT(&anchor->children);
219 strlcpy(anchor->name, q, sizeof(anchor->name));
220 if (parent != NULL) {
221 strlcpy(anchor->path, parent->path,
222 sizeof(anchor->path));
223 strlcat(anchor->path, "/", sizeof(anchor->path));
225 strlcat(anchor->path, anchor->name, sizeof(anchor->path));
226 if ((dup = RB_INSERT(pf_anchor_global, &V_pf_anchors, anchor)) !=
228 printf("pf_find_or_create_ruleset: RB_INSERT1 "
229 "'%s' '%s' collides with '%s' '%s'\n",
230 anchor->path, anchor->name, dup->path, dup->name);
235 if (parent != NULL) {
236 anchor->parent = parent;
237 if ((dup = RB_INSERT(pf_anchor_node, &parent->children,
239 printf("pf_find_or_create_ruleset: "
240 "RB_INSERT2 '%s' '%s' collides with "
241 "'%s' '%s'\n", anchor->path, anchor->name,
242 dup->path, dup->name);
243 RB_REMOVE(pf_anchor_global, &V_pf_anchors,
250 pf_init_ruleset(&anchor->ruleset);
251 anchor->ruleset.anchor = anchor;
259 return (&anchor->ruleset);
263 pf_remove_if_empty_ruleset(struct pf_ruleset *ruleset)
265 struct pf_anchor *parent;
268 while (ruleset != NULL) {
269 if (ruleset == &pf_main_ruleset || ruleset->anchor == NULL ||
270 !RB_EMPTY(&ruleset->anchor->children) ||
271 ruleset->anchor->refcnt > 0 || ruleset->tables > 0 ||
274 for (i = 0; i < PF_RULESET_MAX; ++i)
275 if (!TAILQ_EMPTY(ruleset->rules[i].active.ptr) ||
276 !TAILQ_EMPTY(ruleset->rules[i].inactive.ptr) ||
277 ruleset->rules[i].inactive.open)
279 RB_REMOVE(pf_anchor_global, &V_pf_anchors, ruleset->anchor);
280 if ((parent = ruleset->anchor->parent) != NULL)
281 RB_REMOVE(pf_anchor_node, &parent->children,
283 rs_free(ruleset->anchor);
286 ruleset = &parent->ruleset;
290 pf_anchor_setup(struct pf_rule *r, const struct pf_ruleset *s,
294 struct pf_ruleset *ruleset;
297 r->anchor_relative = 0;
298 r->anchor_wildcard = 0;
301 path = (char *)rs_malloc(MAXPATHLEN);
305 strlcpy(path, name + 1, MAXPATHLEN);
308 r->anchor_relative = 1;
309 if (s->anchor == NULL || !s->anchor->path[0])
312 strlcpy(path, s->anchor->path, MAXPATHLEN);
313 while (name[0] == '.' && name[1] == '.' && name[2] == '/') {
315 printf("pf_anchor_setup: .. beyond root\n");
319 if ((p = strrchr(path, '/')) != NULL)
323 r->anchor_relative++;
327 strlcat(path, "/", MAXPATHLEN);
328 strlcat(path, name, MAXPATHLEN);
330 if ((p = strrchr(path, '/')) != NULL && !strcmp(p, "/*")) {
331 r->anchor_wildcard = 1;
334 ruleset = pf_find_or_create_ruleset(path);
336 if (ruleset == NULL || ruleset->anchor == NULL) {
337 printf("pf_anchor_setup: ruleset\n");
340 r->anchor = ruleset->anchor;