hash: spelling

src/util-hash.c

@@ -23,7 +23,7 @@
  * Chained hash table implementation
  *
  * The 'Free' pointer can be used to have the API free your
- * hashed data. If it's NULL it's the callers responsebility
+ * hashed data. If it's NULL it's the callers responsibility
  */
 
 #include "suricata-common.h"
@@ -96,7 +96,7 @@ void HashTableFree(HashTable *ht)
         }
     }
 
-    /* free the arrray */
+    /* free the array */
     if (ht->array != NULL)
         SCFree(ht->array);
 

src/util-hashlist.c

@@ -23,7 +23,7 @@
  * Chained hash table implementation
  *
  * The 'Free' pointer can be used to have the API free your
- * hashed data. If it's NULL it's the callers responsebility
+ * hashed data. If it's NULL it's the callers responsibility
  */
 
 #include "suricata-common.h"

src/util-thash.c

@@ -511,7 +511,7 @@ static THashData *THashDataGetNew(THashTableContext *ctx, void *data)
     } else {
         /* data has been recycled before it went into the spare queue */
 
-        /* data is initialized (recylced) but *unlocked* */
+        /* data is initialized (recycled) but *unlocked* */
     }
 
     // setup the data