296 static inline void mte_set_node_dead(struct maple_enode *mn)  in mte_set_node_dead()  argument
298 	mte_to_node(mn)->parent = ma_parent_ptr(mte_to_node(mn));  in mte_set_node_dead()
664 static inline unsigned long mte_pivot(const struct maple_enode *mn,  in mte_pivot()  argument
667 	struct maple_node *node = mte_to_node(mn);  in mte_pivot()
673 	switch (mte_node_type(mn)) {  in mte_pivot()
755 static inline void mte_set_pivot(struct maple_enode *mn, unsigned char piv,  in mte_set_pivot()  argument
758 	struct maple_node *node = mte_to_node(mn);  in mte_set_pivot()
759 	enum maple_type type = mte_node_type(mn);  in mte_set_pivot()
784 static inline void __rcu **ma_slots(struct maple_node *mn, enum maple_type mt)  in ma_slots()  argument
789 		return mn->ma64.slot;  in ma_slots()
792 		return mn->mr64.slot;  in ma_slots()
794 		return mn->slot;  in ma_slots()
865 static inline struct maple_metadata *ma_meta(struct maple_node *mn,  in ma_meta()  argument
870 		return &mn->ma64.meta;  in ma_meta()
872 		return &mn->mr64.meta;  in ma_meta()
883 static inline void ma_set_meta(struct maple_node *mn, enum maple_type mt,  in ma_set_meta()  argument
886 	struct maple_metadata *meta = ma_meta(mn, mt);  in ma_set_meta()
897 static inline unsigned char ma_meta_end(struct maple_node *mn,  in ma_meta_end()  argument
900 	struct maple_metadata *meta = ma_meta(mn, mt);  in ma_meta_end()
910 static inline unsigned char ma_meta_gap(struct maple_node *mn,  in ma_meta_gap()  argument
915 	return mn->ma64.meta.gap;  in ma_meta_gap()
924 static inline void ma_set_meta_gap(struct maple_node *mn, enum maple_type mt,  in ma_set_meta_gap()  argument
928 	struct maple_metadata *meta = ma_meta(mn, mt);  in ma_set_meta_gap()
1022 static inline void mte_set_gap(const struct maple_enode *mn,  in mte_set_gap()  argument
1025 	switch (mte_node_type(mn)) {  in mte_set_gap()
1029 		mte_to_node(mn)->ma64.gap[gap] = val;  in mte_set_gap()
1451 	struct maple_node *mn;  in mas_leaf_max_gap()  local
1458 	mn = mas_mn(mas);  in mas_leaf_max_gap()
1459 	slots = ma_slots(mn, mt);  in mas_leaf_max_gap()
1481 	pivots = ma_pivots(mn, mt);  in mas_leaf_max_gap()
1490 	max_piv = ma_data_end(mn, mt, pivots, mas->max) - 1;  in mas_leaf_max_gap()
1693 	struct maple_node *mn = mas_mn(mas);  in mas_replace()  local
1698 	if (ma_is_root(mn)) {  in mas_replace()
1711 		mn->parent = ma_parent_ptr(  in mas_replace()
4795 	struct maple_node *mn;  in mas_prev_nentry()  local
4805 	mn = mas_mn(mas);  in mas_prev_nentry()
4811 	slots = ma_slots(mn, mt);  in mas_prev_nentry()
4812 	pivots = ma_pivots(mn, mt);  in mas_prev_nentry()
4818 	if (unlikely(ma_dead_node(mn))) {  in mas_prev_nentry()
4829 	if (unlikely(ma_dead_node(mn))) {  in mas_prev_nentry()
5163 	struct maple_enode *mn = mas->node;  in mas_fill_gap()  local
5185 	mas->node = mn;  in mas_fill_gap()
6593 static inline void *mas_first_entry(struct ma_state *mas, struct maple_node *mn,  in mas_first_entry()  argument
6610 		slots = ma_slots(mn, mt);  in mas_first_entry()
6611 		pivots = ma_pivots(mn, mt);  in mas_first_entry()
6614 		if (unlikely(ma_dead_node(mn)))  in mas_first_entry()
6617 		mn = mas_mn(mas);  in mas_first_entry()
6623 	slots = ma_slots(mn, mt);  in mas_first_entry()
6625 	if (unlikely(ma_dead_node(mn)))  in mas_first_entry()
6635 	pivots = ma_pivots(mn, mt);  in mas_first_entry()
6639 	if (unlikely(ma_dead_node(mn)))  in mas_first_entry()
6649 	if (likely(!ma_dead_node(mn)))  in mas_first_entry()
6658 	struct maple_enode *p = MAS_NONE, *mn = mas->node;  in mas_dfs_postorder()  local
6665 	if (mte_is_root(mn))  in mas_dfs_postorder()
6668 	mas->node = mn;  in mas_dfs_postorder()