2 * Copyright (C) 1995-2011 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 Provides several statistic functions for the backend.
23 * @author Christian Wuerdig, Matthias Braun
34 #include "firmstat_t.h"
48 typedef struct pressure_walker_env_t pressure_walker_env_t;
49 struct pressure_walker_env_t {
55 const arch_register_class_t *cls;
58 static void check_reg_pressure_class(pressure_walker_env_t *env,
60 const arch_register_class_t *cls)
62 ir_graph *irg = env->irg;
63 ir_nodeset_t live_nodes;
66 ir_nodeset_init(&live_nodes);
67 be_liveness_end_of_block(env->lv, cls, block, &live_nodes);
68 max_live = ir_nodeset_size(&live_nodes);
69 env->regpressure += max_live;
71 sched_foreach_reverse(block, irn) {
77 be_liveness_transfer(cls, irn, &live_nodes);
78 cnt = ir_nodeset_size(&live_nodes);
79 max_live = cnt < max_live ? max_live : cnt;
80 env->regpressure += cnt;
84 if (max_live > env->max_pressure)
85 env->max_pressure = max_live;
87 stat_be_block_regpressure(irg, block, max_live, cls->name);
88 ir_nodeset_destroy(&live_nodes);
91 static void stat_reg_pressure_block(ir_node *block, void *data)
93 pressure_walker_env_t *env = (pressure_walker_env_t*)data;
95 check_reg_pressure_class(env, block, env->cls);
98 void be_do_stat_reg_pressure(ir_graph *irg, const arch_register_class_t *cls)
100 pressure_walker_env_t env;
101 double average_pressure;
105 env.max_pressure = 0;
107 be_assure_live_sets(irg);
108 env.lv = be_get_irg_liveness(irg);
111 /* Collect register pressure information for each block */
112 irg_block_walk_graph(irg, stat_reg_pressure_block, NULL, &env);
114 average_pressure = env.regpressure / env.insn_count;
115 stat_ev_emit("bechordal_average_register_pressure", average_pressure);
116 stat_ev_emit("bechordal_maximum_register_pressure", env.max_pressure);
122 typedef struct estimate_irg_costs_env_t {
124 } estimate_irg_costs_env_t;
126 static void estimate_block_costs(ir_node *block, void *data)
128 estimate_irg_costs_env_t *env = (estimate_irg_costs_env_t*)data;
131 sched_foreach(block, node) {
132 costs += arch_get_op_estimated_cost(node);
135 env->costs += costs * get_block_execfreq(block);
138 double be_estimate_irg_costs(ir_graph *irg)
140 estimate_irg_costs_env_t env;
143 irg_block_walk_graph(irg, estimate_block_costs, NULL, &env);
150 static void node_stat_walker(ir_node *irn, void *data)
152 be_node_stats_t *const stats = (be_node_stats_t*)data;
154 /* if the node is a normal phi */
156 if (get_irn_mode(irn) == mode_M) {
157 (*stats)[BE_STAT_MEM_PHIS]++;
159 (*stats)[BE_STAT_PHIS]++;
161 } else if (be_is_Perm(irn)) {
162 (*stats)[BE_STAT_PERMS]++;
163 } else if (be_is_Copy(irn)) {
164 (*stats)[BE_STAT_COPIES]++;
168 void be_collect_node_stats(be_node_stats_t *new_stats, ir_graph *irg)
170 memset(new_stats, 0, sizeof(*new_stats));
171 irg_walk_graph(irg, NULL, node_stat_walker, new_stats);
174 void be_subtract_node_stats(be_node_stats_t *stats, be_node_stats_t *sub)
177 for (i = 0; i < BE_STAT_COUNT; ++i) {
178 (*stats)[i] -= (*sub)[i];
182 void be_copy_node_stats(be_node_stats_t *dest, be_node_stats_t *src)
184 memcpy(dest, src, sizeof(be_node_stats_t));
187 static const char *get_stat_name(enum be_stat_tag_t tag)
190 case BE_STAT_PHIS: return "phis";
191 case BE_STAT_MEM_PHIS: return "mem_phis";
192 case BE_STAT_COPIES: return "copies";
193 case BE_STAT_PERMS: return "perms";
194 default: panic("unknown stat tag found");
198 void be_emit_node_stats(be_node_stats_t *stats, const char *prefix)
200 static char buf[256];
203 for (i = BE_STAT_FIRST; i < BE_STAT_COUNT; ++i) {
204 snprintf(buf, sizeof(buf), "%s%s", prefix, get_stat_name(i));
205 stat_ev_dbl(buf, (*stats)[i]);
211 static void insn_count_walker(ir_node *irn, void *data)
213 unsigned long *cnt = (unsigned long*)data;
215 switch (get_irn_opcode(irn)) {
226 unsigned long be_count_insns(ir_graph *irg)
228 unsigned long cnt = 0;
229 irg_walk_graph(irg, insn_count_walker, NULL, &cnt);
233 static void block_count_walker(ir_node *node, void *data)
235 unsigned long *cnt = (unsigned long*)data;
236 if (node == get_irg_end_block(get_irn_irg(node)))
241 unsigned long be_count_blocks(ir_graph *irg)
243 unsigned long cnt = 0;
244 irg_block_walk_graph(irg, block_count_walker, NULL, &cnt);