Lines Matching full:por
272 struct pf_opt_rule *por; in pfctl_optimize_ruleset() local
297 if ((por = calloc(1, sizeof(*por))) == NULL) in pfctl_optimize_ruleset()
299 memcpy(&por->por_rule, r, sizeof(*r)); in pfctl_optimize_ruleset()
301 TAILQ_INIT(&por->por_rule.rdr.list); in pfctl_optimize_ruleset()
302 pfctl_move_pool(&r->rdr, &por->por_rule.rdr); in pfctl_optimize_ruleset()
304 bzero(&por->por_rule.rdr, in pfctl_optimize_ruleset()
305 sizeof(por->por_rule.rdr)); in pfctl_optimize_ruleset()
307 TAILQ_INIT(&por->por_rule.nat.list); in pfctl_optimize_ruleset()
308 pfctl_move_pool(&r->nat, &por->por_rule.nat); in pfctl_optimize_ruleset()
310 bzero(&por->por_rule.nat, in pfctl_optimize_ruleset()
311 sizeof(por->por_rule.nat)); in pfctl_optimize_ruleset()
313 TAILQ_INIT(&por->por_rule.route.list); in pfctl_optimize_ruleset()
314 pfctl_move_pool(&r->route, &por->por_rule.route); in pfctl_optimize_ruleset()
316 bzero(&por->por_rule.route, in pfctl_optimize_ruleset()
317 sizeof(por->por_rule.route)); in pfctl_optimize_ruleset()
319 TAILQ_INSERT_TAIL(&opt_queue, por, por_entry); in pfctl_optimize_ruleset()
340 while ((por = TAILQ_FIRST(&block->sb_rules))) { in pfctl_optimize_ruleset()
341 TAILQ_REMOVE(&block->sb_rules, por, por_entry); in pfctl_optimize_ruleset()
342 por->por_rule.nr = rs->anchor->refcnt++; in pfctl_optimize_ruleset()
345 memcpy(r, &por->por_rule, sizeof(*r)); in pfctl_optimize_ruleset()
347 pfctl_move_pool(&por->por_rule.rdr, &r->rdr); in pfctl_optimize_ruleset()
349 pfctl_move_pool(&por->por_rule.nat, &r->nat); in pfctl_optimize_ruleset()
353 pf_opt_table_unref(por->por_src_tbl); in pfctl_optimize_ruleset()
354 pf_opt_table_unref(por->por_dst_tbl); in pfctl_optimize_ruleset()
355 free(por); in pfctl_optimize_ruleset()
363 while ((por = TAILQ_FIRST(&opt_queue))) { in pfctl_optimize_ruleset()
364 TAILQ_REMOVE(&opt_queue, por, por_entry); in pfctl_optimize_ruleset()
365 pf_opt_table_unref(por->por_src_tbl); in pfctl_optimize_ruleset()
366 pf_opt_table_unref(por->por_dst_tbl); in pfctl_optimize_ruleset()
367 free(por); in pfctl_optimize_ruleset()
384 struct pf_opt_rule *por; in optimize_superblock() local
423 TAILQ_FOREACH(por, &block->sb_rules, por_entry) { in optimize_superblock()
425 print_rule(&por->por_rule, por->por_rule.anchor ? in optimize_superblock()
426 por->por_rule.anchor->name : "", 1, 0); in optimize_superblock()
662 struct pf_opt_rule *por; in reorder_rules() local
671 TAILQ_FOREACH(por, &block->sb_rules, por_entry) { in reorder_rules()
674 if (skip_compare(i, skiplist, por) == 0) in reorder_rules()
685 skip_append(block, i, skiplist, por); in reorder_rules()
689 TAILQ_FOREACH(por, &block->sb_rules, por_entry) in reorder_rules()
788 while ((por = TAILQ_FIRST(&skiplist->ps_rules))) { in reorder_rules()
789 TAILQ_REMOVE(&head, por, por_entry); in reorder_rules()
790 TAILQ_REMOVE(&skiplist->ps_rules, por, in reorder_rules()
792 TAILQ_INSERT_TAIL(&newblock->sb_rules, por, in reorder_rules()
797 largest_list], block, por, skiplist); in reorder_rules()
891 struct pf_opt_rule *por; in load_feedback_profile() local
909 if ((por = calloc(1, sizeof(*por))) == NULL) { in load_feedback_profile()
917 free(por); in load_feedback_profile()
920 memcpy(&por->por_rule, &rule, sizeof(por->por_rule)); in load_feedback_profile()
922 por->por_rule.anchor = rs->anchor; in load_feedback_profile()
923 if (TAILQ_EMPTY(&por->por_rule.rdr.list)) in load_feedback_profile()
924 memset(&por->por_rule.rdr, 0, in load_feedback_profile()
925 sizeof(por->por_rule.rdr)); in load_feedback_profile()
926 if (TAILQ_EMPTY(&por->por_rule.nat.list)) in load_feedback_profile()
927 memset(&por->por_rule.nat, 0, in load_feedback_profile()
928 sizeof(por->por_rule.nat)); in load_feedback_profile()
929 TAILQ_INSERT_TAIL(&queue, por, por_entry); in load_feedback_profile()
982 struct pf_opt_rule *por) in skip_compare() argument
987 a = &por->por_rule; in skip_compare()
999 struct pf_skip_step *skiplist, struct pf_opt_rule *por) in skip_append() argument
1004 TAILQ_INSERT_TAIL(&skiplist->ps_rules, por, por_skip_entry[skipnum]); in skip_append()
1021 struct pf_opt_rule *por, struct pf_skip_step *active_list) in remove_from_skipsteps() argument
1034 if (p2 == por) { in remove_from_skipsteps()
1350 struct pf_opt_rule *por; in construct_superblocks() local
1354 por = TAILQ_FIRST(opt_queue); in construct_superblocks()
1355 TAILQ_REMOVE(opt_queue, por, por_entry); in construct_superblocks()
1356 if (block == NULL || !superblock_inclusive(block, por)) { in construct_superblocks()
1366 TAILQ_INSERT_TAIL(&block->sb_rules, por, por_entry); in construct_superblocks()
1419 superblock_inclusive(struct superblock *block, struct pf_opt_rule *por) in superblock_inclusive() argument
1428 if (((char *)&por->por_rule)[j + in superblock_inclusive()
1435 if (por->por_rule.rule_flag & PFRULE_RULESRCTRACK) in superblock_inclusive()
1452 if (interface_group(por->por_rule.ifname) || in superblock_inclusive()
1454 if (strcasecmp(por->por_rule.ifname, in superblock_inclusive()
1460 comparable_rule(&b, &por->por_rule, NOMERGE); in superblock_inclusive()
1465 for (i = 0; i < sizeof(por->por_rule); i++) { in superblock_inclusive()
1474 por->por_rule.nr, in superblock_inclusive()
1488 por->por_rule.nr, in superblock_inclusive()
1494 por->por_rule.nr, i); in superblock_inclusive()
1651 struct pf_opt_rule *por; in superblock_free() local
1652 while ((por = TAILQ_FIRST(&block->sb_rules))) { in superblock_free()
1653 TAILQ_REMOVE(&block->sb_rules, por, por_entry); in superblock_free()
1654 pf_opt_table_unref(por->por_src_tbl); in superblock_free()
1655 pf_opt_table_unref(por->por_dst_tbl); in superblock_free()
1656 free(por); in superblock_free()