/*
- * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
+ * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
*
* This file is part of libFirm.
*
* @author Goetz Lindenmaier
* @date 2.2002
* @version $Id$
- * @summary
+ * @brief
* This file contains routines to construct and access dominator information.
*
* The dominator information is stored in three fields of block nodes:
*
* @param irn A node.
* @param handle_phi 1 if Phis should be handled different
- * @return The first block dominating all users of @irn
+ * @return The first block dominating all users of @p irn
*/
ir_node *node_users_smallest_common_dominator(ir_node *irn, int handle_phi);
*/
void compute_doms(ir_graph *irg);
-/** Computes the dominator trees on demand */
+/** Computes the dominator trees on demand, @see compute_doms(). */
void assure_doms(ir_graph *irg);
/** Computes the post dominator trees.