|
| 1 | +#include "misc/dynarr.h" |
| 2 | + |
| 3 | +#define ARRAY_PTR_CHECK if(array_ptr == NULL || array_ptr->data_ptr == NULL){\ |
| 4 | + /**/DYNARR_DBG("array not initialized");\ |
| 5 | + return false; \ |
| 6 | + } |
| 7 | + |
| 8 | +bool dynarr_init(dynarr_t* array_ptr, size_t array_size, size_t data_size){ |
| 9 | + if(array_ptr == NULL || data_size == 0 || array_size == 0){ |
| 10 | + /**/DYNARR_DBG("Invalid parameter: array_ptr(%p) data_size(%u) array_size(%u)", array_ptr, data_size, array_size); |
| 11 | + return false; |
| 12 | + } |
| 13 | + if(array_ptr->data_ptr != NULL ){ |
| 14 | + /**/DYNARR_DBG("Array already initialized: array_ptr->data_ptr=%p", array_ptr->data_ptr); |
| 15 | + return false; |
| 16 | + } |
| 17 | + /**/DYNARR_DBG("Array parameters:\n\t\t\tarray_size(%u)\n\t\t\tdata_size(%u)\n\t\t\ttotal size(bytes):%u", array_size, data_size, (array_size * data_size)); |
| 18 | + |
| 19 | + void* temp_array = c_zalloc(array_size * data_size); |
| 20 | + if(temp_array == NULL){ |
| 21 | + /**/DYNARR_ERR("malloc FAIL! req:%u free:%u", (array_size * data_size), system_get_free_heap_size()); |
| 22 | + return false; |
| 23 | + } |
| 24 | + |
| 25 | + array_ptr->data_ptr = temp_array; |
| 26 | + array_ptr->array_size = array_size; |
| 27 | + array_ptr->data_size = data_size; |
| 28 | + array_ptr->used = 0; |
| 29 | + |
| 30 | + return true; |
| 31 | +} |
| 32 | + |
| 33 | +bool dynarr_resize(dynarr_t* array_ptr, size_t elements_to_add){ |
| 34 | + ARRAY_PTR_CHECK; |
| 35 | + |
| 36 | + if(elements_to_add <= 0){ |
| 37 | + /**/DYNARR_DBG("Invalid qty: elements_to_add=%u", elements_to_add); |
| 38 | + return false; |
| 39 | + } |
| 40 | + |
| 41 | + size_t new_array_size = array_ptr->array_size + elements_to_add; |
| 42 | + |
| 43 | + /**/DYNARR_DBG("old size=%u\tnew size=%u\tmem used=%u", |
| 44 | + array_ptr->array_size, new_array_size, (new_array_size * array_ptr->data_size)); |
| 45 | + |
| 46 | + void* temp_array_p = c_realloc(array_ptr->data_ptr, new_array_size * array_ptr->data_size); |
| 47 | + if(temp_array_p == NULL){ |
| 48 | + /**/DYNARR_ERR("malloc FAIL! req:%u free:%u", (new_array_size * array_ptr->data_size), system_get_free_heap_size()); |
| 49 | + return false; |
| 50 | + } |
| 51 | + |
| 52 | + array_ptr->data_ptr = temp_array_p; |
| 53 | + |
| 54 | + size_t prev_size = array_ptr->array_size; |
| 55 | + |
| 56 | + array_ptr->array_size = new_array_size; |
| 57 | + |
| 58 | + //set memory to 0 for newly added array elements |
| 59 | + memset((uint8*) array_ptr->data_ptr + (prev_size * array_ptr->data_size), 0, (elements_to_add * array_ptr->data_size)); |
| 60 | + |
| 61 | + /**/DYNARR_DBG("Array successfully resized"); |
| 62 | + return true; |
| 63 | +} |
| 64 | + |
| 65 | +bool dynarr_remove(dynarr_t* array_ptr, void* element_to_remove){ |
| 66 | + ARRAY_PTR_CHECK; |
| 67 | + |
| 68 | + uint8* element_ptr = element_to_remove; |
| 69 | + uint8* data_ptr = array_ptr->data_ptr; |
| 70 | + |
| 71 | + if(dynarr_boundaryCheck(array_ptr, element_to_remove) == FALSE){ |
| 72 | + return false; |
| 73 | + } |
| 74 | + |
| 75 | + //overwrite element to be removed by shifting all elements to the left |
| 76 | + memmove(element_ptr, element_ptr + array_ptr->data_size, (array_ptr->array_size - 1) * array_ptr->data_size - (element_ptr - data_ptr)); |
| 77 | + |
| 78 | + //clear newly freed element |
| 79 | + memset(data_ptr + ((array_ptr->array_size-1) * array_ptr->data_size), 0, array_ptr->data_size); |
| 80 | + |
| 81 | + //decrement array used since we removed an element |
| 82 | + array_ptr->used--; |
| 83 | + /**/DYNARR_DBG("element(%p) removed from array", element_ptr); |
| 84 | + return true; |
| 85 | +} |
| 86 | + |
| 87 | +bool dynarr_add(dynarr_t* array_ptr, void* data_ptr, size_t data_size){ |
| 88 | + ARRAY_PTR_CHECK; |
| 89 | + |
| 90 | + if(data_size != array_ptr->data_size){ |
| 91 | + /**/DYNARR_DBG("Invalid data size: data_size(%u) != arr->data_size(%u)", data_size, array_ptr->data_size); |
| 92 | + return false; |
| 93 | + } |
| 94 | + |
| 95 | + if(array_ptr->array_size == array_ptr->used){ |
| 96 | + if(!dynarr_resize(array_ptr, (array_ptr->array_size/2))){ |
| 97 | + return false; |
| 98 | + } |
| 99 | + } |
| 100 | + memcpy(((uint8*)array_ptr->data_ptr + (array_ptr->used * array_ptr->data_size)), data_ptr, array_ptr->data_size); |
| 101 | + |
| 102 | + array_ptr->used++; |
| 103 | + return true; |
| 104 | +} |
| 105 | + |
| 106 | +bool dynarr_boundaryCheck(dynarr_t* array_ptr, void* element_to_check){ |
| 107 | + ARRAY_PTR_CHECK; |
| 108 | + |
| 109 | + uint8* data_ptr = array_ptr->data_ptr; |
| 110 | + uint8* element_ptr = element_to_check; |
| 111 | + |
| 112 | + if(element_ptr < data_ptr || ((element_ptr - data_ptr) / array_ptr->data_size) > array_ptr->array_size - 1){ |
| 113 | + /**/DYNARR_DBG("element_ptr(%p) out of bounds: first element ptr:%p last element ptr:%p", |
| 114 | + element_ptr, data_ptr, data_ptr + ((array_ptr->array_size - 1) * array_ptr->data_size)); |
| 115 | + return false; |
| 116 | + } |
| 117 | + return true; |
| 118 | +} |
| 119 | + |
| 120 | +bool dynarr_free(dynarr_t* array_ptr){ |
| 121 | + ARRAY_PTR_CHECK; |
| 122 | + |
| 123 | + c_free(array_ptr->data_ptr); |
| 124 | + |
| 125 | + array_ptr->data_ptr=NULL; |
| 126 | + array_ptr->array_size = array_ptr->used = 0; |
| 127 | + |
| 128 | + /**/DYNARR_DBG("array freed"); |
| 129 | + return true; |
| 130 | +} |
| 131 | + |
0 commit comments