X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbecopyopt.h;h=67175e298264ee9b7cee7cd2a08d0280eebfca13;hb=4f945762ec7e9a345cbf8a80ef7f4eb96a39a389;hp=93dc76252b0d762f3319636ce2346edaceb1c308;hpb=76c0c4f215716a69cebe49fbcba24c17a9595f32;p=libfirm diff --git a/ir/be/becopyopt.h b/ir/be/becopyopt.h index 93dc76252..67175e298 100644 --- a/ir/be/becopyopt.h +++ b/ir/be/becopyopt.h @@ -1,29 +1,59 @@ +/* + * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved. + * + * This file is part of libFirm. + * + * 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. + * + * 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. + */ + /** - * Author: Daniel Grund - * Date: 11.04.2005 - * Copyright: (c) Universitaet Karlsruhe - * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE. + * @file + * @brief Copy minimization driver. + * @author Daniel Grund + * @date 11.04.2005 * * Main file for the optimization reducing the copies needed for: * - Phi coalescing * - Register-constrained nodes * - Two-address code instructions */ +#ifndef FIRM_BE_BECOPYOPT_H +#define FIRM_BE_BECOPYOPT_H -#ifndef _BECOPYOPT_H -#define _BECOPYOPT_H +#include -#include "irnode.h" +#include "firm_types.h" #include "bechordal.h" +typedef int(*cost_fct_t)(const ir_node *node, int input); + +typedef struct { + int (*copyopt)(copy_opt_t *co); /**< function ptr to run copyopt */ + bool can_improve_existing; +} co_algo_info; + /** - * Has to be called during the firm init phase + * Register a new copy optimization algorithm. + * + * @param name the name of the copy optimazation algorithm, + * used to select it + * @param copyopt a copy optimazation entry */ -void be_copy_opt_init(void); +void be_register_copyopt(const char *name, co_algo_info *copyopt); -typedef int(*cost_fct_t)(ir_node*, ir_node*, int); - -typedef struct _copy_opt_t copy_opt_t; +/** The driver for copy minimization. */ +void co_driver(be_chordal_env_t *cenv); /** * Generate the problem. Collect all information and optimizable nodes. @@ -36,32 +66,25 @@ copy_opt_t *new_copy_opt(be_chordal_env_t *chordal_env, cost_fct_t get_costs); void free_copy_opt(copy_opt_t *co); /** - * Checks if a node is optimizable, viz. has somthing to do with coalescing - * @param arch The architecture environment - * @param irn The irn to check - * @param req A register_requirement structure (used to check for 2-addr-code) - */ -int co_is_optimizable_root(const copy_opt_t *co, ir_node *irn); - -/** - * Checks if the irn is a non-interfering argument of a node which 'is_optimizable' - */ -int co_is_optimizable_arg(const copy_opt_t *co, ir_node *irn); - -/** - * Computes the costs of a copy according to loop depth - * @param pos: the argument position of arg in the root arguments - * @return Must be >= 0 in all cases. + * Statistics over a copy optimization module. */ -int co_get_costs_loop_depth(ir_node *root, ir_node* arg, int pos); +typedef struct { + unsigned long long aff_edges; /**< number of affinity edges. */ + unsigned long long aff_nodes; /**< number of nodes with incident affinity edges. */ + unsigned long long aff_int; /**< number of affinity edges whose nodes also interfere. */ + unsigned long long inevit_costs; /**< costs which cannot be evited (due to interfering affinities). */ + unsigned long long max_costs; /**< all costs of the affinities. */ + unsigned long long costs; /**< The costs of the current coloring. */ + unsigned long long unsatisfied_edges; /**< The number of unequally colored affinity edges. */ +} co_complete_stats_t; /** - * All costs equal 1. Using this will reduce the _number_ of copies. - * @return Must be >= 0 in all cases. + * Collect statistics of a copy optimization module. + * @param co The copy optimization environment. + * @param stat Where to put the stats. + * @note This requires the graph info to be computed. */ -int co_get_costs_all_one(ir_node *root, ir_node* arg, int pos); - - +void co_complete_stats(const copy_opt_t *co, co_complete_stats_t *stat); /** @@ -77,18 +100,21 @@ void co_free_ou_structure(copy_opt_t *co); /** * Solves the problem using a heuristic approach + * Uses the OU data structure */ int co_solve_heuristic(copy_opt_t *co); /** * Returns the maximal costs possible, i.e. the costs if all * pairs would be assigned different registers. + * Uses the OU data structure */ int co_get_max_copy_costs(const copy_opt_t *co); /** * Returns the inevitable costs, i.e. the costs of * all copy pairs which interfere. + * Uses the OU data structure */ int co_get_inevit_copy_costs(const copy_opt_t *co); @@ -96,6 +122,7 @@ int co_get_inevit_copy_costs(const copy_opt_t *co); * Returns the current costs the copies are causing. * The result includes inevitable costs and the costs * of the copies regarding the current register allocation + * Uses the OU data structure */ int co_get_copy_costs(const copy_opt_t *co); @@ -103,13 +130,10 @@ int co_get_copy_costs(const copy_opt_t *co); * Returns a lower bound for the costs of copies in this ou. * The result includes inevitable costs and the costs of a * minimal costs caused by the nodes of the ou. + * Uses the OU data structure */ int co_get_lower_bound(const copy_opt_t *co); - - - - /** * Constructs another internal representation of the affinity edges */ @@ -122,20 +146,8 @@ void co_build_graph_structure(copy_opt_t *co); void co_free_graph_structure(copy_opt_t *co); /** - * Solves the problem using mixed integer programming - * @returns 1 iff solution state was optimal - */ -int co_solve_ilp1(copy_opt_t *co, double time_limit); - -/** - * Solves the problem using mixed integer programming - * @returns 1 iff solution state was optimal - */ -int co_solve_ilp2(copy_opt_t *co, double time_limit); - -/** - * Checks if a node is optimizable, viz. has somthing to do with coalescing. - * Uses the graph representation + * Checks if a node is optimizable, viz has something to do with coalescing. + * Uses the GRAPH data structure */ int co_gs_is_optimizable(copy_opt_t *co, ir_node *irn);