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
|
/*****************************************************************************
Copyright (c) 2006, 2009, Innobase Oy. 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; version 2 of the License.
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.,
51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*****************************************************************************/
/*******************************************************************//**
@file ut/ut0list.c
A double-linked list
Created 4/26/2006 Osku Salerma
************************************************************************/
#include "ut0list.h"
#ifdef UNIV_NONINL
#include "ut0list.ic"
#endif
/****************************************************************//**
Create a new list.
@return list */
UNIV_INTERN
ib_list_t*
ib_list_create(void)
/*=================*/
{
ib_list_t* list = mem_alloc(sizeof(ib_list_t));
list->first = NULL;
list->last = NULL;
list->is_heap_list = FALSE;
return(list);
}
/****************************************************************//**
Create a new list using the given heap. ib_list_free MUST NOT BE CALLED for
lists created with this function.
@return list */
UNIV_INTERN
ib_list_t*
ib_list_create_heap(
/*================*/
mem_heap_t* heap) /*!< in: memory heap to use */
{
ib_list_t* list = mem_heap_alloc(heap, sizeof(ib_list_t));
list->first = NULL;
list->last = NULL;
list->is_heap_list = TRUE;
return(list);
}
/****************************************************************//**
Free a list. */
UNIV_INTERN
void
ib_list_free(
/*=========*/
ib_list_t* list) /*!< in: list */
{
ut_a(!list->is_heap_list);
/* We don't check that the list is empty because it's entirely valid
to e.g. have all the nodes allocated from a single heap that is then
freed after the list itself is freed. */
mem_free(list);
}
/****************************************************************//**
Add the data to the start of the list.
@return new list node */
UNIV_INTERN
ib_list_node_t*
ib_list_add_first(
/*==============*/
ib_list_t* list, /*!< in: list */
void* data, /*!< in: data */
mem_heap_t* heap) /*!< in: memory heap to use */
{
return(ib_list_add_after(list, ib_list_get_first(list), data, heap));
}
/****************************************************************//**
Add the data to the end of the list.
@return new list node */
UNIV_INTERN
ib_list_node_t*
ib_list_add_last(
/*=============*/
ib_list_t* list, /*!< in: list */
void* data, /*!< in: data */
mem_heap_t* heap) /*!< in: memory heap to use */
{
return(ib_list_add_after(list, ib_list_get_last(list), data, heap));
}
/****************************************************************//**
Add the data after the indicated node.
@return new list node */
UNIV_INTERN
ib_list_node_t*
ib_list_add_after(
/*==============*/
ib_list_t* list, /*!< in: list */
ib_list_node_t* prev_node, /*!< in: node preceding new node (can
be NULL) */
void* data, /*!< in: data */
mem_heap_t* heap) /*!< in: memory heap to use */
{
ib_list_node_t* node = mem_heap_alloc(heap, sizeof(ib_list_node_t));
node->data = data;
if (!list->first) {
/* Empty list. */
ut_a(!prev_node);
node->prev = NULL;
node->next = NULL;
list->first = node;
list->last = node;
} else if (!prev_node) {
/* Start of list. */
node->prev = NULL;
node->next = list->first;
list->first->prev = node;
list->first = node;
} else {
/* Middle or end of list. */
node->prev = prev_node;
node->next = prev_node->next;
prev_node->next = node;
if (node->next) {
node->next->prev = node;
} else {
list->last = node;
}
}
return(node);
}
/****************************************************************//**
Remove the node from the list. */
UNIV_INTERN
void
ib_list_remove(
/*===========*/
ib_list_t* list, /*!< in: list */
ib_list_node_t* node) /*!< in: node to remove */
{
if (node->prev) {
node->prev->next = node->next;
} else {
/* First item in list. */
ut_ad(list->first == node);
list->first = node->next;
}
if (node->next) {
node->next->prev = node->prev;
} else {
/* Last item in list. */
ut_ad(list->last == node);
list->last = node->prev;
}
}
|
