lib/libpfctl/libpfctl.c

728

assert(skipcount == PF_SKIP_COUNT);

lib/libpfctl/libpfctl.c

729

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

lib/libpfctl/libpfctl.h

183

union pf_rule_ptr skip[PF_SKIP_COUNT];

sbin/pfctl/pfctl.c

1193

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

sbin/pfctl/pfctl.c

1198

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

sbin/pfctl/pfctl_optimize.c

1027

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

sbin/pfctl/pfctl_optimize.c

1215

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

sbin/pfctl/pfctl_optimize.c

1222

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

sbin/pfctl/pfctl_optimize.c

1363

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

sbin/pfctl/pfctl_optimize.c

248

static int (*skip_comparitors[PF_SKIP_COUNT])(struct pfctl_rule *,

sbin/pfctl/pfctl_optimize.c

250

static const char *skip_comparitors_names[PF_SKIP_COUNT];

sbin/pfctl/pfctl_optimize.c

670

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

734

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

sbin/pfctl/pfctl_optimize.c

76

TAILQ_HEAD(skiplist, pf_skip_step) sb_skipsteps[PF_SKIP_COUNT];

sbin/pfctl/pfctl_optimize.c

777

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

sbin/pfctl/pfctl_optimize.c

807

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

sbin/pfctl/pfctl_optimize.c

985

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

sbin/pfctl/pfctl_parser.h

300

TAILQ_ENTRY(pf_opt_rule) por_skip_entry[PF_SKIP_COUNT];

sys/net/pfvar.h

802

struct pf_krule *skip[PF_SKIP_COUNT];

sys/netpfil/pf/pf.c

3518

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

sys/netpfil/pf/pf.c

3523

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

sys/netpfil/pf/pf.c

3552

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

sys/netpfil/pf/pf.h

523

union pf_rule_ptr skip[PF_SKIP_COUNT];

sys/netpfil/pf/pf_nv.c

708

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