Lines Matching refs:ULONG_MAX
398 top = ULONG_MAX;
436 mas_for_each(&mas, entry, ULONG_MAX) {
452 mas_for_each(&mas, entry, ULONG_MAX) {
483 MT_BUG_ON(mt, mtree_insert_index(mt, ULONG_MAX, GFP_KERNEL));
484 mt_for_each(mt, entry, index, ULONG_MAX) {
492 val = ULONG_MAX;
504 mtree_erase_index(mt, ULONG_MAX);
518 /* Insert ULONG_MAX */
519 MT_BUG_ON(mt, mtree_insert_index(mt, ULONG_MAX, GFP_KERNEL));
524 mas_for_each(&mas, entry, ULONG_MAX) {
534 val = ULONG_MAX;
557 * 3. find the last value but searching for ULONG_MAX and then using
563 mas.index = ULONG_MAX; /* start at max.. */
564 entry = mas_find(&mas, ULONG_MAX);
571 mas.index = ULONG_MAX;
572 mas.last = ULONG_MAX;
586 mas.index = ULONG_MAX;
587 mas.last = ULONG_MAX;
605 mas_for_each(&mas, entry, ULONG_MAX)
614 mas_for_each(&mas, entry, ULONG_MAX) {
627 mas_for_each(&mas, entry, ULONG_MAX) {
752 mtree_store_range(mt, MTREE_ALLOC_MAX, ULONG_MAX, XA_ZERO_ENTRY,
927 mtree_store_range(mt, MTREE_ALLOC_MAX, ULONG_MAX, XA_ZERO_ENTRY,
1184 MT_BUG_ON(mt, mtree_test_store_range(mt, val, ULONG_MAX,
1352 value = mas_find(&mas, ULONG_MAX);
1396 MT_BUG_ON(mt, mas.last != ULONG_MAX);
1428 MT_BUG_ON(mt, mas.last != ULONG_MAX);
1443 ptr = mas_next(&mas, ULONG_MAX);
1445 MT_BUG_ON(mt, (mas.index != 1) && (mas.last != ULONG_MAX));
1461 ptr = mas_next(&mas, ULONG_MAX);
1463 MT_BUG_ON(mt, (mas.index != ULONG_MAX) && (mas.last != ULONG_MAX));
1539 entry = mas_find(&mas, ULONG_MAX);
1542 mas_next(&mas, ULONG_MAX);
1543 entry = mas_next(&mas, ULONG_MAX);
1570 entry = mas_find(&mas, ULONG_MAX);
1573 entry = mas_next(&mas, ULONG_MAX);
1575 mas_next(&mas, ULONG_MAX); /* go to the next entry. */
1826 mas_set(&mas, ULONG_MAX);
1867 mas_for_each(&mas, val, ULONG_MAX) {
1906 val = mas_find(&mas, ULONG_MAX);
1923 val = mas_find(&mas, ULONG_MAX);
1940 val = mas_find(&mas, ULONG_MAX);
1967 mas_for_each(&mas, val, ULONG_MAX) {
2011 mas_for_each(&mas, val, ULONG_MAX) {
2151 val = mas_next(&mas, ULONG_MAX);
2154 MT_BUG_ON(mt, mas.last != ULONG_MAX);
2269 mtree_test_store_range(mt, 0, ULONG_MAX, (void *)0x1);
2325 mtree_test_insert(mt, ULONG_MAX,
2327 mtree_test_erase(mt, ULONG_MAX);
2596 mtree_test_insert(mt, ULONG_MAX - 10, (void *)0xffffffffffffffeb);
2597 mtree_test_erase(mt, ULONG_MAX - 10);
2613 mtree_test_insert(mt, ULONG_MAX - 10, (void *)0xffffffffffffffeb);
2614 mtree_test_erase(mt, ULONG_MAX - 10);
2649 mas_for_each(&mas, tmp, ULONG_MAX) {
3081 entry = mas_next(&mas, ULONG_MAX);
3083 MT_BUG_ON(mt, mas.last != ULONG_MAX);
3089 entry = mas_next(&mas, ULONG_MAX);
3091 MT_BUG_ON(mt, mas.last != ULONG_MAX);
3097 entry = mas_find(&mas, ULONG_MAX);
3104 entry = mas_find(&mas, ULONG_MAX);
3107 MT_BUG_ON(mt, mas.last != ULONG_MAX);
3111 entry = mas_find(&mas, ULONG_MAX);
3114 MT_BUG_ON(mt, mas.last != ULONG_MAX);
3119 entry = mas_find(&mas, ULONG_MAX);
3122 MT_BUG_ON(mt, mas.last != ULONG_MAX);
3167 MT_BUG_ON(mt, mas.last != ULONG_MAX);
3176 MT_BUG_ON(mt, mas.last != ULONG_MAX);
3184 MT_BUG_ON(mt, mas.last != ULONG_MAX);
3191 MT_BUG_ON(mt, mas.last != ULONG_MAX);
3231 MT_BUG_ON(mt, mas.last != ULONG_MAX);
3254 entry = mas_next(&mas, ULONG_MAX);
3263 entry = mas_next(&mas, ULONG_MAX);
3273 entry = mas_next(&mas, ULONG_MAX);
3280 entry = mas_next(&mas, ULONG_MAX);
3294 entry = mas_next(&mas, ULONG_MAX);
3301 entry = mas_next(&mas, ULONG_MAX);
3304 MT_BUG_ON(mt, mas.last != ULONG_MAX);
3308 entry = mas_next(&mas, ULONG_MAX);
3311 MT_BUG_ON(mt, mas.last != ULONG_MAX);
3315 entry = mas_next(&mas, ULONG_MAX);
3318 MT_BUG_ON(mt, mas.last != ULONG_MAX);
3330 entry = mas_next(&mas, ULONG_MAX);
3333 entry = mas_next(&mas, ULONG_MAX);
3368 entry = mas_next(&mas, ULONG_MAX);
3382 entry = mas_find(&mas, ULONG_MAX);
3415 entry = mas_find(&mas, ULONG_MAX);
3424 entry = mas_find(&mas, ULONG_MAX);
3432 entry = mas_find(&mas, ULONG_MAX);
3439 entry = mas_find(&mas, ULONG_MAX);
3461 entry = mas_find(&mas, ULONG_MAX);
3464 MT_BUG_ON(mt, mas.last != ULONG_MAX);