/*
- * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
- *
* This file is part of libFirm.
- *
- * This file may be distributed and/or modified under the terms of the
- * GNU General Public License version 2 as published by the Free Software
- * Foundation and appearing in the file LICENSE.GPL included in the
- * packaging of this file.
- *
- * Licensees holding valid libFirm Professional Edition licenses may use
- * this file in accordance with the libFirm Commercial License.
- * Agreement provided with the Software.
- *
- * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
- * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE.
+ * Copyright (C) 2012 University of Karlsruhe.
*/
/**
* @brief Common stuff used by all ILP formulations.
* @author Daniel Grund
* @date 28.02.2006
- * @version $Id$
*/
#ifndef FIRM_BE_BECOPYILP_T_H
#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;
+ copy_opt_t *co;
+ ir_node **col_suff; /**< Coloring suffix. A PEO prefix. */
+ ir_nodeset_t all_removed; /**< All nodes removed during problem size reduction */
} 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);
+static inline bool sr_is_removed(size_red_t const *const sr, ir_node const *const irn)
+{
+ return ir_nodeset_contains(&sr->all_removed, irn);
+}
/**
* TODO: This search is necessary because during the construction of the
* 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;
+ int i;
/* search optimization unit for phi */
list_for_each_entry(unit_t, curr, &co->units, units)
void free_ilp_env(ilp_env_t *ienv);
-
-#define name_cdd(buf, char1, int1, int2) \
- (snprintf(buf, sizeof(buf), "%c_%d_%d", char1, int1, int2), buf)
-
-#define name_cdd_sorted(buf, char1, int1, int2) \
- name_cdd(buf, char1, MIN(int1, int2), MAX(int1, int2))
-
#endif