Index: kernel/generic/include/adt/avl.h
===================================================================
--- kernel/generic/include/adt/avl.h	(revision a211838659e5f36770cab316785a73bb49c1fca5)
+++ kernel/generic/include/adt/avl.h	(revision 3061bc129a855122d429fbba1e623a521aaa164c)
@@ -62,5 +62,5 @@
 struct avltree_node
 {
-	/** 
+	/**
 	 * Pointer to the left descendant of this node.
 	 *
@@ -70,5 +70,5 @@
 	struct avltree_node *lft;
 	
-	/** 
+	/**
 	 * Pointer to the right descendant of this node.
 	 *
@@ -82,5 +82,5 @@
 	
 	/** Node's key. */
-	avltree_key_t key; 
+	avltree_key_t key;
 	
 	/**
@@ -97,13 +97,13 @@
 	struct avltree_node *root;
 
-	/** 
+	/**
 	 * Base of the tree is a value that is smaller or equal than every value
 	 * in the tree (valid for positive keys otherwise ignore this atribute).
-	 *  
+	 *
 	 * The base is added to the current key when a new node is inserted into
 	 * the tree. The base is changed to the key of the node which is deleted
 	 * with avltree_delete_min().
 	 */
-	avltree_key_t base; 
+	avltree_key_t base;
 };
 
Index: kernel/generic/include/adt/btree.h
===================================================================
--- kernel/generic/include/adt/btree.h	(revision a211838659e5f36770cab316785a73bb49c1fca5)
+++ kernel/generic/include/adt/btree.h	(revision 3061bc129a855122d429fbba1e623a521aaa164c)
@@ -55,5 +55,5 @@
 	btree_key_t key[BTREE_MAX_KEYS + 1];
 
