aboutsummaryrefslogtreecommitdiff
path: root/lib
diff options
context:
space:
mode:
authorAryadev Chavali <aryadev@aryadevchavali.com>2023-10-23 04:24:28 +0100
committerAryadev Chavali <aryadev@aryadevchavali.com>2023-10-23 04:25:48 +0100
commitac57e32a0222a3f18e138f0a358d1d01921be3a0 (patch)
treeb688af5abcfc48e08c7eba61f7f24623c536e931 /lib
parentaa4a3b86143250ff958ca66e77d6097aff8d42a1 (diff)
downloadovm-ac57e32a0222a3f18e138f0a358d1d01921be3a0.tar.gz
ovm-ac57e32a0222a3f18e138f0a358d1d01921be3a0.tar.bz2
ovm-ac57e32a0222a3f18e138f0a358d1d01921be3a0.zip
Added lib folder for general stuff, introduced as target to Makefile
Diffstat (limited to 'lib')
-rw-r--r--lib/base.h70
-rw-r--r--lib/darr.c77
-rw-r--r--lib/darr.h39
3 files changed, 186 insertions, 0 deletions
diff --git a/lib/base.h b/lib/base.h
new file mode 100644
index 0000000..dbeec80
--- /dev/null
+++ b/lib/base.h
@@ -0,0 +1,70 @@
+/* Copyright (C) 2023 Aryadev Chavali
+
+ * You may distribute and modify this code under the terms of the GPLv2
+ * license. You should have received a copy of the GPLv2 license with
+ * this file. If not, please write to: aryadev@aryadevchavali.com.
+
+ * Created: 2023-10-15
+ * Author: Aryadev Chavali
+ * Description: Basic types and routines
+ */
+
+#ifndef BASE_H
+#define BASE_H
+
+#include <stdint.h>
+
+#define ARR_SIZE(xs) (sizeof(xs) / sizeof(xs[0]))
+#define MAX(a, b) ((a) > (b) ? (a) : (b))
+#define MIN(a, b) ((a) > (b) ? (b) : (a))
+
+// Flags
+#ifndef VERBOSE
+#define VERBOSE 0
+#endif
+
+typedef uint64_t u64;
+typedef uint32_t u32;
+typedef int32_t i32;
+typedef int64_t i64;
+typedef float f32;
+typedef double f64;
+
+typedef uint8_t byte;
+typedef u32 hword;
+typedef u64 word;
+
+typedef union
+{
+ byte as_byte;
+ hword as_hword;
+ word as_word;
+} data_t;
+
+typedef enum
+{
+ DATA_TYPE_NIL = 0,
+ DATA_TYPE_BYTE,
+ DATA_TYPE_HWORD,
+ DATA_TYPE_WORD,
+} data_type_t;
+
+#define DBYTE(BYTE) ((data_t){.as_byte = (BYTE)})
+#define DHWORD(HWORD) ((data_t){.as_hword = (HWORD)})
+#define DWORD(WORD) ((data_t){.as_word = (WORD)})
+
+#define HWORD_SIZE sizeof(hword)
+#define WORD_SIZE sizeof(word)
+
+// Macros to extract the nth byte or nth hword from a word
+#define WORD_NTH_BYTE(WORD, N) (((WORD) >> ((N)*8)) & 0xff)
+#define WORD_NTH_HWORD(WORD, N) (((WORD) >> ((N)*2)) & 0xFFFFFFFF)
+
+// Assume array contains 4 bytes.
+hword convert_bytes_to_hword(byte *);
+void convert_hword_to_bytes(hword, byte *);
+// Assume array contains 8 bytes.
+word convert_bytes_to_word(byte *);
+void convert_word_to_bytes(word, byte *);
+
+#endif
diff --git a/lib/darr.c b/lib/darr.c
new file mode 100644
index 0000000..4393c4b
--- /dev/null
+++ b/lib/darr.c
@@ -0,0 +1,77 @@
+/* Copyright (C) 2023 Aryadev Chavali
+
+ * You may distribute and modify this code under the terms of the
+ * GPLv2 license. You should have received a copy of the GPLv2
+ * license with this file. If not, please write to:
+ * aryadev@aryadevchavali.com.
+
+ * Created: 2023-10-15
+ * Author: Aryadev Chavali
+ * Description: Dynamically sized byte array
+ */
+
+#include <assert.h>
+#include <malloc.h>
+#include <string.h>
+
+#include "./darr.h"
+
+void darr_init(darr_t *darr, size_t size)
+{
+ if (size == 0)
+ size = DARR_DEFAULT_SIZE;
+ *darr = (darr_t){
+ .data = calloc(size, 1),
+ .used = 0,
+ .available = size,
+ };
+}
+
+void darr_ensure_capacity(darr_t *darr, size_t requested)
+{
+ if (darr->used + requested >= darr->available)
+ {
+ darr->available =
+ MAX(darr->used + requested, darr->available * DARR_REALLOC_MULT);
+ darr->data = realloc(darr->data, darr->available);
+ }
+}
+
+void darr_append_byte(darr_t *darr, byte byte)
+{
+ darr_ensure_capacity(darr, 1);
+ darr->data[darr->used++] = byte;
+}
+
+void darr_append_bytes(darr_t *darr, byte *bytes, size_t n)
+{
+ darr_ensure_capacity(darr, n);
+ memcpy(darr->data + darr->used, bytes, n);
+ darr->used += n;
+}
+
+byte darr_at(darr_t *darr, size_t index)
+{
+ if (index >= darr->used)
+ // TODO: Error (index is out of bounds)
+ return 0;
+ return darr->data[index];
+}
+
+void darr_write_file(darr_t *bytes, FILE *fp)
+{
+ size_t size = fwrite(bytes->data, bytes->used, 1, fp);
+ assert(size == 1);
+}
+
+darr_t darr_read_file(FILE *fp)
+{
+ darr_t darr = {0};
+ fseek(fp, 0, SEEK_END);
+ long size = ftell(fp);
+ darr_init(&darr, size);
+ fseek(fp, 0, SEEK_SET);
+ size_t read = fread(darr.data, size, 1, fp);
+ assert(read == 1);
+ return darr;
+}
diff --git a/lib/darr.h b/lib/darr.h
new file mode 100644
index 0000000..1d5820b
--- /dev/null
+++ b/lib/darr.h
@@ -0,0 +1,39 @@
+/* Copyright (C) 2023 Aryadev Chavali
+
+ * You may distribute and modify this code under the terms of the
+ * GPLv2 license. You should have received a copy of the GPLv2
+ * license with this file. If not, please write to:
+ * aryadev@aryadevchavali.com.
+
+ * Created: 2023-10-15
+ * Author: Aryadev Chavali
+ * Description: Dynamically sized byte array
+ */
+
+#ifndef DARR_H
+#define DARR_H
+
+#include <stdio.h>
+#include <stdlib.h>
+
+#include "./base.h"
+
+typedef struct
+{
+ byte *data;
+ size_t used, available;
+} darr_t;
+
+#define DARR_DEFAULT_SIZE 8
+#define DARR_REALLOC_MULT 1.5
+
+void darr_init(darr_t *, size_t);
+void darr_ensure_capacity(darr_t *, size_t);
+void darr_append_byte(darr_t *, byte);
+void darr_append_bytes(darr_t *, byte *, size_t);
+byte darr_at(darr_t *, size_t);
+
+void darr_write_file(darr_t *, FILE *);
+darr_t darr_read_file(FILE *);
+
+#endif