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
|
/*********************************************************
* Copyright (C) 2004-2015 VMware, Inc. All rights reserved.
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU Lesser General Public License as published
* by the Free Software Foundation version 2.1 and no 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 Lesser GNU General Public
* License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program; if not, write to the Free Software Foundation, Inc.,
* 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
*********************************************************/
/*
* dynarray.c --
*
* Dynamic array of objects -- tonyc
*/
#include <stdlib.h>
#include "vmware.h"
#include "dynarray.h"
/*
*-----------------------------------------------------------------------------
*
* DynArray_Init --
*
* Initialize the dynamic array
*
* Results:
* TRUE on success. FALSE on failure.
*
* Side effects:
* See above
*
*-----------------------------------------------------------------------------
*/
Bool
DynArray_Init(DynArray *a, // IN/OUT
unsigned int count, // IN
size_t width) // IN
{
ASSERT(a);
DynBuf_Init(&a->buf);
a->width = width;
return DynArray_SetCount(a, count);
}
/*
*-----------------------------------------------------------------------------
*
* DynArray_Destroy --
*
* Destroy the array
*
* Results:
* None
*
* Side effects:
* See above
*
*-----------------------------------------------------------------------------
*/
void
DynArray_Destroy(DynArray *a) // IN/OUT
{
ASSERT(a);
DynBuf_Destroy(&a->buf);
}
/*
*-----------------------------------------------------------------------------
*
* DynArray_SetCount --
*
* Sets the number of elements in the array. This may enlarge
* the size of the array.
*
* Results:
* TRUE on success
* FALSE on failure (not enough memory)
*
* Side effects:
* May resize the array
*
*-----------------------------------------------------------------------------
*/
Bool
DynArray_SetCount(DynArray *a, // IN/OUT
unsigned int c) // IN
{
size_t needed, allocated;
ASSERT(a);
needed = c * a->width;
allocated = DynBuf_GetAllocatedSize(&a->buf);
if (allocated < needed) {
if (!DynBuf_Enlarge(&a->buf, needed)) {
return FALSE;
}
}
DynBuf_SetSize(&a->buf, needed);
return TRUE;
}
/*
*-----------------------------------------------------------------------------
*
* DynArray_AllocCount --
*
* Returns the actual size of the array. If you want the effective
* size, use DynArray_Count. Technically, you don't need this API
* unless you're doing trimming (i.e. Don't bother trimming if
* DynArray_AllocCount is within some threshold of DynArray_Count.
* It won't buy you much).
*
* XXX: This is relatively slow, since we do an integer division.
* Avoid calling this in inner loops.
*
* Results:
* See above.
*
* Side effects:
* None.
*
*-----------------------------------------------------------------------------
*/
unsigned int
DynArray_AllocCount(const DynArray *a) // IN
{
ASSERT(a);
return (unsigned int) (DynBuf_GetAllocatedSize(&a->buf) / a->width);
}
/*
*-----------------------------------------------------------------------------
*
* DynArray_QSort --
*
* A wrapper for the quicksort function. Sorts the DynArray
* according to the provided comparison function.
*
* Results:
* None.
*
* Side effects:
* None.
*
*-----------------------------------------------------------------------------
*/
void
DynArray_QSort(DynArray *a, // IN/OUT
DynArrayCmp compare) // IN
{
uint8 *arrayBuf;
ASSERT(a);
ASSERT(compare);
arrayBuf = DynBuf_Get(&a->buf);
qsort(arrayBuf, DynArray_Count(a), a->width, compare);
}
|
