summaryrefslogtreecommitdiffhomepage
path: root/ir/kaps
diff options
context:
space:
mode:
authorSebastian Buchwald <Sebastian.Buchwald@kit.edu>2013-01-23 13:38:08 +0100
committerSebastian Buchwald <Sebastian.Buchwald@kit.edu>2013-01-23 13:44:32 +0100
commitdbef7869098307a45e90b79fad5188abdf8c5e8d (patch)
tree29f087449d5d8afb1e5866d8d4d79055201e3fc2 /ir/kaps
parent851c750f109af0b04a2c565c6023b1dffa334585 (diff)
Fixed format specifiers.
Diffstat (limited to 'ir/kaps')
-rw-r--r--ir/kaps/brute_force.c8
-rw-r--r--ir/kaps/heuristical.c5
-rw-r--r--ir/kaps/heuristical_co.c5
-rw-r--r--ir/kaps/heuristical_co_ld.c8
-rw-r--r--ir/kaps/optimal.c16
5 files changed, 20 insertions, 22 deletions
diff --git a/ir/kaps/brute_force.c b/ir/kaps/brute_force.c
index 612974e..1b8bce8 100644
--- a/ir/kaps/brute_force.c
+++ b/ir/kaps/brute_force.c
@@ -131,7 +131,7 @@ static void apply_Brute_Force(pbqp_t *pbqp)
#if KAPS_DUMP
if (pbqp->dump_file) {
char txt[100];
- sprintf(txt, "BF-Reduction of Node n%d", node->index);
+ sprintf(txt, "BF-Reduction of Node n%u", node->index);
pbqp_dump_section(pbqp->dump_file, 2, txt);
pbqp_dump_graph(pbqp);
}
@@ -146,7 +146,7 @@ static void apply_Brute_Force(pbqp_t *pbqp)
#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);
+ fprintf(pbqp->dump_file, "node n%u is set to %u<br><br>\n", node->index, min_index);
}
#endif
@@ -190,7 +190,7 @@ static void back_propagate_RI(pbqp_t *pbqp, pbqp_node_t *node)
#if KAPS_DUMP
if (pbqp->dump_file) {
- fprintf(pbqp->dump_file, "node n%d is set to %d<br>\n", node->index, node->solution);
+ fprintf(pbqp->dump_file, "node n%u is set to %u<br>\n", node->index, node->solution);
}
#endif
}
@@ -257,7 +257,7 @@ static void back_propagate_RII(pbqp_t *pbqp, pbqp_node_t *node)
#if KAPS_DUMP
if (pbqp->dump_file) {
- fprintf(pbqp->dump_file, "node n%d is set to %d<br>\n", node->index, node->solution);
+ fprintf(pbqp->dump_file, "node n%u is set to %u<br>\n", node->index, node->solution);
}
#endif
diff --git a/ir/kaps/heuristical.c b/ir/kaps/heuristical.c
index bfdf72e..f17fbb6 100644
--- a/ir/kaps/heuristical.c
+++ b/ir/kaps/heuristical.c
@@ -40,7 +40,7 @@ static void apply_RN(pbqp_t *pbqp)
#if KAPS_DUMP
if (pbqp->dump_file) {
char txt[100];
- sprintf(txt, "RN-Reduction of Node n%d", node->index);
+ sprintf(txt, "RN-Reduction of Node n%u", node->index);
pbqp_dump_section(pbqp->dump_file, 2, txt);
pbqp_dump_graph(pbqp);
}
@@ -50,8 +50,7 @@ static void apply_RN(pbqp_t *pbqp)
#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);
+ fprintf(pbqp->dump_file, "node n%u is set to %u<br><br>\n", node->index, min_index);
}
#endif
diff --git a/ir/kaps/heuristical_co.c b/ir/kaps/heuristical_co.c
index 73bf97f..a967dad 100644
--- a/ir/kaps/heuristical_co.c
+++ b/ir/kaps/heuristical_co.c
@@ -63,7 +63,7 @@ static void apply_RN_co(pbqp_t *pbqp)
#if KAPS_DUMP
if (pbqp->dump_file) {
char txt[100];
- sprintf(txt, "RN-Reduction of Node n%d", node->index);
+ sprintf(txt, "RN-Reduction of Node n%u", node->index);
pbqp_dump_section(pbqp->dump_file, 2, txt);
pbqp_dump_graph(pbqp);
}
@@ -73,8 +73,7 @@ static void apply_RN_co(pbqp_t *pbqp)
#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);
+ fprintf(pbqp->dump_file, "node n%u is set to %u<br><br>\n", node->index, min_index);
}
#endif
diff --git a/ir/kaps/heuristical_co_ld.c b/ir/kaps/heuristical_co_ld.c
index b0efdd1..48e9607 100644
--- a/ir/kaps/heuristical_co_ld.c
+++ b/ir/kaps/heuristical_co_ld.c
@@ -46,7 +46,7 @@ static void back_propagate_RI(pbqp_t *pbqp, pbqp_node_t *node)
#if KAPS_DUMP
if (pbqp->dump_file) {
- fprintf(pbqp->dump_file, "node n%d is set to %d<br>\n", node->index, node->solution);
+ fprintf(pbqp->dump_file, "node n%u is set to %u<br>\n", node->index, node->solution);
}
#endif
}
@@ -110,7 +110,7 @@ static void back_propagate_RII(pbqp_t *pbqp, pbqp_node_t *node)
#if KAPS_DUMP
if (pbqp->dump_file) {
- fprintf(pbqp->dump_file, "node n%d is set to %d<br>\n", node->index, node->solution);
+ fprintf(pbqp->dump_file, "node n%u is set to %u<br>\n", node->index, node->solution);
}
#endif
@@ -139,7 +139,7 @@ static void back_propagate_RN(pbqp_t *pbqp, pbqp_node_t *node)
#if KAPS_DUMP
if (pbqp->dump_file) {
- fprintf(pbqp->dump_file, "node n%d is set to %d<br>\n", node->index, node->solution);
+ fprintf(pbqp->dump_file, "node n%u is set to %u<br>\n", node->index, node->solution);
}
#endif
@@ -205,7 +205,7 @@ static void apply_RN_co_without_selection(pbqp_t *pbqp)
#if KAPS_DUMP
if (pbqp->dump_file) {
char txt[100];
- sprintf(txt, "RN-Reduction of Node n%d", node->index);
+ sprintf(txt, "RN-Reduction of Node n%u", node->index);
pbqp_dump_section(pbqp->dump_file, 2, txt);
pbqp_dump_graph(pbqp);
}
diff --git a/ir/kaps/optimal.c b/ir/kaps/optimal.c
index 32c0c6a..c08b133 100644
--- a/ir/kaps/optimal.c
+++ b/ir/kaps/optimal.c
@@ -267,7 +267,7 @@ static void merge_source_into_target(pbqp_t *pbqp, pbqp_edge_t *edge)
#if KAPS_DUMP
if (pbqp->dump_file) {
char txt[100];
- sprintf(txt, "Merging n%d into n%d", src_node->index, tgt_node->index);
+ sprintf(txt, "Merging n%u into n%u", src_node->index, tgt_node->index);
pbqp_dump_section(pbqp->dump_file, 3, txt);
}
#endif
@@ -408,7 +408,7 @@ static void merge_target_into_source(pbqp_t *pbqp, pbqp_edge_t *edge)
#if KAPS_DUMP
if (pbqp->dump_file) {
char txt[100];
- sprintf(txt, "Merging n%d into n%d", tgt_node->index, src_node->index);
+ sprintf(txt, "Merging n%u into n%u", tgt_node->index, src_node->index);
pbqp_dump_section(pbqp->dump_file, 3, txt);
}
#endif
@@ -578,7 +578,7 @@ void simplify_edge(pbqp_t *pbqp, pbqp_edge_t *edge)
#if KAPS_DUMP
if (pbqp->dump_file) {
char txt[100];
- sprintf(txt, "Simplification of Edge n%d-n%d", src_node->index, tgt_node->index);
+ sprintf(txt, "Simplification of Edge n%u-n%u", src_node->index, tgt_node->index);
pbqp_dump_section(pbqp->dump_file, 3, txt);
}
#endif
@@ -702,7 +702,7 @@ num determine_solution(pbqp_t *pbqp)
#if KAPS_DUMP
if (file) {
- fprintf(file, "node n%d is set to %d<br>\n", node->index, node->solution);
+ fprintf(file, "node n%u is set to %u<br>\n", node->index, node->solution);
pbqp_dump_node(file, node);
}
#endif
@@ -746,7 +746,7 @@ static void back_propagate_RI(pbqp_t *pbqp, pbqp_node_t *node)
#if KAPS_DUMP
if (pbqp->dump_file) {
- fprintf(pbqp->dump_file, "node n%d is set to %d<br>\n", node->index, node->solution);
+ fprintf(pbqp->dump_file, "node n%u is set to %u<br>\n", node->index, node->solution);
}
#endif
}
@@ -811,7 +811,7 @@ static void back_propagate_RII(pbqp_t *pbqp, pbqp_node_t *node)
#if KAPS_DUMP
if (pbqp->dump_file) {
- fprintf(pbqp->dump_file, "node n%d is set to %d<br>\n", node->index, node->solution);
+ fprintf(pbqp->dump_file, "node n%u is set to %u<br>\n", node->index, node->solution);
}
#endif
@@ -871,7 +871,7 @@ void apply_RI(pbqp_t *pbqp)
#if KAPS_DUMP
if (pbqp->dump_file) {
char txt[100];
- sprintf(txt, "RI-Reduction of Node n%d", node->index);
+ sprintf(txt, "RI-Reduction of Node n%u", node->index);
pbqp_dump_section(pbqp->dump_file, 2, txt);
pbqp_dump_graph(pbqp);
fputs("<br>\nBefore reduction:<br>\n", pbqp->dump_file);
@@ -952,7 +952,7 @@ void apply_RII(pbqp_t *pbqp)
#if KAPS_DUMP
if (pbqp->dump_file) {
char txt[100];
- sprintf(txt, "RII-Reduction of Node n%d", node->index);
+ sprintf(txt, "RII-Reduction of Node n%u", node->index);
pbqp_dump_section(pbqp->dump_file, 2, txt);
pbqp_dump_graph(pbqp);
fputs("<br>\nBefore reduction:<br>\n", pbqp->dump_file);