implement aggregate returns according to sparc ABI

[libfirm] / ir / be / becopyilp_t.h

diff --git a/ir/be/becopyilp_t.h b/ir/be/becopyilp_t.h
index bfa8e69..5f31c12 100644 (file)
--- a/ir/be/becopyilp_t.h
+++ b/ir/be/becopyilp_t.h
@@ -41,14 +41,14 @@
 
  *****************************************************************************/
 
-typedef struct _coloring_suffix_t coloring_suffix_t;
+typedef struct coloring_suffix_t coloring_suffix_t;
 
-struct _coloring_suffix_t {
+struct coloring_suffix_t {
        coloring_suffix_t *next;
        ir_node           *irn;
 };
 
-typedef struct _size_red_t {
+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 */
@@ -63,7 +63,7 @@ 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)
+#define sr_is_removed(sr, irn)   pset_find_ptr((sr)->all_removed, irn)
 
 /**
  * Virtually remove all nodes not related to the problem
@@ -86,7 +86,7 @@ void free_size_red(size_red_t *sr);
  *       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) {
+static inline int co_ilp_get_costs(copy_opt_t *co, ir_node *root, ir_node *arg) {
        int    i;
        unit_t *curr;
 
@@ -115,24 +115,16 @@ static INLINE int co_ilp_get_costs(copy_opt_t *co, ir_node *root, ir_node *arg)
 
  *****************************************************************************/
 
-#ifdef WITH_ILP
-#include <lpp/lpp.h>
-
-#define LPP_SOLVE_NET
-
-#ifdef LPP_SOLVE_NET
-#  include <lpp/lpp_net.h>
-#else
-#  include <lpp/lpp_cplex.h>
-#endif
+#include "lpp.h"
+#include "lpp_net.h"
 
 #define EPSILON 0.00001
 
-typedef struct _ilp_env_t ilp_env_t;
+typedef struct ilp_env_t ilp_env_t;
 
 typedef void(*ilp_callback)(ilp_env_t*);
 
-struct _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 */
@@ -154,6 +146,4 @@ void free_ilp_env(ilp_env_t *ienv);
 #define name_cdd_sorted(buf, char1, int1, int2) \
                        name_cdd(buf, char1, MIN(int1, int2), MAX(int1, int2))
 
-#endif /* WITH_ILP */
-
-#endif /* FIRM_BE_BECOPYILP_T_H */
+#endif