aboutsummaryrefslogtreecommitdiff
path: root/util/array.c
diff options
context:
space:
mode:
authorKenny Levinsen <kl@kl.wtf>2022-08-18 11:51:21 +0200
committerKenny Levinsen <kl@kl.wtf>2022-08-19 19:38:33 +0200
commit724aa38fc2de14909663cb984a9de64a561abf5f (patch)
treefef5edaf1f4adb49a99cb53442d3164f8f03b61c /util/array.c
parent9ab819684d41b5052260e11a337ce0cdee6ce3bd (diff)
util/array: Add array_realloc for wl_array
array_realloc will grow the array for the target size like wl_insert_add, but will also shrink the array if the target size is sufficiently smaller than the current allocation.
Diffstat (limited to 'util/array.c')
-rw-r--r--util/array.c29
1 files changed, 29 insertions, 0 deletions
diff --git a/util/array.c b/util/array.c
index 50025b77..9da26127 100644
--- a/util/array.c
+++ b/util/array.c
@@ -55,3 +55,32 @@ void array_remove_at(struct wl_array *arr, size_t offset, size_t size) {
memmove(&data[offset], &data[offset + size], arr->size - offset - size);
arr->size -= size;
}
+
+bool array_realloc(struct wl_array *arr, size_t size) {
+ // If the size is less than 1/4th of the allocation size, we shrink it.
+ // 1/4th is picked to provide hysteresis, without which an array with size
+ // arr->alloc would constantly reallocate if an element is added and then
+ // removed continously.
+ size_t alloc;
+ if (arr->alloc > 0 && size > arr->alloc / 4) {
+ alloc = arr->alloc;
+ } else {
+ alloc = 16;
+ }
+
+ while (alloc < size) {
+ alloc *= 2;
+ }
+
+ if (alloc == arr->alloc) {
+ return true;
+ }
+
+ void *data = realloc(arr->data, alloc);
+ if (data == NULL) {
+ return false;
+ }
+ arr->data = data;
+ arr->alloc = alloc;
+ return true;
+}