include/complib/cl_qlist.h

120 	struct _cl_qlist *p_list;
413 static inline void __cl_qlist_reset(IN cl_qlist_t * const p_list)
416 	p_list->end.p_next = &p_list->end;
417 	p_list->end.p_prev = &p_list->end;
419 	p_list->end.p_list = p_list;
423 	p_list->count = 0;
435 static inline void cl_qlist_init(IN cl_qlist_t * const p_list)
438 	CL_ASSERT(p_list);
440 	p_list->state = CL_INITIALIZED;
443 	__cl_qlist_reset(p_list);
448 *	p_list
472 static inline uint32_t cl_qlist_count(IN const cl_qlist_t * const p_list)
475 	CL_ASSERT(p_list);
477 	CL_ASSERT(p_list->state == CL_INITIALIZED);
478 	return ((uint32_t) p_list->count);
484 *	p_list
504 static inline boolean_t cl_is_qlist_empty(IN const cl_qlist_t * const p_list)
507 	CL_ASSERT(p_list);
509 	CL_ASSERT(p_list->state == CL_INITIALIZED);
511 	return (!cl_qlist_count(p_list));
516 *	p_list
544 	CL_ASSERT(p_list_item->p_list->state == CL_INITIALIZED);
582 	CL_ASSERT(p_list_item->p_list->state == CL_INITIALIZED);
614 static inline cl_list_item_t *cl_qlist_head(IN const cl_qlist_t * const p_list)
617 	CL_ASSERT(p_list);
619 	CL_ASSERT(p_list->state == CL_INITIALIZED);
621 	return (cl_qlist_next(&p_list->end));
626 *	p_list
652 static inline cl_list_item_t *cl_qlist_tail(IN const cl_qlist_t * const p_list)
655 	CL_ASSERT(p_list);
657 	CL_ASSERT(p_list->state == CL_INITIALIZED);
659 	return (cl_qlist_prev(&p_list->end));
664 *	p_list
690 						 const p_list)
693 	CL_ASSERT(p_list);
695 	CL_ASSERT(p_list->state == CL_INITIALIZED);
697 	return (&p_list->end);
702 *	p_list
732 cl_qlist_insert_head(IN cl_qlist_t * const p_list,
736 	CL_ASSERT(p_list);
740 	CL_ASSERT(p_list->state == CL_INITIALIZED);
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);
757 	p_list->count++;
762 *	p_list
793 cl_qlist_insert_tail(IN cl_qlist_t * const p_list,
797 	CL_ASSERT(p_list);
801 	CL_ASSERT(p_list->state == CL_INITIALIZED);
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);
821 	p_list->count++;
826 *	p_list
933 cl_qlist_insert_array_head(IN cl_qlist_t * const p_list,
938 *	p_list
958 *	to the head of the quick list specified by the p_list parameter,
982 cl_qlist_insert_array_tail(IN cl_qlist_t * const p_list,
987 *	p_list
1007 *	to the tail of the quick list specified by the p_list parameter,
1031 cl_qlist_insert_prev(IN cl_qlist_t * const p_list,
1036 	CL_ASSERT(p_list);
1042 	CL_ASSERT(p_list->state == CL_INITIALIZED);
1050 	CL_ASSERT(p_new_item->p_list != p_list);
1053 	p_new_item->p_list = p_list;
1058 	p_list->count++;
1063 *	p_list
1095 cl_qlist_insert_next(IN cl_qlist_t * const p_list,
1100 	CL_ASSERT(p_list);
1106 	CL_ASSERT(p_list->state == CL_INITIALIZED);
1114 	CL_ASSERT(p_new_item->p_list != p_list);
1117 	p_new_item->p_list = p_list;
1122 	p_list->count++;
1127 *	p_list
1159 static inline cl_list_item_t *cl_qlist_remove_head(IN cl_qlist_t * const p_list)
1164 	CL_ASSERT(p_list);
1166 	CL_ASSERT(p_list->state == CL_INITIALIZED);
1168 	p_item = cl_qlist_head(p_list);
1170 	CL_ASSERT(p_item->p_list == p_list);
1172 	if (p_item == cl_qlist_end(p_list))
1177 	p_item->p_list = NULL;
1182 	p_list->count--;
1189 *	p_list
1212 static inline cl_list_item_t *cl_qlist_remove_tail(IN cl_qlist_t * const p_list)
1217 	CL_ASSERT(p_list);
1219 	CL_ASSERT(p_list->state == CL_INITIALIZED);
1221 	p_item = cl_qlist_tail(p_list);
1223 	CL_ASSERT(p_item->p_list == p_list);
1225 	if (p_item == cl_qlist_end(p_list))
1230 	p_item->p_list = NULL;
1235 	p_list->count--;
1242 *	p_list
1265 cl_qlist_remove_item(IN cl_qlist_t * const p_list,
1269 	CL_ASSERT(p_list);
1273 	CL_ASSERT(p_list->state == CL_INITIALIZED);
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;
1287 	p_list->count--;
1292 *	p_list
1319 static inline void cl_qlist_remove_all(IN cl_qlist_t * const p_list)
1325 	CL_ASSERT(p_list);
1327 	CL_ASSERT(p_list->state == CL_INITIALIZED);
1328 	p_list_item = cl_qlist_head(p_list);
1329 	while (p_list_item != cl_qlist_end(p_list)) {
1331 		cl_qlist_prev(p_list_item)->p_list = NULL;
1335 	__cl_qlist_reset(p_list);
1340 *	p_list
1362 cl_is_item_in_qlist(IN const cl_qlist_t * const p_list,
1366 *	p_list
1391 cl_list_item_t *cl_qlist_find_next(IN const cl_qlist_t * const p_list,
1397 *	p_list
1443 cl_list_item_t *cl_qlist_find_prev(IN const cl_qlist_t * const p_list,
1449 *	p_list
1496 						      const p_list,
1503 	CL_ASSERT(p_list);
1505 	CL_ASSERT(p_list->state == CL_INITIALIZED);
1509 	return (cl_qlist_find_next(p_list, cl_qlist_end(p_list), pfn_func,
1515 *	p_list
1558 						      const p_list,
1565 	CL_ASSERT(p_list);
1567 	CL_ASSERT(p_list->state == CL_INITIALIZED);
1571 	return (cl_qlist_find_prev(p_list, cl_qlist_end(p_list), pfn_func,
1577 *	p_list
1620 cl_qlist_apply_func(IN const cl_qlist_t * const p_list,
1625 *	p_list