Commit 6f2b3c29 authored by yb9976's avatar yb9976
Browse files

Summary is not a doxygen tag

[r26407]
parent 53a978ca
......@@ -22,7 +22,7 @@
* @author Sebastian Hack
* @date 20.04.2007
* @version $Id$
* @summary
* @brief
*
* An abstract graph "interface". Currently
* only used by the DFS facility.
......
......@@ -22,7 +22,7 @@
* @author Kimon Hoffmann
* @date 14.07.2005
* @cvs-id $Id$
* @summary Simple, non circular, double linked pointer list.
* @brief Simple, non circular, double linked pointer list.
* Created because the properties of the standard circular list were
* not very well suited for the interference graph implementation.
* This list uses an obstack and a free-list to efficiently manage its
......
......@@ -23,7 +23,7 @@
* @date 15.10.2004
* @author Matthias Braun
* @version $Id$
* @summary
* @brief
* Raw bitsets are constructed from unsigned int arrays. Additional information
* like the size of the bitset or the used memory are not stored for
* efficiency reasons.
......
......@@ -22,7 +22,7 @@
* @brief Union-Find datastructure
* @author Matthias Braun
* @version $Id$
* @summary
* @brief
* Union-Find datastructure
*
* This implementation uses weighted sets and path compression which results
......
......@@ -23,7 +23,7 @@
* @author Goetz Lindenmaier
* @date 21.7.2004
* @version $Id$
* @summary
* @brief
* This file contains the representation of the callgraph.
* The nodes of the call graph are ir_graphs. The edges between
* the nodes are calling relations. I.e., if method a calls method
......
......@@ -23,8 +23,7 @@
* @author Hubert Schmid
* @date 09.06.2002
* @version $Id$
* @summary
* @summary
* @brief
* Interprocedural analysis to estimate the calling relation.
*
* This analysis computes all entities representing methods that
......
......@@ -23,7 +23,7 @@
* @author Goetz Lindenmaier, Michael Beck
* @date 2001
* @version $Id$
* @summary
* @brief
* Firm requires a debugging module fulfilling this interface, else no
* debugging information is passed to the backend.
* The interface requires a datatype representing the debugging
......
......@@ -22,7 +22,7 @@
* @author Sebastian Hack
* @date 20.04.2007
* @version $Id$
* @summary
* @brief
*
* Primitive depth-first search on the CFG.
*/
......
......@@ -23,7 +23,7 @@
* @author Goetz Lindenmaier
* @date 5.11.2004
* @version $Id$
* @summary
* @brief
* We assume the start block of a procedure is executed once. Based on this we
* compute the execution freqency of all blocks.
*
......
......@@ -22,7 +22,7 @@
* @brief Central firm header.
* @author Martin Trapp, Christian Schaefer, Goetz Lindenmaier
* @version $Id$
* @summary
* @brief
* Central FIRM header.
*
* FIRM is a full graph based intermediate representation in SSA Form
......
......@@ -22,7 +22,7 @@
* @brief Data type for unique names.
* @author Goetz Lindenmaier
* @version $Id$
* @summary
* @brief
* Declarations for identifiers in the firm library
*
* Identifiers are used in the firm library. This is the interface to it.
......
......@@ -23,7 +23,7 @@
* @author Goetz Lindenmaier
* @date 5.11.2004
* @version $Id$
* @summary
* @brief
* Decompost control flow graph into acylic, hierarchic intervals.
*
* The analysis is based on the control flow looptree. An intervall
......
......@@ -23,10 +23,10 @@
* @author Hubert Schmid
* @date 09.06.2002
* @version $Id$
* @summary
* @brief
* (TODO: translate to english)
* Entfernen von nicht erreichbaren (aufrufbaren) Methoden. Die Menge
* der nicht erreichbaren Methoden wird aus der Abschtzung der
* der nicht erreichbaren Methoden wird aus der Absch�tzung der
* Aufrufrelation bestimmt.
*/
#ifndef FIRM_IR_ICGOPT_H
......
......@@ -23,7 +23,7 @@
* @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:
......
......@@ -22,7 +22,7 @@
* @brief Write vcg representation of firm to file.
* @author Martin Trapp, Christian Schaefer, Goetz Lindenmaier, Hubert Schmidt
* @version $Id$
* @summary
* @brief
* Dump routines for the ir graph and all type information.
*
* The dump format of most functions is vcg. This is a text based graph
......
......@@ -22,7 +22,7 @@
* @brief Flags to control optimizations.
* @author Christian Schaefer, Goetz Lindenmaier, Michael Beck
* @version $Id$
* @summary
* @brief
* Flags to customize the behavior of libfirm.
*
* There are the following groups of flags:
......
......@@ -22,7 +22,7 @@
* @brief Traverse an ir graph
* @author Boris Boesler, Goetz Lindenmaier
* @version $Id$
* @summary
* @brief
* Traverse an ir graph:
* - execute the pre function before recursion
* - execute the post function after recursion
......
......@@ -22,7 +22,7 @@
* @author Sebastian Hack
* @date 22.04.2007
* @version $Id$
* @summary
* @brief
*
* Live in/end checks whose only precomputation concerns the structure of the CFG.
* Hence, nothing has to be updated if the program is modified unless the CFG is touched.
......
......@@ -23,7 +23,7 @@
* @author Goetz Lindenmaier
* @date 7.2002
* @version $Id$
* @summary
* @brief
* Computes backedges in the control and data flow.
*
* @note
......
......@@ -23,7 +23,7 @@
* @author Martin Trapp, Christian Schaefer, Goetz Lindenmaier, Mathias Heil,
* Michael Beck
* @version $Id$
* @summary
* @brief
* This module specifies the modes that type the firm nodes. It defines
* a datasturcture that describes a mode and implements constructors and
* access routines to this datastructure. Further it defines a set of
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment