2132 	b_node->pivot[b_end] = mas->last;  in mas_store_b_node()
2135 	if (mas->last >= mas->max)  in mas_store_b_node()
2140 	if (piv > mas->last) {  in mas_store_b_node()
2150 			b_node->gap[b_end] = piv - mas->last + 1;  in mas_store_b_node()
2197 	MA_STATE(parent, mas->tree, mas->index, mas->last);  in mas_next_sibling()
2271 	mast->orig_r->last = mast->orig_r->max;  in mast_rebalance_next()
2357 	if (mast->orig_r->last < mast->orig_r->index)  in mast_ascend()
2358 		mast->orig_r->last = mast->orig_r->index;  in mast_ascend()
2640 				    (tmp_next[n].max <= tmp_next->last)) {  in mas_topiary_replace()
2754 	mast->orig_r->last = mast->orig_r->max;  in mast_combine_cp_right()
2788 	struct maple_enode *next, *last;  in mtree_range_walk()  local
2800 		last = next;  in mtree_range_walk()
2834 	mas->last = max;  in mtree_range_walk()
2837 	mas->node = last;  in mtree_range_walk()
2872 	MA_STATE(r_mas, mas->tree, mas->index, mas->last);  in mas_spanning_rebalance()
2932 		mast->orig_l->last = mast->orig_l->max;  in mas_spanning_rebalance()
2999 	MA_STATE(l_mas, mas->tree, mas->index, mas->last);  in mas_rebalance()
3000 	MA_STATE(r_mas, mas->tree, mas->index, mas->last);  in mas_rebalance()
3026 		r_mas.last = r_mas.index = r_mas.max;  in mas_rebalance()
3034 		l_mas.index = l_mas.last = l_mas.min;  in mas_rebalance()
3059 	MA_STATE(l_mas, mas->tree, mas->index, mas->last);  in mas_destroy_rebalance()
3286 	MA_STATE(tmp_mas, mas->tree, mas->index, mas->last);  in mas_push_data()
3372 	MA_STATE(l_mas, mas->tree, mas->index, mas->last);  in mas_split()
3373 	MA_STATE(r_mas, mas->tree, mas->index, mas->last);  in mas_split()
3374 	MA_STATE(prev_l_mas, mas->tree, mas->index, mas->last);  in mas_split()
3375 	MA_STATE(prev_r_mas, mas->tree, mas->index, mas->last);  in mas_split()
3536 	pivots[slot] = mas->last;  in mas_root_expand()
3537 	if (mas->last != ULONG_MAX)  in mas_root_expand()
3550 	if (likely((mas->last != 0) || (mas->index != 0)))  in mas_store_root()
3576 	unsigned long last = wr_mas->mas->last;  in mas_is_span_wr()  local
3581 	if (last < max)  in mas_is_span_wr()
3586 		if (last < max)  in mas_is_span_wr()
3590 	if (last == max) {  in mas_is_span_wr()
3595 		if (entry || last == ULONG_MAX)  in mas_is_span_wr()
3689 		if (r_mas->last < r_wr_mas->r_max)  in mas_extend_spanning_null()
3690 			r_mas->last = r_wr_mas->r_max;  in mas_extend_spanning_null()
3692 	} else if ((r_mas->last == r_wr_mas->r_max) &&  in mas_extend_spanning_null()
3693 	    (r_mas->last < r_mas->max) &&  in mas_extend_spanning_null()
3695 		r_mas->last = mas_safe_pivot(r_mas, r_wr_mas->pivots,  in mas_extend_spanning_null()
3784 	if (!entry && !mas->index && mas->last == ULONG_MAX) {  in mas_new_root()
3802 	pivots[0] = mas->last;  in mas_new_root()
3850 	if (unlikely(!mas->index && mas->last == ULONG_MAX))  in mas_wr_spanning_store()
3868 	if (r_mas.last + 1)  in mas_wr_spanning_store()
3869 		r_mas.last++;  in mas_wr_spanning_store()
3871 	r_mas.index = r_mas.last;  in mas_wr_spanning_store()
3873 	r_mas.last = r_mas.index = mas->last;  in mas_wr_spanning_store()
3883 		mas->last = l_mas.last = r_mas.last;  in mas_wr_spanning_store()
3887 	if (!l_mas.index && r_mas.last == ULONG_MAX) {  in mas_wr_spanning_store()
3903 	l_mas.index = l_mas.last = mas->index;  in mas_wr_spanning_store()
3936 	if (mas->last == wr_mas->end_piv)  in mas_wr_node_store()
3968 		dst_pivots[mas->offset] = mas->last;  in mas_wr_node_store()
4024 			wr_mas->pivots[offset] = mas->last;  in mas_wr_slot_store()
4039 		wr_mas->pivots[offset + 1] = mas->last;  in mas_wr_slot_store()
4062 		mas->last = wr_mas->end_piv;  in mas_wr_extend_null()
4065 		if ((mas->last == wr_mas->end_piv) &&  in mas_wr_extend_null()
4070 				mas->last = mas->max;  in mas_wr_extend_null()
4072 				mas->last = wr_mas->pivots[wr_mas->offset_end];  in mas_wr_extend_null()
4073 			wr_mas->end_piv = mas->last;  in mas_wr_extend_null()
4095 	       (wr_mas->mas->last > wr_mas->pivots[wr_mas->offset_end]))  in mas_wr_end_piv()
4116 	if (wr_mas->end_piv == mas->last)  in mas_wr_new_end()
4158 		if (mas->last == wr_mas->r_max) {  in mas_wr_append()
4166 			wr_mas->pivots[end] = mas->last;  in mas_wr_append()
4172 		wr_mas->pivots[end + 1] = mas->last;  in mas_wr_append()
4207 	if (wr_mas->r_min == mas->index && wr_mas->r_max == mas->last) {  in mas_wr_modify()
4264 	if (unlikely(!mas->index && mas->last == ULONG_MAX)) {  in mas_wr_store_entry()
4316 	if (wr_mas.content || (mas->last > wr_mas.r_max))  in mas_insert()
4470 		mas->last = mas->index - 1;  in mas_prev_slot()
4481 		mas->last = mas->max;  in mas_prev_slot()
4612 	unsigned long save_point = mas->last;  in mas_next_slot()
4641 			mas->last = pivots[mas->offset];  in mas_next_slot()
4643 			mas->last = mas->max;  in mas_next_slot()
4661 		mas->last = pivots[0];  in mas_next_slot()
4673 		if (mas->last >= max)  in mas_next_slot()
4676 		mas->index = mas->last + 1;  in mas_next_slot()
4704 	if (mas->last >= limit) {  in mas_next_entry()
4747 	while (mas->last < min)  in mas_rev_awalk()
4759 			if ((size <= gap) && (size <= mas->last - min + 1))  in mas_rev_awalk()
4840 			gap = min(pivot, mas->last) - max(mas->index, min) + 1;  in mas_anode_descend()
4859 		if (mas->last <= pivot) {  in mas_anode_descend()
4893 		mas->last = ULONG_MAX;  in mas_walk()
4896 			mas->last = 0;  in mas_walk()
4901 		mas->last = ULONG_MAX;  in mas_walk()
4965 	struct maple_enode *last = NULL;  in mas_awalk()  local
4975 		if (last == mas->node)  in mas_awalk()
4978 			last = mas->node;  in mas_awalk()
5007 		mas->last = min + size - 1;  in mas_sparse_area()
5009 		mas->last = max;  in mas_sparse_area()
5049 	mas->last = max;  in mas_empty_area()
5064 	mas->last = mas->index + size - 1;  in mas_empty_area()
5080 	struct maple_enode *last = mas->node;  in mas_empty_area_rev()  local
5103 	mas->last = max;  in mas_empty_area_rev()
5106 		if (last == mas->node) {  in mas_empty_area_rev()
5110 			last = mas->node;  in mas_empty_area_rev()
5121 	if (max < mas->last)  in mas_empty_area_rev()
5122 		mas->last = max;  in mas_empty_area_rev()
5124 	mas->index = mas->last - size + 1;  in mas_empty_area_rev()
5364 	if (wr_mas->mas->last > wr_mas->mas->max)  in mas_wr_store_setup()
5371 	    wr_mas->mas->last == wr_mas->mas->max)  in mas_wr_store_setup()
5399 	if (MAS_WARN_ON(mas, mas->index > mas->last))  in mas_store()
5400 		pr_err("Error %lX > %lX %p\n", mas->index, mas->last, entry);  in mas_store()
5402 	if (mas->index > mas->last) {  in mas_store()
5482 	if (unlikely(!mas->index && mas->last == ULONG_MAX))  in mas_preallocate()
5499 	if (wr_mas.r_min == mas->index && wr_mas.r_max == mas->last)  in mas_preallocate()
5662 	if (unlikely(mas->last >= max)) {  in mas_next_setup()
5688 			mas->index = mas->last = 0;  in mas_next_setup()
5692 		mas->last = ULONG_MAX;  in mas_next_setup()
5804 		mas->index = mas->last = 0;  in mas_prev_setup()
5812 			mas->index = mas->last = 0;  in mas_prev_setup()
5927 		if (mas->last < max)  in mas_find_setup()
5934 		if (unlikely(mas->last >= max))  in mas_find_setup()
5937 		mas->index = ++mas->last;  in mas_find_setup()
5940 		if (unlikely(mas->last >= max))  in mas_find_setup()
5943 		mas->index = mas->last;  in mas_find_setup()
5980 	mas->last = ULONG_MAX;  in mas_find_setup()
6056 		mas->last = --mas->index;  in mas_find_rev_setup()
6061 		mas->last = mas->index;  in mas_find_rev_setup()
6064 		if (mas->last <= min) {  in mas_find_rev_setup()
6091 			mas->last = mas->index = 0;  in mas_find_rev_setup()
6282 		unsigned long last, void *entry, gfp_t gfp)  in mtree_store_range()  argument
6284 	MA_STATE(mas, mt, index, last);  in mtree_store_range()
6291 	if (index > last)  in mtree_store_range()
6337 		unsigned long last, void *entry, gfp_t gfp)  in mtree_insert_range()  argument
6339 	MA_STATE(ms, mt, first, last);  in mtree_insert_range()
6344 	if (first > last)  in mtree_insert_range()
6552 	while (mas_searchable(&mas) && (mas.last < max)) {  in mt_find()
6563 		*index = mas.last + 1;  in mt_find()
6779 		unsigned long last = max;  in mt_dump_range64()  local
6782 			last = node->pivot[i];  in mt_dump_range64()
6785 		if (last == 0 && i > 0)  in mt_dump_range64()
6789 					first, last, depth + 1, format);  in mt_dump_range64()
6792 					first, last, depth + 1, format);  in mt_dump_range64()
6794 		if (last == max)  in mt_dump_range64()
6796 		if (last > max) {  in mt_dump_range64()
6800 					node, last, max, i);  in mt_dump_range64()
6805 					node, last, max, i);  in mt_dump_range64()
6808 		first = last + 1;  in mt_dump_range64()
6845 		unsigned long last = max;  in mt_dump_arange64()  local
6848 			last = node->pivot[i];  in mt_dump_arange64()
6851 		if (last == 0 && i > 0)  in mt_dump_arange64()
6855 					first, last, depth + 1, format);  in mt_dump_arange64()
6858 					first, last, depth + 1, format);  in mt_dump_arange64()
6860 		if (last == max)  in mt_dump_arange64()
6862 		if (last > max) {  in mt_dump_arange64()
6864 					node, last, max, i);  in mt_dump_arange64()
6867 		first = last + 1;  in mt_dump_arange64()
7163 	void *entry, *last = (void *)1;  in mt_validate_nulls()  local
7178 		if (!last && !entry) {  in mt_validate_nulls()
7182 		MT_BUG_ON(mt, !last && !entry);  in mt_validate_nulls()
7183 		last = entry;  in mt_validate_nulls()
7250 	pr_err("[%u] index=%lx last=%lx\n", mas->offset, mas->index, mas->last);  in mas_dump()
7253 	if (mas->index > mas->last)  in mas_dump()