|
9 | 9 |
|
10 | 10 | #include "util.h"
|
11 | 11 |
|
12 |
| -#define git_array_t(type) struct { type *ptr; size_t size, asize; } |
| 12 | +/* |
| 13 | + * Use this to declare a typesafe resizable array of items, a la: |
| 14 | + * |
| 15 | + * git_array_t(int) my_ints = GIT_ARRAY_INIT; |
| 16 | + * ... |
| 17 | + * int *i = git_array_alloc(my_ints); |
| 18 | + * GITERR_CHECK_ALLOC(i); |
| 19 | + * ... |
| 20 | + * git_array_clear(my_ints); |
| 21 | + * |
| 22 | + * You may also want to do things like: |
| 23 | + * |
| 24 | + * typedef git_array_t(my_struct) my_struct_array_t; |
| 25 | + */ |
| 26 | +#define git_array_t(type) struct { type *ptr; uint32_t size, asize; } |
| 27 | + |
| 28 | +#define GIT_ARRAY_INIT { NULL, 0, 0 } |
13 | 29 |
|
14 | 30 | #define git_array_init(a) \
|
15 | 31 | do { (a).size = (a).asize = 0; (a).ptr = NULL; } while (0)
|
16 | 32 |
|
17 | 33 | #define git_array_clear(a) \
|
18 | 34 | do { git__free((a).ptr); git_array_init(a); } while (0)
|
19 | 35 |
|
20 |
| -#define git_array_grow(a) do { \ |
21 |
| - void *new_array; size_t new_size = \ |
22 |
| - ((a).asize >= 256) ? (a).asize + 256 : ((a).asize >= 8) ? (a).asize * 2 : 8; \ |
23 |
| - new_array = git__realloc((a).ptr, new_size * sizeof(*(a).ptr)); \ |
24 |
| - if (!new_array) { git_array_clear(a); } \ |
25 |
| - else { (a).ptr = new_array; (a).asize = new_size; } \ |
26 |
| - } while (0) |
27 |
| - |
28 | 36 | #define GITERR_CHECK_ARRAY(a) GITERR_CHECK_ALLOC((a).ptr)
|
29 | 37 |
|
30 |
| -#define git_array_alloc(a, el) do { \ |
31 |
| - if ((a).size >= (a).asize) git_array_grow(a); \ |
32 |
| - (el) = (a).ptr ? &(a).ptr[(a).size++] : NULL; \ |
33 |
| - } while (0) |
| 38 | + |
| 39 | +typedef git_array_t(void) git_array_generic_t; |
| 40 | + |
| 41 | +/* use a generic array for growth so this can return the new item */ |
| 42 | +GIT_INLINE(void *) git_array_grow(git_array_generic_t *a, size_t item_size) |
| 43 | +{ |
| 44 | + uint32_t new_size = (a->size < 8) ? 8 : a->asize * 3 / 2; |
| 45 | + void *new_array = git__realloc(a->ptr, new_size * item_size); |
| 46 | + if (!new_array) { |
| 47 | + git_array_clear(*a); |
| 48 | + return NULL; |
| 49 | + } else { |
| 50 | + a->ptr = new_array; a->asize = new_size; a->size++; |
| 51 | + return (((char *)a->ptr) + (a->size - 1) * item_size); |
| 52 | + } |
| 53 | +} |
| 54 | + |
| 55 | +#define git_array_alloc(a) \ |
| 56 | + ((a).size >= (a).asize) ? \ |
| 57 | + git_array_grow((git_array_generic_t *)&(a), sizeof(*(a).ptr)) : \ |
| 58 | + (a).ptr ? &(a).ptr[(a).size++] : NULL |
34 | 59 |
|
35 | 60 | #define git_array_last(a) ((a).size ? &(a).ptr[(a).size - 1] : NULL)
|
36 | 61 |
|
|
0 commit comments