Lines Matching refs:nodes
268 struct drm_mm_node nodes[2]; in igt_debug() local
277 memset(nodes, 0, sizeof(nodes)); in igt_debug()
278 nodes[0].start = 512; in igt_debug()
279 nodes[0].size = 1024; in igt_debug()
280 ret = drm_mm_reserve_node(&mm, &nodes[0]); in igt_debug()
283 nodes[0].start, nodes[0].size); in igt_debug()
287 nodes[1].size = 1024; in igt_debug()
288 nodes[1].start = 4096 - 512 - nodes[1].size; in igt_debug()
289 ret = drm_mm_reserve_node(&mm, &nodes[1]); in igt_debug()
292 nodes[1].start, nodes[1].size); in igt_debug()
376 struct drm_mm_node tmp, *nodes, *node, *next; in __igt_reserve() local
394 nodes = vzalloc(array_size(count, sizeof(*nodes))); in __igt_reserve()
395 if (!nodes) in __igt_reserve()
405 nodes[n].start = order[n] * size; in __igt_reserve()
406 nodes[n].size = size; in __igt_reserve()
408 err = drm_mm_reserve_node(&mm, &nodes[n]); in __igt_reserve()
411 n, nodes[n].start); in __igt_reserve()
416 if (!drm_mm_node_allocated(&nodes[n])) { in __igt_reserve()
418 n, nodes[n].start); in __igt_reserve()
422 if (!expect_reserve_fail(&mm, &nodes[n])) in __igt_reserve()
438 drm_mm_remove_node(&nodes[order[n]]); in __igt_reserve()
439 err = drm_mm_reserve_node(&mm, &nodes[order[n]]); in __igt_reserve()
442 n, nodes[n].start); in __igt_reserve()
467 node = &nodes[order[(o + m) % count]]; in __igt_reserve()
472 node = &nodes[order[(o + m) % count]]; in __igt_reserve()
493 vfree(nodes); in __igt_reserve()
574 struct drm_mm_node *nodes, *node, *next; in __igt_insert() local
584 nodes = vmalloc(array_size(count, sizeof(*nodes))); in __igt_insert()
585 if (!nodes) in __igt_insert()
599 node = replace ? &tmp : &nodes[n]; in __igt_insert()
608 drm_mm_replace_node(&tmp, &nodes[n]); in __igt_insert()
615 if (!assert_node(&nodes[n], &mm, size, 0, n)) { in __igt_insert()
621 if (tmp.start != nodes[n].start) { in __igt_insert()
624 nodes[n].start, nodes[n].size); in __igt_insert()
640 u64 addr = nodes[n].start; in __igt_insert()
642 drm_mm_remove_node(&nodes[n]); in __igt_insert()
643 if (!expect_insert(&mm, &nodes[n], size, 0, n, mode)) { in __igt_insert()
649 if (nodes[n].start != addr) { in __igt_insert()
651 mode->name, n, addr, nodes[n].start); in __igt_insert()
662 node = &nodes[order[(o + m) % count]]; in __igt_insert()
667 node = &nodes[order[(o + m) % count]]; in __igt_insert()
698 vfree(nodes); in __igt_insert()
881 struct drm_mm_node *nodes, *node, *next; in __igt_insert_range() local
894 nodes = vzalloc(array_size(count, sizeof(*nodes))); in __igt_insert_range()
895 if (!nodes) in __igt_insert_range()
906 if (!expect_insert_in_range(&mm, &nodes[n], in __igt_insert_range()
925 u64 addr = nodes[n].start; in __igt_insert_range()
927 drm_mm_remove_node(&nodes[n]); in __igt_insert_range()
928 if (!expect_insert_in_range(&mm, &nodes[n], in __igt_insert_range()
935 if (nodes[n].start != addr) { in __igt_insert_range()
937 mode->name, n, addr, nodes[n].start); in __igt_insert_range()
960 vfree(nodes); in __igt_insert_range()
1038 struct drm_mm_node *nodes, in prepare_igt_frag() argument
1046 if (!expect_insert(mm, &nodes[i], size, 0, i, in prepare_igt_frag()
1056 drm_mm_remove_node(&nodes[i]); in prepare_igt_frag()
1065 struct drm_mm_node *nodes, in get_insert_time() argument
1074 if (!expect_insert(mm, &nodes[i], size, 0, i, mode) != 0) { in get_insert_time()
1087 struct drm_mm_node *nodes, *node, *next; in igt_frag() local
1098 nodes = vzalloc(array_size(insert_size * 4, sizeof(*nodes))); in igt_frag()
1099 if (!nodes) in igt_frag()
1114 ret = prepare_igt_frag(&mm, nodes, insert_size, mode); in igt_frag()
1119 nodes + insert_size, mode); in igt_frag()
1124 nodes + insert_size * 2, mode); in igt_frag()
1148 vfree(nodes); in igt_frag()
1158 struct drm_mm_node *nodes, *node, *next; in igt_align() local
1167 nodes = vzalloc(array_size(max_count, sizeof(*nodes))); in igt_align()
1168 if (!nodes) in igt_align()
1179 if (!expect_insert(&mm, &nodes[i], in igt_align()
1202 vfree(nodes); in igt_align()
1305 struct evict_node *nodes, in evict_nodes() argument
1315 e = &nodes[order ? order[i] : i]; in evict_nodes()
1353 struct evict_node *nodes) in evict_nothing() argument
1363 e = &nodes[n]; in evict_nothing()
1371 e = &nodes[n]; in evict_nothing()
1387 e = &nodes[n]; in evict_nothing()
1395 return assert_continuous(mm, nodes[0].node.size); in evict_nothing()
1400 struct evict_node *nodes) in evict_everything() argument
1410 e = &nodes[n]; in evict_everything()
1444 return assert_continuous(mm, nodes[0].node.size); in evict_everything()
1449 struct evict_node *nodes, in evict_something() argument
1467 nodes, order, count, false, in evict_something()
1510 if (!assert_continuous(mm, nodes[0].node.size)) { in evict_something()
1524 struct evict_node *nodes; in igt_evict() local
1537 nodes = vzalloc(array_size(size, sizeof(*nodes))); in igt_evict()
1538 if (!nodes) in igt_evict()
1548 err = drm_mm_insert_node(&mm, &nodes[n].node, 1); in igt_evict()
1557 if (!evict_nothing(&mm, size, nodes)) { in igt_evict()
1561 if (!evict_everything(&mm, size, nodes)) { in igt_evict()
1570 nodes, order, size, in igt_evict()
1584 nodes, order, size, in igt_evict()
1602 nodes, order, size, in igt_evict()
1623 vfree(nodes); in igt_evict()
1637 struct evict_node *nodes; in igt_evict_range() local
1647 nodes = vzalloc(array_size(size, sizeof(*nodes))); in igt_evict_range()
1648 if (!nodes) in igt_evict_range()
1658 err = drm_mm_insert_node(&mm, &nodes[n].node, 1); in igt_evict_range()
1670 nodes, order, size, in igt_evict_range()
1683 nodes, order, size, in igt_evict_range()
1700 nodes, order, size, in igt_evict_range()
1720 vfree(nodes); in igt_evict_range()
1738 struct drm_mm_node *nodes, *node, *next; in igt_topdown() local
1748 nodes = vzalloc(array_size(count, sizeof(*nodes))); in igt_topdown()
1749 if (!nodes) in igt_topdown()
1764 if (!expect_insert(&mm, &nodes[n], in igt_topdown()
1771 if (drm_mm_hole_follows(&nodes[n])) { in igt_topdown()
1773 n, nodes[n].start, size); in igt_topdown()
1787 node = &nodes[order[(o + m) % count]]; in igt_topdown()
1795 node = &nodes[order[(o + m) % count]]; in igt_topdown()
1839 vfree(nodes); in igt_topdown()
1852 struct drm_mm_node *nodes, *node, *next; in igt_bottomup() local
1861 nodes = vzalloc(array_size(count, sizeof(*nodes))); in igt_bottomup()
1862 if (!nodes) in igt_bottomup()
1877 if (!expect_insert(&mm, &nodes[n], in igt_bottomup()
1894 node = &nodes[order[(o + m) % count]]; in igt_bottomup()
1902 node = &nodes[order[(o + m) % count]]; in igt_bottomup()
1939 vfree(nodes); in igt_bottomup()
2191 struct evict_node *nodes, in evict_color() argument
2210 nodes, order, count, true, in evict_color()
2265 struct evict_node *nodes; in igt_color_evict() local
2277 nodes = vzalloc(array_size(total_size, sizeof(*nodes))); in igt_color_evict()
2278 if (!nodes) in igt_color_evict()
2289 if (!expect_insert(&mm, &nodes[n].node, in igt_color_evict()
2301 nodes, order, total_size, in igt_color_evict()
2314 nodes, order, total_size, in igt_color_evict()
2331 nodes, order, total_size, in igt_color_evict()
2353 vfree(nodes); in igt_color_evict()
2368 struct evict_node *nodes; in igt_color_evict_range() local
2378 nodes = vzalloc(array_size(total_size, sizeof(*nodes))); in igt_color_evict_range()
2379 if (!nodes) in igt_color_evict_range()
2390 if (!expect_insert(&mm, &nodes[n].node, in igt_color_evict_range()
2402 nodes, order, total_size, in igt_color_evict_range()
2415 nodes, order, total_size, in igt_color_evict_range()
2432 nodes, order, total_size, in igt_color_evict_range()
2454 vfree(nodes); in igt_color_evict_range()