Searched refs:PF_SKIP_COUNT (Results 1 – 9 of 9) sorted by path
704 assert(skipcount == PF_SKIP_COUNT); in pf_nvrule_to_rule()705 for (int i = 0; i < PF_SKIP_COUNT; i++) in pf_nvrule_to_rule()
165 union pf_rule_ptr skip[PF_SKIP_COUNT];
1045 const char *t[PF_SKIP_COUNT] = { "i", "d", "f", in pfctl_print_rule_counters()1050 for (i = 0; i < PF_SKIP_COUNT; ++i) { in pfctl_print_rule_counters()
245 static const char *skip_comparitors_names[PF_SKIP_COUNT];651 for (i = 0; i < PF_SKIP_COUNT; i++) { in reorder_rules()679 for (i = 0; i < PF_SKIP_COUNT; i++) { in reorder_rules()719 for (i = 0; i < PF_SKIP_COUNT; i++) { in reorder_rules()766 for (i = 0; i < PF_SKIP_COUNT; i++) in reorder_rules()796 for (i = 0; i < PF_SKIP_COUNT; i++) { in reorder_rules()973 if (skipnum >= PF_SKIP_COUNT || skipnum < 0) in skip_compare()1015 for (i = 0; i < PF_SKIP_COUNT; i++) { in remove_from_skipsteps()1203 for (skipnum = 0; skipnum < PF_SKIP_COUNT; skipnum++) { in skip_init()1210 for (skipnum = 0; skipnum < PF_SKIP_COUNT; skipnum++) in skip_init()[all …]
272 TAILQ_ENTRY(pf_opt_rule) por_skip_entry[PF_SKIP_COUNT];
760 union pf_krule_ptr skip[PF_SKIP_COUNT];
2508 struct pf_krule *cur, *prev, *head[PF_SKIP_COUNT]; in pf_calc_skip_steps()2513 for (i = 0; i < PF_SKIP_COUNT; ++i) in pf_calc_skip_steps()2542 for (i = 0; i < PF_SKIP_COUNT; ++i) in pf_calc_skip_steps()
495 #define PF_SKIP_COUNT 8 macro496 union pf_rule_ptr skip[PF_SKIP_COUNT];
704 for (int i = 0; i < PF_SKIP_COUNT; i++) { in pf_krule_to_nvrule()