#include "plist.h"
#include "timing.h"
-static void apply_RN_co(pbqp *pbqp, plist_t *rpeo)
+static void merge_into_RN_node(pbqp *pbqp, plist_t *rpeo)
{
pbqp_node *node = NULL;
- unsigned min_index = 0;
assert(pbqp);
pbqp_dump_graph(pbqp);
}
#endif
-#if 1
/* Check whether we can merge a neighbor into the current node. */
- for (min_index = 0; min_index < pbqp_node_get_degree(node); ++min_index) {
- check_melting_possibility(pbqp, node->edges[min_index]);
- }
-#endif
+ apply_RM(pbqp, node);
+}
+
+static void apply_RN_co(pbqp *pbqp)
+{
+ pbqp_node *node = NULL;
+ unsigned min_index = 0;
+
+ assert(pbqp);
+
+ node = merged_node;
+ merged_node = NULL;
+ assert(node);
+
+ if (node_is_reduced(node))
+ return;
min_index = get_local_minimal_alternative(pbqp, node);
#endif
#if KAPS_STATISTIC
- if (dump == 0) {
FILE *fh = fopen("solutions.pb", "a");
fprintf(fh, "[%u]", min_index);
fclose(fh);
pbqp->num_rn++;
- }
#endif
/* Now that we found the local minimum set all other costs to infinity. */
{
#if KAPS_TIMING
/* create timers */
- ir_timer_t *t_edge = ir_timer_register("be_pbqp_edges", "pbqp reduce independent edges");
- ir_timer_t *t_r0 = ir_timer_register("be_pbqp_r0", "pbqp R0 reductions");
- ir_timer_t *t_r1 = ir_timer_register("be_pbqp_r1", "pbqp R1 reductions");
- ir_timer_t *t_r2 = ir_timer_register("be_pbqp_r2", "pbqp R2 reductions");
- ir_timer_t *t_rn = ir_timer_register("be_pbqp_rN", "pbqp RN reductions");
-
- /* reset timers */
- ir_timer_reset(t_edge);
- ir_timer_reset(t_r0);
- ir_timer_reset(t_r1);
- ir_timer_reset(t_r2);
- ir_timer_reset(t_rn);
+ ir_timer_t *t_edge = ir_timer_new();
+ ir_timer_t *t_r1 = ir_timer_new();
+ ir_timer_t *t_r2 = ir_timer_new();
+ ir_timer_t *t_rn = ir_timer_new();
#endif
for (;;) {
if (edge_bucket_get_length(edge_bucket) > 0) {
#if KAPS_TIMING
- ir_timer_start(t_r0);
+ ir_timer_start(t_edge);
#endif
apply_edge(pbqp);
#if KAPS_TIMING
- ir_timer_stop(t_r0);
+ ir_timer_stop(t_edge);
#endif
} else if (node_bucket_get_length(node_buckets[1]) > 0) {
#if KAPS_TIMING
#if KAPS_TIMING
ir_timer_stop(t_r2);
#endif
+ } else if (merged_node != NULL) {
+ #if KAPS_TIMING
+ ir_timer_start(t_rn);
+ #endif
+
+ apply_RN_co(pbqp);
+
+ #if KAPS_TIMING
+ ir_timer_stop(t_rn);
+ #endif
} else if (node_bucket_get_length(node_buckets[3]) > 0) {
#if KAPS_TIMING
ir_timer_start(t_rn);
#endif
- apply_RN_co(pbqp, rpeo);
+ merge_into_RN_node(pbqp, rpeo);
#if KAPS_TIMING
ir_timer_stop(t_rn);
#endif
} else {
#if KAPS_TIMING
- printf("%-20s: %8.3lf msec\n", ir_timer_get_description(t_edge), (double)ir_timer_elapsed_usec(t_edge) / 1000.0);
- printf("%-20s: %8.3lf msec\n", ir_timer_get_description(t_r0), (double)ir_timer_elapsed_usec(t_r0) / 1000.0);
- printf("%-20s: %8.3lf msec\n", ir_timer_get_description(t_r1), (double)ir_timer_elapsed_usec(t_r1) / 1000.0);
- printf("%-20s: %8.3lf msec\n", ir_timer_get_description(t_r2), (double)ir_timer_elapsed_usec(t_r2) / 1000.0);
- printf("%-20s: %8.3lf msec\n", ir_timer_get_description(t_rn), (double)ir_timer_elapsed_usec(t_rn) / 1000.0);
+ printf("PBQP RE reductions: %10.3lf msec\n", (double)ir_timer_elapsed_usec(t_edge) / 1000.0);
+ printf("PBQP R1 reductions: %10.3lf msec\n", (double)ir_timer_elapsed_usec(t_r1) / 1000.0);
+ printf("PBQP R2 reductions: %10.3lf msec\n", (double)ir_timer_elapsed_usec(t_r2) / 1000.0);
+ printf("PBQP RN reductions: %10.3lf msec\n", (double)ir_timer_elapsed_usec(t_rn) / 1000.0);
#endif
return;
#if KAPS_STATISTIC
fh = fopen("solutions.pb", "a");
- fprintf(fh, ": %lld RE:%u R0:%u R1:%u R2:%u RN/BF:%u\n", pbqp->solution,
+ #if KAPS_USE_UNSIGNED
+ fprintf(fh, ": %u RE:%u R0:%u R1:%u R2:%u RM:%u RN/BF:%u\n", pbqp->solution,
+ pbqp->num_edges, pbqp->num_r0, pbqp->num_r1, pbqp->num_r2,
+ pbqp->num_rm, pbqp->num_rn);
+ #else
+ fprintf(fh, ": %lld RE:%u R0:%u R1:%u R2:%u RM:%u RN/BF:%u\n", pbqp->solution,
pbqp->num_edges, pbqp->num_r0, pbqp->num_r1, pbqp->num_r2,
- pbqp->num_rn);
+ #endif
fclose(fh);
#endif