Lines Matching refs:rs

1202 	struct pf_ruleset	*rs;
1207 rs = pf_find_or_create_ruleset(anchor);
1208 if (rs == NULL)
1210 while ((rule = TAILQ_FIRST(rs->rules[rs_num].inactive.ptr)) != NULL) {
1211 pf_rm_rule(rs->rules[rs_num].inactive.ptr, rule);
1212 rs->rules[rs_num].inactive.rcount--;
1214 *ticket = ++rs->rules[rs_num].inactive.ticket;
1215 rs->rules[rs_num].inactive.open = 1;
1222 struct pf_ruleset *rs;
1227 rs = pf_find_ruleset(anchor);
1228 if (rs == NULL || !rs->rules[rs_num].inactive.open ||
1229 rs->rules[rs_num].inactive.ticket != ticket)
1231 while ((rule = TAILQ_FIRST(rs->rules[rs_num].inactive.ptr)) != NULL) {
1232 pf_rm_rule(rs->rules[rs_num].inactive.ptr, rule);
1233 rs->rules[rs_num].inactive.rcount--;
1235 rs->rules[rs_num].inactive.open = 0;
1325 struct pf_ruleset *rs;
1333 rs = pf_find_ruleset(anchor);
1334 if (rs == NULL || !rs->rules[rs_num].inactive.open ||
1335 ticket != rs->rules[rs_num].inactive.ticket)
1339 if (rs == &pf_main_ruleset) {
1340 error = pf_setup_pfsync_matching(rs);
1347 old_rules = rs->rules[rs_num].active.ptr;
1348 old_rcount = rs->rules[rs_num].active.rcount;
1349 old_array = rs->rules[rs_num].active.ptr_array;
1351 rs->rules[rs_num].active.ptr =
1352 rs->rules[rs_num].inactive.ptr;
1353 rs->rules[rs_num].active.ptr_array =
1354 rs->rules[rs_num].inactive.ptr_array;
1355 rs->rules[rs_num].active.rcount =
1356 rs->rules[rs_num].inactive.rcount;
1357 rs->rules[rs_num].inactive.ptr = old_rules;
1358 rs->rules[rs_num].inactive.ptr_array = old_array;
1359 rs->rules[rs_num].inactive.rcount = old_rcount;
1361 rs->rules[rs_num].active.ticket =
1362 rs->rules[rs_num].inactive.ticket;
1363 pf_calc_skip_steps(rs->rules[rs_num].active.ptr);
1369 if (rs->rules[rs_num].inactive.ptr_array)
1370 free(rs->rules[rs_num].inactive.ptr_array, M_TEMP);
1371 rs->rules[rs_num].inactive.ptr_array = NULL;
1372 rs->rules[rs_num].inactive.rcount = 0;
1373 rs->rules[rs_num].inactive.open = 0;
1374 pf_remove_if_empty_ruleset(rs);
1380 pf_setup_pfsync_matching(struct pf_ruleset *rs)
1393 if (rs->rules[rs_cnt].inactive.ptr_array)
1394 free(rs->rules[rs_cnt].inactive.ptr_array, M_TEMP);
1395 rs->rules[rs_cnt].inactive.ptr_array = NULL;
1397 if (rs->rules[rs_cnt].inactive.rcount) {
1398 rs->rules[rs_cnt].inactive.ptr_array =
1400 rs->rules[rs_cnt].inactive.rcount,
1403 if (!rs->rules[rs_cnt].inactive.ptr_array)
1407 TAILQ_FOREACH(rule, rs->rules[rs_cnt].inactive.ptr,
1410 (rs->rules[rs_cnt].inactive.ptr_array)[rule->nr] = rule;
3559 struct pf_ruleset *rs;
3611 rs = pf_find_ruleset(ioe->anchor);
3612 if (rs == NULL || !rs->topen || ioe->ticket !=
3613 rs->tticket) {
3628 rs = pf_find_ruleset(ioe->anchor);
3629 if (rs == NULL ||
3630 !rs->rules[ioe->rs_num].inactive.open ||
3631 rs->rules[ioe->rs_num].inactive.ticket !=