Searched refs:PF_SKIP_COUNT (Results 1 – 9 of 9) sorted by relevance
76 TAILQ_HEAD(skiplist, pf_skip_step) sb_skipsteps[PF_SKIP_COUNT];246 static int (*skip_comparitors[PF_SKIP_COUNT])(struct pfctl_rule *,248 static const char *skip_comparitors_names[PF_SKIP_COUNT];667 for (i = 0; i < PF_SKIP_COUNT; i++) { in reorder_rules()695 for (i = 0; i < PF_SKIP_COUNT; i++) { in reorder_rules()735 for (i = 0; i < PF_SKIP_COUNT; i++) { in reorder_rules()782 for (i = 0; i < PF_SKIP_COUNT; i++) in reorder_rules()812 for (i = 0; i < PF_SKIP_COUNT; i++) { in reorder_rules()992 if (skipnum >= PF_SKIP_COUNT || skipnum < 0) in skip_compare()1034 for (i = 0; i < PF_SKIP_COUNT; i++) { in remove_from_skipsteps()[all …]
272 TAILQ_ENTRY(pf_opt_rule) por_skip_entry[PF_SKIP_COUNT];
1040 const char *t[PF_SKIP_COUNT] = { "i", "d", "f", in pfctl_print_rule_counters()1045 for (i = 0; i < PF_SKIP_COUNT; ++i) { in pfctl_print_rule_counters()
504 #define PF_SKIP_COUNT 8 macro505 union pf_rule_ptr skip[PF_SKIP_COUNT];
705 for (int i = 0; i < PF_SKIP_COUNT; i++) { in pf_krule_to_nvrule()
3113 struct pf_krule *cur, *prev, *head[PF_SKIP_COUNT]; in pf_calc_skip_steps()3118 for (i = 0; i < PF_SKIP_COUNT; ++i) in pf_calc_skip_steps()3147 for (i = 0; i < PF_SKIP_COUNT; ++i) in pf_calc_skip_steps()
165 union pf_rule_ptr skip[PF_SKIP_COUNT];
713 assert(skipcount == PF_SKIP_COUNT); in pf_nvrule_to_rule()714 for (int i = 0; i < PF_SKIP_COUNT; i++) in pf_nvrule_to_rule()
802 struct pf_krule *skip[PF_SKIP_COUNT];