include/complib/cl_qmap.h

61 *	Quick map implements a binary tree that stores user provided cl_map_item_t
79 *		cl_qmap_t, cl_map_item_t, cl_map_obj_t
126 *	Quick Map, cl_map_item_t
129 /****s* Component Library: Quick Map/cl_map_item_t
131 *	cl_map_item_t
134 *	The cl_map_item_t structure is used by maps to store objects.
136 *	The cl_map_item_t structure should be treated as opaque and should
152 } cl_map_item_t;
209 	cl_map_item_t item;
231 *	Quick Map, cl_qmap_set_obj, cl_qmap_obj, cl_map_item_t
247 	cl_map_item_t root;
248 	cl_map_item_t nil;
285  (*cl_pfn_qmap_apply_t) (IN cl_map_item_t * const p_map_item, IN void *context);
289 *		[in] Pointer to a cl_map_item_t structure.
435 static inline uint64_t cl_qmap_key(IN const cl_map_item_t * const p_item)
490 static inline const cl_map_item_t *cl_qmap_end(IN const cl_qmap_t * const p_map)
528 static inline cl_map_item_t *cl_qmap_head(IN const cl_qmap_t * const p_map)
532 	return ((cl_map_item_t *) p_map->nil.pool_item.list_item.p_next);
564 static inline cl_map_item_t *cl_qmap_tail(IN const cl_qmap_t * const p_map)
568 	return ((cl_map_item_t *) p_map->nil.pool_item.list_item.p_prev);
600 static inline cl_map_item_t *cl_qmap_next(IN const cl_map_item_t * const p_item)
603 	return ((cl_map_item_t *) p_item->pool_item.list_item.p_next);
619 *	cl_map_item_t
632 static inline cl_map_item_t *cl_qmap_prev(IN const cl_map_item_t * const p_item)
635 	return ((cl_map_item_t *) p_item->pool_item.list_item.p_prev);
651 *	cl_map_item_t
664 cl_map_item_t *cl_qmap_insert(IN cl_qmap_t * const p_map,
666 			      IN cl_map_item_t * const p_item);
676 *		[in] Pointer to a cl_map_item_t stucture to insert into the quick map.
688 *	Quick Map, cl_qmap_remove, cl_map_item_t
700 cl_map_item_t *cl_qmap_get(IN const cl_qmap_t * const p_map,
734 cl_map_item_t *cl_qmap_get_next(IN const cl_qmap_t * const p_map,
770 		    IN cl_map_item_t * const p_item);
799 cl_map_item_t *cl_qmap_remove(IN cl_qmap_t * const p_map,