give Bad nodes a mode

[libfirm] / include / libfirm / field_temperature.h

diff --git a/include/libfirm/field_temperature.h b/include/libfirm/field_temperature.h
index ad3fd9d..57e0a77 100644 (file)
--- a/include/libfirm/field_temperature.h
+++ b/include/libfirm/field_temperature.h
@@ -42,60 +42,60 @@
 /* The number of array elements we assume if not both bounds are given. */
 #define DEFAULT_N_ARRAY_ELEMENTS 1
 
-FIRM_DLL int get_irn_loop_call_depth(ir_node *n);
+FIRM_API int get_irn_loop_call_depth(ir_node *n);
 /** Return loop depth of node.
  *
  *  Returns the loop depth of n in the control flow.  I.e., we
  *  go from the node to the block to the loop the block is in,
  *  and return its depth.  */
-FIRM_DLL int get_irn_cfloop_depth(ir_node *n);
-FIRM_DLL int get_irn_recursion_depth(ir_node *n);
+FIRM_API int get_irn_cfloop_depth(ir_node *n);
+FIRM_API int get_irn_recursion_depth(ir_node *n);
 
 /** Get the weighted interprocedural loop depth of the node.
     The depth is estimated by a heuristic. The heuristic considers
     loop and recursion depth. */
-FIRM_DLL int get_weighted_loop_depth(ir_node *n);
+FIRM_API int get_weighted_loop_depth(ir_node *n);
 
 /** Heuristic merging recursion and loop depth. */
-FIRM_DLL double get_irn_final_cost(ir_node *n);
+FIRM_API double get_irn_final_cost(ir_node *n);
 
 /** Get accumulated(really?) execution frequencies.
  *  A heuristic weights the recursions. */
-FIRM_DLL double get_type_estimated_n_instances(ir_type *clss);
-FIRM_DLL double get_type_estimated_mem_consumption_bytes(ir_type *tp);
+FIRM_API double get_type_estimated_n_instances(ir_type *clss);
+FIRM_API double get_type_estimated_mem_consumption_bytes(ir_type *tp);
 
 /** Estimates the size of an object.
  *
  *  The heuristic mainly affects array sizes.
  *  Further this ignores padding for alignment, especially of small fields. */
-FIRM_DLL int get_type_estimated_size_bytes(ir_type *tp);
+FIRM_API int get_type_estimated_size_bytes(ir_type *tp);
 /** Estimates the number of fields of a single Object.
  *  The heuristic mainly affects array sizes.
  *  @@@ Misses inherited fields! */
-FIRM_DLL int get_type_estimated_n_fields(ir_type *tp);
-FIRM_DLL double get_type_estimated_n_casts(ir_type *clss);
+FIRM_API int get_type_estimated_n_fields(ir_type *tp);
+FIRM_API double get_type_estimated_n_casts(ir_type *clss);
 
-FIRM_DLL double get_class_estimated_n_upcasts(ir_type *clss);
-FIRM_DLL double get_class_estimated_n_downcasts(ir_type *clss);
+FIRM_API double get_class_estimated_n_upcasts(ir_type *clss);
+FIRM_API double get_class_estimated_n_downcasts(ir_type *clss);
 
 /** Returns the number of accesses to the dispatch table.
  *
  *  This includes the initialization of the pointer field, and accesses
  *  to virtual fields (as instance marker in Java).  Certainly this
  *  includes virtual method calls. */
-FIRM_DLL double get_class_estimated_n_dyncalls(ir_type *clss);
+FIRM_API double get_class_estimated_n_dyncalls(ir_type *clss);
 /** Returns the number of writes to the dispatch pointer.
  *  This is the same as the number of allocations. */
-FIRM_DLL double get_class_estimated_dispatch_writes(ir_type *clss);
+FIRM_API double get_class_estimated_dispatch_writes(ir_type *clss);
 /** Returns the number of reads of the dispatch pointer. */
-FIRM_DLL double get_class_estimated_dispatch_reads (ir_type *clss);
+FIRM_API double get_class_estimated_dispatch_reads (ir_type *clss);
 
-FIRM_DLL double get_entity_estimated_n_loads(ir_entity *ent);
-FIRM_DLL double get_entity_estimated_n_stores(ir_entity *ent);
-FIRM_DLL double get_entity_estimated_n_calls(ir_entity *ent);
+FIRM_API double get_entity_estimated_n_loads(ir_entity *ent);
+FIRM_API double get_entity_estimated_n_stores(ir_entity *ent);
+FIRM_API double get_entity_estimated_n_calls(ir_entity *ent);
 /** The number of accesses to dynamically called methods and
  *  to other static fields that overwrite/are overwritten. */
-FIRM_DLL double get_entity_estimated_n_dyncalls(ir_entity *ent);
+FIRM_API double get_entity_estimated_n_dyncalls(ir_entity *ent);
 
 /* ------------------------------------------------------------------------- */
 /* Accumulate information in the type hierarchy.                             */