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	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)-(uintptr_t)(&((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)
#define	list_for_each_entry_continue(pos, head, member)

Functions
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 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

INIT_LIST_HEAD

#define INIT_LIST_HEAD

(

ptr

)

Value:

          do { \
          (ptr)->next = (ptr); (ptr)->prev = (ptr); \
  } while (0)

Definition at line 24 of file list.h.

list_entry

#define list_entry	(		ptr,
			type,
			member
	)		((type *)((char *)(ptr)-(uintptr_t)(&((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 185 of file list.h.

list_for_each

#define list_for_each	(		pos,
			head
	)

Value:

         for (pos = (head)->next; pos != (head); \
                 pos = 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 193 of file list.h.

list_for_each_entry

#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))

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 221 of file list.h.

list_for_each_entry_continue

#define list_for_each_entry_continue	(		pos,
			head,
			member
	)

Value:

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

list_for_each_entry_continue - iterate over list of given type continuing after existing point @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 246 of file list.h.

list_for_each_entry_safe

#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))

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 233 of file list.h.

list_for_each_prev

#define list_for_each_prev	(		pos,
			head
	)

Value:

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

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

Definition at line 201 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 211 of file list.h.

LIST_HEAD

#define LIST_HEAD

(

name

)

struct list_head name = LIST_HEAD_INIT(name)

Definition at line 21 of file list.h.

LIST_HEAD_INIT

#define LIST_HEAD_INIT

(

name

)

{ &(name), &(name) }

Definition at line 19 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 35 of file list.h.

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

Referenced by list_add(), and list_add_tail().

__list_del()

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

inlinestatic

Definition at line 78 of file list.h.

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

Referenced by list_del(), list_del_init(), list_move(), and list_move_tail().

__list_splice()

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

inlinestatic

Definition at line 138 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;
 }

Referenced by list_splice(), and list_splice_init().

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 53 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 66 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 89 of file list.h.

  {
          __list_del(entry->prev, entry->next);
          entry->next = (void *) 0;
          entry->prev = (void *) 0;
  }

Referenced by __remove_wait_queue(), acpi_bus_receive_event(), acpi_bus_unregister_driver(), acpi_power_off_device(), acpi_power_remove(), chmc_entries_free(), chmc_pmgi_free(), chmc_pmgl_free(), chmc_section_destroy(), chmc_sections_free(), and journal_clear_revoke().

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);
 }

Referenced by ext4_xattr_item_remove(), and finish_wait().

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_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);
 }

Referenced by shader_arb_handle_instruction().

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 157 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 170 of file list.h.

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