1 /* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe
9 * ir graph modification.
11 * @author Martin Trapp, Christian Schaefer
21 /** Exchanges two nodes by conserving edges leaving old (i.e., pointers
22 pointing to old). Turns the old node into an Id. Requires that
23 current_ir_graph is set properly. */
24 INLINE void exchange (ir_node *old, ir_node *nw);
26 /** Turns a node into a "useless" Tuple. The Tuple node just forms a tuple
27 from several inputs. The predecessors of the tuple have to be
28 set by hand. The block predecessor automatically remains the same.
29 This is useful if a node returning a tuple is removed, but the Projs
30 extracting values from the tuple are not available. */
31 void turn_into_tuple (ir_node *node, int arity);
33 /** Walks over the passed ir graph and collects all Phi nodes as a
34 list built with the link field in their corresponding block.
35 Further it collects all Proj nodes in a list of the node producing
36 the tuple. In case of nested tuples the Projs are collected in the
37 node producing the outermost Tuple. */
38 void collect_phiprojs(ir_graph *irg);
40 /** Parts a block into two. This is useful to insert other blocks within a
42 Adds a new block (new_block) in the control flow before the block
43 (old_block) of node. Moves node and its predecessors from old_block to
44 new_block. Moves all Projs that depend on moved nodes and are in old_block
45 to new_block. Moves all Phi nodes from old_block to new_block. To achieve
46 this the routine assumes that all Phi nodes are in a list (using the link
47 field) in the link field of old_block. Further it assumes that all Proj nodes
48 are accessible by the link field of the nodes producing the Tuple. This
49 can be established by collect_phiprojs(). part_block conserves this property.
50 Adds a Jmp node to new_block that jumps to old_block.
51 Assumes that node is contained in current_ir_graph. Sets current_block in
52 this ir_graph to new_block. */
53 void part_block(ir_node *node);
55 #endif /* ifndef _IRGMOD_H_ */