3 * File name: ir/ir/irgmod.h
4 * Purpose: Support for ir graph modification.
5 * Author: Martin Trapp, Christian Schaefer
6 * Modified by: Goetz Lindenmaier
9 * Copyright: (c) 1998-2003 Universität Karlsruhe
10 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
17 * ir graph modification.
19 * @author Martin Trapp, Christian Schaefer
28 /** Exchanges two nodes by conserving edges leaving old (i.e., pointers
29 pointing to old). Turns the old node into an Id. Requires that
30 current_ir_graph is set properly. */
31 INLINE void exchange (ir_node *old, ir_node *nw);
33 /** Turns a node into a "useless" Tuple. The Tuple node just forms a tuple
34 from several inputs. The predecessors of the tuple have to be
35 set by hand. The block predecessor automatically remains the same.
36 This is useful if a node returning a tuple is removed, but the Projs
37 extracting values from the tuple are not available. */
38 void turn_into_tuple (ir_node *node, int arity);
40 /** Walks over the passed ir graph and collects all Phi nodes as a
41 list built with the link field in their corresponding block.
42 Further it collects all Proj nodes in a list of the node producing
43 the tuple. In case of nested tuples the Projs are collected in the
44 node producing the outermost Tuple. */
45 void collect_phiprojs(ir_graph *irg);
47 /** Parts a block into two. This is useful to insert other blocks within a
49 Adds a new block (new_block) in the control flow before the block
50 (old_block) of node. Moves node and its predecessors from old_block to
51 new_block. Moves all Projs that depend on moved nodes and are in old_block
52 to new_block. Moves all Phi nodes from old_block to new_block. To achieve
53 this the routine assumes that all Phi nodes are in a list (using the link
54 field) in the link field of old_block. Further it assumes that all Proj nodes
55 are accessible by the link field of the nodes producing the Tuple. This
56 can be established by collect_phiprojs(). part_block conserves this property.
57 Adds a Jmp node to new_block that jumps to old_block.
58 Assumes that node is contained in current_ir_graph. Sets current_block in
59 this ir_graph to new_block. */
60 void part_block(ir_node *node);
62 #endif /* ifndef _IRGMOD_H_ */