287 static inline struct maple_node *mas_mn(const struct ma_state *mas)  in mas_mn()  function
1005 	node = mas_mn(mas);  in mas_descend()
1056 	a_node = mas_mn(mas);  in mas_ascend()
1426 	node = mas_mn(mas);  in mas_data_end()
1458 	mn = mas_mn(mas);  in mas_leaf_max_gap()
1566 	node = mas_mn(mas);  in mas_max_gap()
1670 	struct maple_node *node = mas_mn(mas);  in mas_adopt_children()
1693 	struct maple_node *mn = mas_mn(mas);  in mas_replace()
1740 	node = mas_mn(mas);  in mas_new_child()
1912 	node = mas_mn(mas);  in mas_mab_cp()
2257 	wr_mas->node = mas_mn(wr_mas->mas);  in mas_wr_node_walk()
2307 	slots = ma_slots(mas_mn(mas), mte_node_type(mas->node));  in mas_topiary_range()
2341 	l_slots = ma_slots(mas_mn(mast->orig_l),  in mast_topiary()
2344 	r_slots = ma_slots(mas_mn(mast->orig_r),  in mast_topiary()
2777 	mas_mn(mast->l)->parent =  in mast_new_root()
3074 		mas_mn(&l_mas)->parent = mas_mn(mast->orig_l)->parent;  in mas_spanning_rebalance()
3187 	node = mas_mn(mas);  in mas_destroy_rebalance()
3191 	left = mas_mn(&l_mas);  in mas_destroy_rebalance()
3297 	mte_to_node(ancestor)->parent = mas_mn(mas)->parent;  in mas_split_final_node()
3604 	node->parent = mas_mn(wr_mas->mas)->parent;  in mas_commit_b_node()
4109 	newnode->parent = mas_mn(mas)->parent;  in mas_wr_node_store()
4484 		node = mas_mn(mas);  in mas_prev_node()
4497 	node = mas_mn(mas);  in mas_prev_node()
4517 		node = mas_mn(mas);  in mas_prev_node()
4589 		node = mas_mn(mas);  in mas_next_node()
4604 		node = mas_mn(mas);  in mas_next_node()
4742 	node = mas_mn(mas);  in mas_next_entry()
4771 		node = mas_mn(mas);  in mas_next_entry()
4803 	mn = mas_mn(mas);  in mas_prev_nentry()
4879 	struct maple_node *node = mas_mn(mas);  in mas_rev_awalk()
4969 	unsigned long *pivots = ma_pivots(mas_mn(mas), type);  in mas_anode_descend()
4970 	void __rcu **slots = ma_slots(mas_mn(mas), type);  in mas_anode_descend()
5111 	pivots = ma_pivots(mas_mn(mas), mt);  in mas_skip_node()
5180 	pivots = ma_pivots(mas_mn(mas), ptype);  in mas_fill_gap()
5259 	pivots = ma_pivots(mas_mn(mas), mt);  in mas_empty_area()
5442 	next = mas_mn(mas);  in mas_dead_walk()
5445 		node = mas_mn(mas);  in mas_dead_walk()
5473 	node = mas_mn(&mas);  in mt_free_walk()
5478 		if (mas_mn(&mas) == node)  in mt_free_walk()
5486 		node = mas_mn(&mas);  in mt_free_walk()
5507 		node = mas_mn(mas);  in mas_destroy_descend()
5542 	node = mas_mn(&mas);  in mt_destroy_walk()
5553 		if (mas_mn(&mas) == node)  in mt_destroy_walk()
5568 		node = mas_mn(&mas);  in mt_destroy_walk()
5571 	node = mas_mn(&mas);  in mt_destroy_walk()
6576 	return mas_slot(mas, ma_slots(mas_mn(mas), mte_node_type(mas->node)),  in mas_get_slot()
6615 		mn = mas_mn(mas);  in mas_first_entry()
6659 	mas_next_node(mas, mas_mn(mas), max);  in mas_dfs_postorder()
6887 						mas_mn(mas), i,  in mas_validate_gaps()
6898 					mas_mn(mas), i, gap, p_end, p_start,  in mas_validate_gaps()
6944 	MT_BUG_ON(mas->tree, mas_mn(mas) == parent);  in mas_validate_parent_slot()
6953 					parent, i, mas_mn(mas));  in mas_validate_parent_slot()
6957 			       mas_mn(mas), parent, i, p_slot);  in mas_validate_parent_slot()
6984 			       mas_mn(mas), i, mte_to_node(child),  in mas_validate_child_slot()
7007 	unsigned long *pivots = ma_pivots(mas_mn(mas), type);  in mas_validate_limits()
7026 				       mas_mn(mas), i);  in mas_validate_limits()
7033 				mas_mn(mas), i, piv, prev_piv);  in mas_validate_limits()
7038 			pr_err("%p[%u] %lu < %lu\n", mas_mn(mas), i,  in mas_validate_limits()
7043 			pr_err("%p[%u] %lu > %lu\n", mas_mn(mas), i,  in mas_validate_limits()
7055 			pr_err("%p[%u] should not have entry %p\n", mas_mn(mas),  in mas_validate_limits()
7067 			       mas_mn(mas), i, piv);  in mas_validate_limits()
7092 				mas_mn(&mas), offset);  in mt_validate_nulls()
7097 			mas_next_node(&mas, mas_mn(&mas), ULONG_MAX);  in mt_validate_nulls()
7125 	mas_first_entry(&mas, mas_mn(&mas), ULONG_MAX, mte_node_type(mas.node));  in mt_validate()
7133 				mas_mn(&mas));  in mt_validate()