sbin/pfctl/pfctl.c

856

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

sbin/pfctl/pfctl.c

861

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

sbin/pfctl/pfctl_optimize.c

1173

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

sbin/pfctl/pfctl_optimize.c

1180

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

sbin/pfctl/pfctl_optimize.c

1320

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

sbin/pfctl/pfctl_optimize.c

245

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

sbin/pfctl/pfctl_optimize.c

246

const char *skip_comparitors_names[PF_SKIP_COUNT];

sbin/pfctl/pfctl_optimize.c

634

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

sbin/pfctl/pfctl_optimize.c

662

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

sbin/pfctl/pfctl_optimize.c

698

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

sbin/pfctl/pfctl_optimize.c

74

TAILQ_HEAD(skiplist, pf_skip_step) sb_skipsteps[PF_SKIP_COUNT];

sbin/pfctl/pfctl_optimize.c

741

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

sbin/pfctl/pfctl_optimize.c

771

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

sbin/pfctl/pfctl_optimize.c

934

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

sbin/pfctl/pfctl_optimize.c

976

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

sbin/pfctl/pfctl_parser.h

219

TAILQ_ENTRY(pf_opt_rule) por_skip_entry[PF_SKIP_COUNT];

sys/net/pf.c

2566

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

sys/net/pf.c

2571

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

sys/net/pf.c

2603

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

sys/net/pf_ioctl.c

2525

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

sys/net/pfvar.h

502

union pf_rule_ptr skip[PF_SKIP_COUNT];