dist/pf/sbin/pfctl/pfctl.c

714

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

dist/pf/sbin/pfctl/pfctl.c

719

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

dist/pf/sbin/pfctl/pfctl_optimize.c

1012

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

dist/pf/sbin/pfctl/pfctl_optimize.c

1200

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

dist/pf/sbin/pfctl/pfctl_optimize.c

1207

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

dist/pf/sbin/pfctl/pfctl_optimize.c

1345

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

dist/pf/sbin/pfctl/pfctl_optimize.c

241

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

dist/pf/sbin/pfctl/pfctl_optimize.c

242

const char *skip_comparitors_names[PF_SKIP_COUNT];

dist/pf/sbin/pfctl/pfctl_optimize.c

648

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

dist/pf/sbin/pfctl/pfctl_optimize.c

676

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

dist/pf/sbin/pfctl/pfctl_optimize.c

716

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

dist/pf/sbin/pfctl/pfctl_optimize.c

76

TAILQ_HEAD(skiplist, pf_skip_step) sb_skipsteps[PF_SKIP_COUNT];

dist/pf/sbin/pfctl/pfctl_optimize.c

763

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

dist/pf/sbin/pfctl/pfctl_optimize.c

793

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

dist/pf/sbin/pfctl/pfctl_optimize.c

970

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

dist/pf/sbin/pfctl/pfctl_parser.h

186

TAILQ_ENTRY(pf_opt_rule) por_skip_entry[PF_SKIP_COUNT];

sys/dist/pf/net/pf.c

1332

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

sys/dist/pf/net/pf.c

1337

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

sys/dist/pf/net/pf.c

1367

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

sys/dist/pf/net/pf_ioctl.c

1632

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

sys/dist/pf/net/pfvar.h

529

union pf_rule_ptr skip[PF_SKIP_COUNT];