X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firgopt.h;h=e267e362fc8f49ec5ab3348f9ede35f163dc1218;hb=eda9d668d0e8c8246015b4c5e743316a6a835a23;hp=f50d4f0606687fa4a41019e929e4df165306661e;hpb=346dfddce9be4420855b06ea40d2bf21dad9bc88;p=libfirm diff --git a/ir/ir/irgopt.h b/ir/ir/irgopt.h index f50d4f060..e267e362f 100644 --- a/ir/ir/irgopt.h +++ b/ir/ir/irgopt.h @@ -1,27 +1,32 @@ /* - * Project: libFIRM - * File name: ir/ir/irgopt.h - * Purpose: Optimizations for a whole ir graph, i.e., a procedure. - * Author: Christian Schaefer, Goetz Lindenmaier - * Modified by: Sebastian Felis - * Created: - * CVS-ID: $Id$ - * Copyright: (c) 1998-2003 Universität Karlsruhe - * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE. - */ - -/** - * @file irgopt.h + * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved. + * + * This file is part of libFirm. * - * Optimizations for a whole ir graph, i.e., a procedure. + * This file may be distributed and/or modified under the terms of the + * GNU General Public License version 2 as published by the Free Software + * Foundation and appearing in the file LICENSE.GPL included in the + * packaging of this file. * - * @author Christian Schaefer, Goetz Lindenmaier + * Licensees holding valid libFirm Professional Edition licenses may use + * this file in accordance with the libFirm Commercial License. + * Agreement provided with the Software. + * + * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE + * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR + * PURPOSE. */ -# ifndef _IRGOPT_H_ -# define _IRGOPT_H_ +/** + * @file + * @brief Optimizations for a whole ir graph, i.e., a procedure. + * @author Christian Schaefer, Goetz Lindenmaier, Sebastian Felis + * @version $Id$ + */ +#ifndef FIRM_IR_IRGOPT_H +#define FIRM_IR_IRGOPT_H -# include "irgraph.h" +#include "firm_types.h" /** Applies local optimizations (see iropt.h) to all nodes reachable from node n. * @@ -33,17 +38,28 @@ void local_optimize_node(ir_node *n); * * @param irg The graph to be optimized. * - * After appliying local_optimize_graph() to a IR-graph, Bad nodes + * After applying local_optimize_graph() to a IR-graph, Bad nodes * only occure as predecessor of Block and Phi nodes. */ void local_optimize_graph (ir_graph *irg); +/** Applies local optimizations (see iropt.h) to all nodes in the graph. + * + * @param irg The graph to be optimized. + * + * After applying local_optimize_graph() to a IR-graph, Bad nodes + * only occure as predecessor of Block and Phi nodes. + * + * This version used a fixpoint iteration. + */ +void optimize_graph_df(ir_graph *irg); + /** Performs dead node elimination by copying the ir graph to a new obstack. * * The major intention of this pass is to free memory occupied by - * dead nodes and outdated analyses information. Further this - * function removes Bad predecesors from Blocks and the corresponding - * inputs to Phi nodes. This opens optmization potential for other + * dead nodes and outdated analyzes information. Further this + * function removes Bad predecessors from Blocks and the corresponding + * inputs to Phi nodes. This opens optimization potential for other * optimizations. Further this phase reduces dead Block<->Jmp * self-cycles to Bad nodes. * @@ -54,16 +70,35 @@ void local_optimize_graph (ir_graph *irg); * Removes old attributes of nodes. Sets link field to NULL. * Callee information must be freed (irg_callee_info_none). * - * Attention: the numbers assigned to nodes if the library is compiled for - * development/debugging are not conserved by copying. - * * @param irg The graph to be optimized. */ void dead_node_elimination(ir_graph *irg); -/** Cleans the control flow from Bad predecesors. +typedef struct _survive_dce_t survive_dce_t; + +/** + * Make a new Survive DCE environment. + */ +survive_dce_t *new_survive_dce(void); + +/** + * Free a Survive DCE environment. + */ +void free_survive_dce(survive_dce_t *sd); + +/** + * Register a node pointer to be patched upon DCE. + * When DCE occurs, the node pointer specified by @p place will be + * patched to the new address of the node it is pointing to. * - * Removes Bad predecesors from Blocks and the corresponding + * @param sd The Survive DCE environment. + * @param place The address of the node pointer. + */ +void survive_dce_register_irn(survive_dce_t *sd, ir_node **place); + +/** Cleans the control flow from Bad predecessors. + * + * Removes Bad predecessors from Blocks and the corresponding * inputs to Phi nodes as in dead_node_elimination but without * copying the graph. * @@ -136,19 +171,23 @@ void inline_small_irgs(ir_graph *irg, int size); * * For a heuristic this inlineing uses firm node counts. It does * not count auxiliary nodes as Proj, Tuple, End, Start, Id, Sync. - * - * @param maxsize Do not inline any calls if a method has more than - * maxsize firm nodes. It may reach this limit by - * inlineing. - * @param leavesize Inline leave functions if they have less than leavesize - * nodes. - * @param size Inline all function smaller than size. + * If the ignore_runtime flag is set, calls to functions marked with the + * mtp_property_runtime property are ignored. + * + * @param maxsize Do not inline any calls if a method has more than + * maxsize firm nodes. It may reach this limit by + * inlineing. + * @param leavesize Inline leave functions if they have less than leavesize + * nodes. + * @param size Inline all function smaller than size. + * @param ignore_runtime count a function only calling runtime functions as + * leave */ -void inline_leave_functions(int maxsize, int leavesize, int size); +void inline_leave_functions(int maxsize, int leavesize, int size, int ignore_runtime); /** Code Placement. * - * Pinns all floating nodes to a block where they + * Pins all floating nodes to a block where they * will be executed only if needed. Depends on the flag opt_global_cse. * Graph may not be in phase_building. Does not schedule control dead * code. Uses dominator information which it computes if the irg is not @@ -171,10 +210,9 @@ void place_code(ir_graph *irg); * A critical control flow edge is an edge from a block with several * control exits to a block with several control entries (See Muchnic * p. 407). - * Is only executed if flag set_opt_critical_edges() is set. * * @param irg IR Graph */ void remove_critical_cf_edges(ir_graph *irg); -# endif /* _IRGOPT_H_ */ +#endif