/*
- * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
+ * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
*
* This file is part of libFirm.
*
*/
/**
- * Author: Daniel Grund
- * Date: 11.04.2005
- * Copyright: (c) Universitaet Karlsruhe
- * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
+ * @file
+ * @brief Copy minimization driver.
+ * @author Daniel Grund
+ * @date 11.04.2005
+ * @version $Id$
*
* Main file for the optimization reducing the copies needed for:
* - Phi coalescing
* - Register-constrained nodes
* - Two-address code instructions
*/
-#ifndef _BECOPYOPT_H
-#define _BECOPYOPT_H
+#ifndef FIRM_BE_BECOPYOPT_H
+#define FIRM_BE_BECOPYOPT_H
#include <stdio.h>
#include "firm_types.h"
#include "bechordal.h"
+#include "beutil.h"
/**
* Flags for dumping the IFG.
CO_ALGO_NONE,
CO_ALGO_HEUR,
CO_ALGO_HEUR2,
- CO_ALGO_HEUR3,
CO_ALGO_HEUR4,
CO_ALGO_ILP,
+#ifdef FIRM_KAPS
+ CO_ALGO_PBQP,
+#endif
CO_ALGO_LAST
};
-/** The driver for copy minimization. */
-void co_driver(be_chordal_env_t *cenv);
+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);
-typedef int(*cost_fct_t)(const copy_opt_t *, ir_node*, ir_node*, int);
+typedef struct {
+ int (*copyopt)(copy_opt_t *co); /**< function ptr to run copyopt */
+ int can_improve_existing;
+} co_algo_info;
+
+
+/**
+ * Register a new copy optimization algorithm.
+ *
+ * @param name the name of the copy optimazation algorithm,
+ * used to select it
+ * @param copyopt a copy optimazation entry
+ */
+void be_register_copyopt(const char *name, co_algo_info *copyopt);
+
+/** The driver for copy minimization. */
+void co_driver(be_chordal_env_t *cenv);
/** A coalescing algorithm. */
typedef int (co_algo_t)(copy_opt_t *);
*/
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 co The copy opt object.
*/
int co_get_costs_all_one(const copy_opt_t *co, ir_node *root, ir_node* arg, int pos);
+#ifdef _MSC_VER
+typedef __int64 long64;
+typedef unsigned __int64 ulong64;
+
+#define LL_FMT "i64"
+#define ULL_FMT "ui64"
+
+#else
+typedef long long long64;
+typedef unsigned long long ulong64;
+
+#define LL_FMT "ll"
+#define ULL_FMT "llu"
+
+#endif
+
/**
* Statistics over a copy optimization module.
*/
*/
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);
-
-/**
- * This is the pure C implementation of co_solve_heuristic_java().
- */
-int co_solve_heuristic_mst(copy_opt_t *co);
-
/**
* Returns the maximal costs possible, i.e. the costs if all
* pairs would be assigned different registers.
*/
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
*/
int co_gs_is_optimizable(copy_opt_t *co, ir_node *irn);
-#endif /* _BECOPYOPT_H */
+#endif