node->costs->entries[node->solution].data);
if (pbqp->dump_file) {
fprintf(pbqp->dump_file, "node n%d is set to %d<br>\n", node->index, node->solution);
- dump_node(pbqp, node);
+ dump_node(pbqp->dump_file, node);
}
}
dump_section(pbqp->dump_file, 2, txt);
pbqp_dump_graph(pbqp);
fputs("<br>\nBefore reduction:<br>\n", pbqp->dump_file);
- dump_node(pbqp, node);
- dump_node(pbqp, other_node);
+ dump_node(pbqp->dump_file, node);
+ dump_node(pbqp->dump_file, other_node);
dump_edge(pbqp, edge);
}
if (pbqp->dump_file) {
fputs("<br>\nAfter reduction:<br>\n", pbqp->dump_file);
- dump_node(pbqp, other_node);
+ dump_node(pbqp->dump_file, other_node);
}
reorder_node(other_node);
dump_section(pbqp->dump_file, 2, txt);
pbqp_dump_graph(pbqp);
fputs("<br>\nBefore reduction:<br>\n", pbqp->dump_file);
- dump_node(pbqp, src_node);
+ dump_node(pbqp->dump_file, src_node);
dump_edge(pbqp, src_edge);
- dump_node(pbqp, node);
+ dump_node(pbqp->dump_file, node);
dump_edge(pbqp, tgt_edge);
- dump_node(pbqp, tgt_node);
+ dump_node(pbqp->dump_file, tgt_node);
}
src_mat = src_edge->costs;
fputs("</p>", pbqp->dump_file);
}
-void dump_node(pbqp *pbqp, pbqp_node *node)
+void dump_node(FILE *file, pbqp_node *node)
{
- assert(pbqp);
- assert(pbqp->dump_file);
+ assert(file);
if (node) {
- fprintf(pbqp->dump_file, "\tc<sub>%d</sub> = ", node->index);
- dump_vector(pbqp->dump_file, node->costs);
- fputs("<br>\n", pbqp->dump_file);
+ fprintf(file, "\tc<sub>%d</sub> = ", node->index);
+ dump_vector(file, node->costs);
+ fputs("<br>\n", file);
}
}
assert(pbqp);
assert(pbqp->dump_file);
- dump_node(pbqp, edge->src);
+ dump_node(pbqp->dump_file, edge->src);
dump_edge(pbqp, edge);
- dump_node(pbqp, edge->tgt);
+ dump_node(pbqp->dump_file, edge->tgt);
}
void dump_section(FILE *f, int level, char *txt);
-void dump_node(pbqp *pbqp, pbqp_node *node);
+void dump_node(FILE *file, pbqp_node *node);
void dump_edge(pbqp *pbqp, pbqp_edge *edge);
#endif /* KAPS_HTML_DUMPER_H */