alist.h File Reference

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

Go to the source code of this file.

Macros
#define	alist_foreach(list, l)   for ((l) = (list); (l); (l) = alist_next(l))
#define	alist_foreach_safe(list, l, n)

Functions
struct alist *	alist_append (struct alist *list, struct alist *new)
int	alist_count (struct alist *l)
struct alist *	alist_next (struct alist *l)
struct alist *	alist_nth (struct alist *l, int nth)
struct alist *	alist_prepend (struct alist *list, struct alist *new)
struct alist *	alist_prev (struct alist *l)
struct alist *	alist_remove (struct alist *list, struct alist *l)

Macro Definition Documentation

#define alist_foreach	(		list,
			l
	)		for ((l) = (list); (l); (l) = alist_next(l))

Definition at line 1 of file alist.h.

Referenced by alist_count().

#define alist_foreach_safe	(		list,
			l,
			n
	)

Value:

for ((l) = (list), (n) = alist_next(l); \
                (l); \
                (l) = (n), (n) = alist_next(l))

Definition at line 4 of file alist.h.

Function Documentation

struct alist* alist_append	(	struct alist *	list,
		struct alist *	new
	)

Definition at line 28 of file alist.c.

References alist::next, NULL, and alist::prev.

int alist_count

(

struct alist *

l)

Definition at line 104 of file alist.c.

References alist_foreach.

struct alist* alist_next

(

struct alist *

l)

Definition at line 94 of file alist.c.

References alist::next, and NULL.

struct alist* alist_nth	(	struct alist *	l,
		int	nth
	)

Definition at line 117 of file alist.c.

References alist::next, and NULL.

struct alist* alist_prepend	(	struct alist *	list,
		struct alist *	new
	)

Definition at line 45 of file alist.c.

References alist::next, NULL, and alist::prev.

struct alist* alist_prev

(

struct alist *

l)

Definition at line 99 of file alist.c.

References NULL, and alist::prev.

struct alist* alist_remove	(	struct alist *	list,
		struct alist *	l
	)

Note

If the removed entry 'l' has no next element, it is the last element. In this case, check the existence of the list first, and if the list is not empty, update the 'prev' of the list (which is a head element of the list)

If we didn't care about this, the head element(list) can indicates the invalid element.

Definition at line 64 of file alist.c.

References alist::next, NULL, and alist::prev.