Lines Matching refs:ULONG_MAX
374 top = ULONG_MAX; in check_find()
412 mas_for_each(&mas, entry, ULONG_MAX) { in check_find()
428 mas_for_each(&mas, entry, ULONG_MAX) { in check_find()
459 MT_BUG_ON(mt, mtree_insert_index(mt, ULONG_MAX, GFP_KERNEL)); in check_find()
460 mt_for_each(mt, entry, index, ULONG_MAX) { in check_find()
468 val = ULONG_MAX; in check_find()
480 mtree_erase_index(mt, ULONG_MAX); in check_find()
495 MT_BUG_ON(mt, mtree_insert_index(mt, ULONG_MAX, GFP_KERNEL)); in check_find()
500 mas_for_each(&mas, entry, ULONG_MAX) { in check_find()
510 val = ULONG_MAX; in check_find()
539 mas.index = ULONG_MAX; /* start at max.. */ in check_find()
540 entry = mas_find(&mas, ULONG_MAX); in check_find()
547 mas.index = ULONG_MAX; in check_find()
548 mas.last = ULONG_MAX; in check_find()
562 mas.index = ULONG_MAX; in check_find()
563 mas.last = ULONG_MAX; in check_find()
581 mas_for_each(&mas, entry, ULONG_MAX) in check_find_2()
590 mas_for_each(&mas, entry, ULONG_MAX) { in check_find_2()
603 mas_for_each(&mas, entry, ULONG_MAX) { in check_find_2()
722 mtree_store_range(mt, MTREE_ALLOC_MAX, ULONG_MAX, XA_ZERO_ENTRY, in check_alloc_rev_range()
889 mtree_store_range(mt, MTREE_ALLOC_MAX, ULONG_MAX, XA_ZERO_ENTRY, in check_alloc_range()
1249 value = mas_find(&mas, ULONG_MAX); in check_prev_entry()
1292 MT_BUG_ON(mt, mas.last != ULONG_MAX); in check_root_expand()
1324 MT_BUG_ON(mt, mas.last != ULONG_MAX); in check_root_expand()
1339 ptr = mas_next(&mas, ULONG_MAX); in check_root_expand()
1341 MT_BUG_ON(mt, (mas.index != 1) && (mas.last != ULONG_MAX)); in check_root_expand()
1357 ptr = mas_next(&mas, ULONG_MAX); in check_root_expand()
1359 MT_BUG_ON(mt, (mas.index != 1) && (mas.last != ULONG_MAX)); in check_root_expand()
1435 entry = mas_find(&mas, ULONG_MAX); in check_gap_combining()
1438 mas_next(&mas, ULONG_MAX); in check_gap_combining()
1439 entry = mas_next(&mas, ULONG_MAX); in check_gap_combining()
1466 entry = mas_find(&mas, ULONG_MAX); in check_gap_combining()
1469 entry = mas_next(&mas, ULONG_MAX); in check_gap_combining()
1471 mas_next(&mas, ULONG_MAX); /* go to the next entry. */ in check_gap_combining()
1699 mas_for_each(&mas, val, ULONG_MAX) { in check_forking()
1738 val = mas_find(&mas, ULONG_MAX); in check_iteration()
1755 val = mas_find(&mas, ULONG_MAX); in check_iteration()
1768 mas_next(&mas, ULONG_MAX); in check_iteration()
1773 val = mas_find(&mas, ULONG_MAX); in check_iteration()
1800 mas_for_each(&mas, val, ULONG_MAX) { in check_mas_store_gfp()
1840 mas_for_each(&mas, val, ULONG_MAX) { in bench_forking()
1975 val = mas_next(&mas, ULONG_MAX); in next_prev_test()
1977 MT_BUG_ON(mt, mas.index != ULONG_MAX); in next_prev_test()
1978 MT_BUG_ON(mt, mas.last != ULONG_MAX); in next_prev_test()
2092 mtree_test_store_range(mt, 0, ULONG_MAX, (void *)0x1); in check_fuzzer()
2148 mtree_test_insert(mt, ULONG_MAX, in check_fuzzer()
2150 mtree_test_erase(mt, ULONG_MAX); in check_fuzzer()
2419 mtree_test_insert(mt, ULONG_MAX - 10, (void *)0xffffffffffffffeb); in check_fuzzer()
2420 mtree_test_erase(mt, ULONG_MAX - 10); in check_fuzzer()
2436 mtree_test_insert(mt, ULONG_MAX - 10, (void *)0xffffffffffffffeb); in check_fuzzer()
2437 mtree_test_erase(mt, ULONG_MAX - 10); in check_fuzzer()
2468 mas_for_each(&mas, tmp, ULONG_MAX) { in check_dup_gaps()