X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbecopyopt.h;h=471fccdd777ae1515ce35f53f2888ad9885afa2b;hb=c1fdf770d4d000dd5cf22daead32369342c5f5d1;hp=7e11ba32de324e62af9cf97babd48b2d3565a289;hpb=8b6be7e6885ce00f03f83626aaee50503ea12069;p=libfirm

diff --git a/ir/be/becopyopt.h b/ir/be/becopyopt.h
index 7e11ba32d..471fccdd7 100644
--- a/ir/be/becopyopt.h
+++ b/ir/be/becopyopt.h
@@ -1,27 +1,42 @@
+/*
+ * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
+ *
+ * This file is part of libFirm.
+ *
+ * This file may be distributed and/or modified under the terms of the
+ * GNU General Public License version 2 as published by the Free Software
+ * Foundation and appearing in the file LICENSE.GPL included in the
+ * packaging of this file.
+ *
+ * Licensees holding valid libFirm Professional Edition licenses may use
+ * this file in accordance with the libFirm Commercial License.
+ * Agreement provided with the Software.
+ *
+ * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
+ * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE.
+ */
+
 /**
- * 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"
-
-#ifdef WITH_LIBCORE
-#include <libcore/lc_opts.h>
-extern void co_register_options(lc_opt_entry_t *grp);
-#endif
+#include "beutil.h"
 
 /**
  * Flags for dumping the IFG.
@@ -41,6 +56,7 @@ enum {
 	CO_ALGO_HEUR,
 	CO_ALGO_HEUR2,
 	CO_ALGO_HEUR3,
+	CO_ALGO_HEUR4,
 	CO_ALGO_ILP,
 	CO_ALGO_LAST
 };
@@ -48,14 +64,9 @@ enum {
 /** 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);
+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 *);
@@ -70,18 +81,6 @@ copy_opt_t *new_copy_opt(be_chordal_env_t *chordal_env, cost_fct_t get_costs);
  */
 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.
@@ -154,7 +153,7 @@ 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);
+int co_solve_heuristic_new(copy_opt_t *co);
 
 /**
  * Solves the copy minimization problem using another heuristic approach implemented in Java.
@@ -163,6 +162,11 @@ int  co_solve_heuristic_new(copy_opt_t *co);
  */
 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.
@@ -248,4 +252,4 @@ int co_solve_ilp2(copy_opt_t *co);
  */
 int co_gs_is_optimizable(copy_opt_t *co, ir_node *irn);
 
-#endif /* _BECOPYOPT_H */
+#endif /* FIRM_BE_BECOPYOPT_H */