/**
+ * Author: Daniel Grund
+ * Date: 12.04.2005
+ * Copyright: (c) Universitaet Karlsruhe
+ * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
+ *
* Header for copy optimization problem. Analysis and set up of the problem.
- * @author Daniel Grund
- * @date 12.04.2005
*/
#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 "beutil.h"
#include "benumb_t.h"
#include "belive_t.h"
-#include "bera_t.h"
#include "bechordal_t.h"
#include "bearch.h"
+#define DEBUG_IRG "NONE spec.c__main__datab"
+#define DEBUG_LVL_CO LEVEL_1
+#define DEBUG_LVL_HEUR LEVEL_1
+#define DEBUG_LVL_ILP LEVEL_1
+
+typedef int(*cost_fct_t)(ir_node*, ir_node*, int);
+
/**
- * 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 is_Copy(irn) 0
-#define MAX_COLORS 32
+typedef struct _copy_opt_t {
+ be_chordal_env_t *chordal_env;
+ char *name; /**< ProgName__IrgName__RegClass */
+ struct list_head units; /**< all units to optimize in right order */
+ pset *roots; /**< used only temporary for detecting multiple appends */
+ cost_fct_t get_costs; /**< function ptr used to get costs for copies */
+ 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 */
- int interf; /**< number of nodes dropped due to interference */
+ copy_opt_t *co; /**< the copy_opt this unit belongs to */
int node_count; /**< size of the nodes array */
- const ir_node **nodes; /**< [0] is the root-node, others are non interfering args of it. */
+ ir_node **nodes; /**< [0] is the root-node, others are non interfering args of it. */
+ int *costs; /**< costs[i] are arising, if nodes[i] has a different color */
+ int complete_costs; /**< sum of all costs[i] */
+ int minimal_costs; /**< a lower bound for this ou, considering only ifg (not coloring conflicts) */
+
+ int sort_key; /**< maximum costs. controls the order of ou's. */
/* 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;
-/**
- * Data representing the problem of copy minimization.
- */
-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;
+/* Helpers */
+#define set_irn_col(co, irn, col) \
+ arch_set_irn_register(co->chordal_env->arch_env, irn, 0, arch_register_for_index(co->chordal_env->cls, col))
+
+#define get_irn_col(co, irn) \
+ arch_register_get_index(arch_get_irn_register(co->chordal_env->arch_env, irn, 0))
+
+#define list_entry_units(lh) list_entry(lh, unit_t, units)
/**
* Generate the problem. Collect all infos 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, int (*get_costs)(ir_node*, ir_node*, int));
/**
* Free the space...
*/
void free_copy_opt(copy_opt_t *co);
+
+#define is_Perm(arch_env, irn) (arch_irn_classify(arch_env, irn) == arch_irn_class_perm)
+
/**
- * Returns the current number of copies needed
+ * A copy is a proj haning out of perm node
*/
-int co_get_copy_count(copy_opt_t *co);
+#define is_Copy(arch_env, irn) (is_Proj(irn) && is_Perm(arch_env, get_Proj_pred(irn)))
/**
- * 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.
+ * returns the corresponding argument of the perm node for a copy
+ */
+#define get_Copy_src(irn) (get_irn_n(get_Proj_pred(irn), get_Proj_proj(irn)))
+
+/**
+ * Checks if a node is optimizable, viz. is a target of a 'copy-op'
+ */
+#define is_optimizable(arch_env, irn) (is_Phi(irn) || is_Copy(arch_env, irn))
+
+/**
+ * Checks if the irn is a non-interfering argument of a node which 'is_optimizable'
+ */
+int is_optimizable_arg(const copy_opt_t *co, ir_node *irn);
+
+/**
+ * Computes the costs of a copy according to loop depth
+ * @param root, arg: clear.
+ * @param pos: -1 for perm-copies.
+ * Else the argument position of arg in the phi node root.
+ * @return Must be >= 0 in all cases.
*/
-int co_get_lower_bound(copy_opt_t *co);
+int get_costs_loop_depth(ir_node *root, ir_node* arg, int pos);
/**
- * Returns the number of arguments interfering with their root node. This also
- * is a (worse) lower bound for the number of copies needed.
+ * All costs equal 1. Using this will reduce the number of copies.
+ * @return Must be >= 0 in all cases.
*/
-int co_get_interferer_count(copy_opt_t *co);
+int get_costs_all_one(ir_node *root, ir_node* arg, int pos);
+
+/**
+ * Returns the current costs the copies are causing
+ */
+int co_get_copy_costs(const copy_opt_t *co);
+
+/**
+ * Returns a lower bound for the costs of copies based on interfering
+ * arguments and the size of a max indep. set (only ifg-edges) of the other args.
+ */
+int co_get_lower_bound(const copy_opt_t *co);
/**
* Solves the problem using a heuristic approach
*/
void co_ilp_opt(copy_opt_t *co);
-/**
- * Checks the register allocation for correctness
- */
-void co_check_allocation(copy_opt_t *co);
-
#endif
projects / libfirm / blobdiff