Lines Matching refs:por
264 struct pf_opt_rule *por;
286 if ((por = calloc(1, sizeof(*por))) == NULL)
288 memcpy(&por->por_rule, r, sizeof(*r));
290 TAILQ_INIT(&por->por_rule.rpool.list);
291 pfctl_move_pool(&r->rpool, &por->por_rule.rpool);
293 bzero(&por->por_rule.rpool,
294 sizeof(por->por_rule.rpool));
297 TAILQ_INSERT_TAIL(&opt_queue, por, por_entry);
318 while ((por = TAILQ_FIRST(&block->sb_rules))) {
319 TAILQ_REMOVE(&block->sb_rules, por, por_entry);
320 por->por_rule.nr = rs->anchor->refcnt++;
323 memcpy(r, &por->por_rule, sizeof(*r));
325 pfctl_move_pool(&por->por_rule.rpool, &r->rpool);
329 free(por);
337 while ((por = TAILQ_FIRST(&opt_queue))) {
338 TAILQ_REMOVE(&opt_queue, por, por_entry);
339 if (por->por_src_tbl) {
340 pfr_buf_clear(por->por_src_tbl->pt_buf);
341 free(por->por_src_tbl->pt_buf);
342 free(por->por_src_tbl);
344 if (por->por_dst_tbl) {
345 pfr_buf_clear(por->por_dst_tbl->pt_buf);
346 free(por->por_dst_tbl->pt_buf);
347 free(por->por_dst_tbl);
349 free(por);
366 struct pf_opt_rule *por;
405 TAILQ_FOREACH(por, &block->sb_rules, por_entry) {
407 print_rule(&por->por_rule, por->por_rule.anchor ?
408 por->por_rule.anchor->name : "", 1);
640 struct pf_opt_rule *por;
649 TAILQ_FOREACH(por, &block->sb_rules, por_entry) {
652 if (skip_compare(i, skiplist, por) == 0)
663 skip_append(block, i, skiplist, por);
667 TAILQ_FOREACH(por, &block->sb_rules, por_entry)
704 while ((por = TAILQ_FIRST(&block->sb_rules))) {
705 TAILQ_REMOVE(&block->sb_rules, por, por_entry);
706 TAILQ_INSERT_TAIL(&head, por, por_entry);
729 while ((por = TAILQ_FIRST(&head))) {
730 TAILQ_REMOVE(&head, por, por_entry);
731 TAILQ_INSERT_TAIL(&block->sb_rules, por,
774 while ((por = TAILQ_FIRST(&skiplist->ps_rules))) {
775 TAILQ_REMOVE(&head, por, por_entry);
776 TAILQ_REMOVE(&skiplist->ps_rules, por,
778 TAILQ_INSERT_TAIL(&newblock->sb_rules, por,
783 largest_list], block, por, skiplist);
878 struct pf_opt_rule *por;
898 if ((por = calloc(1, sizeof(*por))) == NULL) {
905 free(por);
908 memcpy(&por->por_rule, &pr.rule, sizeof(por->por_rule));
910 por->por_rule.anchor = rs->anchor;
911 if (TAILQ_EMPTY(&por->por_rule.rpool.list))
912 memset(&por->por_rule.rpool, 0,
913 sizeof(por->por_rule.rpool));
914 TAILQ_INSERT_TAIL(&queue, por, por_entry);
967 struct pf_opt_rule *por)
972 a = &por->por_rule;
984 struct pf_skip_step *skiplist, struct pf_opt_rule *por)
989 TAILQ_INSERT_TAIL(&skiplist->ps_rules, por, por_skip_entry[skipnum]);
1006 struct pf_opt_rule *por, struct pf_skip_step *active_list)
1019 if (p2 == por) {
1333 struct pf_opt_rule *por;
1337 por = TAILQ_FIRST(opt_queue);
1338 TAILQ_REMOVE(opt_queue, por, por_entry);
1339 if (block == NULL || !superblock_inclusive(block, por)) {
1349 TAILQ_INSERT_TAIL(&block->sb_rules, por, por_entry);
1402 superblock_inclusive(struct superblock *block, struct pf_opt_rule *por)
1411 if (((char *)&por->por_rule)[j +
1418 if (por->por_rule.rule_flag & PFRULE_RULESRCTRACK)
1435 if (interface_group(por->por_rule.ifname) ||
1437 if (strcasecmp(por->por_rule.ifname,
1443 comparable_rule(&b, &por->por_rule, NOMERGE);
1448 for (i = 0; i < sizeof(por->por_rule); i++) {
1457 por->por_rule.nr,
1471 por->por_rule.nr,
1477 por->por_rule.nr, i);
1624 struct pf_opt_rule *por;
1625 while ((por = TAILQ_FIRST(&block->sb_rules))) {
1626 TAILQ_REMOVE(&block->sb_rules, por, por_entry);
1627 if (por->por_src_tbl) {
1628 if (por->por_src_tbl->pt_buf) {
1629 pfr_buf_clear(por->por_src_tbl->pt_buf);
1630 free(por->por_src_tbl->pt_buf);
1632 free(por->por_src_tbl);
1634 if (por->por_dst_tbl) {
1635 if (por->por_dst_tbl->pt_buf) {
1636 pfr_buf_clear(por->por_dst_tbl->pt_buf);
1637 free(por->por_dst_tbl->pt_buf);
1639 free(por->por_dst_tbl);
1641 free(por);
Indexes created Sat Oct 25 10:09:55 GMT 2025