fixed all the issues reported by the clang static analyzer

some potential leaks and one potential access to freed memory

src/hashtable.c

@@ -132,13 +132,14 @@ void ht_clear(hashtable_t *table) {
     SPIN_LOCK(&table->lock);
     for (i = 0; i < table->size; i++) {
         ht_item_t *item = NULL;
+        ht_item_t *tmp;
 
         ht_items_list_t *list = __sync_fetch_and_add(&table->items[i], 0);
 
         if (!list)
             continue;
 
-        while((item = TAILQ_FIRST(&list->head))) {
+        TAILQ_FOREACH_SAFE(item, &list->head, next, tmp) {
             TAILQ_REMOVE(&list->head, item, next);
             if (table->free_item_cb)
                 table->free_item_cb(item->data);
@@ -246,6 +247,9 @@ int _ht_set_internal(hashtable_t *table, void *key, size_t klen,
     void *prev = NULL;
     size_t plen = 0;
 
+    if (!klen)
+        return -1;
+
     PERL_HASH(hash, key, klen);
 
     actual_size = table->size;
@@ -547,6 +551,8 @@ void *_ht_get_internal(hashtable_t *table, void *key, size_t klen,
             }
             if (dlen)
                 *dlen = item->dlen;
+
+            break;
         }
     }
 

src/rbuf.c

@@ -207,7 +207,6 @@ rbuf_read_until(rbuf_t *rb, u_char octet, u_char *out, int maxsize)
         for (i = 0; to_read > 0 && (size-to_read) < maxsize; i++) {
             to_read--;
             if(rb->buf[i] == octet) {
-                found = 1;
                 break;
             }
             else {

src/refcnt.c

@@ -89,6 +89,9 @@ refcnt_node_t *deref_link(refcnt_t *refcnt, refcnt_node_t **link) {
 }
 
 void release_ref(refcnt_t *refcnt, refcnt_node_t *ref) {
+    if (!refcnt)
+        return;
+
     if (ATOMIC_READ(ref->count) > 0)
         ATOMIC_DECREMENT(ref->count, 1);
     if (ATOMIC_CMPXCHG(ref->delete, 0, 1)) {

src/rqueue.c

@@ -74,6 +74,11 @@ rqueue_t *rqueue_create(uint32_t size, rqueue_mode_t mode) {
         rb->tail = page;
     }
 
+    if (!rb->head || !rb->tail) {
+        free(rb);
+        return NULL;
+    }
+
     // close the ringbuffer
     rb->head->prev = rb->tail;
     rb->tail->next = rb->head;