list.h File Reference

Linked lists. More...

#include <stddef.h>
#include <assert.h>

Go to the source code of this file.

Data Structures
struct	list_head
	A doubly-linked list entry (or list head) More...

Macros
#define	LIST_HEAD_INIT(list)   { &(list), &(list) }
	Initialise a static list head. More...
#define	LIST_HEAD(list)   struct list_head list = LIST_HEAD_INIT ( list )
	Declare a static list head. More...
#define	INIT_LIST_HEAD(list)
	Initialise a list head. More...
#define	list_check(list)
	Check a list entry or list head is valid. More...
#define	list_add(new, head)
	Add a new entry to the head of a list. More...
#define	list_add_tail(new, head)
	Add a new entry to the tail of a list. More...
#define	list_del(list)
	Delete an entry from a list. More...
#define	list_empty(list)
	Test whether a list is empty. More...
#define	list_is_singular(list)
	Test whether a list has just one entry. More...
#define	list_is_last(list, head)
	Test whether an entry is the last entry in list. More...
#define	list_cut_position(new, list, entry)
	Cut a list into two. More...
#define	list_splice(list, entry)
	Move all entries from one list into another list. More...
#define	list_splice_tail(list, entry)
	Move all entries from one list into another list. More...
#define	list_splice_init(list, entry)
	Move all entries from one list into another list and reinitialise empty list. More...
#define	list_splice_tail_init(list, entry)
	Move all entries from one list into another list and reinitialise empty list. More...
#define	list_entry(list, type, member)
	Get the container of a list entry. More...
#define	list_first_entry(list, type, member)
	Get the container of the first entry in a list. More...
#define	list_last_entry(list, type, member)
	Get the container of the last entry in a list. More...
#define	list_next_entry(pos, head, member)
	Get the container of the next entry in a list. More...
#define	list_prev_entry(pos, head, member)
	Get the container of the previous entry in a list. More...
#define	list_is_first_entry(entry, head, member)   ( (head)->next == &(entry)->member )
	Test if entry is first in a list. More...
#define	list_is_last_entry(entry, head, member)   ( (head)->prev == &(entry)->member )
	Test if entry is last in a list. More...
#define	list_is_head_entry(entry, head, member)   ( (head) == &(entry)->member )
	Test if entry is the list head. More...
#define	list_for_each(pos, head)
	Iterate over a list. More...
#define	list_for_each_entry(pos, head, member)
	Iterate over entries in a list. More...
#define	list_for_each_entry_reverse(pos, head, member)
	Iterate over entries in a list in reverse order. More...
#define	list_for_each_entry_safe(pos, tmp, head, member)
	Iterate over entries in a list, safe against deletion of the current entry. More...
#define	list_for_each_entry_continue(pos, head, member)
	Iterate over entries in a list, starting after current position. More...
#define	list_for_each_entry_continue_reverse(pos, head, member)
	Iterate over entries in a list in reverse, starting after current position. More...
#define	list_for_each_entry_safe_continue(pos, tmp, head, member)
	Iterate over subsequent entries in a list, safe against deletion. More...
#define	list_contains(entry, head)
	Test if list contains a specified entry. More...
#define	list_contains_entry(entry, head, member)   list_contains ( &(entry)->member, (head) )
	Test if list contains a specified entry. More...
#define	list_check_contains_entry(entry, head, member)
	Check list contains a specified entry. More...

Functions
	FILE_LICENCE (GPL2_OR_LATER_OR_UBDL)
