Lines Matching full:inactive
458 ruleset->rules[rs_num].inactive.ticket)
461 rule = TAILQ_LAST(ruleset->rules[rs_num].inactive.ptr,
464 rule = TAILQ_FIRST(ruleset->rules[rs_num].inactive.ptr);
783 /* Purge old inactive rules. */
784 TAILQ_FOREACH_SAFE(rule, rs->inactive.rules, entries,
786 TAILQ_REMOVE(rs->inactive.rules, rule,
791 *ticket = ++rs->inactive.ticket;
792 rs->inactive.open = 1;
807 pf_rollback_eth(rs->inactive.ticket,
826 if (!rs->inactive.open ||
827 ticket != rs->inactive.ticket)
830 /* Purge old inactive rules. */
831 TAILQ_FOREACH_SAFE(rule, rs->inactive.rules, entries,
833 TAILQ_REMOVE(rs->inactive.rules, rule, entries);
837 rs->inactive.open = 0;
898 if (!rs->inactive.open ||
899 ticket != rs->inactive.ticket)
904 pf_eth_calc_skip_steps(rs->inactive.rules);
907 ck_pr_store_ptr(&rs->active.rules, rs->inactive.rules);
908 rs->inactive.rules = rules;
909 rs->inactive.ticket = rs->active.ticket;
911 /* Clean up inactive rules (i.e. previously active rules), only when
1237 pf_rule_tree_free(rs->rules[rs_num].inactive.tree);
1238 rs->rules[rs_num].inactive.tree = tree;
1240 while ((rule = TAILQ_FIRST(rs->rules[rs_num].inactive.ptr)) != NULL) {
1241 pf_unlink_rule(rs->rules[rs_num].inactive.ptr, rule);
1242 rs->rules[rs_num].inactive.rcount--;
1244 *ticket = ++rs->rules[rs_num].inactive.ticket;
1245 rs->rules[rs_num].inactive.open = 1;
1260 if (rs == NULL || !rs->rules[rs_num].inactive.open ||
1261 rs->rules[rs_num].inactive.ticket != ticket)
1263 while ((rule = TAILQ_FIRST(rs->rules[rs_num].inactive.ptr)) != NULL) {
1264 pf_unlink_rule(rs->rules[rs_num].inactive.ptr, rule);
1265 rs->rules[rs_num].inactive.rcount--;
1267 rs->rules[rs_num].inactive.open = 0;
1390 if (rs == NULL || !rs->rules[rs_num].inactive.open ||
1391 ticket != rs->rules[rs_num].inactive.ticket)
1408 rs->rules[rs_num].inactive.ptr;
1410 rs->rules[rs_num].inactive.ptr_array;
1412 rs->rules[rs_num].inactive.tree;
1414 rs->rules[rs_num].inactive.rcount;
1439 rs->rules[rs_num].inactive.ptr = old_rules;
1440 rs->rules[rs_num].inactive.ptr_array = old_array;
1441 rs->rules[rs_num].inactive.tree = NULL; /* important for pf_ioctl_addrule */
1442 rs->rules[rs_num].inactive.rcount = old_rcount;
1445 rs->rules[rs_num].inactive.ticket;
1453 if (rs->rules[rs_num].inactive.ptr_array)
1454 free(rs->rules[rs_num].inactive.ptr_array, M_TEMP);
1455 rs->rules[rs_num].inactive.ptr_array = NULL;
1456 rs->rules[rs_num].inactive.rcount = 0;
1457 rs->rules[rs_num].inactive.open = 0;
1478 if (rs->rules[rs_cnt].inactive.ptr_array)
1479 free(rs->rules[rs_cnt].inactive.ptr_array, M_TEMP);
1480 rs->rules[rs_cnt].inactive.ptr_array = NULL;
1482 if (rs->rules[rs_cnt].inactive.rcount) {
1483 rs->rules[rs_cnt].inactive.ptr_array =
1484 mallocarray(rs->rules[rs_cnt].inactive.rcount,
1488 if (!rs->rules[rs_cnt].inactive.ptr_array)
1492 TAILQ_FOREACH(rule, rs->rules[rs_cnt].inactive.ptr,
1495 (rs->rules[rs_cnt].inactive.ptr_array)[rule->nr] = rule;
2134 if (ticket != ruleset->rules[rs_num].inactive.ticket) {
2137 ruleset->rules[rs_num].inactive.ticket));
2153 if (ruleset->rules[rs_num].inactive.tree == NULL) {
2157 tail = TAILQ_LAST(ruleset->rules[rs_num].inactive.ptr,
2258 TAILQ_INSERT_TAIL(ruleset->rules[rs_num].inactive.ptr,
2260 ruleset->rules[rs_num].inactive.rcount++;
2264 if (RB_INSERT(pf_krule_global, ruleset->rules[rs_num].inactive.tree, rule) != NULL) {
2266 TAILQ_REMOVE(ruleset->rules[rs_num].inactive.ptr, rule, entries);
2267 ruleset->rules[rs_num].inactive.rcount--;
3156 ruleset->inactive.ticket) {
3160 ruleset->inactive.ticket));
3231 tail = TAILQ_LAST(ruleset->inactive.rules, pf_keth_ruleq);
3237 TAILQ_INSERT_TAIL(ruleset->inactive.rules, rule, entries);
5358 ioe->ticket != ers->inactive.ticket) {
5402 !rs->rules[ioe->rs_num].inactive.open ||
5403 rs->rules[ioe->rs_num].inactive.ticket !=