Defensive frees

src/bitarray.c

@@ -64,6 +64,7 @@ const unsigned char* ba_get_bitarray(bitarray_t ba) {
 
 void ba_free(bitarray_t ba) {
     free(ba->arr);
+    ba->arr = NULL;
     ba->num_bits = 0;
     ba->num_chars = 0;
     free(ba);

src/dllist.c

@@ -31,12 +31,17 @@ void dll_free(dllist_t l) {
 void dll_free_alt(dllist_t l, bool free_data) {
     dll_node* n = l->head;
     while (n != NULL) {
-        if (free_data == true)
+        if (free_data == true) {
             free(n->data);
+            n->data = NULL;
+        }
         dll_node* t = n;
         n = n->next;
         free(t);
+        t = NULL;
     }
+    l->head = NULL;
+    l->tail = NULL;
     l->elms = 0;
     free(l);
 }
@@ -156,5 +161,6 @@ void* dll_remove(dllist_t l, int idx) {
     data = ret->data;
     --(l->elms);
     free(ret);
+    ret = NULL;
     return data;
 }

src/fileutils.c

@@ -438,6 +438,19 @@ void f_free(file_t f) {
         f->lines[i] = NULL;
     free(f->lines);
     free(f->buffer);
+
+    /* Set everything to a default value */
+    f->filesize = 0;
+    f->mode = 0;
+    f->num_lines = 0;
+    f->is_symlink = false;
+    f->basepath = NULL;
+    f->filename = NULL;
+    f->extension = NULL;
+    f->absolute_path = NULL;
+    f->buffer = NULL;
+    f->lines = NULL;
+
     free(f);
 }
 
@@ -571,6 +584,19 @@ void d_free(dir_t d) {
     __free_double_array(d->subitems_fullpath, d->num_subitems);
 
     free(d->full_path);
+
+    /* Set everything to a default value */
+    d->num_subitems = 0;
+    d->num_subdirs = 0;
+    d->num_subfiles = 0;
+    d->full_path = NULL;
+    d->subitems = NULL;
+    d->subdirs = NULL;
+    d->subfiles = NULL;
+    d->subitems_fullpath = NULL;
+    d->subdirs_fullpath = NULL;
+    d->subfiles_fullpath = NULL;
+
     free(d);
 }
 

src/graph.c

@@ -118,6 +118,8 @@ void g_free_alt(graph_t g, bool free_metadata) {
     g->_max_edges = 0;
     g->_prev_vert_id = 0;
     g->_prev_edge_id = 0;
+    g->verts = NULL;
+    g->edges = NULL;
 
     free(g);
 }
@@ -320,6 +322,9 @@ void g_vertex_free_alt(vertex_t v, bool free_metadata) {
     free(v->edges);
     if (free_metadata == true)
         free(v->metadata);
+
+    v->metadata = NULL;
+    v->edges = NULL;
     free(v);
 }
 
@@ -359,6 +364,7 @@ void g_edge_free_alt(edge_t e, bool free_metadata) {
     e->dest = 0;
     if (free_metadata == true)
         free(e->metadata);
+    e->metadata = NULL;
     free(e);
 }
 

src/llist.c

@@ -32,10 +32,14 @@ void ll_free_alt(llist_t l, bool free_data) {
     while (n != NULL) {
         if (free_data == true)
             free(n->data);
+        n->data = NULL;
         ll_node* t = n->next;
         free(n);
         n = t;
     }
+
+    l->head = NULL;
+    l->elms = 0;
     free(l);
 }
 

src/permutations.c

@@ -12,9 +12,9 @@
 typedef struct __permutations {
     unsigned short alphabet_len;
     size_t input_len;
-    char* alphabet;
     unsigned short* cur_perm;
     char* cur_perm_str;
+    char* alphabet;
 } __permutations;
 
 
@@ -41,6 +41,12 @@ void perm_free(permutations_t p) {
     free(p->alphabet);
     free(p->cur_perm);
     free(p->cur_perm_str);
+
+    p->alphabet_len = 0;
+    p->input_len = 0;
+    p->cur_perm = NULL;
+    p->cur_perm_str = NULL;
+    p->alphabet = NULL;
     free(p);
 }
 

src/queue.c

@@ -33,11 +33,14 @@ void q_free_alt(queue_list_t q, bool free_data) {
     while (n != NULL) {
         if (free_data == true)
             free(n->data);
+        n->data = NULL;
         queue_node* t = n;
         n = n->next;
         free(t);
     }
     q->elms = 0;
+    q->head = NULL;
+    q->tail = NULL;
     free(q);
 }
 

src/stack.c

@@ -31,11 +31,13 @@ void stk_free_alt(stack_list_t stk, bool free_data) {
     while (n != NULL) {
         if (free_data == true)
             free(n->data);
+        n->data = NULL;
         stack_node* t = n;
         n = n->next;
         free(t);
     }
     stk->elms = 0;
+    stk->head = NULL;
     free(stk);
 }
 

src/stringlib.c

@@ -13,8 +13,10 @@
 
 void s_free_array_of_strings(char** a, int num) {
     int i;
-    for (i = 0; i < num; ++i)
+    for (i = 0; i < num; ++i) {
         free(a[i]);
+        a[i] = NULL;
+    }
     free(a);
 }
 

src/stringlib.h

@@ -21,12 +21,11 @@
 ***
 *******************************************************************************/
 
-#include <stdio.h>
 
 #define CASE_SENSITIVE 1
 #define CASE_INSENSITIVE 0
 
-#define STRLIB_VERSION "0.1.0"
+#define S_STRLIB_VERSION "0.1.1"
 
 
 void s_free_array_of_strings(char** a, int num);