Lines Matching defs:list
17 * copyright notice, this list of conditions and the following
21 * copyright notice, this list of conditions and the following
38 * Declaration of list.
61 * List stores objects in a doubly linked list.
63 * Unlike quick list, users pass pointers to the object being stored, rather
64 * than to a cl_list_item_t structure. Insertion operations on a list can
67 * Use quick list in situations where insertion failures cannot be tolerated.
71 * The list functions operates on a cl_list_t structure which should be
119 cl_qlist_t list;
124 * list
125 * Quick list of items stored in the list.
128 * Quick pool of list objects for storing objects in the quick list.
139 * Iterator type used to walk a list.
146 * The iterator should be treated as opaque to prevent corrupting the list.
159 * used to iterate objects in a list.
168 * [in] Pointer to an object stored in a list.
191 * used to find objects in a list.
200 * [in] Pointer to an object stored in a list.
206 * Return CL_SUCCESS if the desired item was found. This stops list iteration.
208 * Return CL_NOT_FOUND to continue the list iteration.
224 * The cl_list_construct function constructs a list.
241 * list function except cl_list_init.
252 * The cl_is_list_inited function returns whether a list was
263 * list is initialized too.
275 * TRUE if the list was initialized successfully.
280 * Allows checking the state of a list to determine if invoking
292 * The cl_list_init function initializes a list for use.
309 * CL_SUCCESS if the list was initialized successfully.
314 * The list will always be able to store at least as many items as specified
327 * The cl_list_destroy function destroys a list.
341 * cl_list_destroy does not affect any of the objects stored in the list,
343 * should not be attempted on the list after cl_list_destroy is invoked.
348 * In debug builds, cl_list_destroy asserts if the list is not empty.
359 * The cl_is_list_empty function returns whether a list is empty.
367 return (cl_is_qlist_empty(&p_list->list));
376 * TRUE if the specified list is empty.
389 * The cl_list_insert_head function inserts an object at the head of a list.
401 /* Get a list item to add to the list. */
407 cl_qlist_insert_head(&p_list->list, &p_pool_obj->pool_item.list_item);
417 * [in] Pointer to an object to insert into the list.
425 * Inserts the specified object at the head of the list. List insertion
440 * The cl_list_insert_tail function inserts an object at the tail of a list.
452 /* Get a list item to add to the list. */
458 cl_qlist_insert_tail(&p_list->list, &p_pool_obj->pool_item.list_item);
468 * [in] Pointer to an object to insert into the list.
476 * Inserts the specified object at the tail of the list. List insertion
492 * at the head of a list.
512 * [in] Size of the objects added to the list. This is the stride in the
521 * Inserts all objects in the array to the head of the list, preserving the
537 * at the tail of a list.
557 * [in] Size of the objects added to the list. This is the stride in the
566 * Inserts all objects in the array to the tail of the list, preserving the
581 * The cl_list_insert_next function inserts an object in a list after
596 /* Get a list item to add to the list. */
602 cl_qlist_insert_next(&p_list->list, (cl_list_item_t *) iterator,
617 * [in] Pointer to an object to insert into the list.
634 * The cl_list_insert_prev function inserts an object in a list before
649 /* Get a list item to add to the list. */
655 cl_qlist_insert_prev(&p_list->list, (cl_list_item_t *) iterator,
670 * [in] Pointer to an object to insert into the list.
687 * The cl_list_remove_head function removes an object from the head of a list.
699 /* See if the list is empty. */
700 if (cl_is_qlist_empty(&p_list->list))
703 /* Get the item at the head of the list. */
704 p_pool_obj = (cl_pool_obj_t *) cl_qlist_remove_head(&p_list->list);
719 * Returns the pointer to the object formerly at the head of the list.
721 * NULL if the list was empty.
733 * The cl_list_remove_tail function removes an object from the tail of a list.
744 /* See if the list is empty. */
745 if (cl_is_qlist_empty(&p_list->list))
748 /* Get the item at the head of the list. */
749 p_pool_obj = (cl_pool_obj_t *) cl_qlist_remove_tail(&p_list->list);
751 /* Place the list item back into the pool. */
763 * Returns the pointer to the object formerly at the tail of the list.
765 * NULL if the list was empty.
777 * The cl_list_remove_all function removes all objects from a list,
787 /* Return all the list items to the pool. */
788 cl_qpool_put_list(&p_list->list_item_pool, &p_list->list);
809 * The cl_list_remove_object function removes a specific object from a list.
822 * [in] Pointer to an object to remove from the list.
827 * CL_NOT_FOUND if the object was not found in the list.
830 * Removes the first occurrence of an object from a list.
842 * The cl_list_remove_item function removes an object from the head of a list.
852 cl_qlist_remove_item(&p_list->list, (cl_list_item_t *) iterator);
854 /* Place the list item back into the pool. */
881 * is stored in a list.
894 * [in] Pointer to an object stored in a list.
897 * TRUE if p_object was found in the list.
910 * The cl_list_end function returns returns the list iterator for
911 * the end of a list.
920 return (cl_qlist_end(&p_list->list));
930 * cl_list_iterator_t for the end of the list.
946 * The cl_list_head function returns returns a list iterator for
947 * the head of a list.
956 return (cl_qlist_head(&p_list->list));
966 * cl_list_iterator_t for the head of the list.
968 * cl_list_iterator_t for the end of the list if the list is empty.
984 * The cl_list_tail function returns returns a list iterator for
985 * the tail of a list.
994 return (cl_qlist_tail(&p_list->list));
1004 * cl_list_iterator_t for the tail of the list.
1006 * cl_list_iterator_t for the end of the list if the list is empty.
1023 * The cl_list_next function returns a list iterator for the object stored
1024 * in a list after the object associated with a given list iterator.
1047 * the list iterator specified by the iterator parameter.
1049 * cl_list_iterator_t for the end of the list if the list is empty.
1065 * The cl_list_prev function returns a list iterator for the object stored
1066 * in a list before the object associated with a given list iterator.
1089 * the list iterator specified by the iterator parameter.
1091 * cl_list_iterator_t for the end of the list if the list is empty.
1108 * with a list iterator.
1126 * Pointer to the object associated with the list iterator specified
1139 * to search for an object starting from the head of a list.
1163 * Returns the iterator for the list end otherwise.
1167 * the list. The iterator for the object is returned when the function
1169 * specified by the pfn_func parameter must not perform any list
1170 * operations as these would corrupt the list.
1183 * to search for an object starting from the tail of a list.
1207 * Returns the iterator for the list end otherwise.
1211 * the list. The iterator for the object is returned when the function
1213 * specified by the pfn_func parameter must not perform any list
1214 * operations as these would corrupt the list.
1227 * object stored in a list.
1241 * [in] Function invoked for every item in a list.
1253 * object stored in the list, starting from the head. The function specified
1254 * by the pfn_func parameter must not perform any list operations as these
1255 * would corrupt the list.
1267 * The cl_list_count function returns the number of objects stored in a list.
1276 return (cl_qlist_count(&p_list->list));
1285 * Number of objects stored in the specified list.