X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;ds=sidebyside;f=ir%2Fbe%2Fbecopyopt_t.h;h=d631b92971f444691609f05c5b08ede0cdb7d8a6;hb=c23b55879df97f49fc6f1e95651f9f28a980b620;hp=48c795fc102807187a7cfff213eef2ef788a61f9;hpb=8535fe8732b0acf822be252812a7158ce5b8134a;p=libfirm diff --git a/ir/be/becopyopt_t.h b/ir/be/becopyopt_t.h index 48c795fc1..d631b9297 100644 --- a/ir/be/becopyopt_t.h +++ b/ir/be/becopyopt_t.h @@ -1,39 +1,58 @@ -/** - * 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. * - * Internal header for copy optimization 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_T_H -#define _BECOPYOPT_T_H +/** + * @file + * @brief Internal header for copy optimization problem. + * @author Daniel Grund + * @date 12.04.2005 + * @version $Id$ + */ +#ifndef FIRM_BE_BECOPYOPT_T_H +#define FIRM_BE_BECOPYOPT_T_H -#include +#include "obst.h" #include "list.h" -#include "bearch.h" +#include "set.h" +#include "irnode_t.h" + +#include "bearch_t.h" #include "bechordal_t.h" #include "becopyopt.h" -#include "benodesets.h" /** * Data representing the problem of copy minimization. */ struct _copy_opt_t { - be_chordal_env_t *cenv; + be_chordal_env_t *cenv; const arch_register_class_t *cls; - const arch_env_t *aenv; - ir_graph *irg; - char *name; /**< ProgName__IrgName__RegClassName */ - cost_fct_t get_costs; /**< function ptr used to get costs for copies */ + const arch_env_t *aenv; + ir_graph *irg; + char *name; /**< ProgName__IrgName__RegClassName */ + cost_fct_t get_costs; /**< function ptr used to get costs for copies */ /** Representation as optimization units */ - struct list_head units; /**< all units to optimize in specific order */ + struct list_head units; /**< all units to optimize in specific order */ /** Representation in graph structure. Only build on demand */ struct obstack obst; - set *nodes; + set *nodes; }; /* Helpers */ @@ -54,7 +73,7 @@ struct _copy_opt_t { static INLINE int is_2addr_code(const arch_register_req_t *req) { - return req->type == arch_register_req_type_should_be_same; + return (req->type & arch_register_req_type_should_be_same) != 0; } /****************************************************************************** @@ -71,18 +90,18 @@ static INLINE int is_2addr_code(const arch_register_req_t *req) #define MIS_HEUR_TRIGGER 8 typedef struct _unit_t { - struct list_head units; /**< chain for all units */ - copy_opt_t *co; /**< the copy opt this unit belongs to */ - int node_count; /**< size of the nodes array */ - ir_node **nodes; /**< [0] is the root-node, others are non interfering args of it. */ - int *costs; /**< costs[i] are incurred, if nodes[i] has a different color */ - int inevitable_costs; /**< sum of costs of all args interfering with root */ - int all_nodes_costs; /**< sum of all costs[i] */ - int min_nodes_costs; /**< a lower bound for the costs in costs[], determined by a max independent set */ - int sort_key; /**< maximum costs. controls the order of ou's in the struct list_head units. */ + struct list_head units; /**< chain for all units */ + copy_opt_t *co; /**< the copy opt this unit belongs to */ + int node_count; /**< size of the nodes array */ + ir_node **nodes; /**< [0] is the root-node, others are non interfering args of it. */ + int *costs; /**< costs[i] are incurred, if nodes[i] has a different color */ + int inevitable_costs; /**< sum of costs of all args interfering with root */ + int all_nodes_costs; /**< sum of all costs[i] */ + int min_nodes_costs; /**< a lower bound for the costs in costs[], determined by a max independent set */ + int sort_key; /**< maximum costs. controls the order of ou's in the struct list_head units. */ /* for heuristic */ - struct list_head queue; /**< list of qn's sorted by weight of qn-mis */ + struct list_head queue; /**< list of qn's sorted by weight of qn-mis */ } unit_t; @@ -102,26 +121,26 @@ typedef struct _neighb_t neighb_t; typedef struct _affinity_node_t affinity_node_t; struct _neighb_t { - neighb_t *next; /** the next neighbour entry*/ - ir_node *irn; /** the neighbour itself */ - int costs; /** the costs of the edge (affinity_node_t->irn, neighb_t->irn) */ + neighb_t *next; /** the next neighbour entry*/ + const ir_node *irn; /** the neighbour itself */ + int costs; /** the costs of the edge (affinity_node_t->irn, neighb_t->irn) */ }; struct _affinity_node_t { - ir_node *irn; /** a node with affinity edges */ - int degree; /** number of affinity edges in the linked list below */ - neighb_t *neighbours; /** a linked list of all affinity neighbours */ - void *data; /** stuff that is attachable. */ + const ir_node *irn; /** a node with affinity edges */ + int degree; /** number of affinity edges in the linked list below */ + neighb_t *neighbours; /** a linked list of all affinity neighbours */ + void *data; /** stuff that is attachable. */ }; -static INLINE affinity_node_t *get_affinity_info(const copy_opt_t *co, ir_node *irn) { +static INLINE affinity_node_t *get_affinity_info(const copy_opt_t *co, const ir_node *irn) { affinity_node_t find; ASSERT_GS_AVAIL(co); find.irn = irn; - return set_find(co->nodes, &find, sizeof(find), nodeset_hash(irn)); + return set_find(co->nodes, &find, sizeof(find), hash_irn(irn)); } #define co_gs_nodes_begin(co) set_first((co)->nodes) @@ -132,4 +151,4 @@ static INLINE affinity_node_t *get_affinity_info(const copy_opt_t *co, ir_node * #define co_gs_foreach_neighb(aff_node, neighb) for (neighb = aff_node->neighbours; neighb; neighb = neighb->next) -#endif +#endif /* FIRM_BE_BECOPYOPT_T_H */