Namespaces | |
namespace | rpa |
Classes | |
struct | list_head |
class | rpa::rpa_list_head< Struct, Member > |
struct | rpa::rpa_list_head< Struct, Member >::iterator |
Defines | |
#define | _LVM_H_INCLUDE |
#define | LIST_HEAD_INIT(name) { &(name), &(name) } |
#define | LIST_HEAD(name) struct list_head name = LIST_HEAD_INIT(name) |
#define | INIT_LIST_HEAD(ptr) |
#define | list_entry(ptr, type, member) ((type *)((char *)(ptr)-(unsigned long)(&((type *)0)->member))) |
#define | list_for_each(pos, head) |
#define | list_for_each_prev(pos, head) |
#define | list_for_each_safe(pos, n, head) |
#define | list_for_each_entry(pos, head, member) |
#define | list_for_each_entry_safe(pos, n, head, member) |
Functions | |
static void | __list_add (struct list_head *new_lh, struct list_head *prev, struct list_head *next) |
static void | list_add (struct list_head *new_lh, struct list_head *head) |
static void | list_add_tail (struct list_head *new_lh, struct list_head *head) |
static void | __list_del (struct list_head *prev, struct list_head *next) |
static void | list_del (struct list_head *entry) |
static void | list_del_init (struct list_head *entry) |
static void | list_move (struct list_head *list, struct list_head *head) |
static void | list_move_tail (struct list_head *list, struct list_head *head) |
static int | list_empty (struct list_head *head) |
static void | __list_splice (struct list_head *list, struct list_head *head) |
static void | list_splice (struct list_head *list, struct list_head *head) |
static void | list_splice_init (struct list_head *list, struct list_head *head) |
#define _LVM_H_INCLUDE |
Because of this: if defined(__KERNEL__) || defined(_LVM_H_INCLUDE)
#define INIT_LIST_HEAD | ( | ptr | ) |
Value:
do { \ (ptr)->next = (ptr); (ptr)->prev = (ptr); \ } while (0)
#define list_entry | ( | ptr, | |||
type, | |||||
member | ) | ((type *)((char *)(ptr)-(unsigned long)(&((type *)0)->member))) |
list_entry - get the struct for this entry : the &struct list_head pointer. : the type of the struct this is embedded in. : the name of the list_struct within the struct.
#define list_for_each | ( | pos, | |||
head | ) |
Value:
for (pos = (head)->next; pos != (head); \
pos = pos->next)
#define list_for_each_entry | ( | pos, | |||
head, | |||||
member | ) |
Value:
for (pos = list_entry((head)->next, typeof(*pos), member); \ &pos->member != (head); \ pos = list_entry(pos->member.next, typeof(*pos), member))
#define list_for_each_entry_safe | ( | pos, | |||
n, | |||||
head, | |||||
member | ) |
Value:
for (pos = list_entry((head)->next, typeof(*pos), member), \ n = list_entry(pos->member.next, typeof(*pos), member); \ &pos->member != (head); \ pos = n, n = list_entry(n->member.next, typeof(*n), member))
#define list_for_each_prev | ( | pos, | |||
head | ) |
Value:
for (pos = (head)->prev; pos != (head); \
pos = pos->prev)
#define list_for_each_safe | ( | pos, | |||
n, | |||||
head | ) |
#define LIST_HEAD | ( | name | ) | struct list_head name = LIST_HEAD_INIT(name) |
#define LIST_HEAD_INIT | ( | name | ) | { &(name), &(name) } |
static void __list_add | ( | struct list_head * | new_lh, | |
struct list_head * | prev, | |||
struct list_head * | next | |||
) | [inline, static] |
list_add - add a new entry : new entry to be added : list head to add it after
Insert a new entry after the specified head. This is good for implementing stacks.
list_add_tail - add a new entry : new entry to be added : list head to add it before
Insert a new entry before the specified head. This is useful for implementing queues.
static void list_del | ( | struct list_head * | entry | ) | [inline, static] |
list_del - deletes entry from list. : the element to delete from the list. Note: list_empty on entry does not return true after this, the entry is in an undefined state.
static void list_del_init | ( | struct list_head * | entry | ) | [inline, static] |
list_del_init - deletes entry from list and reinitialize it. : the element to delete from the list.
static int list_empty | ( | struct list_head * | head | ) | [inline, static] |
list_empty - tests whether a list is empty : the list to test.
list_move - delete from one list and add as another's head : the entry to move : the head that will precede our entry
list_move_tail - delete from one list and add as another's tail : the entry to move : the head that will follow our entry
list_splice - join two lists : the new list to add. : the place to add it in the first list.
list_splice_init - join two lists and reinitialise the emptied list. : the new list to add. : the place to add it in the first list.
The list at is reinitialised