HomeSort by: relevance | last modified time | path
    Searched defs:por_next (Results 1 - 2 of 2) sorted by relevancy

  /src/dist/pf/sbin/pfctl/
pfctl_optimize.c 446 struct pf_opt_rule *por1, *por2, *por_next, *por2_next; local in function:remove_identical_rules
449 for (por1 = TAILQ_FIRST(&block->sb_rules); por1; por1 = por_next) {
450 por_next = TAILQ_NEXT(por1, por_entry);
451 for (por2 = por_next; por2; por2 = por2_next) {
464 if (por_next == por2)
465 por_next = TAILQ_NEXT(por1, por_entry);
488 struct pf_opt_rule *p1, *p2, *por_next; local in function:combine_rules
498 for (p2 = TAILQ_NEXT(p1, por_entry); p2; p2 = por_next) {
499 por_next = TAILQ_NEXT(p2, por_entry);
559 for (p1 = TAILQ_FIRST(&block->sb_rules); p1; p1 = por_next) {
    [all...]
pfctl_optimize.c 446 struct pf_opt_rule *por1, *por2, *por_next, *por2_next; local in function:remove_identical_rules
449 for (por1 = TAILQ_FIRST(&block->sb_rules); por1; por1 = por_next) {
450 por_next = TAILQ_NEXT(por1, por_entry);
451 for (por2 = por_next; por2; por2 = por2_next) {
464 if (por_next == por2)
465 por_next = TAILQ_NEXT(por1, por_entry);
488 struct pf_opt_rule *p1, *p2, *por_next; local in function:combine_rules
498 for (p2 = TAILQ_NEXT(p1, por_entry); p2; p2 = por_next) {
499 por_next = TAILQ_NEXT(p2, por_entry);
559 for (p1 = TAILQ_FIRST(&block->sb_rules); p1; p1 = por_next) {
    [all...]

Completed in 27 milliseconds