Index: uspace/lib/c/generic/malloc.c
===================================================================
--- uspace/lib/c/generic/malloc.c	(revision b078a42d6c08e6d638c8564b9160d39f9a09c544)
+++ uspace/lib/c/generic/malloc.c	(revision da287d16f76967ca44d7813d30c7a1a046348e1a)
@@ -110,5 +110,5 @@
 
 #define AREA_LAST_BLOCK_HEAD(area) \
-	((uintptr_t) BLOCK_HEAD(((heap_block_foot_t *)AREA_LAST_BLOCK_FOOT(area))))
+	((uintptr_t) BLOCK_HEAD(((heap_block_foot_t *) AREA_LAST_BLOCK_FOOT(area))))
 
 /** Get header in heap block.
@@ -349,5 +349,6 @@
 		return false;
 	
-	heap_block_head_t *last_head = (heap_block_head_t *) AREA_LAST_BLOCK_HEAD(area);
+	heap_block_head_t *last_head =
+	    (heap_block_head_t *) AREA_LAST_BLOCK_HEAD(area);
 	
 	if (last_head->free) {
@@ -651,10 +652,13 @@
 
 /** Try to enlarge any of the heap areas.
- *  If successful, allocate block of the given size in the area.
- *
+ *
+ * If successful, allocate block of the given size in the area.
  * Should be called only inside the critical section.
  *
- * @param size Gross size of item to allocate (bytes).
+ * @param size  Gross size of item to allocate (bytes).
  * @param align Memory address alignment.
+ *
+ * @return Allocated block.
+ * @return NULL on failure.
  *
  */
@@ -663,13 +667,15 @@
 	if (size == 0)
 		return NULL;
-		
+	
 	/* First try to enlarge some existing area */
 	for (heap_area_t *area = first_heap_area; area != NULL;
 	    area = area->next) {
-	    
+		
 		if (area_grow(area, size + align)) {
-			heap_block_head_t *first = (heap_block_head_t *) AREA_LAST_BLOCK_HEAD(area);
-			
-			void *addr = malloc_area(area, first, NULL, size, align);
+			heap_block_head_t *first =
+			    (heap_block_head_t *) AREA_LAST_BLOCK_HEAD(area);
+			
+			void *addr =
+			    malloc_area(area, first, NULL, size, align);
 			malloc_assert(addr != NULL);
 			return addr;
@@ -679,7 +685,9 @@
 	/* Eventually try to create a new area */
 	if (area_create(AREA_OVERHEAD(size + align))) {
-		heap_block_head_t *first = (heap_block_head_t *) AREA_FIRST_BLOCK_HEAD(last_heap_area);
-		
-		void *addr = malloc_area(last_heap_area, first, NULL, size, align);
+		heap_block_head_t *first =
+		    (heap_block_head_t *) AREA_FIRST_BLOCK_HEAD(last_heap_area);
+		
+		void *addr =
+		    malloc_area(last_heap_area, first, NULL, size, align);
 		malloc_assert(addr != NULL);
 		return addr;
@@ -707,15 +715,13 @@
 	
 	size_t falign = lcm(align, BASE_ALIGN);
-
+	
 	/* Check for integer overflow. */
 	if (falign < align)
 		return NULL;
-
+	
 	size_t gross_size = GROSS_SIZE(ALIGN_UP(size, BASE_ALIGN));
 	
-	heap_block_head_t *split;
-	
 	/* Try the next fit approach */
-	split = next_fit;
+	heap_block_head_t *split = next_fit;
 	
 	if (split != NULL) {