[go: up one dir, main page]
Menu ▾ ▴

[r456]: / tags / start / src / llist.h  Maximize  Restore  History

Download this file

94 lines (77 with data), 2.3 kB 

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
/*

 * -------------------------------------------------------

 * Copyright (C) 2002-2003 Tommi Saviranta <tsaviran@cs.helsinki.fi>

 *	(C) 2002 Lee Hardy <lee@leeh.co.uk>

 * -------------------------------------------------------

 * This program is free software; you can redistribute it and/or modify

 * it under the terms of the GNU General Public License as published by

 * the Free Software Foundation; either version 2 of the License, or

 * (at your option) any later version.

 *

 * This program is distributed in the hope that it will be useful,

 * but WITHOUT ANY WARRANTY; without even the implied warranty of

 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

 * GNU General Public License for more details.

 */





#ifndef _LLIST_H

#define _LLIST_H



typedef struct _llist_node llist_node;

typedef struct _llist_list llist_list;



struct _llist_node

{

	void		*data;

	llist_node	*next;

	llist_node	*prev;

};



struct _llist_list

{

	llist_node	*head;

	llist_node	*tail;

};



llist_node *llist_create(void *data);



void llist_add(llist_node *node, llist_list *list);

void llist_add_tail(llist_node *node, llist_list *list);

void llist_delete(llist_node *node, llist_list *list);

llist_node *llist_find(void *data, llist_list *list);

llist_node **llist_get_indexed(const llist_list *list);



#define LLIST_EMPTY(firstnode, list) \

{ \

	llist_node	*node = (firstnode); \

	llist_node	*nextnode; \

	while (node != NULL) { \

		nextnode = node->next; \

		xfree(node->data); \

		llist_delete(node, (list)); \

		node = nextnode; \

	} \

}







/*

 * Following macros can be used to walk thru the list even when elements

 * will be removed during it.

 *

 * Example:

 * LLIST_WALK_H(nicknames.nicks.head, char *);

 * xfree(data);

 * LLIST_WALK_F;

 *

 * Using these macros, "node" points to current node and "data" to node->data.

 */

#define LLIST_WALK_H(firstitem, datatype) { \

	datatype	data; \

	llist_node	*node; \

	llist_node	*nextnode; \

	node = (firstitem); \

	while (node != NULL) { \

		nextnode = node->next; \

		data = (datatype) node->data;

#define LLIST_WALK_F \

		node = nextnode; \

	} }

#define LLIST_WALK_CONTINUE \

		node = nextnode; \

		continue;







/*

 * Not worth the trouble (bytes) to do this:

void llist_empty(llist_list *list, void (* action) (void *));

*/





#endif /* _LLIST_H */