2241 		wr_mas->r_max = wr_mas->r_min = mas->index;  in mas_wr_node_walk()
2255 	wr_mas->r_max = offset < count ? wr_mas->pivots[offset] : mas->max;  in mas_wr_node_walk()
3575 	unsigned long max = wr_mas->r_max;  in mas_is_span_wr()
3599 	trace_ma_write(__func__, wr_mas->mas, wr_mas->r_max, entry);  in mas_is_span_wr()
3612 	wr_mas->mas->max = wr_mas->r_max;  in mas_wr_walk_traverse()
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()
3938 	else if (unlikely(wr_mas->r_max == ULONG_MAX))  in mas_wr_node_store()
4087 			wr_mas->r_max = wr_mas->pivots[mas->offset];  in mas_wr_extend_null()
4158 		if (mas->last == wr_mas->r_max) {  in mas_wr_append()
4207 	if (wr_mas->r_min == mas->index && wr_mas->r_max == mas->last) {  in mas_wr_modify()
4314 	wr_mas.end_piv = wr_mas.r_max;  in mas_insert()
4316 	if (wr_mas.content || (mas->last > wr_mas.r_max))  in mas_insert()
5499 	if (wr_mas.r_min == mas->index && wr_mas.r_max == mas->last)  in mas_preallocate()
7250 	       wr_mas->node, wr_mas->r_min, wr_mas->r_max);  in mas_wr_dump()