nsz Git - libfirm/blob - heuristical.c

   1 #include "adt/array.h"
   2 #include "assert.h"
   3 #include "error.h"
   4
   5 #include "bucket.h"
   6 #include "heuristical.h"
   7 #include "html_dumper.h"
   8 #include "kaps.h"
   9 #include "matrix.h"
  10 #include "pbqp_edge.h"
  11 #include "pbqp_edge_t.h"
  12 #include "pbqp_node.h"
  13 #include "pbqp_node_t.h"
  14 #include "vector.h"
  15
  16 static pbqp_edge **edge_bucket;
  17 static pbqp_node **node_buckets[4];
  18 static pbqp_node **reduced_bucket = NULL;
  19 static int         buckets_filled = 0;
  20
  21 static void insert_into_edge_bucket(pbqp_edge *edge)
  22 {
  23         if (edge_bucket_contains(edge_bucket, edge)) {
  24                 /* Edge is already inserted. */
  25                 return;
  26         }
  27
  28         edge_bucket_insert(&edge_bucket, edge);
  29 }
  30
  31 static void init_buckets(void)
  32 {
  33         int i;
  34
  35         edge_bucket_init(&edge_bucket);
  36         node_bucket_init(&reduced_bucket);
  37
  38         for (i = 0; i < 4; ++i) {
  39                 node_bucket_init(&node_buckets[i]);
  40         }
  41 }
  42
  43 static void free_buckets(void)
  44 {
  45         int i;
  46
  47         for (i = 0; i < 4; ++i) {
  48                 node_bucket_free(&node_buckets[i]);
  49         }
  50
  51         edge_bucket_free(&edge_bucket);
  52         node_bucket_free(&reduced_bucket);
  53
  54         buckets_filled = 0;
  55 }
  56
  57 static void fill_node_buckets(pbqp *pbqp)
  58 {
  59         unsigned node_index;
  60         unsigned node_len;
  61
  62         assert(pbqp);
  63         node_len = pbqp->num_nodes;
  64
  65         for (node_index = 0; node_index < node_len; ++node_index) {
  66                 unsigned   degree;
  67                 pbqp_node *node = get_node(pbqp, node_index);
  68
  69                 if (!node) continue;
  70
  71                 degree = pbqp_node_get_degree(node);
  72
  73                 /* We have only one bucket for nodes with arity >= 3. */
  74                 if (degree > 3) {
  75                         degree = 3;
  76                 }
  77
  78                 node_bucket_insert(&node_buckets[degree], node);
  79         }
  80
  81         buckets_filled = 1;
  82 }
  83
  84 static void normalize_towards_source(pbqp *pbqp, pbqp_edge *edge)
  85 {
  86         pbqp_matrix    *mat;
  87         pbqp_node      *src_node;
  88         pbqp_node      *tgt_node;
  89         vector         *src_vec;
  90         vector         *tgt_vec;
  91         int             src_len;
  92         int             tgt_len;
  93         int             src_index;
  94
  95         assert(pbqp);
  96         assert(edge);
  97
  98         src_node = edge->src;
  99         tgt_node = edge->tgt;
 100         assert(src_node);
 101         assert(tgt_node);
 102
 103         src_vec = src_node->costs;
 104         tgt_vec = tgt_node->costs;
 105         assert(src_vec);
 106         assert(tgt_vec);
 107
 108         src_len = src_vec->len;
 109         tgt_len = tgt_vec->len;
 110         assert(src_len > 0);
 111         assert(tgt_len > 0);
 112
 113         mat = edge->costs;
 114         assert(mat);
 115
 116         /* Normalize towards source node. */
 117         for (src_index = 0; src_index < src_len; ++src_index) {
 118                 num min = pbqp_matrix_get_row_min(mat, src_index, tgt_vec);
 119
 120                 if (min != 0) {
 121                         if (src_vec->entries[src_index].data == INF_COSTS) {
 122                                 pbqp_matrix_set_row_value(mat, src_index, 0);
 123                         } else {
 124                                 pbqp_matrix_sub_row_value(mat, src_index, tgt_vec, min);
 125                         }
 126                         src_vec->entries[src_index].data = pbqp_add(
 127                                         src_vec->entries[src_index].data, min);
 128
 129                         if (min == INF_COSTS) {
 130                                 unsigned edge_index;
 131                                 unsigned edge_len = pbqp_node_get_degree(src_node);
 132
 133                                 for (edge_index = 0; edge_index < edge_len; ++edge_index) {
 134                                         pbqp_edge *edge_candidate = src_node->edges[edge_index];
 135                                         if (edge_candidate != edge) {
 136                                                 insert_into_edge_bucket(edge_candidate);
 137                                         }
 138                                 }
 139                         }
 140                 }
 141         }
 142 }
 143
 144 static void normalize_towards_target(pbqp *pbqp, pbqp_edge *edge)
 145 {
 146         pbqp_matrix    *mat;
 147         pbqp_node      *src_node;
 148         pbqp_node      *tgt_node;
 149         vector         *src_vec;
 150         vector         *tgt_vec;
 151         int             src_len;
 152         int             tgt_len;
 153         int             tgt_index;
 154
 155         assert(pbqp);
 156         assert(edge);
 157
 158         src_node = edge->src;
 159         tgt_node = edge->tgt;
 160         assert(src_node);
 161         assert(tgt_node);
 162
 163         src_vec = src_node->costs;
 164         tgt_vec = tgt_node->costs;
 165         assert(src_vec);
 166         assert(tgt_vec);
 167
 168         src_len = src_vec->len;
 169         tgt_len = tgt_vec->len;
 170         assert(src_len > 0);
 171         assert(tgt_len > 0);
 172
 173         mat = edge->costs;
 174         assert(mat);
 175
 176         for (tgt_index = 0; tgt_index < tgt_len; ++tgt_index) {
 177                 num min = pbqp_matrix_get_col_min(mat, tgt_index, src_vec);
 178
 179                 if (min != 0) {
 180                         if (tgt_vec->entries[tgt_index].data == INF_COSTS) {
 181                                 pbqp_matrix_set_col_value(mat, tgt_index, 0);
 182                         } else {
 183                                 pbqp_matrix_sub_col_value(mat, tgt_index, src_vec, min);
 184                         }
 185                         tgt_vec->entries[tgt_index].data = pbqp_add(
 186                                         tgt_vec->entries[tgt_index].data, min);
 187
 188                         if (min == INF_COSTS) {
 189                                 unsigned edge_index;
 190                                 unsigned edge_len = pbqp_node_get_degree(tgt_node);
 191
 192                                 for (edge_index = 0; edge_index < edge_len; ++edge_index) {
 193                                         pbqp_edge *edge_candidate = tgt_node->edges[edge_index];
 194                                         if (edge_candidate != edge) {
 195                                                 insert_into_edge_bucket(edge_candidate);
 196                                         }
 197                                 }
 198                         }
 199                 }
 200         }
 201 }
 202
 203 static void reorder_node(pbqp_node *node)
 204 {
 205         unsigned    degree     = pbqp_node_get_degree(node);
 206         /* Assume node lost one incident edge. */
 207         unsigned    old_degree = degree + 1;
 208
 209         if (!buckets_filled) return;
 210
 211         /* Same bucket as before */
 212         if (degree > 2) return;
 213
 214         if (!node_bucket_contains(node_buckets[old_degree], node)) {
 215                 /* Old arity is new arity, so we have nothing to do. */
 216                 assert(node_bucket_contains(node_buckets[degree], node));
 217                 return;
 218         }
 219
 220         /* Delete node from old bucket... */
 221         node_bucket_remove(&node_buckets[old_degree], node);
 222
 223         /* ..and add to new one. */
 224         node_bucket_insert(&node_buckets[degree], node);
 225 }
 226
 227 static void check_melting_possibility(pbqp *pbqp, pbqp_edge *edge)
 228 {
 229         pbqp_matrix    *mat;
 230         pbqp_node      *src_node;
 231         pbqp_node      *tgt_node;
 232         vector         *src_vec;
 233         vector         *tgt_vec;
 234         int             src_len;
 235         int             tgt_len;
 236         int             src_index;
 237         int             tgt_index;
 238
 239         assert(pbqp);
 240         assert(edge);
 241
 242         src_node = edge->src;
 243         tgt_node = edge->tgt;
 244         assert(src_node);
 245         assert(tgt_node);
 246
 247         src_vec = src_node->costs;
 248         tgt_vec = tgt_node->costs;
 249         assert(src_vec);
 250         assert(tgt_vec);
 251
 252         src_len = src_vec->len;
 253         tgt_len = tgt_vec->len;
 254         assert(src_len > 0);
 255         assert(tgt_len > 0);
 256
 257         mat = edge->costs;
 258         assert(mat);
 259
 260         if (src_len == 1 && tgt_len == 1) {
 261                 //panic("Something is wrong");
 262         }
 263
 264         int allRowsOk = 1;
 265         for (src_index = 0; src_index < src_len; ++src_index) {
 266                 int onlyOneZero = 0;
 267                 if (src_vec->entries[src_index].data == INF_COSTS) {
 268                         continue;
 269                 }
 270                 for (tgt_index = 0; tgt_index < tgt_len; ++tgt_index) {
 271                         if (tgt_vec->entries[tgt_index].data == INF_COSTS) {
 272                                 continue;
 273                         }
 274                         if (mat->entries[src_index * tgt_len + tgt_index] == 0) {
 275                                 if (onlyOneZero) {
 276                                         onlyOneZero = 0;
 277                                         break;
 278                                 } else {
 279                                         onlyOneZero = 1;
 280                                         continue;
 281                                 }
 282                         }
 283                         if (mat->entries[src_index * tgt_len + tgt_index] == INF_COSTS) {
 284                                 continue;
 285                         }
 286                         onlyOneZero = 0;
 287                         break;
 288                 }
 289                 allRowsOk &= onlyOneZero;
 290         }
 291
 292         int allColsOk = 1;
 293         for (tgt_index = 0; tgt_index < tgt_len; ++tgt_index) {
 294                 int onlyOneZero = 0;
 295                 if (tgt_vec->entries[tgt_index].data == INF_COSTS) {
 296                         continue;
 297                 }
 298                 for (src_index = 0; src_index < src_len; ++src_index) {
 299                         if (src_vec->entries[src_index].data == INF_COSTS) {
 300                                 continue;
 301                         }
 302                         if (mat->entries[src_index * tgt_len + tgt_index] == 0) {
 303                                 if (onlyOneZero) {
 304                                         onlyOneZero = 0;
 305                                         break;
 306                                 } else {
 307                                         onlyOneZero = 1;
 308                                         continue;
 309                                 }
 310                         }
 311                         if (mat->entries[src_index * tgt_len + tgt_index] == INF_COSTS) {
 312                                 continue;
 313                         }
 314                         onlyOneZero = 0;
 315                         break;
 316                 }
 317                 allColsOk &= onlyOneZero;
 318         }
 319
 320         if (allRowsOk && allColsOk) {
 321                 panic("Hurray");
 322         }
 323 }
 324
 325 static void simplify_edge(pbqp *pbqp, pbqp_edge *edge)
 326 {
 327         pbqp_matrix    *mat;
 328         pbqp_node      *src_node;
 329         pbqp_node      *tgt_node;
 330         vector         *src_vec;
 331         vector         *tgt_vec;
 332         int             src_len;
 333         int             tgt_len;
 334
 335         assert(pbqp);
 336         assert(edge);
 337
 338         src_node = edge->src;
 339         tgt_node = edge->tgt;
 340         assert(src_node);
 341         assert(tgt_node);
 342
 343         /* If edge are already deleted, we have nothing to do. */
 344         if (!is_connected(src_node, edge) || !is_connected(tgt_node, edge))
 345                 return;
 346
 347         if (pbqp->dump_file) {
 348                 char txt[100];
 349                 sprintf(txt, "Simplification of Edge n%d-n%d", src_node->index, tgt_node->index);
 350                 dump_section(pbqp->dump_file, 3, txt);
 351         }
 352
 353         src_vec = src_node->costs;
 354         tgt_vec = tgt_node->costs;
 355         assert(src_vec);
 356         assert(tgt_vec);
 357
 358         src_len = src_vec->len;
 359         tgt_len = tgt_vec->len;
 360         assert(src_len > 0);
 361         assert(tgt_len > 0);
 362
 363         mat = edge->costs;
 364         assert(mat);
 365
 366         if (pbqp->dump_file) {
 367                 fputs("Input:<br>\n", pbqp->dump_file);
 368                 dump_simplifyedge(pbqp, edge);
 369         }
 370
 371         normalize_towards_source(pbqp, edge);
 372         normalize_towards_target(pbqp, edge);
 373
 374         if (pbqp->dump_file) {
 375                 fputs("<br>\nOutput:<br>\n", pbqp->dump_file);
 376                 dump_simplifyedge(pbqp, edge);
 377         }
 378
 379         if (pbqp_matrix_is_zero(mat, src_vec, tgt_vec)) {
 380                 if (pbqp->dump_file) {
 381                         fputs("edge has been eliminated<br>\n", pbqp->dump_file);
 382                 }
 383
 384                 delete_edge(edge);
 385                 reorder_node(src_node);
 386                 reorder_node(tgt_node);
 387         } else {
 388                 //check_melting_possibility(pbqp, edge);
 389         }
 390 }
 391
 392 void solve_pbqp_heuristical(pbqp *pbqp)
 393 {
 394         unsigned node_index;
 395         unsigned node_len;
 396
 397         assert(pbqp);
 398
 399         if (pbqp->dump_file) {
 400                 pbqp_dump_input(pbqp);
 401                 dump_section(pbqp->dump_file, 1, "2. Simplification of Cost Matrices");
 402         }
 403
 404         node_len = pbqp->num_nodes;
 405
 406         init_buckets();
 407
 408         /* First simplify all edges. */
 409         for (node_index = 0; node_index < node_len; ++node_index) {
 410                 unsigned    edge_index;
 411                 pbqp_node  *node = get_node(pbqp, node_index);
 412                 pbqp_edge **edges;
 413                 unsigned    edge_len;
 414
 415                 if (!node) continue;
 416
 417                 edges = node->edges;
 418                 edge_len = pbqp_node_get_degree(node);
 419
 420                 for (edge_index = 0; edge_index < edge_len; ++edge_index) {
 421                         pbqp_edge *edge = edges[edge_index];
 422
 423                         /* Simplify only once per edge. */
 424                         if (node != edge->src) continue;
 425
 426                         simplify_edge(pbqp, edge);
 427                 }
 428         }
 429
 430         /* Put node into bucket representing their arity. */
 431         fill_node_buckets(pbqp);
 432
 433         for (;;) {
 434                 if (edge_bucket_get_length(edge_bucket) > 0) {
 435                         apply_edge(pbqp);
 436                 } else if (node_bucket_get_length(node_buckets[1]) > 0) {
 437                         apply_RI(pbqp);
 438                 } else if (node_bucket_get_length(node_buckets[2]) > 0) {
 439                         apply_RII(pbqp);
 440                 } else if (node_bucket_get_length(node_buckets[3]) > 0) {
 441                         apply_RN(pbqp);
 442                 } else {
 443                         break;
 444                 }
 445         }
 446
 447         if (pbqp->dump_file) {
 448                 dump_section(pbqp->dump_file, 1, "4. Determine Solution/Minimum");
 449                 dump_section(pbqp->dump_file, 2, "4.1. Trivial Solution");
 450         }
 451
 452         /* Solve trivial nodes and calculate solution. */
 453         node_len = node_bucket_get_length(node_buckets[0]);
 454         for (node_index = 0; node_index < node_len; ++node_index) {
 455                 pbqp_node *node = node_buckets[0][node_index];
 456                 assert(node);
 457
 458                 node->solution = vector_get_min_index(node->costs);
 459                 pbqp->solution = pbqp_add(pbqp->solution,
 460                                 node->costs->entries[node->solution].data);
 461                 if (pbqp->dump_file) {
 462                         fprintf(pbqp->dump_file, "node n%d is set to %d<br>\n", node->index, node->solution);
 463                         dump_node(pbqp, node);
 464                 }
 465         }
 466
 467         if (pbqp->dump_file) {
 468                 dump_section(pbqp->dump_file, 2, "Minimum");
 469                 fprintf(pbqp->dump_file, "Minimum is equal to %lld.", pbqp->solution);
 470                 dump_section(pbqp->dump_file, 2, "Back Propagation");
 471         }
 472
 473         /* Solve reduced nodes. */
 474         node_len = node_bucket_get_length(reduced_bucket);
 475         for (node_index = node_len; node_index > 0; --node_index) {
 476                 pbqp_node *node = reduced_bucket[node_index - 1];
 477
 478                 switch (pbqp_node_get_degree(node)) {
 479                         case 1:
 480                                 back_propagate_RI(pbqp, node);
 481                                 break;
 482                         case 2:
 483                                 back_propagate_RII(pbqp, node);
 484                                 break;
 485                         default:
 486                                 panic("Only nodes with degree one or two should be in this bucket");
 487                                 break;
 488                 }
 489         }
 490
 491         free_buckets();
 492 }
 493
 494 void apply_edge(pbqp *pbqp)
 495 {
 496         pbqp_edge *edge = edge_bucket_pop(&edge_bucket);
 497
 498         simplify_edge(pbqp, edge);
 499 }
 500
 501 void apply_RI(pbqp *pbqp)
 502 {
 503         pbqp_node   *node       = node_bucket_pop(&node_buckets[1]);
 504         pbqp_edge   *edge       = node->edges[0];
 505         pbqp_matrix *mat        = edge->costs;
 506         int          is_src     = edge->src == node;
 507         pbqp_node   *other_node;
 508
 509         if (is_src) {
 510                 other_node = edge->tgt;
 511         } else {
 512                 other_node = edge->src;
 513         }
 514
 515         if (pbqp->dump_file) {
 516                 char     txt[100];
 517                 sprintf(txt, "RI-Reduction of Node n%d", node->index);
 518                 dump_section(pbqp->dump_file, 2, txt);
 519                 pbqp_dump_graph(pbqp);
 520                 fputs("<br>\nBefore reduction:<br>\n", pbqp->dump_file);
 521                 dump_node(pbqp, node);
 522                 dump_node(pbqp, other_node);
 523                 dump_edge(pbqp, edge);
 524         }
 525
 526         if (is_src) {
 527                 pbqp_matrix_add_to_all_cols(mat, node->costs);
 528                 normalize_towards_target(pbqp, edge);
 529         } else {
 530                 pbqp_matrix_add_to_all_rows(mat, node->costs);
 531                 normalize_towards_source(pbqp, edge);
 532         }
 533         disconnect_edge(other_node, edge);
 534
 535         if (pbqp->dump_file) {
 536                 fputs("<br>\nAfter reduction:<br>\n", pbqp->dump_file);
 537                 dump_node(pbqp, other_node);
 538         }
 539
 540         reorder_node(other_node);
 541
 542         /* Add node to back propagation list. */
 543         node_bucket_insert(&reduced_bucket, node);
 544 }
 545
 546 void apply_RII(pbqp *pbqp)
 547 {
 548         pbqp_node   *node       = node_bucket_pop(&node_buckets[2]);
 549         pbqp_edge   *src_edge   = node->edges[0];
 550         pbqp_edge   *tgt_edge   = node->edges[1];
 551         int          src_is_src = src_edge->src == node;
 552         int          tgt_is_src = tgt_edge->src == node;
 553         pbqp_matrix *src_mat;
 554         pbqp_matrix *tgt_mat;
 555         pbqp_node   *src_node;
 556         pbqp_node   *tgt_node;
 557         pbqp_matrix *mat;
 558         vector      *vec;
 559         vector      *node_vec;
 560         vector      *src_vec;
 561         vector      *tgt_vec;
 562         unsigned     col_index;
 563         unsigned     col_len;
 564         unsigned     row_index;
 565         unsigned     row_len;
 566         unsigned     node_len;
 567
 568         assert(pbqp);
 569
 570         if (src_is_src) {
 571                 src_node = src_edge->tgt;
 572         } else {
 573                 src_node = src_edge->src;
 574         }
 575
 576         if (tgt_is_src) {
 577                 tgt_node = tgt_edge->tgt;
 578         } else {
 579                 tgt_node = tgt_edge->src;
 580         }
 581
 582         /* Swap nodes if necessary. */
 583         if (tgt_node->index < src_node->index) {
 584                 pbqp_node *tmp_node;
 585                 pbqp_edge *tmp_edge;
 586
 587                 tmp_node = src_node;
 588                 src_node = tgt_node;
 589                 tgt_node = tmp_node;
 590
 591                 tmp_edge = src_edge;
 592                 src_edge = tgt_edge;
 593                 tgt_edge = tmp_edge;
 594
 595                 src_is_src = src_edge->src == node;
 596                 tgt_is_src = tgt_edge->src == node;
 597         }
 598
 599         if (pbqp->dump_file) {
 600                 char     txt[100];
 601                 sprintf(txt, "RII-Reduction of Node n%d", node->index);
 602                 dump_section(pbqp->dump_file, 2, txt);
 603                 pbqp_dump_graph(pbqp);
 604                 fputs("<br>\nBefore reduction:<br>\n", pbqp->dump_file);
 605                 dump_node(pbqp, src_node);
 606                 dump_edge(pbqp, src_edge);
 607                 dump_node(pbqp, node);
 608                 dump_edge(pbqp, tgt_edge);
 609                 dump_node(pbqp, tgt_node);
 610         }
 611
 612         src_mat = src_edge->costs;
 613         tgt_mat = tgt_edge->costs;
 614
 615         src_vec  = src_node->costs;
 616         tgt_vec  = tgt_node->costs;
 617         node_vec = node->costs;
 618
 619         row_len  = src_vec->len;
 620         col_len  = tgt_vec->len;
 621         node_len = node_vec->len;
 622
 623         mat = pbqp_matrix_alloc(pbqp, row_len, col_len);
 624
 625         for (row_index = 0; row_index < row_len; ++row_index) {
 626                 for (col_index = 0; col_index < col_len; ++col_index) {
 627                         vec = vector_copy(pbqp, node_vec);
 628
 629                         if (src_is_src) {
 630                                 vector_add_matrix_col(vec, src_mat, row_index);
 631                         } else {
 632                                 vector_add_matrix_row(vec, src_mat, row_index);
 633                         }
 634
 635                         if (tgt_is_src) {
 636                                 vector_add_matrix_col(vec, tgt_mat, col_index);
 637                         } else {
 638                                 vector_add_matrix_row(vec, tgt_mat, col_index);
 639                         }
 640
 641                         mat->entries[row_index * col_len + col_index] = vector_get_min(vec);
 642
 643                         obstack_free(&pbqp->obstack, vec);
 644                 }
 645         }
 646
 647         pbqp_edge *edge = get_edge(pbqp, src_node->index, tgt_node->index);
 648
 649         /* Disconnect node. */
 650         disconnect_edge(src_node, src_edge);
 651         disconnect_edge(tgt_node, tgt_edge);
 652
 653         /* Add node to back propagation list. */
 654         node_bucket_insert(&reduced_bucket, node);
 655
 656         if (edge == NULL) {
 657                 edge = alloc_edge(pbqp, src_node->index, tgt_node->index, mat);
 658         } else {
 659                 pbqp_matrix_add(edge->costs, mat);
 660
 661                 /* Free local matrix. */
 662                 obstack_free(&pbqp->obstack, mat);
 663
 664                 reorder_node(src_node);
 665                 reorder_node(tgt_node);
 666         }
 667
 668         if (pbqp->dump_file) {
 669                 fputs("<br>\nAfter reduction:<br>\n", pbqp->dump_file);
 670                 dump_edge(pbqp, edge);
 671         }
 672
 673         /* Edge has changed so we simplify it. */
 674         simplify_edge(pbqp, edge);
 675 }
 676
 677 void apply_RN(pbqp *pbqp)
 678 {
 679         pbqp_node  **bucket       = node_buckets[3];
 680         unsigned     bucket_len   = node_bucket_get_length(bucket);
 681         unsigned     bucket_index;
 682         pbqp_node   *node         = NULL;
 683         pbqp_edge   *edge;
 684         vector      *node_vec;
 685         vector      *vec;
 686         pbqp_matrix *mat;
 687         unsigned     edge_index;
 688         unsigned     max_degree   = 0;
 689         unsigned     node_index;
 690         unsigned     node_len;
 691         unsigned     min_index    = 0;
 692         num          min          = INF_COSTS;
 693         int          is_src;
 694
 695         assert(pbqp);
 696
 697         /* Search for node with maximum degree. */
 698         for (bucket_index = 0; bucket_index < bucket_len; ++bucket_index) {
 699                 pbqp_node *candidate = bucket[bucket_index];
 700                 unsigned   degree    = pbqp_node_get_degree(candidate);
 701
 702                 if (degree > max_degree) {
 703                         node = candidate;
 704                         max_degree = degree;
 705                 }
 706         }
 707         assert(node);
 708         node_vec = node->costs;
 709         node_len = node_vec->len;
 710
 711         if (pbqp->dump_file) {
 712                 char     txt[100];
 713                 sprintf(txt, "RN-Reduction of Node n%d", node->index);
 714                 dump_section(pbqp->dump_file, 2, txt);
 715                 pbqp_dump_graph(pbqp);
 716         }
 717
 718         for (node_index = 0; node_index < node_len; ++node_index) {
 719                 num value = node_vec->entries[node_index].data;
 720
 721                 for (edge_index = 0; edge_index < max_degree; ++edge_index) {
 722                         edge   = node->edges[edge_index];
 723                         mat    = edge->costs;
 724                         is_src = edge->src == node;
 725
 726                         if (is_src) {
 727                                 vec = vector_copy(pbqp, edge->tgt->costs);
 728                                 vector_add_matrix_row(vec, mat, node_index);
 729                         } else {
 730                                 vec = vector_copy(pbqp, edge->src->costs);
 731                                 vector_add_matrix_col(vec, mat, node_index);
 732                         }
 733
 734                         value = pbqp_add(value, vector_get_min(vec));
 735
 736                         obstack_free(&pbqp->obstack, vec);
 737                 }
 738
 739                 if (value < min) {
 740                         min = value;
 741                         min_index = node_index;
 742                 }
 743         }
 744
 745         if (pbqp->dump_file) {
 746                 fprintf(pbqp->dump_file, "node n%d is set to %d<br><br>\n",
 747                                         node->index, min_index);
 748                 fprintf(pbqp->dump_file, "Minimal cost of RN reduction: %lld<br>\n",
 749                                                         min);
 750         }
 751
 752         node->solution = min_index;
 753
 754         /* Now that we found the local minimum set all other costs to infinity. */
 755         for (node_index = 0; node_index < node_len; ++node_index) {
 756                 if (node_index != min_index) {
 757                         node_vec->entries[node_index].data = INF_COSTS;
 758                 }
 759         }
 760
 761         /* Add all incident edges to edge bucket, since they are now independent. */
 762         for (edge_index = 0; edge_index < max_degree; ++edge_index) {
 763                 insert_into_edge_bucket(node->edges[edge_index]);
 764         }
 765 }
 766
 767 void back_propagate_RI(pbqp *pbqp, pbqp_node *node)
 768 {
 769         pbqp_edge   *edge;
 770         pbqp_node   *other;
 771         pbqp_matrix *mat;
 772         vector      *vec;
 773         int          is_src;
 774
 775         assert(pbqp);
 776         assert(node);
 777
 778         edge = node->edges[0];
 779         mat = edge->costs;
 780         is_src = edge->src == node;
 781         vec = node->costs;
 782
 783         if (is_src) {
 784                 other = edge->tgt;
 785                 assert(other);
 786                 vector_add_matrix_col(vec, mat, other->solution);
 787         } else {
 788                 other = edge->src;
 789                 assert(other);
 790                 vector_add_matrix_row(vec, mat, other->solution);
 791         }
 792
 793         node->solution = vector_get_min_index(vec);
 794         if (pbqp->dump_file) {
 795                 fprintf(pbqp->dump_file, "node n%d is set to %d<br>\n", node->index, node->solution);
 796         }
 797 }
 798
 799 void back_propagate_RII(pbqp *pbqp, pbqp_node *node)
 800 {
 801         pbqp_edge   *src_edge   = node->edges[0];
 802         pbqp_edge   *tgt_edge   = node->edges[1];
 803         int          src_is_src = src_edge->src == node;
 804         int          tgt_is_src = tgt_edge->src == node;
 805         pbqp_matrix *src_mat;
 806         pbqp_matrix *tgt_mat;
 807         pbqp_node   *src_node;
 808         pbqp_node   *tgt_node;
 809         vector      *vec;
 810         vector      *node_vec;
 811         unsigned     col_index;
 812         unsigned     row_index;
 813
 814         assert(pbqp);
 815
 816         if (src_is_src) {
 817                 src_node = src_edge->tgt;
 818         } else {
 819                 src_node = src_edge->src;
 820         }
 821
 822         if (tgt_is_src) {
 823                 tgt_node = tgt_edge->tgt;
 824         } else {
 825                 tgt_node = tgt_edge->src;
 826         }
 827
 828         /* Swap nodes if necessary. */
 829         if (tgt_node->index < src_node->index) {
 830                 pbqp_node *tmp_node;
 831                 pbqp_edge *tmp_edge;
 832
 833                 tmp_node = src_node;
 834                 src_node = tgt_node;
 835                 tgt_node = tmp_node;
 836
 837                 tmp_edge = src_edge;
 838                 src_edge = tgt_edge;
 839                 tgt_edge = tmp_edge;
 840
 841                 src_is_src = src_edge->src == node;
 842                 tgt_is_src = tgt_edge->src == node;
 843         }
 844
 845         src_mat = src_edge->costs;
 846         tgt_mat = tgt_edge->costs;
 847
 848         node_vec = node->costs;
 849
 850         row_index = src_node->solution;
 851         col_index = tgt_node->solution;
 852
 853         vec = vector_copy(pbqp, node_vec);
 854
 855         if (src_is_src) {
 856                 vector_add_matrix_col(vec, src_mat, row_index);
 857         } else {
 858                 vector_add_matrix_row(vec, src_mat, row_index);
 859         }
 860
 861         if (tgt_is_src) {
 862                 vector_add_matrix_col(vec, tgt_mat, col_index);
 863         } else {
 864                 vector_add_matrix_row(vec, tgt_mat, col_index);
 865         }
 866
 867         node->solution = vector_get_min_index(vec);
 868         if (pbqp->dump_file) {
 869                 fprintf(pbqp->dump_file, "node n%d is set to %d<br>\n", node->index, node->solution);
 870         }
 871
 872         obstack_free(&pbqp->obstack, vec);
 873 }
 874
 875 int node_is_reduced(pbqp_node *node)
 876 {
 877         if (!reduced_bucket) return 0;
 878
 879         if (pbqp_node_get_degree(node) == 0) return 1;
 880
 881         return node_bucket_contains(reduced_bucket, node);
 882 }