X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbecopyopt.h;h=67175e298264ee9b7cee7cd2a08d0280eebfca13;hb=b59e22a229aa1227ef992c184c79fdafe34908cf;hp=509c28fc07dddb14e1f25fe6d71a1146eb27804f;hpb=ad8d083988ca94d6d0370f172533112f592f62df;p=libfirm diff --git a/ir/be/becopyopt.h b/ir/be/becopyopt.h index 509c28fc0..67175e298 100644 --- a/ir/be/becopyopt.h +++ b/ir/be/becopyopt.h @@ -1,105 +1,154 @@ +/* + * 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. + */ + /** - * Header for copy optimization problem. Analysis and set up of the problem. - * @author Daniel Grund - * @date 12.04.2005 + * @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 -#ifdef HAVE_CONFIG_H -#include "config.h" -#endif +#include "firm_types.h" +#include "bechordal.h" -#include -#include -#include -#include -#include +typedef int(*cost_fct_t)(const ir_node *node, int input); -#include "debug.h" -#include "obst.h" -#include "list.h" -#include "set.h" -#include "pset.h" -#include "bitset.h" -#include "sp_matrix.h" +typedef struct { + int (*copyopt)(copy_opt_t *co); /**< function ptr to run copyopt */ + bool can_improve_existing; +} co_algo_info; -#include "irgraph.h" -#include "irgwalk.h" -#include "irnode.h" -#include "irdom.h" -#include "irouts.h" +/** + * 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_register_copyopt(const char *name, co_algo_info *copyopt); -#include "beutil.h" -#include "benumb_t.h" -#include "belive_t.h" -#include "bera_t.h" -#include "bechordal_t.h" +/** The driver for copy minimization. */ +void co_driver(be_chordal_env_t *cenv); /** - * TODO external things - * define get_weight to sth representing the _gain_ if node n and m - * have the same color. Must return values MIN_WEIGHT <= . <= MAX_WEIGHT. + * Generate the problem. Collect all information and optimizable nodes. */ -#define get_weight(n,m) 1 -#define is_possible_color(irn, col) 1 -#define MAX_COLORS 32 +copy_opt_t *new_copy_opt(be_chordal_env_t *chordal_env, cost_fct_t get_costs); /** - * A single unit of optimization. Lots of these form a copy-opt problem + * Free the space used... */ -typedef struct _unit_t { - struct list_head units; /**< chain for all units */ - int interf; /**< number of nodes dropped due to interference */ - int node_count; /**< size of the nodes array */ - const ir_node **nodes; /**< [0] is the root-node, others are non interfering args of it. */ +void free_copy_opt(copy_opt_t *co); - /* for heuristic */ - int mis_size; /**< size of a mis considering only ifg (not coloring conflicts) */ - struct list_head queue; /**< list of (mis/color) sorted by size of mis */ -} unit_t; +/** + * Statistics over a copy optimization module. + */ +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; /** - * Data representing the problem of copy minimization. + * 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. */ -typedef struct _copy_opt_t { - ir_graph *irg; /**< the irg which is processed */ - struct list_head units; /**< all units to optimize in right oreder */ - pset *roots; /**< used only temporary for detecting multiple appends */ -} copy_opt_t; +void co_complete_stats(const copy_opt_t *co, co_complete_stats_t *stat); /** - * Generate the problem. Collect all infos and optimizable nodes. + * Build internal optimization units structure */ -copy_opt_t *new_copy_opt(ir_graph *irg); +void co_build_ou_structure(copy_opt_t *co); /** - * Free the space... + * Frees the space used by the opt unit representation. + * Does NOT free the whole copyopt structure */ -void free_copy_opt(copy_opt_t *co); +void co_free_ou_structure(copy_opt_t *co); /** - * Returns a lower bound for the number of copies needed based on interfering - * arguments and the size of a max indep. set (only ifg-edges) of the other args. + * Solves the problem using a heuristic approach + * Uses the OU data structure */ -int co_get_lower_bound(copy_opt_t *co); +int co_solve_heuristic(copy_opt_t *co); /** - * Returns the number of arguments interfering with their root node. This also - * is a (worse) lower bound for the number of copies needed. + * 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_interferer_count(copy_opt_t *co); +int co_get_max_copy_costs(const copy_opt_t *co); /** - * Solves the problem using a heuristic approach + * 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); + +/** + * 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); + +/** + * 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 + */ +void co_build_graph_structure(copy_opt_t *co); + +/** + * Frees the space used by the graph representation. + * Does NOT free the whole copyopt structure */ -void co_heur_opt(copy_opt_t *co); +void co_free_graph_structure(copy_opt_t *co); /** - * Solves the problem using mixed integer programming + * Checks if a node is optimizable, viz has something to do with coalescing. + * Uses the GRAPH data structure */ -void co_ilp_opt(copy_opt_t *co); +int co_gs_is_optimizable(copy_opt_t *co, ir_node *irn); #endif