X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fir%2Firphase.c;h=362d0bc22e772939472c52baa998abfe415dda81;hb=bb9f2e36362333c6635b89f5258171b06c786608;hp=852c1a6ad155d28032c15d2a57ddbb5f2d4fa593;hpb=b84d550997d07bfcc4d828e8fbb5742098e050e4;p=libfirm

diff --git a/ir/ir/irphase.c b/ir/ir/irphase.c
index 852c1a6ad..362d0bc22 100644
--- a/ir/ir/irphase.c
+++ b/ir/ir/irphase.c
@@ -1,53 +1,101 @@
 /*
- * 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-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.
  */
 
-#ifdef _HAVE_CONFIG_H
+/**
+ * @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.
+ */
 #include "config.h"
-#endif
 
 #include "array.h"
+#include "util.h"
 #include "irnode_t.h"
+#include "irgraph_t.h"
 #include "irphase_t.h"
 
-phase_t *phase_new(const char *name, ir_graph *irg, size_t data_size, unsigned growth_factor,
-                   phase_irn_data_init_t *data_init, void *priv)
+void *phase_irn_init_default(ir_phase *ph, const ir_node *irn, void *old)
 {
-	phase_t *ph;
+	(void) ph;
+	(void) irn;
+	(void) old;
+	return NULL;
+}
 
-	assert(growth_factor >= 1.0 && "growth factor must greater or equal to 1.0");
+ir_phase *init_irg_phase(ir_graph *irg, ir_phase_id id, size_t size, phase_irn_init *data_init)
+{
+	ir_phase *ph;
 
-	ph = xmalloc(sizeof(ph[0]));
+	size = MAX(sizeof(*ph), size);
+	assert(id != PHASE_NOT_IRG_MANAGED && id < PHASE_LAST);
+	assert(irg->phases[id] == NULL && "you cannot overwrite another irg managed phase");
 
+	ph = xmalloc(size);
+	memset(ph, 0, size);
 	obstack_init(&ph->obst);
+	ph->id            = id;
+	ph->growth_factor = PHASE_DEFAULT_GROWTH;
+	ph->data_init     = data_init;
+	ph->irg           = irg;
+	ph->n_data_ptr    = 0;
+	ph->data_ptr      = NULL;
+
+	irg->phases[id] = ph;
+
+	return ph;
+}
 
-	ph->name          = name;
+void free_irg_phase(ir_graph *irg, ir_phase_id id)
+{
+	ir_phase *ph = get_irg_phase(irg, id);
+	phase_free(ph);
+	xfree(ph);
+	irg->phases[id] = NULL;
+}
+
+ir_phase *phase_init(ir_phase *ph, const char *name, ir_graph *irg, unsigned growth_factor, phase_irn_init *data_init, void *priv)
+{
+	obstack_init(&ph->obst);
+
+	(void) name;
+	ph->id            = PHASE_NOT_IRG_MANAGED;
 	ph->growth_factor = growth_factor;
 	ph->data_init     = data_init;
-	ph->data_size     = data_size;
 	ph->irg           = irg;
 	ph->n_data_ptr    = 0;
 	ph->data_ptr      = NULL;
 	ph->priv          = priv;
-
 	return ph;
 }
 
-void phase_free(phase_t *phase)
+void phase_free(ir_phase *phase)
 {
 	obstack_free(&phase->obst, NULL);
-	xfree(phase->data_ptr);
+	if(phase->data_ptr)
+		xfree(phase->data_ptr);
 }
 
-phase_stat_t *phase_stat(const phase_t *phase, phase_stat_t *stat)
+phase_stat_t *phase_stat(const ir_phase *phase, phase_stat_t *stat)
 {
 	int i, n;
 	memset(stat, 0, sizeof(stat[0]));
@@ -57,9 +105,57 @@ phase_stat_t *phase_stat(const phase_t *phase, phase_stat_t *stat)
 	for(i = 0, n = phase->n_data_ptr; i < n; ++i) {
 		if(phase->data_ptr[i] != NULL) {
 			stat->node_slots_used++;
-			stat->node_data_bytes += phase->data_size;
 		}
 	}
-	stat->overall_bytes = stat->node_map_bytes + obstack_memory_used(&phase->obst);
+	stat->overall_bytes = stat->node_map_bytes + obstack_memory_used(&((ir_phase *)phase)->obst);
 	return stat;
 }
+
+void phase_reinit_irn_data(ir_phase *phase)
+{
+	int i, n;
+
+	if (! phase->data_init)
+		return;
+
+	for (i = 0, n = phase->n_data_ptr; i < n; ++i) {
+		if (phase->data_ptr[i])
+			phase->data_init(phase, get_idx_irn(phase->irg, i), phase->data_ptr[i]);
+	}
+}
+
+void phase_reinit_block_irn_data(ir_phase *phase, ir_node *block)
+{
+	int i, n;
+
+	if (! phase->data_init)
+		return;
+
+	for (i = 0, n = phase->n_data_ptr; i < n; ++i) {
+		if (phase->data_ptr[i]) {
+			ir_node *irn = get_idx_irn(phase->irg, i);
+			if (! is_Block(irn) && get_nodes_block(irn) == block)
+				phase->data_init(phase, irn, phase->data_ptr[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 get_idx_irn(phase->irg, i);
+
+	return NULL;
+}
+
+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])
+			return get_idx_irn(phase->irg, i);
+
+	return NULL;
+}