--- a/th_util.h	Wed Jan 28 08:06:02 2015 +0200
+++ b/th_util.h	Fri Feb 06 23:04:08 2015 +0200
@@ -144,35 +144,35 @@
 
 /* Doubly linked list handling
  */
-typedef struct _qlist_t
+typedef struct _th_llist_t
 {
     void *data;
     size_t num;
-    struct _qlist_t *prev, *next;
-} qlist_t;
+    struct _th_llist_t *prev, *next;
+} th_llist_t;
 
 
-qlist_t * th_llist_new(void *data);
-void      th_llist_free(qlist_t *list);
-void      th_llist_free_func(qlist_t *list, void (*freefunc)(void *data));
+th_llist_t * th_llist_new(void *data);
+void      th_llist_free(th_llist_t *list);
+void      th_llist_free_func(th_llist_t *list, void (*freefunc)(void *data));
 
-void      th_llist_append_node(qlist_t **list, qlist_t *node);
-qlist_t * th_llist_append(qlist_t **list, void *data);
-void      th_llist_prepend_node(qlist_t **list, qlist_t *node);
-qlist_t * th_llist_prepend(qlist_t **list, void *data);
-void      th_llist_delete(qlist_t **list, const void *data);
-void      th_llist_delete_node(qlist_t **list, qlist_t *node);
-void      th_llist_delete_node_fast(qlist_t **list, qlist_t *node);
+void      th_llist_append_node(th_llist_t **list, th_llist_t *node);
+th_llist_t * th_llist_append(th_llist_t **list, void *data);
+void      th_llist_prepend_node(th_llist_t **list, th_llist_t *node);
+th_llist_t * th_llist_prepend(th_llist_t **list, void *data);
+void      th_llist_delete(th_llist_t **list, const void *data);
+void      th_llist_delete_node(th_llist_t **list, th_llist_t *node);
+void      th_llist_delete_node_fast(th_llist_t **list, th_llist_t *node);
 
-qlist_t * th_llist_get_nth(qlist_t *list, const size_t n);
-size_t    th_llist_length(const qlist_t *list);
-ssize_t   th_llist_position(const qlist_t *list, const qlist_t *node);
+th_llist_t * th_llist_get_nth(th_llist_t *list, const size_t n);
+size_t    th_llist_length(const th_llist_t *list);
+ssize_t   th_llist_position(const th_llist_t *list, const th_llist_t *node);
 
-void      th_llist_foreach(qlist_t *list, void (*func)(qlist_t *node, void *userdata), void *data);
-int       th_llist_foreach_cond(qlist_t *list, int (*func)(qlist_t *node, void *userdata), void *data, qlist_t **res);
+void      th_llist_foreach(th_llist_t *list, void (*func)(th_llist_t *node, void *userdata), void *data);
+int       th_llist_foreach_cond(th_llist_t *list, int (*func)(th_llist_t *node, void *userdata), void *data, th_llist_t **res);
 
-qlist_t * th_llist_find(qlist_t *list, const void *data);
-qlist_t * th_llist_find_func(qlist_t *list, const void *userdata, int (compare)(const void *, const void *));
+th_llist_t * th_llist_find(th_llist_t *list, const void *data);
+th_llist_t * th_llist_find_func(th_llist_t *list, const void *userdata, int (compare)(const void *, const void *));
 
 
 /* Ringbuffer implementation