24 	} policies[] __counted_by(n_alloc);  member
38 		if (state->policies[i].policy == policy &&  in add_policy()
39 		    state->policies[i].maxtype == maxtype)  in add_policy()
42 		if (!state->policies[i].policy) {  in add_policy()
43 			state->policies[i].policy = policy;  in add_policy()
44 			state->policies[i].maxtype = maxtype;  in add_policy()
50 	state = krealloc(state, struct_size(state, policies, n_alloc),  in add_policy()
57 	memset(&state->policies[old_n_alloc], 0,  in add_policy()
58 	       flex_array_size(state, policies, n_alloc - old_n_alloc));  in add_policy()
60 	state->policies[old_n_alloc].policy = policy;  in add_policy()
61 	state->policies[old_n_alloc].maxtype = maxtype;  in add_policy()
92 		if (state->policies[i].policy == policy &&  in netlink_policy_dump_get_policy_idx()
93 		    state->policies[i].maxtype == maxtype)  in netlink_policy_dump_get_policy_idx()
105 	state = kzalloc(struct_size(state, policies, INITIAL_POLICIES_ALLOC),  in alloc_state()
122  * Call this to allocate a policy dump state, and to add policies to it. This
142 	 * walk the policies and nested ones first, and build  in netlink_policy_dump_add_policy()
151 	     policy_idx < state->n_alloc && state->policies[policy_idx].policy;  in netlink_policy_dump_add_policy()
156 		policy = state->policies[policy_idx].policy;  in netlink_policy_dump_add_policy()
159 		     type <= state->policies[policy_idx].maxtype;  in netlink_policy_dump_add_policy()
194 	       !state->policies[state->policy_idx].policy;  in netlink_policy_dump_finished()
441 	pt = &state->policies[state->policy_idx].policy[state->attr_idx];  in netlink_policy_dump_write()
461 	if (state->attr_idx > state->policies[state->policy_idx].maxtype) {  in netlink_policy_dump_write()