bsd/net/pf_ioctl.c

1162 	struct pf_ruleset	*rs;
1167 	rs = pf_find_or_create_ruleset(anchor);
1168 	if (rs == NULL)
1170 	while ((rule = TAILQ_FIRST(rs->rules[rs_num].inactive.ptr)) != NULL) {
1171 		pf_rm_rule(rs->rules[rs_num].inactive.ptr, rule);
1172 		rs->rules[rs_num].inactive.rcount--;
1174 	*ticket = ++rs->rules[rs_num].inactive.ticket;
1175 	rs->rules[rs_num].inactive.open = 1;
1182 	struct pf_ruleset	*rs;
1187 	rs = pf_find_ruleset(anchor);
1188 	if (rs == NULL || !rs->rules[rs_num].inactive.open ||
1189 	    rs->rules[rs_num].inactive.ticket != ticket)
1191 	while ((rule = TAILQ_FIRST(rs->rules[rs_num].inactive.ptr)) != NULL) {
1192 		pf_rm_rule(rs->rules[rs_num].inactive.ptr, rule);
1193 		rs->rules[rs_num].inactive.rcount--;
1195 	rs->rules[rs_num].inactive.open = 0;
1294 	struct pf_ruleset	*rs;
1304 	rs = pf_find_ruleset(anchor);
1305 	if (rs == NULL || !rs->rules[rs_num].inactive.open ||
1306 	    ticket != rs->rules[rs_num].inactive.ticket)
1310 	if (rs == &pf_main_ruleset) {
1311 		error = pf_setup_pfsync_matching(rs);
1317 	old_rules = rs->rules[rs_num].active.ptr;
1318 	old_rcount = rs->rules[rs_num].active.rcount;
1319 	old_array = rs->rules[rs_num].active.ptr_array;
1321 	rs->rules[rs_num].active.ptr =
1322 	    rs->rules[rs_num].inactive.ptr;
1323 	rs->rules[rs_num].active.ptr_array =
1324 	    rs->rules[rs_num].inactive.ptr_array;
1325 	rs->rules[rs_num].active.rcount =
1326 	    rs->rules[rs_num].inactive.rcount;
1327 	rs->rules[rs_num].inactive.ptr = old_rules;
1328 	rs->rules[rs_num].inactive.ptr_array = old_array;
1329 	rs->rules[rs_num].inactive.rcount = old_rcount;
1331 	rs->rules[rs_num].active.ticket =
1332 	    rs->rules[rs_num].inactive.ticket;
1333 	pf_calc_skip_steps(rs->rules[rs_num].active.ptr);
1339 	if (rs->rules[rs_num].inactive.ptr_array)
1340 		_FREE(rs->rules[rs_num].inactive.ptr_array, M_TEMP);
1341 	rs->rules[rs_num].inactive.ptr_array = NULL;
1342 	rs->rules[rs_num].inactive.rcount = 0;
1343 	rs->rules[rs_num].inactive.open = 0;
1344 	pf_remove_if_empty_ruleset(rs);
1513 pf_setup_pfsync_matching(struct pf_ruleset *rs)
1526 		if (rs->rules[rs_cnt].inactive.ptr_array)
1527 			_FREE(rs->rules[rs_cnt].inactive.ptr_array, M_TEMP);
1528 		rs->rules[rs_cnt].inactive.ptr_array = NULL;
1530 		if (rs->rules[rs_cnt].inactive.rcount) {
1531 			rs->rules[rs_cnt].inactive.ptr_array =
1533 			    rs->rules[rs_cnt].inactive.rcount,
1536 			if (!rs->rules[rs_cnt].inactive.ptr_array)
1540 		TAILQ_FOREACH(rule, rs->rules[rs_cnt].inactive.ptr,
1543 			(rs->rules[rs_cnt].inactive.ptr_array)[rule->nr] = rule;
2806 pf_ruleset_cleanup(struct pf_ruleset *ruleset, int rs)
2808 	pf_calc_skip_steps(ruleset->rules[rs].active.ptr);
2809 	ruleset->rules[rs].active.ticket =
2810 	    ++ruleset->rules[rs].inactive.ticket;
2891 	for (int rs = 0; rs < PF_RULESET_MAX; rs++) {
2892 		rule = TAILQ_FIRST(pf_main_ruleset.rules[rs].active.ptr);
2899 					if (rule->anchor->ruleset.rules[rs].active.rcount > 0) {
2901 							pf_ruleset_cleanup(ruleset, rs);
2907 						rule = TAILQ_FIRST(ruleset->rules[rs].active.ptr);
2913 						pf_delete_rule_from_ruleset(ruleset, rs, rule);
2925 					    rs, rule);
2932 					pf_ruleset_cleanup(ruleset, rs);
2937 					    rs, &rule);
2945     int rs, struct pf_rule **rule_ptr)
2955 	rule = TAILQ_FIRST(ruleset->rules[rs].active.ptr);
2960 	if (rule->anchor->ruleset.rules[rs].active.rcount > 0)
4395 		struct pf_ruleset	*rs;
4436 				rs = pf_find_ruleset(ioe->anchor);
4437 				if (rs == NULL || !rs->topen || ioe->ticket !=
4438 				    rs->tticket) {
4453 				rs = pf_find_ruleset(ioe->anchor);
4454 				if (rs == NULL ||
4455 				    !rs->rules[ioe->rs_num].inactive.open ||
4456 				    rs->rules[ioe->rs_num].inactive.ticket !=