include/complib/cl_qlist.h

213  (*cl_pfn_qlist_apply_t) (IN cl_list_item_t * const p_list_item,
217 *	p_list_item
246     (*cl_pfn_qlist_find_t) (IN const cl_list_item_t * const p_list_item,
250 *	p_list_item
283 __cl_primitive_insert(IN cl_list_item_t * const p_list_item,
287 	CL_ASSERT(p_list_item);
291 	p_new_item->p_next = p_list_item;
292 	p_new_item->p_prev = p_list_item->p_prev;
293 	p_list_item->p_prev = p_new_item;
299 *	p_list_item
319 static inline void __cl_primitive_remove(IN cl_list_item_t * const p_list_item)
322 	CL_ASSERT(p_list_item);
325 	p_list_item->p_next->p_prev = p_list_item->p_prev;
327 	p_list_item->p_prev->p_next = p_list_item->p_next;
331 	if (p_list_item != p_list_item->p_next) {
332 		p_list_item->p_next = NULL;
333 		p_list_item->p_prev = NULL;
340 *	p_list_item
539 					    const p_list_item)
542 	CL_ASSERT(p_list_item);
544 	CL_ASSERT(p_list_item->p_list->state == CL_INITIALIZED);
547 	return (p_list_item->p_next);
552 *	p_list_item
557 *	the p_list_item parameter in the quick list.
559 *	Pointer to the list end if p_list_item was at the tail of the list.
577 					    const p_list_item)
580 	CL_ASSERT(p_list_item);
582 	CL_ASSERT(p_list_item->p_list->state == CL_INITIALIZED);
585 	return (p_list_item->p_prev);
590 *	p_list_item
595 *	the p_list_item parameter in the quick list.
597 *	Pointer to the list end if p_list_item was at the tail of the list.
733 		     IN cl_list_item_t * const p_list_item)
738 	CL_ASSERT(p_list_item);
748 	CL_ASSERT(p_list_item->p_list != p_list);
751 	p_list_item->p_list = p_list;
755 	__cl_primitive_insert(cl_qlist_head(p_list), p_list_item);
765 *	p_list_item
794 		     IN cl_list_item_t * const p_list_item)
799 	CL_ASSERT(p_list_item);
809 	CL_ASSERT(p_list_item->p_list != p_list);
812 	p_list_item->p_list = p_list;
819 	__cl_primitive_insert(&p_list->end, p_list_item);
829 *	p_list_item
1032 		     IN cl_list_item_t * const p_list_item,
1038 	CL_ASSERT(p_list_item);
1056 	__cl_primitive_insert(p_list_item, p_new_item);
1066 *	p_list_item
1076 *	Inserts the new list item before the list item specified by p_list_item.
1096 		     IN cl_list_item_t * const p_list_item,
1102 	CL_ASSERT(p_list_item);
1120 	__cl_primitive_insert(cl_qlist_next(p_list_item), p_new_item);
1130 *	p_list_item
1140 *	Inserts the new list item after the list item specified by p_list_item.
1141 *	The list item specified by p_list_item must be in the quick list.
1266 		     IN cl_list_item_t * const p_list_item)
1271 	CL_ASSERT(p_list_item);
1275 	CL_ASSERT(p_list_item->p_list == p_list);
1277 	if (p_list_item == cl_qlist_end(p_list))
1282 	p_list_item->p_list = NULL;
1285 	__cl_primitive_remove(p_list_item);
1295 *	p_list_item
1302 *	Removes the list item pointed to by the p_list_item parameter from
1322 	cl_list_item_t *p_list_item;
1328 	p_list_item = cl_qlist_head(p_list);
1329 	while (p_list_item != cl_qlist_end(p_list)) {
1330 		p_list_item = cl_qlist_next(p_list_item);
1331 		cl_qlist_prev(p_list_item)->p_list = NULL;
1363 		    IN const cl_list_item_t * const p_list_item);
1369 *	p_list_item
1392 				   IN const cl_list_item_t * const p_list_item,
1400 *	p_list_item
1416 *	p_list_item if not found.
1444 				   IN const cl_list_item_t * const p_list_item,
1452 *	p_list_item
1468 *	p_list_item if not found.