This repository was archived by the owner on Apr 19, 2025. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathdrpc_array.c
More file actions
419 lines (372 loc) · 13.9 KB
/
drpc_array.c
File metadata and controls
419 lines (372 loc) · 13.9 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
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
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
#include "drpc_array.h"
#include "queue.h"
#include "drpc_queue.h"
#include "drpc_struct.h"
#include "drpc_types.h"
#include "hashtable.c/hashtable.h"
#include <stdio.h>
#include <assert.h>
#include <stdlib.h>
#include <stdarg.h>
#include <string.h>
#include <pthread.h>
struct d_array* new_d_array(size_t start_cappacity){
if(start_cappacity == 0) start_cappacity = 1;
struct d_array* new = malloc(sizeof(*new));
assert(new);
new->lookup_size = start_cappacity;
new->lookup_table = calloc(new->lookup_size,sizeof(*new->lookup_table));
new->real_size = 0;
assert(new->lookup_table);
assert(pthread_mutex_init(&new->lock,NULL) == 0);
return new;
}
static inline void d_array_set_internal(struct d_array* darray, size_t index, struct d_struct_element* el){
if(index >= darray->lookup_size){
size_t prev_size = darray->lookup_size;
darray->lookup_size = (index+1) * 1.5;
darray->lookup_table = realloc(darray->lookup_table,sizeof(*darray->lookup_table) * darray->lookup_size);
assert(darray->lookup_table);
memset(darray->lookup_table + (prev_size * sizeof(*darray->lookup_table)),0,(darray->lookup_size - prev_size) * sizeof(*darray->lookup_table));
}
darray->real_size++;
darray->lookup_table[index] = el;
}
static inline struct d_struct_element* d_array_get_internal(struct d_array* darray, size_t index){
if(index >= darray->lookup_size) return NULL;
return darray->lookup_table[index];
}
static inline void d_array_del_internal(struct d_array* darray, size_t index){
if(index >= darray->lookup_size) return;
if(darray->lookup_table[index] == NULL) return;
if(darray->real_size > 0) darray->real_size--;
darray->lookup_table[index] = NULL;
}
void d_array_set(struct d_array* darray,size_t index, void* native_type, enum drpc_types type,...){
assert(darray); assert(native_type);
pthread_mutex_lock(&darray->lock);
struct d_struct_element* element = d_array_get_internal(darray,index);
if(element == NULL){
element = calloc(1,sizeof(*element)); assert(element);
}else{
if(element->is_packed == 1){
drpc_type_free(element->data);
free(element->data);
}else{
switch(element->type){
case d_sizedbuf:
free(element->data);
break;
case d_str:
free(element->data);
break;
case d_queue:
d_queue_free(element->data);
break;
case d_array:
d_array_free(element->data);
break;
case d_struct:
d_struct_free(element->data);
break;
}
}
}
switch(type){
case d_int8:
element->is_packed = 1;
element->data = malloc(sizeof(struct drpc_type)); assert(element->data);
element->type = type;
int8_to_drpc(element->data,*(int8_t*)native_type);
break;
case d_uint8:
element->is_packed = 1;
element->data = malloc(sizeof(struct drpc_type)); assert(element->data);
element->type = type;
uint8_to_drpc(element->data,*(uint8_t*)native_type);
break;
case d_int16:
element->is_packed = 1;
element->data = malloc(sizeof(struct drpc_type)); assert(element->data);
element->type = type;
int16_to_drpc(element->data,*(int16_t*)native_type);
break;
case d_uint16:
element->is_packed = 1;
element->data = malloc(sizeof(struct drpc_type)); assert(element->data);
element->type = type;
uint16_to_drpc(element->data,*(uint16_t*)native_type);
break;
case d_int32:
element->is_packed = 1;
element->data = malloc(sizeof(struct drpc_type)); assert(element->data);
element->type = type;
int32_to_drpc(element->data,*(int32_t*)native_type);
break;
case d_uint32:
element->is_packed = 1;
element->data = malloc(sizeof(struct drpc_type)); assert(element->data);
element->type = type;
uint32_to_drpc(element->data,*(uint32_t*)native_type);
break;
case d_int64:
element->is_packed = 1;
element->data = malloc(sizeof(struct drpc_type)); assert(element->data);
element->type = type;
int64_to_drpc(element->data,*(int64_t*)native_type);
break;
case d_uint64:
element->is_packed = 1;
element->data = malloc(sizeof(struct drpc_type)); assert(element->data);
element->type = type;
uint64_to_drpc(element->data,*(uint64_t*)native_type);
break;
case d_float:
element->is_packed = 1;
element->data = malloc(sizeof(struct drpc_type)); assert(element->data);
element->type = type;
float_to_drpc(element->data,*(float*)native_type);
break;
case d_double:
element->is_packed = 1;
element->data = malloc(sizeof(struct drpc_type)); assert(element->data);
element->type = type;
double_to_drpc(element->data,*(double*)native_type);
break;
case d_sizedbuf:
element->type = type;
element->is_packed = 0;
va_list varargs;
va_start(varargs,type);
element->sizedbuf_len = va_arg(varargs,size_t);
element->data = malloc(element->sizedbuf_len); assert(element->data);
memcpy(element->data,native_type,element->sizedbuf_len);
break;
case d_str:
element->type = type;
element->is_packed = 0;
element->data = strdup(native_type);
break;
case d_struct:
element->type = type;
element->is_packed = 0;
element->data = native_type;
break;
case d_queue:
element->type = type;
element->is_packed = 0;
element->data = native_type;
break;
case d_array:
element->type = type;
element->is_packed = 0;
element->data = native_type;
break;
default:
free(element);
pthread_mutex_unlock(&darray->lock);
return;
}
d_array_set_internal(darray,index,element);
pthread_mutex_unlock(&darray->lock);
}
int d_array_get(struct d_array* darray,size_t index, void* native_type, enum drpc_types type,...){
assert(darray); assert(native_type);
pthread_mutex_lock(&darray->lock);
struct d_struct_element* element = d_array_get_internal(darray,index);
if(element == NULL) {pthread_mutex_unlock(&darray->lock); return 1;}
if(element->type != type) {pthread_mutex_unlock(&darray->lock); return 1;}
switch(type){
default:
*(void**)native_type = element->data;
if(type == d_sizedbuf){
va_list varargs;
va_start(varargs,type);
size_t* sizedbuf_len = va_arg(varargs,size_t*);
*sizedbuf_len = element->sizedbuf_len;
}
break;
case d_int8:
*(int8_t*)native_type = drpc_to_int8(element->data);
break;
case d_uint8:
*(uint8_t*)native_type = drpc_to_uint8(element->data);
break;
case d_int16:
*(int16_t*)native_type = drpc_to_int16(element->data);
break;
case d_uint16:
*(uint16_t*)native_type = drpc_to_uint16(element->data);
break;
case d_int32:
*(int32_t*)native_type = drpc_to_int32(element->data);
break;
case d_uint32:
*(uint32_t*)native_type = drpc_to_uint32(element->data);
break;
case d_int64:
*(int64_t*)native_type = drpc_to_int64(element->data);
break;
case d_uint64:
*(uint64_t*)native_type = drpc_to_uint64(element->data);
break;
case d_float:
*(float*)native_type = drpc_to_float(element->data);
break;
case d_double:
*(double*)native_type = drpc_to_double(element->data);
break;
}
pthread_mutex_unlock(&darray->lock);
return 0;
}
void d_array_remove(struct d_array* darray, size_t index){
assert(darray);
struct d_struct_element* element = d_array_get_internal(darray,index);
if(element == NULL) return;
d_array_del_internal(darray,index);
if(element->is_packed == 1){
drpc_type_free(element->data);
free(element->data);
}else{
switch(element->type){
case d_sizedbuf:
free(element->data);
break;
case d_str:
free(element->data);
break;
case d_struct:
d_struct_free(element->data);
break;
case d_queue:
d_queue_free(element->data);
break;
case d_array:
d_array_free(element->data);
break;
}
}
free(element);
}
enum drpc_types d_array_get_type(struct d_array* darray, size_t index){
struct d_struct_element* element = d_array_get_internal(darray,index);
enum drpc_types ret = d_void;
if(element != NULL){
ret = element->type;
}
return ret;
}
int d_array_unlink(struct d_array* darray, size_t index){
assert(darray);
struct d_struct_element* element = d_array_get_internal(darray,index);
if(element != NULL && element->is_packed == 0){
d_array_del_internal(darray,index);
free(element);
return 0;
}
return 1;
}
void d_array_free_internal(struct d_array* darray){
for(size_t i = 0; i < darray->lookup_size; i++){
if(darray->lookup_table[i] == NULL) continue;
d_array_remove(darray,i);
}
free(darray->lookup_table);
}
void d_array_free(struct d_array* darray){
d_array_free_internal(darray);
free(darray);
}
char* d_array_buf(struct d_array* darray, size_t* buflen){
pthread_mutex_lock(&darray->lock);
struct d_struct* packed = new_d_struct();
for(size_t i = 0; i < darray->lookup_size; i++){
if(darray->lookup_table[i] == NULL) continue;
char key[64];
char* keyp;
sprintf(key,"%zu",i);
keyp = strdup(key);
hashtable_set(packed->hashtable,keyp,darray->lookup_table[i]); //low level hashtable manipulations to set to already existing elements, because they are in the same format!
packed->current_len++;
queue_push(packed->heap_keys,keyp);
}
char* buf = d_struct_buf(packed,buflen);
void* freep = NULL;
while((freep = queue_pop(packed->heap_keys)) != NULL){
free(freep);
}
queue_free(packed->heap_keys);
hashtable_destroy(packed->hashtable);
free(packed);
pthread_mutex_unlock(&darray->lock);
return buf;
}
struct d_array* buf_d_array(char* buf){
struct d_struct* packed = new_d_struct();
buf_d_struct(buf,packed);
size_t keys_len = 0;
char** keys =d_struct_get_fields(packed,&keys_len);
struct d_array* new = new_d_array(keys_len);
for(size_t i = 0; i < keys_len; i++){
size_t set_at = atol(keys[i]);
d_array_set_internal(new,set_at,hashtable_get(packed->hashtable,keys[i]));
}
void* freep = NULL;
while((freep = queue_pop(packed->heap_keys)) != NULL){
free(freep);
}
free(keys);
queue_free(packed->heap_keys);
hashtable_destroy(packed->hashtable);
free(packed);
return new;
}
size_t d_array_len(struct d_array* darray){
assert(darray);
return darray->real_size;
}
struct d_array* d_array_copy(struct d_array* darray){
struct d_array* new = new_d_array(darray->lookup_size);
for(size_t i = 0; i <darray->lookup_size; i++){
struct d_struct_element* element = d_array_get_internal(darray,i);
if(element){
struct d_struct_element* new_element = malloc(sizeof(*new_element)); assert(new_element);
new_element->is_packed = element->is_packed;
new_element->sizedbuf_len = element->sizedbuf_len;
new_element->type = element->type;
if(element->is_packed == 1){
new_element->data = malloc(sizeof(struct drpc_type)); assert(new_element->data);
struct drpc_type* original_el = element->data;
struct drpc_type* copy_el = new_element->data;
copy_el->packed_data = malloc(original_el->len); assert(copy_el->packed_data);
memcpy(copy_el->packed_data,original_el->packed_data,original_el->len);
copy_el->len = original_el->len;
copy_el->type = original_el->type;
} else {
switch(element->type){
case d_struct:
new_element->data = d_struct_copy(element->data);
break;
case d_str:
new_element->data = strdup(element->data);
assert(new_element->data);
break;
case d_sizedbuf:
new_element->data = malloc(element->sizedbuf_len);
assert(new_element->data);
memcpy(new_element->data,element->data,element->sizedbuf_len);
break;
case d_array:
new_element->data = d_array_copy(element->data);
break;
case d_queue:
new_element->data = d_queue_copy(element->data);
break;
}
}
d_array_set_internal(new,i,new_element);
}
}
return new;
}