Home
last modified time | relevance | path

Searched refs:mas_is_none (Results 1 – 3 of 3) sorted by relevance

/linux/lib/
H A Dmaple_tree.c282 static __always_inline bool mas_is_none(const struct ma_state *mas) in mas_is_none() function
2439 if (mas_is_none(mas)) in mas_set_split_parent()
2496 if (mas_is_none(mast->l)) in mast_set_split_parents()
2527 if (mas_is_none(tmp_mas)) in mas_topiary_node()
2575 if (mas_is_none(&tmp[i])) in mas_topiary_replace()
2610 if (mas_is_none(&tmp[i])) in mas_topiary_replace()
3614 if (mas_is_none(mas)) in mas_state_walk()
4123 if (unlikely(mas_is_none(mas))) in mas_wr_prealloc_setup()
4215 if (unlikely(mas_is_none(mas) || mas_is_ptr(mas))) in mas_wr_store_type()
4950 } else if (mas_is_none(mas)) { in mas_walk()
[all …]
H A Dtest_maple_tree.c59 #define mas_is_none(x) ((x)->status == ma_none) macro
2164 if (mas_is_none(&mas)) in next_prev_test()
/linux/tools/testing/radix-tree/
H A Dmaple.c959 if (mas_is_none(mas)) in mas_tree_walk()
991 if (mas_is_none(mas) || mas_is_paused(mas)) in mas_range_load()
35426 } while (!mas_is_none(&mas)); in check_dfs_preorder()
35440 } while (!mas_is_none(&mas)); in check_dfs_preorder()
35452 } while (!mas_is_none(&mas)); in check_dfs_preorder()
35992 while (!mas_is_none(&mas_a) || !mas_is_none(&mas_b)) { in compare_tree()
35994 if (mas_is_none(&mas_a) || mas_is_none(&mas_b)) { in compare_tree()
36068 if (mas_is_none(&mas)) in build_full_tree()