# HG changeset patch # User Matti Hamalainen # Date 1579281276 -7200 # Node ID 964657ad0960f25078b51ddbe1671b4a7e522c90 # Parent 98c8bd80f63353b26ee2a774f067e8b110768e8b Indentation cosmetics. diff -r 98c8bd80f633 -r 964657ad0960 th_datastruct.c --- a/th_datastruct.c Fri Jan 17 19:13:57 2020 +0200 +++ b/th_datastruct.c Fri Jan 17 19:14:36 2020 +0200 @@ -343,7 +343,8 @@ memset(buf->data + buf->size, 0, sizeof(char *) * n); buf->size += n; return TRUE; - } else + } + else return FALSE; } diff -r 98c8bd80f633 -r 964657ad0960 th_datastruct.h --- a/th_datastruct.h Fri Jan 17 19:13:57 2020 +0200 +++ b/th_datastruct.h Fri Jan 17 19:14:36 2020 +0200 @@ -25,28 +25,28 @@ } th_llist_t; -th_llist_t * th_llist_new(void *data); -void th_llist_free(th_llist_t *list); -void th_llist_free_func_data(th_llist_t *list, void (*freefunc)(void *data)); -void th_llist_free_func_node(th_llist_t *list, void (*freefunc)(th_llist_t *node)); +th_llist_t * th_llist_new(void *data); +void th_llist_free(th_llist_t *list); +void th_llist_free_func_data(th_llist_t *list, void (*freefunc)(void *data)); +void th_llist_free_func_node(th_llist_t *list, void (*freefunc)(th_llist_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); +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); -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); +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(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); +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); -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 *)); +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 @@ -58,10 +58,11 @@ void (*deallocator)(void *data); } th_ringbuf_t; -th_ringbuf_t * th_ringbuf_new(const size_t size, void (*mdeallocator)(void *)); -BOOL th_ringbuf_grow(th_ringbuf_t *buf, const size_t n); -void th_ringbuf_free(th_ringbuf_t *buf); -void th_ringbuf_add(th_ringbuf_t *buf, void *ptr); + +th_ringbuf_t * th_ringbuf_new(const size_t size, void (*mdeallocator)(void *data)); +BOOL th_ringbuf_grow(th_ringbuf_t *buf, const size_t n); +void th_ringbuf_free(th_ringbuf_t *buf); +void th_ringbuf_add(th_ringbuf_t *buf, void *ptr); /* Growing buffers