projects
/
libfirm
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
|
inline
| side by side (parent:
b2396bb
)
adapted cost function signature
author
Sebastian Hack
<hack@ipd.info.uni-karlsruhe.de>
Tue, 11 Jul 2006 08:16:40 +0000
(08:16 +0000)
committer
Sebastian Hack
<hack@ipd.info.uni-karlsruhe.de>
Tue, 11 Jul 2006 08:16:40 +0000
(08:16 +0000)
ir/be/becopyopt.h
patch
|
blob
|
history
diff --git
a/ir/be/becopyopt.h
b/ir/be/becopyopt.h
index
f6d5873
..
a99ad23
100644
(file)
--- a/
ir/be/becopyopt.h
+++ b/
ir/be/becopyopt.h
@@
-28,10
+28,10
@@
extern void co_register_options(lc_opt_entry_t *grp);
*/
void be_copy_opt_init(void);
*/
void be_copy_opt_init(void);
-typedef int(*cost_fct_t)(ir_node*, ir_node*, int);
-
typedef struct _copy_opt_t copy_opt_t;
typedef struct _copy_opt_t copy_opt_t;
+typedef int(*cost_fct_t)(const copy_opt_t *, ir_node*, ir_node*, int);
+
/**
* Generate the problem. Collect all information and optimizable nodes.
*/
/**
* Generate the problem. Collect all information and optimizable nodes.
*/
@@
-56,16
+56,26
@@
int co_is_optimizable_arg(const copy_opt_t *co, ir_node *irn);
/**
* Computes the costs of a copy according to loop depth
/**
* Computes the costs of a copy according to loop depth
- * @param pos: the argument position of arg in the root arguments
+ * @param co The copy opt object.
+ * @param pos the argument position of arg in the root arguments
+ * @return Must be >= 0 in all cases.
+ */
+int co_get_costs_loop_depth(const copy_opt_t *co, ir_node *root, ir_node* arg, int pos);
+
+/**
+ * Computes the costs of a copy according to execution frequency
+ * @param co The copy opt object.
+ * @param pos the argument position of arg in the root arguments
* @return Must be >= 0 in all cases.
*/
* @return Must be >= 0 in all cases.
*/
-int co_get_costs_
loop_depth(
ir_node *root, ir_node* arg, int pos);
+int co_get_costs_
exec_freq(const copy_opt_t *co,
ir_node *root, ir_node* arg, int pos);
/**
* All costs equal 1. Using this will reduce the _number_ of copies.
/**
* All costs equal 1. Using this will reduce the _number_ of copies.
+ * @param co The copy opt object.
* @return Must be >= 0 in all cases.
*/
* @return Must be >= 0 in all cases.
*/
-int co_get_costs_all_one(ir_node *root, ir_node* arg, int pos);
+int co_get_costs_all_one(
const copy_opt_t *co,
ir_node *root, ir_node* arg, int pos);
@@
-141,7
+151,12
@@
int co_get_lower_bound(const copy_opt_t *co);
*/
void co_dump_appel_graph(const copy_opt_t *co, FILE *f);
*/
void co_dump_appel_graph(const copy_opt_t *co, FILE *f);
-
+/**
+ * Dumps the IFG of the program splitting after each instruction in the Appel format.
+ * @param co The copy opt object.
+ * @param f The file to dump to.
+ */
+void co_dump_appel_graph_cliques(const copy_opt_t *co, FILE *f);
/**
* Constructs another internal representation of the affinity edges
/**
* Constructs another internal representation of the affinity edges