utils: Create linked list data structure

This is a simple implementation of a general propose single-linked list.

There is only the *prepend* function implemented at this moment.  We can
alway revisit the code and implement new missing functionality on demand.

Signed-off-by: Johnny Richard <johnny@johnnyrichard.com>

1 files changed, 40 insertions, 0 deletions

diff --git a/src/list.h b/src/list.h
new file mode 100644
index 0000000..efe5720
--- /dev/null
+++ b/src/list.h
@@ -0,0 +1,40 @@
+/*
+ * Copyright (C) 2023 Johnny Richard
+ *
+ * This program is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation, either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program.  If not, see <https://www.gnu.org/licenses/>.
+ */
+#ifndef LIST_H
+#define LIST_H
+
+#include <stdlib.h>
+
+typedef struct list_t
+{
+  void *data;
+  struct list_t *next;
+} list_t;
+
+list_t *
+list_new(void);
+
+void
+list_prepend(list_t **list, void *data);
+
+size_t
+list_get_size(list_t *list);
+
+void
+list_destroy(list_t *list);
+
+#endif /* LIST_H */