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
305
306
307
308
309
310
311
312
313
314
|
/*
* $Header$
*
* Copyright 2006, 2007 Massachusetts Institute of Technology.
* All Rights Reserved.
*
* Export of this software from the United States of America may
* require a specific license from the United States Government.
* It is the responsibility of any person or organization contemplating
* export to obtain such a license before exporting.
*
* WITHIN THAT CONSTRAINT, permission to use, copy, modify, and
* distribute this software and its documentation for any purpose and
* without fee is hereby granted, provided that the above copyright
* notice appear in all copies and that both that copyright notice and
* this permission notice appear in supporting documentation, and that
* the name of M.I.T. not be used in advertising or publicity pertaining
* to distribution of the software without specific, written prior
* permission. Furthermore if you modify this software you must label
* your software as modified software and not distribute it in such a
* fashion that it might be confused with the original M.I.T. software.
* M.I.T. makes no representations about the suitability of
* this software for any purpose. It is provided "as is" without express
* or implied warranty.
*/
#include "cci_common.h"
#include "cci_array_internal.h"
#ifdef WIN32
#include "k5-platform.h"
#endif
/* ------------------------------------------------------------------------ */
struct cci_array_d {
cci_array_object_t *objects;
cc_uint64 count;
cc_uint64 max_count;
cci_array_object_release_t object_release;
};
struct cci_array_d cci_array_initializer = { NULL, 0, 0, NULL };
#define CCI_ARRAY_COUNT_INCREMENT 16
/* ------------------------------------------------------------------------ */
static cc_int32 cci_array_resize (cci_array_t io_array,
cc_uint64 in_new_count)
{
cc_int32 err = ccNoError;
cc_uint64 new_max_count = 0;
if (!io_array) { err = cci_check_error (ccErrBadParam); }
if (!err) {
cc_uint64 old_max_count = io_array->max_count;
new_max_count = io_array->max_count;
if (in_new_count > old_max_count) {
/* Expand the array */
while (in_new_count > new_max_count) {
new_max_count += CCI_ARRAY_COUNT_INCREMENT;
}
} else if ((in_new_count + CCI_ARRAY_COUNT_INCREMENT) < old_max_count) {
/* Shrink the array, but never drop below CC_ARRAY_COUNT_INCREMENT */
while ((in_new_count + CCI_ARRAY_COUNT_INCREMENT) < new_max_count &&
(new_max_count > CCI_ARRAY_COUNT_INCREMENT)) {
new_max_count -= CCI_ARRAY_COUNT_INCREMENT;
}
}
}
if (!err && io_array->max_count != new_max_count) {
cci_array_object_t *objects = io_array->objects;
if (!objects) {
objects = malloc (new_max_count * sizeof (*objects));
} else {
objects = realloc (objects, new_max_count * sizeof (*objects));
}
if (!objects) { err = cci_check_error (ccErrNoMem); }
if (!err) {
io_array->objects = objects;
io_array->max_count = new_max_count;
}
}
return cci_check_error (err);
}
#ifdef TARGET_OS_MAC
#pragma mark -
#endif
/* ------------------------------------------------------------------------ */
cc_int32 cci_array_new (cci_array_t *out_array,
cci_array_object_release_t in_array_object_release)
{
cc_int32 err = ccNoError;
cci_array_t array = NULL;
if (!out_array) { err = cci_check_error (ccErrBadParam); }
if (!err) {
array = malloc (sizeof (*array));
if (array) {
*array = cci_array_initializer;
array->object_release = in_array_object_release;
} else {
err = cci_check_error (ccErrNoMem);
}
}
if (!err) {
*out_array = array;
array = NULL;
}
cci_array_release (array);
return cci_check_error (err);
}
/* ------------------------------------------------------------------------ */
cc_int32 cci_array_release (cci_array_t io_array)
{
cc_int32 err = ccNoError;
if (!err && io_array) {
cc_uint64 i;
if (io_array->object_release) {
for (i = 0; i < io_array->count; i++) {
io_array->object_release (io_array->objects[i]);
}
}
free (io_array->objects);
free (io_array);
}
return err;
}
/* ------------------------------------------------------------------------ */
cc_uint64 cci_array_count (cci_array_t in_array)
{
return in_array ? in_array->count : 0;
}
/* ------------------------------------------------------------------------ */
cci_array_object_t cci_array_object_at_index (cci_array_t io_array,
cc_uint64 in_position)
{
if (io_array && in_position < io_array->count) {
return io_array->objects[in_position];
} else {
if (!io_array) {
cci_debug_printf ("%s() got NULL array", __FUNCTION__);
} else {
cci_debug_printf ("%s() got bad index %lld (count = %lld)", __FUNCTION__,
in_position, io_array->count);
}
return NULL;
}
}
#ifdef TARGET_OS_MAC
#pragma mark -
#endif
/* ------------------------------------------------------------------------ */
cc_int32 cci_array_insert (cci_array_t io_array,
cci_array_object_t in_object,
cc_uint64 in_position)
{
cc_int32 err = ccNoError;
if (!io_array ) { err = cci_check_error (ccErrBadParam); }
if (!in_object) { err = cci_check_error (ccErrBadParam); }
if (!err) {
/* Don't try to insert past the end and don't overflow the array */
if (in_position > io_array->count || io_array->count == UINT64_MAX) {
err = cci_check_error (ccErrBadParam);
}
}
if (!err) {
err = cci_array_resize (io_array, io_array->count + 1);
}
if (!err) {
cc_uint64 move_count = io_array->count - in_position;
if (move_count > 0) {
memmove (&io_array->objects[in_position + 1], &io_array->objects[in_position],
move_count * sizeof (*io_array->objects));
}
io_array->objects[in_position] = in_object;
io_array->count++;
}
return cci_check_error (err);
}
/* ------------------------------------------------------------------------ */
cc_int32 cci_array_remove (cci_array_t io_array,
cc_uint64 in_position)
{
cc_int32 err = ccNoError;
if (!io_array) { err = cci_check_error (ccErrBadParam); }
if (!err && in_position >= io_array->count) {
err = cci_check_error (ccErrBadParam);
}
if (!err) {
cc_uint64 move_count = io_array->count - in_position - 1;
cci_array_object_t object = io_array->objects[in_position];
if (move_count > 0) {
memmove (&io_array->objects[in_position], &io_array->objects[in_position + 1],
move_count * sizeof (*io_array->objects));
}
io_array->count--;
if (io_array->object_release) { io_array->object_release (object); }
cci_array_resize (io_array, io_array->count);
}
return cci_check_error (err);
}
/* ------------------------------------------------------------------------ */
cc_int32 cci_array_move (cci_array_t io_array,
cc_uint64 in_position,
cc_uint64 in_new_position,
cc_uint64 *out_real_new_position)
{
cc_int32 err = ccNoError;
if (!io_array ) { err = cci_check_error (ccErrBadParam); }
if (!out_real_new_position) { err = cci_check_error (ccErrBadParam); }
if (!err && in_position >= io_array->count) {
err = cci_check_error (ccErrBadParam);
}
if (!err && in_new_position > io_array->count) {
err = cci_check_error (ccErrBadParam);
}
if (!err) {
cc_uint64 move_from = 0;
cc_uint64 move_to = 0;
cc_uint64 move_count = 0;
cc_uint64 real_new_position = 0;
if (in_position < in_new_position) {
/* shift right, making an empty space so the
* actual new position is one less in_new_position */
move_from = in_position + 1;
move_to = in_position;
move_count = in_new_position - in_position - 1;
real_new_position = in_new_position - 1;
} else if (in_position > in_new_position) {
/* shift left */
move_from = in_new_position;
move_to = in_new_position + 1;
move_count = in_position - in_new_position;
real_new_position = in_new_position;
} else {
real_new_position = in_new_position;
}
if (move_count > 0) {
cci_array_object_t object = io_array->objects[in_position];
memmove (&io_array->objects[move_to], &io_array->objects[move_from],
move_count * sizeof (*io_array->objects));
io_array->objects[real_new_position] = object;
}
*out_real_new_position = real_new_position;
}
return cci_check_error (err);
}
/* ------------------------------------------------------------------------ */
cc_int32 cci_array_push_front (cci_array_t io_array,
cc_uint64 in_position)
{
cc_uint64 real_new_position = 0;
return cci_array_move (io_array, in_position, 0, &real_new_position);
}
|
