netpfil/pf/pf_ruleset.c

97 #define pf_main_ruleset		 pf_main_anchor.ruleset
146 pf_init_ruleset(struct pf_ruleset *ruleset)
150 	memset(ruleset, 0, sizeof(struct pf_ruleset));
152 		TAILQ_INIT(&ruleset->rules[i].queues[0]);
153 		TAILQ_INIT(&ruleset->rules[i].queues[1]);
154 		ruleset->rules[i].active.ptr = &ruleset->rules[i].queues[0];
155 		ruleset->rules[i].inactive.ptr = &ruleset->rules[i].queues[1];
186 		return (&anchor->ruleset);
193 	struct pf_ruleset	*ruleset;
200 	ruleset = pf_find_ruleset(path);
201 	if (ruleset != NULL)
202 		return (ruleset);
209 		if ((ruleset = pf_find_ruleset(p)) != NULL) {
210 			parent = ruleset->anchor;
269 		pf_init_ruleset(&anchor->ruleset);
270 		anchor->ruleset.anchor = anchor;
278 	return (&anchor->ruleset);
282 pf_remove_if_empty_ruleset(struct pf_ruleset *ruleset)
287 	while (ruleset != NULL) {
288 		if (ruleset == &pf_main_ruleset || ruleset->anchor == NULL ||
289 		    !RB_EMPTY(&ruleset->anchor->children) ||
290 		    ruleset->anchor->refcnt > 0 || ruleset->tables > 0 ||
291 		    ruleset->topen)
294 			if (!TAILQ_EMPTY(ruleset->rules[i].active.ptr) ||
295 			    !TAILQ_EMPTY(ruleset->rules[i].inactive.ptr) ||
296 			    ruleset->rules[i].inactive.open)
298 		RB_REMOVE(pf_anchor_global, &V_pf_anchors, ruleset->anchor);
299 		if ((parent = ruleset->anchor->parent) != NULL)
301 			    ruleset->anchor);
302 		rs_free(ruleset->anchor);
305 		ruleset = &parent->ruleset;
314 	struct pf_ruleset	*ruleset;
354 	ruleset = pf_find_or_create_ruleset(path);
356 	if (ruleset == NULL || ruleset->anchor == NULL) {
357 		printf("pf_anchor_setup: ruleset\n");
360 	r->anchor = ruleset->anchor;
422 		pf_remove_if_empty_ruleset(&r->anchor->ruleset);