Lines Matching defs:rs
921 struct pf_kruleset *rs;
928 rs = pf_find_or_create_kruleset(anchor);
929 if (rs == NULL)
931 while ((rule = TAILQ_FIRST(rs->rules[rs_num].inactive.ptr)) != NULL) {
932 pf_unlink_rule(rs->rules[rs_num].inactive.ptr, rule);
933 rs->rules[rs_num].inactive.rcount--;
935 *ticket = ++rs->rules[rs_num].inactive.ticket;
936 rs->rules[rs_num].inactive.open = 1;
943 struct pf_kruleset *rs;
950 rs = pf_find_kruleset(anchor);
951 if (rs == NULL || !rs->rules[rs_num].inactive.open ||
952 rs->rules[rs_num].inactive.ticket != ticket)
954 while ((rule = TAILQ_FIRST(rs->rules[rs_num].inactive.ptr)) != NULL) {
955 pf_unlink_rule(rs->rules[rs_num].inactive.ptr, rule);
956 rs->rules[rs_num].inactive.rcount--;
958 rs->rules[rs_num].inactive.open = 0;
1062 struct pf_kruleset *rs;
1072 rs = pf_find_kruleset(anchor);
1073 if (rs == NULL || !rs->rules[rs_num].inactive.open ||
1074 ticket != rs->rules[rs_num].inactive.ticket)
1078 if (rs == &pf_main_ruleset) {
1079 error = pf_setup_pfsync_matching(rs);
1085 old_rules = rs->rules[rs_num].active.ptr;
1086 old_rcount = rs->rules[rs_num].active.rcount;
1087 old_array = rs->rules[rs_num].active.ptr_array;
1089 rs->rules[rs_num].active.ptr =
1090 rs->rules[rs_num].inactive.ptr;
1091 rs->rules[rs_num].active.ptr_array =
1092 rs->rules[rs_num].inactive.ptr_array;
1093 rs->rules[rs_num].active.rcount =
1094 rs->rules[rs_num].inactive.rcount;
1098 TAILQ_FOREACH(rule, rs->rules[rs_num].active.ptr,
1118 rs->rules[rs_num].inactive.ptr = old_rules;
1119 rs->rules[rs_num].inactive.ptr_array = old_array;
1120 rs->rules[rs_num].inactive.rcount = old_rcount;
1122 rs->rules[rs_num].active.ticket =
1123 rs->rules[rs_num].inactive.ticket;
1124 pf_calc_skip_steps(rs->rules[rs_num].active.ptr);
1129 if (rs->rules[rs_num].inactive.ptr_array)
1130 free(rs->rules[rs_num].inactive.ptr_array, M_TEMP);
1131 rs->rules[rs_num].inactive.ptr_array = NULL;
1132 rs->rules[rs_num].inactive.rcount = 0;
1133 rs->rules[rs_num].inactive.open = 0;
1134 pf_remove_if_empty_kruleset(rs);
1140 pf_setup_pfsync_matching(struct pf_kruleset *rs)
1153 if (rs->rules[rs_cnt].inactive.ptr_array)
1154 free(rs->rules[rs_cnt].inactive.ptr_array, M_TEMP);
1155 rs->rules[rs_cnt].inactive.ptr_array = NULL;
1157 if (rs->rules[rs_cnt].inactive.rcount) {
1158 rs->rules[rs_cnt].inactive.ptr_array =
1160 rs->rules[rs_cnt].inactive.rcount,
1163 if (!rs->rules[rs_cnt].inactive.ptr_array)
1167 TAILQ_FOREACH(rule, rs->rules[rs_cnt].inactive.ptr,
1170 (rs->rules[rs_cnt].inactive.ptr_array)[rule->nr] = rule;
4271 struct pf_kruleset *rs;
4317 rs = pf_find_kruleset(ioe->anchor);
4318 if (rs == NULL || !rs->topen || ioe->ticket !=
4319 rs->tticket) {
4334 rs = pf_find_kruleset(ioe->anchor);
4335 if (rs == NULL ||
4336 !rs->rules[ioe->rs_num].inactive.open ||
4337 rs->rules[ioe->rs_num].inactive.ticket !=