Lines Matching defs:order
120 pr_err("node[%ld] list out of order, expected %llx found %llx\n",
377 unsigned int *order, n, m, o = 0;
390 order = drm_random_order(count, &prng);
391 if (!order)
405 nodes[n].start = order[n] * size;
426 /* After random insertion the nodes should be in order */
431 drm_random_reorder(order, count, &prng);
434 set_node(&tmp, order[n] * size, 1)))
438 drm_mm_remove_node(&nodes[order[n]]);
439 err = drm_mm_reserve_node(&mm, &nodes[order[n]]);
467 node = &nodes[order[(o + m) % count]];
472 node = &nodes[order[(o + m) % count]];
495 kfree(order);
575 unsigned int *order, n, m, o = 0;
588 order = drm_random_order(count, &prng);
589 if (!order)
630 /* After random insertion the nodes should be in order */
662 node = &nodes[order[(o + m) % count]];
667 node = &nodes[order[(o + m) % count]];
696 kfree(order);
836 pr_err("node %d out of order, expected start %llx, found %llx\n",
1306 unsigned int *order,
1315 e = &nodes[order ? order[i] : i];
1450 unsigned int *order,
1467 nodes, order, count, false,
1526 unsigned int *order, n;
1530 * by evicting other nodes in a random order. The drm_mm_scan should
1541 order = drm_random_order(size, &prng);
1542 if (!order)
1568 drm_random_reorder(order, size, &prng);
1570 nodes, order, size,
1582 drm_random_reorder(order, size, &prng);
1584 nodes, order, size,
1600 drm_random_reorder(order, size, &prng);
1602 nodes, order, size,
1621 kfree(order);
1639 unsigned int *order, n;
1651 order = drm_random_order(size, &prng);
1652 if (!order)
1668 drm_random_reorder(order, size, &prng);
1670 nodes, order, size,
1681 drm_random_reorder(order, size, &prng);
1683 nodes, order, size,
1698 drm_random_reorder(order, size, &prng);
1700 nodes, order, size,
1718 kfree(order);
1739 unsigned int *order, n, m, o = 0;
1756 order = drm_random_order(count, &prng);
1757 if (!order)
1784 drm_random_reorder(order, count, &prng);
1787 node = &nodes[order[(o + m) % count]];
1795 node = &nodes[order[(o + m) % count]];
1835 kfree(order);
1853 unsigned int *order, n, m, o = 0;
1869 order = drm_random_order(count, &prng);
1870 if (!order)
1891 drm_random_reorder(order, count, &prng);
1894 node = &nodes[order[(o + m) % count]];
1902 node = &nodes[order[(o + m) % count]];
1935 kfree(order);
2192 unsigned int *order,
2210 nodes, order, count, true,
2267 unsigned int *order, n;
2281 order = drm_random_order(total_size, &prng);
2282 if (!order)
2299 drm_random_reorder(order, total_size, &prng);
2301 nodes, order, total_size,
2312 drm_random_reorder(order, total_size, &prng);
2314 nodes, order, total_size,
2329 drm_random_reorder(order, total_size, &prng);
2331 nodes, order, total_size,
2351 kfree(order);
2370 unsigned int *order, n;
2382 order = drm_random_order(total_size, &prng);
2383 if (!order)
2400 drm_random_reorder(order, range_size, &prng);
2402 nodes, order, total_size,
2413 drm_random_reorder(order, total_size, &prng);
2415 nodes, order, total_size,
2430 drm_random_reorder(order, total_size, &prng);
2432 nodes, order, total_size,
2452 kfree(order);