format code

1 files changed, 18 insertions, 17 deletions

diff --git a/list.c b/list.c
index 8b18de8..18465b0 100644
--- a/list.c
+++ b/list.c
@@ -13,7 +13,7 @@ typedef int T;
 
 struct list_item {
         struct list_item *next;
-        T data;
+        T                 data;
 };
 
 struct list_item *
@@ -39,7 +39,7 @@ list_delete(struct list_item *list, T data)
 
         for ( struct list_item *p = list; p; p = p->next ) {
                 if ( p->data == data ) {
-                        if ( prev == NULL ) {           /* first element in list? */
+                        if ( prev == NULL ) { /* first element in list? */
                                 list = p->next;
                         }
                         else {
@@ -70,13 +70,13 @@ list_length(struct list_item *list)
 struct list_item *
 list_copy(struct list_item *list)
 {
-        struct list_item *head, **p = &head;
+        struct list_item *head = NULL, **p = &head;
 
         for ( ; list; list = list->next ) {
                 *p = malloc(sizeof **p);
                 if ( *p != NULL ) {
-                        (*p)->data = list->data;        // copy elements
-                        p = &(*p)->next;
+                        (*p)->data = list->data; // copy elements
+                        p          = &(*p)->next;
                 }
                 else
                         ERROR("out of memory");
@@ -91,9 +91,9 @@ list_reverse(struct list_item *list)
         struct list_item *head = NULL, *next;
 
         for ( ; list; list = next ) {
-                next = list->next;
+                next       = list->next;
                 list->next = head;
-                head = list;
+                head       = list;
         }
         return head;
 }
@@ -109,7 +109,7 @@ list_apply(struct list_item *list, void (*visit)(T data, void *cl), void *cl)
 struct list_item *
 list_merge(struct list_item *a, struct list_item *b)
 {
-        struct list_item dummy = { .next = NULL };
+        struct list_item  dummy = { .next = NULL };
         struct list_item *head = &dummy, *c = head;
 
         while ( a != NULL && b != NULL )
@@ -118,7 +118,7 @@ list_merge(struct list_item *a, struct list_item *b)
                 else
                         c->next = b, c = b, b = b->next;
 
-        c->next = ( a != NULL ) ? a : b;
+        c->next = (a != NULL) ? a : b;
 
         return head->next;
 }
@@ -130,7 +130,7 @@ list_sort(struct list_item *c)
                 return c;
 
         struct list_item *a = c,
-                                         *b = c->next;
+                         *b = c->next;
 
         while ( b != NULL && b->next != NULL )
                 c = c->next, b = b->next->next;
@@ -151,7 +151,11 @@ list_free(struct list_item *list)
         }
 }
 
-static void print_data(T data, void *cl) { fprintf(cl, "%d\n", data); }
+static void
+print_data(T data, void *cl)
+{
+        fprintf(cl, "%d\n", data);
+}
 
 int
 main()
@@ -183,13 +187,13 @@ main()
         struct list_item *x = NULL;
         for ( int i = 0; i != COUNT; ++i ) {
                 int r = rand();
-                x = list_add(x, r);
+                x     = list_add(x, r);
         }
 
         puts("start");
         start = clock();
-        x = list_sort(x);
-        printf("Fertig: %.3lf sec\n", (double)(clock() - start) / CLOCKS_PER_SEC);
+        x     = list_sort(x);
+        printf("Fertig: %.3lf sec\n", (double) (clock() - start) / CLOCKS_PER_SEC);
 
         //list_apply(x, print_data);
         printf("Len: %zu\n", list_length(x));
@@ -198,6 +202,3 @@ main()
 
         return EXIT_SUCCESS;
 }
-
-
-