2 * Copyright (C) 1995-2007 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 Compute an estimate of field temperature, i.e., field access heuristic.
23 * @author Goetz Lindenmaier
33 #include "field_temperature.h"
36 #include "execution_frequency.h"
39 #include "irgraph_t.h"
47 /* *************************************************************************** */
48 /* initialize, global variables. */
49 /* *************************************************************************** */
51 /* *************************************************************************** */
52 /* Access routines for irnodes */
53 /* *************************************************************************** */
55 /* The entities that can be accessed by this Sel node. */
56 int get_Sel_n_accessed_entities(ir_node *sel) {
60 ir_entity *get_Sel_accessed_entity(ir_node *sel, int pos) {
61 return get_Sel_entity(sel);
64 /* *************************************************************************** */
66 /* *************************************************************************** */
68 int get_irn_loop_call_depth(ir_node *n) {
69 ir_graph *irg = get_irn_irg(n);
70 return get_irg_loop_depth(irg);
73 int get_irn_cfloop_depth(ir_node *n) {
74 ir_loop *l = get_irn_loop(get_nodes_block(n));
76 return get_loop_depth(l);
81 int get_irn_recursion_depth(ir_node *n) {
82 ir_graph *irg = get_irn_irg(n);
83 return get_irg_recursion_depth(irg);
87 /** @@@ the second version of the heuristic. */
88 int get_weighted_loop_depth(ir_node *n) {
89 int loop_call_depth = get_irn_loop_call_depth(n);
90 int loop_depth = get_irn_cfloop_depth(n);
91 int recursion_depth = get_irn_recursion_depth(n);
93 return loop_call_depth + loop_depth + recursion_depth;
97 /* *************************************************************************** */
98 /* The 2. heuristic */
99 /* *************************************************************************** */
101 static int default_recursion_weight = 5;
103 /* The final evaluation of a node. In this function we can
104 adapt the heuristic. Combine execution frequency with
106 @@@ the second version of the heuristic.
108 Return 0 if the node is neither in a loop nor in a recursion. */
109 double get_irn_final_cost(ir_node *n) {
110 double cost_loop = get_irn_exec_freq(n);
111 double cost_method = get_irg_method_execution_frequency(get_irn_irg(n));
112 int rec_depth = get_irn_recursion_depth(n);
116 if (get_irn_recursion_depth(n) == 0 &&
117 get_irn_loop_depth(n) == 0 &&
118 get_irg_method_loop_depth(get_irn_irg(n)) == 0)
121 if (get_weighted_loop_depth(n) == 0) return 0;
124 if (rec_depth) cost_rec = pow(default_recursion_weight, rec_depth);
125 return cost_loop*(cost_method + cost_rec);
128 double get_type_estimated_n_instances(ir_type *tp) {
129 int i, n_allocs = get_type_n_allocs(tp);
130 double n_instances = 0;
131 for (i = 0; i < n_allocs; ++i) {
132 ir_node *alloc = get_type_alloc(tp, i);
133 n_instances += get_irn_final_cost(alloc);
138 double get_type_estimated_mem_consumption_bytes(ir_type *tp) {
143 int get_type_estimated_n_fields(ir_type *tp) {
145 switch(get_type_tpop_code(tp)) {
149 case tpo_enumeration:
154 s = 1; /* dispatch pointer */
157 int i, n_mem = get_compound_n_members(tp);
158 for (i = 0; i < n_mem; ++i) {
159 ir_entity *mem = get_compound_member(tp, i);
160 if (get_entity_allocation(mem) == allocation_automatic) {
161 s += get_type_estimated_n_fields(get_entity_type(mem));
167 long n_elt = DEFAULT_N_ARRAY_ELEMENTS;
168 assert(get_array_n_dimensions(tp) == 1 && "other not implemented");
169 if ((get_irn_op(get_array_lower_bound(tp, 0)) == op_Const) &&
170 (get_irn_op(get_array_upper_bound(tp, 0)) == op_Const) ) {
171 n_elt = get_array_upper_bound_int(tp, 0) - get_array_upper_bound_int(tp, 0);
177 panic("Unsupported type in get_type_estimated_n_fields %+F", tp);
183 int get_type_estimated_size_bytes(ir_type *tp) {
186 switch(get_type_tpop_code(tp)) {
190 case tpo_enumeration:
191 s = get_mode_size_bytes(get_type_mode(tp));
195 s = get_mode_size_bytes(mode_P_data); /* dispatch pointer */
198 int i, n_mem = get_compound_n_members(tp);
199 for (i = 0; i < n_mem; ++i) {
200 ir_entity *mem = get_compound_member(tp, i);
201 s += get_type_estimated_size_bytes(get_entity_type(mem));
203 if (get_entity_allocation(mem) == allocation_automatic) {
204 } /* allocation_automatic */
209 int elt_s = get_type_estimated_size_bytes(get_array_element_type(tp));
210 long n_elt = DEFAULT_N_ARRAY_ELEMENTS;
211 assert(get_array_n_dimensions(tp) == 1 && "other not implemented");
212 if ((get_irn_op(get_array_lower_bound(tp, 0)) == op_Const) &&
213 (get_irn_op(get_array_upper_bound(tp, 0)) == op_Const) ) {
214 n_elt = get_array_upper_bound_int(tp, 0) - get_array_lower_bound_int(tp, 0);
226 double get_type_estimated_n_casts(ir_type *tp) {
227 int i, n_casts = get_type_n_casts(tp);
228 double n_instances = 0;
229 for (i = 0; i < n_casts; ++i) {
230 ir_node *cast = get_type_cast(tp, i);
231 n_instances += get_irn_final_cost(cast);
236 double get_class_estimated_n_upcasts(ir_type *clss) {
237 double n_instances = 0;
238 int i, j, n_casts, n_pointertypes;
240 n_casts = get_type_n_casts(clss);
241 for (i = 0; i < n_casts; ++i) {
242 ir_node *cast = get_type_cast(clss, i);
243 if (get_irn_opcode(cast) != iro_Cast) continue; /* Could be optimized away. */
245 if (is_Cast_upcast(cast))
246 n_instances += get_irn_final_cost(cast);
249 n_pointertypes = get_type_n_pointertypes_to(clss);
250 for (j = 0; j < n_pointertypes; ++j) {
251 n_instances += get_class_estimated_n_upcasts(get_type_pointertype_to(clss, j));
257 double get_class_estimated_n_downcasts(ir_type *clss) {
258 double n_instances = 0;
259 int i, j, n_casts, n_pointertypes;
261 n_casts = get_type_n_casts(clss);
262 for (i = 0; i < n_casts; ++i) {
263 ir_node *cast = get_type_cast(clss, i);
264 if (get_irn_opcode(cast) != iro_Cast) continue; /* Could be optimized away. */
266 if (is_Cast_downcast(cast))
267 n_instances += get_irn_final_cost(cast);
270 n_pointertypes = get_type_n_pointertypes_to(clss);
271 for (j = 0; j < n_pointertypes; ++j) {
272 n_instances += get_class_estimated_n_downcasts(get_type_pointertype_to(clss, j));
279 double get_class_estimated_dispatch_writes(ir_type *clss) {
280 return get_type_estimated_n_instances(clss);
283 /** Returns the number of reads of the dispatch pointer. */
284 double get_class_estimated_dispatch_reads (ir_type *clss) {
285 int i, n_mems = get_class_n_members(clss);
287 for (i = 0; i < n_mems; ++i) {
288 ir_entity *mem = get_class_member(clss, i);
289 n_calls += get_entity_estimated_n_dyncalls(mem);
294 double get_class_estimated_n_dyncalls(ir_type *clss) {
295 return get_class_estimated_dispatch_reads(clss) +
296 get_class_estimated_dispatch_writes(clss);
299 double get_entity_estimated_n_loads(ir_entity *ent) {
300 int i, n_acc = get_entity_n_accesses(ent);
302 for (i = 0; i < n_acc; ++i) {
303 ir_node *acc = get_entity_access(ent, i);
304 if (get_irn_op(acc) == op_Load) {
305 n_loads += get_irn_final_cost(acc);
311 double get_entity_estimated_n_stores(ir_entity *ent) {
312 int i, n_acc = get_entity_n_accesses(ent);
314 for (i = 0; i < n_acc; ++i) {
315 ir_node *acc = get_entity_access(ent, i);
316 if (get_irn_op(acc) == op_Store)
317 n_stores += get_irn_final_cost(acc);
322 /* @@@ Should we evaluate the callee array? */
323 double get_entity_estimated_n_calls(ir_entity *ent) {
324 int i, n_acc = get_entity_n_accesses(ent);
326 for (i = 0; i < n_acc; ++i) {
327 ir_node *acc = get_entity_access(ent, i);
328 if (get_irn_op(acc) == op_Call)
330 n_calls += get_irn_final_cost(acc);
335 double get_entity_estimated_n_dyncalls(ir_entity *ent) {
336 int i, n_acc = get_entity_n_accesses(ent);
338 for (i = 0; i < n_acc; ++i) {
339 ir_node *acc = get_entity_access(ent, i);
341 /* Call->Sel(ent) combination */
342 if (is_Call(acc) && is_Sel(get_Call_ptr(acc))) {
343 n_calls += get_irn_final_cost(acc);
345 /* MemOp->Sel combination for static, overwritten entities */
346 } else if (is_memop(acc) && is_Sel(get_memop_ptr(acc))) {
347 ir_entity *ent = get_Sel_entity(get_memop_ptr(acc));
348 if (is_Class_type(get_entity_owner(ent))) {
349 /* We might call this for inner entities in compounds. */
350 if (get_entity_n_overwrites(ent) > 0 ||
351 get_entity_n_overwrittenby(ent) > 0) {
352 n_calls += get_irn_final_cost(acc);
361 /* ------------------------------------------------------------------------- */
363 /* ------------------------------------------------------------------------- */
365 int is_jack_rts_name(ident *name) {
366 if (id_is_suffix(new_id_from_str("Exception"), name)) return 1;
367 if (id_is_suffix(new_id_from_str("Throwable"), name)) return 1;
368 if (id_is_suffix(new_id_from_str("Error"), name)) return 1;
372 if (id_is_prefix(new_id_from_str("java/"), name)) return 1;
373 if (id_is_prefix(new_id_from_str("["), name)) return 1;
374 if (id_is_prefix(new_id_from_str("gnu/"), name)) return 1;
375 if (id_is_prefix(new_id_from_str("java/"), name)) return 1;
376 if (id_is_prefix(new_id_from_str("CStringToCoreString"), name)) return 1;
382 int is_jack_rts_class(ir_type *t) {
383 ident *name = get_type_ident(t);
384 return is_jack_rts_name(name);
387 #include "entity_t.h" // for the assertion.
389 int is_jack_rts_entity(ir_entity *e) {
393 name = get_entity_ld_ident(e);
395 return is_jack_rts_name(name);