{
callback_func_t *cf;
- cf = c_head_get_root (read_heap);
+ cf = c_heap_get_root (read_heap);
if (cf == NULL)
break;
int rf_type;
/* Get the read function that needs to be read next. */
- rf = c_head_get_root (read_heap);
+ rf = c_heap_get_root (read_heap);
if (rf == NULL)
{
struct timespec abstime;
{
read_func_t *rf;
- rf = c_head_get_root (read_heap);
+ rf = c_heap_get_root (read_heap);
if (rf == NULL)
break;
return (0);
} /* int c_heap_insert */
-void *c_head_get_root (c_heap_t *h)
+void *c_heap_get_root (c_heap_t *h)
{
void *ret = NULL;
pthread_mutex_unlock (&h->lock);
return (ret);
-} /* void *c_head_get_root */
+} /* void *c_heap_get_root */
/* vim: set sw=2 sts=2 et fdm=marker : */
/*
* NAME
- * c_head_get_root
+ * c_heap_get_root
*
* DESCRIPTION
* Removes the value at the root of the heap and returns both, key and value.
* The pointer passed to `c_heap_insert' or NULL if there are no more
* elements in the heap (or an error occurred).
*/
-void *c_head_get_root (c_heap_t *h);
+void *c_heap_get_root (c_heap_t *h);
#endif /* UTILS_HEAP_H */
/* vim: set sw=2 sts=2 et : */