455 	        s->rule.ptr->states++;                          \
456 	        VERIFY(s->rule.ptr->states != 0);               \
458 	                s->anchor.ptr->states++;                \
459 	                VERIFY(s->anchor.ptr->states != 0);     \
462 	                s->nat_rule.ptr->states++;              \
463 	                VERIFY(s->nat_rule.ptr->states != 0);   \
470 	                VERIFY(s->nat_rule.ptr->states > 0);    \
471 	                s->nat_rule.ptr->states--;              \
474 	                VERIFY(s->anchor.ptr->states > 0);      \
475 	                s->anchor.ptr->states--;                \
477 	        VERIFY(s->rule.ptr->states > 0);                \
478 	        s->rule.ptr->states--;                          \
1129 		TAILQ_FOREACH(s, &sk->states, next)  in pf_find_state()
1172 		ret = TAILQ_FIRST(&sk->states);  in pf_find_state_all()
1177 		TAILQ_FOREACH(s, &sk->states, next)  in pf_find_state_all()
1377 		    (*sn)->states >= rule->max_src_states) {  in pf_insert_src_node()
1440 		TAILQ_FOREACH(sp, &cur->states, next)  in pf_insert_state()
1479 	pf_status.states++;  in pf_insert_state()
1480 	VERIFY(pf_status.states != 0);  in pf_insert_state()
1507 		pf_purge_expired_states(pf_status.states);  in pf_purge_thread_cont()
1522 			if (pf_status.states == 0 &&  in pf_purge_thread_cont()
1533 	pf_purge_expired_states(1 + (pf_status.states  in pf_purge_thread_cont()
1573 	u_int32_t       states;  in pf_state_expires()  local
1591 		states = state->rule.ptr->states;  in pf_state_expires()
1595 		states = pf_status.states;  in pf_state_expires()
1597 	if (end && states > start && start < end) {  in pf_state_expires()
1598 		if (states < end) {  in pf_state_expires()
1599 			return state->expire + t * (end - states) /  in pf_state_expires()
1618 		if (cur->states <= 0 && cur->expire <= pf_time_second()) {  in pf_purge_expired_src_nodes()
1621 				if (cur->rule.ptr->states <= 0 &&  in pf_purge_expired_src_nodes()
1646 		VERIFY(s->src_node->states > 0);  in pf_src_tree_remove_state()
1647 		if (--s->src_node->states <= 0) {  in pf_src_tree_remove_state()
1656 		VERIFY(s->nat_src_node->states > 0);  in pf_src_tree_remove_state()
1657 		if (--s->nat_src_node->states <= 0) {  in pf_src_tree_remove_state()
1708 	VERIFY(cur->rule.ptr->states > 0);  in pf_free_state()
1709 	if (--cur->rule.ptr->states <= 0 &&  in pf_free_state()
1714 		VERIFY(cur->nat_rule.ptr->states > 0);  in pf_free_state()
1715 		if (--cur->nat_rule.ptr->states <= 0 &&  in pf_free_state()
1721 		VERIFY(cur->anchor.ptr->states > 0);  in pf_free_state()
1722 		if (--cur->anchor.ptr->states <= 0) {  in pf_free_state()
1737 	VERIFY(pf_status.states > 0);  in pf_free_state()
1738 	pf_status.states--;  in pf_free_state()
4313 		TAILQ_INSERT_TAIL(&sk->states, s, next);  in pf_attach_state()
4315 		TAILQ_INSERT_HEAD(&sk->states, s, next);  in pf_attach_state()
4329 	TAILQ_REMOVE(&sk->states, s, next);  in pf_detach_state()
4355 	TAILQ_INIT(&sk->states);  in pf_alloc_state_key()
5695 		if (r->max_states && (r->states >= r->max_states)) {  in pf_test_rule()
5720 			if (sn != NULL && sn->states == 0 && sn->expire == 0) {  in pf_test_rule()
5726 			if (nsn != sn && nsn != NULL && nsn->states == 0 &&  in pf_test_rule()
5825 			s->src_node->states++;  in pf_test_rule()
5826 			VERIFY(s->src_node->states != 0);  in pf_test_rule()
5831 			s->nat_src_node->states++;  in pf_test_rule()
5832 			VERIFY(s->nat_src_node->states != 0);  in pf_test_rule()
6774 			++gs->src_node->states;  in pf_pptp_handler()
6775 			VERIFY(gs->src_node->states != 0);  in pf_pptp_handler()
6778 			++gs->nat_src_node->states;  in pf_pptp_handler()
6779 			VERIFY(gs->nat_src_node->states != 0);  in pf_pptp_handler()