#define FIRM_BE_BECOPYILP_T_H
#include "firm_types.h"
-#include "pset.h"
#include "becopyopt_t.h"
-/******************************************************************************
- _____ _ _ _ _
- / ____(_) | | | | (_)
- | (___ _ _______ _ __ ___ __| |_ _ ___| |_ _ ___ _ __
- \___ \| |_ / _ \ | '__/ _ \/ _` | | | |/ __| __| |/ _ \| '_ \
- ____) | |/ / __/ | | | __/ (_| | |_| | (__| |_| | (_) | | | |
- |_____/|_/___\___| |_| \___|\__,_|\__,_|\___|\__|_|\___/|_| |_|
-
- *****************************************************************************/
-
-typedef struct coloring_suffix_t coloring_suffix_t;
-
-struct coloring_suffix_t {
- coloring_suffix_t *next;
- ir_node *irn;
-};
-
-typedef struct size_red_t {
- copy_opt_t *co;
- pset *all_removed; /**< All nodes removed during problem size reduction */
- coloring_suffix_t *col_suff; /**< Coloring suffix. Reverse would be a PEO prefix */
- struct obstack ob;
-} size_red_t;
-
-/**
- * Checks if a node has already been removed
- */
-#define sr_is_removed(sr, irn) pset_find_ptr((sr)->all_removed, irn)
-
-/**
- * TODO: This search is necessary because during the construction of the
- * units (ou's) args could be merged and weights are accumulated.
- * Is this necessary?
- */
-static inline int co_ilp_get_costs(copy_opt_t *co, ir_node *root, ir_node *arg) {
- int i;
-
- /* search optimization unit for phi */
- list_for_each_entry(unit_t, curr, &co->units, units)
- if (curr->nodes[0] == root) {
-
- for (i = 1; i < curr->node_count; ++i)
- if (curr->nodes[i] == arg)
- return curr->costs[i];
-
- assert(0 && "irn must occur in this ou");
- }
-
- assert(0 && "phi must be found in a ou");
- return 0;
-}
-
/******************************************************************************
_____ _ _____ _ _____
/ ____| (_) |_ _| | | __ \
typedef void(*ilp_callback)(ilp_env_t*);
struct ilp_env_t {
- const copy_opt_t *co; /**< the copy opt problem */
- size_red_t *sr; /**< problem size reduction. removes simple nodes */
- lpp_t *lp; /**< the linear programming problem */
+ copy_opt_t const *co; /**< the copy opt problem */
+ ir_node **col_suff; /**< Coloring suffix for size reduction. A PEO prefix. */
+ ir_nodeset_t all_removed; /**< All nodes removed during problem size reduction */
+ lpp_t *lp; /**< the linear programming problem */
void *env;
ilp_callback build;
ilp_callback apply;
void free_ilp_env(ilp_env_t *ienv);
+/**
+ * Checks if a node has already been removed
+ */
+static inline bool sr_is_removed(ilp_env_t const *const ienv, ir_node const *const irn)
+{
+ return ir_nodeset_contains(&ienv->all_removed, irn);
+}
+
#endif