list.h File Reference

Go to the source code of this file.

Data Structures
struct	list_t

Macros
#define	LIST_INIT(name)   { &(name), &(name) }
#define	list_for_each(dir, pos, head)    for (pos = (head)->dir; pos != (head); pos = pos->dir)

Functions
static int	list_empty (void *l)
static void	list_insert (void *l, void *i)
static list_t *	list_remove (void *i)

Detailed Description

Simple list support.

Definition in file list.h.

Macro Definition Documentation

list_for_each

#define list_for_each	(		dir,
			pos,
			head
	)		for (pos = (head)->dir; pos != (head); pos = pos->dir)

Iterate over a list. Dir is 'next' to iterate forward and 'prev' to iterate in reverse.

Definition at line 56 of file list.h.

LIST_INIT

#define LIST_INIT

(

name

)

{ &(name), &(name) }

Definition at line 24 of file list.h.

Function Documentation

list_empty()

static int list_empty ( void *  l )

inlinestatic

Definition at line 26 of file list.h.

{
        list_t *list = (list_t *)l;
 
        return list->next == list && list->prev == list;
}

References list_t::next, and list_t::prev.

list_insert()

static void list_insert ( void *  l, void *  i  )

inlinestatic

Insert an item after the given list.

Definition at line 34 of file list.h.

{
        list_t *list = (list_t *)l, *item = (list_t *)i;
 
        item->prev = list;
        item->next = list->next;
        list->next->prev = item;
        list->next = item;
}

References list_t::next, and list_t::prev.

list_remove()

static list_t* list_remove ( void *  i )

inlinestatic

Remove the item from the list and return the item.

Definition at line 45 of file list.h.

{
        list_t *item = (list_t *)i;
 
        item->prev->next = item->next;
        item->next->prev = item->prev;
        return item;
}

References list_t::next, and list_t::prev.