Lines Matching refs:last
2103 b_node->pivot[b_end] = mas->last; in mas_store_b_node()
2106 if (mas->last >= mas->max) in mas_store_b_node()
2111 if (piv > mas->last) { in mas_store_b_node()
2121 b_node->gap[b_end] = piv - mas->last + 1; in mas_store_b_node()
2166 MA_STATE(parent, mas->tree, mas->index, mas->last); in mas_next_sibling()
2244 mast->orig_r->last = mast->orig_r->max; in mast_rebalance_next()
2327 if (mast->orig_r->last < mast->orig_r->index) in mast_ascend()
2328 mast->orig_r->last = mast->orig_r->index; in mast_ascend()
2612 (tmp_next[n].max <= tmp_next->last)) { in mas_topiary_replace()
2727 mast->orig_r->last = mast->orig_r->max; in mast_combine_cp_right()
2761 struct maple_enode *next, *last; in mtree_range_walk() local
2772 last = next; in mtree_range_walk()
2805 mas->last = max; in mtree_range_walk()
2808 mas->node = last; in mtree_range_walk()
2842 MA_STATE(r_mas, mas->tree, mas->index, mas->last); in mas_spanning_rebalance()
2900 mast->orig_l->last = mast->orig_l->max; in mas_spanning_rebalance()
2976 MA_STATE(l_mas, mas->tree, mas->index, mas->last); in mas_rebalance()
2977 MA_STATE(r_mas, mas->tree, mas->index, mas->last); in mas_rebalance()
3000 r_mas.last = r_mas.index = r_mas.max; in mas_rebalance()
3008 l_mas.index = l_mas.last = l_mas.min; in mas_rebalance()
3034 MA_STATE(l_mas, mas->tree, mas->index, mas->last); in mas_destroy_rebalance()
3249 MA_STATE(tmp_mas, mas->tree, mas->index, mas->last); in mas_push_data()
3335 MA_STATE(l_mas, mas->tree, mas->index, mas->last); in mas_split()
3336 MA_STATE(r_mas, mas->tree, mas->index, mas->last); in mas_split()
3337 MA_STATE(prev_l_mas, mas->tree, mas->index, mas->last); in mas_split()
3338 MA_STATE(prev_r_mas, mas->tree, mas->index, mas->last); in mas_split()
3445 pivots[slot] = mas->last; in mas_root_expand()
3446 if (mas->last != ULONG_MAX) in mas_root_expand()
3469 } else if (likely((mas->last != 0) || (mas->index != 0))) in mas_store_root()
3492 unsigned long last = wr_mas->mas->last; in mas_is_span_wr() local
3497 if (last < max) in mas_is_span_wr()
3502 if (last < max) in mas_is_span_wr()
3506 if (last == max) { in mas_is_span_wr()
3511 if (entry || last == ULONG_MAX) in mas_is_span_wr()
3613 if (r_mas->last < r_wr_mas->r_max) in mas_extend_spanning_null()
3614 r_mas->last = r_wr_mas->r_max; in mas_extend_spanning_null()
3616 } else if ((r_mas->last == r_wr_mas->r_max) && in mas_extend_spanning_null()
3617 (r_mas->last < r_mas->max) && in mas_extend_spanning_null()
3619 r_mas->last = mas_safe_pivot(r_mas, r_wr_mas->pivots, in mas_extend_spanning_null()
3700 WARN_ON_ONCE(mas->index || mas->last != ULONG_MAX); in mas_new_root()
3716 pivots[0] = mas->last; in mas_new_root()
3761 if (unlikely(!mas->index && mas->last == ULONG_MAX)) in mas_wr_spanning_store()
3776 if (r_mas.last + 1) in mas_wr_spanning_store()
3777 r_mas.last++; in mas_wr_spanning_store()
3779 r_mas.index = r_mas.last; in mas_wr_spanning_store()
3781 r_mas.last = r_mas.index = mas->last; in mas_wr_spanning_store()
3791 mas->last = l_mas.last = r_mas.last; in mas_wr_spanning_store()
3795 if (!l_mas.index && r_mas.last == ULONG_MAX) { in mas_wr_spanning_store()
3804 if (r_mas.max > r_mas.last) in mas_wr_spanning_store()
3811 l_mas.index = l_mas.last = mas->index; in mas_wr_spanning_store()
3838 if (mas->last == wr_mas->end_piv) in mas_wr_node_store()
3866 dst_pivots[mas->offset] = mas->last; in mas_wr_node_store()
3921 wr_mas->pivots[offset] = mas->last; in mas_wr_slot_store()
3937 wr_mas->pivots[offset + 1] = mas->last; in mas_wr_slot_store()
3958 mas->last = wr_mas->end_piv; in mas_wr_extend_null()
3961 if ((mas->last == wr_mas->end_piv) && in mas_wr_extend_null()
3966 mas->last = mas->max; in mas_wr_extend_null()
3968 mas->last = wr_mas->pivots[wr_mas->offset_end]; in mas_wr_extend_null()
3969 wr_mas->end_piv = mas->last; in mas_wr_extend_null()
3991 (wr_mas->mas->last > wr_mas->pivots[wr_mas->offset_end])) in mas_wr_end_piv()
4009 if (wr_mas->end_piv == mas->last) in mas_wr_new_end()
4038 if (mas->last == wr_mas->r_max) { in mas_wr_append()
4046 wr_mas->pivots[end] = mas->last; in mas_wr_append()
4052 wr_mas->pivots[end + 1] = mas->last; in mas_wr_append()
4152 if (mas->last > mas->max) in mas_wr_prealloc_setup()
4158 if (mte_is_leaf(mas->node) && mas->last == mas->max) in mas_wr_prealloc_setup()
4212 if (likely((mas->last != 0) || (mas->index != 0))) in mas_prealloc_calc()
4249 if ((wr_mas->r_min == mas->index) && (wr_mas->r_max == mas->last)) in mas_wr_store_type()
4252 if (unlikely(!mas->index && mas->last == ULONG_MAX)) in mas_wr_store_type()
4338 if (wr_mas.content || (mas->last > wr_mas.r_max)) in mas_insert()
4543 mas->last = mas->index - 1; in mas_prev_slot()
4557 mas->last = mas->max; in mas_prev_slot()
4690 unsigned long save_point = mas->last; in mas_next_slot()
4720 mas->last = pivots[mas->offset]; in mas_next_slot()
4722 mas->last = mas->max; in mas_next_slot()
4724 if (mas->last >= max) { in mas_next_slot()
4742 mas->last = pivots[0]; in mas_next_slot()
4755 if (mas->last >= max) { in mas_next_slot()
4760 mas->index = mas->last + 1; in mas_next_slot()
4802 while (mas->last < min) in mas_rev_awalk()
4814 if ((size <= gap) && (size <= mas->last - min + 1)) in mas_rev_awalk()
4895 gap = min(pivot, mas->last) - max(mas->index, min) + 1; in mas_anode_descend()
4913 if (mas->last <= pivot) { in mas_anode_descend()
4944 mas->last = ULONG_MAX; in mas_walk()
4947 mas->last = 0; in mas_walk()
4952 mas->last = ULONG_MAX; in mas_walk()
5016 struct maple_enode *last = NULL; in mas_awalk() local
5026 if (last == mas->node) in mas_awalk()
5029 last = mas->node; in mas_awalk()
5058 mas->last = min + size - 1; in mas_sparse_area()
5060 mas->last = max; in mas_sparse_area()
5101 mas->last = max; in mas_empty_area()
5114 mas->last = mas->index + size - 1; in mas_empty_area()
5131 struct maple_enode *last = mas->node; in mas_empty_area_rev() local
5154 mas->last = max; in mas_empty_area_rev()
5157 if (last == mas->node) { in mas_empty_area_rev()
5161 last = mas->node; in mas_empty_area_rev()
5172 if (max < mas->last) in mas_empty_area_rev()
5173 mas->last = max; in mas_empty_area_rev()
5175 mas->index = mas->last - size + 1; in mas_empty_area_rev()
5410 if (MAS_WARN_ON(mas, mas->index > mas->last)) in mas_store()
5411 pr_err("Error %lX > %lX " PTR_FMT "\n", mas->index, mas->last, in mas_store()
5414 if (mas->index > mas->last) { in mas_store()
5462 unsigned long last = mas->last; in mas_store_gfp() local
5470 __mas_set_range(mas, index, last); in mas_store_gfp()
5681 if (unlikely(mas->last >= max)) { in mas_next_setup()
5720 mas->index = mas->last = 0; in mas_next_setup()
5724 mas->last = ULONG_MAX; in mas_next_setup()
5847 mas->index = mas->last = 0; in mas_prev_setup()
5855 mas->index = mas->last = 0; in mas_prev_setup()
5967 if (mas->last < max) in mas_find_setup()
5973 if (unlikely(mas->last >= max)) in mas_find_setup()
5976 mas->index = ++mas->last; in mas_find_setup()
5980 if (unlikely(mas->last >= max)) in mas_find_setup()
5983 mas->index = mas->last; in mas_find_setup()
5999 if (unlikely(mas->last >= max)) in mas_find_setup()
6038 mas->last = ULONG_MAX; in mas_find_setup()
6115 mas->last = --mas->index; in mas_find_rev_setup()
6122 mas->last = mas->index; in mas_find_rev_setup()
6163 mas->last = mas->index = 0; in mas_find_rev_setup()
6261 mas->index = mas->last = index; in mas_erase()
6360 unsigned long last, void *entry, gfp_t gfp) in mtree_store_range() argument
6362 MA_STATE(mas, mt, index, last); in mtree_store_range()
6369 if (index > last) in mtree_store_range()
6409 unsigned long last, void *entry, gfp_t gfp) in mtree_insert_range() argument
6411 MA_STATE(ms, mt, first, last); in mtree_insert_range()
6417 if (first > last) in mtree_insert_range()
6943 while (mas_is_active(&mas) && (mas.last < max)) { in mt_find()
6954 *index = mas.last + 1; in mt_find()
7161 unsigned long last = max; in mt_dump_range64() local
7164 last = node->pivot[i]; in mt_dump_range64()
7167 if (last == 0 && i > 0) in mt_dump_range64()
7171 first, last, depth + 1, format); in mt_dump_range64()
7174 first, last, depth + 1, format); in mt_dump_range64()
7176 if (last == max) in mt_dump_range64()
7178 if (last > max) { in mt_dump_range64()
7182 node, last, max, i); in mt_dump_range64()
7186 node, last, max, i); in mt_dump_range64()
7189 first = last + 1; in mt_dump_range64()
7223 unsigned long last = max; in mt_dump_arange64() local
7226 last = node->pivot[i]; in mt_dump_arange64()
7229 if (last == 0 && i > 0) in mt_dump_arange64()
7233 first, last, depth + 1, format); in mt_dump_arange64()
7235 if (last == max) in mt_dump_arange64()
7237 if (last > max) { in mt_dump_arange64()
7241 node, last, max, i); in mt_dump_arange64()
7245 node, last, max, i); in mt_dump_arange64()
7248 first = last + 1; in mt_dump_arange64()
7546 void *entry, *last = (void *)1; in mt_validate_nulls() local
7561 if (!last && !entry) { in mt_validate_nulls()
7565 MT_BUG_ON(mt, !last && !entry); in mt_validate_nulls()
7566 last = entry; in mt_validate_nulls()
7685 mas->index, mas->last); in mas_dump()
7688 if (mas->index > mas->last) in mas_dump()