sys/net/pf/pf.c

1816

struct pf_rule *cur, *prev, *head[PF_SKIP_COUNT];

sys/net/pf/pf.c

1821

for (i = 0; i < PF_SKIP_COUNT; ++i)

sys/net/pf/pf.c

1851

for (i = 0; i < PF_SKIP_COUNT; ++i)

sys/net/pf/pf_ioctl.c

1343

for (i = 0; i < PF_SKIP_COUNT; ++i)

sys/net/pf/pfvar.h

579

union pf_rule_ptr skip[PF_SKIP_COUNT];

usr.sbin/pfctl/pfctl.c

764

const char *t[PF_SKIP_COUNT] = { "i", "d", "f",

usr.sbin/pfctl/pfctl.c

769

for (i = 0; i < PF_SKIP_COUNT; ++i) {

usr.sbin/pfctl/pfctl_optimize.c

1012

for (i = 0; i < PF_SKIP_COUNT; i++) {

usr.sbin/pfctl/pfctl_optimize.c

1200

for (skipnum = 0; skipnum < PF_SKIP_COUNT; skipnum++) {

usr.sbin/pfctl/pfctl_optimize.c

1207

for (skipnum = 0; skipnum < PF_SKIP_COUNT; skipnum++)

usr.sbin/pfctl/pfctl_optimize.c

1346

for (i = 0; i < PF_SKIP_COUNT; i++)

usr.sbin/pfctl/pfctl_optimize.c

242

int (*skip_comparitors[PF_SKIP_COUNT])(struct pf_rule *, struct pf_rule *);

usr.sbin/pfctl/pfctl_optimize.c

243

const char *skip_comparitors_names[PF_SKIP_COUNT];

usr.sbin/pfctl/pfctl_optimize.c

649

for (i = 0; i < PF_SKIP_COUNT; i++) {

usr.sbin/pfctl/pfctl_optimize.c

677

for (i = 0; i < PF_SKIP_COUNT; i++) {

usr.sbin/pfctl/pfctl_optimize.c

717

for (i = 0; i < PF_SKIP_COUNT; i++) {

usr.sbin/pfctl/pfctl_optimize.c

75

TAILQ_HEAD(skiplist, pf_skip_step) sb_skipsteps[PF_SKIP_COUNT];

usr.sbin/pfctl/pfctl_optimize.c

764

for (i = 0; i < PF_SKIP_COUNT; i++)

usr.sbin/pfctl/pfctl_optimize.c

794

for (i = 0; i < PF_SKIP_COUNT; i++) {

usr.sbin/pfctl/pfctl_optimize.c

970

if (skipnum >= PF_SKIP_COUNT || skipnum < 0)

usr.sbin/pfctl/pfctl_parser.h

230

TAILQ_ENTRY(pf_opt_rule) por_skip_entry[PF_SKIP_COUNT];