* 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"
}
}
- /* free the arrray */
+ /* free the array */
if (ht->array != NULL)
SCFree(ht->array);
* 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"
} 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