Various small changes

1 files changed, 12 insertions, 12 deletions

diff --git a/list.c b/list.c
index 6f0996f..1daefc0 100644
--- a/list.c
+++ b/list.c
@@ -1,13 +1,3 @@
-#include "config.h"
-#include <stdio.h>
-#include <stdlib.h>
-#include <limits.h>
-#include <string.h>
-#include <errno.h>
-
-#include "xmalloc.h"
-#include "list.h"
-
 /* ********************************************************************* */
 /* Tiny list immplementation.                                            */
 /*                                                                       */
@@ -18,6 +8,16 @@
 /* the structure members (head, tail, len, data, prev, next)             */
 /* ********************************************************************* */
 
+#include "config.h"
+#include <stdio.h>
+#include <stdlib.h>
+#include <limits.h>
+#include <string.h>
+#include <errno.h>
+
+#include "xmalloc.h"
+#include "list.h"
+
 /* ======================== */
 /* Create a new linked list */
 /* ======================== */
@@ -186,7 +186,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 */
 /* ====================================================== */
-ll_node_t *
+static ll_node_t *
 ll_partition(ll_node_t * l, ll_node_t * h, int (*comp)(void *, void *),
              void (*swap)(void *, void *))
 {
@@ -221,7 +221,7 @@ ll_partition(ll_node_t * l, ll_node_t * h, int (*comp)(void *, void *),
 /* ======================================================= */
 /* A recursive implementation of quicksort for linked list */
 /* ======================================================= */
-void
+static void
 ll_quicksort(ll_node_t * l, ll_node_t * h, int (*comp)(void *, void *),
              void (*swap)(void * a, void *))
 {