Searched refs:rules (Results 1 – 11 of 11) sorted by relevance
649 ruleset->rules[rs_num].active.ticket) { in pf_get_pool()653 rule = TAILQ_LAST(ruleset->rules[rs_num].active.ptr, in pf_get_pool()656 rule = TAILQ_FIRST(ruleset->rules[rs_num].active.ptr); in pf_get_pool()660 ruleset->rules[rs_num].inactive.ticket) { in pf_get_pool()664 rule = TAILQ_LAST(ruleset->rules[rs_num].inactive.ptr, in pf_get_pool()667 rule = TAILQ_FIRST(ruleset->rules[rs_num].inactive.ptr); in pf_get_pool()912 while ((rule = TAILQ_FIRST(rs->rules[rs_num].inactive.ptr)) != NULL) { in pf_begin_rules()913 pf_rm_rule(rs->rules[rs_num].inactive.ptr, rule); in pf_begin_rules()914 rs->rules[rs_num].inactive.rcount--; in pf_begin_rules()916 *ticket = ++rs->rules[rs_num].inactive.ticket; in pf_begin_rules()[all …]
182 TAILQ_INIT(&ruleset->rules[i].queues[0]); in pf_init_ruleset()183 TAILQ_INIT(&ruleset->rules[i].queues[1]); in pf_init_ruleset()184 ruleset->rules[i].active.ptr = &ruleset->rules[i].queues[0]; in pf_init_ruleset()185 ruleset->rules[i].inactive.ptr = &ruleset->rules[i].queues[1]; in pf_init_ruleset()362 if (!TAILQ_EMPTY(ruleset->rules[i].active.ptr) || in pf_remove_if_empty_ruleset()363 !TAILQ_EMPTY(ruleset->rules[i].inactive.ptr) || in pf_remove_if_empty_ruleset()364 ruleset->rules[i].inactive.open) { in pf_remove_if_empty_ruleset()
1925 r = TAILQ_FIRST(pf_main_ruleset.rules[PF_RULESET_SCRUB].active.ptr); in pf_normalize_ip()2263 r = TAILQ_FIRST(pf_main_ruleset.rules[PF_RULESET_SCRUB].active.ptr); in pf_normalize_ip6()2613 r = TAILQ_FIRST(pf_main_ruleset.rules[PF_RULESET_SCRUB].active.ptr); in pf_normalize_tcp()
2025 pf_calc_skip_steps(struct pf_rulequeue *rules) in pf_calc_skip_steps() argument2030 cur = TAILQ_FIRST(rules); in pf_calc_skip_steps()3109 *r = TAILQ_FIRST((*rs)->rules[n].active.ptr); in pf_step_into_anchor()3135 *r = TAILQ_FIRST((*rs)->rules[n].active.ptr); in pf_step_out_of_anchor()3725 r = TAILQ_FIRST(pf_main_ruleset.rules[rs_num].active.ptr); in pf_match_translation()4984 r = TAILQ_FIRST(pf_main_ruleset.rules[PF_RULESET_FILTER].active.ptr); in pf_test_rule()6162 rules[PF_RULESET_DUMMYNET].active.ptr))) { in pf_is_dummynet_enabled()6260 r = TAILQ_FIRST(pf_main_ruleset.rules[PF_RULESET_DUMMYNET].active.ptr); in pf_test_dummynet()6471 r = TAILQ_FIRST(pf_main_ruleset.rules[PF_RULESET_FILTER].active.ptr); in pf_test_fragment()11121 TAILQ_FOREACH(rule, pf_main_ruleset.rules[i].active.ptr, entries) { in pf_check_compatible_rules()
1212 } rules[PF_RULESET_MAX]; member
5 # MakeInc.rule defines the targets and rules for7 # into them. "do_XXX" may be double-colon rules14 # Generic Install rules346 # Generic Export rules387 # Generic Compilation rules391 # Compilation rules to generate .o from .s400 # Compilation rules to generate .o from .c for normal files412 # Compilation rules to generate .o from .c for driver files423 # Compilation rules to generate .co from .cp or .cpo from .cpp
5 # MakeInc.dir contains the recursion rules for the build system.
6 # recursive build system with rules specific265 # Install rules. Each build config is classified as "primary" (the first
124 or C++ `class`. Fixed-size types must follow certain rules:139 and the rules of "fixed-sized types" above apply to them.141 The following rules are expected when dealing with variable sized allocations:147 If those rules can't be followed, then the allocation must be split with
213 This creates all sorts of issues with macros. Follow these rules to make integral types compatible224 * Use division operators according to Python 3 rules.
18 * `makedefs` - top level rules and defines for kernel build.