Changes in kernel/generic/include/adt/list.h [07525cd:a74d0ad] in mainline
- File:
-
- 1 edited
-
kernel/generic/include/adt/list.h (modified) (3 diffs)
Legend:
- Unmodified
- Added
- Removed
-
kernel/generic/include/adt/list.h
r07525cd ra74d0ad 67 67 ((type *) (((void *)(link)) - list_link_to_void(&(((type *) NULL)->member)))) 68 68 69 #define list_foreach(list, member, itype, iterator) \ 70 for (itype *iterator = NULL; iterator == NULL; iterator = (itype *) 1) \ 71 for (link_t *_link = (list).head.next; \ 72 iterator = list_get_instance(_link, itype, member), \ 73 _link != &(list).head; _link = _link->next) 69 #define list_foreach(list, iterator) \ 70 for (link_t *iterator = (list).head.next; \ 71 iterator != &(list).head; iterator = iterator->next) 74 72 75 73 #define assert_link_not_used(link) \ … … 206 204 } 207 205 208 /** Get next item in list.209 *210 * @param link Current item link211 * @param list List containing @a link212 *213 * @return Next item or NULL if @a link is the last item.214 */215 static inline link_t *list_next(link_t *link, const list_t *list)216 {217 return (link->next == &list->head) ? NULL : link->next;218 }219 220 /** Get previous item in list.221 *222 * @param link Current item link223 * @param list List containing @a link224 *225 * @return Previous item or NULL if @a link is the first item.226 */227 static inline link_t *list_prev(link_t *link, const list_t *list)228 {229 return (link->prev == &list->head) ? NULL : link->prev;230 }231 232 206 /** Split or concatenate headless doubly-linked circular list 233 207 * … … 296 270 { 297 271 unsigned int cnt = 0; 298 link_t *link; 299 300 link = list_first(list); 301 while (link != NULL) { 272 273 list_foreach(*list, link) { 302 274 if (cnt == n) 303 275 return link; 304 276 305 277 cnt++; 306 link = list_next(link, list);307 278 } 308 279
Note:
See TracChangeset
for help on using the changeset viewer.
