projects
/
libfirm
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
sparc: implement 64bit lowering
[libfirm]
/
ir
/
kaps
/
heuristical_co.c
diff --git
a/ir/kaps/heuristical_co.c
b/ir/kaps/heuristical_co.c
index
aa30729
..
a61740c
100644
(file)
--- a/
ir/kaps/heuristical_co.c
+++ b/
ir/kaps/heuristical_co.c
@@
-33,7
+33,7
@@
#include "bucket.h"
#include "heuristical_co.h"
#include "optimal.h"
#include "bucket.h"
#include "heuristical_co.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"
@@
-63,7
+63,6
@@
static void merge_into_RN_node(pbqp_t *pbqp, plist_t *rpeo)
plist_insert_back(rpeo, node);
} while(node_is_reduced(node));
plist_insert_back(rpeo, node);
} while(node_is_reduced(node));
- assert(node);
assert(pbqp_node_get_degree(node) > 2);
/* Check whether we can merge a neighbor into the current node. */
assert(pbqp_node_get_degree(node) > 2);
/* Check whether we can merge a neighbor into the current node. */
@@
-79,12
+78,11
@@
static void apply_RN_co(pbqp_t *pbqp)
node = merged_node;
merged_node = NULL;
node = merged_node;
merged_node = NULL;
- assert(node);
if (node_is_reduced(node))
return;
if (node_is_reduced(node))
return;
-#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);
@@
-95,7
+93,7
@@
static void apply_RN_co(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);