nsz Git - libfirm/blob - ir/be/beifg.c

   1 /**
   2  * @file   beifg.c
   3  * @date   18.11.2005
   4  * @author Sebastian Hack
   5  *
   6  * Copyright (C) 2005 Universitaet Karlsruhe
   7  * Released under the GPL
   8  */
   9
  10 #include <stdlib.h>
  11
  12 #ifdef HAVE_CONFIG_H
  13 #include "config.h"
  14 #endif
  15
  16 #ifdef HAVE_MALLOC_H
  17 #include <malloc.h>
  18 #endif
  19
  20 #ifdef __linux__
  21 #include <malloc.h>
  22 #endif /* __linux__ */
  23
  24 #ifdef HAVE_ALLOCA_H
  25 #include <alloca.h>
  26 #endif
  27
  28 #ifdef WITH_LIBCORE
  29 #include <libcore/lc_opts.h>
  30 #include <libcore/lc_opts_enum.h>
  31 #include <libcore/lc_timing.h>
  32 #endif /* WITH_LIBCORE */
  33
  34 #include "bitset.h"
  35
  36 #include "irgwalk.h"
  37 #include "irnode_t.h"
  38 #include "irprintf.h"
  39 #include "irtools.h"
  40 #include "beifg_t.h"
  41 #include "beifg_impl.h"
  42 #include "irphase.h"
  43 #include "irphase_t.h"
  44 #include "bechordal.h"
  45
  46 #include "becopystat.h"
  47 #include "becopyopt.h"
  48
  49 /** Defines values for the ifg performance test */
  50 #define BE_CH_PERFORMANCETEST_MIN_NODES (50)
  51 #define BE_CH_PERFORMANCETEST_COUNT (10)
  52
  53 typedef struct _coloring_t coloring_t;
  54
  55 struct _coloring_t {
  56         phase_t ph;
  57         const arch_env_t *arch_env;
  58         ir_graph *irg;
  59 };
  60
  61 size_t (be_ifg_nodes_iter_size)(const void *self)
  62 {
  63         const be_ifg_t *ifg = self;
  64         return ifg->impl->nodes_iter_size;
  65 }
  66
  67 size_t (be_ifg_neighbours_iter_size)(const void *self)
  68 {
  69         const be_ifg_t *ifg = self;
  70         return ifg->impl->neighbours_iter_size;
  71 }
  72
  73 size_t (be_ifg_cliques_iter_size)(const void *self)
  74 {
  75         const be_ifg_t *ifg = self;
  76         return ifg->impl->cliques_iter_size;
  77 }
  78
  79 static void *regs_irn_data_init(phase_t *ph, ir_node *irn, void *data)
  80 {
  81         coloring_t *coloring = (coloring_t *) ph;
  82         return (void *) arch_get_irn_register(coloring->arch_env, irn);
  83 }
  84
  85 coloring_t *coloring_init(coloring_t *c, ir_graph *irg, const arch_env_t *aenv)
  86 {
  87         phase_init(&c->ph, "regs_map", irg, PHASE_DEFAULT_GROWTH, regs_irn_data_init);
  88         c->arch_env = aenv;
  89         c->irg = irg;
  90         return c;
  91 }
  92
  93 static void get_irn_color(ir_node *irn, void *c)
  94 {
  95         coloring_t *coloring = c;
  96         phase_get_or_set_irn_data(&coloring->ph, irn);
  97 }
  98
  99 static void restore_irn_color(ir_node *irn, void *c)
 100 {
 101         coloring_t *coloring = c;
 102         const arch_register_t *reg = phase_get_irn_data(&coloring->ph, irn);
 103         if(reg)
 104                 arch_set_irn_register(coloring->arch_env, irn, reg);
 105 }
 106
 107 void coloring_save(coloring_t *c)
 108 {
 109         irg_walk_graph(c->irg, NULL, get_irn_color, c);
 110 }
 111
 112 void coloring_restore(coloring_t *c)
 113 {
 114         irg_walk_graph(c->irg, NULL, restore_irn_color, c);
 115 }
 116
 117 void (be_ifg_free)(void *self)
 118 {
 119         be_ifg_t *ifg = self;
 120         ifg->impl->free(self);
 121 }
 122
 123 int (be_ifg_connected)(const void *self, const ir_node *a, const ir_node *b)
 124 {
 125         const be_ifg_t *ifg = self;
 126         return ifg->impl->connected(self, a, b);
 127 }
 128
 129 ir_node *(be_ifg_neighbours_begin)(const void *self, void *iter, const ir_node *irn)
 130 {
 131         const be_ifg_t *ifg = self;
 132         return ifg->impl->neighbours_begin(self, iter, irn);
 133 }
 134
 135 ir_node *(be_ifg_neighbours_next)(const void *self, void *iter)
 136 {
 137         const be_ifg_t *ifg = self;
 138         return ifg->impl->neighbours_next(self, iter);
 139 }
 140
 141 void (be_ifg_neighbours_break)(const void *self, void *iter)
 142 {
 143         const be_ifg_t *ifg = self;
 144         ifg->impl->neighbours_break(self, iter);
 145 }
 146
 147 ir_node *(be_ifg_nodes_begin)(const void *self, void *iter)
 148 {
 149         const be_ifg_t *ifg = self;
 150         return ifg->impl->nodes_begin(self, iter);
 151 }
 152
 153 ir_node *(be_ifg_nodes_next)(const void *self, void *iter)
 154 {
 155         const be_ifg_t *ifg = self;
 156         return ifg->impl->nodes_next(self, iter);
 157 }
 158
 159 void (be_ifg_nodes_break)(const void *self, void *iter)
 160 {
 161         const be_ifg_t *ifg = self;
 162         ifg->impl->nodes_break(self, iter);
 163 }
 164
 165 int (be_ifg_cliques_begin)(const void *self, void *iter, ir_node **buf)
 166 {
 167         const be_ifg_t *ifg = self;
 168         return ifg->impl->cliques_begin(self, iter, buf);
 169 }
 170
 171 int (be_ifg_cliques_next)(const void *self, void *iter)
 172 {
 173         const be_ifg_t *ifg = self;
 174         return ifg->impl->cliques_next(self, iter);
 175 }
 176
 177 void (be_ifg_cliques_break)(const void *self, void *iter)
 178 {
 179         const be_ifg_t *ifg = self;
 180         ifg->impl->cliques_break(self, iter);
 181 }
 182
 183 int (be_ifg_degree)(const void *self, const ir_node *irn)
 184 {
 185         const be_ifg_t *ifg = self;
 186         return ifg->impl->degree(self, irn);
 187 }
 188
 189
 190 int be_ifg_is_simplicial(const be_ifg_t *ifg, const ir_node *irn)
 191 {
 192         int degree = be_ifg_degree(ifg, irn);
 193         void *iter = be_ifg_neighbours_iter_alloca(ifg);
 194
 195         ir_node **neighbours = xmalloc(degree * sizeof(neighbours[0]));
 196
 197         ir_node *curr;
 198         int i, j;
 199
 200         i = 0;
 201         be_ifg_foreach_neighbour(ifg, iter, irn, curr)
 202                 neighbours[i++] = curr;
 203
 204         for(i = 0; i < degree; ++i) {
 205                 for(j = 0; j < i; ++j)
 206                         if(!be_ifg_connected(ifg, neighbours[i], neighbours[j])) {
 207                                 free(neighbours);
 208                                 return 0;
 209                         }
 210         }
 211
 212
 213         free(neighbours);
 214         return 1;
 215 }
 216
 217 void be_ifg_check(const be_ifg_t *ifg)
 218 {
 219         void *iter1 = be_ifg_nodes_iter_alloca(ifg);
 220         void *iter2 = be_ifg_neighbours_iter_alloca(ifg);
 221
 222         ir_node *n, *m;
 223         int node_count = 0;
 224         int neighbours_count = 0;
 225         int degree = 0;
 226
 227         /* count all nodes */
 228         ir_printf("\n\nFound the following nodes in the graph %+F:\n\n", current_ir_graph);
 229         be_ifg_foreach_node(ifg,iter1,n)
 230         {
 231                 node_count++;
 232                 degree = be_ifg_degree(ifg, n);
 233                 ir_printf("%d. %+F with degree: %d\n", node_count, n, degree);
 234         }
 235
 236         ir_printf("\n\nNumber of nodes: %d\n\n", node_count);
 237
 238         /* Check, if all neighbours are indeed connected to the node. */
 239         be_ifg_foreach_node(ifg, iter1, n)
 240         {
 241                 ir_printf("\n%+F; ", n);
 242                 be_ifg_foreach_neighbour(ifg, iter2, n, m)
 243                 {
 244                         ir_printf("%+F; ", m);
 245                         neighbours_count++;
 246                         if(!be_ifg_connected(ifg, n, m))
 247                                 ir_fprintf(stderr, "%+F is a neighbour of %+F but they are not connected!\n", n, m);
 248                 }
 249         }
 250         ir_printf("\n\nFound %d nodes in the 'check neighbour section'\n", neighbours_count);
 251 }
 252
 253 int be_ifg_check_get_node_count(const be_ifg_t *ifg)
 254 {
 255         void *iter = be_ifg_nodes_iter_alloca(ifg);
 256         int node_count = 0;
 257         ir_node *n;
 258
 259         be_ifg_foreach_node(ifg, iter, n)
 260         {
 261                 node_count++;
 262         }
 263
 264         return node_count;
 265 }
 266
 267 static int be_ifg_check_cmp_nodes(const void *a, const void *b)
 268 {
 269         const ir_node *node_a = *(ir_node **)a;
 270         const ir_node *node_b = *(ir_node **)b;
 271
 272         int nr_a = node_a->node_nr;
 273         int nr_b = node_b->node_nr;
 274
 275         return QSORT_CMP(nr_a, nr_b);
 276 }
 277
 278 void be_ifg_check_sorted(const be_ifg_t *ifg)
 279 {
 280         void *iter1 = be_ifg_nodes_iter_alloca(ifg);
 281         void *iter2 = be_ifg_neighbours_iter_alloca(ifg);
 282
 283         ir_node *n, *m;
 284         const int node_count = be_ifg_check_get_node_count(ifg);
 285         int neighbours_count = 0;
 286         int i = 0;
 287
 288         ir_node **all_nodes = xmalloc(node_count * sizeof(all_nodes[0]));
 289
 290         be_ifg_foreach_node(ifg, iter1, n)
 291         {
 292                 if(!node_is_in_irgs_storage(ifg->env->irg, n))
 293                 {
 294                         printf ("+%F is in ifg but not in the current irg!",n);
 295                         assert (node_is_in_irgs_storage(ifg->env->irg, n));
 296                 }
 297
 298                 all_nodes[i] = n;
 299                 i++;
 300         }
 301
 302         qsort(all_nodes, node_count, sizeof(all_nodes[0]), be_ifg_check_cmp_nodes);
 303
 304         for (i = 0; i < node_count; i++)
 305         {
 306                 ir_node **neighbours = xmalloc(node_count * sizeof(neighbours[0]));
 307                 int j = 0;
 308                 int k = 0;
 309                 int degree = 0;
 310
 311                 degree = be_ifg_degree(ifg, all_nodes[i]);
 312
 313                 be_ifg_foreach_neighbour(ifg, iter2, all_nodes[i], m)
 314                 {
 315                         neighbours[j] = m;
 316                         j++;
 317                 }
 318
 319                 qsort(neighbours, j, sizeof(neighbours[0]), be_ifg_check_cmp_nodes);
 320
 321                 ir_printf("%d. %+F's neighbours(%d): ", i+1, all_nodes[i], degree);
 322
 323                 for(k = 0; k < j; k++)
 324                 {
 325                         ir_printf("%+F, ", neighbours[k]);
 326                 }
 327
 328                 ir_printf("\n");
 329
 330                 free(neighbours);
 331         }
 332
 333         free(all_nodes);
 334
 335 }
 336
 337 void be_ifg_check_performance(be_chordal_env_t *chordal_env)
 338 {
 339         int tests = BE_CH_PERFORMANCETEST_COUNT;
 340         coloring_t coloring;
 341
 342 #ifdef __linux__
 343         struct mallinfo minfo;
 344         int used_memory = 0;
 345 #endif /* __linux__ */
 346
 347         int i = 0;
 348         int rt;
 349         copy_opt_t *co;
 350         be_ifg_t *old_if = chordal_env->ifg;
 351
 352         lc_timer_t *timer = lc_timer_register("getTime","get Time of copy minimization using the ifg");
 353         unsigned long elapsed_usec = 0;
 354
 355         if ((int) get_irg_estimated_node_cnt >= BE_CH_PERFORMANCETEST_MIN_NODES)
 356         {
 357
 358                 coloring_init(&coloring, chordal_env->irg, chordal_env->birg->main_env->arch_env);
 359                 coloring_save(&coloring);
 360
 361                 lc_timer_reset(timer);
 362
 363                 for (i = 0; i<tests; i++) /* performance test with std */
 364                 {
 365 #ifdef __linux__
 366                         minfo = mallinfo();
 367                         used_memory = minfo.uordblks;
 368 #endif /* __linux__ */
 369
 370                         rt = lc_timer_enter_high_priority();
 371                         lc_timer_start(timer);
 372
 373                         chordal_env->ifg = be_ifg_std_new(chordal_env);
 374
 375                         lc_timer_stop(timer);
 376                         rt = lc_timer_leave_high_priority();
 377
 378 #ifdef __linux__
 379                         minfo = mallinfo();
 380                         used_memory = minfo.uordblks - used_memory;
 381 #endif /* __linux__ */
 382
 383                         coloring_restore(&coloring);
 384
 385                         co = NULL;
 386                         co = new_copy_opt(chordal_env, co_get_costs_loop_depth);
 387                         co_build_ou_structure(co);
 388                         co_build_graph_structure(co);
 389
 390                         rt = lc_timer_enter_high_priority();
 391                         lc_timer_start(timer);
 392
 393                         co_solve_heuristic_new(co);
 394
 395                         lc_timer_stop(timer);
 396                         rt = lc_timer_leave_high_priority();
 397
 398                         co_free_graph_structure(co);
 399                         co_free_ou_structure(co);
 400                         free_copy_opt(co);
 401                         be_ifg_free(chordal_env->ifg);
 402
 403                 }
 404
 405                 elapsed_usec = lc_timer_elapsed_usec(timer);
 406                 /* calculating average */
 407                 elapsed_usec = elapsed_usec / tests;
 408
 409                 ir_printf("\nstd:; %+F; ",current_ir_graph);
 410 #ifdef __linux__
 411                 ir_printf("%u; ", used_memory);
 412 #endif /* __linux__ */
 413                 ir_printf("%u; ", elapsed_usec);
 414
 415                 i=0;
 416 #ifdef __linux__
 417                 used_memory=0;
 418 #endif /* __linux__ */
 419                 elapsed_usec=0;
 420
 421                 for (i = 0; i<tests; i++)  /* performance test with clique */
 422                 {
 423 #ifdef __linux__
 424                         minfo = mallinfo();
 425                         used_memory = minfo.uordblks;
 426 #endif /* __linux__ */
 427
 428                         rt = lc_timer_enter_high_priority();
 429                         lc_timer_start(timer);
 430
 431                         chordal_env->ifg = be_ifg_clique_new(chordal_env);
 432
 433                         lc_timer_stop(timer);
 434                         rt = lc_timer_leave_high_priority();
 435
 436 #ifdef __linux__
 437                         minfo = mallinfo();
 438                         used_memory = minfo.uordblks - used_memory;
 439 #endif /* __linux__ */
 440
 441                         coloring_restore(&coloring);
 442
 443                         co = NULL;
 444                         co = new_copy_opt(chordal_env, co_get_costs_loop_depth);
 445                         co_build_ou_structure(co);
 446                         co_build_graph_structure(co);
 447
 448                         rt = lc_timer_enter_high_priority();
 449                         lc_timer_start(timer);
 450
 451                         co_solve_heuristic_new(co);
 452
 453                         lc_timer_stop(timer);
 454                         rt = lc_timer_leave_high_priority();
 455
 456                         co_free_graph_structure(co);
 457                         co_free_ou_structure(co);
 458                         free_copy_opt(co);
 459                         be_ifg_free(chordal_env->ifg);
 460
 461                 }
 462
 463                 elapsed_usec = lc_timer_elapsed_usec(timer);
 464                 /* calculating average */
 465                 elapsed_usec = elapsed_usec / tests;
 466
 467                 ir_printf("\nclique:; %+F; ",current_ir_graph);
 468 #ifdef __linux__
 469                 ir_printf("%u; ", used_memory);
 470 #endif /* __linux__ */
 471                 ir_printf("%u; ", elapsed_usec);
 472
 473                 i=0;
 474 #ifdef __linux__
 475                 used_memory=0;
 476 #endif /* __linux__ */
 477                 elapsed_usec=0;
 478
 479                 for (i = 0; i<tests; i++)  /* performance test with list */
 480                 {
 481 #ifdef __linux__
 482                         minfo = mallinfo();
 483                         used_memory = minfo.uordblks;
 484 #endif /* __linux__ */
 485
 486                         rt = lc_timer_enter_high_priority();
 487                         lc_timer_start(timer);
 488
 489                         chordal_env->ifg = be_ifg_list_new(chordal_env);
 490
 491                         lc_timer_stop(timer);
 492                         rt = lc_timer_leave_high_priority();
 493
 494 #ifdef __linux__
 495                         minfo = mallinfo();
 496                         used_memory = minfo.uordblks - used_memory;
 497 #endif /* __linux__ */
 498
 499                         coloring_restore(&coloring);
 500
 501                         co = NULL;
 502                         co = new_copy_opt(chordal_env, co_get_costs_loop_depth);
 503                         co_build_ou_structure(co);
 504                         co_build_graph_structure(co);
 505
 506                         rt = lc_timer_enter_high_priority();
 507                         lc_timer_start(timer);
 508
 509                         co_solve_heuristic_new(co);
 510
 511                         lc_timer_stop(timer);
 512                         rt = lc_timer_leave_high_priority();
 513
 514                         co_free_graph_structure(co);
 515                         co_free_ou_structure(co);
 516                         free_copy_opt(co);
 517                         be_ifg_free(chordal_env->ifg);
 518
 519                 }
 520
 521                 elapsed_usec = lc_timer_elapsed_usec(timer);
 522                 /* calculating average */
 523                 elapsed_usec = elapsed_usec / tests;
 524
 525                 ir_printf("\nlist:; %+F; ",current_ir_graph);
 526 #ifdef __linux__
 527                 ir_printf("%u; ", used_memory);
 528 #endif /* __linux__ */
 529                 ir_printf("%u; ", elapsed_usec);
 530
 531                 i=0;
 532 #ifdef __linux__
 533                 used_memory=0;
 534 #endif /* __linux__ */
 535                 elapsed_usec=0;
 536
 537                 for (i = 0; i<tests; i++)  /* performance test with pointer */
 538                 {
 539 #ifdef __linux__
 540                         minfo = mallinfo();
 541                         used_memory = minfo.uordblks;
 542 #endif /* __linux__ */
 543
 544                         rt = lc_timer_enter_high_priority();
 545                         lc_timer_start(timer);
 546
 547                         chordal_env->ifg = be_ifg_pointer_new(chordal_env);
 548
 549                         lc_timer_stop(timer);
 550                         rt = lc_timer_leave_high_priority();
 551
 552 #ifdef __linux__
 553                         minfo = mallinfo();
 554                         used_memory = minfo.uordblks - used_memory;
 555 #endif /* __linux__ */
 556
 557                         coloring_restore(&coloring);
 558
 559                         co = NULL;
 560                         co = new_copy_opt(chordal_env, co_get_costs_loop_depth);
 561                         co_build_ou_structure(co);
 562                         co_build_graph_structure(co);
 563
 564                         rt = lc_timer_enter_high_priority();
 565                         lc_timer_start(timer);
 566
 567                         co_solve_heuristic_new(co);
 568
 569                         lc_timer_stop(timer);
 570                         rt = lc_timer_leave_high_priority();
 571
 572                         co_free_graph_structure(co);
 573                         co_free_ou_structure(co);
 574                         free_copy_opt(co);
 575                         be_ifg_free(chordal_env->ifg);
 576
 577                 }
 578
 579                 elapsed_usec = lc_timer_elapsed_usec(timer);
 580                 /* calculating average */
 581                 elapsed_usec = elapsed_usec / tests;
 582
 583                 ir_printf("\npointer:; %+F; ",current_ir_graph);
 584 #ifdef __linux__
 585                 ir_printf("%u; ", used_memory);
 586 #endif /* __linux__ */
 587                 ir_printf("%u; ", elapsed_usec);
 588
 589                 i=0;
 590 #ifdef __linux__
 591                 used_memory=0;
 592 #endif /* __linux__ */
 593                 elapsed_usec=0;
 594         }
 595
 596         chordal_env->ifg = old_if;
 597 }
 598
 599 void be_ifg_dump_dot(be_ifg_t *ifg, ir_graph *irg, FILE *file, const be_ifg_dump_dot_cb_t *cb, void *self)
 600 {
 601         void *nodes_it  = be_ifg_nodes_iter_alloca(ifg);
 602         void *neigh_it  = be_ifg_neighbours_iter_alloca(ifg);
 603         bitset_t *nodes = bitset_malloc(get_irg_last_idx(irg));
 604
 605         ir_node *n, *m;
 606
 607         fprintf(file, "graph G {\n\tgraph [");
 608         if(cb->graph_attr)
 609                 cb->graph_attr(file, self);
 610         fprintf(file, "];\n");
 611
 612         if(cb->at_begin)
 613                 cb->at_begin(file, self);
 614
 615         be_ifg_foreach_node(ifg, nodes_it, n) {
 616                 if(cb->is_dump_node && cb->is_dump_node(self, n)) {
 617                         int idx = get_irn_idx(n);
 618                         bitset_set(nodes, idx);
 619                         fprintf(file, "\tnode [");
 620                         if(cb->node_attr)
 621                                 cb->node_attr(file, self, n);
 622                         fprintf(file, "]; n%d;\n", idx);
 623                 }
 624         }
 625
 626         /* Check, if all neighbours are indeed connected to the node. */
 627         be_ifg_foreach_node(ifg, nodes_it, n) {
 628                 be_ifg_foreach_neighbour(ifg, neigh_it, n, m) {
 629                         int n_idx = get_irn_idx(n);
 630                         int m_idx = get_irn_idx(m);
 631
 632                         if(n_idx < m_idx && bitset_is_set(nodes, n_idx) && bitset_is_set(nodes, m_idx)) {
 633                                 fprintf(file, "\tn%d -- n%d [", n_idx, m_idx);
 634                                 if(cb->edge_attr)
 635                                         cb->edge_attr(file, self, n, m);
 636                                 fprintf(file, "];\n");
 637                         }
 638                 }
 639         }
 640
 641         if(cb->at_end)
 642                 cb->at_end(file, self);
 643
 644         fprintf(file, "}\n");
 645         bitset_free(nodes);
 646 }