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 Provides several statistic functions for the backend.
23 * @author Christian Wuerdig, Matthias Braun
37 #include "firmstat_t.h"
51 typedef struct pressure_walker_env_t pressure_walker_env_t;
52 struct pressure_walker_env_t {
58 const arch_register_class_t *cls;
61 static void check_reg_pressure_class(pressure_walker_env_t *env,
63 const arch_register_class_t *cls)
65 be_irg_t *birg = env->birg;
66 ir_graph *irg = be_get_birg_irg(birg);
67 const arch_env_t *aenv = be_get_birg_arch_env(birg);
69 ir_nodeset_t live_nodes;
72 ir_nodeset_init(&live_nodes);
73 be_liveness_end_of_block(env->lv, aenv, cls, block, &live_nodes);
74 max_live = ir_nodeset_size(&live_nodes);
75 env->regpressure += max_live;
77 sched_foreach_reverse(block, irn) {
83 be_liveness_transfer(cls, irn, &live_nodes);
84 cnt = ir_nodeset_size(&live_nodes);
85 max_live = cnt < max_live ? max_live : cnt;
86 env->regpressure += cnt;
90 if(max_live > env->max_pressure)
91 env->max_pressure = max_live;
93 stat_be_block_regpressure(irg, block, max_live, cls->name);
94 ir_nodeset_destroy(&live_nodes);
97 static void stat_reg_pressure_block(ir_node *block, void *data) {
98 pressure_walker_env_t *env = data;
100 check_reg_pressure_class(env, block, env->cls);
103 void be_do_stat_reg_pressure(be_irg_t *birg, const arch_register_class_t *cls) {
104 pressure_walker_env_t env;
105 ir_graph *irg = be_get_birg_irg(birg);
106 double average_pressure;
110 env.max_pressure = 0;
112 be_liveness_assure_sets(be_assure_liveness(birg));
113 env.lv = be_get_birg_liveness(birg);
116 /* Collect register pressure information for each block */
117 irg_block_walk_graph(irg, stat_reg_pressure_block, NULL, &env);
119 average_pressure = env.regpressure / env.insn_count;
120 stat_ev_emit("bechordal_average_register_pressure", average_pressure);
121 stat_ev_emit("bechordal_maximum_register_pressure", env.max_pressure);
127 typedef struct _estimate_irg_costs_env_t {
128 const arch_env_t *arch_env;
129 ir_exec_freq *execfreqs;
131 } estimate_irg_costs_env_t;
133 static void estimate_block_costs(ir_node *block, void *data)
135 estimate_irg_costs_env_t *env = data;
139 sched_foreach(block, node) {
140 costs += arch_get_op_estimated_cost(node);
143 env->costs += costs * get_block_execfreq(env->execfreqs, block);
146 double be_estimate_irg_costs(ir_graph *irg, const arch_env_t *arch_env, ir_exec_freq *execfreqs)
148 estimate_irg_costs_env_t env;
150 env.arch_env = arch_env;
151 env.execfreqs = execfreqs;
154 irg_block_walk_graph(irg, estimate_block_costs, NULL, &env);
161 static be_node_stats_t *stats;
163 static void node_stat_walker(ir_node *irn, void *data)
167 /* if the node is a normal phi */
169 if (get_irn_mode(irn) == mode_M) {
170 (*stats)[BE_STAT_MEM_PHIS]++;
172 (*stats)[BE_STAT_PHIS]++;
175 arch_irn_class_t classify = arch_irn_classify(irn);
177 if(classify & arch_irn_class_spill)
178 (*stats)[BE_STAT_SPILLS]++;
179 if(classify & arch_irn_class_reload)
180 (*stats)[BE_STAT_RELOADS]++;
181 if(classify & arch_irn_class_remat)
182 (*stats)[BE_STAT_REMATS]++;
183 if(classify & arch_irn_class_copy)
184 (*stats)[BE_STAT_COPIES]++;
185 if(classify & arch_irn_class_perm)
186 (*stats)[BE_STAT_PERMS]++;
190 void be_collect_node_stats(be_node_stats_t *new_stats, be_irg_t *birg)
194 memset(stats, 0, sizeof(*stats));
195 irg_walk_graph(birg->irg, NULL, node_stat_walker, NULL);
198 void be_subtract_node_stats(be_node_stats_t *stats, be_node_stats_t *sub)
201 for (i = 0; i < BE_STAT_COUNT; ++i) {
202 (*stats)[i] -= (*sub)[i];
206 void be_copy_node_stats(be_node_stats_t *dest, be_node_stats_t *src)
208 memcpy(dest, src, sizeof(be_node_stats_t));
211 static const char *get_stat_name(enum be_stat_tag_t tag)
214 case BE_STAT_PHIS: return "phis";
215 case BE_STAT_MEM_PHIS: return "mem_phis";
216 case BE_STAT_COPIES: return "copies";
217 case BE_STAT_PERMS: return "perms";
218 case BE_STAT_SPILLS: return "spills";
219 case BE_STAT_RELOADS: return "reloads";
220 case BE_STAT_REMATS: return "remats";
221 default: panic("unknown stat tag found");
225 void be_emit_node_stats(be_node_stats_t *stats, const char *prefix)
227 static char buf[256];
230 for (i = 0; i < BE_STAT_COUNT; ++i) {
231 snprintf(buf, sizeof(buf), "%s%s", prefix, get_stat_name(i));
232 stat_ev_dbl(buf, (*stats)[i]);
238 static void insn_count_walker(ir_node *irn, void *data)
240 unsigned long *cnt = data;
242 switch(get_irn_opcode(irn)) {
253 unsigned long be_count_insns(ir_graph *irg)
255 unsigned long cnt = 0;
256 irg_walk_graph(irg, insn_count_walker, NULL, &cnt);
260 static void block_count_walker(ir_node *node, void *data)
262 unsigned long *cnt = data;
263 if (node == get_irg_end_block(current_ir_graph))
268 unsigned long be_count_blocks(ir_graph *irg)
270 unsigned long cnt = 0;
271 irg_block_walk_graph(irg, block_count_walker, NULL, &cnt);