101 	[maple_leaf_64]		= ULONG_MAX,
102 	[maple_range_64]	= ULONG_MAX,
103 	[maple_arange_64]	= ULONG_MAX,
104 	[maple_copy]		= ULONG_MAX,
361 	return !mas->min && mas->max == ULONG_MAX;  in mas_is_root_limits()
991 		mas->max = ULONG_MAX;  in mas_ascend()
997 	max = ULONG_MAX;  in mas_ascend()
1009 	if (mas->max == ULONG_MAX)  in mas_ascend()
1175 		mas->max = ULONG_MAX;  in mas_start()
1348 	if (unlikely(max == ULONG_MAX) && !slots[max_piv + 1]) {  in ma_leaf_max_gap()
1349 		gap = ULONG_MAX - pivots[max_piv];  in ma_leaf_max_gap()
2247 		    (wr_mas->mas->max != ULONG_MAX)) {  in rebalance_data()
2275 	if (((l_wr_mas->mas->min != 0) || (r_wr_mas->mas->max != ULONG_MAX)) &&  in spanning_data()
2507 		if (cp->dst[d].max != ULONG_MAX &&  in cp_data_write()
2592 	if (cp->min || cp->max != ULONG_MAX)  in cp_is_new_root()
2621 	mas->max = ULONG_MAX;  in cp_is_new_root()
2761 	if (mas->last != ULONG_MAX)  in mas_root_expand()
2762 		pivots[++slot] = ULONG_MAX;  in mas_root_expand()
2825 		if (entry || last == ULONG_MAX)  in mas_is_span_wr()
3016 	WARN_ON_ONCE(mas->index || mas->last != ULONG_MAX);  in mas_new_root()
3072 	if (unlikely(!mas->index && mas->last == ULONG_MAX))  in mas_wr_spanning_store()
3103 	if (!mas->index && r_mas.last == ULONG_MAX) {  in mas_wr_spanning_store()
3104 		mas_set_range(mas, 0, ULONG_MAX);  in mas_wr_spanning_store()
3679 	if (unlikely(!mas->index && mas->last == ULONG_MAX))  in mas_wr_store_type()
4371 		mas->last = ULONG_MAX;  in mas_walk()
4379 		mas->last = ULONG_MAX;  in mas_walk()
5051 		mas->last = ULONG_MAX;  in mas_next_setup()
5365 	mas->last = ULONG_MAX;  in mas_find_setup()
6084 	new_mas->max = ULONG_MAX;  in mas_dup_build()
6098 			if (mas->max == ULONG_MAX)  in mas_dup_build()
6906 			mas_next_node(&mas, mas_mn(&mas), ULONG_MAX);  in mt_validate_nulls()
6951 		mas_dfs_postorder(&mas, ULONG_MAX);  in mt_validate()