Searched refs:ma_dead_node (Results 1 – 3 of 3) sorted by relevance
130 def ma_dead_node(node): function133 … .format(ma_dead_node.__name__, maple_node_type.get_type().pointer(), node.type))156 return ma_dead_node(node)217 if ma_dead_node(node) is True:
499 static __always_inline bool ma_dead_node(const struct maple_node *node) in ma_dead_node() function520 return ma_dead_node(node); in mte_dead_node()1017 if (unlikely(ma_dead_node(a_node))) in mas_ascend()1030 if (unlikely(ma_dead_node(a_node))) in mas_ascend()1338 if (unlikely(ma_dead_node(node))) in mas_data_end()2119 if (unlikely(ma_dead_node(node))) in mtree_range_walk()3049 if (unlikely(ma_dead_node(node))) in mtree_lookup_walk()3934 if (unlikely(ma_dead_node(node))) { in mas_rewalk_if_dead()3988 if (unlikely(ma_dead_node(node))) in mas_prev_node()3995 if (unlikely(ma_dead_node(node))) in mas_prev_node()[all …]
428 if (unlikely(ma_dead_node(node))) in mas_node_walk()437 if (unlikely(ma_dead_node(node))) in mas_node_walk()450 if (unlikely(ma_dead_node(node))) in mas_node_walk()500 if (unlikely(ma_dead_node(node))) in mas_descend_walk()