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
|
/*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public
* License v2 as published by the Free Software Foundation.
*
* 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 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., 59 Temple Place - Suite 330,
* Boston, MA 021110-1307, USA.
*/
#define _GNU_SOURCE 1
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "common/array.h"
/*
* Extensible array of pointers. Length is the number of user defined pointers,
* capacity is the whole allocated size. Pointers are potentially unstable after
* an append operation. Array initialized to all zeros is valid and can be extended.
*/
static const int alloc_increment = 32;
/* Initialize new array, preallocate @capacity elemennts. */
int array_init(struct array *arr, unsigned int capacity)
{
void *tmp;
arr->data = NULL;
arr->length = 0;
arr->capacity = capacity;
if (arr->capacity == 0)
arr->capacity = alloc_increment;
tmp = calloc(arr->capacity, sizeof(void *));
if (!tmp)
return -1;
arr->data = tmp;
return 0;
}
/* Free internal data array. */
void array_free(struct array *arr)
{
free(arr->data);
arr->length = 0;
arr->capacity = 0;
arr->data = NULL;
}
/* Free all elements up to length. */
void array_free_elements(struct array *arr)
{
unsigned int i;
for (i = 0; i < arr->length; i++) {
free(arr->data[i]);
arr->data[i] = NULL;
}
arr->length = 0;
}
/* Reset all elements to NULL up to capacity. */
void array_clear(struct array *arr)
{
for (unsigned int i = 0; i < arr->capacity; i++)
arr->data[i] = NULL;
}
/* Use the whole capacity for elements. */
void array_use_capacity(struct array *arr)
{
arr->length = arr->capacity;
}
/* Append a new element (increase length), extend the array if needed. */
int array_append(struct array *arr, void *element)
{
if (arr->length == arr->capacity) {
void **tmp;
tmp = realloc(arr->data, (arr->capacity + alloc_increment) * sizeof(void *));
if (!tmp)
return -1;
arr->data = tmp;
memset(&arr->data[arr->capacity], 0, alloc_increment * sizeof(void *));
arr->capacity += alloc_increment;
}
arr->data[arr->length] = element;
arr->length++;
return 0;
}
|
