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
|
/**
* Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
* SPDX-License-Identifier: Apache-2.0.
*/
#include <aws/common/array_list.h>
#include <aws/common/private/array_list.h>
#include <stdlib.h> /* qsort */
int aws_array_list_calc_necessary_size(struct aws_array_list *AWS_RESTRICT list, size_t index, size_t *necessary_size) {
AWS_PRECONDITION(aws_array_list_is_valid(list));
size_t index_inc = 0;
if (aws_add_size_checked(index, 1, &index_inc)) {
AWS_POSTCONDITION(aws_array_list_is_valid(list));
return AWS_OP_ERR;
}
if (aws_mul_size_checked(index_inc, list->item_size, necessary_size)) {
AWS_POSTCONDITION(aws_array_list_is_valid(list));
return AWS_OP_ERR;
}
AWS_POSTCONDITION(aws_array_list_is_valid(list));
return AWS_OP_SUCCESS;
}
int aws_array_list_shrink_to_fit(struct aws_array_list *AWS_RESTRICT list) {
AWS_PRECONDITION(aws_array_list_is_valid(list));
if (list->alloc) {
size_t ideal_size;
if (aws_mul_size_checked(list->length, list->item_size, &ideal_size)) {
AWS_POSTCONDITION(aws_array_list_is_valid(list));
return AWS_OP_ERR;
}
if (ideal_size < list->current_size) {
void *raw_data = NULL;
if (ideal_size > 0) {
raw_data = aws_mem_acquire(list->alloc, ideal_size);
if (!raw_data) {
AWS_POSTCONDITION(aws_array_list_is_valid(list));
return AWS_OP_ERR;
}
memcpy(raw_data, list->data, ideal_size);
aws_mem_release(list->alloc, list->data);
}
list->data = raw_data;
list->current_size = ideal_size;
}
AWS_POSTCONDITION(aws_array_list_is_valid(list));
return AWS_OP_SUCCESS;
}
AWS_POSTCONDITION(aws_array_list_is_valid(list));
return aws_raise_error(AWS_ERROR_LIST_STATIC_MODE_CANT_SHRINK);
}
int aws_array_list_copy(const struct aws_array_list *AWS_RESTRICT from, struct aws_array_list *AWS_RESTRICT to) {
AWS_FATAL_PRECONDITION(from->item_size == to->item_size);
AWS_FATAL_PRECONDITION(from->data);
AWS_PRECONDITION(aws_array_list_is_valid(from));
AWS_PRECONDITION(aws_array_list_is_valid(to));
size_t copy_size;
if (aws_mul_size_checked(from->length, from->item_size, ©_size)) {
AWS_POSTCONDITION(aws_array_list_is_valid(from));
AWS_POSTCONDITION(aws_array_list_is_valid(to));
return AWS_OP_ERR;
}
if (to->current_size >= copy_size) {
if (copy_size > 0) {
memcpy(to->data, from->data, copy_size);
}
to->length = from->length;
AWS_POSTCONDITION(aws_array_list_is_valid(from));
AWS_POSTCONDITION(aws_array_list_is_valid(to));
return AWS_OP_SUCCESS;
}
/* if to is in dynamic mode, we can just reallocate it and copy */
if (to->alloc != NULL) {
void *tmp = aws_mem_acquire(to->alloc, copy_size);
if (!tmp) {
AWS_POSTCONDITION(aws_array_list_is_valid(from));
AWS_POSTCONDITION(aws_array_list_is_valid(to));
return AWS_OP_ERR;
}
memcpy(tmp, from->data, copy_size);
if (to->data) {
aws_mem_release(to->alloc, to->data);
}
to->data = tmp;
to->length = from->length;
to->current_size = copy_size;
AWS_POSTCONDITION(aws_array_list_is_valid(from));
AWS_POSTCONDITION(aws_array_list_is_valid(to));
return AWS_OP_SUCCESS;
}
return aws_raise_error(AWS_ERROR_DEST_COPY_TOO_SMALL);
}
int aws_array_list_ensure_capacity(struct aws_array_list *AWS_RESTRICT list, size_t index) {
AWS_PRECONDITION(aws_array_list_is_valid(list));
size_t necessary_size;
if (aws_array_list_calc_necessary_size(list, index, &necessary_size)) {
AWS_POSTCONDITION(aws_array_list_is_valid(list));
return AWS_OP_ERR;
}
if (list->current_size < necessary_size) {
if (!list->alloc) {
AWS_POSTCONDITION(aws_array_list_is_valid(list));
return aws_raise_error(AWS_ERROR_INVALID_INDEX);
}
/* this will double capacity if the index isn't bigger than what the
* next allocation would be, but allocates the exact requested size if
* it is. This is largely because we don't have a good way to predict
* the usage pattern to make a smart decision about it. However, if the
* user
* is doing this in an iterative fashion, necessary_size will never be
* used.*/
size_t next_allocation_size = list->current_size << 1;
size_t new_size = next_allocation_size > necessary_size ? next_allocation_size : necessary_size;
if (new_size < list->current_size) {
/* this means new_size overflowed. The only way this happens is on a
* 32-bit system where size_t is 32 bits, in which case we're out of
* addressable memory anyways, or we're on a 64 bit system and we're
* most certainly out of addressable memory. But since we're simply
* going to fail fast and say, sorry can't do it, we'll just tell
* the user they can't grow the list anymore. */
AWS_POSTCONDITION(aws_array_list_is_valid(list));
return aws_raise_error(AWS_ERROR_LIST_EXCEEDS_MAX_SIZE);
}
void *temp = aws_mem_acquire(list->alloc, new_size);
if (!temp) {
AWS_POSTCONDITION(aws_array_list_is_valid(list));
return AWS_OP_ERR;
}
if (list->data) {
memcpy(temp, list->data, list->current_size);
#ifdef DEBUG_BUILD
memset(
(void *)((uint8_t *)temp + list->current_size),
AWS_ARRAY_LIST_DEBUG_FILL,
new_size - list->current_size);
#endif
aws_mem_release(list->alloc, list->data);
}
list->data = temp;
list->current_size = new_size;
}
AWS_POSTCONDITION(aws_array_list_is_valid(list));
return AWS_OP_SUCCESS;
}
static void aws_array_list_mem_swap(void *AWS_RESTRICT item1, void *AWS_RESTRICT item2, size_t item_size) {
enum { SLICE = 128 };
AWS_FATAL_PRECONDITION(item1);
AWS_FATAL_PRECONDITION(item2);
/* copy SLICE sized bytes at a time */
size_t slice_count = item_size / SLICE;
uint8_t temp[SLICE];
for (size_t i = 0; i < slice_count; i++) {
memcpy((void *)temp, (void *)item1, SLICE);
memcpy((void *)item1, (void *)item2, SLICE);
memcpy((void *)item2, (void *)temp, SLICE);
item1 = (uint8_t *)item1 + SLICE;
item2 = (uint8_t *)item2 + SLICE;
}
size_t remainder = item_size & (SLICE - 1); /* item_size % SLICE */
memcpy((void *)temp, (void *)item1, remainder);
memcpy((void *)item1, (void *)item2, remainder);
memcpy((void *)item2, (void *)temp, remainder);
}
void aws_array_list_swap(struct aws_array_list *AWS_RESTRICT list, size_t a, size_t b) {
AWS_FATAL_PRECONDITION(a < list->length);
AWS_FATAL_PRECONDITION(b < list->length);
AWS_PRECONDITION(aws_array_list_is_valid(list));
if (a == b) {
AWS_POSTCONDITION(aws_array_list_is_valid(list));
return;
}
void *item1 = NULL;
void *item2 = NULL;
aws_array_list_get_at_ptr(list, &item1, a);
aws_array_list_get_at_ptr(list, &item2, b);
aws_array_list_mem_swap(item1, item2, list->item_size);
AWS_POSTCONDITION(aws_array_list_is_valid(list));
}
|