static void	inline_list_add (struct list_head *new, struct list_head *head)
void	extern_list_add (struct list_head *new, struct list_head *head)
static void	inline_list_add_tail (struct list_head *new, struct list_head *head)
void	extern_list_add_tail (struct list_head *new, struct list_head *head)
static void	inline_list_del (struct list_head *list)
void	extern_list_del (struct list_head *list)
static int	inline_list_empty (const struct list_head *list)
int	extern_list_empty (const struct list_head *list)
static int	inline_list_is_singular (const struct list_head *list)
int	extern_list_is_singular (const struct list_head *list)
static int	inline_list_is_last (const struct list_head *list, const struct list_head *head)
int	extern_list_is_last (const struct list_head *list, const struct list_head *head)
static void	inline_list_cut_position (struct list_head *new, struct list_head *list, struct list_head *entry)
void	extern_list_cut_position (struct list_head *new, struct list_head *list, struct list_head *entry)
static void	inline_list_splice (const struct list_head *list, struct list_head *entry)
void	extern_list_splice (const struct list_head *list, struct list_head *entry)
static void	inline_list_splice_tail (const struct list_head *list, struct list_head *entry)
void	extern_list_splice_tail (const struct list_head *list, struct list_head *entry)
static void	inline_list_splice_init (struct list_head *list, struct list_head *entry)
void	extern_list_splice_init (struct list_head *list, struct list_head *entry)
static void	inline_list_splice_tail_init (struct list_head *list, struct list_head *entry)
void	extern_list_splice_tail_init (struct list_head *list, struct list_head *entry)
static int	inline_list_contains (struct list_head *entry, struct list_head *head)
int	extern_list_contains (struct list_head *entry, struct list_head *head)

Detailed Description

Linked lists.

This linked list handling code is based on the Linux kernel's list.h.

Definition in file list.h.

Macro Definition Documentation

LIST_HEAD_INIT

#define LIST_HEAD_INIT

(

list

)

{ &(list), &(list) }

Initialise a static list head.

Parameters

list

List head

Definition at line 30 of file list.h.

LIST_HEAD

#define LIST_HEAD

(

list

)

struct list_head list = LIST_HEAD_INIT ( list )

Declare a static list head.

Parameters

list

List head

Definition at line 37 of file list.h.

INIT_LIST_HEAD

#define INIT_LIST_HEAD

(

list

)

Value:

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

Initialise a list head.

Parameters

list

List head

Definition at line 45 of file list.h.

list_check

#define list_check

(

list

)

Value:

( {                                     \
        assert ( (list) != NULL );                              \
        assert ( (list)->prev != NULL );                        \
        assert ( (list)->next != NULL );                        \
        assert ( (list)->next->prev == (list) );                \
        assert ( (list)->prev->next == (list) );                \
        } )

Check a list entry or list head is valid.

Parameters

list	List entry or head

Definition at line 55 of file list.h.

list_add

#define list_add	(		new,
			head
	)

Value:

do {                            \
        list_check ( (head) );                                  \
        extern_list_add ( (new), (head) );                      \
        list_check ( (head) );                                  \
        list_check ( (new) );                                   \
        } while ( 0 )

Add a new entry to the head of a list.

Parameters

new	New entry to be added
head	List head, or entry after which to add the new entry

Definition at line 69 of file list.h.

list_add_tail

#define list_add_tail	(		new,
			head
	)

Value:

do {                            \
        list_check ( (head) );                                  \
        extern_list_add_tail ( (new), (head) );                 \
        list_check ( (head) );                                  \
        list_check ( (new) );                                   \
        } while ( 0 )

Add a new entry to the tail of a list.

Parameters

new	New entry to be added
head	List head, or entry before which to add the new entry

Definition at line 93 of file list.h.

list_del

#define list_del

(

list

)

Value:

do {                                    \
        list_check ( (list) );                                  \
        inline_list_del ( (list) );                             \
        } while ( 0 )

Delete an entry from a list.

Parameters

list	List entry

Note that list_empty() on entry does not return true after this; the entry is in an undefined state.

Definition at line 119 of file list.h.

list_empty

#define list_empty

(

list

)

Value:

( {                                     \
        list_check ( (list) );                                  \
        inline_list_empty ( (list) ); } )

Test whether a list is empty.

Parameters

list

List head

Definition at line 136 of file list.h.

list_is_singular

#define list_is_singular

(

list

)

Value:

( {                             \
        list_check ( (list) );                                  \
        inline_list_is_singular ( (list) ); } )

Test whether a list has just one entry.

Parameters

list	List to test

Definition at line 149 of file list.h.

list_is_last

#define list_is_last	(		list,
			head
	)

Value:

