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
|
/* Copyright (C) 2011-2021 by The D Language Foundation, All Rights Reserved
* written by Walter Bright
* http://www.digitalmars.com
* Distributed under the Boost Software License, Version 1.0.
* http://www.boost.org/LICENSE_1_0.txt
* https://github.com/dlang/dmd/blob/master/src/dmd/root/array.h
*/
#pragma once
#include "dsystem.h"
#include "dcompat.h"
#include "object.h"
#include "rmem.h"
template <typename TYPE>
struct Array
{
size_t length;
private:
DArray<TYPE> data;
#define SMALLARRAYCAP 1
TYPE smallarray[SMALLARRAYCAP]; // inline storage for small arrays
Array(const Array&);
public:
Array()
{
data.ptr = NULL;
length = 0;
data.length = 0;
}
~Array()
{
if (data.ptr != &smallarray[0])
mem.xfree(data.ptr);
}
char *toChars() const
{
const char **buf = (const char **)mem.xmalloc(length * sizeof(const char *));
size_t len = 2;
for (size_t u = 0; u < length; u++)
{
buf[u] = ((RootObject *)data.ptr[u])->toChars();
len += strlen(buf[u]) + 1;
}
char *str = (char *)mem.xmalloc(len);
str[0] = '[';
char *p = str + 1;
for (size_t u = 0; u < length; u++)
{
if (u)
*p++ = ',';
len = strlen(buf[u]);
memcpy(p,buf[u],len);
p += len;
}
*p++ = ']';
*p = 0;
mem.xfree(buf);
return str;
}
void push(TYPE ptr)
{
reserve(1);
data.ptr[length++] = ptr;
}
void append(Array *a)
{
insert(length, a);
}
void reserve(size_t nentries)
{
//printf("Array::reserve: length = %d, data.length = %d, nentries = %d\n", (int)length, (int)data.length, (int)nentries);
if (data.length - length < nentries)
{
if (data.length == 0)
{
// Not properly initialized, someone memset it to zero
if (nentries <= SMALLARRAYCAP)
{
data.length = SMALLARRAYCAP;
data.ptr = SMALLARRAYCAP ? &smallarray[0] : NULL;
}
else
{
data.length = nentries;
data.ptr = (TYPE *)mem.xmalloc(data.length * sizeof(TYPE));
}
}
else if (data.length == SMALLARRAYCAP)
{
data.length = length + nentries;
data.ptr = (TYPE *)mem.xmalloc(data.length * sizeof(TYPE));
memcpy(data.ptr, &smallarray[0], length * sizeof(TYPE));
}
else
{
/* Increase size by 1.5x to avoid excessive memory fragmentation
*/
size_t increment = length / 2;
if (nentries > increment) // if 1.5 is not enough
increment = nentries;
data.length = length + increment;
data.ptr = (TYPE *)mem.xrealloc(data.ptr, data.length * sizeof(TYPE));
}
}
}
void remove(size_t i)
{
if (length - i - 1)
memmove(data.ptr + i, data.ptr + i + 1, (length - i - 1) * sizeof(TYPE));
length--;
}
void insert(size_t index, Array *a)
{
if (a)
{
size_t d = a->length;
reserve(d);
if (length != index)
memmove(data.ptr + index + d, data.ptr + index, (length - index) * sizeof(TYPE));
memcpy(data.ptr + index, a->data.ptr, d * sizeof(TYPE));
length += d;
}
}
void insert(size_t index, TYPE ptr)
{
reserve(1);
memmove(data.ptr + index + 1, data.ptr + index, (length - index) * sizeof(TYPE));
data.ptr[index] = ptr;
length++;
}
void setDim(size_t newdim)
{
if (length < newdim)
{
reserve(newdim - length);
}
length = newdim;
}
size_t find(TYPE ptr) const
{
for (size_t i = 0; i < length; i++)
{
if (data.ptr[i] == ptr)
return i;
}
return SIZE_MAX;
}
bool contains(TYPE ptr) const
{
return find(ptr) != SIZE_MAX;
}
TYPE& operator[] (size_t index)
{
#ifdef DEBUG
assert(index < length);
#endif
return data.ptr[index];
}
TYPE *tdata()
{
return data.ptr;
}
Array *copy()
{
Array *a = new Array();
a->setDim(length);
memcpy(a->data.ptr, data.ptr, length * sizeof(TYPE));
return a;
}
void shift(TYPE ptr)
{
reserve(1);
memmove(data.ptr + 1, data.ptr, length * sizeof(TYPE));
data.ptr[0] = ptr;
length++;
}
void zero()
{
memset(data.ptr, 0, length * sizeof(TYPE));
}
TYPE pop()
{
return data.ptr[--length];
}
void sort()
{
struct ArraySort
{
static int
#if _WIN32
__cdecl
#endif
Array_sort_compare(const void *x, const void *y)
{
RootObject *ox = *(RootObject **)const_cast<void *>(x);
RootObject *oy = *(RootObject **)const_cast<void *>(y);
return ox->compare(oy);
}
};
if (length)
{
qsort(data.ptr, length, sizeof(RootObject *), &ArraySort::Array_sort_compare);
}
}
};
|
