Commit 800e4d37 authored by yb9976's avatar yb9976
Browse files

Summary is not a doxygen tag

[r26408]
parent 6f2b3c29
...@@ -22,7 +22,7 @@ ...@@ -22,7 +22,7 @@
* @author Sebastian Hack * @author Sebastian Hack
* @date 20.04.2007 * @date 20.04.2007
* @version $Id$ * @version $Id$
* @summary * @brief
* *
* Abstract graph implementations for the CFG of a ir_graph. * Abstract graph implementations for the CFG of a ir_graph.
*/ */
......
...@@ -23,7 +23,7 @@ ...@@ -23,7 +23,7 @@
* @author Hubert Schmid * @author Hubert Schmid
* @date 09.06.2002 * @date 09.06.2002
* @version $Id$ * @version $Id$
* @summary * @brief
* Interprocedural analysis to estimate the calling relation. * Interprocedural analysis to estimate the calling relation.
* *
* This analysis computes all entities representing methods that * This analysis computes all entities representing methods that
...@@ -118,13 +118,13 @@ static void collect_impls(ir_entity *method, eset *set, int *size, int *open) { ...@@ -118,13 +118,13 @@ static void collect_impls(ir_entity *method, eset *set, int *size, int *open) {
collect_impls(get_entity_overwrittenby(method, i), set, size, open); collect_impls(get_entity_overwrittenby(method, i), set, size, open);
} }
/** Alle Methoden bestimmen, die die übergebene Methode überschreiben /** Alle Methoden bestimmen, die die bergebene Methode berschreiben
* (und implementieren). In der zurückgegebenen Reihung kommt jede * (und implementieren). In der zurckgegebenen Reihung kommt jede
* Methode nur einmal vor. Der Wert 'NULL' steht für unbekannte * Methode nur einmal vor. Der Wert 'NULL' steht fr unbekannte
* (externe) Methoden. Die zurückgegebene Reihung muß vom Aufrufer * (externe) Methoden. Die zurckgegebene Reihung mu vom Aufrufer
* wieder freigegeben werden (siehe "DEL_ARR_F"). Gibt es überhaupt * wieder freigegeben werden (siehe "DEL_ARR_F"). Gibt es berhaupt
* keine Methoden, die "method" überschreiben, so gibt die Methode * keine Methoden, die "method" berschreiben, so gibt die Methode
* "NULL" zurück. * "NULL" zurck.
* *
* @param method * @param method
*/ */
...@@ -139,7 +139,7 @@ static ir_entity ** get_impl_methods(ir_entity * method) { ...@@ -139,7 +139,7 @@ static ir_entity ** get_impl_methods(ir_entity * method) {
/* Vorgaenger einfuegen. */ /* Vorgaenger einfuegen. */
if (size == 0 && !open) { if (size == 0 && !open) {
/* keine implementierte überschriebene Methode */ /* keine implementierte berschriebene Methode */
arr = NULL; arr = NULL;
} else if (open) { } else if (open) {
ir_entity * ent; ir_entity * ent;
...@@ -298,7 +298,7 @@ static ir_entity ** get_Sel_arr(ir_node * sel) { ...@@ -298,7 +298,7 @@ static ir_entity ** get_Sel_arr(ir_node * sel) {
return arr; return arr;
} else { } else {
/* "NULL" zeigt an, dass keine Implementierung existiert. Dies /* "NULL" zeigt an, dass keine Implementierung existiert. Dies
* kann für polymorphe (abstrakte) Methoden passieren. */ * kann fr polymorphe (abstrakte) Methoden passieren. */
if (!NULL_ARRAY) { if (!NULL_ARRAY) {
NULL_ARRAY = NEW_ARR_F(ir_entity *, 0); NULL_ARRAY = NEW_ARR_F(ir_entity *, 0);
} }
...@@ -456,7 +456,7 @@ static void free_ana_walker(ir_node *node, void *env) { ...@@ -456,7 +456,7 @@ static void free_ana_walker(ir_node *node, void *env) {
} }
break; break;
default: default:
/* other nodes: Alle anderen Knoten nehmen wir als Verräter an, bis /* other nodes: Alle anderen Knoten nehmen wir als Verrter an, bis
* jemand das Gegenteil implementiert. */ * jemand das Gegenteil implementiert. */
set_irn_link(node, MARK); set_irn_link(node, MARK);
for (i = get_irn_arity(node) - 1; i >= 0; --i) { for (i = get_irn_arity(node) - 1; i >= 0; --i) {
...@@ -569,9 +569,9 @@ static void add_method_address(ir_entity *ent, eset *set) ...@@ -569,9 +569,9 @@ static void add_method_address(ir_entity *ent, eset *set)
* returns a list of 'free' methods, i.e., the methods that can be called * returns a list of 'free' methods, i.e., the methods that can be called
* from external or via function pointers. * from external or via function pointers.
* *
* Die Datenstrukturen für sel-Methoden (sel_methods) muß vor dem * Die Datenstrukturen fr sel-Methoden (sel_methods) mu vor dem
* Aufruf von "get_free_methods" aufgebaut sein. Die (internen) * Aufruf von "get_free_methods" aufgebaut sein. Die (internen)
* SymConst(name)-Operationen müssen in passende SymConst(ent)-Operationen * SymConst(name)-Operationen mssen in passende SymConst(ent)-Operationen
* umgewandelt worden sein, d.h. SymConst-Operationen verweisen immer * umgewandelt worden sein, d.h. SymConst-Operationen verweisen immer
* auf eine echt externe Methode. * auf eine echt externe Methode.
*/ */
...@@ -648,7 +648,7 @@ static void callee_ana_proj(ir_node *node, long n, eset *methods) { ...@@ -648,7 +648,7 @@ static void callee_ana_proj(ir_node *node, long n, eset *methods) {
case iro_Proj: { case iro_Proj: {
/* proj_proj: in einem "sinnvollen" Graphen kommt jetzt ein /* proj_proj: in einem "sinnvollen" Graphen kommt jetzt ein
* op_Tuple oder ein Knoten, der eine "freie Methode" * op_Tuple oder ein Knoten, der eine "freie Methode"
* zurückgibt. */ * zurckgibt. */
ir_node *pred = get_Proj_pred(node); ir_node *pred = get_Proj_pred(node);
if (get_irn_link(pred) != MARK) { if (get_irn_link(pred) != MARK) {
if (is_Tuple(pred)) { if (is_Tuple(pred)) {
......
...@@ -22,7 +22,7 @@ ...@@ -22,7 +22,7 @@
* @author Sebastian Hack * @author Sebastian Hack
* @date 20.04.2007 * @date 20.04.2007
* @version $Id$ * @version $Id$
* @summary * @brief
* *
* Simple depth first search on CFGs. * Simple depth first search on CFGs.
*/ */
......
...@@ -22,7 +22,7 @@ ...@@ -22,7 +22,7 @@
* @author Sebastian Hack * @author Sebastian Hack
* @date 21.04.2007 * @date 21.04.2007
* @version $Id$ * @version $Id$
* @summary * @brief
* *
* depth first search internal stuff. * depth first search internal stuff.
*/ */
......
...@@ -23,7 +23,7 @@ ...@@ -23,7 +23,7 @@
* @author Matthias Braun * @author Matthias Braun
* @date 5.2005 * @date 5.2005
* @version $Id$ * @version $Id$
* @summary * @brief
* Alternative algorithm for computing extended basic blocks (using out edges * Alternative algorithm for computing extended basic blocks (using out edges
* and execution frequencies) * and execution frequencies)
*/ */
......
...@@ -22,7 +22,7 @@ ...@@ -22,7 +22,7 @@
* @date 21.04.2007 * @date 21.04.2007
* @author Sebastian Hack * @author Sebastian Hack
* @version $Id$ * @version $Id$
* @summary * @brief
* *
* Liveness checks as developed by Benoit Boissinot, Fabrice Rastello and myself. * Liveness checks as developed by Benoit Boissinot, Fabrice Rastello and myself.
* *
......
...@@ -23,7 +23,7 @@ ...@@ -23,7 +23,7 @@
* @author Goetz Lindenmaier * @author Goetz Lindenmaier
* @date 22.8.2003 * @date 22.8.2003
* @version $Id$ * @version $Id$
* @summary * @brief
* Runs most simple type analyses. * Runs most simple type analyses.
* *
* We compute type information for each node. It is derived from the * We compute type information for each node. It is derived from the
......
...@@ -23,7 +23,7 @@ ...@@ -23,7 +23,7 @@
* @author Goetz Lindenmaier * @author Goetz Lindenmaier
* @date 28.8.2003 * @date 28.8.2003
* @version $Id$ * @version $Id$
* @summary * @brief
* Data structure to hold type information for nodes. * Data structure to hold type information for nodes.
* *
* This module defines a field "type" of type "type *" for each ir node. * This module defines a field "type" of type "type *" for each ir node.
......
...@@ -23,7 +23,7 @@ ...@@ -23,7 +23,7 @@
* @author Matthias Braun * @author Matthias Braun
* @date 20.09.2005 * @date 20.09.2005
* @version $Id: bespillbelady.c 13913 2007-05-18 12:48:56Z matze $ * @version $Id: bespillbelady.c 13913 2007-05-18 12:48:56Z matze $
* @summary * @brief
* This implements a naive spilling algorithm. It is designed to produce similar * This implements a naive spilling algorithm. It is designed to produce similar
* effects to the spill decisions produced by traditional graph coloring * effects to the spill decisions produced by traditional graph coloring
* register allocators that spill while they are coloring the graph. * register allocators that spill while they are coloring the graph.
......
...@@ -23,7 +23,7 @@ ...@@ -23,7 +23,7 @@
* @author Goetz Lindenmaier * @author Goetz Lindenmaier
* @date 2001 * @date 2001
* @version $Id$ * @version $Id$
* @summary * @brief
* dbginfo: This is a empty implementation of the Firm interface to * dbginfo: This is a empty implementation of the Firm interface to
* debugging support. It only guarantees that the Firm library compiles * debugging support. It only guarantees that the Firm library compiles
* and runs without any real debugging support. * and runs without any real debugging support.
......
...@@ -23,7 +23,7 @@ ...@@ -23,7 +23,7 @@
* @author Michael Beck * @author Michael Beck
* @date 2005 * @date 2005
* @version $Id$ * @version $Id$
* @summary * @brief
* Sequence numbers for Firm. * Sequence numbers for Firm.
* *
* A sequence number is an unique number representing a filename * A sequence number is an unique number representing a filename
......
...@@ -23,7 +23,7 @@ ...@@ -23,7 +23,7 @@
* @author Sebastian Hack, Michael Beck, Andreas Schoesser * @author Sebastian Hack, Michael Beck, Andreas Schoesser
* @date 14.1.2005 * @date 14.1.2005
* @version $Id$ * @version $Id$
* @summary * @brief
* This are out-edges (also called def-use edges) that are dynamically * This are out-edges (also called def-use edges) that are dynamically
* updated as the graph changes. * updated as the graph changes.
*/ */
......
...@@ -22,7 +22,7 @@ ...@@ -22,7 +22,7 @@
* @brief Functions for traversing ir graphs * @brief Functions for traversing ir graphs
* @author Boris Boesler, Goetz Lindenmaier, Michael Beck * @author Boris Boesler, Goetz Lindenmaier, Michael Beck
* @version $Id$ * @version $Id$
* @summary * @brief
* traverse an ir graph * traverse an ir graph
* - execute the pre function before recursion * - execute the pre function before recursion
* - execute the post function after recursion * - execute the post function after recursion
......
...@@ -22,7 +22,7 @@ ...@@ -22,7 +22,7 @@
* @brief Phase information handling using node indexes. * @brief Phase information handling using node indexes.
* @author Sebastian Hack * @author Sebastian Hack
* @version $Id$ * @version $Id$
* @summary * @brief
* A phase contains a link to private data for each node in an ir graph. * A phase contains a link to private data for each node in an ir graph.
* A phase is independent from the globally visible link field of ir nodes. * A phase is independent from the globally visible link field of ir nodes.
*/ */
......
...@@ -23,7 +23,7 @@ ...@@ -23,7 +23,7 @@
* (VanDrunen Hosking 2004) * (VanDrunen Hosking 2004)
* @author Michael Beck * @author Michael Beck
* @version $Id$ * @version $Id$
* @summary * @brief
*/ */
#include "config.h" #include "config.h"
......
...@@ -23,7 +23,7 @@ ...@@ -23,7 +23,7 @@
* @date 15.03.2006 * @date 15.03.2006
* @author Michael Beck * @author Michael Beck
* @version $Id$ * @version $Id$
* @summary * @brief
* Optimize the frame type by removing unused type members. * Optimize the frame type by removing unused type members.
*/ */
#include "config.h" #include "config.h"
......
...@@ -23,7 +23,7 @@ ...@@ -23,7 +23,7 @@
* @date 12.5.2006 * @date 12.5.2006
* @author Michael Beck * @author Michael Beck
* @version $Id$ * @version $Id$
* @summary * @brief
* Implementation of the Operator Strength Reduction algorithm * Implementation of the Operator Strength Reduction algorithm
* by Keith D. Cooper, L. Taylor Simpson, Christopher A. Vick. * by Keith D. Cooper, L. Taylor Simpson, Christopher A. Vick.
* Extended version. * Extended version.
......
...@@ -22,7 +22,7 @@ ...@@ -22,7 +22,7 @@
* @brief Optimize polymorphic Sel and Load nodes. * @brief Optimize polymorphic Sel and Load nodes.
* @author Goetz Lindenmaier, Michael Beck * @author Goetz Lindenmaier, Michael Beck
* @version $Id$ * @version $Id$
* @summary * @brief
* This file subsumes optimization code from cgana. * This file subsumes optimization code from cgana.
*/ */
#include "config.h" #include "config.h"
......
...@@ -22,7 +22,7 @@ ...@@ -22,7 +22,7 @@
* @brief Optimize polymorphic Sel and Load nodes. * @brief Optimize polymorphic Sel and Load nodes.
* @author Goetz Lindenmaier, Michael Beck * @author Goetz Lindenmaier, Michael Beck
* @version $Id$ * @version $Id$
* @summary * @brief
* This file subsumes optimization code from cgana. * This file subsumes optimization code from cgana.
*/ */
#ifndef FIRM_OPT_OPT_POLYMORPHY_H #ifndef FIRM_OPT_OPT_POLYMORPHY_H
......
...@@ -22,7 +22,7 @@ ...@@ -22,7 +22,7 @@
* @brief Procedure cloning. * @brief Procedure cloning.
* @author Beyhan Veliev, Michael Beck * @author Beyhan Veliev, Michael Beck
* @version $Id$ * @version $Id$
* @summary * @brief
* *
* The purpose is first to find and analyze functions, that are called * The purpose is first to find and analyze functions, that are called
* with constant parameter(s). * with constant parameter(s).
......
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