( {                             \
        list_check ( (list) );                                  \
        list_check ( (head) );                                  \
        inline_list_is_last ( (list), (head) ); } )

Test whether an entry is the last entry in list.

Parameters

list	List entry to test
head	List head

Definition at line 163 of file list.h.

list_cut_position

#define list_cut_position	(		new,
			list,
			entry
	)

Value:

do {            \
        list_check ( (new) );                                   \
        assert ( list_empty ( (new) ) );                        \
        list_check ( (list) );                                  \
        list_check ( (entry) );                                 \
        extern_list_cut_position ( (new), (list), (entry) );    \
        } while ( 0 )

Cut a list into two.

Parameters

new	A new list to contain all removed entries
list	An existing list
entry	An entry within the existing list

All entries from list up to and including entry are moved to new, which should be an empty list. entry may be equal to list, in which case no entries are moved.

Definition at line 185 of file list.h.

list_splice

#define list_splice	(		list,
			entry
	)

Value:

do {                            \
        list_check ( (list) );                                  \
        list_check ( (entry) );                                 \
        extern_list_splice ( (list), (entry) );                 \
        } while ( 0 )

Move all entries from one list into another list.

Parameters

list	List of entries to add
entry	Entry after which to add the new entries

All entries from list are inserted after entry. Note that list is left in an undefined state; use list_splice_init() if you want list to become an empty list.

Definition at line 220 of file list.h.

list_splice_tail

#define list_splice_tail	(		list,
			entry
	)

Value:

do {                    \
        list_check ( (list) );                                  \
        list_check ( (entry) );                                 \
        extern_list_splice_tail ( (list), (entry) );            \
        } while ( 0 )

Move all entries from one list into another list.

Parameters

list	List of entries to add
entry	Entry before which to add the new entries

All entries from list are inserted before entry. Note that list is left in an undefined state; use list_splice_tail_init() if you want list to become an empty list.

Definition at line 250 of file list.h.

list_splice_init

#define list_splice_init	(		list,
			entry
	)

Value:

do {                    \
        list_check ( (list) );                                  \
        list_check ( (entry) );                                 \
        extern_list_splice_init ( (list), (entry) );            \
        } while ( 0 )

Move all entries from one list into another list and reinitialise empty list.

Parameters

list	List of entries to add
entry	Entry after which to add the new entries

All entries from list are inserted after entry.

Definition at line 278 of file list.h.

list_splice_tail_init

#define list_splice_tail_init	(		list,
			entry
	)

Value:

do {            \
        list_check ( (list) );                                  \
        list_check ( (entry) );                                 \
        extern_list_splice_tail_init ( (list), (entry) );       \
        } while ( 0 )

Move all entries from one list into another list and reinitialise empty list.

Parameters

list	List of entries to add
entry	Entry before which to add the new entries

All entries from list are inserted before entry.

Definition at line 299 of file list.h.

list_entry

#define list_entry	(		list,
			type,
			member
	)

Value:

( {                     \
        list_check ( (list) );                                  \
        container_of ( list, type, member ); } )

Get the container of a list entry.

Parameters

list	List entry
type	Containing type
member	Name of list field within containing type

Return values

container

Containing object

Definition at line 321 of file list.h.

list_first_entry

#define list_first_entry	(		list,
			type,
			member
	)

Value:

( list_empty ( (list) ) ?                               \
          ( type * ) NULL :                                     \
          list_entry ( (list)->next, type, member ) )

Get the container of the first entry in a list.

Parameters

list	List head
type	Containing type
member	Name of list field within containing type

Return values

first

First list entry, or NULL

Definition at line 333 of file list.h.

list_last_entry

#define list_last_entry	(		list,
			type,
			member
	)

Value:

( list_empty ( (list) ) ?                               \
          ( type * ) NULL :                                     \
          list_entry ( (list)->prev, type, member ) )

Get the container of the last entry in a list.

Parameters

list	List head
type	Containing type
member	Name of list field within containing type

Return values

first

First list entry, or NULL

Definition at line 346 of file list.h.

list_next_entry

