-
-/* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe
-* All rights reserved.
-*
-* Authors: Martin Trapp, Christian Schaefer
-*
-* irgmod: ir graph modification
-*/
-
-/* $Id$ */
+/*
+ * Project: libFIRM
+ * File name: ir/ir/irgmod.h
+ * Purpose: Support for ir graph modification.
+ * Author: Martin Trapp, Christian Schaefer
+ * Modified by: Goetz Lindenmaier
+ * Created:
+ * CVS-ID: $Id$
+ * Copyright: (c) 1998-2003 Universität Karlsruhe
+ * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
+ */
#ifdef HAVE_CONFIG_H
# include <config.h>
#endif
# include "irvrfy.h"
-# include "irflag.h"
+# include "irflag_t.h"
# include "irgwalk.h"
# include "irnode_t.h"
# include "irgraph_t.h"
# include "irgmod.h"
# include "array.h"
# include "ircons.h"
+# include "firmstat.h"
/* Turns a node into a "useless" Tuple. The Tuple just forms a tuple
from several inputs.
{
assert(node);
set_irn_op(node, op_Tuple);
- if (get_irn_arity(node) == arity) {
+ if (intern_get_irn_arity(node) == arity) {
/* keep old array */
} else {
/* Allocate new array, don't free old in_array, it's on the obstack. */
INLINE void
exchange (ir_node *old, ir_node *nw)
{
- ir_node *block = old->in[0];
+ ir_node *block;
+
+ assert(get_irn_op(old)->opar != oparity_dynamic);
+
+ stat_turn_into_id(old);
+
+ block = old->in[0];
old->op = op_Id;
old->in = NEW_ARR_D (ir_node *, current_ir_graph->obst, 2);
old->in[1] = nw;
}
-/**********************************************************************/
-/* Functionality for collect_phis */
-/**********************************************************************/
+/*--------------------------------------------------------------------*/
+/* Functionality for collect_phis */
+/*--------------------------------------------------------------------*/
static void
clear_link (ir_node *n, void *env) {
static void
collect (ir_node *n, void *env) {
ir_node *pred;
- if (get_irn_op(n) == op_Phi) {
+ if (intern_get_irn_op(n) == op_Phi) {
set_irn_link(n, get_irn_link(get_nodes_Block(n)));
set_irn_link(get_nodes_Block(n), n);
}
- if (get_irn_op(n) == op_Proj) {
+ if (intern_get_irn_op(n) == op_Proj) {
pred = n;
- while (get_irn_op(pred) == op_Proj)
+ while (intern_get_irn_op(pred) == op_Proj)
pred = get_Proj_pred(pred);
set_irn_link(n, get_irn_link(pred));
set_irn_link(pred, n);
}
-/**********************************************************************/
-/* Funcionality for part_block */
-/**********************************************************************/
-
-/* Moves node and all predecessors of node from from_bl to to_bl.
- Does not move predecessors of Phi nodes (or block nodes). */
+/*--------------------------------------------------------------------*/
+/* Functionality for part_block */
+/*--------------------------------------------------------------------*/
+/**
+ * Moves node and all predecessors of node from from_bl to to_bl.
+ * Does not move predecessors of Phi nodes (or block nodes).
+ */
static void move (ir_node *node, ir_node *from_bl, ir_node *to_bl) {
int i;
ir_node *proj, *pred;
set_nodes_Block(node, to_bl);
/* move its projs */
- if (get_irn_mode(node) == mode_T) {
+ if (intern_get_irn_mode(node) == mode_T) {
proj = get_irn_link(node);
while (proj) {
if (get_nodes_Block(proj) == from_bl)
}
/* recursion ... */
- if (get_irn_op(node) == op_Phi) return;
+ if (intern_get_irn_op(node) == op_Phi) return;
- for (i = 0; i < get_irn_arity(node); i++) {
+ for (i = 0; i < intern_get_irn_arity(node); i++) {
pred = get_irn_n(node, i);
if (get_nodes_Block(pred) == from_bl)
move(pred, from_bl, to_bl);
ir_node *phi;
/* Turn off optimizations so that blocks are not merged again. */
- int rem_opt = get_optimize();
+ int rem_opt = get_opt_optimize();
set_optimize(0);
/* Transform the control flow */