Implement the worlds worst register machine

1 files changed, 13 insertions, 1 deletions

diff --git a/src/badlib.h b/src/badlib.h
index 25bb92b..522e4bb 100644
--- a/src/badlib.h
+++ b/src/badlib.h
@@ -920,9 +920,12 @@ typedef struct ArrayHeader {
 #define array_cap(ARR) ((ARR) ? array_head(ARR)->cap : 0)
 
 // Initialize a dynamic array ARR with N elements. The initialization doesn't
-// zero out the data, so thread carefully..
+// zero out the data, so thread carefully. Use array_zero instead if that's what
+// you need.
 #define array_init(ARR, N, ARENA) \
     ((ARR) = _array_reserve(N, sizeof(*(ARR)), (ARENA)))
+#define array_zero(ARR, N, ARENA) \
+    ((ARR) = _array_reserve_zero(N, sizeof(*(ARR)), (ARENA)))
 
 // Push a given element T to the dynamic array ARR.
 #define array_push(ARR, T, ARENA)                          \
@@ -953,6 +956,15 @@ _array_reserve(sz num_elem, sz type_size, Arena *a) {
 }
 
 static inline void *
+_array_reserve_zero(sz num_elem, sz type_size, Arena *a) {
+    u8 *p = arena_calloc(num_elem * type_size + sizeof(ArrayHeader), a);
+    p += sizeof(ArrayHeader);
+    array_head(p)->size = 0;
+    array_head(p)->cap = num_elem;
+    return p;
+}
+
+static inline void *
 _array_maybe_grow(void *arr, sz type_size, Arena *a) {
     if (!arr) {
         arr = _array_reserve(0, 0, a);