-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathvec.c
More file actions
190 lines (157 loc) · 4.45 KB
/
Copy pathvec.c
File metadata and controls
190 lines (157 loc) · 4.45 KB
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
/* Copyright 2008-2026 Carsten Elton Sorensen
This file is part of ASMotor.
ASMotor is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
ASMotor 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
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with ASMotor. If not, see <http://www.gnu.org/licenses/>.
*/
#define IN_VEC_C_
#include <assert.h>
#include <stdint.h>
#include <stdio.h>
#include "set.h"
typedef struct Vector {
uint32_t refCount;
free_t free;
intptr_t userData;
uint32_t allocatedElements;
uint32_t totalElements;
intptr_t* elements;
} vec_t;
#include "vec.h"
static void
growVector(vec_t* vec) {
assert(!vec_Frozen(vec));
vec->allocatedElements += (vec->allocatedElements >> 1) + 1;
vec->elements = mem_Realloc(vec->elements, sizeof(intptr_t) * vec->allocatedElements);
}
extern vec_t*
#if defined(_DEBUG)
vec_CreateLengthDebug(free_t free, size_t size, const char* filename, int lineNumber) {
vec_t* vec = (vec_t*) mem_AllocImpl(sizeof(vec_t), filename, lineNumber);
#else
vec_CreateLength(free_t free, size_t size) {
vec_t* vec = (vec_t*) mem_Alloc(sizeof(vec_t));
#endif
vec->refCount = 0;
vec->free = free;
vec->userData = 0;
vec->allocatedElements = size == 0 ? 1 : (uint32_t) size;
vec->totalElements = 0;
#if defined(_DEBUG)
vec->elements = mem_AllocImpl(sizeof(intptr_t) * vec->allocatedElements, filename, lineNumber);
#else
vec->elements = mem_Alloc(sizeof(intptr_t) * vec->allocatedElements);
#endif
return vec;
}
extern void
vec_PushBack(vec_t* vec, intptr_t element) {
assert(!vec_Frozen(vec));
if (vec->totalElements >= vec->allocatedElements)
growVector(vec);
vec->elements[vec->totalElements++] = element;
}
extern size_t
vec_Count(vec_t* vec) {
assert(vec != NULL);
return vec->totalElements;
}
extern void
vec_Clear(vec_t* vec) {
assert(vec != NULL);
assert(!vec_Frozen(vec));
for (uint32_t i = 0; i < vec->totalElements; ++i) {
vec->free(vec->userData, vec->elements[i]);
}
vec->totalElements = 0;
}
extern void
vec_Free(vec_t* vec) {
assert(vec != NULL);
if (vec_Frozen(vec)) {
vec->refCount -= 1;
}
if (!vec_Frozen(vec)) {
for (uint32_t i = 0; i < vec->totalElements; ++i) {
vec->free(vec->userData, vec->elements[i]);
}
mem_Free(vec->elements);
mem_Free(vec);
}
}
extern void
vec_RemoveAt(vec_t* vec, size_t index) {
assert(vec != NULL);
assert(index < vec->totalElements);
assert(!vec_Frozen(vec));
vec->free(vec->userData, vec->elements[index]);
vec->totalElements -= 1;
if (index < vec->totalElements) {
memmove(&vec->elements[index], &vec->elements[index + 1], sizeof(intptr_t) * (vec->totalElements - index));
}
}
extern intptr_t
vec_ElementAt(vec_t* vec, size_t index) {
assert(vec != NULL);
assert(index < vec->totalElements);
return vec->elements[index];
}
extern intptr_t
vec_SetAt(vec_t* vec, size_t index, intptr_t element) {
assert(vec != NULL);
assert(!vec_Frozen(vec));
assert(index < vec->totalElements);
intptr_t r = vec->elements[index];
if (element != vec->elements[index]) {
vec->free(vec->userData, vec->elements[index]);
vec->elements[index] = element;
}
return r;
}
extern void
vec_InsertAt(vec_t* vec, size_t index, intptr_t element) {
assert(vec != NULL);
assert(index <= vec->totalElements);
assert(!vec_Frozen(vec));
if (vec->totalElements == vec->allocatedElements)
growVector(vec);
if (index < vec->totalElements)
memmove(&vec->elements[index + 1], &vec->elements[index], sizeof(intptr_t) * (vec->totalElements - index));
vec->elements[index] = element;
vec->totalElements += 1;
}
extern vec_t*
vec_Freeze(vec_t* vec) {
assert(vec != NULL);
assert(!vec_Frozen(vec));
vec->refCount = 1;
return vec;
}
extern bool
vec_Frozen(vec_t* vec) {
assert(vec != NULL);
return vec->refCount != 0;
}
extern vec_t*
vec_Copy(vec_t* vec, copy_t copy) {
if (vec != NULL) {
if (vec_Frozen(vec)) {
vec->refCount += 1;
return vec;
}
vec_t* dest = vec_CreateLength(vec->free, vec->totalElements);
for (size_t i = 0; i < vec_Count(vec); ++i) {
vec_PushBack(dest, copy(vec->userData, vec_ElementAt(vec, i)));
}
return dest;
} else {
return NULL;
}
}