bsd/net/pf_ioctl.c

1165 	struct pf_ruleset	*rs;
1170 	rs = pf_find_or_create_ruleset(anchor);
1171 	if (rs == NULL)
1173 	while ((rule = TAILQ_FIRST(rs->rules[rs_num].inactive.ptr)) != NULL) {
1174 		pf_rm_rule(rs->rules[rs_num].inactive.ptr, rule);
1175 		rs->rules[rs_num].inactive.rcount--;
1177 	*ticket = ++rs->rules[rs_num].inactive.ticket;
1178 	rs->rules[rs_num].inactive.open = 1;
1185 	struct pf_ruleset	*rs;
1190 	rs = pf_find_ruleset(anchor);
1191 	if (rs == NULL || !rs->rules[rs_num].inactive.open ||
1192 	    rs->rules[rs_num].inactive.ticket != ticket)
1194 	while ((rule = TAILQ_FIRST(rs->rules[rs_num].inactive.ptr)) != NULL) {
1195 		pf_rm_rule(rs->rules[rs_num].inactive.ptr, rule);
1196 		rs->rules[rs_num].inactive.rcount--;
1198 	rs->rules[rs_num].inactive.open = 0;
1297 	struct pf_ruleset	*rs;
1307 	rs = pf_find_ruleset(anchor);
1308 	if (rs == NULL || !rs->rules[rs_num].inactive.open ||
1309 	    ticket != rs->rules[rs_num].inactive.ticket)
1313 	if (rs == &pf_main_ruleset) {
1314 		error = pf_setup_pfsync_matching(rs);
1320 	old_rules = rs->rules[rs_num].active.ptr;
1321 	old_rcount = rs->rules[rs_num].active.rcount;
1322 	old_array = rs->rules[rs_num].active.ptr_array;
1325 		r = TAILQ_FIRST(rs->rules[rs_num].active.ptr);
1334 	rs->rules[rs_num].active.ptr =
1335 	    rs->rules[rs_num].inactive.ptr;
1336 	rs->rules[rs_num].active.ptr_array =
1337 	    rs->rules[rs_num].inactive.ptr_array;
1338 	rs->rules[rs_num].active.rcount =
1339 	    rs->rules[rs_num].inactive.rcount;
1340 	rs->rules[rs_num].inactive.ptr = old_rules;
1341 	rs->rules[rs_num].inactive.ptr_array = old_array;
1342 	rs->rules[rs_num].inactive.rcount = old_rcount;
1344 	rs->rules[rs_num].active.ticket =
1345 	    rs->rules[rs_num].inactive.ticket;
1346 	pf_calc_skip_steps(rs->rules[rs_num].active.ptr);
1352 	if (rs->rules[rs_num].inactive.ptr_array)
1353 		_FREE(rs->rules[rs_num].inactive.ptr_array, M_TEMP);
1354 	rs->rules[rs_num].inactive.ptr_array = NULL;
1355 	rs->rules[rs_num].inactive.rcount = 0;
1356 	rs->rules[rs_num].inactive.open = 0;
1357 	pf_remove_if_empty_ruleset(rs);
1526 pf_setup_pfsync_matching(struct pf_ruleset *rs)
1539 		if (rs->rules[rs_cnt].inactive.ptr_array)
1540 			_FREE(rs->rules[rs_cnt].inactive.ptr_array, M_TEMP);
1541 		rs->rules[rs_cnt].inactive.ptr_array = NULL;
1543 		if (rs->rules[rs_cnt].inactive.rcount) {
1544 			rs->rules[rs_cnt].inactive.ptr_array =
1546 			    rs->rules[rs_cnt].inactive.rcount,
1549 			if (!rs->rules[rs_cnt].inactive.ptr_array)
1553 		TAILQ_FOREACH(rule, rs->rules[rs_cnt].inactive.ptr,
1556 			(rs->rules[rs_cnt].inactive.ptr_array)[rule->nr] = rule;
2819 pf_ruleset_cleanup(struct pf_ruleset *ruleset, int rs)
2821 	pf_calc_skip_steps(ruleset->rules[rs].active.ptr);
2822 	ruleset->rules[rs].active.ticket =
2823 	    ++ruleset->rules[rs].inactive.ticket;
2928 	for (int rs = 0; rs < PF_RULESET_MAX; rs++) {
2929 		rule = TAILQ_FIRST(pf_main_ruleset.rules[rs].active.ptr);
2944 					if (rule->anchor->ruleset.rules[rs].active.rcount > 0) {
2946 							pf_ruleset_cleanup(ruleset, rs);
2952 						rule = TAILQ_FIRST(ruleset->rules[rs].active.ptr);
2958 						pf_delete_rule_from_ruleset(ruleset, rs, rule);
2970 					    rs, rule);
2977 					pf_ruleset_cleanup(ruleset, rs);
2982 					    rs, &rule);
2990     int rs, struct pf_rule **rule_ptr)
3000 	rule = TAILQ_FIRST(ruleset->rules[rs].active.ptr);
3005 	if (rule->anchor->ruleset.rules[rs].active.rcount > 0)
4497 		struct pf_ruleset	*rs;
4538 				rs = pf_find_ruleset(ioe->anchor);
4539 				if (rs == NULL || !rs->topen || ioe->ticket !=
4540 				    rs->tticket) {
4555 				rs = pf_find_ruleset(ioe->anchor);
4556 				if (rs == NULL ||
4557 				    !rs->rules[ioe->rs_num].inactive.open ||
4558 				    rs->rules[ioe->rs_num].inactive.ticket !=