-/******************************************************************************
- _____ _ _ _ _
- / ____(_) | | | | (_)
- | (___ _ _______ _ __ ___ __| |_ _ ___| |_ _ ___ _ __
- \___ \| |_ / _ \ | '__/ _ \/ _` | | | |/ __| __| |/ _ \| '_ \
- ____) | |/ / __/ | | | __/ (_| | |_| | (__| |_| | (_) | | | |
- |_____/|_/___\___| |_| \___|\__,_|\__,_|\___|\__|_|\___/|_| |_|
-
- *****************************************************************************/
-
-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;
-
-/**
- * Just prepare. Do nothing yet.
- */
-size_red_t *new_size_red(copy_opt_t *co);
-
-/**
- * Checks if a node has already been removed
- */
-#define sr_is_removed(sr, irn) pset_find_ptr((sr)->all_removed, irn)
-
-/**
- * Virtually remove all nodes not related to the problem
- * (simplicial AND not adjacent to a equal-color-edge)
- */
-void sr_remove(size_red_t *sr);
-
-/**
- * Virtually reinsert the nodes removed before and color them
- */
-void sr_reinsert(size_red_t *sr);
-
-/**
- * Free all space...
- */
-void free_size_red(size_red_t *sr);
-
-/**
- * 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;
- unit_t *curr;
-
- /* 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;
-}
-