nsz Git - libfirm/blob - ir/be/beinfo.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  * @author      Matthias Braun
  23  * @version     $Id$
  24  */
  25 #include "config.h"
  26
  27 #include <stdbool.h>
  28
  29 #include "beinfo.h"
  30 #include "bearch.h"
  31 #include "benode_t.h"
  32 #include "irgwalk.h"
  33 #include "irnode_t.h"
  34 #include "error.h"
  35
  36 static copy_attr_func  old_phi_copy_attr;
  37
  38 void be_info_new_node(ir_node *node)
  39 {
  40         struct obstack *obst;
  41         backend_info_t *info;
  42         sched_info_t   *sinfo;
  43
  44         if (is_Anchor(node))
  45                 return;
  46
  47         obst  = get_irg_obstack(current_ir_graph);
  48         info  = obstack_alloc(obst, sizeof(*info));
  49         sinfo = &info->sched_info;
  50
  51         memset(info, 0, sizeof(*info));
  52         sinfo->next = NULL;
  53         sinfo->prev = NULL;
  54
  55         if (is_Phi(node)) {
  56                 info->out_infos = NEW_ARR_D(reg_out_info_t, obst, 1);
  57                 memset(info->out_infos, 0, 1 * sizeof(info->out_infos[0]));
  58         }
  59         assert(node->backend_info == NULL);
  60         node->backend_info = info;
  61 }
  62
  63 static void new_Phi_copy_attr(const ir_node *old_node, ir_node *new_node)
  64 {
  65         struct obstack *obst  = get_irg_obstack(get_irn_irg(new_node));
  66         backend_info_t *old_info = be_get_info(old_node);
  67         backend_info_t *new_info = be_get_info(new_node);
  68
  69         old_phi_copy_attr(old_node, new_node);
  70         new_info->out_infos = DUP_ARR_D(reg_out_info_t, obst, old_info->out_infos);
  71 }
  72
  73 int be_info_equal(const ir_node *node1, const ir_node *node2)
  74 {
  75         backend_info_t *info1 = be_get_info(node1);
  76         backend_info_t *info2 = be_get_info(node2);
  77         int             len   = ARR_LEN(info1->out_infos);
  78         int             i;
  79
  80         if (ARR_LEN(info2->out_infos) != len)
  81                 return 0;
  82
  83         for (i = 0; i < len; ++i) {
  84                 const reg_out_info_t *out1 = &info1->out_infos[i];
  85                 const reg_out_info_t *out2 = &info2->out_infos[i];
  86                 if (out1->reg != out2->reg)
  87                         return 0;
  88                 if (!reg_reqs_equal(out1->req, out2->req))
  89                         return 0;
  90         }
  91
  92         /* TODO: in reqs */
  93
  94         return 1;
  95 }
  96
  97 static void init_walker(ir_node *node, void *data)
  98 {
  99         (void) data;
 100         be_info_new_node(node);
 101 }
 102
 103 static bool initialized = false;
 104
 105 void be_info_init(void)
 106 {
 107         if (initialized)
 108                 panic("double initialization of be_info");
 109
 110         old_phi_copy_attr = op_Phi->ops.copy_attr;
 111         op_Phi->ops.copy_attr = new_Phi_copy_attr;
 112         initialized = true;
 113
 114         /* phis have register and register requirements now which we want to dump */
 115         assert(op_Phi->ops.dump_node == NULL);
 116         op_Phi->ops.dump_node = be_dump_phi_reg_reqs;
 117 }
 118
 119 void be_info_init_irg(ir_graph *irg)
 120 {
 121         irg_walk_anchors(irg, init_walker, NULL, NULL);
 122 }
 123
 124 void be_info_free(void)
 125 {
 126         if (!initialized)
 127                 panic("be_info_free called without prior init");
 128
 129         assert(op_Phi->ops.copy_attr == new_Phi_copy_attr);
 130         op_Phi->ops.copy_attr = old_phi_copy_attr;
 131         initialized = false;
 132
 133         assert(op_Phi->ops.dump_node == be_dump_phi_reg_reqs);
 134         op_Phi->ops.dump_node = NULL;
 135 }
 136
 137 int be_info_initialized(const ir_graph *irg)
 138 {
 139         (void) irg;
 140         return initialized;
 141 }