summaryrefslogtreecommitdiffstats
path: root/list.c
diff options
context:
space:
mode:
authorpgen <p.gen.progs@gmail.com>2019-03-29 22:42:45 +0100
committerpgen <p.gen.progs@gmail.com>2019-03-30 11:39:03 +0100
commitae76ad0e8df96a5e6ea0b503b0c4015659bfe3ea (patch)
tree2a08e533413b2ab45a90f44b27f1d8401c05964c /list.c
parentc264b6de8a6cd615bc32f056cc11ff4c578af580 (diff)
Silent compiler warnings
Diffstat (limited to 'list.c')
-rw-r--r--list.c4
1 files changed, 2 insertions, 2 deletions
diff --git a/list.c b/list.c
index b217492..2757cb3 100644
--- a/list.c
+++ b/list.c
@@ -190,7 +190,7 @@ ll_insert_after(ll_t * const list, ll_node_t * node, void * const data)
/* Based on code found here: */
/* http://www.geeksforgeeks.org/quicksort-for-linked-list */
/* ====================================================== */
-static ll_node_t *
+ll_node_t *
ll_partition(ll_node_t * l, ll_node_t * h, int (*comp)(void *, void *),
void (*swap)(void *, void *))
{
@@ -225,7 +225,7 @@ ll_partition(ll_node_t * l, ll_node_t * h, int (*comp)(void *, void *),
/* ======================================================= */
/* A recursive implementation of quicksort for linked list */
/* ======================================================= */
-static void
+void
ll_quicksort(ll_node_t * l, ll_node_t * h, int (*comp)(void *, void *),
void (*swap)(void * a, void *))
{