list.h File Reference

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
struct	list_head

Macros
#define	prefetch(a)   ((void *)a)
#define	LIST_HEAD_INIT(name)   { &(name), &(name) }
#define	LIST_HEAD(name)    struct list_head name = LIST_HEAD_INIT(name)
#define	list_entry(ptr, type, member)    ((type *)((char *)(ptr)-(char *)(&((type *)0)->member)))
#define	list_for_each(pos, head)
#define	list_for_each_safe(pos, n, head)
#define	list_for_each_prev(pos, head)
#define	list_for_each_entry(pos, head, type, member)
#define	list_for_each_entry_safe(pos, n, head, type, member)

Functions
static void	INIT_LIST_HEAD (struct list_head *list)
static void	__list_add (struct list_head *new, struct list_head *prev, struct list_head *next)
static void	list_add (struct list_head *new, struct list_head *head)
static void	list_add_tail (struct list_head *new, 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 int	list_empty_careful (const 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)

Macro Definition Documentation

list_entry

#define list_entry	(		ptr,
			type,
			member
	)		((type *)((char *)(ptr)-(char *)(&((type *)0)->member)))

list_entry - get the struct for this entry @ptr: the &struct list_head pointer. @type: the type of the struct this is embedded in. @member: the name of the list_struct within the struct.

Definition at line 191 of file list.h.

list_for_each

#define list_for_each	(		pos,
			head
	)

Value:

    for (pos = (head)->next, prefetch(pos->next); pos != (head); \
        pos = pos->next, prefetch(pos->next))

list_for_each - iterate over a list @pos: the &struct list_head to use as a loop counter. @head: the head for your list.

Definition at line 199 of file list.h.

list_for_each_entry

#define list_for_each_entry	(		pos,
			head,
			type,
			member
	)

Value:

        for (pos = list_entry((head)->next, type, member),  \
             prefetch(pos->member.next);            \
         &pos->member != (head);                    \
         pos = list_entry(pos->member.next, type, member),  \
         prefetch(pos->member.next))

list_for_each_entry - iterate over list of given type @pos: the type * to use as a loop counter. @head: the head for your list. @member: the name of the list_struct within the struct.

Definition at line 232 of file list.h.

list_for_each_entry_safe

#define list_for_each_entry_safe	(		pos,
			n,
			head,
			type,
			member
	)

Value:

        for (pos = list_entry((head)->next, type, member),  \
        n = list_entry(pos->member.next, type, member); \
         &pos->member != (head);                    \
         pos = n, n = list_entry(n->member.next, type, member))

list_for_each_entry_safe - iterate over list of given type safe against removal of list entry @pos: the type * to use as a loop counter.
: another type * to use as temporary storage @head: the head for your list. @member: the name of the list_struct within the struct.

Definition at line 248 of file list.h.

list_for_each_prev

#define list_for_each_prev	(		pos,
			head
	)

Value:

    for (pos = (head)->prev, prefetch(pos->prev); pos != (head); \
        pos = pos->prev, prefetch(pos->prev))

list_for_each_prev - iterate over a list in reverse order @pos: the &struct list_head to use as a loop counter. @head: the head for your list.

Definition at line 219 of file list.h.

list_for_each_safe

#define list_for_each_safe	(		pos,
			n,
			head
	)

Value:

    for (pos = (head)->next, n = pos->next; pos != (head); \
        pos = n, n = pos->next)

list_for_each_safe - iterate over a list safe against removal of list entry @pos: the &struct list_head to use as a loop counter.
: another &struct list_head to use as temporary storage @head: the head for your list.

Definition at line 209 of file list.h.

LIST_HEAD

#define LIST_HEAD

(

name

)

struct list_head name = LIST_HEAD_INIT(name)

Definition at line 22 of file list.h.

LIST_HEAD_INIT

#define LIST_HEAD_INIT

(

name

)

{ &(name), &(name) }

Definition at line 20 of file list.h.

prefetch

#define prefetch

(

a

)

((void *)a)

Definition at line 14 of file list.h.

Function Documentation

