Searched refs:PF_SKIP_COUNT (Results 1 – 6 of 6) sorted by relevance
76 TAILQ_HEAD(skiplist, pf_skip_step) sb_skipsteps[PF_SKIP_COUNT];241 int (*skip_comparitors[PF_SKIP_COUNT])(struct pf_rule *, struct pf_rule *);242 const char *skip_comparitors_names[PF_SKIP_COUNT];648 for (i = 0; i < PF_SKIP_COUNT; i++) { in reorder_rules()676 for (i = 0; i < PF_SKIP_COUNT; i++) { in reorder_rules()716 for (i = 0; i < PF_SKIP_COUNT; i++) { in reorder_rules()763 for (i = 0; i < PF_SKIP_COUNT; i++) in reorder_rules()793 for (i = 0; i < PF_SKIP_COUNT; i++) { in reorder_rules()970 if (skipnum >= PF_SKIP_COUNT || skipnum < 0) in skip_compare()1012 for (i = 0; i < PF_SKIP_COUNT; i++) { in remove_from_skipsteps()[all …]
186 TAILQ_ENTRY(pf_opt_rule) por_skip_entry[PF_SKIP_COUNT];
714 const char *t[PF_SKIP_COUNT] = { "i", "d", "f", in pfctl_print_rule_counters()719 for (i = 0; i < PF_SKIP_COUNT; ++i) { in pfctl_print_rule_counters()
528 #define PF_SKIP_COUNT 8 macro529 union pf_rule_ptr skip[PF_SKIP_COUNT];
1332 struct pf_rule *cur, *prev, *head[PF_SKIP_COUNT];1337 for (i = 0; i < PF_SKIP_COUNT; ++i)1367 for (i = 0; i < PF_SKIP_COUNT; ++i)
1632 for (i = 0; i < PF_SKIP_COUNT; ++i) in pfioctl()