return (ISC_R_SUCCESS);
cleanup_listlock:
- isc_mutex_destroy(&manager->listlock);
+ (void) isc_mutex_destroy(&manager->listlock);
cleanup_lock:
- isc_mutex_destroy(&manager->lock);
+ (void) isc_mutex_destroy(&manager->lock);
cleanup_manager:
isc_mem_put(manager->mctx, manager, sizeof(*manager));
if (disp->sepool != NULL) {
isc_mempool_destroy(&disp->sepool);
- isc_mutex_destroy(&disp->sepool_lock);
+ (void)isc_mutex_destroy(&disp->sepool_lock);
}
if (disp->socket != NULL)
return;
}
+ INSIST(rbt->hashsize > 0);
+
for (i = 0; i < rbt->hashsize; i++)
rbt->hashtable[i] = NULL;
COLOR(sibling) = COLOR(parent);
MAKE_BLACK(parent);
+ INSIST(RIGHT(sibling) != NULL);
MAKE_BLACK(RIGHT(sibling));
rotate_left(parent, rootp);
child = *rootp;
COLOR(sibling) = COLOR(parent);
MAKE_BLACK(parent);
+ INSIST(LEFT(sibling) != NULL);
MAKE_BLACK(LEFT(sibling));
rotate_right(parent, rootp);
child = *rootp;
* will do it on the LRU side, so memory
* will not leak... for long.
*/
+ INSIST(rbtdb->heaps != NULL);
isc_heap_insert(rbtdb->heaps[idx], newheader);
} else if (RESIGN(newheader))
resign_insert(rbtdb, idx, newheader);
#define ISC_QUEUE_DESTROY(queue) \
do { \
ISC_QLINK_INSIST(ISC_QUEUE_EMPTY(queue)); \
- isc_mutex_destroy(&(queue).taillock); \
- isc_mutex_destroy(&(queue).headlock); \
+ (void) isc_mutex_destroy(&(queue).taillock); \
+ (void) isc_mutex_destroy(&(queue).headlock); \
} while (0)
/*