X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeifg.h;h=0fc3ccf46dafc950f9494e4b016a332728f0c039;hb=fef8dc3eff6468d7d65485af8e1ac9884c504e1a;hp=0e0eb8d328bc83ece2132bf476f38f19c84eee50;hpb=02046d6f22e734521c84dfb2f342cf61e6442c2f;p=libfirm diff --git a/ir/be/beifg.h b/ir/be/beifg.h index 0e0eb8d32..0fc3ccf46 100644 --- a/ir/be/beifg.h +++ b/ir/be/beifg.h @@ -1,52 +1,92 @@ -/** - * @file beifg.h - * @date 18.11.2005 - * @author Sebastian Hack +/* + * 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. * - * Copyright (C) 2005 Universitaet Karlsruhe - * Released under the GPL + * 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 _BEIFG_H -#define _BEIFG_H - -#include "becopyopt.h" - -#include "firm_types.h" - -typedef struct _be_ifg_impl_t be_ifg_impl_t; -typedef struct _be_ifg_t be_ifg_t; - -#define be_ifg_nodes_iter_alloca(self) (alloca(be_ifg_nodes_iter_size(self))) -#define be_ifg_neighbours_iter_alloca(self) (alloca(be_ifg_neighbours_iter_size(self))) -#define be_ifg_cliques_iter_alloca(self) (alloca(be_ifg_cliques_iter_size(self))) - -size_t (be_ifg_nodes_iter_size)(const be_ifg_t *self); -size_t (be_ifg_neighbours_iter_size)(const be_ifg_t *self); -size_t (be_ifg_cliques_iter_size)(const be_ifg_t *self); -void (be_ifg_free)(be_ifg_t *self); -int (be_ifg_connected)(const be_ifg_t *self, const ir_node *a, const ir_node *b); -ir_node *(be_ifg_neighbours_begin)(const be_ifg_t *self, void *iter, const ir_node *irn); -ir_node *(be_ifg_neighbours_next)(const be_ifg_t *self, void *iter); -void (be_ifg_neighbours_break)(const be_ifg_t *self, void *iter); -ir_node *(be_ifg_nodes_begin)(const be_ifg_t *self, void *iter); -ir_node *(be_ifg_nodes_next)(const be_ifg_t *self, void *iter); -void (be_ifg_nodes_break)(const be_ifg_t *self, void *iter); -int (be_ifg_cliques_begin)(const be_ifg_t *self, void *iter, ir_node **buf); -int (be_ifg_cliques_next)(const be_ifg_t *self, void *iter); -void (be_ifg_cliques_break)(const be_ifg_t *self, void *iter); -int (be_ifg_degree)(const be_ifg_t *self, const ir_node *irn); - -#define be_ifg_foreach_neighbour(self, iter, irn, pos) \ - for(pos = be_ifg_neighbours_begin(self, iter, irn); (pos); pos = be_ifg_neighbours_next(self, iter)) - -#define be_ifg_foreach_node(self, iter, pos) \ - for(pos = be_ifg_nodes_begin(self, iter); (pos); pos = be_ifg_nodes_next(self, iter)) - -#define be_ifg_foreach_clique(self, iter, buf, count) \ - for(*(count) = be_ifg_cliques_begin(self, iter, buf); \ +/** + * @file + * @brief Interface for interference graphs. + * @author Sebastian Hack + * @date 18.11.2005 + */ +#ifndef FIRM_BE_BEIFG_H +#define FIRM_BE_BEIFG_H + +#include "be_types.h" +#include "bechordal.h" +#include "irnodeset.h" +#include "pset.h" + +struct be_ifg_t { + const be_chordal_env_t *env; +}; + +typedef struct nodes_iter_t { + const be_chordal_env_t *env; + struct obstack obst; + int n; + int curr; + ir_node **nodes; +} nodes_iter_t; + +typedef struct neighbours_iter_t { + const be_chordal_env_t *env; + const ir_node *irn; + int valid; + ir_nodeset_t neighbours; + ir_nodeset_iterator_t iter; +} neighbours_iter_t; + +typedef struct cliques_iter_t { + struct obstack ob; + const be_chordal_env_t *cenv; + ir_node **buf; + ir_node **blocks; + int n_blocks, blk; + struct list_head *bor; + pset *living; +} cliques_iter_t; + +void be_ifg_free(be_ifg_t *ifg); +int be_ifg_connected(const be_ifg_t *ifg, const ir_node *a, + const ir_node *b); +ir_node *be_ifg_neighbours_begin(const be_ifg_t *ifg, neighbours_iter_t *iter, + const ir_node *irn); +ir_node *be_ifg_neighbours_next(neighbours_iter_t *iter); +void be_ifg_neighbours_break(neighbours_iter_t *iter); +ir_node *be_ifg_nodes_begin(const be_ifg_t *ifg, nodes_iter_t *iter); +ir_node *be_ifg_nodes_next(nodes_iter_t *iter); +void be_ifg_nodes_break(nodes_iter_t *iter); +int be_ifg_cliques_begin(const be_ifg_t *ifg, cliques_iter_t *iter, + ir_node **buf); +int be_ifg_cliques_next(cliques_iter_t *iter); +void be_ifg_cliques_break(cliques_iter_t *iter); +int be_ifg_degree(const be_ifg_t *ifg, const ir_node *irn); + +#define be_ifg_foreach_neighbour(ifg, iter, irn, pos) \ + for(pos = be_ifg_neighbours_begin(ifg, iter, irn); pos != NULL; pos = be_ifg_neighbours_next(iter)) + +#define be_ifg_foreach_node(ifg, iter, pos) \ + for(pos = be_ifg_nodes_begin(ifg, iter); pos != NULL; pos = be_ifg_nodes_next(iter)) + +#define be_ifg_foreach_clique(ifg, iter, buf, count) \ + for(*(count) = be_ifg_cliques_begin(ifg, iter, buf); \ *(count) != -1 ; \ - *(count) = be_ifg_cliques_next(self, iter)) + *(count) = be_ifg_cliques_next(iter)) typedef struct { int n_nodes; @@ -54,32 +94,8 @@ typedef struct { int n_comps; } be_ifg_stat_t; -void be_ifg_stat(be_irg_t *birg, be_ifg_t *ifg, be_ifg_stat_t *stat); +void be_ifg_stat(ir_graph *irg, be_ifg_t *ifg, be_ifg_stat_t *stat); be_ifg_t *be_create_ifg(const be_chordal_env_t *env); -/* - ____ _ - | _ \ _ _ _ __ ___ _ __ (_)_ __ __ _ - | | | | | | | '_ ` _ \| '_ \| | '_ \ / _` | - | |_| | |_| | | | | | | |_) | | | | | (_| | - |____/ \__,_|_| |_| |_| .__/|_|_| |_|\__, | - |_| |___/ -*/ - -typedef struct _be_ifg_dump_dot_cb_t { - int (*is_dump_node)(void *self, ir_node *irn); - void (*graph_attr)(FILE *f, void *self); - void (*node_attr)(FILE *f, void *self, ir_node *irn); - void (*edge_attr)(FILE *f, void *self, ir_node *from, ir_node *to); - void (*at_begin)(FILE *file, void *self); - void (*at_end)(FILE *file, void *self); -} be_ifg_dump_dot_cb_t; - -void be_ifg_dump_dot(be_ifg_t *ifg, ir_graph *irg, FILE *file, const be_ifg_dump_dot_cb_t *cb, void *self); -void be_ifg_check_sorted(const be_ifg_t *ifg); -void be_ifg_check_sorted_to_file(const be_ifg_t *ifg, FILE *f); -void be_ifg_check_performance(be_chordal_env_t *chordal_env); - - -#endif /* _BEIFG_H */ +#endif