X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firedges_t.h;h=daa6571d1c41e74b894eab6d46d4d8e945e256c0;hb=0fbcef83aa6060534172bb13e71cdadb04428806;hp=0efda43c1fc5b5ceb6cd2f547d3cf01c8441c433;hpb=a8d16f87f78c4f0b48b0a23a9c6cccc845b56465;p=libfirm diff --git a/ir/ir/iredges_t.h b/ir/ir/iredges_t.h index 0efda43c1..daa6571d1 100644 --- a/ir/ir/iredges_t.h +++ b/ir/ir/iredges_t.h @@ -1,24 +1,32 @@ /* - * Project: libFIRM - * File name: ir/ir/iredges_t.h - * Purpose: Everlasting outs -- private header. - * Author: Sebastian Hack - * Created: 15.01.2005 - * CVS-ID: $Id$ - * Copyright: (c) 1998-2005 Universit�t 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. + * + * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE + * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR + * PURPOSE. */ /** - * everlasting outs. - * @author Sebastian Hack - * @date 15.1.2005 + * @file + * @brief Everlasting outs -- private header. + * @author Sebastian Hack, Andreas Schoesser + * @date 15.01.2005 + * @version $Id$ */ +#ifndef FIRM_IR_EDGES_T_H +#define FIRM_IR_EDGES_T_H -#ifndef _FIRM_EDGES_T_H -#define _FIRM_EDGES_T_H - -#include "config.h" #include "debug.h" #include "set.h" @@ -27,146 +35,179 @@ #include "irnode_t.h" #include "irgraph_t.h" +#include "iredgekinds.h" #include "iredges.h" -#if FIRM_EDGES_INPLACE - -#define DBG_EDGES "edges" +#define DBG_EDGES "firm.ir.edges" /** * An edge. */ -typedef struct _ir_edge_t { +struct _ir_edge_t { + ir_node *src; /**< The source node of the edge. */ + int pos; /**< The position of the edge at @p src. */ + unsigned invalid : 1; /**< edges that are removed are marked invalid. */ + unsigned present : 1; /**< Used by the verifier. Don't rely on its content. */ + unsigned kind : 4; /**< The kind of the edge. */ + struct list_head list; /**< The list head to queue all out edges at a node. */ #ifdef DEBUG_libfirm long src_nr; /**< The node number of the source node. */ + long edge_nr; /**< A unique number identifying the edge. */ #endif - ir_node *src; /**< The source node of the edge. */ - int pos; /**< The position of the edge at @p src. */ - struct list_head list; /**< The list head to queue all out edges at a node. */ - unsigned invalid : 1; /**< edges that are removed are marked invalid. */ - unsigned present : 1; /**< Used by the verifier. Don't rely on its content. */ -} ir_edge_t; +}; + /** Accessor for private irn info. */ -#define _get_irn_edge_info(irn) ((irn_edge_info_t *) &(irn)->edge_info) +#define _get_irn_edge_info(irn, kind) (&(((irn)->edge_info)[kind])) /** Accessor for private irg info. */ -#define _get_irg_edge_info(irg) ((irg_edge_info_t *) &(irg)->edge_info) +#define _get_irg_edge_info(irg, kind) (&(((irg)->edge_info)[kind])) /** - * Convenience macro to get the outs_head from a irn_edge_info_t - * struct. - */ -#define _get_irn_outs_head(irn) (&_get_irn_edge_info(irn)->outs_head) +* Convenience macro to get the outs_head from a irn_edge_info_t +* struct. +*/ +#define _get_irn_outs_head(irn, kind) (&_get_irn_edge_info(irn, kind)->outs_head) /** - * Get the first edge pointing to some node. - * @note There is no order on out edges. First in this context only - * means, that you get some starting point into the list of edges. - * @param irn The node. - * @return The first out edge that points to this node. - */ -static INLINE const ir_edge_t *_get_irn_out_edge_first(const ir_node *irn) +* Get the first edge pointing to some node. +* @note There is no order on out edges. First in this context only +* means, that you get some starting point into the list of edges. +* @param irn The node. +* @return The first out edge that points to this node. +*/ +static INLINE const ir_edge_t *_get_irn_out_edge_first_kind(const ir_node *irn, ir_edge_kind_t kind) { - struct list_head *head = _get_irn_outs_head(irn); - return list_empty(head) ? NULL : list_entry(head->next, ir_edge_t, list); + const struct list_head *head = _get_irn_outs_head(irn, kind); + return list_empty(head) ? NULL : list_entry(head->next, ir_edge_t, list); } /** - * Get the next edge in the out list of some node. - * @param irn The node. - * @param last The last out edge you have seen. - * @return The next out edge in @p irn 's out list after @p last. - */ +* Get the next edge in the out list of some node. +* @param irn The node. +* @param last The last out edge you have seen. +* @return The next out edge in @p irn 's out list after @p last. +*/ static INLINE const ir_edge_t *_get_irn_out_edge_next(const ir_node *irn, const ir_edge_t *last) { - struct list_head *next = last->list.next; - return next == _get_irn_outs_head(irn) ? NULL : list_entry(next, ir_edge_t, list); + struct list_head *next = last->list.next; + return next == _get_irn_outs_head(irn, last->kind) ? NULL : list_entry(next, ir_edge_t, list); } /** - * A convenience iteration macro over all out edges of a node. - * @param irn The node. - * @param edge An @c ir_edge_t pointer which shall be set to the current - * edge. - */ -#define foreach_out_edge(irn,edge) \ - for(edge = get_irn_out_edge_first(irn); edge; edge = get_irn_out_edge_next(irn, edge)) +* Get the number of edges pointing to a node. +* @param irn The node. +* @return The number of edges pointing to this node. +*/ +static INLINE int _get_irn_n_edges_kind(const ir_node *irn, int kind) +{ + /* Perhaps out_count was buggy. This code does it more safely. */ +#if 0 + int res = 0; + const struct list_head *pos, *head = _get_irn_outs_head(irn, kind); + list_for_each(pos, head) + res++; + return res; +#else + return _get_irn_edge_info(irn, kind)->out_count; +#endif +} + +static INLINE int _edges_activated_kind(const ir_graph *irg, ir_edge_kind_t kind) +{ + return _get_irg_edge_info(irg, kind)->activated; +} /** - * Get the source node of an edge. - * @param edge The edge. - * @return The source node of that edge. - */ -static INLINE ir_node *_get_edge_src_irn(const ir_edge_t *edge) +* Assure, that the edges information is present for a certain graph. +* @param irg The graph. +*/ +static INLINE void _edges_assure_kind(ir_graph *irg, int kind) { - return edge ? edge->src : NULL; + if(!_edges_activated_kind(irg, kind)) + edges_activate_kind(irg, kind); } +void edges_init_graph_kind(ir_graph *irg, ir_edge_kind_t kind); + /** - * Get the position of an edge. - * @param edge. - * @return The position in the in array of that edges source. - */ -static INLINE int _get_edge_src_pos(const ir_edge_t *edge) +* Notify of a edge change. +* The edge from (src, pos) -> old_tgt is redirected to tgt +*/ +void edges_notify_edge_kind(ir_node *src, int pos, ir_node *tgt, ir_node *old_tgt, ir_edge_kind_t kind, ir_graph *irg); + +/** +* A node is deleted. +*/ +void edges_node_deleted(ir_node *old, ir_graph *irg); + +void edges_invalidate_kind(ir_node *irn, ir_edge_kind_t kind, ir_graph *irg); + +/** +* Register additional memory in an edge. +* This must be called before Firm is initialized. +* @param n Number of bytes you need. +* @return A number you have to keep and to pass +* edges_get_private_data() +* to get a pointer to your data. +*/ +int edges_register_private_data(size_t n); + +/** +* Get a pointer to the private data you registered. +* @param edge The edge. +* @param ofs The number, you obtained with +* edges_register_private_data(). +* @return A pointer to the private data. +*/ +static INLINE void *_get_edge_private_data(const ir_edge_t *edge, int ofs) { - return edge ? edge->pos : -1; + return (void *) ((char *) edge + sizeof(edge[0]) + ofs); } -static INLINE int _edges_activated(const ir_graph *irg) +static INLINE ir_node *_get_edge_src_irn(const ir_edge_t *edge) { - return _get_irg_edge_info(irg)->activated; + return edge->src; } -/** - * Assure, that the edges information is present for a certain graph. - * @param irg The graph. - */ -static INLINE void _edges_assure(ir_graph *irg) +static INLINE int _get_edge_src_pos(const ir_edge_t *edge) { - if(!_edges_activated(irg)) - edges_activate(irg); + return edge->pos; } -void edges_reroute(ir_node *old, ir_node *nw, ir_graph *irg); +/** +* Initialize the out edges. +* This must be called before firm is initialized. +*/ +extern void init_edges(void); -void edges_init_graph(ir_graph *irg); +/** + * Set dbg information for edges. + */ +void edges_init_dbg(int do_dbg); -void edges_notify_edge(ir_node *src, int pos, ir_node *tgt, ir_node *old_tgt, ir_graph *irg); +void edges_invalidate_all(ir_node *irn, ir_graph *irg); -void edges_node_deleted(ir_node *old, ir_graph *irg); +#define get_irn_n_edges_kind(irn, kind) _get_irn_n_edges_kind(irn, kind) +#define get_edge_src_irn(edge) _get_edge_src_irn(edge) +#define get_edge_src_pos(edge) _get_edge_src_pos(edge) +#define get_edge_private_data(edge, ofs) _get_edge_private_data(edge,ofs) +#define get_irn_out_edge_next(irn, last) _get_irn_out_edge_next(irn, last) -void edges_invalidate(ir_node *irn, ir_graph *irg); +#ifndef get_irn_n_edges +#define get_irn_n_edges(irn) _get_irn_n_edges_kind(irn, EDGE_KIND_NORMAL) +#endif -/** - * Initialize the out edges. - * This must be called before firm is initialized. - */ -extern void init_edges(void); +#ifndef get_irn_out_edge_first +#define get_irn_out_edge_first(irn) _get_irn_out_edge_first_kind(irn, EDGE_KIND_NORMAL) +#endif -#define get_irn_out_edge_first(irn) _get_irn_out_edge_first(irn) -#define get_irn_out_edge_next(irn,last) _get_irn_out_edge_next(irn, last) -#define get_edge_src_irn(edge) _get_edge_src_irn(edge) -#define get_edge_src_pos(edge) _get_edge_src_pos(edge) -#define edges_activated(irg) _edges_activated(irg) -#define edges_assure(irg) _edges_assure(irg) +#ifndef get_block_succ_first +#define get_block_succ_first(irn) _get_irn_out_edge_first_kind(irn, EDGE_KIND_BLOCK) +#endif -#else -/* new edges are disabled */ - -#define init_edges() -#define edges_reroute(old, nw, irg) -#define edges_init_graph(irg); -#define edges_notify_edge(src, pos, tgt, old_tgt, irg) -#define edges_node_deleted(old, irg) -#define edges_invalidate(irn, irg) -#define get_irn_out_edge_first(irn) NULL -#define get_irn_out_edge_next(irn,last) NULL -#define get_edge_src_irn(edge) NULL -#define get_edge_src_pos(edge) -1 -#define edges_activated(irg) 0 -#define edges_assure(irg) - -#endif /* FIRM_EDGES_INPLACE */ - -#endif /* _FIRM_EDGES_T_H */ +#ifndef get_block_succ_next +#define get_block_succ_next(irn, last) _get_irn_out_edge_next(irn, last) +#endif + +#endif