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 Compute an estimate of field temperature, i.e., field access heuristic.
23 * @author Goetz Lindenmaier
29 #ifdef INTERPROCEDURAL_VIEW
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)
62 ir_entity *get_Sel_accessed_entity(ir_node *sel, int pos)
65 return get_Sel_entity(sel);
68 /* *************************************************************************** */
70 /* *************************************************************************** */
72 int get_irn_loop_call_depth(ir_node *n)
74 ir_graph *irg = get_irn_irg(n);
75 return get_irg_loop_depth(irg);
78 int get_irn_cfloop_depth(ir_node *n)
80 ir_loop *l = get_irn_loop(get_nodes_block(n));
82 return get_loop_depth(l);
87 int get_irn_recursion_depth(ir_node *n)
89 ir_graph *irg = get_irn_irg(n);
90 return get_irg_recursion_depth(irg);
94 /** @@@ the second version of the heuristic. */
95 int get_weighted_loop_depth(ir_node *n)
97 int loop_call_depth = get_irn_loop_call_depth(n);
98 int loop_depth = get_irn_cfloop_depth(n);
99 int recursion_depth = get_irn_recursion_depth(n);
101 return loop_call_depth + loop_depth + recursion_depth;
105 /* *************************************************************************** */
106 /* The 2. heuristic */
107 /* *************************************************************************** */
109 static int default_recursion_weight = 5;
111 /* The final evaluation of a node. In this function we can
112 adapt the heuristic. Combine execution frequency with
114 @@@ the second version of the heuristic.
116 Return 0 if the node is neither in a loop nor in a recursion. */
117 double get_irn_final_cost(ir_node *n)
119 double cost_loop = get_irn_exec_freq(n);
120 double cost_method = get_irg_method_execution_frequency(get_irn_irg(n));
121 int rec_depth = get_irn_recursion_depth(n);
125 if (get_irn_recursion_depth(n) == 0 &&
126 get_irn_loop_depth(n) == 0 &&
127 get_irg_method_loop_depth(get_irn_irg(n)) == 0)
130 if (get_weighted_loop_depth(n) == 0) return 0;
133 if (rec_depth) cost_rec = pow(default_recursion_weight, rec_depth);
134 return cost_loop*(cost_method + cost_rec);
137 double get_type_estimated_n_instances(ir_type *tp)
139 int i, n_allocs = get_type_n_allocs(tp);
140 double n_instances = 0;
141 for (i = 0; i < n_allocs; ++i) {
142 ir_node *alloc = get_type_alloc(tp, i);
143 n_instances += get_irn_final_cost(alloc);
148 double get_type_estimated_mem_consumption_bytes(ir_type *tp)
155 int get_type_estimated_n_fields(ir_type *tp)
158 switch (get_type_tpop_code(tp)) {
162 case tpo_enumeration:
167 s = 1; /* dispatch pointer */
170 int i, n_mem = get_compound_n_members(tp);
171 for (i = 0; i < n_mem; ++i) {
172 ir_entity *mem = get_compound_member(tp, i);
173 if (get_entity_allocation(mem) == allocation_automatic) {
174 s += get_type_estimated_n_fields(get_entity_type(mem));
180 long n_elt = DEFAULT_N_ARRAY_ELEMENTS;
181 assert(get_array_n_dimensions(tp) == 1 && "other not implemented");
182 if (is_Const(get_array_lower_bound(tp, 0)) &&
183 is_Const(get_array_upper_bound(tp, 0))) {
184 n_elt = get_array_upper_bound_int(tp, 0) - get_array_upper_bound_int(tp, 0);
190 panic("Unsupported type in get_type_estimated_n_fields %+F", tp);
196 int get_type_estimated_size_bytes(ir_type *tp)
200 switch (get_type_tpop_code(tp)) {
204 case tpo_enumeration:
205 s = get_mode_size_bytes(get_type_mode(tp));
209 s = get_mode_size_bytes(mode_P_data); /* dispatch pointer */
212 int i, n_mem = get_compound_n_members(tp);
213 for (i = 0; i < n_mem; ++i) {
214 ir_entity *mem = get_compound_member(tp, i);
215 s += get_type_estimated_size_bytes(get_entity_type(mem));
217 if (get_entity_allocation(mem) == allocation_automatic) {
218 } /* allocation_automatic */
223 int elt_s = get_type_estimated_size_bytes(get_array_element_type(tp));
224 long n_elt = DEFAULT_N_ARRAY_ELEMENTS;
225 assert(get_array_n_dimensions(tp) == 1 && "other not implemented");
226 if (is_Const(get_array_lower_bound(tp, 0)) &&
227 is_Const(get_array_upper_bound(tp, 0))) {
228 n_elt = get_array_upper_bound_int(tp, 0) - get_array_lower_bound_int(tp, 0);
240 double get_type_estimated_n_casts(ir_type *tp)
242 int i, n_casts = get_type_n_casts(tp);
243 double n_instances = 0;
244 for (i = 0; i < n_casts; ++i) {
245 ir_node *cast = get_type_cast(tp, i);
246 n_instances += get_irn_final_cost(cast);
251 double get_class_estimated_n_upcasts(ir_type *clss)
253 double n_instances = 0;
254 int i, j, n_casts, n_pointertypes;
256 n_casts = get_type_n_casts(clss);
257 for (i = 0; i < n_casts; ++i) {
258 ir_node *cast = get_type_cast(clss, i);
259 if (get_irn_opcode(cast) != iro_Cast) continue; /* Could be optimized away. */
261 if (is_Cast_upcast(cast))
262 n_instances += get_irn_final_cost(cast);
265 n_pointertypes = get_type_n_pointertypes_to(clss);
266 for (j = 0; j < n_pointertypes; ++j) {
267 n_instances += get_class_estimated_n_upcasts(get_type_pointertype_to(clss, j));
273 double get_class_estimated_n_downcasts(ir_type *clss)
275 double n_instances = 0;
276 int i, j, n_casts, n_pointertypes;
278 n_casts = get_type_n_casts(clss);
279 for (i = 0; i < n_casts; ++i) {
280 ir_node *cast = get_type_cast(clss, i);
281 if (get_irn_opcode(cast) != iro_Cast) continue; /* Could be optimized away. */
283 if (is_Cast_downcast(cast))
284 n_instances += get_irn_final_cost(cast);
287 n_pointertypes = get_type_n_pointertypes_to(clss);
288 for (j = 0; j < n_pointertypes; ++j) {
289 n_instances += get_class_estimated_n_downcasts(get_type_pointertype_to(clss, j));
296 double get_class_estimated_dispatch_writes(ir_type *clss)
298 return get_type_estimated_n_instances(clss);
301 /** Returns the number of reads of the dispatch pointer. */
302 double get_class_estimated_dispatch_reads (ir_type *clss)
304 int i, n_mems = get_class_n_members(clss);
306 for (i = 0; i < n_mems; ++i) {
307 ir_entity *mem = get_class_member(clss, i);
308 n_calls += get_entity_estimated_n_dyncalls(mem);
313 double get_class_estimated_n_dyncalls(ir_type *clss)
315 return get_class_estimated_dispatch_reads(clss) +
316 get_class_estimated_dispatch_writes(clss);
319 double get_entity_estimated_n_loads(ir_entity *ent)
321 int i, n_acc = get_entity_n_accesses(ent);
323 for (i = 0; i < n_acc; ++i) {
324 ir_node *acc = get_entity_access(ent, i);
326 n_loads += get_irn_final_cost(acc);
332 double get_entity_estimated_n_stores(ir_entity *ent)
334 int i, n_acc = get_entity_n_accesses(ent);
336 for (i = 0; i < n_acc; ++i) {
337 ir_node *acc = get_entity_access(ent, i);
339 n_stores += get_irn_final_cost(acc);
344 /* @@@ Should we evaluate the callee array? */
345 double get_entity_estimated_n_calls(ir_entity *ent)
347 int i, n_acc = get_entity_n_accesses(ent);
349 for (i = 0; i < n_acc; ++i) {
350 ir_node *acc = get_entity_access(ent, i);
352 n_calls += get_irn_final_cost(acc);
357 double get_entity_estimated_n_dyncalls(ir_entity *ent)
359 int i, n_acc = get_entity_n_accesses(ent);
361 for (i = 0; i < n_acc; ++i) {
362 ir_node *acc = get_entity_access(ent, i);
364 /* Call->Sel(ent) combination */
365 if (is_Call(acc) && is_Sel(get_Call_ptr(acc))) {
366 n_calls += get_irn_final_cost(acc);
368 /* MemOp->Sel combination for static, overwritten entities */
369 } else if (is_memop(acc) && is_Sel(get_memop_ptr(acc))) {
370 ir_entity *ent = get_Sel_entity(get_memop_ptr(acc));
371 if (is_Class_type(get_entity_owner(ent))) {
372 /* We might call this for inner entities in compounds. */
373 if (get_entity_n_overwrites(ent) > 0 ||
374 get_entity_n_overwrittenby(ent) > 0) {
375 n_calls += get_irn_final_cost(acc);
385 /* Move this to the jack compiler */
387 /* ------------------------------------------------------------------------- */
389 /* ------------------------------------------------------------------------- */
391 int is_jack_rts_name(ident *name)
393 if (id_is_suffix(new_id_from_str("Exception"), name)) return 1;
394 if (id_is_suffix(new_id_from_str("Throwable"), name)) return 1;
395 if (id_is_suffix(new_id_from_str("Error"), name)) return 1;
399 if (id_is_prefix(new_id_from_str("java/"), name)) return 1;
400 if (id_is_prefix(new_id_from_str("["), name)) return 1;
401 if (id_is_prefix(new_id_from_str("gnu/"), name)) return 1;
402 if (id_is_prefix(new_id_from_str("java/"), name)) return 1;
403 if (id_is_prefix(new_id_from_str("CStringToCoreString"), name)) return 1;
409 int is_jack_rts_class(ir_type *t)
411 ident *name = get_type_ident(t);
412 return is_jack_rts_name(name);
415 #include "entity_t.h" // for the assertion.
417 int is_jack_rts_entity(ir_entity *e)
422 name = get_entity_ld_ident(e);
424 return is_jack_rts_name(name);