X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbecopyopt.h;h=471fccdd777ae1515ce35f53f2888ad9885afa2b;hb=bc7b5ee69d084e629590a6977b79a2fab7cd1aa1;hp=c2ee3aa0b4db779240fd599bc3ceeca49a8e507b;hpb=19edaf4daa48215a5ad7bb72fa76bfc04ffea0b5;p=libfirm diff --git a/ir/be/becopyopt.h b/ir/be/becopyopt.h index c2ee3aa0b..471fccdd7 100644 --- a/ir/be/becopyopt.h +++ b/ir/be/becopyopt.h @@ -1,124 +1,255 @@ -/** - * Author: Daniel Grund - * Date: 12.04.2005 - * Copyright: (c) Universitaet Karlsruhe - * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE. +/* + * 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. * - * Header for copy optimization problem. Analysis and set up of the problem. + * 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 _BECOPYOPT_H -#define _BECOPYOPT_H - -#include "debug.h" -#include "obst.h" -#include "list.h" -#include "set.h" -#include "pset.h" -#include "bitset.h" -#include "sp_matrix.h" +/** + * @file + * @brief Copy minimization driver. + * @author Daniel Grund + * @date 11.04.2005 + * @version $Id$ + * + * 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 -#include "irgraph.h" -#include "irgwalk.h" -#include "irnode.h" -#include "irdom.h" -#include "irouts.h" +#include +#include "firm_types.h" +#include "bechordal.h" #include "beutil.h" -#include "benumb_t.h" -#include "belive_t.h" -#include "bera_t.h" -#include "bechordal_t.h" -#include "bearch.h" - -/* TODO is_Copy */ -#define is_Copy(irn) 0 -#define DEBUG_IRG "-scanner.c__init_td__gp" /** - * Data representing the problem of copy minimization. + * Flags for dumping the IFG. */ -typedef struct _copy_opt_t { - ir_graph *irg; /**< the irg to process */ - char *name; /**< ProgName__IrgName__RegClass */ - const arch_env_t *env; /**< Environment (isa + handlers) */ - const arch_register_class_t *cls; /**< the registerclass all nodes belong to (in this pass) */ - struct list_head units; /**< all units to optimize in right order */ - pset *roots; /**< used only temporary for detecting multiple appends */ - struct obstack ob; -} copy_opt_t; +enum { + CO_IFG_DUMP_COLORS = 1, /**< Dump the graph colored. */ + CO_IFG_DUMP_LABELS = 2, /**< Dump node/edge labels. */ + CO_IFG_DUMP_SHAPE = 4, /**< Give constrained nodes special shapes. */ + CO_IFG_DUMP_CONSTR = 8 /**< Dump the node constraints in the label. */ +}; /** - * A single unit of optimization. Lots of these form a copy-opt problem + * Algorithms. */ -typedef struct _unit_t { - struct list_head units; /**< chain for all units */ - copy_opt_t *co; /**< the copy_opt this unit belongs to */ - int interf; /**< number of nodes dropped due to interference */ - int node_count; /**< size of the nodes array */ - ir_node **nodes; /**< [0] is the root-node, others are non interfering args of it. */ +enum { + CO_ALGO_NONE, + CO_ALGO_HEUR, + CO_ALGO_HEUR2, + CO_ALGO_HEUR3, + CO_ALGO_HEUR4, + CO_ALGO_ILP, + CO_ALGO_LAST +}; - /* 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; +/** The driver for copy minimization. */ +void co_driver(be_chordal_env_t *cenv); -/* Helpers */ -#define set_irn_col(co, irn, col) \ - arch_set_irn_register(co->env, irn, 0, arch_register_for_index(co->cls, col)) +typedef struct _copy_opt_t copy_opt_t; -#define get_irn_col(co, irn) \ - arch_register_get_index(arch_get_irn_register(co->env, irn, 0)) +typedef int(*cost_fct_t)(const copy_opt_t *, ir_node *, ir_node *, int); +/** A coalescing algorithm. */ +typedef int (co_algo_t)(copy_opt_t *); /** - * Generate the problem. Collect all infos and optimizable nodes. + * Generate the problem. Collect all information and optimizable nodes. */ -copy_opt_t *new_copy_opt(ir_graph *irg, const arch_env_t *env, const arch_register_class_t *cls); +copy_opt_t *new_copy_opt(be_chordal_env_t *chordal_env, cost_fct_t get_costs); /** - * Free the space... + * Free the space used... */ void free_copy_opt(copy_opt_t *co); -#define is_optimizable(irn) (is_Phi(irn) || is_Copy(irn)) +/** + * Computes the costs of a copy according to loop depth + * @param co The copy opt object. + * @param pos the argument position of arg in the root arguments + * @return Must be >= 0 in all cases. + */ +int co_get_costs_loop_depth(const copy_opt_t *co, ir_node *root, ir_node* arg, int pos); + +/** + * Computes the costs of a copy according to execution frequency + * @param co The copy opt object. + * @param pos the argument position of arg in the root arguments + * @return Must be >= 0 in all cases. + */ +int co_get_costs_exec_freq(const copy_opt_t *co, ir_node *root, ir_node* arg, int pos); + +/** + * All costs equal 1. Using this will reduce the _number_ of copies. + * @param co The copy opt object. + * @return Must be >= 0 in all cases. + */ +int co_get_costs_all_one(const copy_opt_t *co, ir_node *root, ir_node* arg, int pos); /** - * Checks if the irn is a non-interfering argument of a node which 'is_optimizable' + * Statistics over a copy optimization module. */ -int is_optimizable_arg(ir_node *irn); +typedef struct { + ulong64 aff_edges; /**< number of affinity edges. */ + ulong64 aff_nodes; /**< number of nodes with incident affinity edges. */ + ulong64 aff_int; /**< number of affinity edges whose nodes also interfere. */ + ulong64 inevit_costs; /**< costs which cannot be evited (due to interfering affinities). */ + ulong64 max_costs; /**< all costs of the affinities. */ + ulong64 costs; /**< The costs of the current coloring. */ + ulong64 unsatisfied_edges; /**< The number of unequally colored affinity edges. */ +} co_complete_stats_t; /** - * Returns the current number of copies needed + * 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_copy_count(copy_opt_t *co); +void co_complete_stats(const copy_opt_t *co, co_complete_stats_t *stat); + /** - * IMPORTANT: Available only iff heuristic has run! - * 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. + * Build internal optimization units structure */ -int co_get_lower_bound(copy_opt_t *co); +void co_build_ou_structure(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. + * Frees the space used by the opt unit representation. + * Does NOT free the whole copyopt structure */ -int co_get_interferer_count(copy_opt_t *co); +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); + +/** + * Apply Park/Moon coalescing to the graph. + * @param co The copy optimization data structure. + */ +void co_solve_park_moon(copy_opt_t *co); + +/** + * Solves the copy minimization problem using another heuristic approach. + * Uses the OU and the GRAPH data structure. + */ +int co_solve_heuristic_new(copy_opt_t *co); + +/** + * Solves the copy minimization problem using another heuristic approach implemented in Java. + * This function needs a JVM which is started to call the Java module. + * Uses the GRAPH data structure. + */ +int co_solve_heuristic_java(copy_opt_t *co); + +/** + * This is the pure C implementation of co_solve_heuristic_java(). + */ +int co_solve_heuristic_mst(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); + +/** + * 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); + +/** + * Dump the interference graph according to the Appel/George coalescing contest file format. + * See: http://www.cs.princeton.edu/~appel/coalesce/format.html + * @note Requires graph structure. + * @param co The copy opt object. + * @param f A file to dump to. + */ +void co_dump_appel_graph(const copy_opt_t *co, FILE *f); + +/** + * Dumps the IFG of the program splitting after each instruction in the Appel format. + * @param co The copy opt object. + * @param f The file to dump to. + */ +void co_dump_appel_graph_cliques(const copy_opt_t *co, FILE *f); +/** + * Dump the interference graph with the affinity edges and the coloring. + * @param co The copy opt structure. + * @param f The file to dump to. + * @param flags The dump flags (see enum above). + */ +void co_dump_ifg_dot(const copy_opt_t *co, FILE *f, unsigned flags); + +/** + * 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_free_graph_structure(copy_opt_t *co); + +/** + * Solves the problem using mixed integer programming + * @returns 1 iff solution state was optimal + * NYI */ -void co_heur_opt(copy_opt_t *co); +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 + * Uses the OU and the GRAPH data structure + * Dependency of the OU structure can be removed */ -void co_ilp_opt(copy_opt_t *co); +int co_solve_ilp2(copy_opt_t *co); /** - * Checks the register allocation for correctness + * Checks if a node is optimizable, viz has something to do with coalescing. + * Uses the GRAPH data structure */ -void co_check_allocation(copy_opt_t *co); +int co_gs_is_optimizable(copy_opt_t *co, ir_node *irn); -#endif +#endif /* FIRM_BE_BECOPYOPT_H */