#include <stddef.h>
Go to the source code of this file.
|
| #define | LIST_HEAD_INIT(el) { &(el), &(el) } |
| |
| #define | list_entry(el, type, member) container_of(el, type, member) |
| |
| #define | list_for_each(el, head) for(el = (head)->next; el != (head); el = el->next) |
| |
| #define | list_for_each_safe(el, el1, head) |
| |
| #define | list_for_each_prev(el, head) for(el = (head)->prev; el != (head); el = el->prev) |
| |
| #define | list_for_each_prev_safe(el, el1, head) |
| |
◆ list_entry
◆ list_for_each
| #define list_for_each |
( |
|
el, |
|
|
|
head |
|
) |
| for(el = (head)->next; el != (head); el = el->next) |
◆ list_for_each_prev
| #define list_for_each_prev |
( |
|
el, |
|
|
|
head |
|
) |
| for(el = (head)->prev; el != (head); el = el->prev) |
◆ list_for_each_prev_safe
| #define list_for_each_prev_safe |
( |
|
el, |
|
|
|
el1, |
|
|
|
head |
|
) |
| |
Value: for(el = (
head)->prev, el1 = el->prev; el != (
head); \
el = el1, el1 = el->prev)
int const struct list_head const struct list_head struct list_head * head
Definition list_sort.h:13
◆ list_for_each_safe
| #define list_for_each_safe |
( |
|
el, |
|
|
|
el1, |
|
|
|
head |
|
) |
| |
Value: for(el = (
head)->next, el1 = el->next; el != (
head); \
el = el1, el1 = el->next)
◆ LIST_HEAD_INIT
| #define LIST_HEAD_INIT |
( |
|
el | ) |
{ &(el), &(el) } |