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
|
/* -*- Mode: C; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 8 -*- */
/* GMime
* Copyright (C) 2000-2012 Jeffrey Stedfast
*
* 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, 51 Franklin Street, Fifth Floor, Boston, MA
* 02110-1301, USA.
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include "list.h"
void
list_init (List *list)
{
list->head = (ListNode *) &list->tail;
list->tail = NULL;
list->tailpred = (ListNode *) &list->head;
}
int
list_is_empty (List *list)
{
return list->head == (ListNode *) &list->tail;
}
int
list_length (List *list)
{
ListNode *node;
int n = 0;
node = list->head;
while (node->next) {
node = node->next;
n++;
}
return n;
}
ListNode *
list_unlink_head (List *list)
{
ListNode *n, *nn;
n = list->head;
nn = n->next;
if (nn) {
nn->prev = n->prev;
list->head = nn;
return n;
}
return NULL;
}
ListNode *
list_unlink_tail (List *list)
{
ListNode *n, *np;
n = list->tailpred;
np = n->prev;
if (np) {
np->next = n->next;
list->tailpred = np;
return n;
}
return NULL;
}
ListNode *
list_prepend (List *list, ListNode *node)
{
node->next = list->head;
node->prev = (ListNode *) &list->head;
list->head->prev = node;
list->head = node;
return node;
}
ListNode *
list_append (List *list, ListNode *node)
{
node->next = (ListNode *) &list->tail;
node->prev = list->tailpred;
list->tailpred->next = node;
list->tailpred = node;
return node;
}
ListNode *
list_unlink (ListNode *node)
{
node->next->prev = node->prev;
node->prev->next = node->next;
return node;
}
|
