HomeSort by: relevance | last modified time | path
    Searched refs:PF_SKIP_COUNT (Results 1 - 6 of 6) sorted by relevancy

  /src/dist/pf/sbin/pfctl/
pfctl_optimize.c 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++) {
676 for (i = 0; i < PF_SKIP_COUNT; i++) {
716 for (i = 0; i < PF_SKIP_COUNT; i++) {
763 for (i = 0; i < PF_SKIP_COUNT; i++)
793 for (i = 0; i < PF_SKIP_COUNT; i++) {
970 if (skipnum >= PF_SKIP_COUNT || skipnum < 0)
1012 for (i = 0; i < PF_SKIP_COUNT; i++)
    [all...]
pfctl_parser.h 186 TAILQ_ENTRY(pf_opt_rule) por_skip_entry[PF_SKIP_COUNT];
pfctl.c 714 const char *t[PF_SKIP_COUNT] = { "i", "d", "f",
719 for (i = 0; i < PF_SKIP_COUNT; ++i) {
  /src/sys/dist/pf/net/
pfvar.h 528 #define PF_SKIP_COUNT 8
529 union pf_rule_ptr skip[PF_SKIP_COUNT];
pf.c 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)
pf_ioctl.c 1632 for (i = 0; i < PF_SKIP_COUNT; ++i)

Completed in 22 milliseconds