-/**********************************************************************/
-/** The loops datastructure **/
-/** **/
-/** The loops datastructure represents circles in the intermediate **/
-/** representation. It does not represent loops in the terms of a **/
-/** source program. **/
-/** Each ir_graph can contain one outermost loop datastructure. **/
-/** loop is the entry point to the nested loops. **/
-/** The loop datastructure contains a field indicating the depth of **/
-/** the loop within the nesting. Further it contains a list of the **/
-/** loops with nesting depth -1. Finally it contains a list of all **/
-/** nodes in the loop. **/
-/* @@@ We could add a field pointing from a node to the containing loop,
- this would cost a lot of memory, though. */
-/**********************************************************************/
-
+/**
+ * The loops datastructure.
+ *
+ * The loops datastructure represents circles in the intermediate
+ * representation. It does not represent loops in the terms of a
+ * source program.
+ * Each ir_graph can contain one outermost loop datastructure.
+ * loop is the entry point to the nested loops.
+ * The loop datastructure contains a field indicating the depth of
+ * the loop within the nesting. Further it contains a list of the
+ * loops with nesting depth -1. Finally it contains a list of all
+ * nodes in the loop.
+ *
+ * @todo We could add a field pointing from a node to the containing loop,
+ * this would cost a lot of memory, though.
+ */