#include "pbqp_edge_t.h"
#include "pbqp_node_t.h"
+#include "heuristical.h"
#include "html_dumper.h"
#include "kaps.h"
#include "pbqp_t.h"
+/* Caution: Due to static buffer use only once per statement */
+static const char *cost2a(num const cost)
+{
+ static char buf[10];
+
+ if (cost == INF_COSTS) return "inf";
+ sprintf(buf, "%10lld", cost);
+ return buf;
+}
+
/* print vector */
static void dump_vector(FILE *f, vector *vec)
{
assert(len > 0);
for (index = 0; index < len; ++index) {
#if EXT_GRS_DEBUG
- fprintf(f, "<span title=\"%s\">%6d</span>", vec->entries[index].name,
- vec->entries[index].data);
+ fprintf(f, "<span title=\"%s\">%s</span> ",
+ vec->entries[index].name, cost2a(vec->entries[index].data));
#else
- fprintf(f, "%6d", vec->entries[index].data);
+ fprintf(f, "%s ", cost2a(vec->entries[index].data));
#endif
}
fprintf(f, " )</span>\n");
assert(mat->rows> 0);
fprintf(f, "\t\\begin{pmatrix}\n");
for (row = 0; row < mat->rows; ++row) {
- fprintf(f, "\t %6d", *p++);
+ fprintf(f, "\t %s", cost2a(*p++));
+
for (col = 1; col < mat->cols; ++col) {
- fprintf(f, "& %6d", *p++);
+ fprintf(f, "& %s", cost2a(*p++));
}
fprintf(f, "\\\\\n");
}
fprintf(f, "\t\\end{pmatrix}\n");
}
+void dump_edge(FILE *file, pbqp_edge *edge)
+{
+ fputs("<tex>\n", file);
+ fprintf(file, "\t\\overline\n{C}_{%d,%d}=\n",
+ edge->src->index, edge->tgt->index);
+ dump_matrix(file, edge->costs);
+ fputs("</tex><br>", file);
+}
+
static void dump_edge_costs(pbqp *pbqp)
{
unsigned src_index;
unsigned len = ARR_LEN(src_node->edges);
for (edge_index = 0; edge_index < len; ++edge_index) {
pbqp_edge *edge = src_node->edges[edge_index];
- unsigned tgt_index = edge->tgt;
+ unsigned tgt_index = edge->tgt->index;
if (src_index < tgt_index) {
- fputs("<tex>\n", pbqp->dump_file);
- fprintf(pbqp->dump_file, "\t\\overline\n{C}_{%d,%d}=\n",
- src_index, tgt_index);
- dump_matrix(pbqp->dump_file, edge->costs);
- fputs("</tex><br>", pbqp->dump_file);
+ dump_edge(pbqp->dump_file, edge);
}
}
}
fputs("</p>", pbqp->dump_file);
}
+void dump_node(FILE *file, pbqp_node *node)
+{
+ assert(file);
+
+ if (node) {
+ fprintf(file, "\tc<sub>%d</sub> = ", node->index);
+ dump_vector(file, node->costs);
+ fputs("<br>\n", file);
+ }
+}
+
static void dump_node_costs(pbqp *pbqp)
{
unsigned index;
/* dump node costs */
fputs("<p>", pbqp->dump_file);
for (index = 0; index < pbqp->num_nodes; ++index) {
- pbqp_node *node = get_node(pbqp, index);
- if (node) {
- fprintf(pbqp->dump_file, "\tc<sub>%d</sub> = ", index);
- dump_vector(pbqp->dump_file, node->costs);
- fputs("<br>\n", pbqp->dump_file);
- }
+ dump_node(pbqp->dump_file, get_node(pbqp, index));
}
fputs("</p>", pbqp->dump_file);
}
-static void dump_section(FILE *f, int level, char *txt)
+void dump_section(FILE *f, int level, char *txt)
{
assert(f);
fputs("<p>\n<graph>\n\tgraph input {\n", pbqp->dump_file);
for (src_index = 0; src_index < pbqp->num_nodes; ++src_index) {
pbqp_node *node = get_node(pbqp, src_index);
- if (node) {
+ if (node && !node_is_reduced(node)) {
fprintf(pbqp->dump_file, "\t n%d;\n", src_index);
}
}
if (!node)
continue;
+ if (node_is_reduced(node))
+ continue;
+
unsigned len = ARR_LEN(node->edges);
unsigned edge_index;
for (edge_index = 0; edge_index < len; ++edge_index) {
- unsigned tgt_index = node->edges[edge_index]->tgt;
+ pbqp_node *tgt_node = node->edges[edge_index]->tgt;
+ unsigned tgt_index = tgt_node->index;
+
+ if (node_is_reduced(tgt_node))
+ continue;
if (src_index < tgt_index) {
fprintf(pbqp->dump_file, "\t n%d -- n%d;\n", src_index,
fputs("\t}\n</graph>\n</p>\n", pbqp->dump_file);
}
-void dump_input(pbqp *pbqp)
+void pbqp_dump_input(pbqp *pbqp)
{
assert(pbqp);
assert(pbqp->dump_file);
dump_section(pbqp->dump_file, 2, "1.3 Cost Matrices");
dump_edge_costs(pbqp);
}
+
+void dump_simplifyedge(pbqp *pbqp, pbqp_edge *edge)
+{
+ assert(pbqp);
+ assert(pbqp->dump_file);
+
+ dump_node(pbqp->dump_file, edge->src);
+ dump_edge(pbqp->dump_file, edge);
+ dump_node(pbqp->dump_file, edge->tgt);
+}