/**
- * Header for copy optimization problem. Analysis and set up of the problem.
- * @author Daniel Grund
- * @date 12.04.2005
+ * Author: Daniel Grund
+ * Date: 11.04.2005
+ * Copyright: (c) Universitaet Karlsruhe
+ * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
+ *
+ * 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
-#ifdef HAVE_CONFIG_H
-#include "config.h"
-#endif
-
-#include <stdlib.h>
-#include <stdio.h>
-#include <alloca.h>
-#include <sys/types.h>
-#include <sys/stat.h>
-
-#include "debug.h"
-#include "obst.h"
-#include "list.h"
-#include "set.h"
-#include "pset.h"
-#include "bitset.h"
-#include "sp_matrix.h"
-
-#include "irgraph.h"
-#include "irgwalk.h"
#include "irnode.h"
-#include "irdom.h"
-#include "irouts.h"
+#include "bechordal.h"
-#include "beutil.h"
-#include "benumb_t.h"
-#include "belive_t.h"
-#include "bera_t.h"
-#include "bechordal_t.h"
-#include "bearch.h"
-
-/**
- * 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.
- */
-#define get_weight(n,m) 1
-#define is_possible_color(irn, col) 1
-#define is_Copy(irn) 0
-#define MAX_COLORS 32
-/**
- * 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 */
- 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. */
+typedef int(*cost_fct_t)(ir_node*, ir_node*, int);
- /* for heuristic */
- int mis_size; /**< size of a mis considering only ifg (not coloring conflicts) */
- struct list_head queue; /**< list of (mis/color) sorted by size of mis */
-} unit_t;
+typedef struct _copy_opt_t copy_opt_t;
/**
- * Data representing the problem of copy minimization.
+ * Has to be called during the firm init phase
*/
-typedef struct _copy_opt_t {
- ir_graph *irg; /**< the irg to process */
- const arch_isa_if_t *isa;
- const arch_register_class_t *cls; /**< the registerclass to optimize */
- 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;
-
+void be_copy_opt_init(void);
/**
- * Generate the problem. Collect all infos and optimizable nodes.
+ * Generate the problem. Collect all information and optimizable nodes.
*/
-copy_opt_t *new_copy_opt(ir_graph *irg, const arch_isa_if_t *isa, const arch_register_class_t *cls);
+copy_opt_t *new_copy_opt(be_chordal_env_t *chordal_env, cost_fct_t get_costs);
/**
- * Free the space...
+ * Free the space used...
*/
void free_copy_opt(copy_opt_t *co);
/**
- * Returns the current number of copies needed
+ * Computes the costs of a copy according to loop depth
+ * @param pos: the argument position of arg in the root arguments
+ * @return Must be >= 0 in all cases.
*/
-int co_get_copy_count(copy_opt_t *co);
+int co_get_costs_loop_depth(ir_node *root, ir_node* arg, int pos);
/**
- * 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.
+ * All costs equal 1. Using this will reduce the _number_ of copies.
+ * @return Must be >= 0 in all cases.
*/
-int co_get_lower_bound(copy_opt_t *co);
-
-/**
- * Returns the number of arguments interfering with their root node. This also
- * is a (worse) lower bound for the number of copies needed.
- */
-int co_get_interferer_count(copy_opt_t *co);
+int co_get_costs_all_one(ir_node *root, ir_node* arg, int pos);
/**
* Solves the problem using a heuristic approach
*/
-void co_heur_opt(copy_opt_t *co);
+int co_solve_heuristic(copy_opt_t *co);
/**
* Solves the problem using mixed integer programming
+ * @returns 1 iff solution state was optimal
*/
-void co_ilp_opt(copy_opt_t *co);
+int co_solve_ilp1(copy_opt_t *co, double time_limit);
/**
- * Checks the register allocation for correctness
+ * Solves the problem using mixed integer programming
+ * @returns 1 iff solution state was optimal
*/
-void co_check_allocation(copy_opt_t *co);
+int co_solve_ilp2(copy_opt_t *co, double time_limit);
#endif
projects / libfirm / blobdiff