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_entry

Macros
#define	list_container(entry, type, field)   ((type*)((const char*)(entry) - (const char*)(&((type*)0)->field)))
#define	list_for_each(entry, head)   for (entry = (head)->next; entry != (head); entry = entry->next)
#define	list_for_each_tmp(entry, tmp, head)
#define	list_for_each_reverse(entry, head)   for (entry = (head)->prev; entry != (head); entry = entry->prev)
#define	list_for_each_reverse_tmp(entry, tmp, head)

Typedefs
typedef int(*	list_compare_fn) (const struct list_entry *, const void *)

Functions
static void	list_init (struct list_entry *head)
static int	list_empty (struct list_entry *head)
static void	list_add (struct list_entry *entry, struct list_entry *prev, struct list_entry *next)
static void	list_add_head (struct list_entry *head, struct list_entry *entry)
static void	list_add_tail (struct list_entry *head, struct list_entry *entry)
static void	list_remove (struct list_entry *entry)
static struct list_entry *	list_search (const struct list_entry *head, const void *value, list_compare_fn compare)

Macro Definition Documentation

list_container

#define list_container	(		entry,
			type,
			field
	)		((type*)((const char*)(entry) - (const char*)(&((type*)0)->field)))

Definition at line 33 of file list.h.

list_for_each

#define list_for_each	(		entry,
			head
	)		for (entry = (head)->next; entry != (head); entry = entry->next)

Definition at line 36 of file list.h.

list_for_each_reverse

#define list_for_each_reverse	(		entry,
			head
	)		for (entry = (head)->prev; entry != (head); entry = entry->prev)

Definition at line 43 of file list.h.

list_for_each_reverse_tmp

#define list_for_each_reverse_tmp	(		entry,
			tmp,
			head
	)

Value:

for (entry = (head)->next, tmp = entry->next; entry != (head); \
        entry = tmp, tmp = entry->next)

Definition at line 46 of file list.h.

list_for_each_tmp

#define list_for_each_tmp	(		entry,
			tmp,
			head
	)

Value:

for (entry = (head)->next, tmp = entry->next; entry != (head); \
        entry = tmp, tmp = entry->next)

Definition at line 39 of file list.h.

Typedef Documentation

list_compare_fn

typedef int(* list_compare_fn) (const struct list_entry *, const void *)

Definition at line 100 of file list.h.

Function Documentation

list_add()

static void list_add ( struct list_entry *  entry, struct list_entry *  prev, struct list_entry *  next  )

static

Definition at line 64 of file list.h.

{
    /* assert(prev->next == next && next->prev == prev); */
    entry->prev = prev;
    entry->next = next;
    prev->next = entry;
    next->prev = entry;
}

Referenced by __add_wait_queue(), insert_revoke_hash(), layout_ordered_insert(), list_add_head(), and list_add_tail().

list_add_head()

static void list_add_head ( struct list_entry *  head, struct list_entry *  entry  )

static

Definition at line 76 of file list.h.

{
    list_add(entry, head, head->next);
}

list_add_tail()

static void list_add_tail ( struct list_entry *  head, struct list_entry *  entry  )

static

Definition at line 83 of file list.h.

{
    list_add(entry, head->prev, head);
}

list_empty()

static int list_empty ( struct list_entry *  head )

static

Definition at line 58 of file list.h.

{
    return head->next == head;
}

Referenced by list_remove().

list_init()

static void list_init ( struct list_entry *  head )

static

Definition at line 51 of file list.h.

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

Referenced by list_remove().

list_remove()

static void list_remove ( struct list_entry *  entry )

static

Definition at line 90 of file list.h.

{
    if (!list_empty(entry)) {
        entry->next->prev = entry->prev;
        entry->prev->next = entry->next;
        list_init(entry);
    }
}

list_search()

static struct list_entry* list_search ( const struct list_entry *  head, const void *  value, list_compare_fn  compare  )

static

Definition at line 102 of file list.h.

{
    struct list_entry *entry;
    list_for_each(entry, head)
        if (compare(entry, value) == 0)
            return entry;
    return NULL;
}

Referenced by cache_insert(), cache_lookup(), deleg_open_find(), delegation_find(), file_device_find_or_create(), find_superblock(), is_dst_name_opened(), layout_entry_find(), nfs41_server_find_or_create(), open_unlock_delegate(), open_unlock_remove(), pnfs_file_device_notify(), root_client_find(), root_client_find_addrs(), and server_entry_find().