Lines Matching full:list

38  * @brief initialize a list object
43  * @brief initialize a list
45  * @param l list to be initialized
53  * @brief insert a node after a list
55  * @param l list to insert it
68  * @brief insert a node before a list
71  * @param l list to insert it
83  * @brief remove node from list.
84  * @param n the node to remove from the list.
95  * @brief tests whether a list is empty
96  * @param l the list to test.
104  * @brief get the list length
105  * @param l the list to get.
124  * @param member the name of list in structure
130  * rt_list_for_each - iterate over a list
132  * @head:	the head for your list.
138  * rt_list_for_each_safe - iterate over a list safe against removal of list entry
141  * @head:	the head for your list.
148  * rt_list_for_each_entry  -   iterate over list of given type
150  * @head:   the head for your list.
159  * rt_list_for_each_entry_safe - iterate over list of given type safe against removal of list entry
162  * @head:   the head for your list.
172  * rt_list_first_entry - get the first element from a list
173  * @ptr:    the list head to take the element from.
177  * Note, that list is expected to be not empty.
185  * @brief initialize a single list
187  * @param l the single list to be initialized
215     const rt_slist_t *list = l->next;  in rt_slist_len()  local
216     while (list != RT_NULL)  in rt_slist_len()
218         list = list->next;  in rt_slist_len()
260  * @brief get the struct for this single list node
263  * @param member the name of list in structure
269  * rt_slist_for_each - iterate over a single list
271  * @head:   the head for your single list.
277  * rt_slist_for_each_entry  -   iterate over single list of given type
279  * @head:   the head for your single list.