pf_main_ruleset
return (&pf_main_ruleset);
return (&pf_main_ruleset);
if (ruleset == &pf_main_ruleset || ruleset->anchor == NULL ||
pf_main_ruleset.rules[PF_RULESET_FILTER].active.rcount) {
TAILQ_FOREACH(r, pf_main_ruleset.rules[
ruleset = &pf_main_ruleset;
if (rs == &pf_main_ruleset) {
if (ioc->ticket != pf_main_ruleset.rules[PF_RULESET_FILTER].inactive.ticket) {
if (ioc->ticket != pf_main_ruleset.rules[PF_RULESET_FILTER].inactive.ticket) {
&pf_main_ruleset, pfsrlim->pfsrlim_overload.name);
pf_init_kruleset(&pf_main_ruleset);
if (ruleset == &pf_main_ruleset) {
if (ruleset == &pf_main_ruleset) {
struct pf_kruleset *ruleset = &pf_main_ruleset;
pf_rule_tree_free(pf_main_ruleset.rules[i].active.tree);
pf_rule_tree_free(pf_main_ruleset.rules[i].inactive.tree);
rv = pf_match_translation_rule(rs_num, ctx, &pf_main_ruleset);
r = TAILQ_FIRST(pf_main_ruleset.rules[PF_RULESET_SCRUB].active.ptr);
r = TAILQ_FIRST(pf_main_ruleset.rules[PF_RULESET_SCRUB].active.ptr);
r = TAILQ_FIRST(pf_main_ruleset.rules[PF_RULESET_SCRUB].active.ptr);
r = TAILQ_FIRST(pf_main_ruleset.rules[PF_RULESET_SCRUB].active.ptr);
return (&pf_main_ruleset);
ruleset = &pf_main_ruleset;
return (&pf_main_ruleset);
if (ruleset == &pf_main_ruleset ||
if (ruleset == NULL || ruleset == &pf_main_ruleset) {
if (rs == &pf_main_ruleset)
return (pf_main_ruleset.tables);