#define list_next_entry	(		pos,
			head,
			member
	)

Value:

( {             \
        typeof (pos) next = list_entry ( (pos)->member.next,    \
                                         typeof ( *(pos) ),     \
                                         member );              \
        ( ( &next->member == (head) ) ? NULL : next ); } )

Get the container of the next entry in a list.

Parameters

pos	Current list entry
head	List head
member	Name of list field within iterator's type

Return values

next	Next list entry, or NULL at end of list

Definition at line 359 of file list.h.

list_prev_entry

#define list_prev_entry	(		pos,
			head,
			member
	)

Value:

( {             \
        typeof (pos) prev = list_entry ( (pos)->member.prev,    \
                                         typeof ( *(pos) ),     \
                                         member );              \
        ( ( &prev->member == (head) ) ? NULL : prev ); } )

Get the container of the previous entry in a list.

Parameters

pos	Current list entry
head	List head
member	Name of list field within iterator's type

Return values

next	Next list entry, or NULL at end of list

Definition at line 373 of file list.h.

list_is_first_entry

#define list_is_first_entry	(		entry,
			head,
			member
	)		( (head)->next == &(entry)->member )

Test if entry is first in a list.

Parameters

entry	List entry
head	List head
member	Name of list field within iterator's type

Return values

is_first

Entry is first in the list

Definition at line 387 of file list.h.

list_is_last_entry

#define list_is_last_entry	(		entry,
			head,
			member
	)		( (head)->prev == &(entry)->member )

Test if entry is last in a list.

Parameters

entry	List entry
head	List head
member	Name of list field within iterator's type

Return values

is_last

Entry is last in the list

Definition at line 398 of file list.h.

list_is_head_entry

#define list_is_head_entry	(		entry,
			head,
			member
	)		( (head) == &(entry)->member )

Test if entry is the list head.

Parameters

entry	List entry
head	List head
member	Name of list field within iterator's type

Return values

is_head

Entry is the list head

Definition at line 409 of file list.h.

list_for_each

#define list_for_each	(		pos,
			head
	)

Value:

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

Iterate over a list.

Parameters

pos	Iterator
head	List head

Definition at line 418 of file list.h.

list_for_each_entry

#define list_for_each_entry	(		pos,
			head,
			member
	)

Value:

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

Iterate over entries in a list.

Parameters

pos	Iterator
head	List head
member	Name of list field within iterator's type

Definition at line 431 of file list.h.

list_for_each_entry_reverse

#define list_for_each_entry_reverse	(		pos,
			head,
			member
	)

Value:

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

Iterate over entries in a list in reverse order.

Parameters

pos	Iterator
head	List head
member	Name of list field within iterator's type

Definition at line 444 of file list.h.

list_for_each_entry_safe

#define list_for_each_entry_safe	(		pos,
			tmp,
			head,
			member
	)

Value:

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

Iterate over entries in a list, safe against deletion of the current entry.

Parameters

pos	Iterator
tmp	Temporary value (of same type as iterator)
head	List head
member	Name of list field within iterator's type

Definition at line 458 of file list.h.

list_for_each_entry_continue

#define list_for_each_entry_continue	(		pos,
			head,
			member
	)

Value:

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

Iterate over entries in a list, starting after current position.

Parameters

pos	Iterator
head	List head
member	Name of list field within iterator's type

Definition at line 473 of file list.h.

list_for_each_entry_continue_reverse

#define list_for_each_entry_continue_reverse	(		pos,
			head,
			member
	)

Value:

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

Iterate over entries in a list in reverse, starting after current position.

Parameters

pos	Iterator
head	List head
member	Name of list field within iterator's type

Definition at line 486 of file list.h.

list_for_each_entry_safe_continue

#define list_for_each_entry_safe_continue	(		pos,
			tmp,
			head,
			member
	)

Value:

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

Iterate over subsequent entries in a list, safe against deletion.

Parameters

pos	Iterator
tmp	Temporary value (of same type as iterator)
head	List head
member	Name of list field within iterator's type

Definition at line 500 of file list.h.

list_contains

#define list_contains	(		entry,
			head
	)

