/* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe
-** All rights reserved.
-**
-** Authors: Martin Trapp, Christian Schaefer
-**
-** irgmod.h: ir graph modification
+* All rights reserved.
+*
+* Authors: Martin Trapp, Christian Schaefer
+*
+* irgmod.h: ir graph modification
*/
/* $Id$ */
# include "irnode.h"
+/* Exchanges two nodes by conserving edges leaving old (i.e., pointers
+ pointing to old). Turns the old node into an Id. Requires that
+ current_ir_graph is set properly. */
+INLINE void exchange (ir_node *old, ir_node *nw);
+
/* Turns a node into a "useless" Tuple. The Tuple node just forms a tuple
from several inputs. The predecessors of the tuple have to be
set by hand. The block predecessor automatically remains the same.
extracting values from the tuple are not available. */
void turn_into_tuple (ir_node *node, int arity);
-/* Exchanges two nodes by conserving edges leaving old (i.e., pointers
- pointing to old). Turns the old node into an Id. Requires that
- current_ir_graph is set properly. */
-inline void exchange (ir_node *old, ir_node *new);
-
/* Walks over the passed ir graph and collects all Phi nodes as a
list built with the link field in their corresponding block.
Further it collects all Proj nodes in a list of the node producing