4 #include "pbqp_edge_t.h"
5 #include "pbqp_node_t.h"
6 #include "heuristical.h"
7 #include "html_dumper.h"
10 /* Caution: Due to static buffer use only once per statement */
11 static const char *cost2a(num const cost)
15 if (cost == INF_COSTS) return "inf";
16 sprintf(buf, "%10lld", cost);
21 static void dump_vector(FILE *f, vector *vec)
26 fprintf(f, "<span class=\"vector\">( ");
27 unsigned len = vec->len;
29 for (index = 0; index < len; ++index) {
30 #if KAPS_ENABLE_VECTOR_NAMES
31 fprintf(f, "<span title=\"%s\">%s</span> ",
32 vec->entries[index].name, cost2a(vec->entries[index].data));
34 fprintf(f, "%s ", cost2a(vec->entries[index].data));
37 fprintf(f, " )</span>\n");
40 static void dump_matrix(FILE *f, pbqp_matrix *mat)
44 num *p = mat->entries;
48 fprintf(f, "\t\\begin{pmatrix}\n");
49 for (row = 0; row < mat->rows; ++row) {
50 fprintf(f, "\t %s", cost2a(*p++));
52 for (col = 1; col < mat->cols; ++col) {
53 fprintf(f, "& %s", cost2a(*p++));
57 fprintf(f, "\t\\end{pmatrix}\n");
60 void dump_edge(FILE *file, pbqp_edge *edge)
62 fputs("<tex>\n", file);
63 fprintf(file, "\t\\overline\n{C}_{%d,%d}=\n",
64 edge->src->index, edge->tgt->index);
65 dump_matrix(file, edge->costs);
66 fputs("</tex><br>", file);
69 static void dump_edge_costs(pbqp *pbqp)
74 assert(pbqp->dump_file);
76 fputs("<p>", pbqp->dump_file);
77 for (src_index = 0; src_index < pbqp->num_nodes; ++src_index) {
78 pbqp_node *src_node = get_node(pbqp, src_index);
84 unsigned len = ARR_LEN(src_node->edges);
85 for (edge_index = 0; edge_index < len; ++edge_index) {
86 pbqp_edge *edge = src_node->edges[edge_index];
87 unsigned tgt_index = edge->tgt->index;
88 if (src_index < tgt_index) {
89 dump_edge(pbqp->dump_file, edge);
93 fputs("</p>", pbqp->dump_file);
96 void dump_node(FILE *file, pbqp_node *node)
101 fprintf(file, "\tc<sub>%d</sub> = ", node->index);
102 dump_vector(file, node->costs);
103 fputs("<br>\n", file);
107 static void dump_node_costs(pbqp *pbqp)
112 assert(pbqp->dump_file);
114 /* dump node costs */
115 fputs("<p>", pbqp->dump_file);
116 for (index = 0; index < pbqp->num_nodes; ++index) {
117 dump_node(pbqp->dump_file, get_node(pbqp, index));
119 fputs("</p>", pbqp->dump_file);
122 void dump_section(FILE *f, int level, char *txt)
126 fprintf(f, "<h%d>%s</h%d>\n", level, txt, level);
129 void pbqp_dump_graph(pbqp *pbqp)
134 assert(pbqp->dump_file);
136 fputs("<p>\n<graph>\n\tgraph input {\n", pbqp->dump_file);
137 for (src_index = 0; src_index < pbqp->num_nodes; ++src_index) {
138 pbqp_node *node = get_node(pbqp, src_index);
139 if (node && !node_is_reduced(node)) {
140 fprintf(pbqp->dump_file, "\t n%d;\n", src_index);
144 for (src_index = 0; src_index < pbqp->num_nodes; ++src_index) {
145 pbqp_node *node = get_node(pbqp, src_index);
150 if (node_is_reduced(node))
153 unsigned len = ARR_LEN(node->edges);
155 for (edge_index = 0; edge_index < len; ++edge_index) {
156 pbqp_node *tgt_node = node->edges[edge_index]->tgt;
157 unsigned tgt_index = tgt_node->index;
159 if (node_is_reduced(tgt_node))
162 if (src_index < tgt_index) {
163 fprintf(pbqp->dump_file, "\t n%d -- n%d;\n", src_index,
168 fputs("\t}\n</graph>\n</p>\n", pbqp->dump_file);
171 void pbqp_dump_input(pbqp *pbqp)
174 assert(pbqp->dump_file);
176 dump_section(pbqp->dump_file, 1, "1. PBQP Problem");
177 dump_section(pbqp->dump_file, 2, "1.1 Topology");
178 pbqp_dump_graph(pbqp);
179 dump_section(pbqp->dump_file, 2, "1.2 Cost Vectors");
180 dump_node_costs(pbqp);
181 dump_section(pbqp->dump_file, 2, "1.3 Cost Matrices");
182 dump_edge_costs(pbqp);
185 void dump_simplifyedge(pbqp *pbqp, pbqp_edge *edge)
188 assert(pbqp->dump_file);
190 dump_node(pbqp->dump_file, edge->src);
191 dump_edge(pbqp->dump_file, edge);
192 dump_node(pbqp->dump_file, edge->tgt);