73ef4ff3
 Hu Chunming
提交三方库
|
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
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
|
/*
The oSIP library implements the Session Initiation Protocol (SIP -rfc3261-)
Copyright (C) 2001-2020 Aymeric MOIZARD amoizard@antisip.com
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#include <osipparser2/internal.h>
#include <osipparser2/osip_port.h>
#include <osipparser2/osip_list.h>
int osip_list_init(osip_list_t *li) {
if (li == NULL)
return OSIP_BADPARAMETER;
memset(li, 0, sizeof(osip_list_t));
return OSIP_SUCCESS; /* ok */
}
int osip_list_clone(const osip_list_t *src, osip_list_t *dst, int (*clone_func)(void *, void **)) {
void *data;
void *data2;
int i;
osip_list_iterator_t iterator;
for (data = osip_list_get_first((osip_list_t *) src, &iterator); osip_list_iterator_has_elem(iterator); data = osip_list_get_next(&iterator)) {
i = clone_func(data, &data2);
if (i != 0)
return i;
osip_list_add(dst, data2, -1);
}
return OSIP_SUCCESS;
}
void osip_list_special_free(osip_list_t *li, void (*free_func)(void *)) {
void *element;
if (li == NULL)
return;
while (!osip_list_eol(li, 0)) {
element = (void *) osip_list_get(li, 0);
osip_list_remove(li, 0);
if (free_func != NULL)
free_func(element);
}
}
void osip_list_ofchar_free(osip_list_t *li) {
char *chain;
if (li == NULL)
return;
while (!osip_list_eol(li, 0)) {
chain = (char *) osip_list_get(li, 0);
osip_list_remove(li, 0);
osip_free(chain);
}
}
int osip_list_size(const osip_list_t *li) {
if (li == NULL)
return OSIP_BADPARAMETER;
return li->nb_elt;
}
int osip_list_eol(const osip_list_t *li, int i) {
if (li == NULL)
return OSIP_BADPARAMETER;
if (i < li->nb_elt)
return OSIP_SUCCESS; /* not end of list */
return 1; /* end of list */
}
/* index starts from 0; */
int osip_list_add(osip_list_t *li, void *el, int pos) {
__node_t *ntmp;
int i = 0;
if (li == NULL)
return OSIP_BADPARAMETER;
if (li->nb_elt == 0) {
li->node = (__node_t *) osip_malloc(sizeof(__node_t));
if (li->node == NULL)
return OSIP_NOMEM;
li->node->element = el;
li->node->next = NULL;
li->nb_elt++;
return li->nb_elt;
}
if (pos == -1 || pos >= li->nb_elt) { /* insert at the end */
pos = li->nb_elt;
}
ntmp = li->node; /* exist because nb_elt>0 */
if (pos == 0) { /* pos = 0 insert before first elt */
li->node = (__node_t *) osip_malloc(sizeof(__node_t));
if (li->node == NULL) {
/* leave the list unchanged */
li->node = ntmp;
return OSIP_NOMEM;
}
li->node->element = el;
li->node->next = ntmp;
li->nb_elt++;
return li->nb_elt;
}
while (pos > i + 1) {
i++;
/* when pos>i next node exist */
ntmp = ntmp->next;
}
/* if pos==nb_elt next node does not exist */
if (pos == li->nb_elt) {
ntmp->next = osip_malloc(sizeof(__node_t));
if (ntmp->next == NULL)
return OSIP_NOMEM; /* leave the list unchanged */
ntmp = ntmp->next;
ntmp->element = el;
ntmp->next = NULL;
li->nb_elt++;
return li->nb_elt;
}
/* here pos==i so next node is where we want to insert new node */
{
__node_t *nextnode = ntmp->next;
ntmp->next = osip_malloc(sizeof(__node_t));
if (ntmp->next == NULL) {
/* leave the list unchanged */
ntmp->next = nextnode;
return OSIP_NOMEM;
}
ntmp = ntmp->next;
ntmp->element = el;
ntmp->next = nextnode;
li->nb_elt++;
}
return li->nb_elt;
}
/* index starts from 0 */
void *osip_list_get(const osip_list_t *li, int pos) {
__node_t *ntmp;
int i = 0;
if (li == NULL)
return NULL;
if (pos < 0 || pos >= li->nb_elt)
/* element does not exist */
return NULL;
ntmp = li->node; /* exist because nb_elt>0 */
while (pos > i) {
i++;
ntmp = ntmp->next;
}
return ntmp->element;
}
/* added by bennewit@cs.tu-berlin.de */
void *osip_list_get_first(const osip_list_t *li, osip_list_iterator_t *iterator) {
if (li == NULL || 0 >= li->nb_elt) {
iterator->actual = 0;
return OSIP_SUCCESS;
}
iterator->actual = li->node;
iterator->prev = (__node_t **) &li->node;
iterator->li = (osip_list_t *) li;
iterator->pos = 0;
return li->node->element;
}
/* added by bennewit@cs.tu-berlin.de */
void *osip_list_get_next(osip_list_iterator_t *iterator) {
if (iterator->actual == NULL) {
return OSIP_SUCCESS;
}
iterator->prev = &(iterator->actual->next);
iterator->actual = iterator->actual->next;
++(iterator->pos);
if (osip_list_iterator_has_elem(*iterator)) {
return iterator->actual->element;
}
iterator->actual = 0;
return OSIP_SUCCESS;
}
/* added by bennewit@cs.tu-berlin.de */
void *osip_list_iterator_remove(osip_list_iterator_t *iterator) {
if (osip_list_iterator_has_elem(*iterator)) {
--(iterator->li->nb_elt);
*(iterator->prev) = iterator->actual->next;
osip_free(iterator->actual);
iterator->actual = *(iterator->prev);
}
if (osip_list_iterator_has_elem(*iterator)) {
return iterator->actual->element;
}
return OSIP_SUCCESS;
}
/* return -1 if failed */
int osip_list_remove(osip_list_t *li, int pos) {
__node_t *ntmp;
int i = 0;
if (li == NULL)
return OSIP_BADPARAMETER;
if (pos < 0 || pos >= li->nb_elt)
/* element does not exist */
return OSIP_UNDEFINED_ERROR;
ntmp = li->node; /* exist because nb_elt>0 */
if (pos == 0) { /* special case */
li->node = ntmp->next;
li->nb_elt--;
osip_free(ntmp);
return li->nb_elt;
}
while (pos > i + 1) {
i++;
ntmp = ntmp->next;
}
/* insert new node */
{
__node_t *remnode;
remnode = ntmp->next;
ntmp->next = (ntmp->next)->next;
osip_free(remnode);
li->nb_elt--;
}
return li->nb_elt;
}
|
