bsd/net/pf.c

429 		s->rule.ptr->states++;				\
430 		VERIFY(s->rule.ptr->states != 0);		\
432 			s->anchor.ptr->states++;		\
433 			VERIFY(s->anchor.ptr->states != 0);	\
436 			s->nat_rule.ptr->states++;		\
437 			VERIFY(s->nat_rule.ptr->states != 0);	\
444 			VERIFY(s->nat_rule.ptr->states > 0);	\
445 			s->nat_rule.ptr->states--;		\
448 			VERIFY(s->anchor.ptr->states > 0);	\
449 			s->anchor.ptr->states--;		\
451 		VERIFY(s->rule.ptr->states > 0);		\
452 		s->rule.ptr->states--;				\
1130 	/* list is sorted, if-bound states before floating ones */
1132 		TAILQ_FOREACH(s, &sk->states, next)
1161 		ret = TAILQ_FIRST(&sk->states);
1165 		TAILQ_FOREACH(s, &sk->states, next)
1259 		/* kill existing states if that's required. */
1268 				 * Kill states from this source.  (Only those
1291 				printf(", %u states killed", killed);
1359 		    (*sn)->states >= rule->max_src_states) {
1418 		TAILQ_FOREACH(sp, &cur->states, next)
1456 	pf_status.states++;
1457 	VERIFY(pf_status.states != 0);
1477 		pf_purge_expired_states(pf_status.states);
1492 			if (pf_status.states == 0 &&
1503 	pf_purge_expired_states(1 + (pf_status.states
1543 	u_int32_t	states;
1560 		states = state->rule.ptr->states;
1564 		states = pf_status.states;
1566 	if (end && states > start && start < end) {
1567 		if (states < end)
1568 			return (state->expire + t * (end - states) /
1586 		if (cur->states <= 0 && cur->expire <= pf_time_second()) {
1589 				if (cur->rule.ptr->states <= 0 &&
1613 		VERIFY(s->src_node->states > 0);
1614 		if (--s->src_node->states <= 0) {
1622 		VERIFY(s->nat_src_node->states > 0);
1623 		if (--s->nat_src_node->states <= 0) {
1671 	VERIFY(cur->rule.ptr->states > 0);
1672 	if (--cur->rule.ptr->states <= 0 &&
1676 		VERIFY(cur->nat_rule.ptr->states > 0);
1677 		if (--cur->nat_rule.ptr->states <= 0 &&
1682 		VERIFY(cur->anchor.ptr->states > 0);
1683 		if (--cur->anchor.ptr->states <= 0)
1693 	VERIFY(pf_status.states > 0);
1694 	pf_status.states--;
3915 	/* list is sorted, if-bound states before floating */
3917 		TAILQ_INSERT_TAIL(&sk->states, s, next);
3919 		TAILQ_INSERT_HEAD(&sk->states, s, next);
3931 	TAILQ_REMOVE(&sk->states, s, next);
3953 	TAILQ_INIT(&sk->states);
3967 		/* don't touch tree entries, states and refcnt on sk */
4763 		if (r->max_states && (r->states >= r->max_states)) {
4788 			if (sn != NULL && sn->states == 0 && sn->expire == 0) {
4794 			if (nsn != sn && nsn != NULL && nsn->states == 0 &&
4887 			s->src_node->states++;
4888 			VERIFY(s->src_node->states != 0);
4893 			s->nat_src_node->states++;
4894 			VERIFY(s->nat_src_node->states != 0);
5716 			++gs->src_node->states;
5717 			VERIFY(gs->src_node->states != 0);
5720 			++gs->nat_src_node->states;
5721 			VERIFY(gs->nat_src_node->states != 0);
5731 			 * are chosen before states are inserted.  This is
6120 		/* update states */
6401 	/* update states */
7158 	/* update states */
7329 	/* update states */
7415 	/* update states */