125 				if (n->provider == n->links[i]->provider)  in icc_graph_show()
127 							    n->links[i]);  in icc_graph_show()
136 				if (n->provider != n->links[i]->provider)  in icc_graph_show()
138 							    n->links[i]);  in icc_graph_show()
205 				struct icc_node *tmp = node->links[i];  in path_find()
860 	kfree(node->links);  in icc_node_destroy()
899 	new = krealloc(node->links,  in icc_link_create()
900 		       (node->num_links + 1) * sizeof(*node->links),  in icc_link_create()
907 	node->links = new;  in icc_link_create()
908 	node->links[node->num_links++] = dst;  in icc_link_create()
939 		if (src->links[slot] == dst)  in icc_link_destroy()
947 	src->links[slot] = src->links[--src->num_links];  in icc_link_destroy()
949 	new = krealloc(src->links, src->num_links * sizeof(*src->links),  in icc_link_destroy()
952 		src->links = new;  in icc_link_destroy()