-	/** 
+	/**
 	 * Pointers to values. Sorted according to the key array. Defined only in
 	 * leaf-level. There is room for storing value for the extra key.
Index: kernel/generic/include/adt/cht.h
===================================================================
--- kernel/generic/include/adt/cht.h	(revision a211838659e5f36770cab316785a73bb49c1fca5)
+++ kernel/generic/include/adt/cht.h	(revision 3061bc129a855122d429fbba1e623a521aaa164c)
@@ -46,9 +46,9 @@
 /** Concurrent hash table node link. */
 typedef struct cht_link {
-	/* Must be placed first. 
-	 * 
-	 * The function pointer (rcu_link.func) is used to store the item's 
-	 * mixed memoized hash. If in use by RCU (ie waiting for deferred 
-	 * destruction) the hash will contain the value of 
+	/* Must be placed first.
+	 *
+	 * The function pointer (rcu_link.func) is used to store the item's
+	 * mixed memoized hash. If in use by RCU (ie waiting for deferred
+	 * destruction) the hash will contain the value of
 	 * cht_t.op->remove_callback.
 	 */
@@ -64,5 +64,5 @@
 typedef struct cht_ops {
 	/** Returns the hash of the item.
-	 * 
+	 *
 	 * Applicable also to items that were logically deleted from the table
 	 * but have yet to be physically removed by means of remove_callback().
@@ -80,5 +80,5 @@
 
 /** Groups hash table buckets with their count.
- * 
+ *
  * It allows both the number of buckets as well as the bucket array
  * to be swapped atomically when resing the table.
@@ -100,9 +100,9 @@
 	/** Resized table buckets that will replace b once resize is complete. */
 	cht_buckets_t *new_b;
-	/** Invalid memoized hash value. 
-	 * 
+	/** Invalid memoized hash value.
+	 *
 	 * If cht_link.hash contains this value the item had been logically
 	 * removed and is waiting to be freed. Such hashes (and the associated
-	 * items) are disregarded and skipped or the actual hash must be 
+	 * items) are disregarded and skipped or the actual hash must be
 	 * determined via op->hash().
 	 */
@@ -116,5 +116,5 @@
 	work_t resize_work;
 	/** If positive the table should grow or shrink.
-	 * 
+	 *
 	 * If not 0 resize work had already been posted to the system work queue.
 	 */
@@ -133,5 +133,5 @@
 
 extern bool cht_create_simple(cht_t *h, cht_ops_t *op);
-extern bool cht_create(cht_t *h, size_t init_size, size_t min_size, 
+extern bool cht_create(cht_t *h, size_t init_size, size_t min_size,
 	size_t max_load, bool can_block, cht_ops_t *op);
 extern void cht_destroy(cht_t *h);
Index: kernel/generic/include/adt/fifo.h
===================================================================
--- kernel/generic/include/adt/fifo.h	(revision a211838659e5f36770cab316785a73bb49c1fca5)
+++ kernel/generic/include/adt/fifo.h	(revision 3061bc129a855122d429fbba1e623a521aaa164c)
@@ -72,5 +72,5 @@
  *
  * FIFO is allocated dynamically.
- * This macro is suitable for creating larger FIFOs. 
+ * This macro is suitable for creating larger FIFOs.
  *
  * @param name Name of FIFO.
Index: kernel/generic/include/adt/hash.h
===================================================================
--- kernel/generic/include/adt/hash.h	(revision a211838659e5f36770cab316785a73bb49c1fca5)
+++ kernel/generic/include/adt/hash.h	(revision 3061bc129a855122d429fbba1e623a521aaa164c)
@@ -75,5 +75,5 @@
 
 /** Produces a uniform hash affecting all output bits from the skewed input. */
-static inline size_t hash_mix(size_t hash) 
+static inline size_t hash_mix(size_t hash)
 {
 #ifdef __32_BITS__
@@ -87,5 +87,5 @@
 
 /** Use to create a hash from multiple values.
- * 
+ *
  * Typical usage:
  * @code
@@ -101,5 +101,5 @@
 static inline size_t hash_combine(size_t seed, size_t hash)
 {
-	/* 
+	/*
 	 * todo: use Bob Jenkin's proper mixing hash pass:
 	 * http://burtleburtle.net/bob/c/lookup3.c
Index: kernel/generic/include/adt/hash_table.h
===================================================================
--- kernel/generic/include/adt/hash_table.h	(revision a211838659e5f36770cab316785a73bb49c1fca5)
+++ kernel/generic/include/adt/hash_table.h	(revision 3061bc129a855122d429fbba1e623a521aaa164c)
@@ -2,5 +2,5 @@
  * Copyright (c) 2006 Jakub Jermar
  * Copyright (c) 2012 Adam Hraska
- * 
+ *
  * All rights reserved.
  *
@@ -62,5 +62,5 @@
 
 	/** Hash table item removal callback.
-	 * 
+	 *
 	 * Must not invoke any mutating functions of the hash table.
 	 *
Index: kernel/generic/include/adt/list.h
===================================================================
--- kernel/generic/include/adt/list.h	(revision a211838659e5f36770cab316785a73bb49c1fca5)
+++ kernel/generic/include/adt/list.h	(revision 3061bc129a855122d429fbba1e623a521aaa164c)
@@ -66,12 +66,12 @@
 
 /** Initializer for statically allocated list.
- * 
+ *
  * @code
  * struct named_list {
  *     const char *name;
  *     list_t list;
- * } var = { 
- *     .name = "default name", 
- *     .list = LIST_INITIALIZER(name_list.list) 
+ * } var = {
+ *     .name = "default name",
+ *     .list = LIST_INITIALIZER(name_list.list)
  * };
  * @endcode
@@ -111,7 +111,7 @@
  *     link_t item_link;
  * } item_t;
- * 
+ *
  * //..
- * 
+ *
  * // Print each list element's value and remove the element from the list.
  * list_foreach_safe(mylist, cur_link, next_link) {
@@ -121,5 +121,5 @@
  * }
  * @endcode
- * 
+ *
  * @param list List to traverse.
  * @param iterator Iterator to the current element of the list.
Index: kernel/generic/include/arch.h
===================================================================
--- kernel/generic/include/arch.h	(revision a211838659e5f36770cab316785a73bb49c1fca5)
+++ kernel/generic/include/arch.h	(revision 3061bc129a855122d429fbba1e623a521aaa164c)
@@ -71,5 +71,5 @@
 #ifdef RCU_PREEMPT_A
 	size_t rcu_nesting;    /**< RCU nesting count and flag. */
-#endif 
+#endif
 	struct thread *thread; /**< Current thread. */
 	struct task *task;     /**< Current task. */
Index: kernel/generic/include/cpu/cpu_mask.h
===================================================================
--- kernel/generic/include/cpu/cpu_mask.h	(revision a211838659e5f36770cab316785a73bb49c1fca5)
+++ kernel/generic/include/cpu/cpu_mask.h	(revision 3061bc129a855122d429fbba1e623a521aaa164c)
@@ -39,11 +39,11 @@
 #include <lib/memfnc.h>
 
-/** Iterates over all cpu id's whose bit is included in the cpu mask. 
- * 
+/** Iterates over all cpu id's whose bit is included in the cpu mask.
+ *
  * Example usage:
  * @code
  * DEFINE_CPU_MASK(cpu_mask);
  * cpu_mask_active(&cpu_mask);
- * 
+ *
  * cpu_mask_for_each(cpu_mask, cpu_id) {
  *     printf("Cpu with logical id %u is active.\n", cpu_id);
@@ -53,5 +53,5 @@
 #define cpu_mask_for_each(mask, cpu_id) \
 	for (unsigned int (cpu_id) = 0; (cpu_id) < config.cpu_count; ++(cpu_id)) \
-		if (cpu_mask_is_set(&(mask), (cpu_id))) 
+		if (cpu_mask_is_set(&(mask), (cpu_id)))
 
 /** Allocates a cpu_mask_t on stack. */
@@ -74,5 +74,5 @@
 extern bool cpu_mask_is_none(cpu_mask_t *);
 
-#endif /* KERN_CPU_CPU_MASK_H_ */ 
+#endif /* KERN_CPU_CPU_MASK_H_ */
 
 /** @}
Index: kernel/generic/include/ddi/irq.h
===================================================================
--- kernel/generic/include/ddi/irq.h	(revision a211838659e5f36770cab316785a73bb49c1fca5)
+++ kernel/generic/include/ddi/irq.h	(revision 3061bc129a855122d429fbba1e623a521aaa164c)
@@ -126,5 +126,5 @@
 	
 	/** Notification configuration structure. */
-	ipc_notif_cfg_t notif_cfg; 
+	ipc_notif_cfg_t notif_cfg;
 } irq_t;
 
Index: kernel/generic/include/fpu_context.h
===================================================================
--- kernel/generic/include/fpu_context.h	(revision a211838659e5f36770cab316785a73bb49c1fca5)
+++ kernel/generic/include/fpu_context.h	(revision 3061bc129a855122d429fbba1e623a521aaa164c)
@@ -1,4 +1,4 @@
 /*
- * Copyright (c) 2005 Jakub Vana 
+ * Copyright (c) 2005 Jakub Vana
  * All rights reserved.
  *
@@ -27,5 +27,5 @@
  */
 
-/** @addtogroup generic	
+/** @addtogroup generic
  * @{
  */
Index: kernel/generic/include/ipc/sysipc_ops.h
===================================================================
--- kernel/generic/include/ipc/sysipc_ops.h	(revision a211838659e5f36770cab316785a73bb49c1fca5)
+++ kernel/generic/include/ipc/sysipc_ops.h	(revision 3061bc129a855122d429fbba1e623a521aaa164c)
@@ -1,4 +1,4 @@
 /*
- * Copyright (c) 2012 Jakub Jermar 
+ * Copyright (c) 2012 Jakub Jermar
  * All rights reserved.
  *
@@ -84,5 +84,5 @@
 	/**
 	 * This callback is called from request_preprocess().
-	 * 
+	 *
 	 * Context:		caller
 	 * Caller alive:	guaranteed
Index: kernel/generic/include/ipc/sysipc_priv.h
===================================================================
--- kernel/generic/include/ipc/sysipc_priv.h	(revision a211838659e5f36770cab316785a73bb49c1fca5)
+++ kernel/generic/include/ipc/sysipc_priv.h	(revision 3061bc129a855122d429fbba1e623a521aaa164c)
@@ -1,4 +1,4 @@
 /*
- * Copyright (c) 2012 Jakub Jermar 
+ * Copyright (c) 2012 Jakub Jermar
  * All rights reserved.
  *
Index: kernel/generic/include/mm/as.h
===================================================================
--- kernel/generic/include/mm/as.h	(revision a211838659e5f36770cab316785a73bb49c1fca5)
+++ kernel/generic/include/mm/as.h	(revision 3061bc129a855122d429fbba1e623a521aaa164c)
@@ -72,5 +72,5 @@
 
 /** The page fault was resolved by as_page_fault(). */
-#define AS_PF_OK     0 
+#define AS_PF_OK     0
 
 /** The page fault was caused by memcpy_from_uspace() or memcpy_to_uspace(). */
Index: kernel/generic/include/mm/page.h
===================================================================
--- kernel/generic/include/mm/page.h	(revision a211838659e5f36770cab316785a73bb49c1fca5)
+++ kernel/generic/include/mm/page.h	(revision 3061bc129a855122d429fbba1e623a521aaa164c)
@@ -42,5 +42,5 @@
 
 #define P2SZ(pages) \
-	((pages) << PAGE_WIDTH)	
+	((pages) << PAGE_WIDTH)
 
 /** Operations to manipulate page mappings. */
Index: kernel/generic/include/mm/tlb.h
===================================================================
--- kernel/generic/include/mm/tlb.h	(revision a211838659e5f36770cab316785a73bb49c1fca5)
+++ kernel/generic/include/mm/tlb.h	(revision 3061bc129a855122d429fbba1e623a521aaa164c)
@@ -73,5 +73,5 @@
 extern void tlb_shootdown_ipi_recv(void);
 #else
-#define tlb_shootdown_start(w, x, y, z)	interrupts_disable()	
+#define tlb_shootdown_start(w, x, y, z)	interrupts_disable()
 #define tlb_shootdown_finalize(i)	(interrupts_restore(i));
 #define tlb_shootdown_ipi_recv()
Index: kernel/generic/include/proc/thread.h
===================================================================
--- kernel/generic/include/proc/thread.h	(revision a211838659e5f36770cab316785a73bb49c1fca5)
+++ kernel/generic/include/proc/thread.h	(revision 3061bc129a855122d429fbba1e623a521aaa164c)
@@ -190,5 +190,5 @@
 	struct work_queue *workq;
 	/** Links work queue threads. Protected by workq->lock. */
-	link_t workq_link; 
+	link_t workq_link;
 	/** True if the worker was blocked and is not running. Use thread->lock. */
 	bool workq_blocked;
Index: kernel/generic/include/security/perm.h
===================================================================
--- kernel/generic/include/security/perm.h	(revision a211838659e5f36770cab316785a73bb49c1fca5)
+++ kernel/generic/include/security/perm.h	(revision 3061bc129a855122d429fbba1e623a521aaa164c)
@@ -40,5 +40,5 @@
  * holder to perform certain security sensitive tasks.
  *
- * Each task can have arbitrary combination of the permissions 
+ * Each task can have arbitrary combination of the permissions
  * defined in this file. Therefore, they are required to be powers
  * of two.
Index: kernel/generic/include/synch/rcu.h
===================================================================
--- kernel/generic/include/synch/rcu.h	(revision a211838659e5f36770cab316785a73bb49c1fca5)
+++ kernel/generic/include/synch/rcu.h	(revision 3061bc129a855122d429fbba1e623a521aaa164c)
@@ -41,7 +41,7 @@
 
 
-/** Use to assign a pointer to newly initialized data to a rcu reader 
+/** Use to assign a pointer to newly initialized data to a rcu reader
  * accessible pointer.
- * 
+ *
  * Example:
  * @code
@@ -50,8 +50,8 @@
  *     int grade;
  * } exam_t;
- * 
+ *
  * exam_t *exam_list;
  * // ..
- * 
+ *
  * // Insert at the beginning of the list.
  * exam_t *my_exam = malloc(sizeof(exam_t), 0);
@@ -59,5 +59,5 @@
  * my_exam->next = exam_list;
  * rcu_assign(exam_list, my_exam);
- * 
+ *
  * // Changes properly propagate. Every reader either sees
  * // the old version of exam_list or the new version with
@@ -65,5 +65,5 @@
  * rcu_synchronize();
  * // Now we can be sure every reader sees my_exam.
- * 
+ *
  * @endcode
  */
@@ -75,13 +75,13 @@
 
 /** Use to access RCU protected data in a reader section.
- * 
+ *
  * Example:
  * @code
  * exam_t *exam_list;
  * // ...
- * 
+ *
  * rcu_read_lock();
  * exam_t *first_exam = rcu_access(exam_list);
- * // We can now safely use first_exam, it won't change 
+ * // We can now safely use first_exam, it won't change
  * // under us while we're using it.
  *
@@ -131,6 +131,6 @@
 void _rcu_preempted_unlock(void);
 
-/** Delimits the start of an RCU reader critical section. 
- * 
+/** Delimits the start of an RCU reader critical section.
+ *
  * Reader sections may be nested and are preemptible. You must not
  * however block/sleep within reader sections.
@@ -165,12 +165,12 @@
 	assert(PREEMPTION_DISABLED || interrupts_disabled());
 	
-	/* 
-	 * A new GP was started since the last time we passed a QS. 
+	/*
+	 * A new GP was started since the last time we passed a QS.
 	 * Notify the detector we have reached a new QS.
 	 */
 	if (CPU->rcu.last_seen_gp != _rcu_cur_gp) {
 		rcu_gp_t cur_gp = ACCESS_ONCE(_rcu_cur_gp);
-		/* 
-		 * Contain memory accesses within a reader critical section. 
+		/*
+		 * Contain memory accesses within a reader critical section.
 		 * If we are in rcu_lock() it also makes changes prior to the
 		 * start of the GP visible in the reader section.
@@ -180,19 +180,19 @@
 		 * Acknowledge we passed a QS since the beginning of rcu.cur_gp.
 		 * Cache coherency will lazily transport the value to the
-		 * detector while it sleeps in gp_sleep(). 
-		 * 
+		 * detector while it sleeps in gp_sleep().
+		 *
 		 * Note that there is a theoretical possibility that we
-		 * overwrite a more recent/greater last_seen_gp here with 
+		 * overwrite a more recent/greater last_seen_gp here with
 		 * an older/smaller value. If this cpu is interrupted here
-		 * while in rcu_lock() reader sections in the interrupt handler 
-		 * will update last_seen_gp to the same value as is currently 
-		 * in local cur_gp. However, if the cpu continues processing 
-		 * interrupts and the detector starts a new GP immediately, 
-		 * local interrupt handlers may update last_seen_gp again (ie 
-		 * properly ack the new GP) with a value greater than local cur_gp. 
-		 * Resetting last_seen_gp to a previous value here is however 
-		 * benign and we only have to remember that this reader may end up 
+		 * while in rcu_lock() reader sections in the interrupt handler
+		 * will update last_seen_gp to the same value as is currently
+		 * in local cur_gp. However, if the cpu continues processing
+		 * interrupts and the detector starts a new GP immediately,
+		 * local interrupt handlers may update last_seen_gp again (ie
+		 * properly ack the new GP) with a value greater than local cur_gp.
+		 * Resetting last_seen_gp to a previous value here is however
+		 * benign and we only have to remember that this reader may end up
 		 * in cur_preempted even after the GP ends. That is why we
-		 * append next_preempted to cur_preempted rather than overwriting 
+		 * append next_preempted to cur_preempted rather than overwriting
 		 * it as if cur_preempted were empty.
 		 */
@@ -201,6 +201,6 @@
 }
 
-/** Delimits the start of an RCU reader critical section. 
- * 
+/** Delimits the start of an RCU reader critical section.
+ *
  * Reader sections may be nested and are preemptable. You must not
  * however block/sleep within reader sections.
@@ -229,7 +229,7 @@
 		_rcu_record_qs();
 		
-		/* 
-		 * The thread was preempted while in a critical section or 
-		 * the detector is eagerly waiting for this cpu's reader to finish. 
+		/*
+		 * The thread was preempted while in a critical section or
+		 * the detector is eagerly waiting for this cpu's reader to finish.
 		 */
 		if (CPU->rcu.signal_unlock) {
Index: kernel/generic/include/synch/rcu_types.h
===================================================================
--- kernel/generic/include/synch/rcu_types.h	(revision a211838659e5f36770cab316785a73bb49c1fca5)
+++ kernel/generic/include/synch/rcu_types.h	(revision 3061bc129a855122d429fbba1e623a521aaa164c)
@@ -72,12 +72,12 @@
 	
 	/** True if we should signal the detector that we exited a reader section.
-	 * 
+	 *
 	 * Equal to (THREAD->rcu.was_preempted || CPU->rcu.is_delaying_gp).
 	 */
 	bool signal_unlock;
 
-	/** The number of times an RCU reader section is nested on this cpu. 
-	 * 
-	 * If positive, it is definitely executing reader code. If zero, 
+	/** The number of times an RCU reader section is nested on this cpu.
+	 *
+	 * If positive, it is definitely executing reader code. If zero,
 	 * the thread might already be executing reader code thanks to
 	 * cpu instruction reordering.
@@ -92,5 +92,5 @@
 	/** Number of callbacks in cur_cbs. */
 	size_t cur_cbs_cnt;
-	/** Callbacks to invoke once the next grace period ends, ie next_cbs_gp. 
+	/** Callbacks to invoke once the next grace period ends, ie next_cbs_gp.
 	 * Accessed by the local reclaimer only.
 	 */
@@ -102,5 +102,5 @@
 	/** Tail of arriving_cbs list. Disable interrupts to access. */
 	rcu_item_t **parriving_cbs_tail;
-	/** Number of callbacks currently in arriving_cbs. 
+	/** Number of callbacks currently in arriving_cbs.
 	 * Disable interrupts to access.
 	 */
@@ -110,9 +110,9 @@
 	rcu_gp_t cur_cbs_gp;
 	/** At the end of this grace period callbacks in next_cbs will be invoked.
-	 * 
-	 * Should be the next grace period but it allows the reclaimer to 
+	 *
+	 * Should be the next grace period but it allows the reclaimer to
 	 * notice if it missed a grace period end announcement. In that
 	 * case it can execute next_cbs without waiting for another GP.
-	 * 
+	 *
 	 * Invariant: next_cbs_gp >= cur_cbs_gp
 	 */
@@ -143,6 +143,6 @@
 /** RCU related per-thread data. */
 typedef struct rcu_thread_data {
-	/** 
-	 * Nesting count of the thread's RCU read sections when the thread 
+	/**
+	 * Nesting count of the thread's RCU read sections when the thread
 	 * is not running.
 	 */
@@ -151,9 +151,9 @@
 #ifdef RCU_PREEMPT_PODZIMEK
 	
-	/** True if the thread was preempted in a reader section. 
+	/** True if the thread was preempted in a reader section.
 	 *
 	 * The thread is placed into rcu.cur_preempted or rcu.next_preempted
-	 * and must remove itself in rcu_read_unlock(). 
-	 * 
+	 * and must remove itself in rcu_read_unlock().
+	 *
 	 * Access with interrupts disabled.
 	 */
Index: kernel/generic/include/synch/workqueue.h
===================================================================
--- kernel/generic/include/synch/workqueue.h	(revision a211838659e5f36770cab316785a73bb49c1fca5)
+++ kernel/generic/include/synch/workqueue.h	(revision 3061bc129a855122d429fbba1e623a521aaa164c)
@@ -53,5 +53,5 @@
 	/* Magic number for integrity checks. */
 	uint32_t cookie;
-#endif 
+#endif
 } work_t;
 
Index: kernel/generic/include/userspace.h
===================================================================
--- kernel/generic/include/userspace.h	(revision a211838659e5f36770cab316785a73bb49c1fca5)
+++ kernel/generic/include/userspace.h	(revision 3061bc129a855122d429fbba1e623a521aaa164c)
@@ -40,5 +40,5 @@
 
 /** Switch to user-space (CPU user priviledge level) */
-extern void userspace(uspace_arg_t *uarg) __attribute__ ((noreturn)); 
+extern void userspace(uspace_arg_t *uarg) __attribute__ ((noreturn));
 
 #endif