118 	struct solver_node *node;  in set_dpm_level()  local
135 	list_for_each_entry(node, &rgp->node_list, list) {  in set_dpm_level()
136 		if (node->dpm_level > level)  in set_dpm_level()
137 			level = node->dpm_level;  in set_dpm_level()
147 	struct solver_node *node;  in rg_search_node()  local
149 	list_for_each_entry(node, &rgp->node_list, list) {  in rg_search_node()
150 		if (node->rid == rid)  in rg_search_node()
151 			return node;  in rg_search_node()
172 			       struct solver_node *node)  in remove_solver_node()  argument
174 	list_del(&node->list);  in remove_solver_node()
177 	if (node->pt_node)  in remove_solver_node()
178 		remove_partition_node(rgp, node->pt_node);  in remove_solver_node()
180 	kfree(node);  in remove_solver_node()
266 	struct solver_node *node;  in create_solver_node()  local
269 	node = kzalloc(struct_size(node, start_cols, cdop->cols_len), GFP_KERNEL);  in create_solver_node()
270 	if (!node)  in create_solver_node()
273 	node->rid = req->rid;  in create_solver_node()
274 	node->cols_len = cdop->cols_len;  in create_solver_node()
275 	memcpy(node->start_cols, cdop->start_cols, cdop->cols_len * sizeof(u32));  in create_solver_node()
277 	ret = allocate_partition(xrs, node, req);  in create_solver_node()
281 	list_add_tail(&node->list, &xrs->rgp.node_list);  in create_solver_node()
283 	return node;  in create_solver_node()
286 	kfree(node);  in create_solver_node()
350 	struct solver_node *node;  in xrs_release_resource()  local
352 	node = rg_search_node(&xrs->rgp, rid);  in xrs_release_resource()
353 	if (!node) {  in xrs_release_resource()
358 	xrs->cfg.actions->unload(node->cb_arg);  in xrs_release_resource()
359 	remove_solver_node(&xrs->rgp, node);  in xrs_release_resource()