forked from twitter/twemproxy
-
Notifications
You must be signed in to change notification settings - Fork 0
/
nc_array.c
204 lines (158 loc) · 3.62 KB
/
nc_array.c
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
/*
* twemproxy - A fast and lightweight proxy for memcached protocol.
* Copyright (C) 2011 Twitter, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include <stdlib.h>
#include <nc_core.h>
struct array *
array_create(uint32_t n, size_t size)
{
struct array *a;
ASSERT(n != 0 && size != 0);
a = nc_alloc(sizeof(*a));
if (a == NULL) {
return NULL;
}
a->elem = nc_alloc(n * size);
if (a->elem == NULL) {
nc_free(a);
return NULL;
}
a->nelem = 0;
a->size = size;
a->nalloc = n;
return a;
}
void
array_destroy(struct array *a)
{
array_deinit(a);
nc_free(a);
}
rstatus_t
array_init(struct array *a, uint32_t n, size_t size)
{
ASSERT(n != 0 && size != 0);
a->elem = nc_alloc(n * size);
if (a->elem == NULL) {
return NC_ENOMEM;
}
a->nelem = 0;
a->size = size;
a->nalloc = n;
return NC_OK;
}
void
array_deinit(struct array *a)
{
ASSERT(a->nelem == 0);
if (a->elem != NULL) {
nc_free(a->elem);
}
}
uint32_t
array_idx(const struct array *a, const void *elem)
{
const uint8_t *p, *q;
uint32_t off, idx;
ASSERT(elem >= a->elem);
p = a->elem;
q = elem;
off = (uint32_t)(q - p);
ASSERT(off % (uint32_t)a->size == 0);
idx = off / (uint32_t)a->size;
return idx;
}
void *
array_push(struct array *a)
{
void *elem, *new;
size_t size;
if (a->nelem == a->nalloc) {
/* the array is full; allocate new array */
size = a->size * a->nalloc;
new = nc_realloc(a->elem, 2 * size);
if (new == NULL) {
return NULL;
}
a->elem = new;
a->nalloc *= 2;
}
elem = (uint8_t *)a->elem + a->size * a->nelem;
a->nelem++;
return elem;
}
void *
array_pop(struct array *a)
{
void *elem;
ASSERT(a->nelem != 0);
a->nelem--;
elem = (uint8_t *)a->elem + a->size * a->nelem;
return elem;
}
void *
array_get(const struct array *a, uint32_t idx)
{
void *elem;
ASSERT(a->nelem != 0);
ASSERT(idx < a->nelem);
elem = (uint8_t *)a->elem + (a->size * idx);
return elem;
}
void *
array_top(const struct array *a)
{
ASSERT(a->nelem != 0);
return array_get(a, a->nelem - 1);
}
void
array_swap(struct array *a, struct array *b)
{
struct array tmp;
tmp = *a;
*a = *b;
*b = tmp;
}
/*
* Sort nelem elements of the array in ascending order based on the
* compare comparator.
*/
void
array_sort(struct array *a, array_compare_t compare)
{
ASSERT(a->nelem != 0);
qsort(a->elem, a->nelem, a->size, compare);
}
/*
* Calls the func once for each element in the array as long as func returns
* success. On failure short-circuits and returns the error status.
*/
rstatus_t
array_each(const struct array *a, array_each_t func, void *data)
{
uint32_t i, nelem;
ASSERT(array_n(a) != 0);
ASSERT(func != NULL);
for (i = 0, nelem = array_n(a); i < nelem; i++) {
void *elem = array_get(a, i);
rstatus_t status;
status = func(elem, data);
if (status != NC_OK) {
return status;
}
}
return NC_OK;
}