266 	struct drm_mm_node nodes[2];  in igt_debug()  local
275 	memset(nodes, 0, sizeof(nodes));  in igt_debug()
276 	nodes[0].start = 512;  in igt_debug()
277 	nodes[0].size = 1024;  in igt_debug()
278 	ret = drm_mm_reserve_node(&mm, &nodes[0]);  in igt_debug()
281 		       nodes[0].start, nodes[0].size);  in igt_debug()
285 	nodes[1].size = 1024;  in igt_debug()
286 	nodes[1].start = 4096 - 512 - nodes[1].size;  in igt_debug()
287 	ret = drm_mm_reserve_node(&mm, &nodes[1]);  in igt_debug()
290 		       nodes[1].start, nodes[1].size);  in igt_debug()
374 	struct drm_mm_node tmp, *nodes, *node, *next;  in __igt_reserve()  local
392 	nodes = vzalloc(array_size(count, sizeof(*nodes)));  in __igt_reserve()
393 	if (!nodes)  in __igt_reserve()
403 		nodes[n].start = order[n] * size;  in __igt_reserve()
404 		nodes[n].size = size;  in __igt_reserve()
406 		err = drm_mm_reserve_node(&mm, &nodes[n]);  in __igt_reserve()
409 			       n, nodes[n].start);  in __igt_reserve()
414 		if (!drm_mm_node_allocated(&nodes[n])) {  in __igt_reserve()
416 			       n, nodes[n].start);  in __igt_reserve()
420 		if (!expect_reserve_fail(&mm, &nodes[n]))  in __igt_reserve()
436 		drm_mm_remove_node(&nodes[order[n]]);  in __igt_reserve()
437 		err = drm_mm_reserve_node(&mm, &nodes[order[n]]);  in __igt_reserve()
440 			       n, nodes[n].start);  in __igt_reserve()
465 			node = &nodes[order[(o + m) % count]];  in __igt_reserve()
470 			node = &nodes[order[(o + m) % count]];  in __igt_reserve()
491 	vfree(nodes);  in __igt_reserve()
572 	struct drm_mm_node *nodes, *node, *next;  in __igt_insert()  local
582 	nodes = vmalloc(array_size(count, sizeof(*nodes)));  in __igt_insert()
583 	if (!nodes)  in __igt_insert()
597 			node = replace ? &tmp : &nodes[n];  in __igt_insert()
606 				drm_mm_replace_node(&tmp, &nodes[n]);  in __igt_insert()
613 				if (!assert_node(&nodes[n], &mm, size, 0, n)) {  in __igt_insert()
619 				if (tmp.start != nodes[n].start) {  in __igt_insert()
622 					       nodes[n].start, nodes[n].size);  in __igt_insert()
638 			u64 addr = nodes[n].start;  in __igt_insert()
640 			drm_mm_remove_node(&nodes[n]);  in __igt_insert()
641 			if (!expect_insert(&mm, &nodes[n], size, 0, n, mode)) {  in __igt_insert()
647 			if (nodes[n].start != addr) {  in __igt_insert()
649 				       mode->name, n, addr, nodes[n].start);  in __igt_insert()
660 				node = &nodes[order[(o + m) % count]];  in __igt_insert()
665 				node = &nodes[order[(o + m) % count]];  in __igt_insert()
696 	vfree(nodes);  in __igt_insert()
879 	struct drm_mm_node *nodes, *node, *next;  in __igt_insert_range()  local
892 	nodes = vzalloc(array_size(count, sizeof(*nodes)));  in __igt_insert_range()
893 	if (!nodes)  in __igt_insert_range()
904 			if (!expect_insert_in_range(&mm, &nodes[n],  in __igt_insert_range()
923 			u64 addr = nodes[n].start;  in __igt_insert_range()
925 			drm_mm_remove_node(&nodes[n]);  in __igt_insert_range()
926 			if (!expect_insert_in_range(&mm, &nodes[n],  in __igt_insert_range()
933 			if (nodes[n].start != addr) {  in __igt_insert_range()
935 				       mode->name, n, addr, nodes[n].start);  in __igt_insert_range()
958 	vfree(nodes);  in __igt_insert_range()
1040 	struct drm_mm_node *nodes, *node, *next;  in igt_align()  local
1049 	nodes = vzalloc(array_size(max_count, sizeof(*nodes)));  in igt_align()
1050 	if (!nodes)  in igt_align()
1061 			if (!expect_insert(&mm, &nodes[i],  in igt_align()
1084 	vfree(nodes);  in igt_align()
1187 			struct evict_node *nodes,  in evict_nodes()  argument
1197 		e = &nodes[order ? order[i] : i];  in evict_nodes()
1235 			  struct evict_node *nodes)  in evict_nothing()  argument
1245 		e = &nodes[n];  in evict_nothing()
1253 		e = &nodes[n];  in evict_nothing()
1269 		e = &nodes[n];  in evict_nothing()
1277 	return assert_continuous(mm, nodes[0].node.size);  in evict_nothing()
1282 			     struct evict_node *nodes)  in evict_everything()  argument
1292 		e = &nodes[n];  in evict_everything()
1326 	return assert_continuous(mm, nodes[0].node.size);  in evict_everything()
1331 			   struct evict_node *nodes,  in evict_something()  argument
1349 			 nodes, order, count, false,  in evict_something()
1392 	if (!assert_continuous(mm, nodes[0].node.size)) {  in evict_something()
1406 	struct evict_node *nodes;  in igt_evict()  local
1419 	nodes = vzalloc(array_size(size, sizeof(*nodes)));  in igt_evict()
1420 	if (!nodes)  in igt_evict()
1430 		err = drm_mm_insert_node(&mm, &nodes[n].node, 1);  in igt_evict()
1439 	if (!evict_nothing(&mm, size, nodes)) {  in igt_evict()
1443 	if (!evict_everything(&mm, size, nodes)) {  in igt_evict()
1452 					      nodes, order, size,  in igt_evict()
1466 					      nodes, order, size,  in igt_evict()
1484 					      nodes, order, size,  in igt_evict()
1505 	vfree(nodes);  in igt_evict()
1519 	struct evict_node *nodes;  in igt_evict_range()  local
1529 	nodes = vzalloc(array_size(size, sizeof(*nodes)));  in igt_evict_range()
1530 	if (!nodes)  in igt_evict_range()
1540 		err = drm_mm_insert_node(&mm, &nodes[n].node, 1);  in igt_evict_range()
1552 					      nodes, order, size,  in igt_evict_range()
1565 					      nodes, order, size,  in igt_evict_range()
1582 					      nodes, order, size,  in igt_evict_range()
1602 	vfree(nodes);  in igt_evict_range()
1620 	struct drm_mm_node *nodes, *node, *next;  in igt_topdown()  local
1630 	nodes = vzalloc(array_size(count, sizeof(*nodes)));  in igt_topdown()
1631 	if (!nodes)  in igt_topdown()
1647 			if (!expect_insert(&mm, &nodes[n],  in igt_topdown()
1654 			if (drm_mm_hole_follows(&nodes[n])) {  in igt_topdown()
1656 				       n, nodes[n].start, size);  in igt_topdown()
1670 				node = &nodes[order[(o + m) % count]];  in igt_topdown()
1678 				node = &nodes[order[(o + m) % count]];  in igt_topdown()
1722 	vfree(nodes);  in igt_topdown()
1735 	struct drm_mm_node *nodes, *node, *next;  in igt_bottomup()  local
1744 	nodes = vzalloc(array_size(count, sizeof(*nodes)));  in igt_bottomup()
1745 	if (!nodes)  in igt_bottomup()
1761 			if (!expect_insert(&mm, &nodes[n],  in igt_bottomup()
1778 				node = &nodes[order[(o + m) % count]];  in igt_bottomup()
1786 				node = &nodes[order[(o + m) % count]];  in igt_bottomup()
1823 	vfree(nodes);  in igt_bottomup()
2086 		       struct evict_node *nodes,  in evict_color()  argument
2105 			 nodes, order, count, true,  in evict_color()
2160 	struct evict_node *nodes;  in igt_color_evict()  local
2172 	nodes = vzalloc(array_size(total_size, sizeof(*nodes)));  in igt_color_evict()
2173 	if (!nodes)  in igt_color_evict()
2184 		if (!expect_insert(&mm, &nodes[n].node,  in igt_color_evict()
2196 					  nodes, order, total_size,  in igt_color_evict()
2209 					  nodes, order, total_size,  in igt_color_evict()
2226 					  nodes, order, total_size,  in igt_color_evict()
2248 	vfree(nodes);  in igt_color_evict()
2263 	struct evict_node *nodes;  in igt_color_evict_range()  local
2273 	nodes = vzalloc(array_size(total_size, sizeof(*nodes)));  in igt_color_evict_range()
2274 	if (!nodes)  in igt_color_evict_range()
2285 		if (!expect_insert(&mm, &nodes[n].node,  in igt_color_evict_range()
2297 					  nodes, order, total_size,  in igt_color_evict_range()
2310 					  nodes, order, total_size,  in igt_color_evict_range()
2327 					  nodes, order, total_size,  in igt_color_evict_range()
2349 	vfree(nodes);  in igt_color_evict_range()