Index: kernel/generic/include/adt/avl.h
===================================================================
--- kernel/generic/include/adt/avl.h	(revision 1b20da07baaa3e3c424f62c927274e676e4295cd)
+++ kernel/generic/include/adt/avl.h	(revision 314f4b59687d394aa33a8c64a0f52470e5767db7)
@@ -69,5 +69,5 @@
 	 */
 	struct avltree_node *lft;
-	
+
 	/**
 	 * Pointer to the right descendant of this node.
@@ -77,11 +77,11 @@
 	 */
 	struct avltree_node *rgt;
-	
+
 	/** Pointer to the parent node. Root node has NULL parent. */
 	struct avltree_node *par;
-	
+
 	/** Node's key. */
 	avltree_key_t key;
-	
+
 	/**
 	 * Difference between the heights of the left and the right subtree of
Index: kernel/generic/include/adt/bitmap.h
===================================================================
--- kernel/generic/include/adt/bitmap.h	(revision 1b20da07baaa3e3c424f62c927274e676e4295cd)
+++ kernel/generic/include/adt/bitmap.h	(revision 314f4b59687d394aa33a8c64a0f52470e5767db7)
@@ -54,8 +54,8 @@
 	if (element >= bitmap->elements)
 		return;
-	
+
 	size_t byte = element / BITMAP_ELEMENT;
 	uint8_t mask = 1 << (element & BITMAP_REMAINER);
-	
+
 	if (value) {
 		bitmap->bits[byte] |= mask;
@@ -70,8 +70,8 @@
 	if (element >= bitmap->elements)
 		return 0;
-	
+
 	size_t byte = element / BITMAP_ELEMENT;
 	uint8_t mask = 1 << (element & BITMAP_REMAINER);
-	
+
 	return !!((bitmap->bits)[byte] & mask);
 }
Index: kernel/generic/include/adt/btree.h
===================================================================
--- kernel/generic/include/adt/btree.h	(revision 1b20da07baaa3e3c424f62c927274e676e4295cd)
+++ kernel/generic/include/adt/btree.h	(revision 314f4b59687d394aa33a8c64a0f52470e5767db7)
@@ -60,5 +60,5 @@
 	 */
 	void *value[BTREE_MAX_KEYS + 1];
-	
+
 	/**
 	 * Pointers to descendants of this node sorted according to the key
Index: kernel/generic/include/adt/cht.h
===================================================================
--- kernel/generic/include/adt/cht.h	(revision 1b20da07baaa3e3c424f62c927274e676e4295cd)
+++ kernel/generic/include/adt/cht.h	(revision 314f4b59687d394aa33a8c64a0f52470e5767db7)
@@ -95,5 +95,5 @@
 	/** Item specific operations. */
 	cht_ops_t *op;
-	
+
 	/** Buckets currently in use. */
 	cht_buckets_t *b;
@@ -120,5 +120,5 @@
 	 */
 	atomic_t resize_reqs;
-	
+
 	/** Number of items in the table that have not been logically deleted. */
 	atomic_t item_cnt;
Index: kernel/generic/include/adt/hash_table.h
===================================================================
--- kernel/generic/include/adt/hash_table.h	(revision 1b20da07baaa3e3c424f62c927274e676e4295cd)
+++ kernel/generic/include/adt/hash_table.h	(revision 314f4b59687d394aa33a8c64a0f52470e5767db7)
@@ -51,8 +51,8 @@
 	/** Returns the hash of the key stored in the item (ie its lookup key). */
 	size_t (*hash)(const ht_link_t *item);
-	
+
 	/** Returns the hash of the key. */
 	size_t (*key_hash)(void *key);
-	
+
 	/** True if the items are equal (have the same lookup keys). */
 	bool (*equal)(const ht_link_t *item1, const ht_link_t *item2);
Index: kernel/generic/include/adt/list.h
===================================================================
--- kernel/generic/include/adt/list.h	(revision 1b20da07baaa3e3c424f62c927274e676e4295cd)
+++ kernel/generic/include/adt/list.h	(revision 314f4b59687d394aa33a8c64a0f52470e5767db7)
@@ -231,5 +231,5 @@
 		link->prev->next = link->next;
 	}
-	
+
 	link_initialize(link);
 }
@@ -314,7 +314,7 @@
 	part1->prev->next = part2;
 	part2->prev->next = part1;
-	
+
 	link_t *hlp = part1->prev;
-	
+
 	part1->prev = part2->prev;
 	part2->prev = hlp;
@@ -378,14 +378,14 @@
 {
 	unsigned long cnt = 0;
-	
+
 	link_t *link = list_first(list);
 	while (link != NULL) {
 		if (cnt == n)
 			return link;
-		
+
 		cnt++;
 		link = list_next(link, list);
 	}
-	
+
 	return NULL;
 }