Index: generic/src/adt/bitmap.c
===================================================================
--- generic/src/adt/bitmap.c	(revision cf85e24c9b6fc5900e0535710b65384f89867e00)
+++ generic/src/adt/bitmap.c	(revision a98cdc75925619cf46177b7e734930398d02a8e2)
@@ -25,4 +25,12 @@
  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+/**
+ * @file	bitmap.c
+ * @brief	Implementation of bitmap ADT.
+ *
+ * This file implements bitmap ADT and provides functions for
+ * setting and clearing ranges of bits.
  */
 
Index: generic/src/adt/btree.c
===================================================================
--- generic/src/adt/btree.c	(revision cf85e24c9b6fc5900e0535710b65384f89867e00)
+++ generic/src/adt/btree.c	(revision a98cdc75925619cf46177b7e734930398d02a8e2)
@@ -27,10 +27,14 @@
  */
 
-/*
- * This B-tree has the following properties:
- * - it is a ballanced 3-4-5 tree (i.e. BTREE_M = 5)
- * - values (i.e. pointers to values) are stored only in leaves
- * - leaves are linked in a list
- * - technically, it is a B+tree (because of the previous properties)
+/**
+ * @file	btree.c
+ * @brief	B+tree implementation.
+ *
+ * This file implements B+tree type and operations.
+ *
+ * The B+tree has the following properties:
+ * @li it is a ballanced 3-4-5 tree (i.e. BTREE_M = 5)
+ * @li values (i.e. pointers to values) are stored only in leaves
+ * @li leaves are linked in a list
  *
  * Be carefull when using these trees. They need to allocate
Index: generic/src/adt/hash_table.c
===================================================================
--- generic/src/adt/hash_table.c	(revision cf85e24c9b6fc5900e0535710b65384f89867e00)
+++ generic/src/adt/hash_table.c	(revision a98cdc75925619cf46177b7e734930398d02a8e2)
@@ -27,6 +27,9 @@
  */
 
-/*
- * This is an implementation of generic chained hash table.
+/**
+ * @file	hash_table.c
+ * @brief	Implementation of generic chained hash table.
+ *
+ * This file contains implementation of generic chained hash table.
  */
 
@@ -126,5 +129,5 @@
  * @param h Hash table.
  * @param key Array of keys that will be compared against items of the hash table.
- * @param keys Number of keys in the 'key' array.
+ * @param keys Number of keys in the key array.
  */
 void hash_table_remove(hash_table_t *h, __native key[], count_t keys)
Index: generic/src/adt/list.c
===================================================================
--- generic/src/adt/list.c	(revision cf85e24c9b6fc5900e0535710b65384f89867e00)
+++ generic/src/adt/list.c	(revision a98cdc75925619cf46177b7e734930398d02a8e2)
@@ -27,6 +27,13 @@
  */
 
+/**
+ * @file	list.c
+ * @brief	Functions completing doubly linked circular list implementaion.
+ *
+ * This file contains some of the functions implementing doubly linked circular lists.
+ * However, this ADT is mostly implemented in @ref list.h.
+ */
+
 #include <adt/list.h>
-
 
 /** Check for membership