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
|
/* Copyright (c) 2000, 2017, Oracle and/or its affiliates. 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, version 2.0,
as published by the Free Software Foundation.
This program is also distributed with certain software (including
but not limited to OpenSSL) that is licensed under separate terms,
as designated in a particular file or component or in included license
documentation. The authors of MySQL hereby grant you an additional
permission to link the program and your derivative works with the
separately licensed software that they have included with MySQL.
Without limiting anything contained in the foregoing, this file,
which is part of C Driver for MySQL (Connector/C), is also subject to the
Universal FOSS Exception, version 1.0, a copy of which can be found at
http://oss.oracle.com/licenses/universal-foss-exception.
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, version 2.0, 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 mysys/list.cc
Code for handling double-linked lists in C.
*/
#include <sys/types.h>
#include "my_dbug.h"
#include "my_inttypes.h"
#include "my_list.h"
#include "my_sys.h"
#include "mysql/service_mysql_alloc.h"
#include "mysys/mysys_priv.h"
/* Add a element to start of list */
LIST *list_add(LIST *root, LIST *element) {
DBUG_ENTER("list_add");
DBUG_PRINT("enter", ("root: %p element: %p", root, element));
if (root) {
if (root->prev) /* If add in mid of list */
root->prev->next = element;
element->prev = root->prev;
root->prev = element;
} else
element->prev = 0;
element->next = root;
DBUG_RETURN(element); /* New root */
}
LIST *list_delete(LIST *root, LIST *element) {
if (element->prev)
element->prev->next = element->next;
else
root = element->next;
if (element->next) element->next->prev = element->prev;
return root;
}
void list_free(LIST *root, uint free_data) {
LIST *next;
while (root) {
next = root->next;
if (free_data) my_free(root->data);
my_free(root);
root = next;
}
}
LIST *list_cons(void *data, LIST *list) {
LIST *new_charset =
(LIST *)my_malloc(key_memory_LIST, sizeof(LIST), MYF(MY_FAE));
if (!new_charset) return 0;
new_charset->data = data;
return list_add(list, new_charset);
}
LIST *list_reverse(LIST *root) {
LIST *last;
last = root;
while (root) {
last = root;
root = root->next;
last->next = last->prev;
last->prev = root;
}
return last;
}
uint list_length(LIST *list) {
uint count;
for (count = 0; list; list = list->next, count++)
;
return count;
}
int list_walk(LIST *list, list_walk_action action, uchar *argument) {
int error = 0;
while (list) {
if ((error = (*action)(list->data, argument))) return error;
list = list_rest(list);
}
return 0;
}
|
