X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbecopyopt.h;h=6646e5d01f228d619d13b2c52c02bd8765b738e0;hb=10d435353850d6f7c858e5b9e71fb06443855d95;hp=38d5a2c8717ed1467a6b7e4874859b6ce72da749;hpb=ab182d4b9ed44239ab3ff1d08b2f8e14a3699ccf;p=libfirm

diff --git a/ir/be/becopyopt.h b/ir/be/becopyopt.h
index 38d5a2c87..6646e5d01 100644
--- a/ir/be/becopyopt.h
+++ b/ir/be/becopyopt.h
@@ -57,9 +57,7 @@ enum {
 	CO_ALGO_HEUR2,
 	CO_ALGO_HEUR4,
 	CO_ALGO_ILP,
-#ifdef FIRM_KAPS
 	CO_ALGO_PBQP,
-#endif
 	CO_ALGO_LAST
 };
 
@@ -101,15 +99,15 @@ void free_copy_opt(copy_opt_t *co);
 /**
  * Computes the costs of a copy according to loop depth
  * @param co   The copy opt object.
- * @param pos	the argument position of arg in the root arguments
- * @return Must be >= 0 in all cases.
+ * @param pos  the argument position of arg in the root arguments
+ * @return     Must be >= 0 in all cases.
  */
 int co_get_costs_loop_depth(const copy_opt_t *co, ir_node *root, ir_node* arg, int pos);
 
 /**
  * Computes the costs of a copy according to execution frequency
  * @param co   The copy opt object.
- * @param pos	the argument position of arg in the root arguments
+ * @param pos  the argument position of arg in the root arguments
  * @return Must be >= 0 in all cases.
  */
 int co_get_costs_exec_freq(const copy_opt_t *co, ir_node *root, ir_node* arg, int pos);
@@ -125,15 +123,15 @@ int co_get_costs_all_one(const copy_opt_t *co, ir_node *root, ir_node* arg, int
 typedef          __int64 long64;
 typedef unsigned __int64 ulong64;
 
-#define LL_FMT	"i64"
-#define ULL_FMT	"ui64"
+#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"
+#define LL_FMT   "ll"
+#define ULL_FMT  "llu"
 
 #endif
 
@@ -252,13 +250,6 @@ void co_build_graph_structure(copy_opt_t *co);
  */
 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
@@ -273,4 +264,4 @@ int co_solve_ilp2(copy_opt_t *co);
  */
 int co_gs_is_optimizable(copy_opt_t *co, ir_node *irn);
 
-#endif /* FIRM_BE_BECOPYOPT_H */
+#endif