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
|
/*****************************************************************************
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., 59 Temple
Place, Suite 330, Boston, MA 02111-1307 USA
*****************************************************************************/
/*******************************************************************//**
@file include/ut0list.h
A double-linked list
Created 4/26/2006 Osku Salerma
************************************************************************/
/*******************************************************************//**
A double-linked list. This differs from the one in ut0lst.h in that in this
one, each list node contains a pointer to the data, whereas the one in
ut0lst.h uses a strategy where the list pointers are embedded in the data
items themselves.
Use this one when you need to store arbitrary data in the list where you
can't embed the list pointers in the data, if a data item needs to be
stored in multiple lists, etc.
Note about the memory management: ib_list_t is a fixed-size struct whose
allocation/deallocation is done through ib_list_create/ib_list_free, but the
memory for the list nodes is allocated through a user-given memory heap,
which can either be the same for all nodes or vary per node. Most users will
probably want to create a memory heap to store the item-specific data, and
pass in this same heap to the list node creation functions, thus
automatically freeing the list node when the item's heap is freed.
************************************************************************/
#ifndef IB_LIST_H
#define IB_LIST_H
#include "mem0mem.h"
typedef struct ib_list_struct ib_list_t;
typedef struct ib_list_node_struct ib_list_node_t;
typedef struct ib_list_helper_struct ib_list_helper_t;
/****************************************************************//**
Create a new list using mem_alloc. Lists created with this function must be
freed with ib_list_free.
@return list */
UNIV_INTERN
ib_list_t*
ib_list_create(void);
/*=================*/
/****************************************************************//**
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 */
/****************************************************************//**
Free a list. */
UNIV_INTERN
void
ib_list_free(
/*=========*/
ib_list_t* list); /*!< in: 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 */
/****************************************************************//**
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 */
/****************************************************************//**
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 */
/****************************************************************//**
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 */
/****************************************************************//**
Get the first node in the list.
@return first node, or NULL */
UNIV_INLINE
ib_list_node_t*
ib_list_get_first(
/*==============*/
ib_list_t* list); /*!< in: list */
/****************************************************************//**
Get the last node in the list.
@return last node, or NULL */
UNIV_INLINE
ib_list_node_t*
ib_list_get_last(
/*=============*/
ib_list_t* list); /*!< in: list */
/* List. */
struct ib_list_struct {
ib_list_node_t* first; /*!< first node */
ib_list_node_t* last; /*!< last node */
ibool is_heap_list; /*!< TRUE if this list was
allocated through a heap */
};
/* A list node. */
struct ib_list_node_struct {
ib_list_node_t* prev; /*!< previous node */
ib_list_node_t* next; /*!< next node */
void* data; /*!< user data */
};
/* Quite often, the only additional piece of data you need is the per-item
memory heap, so we have this generic struct available to use in those
cases. */
struct ib_list_helper_struct {
mem_heap_t* heap; /*!< memory heap */
void* data; /*!< user data */
};
#ifndef UNIV_NONINL
#include "ut0list.ic"
#endif
#endif
|
