pivots (reference) in projects: linux - OpenGrok search results

Project(s)

Full Search
Definition
Symbol
File Path
History
Type

Searched refs:pivots (Results 1 – 4 of 4) sorted by relevance

/linux/lib/
H A D	maple_tree.c	15 * pivots. In the case of dense nodes, the pivots are implied by the position 18 * In regular B-Tree terms, pivots are called keys. The term pivot is used to 25 * The following illustrates the layout of a range64 nodes slots and pivots. 563 * ma_pivots() - Get a pointer to the maple node pivots. 569 * Return: A pointer to the maple node pivots 614 * @pivots: The pointer to the maple node pivots 618 * Return: The pivot at @piv within the limit of the @pivots array, @mas->max 622 mas_safe_pivot(const struct ma_state mas, unsigned long pivots, in mas_safe_pivot() argument 640 mas_safe_min(struct ma_state * mas,unsigned long * pivots,unsigned char offset) mas_safe_min() argument 815 unsigned long pivots; mt_clear_meta() local 934 unsigned long pivots; mas_descend() local 967 unsigned long pivots; mas_ascend() local 1225 ma_data_end(struct maple_node node,enum maple_type type,unsigned long * pivots,unsigned long max) ma_data_end() argument 1259 unsigned long pivots; mas_data_end() local 1308 ma_leaf_max_gap(struct maple_node mn,enum maple_type mt,unsigned long min,unsigned long max,unsigned long * pivots,void __rcu ** slots) ma_leaf_max_gap() argument 1383 unsigned long pivots; mas_leaf_max_gap() local 1542 unsigned long pivots = ma_pivots(node, type); mas_adopt_children() local 1609 unsigned long pivots; mas_find_child() local 2011 unsigned long pivots; mtree_range_walk() local 2739 unsigned long pivots; mas_root_expand() local 2966 unsigned long pivots; mtree_lookup_walk() local 3014 unsigned long pivots; mas_new_root() local 3866 unsigned long pivots; mas_prev_node() local 3946 unsigned long pivots; mas_prev_slot() local 4027 unsigned long pivots; mas_next_node() local 4113 unsigned long pivots; mas_next_slot() local 4208 unsigned long pivots, gaps; mas_rev_awalk() local 4295 unsigned long gaps, pivots; mas_anode_descend() local 4505 unsigned long pivots; mas_empty_area() local 6653 unsigned long pivots = ma_pivots(node, mt); mas_validate_gaps() local 6774 unsigned long pivots = ma_pivots(mte_to_node(mas->node), type); mas_validate_child_slot() local 6820 unsigned long *pivots = ma_pivots(mas_mn(mas), type); mas_validate_limits() local [all...]
/linux/scripts/gdb/linux/
H A D	mapletree.py	`205 pivots = ma_pivots(node, tp) 209 if pivots[offset] >= mas.index:`
/linux/include/linux/
H A D	maple_tree.h	`497 unsigned long pivots; / mas->node->pivots pointer */ member`
/linux/tools/testing/radix-tree/
H A D	maple.c	420 unsigned long pivots; in mas_node_walk() local 435 pivots = ma_pivots(node, type); in mas_node_walk() 436 max = pivots[0]; in mas_node_walk() 449 max = pivots[offset]; in mas_node_walk() 34970 unsigned long pivots; in mas_dfs_preorder() local 35003 pivots = ma_pivots(mte_to_node(prev), mte_node_type(prev)); in mas_dfs_preorder() 35004 mas->max = mas_safe_pivot(mas, pivots, slot, mte_node_type(prev)); in mas_dfs_preorder() 35005 mas->min = mas_safe_min(mas, pivots, slot); in mas_dfs_preorder() 35075 unsigned long *pivots; in get_vacant_height() local 35092 pivots = ma_pivots(mte_to_node(mas->node), type); in get_vacant_height() [all …]