Searched refs:PF_SKIP_COUNT (Results 1 – 10 of 10) sorted by relevance
79 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];654 for (i = 0; i < PF_SKIP_COUNT; i++) { in reorder_rules()682 for (i = 0; i < PF_SKIP_COUNT; i++) { in reorder_rules()722 for (i = 0; i < PF_SKIP_COUNT; i++) { in reorder_rules()769 for (i = 0; i < PF_SKIP_COUNT; i++) in reorder_rules()799 for (i = 0; i < PF_SKIP_COUNT; i++) { in reorder_rules()978 if (skipnum >= PF_SKIP_COUNT || skipnum < 0) in skip_compare()1020 for (i = 0; i < PF_SKIP_COUNT; i++) { in remove_from_skipsteps()[all …]
258 TAILQ_ENTRY(pf_opt_rule) por_skip_entry[PF_SKIP_COUNT];
984 const char *t[PF_SKIP_COUNT] = { "i", "d", "f", in pfctl_print_rule_counters()989 for (i = 0; i < PF_SKIP_COUNT; ++i) { in pfctl_print_rule_counters()
479 #define PF_SKIP_COUNT 8 macro480 union pf_rule_ptr skip[PF_SKIP_COUNT];
703 for (int i = 0; i < PF_SKIP_COUNT; i++) { in pf_krule_to_nvrule()
2375 struct pf_krule *cur, *prev, *head[PF_SKIP_COUNT]; in pf_calc_skip_steps()2380 for (i = 0; i < PF_SKIP_COUNT; ++i) in pf_calc_skip_steps()2410 for (i = 0; i < PF_SKIP_COUNT; ++i) in pf_calc_skip_steps()
1626 for (int i = 0; i < PF_SKIP_COUNT; ++i) { in pf_krule_to_rule()
87 union pf_rule_ptr skip[PF_SKIP_COUNT];
491 assert(skipcount == PF_SKIP_COUNT); in pf_nvrule_to_rule()492 for (int i = 0; i < PF_SKIP_COUNT; i++) in pf_nvrule_to_rule()
575 union pf_krule_ptr skip[PF_SKIP_COUNT];