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

   1 /*
   2  * Copyright (C) 1995-2008 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  * @file
  22  * @brief       Scheduling utilities for nodes in Blocks and Blocks.
  23  * @author      Sebastian Hack
  24  */
  25 #include "config.h"
  26
  27 #include <stdlib.h>
  28
  29 #include "irprintf.h"
  30 #include "irgwalk.h"
  31 #include "firm_types.h"
  32 #include "irgraph_t.h"
  33 #include "iredges_t.h"
  34 #include "ircons.h"
  35 #include "irgmod.h"
  36 #include "debug.h"
  37
  38 #include "bemodule.h"
  39 #include "bearch.h"
  40 #include "besched.h"
  41 #include "beutil.h"
  42 #include "belistsched.h"
  43 #include "belive.h"
  44
  45 #include "lc_opts.h"
  46 #include "lc_opts_enum.h"
  47 #include "irtools.h"
  48
  49 #define SCHED_INITIAL_GRANULARITY (1 << 14)
  50
  51 static void sched_renumber(const ir_node *block)
  52 {
  53         sched_info_t *inf;
  54         sched_timestep_t step = SCHED_INITIAL_GRANULARITY;
  55
  56         sched_foreach(block, irn) {
  57                 inf = get_irn_sched_info(irn);
  58                 inf->time_step = step;
  59                 step += SCHED_INITIAL_GRANULARITY;
  60         }
  61 }
  62
  63 static inline void sched_set_time_stamp(const ir_node *irn)
  64 {
  65         sched_info_t       *info      = get_irn_sched_info(irn);
  66         const sched_info_t *prev_info = get_irn_sched_info(info->prev);
  67         const sched_info_t *next_info = get_irn_sched_info(info->next);
  68         sched_timestep_t    before_ts = prev_info->time_step;
  69         sched_timestep_t    after_ts  = next_info->time_step;
  70
  71         /*
  72          * If we are the last, we can give us a big time step,
  73          * else we have to compute our time step from our
  74          * neighbours.
  75          */
  76         if(before_ts >= after_ts) {
  77                 info->time_step = before_ts + SCHED_INITIAL_GRANULARITY;
  78                 /* overflow? */
  79                 if (info->time_step <= before_ts) {
  80                         sched_renumber(get_nodes_block(irn));
  81                 }
  82         } else {
  83                 sched_timestep_t ts = (before_ts + after_ts) / 2;
  84
  85                 /*
  86                  * If the resolution went out, we have to renumber
  87                  * this block.
  88                  */
  89                 if(ts == before_ts || ts == after_ts)
  90                         sched_renumber(get_nodes_block(irn));
  91                 else
  92                         info->time_step = ts;
  93         }
  94 }
  95
  96 void sched_add_before(ir_node *before, ir_node *irn)
  97 {
  98         sched_info_t *info      = get_irn_sched_info(irn);
  99         ir_node      *next      = before;
 100         sched_info_t *next_info = get_irn_sched_info(next);
 101         ir_node      *prev      = next_info->prev;
 102         sched_info_t *prev_info = get_irn_sched_info(prev);
 103         assert(sched_is_scheduled(before));
 104         assert(!sched_is_scheduled(irn));
 105         assert(!is_Proj(before));
 106         assert(!is_Proj(irn));
 107
 108         info->prev = prev;
 109         info->next = next;
 110         prev_info->next = irn;
 111         next_info->prev = irn;
 112         sched_set_time_stamp(irn);
 113 }
 114
 115 void sched_add_after(ir_node *after, ir_node *irn)
 116 {
 117         sched_info_t *info      = get_irn_sched_info(irn);
 118         ir_node      *prev      = after;
 119         sched_info_t *prev_info = get_irn_sched_info(prev);
 120         ir_node      *next      = prev_info->next;
 121         sched_info_t *next_info = get_irn_sched_info(next);
 122         assert(sched_is_scheduled(after));
 123         assert(!sched_is_scheduled(irn));
 124         assert(!is_Proj(after));
 125         assert(!is_Proj(irn));
 126
 127         info->prev = prev;
 128         info->next = next;
 129         prev_info->next = irn;
 130         next_info->prev = irn;
 131         sched_set_time_stamp(irn);
 132 }
 133
 134 void sched_remove(ir_node *irn)
 135 {
 136         sched_info_t *info      = get_irn_sched_info(irn);
 137         ir_node      *prev      = info->prev;
 138         ir_node      *next      = info->next;
 139         sched_info_t *prev_info = get_irn_sched_info(prev);
 140         sched_info_t *next_info = get_irn_sched_info(next);
 141         assert(sched_is_scheduled(irn));
 142
 143         prev_info->next = next;
 144         next_info->prev = prev;
 145         info->next      = NULL;
 146         info->prev      = NULL;
 147 }
 148
 149
 150
 151 static be_module_list_entry_t *schedulers;
 152 static schedule_func           scheduler;
 153
 154 void be_register_scheduler(const char *name, schedule_func func)
 155 {
 156         if (scheduler == NULL)
 157                 scheduler = func;
 158         be_add_module_to_list(&schedulers, name, (void*)func);
 159 }
 160
 161 void be_schedule_graph(ir_graph *irg)
 162 {
 163         scheduler(irg);
 164 }
 165
 166 BE_REGISTER_MODULE_CONSTRUCTOR(be_init_sched)
 167 void be_init_sched(void)
 168 {
 169         lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
 170         be_add_module_list_opt(be_grp, "scheduler", "scheduling algorithm",
 171                                &schedulers, (void**)&scheduler);
 172 }