Lines Matching defs:ruleset
134 pf_init_kruleset(struct pf_kruleset *ruleset)
138 memset(ruleset, 0, sizeof(struct pf_kruleset));
140 TAILQ_INIT(&ruleset->rules[i].queues[0]);
141 TAILQ_INIT(&ruleset->rules[i].queues[1]);
142 ruleset->rules[i].active.ptr = &ruleset->rules[i].queues[0];
143 ruleset->rules[i].inactive.ptr = &ruleset->rules[i].queues[1];
160 return (&anchor->ruleset);
167 struct pf_kruleset *ruleset;
174 ruleset = pf_find_kruleset(path);
175 if (ruleset != NULL)
176 return (ruleset);
183 if ((ruleset = pf_find_kruleset(p)) != NULL) {
184 parent = ruleset->anchor;
243 pf_init_kruleset(&anchor->ruleset);
244 anchor->ruleset.anchor = anchor;
252 return (&anchor->ruleset);
256 pf_remove_if_empty_kruleset(struct pf_kruleset *ruleset)
261 while (ruleset != NULL) {
262 if (ruleset == &pf_main_ruleset || ruleset->anchor == NULL ||
263 !RB_EMPTY(&ruleset->anchor->children) ||
264 ruleset->anchor->refcnt > 0 || ruleset->tables > 0 ||
265 ruleset->topen)
268 if (!TAILQ_EMPTY(ruleset->rules[i].active.ptr) ||
269 !TAILQ_EMPTY(ruleset->rules[i].inactive.ptr) ||
270 ruleset->rules[i].inactive.open)
272 RB_REMOVE(pf_kanchor_global, &V_pf_anchors, ruleset->anchor);
273 if ((parent = ruleset->anchor->parent) != NULL)
275 ruleset->anchor);
276 rs_free(ruleset->anchor);
279 ruleset = &parent->ruleset;
288 struct pf_kruleset *ruleset;
328 ruleset = pf_find_or_create_kruleset(path);
330 if (ruleset == NULL || ruleset->anchor == NULL) {
331 printf("pf_anchor_setup: ruleset\n");
334 r->anchor = ruleset->anchor;
443 pf_remove_if_empty_kruleset(&r->anchor->ruleset);