Lines Matching defs:por1
450 struct pf_opt_rule *por1, *por2, *por_next, *por2_next;
453 for (por1 = TAILQ_FIRST(&block->sb_rules); por1; por1 = por_next) {
454 por_next = TAILQ_NEXT(por1, por_entry);
457 comparable_rule(&a, &por1->por_rule, DC);
466 por1->por_rule.nr, por2->por_rule.nr);
469 por_next = TAILQ_NEXT(por1, por_entry);
473 por1->por_rule.nr, por2->por_rule.nr);
474 TAILQ_REMOVE(&block->sb_rules, por1, por_entry);
475 free(por1);
817 struct pf_opt_rule *por1, *por2;
826 TAILQ_FOREACH(por1, &block->sb_profiled_block->sb_rules, por_entry) {
827 comparable_rule(&a, &por1->por_rule, DC);
828 total_count += por1->por_rule.packets[0] +
829 por1->por_rule.packets[1];
836 por1->por_rule.packets[0] +
837 por1->por_rule.packets[1];
851 while ((por1 = TAILQ_FIRST(&block->sb_rules)) != NULL) {
852 TAILQ_REMOVE(&block->sb_rules, por1, por_entry);
853 TAILQ_INSERT_TAIL(&queue, por1, por_entry);
856 while ((por1 = TAILQ_FIRST(&queue)) != NULL) {
857 TAILQ_REMOVE(&queue, por1, por_entry);
860 if (por1->por_profile_count > por2->por_profile_count) {
861 TAILQ_INSERT_BEFORE(por2, por1, por_entry);
870 TAILQ_INSERT_TAIL(&block->sb_rules, por1, por_entry);