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
|
/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License (the "License").
* You may not use this file except in compliance with the License.
*
* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
* or http://www.opensolaris.org/os/licensing.
* See the License for the specific language governing permissions
* and limitations under the License.
*
* When distributing Covered Code, include this CDDL HEADER in each
* file and include the License file at usr/src/OPENSOLARIS.LICENSE.
* If applicable, add the following below this CDDL HEADER, with the
* fields enclosed by brackets "[]" replaced with your own identifying
* information: Portions Copyright [yyyy] [name of copyright owner]
*
* CDDL HEADER END
*/
/*
* Copyright 2008 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*
*/
/* $Id: list.c 146 2006-03-24 00:26:54Z njacobs $ */
#pragma ident "%Z%%M% %I% %E% SMI"
/*LINTLIBRARY*/
#include <stdlib.h>
#include <stdarg.h>
#include <errno.h>
static int __list_increment = 16;
#define LIST_SIZE(x) ((((x) / __list_increment) + 1) * __list_increment)
int
list_append(void ***list, void *item)
{
int count;
if ((list == NULL) || (item == NULL)) {
errno = EINVAL;
return (-1);
}
if (item != NULL) {
if (*list == NULL)
*list = (void **)calloc(__list_increment,
sizeof (void *));
for (count = 0; (*list)[count] != NULL; count++)
;
if ((count + 1) % __list_increment == 0) { /* expand the list */
void **new_list = NULL;
int new_size = LIST_SIZE(count + 1);
new_list = (void **)calloc(new_size, sizeof (void *));
if (new_list == NULL)
return (-1);
for (count = 0; (*list)[count] != NULL; count++)
new_list[count] = (*list)[count];
free(*list);
*list = new_list;
}
(*list)[count] = item;
}
return (0);
}
/*
* list_concatenate() takes in two NULL terminated lists of items (type **)
* and creates a new list with items from list2 appended on the end of
* the list of items from list1. The result is a list (type **). If
* there is a failure, -1 is returned.
*/
int
list_concatenate(void ***result, void **list2)
{
void **list1;
int size1 = 0;
int size2 = 0;
int new_size = 0;
if ((result == NULL) || ((*result == NULL) && (list2 == NULL))) {
errno = EINVAL;
return (-1);
}
list1 = *result;
if (list1 != NULL)
for (size1 = 0; list1[size1] != NULL; size1++)
;
if (list2 != NULL)
for (size2 = 0; list2[size2] != NULL; size2++)
;
/* list1 + list2 padded to a multiple of _list_increment */
new_size = LIST_SIZE(size1 + size2);
if ((*result = (void **)calloc((new_size), sizeof (void *))) != NULL) {
int count = 0;
if (list1 != NULL)
for (size1 = 0; list1[size1] != NULL; size1++)
(*result)[count++] = list1[size1];
if (list2 != NULL)
for (size2 = 0; list2[size2] != NULL; size2++)
(*result)[count++] = list2[size2];
free(list1);
}
return (0);
}
/*
* list_locate() iterates through the list passed in and uses the comparison
* routine and element passed in to find an element in the list. It
* returns the first element matched, or NULL if none exists
*/
void *
list_locate(void **list, int (*compare)(void *, void *), void *element)
{
int current = 0;
if ((list != NULL) && (element != NULL))
for (current = 0; list[current] != NULL; current++)
if ((compare)(list[current], element) == 0)
return (list[current]);
return (NULL);
}
void
list_remove(void ***list, void *item)
{
int i = 0, count;
if ((list == NULL) || (*list == NULL) || (item == NULL))
return;
/* size the original list */
for (count = 0; (*list)[count] != NULL; count++)
if ((*list)[count] == item) { /* mark the location of item */
i = count;
item = NULL;
}
/* if found, remove it */
if (item == NULL) {
/* shift the list over the item */
for (++i; ((*list)[i] != NULL); i++)
(*list)[i-1] = (*list)[i];
(*list)[i-1] = NULL;
}
/* if found, removed, and list should shrink, shrink it */
if ((item == NULL) && (LIST_SIZE(i) < LIST_SIZE(count))) {
void **tmp = (void **)calloc(LIST_SIZE(i), sizeof (void *));
if (tmp != NULL) {
for (i = 0; (*list)[i] != NULL; i++)
tmp[i] = (*list)[i];
free(*list);
*list = tmp;
}
}
}
|
