Lines Matching refs:ruleset
183 pf_init_ruleset(struct pf_ruleset *ruleset)
187 memset(ruleset, 0, sizeof (struct pf_ruleset));
189 TAILQ_INIT(&ruleset->rules[i].queues[0]);
190 TAILQ_INIT(&ruleset->rules[i].queues[1]);
191 ruleset->rules[i].active.ptr = &ruleset->rules[i].queues[0];
192 ruleset->rules[i].inactive.ptr = &ruleset->rules[i].queues[1];
222 return (&anchor->ruleset);
242 return (&anchor->ruleset);
252 struct pf_ruleset *ruleset;
259 ruleset = pf_find_ruleset(path);
260 if (ruleset != NULL)
261 return (ruleset);
267 if ((ruleset = pf_find_ruleset(p)) != NULL) {
268 parent = ruleset->anchor;
328 pf_init_ruleset(&anchor->ruleset);
329 anchor->ruleset.anchor = anchor;
337 return (anchor ? &anchor->ruleset : 0);
341 pf_remove_if_empty_ruleset(struct pf_ruleset *ruleset)
346 while (ruleset != NULL) {
347 if (ruleset == &pf_main_ruleset || ruleset->anchor == NULL ||
348 !RB_EMPTY(&ruleset->anchor->children) ||
349 ruleset->anchor->refcnt > 0 || ruleset->tables > 0 ||
350 ruleset->topen)
353 if (!TAILQ_EMPTY(ruleset->rules[i].active.ptr) ||
354 !TAILQ_EMPTY(ruleset->rules[i].inactive.ptr) ||
355 ruleset->rules[i].inactive.open)
357 RB_REMOVE(pf_anchor_global, &pf_anchors, ruleset->anchor);
358 if ((parent = ruleset->anchor->parent) != NULL)
360 ruleset->anchor);
361 rs_free(ruleset->anchor);
364 ruleset = &parent->ruleset;
373 struct pf_ruleset *ruleset;
412 ruleset = pf_find_or_create_ruleset(path);
414 if (ruleset == NULL || ruleset->anchor == NULL) {
415 printf("pf_anchor_setup: ruleset\n");
418 r->anchor = ruleset->anchor;
479 pf_remove_if_empty_ruleset(&r->anchor->ruleset);