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

   1 /*
   2  * Copyright (C) 1995-2007 University of Karlsruhe.  All right reserved.
   3  *
   4  * This file is part of libFirm.
   5  *
   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.
  10  *
  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.
  14  *
  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
  17  * PURPOSE.
  18  */
  19
  20 /**
  21  * @brief   Use the strong normal form theorem (though it does not hold)
  22  * @author  Christoph Mallon
  23  * @version $Id: beschedrand.c 14604 2007-06-18 14:07:07Z matze $
  24  */
  25 #ifdef HAVE_CONFIG_H
  26 #include "config.h"
  27 #endif
  28
  29 #include <stdlib.h>
  30
  31 #include "besched_t.h"
  32 #include "belistsched.h"
  33 #include "belive_t.h"
  34 #include "beutil.h"
  35 #include "irtools.h"
  36 #include "irgwalk.h"
  37
  38
  39 // XXX there is no one time init for schedulers
  40 //#define NORMAL_DBG
  41
  42
  43 static const arch_env_t *cur_arch_env;
  44
  45
  46 static ir_node *normal_select(void *block_env, ir_nodeset_t *ready_set,
  47                               ir_nodeset_t *live_set)
  48 {
  49         ir_nodeset_iterator_t iter;
  50         ir_node*  block;
  51         ir_node*  irn;
  52         ir_node** sched;
  53         int sched_count;
  54
  55         (void)block_env;
  56         (void)live_set;
  57
  58         ir_nodeset_iterator_init(&iter, ready_set);
  59         irn = ir_nodeset_iterator_next(&iter);
  60         block = get_nodes_block(irn);
  61         sched = get_irn_link(block);
  62         sched_count = ARR_LEN(sched);
  63         for (; sched_count-- != 0; ++sched) {
  64                 ir_node* irn = *sched;
  65                 if (ir_nodeset_contains(ready_set, irn) &&
  66                                 !arch_irn_class_is(cur_arch_env, irn, branch)) {
  67 #if defined NORMAL_DBG
  68                         ir_fprintf(stderr, "scheduling %+F\n", irn);
  69 #endif
  70                         return irn;
  71                 }
  72         }
  73
  74         return irn;
  75 }
  76
  77
  78 typedef struct irn_cost_pair {
  79         ir_node* irn;
  80         int      cost;
  81 } irn_cost_pair;
  82
  83
  84 static int cost_cmp(const void* a, const void* b)
  85 {
  86         const irn_cost_pair* a1 = a;
  87         const irn_cost_pair* b1 = b;
  88         return b1->cost - a1->cost;
  89 }
  90
  91
  92 typedef struct flag_and_cost {
  93         int no_root;
  94         irn_cost_pair costs[];
  95 } flag_and_cost;
  96
  97
  98 static int count_result(const ir_node* irn)
  99 {
 100         const ir_mode* mode = get_irn_mode(irn);
 101         return
 102                 mode != mode_M &&
 103                 mode != mode_X &&
 104                 !arch_irn_is(cur_arch_env, irn, ignore);
 105 }
 106
 107
 108 static int normal_tree_cost(ir_node* irn)
 109 {
 110         flag_and_cost* fc    = get_irn_link(irn);
 111         ir_node*       block = get_nodes_block(irn);
 112         int            arity = get_irn_arity(irn);
 113         int            cost_max  = 0;
 114         int            count_max = 0;
 115         int            n_res;
 116         int            cost;
 117
 118         if (fc == NULL) {
 119                 irn_cost_pair* costs;
 120                 int            i;
 121
 122                 fc = malloc(sizeof(*fc) + sizeof(*fc->costs) * arity);
 123                 fc->no_root = 0;
 124                 costs = fc->costs;
 125
 126                 for (i = 0; i < arity; ++i) {
 127                         ir_node* pred = get_irn_n(irn, i);
 128                         int cost;
 129
 130                         if (is_Phi(irn) || get_irn_mode(pred) == mode_M) {
 131                                 cost = 0;
 132                         } else if (get_nodes_block(pred) != block) {
 133                                 cost = 1;
 134                         } else {
 135                                 flag_and_cost* pred_fc;
 136
 137                                 cost = normal_tree_cost(pred);
 138                                 pred_fc = get_irn_link(pred);
 139                                 pred_fc->no_root = 1;
 140 #if defined NORMAL_DBG
 141                                 ir_fprintf(stderr, "%+F says that %+F is no root\n", irn, pred);
 142 #endif
 143                         }
 144
 145                         costs[i].irn  = pred;
 146                         costs[i].cost = cost;
 147
 148                         if (cost > cost_max) {
 149                                 cost_max  = cost;
 150                                 count_max = 1;
 151                         } else if (cost == cost_max) {
 152                                 ++count_max;
 153                         }
 154                 }
 155
 156                 qsort(costs, arity, sizeof(*costs), cost_cmp);
 157                 set_irn_link(irn, fc);
 158         } else {
 159                 irn_cost_pair* costs = fc->costs;
 160                 int            i;
 161
 162                 if (arity > 0) {
 163                         cost_max = costs[0].cost;
 164
 165                         for (i = 0; i < arity; ++i) {
 166                                 if (costs[i].cost < cost_max) break;
 167                                 ++count_max;
 168                         }
 169                 }
 170         }
 171
 172         n_res = count_result(irn);
 173         if (cost_max == 0) {
 174                 cost = n_res;
 175         } else {
 176                 cost = MAX(n_res, cost_max + count_max - 1);
 177         }
 178
 179 #if defined NORMAL_DBG
 180         ir_fprintf(stderr, "reguse of %+F is %d\n", irn, cost);
 181 #endif
 182
 183         return cost;
 184 }
 185
 186
 187 static void normal_tree_sched(ir_node* irn)
 188 {
 189         irn_cost_pair* irns  = get_irn_link(irn);
 190         int            arity = get_irn_arity(irn);
 191         int            i;
 192
 193         if (irns == NULL) return;
 194
 195         for (i = 0; i < arity; ++i) {
 196                 normal_tree_sched(irns[i].irn);
 197         }
 198
 199         if (1) { // TODO check if node needs to be scheduled
 200                 ir_node*  block = get_nodes_block(irn);
 201                 ir_node** sched = get_irn_link(block);
 202
 203 #if defined NORMAL_DBG
 204                 ir_fprintf(stderr, "scheduling %+F in array %p\n", irn, sched);
 205 #endif
 206
 207                 if (sched == NULL) {
 208                         sched = NEW_ARR_F(ir_node*, 0);
 209                 }
 210                 ARR_APP1(ir_node*, sched, irn);
 211                 set_irn_link(block, sched);
 212         }
 213
 214         free(irns);
 215         set_irn_link(irn, NULL);
 216 }
 217
 218
 219 static void normal_cost_walker(ir_node* irn, void* env)
 220 {
 221         (void)env;
 222
 223 #if defined NORMAL_DBG
 224         ir_fprintf(stderr, "cost walking node %+F\n", irn);
 225 #endif
 226         if (is_Block(irn)) return;
 227         normal_tree_cost(irn);
 228 }
 229
 230
 231 static void collect_roots(ir_node* irn, void* env)
 232 {
 233         flag_and_cost* fc;
 234
 235         (void)env;
 236
 237         if (is_Block(irn)) return;
 238
 239         fc = get_irn_link(irn);
 240
 241 #if defined NORMAL_DBG
 242         ir_fprintf(stderr, "%+F is %sroot\n", irn, fc->no_root ? "no " : "");
 243 #endif
 244
 245         if (!fc->no_root) {
 246                 ir_node* block = get_nodes_block(irn);
 247                 ir_node** roots = get_irn_link(block);
 248                 if (roots == NULL) {
 249                         roots = NEW_ARR_F(ir_node*, 0);
 250                 }
 251                 ARR_APP1(ir_node*, roots, irn);
 252                 set_irn_link(block, roots);
 253         }
 254 }
 255
 256
 257 static ir_node** sched_node(ir_node** sched, ir_node* irn)
 258 {
 259         ir_node* block = get_nodes_block(irn);
 260         int arity = get_irn_arity(irn);
 261         int i;
 262
 263         if (irn_visited(irn)) return sched;
 264
 265         if (!is_Phi(irn)) {
 266                 for (i = 0; i < arity; ++i) {
 267                         ir_node* pred = get_irn_n(irn, i);
 268                         if (get_nodes_block(pred) != block) continue;
 269                         sched = sched_node(sched, pred);
 270                 }
 271         }
 272
 273         mark_irn_visited(irn);
 274         ARR_APP1(ir_node*, sched, irn);
 275         return sched;
 276 }
 277
 278
 279 static void normal_sched_block(ir_node* block, void* env)
 280 {
 281         ir_node** roots = get_irn_link(block);
 282         int            root_count;
 283         irn_cost_pair* root_costs;
 284         int i;
 285         ir_node**      sched;
 286
 287         (void)env;
 288
 289 #if defined NORMAL_DBG
 290         ir_fprintf(stderr, "sched walking block %+F\n", block);
 291 #endif
 292
 293         if (roots == NULL) {
 294 #if defined NORMAL_DBG
 295                 fprintf(stderr, "has no roots\n");
 296 #endif
 297                 return;
 298         }
 299
 300         root_count = ARR_LEN(roots);
 301         NEW_ARR_A(irn_cost_pair, root_costs, root_count);
 302         for (i = 0; i < root_count; ++i) {
 303                 root_costs[i].irn  = roots[i];
 304                 root_costs[i].cost = normal_tree_cost(roots[i]);
 305         }
 306         qsort(root_costs, root_count, sizeof(*root_costs), cost_cmp);
 307
 308         sched = NEW_ARR_F(ir_node*, 0);
 309         for (i = 0; i < root_count; ++i) {
 310                 ir_node* irn = root_costs[i].irn;
 311                 sched = sched_node(sched, irn);
 312         }
 313         set_irn_link(block, sched);
 314         DEL_ARR_F(roots);
 315
 316 #if defined NORMAL_DBG
 317         {
 318                 int n = ARR_LEN(sched);
 319                 int i;
 320
 321                 ir_fprintf(stderr, "Scheduling of %+F:\n", block);
 322                 for (i = 0; i < n; ++i) {
 323                         int j;
 324                         for (j = 0; j < i; ++j) {
 325                                 if (sched[i] == sched[j]) goto skip;
 326                         }
 327                         ir_fprintf(stderr, "  %+F\n", sched[i]);
 328 skip:;
 329                 }
 330                 fprintf(stderr, "\n");
 331         }
 332 #endif
 333 }
 334
 335
 336 static void *normal_init_graph(const list_sched_selector_t *vtab,
 337                                const be_irg_t *birg)
 338 {
 339         ir_graph* irg = be_get_birg_irg(birg);
 340
 341         (void)vtab;
 342
 343         cur_arch_env = be_get_birg_arch_env(birg);
 344
 345         be_clear_links(irg);
 346
 347         irg_walk_graph(irg, normal_cost_walker,  NULL, NULL);
 348         irg_walk_graph(irg, collect_roots, NULL, NULL);
 349         inc_irg_visited(irg);
 350         irg_block_walk_graph(irg, normal_sched_block, NULL, NULL);
 351
 352         return NULL;
 353 }
 354
 355
 356 static void *normal_init_block(void *graph_env, ir_node *block)
 357 {
 358         (void)graph_env;
 359         (void)block;
 360
 361         return NULL;
 362 }
 363
 364
 365 const list_sched_selector_t normal_selector = {
 366         normal_init_graph,
 367         normal_init_block,
 368         normal_select,
 369         NULL,              /* to_appear_in_schedule */
 370         NULL,              /* node_ready */
 371         NULL,              /* node_selected */
 372         NULL,              /* exectime */
 373         NULL,              /* latency */
 374         NULL,              /* finish_block */
 375         NULL               /* finish_graph */
 376 };