__list_add()

static void __list_add ( struct list_head *  new, struct list_head *  prev, struct list_head *  next  )

inlinestatic

Definition at line 37 of file list.h.

{
    next->prev = new;
    new->next = next;
    new->prev = prev;
    prev->next = new;
}

__list_del()

static void __list_del ( struct list_head *  prev, struct list_head *  next  )

inlinestatic

Definition at line 80 of file list.h.

{
    next->prev = prev;
    prev->next = next;
}

__list_splice()

static void __list_splice ( struct list_head *  list, struct list_head *  head  )

inlinestatic

Definition at line 144 of file list.h.

{
    struct list_head *first = list->next;
    struct list_head *last = list->prev;
    struct list_head *at = head->next;
 
    first->prev = head;
    head->next = first;
 
    last->next = at;
    at->prev = last;
}

INIT_LIST_HEAD()

static void INIT_LIST_HEAD ( struct list_head *  list )

inlinestatic

Definition at line 25 of file list.h.

{
    list->next = list;
    list->prev = list;
}

list_add()

static void list_add ( struct list_head *  new, struct list_head *  head  )

inlinestatic

list_add - add a new entry @new: new entry to be added @head: list head to add it after

Insert a new entry after the specified head. This is good for implementing stacks.

Definition at line 55 of file list.h.

{
    __list_add(new, head, head->next);
}

list_add_tail()

static void list_add_tail ( struct list_head *  new, struct list_head *  head  )

inlinestatic

list_add_tail - add a new entry @new: new entry to be added @head: list head to add it before

Insert a new entry before the specified head. This is useful for implementing queues.

Definition at line 68 of file list.h.

{
    __list_add(new, head->prev, head);
}

list_del()

static void list_del ( struct list_head *  entry )

inlinestatic

list_del - deletes entry from list. @entry: 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.

Definition at line 91 of file list.h.

{
    __list_del(entry->prev, entry->next);
}

list_del_init()

static void list_del_init ( struct list_head *  entry )

inlinestatic

list_del_init - deletes entry from list and reinitialize it. @entry: the element to delete from the list.

Definition at line 100 of file list.h.

{
    __list_del(entry->prev, entry->next);
    INIT_LIST_HEAD(entry);
}

list_empty()

static int list_empty ( struct list_head *  head )

inlinestatic

list_empty - tests whether a list is empty @head: the list to test.

Definition at line 133 of file list.h.

{
    return head->next == head;
}

list_empty_careful()

static int list_empty_careful ( const struct list_head *  head )

inlinestatic

Definition at line 138 of file list.h.

{
    struct list_head *next = head->next;
    return (next == head) && (next == head->prev);
}

Referenced by finish_wait().

list_move()

static void list_move ( struct list_head *  list, struct list_head *  head  )

inlinestatic

list_move - delete from one list and add as another's head @list: the entry to move @head: the head that will precede our entry

Definition at line 111 of file list.h.

{
    __list_del(list->prev, list->next);
    list_add(list, head);
}

list_move_tail()

static void list_move_tail ( struct list_head *  list, struct list_head *  head  )

inlinestatic

list_move_tail - delete from one list and add as another's tail @list: the entry to move @head: the head that will follow our entry

Definition at line 122 of file list.h.

{
    __list_del(list->prev, list->next);
    list_add_tail(list, head);
}

list_splice()

static void list_splice ( struct list_head *  list, struct list_head *  head  )

inlinestatic

list_splice - join two lists @list: the new list to add. @head: the place to add it in the first list.

Definition at line 163 of file list.h.

{
    if (!list_empty(list))
        __list_splice(list, head);
}

list_splice_init()

static void list_splice_init ( struct list_head *  list, struct list_head *  head  )

inlinestatic

list_splice_init - join two lists and reinitialise the emptied list. @list: the new list to add. @head: the place to add it in the first list.

The list at @list is reinitialised

Definition at line 176 of file list.h.

{
    if (!list_empty(list)) {
        __list_splice(list, head);
        INIT_LIST_HEAD(list);
    }
}