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
25 #ifndef FIRM_BE_BEUTIL_H
26 #define FIRM_BE_BEUTIL_H
28 #include "firm_types.h"
31 * Convenient block getter.
32 * Works also, if the given node is a block.
33 * @param irn The node.
34 * @return The block of the node, or the node itself, if the node is a
37 static inline ir_node *get_block(ir_node *irn)
39 return is_Block(irn) ? irn : get_nodes_block(irn);
42 static inline const ir_node *get_block_const(const ir_node *irn)
44 return is_Block(irn) ? irn : get_nodes_block(irn);
48 * Clears the link fields of all nodes of the given graph.
49 * @param irg The graph.
51 void be_clear_links(ir_graph *irg);
54 * Gets the Proj with number pn from irn.
56 ir_node *be_get_Proj_for_pn(const ir_node *irn, long pn);
59 * Returns an array (an ARR_F) of the programs blocks in reverse postorder
60 * (note: caller has to free the memory with DEL_ARR_F after use;
61 * of course you can use ARR_LEN on the array too.)
63 ir_node **be_get_cfgpostorder(ir_graph *irg);
66 * convenience function to return the first successor block
67 * (it is often known that there is exactly 1 successor anyway)
69 ir_node *get_first_block_succ(const ir_node *block);