2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Phase information handling using node indexes.
23 * @author Sebastian Hack
26 * A phase contains a link to private data for each node in an ir graph.
27 * A phase is independent from the globally visible link field of ir nodes.
34 #include "irgraph_t.h"
35 #include "irphase_t.h"
37 void *phase_irn_init_default(ir_phase *ph, const ir_node *irn, void *old)
45 ir_phase *init_irg_phase(ir_graph *irg, ir_phase_id id, size_t size, phase_irn_init *data_init)
49 size = MAX(sizeof(*ph), size);
50 assert(id != PHASE_NOT_IRG_MANAGED && id < PHASE_LAST);
51 assert(irg->phases[id] == NULL && "you cannot overwrite another irg managed phase");
55 obstack_init(&ph->obst);
57 ph->growth_factor = PHASE_DEFAULT_GROWTH;
58 ph->data_init = data_init;
68 void free_irg_phase(ir_graph *irg, ir_phase_id id)
70 ir_phase *ph = get_irg_phase(irg, id);
73 irg->phases[id] = NULL;
76 ir_phase *phase_init(ir_phase *ph, const char *name, ir_graph *irg, unsigned growth_factor, phase_irn_init *data_init, void *priv)
78 obstack_init(&ph->obst);
81 ph->id = PHASE_NOT_IRG_MANAGED;
82 ph->growth_factor = growth_factor;
83 ph->data_init = data_init;
91 void phase_free(ir_phase *phase)
93 obstack_free(&phase->obst, NULL);
95 xfree(phase->data_ptr);
98 phase_stat_t *phase_stat(const ir_phase *phase, phase_stat_t *stat)
101 memset(stat, 0, sizeof(stat[0]));
103 stat->node_map_bytes = phase->n_data_ptr * sizeof(phase->data_ptr[0]);
104 stat->node_slots = phase->n_data_ptr;
105 for (i = 0, n = phase->n_data_ptr; i < n; ++i) {
106 if (phase->data_ptr[i] != NULL) {
107 stat->node_slots_used++;
110 stat->overall_bytes = stat->node_map_bytes + obstack_memory_used(&((ir_phase *)phase)->obst);
114 void phase_reinit_irn_data(ir_phase *phase)
118 if (! phase->data_init)
121 for (i = 0, n = phase->n_data_ptr; i < n; ++i) {
122 if (phase->data_ptr[i])
123 phase->data_init(phase, get_idx_irn(phase->irg, i), phase->data_ptr[i]);
127 void phase_reinit_block_irn_data(ir_phase *phase, ir_node *block)
131 if (! phase->data_init)
134 for (i = 0, n = phase->n_data_ptr; i < n; ++i) {
135 if (phase->data_ptr[i]) {
136 ir_node *irn = get_idx_irn(phase->irg, i);
137 if (! is_Block(irn) && get_nodes_block(irn) == block)
138 phase->data_init(phase, irn, phase->data_ptr[i]);
143 ir_node *phase_get_first_node(const ir_phase *phase)
147 for (i = 0; i < phase->n_data_ptr; ++i)
148 if (phase->data_ptr[i])
149 return get_idx_irn(phase->irg, i);
154 ir_node *phase_get_next_node(const ir_phase *phase, ir_node *start)
158 for (i = get_irn_idx(start) + 1; i < phase->n_data_ptr; ++i)
159 if (phase->data_ptr[i])
160 return get_idx_irn(phase->irg, i);