Assertion lower bound now. Will be removed...

[libfirm] / ir / be / becopyopt.h

diff --git a/ir/be/becopyopt.h b/ir/be/becopyopt.h
index 509c28f..b13bd07 100644 (file)
--- a/ir/be/becopyopt.h
+++ b/ir/be/becopyopt.h
@@ -14,6 +14,7 @@
 #include <stdlib.h>
 #include <stdio.h>
 #include <alloca.h>
+#include <string.h>
 #include <sys/types.h>
 #include <sys/stat.h>
 
@@ -36,21 +37,31 @@
 #include "belive_t.h"
 #include "bera_t.h"
 #include "bechordal_t.h"
+#include "bearch.h"
+
+/* TODO is_Copy */
+#define is_Copy(irn) 0
+#define DEBUG_IRG "scanner.c__init_td__gp"
 
 /**
- * TODO external things
- * define get_weight to sth representing the _gain_ if node n and m
- * have the same color. Must return values MIN_WEIGHT <= . <= MAX_WEIGHT.
+ * Data representing the problem of copy minimization.
  */
-#define get_weight(n,m) 1
-#define is_possible_color(irn, col) 1
-#define MAX_COLORS 32
+typedef struct _copy_opt_t {
+       ir_graph *irg;                                          /**< the irg to process */
+       char *name;                                                     /**< ProgName__IrgName__RegClass */
+       const arch_isa_if_t *isa;
+       const arch_register_class_t *cls;       /**< the registerclass all nodes belong to (in this pass) */
+       struct list_head units;                         /**< all units to optimize in right oreder */
+       pset *roots;                                            /**< used only temporary for detecting multiple appends */
+       struct obstack ob;
+} copy_opt_t;
 
 /**
  * A single unit of optimization. Lots of these form a copy-opt problem
  */
 typedef struct _unit_t {
        struct list_head units;         /**< chain for all units */
+       copy_opt_t *co;                         /**< the copy_opt this unit belongs to */
        int interf;                                     /**< number of nodes dropped due to interference */
        int node_count;                         /**< size of the nodes array */
        const ir_node **nodes;          /**< [0] is the root-node, others are non interfering args of it. */
@@ -60,20 +71,10 @@ typedef struct _unit_t {
        struct list_head queue;         /**< list of (mis/color) sorted by size of mis */
 } unit_t;
 
-/**
- * Data representing the problem of copy minimization.
- */
-typedef struct _copy_opt_t {
-       ir_graph *irg;                          /**< the irg which is processed */
-       struct list_head units;         /**< all units to optimize in right oreder */
-       pset *roots;                            /**< used only temporary for detecting multiple appends */
-} copy_opt_t;
-
-
 /**
  * Generate the problem. Collect all infos and optimizable nodes.
  */
-copy_opt_t *new_copy_opt(ir_graph *irg);
+copy_opt_t *new_copy_opt(ir_graph *irg, const arch_isa_if_t *isa, const arch_register_class_t *cls);
 
 /**
  * Free the space...
@@ -81,6 +82,12 @@ copy_opt_t *new_copy_opt(ir_graph *irg);
 void free_copy_opt(copy_opt_t *co);
 
 /**
+ * Returns the current number of copies needed
+ */
+int co_get_copy_count(copy_opt_t *co);
+
+/**
+ * IMPORTANT: Available only iff heuristic has run!
  * Returns a lower bound for the number of copies needed based on interfering
  * arguments and the size of a max indep. set (only ifg-edges) of the other args.
  */
@@ -102,4 +109,9 @@ void co_heur_opt(copy_opt_t *co);
  */
 void co_ilp_opt(copy_opt_t *co);
 
+/**
+ * Checks the register allocation for correctness
+ */
+void co_check_allocation(copy_opt_t *co);
+
 #endif