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 void phase_init(ir_phase *phase, ir_graph *irg, phase_irn_init *data_init)
47 memset(phase, 0, sizeof(*phase));
49 obstack_init(&phase->obst);
50 phase->data_init = data_init;
52 phase->n_data_ptr = 0;
53 phase->data_ptr = NULL;
56 ir_phase *new_phase(ir_graph *irg, phase_irn_init *data_init)
58 ir_phase *phase = xmalloc(sizeof(*phase));
59 phase_init(phase, irg, data_init);
63 void phase_deinit(ir_phase *phase)
65 obstack_free(&phase->obst, NULL);
67 xfree(phase->data_ptr);
70 void phase_free(ir_phase *phase)
76 phase_stat_t *phase_stat(const ir_phase *phase, phase_stat_t *stat)
79 memset(stat, 0, sizeof(stat[0]));
81 stat->node_map_bytes = phase->n_data_ptr * sizeof(phase->data_ptr[0]);
82 stat->node_slots = phase->n_data_ptr;
83 for (i = 0, n = phase->n_data_ptr; i < n; ++i) {
84 if (phase->data_ptr[i] != NULL) {
85 stat->node_slots_used++;
88 stat->overall_bytes = stat->node_map_bytes + obstack_memory_used(&((ir_phase *)phase)->obst);
92 void phase_reinit_irn_data(ir_phase *phase)
96 if (! phase->data_init)
99 for (i = 0, n = phase->n_data_ptr; i < n; ++i) {
100 if (phase->data_ptr[i])
101 phase->data_init(phase, get_idx_irn(phase->irg, i), phase->data_ptr[i]);
105 void phase_reinit_block_irn_data(ir_phase *phase, ir_node *block)
109 if (! phase->data_init)
112 for (i = 0, n = phase->n_data_ptr; i < n; ++i) {
113 if (phase->data_ptr[i]) {
114 ir_node *irn = get_idx_irn(phase->irg, i);
115 if (! is_Block(irn) && get_nodes_block(irn) == block)
116 phase->data_init(phase, irn, phase->data_ptr[i]);
121 ir_node *phase_get_first_node(const ir_phase *phase)
125 for (i = 0; i < phase->n_data_ptr; ++i)
126 if (phase->data_ptr[i])
127 return get_idx_irn(phase->irg, i);
132 ir_node *phase_get_next_node(const ir_phase *phase, ir_node *start)
136 for (i = get_irn_idx(start) + 1; i < phase->n_data_ptr; ++i)
137 if (phase->data_ptr[i])
138 return get_idx_irn(phase->irg, i);