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
35 #include "firmstat_t.h"
49 typedef struct pressure_walker_env_t pressure_walker_env_t;
50 struct pressure_walker_env_t {
56 const arch_register_class_t *cls;
59 static void check_reg_pressure_class(pressure_walker_env_t *env,
61 const arch_register_class_t *cls)
63 be_irg_t *birg = env->birg;
64 ir_graph *irg = be_get_birg_irg(birg);
66 ir_nodeset_t live_nodes;
69 ir_nodeset_init(&live_nodes);
70 be_liveness_end_of_block(env->lv, cls, block, &live_nodes);
71 max_live = ir_nodeset_size(&live_nodes);
72 env->regpressure += max_live;
74 sched_foreach_reverse(block, irn) {
80 be_liveness_transfer(cls, irn, &live_nodes);
81 cnt = ir_nodeset_size(&live_nodes);
82 max_live = cnt < max_live ? max_live : cnt;
83 env->regpressure += cnt;
87 if(max_live > env->max_pressure)
88 env->max_pressure = max_live;
90 stat_be_block_regpressure(irg, block, max_live, cls->name);
91 ir_nodeset_destroy(&live_nodes);
94 static void stat_reg_pressure_block(ir_node *block, void *data) {
95 pressure_walker_env_t *env = data;
97 check_reg_pressure_class(env, block, env->cls);
100 void be_do_stat_reg_pressure(be_irg_t *birg, const arch_register_class_t *cls) {
101 pressure_walker_env_t env;
102 ir_graph *irg = be_get_birg_irg(birg);
103 double average_pressure;
107 env.max_pressure = 0;
109 be_liveness_assure_sets(be_assure_liveness(birg));
110 env.lv = be_get_birg_liveness(birg);
113 /* Collect register pressure information for each block */
114 irg_block_walk_graph(irg, stat_reg_pressure_block, NULL, &env);
116 average_pressure = env.regpressure / env.insn_count;
117 stat_ev_emit("bechordal_average_register_pressure", average_pressure);
118 stat_ev_emit("bechordal_maximum_register_pressure", env.max_pressure);
124 typedef struct _estimate_irg_costs_env_t {
125 const arch_env_t *arch_env;
126 ir_exec_freq *execfreqs;
128 } estimate_irg_costs_env_t;
130 static void estimate_block_costs(ir_node *block, void *data)
132 estimate_irg_costs_env_t *env = data;
136 sched_foreach(block, node) {
137 costs += arch_get_op_estimated_cost(node);
140 env->costs += costs * get_block_execfreq(env->execfreqs, block);
143 double be_estimate_irg_costs(ir_graph *irg, const arch_env_t *arch_env, ir_exec_freq *execfreqs)
145 estimate_irg_costs_env_t env;
147 env.arch_env = arch_env;
148 env.execfreqs = execfreqs;
151 irg_block_walk_graph(irg, estimate_block_costs, NULL, &env);
158 static be_node_stats_t *stats;
160 static void node_stat_walker(ir_node *irn, void *data)
164 /* if the node is a normal phi */
166 if (get_irn_mode(irn) == mode_M) {
167 (*stats)[BE_STAT_MEM_PHIS]++;
169 (*stats)[BE_STAT_PHIS]++;
172 arch_irn_class_t classify = arch_irn_classify(irn);
174 if(classify & arch_irn_class_spill)
175 (*stats)[BE_STAT_SPILLS]++;
176 if(classify & arch_irn_class_reload)
177 (*stats)[BE_STAT_RELOADS]++;
178 if(classify & arch_irn_class_remat)
179 (*stats)[BE_STAT_REMATS]++;
180 if(classify & arch_irn_class_copy)
181 (*stats)[BE_STAT_COPIES]++;
182 if(classify & arch_irn_class_perm)
183 (*stats)[BE_STAT_PERMS]++;
187 void be_collect_node_stats(be_node_stats_t *new_stats, be_irg_t *birg)
191 memset(stats, 0, sizeof(*stats));
192 irg_walk_graph(birg->irg, NULL, node_stat_walker, NULL);
195 void be_subtract_node_stats(be_node_stats_t *stats, be_node_stats_t *sub)
198 for (i = 0; i < BE_STAT_COUNT; ++i) {
199 (*stats)[i] -= (*sub)[i];
203 void be_copy_node_stats(be_node_stats_t *dest, be_node_stats_t *src)
205 memcpy(dest, src, sizeof(be_node_stats_t));
208 static const char *get_stat_name(enum be_stat_tag_t tag)
211 case BE_STAT_PHIS: return "phis";
212 case BE_STAT_MEM_PHIS: return "mem_phis";
213 case BE_STAT_COPIES: return "copies";
214 case BE_STAT_PERMS: return "perms";
215 case BE_STAT_SPILLS: return "spills";
216 case BE_STAT_RELOADS: return "reloads";
217 case BE_STAT_REMATS: return "remats";
218 default: panic("unknown stat tag found");
222 void be_emit_node_stats(be_node_stats_t *stats, const char *prefix)
224 static char buf[256];
227 for (i = 0; i < BE_STAT_COUNT; ++i) {
228 snprintf(buf, sizeof(buf), "%s%s", prefix, get_stat_name(i));
229 stat_ev_dbl(buf, (*stats)[i]);
235 static void insn_count_walker(ir_node *irn, void *data)
237 unsigned long *cnt = data;
239 switch(get_irn_opcode(irn)) {
250 unsigned long be_count_insns(ir_graph *irg)
252 unsigned long cnt = 0;
253 irg_walk_graph(irg, insn_count_walker, NULL, &cnt);
257 static void block_count_walker(ir_node *node, void *data)
259 unsigned long *cnt = data;
260 if (node == get_irg_end_block(current_ir_graph))
265 unsigned long be_count_blocks(ir_graph *irg)
267 unsigned long cnt = 0;
268 irg_block_walk_graph(irg, block_count_walker, NULL, &cnt);