Lines Matching refs:n
110 unsigned long n; in assert_continuous() local
116 n = 0; in assert_continuous()
121 n, addr, node->start); in assert_continuous()
127 n, size, node->size); in assert_continuous()
132 pr_err("node[%ld] is followed by a hole!\n", n); in assert_continuous()
152 n++; in assert_continuous()
356 int n; in check_reserve_boundaries() local
358 for (n = 0; n < ARRAY_SIZE(boundaries); n++) { in check_reserve_boundaries()
361 boundaries[n].start, in check_reserve_boundaries()
362 boundaries[n].size))) { in check_reserve_boundaries()
364 n, boundaries[n].name, count, size); in check_reserve_boundaries()
377 unsigned int *order, n, m, o = 0; in __igt_reserve() local
404 for (n = 0; n < count; n++) { 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()
432 for (n = 0; n < count; n++) { in __igt_reserve()
434 set_node(&tmp, order[n] * size, 1))) 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()
452 for (n = 0; n < count; n++) { in __igt_reserve()
456 for (n = 0; n < count; n++) { in __igt_reserve()
459 size * n, in __igt_reserve()
460 size * (count - n)))) in __igt_reserve()
465 for_each_prime_number(n, min(max_prime, count)) { in __igt_reserve()
466 for (m = 0; m < n; m++) { in __igt_reserve()
471 for (m = 0; m < n; m++) { in __igt_reserve()
476 m, n, node->start); in __igt_reserve()
482 o += n; in __igt_reserve()
503 int n, ret; in igt_reserve() local
505 for_each_prime_number_from(n, 1, 54) { in igt_reserve()
506 u64 size = BIT_ULL(n); in igt_reserve()
575 unsigned int *order, n, m, o = 0; in __igt_insert() local
596 for (n = 0; n < count; n++) { in __igt_insert()
599 node = replace ? &tmp : &nodes[n]; in __igt_insert()
601 if (!expect_insert(&mm, node, size, 0, n, mode)) { in __igt_insert()
603 mode->name, size, n); in __igt_insert()
608 drm_mm_replace_node(&tmp, &nodes[n]); in __igt_insert()
611 n); in __igt_insert()
615 if (!assert_node(&nodes[n], &mm, size, 0, n)) { in __igt_insert()
617 size, n); in __igt_insert()
621 if (tmp.start != nodes[n].start) { in __igt_insert()
624 nodes[n].start, nodes[n].size); in __igt_insert()
639 for (n = 0; n < count; n++) { 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()
645 mode->name, size, n); in __igt_insert()
649 if (nodes[n].start != addr) { in __igt_insert()
651 mode->name, n, addr, nodes[n].start); in __igt_insert()
660 for_each_prime_number(n, min(max_prime, count)) { in __igt_insert()
661 for (m = 0; m < n; m++) { in __igt_insert()
666 for (m = 0; m < n; m++) { in __igt_insert()
668 if (!expect_insert(&mm, node, size, 0, n, mode)) { in __igt_insert()
670 mode->name, size, n); in __igt_insert()
675 o += n; in __igt_insert()
706 unsigned int n; in igt_insert() local
709 for_each_prime_number_from(n, 1, 54) { in igt_insert()
710 u64 size = BIT_ULL(n); in igt_insert()
733 unsigned int n; in igt_replace() local
742 for_each_prime_number_from(n, 1, 54) { in igt_replace()
743 u64 size = BIT_ULL(n); in igt_replace()
822 unsigned int n; in assert_contiguous_in_range() local
827 n = div64_u64(start + size - 1, size); in assert_contiguous_in_range()
831 n, node->start, node->start + node->size, start, end); in assert_contiguous_in_range()
835 if (node->start != n * size) { in assert_contiguous_in_range()
837 n, n * size, node->start); in assert_contiguous_in_range()
843 n, size, node->size); in assert_contiguous_in_range()
849 pr_err("node %d is followed by a hole!\n", n); in assert_contiguous_in_range()
853 n++; in assert_contiguous_in_range()
882 unsigned int n, start_n, end_n; in __igt_insert_range() local
905 for (n = start_n; n <= end_n; n++) { in __igt_insert_range()
906 if (!expect_insert_in_range(&mm, &nodes[n], in __igt_insert_range()
907 size, size, n, in __igt_insert_range()
910 mode->name, size, n, in __igt_insert_range()
924 for (n = start_n; n <= end_n; 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()
929 size, size, n, in __igt_insert_range()
931 pr_err("%s reinsert failed, step %d\n", mode->name, 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()
995 unsigned int n; in igt_insert_range() local
1003 for_each_prime_number_from(n, 1, 50) { in igt_insert_range()
1004 const u64 size = BIT_ULL(n); in igt_insert_range()
1359 unsigned int n; in evict_nothing() local
1362 for (n = 0; n < total_size; n++) { in evict_nothing()
1363 e = &nodes[n]; in evict_nothing()
1370 for (n = 0; n < total_size; n++) { in evict_nothing()
1371 e = &nodes[n]; in evict_nothing()
1374 pr_err("node[%d] no longer allocated!\n", n); in evict_nothing()
1386 for (n = 0; n < total_size; n++) { in evict_nothing()
1387 e = &nodes[n]; in evict_nothing()
1390 pr_err("node[%d] no longer connected!\n", n); in evict_nothing()
1405 unsigned int n; in evict_everything() local
1409 for (n = 0; n < total_size; n++) { in evict_everything()
1410 e = &nodes[n]; in evict_everything()
1526 unsigned int *order, n; in igt_evict() local
1547 for (n = 0; n < size; n++) { in igt_evict()
1548 err = drm_mm_insert_node(&mm, &nodes[n].node, 1); in igt_evict()
1550 pr_err("insert failed, step %d\n", n); in igt_evict()
1567 for (n = 1; n <= size; n <<= 1) { in igt_evict()
1571 n, 1, in igt_evict()
1575 mode->name, n); in igt_evict()
1581 for (n = 1; n < size; n <<= 1) { in igt_evict()
1585 size/2, n, in igt_evict()
1589 mode->name, size/2, n); in igt_evict()
1595 for_each_prime_number_from(n, 1, min(size, max_prime)) { in igt_evict()
1596 unsigned int nsize = (size - n + 1) / 2; in igt_evict()
1603 nsize, n, in igt_evict()
1607 mode->name, nsize, n); in igt_evict()
1639 unsigned int *order, n; in igt_evict_range() local
1657 for (n = 0; n < size; n++) { in igt_evict_range()
1658 err = drm_mm_insert_node(&mm, &nodes[n].node, 1); in igt_evict_range()
1660 pr_err("insert failed, step %d\n", n); in igt_evict_range()
1667 for (n = 1; n <= range_size; n <<= 1) { in igt_evict_range()
1671 n, 1, in igt_evict_range()
1675 mode->name, n, range_start, range_end); in igt_evict_range()
1680 for (n = 1; n <= range_size; n <<= 1) { in igt_evict_range()
1684 range_size/2, n, in igt_evict_range()
1688 mode->name, range_size/2, n, range_start, range_end); in igt_evict_range()
1693 for_each_prime_number_from(n, 1, min(range_size, max_prime)) { in igt_evict_range()
1694 unsigned int nsize = (range_size - n + 1) / 2; in igt_evict_range()
1701 nsize, n, in igt_evict_range()
1705 mode->name, nsize, n, range_start, range_end); in igt_evict_range()
1739 unsigned int *order, n, m, o = 0; in igt_topdown() local
1763 for (n = 0; n < count; n++) { in igt_topdown()
1764 if (!expect_insert(&mm, &nodes[n], in igt_topdown()
1765 size, 0, n, in igt_topdown()
1767 pr_err("insert failed, size %u step %d\n", size, n); in igt_topdown()
1771 if (drm_mm_hole_follows(&nodes[n])) { in igt_topdown()
1773 n, nodes[n].start, size); in igt_topdown()
1777 if (!assert_one_hole(&mm, 0, size*(count - n - 1))) in igt_topdown()
1785 for_each_prime_number_from(n, 1, min(count, max_prime)) { in igt_topdown()
1786 for (m = 0; m < n; m++) { in igt_topdown()
1792 for (m = 0; m < n; m++) { in igt_topdown()
1799 pr_err("insert failed, step %d/%d\n", m, n); in igt_topdown()
1805 m, n, node->start); in igt_topdown()
1812 m, n, size, last, node_index(node)); in igt_topdown()
1821 o += n; in igt_topdown()
1853 unsigned int *order, n, m, o = 0; in igt_bottomup() local
1876 for (n = 0; n < count; n++) { in igt_bottomup()
1877 if (!expect_insert(&mm, &nodes[n], in igt_bottomup()
1878 size, 0, n, in igt_bottomup()
1880 pr_err("bottomup insert failed, size %u step %d\n", size, n); in igt_bottomup()
1884 if (!assert_one_hole(&mm, size*(n + 1), size*count)) in igt_bottomup()
1892 for_each_prime_number_from(n, 1, min(count, max_prime)) { in igt_bottomup()
1893 for (m = 0; m < n; m++) { in igt_bottomup()
1899 for (m = 0; m < n; m++) { in igt_bottomup()
1906 pr_err("insert failed, step %d/%d\n", m, n); in igt_bottomup()
1913 m, n, first, node_index(node)); in igt_bottomup()
1921 o += n; in igt_bottomup()
2038 unsigned int n; in igt_color() local
2050 for (n = 1; n <= count; n++) { in igt_color()
2058 n, 0, n, in igt_color()
2060 pr_err("insert failed, step %d\n", n); in igt_color()
2101 for (n = 1; n <= count; n++) { in igt_color()
2111 node->size = n + count; in igt_color()
2117 n, err); in igt_color()
2121 node->start += n + 1; in igt_color()
2122 rem = misalignment(node, n + count); in igt_color()
2123 node->start += n + count - rem; in igt_color()
2127 pr_err("reserve %d failed, err=%d\n", n, err); in igt_color()
2135 for (n = 1; n <= count; n++) { in igt_color()
2143 n, n, n, in igt_color()
2146 mode->name, n); in igt_color()
2267 unsigned int *order, n; in igt_color_evict() local
2288 for (n = 0; n < total_size; n++) { in igt_color_evict()
2289 if (!expect_insert(&mm, &nodes[n].node, in igt_color_evict()
2292 pr_err("insert failed, step %d\n", n); in igt_color_evict()
2298 for (n = 1; n <= total_size; n <<= 1) { in igt_color_evict()
2302 n, 1, color++, in igt_color_evict()
2306 mode->name, n); in igt_color_evict()
2311 for (n = 1; n < total_size; n <<= 1) { in igt_color_evict()
2315 total_size/2, n, color++, in igt_color_evict()
2319 mode->name, total_size/2, n); in igt_color_evict()
2324 for_each_prime_number_from(n, 1, min(total_size, max_prime)) { in igt_color_evict()
2325 unsigned int nsize = (total_size - n + 1) / 2; in igt_color_evict()
2332 nsize, n, color++, in igt_color_evict()
2336 mode->name, nsize, n); in igt_color_evict()
2370 unsigned int *order, n; in igt_color_evict_range() local
2389 for (n = 0; n < total_size; n++) { in igt_color_evict_range()
2390 if (!expect_insert(&mm, &nodes[n].node, in igt_color_evict_range()
2393 pr_err("insert failed, step %d\n", n); in igt_color_evict_range()
2399 for (n = 1; n <= range_size; n <<= 1) { in igt_color_evict_range()
2403 n, 1, color++, in igt_color_evict_range()
2407 mode->name, n, range_start, range_end); in igt_color_evict_range()
2412 for (n = 1; n < range_size; n <<= 1) { in igt_color_evict_range()
2416 range_size/2, n, color++, in igt_color_evict_range()
2420 mode->name, total_size/2, n, range_start, range_end); in igt_color_evict_range()
2425 for_each_prime_number_from(n, 1, min(range_size, max_prime)) { in igt_color_evict_range()
2426 unsigned int nsize = (range_size - n + 1) / 2; in igt_color_evict_range()
2433 nsize, n, color++, in igt_color_evict_range()
2437 mode->name, nsize, n, range_start, range_end); in igt_color_evict_range()