Home
last modified time | relevance | path

Searched refs:PF_SKIP_COUNT (Results 1 – 9 of 9) sorted by path

/freebsd/lib/libpfctl/
H A Dlibpfctl.c704 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()
H A Dlibpfctl.h165 union pf_rule_ptr skip[PF_SKIP_COUNT];
/freebsd/sbin/pfctl/
H A Dpfctl.c1045 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()
H A Dpfctl_optimize.c245 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 …]
H A Dpfctl_parser.h272 TAILQ_ENTRY(pf_opt_rule) por_skip_entry[PF_SKIP_COUNT];
/freebsd/sys/net/
H A Dpfvar.h760 union pf_krule_ptr skip[PF_SKIP_COUNT];
/freebsd/sys/netpfil/pf/
H A Dpf.c2508 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()
H A Dpf.h495 #define PF_SKIP_COUNT 8 macro
496 union pf_rule_ptr skip[PF_SKIP_COUNT];
H A Dpf_nv.c704 for (int i = 0; i < PF_SKIP_COUNT; i++) { in pf_krule_to_nvrule()