2 * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Compute and access out edges (also called def-use edges).
23 * @author Goetz Lindenmaier, Michael Beck
27 #ifndef FIRM_ANA_IROUTS_H
28 #define FIRM_ANA_IROUTS_H
30 #include "firm_types.h"
32 /*------------------------------------------------------------------*/
33 /* Accessing the out datastructures. */
34 /* These routines only work properly if the ir_graph is in state */
35 /* outs_consistent or outs_inconsistent. */
36 /*------------------------------------------------------------------*/
38 /** To iterate through the successors iterate from 0 to i < get_irn_outs(). No
39 order of successors guaranteed. Will return edges from block to floating
40 nodes even if irgraph is in state "op_pin_state_floats". */
41 /* returns the number of successors of the node: */
42 int get_irn_n_outs(ir_node *node);
44 /** Get predecessor n */
45 ir_node *get_irn_out(ir_node *node, int pos);
47 /** Set predecessor n */
48 void set_irn_out(ir_node *node, int pos, ir_node *out);
50 /* Methods to iterate through the control flow graph. Iterate from 0 to
51 i < get_Block_cfg_outs(block). No order of successors guaranteed. */
53 /** Return the number of control flow successors, ignore keep-alives. */
54 int get_Block_n_cfg_outs(ir_node *node);
56 /** Return the number of control flow successors, honor keep-alives. */
57 int get_Block_n_cfg_outs_ka(ir_node *node);
59 /** Access predecessor n, ignore keep-alives. */
60 ir_node *get_Block_cfg_out(ir_node *node, int pos);
62 /** Access predecessor n, honor keep-alives. */
63 ir_node *get_Block_cfg_out_ka(ir_node *node, int pos);
65 /** Walks over the graph starting at node. Walks also if graph is in state
66 "outs_inconsistent". Assumes current_ir_graph is set properly. */
67 void irg_out_walk(ir_node *node,
68 irg_walk_func *pre, irg_walk_func *post,
71 /** Walks only over Block nodes in the graph. Has it's own visited
72 flag, so that it can be interleaved with the other walker.
73 node must be either op_Block or mode_X. */
74 void irg_out_block_walk(ir_node *node,
75 irg_walk_func *pre, irg_walk_func *post,
78 /*------------------------------------------------------------------*/
79 /* Building and Removing the out datastructure */
80 /*------------------------------------------------------------------*/
82 /** Computes the out edges. Sets a flag in irg to "outs_consistent". If the
83 graph is changed this flag must be set to "outs_inconsistent". Computes
84 out edges from block to floating nodes even if graph is in state
85 "op_pin_state_floats". Optimizes Tuple nodes. */
86 void compute_irg_outs(ir_graph *irg);
87 void compute_irp_outs(void);
89 void assure_irg_outs(ir_graph *irg);
91 #ifdef INTERPROCEDURAL_VIEW
92 /** Computes the out edges in interprocedural view */
93 void compute_ip_outs(void);
94 /** Frees the out datastructures. Sets the flag in irg to "outs_none". */
95 void free_ip_outs(void);
98 void free_irg_outs(ir_graph *irg);
99 void free_irp_outs(void);