2 * Copyright (C) 1995-2008 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 Contains some useful function for the backend.
23 * @author Sebastian Hack
40 #include "iredges_t.h"
46 void be_clear_links(ir_graph *irg)
48 irg_walk_graph(irg, firm_clear_link, NULL, NULL);
52 * Gets the Proj with number pn from irn.
54 ir_node *be_get_Proj_for_pn(const ir_node *irn, long pn)
56 const ir_edge_t *edge;
58 assert(get_irn_mode(irn) == mode_T && "need mode_T");
60 foreach_out_edge(irn, edge) {
61 proj = get_edge_src_irn(edge);
63 if (is_Proj(proj) && get_Proj_proj(proj) == pn)
71 * Block-walker: adds the visited block to a flexible array.
73 static void add_to_postorder(ir_node *block, void *data)
75 ir_node ***list = (ir_node***) data;
76 ARR_APP1(ir_node*, *list, block);
79 ir_node **be_get_cfgpostorder(ir_graph *irg)
81 ir_node **list = NEW_ARR_F(ir_node*, 0);
82 ir_node *end_block = get_irg_end_block(irg);
84 /* end block may be unreachable in case of endless loops */
85 if (get_Block_n_cfgpreds(end_block) == 0)
86 ARR_APP1(ir_node*, list, end_block);
89 irg_block_edges_walk(get_irg_start_block(irg), NULL, add_to_postorder,
95 ir_node *get_first_block_succ(const ir_node *block)
97 const ir_edge_t *edge = get_irn_out_edge_first_kind(block, EDGE_KIND_BLOCK);
99 return get_edge_src_irn(edge);