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.c244 static __always_inline bool mas_is_none(const struct ma_state *mas) in mas_is_none() function
1787 if (mas_is_none(tmp_mas)) in mas_topiary_node()
1833 if (mas_is_none(&tmp[i])) in mas_topiary_replace()
1868 if (mas_is_none(&tmp[i])) in mas_topiary_replace()
2946 if (mas_is_none(mas)) in mas_state_walk()
3564 if (unlikely(mas_is_none(mas))) in mas_wr_prealloc_setup()
3665 if (unlikely(mas_is_none(mas) || mas_is_ptr(mas))) in mas_wr_store_type()
4369 } else if (mas_is_none(mas)) { in mas_walk()
4472 if (!unlikely(mas_is_none(mas)) && min == 0) { in mas_sparse_area()
4523 if (mas_is_none(mas) || mas_is_ptr(mas)) in mas_empty_area()
[all …]
H A Dtest_maple_tree.c59 #define mas_is_none(x) ((x)->status == ma_none) macro
2223 if (mas_is_none(&mas)) in next_prev_test()
/linux/tools/testing/radix-tree/
H A Dmaple.c530 if (mas_is_none(mas)) in mas_tree_walk()
562 if (mas_is_none(mas) || mas_is_paused(mas)) in mas_range_load()
35028 } while (!mas_is_none(&mas)); in check_dfs_preorder()
35042 } while (!mas_is_none(&mas)); in check_dfs_preorder()
35054 } while (!mas_is_none(&mas)); in check_dfs_preorder()
35795 while (!mas_is_none(&mas_a) || !mas_is_none(&mas_b)) { in compare_tree()
35797 if (mas_is_none(&mas_a) || mas_is_none(&mas_b)) { in compare_tree()
35871 if (mas_is_none(&mas)) in build_full_tree()