bsd/net/pf_ioctl.c

577 	struct pf_state		*state;
599 	RB_FOREACH(state, pf_state_tree_id, &tree_id) {
600 		state->timeout = PFTM_PURGE;
602 		state->sync_flags = PFSTATE_NOSYNC;
612 	RB_FOREACH(state, pf_state_tree_id, &tree_id) {
613 		state->src_node = NULL;
614 		state->nat_src_node = NULL;
1405 	/* copy from state key */
1419 	/* copy from state */
1458 	/* copy to state key */
1472 	/* copy to state */
2245 		struct pf_state		*state;
2247 		RB_FOREACH(state, pf_state_tree_id, &tree_id) {
2248 			state->src_node = NULL;
2249 			state->nat_src_node = NULL;
2750 	struct pf_state		*state;
2755 	state = TAILQ_FIRST(&state_list);
2756 	while (state) {
2757 		if (state->rule.ptr == rule)
2758 			state->timeout = PFTM_PURGE;
2759 		state = TAILQ_NEXT(state, entry_list);
2768 			RB_FOREACH(state, pf_state_tree_id,
2770 				if (state->src_node == sn)
2771 					state->src_node = NULL;
2772 				if (state->nat_src_node == sn)
2773 					state->nat_src_node = NULL;
3617 				/* send immediate delete of state */
3645 		struct pfsync_state	*sp = &ps->state;
3691 		bcopy(ps->state.id, &id_key.id, sizeof (id_key.id));
3692 		id_key.creatorid = ps->state.creatorid;
3700 		pf_state_export(&ps->state, s->state_key, s);
3721 		struct pf_state		*state;
3744 		state = TAILQ_FIRST(&state_list);
3745 		while (state) {
3746 			if (state->timeout != PFTM_UNLINKED) {
3751 				    state->state_key, state);
3760 			state = TAILQ_NEXT(state, entry_list);
3790 		struct pf_state		*state;
3810 			 * state tree.
3819 				state = pf_find_state_all(&key, PF_IN, &m);
3827 				state = pf_find_state_all(&key, PF_OUT, &m);
3830 				error = E2BIG;	/* more than one state */
3831 			else if (state != NULL) {
3832 				sk = state->state_key;
4633 				/* Handle state to src_node linkage */