/* initialize, global variables. */
/* *************************************************************************** */
-
/* *************************************************************************** */
/* Access routines for irnodes */
/* *************************************************************************** */
return get_Sel_entity(sel);
}
-
-
/* *************************************************************************** */
/* The heuristic */
/* *************************************************************************** */
}
+/** @@@ the second version of the heuristic. */
int get_weighted_loop_depth(ir_node *n) {
int loop_call_depth = get_irn_loop_call_depth(n);
int loop_depth = get_irn_loop_depth(n);
/* The final evaluation of a node. In this function we can
adapt the heuristic. Combine execution freqency with
- recursion depth. */
+ recursion depth.
+ @@@ the second version of the heuristic. */
double get_irn_final_cost(ir_node *n) {
- double cost_loop = get_irn_exec_freq(n);
- int rec_depth = get_irn_recursion_depth(n);
- double cost_rec = pow(default_recursion_weight, rec_depth);
- return cost_loop + cost_rec;
+ double cost_loop = get_irn_exec_freq(n);
+ double cost_method = get_irg_method_execution_frequency(get_irn_irg(n));
+ int rec_depth = get_irn_recursion_depth(n);
+ double cost_rec = pow(default_recursion_weight, rec_depth);
+ return cost_loop*(cost_method + cost_rec);
}
double get_type_estimated_n_instances(type *tp) {
double get_type_estimated_mem_consumption_bytes(type *tp) {
assert(0);
+ return 0.0;
}
int get_type_estimated_n_fields(type *tp) {
return n_calls;
}
-
-/* *************************************************************************** */
-/* Auxiliary */
-/* *************************************************************************** */
+/* ------------------------------------------------------------------------- */
+/* Auxiliary */
+/* ------------------------------------------------------------------------- */
int is_jack_rts_name(ident *name) {
return 0;