#ifndef _BECOPYOPT_H
#define _BECOPYOPT_H
-#include "irnode.h"
+#include <stdio.h>
+
+#include "firm_types.h"
#include "bechordal.h"
+#ifdef WITH_LIBCORE
+#include <libcore/lc_opts.h>
+extern void co_register_options(lc_opt_entry_t *grp);
+#endif
-typedef int(*cost_fct_t)(ir_node*, ir_node*, int);
+/**
+ * Flags for dumping the IFG.
+ */
+enum {
+ CO_IFG_DUMP_COLORS = 1, /**< Dump the graph colored. */
+ CO_IFG_DUMP_LABELS = 2, /**< Dump node/edge labels. */
+ CO_IFG_DUMP_SHAPE = 4, /**< Give constrained nodes special shapes. */
+ CO_IFG_DUMP_CONSTR = 8 /**< Dump the node constraints in the label. */
+};
-typedef struct _copy_opt_t copy_opt_t;
+/**
+ * Algorithms.
+ */
+enum {
+ CO_ALGO_NONE,
+ CO_ALGO_HEUR,
+ CO_ALGO_HEUR2,
+ CO_ALGO_HEUR3,
+ CO_ALGO_ILP,
+ CO_ALGO_LAST
+};
+
+/** The driver for copy minimization. */
+void co_driver(be_chordal_env_t *cenv);
/**
* Has to be called during the firm init phase
*/
void be_copy_opt_init(void);
+typedef struct _copy_opt_t copy_opt_t;
+
+typedef int(*cost_fct_t)(const copy_opt_t *, ir_node*, ir_node*, int);
+
+/** A coalescing algorithm. */
+typedef int (co_algo_t)(copy_opt_t *);
+
/**
* Generate the problem. Collect all information and optimizable nodes.
*/
*/
void free_copy_opt(copy_opt_t *co);
+/**
+ * Checks if a node is optimizable, viz. has something to do with coalescing
+ * @param arch The architecture environment
+ * @param irn The irn to check
+ */
+int co_is_optimizable_root(const copy_opt_t *co, ir_node *irn);
+
+/**
+ * Checks if the irn is a non-interfering argument of a node which 'is_optimizable'
+ */
+int co_is_optimizable_arg(const copy_opt_t *co, ir_node *irn);
+
/**
* 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(ir_node *root, ir_node* arg, int pos);
+int co_get_costs_loop_depth(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.
+ * 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.
*/
-int co_get_costs_all_one(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.
+ * @param co The copy opt object.
+ * @return Must be >= 0 in all cases.
+ */
+int co_get_costs_all_one(const copy_opt_t *co, ir_node *root, ir_node* arg, int pos);
+
+
+
+
+/**
+ * Build internal optimization units structure
+ */
+void co_build_ou_structure(copy_opt_t *co);
+
+/**
+ * Frees the space used by the opt unit representation.
+ * Does NOT free the whole copyopt structure
+ */
+void co_free_ou_structure(copy_opt_t *co);
/**
* Solves the problem using a heuristic approach
+ * Uses the OU data structure
*/
int co_solve_heuristic(copy_opt_t *co);
+/**
+ * Apply Park/Moon coalescing to the graph.
+ * @param co The copy optimization data structure.
+ */
+void co_solve_park_moon(copy_opt_t *co);
+
+/**
+ * Solves the copy minimization problem using another heuristic approach.
+ * Uses the OU and the GRAPH data structure.
+ */
+int co_solve_heuristic_new(copy_opt_t *co);
+
+/**
+ * Solves the copy minimization problem using another heuristic approach implemented in Java.
+ * This function needs a JVM which is started to call the Java module.
+ * Uses the GRAPH data structure.
+ */
+int co_solve_heuristic_java(copy_opt_t *co);
+
+/**
+ * Returns the maximal costs possible, i.e. the costs if all
+ * pairs would be assigned different registers.
+ * Uses the OU data structure
+ */
+int co_get_max_copy_costs(const copy_opt_t *co);
+
+/**
+ * Returns the inevitable costs, i.e. the costs of
+ * all copy pairs which interfere.
+ * Uses the OU data structure
+ */
+int co_get_inevit_copy_costs(const copy_opt_t *co);
+
+/**
+ * Returns the current costs the copies are causing.
+ * The result includes inevitable costs and the costs
+ * of the copies regarding the current register allocation
+ * Uses the OU data structure
+ */
+int co_get_copy_costs(const copy_opt_t *co);
+
+/**
+ * Returns a lower bound for the costs of copies in this ou.
+ * The result includes inevitable costs and the costs of a
+ * minimal costs caused by the nodes of the ou.
+ * Uses the OU data structure
+ */
+int co_get_lower_bound(const copy_opt_t *co);
+
+/**
+ * Dump the interference graph according to the Appel/George coalescing contest file format.
+ * See: http://www.cs.princeton.edu/~appel/coalesce/format.html
+ * @note Requires graph structure.
+ * @param co The copy opt object.
+ * @param f A file to dump to.
+ */
+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);
+/**
+ * Dump the interference graph with the affinity edges and the coloring.
+ * @param co The copy opt structure.
+ * @param f The file to dump to.
+ * @param flags The dump flags (see enum above).
+ */
+void co_dump_ifg_dot(const copy_opt_t *co, FILE *f, unsigned flags);
+
+/**
+ * Constructs another internal representation of the affinity edges
+ */
+void co_build_graph_structure(copy_opt_t *co);
+
+/**
+ * Frees the space used by the graph representation.
+ * Does NOT free the whole copyopt structure
+ */
+void co_free_graph_structure(copy_opt_t *co);
+
/**
* Solves the problem using mixed integer programming
* @returns 1 iff solution state was optimal
+ * NYI
*/
int co_solve_ilp1(copy_opt_t *co, double time_limit);
/**
* Solves the problem using mixed integer programming
* @returns 1 iff solution state was optimal
+ * Uses the OU and the GRAPH data structure
+ * Dependency of the OU structure can be removed
*/
-int co_solve_ilp2(copy_opt_t *co, double time_limit);
+int co_solve_ilp2(copy_opt_t *co);
/**
- * Compares different solutions of the same problem
+ * Checks if a node is optimizable, viz has something to do with coalescing.
+ * Uses the GRAPH data structure
*/
-void co_compare_solvers(be_chordal_env_t *chordal_env);
+int co_gs_is_optimizable(copy_opt_t *co, ir_node *irn);
-#endif
+#endif /* _BECOPYOPT_H */
projects / libfirm / blobdiff