Home
last modified time | relevance | path

Searched refs:mt_slot_count (Results 1 – 2 of 2) sorted by relevance

/linux-6.1.9/lib/
Dmaple_tree.c98 #define mt_slot_count(x) mt_slots[mte_node_type(x)] macro
2393 mas_mab_cp(mast->orig_r, 0, mt_slot_count(mast->orig_r->node), in mast_rebalance_next()
2858 mt_slot_count(mast->orig_r->node), mast->bn, in mast_combine_cp_right()
2883 if (mast->bn->b_end >= mt_slot_count(mast->orig_l->node)) in mast_overflow()
3138 mas_mab_cp(&r_mas, 0, mt_slot_count(r_mas.node), b_node, b_end); in mas_rebalance()
3345 mas_mab_cp(mas, split + skip, mt_slot_count(mas->node) - 1, in mast_fill_bnode()
3409 space = 2 * mt_slot_count(mas->node) - 2; in mas_push_data()
5422 for (offset = 0; offset < mt_slot_count(mas->node); offset++) { in mas_dead_leaves()
6859 for (i = 0; i < mt_slot_count(mte); i++) { in mas_validate_gaps()
6872 for (i = 0; i < mt_slot_count(mte); i++) { in mas_validate_gaps()
/linux-6.1.9/tools/testing/radix-tree/
Dmaple.c982 if (mas_start.offset > mt_slot_count(mas_start.node)) { in check_erase2_testset()
35595 MT_BUG_ON(mt, (mas_data_end(&mas)) != mt_slot_count(mas.node) - 1); in check_spanning_write()