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
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include <axutil_array_list.h>
#include <axutil_utils.h>
#include <string.h>
struct axutil_array_list
{
/**The number of elements in this list. */
int size;
/**Current capacity of this list. */
int capacity;
/** Where the data is stored. */
void **data;
};
AXIS2_EXTERN struct axutil_array_list *AXIS2_CALL
axutil_array_list_create(
const axutil_env_t * env,
int capacity)
{
axutil_array_list_t *array_list = NULL;
array_list = AXIS2_MALLOC(env->allocator, sizeof(axutil_array_list_t));
if(!array_list)
{
AXIS2_ERROR_SET(env->error, AXIS2_ERROR_NO_MEMORY, AXIS2_FAILURE);
AXIS2_LOG_ERROR(env->log, AXIS2_LOG_SI, "Out of memory");
return NULL;
}
array_list->size = 0;
array_list->capacity = 0;
array_list->data = NULL;
/* Check capacity, and set the default if error */
if(capacity <= 0)
capacity = AXIS2_ARRAY_LIST_DEFAULT_CAPACITY;
array_list->data = AXIS2_MALLOC(env->allocator, sizeof(void *) * capacity);
if(!array_list->data)
{
axutil_array_list_free(array_list, env);
AXIS2_ERROR_SET(env->error, AXIS2_ERROR_NO_MEMORY, AXIS2_FAILURE);
AXIS2_LOG_ERROR(env->log, AXIS2_LOG_SI, "Out of memory");
return NULL;
}
array_list->capacity = capacity;
return array_list;
}
AXIS2_EXTERN axis2_status_t AXIS2_CALL
axutil_array_list_ensure_capacity(
struct axutil_array_list * array_list,
const axutil_env_t * env,
int min_capacity)
{
AXIS2_PARAM_CHECK(env->error, array_list, AXIS2_FAILURE);
if(min_capacity > array_list->capacity)
{
int new_capacity = (array_list->capacity * 2 > min_capacity) ? (array_list->capacity * 2)
: min_capacity;
void **data = (void **)AXIS2_MALLOC(env->allocator, sizeof(void *) * new_capacity);
if(!data)
{
AXIS2_ERROR_SET(env->error, AXIS2_ERROR_NO_MEMORY, AXIS2_FAILURE);
AXIS2_LOG_ERROR(env->log, AXIS2_LOG_SI, "Out of memory");
return AXIS2_FAILURE;
}
memcpy(data, array_list->data, sizeof(void *) * array_list->capacity);
AXIS2_FREE(env->allocator, array_list->data);
array_list->data = data;
array_list->capacity = new_capacity;
}
return AXIS2_SUCCESS;
}
AXIS2_EXTERN int AXIS2_CALL
axutil_array_list_size(
struct axutil_array_list *array_list,
const axutil_env_t * env)
{
/* Don't use AXIS2_PARAM_CHECK to verify array_list, as it clobbers
env->error->status_code on no error destroying the information
therein that an error has already occurred. */
if(!array_list)
return 0;
return array_list->size;
}
AXIS2_EXTERN axis2_bool_t AXIS2_CALL
axutil_array_list_is_empty(
struct axutil_array_list * array_list,
const axutil_env_t * env)
{
AXIS2_PARAM_CHECK(env->error, array_list, AXIS2_FAILURE);
return array_list->size == 0;
}
AXIS2_EXTERN axis2_bool_t AXIS2_CALL
axutil_array_list_contains(
struct axutil_array_list * array_list,
const axutil_env_t * env,
void *e)
{
AXIS2_PARAM_CHECK(env->error, array_list, AXIS2_FAILURE);
return axutil_array_list_index_of(array_list, env, e) != -1;
}
AXIS2_EXTERN int AXIS2_CALL
axutil_array_list_index_of(
struct axutil_array_list *array_list,
const axutil_env_t * env,
void *e)
{
int i = 0;
AXIS2_PARAM_CHECK(env->error, array_list, AXIS2_FAILURE);
for(i = 0; i < array_list->size; i++)
if(e == array_list->data[i])
return i;
return -1;
}
AXIS2_EXTERN void *AXIS2_CALL
axutil_array_list_get(
struct axutil_array_list *array_list,
const axutil_env_t * env,
int index)
{
/* Don't use AXIS2_PARAM_CHECK to verify array_list, as it clobbers
env->error->status_code on no error destroying the information
therein that an error has already occurred. */
if(axutil_array_list_check_bound_exclusive(array_list, env, index))
return array_list->data[index];
else
return NULL;
}
AXIS2_EXTERN void *AXIS2_CALL
axutil_array_list_set(
struct axutil_array_list *array_list,
const axutil_env_t * env,
int index,
void *e)
{
void *result = NULL;
AXIS2_PARAM_CHECK(env->error, array_list, NULL);
if(axutil_array_list_check_bound_exclusive(array_list, env, index))
{
result = array_list->data[index];
array_list->data[index] = e;
}
return result;
}
AXIS2_EXTERN axis2_status_t AXIS2_CALL
axutil_array_list_add(
struct axutil_array_list * array_list,
const axutil_env_t * env,
const void *e)
{
AXIS2_PARAM_CHECK(env->error, array_list, AXIS2_FAILURE);
if(array_list->size == array_list->capacity)
if(axutil_array_list_ensure_capacity(array_list, env, array_list->size + 1)
!= AXIS2_SUCCESS)
return AXIS2_FAILURE;
array_list->data[array_list->size++] = (void *)e;
return AXIS2_SUCCESS;
}
AXIS2_EXTERN axis2_status_t AXIS2_CALL
axutil_array_list_add_at(
struct axutil_array_list * array_list,
const axutil_env_t * env,
const int index,
const void *e)
{
int i = 0;
AXIS2_PARAM_CHECK(env->error, array_list, AXIS2_FAILURE);
if(!axutil_array_list_check_bound_inclusive(array_list, env, index))
return AXIS2_FAILURE;
if(array_list->size == array_list->capacity)
{
if(axutil_array_list_ensure_capacity(array_list, env, array_list->size + 1)
!= AXIS2_SUCCESS)
return AXIS2_FAILURE;
}
if(index != array_list->size)
{
for(i = array_list->size; i > index; i--)
array_list->data[i] = array_list->data[i - 1];
}
array_list->data[index] = (void *)e;
array_list->size++;
return AXIS2_SUCCESS;
}
AXIS2_EXTERN void *AXIS2_CALL
axutil_array_list_remove(
struct axutil_array_list *array_list,
const axutil_env_t * env,
int index)
{
void *result = NULL;
int i = 0;
AXIS2_PARAM_CHECK(env->error, array_list, NULL);
if(axutil_array_list_check_bound_exclusive(array_list, env, index))
{
result = array_list->data[index];
for(i = index; i < array_list->size - 1; i++)
array_list->data[i] = array_list->data[i + 1];
array_list->size--;
}
return result;
}
AXIS2_EXTERN axis2_bool_t AXIS2_CALL
axutil_array_list_check_bound_inclusive(
struct axutil_array_list * array_list,
const axutil_env_t * env,
int index)
{
/* Don't use AXIS2_PARAM_CHECK to verify array_list, as it clobbers
env->error->status_code on no error destroying the information
therein that an error has already occurred. */
if(!array_list || index < 0 || index > array_list->size)
{
AXIS2_ERROR_SET(env->error, AXIS2_ERROR_INDEX_OUT_OF_BOUNDS, AXIS2_FAILURE);
return AXIS2_FALSE;
}
return AXIS2_TRUE;
}
AXIS2_EXTERN axis2_bool_t AXIS2_CALL
axutil_array_list_check_bound_exclusive(
struct axutil_array_list * array_list,
const axutil_env_t * env,
int index)
{
/* Don't use AXIS2_PARAM_CHECK to verify array_list, as it clobbers
env->error->status_code on no error destroying the information
therein that an error has already occurred. */
if(!array_list || index < 0 || index >= array_list->size)
{
AXIS2_ERROR_SET(env->error, AXIS2_ERROR_INDEX_OUT_OF_BOUNDS, AXIS2_FAILURE);
return AXIS2_FALSE;
}
return AXIS2_TRUE;
}
AXIS2_EXTERN void AXIS2_CALL
axutil_array_list_free(
struct axutil_array_list *array_list,
const axutil_env_t * env)
{
AXIS2_PARAM_CHECK_VOID(env->error, array_list);
if(array_list->data)
{
AXIS2_FREE(env->allocator, array_list->data);
}
AXIS2_FREE(env->allocator, array_list);
return;
}
AXIS2_EXTERN void AXIS2_CALL
axutil_array_list_free_void_arg(
void *array_list,
const axutil_env_t * env)
{
axutil_array_list_t *array_list_l = NULL;
AXIS2_PARAM_CHECK_VOID(env->error, array_list);
array_list_l = (axutil_array_list_t *)array_list;
axutil_array_list_free(array_list_l, env);
return;
}
|