/*
- * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
- *
* This file is part of libFirm.
- *
- * This file may be distributed and/or modified under the terms of the
- * GNU General Public License version 2 as published by the Free Software
- * Foundation and appearing in the file LICENSE.GPL included in the
- * packaging of this file.
- *
- * Licensees holding valid libFirm Professional Edition licenses may use
- * this file in accordance with the libFirm Commercial License.
- * Agreement provided with the Software.
- *
- * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
- * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE.
+ * Copyright (C) 2012 University of Karlsruhe.
*/
/**
* @file
* @brief Support for ir graph modification.
* @author Martin Trapp, Christian Schaefer, Goetz Lindenmaier
- * @version $Id$
*/
#ifndef FIRM_IR_IRGMOD_H
#define FIRM_IR_IRGMOD_H
* @param node The node to be turned into a tuple.
* @param arity The number of values formed into a Tuple.
*/
-FIRM_API void turn_into_tuple(ir_node *node, int arity);
+FIRM_API void turn_into_tuple(ir_node *node, int arity, ir_node *const in[]);
/** Walks over the passed IR graph and collects all Phi nodes as a
* list in their corresponding block (using get_Block_phis() API).
FIRM_API ir_node *part_block_edges(ir_node *node);
/**
- * Kill a node by setting its predecessors to Bad and finally
- * exchange the node by Bad itself.
+ * Kill a node. No other node may have this node as operand.
*/
FIRM_API void kill_node(ir_node *node);