Lines Matching refs:n
108 unsigned long n; in assert_continuous() local
114 n = 0; in assert_continuous()
119 n, addr, node->start); in assert_continuous()
125 n, size, node->size); in assert_continuous()
130 pr_err("node[%ld] is followed by a hole!\n", n); in assert_continuous()
150 n++; in assert_continuous()
354 int n; in check_reserve_boundaries() local
356 for (n = 0; n < ARRAY_SIZE(boundaries); n++) { in check_reserve_boundaries()
359 boundaries[n].start, in check_reserve_boundaries()
360 boundaries[n].size))) { in check_reserve_boundaries()
362 n, boundaries[n].name, count, size); in check_reserve_boundaries()
375 unsigned int *order, n, m, o = 0; in __igt_reserve() local
402 for (n = 0; n < count; n++) { 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()
430 for (n = 0; n < count; n++) { in __igt_reserve()
432 set_node(&tmp, order[n] * size, 1))) 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()
450 for (n = 0; n < count; n++) { in __igt_reserve()
454 for (n = 0; n < count; n++) { in __igt_reserve()
457 size * n, in __igt_reserve()
458 size * (count - n)))) in __igt_reserve()
463 for_each_prime_number(n, min(max_prime, count)) { in __igt_reserve()
464 for (m = 0; m < n; m++) { in __igt_reserve()
469 for (m = 0; m < n; m++) { in __igt_reserve()
474 m, n, node->start); in __igt_reserve()
480 o += n; in __igt_reserve()
501 int n, ret; in igt_reserve() local
503 for_each_prime_number_from(n, 1, 54) { in igt_reserve()
504 u64 size = BIT_ULL(n); in igt_reserve()
573 unsigned int *order, n, m, o = 0; in __igt_insert() local
594 for (n = 0; n < count; n++) { in __igt_insert()
597 node = replace ? &tmp : &nodes[n]; in __igt_insert()
599 if (!expect_insert(&mm, node, size, 0, n, mode)) { in __igt_insert()
601 mode->name, size, n); in __igt_insert()
606 drm_mm_replace_node(&tmp, &nodes[n]); in __igt_insert()
609 n); in __igt_insert()
613 if (!assert_node(&nodes[n], &mm, size, 0, n)) { in __igt_insert()
615 size, n); in __igt_insert()
619 if (tmp.start != nodes[n].start) { in __igt_insert()
622 nodes[n].start, nodes[n].size); in __igt_insert()
637 for (n = 0; n < count; n++) { 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()
643 mode->name, size, n); in __igt_insert()
647 if (nodes[n].start != addr) { in __igt_insert()
649 mode->name, n, addr, nodes[n].start); in __igt_insert()
658 for_each_prime_number(n, min(max_prime, count)) { in __igt_insert()
659 for (m = 0; m < n; m++) { in __igt_insert()
664 for (m = 0; m < n; m++) { in __igt_insert()
666 if (!expect_insert(&mm, node, size, 0, n, mode)) { in __igt_insert()
668 mode->name, size, n); in __igt_insert()
673 o += n; in __igt_insert()
702 unsigned int n; in igt_insert() local
705 for_each_prime_number_from(n, 1, 54) { in igt_insert()
706 u64 size = BIT_ULL(n); in igt_insert()
729 unsigned int n; in igt_replace() local
738 for_each_prime_number_from(n, 1, 54) { in igt_replace()
739 u64 size = BIT_ULL(n); in igt_replace()
818 unsigned int n; in assert_contiguous_in_range() local
823 n = div64_u64(start + size - 1, size); in assert_contiguous_in_range()
827 n, node->start, node->start + node->size, start, end); in assert_contiguous_in_range()
831 if (node->start != n * size) { in assert_contiguous_in_range()
833 n, n * size, node->start); in assert_contiguous_in_range()
839 n, size, node->size); in assert_contiguous_in_range()
845 pr_err("node %d is followed by a hole!\n", n); in assert_contiguous_in_range()
849 n++; in assert_contiguous_in_range()
878 unsigned int n, start_n, end_n; in __igt_insert_range() local
901 for (n = start_n; n <= end_n; n++) { in __igt_insert_range()
902 if (!expect_insert_in_range(&mm, &nodes[n], in __igt_insert_range()
903 size, size, n, in __igt_insert_range()
906 mode->name, size, n, in __igt_insert_range()
920 for (n = start_n; n <= end_n; n++) { in __igt_insert_range()
921 u64 addr = nodes[n].start; in __igt_insert_range()
923 drm_mm_remove_node(&nodes[n]); in __igt_insert_range()
924 if (!expect_insert_in_range(&mm, &nodes[n], in __igt_insert_range()
925 size, size, n, in __igt_insert_range()
927 pr_err("%s reinsert failed, step %d\n", mode->name, n); in __igt_insert_range()
931 if (nodes[n].start != addr) { in __igt_insert_range()
933 mode->name, n, addr, nodes[n].start); in __igt_insert_range()
989 unsigned int n; in igt_insert_range() local
997 for_each_prime_number_from(n, 1, 50) { in igt_insert_range()
998 const u64 size = BIT_ULL(n); in igt_insert_range()
1236 unsigned int n; in evict_nothing() local
1239 for (n = 0; n < total_size; n++) { in evict_nothing()
1240 e = &nodes[n]; in evict_nothing()
1247 for (n = 0; n < total_size; n++) { in evict_nothing()
1248 e = &nodes[n]; in evict_nothing()
1251 pr_err("node[%d] no longer allocated!\n", n); in evict_nothing()
1263 for (n = 0; n < total_size; n++) { in evict_nothing()
1264 e = &nodes[n]; in evict_nothing()
1267 pr_err("node[%d] no longer connected!\n", n); in evict_nothing()
1282 unsigned int n; in evict_everything() local
1286 for (n = 0; n < total_size; n++) { in evict_everything()
1287 e = &nodes[n]; in evict_everything()
1403 unsigned int *order, n; in igt_evict() local
1424 for (n = 0; n < size; n++) { in igt_evict()
1425 err = drm_mm_insert_node(&mm, &nodes[n].node, 1); in igt_evict()
1427 pr_err("insert failed, step %d\n", n); in igt_evict()
1444 for (n = 1; n <= size; n <<= 1) { in igt_evict()
1448 n, 1, in igt_evict()
1452 mode->name, n); in igt_evict()
1458 for (n = 1; n < size; n <<= 1) { in igt_evict()
1462 size/2, n, in igt_evict()
1466 mode->name, size/2, n); in igt_evict()
1472 for_each_prime_number_from(n, 1, min(size, max_prime)) { in igt_evict()
1473 unsigned int nsize = (size - n + 1) / 2; in igt_evict()
1480 nsize, n, in igt_evict()
1484 mode->name, nsize, n); in igt_evict()
1516 unsigned int *order, n; in igt_evict_range() local
1534 for (n = 0; n < size; n++) { in igt_evict_range()
1535 err = drm_mm_insert_node(&mm, &nodes[n].node, 1); in igt_evict_range()
1537 pr_err("insert failed, step %d\n", n); in igt_evict_range()
1544 for (n = 1; n <= range_size; n <<= 1) { in igt_evict_range()
1548 n, 1, in igt_evict_range()
1552 mode->name, n, range_start, range_end); in igt_evict_range()
1557 for (n = 1; n <= range_size; n <<= 1) { in igt_evict_range()
1561 range_size/2, n, in igt_evict_range()
1565 mode->name, range_size/2, n, range_start, range_end); in igt_evict_range()
1570 for_each_prime_number_from(n, 1, min(range_size, max_prime)) { in igt_evict_range()
1571 unsigned int nsize = (range_size - n + 1) / 2; in igt_evict_range()
1578 nsize, n, in igt_evict_range()
1582 mode->name, nsize, n, range_start, range_end); in igt_evict_range()
1616 unsigned int *order, n, m, o = 0; in igt_topdown() local
1641 for (n = 0; n < count; n++) { in igt_topdown()
1642 if (!expect_insert(&mm, &nodes[n], in igt_topdown()
1643 size, 0, n, in igt_topdown()
1645 pr_err("insert failed, size %u step %d\n", size, n); in igt_topdown()
1649 if (drm_mm_hole_follows(&nodes[n])) { in igt_topdown()
1651 n, nodes[n].start, size); in igt_topdown()
1655 if (!assert_one_hole(&mm, 0, size*(count - n - 1))) in igt_topdown()
1663 for_each_prime_number_from(n, 1, min(count, max_prime)) { in igt_topdown()
1664 for (m = 0; m < n; m++) { in igt_topdown()
1670 for (m = 0; m < n; m++) { in igt_topdown()
1677 pr_err("insert failed, step %d/%d\n", m, n); in igt_topdown()
1683 m, n, node->start); in igt_topdown()
1690 m, n, size, last, node_index(node)); in igt_topdown()
1699 o += n; in igt_topdown()
1731 unsigned int *order, n, m, o = 0; in igt_bottomup() local
1755 for (n = 0; n < count; n++) { in igt_bottomup()
1756 if (!expect_insert(&mm, &nodes[n], in igt_bottomup()
1757 size, 0, n, in igt_bottomup()
1759 pr_err("bottomup insert failed, size %u step %d\n", size, n); in igt_bottomup()
1763 if (!assert_one_hole(&mm, size*(n + 1), size*count)) in igt_bottomup()
1771 for_each_prime_number_from(n, 1, min(count, max_prime)) { in igt_bottomup()
1772 for (m = 0; m < n; m++) { in igt_bottomup()
1778 for (m = 0; m < n; m++) { in igt_bottomup()
1785 pr_err("insert failed, step %d/%d\n", m, n); in igt_bottomup()
1792 m, n, first, node_index(node)); in igt_bottomup()
1800 o += n; in igt_bottomup()
1857 unsigned int n; in igt_color() local
1869 for (n = 1; n <= count; n++) { in igt_color()
1877 n, 0, n, in igt_color()
1879 pr_err("insert failed, step %d\n", n); in igt_color()
1920 for (n = 1; n <= count; n++) { in igt_color()
1930 node->size = n + count; in igt_color()
1936 n, err); in igt_color()
1940 node->start += n + 1; in igt_color()
1941 rem = misalignment(node, n + count); in igt_color()
1942 node->start += n + count - rem; in igt_color()
1946 pr_err("reserve %d failed, err=%d\n", n, err); in igt_color()
1954 for (n = 1; n <= count; n++) { in igt_color()
1962 n, n, n, in igt_color()
1965 mode->name, n); in igt_color()
2086 unsigned int *order, n; in igt_color_evict() local
2107 for (n = 0; n < total_size; n++) { in igt_color_evict()
2108 if (!expect_insert(&mm, &nodes[n].node, in igt_color_evict()
2111 pr_err("insert failed, step %d\n", n); in igt_color_evict()
2117 for (n = 1; n <= total_size; n <<= 1) { in igt_color_evict()
2121 n, 1, color++, in igt_color_evict()
2125 mode->name, n); in igt_color_evict()
2130 for (n = 1; n < total_size; n <<= 1) { in igt_color_evict()
2134 total_size/2, n, color++, in igt_color_evict()
2138 mode->name, total_size/2, n); in igt_color_evict()
2143 for_each_prime_number_from(n, 1, min(total_size, max_prime)) { in igt_color_evict()
2144 unsigned int nsize = (total_size - n + 1) / 2; in igt_color_evict()
2151 nsize, n, color++, in igt_color_evict()
2155 mode->name, nsize, n); in igt_color_evict()
2189 unsigned int *order, n; in igt_color_evict_range() local
2208 for (n = 0; n < total_size; n++) { in igt_color_evict_range()
2209 if (!expect_insert(&mm, &nodes[n].node, in igt_color_evict_range()
2212 pr_err("insert failed, step %d\n", n); in igt_color_evict_range()
2218 for (n = 1; n <= range_size; n <<= 1) { in igt_color_evict_range()
2222 n, 1, color++, in igt_color_evict_range()
2226 mode->name, n, range_start, range_end); in igt_color_evict_range()
2231 for (n = 1; n < range_size; n <<= 1) { in igt_color_evict_range()
2235 range_size/2, n, color++, in igt_color_evict_range()
2239 mode->name, total_size/2, n, range_start, range_end); in igt_color_evict_range()
2244 for_each_prime_number_from(n, 1, min(range_size, max_prime)) { in igt_color_evict_range()
2245 unsigned int nsize = (range_size - n + 1) / 2; in igt_color_evict_range()
2252 nsize, n, color++, in igt_color_evict_range()
2256 mode->name, nsize, n, range_start, range_end); in igt_color_evict_range()