mirror of
https://github.com/krgamestudios/Toy.git
synced 2026-04-15 23:04:08 +10:00
The results can be found in 'tests/benchmarks/array_allocation/results.md' The results are disappointing, as 'malloc()' is simply faster in every possible situation compared to my custom arena allocator.
34 lines
976 B
C
34 lines
976 B
C
#include "toy_array.h"
|
|
#include "toy_console_colors.h"
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
|
|
Toy_Array* Toy_resizeArray(Toy_Array* paramArray, unsigned int capacity) {
|
|
if (capacity == 0) {
|
|
free(paramArray);
|
|
return NULL;
|
|
}
|
|
|
|
//if some values will be removed, free them first
|
|
if (paramArray != NULL && paramArray->count > capacity) {
|
|
for (unsigned int i = capacity; i < paramArray->count; i++) {
|
|
Toy_freeValue(paramArray->data[i]);
|
|
}
|
|
}
|
|
|
|
unsigned int originalCapacity = paramArray == NULL ? 0 : paramArray->capacity;
|
|
|
|
Toy_Array* array = realloc(paramArray, capacity * sizeof(Toy_Value) + sizeof(Toy_Array));
|
|
|
|
if (array == NULL) {
|
|
fprintf(stderr, TOY_CC_ERROR "ERROR: Failed to resize a 'Toy_Array' from %d to %d capacity\n" TOY_CC_RESET, (int)originalCapacity, (int)capacity);
|
|
exit(-1);
|
|
}
|
|
|
|
array->capacity = capacity;
|
|
array->count = paramArray == NULL ? 0 :
|
|
(array->count > capacity ? capacity : array->count); //truncate lost data
|
|
|
|
return array;
|
|
} |