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
|
/*
* $Id: Array.c,v 1.7 2001/02/07 18:56:50 hno Exp $
*
* AUTHOR: Alex Rousskov
*
* SQUID Web Proxy Cache http://www.squid-cache.org/
* ----------------------------------------------------------
*
* Squid is the result of efforts by numerous individuals from
* the Internet community; see the CONTRIBUTORS file for full
* details. Many organizations have provided support for Squid's
* development; see the SPONSORS file for full details. Squid is
* Copyrighted (C) 2001 by the Regents of the University of
* California; see the COPYRIGHT file for full details. Squid
* incorporates software developed and/or copyrighted by other
* sources; see the CREDITS file for full details.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* 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 02111, USA.
*
*/
/*
* Array is an array of (void*) items with unlimited capacity
*
* Array grows when arrayAppend() is called and no space is left
* Currently, array does not have an interface for deleting an item because
* we do not need such an interface yet.
*/
#include "config.h"
#include "Array.h"
#if HAVE_ASSERT_H
#include <assert.h>
#endif
#if HAVE_STRING_H
#include <string.h>
#endif
#include "util.h"
#include "Array.h"
static void arrayGrow(Array * a, int min_capacity);
Array *
arrayCreate(void)
{
Array *a = xmalloc(sizeof(Array));
arrayInit(a);
return a;
}
void
arrayInit(Array * a)
{
assert(a);
memset(a, 0, sizeof(Array));
}
void
arrayClean(Array * a)
{
assert(a);
/* could also warn if some objects are left */
xfree(a->items);
a->items = NULL;
}
void
arrayDestroy(Array * a)
{
assert(a);
arrayClean(a);
xfree(a);
}
void
arrayAppend(Array * a, void *obj)
{
assert(a);
if (a->count >= a->capacity)
arrayGrow(a, a->count + 1);
a->items[a->count++] = obj;
}
/* if you are going to append a known and large number of items, call this first */
void
arrayPreAppend(Array * a, int app_count)
{
assert(a);
if (a->count + app_count > a->capacity)
arrayGrow(a, a->count + app_count);
}
/* grows internal buffer to satisfy required minimal capacity */
static void
arrayGrow(Array * a, int min_capacity)
{
const int min_delta = 16;
int delta;
assert(a->capacity < min_capacity);
delta = min_capacity;
/* make delta a multiple of min_delta */
delta += min_delta - 1;
delta /= min_delta;
delta *= min_delta;
/* actual grow */
assert(delta > 0);
a->capacity += delta;
a->items = a->items ?
xrealloc(a->items, a->capacity * sizeof(void *)) :
xmalloc(a->capacity * sizeof(void *));
/* reset, just in case */
memset(a->items + a->count, 0, (a->capacity - a->count) * sizeof(void *));
}
|
