CO_ALGO_LAST
};
-typedef struct _copy_opt_t copy_opt_t;
+typedef struct copy_opt_t copy_opt_t;
typedef int(*cost_fct_t)(const copy_opt_t *, ir_node *, ir_node *, int);
/**
- * Register a new copy optimazation algorithm.
+ * Register a new copy optimization algorithm.
*
* @param name the name of the copy optimazation algorithm,
* used to select it
- * @param spiller a copy optimazation entry
+ * @param copyopt a copy optimazation entry
*/
void be_register_copyopt(const char *name, co_algo_info *copyopt);
*/
int co_get_costs_all_one(const copy_opt_t *co, ir_node *root, ir_node* arg, int pos);
+#ifdef _MSC_VER
+typedef __int64 long64;
+typedef unsigned __int64 ulong64;
+
+#define LL_FMT "i64"
+#define ULL_FMT "ui64"
+
+#else
+typedef long long long64;
+typedef unsigned long long ulong64;
+
+#define LL_FMT "ll"
+#define ULL_FMT "llu"
+
+#endif
+
/**
* Statistics over a copy optimization module.
*/
*/
void co_free_graph_structure(copy_opt_t *co);
-/**
- * Solves the problem using mixed integer programming
- * @returns 1 iff solution state was optimal
- * NYI
- */
-int co_solve_ilp1(copy_opt_t *co, double time_limit);
-
/**
* Solves the problem using mixed integer programming
* @returns 1 iff solution state was optimal
*/
int co_gs_is_optimizable(copy_opt_t *co, ir_node *irn);
-#endif /* FIRM_BE_BECOPYOPT_H */
+#endif