Improved dump for RM.

[libfirm] / heuristical.h

diff --git a/heuristical.h b/heuristical.h
index 5ff812d..2e01649 100644 (file)
--- a/heuristical.h
+++ b/heuristical.h
@@ -1,16 +1,34 @@
-#ifndef KAPS_HEURISTICAL_H
-#define KAPS_HEURISTICAL_H
-
-#include "pbqp_t.h"
-
-/**
- * Create an empty PBQP instance with the given number of nodes.
+/*
+ * 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.
  */
-pbqp* alloc_pbqp(int number_nodes);
 
 /**
- * Free the given PBQP.
+ * @file
+ * @brief   Heuristic PBQP solver.
+ * @date    02.10.2008
+ * @author  Sebastian Buchwald
+ * @version $Id$
  */
-void free_pbqp(pbqp *pbqp);
+#ifndef KAPS_HEURISTICAL_CO_H
+#define KAPS_HEURISTICAL_CO_H
+
+#include "pbqp_t.h"
+
+void solve_pbqp_heuristical(pbqp *pbqp);
 
-#endif /* KAPS_HEURISTICAL_H */
+#endif /* KAPS_HEURISTICAL_CO_H */