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
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
|
/*
* Copyright (C) 2000-2006 SWsoft. All rights reserved.
*
* 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.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#ifndef _LIST_H_
#define _LIST_H_
struct list_elem;
typedef struct {
struct list_elem *prev, *next;
} list_head_t;
typedef struct list_elem {
struct list_elem *prev, *next;
} list_elem_t;
struct str_struct {
list_elem_t list;
char *val;
};
typedef struct str_struct str_param;
static inline void list_head_init(list_head_t *head)
{
head->next = (list_elem_t *)head;
head->prev = (list_elem_t *)head;
}
static inline void list_elem_init(list_elem_t *entry)
{
entry->next = entry;
entry->prev = entry;
}
static inline void list_add(list_elem_t *new, list_head_t *list)
{
new->next = list->next;
new->prev = (list_elem_t *)list;
list->next->prev = new;
list->next = new;
}
static inline void list_add_tail(list_elem_t *new, list_head_t *list)
{
new->next = (list_elem_t *)list;
new->prev = list->prev;
list->prev->next = new;
list->prev = new;
}
static inline void list_del(list_elem_t *el)
{
el->prev->next = el->next;
el->next->prev = el->prev;
el->prev = (void *)0x5a5a5a5a;
el->next = (void *)0xa5a5a5a5;
}
static inline void list_del_init(list_elem_t *el)
{
el->prev->next = el->next;
el->next->prev = el->prev;
list_elem_init(el);
}
static inline int list_is_init(list_head_t *h)
{
return h->next == NULL;
}
static inline int list_empty(list_head_t *h)
{
if (list_is_init(h))
return 1;
return h->next == (list_elem_t *)h;
}
static inline int list_elem_inserted(list_elem_t *el)
{
return el->next != el;
}
static inline void list_moveall(list_head_t *src, list_head_t *dst)
{
list_add((list_elem_t *)dst, src);
list_del((list_elem_t *)src);
list_head_init(src);
}
#define list_entry(ptr, type, field) \
((type *)((char *)(ptr)-(unsigned long)(&((type *)0)->field)))
#define list_first_entry(head, type, field) \
list_entry((head)->next, type, field)
#define list_for_each(entry, head, field) \
for (entry = list_entry((head)->next, typeof(*entry), field);\
&entry->field != (list_elem_t*)(head); \
entry = list_entry(entry->field.next, typeof(*entry), field))
#define list_for_each_prev(entry, head, field) \
for (entry = list_entry((head)->prev, typeof(*entry), field);\
&entry->field != (list_elem_t*)(head); \
entry = list_entry(entry->field.prev, typeof(*entry), field))
#define list_for_each_safe(entry, tmp, head, field) \
for (entry = list_entry((head)->next, typeof(*entry), field),\
tmp = list_entry(entry->field.next, typeof(*entry), field); \
&entry->field != (list_elem_t*)(head); \
entry = tmp, \
tmp = list_entry(tmp->field.next, typeof(*tmp), field))
char *list2str_c(char *name, char c, list_head_t *head);
char *list2str(char *name, list_head_t *head);
char **list2arg(list_head_t *head);
int add_str_param(list_head_t *head, const char *str);
int add_str_param2(list_head_t *head, char *str);
int add_str2list(list_head_t *head, const char *val);
void free_str_param(list_head_t *head);
int copy_str_param(list_head_t *dst, list_head_t *src);
char *find_str(list_head_t *head, const char *val);
int merge_str_list(int delall, list_head_t *old, list_head_t *add,
list_head_t *del, list_head_t *merged);
int list_size(list_head_t *head);
#endif /* _LIST_H_ */
|
