1 files changed, 14 insertions, 7 deletions

diff --git a/list.c b/list.c
index 24024da..5c36ea4 100644
--- a/list.c
+++ b/list.c
@@ -29,8 +29,9 @@ list_add(struct list_item *next, T data)
                 new_item->next = next;
                 new_item->data = data;
         }
-        else
+        else {
                 ERROR("out of memory");
+        }
 
         return new_item;
 }
@@ -49,8 +50,9 @@ list_insert_next(struct list_item *list, T data)
                 new_item->next = list->next;
                 list->next     = new_item;
         }
-        else
+        else {
                 ERROR("out of memory");
+        }
 }
 /* -->8-- */
 
@@ -102,8 +104,9 @@ list_length(struct list_item *list)
 {
         size_t len = 0;
 
-        for ( ; list; list = list->next )
+        for ( ; list; list = list->next ) {
                 ++len;
+        }
 
         return len;
 }
@@ -121,8 +124,9 @@ list_copy(struct list_item *list)
                         (*p)->data = list->data; // copy elements
                         p          = &(*p)->next;
                 }
-                else
+                else {
                         ERROR("out of memory");
+                }
         }
         *p = NULL;
         return head;
@@ -162,10 +166,12 @@ list_merge(struct list_item *a, struct list_item *b)
         struct list_item *head = &dummy, *c = head;
 
         while ( a != NULL && b != NULL )
-                if ( a->data < b->data )
+                if ( a->data < b->data ) {
                         c->next = a, c = a, a = a->next;
-                else
+                }
+                else {
                         c->next = b, c = b, b = b->next;
+                }
 
         c->next = (a != NULL) ? a : b;
 
@@ -183,8 +189,9 @@ list_sort(struct list_item *c)
         struct list_item *a = c,
                          *b = c->next;
 
-        while ( b != NULL && b->next != NULL )
+        while ( b != NULL && b->next != NULL ) {
                 c = c->next, b = b->next->next;
+        }
 
         b = c->next, c->next = NULL;