Home
last modified time | relevance | path

Searched refs:rules (Results 1 – 11 of 11) sorted by relevance

/xnu-8020.121.3/bsd/net/
H A Dpf_ioctl.c649 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 …]
H A Dpf_ruleset.c182 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()
H A Dpf_norm.c1925 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()
H A Dpf.c2004 pf_calc_skip_steps(struct pf_rulequeue *rules) in pf_calc_skip_steps() argument
2009 cur = TAILQ_FIRST(rules); in pf_calc_skip_steps()
3052 *r = TAILQ_FIRST((*rs)->rules[n].active.ptr); in pf_step_into_anchor()
3078 *r = TAILQ_FIRST((*rs)->rules[n].active.ptr); in pf_step_out_of_anchor()
3668 r = TAILQ_FIRST(pf_main_ruleset.rules[rs_num].active.ptr); in pf_match_translation()
4904 r = TAILQ_FIRST(pf_main_ruleset.rules[PF_RULESET_FILTER].active.ptr); in pf_test_rule()
6063 rules[PF_RULESET_DUMMYNET].active.ptr))) { in pf_is_dummynet_enabled()
6157 r = TAILQ_FIRST(pf_main_ruleset.rules[PF_RULESET_DUMMYNET].active.ptr); in pf_test_dummynet()
6368 r = TAILQ_FIRST(pf_main_ruleset.rules[PF_RULESET_FILTER].active.ptr); in pf_test_fragment()
10991 TAILQ_FOREACH(rule, pf_main_ruleset.rules[i].active.ptr, entries) { in pf_check_compatible_rules()
H A Dpfvar.h1212 } rules[PF_RULESET_MAX]; member
/xnu-8020.121.3/makedefs/
H A DMakeInc.rule5 # MakeInc.rule defines the targets and rules for
7 # into them. "do_XXX" may be double-colon rules
14 # Generic Install rules
328 # Generic Export rules
369 # Generic Compilation rules
373 # Compilation rules to generate .o from .s
382 # Compilation rules to generate .o from .c for normal files
394 # Compilation rules to generate .o from .c for driver files
405 # Compilation rules to generate .co from .cp or .cpo from .cpp
H A DMakeInc.dir5 # MakeInc.dir contains the recursion rules for the build system.
H A DMakeInc.kernel6 # recursive build system with rules specific
264 # Install rules. Each build config is classified as "primary" (the first
/xnu-8020.121.3/doc/allocators/
H A Dapi-basics.md124 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
/xnu-8020.121.3/doc/
H A Ddebugging.md154 This creates all sorts of issues with macros. Follow these rules to make integral types compatible
165 * Use division operators according to Python 3 rules.
/xnu-8020.121.3/
H A DREADME.md18 * `makedefs` - top level rules and defines for kernel build.