[c-utils] patches for better C23 compatibility

c-utils/src/dllist.h

@@ -58,7 +58,7 @@ typedef struct __dll_node {
         NULL        - If error allocating the memory
         dllist_t
 */
-dllist_t dll_init();
+dllist_t dll_init(void);
 
 /*  Free the data from the doubly linked list;
     NOTE: does not free the data element */

c-utils/src/graph.h

@@ -38,7 +38,7 @@ typedef struct __edge_node* edge_t;
 
 /*  Initialize the graph either using the default start size or based on the
     passed in size parameter */
-graph_t g_init();
+graph_t g_init(void);
 graph_t g_init_alt(unsigned int size);
 
 /*  Free the graph and all edges & vertices; defaults to free'ing the metadata

c-utils/src/llist.h

@@ -56,7 +56,7 @@ typedef struct __ll_node {
         NULL    - if unable to allocate the memory
         llist_t
 */
-llist_t ll_init();
+llist_t ll_init(void);
 
 /*  Free the data from the linked list
     NOTE: does not free the data element */

c-utils/src/queue.h

@@ -44,7 +44,7 @@ typedef struct __dll_node {
         NULL        - If error allocating the memory
         dllist_t
 */
-queue_list_t q_init();
+queue_list_t q_init(void);
 
 /*  Free the data from the doubly linked list;
     NOTE: does not free the data element */

c-utils/src/stack.h

@@ -43,7 +43,7 @@ typedef struct __stack_node {
         NULL        - If error allocating the memory
         stack_list_t
 */
-stack_list_t stk_init();
+stack_list_t stk_init(void);
 
 /*  Free the data from the singly linked list;
     NOTE: does not free the data element */