Home
last modified time | relevance | path

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

/linux/lib/
H A Dmaple_tree.c116 #define mt_slot_count(x) mt_slots[mte_node_type(x)] macro
4627 for (offset = 0; offset < mt_slot_count(enode); offset++) { in mte_dead_leaves()
6657 for (i = 0; i < mt_slot_count(mte); i++) { in mas_validate_gaps()
6670 for (i = 0; i < mt_slot_count(mte); i++) { in mas_validate_gaps()
6713 for (i++ ; i < mt_slot_count(mte); i++) { in mas_validate_gaps()
/linux/tools/testing/radix-tree/
H A Dmaple.c629 if (mas_start.offset > mt_slot_count(mas_start.node)) { in check_erase2_testset()
35106 if (mas->end < mt_slot_count(mas->node) - 1) in get_vacant_height()
35418 } while (mas_data_end(&mas) < mt_slot_count(mas.node) - 1); in check_spanning_write()
35431 MT_BUG_ON(mt, (mas_data_end(&mas)) != mt_slot_count(mas.node) - 1); in check_spanning_write()
35529 MT_BUG_ON(mt, mas.end != mt_slot_count(mas.node) - 1); in check_spanning_write()
35533 MT_BUG_ON(mt, mas.end != mt_slot_count(mas.node) - 1); in check_spanning_write()
35564 MT_BUG_ON(mt, mas.end != mt_slot_count(mas.node) - 1); in check_spanning_write()
35569 MT_BUG_ON(mt, mas.end != mt_slot_count(mas.node) - 1); in check_spanning_write()