/*
- * Project: libFIRM
- * File name: ir/ir/irphase.c
- * Purpose: Phase information handling using node indexes.
- * Author: Sebastian Hack
- * Modified by:
- * Created:
- * CVS-ID: $Id$
- * Copyright: (c) 1998-2006 Universitaet Karlsruhe
- * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
+ * Copyright (C) 1995-2007 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.
*/
+/**
+ * @file
+ * @brief Phase information handling using node indexes.
+ * @author Sebastian Hack
+ * @version $Id$
+ * @summary
+ * A phase contains a link to private data for each node in an ir graph.
+ * A phase is independent from the globally visible link field of ir nodes.
+ */
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#include "irnode_t.h"
#include "irphase_t.h"
-ir_phase *phase_init(ir_phase *ph, const char *name, ir_graph *irg, unsigned growth_factor, phase_irn_data_init_t *data_init)
+ir_phase *phase_init(ir_phase *ph, const char *name, ir_graph *irg, unsigned growth_factor, phase_irn_data_init_t *data_init, void *priv)
{
assert(growth_factor >= 256 && "growth factor must greater or equal to 256/256");
assert(data_init && "You must provide a data constructor");
ph->irg = irg;
ph->n_data_ptr = 0;
ph->data_ptr = NULL;
+ ph->priv = priv;
return ph;
}
}
}
-ir_node *phase_get_first_node(ir_phase *phase) {
- int i;
+ir_node *phase_get_first_node(const ir_phase *phase) {
+ unsigned i;
for (i = 0; i < phase->n_data_ptr; ++i)
if (phase->data_ptr[i])
return NULL;
}
-ir_node *phase_get_next_node(ir_phase *phase, ir_node *start) {
- int i;
+ir_node *phase_get_next_node(const ir_phase *phase, ir_node *start) {
+ unsigned i;
for (i = get_irn_idx(start) + 1; i < phase->n_data_ptr; ++i)
if (phase->data_ptr[i])