Lines Matching defs:data

50  *	- The AVL specific data structures are physically embedded as fields
51  *	  in the "using" data structures.  To maintain generality the code
53  *	  data structure "void *"s by adding/subtracting the avl_offset.
55  *	- Since the AVL data is always embedded in other structures, there is
57  *	  provided for by the enclosing data structure's semantics. Typically,
110  * Code that deals with binary tree data structures will randomly use
116  * small the data should remain efficiently in cache.
230 	void *data;
237 	data = AVL_NODE2DATA(node, off);
239 		return (data);
241 	return (avl_walk(tree, data, direction));
561  * before (AVL_AFTER, AVL_BEFORE) the data "here".
678 avl_remove(avl_tree_t *tree, void *data)
693 	delete = AVL_DATA2NODE(data, off);