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
|
/*
* Copyright 2013-2015 Samy Al Bahra
* Copyright 2013-2014 AppNexus, Inc.
* 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.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR 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 AUTHOR 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.
*/
#include <ck_array.h>
#include <ck_cc.h>
#include <ck_pr.h>
#include <ck_stdbool.h>
#include <ck_string.h>
static struct _ck_array *
ck_array_create(struct ck_malloc *allocator, unsigned int length)
{
struct _ck_array *active;
active = allocator->malloc(sizeof(struct _ck_array) + sizeof(void *) * length);
if (active == NULL)
return NULL;
active->n_committed = 0;
active->length = length;
return active;
}
bool
ck_array_init(struct ck_array *array, unsigned int mode, struct ck_malloc *allocator, unsigned int length)
{
struct _ck_array *active;
(void)mode;
if (allocator->realloc == NULL ||
allocator->malloc == NULL ||
allocator->free == NULL ||
length == 0)
return false;
active = ck_array_create(allocator, length);
if (active == NULL)
return false;
array->n_entries = 0;
array->allocator = allocator;
array->active = active;
array->transaction = NULL;
return true;
}
bool
ck_array_put(struct ck_array *array, void *value)
{
struct _ck_array *target;
unsigned int size;
/*
* If no transaction copy has been necessary, attempt to do in-place
* modification of the array.
*/
if (array->transaction == NULL) {
target = array->active;
if (array->n_entries == target->length) {
size = target->length << 1;
target = array->allocator->realloc(target,
sizeof(struct _ck_array) + sizeof(void *) * array->n_entries,
sizeof(struct _ck_array) + sizeof(void *) * size,
true);
if (target == NULL)
return false;
ck_pr_store_uint(&target->length, size);
/* Serialize with respect to contents. */
ck_pr_fence_store();
ck_pr_store_ptr(&array->active, target);
}
target->values[array->n_entries++] = value;
return true;
}
target = array->transaction;
if (array->n_entries == target->length) {
size = target->length << 1;
target = array->allocator->realloc(target,
sizeof(struct _ck_array) + sizeof(void *) * array->n_entries,
sizeof(struct _ck_array) + sizeof(void *) * size,
true);
if (target == NULL)
return false;
target->length = size;
array->transaction = target;
}
target->values[array->n_entries++] = value;
return false;
}
int
ck_array_put_unique(struct ck_array *array, void *value)
{
unsigned int i, limit;
void **v;
limit = array->n_entries;
if (array->transaction != NULL) {
v = array->transaction->values;
} else {
v = array->active->values;
}
for (i = 0; i < limit; i++) {
if (v[i] == value)
return 1;
}
return -!ck_array_put(array, value);
}
bool
ck_array_remove(struct ck_array *array, void *value)
{
struct _ck_array *target;
unsigned int i;
if (array->transaction != NULL) {
target = array->transaction;
for (i = 0; i < array->n_entries; i++) {
if (target->values[i] == value) {
target->values[i] = target->values[--array->n_entries];
return true;
}
}
return false;
}
target = array->active;
for (i = 0; i < array->n_entries; i++) {
if (target->values[i] == value)
break;
}
if (i == array->n_entries)
return false;
/* If there are pending additions, immediately eliminate the operation. */
if (target->n_committed != array->n_entries) {
ck_pr_store_ptr(&target->values[i], target->values[--array->n_entries]);
return true;
}
/*
* The assumption is that these allocations are small to begin with.
* If there is no immediate opportunity for transaction, allocate a
* transactional array which will be applied upon commit time.
*/
target = ck_array_create(array->allocator, array->n_entries);
if (target == NULL)
return false;
memcpy(target->values, array->active->values, sizeof(void *) * array->n_entries);
target->length = array->n_entries;
target->n_committed = array->n_entries;
target->values[i] = target->values[--array->n_entries];
array->transaction = target;
return true;
}
bool
ck_array_commit(ck_array_t *array)
{
struct _ck_array *m = array->transaction;
if (m != NULL) {
struct _ck_array *p;
m->n_committed = array->n_entries;
ck_pr_fence_store();
p = array->active;
ck_pr_store_ptr(&array->active, m);
array->allocator->free(p, sizeof(struct _ck_array) +
p->length * sizeof(void *), true);
array->transaction = NULL;
return true;
}
ck_pr_fence_store();
ck_pr_store_uint(&array->active->n_committed, array->n_entries);
return true;
}
void
ck_array_deinit(struct ck_array *array, bool defer)
{
array->allocator->free(array->active,
sizeof(struct _ck_array) + sizeof(void *) * array->active->length, defer);
if (array->transaction != NULL) {
array->allocator->free(array->transaction,
sizeof(struct _ck_array) + sizeof(void *) * array->transaction->length, defer);
}
array->transaction = array->active = NULL;
return;
}
|