Value:

( {                     \
        list_check ( (head) );                                  \
        list_check ( (entry) );                                 \
        extern_list_contains ( (entry), (head) ); } )

Test if list contains a specified entry.

Parameters

entry	Entry
head	List head

Return values

present

List contains specified entry

Definition at line 515 of file list.h.

list_contains_entry

#define list_contains_entry	(		entry,
			head,
			member
	)		list_contains ( &(entry)->member, (head) )

Test if list contains a specified entry.

Parameters

entry	Entry
head	List head

Return values

present

List contains specified entry

Definition at line 539 of file list.h.

list_check_contains_entry

#define list_check_contains_entry	(		entry,
			head,
			member
	)

Value:

do {                  \
        assert ( list_contains_entry ( (entry), (head), member ) );           \
        } while ( 0 )

Check list contains a specified entry.

Parameters

entry	Entry
head	List head
member	Name of list field within iterator's type

Definition at line 549 of file list.h.

Function Documentation

FILE_LICENCE()

FILE_LICENCE

(

GPL2_OR_LATER_OR_UBDL

)

inline_list_add()

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

inlinestatic

Definition at line 75 of file list.h.

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

References head, list_head::next, next, and list_head::prev.

Referenced by extern_list_add().

extern_list_add()

void extern_list_add	(	struct list_head *	new,
		struct list_head *	head
	)

Definition at line 34 of file list.c.

                                                                       {
        inline_list_add ( new, head );
}

References head, and inline_list_add().

inline_list_add_tail()

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

inlinestatic

Definition at line 99 of file list.h.

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

References head, list_head::next, next, and list_head::prev.

Referenced by extern_list_add_tail().

extern_list_add_tail()

void extern_list_add_tail	(	struct list_head *	new,
		struct list_head *	head
	)

Definition at line 38 of file list.c.

                                                                            {
        inline_list_add_tail ( new, head );
}

References head, and inline_list_add_tail().

inline_list_del()

static void inline_list_del ( struct list_head *  list )

inlinestatic

Definition at line 123 of file list.h.

                                                              {
        struct list_head *next = (list)->next;
        struct list_head *prev = (list)->prev;
        next->prev = prev;
        prev->next = next;
}

References list_head::next, next, and list_head::prev.

Referenced by extern_list_del().

extern_list_del()

void extern_list_del

(

struct list_head *

list

)

Definition at line 42 of file list.c.

                                                {
        inline_list_del ( list );
}

References inline_list_del().

inline_list_empty()

static int inline_list_empty ( const struct list_head *  list )

inlinestatic

Definition at line 139 of file list.h.

                                                                     {
        return ( list->next == list );
}

References list_head::next.

Referenced by extern_list_empty().

extern_list_empty()

int extern_list_empty

(

const struct list_head *

list

)

Definition at line 46 of file list.c.

                                                       {
        return inline_list_empty ( list );
}

References inline_list_empty().

inline_list_is_singular()

static int inline_list_is_singular ( const struct list_head *  list )

inlinestatic

Definition at line 152 of file list.h.

                                                                           {
        return ( ( ! list_empty ( list ) ) && ( list->next == list->prev ) );
}

References list_empty, list_head::next, and list_head::prev.

Referenced by extern_list_is_singular().

extern_list_is_singular()

int extern_list_is_singular

(

const struct list_head *

list

)

Definition at line 50 of file list.c.

                                                             {
        return inline_list_is_singular ( list );
}

References inline_list_is_singular().

inline_list_is_last()

static int inline_list_is_last ( const struct list_head *  list, const struct list_head *  head  )

inlinestatic

Definition at line 167 of file list.h.

                                                                       {
        return ( list->next == head );
}

References head, and list_head::next.

Referenced by extern_list_is_last().

extern_list_is_last()

int extern_list_is_last	(	const struct list_head *	list,
		const struct list_head *	head
	)

Definition at line 54 of file list.c.

                                                         {
        return inline_list_is_last ( list, head );
}

References head, and inline_list_is_last().

inline_list_cut_position()

