Lines Matching defs:order
72 unsigned order, void *entry, gfp_t gfp)
74 XA_STATE_ORDER(xas, xa, index, order);
177 unsigned int order;
207 for (order = 2; order < max_order; order++) {
208 unsigned long base = round_down(index, 1UL << order);
209 unsigned long next = base + (1UL << order);
217 xa_store_order(xa, index, order, xa_mk_index(index),
328 unsigned int order;
353 for (order = 0; order < max_order; order++) {
354 unsigned long max = (1UL << order) - 1;
355 xa_store_order(xa, 0, order, xa_mk_value(0), GFP_KERNEL);
532 unsigned int order)
535 unsigned long min = index & ~((1UL << order) - 1);
536 unsigned long max = min + (1UL << order);
538 xa_store_order(xa, index, order, xa_mk_index(index), GFP_KERNEL);
557 unsigned int order)
560 xa_store_order(xa, index, order, xa_mk_value(0), GFP_KERNEL);
571 unsigned int order)
577 xa_store_order(xa, index, order, xa_mk_index(index), GFP_KERNEL);
868 unsigned int order, unsigned int present)
870 XA_STATE_ORDER(xas, xa, start, order);
879 XA_BUG_ON(xa, entry > xa_mk_index(start + (1UL << order) - 1));
891 XA_BUG_ON(xa, xa_load(xa, start + (1UL << order) - 1) !=
934 static noinline void check_multi_find_1(struct xarray *xa, unsigned order)
937 unsigned long multi = 3 << order;
938 unsigned long next = 4 << order;
941 xa_store_order(xa, multi, order, xa_mk_value(multi), GFP_KERNEL);
992 unsigned int order;
994 for (order = 5; order < order_limit; order++) {
995 unsigned long index = 1UL << (order - 5);
998 xa_store_order(xa, 0, order - 4, xa_mk_index(0), GFP_KERNEL);
1155 unsigned int order;
1158 for (order = 0; order < 20; order++) {
1159 for (offset = 0; offset < (1UL << (order + 3));
1160 offset += (1UL << order)) {
1161 for (index = 0; index < (1UL << (order + 5));
1162 index += (1UL << order)) {
1163 xa_store_order(xa, index, order,
1188 unsigned int order;
1192 for (order = 0; order < order_limit; order++) {
1193 XA_BUG_ON(xa, xa_store_order(xa, index, order,
1195 index += 1UL << order;
1381 unsigned long index, unsigned order)
1383 XA_STATE_ORDER(xas, xa, index, order);
1392 for (i = 0; i < (1U << order); i++) {
1404 unsigned long index, unsigned order)
1408 xa_store_many_order(xa, index, order);
1409 for (i = index; i < index + (1UL << order); i++)
1414 static noinline void check_create_range_2(struct xarray *xa, unsigned order)
1417 unsigned long nr = 1UL << order;
1420 xa_store_many_order(xa, i, order);
1435 unsigned long index, unsigned order)
1437 XA_STATE_ORDER(xas, xa, index, order);
1447 for (i = 0; i < (1UL << order); i++) {
1461 for (i = base; i < base + (1UL << order); i++)
1467 unsigned long index, unsigned int order)
1469 XA_STATE_ORDER(xas, xa, index, order);
1472 xa_store_order(xa, index, order, xa_mk_index(index), GFP_KERNEL);
1474 for (i = 0; i < order + 10; i++) {
1487 unsigned int order;
1490 for (order = 0; order < max_order; order++) {
1491 check_create_range_1(xa, 0, order);
1492 check_create_range_1(xa, 1U << order, order);
1493 check_create_range_1(xa, 2U << order, order);
1494 check_create_range_1(xa, 3U << order, order);
1495 check_create_range_1(xa, 1U << 24, order);
1496 if (order < 10)
1497 check_create_range_2(xa, order);
1499 check_create_range_4(xa, 0, order);
1500 check_create_range_4(xa, 1U << order, order);
1501 check_create_range_4(xa, 2U << order, order);
1502 check_create_range_4(xa, 3U << order, order);
1503 check_create_range_4(xa, 1U << 24, order);
1505 check_create_range_4(xa, 1, order);
1506 check_create_range_4(xa, (1U << order) + 1, order);
1507 check_create_range_4(xa, (2U << order) + 1, order);
1508 check_create_range_4(xa, (2U << order) - 1, order);
1509 check_create_range_4(xa, (3U << order) + 1, order);
1510 check_create_range_4(xa, (3U << order) - 1, order);
1511 check_create_range_4(xa, (1U << 24) + 1, order);
1513 check_create_range_5(xa, 0, order);
1514 check_create_range_5(xa, (1U << order), order);
1555 unsigned int order, unsigned int new_order)
1560 xa_store_order(xa, index, order, xa, GFP_KERNEL);
1562 xas_split_alloc(&xas, xa, order, GFP_KERNEL);
1564 xas_split(&xas, xa, order);
1565 for (i = 0; i < (1 << order); i += (1 << new_order))
1569 for (i = 0; i < (1 << order); i++) {
1582 unsigned int order, new_order;
1586 for (order = 1; order < 2 * XA_CHUNK_SHIFT; order++) {
1587 for (new_order = 0; new_order < order; new_order++) {
1588 check_split_1(xa, 0, order, new_order);
1589 check_split_1(xa, 1UL << order, order, new_order);
1590 check_split_1(xa, 3UL << order, order, new_order);
1713 unsigned int order;
1715 for (order = 1; order < 12; order++) {
1716 XA_STATE(xas, xa, 1 << order);
1718 xa_store_order(xa, 0, order, xa, GFP_KERNEL);
1722 XA_BUG_ON(xa, xas.xa_node->count > (1 << order));
1726 xa_store_order(xa, 1 << order, order, xa_mk_index(1UL << order),
1730 xa_erase(xa, 1 << order);
1742 unsigned int order;
1748 for (order = 0; order < max_order; order++) {
1750 xa_store_order(xa, i << order, order,
1751 xa_mk_index(i << order), GFP_KERNEL);
1752 for (j = i << order; j < (i + 1) << order; j++)
1753 XA_BUG_ON(xa, xa_get_order(xa, j) != order);
1754 xa_erase(xa, i << order);