projects
/
libfirm
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Remove the unused function fail_char().
[libfirm]
/
ir
/
kaps
/
heuristical.c
diff --git
a/ir/kaps/heuristical.c
b/ir/kaps/heuristical.c
index
c078f5d
..
0e57807
100644
(file)
--- a/
ir/kaps/heuristical.c
+++ b/
ir/kaps/heuristical.c
@@
-33,7
+33,7
@@
#include "bucket.h"
#include "heuristical.h"
#include "optimal.h"
#include "bucket.h"
#include "heuristical.h"
#include "optimal.h"
-#if
KAPS_DUMP
+#if KAPS_DUMP
#include "html_dumper.h"
#endif
#include "kaps.h"
#include "html_dumper.h"
#endif
#include "kaps.h"
@@
-55,10
+55,9
@@
static void apply_RN(pbqp_t *pbqp)
/* We want to reduce a node with maximum degree. */
node = get_node_with_max_degree();
/* We want to reduce a node with maximum degree. */
node = get_node_with_max_degree();
- assert(node);
assert(pbqp_node_get_degree(node) > 2);
assert(pbqp_node_get_degree(node) > 2);
-#if
KAPS_DUMP
+#if KAPS_DUMP
if (pbqp->dump_file) {
char txt[100];
sprintf(txt, "RN-Reduction of Node n%d", node->index);
if (pbqp->dump_file) {
char txt[100];
sprintf(txt, "RN-Reduction of Node n%d", node->index);
@@
-69,7
+68,7
@@
static void apply_RN(pbqp_t *pbqp)
min_index = get_local_minimal_alternative(pbqp, node);
min_index = get_local_minimal_alternative(pbqp, node);
-#if
KAPS_DUMP
+#if KAPS_DUMP
if (pbqp->dump_file) {
fprintf(pbqp->dump_file, "node n%d is set to %d<br><br>\n",
node->index, min_index);
if (pbqp->dump_file) {
fprintf(pbqp->dump_file, "node n%d is set to %d<br><br>\n",
node->index, min_index);