static void inline_list_cut_position ( struct list_head *  new, struct list_head *  list, struct list_head *  entry  )

inlinestatic

Definition at line 192 of file list.h.

                                                                        {
        struct list_head *first = entry->next;

        if ( list != entry ) {
                new->next = list->next;
                new->next->prev = new;
                new->prev = entry;
                new->prev->next = new;
                list->next = first;
                list->next->prev = list;
        }
}

References first, list_head::next, and list_head::prev.

Referenced by extern_list_cut_position().

extern_list_cut_position()

void extern_list_cut_position	(	struct list_head *	new,
		struct list_head *	list,
		struct list_head *	entry
	)

Definition at line 59 of file list.c.

                                                          {
        inline_list_cut_position ( new, list, entry );
}

References inline_list_cut_position().

inline_list_splice()

static void inline_list_splice ( const struct list_head *  list, struct list_head *  entry  )

inlinestatic

Definition at line 225 of file list.h.

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

        if ( ! list_empty ( list ) ) {
                last->next = entry->next;
                last->next->prev = last;
                first->prev = entry;
                first->prev->next = first;
        }
}

References first, list_empty, list_head::next, and list_head::prev.

Referenced by extern_list_splice().

extern_list_splice()

void extern_list_splice	(	const struct list_head *	list,
		struct list_head *	entry
	)

Definition at line 65 of file list.c.

                                                    {
        inline_list_splice ( list, entry );
}

References inline_list_splice().

inline_list_splice_tail()

static void inline_list_splice_tail ( const struct list_head *  list, struct list_head *  entry  )

inlinestatic

Definition at line 255 of file list.h.

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

        if ( ! list_empty ( list ) ) {
                first->prev = entry->prev;
                first->prev->next = first;
                last->next = entry;
                last->next->prev = last;
        }
}

References first, list_empty, list_head::next, and list_head::prev.

Referenced by extern_list_splice_tail().

extern_list_splice_tail()

void extern_list_splice_tail	(	const struct list_head *	list,
		struct list_head *	entry
	)

Definition at line 70 of file list.c.

                                                         {
        inline_list_splice_tail ( list, entry );
}

References inline_list_splice_tail().

inline_list_splice_init()

static void inline_list_splice_init ( struct list_head *  list, struct list_head *  entry  )

inlinestatic

Definition at line 283 of file list.h.

                                                                       {
        list_splice ( list, entry );
        INIT_LIST_HEAD ( list );
}

References INIT_LIST_HEAD, and list_splice.

Referenced by extern_list_splice_init().

extern_list_splice_init()

void extern_list_splice_init	(	struct list_head *	list,
		struct list_head *	entry
	)

Definition at line 75 of file list.c.

                                                         {
        inline_list_splice_init ( list, entry );
}

References inline_list_splice_init().

inline_list_splice_tail_init()

static void inline_list_splice_tail_init ( struct list_head *  list, struct list_head *  entry  )

inlinestatic

Definition at line 305 of file list.h.

                                                                            {
        list_splice_tail ( list, entry );
        INIT_LIST_HEAD ( list );
}

References INIT_LIST_HEAD, and list_splice_tail.

Referenced by extern_list_splice_tail_init().

extern_list_splice_tail_init()

void extern_list_splice_tail_init	(	struct list_head *	list,
		struct list_head *	entry
	)

Definition at line 80 of file list.c.

                                                              {
        inline_list_splice_tail_init ( list, entry );
}

References inline_list_splice_tail_init().

inline_list_contains()

static int inline_list_contains ( struct list_head *  entry, struct list_head *  head  )

inlinestatic

Definition at line 519 of file list.h.

                                                                  {
        struct list_head *tmp;

        list_for_each ( tmp, head ) {
                if ( tmp == entry )
                        return 1;
        }
        return 0;
}

References head, list_for_each, and tmp.

Referenced by extern_list_contains().

extern_list_contains()

int extern_list_contains	(	struct list_head *	entry,
		struct list_head *	head
	)

Definition at line 85 of file list.c.

                                                    {
        return inline_list_contains ( entry, head );
}

References head, and inline_list_contains().