Home
last modified time | relevance | path

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

/linux-6.12.1/include/linux/
Dmaple_tree.h41 #define MAPLE_NODE_MASK 255UL macro
/linux-6.12.1/lib/
Dmaple_tree.c291 return (struct maple_node *)((unsigned long)entry & ~MAPLE_NODE_MASK); in mte_to_node()
303 ((unsigned long)entry & ~MAPLE_NODE_MASK); in mte_to_mat()
463 p_type &= MAPLE_NODE_MASK; in mas_parent_type()
510 val &= ~MAPLE_NODE_MASK; /* Clear all node metadata in parent */ in mas_set_parent()
546 (mte_to_node(enode)->parent) & ~MAPLE_NODE_MASK); in mte_parent()
561 parent = (void *)((unsigned long) node->parent & ~MAPLE_NODE_MASK); in ma_dead_node()
6632 ((unsigned long *)slots)[i] &= ~MAPLE_NODE_MASK; in mas_dup_free()
6659 val = (unsigned long)node->parent & MAPLE_NODE_MASK; in mas_copy_node()
6698 val &= MAPLE_NODE_MASK; in mas_dup_alloc()
/linux-6.12.1/tools/testing/radix-tree/
Dmaple.c320 for (i = 1; i < MAPLE_NODE_MASK + 1; i++) { in check_new_node()
392 for (i = 3; i < MAPLE_NODE_MASK * 3; i++) { in check_new_node()
35883 if (((unsigned long)enode_a & MAPLE_NODE_MASK) != in compare_node()
35884 ((unsigned long)enode_b & MAPLE_NODE_MASK)) { in compare_node()
35903 MAPLE_NODE_MASK); in compare_node()
35905 MAPLE_NODE_MASK); in compare_node()
35934 ((unsigned long *)slots_a)[i] &= MAPLE_NODE_MASK; in compare_node()
35935 ((unsigned long *)slots_b)[i] &= MAPLE_NODE_MASK; in compare_node()