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
|
/*
* libEtPan! -- a mail stuff library
*
* carray - Implements simple dynamic pointer arrays
*
* Copyright (c) 1999-2005, Gaël Roualland <gael.roualland@iname.com>
* interface changes - 2005 - DINH Viet Hoa
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the libEtPan! project nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHORS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
/*
* $Id$
*/
#include <stdlib.h>
#include <string.h>
#include "carray.h"
carray * carray_new(unsigned int initsize) {
carray * array;
array = (carray *) malloc(sizeof(carray));
if (!array) return NULL;
array->len = 0;
array->max = initsize;
array->array = (void **) malloc(sizeof(void *) * initsize);
if (!array->array) {
free(array);
return NULL;
}
return array;
}
int carray_add(carray * array, void * data, unsigned int * index) {
int r;
r = carray_set_size(array, array->len + 1);
if (r < 0)
return r;
array->array[array->len - 1] = data;
if (index != NULL)
* index = array->len - 1;
return 0;
}
int carray_set_size(carray * array, unsigned int new_size)
{
if (new_size > array->max) {
unsigned int n = array->max * 2;
void * new;
while (n <= new_size)
n *= 2;
new = (void **) realloc(array->array, sizeof(void *) * n);
if (!new)
return -1;
array->array = new;
array->max = n;
}
array->len = new_size;
return 0;
}
int carray_delete_fast(carray * array, unsigned int indx) {
if (indx >= array->len)
return -1;
array->array[indx] = NULL;
return 0;
}
int carray_delete(carray * array, unsigned int indx) {
if (indx >= array->len)
return -1;
if (indx != --array->len)
array->array[indx] = array->array[array->len];
return 0;
}
int carray_delete_slow(carray * array, unsigned int indx) {
if (indx >= array->len)
return -1;
if (indx != --array->len)
memmove(array->array + indx, array->array + indx + 1,
(array->len - indx) * sizeof(void *));
return 0;
}
#ifdef NO_MACROS
void ** carray_data(carray * array) {
return array->array;
}
unsigned int carray_count(carray * array) {
return array->len;
}
void * carray_get(carray * array, unsigned int indx) {
return array->array[indx];
}
void carray_set(carray * array, unsigned int indx, void * value) {
array->array[indx] = value;
}
#endif
void carray_free(carray * array) {
free(array->array);
free(array);
}
|
