Home
last modified time | relevance | path

Searched refs:pivots (Results 1 - 3 of 3) sorted by relevance

/kernel/linux/linux-6.6/lib/
H A Dmaple_tree.c13 * pivots. In the case of dense nodes, the pivots are implied by the position
16 * In regular B-Tree terms, pivots are called keys. The term pivot is used to
23 * The following illustrates the layout of a range64 nodes slots and pivots.
638 * ma_pivots() - Get a pointer to the maple node pivots.
644 * Return: A pointer to the maple node pivots
714 * @pivots: The pointer to the maple node pivots
718 * Return: The pivot at @piv within the limit of the @pivots array, @mas->max
722 mas_safe_pivot(const struct ma_state *mas, unsigned long *pivots, in mas_safe_pivot() argument
740 mas_safe_min(struct ma_state *mas, unsigned long *pivots, unsigned char offset) mas_safe_min() argument
914 unsigned long *pivots; mt_clear_meta() local
1035 unsigned long *pivots; mas_descend() local
1086 unsigned long *pivots; mas_ascend() local
1428 ma_data_end(struct maple_node *node, enum maple_type type, unsigned long *pivots, unsigned long max) ma_data_end() argument
1465 unsigned long *pivots; mas_data_end() local
1497 unsigned long *pivots; mas_leaf_max_gap() local
1710 unsigned long *pivots = ma_pivots(node, type); mas_adopt_children() local
1775 unsigned long *pivots; global() variable
1949 unsigned long *pivots, *gaps; mas_mab_cp() local
2000 mas_leaf_set_meta(struct ma_state *mas, struct maple_node *node, unsigned long *pivots, enum maple_type mt, unsigned char end) mas_leaf_set_meta() argument
2030 unsigned long *pivots = ma_pivots(node, mt); mab_mas_cp() local
2785 unsigned long *pivots; mtree_range_walk() local
3512 unsigned long *pivots; mas_root_expand() local
3726 unsigned long *pivots; mtree_lookup_walk() local
3782 unsigned long *pivots; mas_new_root() local
4365 unsigned long *pivots; mas_prev_node() local
4446 unsigned long *pivots; mas_prev_slot() local
4523 unsigned long *pivots; mas_next_node() local
4607 unsigned long *pivots; mas_next_slot() local
4726 unsigned long *pivots, *gaps; mas_rev_awalk() local
4813 unsigned long *gaps, *pivots; mas_anode_descend() local
5027 unsigned long *pivots; mas_empty_area() local
6932 unsigned long *pivots = ma_pivots(node, mt); mas_validate_gaps() local
7053 unsigned long *pivots = ma_pivots(mte_to_node(mas->node), type); mas_validate_child_slot() local
7099 unsigned long *pivots = ma_pivots(mas_mn(mas), type); mas_validate_limits() local
[all...]
/kernel/linux/linux-6.6/include/linux/
H A Dmaple_tree.h96 * In regular B-Tree terms, pivots are called keys. The term pivot is used to
274 * pivots, and a parent pointer.
401 unsigned long *pivots; /* mas->node->pivots pointer */ member
/kernel/linux/linux-6.6/tools/testing/radix-tree/
H A Dmaple.c821 unsigned long *pivots; in mas_node_walk() local
836 pivots = ma_pivots(node, type); in mas_node_walk()
837 max = pivots[0]; in mas_node_walk()
850 max = pivots[offset]; in mas_node_walk()
35337 unsigned long *pivots; mas_dfs_preorder() local
[all...]

Completed in 23 milliseconds