2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Optimal reductions and helper functions.
24 * @author Sebastian Buchwald
29 #include "adt/array.h"
35 #include "html_dumper.h"
40 #include "pbqp_edge.h"
41 #include "pbqp_edge_t.h"
42 #include "pbqp_node.h"
43 #include "pbqp_node_t.h"
49 pbqp_edge **edge_bucket;
50 pbqp_node **node_buckets[4];
51 pbqp_node **reduced_bucket = NULL;
52 static int buckets_filled = 0;
58 static void insert_into_edge_bucket(pbqp_edge *edge)
60 if (edge_bucket_contains(edge_bucket, edge)) {
61 /* Edge is already inserted. */
65 edge_bucket_insert(&edge_bucket, edge);
68 static void init_buckets(void)
72 edge_bucket_init(&edge_bucket);
73 node_bucket_init(&reduced_bucket);
75 for (i = 0; i < 4; ++i) {
76 node_bucket_init(&node_buckets[i]);
80 void free_buckets(void)
84 for (i = 0; i < 4; ++i) {
85 node_bucket_free(&node_buckets[i]);
88 edge_bucket_free(&edge_bucket);
89 node_bucket_free(&reduced_bucket);
94 void fill_node_buckets(pbqp *pbqp)
100 node_len = pbqp->num_nodes;
103 ir_timer_t *t_fill_buckets = ir_timer_register("be_pbqp_fill_buckets", "PBQP Fill Nodes into buckets");
104 ir_timer_reset_and_start(t_fill_buckets);
107 for (node_index = 0; node_index < node_len; ++node_index) {
109 pbqp_node *node = get_node(pbqp, node_index);
113 degree = pbqp_node_get_degree(node);
115 /* We have only one bucket for nodes with arity >= 3. */
120 node_bucket_insert(&node_buckets[degree], node);
126 ir_timer_stop(t_fill_buckets);
127 printf("%-20s: %8.3lf msec\n", ir_timer_get_description(t_fill_buckets), (double)ir_timer_elapsed_usec(t_fill_buckets) / 1000.0);
131 static void normalize_towards_source(pbqp *pbqp, pbqp_edge *edge)
145 src_node = edge->src;
146 tgt_node = edge->tgt;
150 src_vec = src_node->costs;
151 tgt_vec = tgt_node->costs;
155 src_len = src_vec->len;
156 tgt_len = tgt_vec->len;
163 /* Normalize towards source node. */
164 for (src_index = 0; src_index < src_len; ++src_index) {
165 num min = pbqp_matrix_get_row_min(mat, src_index, tgt_vec);
168 if (src_vec->entries[src_index].data == INF_COSTS) {
169 pbqp_matrix_set_row_value(mat, src_index, 0);
171 pbqp_matrix_sub_row_value(mat, src_index, tgt_vec, min);
173 src_vec->entries[src_index].data = pbqp_add(
174 src_vec->entries[src_index].data, min);
176 if (min == INF_COSTS) {
178 unsigned edge_len = pbqp_node_get_degree(src_node);
180 for (edge_index = 0; edge_index < edge_len; ++edge_index) {
181 pbqp_edge *edge_candidate = src_node->edges[edge_index];
182 if (edge_candidate != edge) {
183 insert_into_edge_bucket(edge_candidate);
191 static void normalize_towards_target(pbqp *pbqp, pbqp_edge *edge)
205 src_node = edge->src;
206 tgt_node = edge->tgt;
210 src_vec = src_node->costs;
211 tgt_vec = tgt_node->costs;
215 src_len = src_vec->len;
216 tgt_len = tgt_vec->len;
223 for (tgt_index = 0; tgt_index < tgt_len; ++tgt_index) {
224 num min = pbqp_matrix_get_col_min(mat, tgt_index, src_vec);
227 if (tgt_vec->entries[tgt_index].data == INF_COSTS) {
228 pbqp_matrix_set_col_value(mat, tgt_index, 0);
230 pbqp_matrix_sub_col_value(mat, tgt_index, src_vec, min);
232 tgt_vec->entries[tgt_index].data = pbqp_add(
233 tgt_vec->entries[tgt_index].data, min);
235 if (min == INF_COSTS) {
237 unsigned edge_len = pbqp_node_get_degree(tgt_node);
239 for (edge_index = 0; edge_index < edge_len; ++edge_index) {
240 pbqp_edge *edge_candidate = tgt_node->edges[edge_index];
241 if (edge_candidate != edge) {
242 insert_into_edge_bucket(edge_candidate);
250 static void reorder_node(pbqp_node *node)
252 unsigned degree = pbqp_node_get_degree(node);
253 /* Assume node lost one incident edge. */
254 unsigned old_degree = degree + 1;
256 if (!buckets_filled) return;
258 /* Same bucket as before */
259 if (degree > 2) return;
261 if (!node_bucket_contains(node_buckets[old_degree], node)) {
262 /* Old arity is new arity, so we have nothing to do. */
263 assert(node_bucket_contains(node_buckets[degree], node));
267 /* Delete node from old bucket... */
268 node_bucket_remove(&node_buckets[old_degree], node);
270 /* ..and add to new one. */
271 node_bucket_insert(&node_buckets[degree], node);
275 static void check_melting_possibility(pbqp *pbqp, pbqp_edge *edge)
290 src_node = edge->src;
291 tgt_node = edge->tgt;
295 src_vec = src_node->costs;
296 tgt_vec = tgt_node->costs;
300 src_len = src_vec->len;
301 tgt_len = tgt_vec->len;
308 if (src_len == 1 && tgt_len == 1) {
309 //panic("Something is wrong");
313 for (src_index = 0; src_index < src_len; ++src_index) {
315 if (src_vec->entries[src_index].data == INF_COSTS) {
318 for (tgt_index = 0; tgt_index < tgt_len; ++tgt_index) {
319 if (tgt_vec->entries[tgt_index].data == INF_COSTS) {
322 if (mat->entries[src_index * tgt_len + tgt_index] == 0) {
331 if (mat->entries[src_index * tgt_len + tgt_index] == INF_COSTS) {
337 allRowsOk &= onlyOneZero;
341 for (tgt_index = 0; tgt_index < tgt_len; ++tgt_index) {
343 if (tgt_vec->entries[tgt_index].data == INF_COSTS) {
346 for (src_index = 0; src_index < src_len; ++src_index) {
347 if (src_vec->entries[src_index].data == INF_COSTS) {
350 if (mat->entries[src_index * tgt_len + tgt_index] == 0) {
359 if (mat->entries[src_index * tgt_len + tgt_index] == INF_COSTS) {
365 allColsOk &= onlyOneZero;
368 if (allRowsOk && allColsOk) {
374 void simplify_edge(pbqp *pbqp, pbqp_edge *edge)
387 src_node = edge->src;
388 tgt_node = edge->tgt;
392 /* If edge are already deleted, we have nothing to do. */
393 if (!is_connected(src_node, edge) || !is_connected(tgt_node, edge))
397 if (pbqp->dump_file) {
399 sprintf(txt, "Simplification of Edge n%d-n%d", src_node->index, tgt_node->index);
400 dump_section(pbqp->dump_file, 3, txt);
404 src_vec = src_node->costs;
405 tgt_vec = tgt_node->costs;
409 src_len = src_vec->len;
410 tgt_len = tgt_vec->len;
418 if (pbqp->dump_file) {
419 fputs("Input:<br>\n", pbqp->dump_file);
420 dump_simplifyedge(pbqp, edge);
424 normalize_towards_source(pbqp, edge);
425 normalize_towards_target(pbqp, edge);
428 if (pbqp->dump_file) {
429 fputs("<br>\nOutput:<br>\n", pbqp->dump_file);
430 dump_simplifyedge(pbqp, edge);
434 if (pbqp_matrix_is_zero(mat, src_vec, tgt_vec)) {
436 if (pbqp->dump_file) {
437 fputs("edge has been eliminated<br>\n", pbqp->dump_file);
448 reorder_node(src_node);
449 reorder_node(tgt_node);
453 void initial_simplify_edges(pbqp *pbqp)
461 ir_timer_t *t_int_simpl = ir_timer_register("be_pbqp_init_simp", "PBQP Initial simplify edges");
462 ir_timer_reset_and_start(t_int_simpl);
466 if (pbqp->dump_file) {
467 pbqp_dump_input(pbqp);
468 dump_section(pbqp->dump_file, 1, "2. Simplification of Cost Matrices");
472 node_len = pbqp->num_nodes;
476 /* First simplify all edges. */
477 for (node_index = 0; node_index < node_len; ++node_index) {
479 pbqp_node *node = get_node(pbqp, node_index);
486 edge_len = pbqp_node_get_degree(node);
488 for (edge_index = 0; edge_index < edge_len; ++edge_index) {
489 pbqp_edge *edge = edges[edge_index];
491 /* Simplify only once per edge. */
492 if (node != edge->src) continue;
494 simplify_edge(pbqp, edge);
499 ir_timer_stop(t_int_simpl);
500 printf("%-20s: %8.3lf msec\n", ir_timer_get_description(t_int_simpl), (double)ir_timer_elapsed_usec(t_int_simpl) / 1000.0);
504 num determine_solution(pbqp *pbqp)
511 ir_timer_t *t_det_solution = ir_timer_register("be_det_solution", "PBQP Determine Solution");
512 ir_timer_reset_and_start(t_det_solution);
522 file = pbqp->dump_file;
525 dump_section(file, 1, "4. Determine Solution/Minimum");
526 dump_section(file, 2, "4.1. Trivial Solution");
530 /* Solve trivial nodes and calculate solution. */
531 node_len = node_bucket_get_length(node_buckets[0]);
535 pbqp->num_r0 = node_len;
539 for (node_index = 0; node_index < node_len; ++node_index) {
540 pbqp_node *node = node_buckets[0][node_index];
543 node->solution = vector_get_min_index(node->costs);
544 solution = pbqp_add(solution,
545 node->costs->entries[node->solution].data);
549 fprintf(file, "node n%d is set to %d<br>\n", node->index, node->solution);
550 dump_node(file, node);
557 dump_section(file, 2, "Minimum");
558 #if KAPS_USE_UNSIGNED
559 fprintf(file, "Minimum is equal to %u.", solution);
561 fprintf(file, "Minimum is equal to %lld.", solution);
567 ir_timer_stop(t_det_solution);
568 printf("%-20s: %8.3lf msec\n", ir_timer_get_description(t_det_solution), (double)ir_timer_elapsed_usec(t_det_solution) / 1000.0);
574 static void back_propagate_RI(pbqp *pbqp, pbqp_node *node)
585 edge = node->edges[0];
587 is_src = edge->src == node;
594 /* Update pointer for brute force solver. */
595 other = pbqp->nodes[other->index];
597 node->solution = pbqp_matrix_get_col_min_index(mat, other->solution, vec);
602 /* Update pointer for brute force solver. */
603 other = pbqp->nodes[other->index];
605 node->solution = pbqp_matrix_get_row_min_index(mat, other->solution, vec);
609 if (pbqp->dump_file) {
610 fprintf(pbqp->dump_file, "node n%d is set to %d<br>\n", node->index, node->solution);
615 static void back_propagate_RII(pbqp *pbqp, pbqp_node *node)
617 pbqp_edge *src_edge = node->edges[0];
618 pbqp_edge *tgt_edge = node->edges[1];
619 int src_is_src = src_edge->src == node;
620 int tgt_is_src = tgt_edge->src == node;
621 pbqp_matrix *src_mat;
622 pbqp_matrix *tgt_mat;
633 src_node = src_edge->tgt;
635 src_node = src_edge->src;
639 tgt_node = tgt_edge->tgt;
641 tgt_node = tgt_edge->src;
644 /* Swap nodes if necessary. */
645 if (tgt_node->index < src_node->index) {
657 src_is_src = src_edge->src == node;
658 tgt_is_src = tgt_edge->src == node;
661 /* Update pointer for brute force solver. */
662 src_node = pbqp->nodes[src_node->index];
663 tgt_node = pbqp->nodes[tgt_node->index];
665 src_mat = src_edge->costs;
666 tgt_mat = tgt_edge->costs;
668 node_vec = node->costs;
670 row_index = src_node->solution;
671 col_index = tgt_node->solution;
673 vec = vector_copy(pbqp, node_vec);
676 vector_add_matrix_col(vec, src_mat, row_index);
678 vector_add_matrix_row(vec, src_mat, row_index);
682 vector_add_matrix_col(vec, tgt_mat, col_index);
684 vector_add_matrix_row(vec, tgt_mat, col_index);
687 node->solution = vector_get_min_index(vec);
690 if (pbqp->dump_file) {
691 fprintf(pbqp->dump_file, "node n%d is set to %d<br>\n", node->index, node->solution);
695 obstack_free(&pbqp->obstack, vec);
698 void back_propagate(pbqp *pbqp)
701 unsigned node_len = node_bucket_get_length(reduced_bucket);
706 if (pbqp->dump_file) {
707 dump_section(pbqp->dump_file, 2, "Back Propagation");
711 for (node_index = node_len; node_index > 0; --node_index) {
712 pbqp_node *node = reduced_bucket[node_index - 1];
714 switch (pbqp_node_get_degree(node)) {
716 back_propagate_RI(pbqp, node);
719 back_propagate_RII(pbqp, node);
722 panic("Only nodes with degree one or two should be in this bucket");
728 void apply_edge(pbqp *pbqp)
730 pbqp_edge *edge = edge_bucket_pop(&edge_bucket);
732 simplify_edge(pbqp, edge);
735 void apply_RI(pbqp *pbqp)
737 pbqp_node *node = node_bucket_pop(&node_buckets[1]);
738 pbqp_edge *edge = node->edges[0];
739 pbqp_matrix *mat = edge->costs;
740 int is_src = edge->src == node;
741 pbqp_node *other_node;
743 assert(pbqp_node_get_degree(node) == 1);
746 other_node = edge->tgt;
748 other_node = edge->src;
752 if (pbqp->dump_file) {
754 sprintf(txt, "RI-Reduction of Node n%d", node->index);
755 dump_section(pbqp->dump_file, 2, txt);
756 pbqp_dump_graph(pbqp);
757 fputs("<br>\nBefore reduction:<br>\n", pbqp->dump_file);
758 dump_node(pbqp->dump_file, node);
759 dump_node(pbqp->dump_file, other_node);
760 dump_edge(pbqp->dump_file, edge);
765 pbqp_matrix_add_to_all_cols(mat, node->costs);
766 normalize_towards_target(pbqp, edge);
768 pbqp_matrix_add_to_all_rows(mat, node->costs);
769 normalize_towards_source(pbqp, edge);
771 disconnect_edge(other_node, edge);
774 if (pbqp->dump_file) {
775 fputs("<br>\nAfter reduction:<br>\n", pbqp->dump_file);
776 dump_node(pbqp->dump_file, other_node);
780 reorder_node(other_node);
788 /* Add node to back propagation list. */
789 node_bucket_insert(&reduced_bucket, node);
792 void apply_RII(pbqp *pbqp)
794 pbqp_node *node = node_bucket_pop(&node_buckets[2]);
795 pbqp_edge *src_edge = node->edges[0];
796 pbqp_edge *tgt_edge = node->edges[1];
797 int src_is_src = src_edge->src == node;
798 int tgt_is_src = tgt_edge->src == node;
799 pbqp_matrix *src_mat;
800 pbqp_matrix *tgt_mat;
815 assert(pbqp_node_get_degree(node) == 2);
818 src_node = src_edge->tgt;
820 src_node = src_edge->src;
824 tgt_node = tgt_edge->tgt;
826 tgt_node = tgt_edge->src;
829 /* Swap nodes if necessary. */
830 if (tgt_node->index < src_node->index) {
842 src_is_src = src_edge->src == node;
843 tgt_is_src = tgt_edge->src == node;
847 if (pbqp->dump_file) {
849 sprintf(txt, "RII-Reduction of Node n%d", node->index);
850 dump_section(pbqp->dump_file, 2, txt);
851 pbqp_dump_graph(pbqp);
852 fputs("<br>\nBefore reduction:<br>\n", pbqp->dump_file);
853 dump_node(pbqp->dump_file, src_node);
854 dump_edge(pbqp->dump_file, src_edge);
855 dump_node(pbqp->dump_file, node);
856 dump_edge(pbqp->dump_file, tgt_edge);
857 dump_node(pbqp->dump_file, tgt_node);
861 src_mat = src_edge->costs;
862 tgt_mat = tgt_edge->costs;
864 src_vec = src_node->costs;
865 tgt_vec = tgt_node->costs;
866 node_vec = node->costs;
868 row_len = src_vec->len;
869 col_len = tgt_vec->len;
870 node_len = node_vec->len;
872 mat = pbqp_matrix_alloc(pbqp, row_len, col_len);
874 for (row_index = 0; row_index < row_len; ++row_index) {
875 for (col_index = 0; col_index < col_len; ++col_index) {
876 vec = vector_copy(pbqp, node_vec);
879 vector_add_matrix_col(vec, src_mat, row_index);
881 vector_add_matrix_row(vec, src_mat, row_index);
885 vector_add_matrix_col(vec, tgt_mat, col_index);
887 vector_add_matrix_row(vec, tgt_mat, col_index);
890 mat->entries[row_index * col_len + col_index] = vector_get_min(vec);
892 obstack_free(&pbqp->obstack, vec);
896 pbqp_edge *edge = get_edge(pbqp, src_node->index, tgt_node->index);
898 /* Disconnect node. */
899 disconnect_edge(src_node, src_edge);
900 disconnect_edge(tgt_node, tgt_edge);
908 /* Add node to back propagation list. */
909 node_bucket_insert(&reduced_bucket, node);
912 edge = alloc_edge(pbqp, src_node->index, tgt_node->index, mat);
915 pbqp_matrix_add(edge->costs, mat);
917 /* Free local matrix. */
918 obstack_free(&pbqp->obstack, mat);
920 reorder_node(src_node);
921 reorder_node(tgt_node);
925 if (pbqp->dump_file) {
926 fputs("<br>\nAfter reduction:<br>\n", pbqp->dump_file);
927 dump_edge(pbqp->dump_file, edge);
931 /* Edge has changed so we simplify it. */
932 simplify_edge(pbqp, edge);
935 void select_alternative(pbqp_node *node, unsigned selected_index)
941 unsigned max_degree = pbqp_node_get_degree(node);
944 node->solution = selected_index;
945 node_vec = node->costs;
946 node_len = node_vec->len;
947 assert(selected_index < node_len);
949 /* Set all other costs to infinity. */
950 for (node_index = 0; node_index < node_len; ++node_index) {
951 if (node_index != selected_index) {
952 node_vec->entries[node_index].data = INF_COSTS;
956 /* Add all incident edges to edge bucket, since they are now independent. */
957 for (edge_index = 0; edge_index < max_degree; ++edge_index) {
958 insert_into_edge_bucket(node->edges[edge_index]);
962 pbqp_node *get_node_with_max_degree(void)
964 pbqp_node **bucket = node_buckets[3];
965 unsigned bucket_len = node_bucket_get_length(bucket);
966 unsigned bucket_index;
967 unsigned max_degree = 0;
968 pbqp_node *result = NULL;
970 for (bucket_index = 0; bucket_index < bucket_len; ++bucket_index) {
971 pbqp_node *candidate = bucket[bucket_index];
972 unsigned degree = pbqp_node_get_degree(candidate);
974 if (degree > max_degree) {
983 unsigned get_local_minimal_alternative(pbqp *pbqp, pbqp_node *node)
990 unsigned max_degree = 0;
993 unsigned min_index = 0;
999 node_vec = node->costs;
1000 node_len = node_vec->len;
1002 for (node_index = 0; node_index < node_len; ++node_index) {
1003 num value = node_vec->entries[node_index].data;
1005 for (edge_index = 0; edge_index < max_degree; ++edge_index) {
1006 edge = node->edges[edge_index];
1008 is_src = edge->src == node;
1011 vec = vector_copy(pbqp, edge->tgt->costs);
1012 vector_add_matrix_row(vec, mat, node_index);
1014 vec = vector_copy(pbqp, edge->src->costs);
1015 vector_add_matrix_col(vec, mat, node_index);
1018 value = pbqp_add(value, vector_get_min(vec));
1020 obstack_free(&pbqp->obstack, vec);
1025 min_index = node_index;
1032 int node_is_reduced(pbqp_node *node)
1034 if (!reduced_bucket) return 0;
1036 if (pbqp_node_get_degree(node) == 0) return 1;
1038 return node_bucket_contains(reduced_bucket, node);