/*
- * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
- *
* This file is part of libFirm.
- *
- * This file may be distributed and/or modified under the terms of the
- * GNU General Public License version 2 as published by the Free Software
- * Foundation and appearing in the file LICENSE.GPL included in the
- * packaging of this file.
- *
- * Licensees holding valid libFirm Professional Edition licenses may use
- * this file in accordance with the libFirm Commercial License.
- * Agreement provided with the Software.
- *
- * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
- * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
- * PURPOSE.
+ * Copyright (C) 2012 University of Karlsruhe.
*/
/**
* @file
* @brief Processor architecture specification.
* @author Sebastian Hack
- * @version $Id$
*/
#include "config.h"
#include <string.h>
#include "bearch.h"
-#include "benode_t.h"
+#include "benode.h"
#include "beinfo.h"
#include "ircons_t.h"
#include "irnode_t.h"
#include "irprintf.h"
-/* Initialize the architecture environment struct. */
-arch_env_t *arch_env_init(const arch_isa_if_t *isa_if, FILE *file_handle, be_main_env_t *main_env)
-{
- arch_env_t *arch_env = isa_if->init(file_handle);
- arch_env->main_env = main_env;
- return arch_env;
-}
+arch_register_req_t const arch_no_requirement = {
+ arch_register_req_type_none,
+ NULL,
+ NULL,
+ 0,
+ 0,
+ 0
+};
/**
* Get the isa responsible for a node.
* @param irn The node to get the responsible isa for.
* @return The irn operations given by the responsible isa.
*/
-static inline const arch_irn_ops_t *get_irn_ops(const ir_node *irn)
+static const arch_irn_ops_t *get_irn_ops(const ir_node *irn)
{
- const ir_op *ops;
- const arch_irn_ops_t *be_ops;
-
if (is_Proj(irn)) {
irn = get_Proj_pred(irn);
assert(!is_Proj(irn));
}
- ops = get_irn_op(irn);
- be_ops = get_op_ops(ops)->be_ops;
+ ir_op *ops = get_irn_op(irn);
+ const arch_irn_ops_t *be_ops = get_op_ops(ops)->be_ops;
return be_ops;
}
-const arch_register_req_t *arch_get_register_req(const ir_node *irn, int pos)
-{
- const arch_irn_ops_t *ops;
-
- if (is_Proj(irn)) {
- assert(pos == -1);
- pos = -1-get_Proj_proj(irn);
- irn = get_Proj_pred(irn);
- }
- ops = get_irn_ops_simple(irn);
- if (pos < 0) {
- return ops->get_irn_reg_req_out(irn, -pos-1);
- } else {
- return ops->get_irn_reg_req_in(irn, pos);
- }
-}
-
-const arch_register_req_t *arch_get_register_req_out(const ir_node *irn)
-{
- int pos = 0;
- const arch_irn_ops_t *ops;
-
- if (is_Proj(irn)) {
- pos = get_Proj_proj(irn);
- irn = get_Proj_pred(irn);
- } else if (get_irn_mode(irn) == mode_T) {
- return arch_no_register_req;
- }
- ops = get_irn_ops(irn);
- return ops->get_irn_reg_req_out(irn, pos);
-}
-
void arch_set_frame_offset(ir_node *irn, int offset)
{
const arch_irn_ops_t *ops = get_irn_ops(irn);
return ops->get_frame_entity(irn);
}
-void arch_set_frame_entity(ir_node *irn, ir_entity *ent)
-{
- const arch_irn_ops_t *ops = get_irn_ops(irn);
- ops->set_frame_entity(irn, ent);
-}
-
int arch_get_sp_bias(ir_node *irn)
{
const arch_irn_ops_t *ops = get_irn_ops(irn);
return ops->get_sp_bias(irn);
}
-arch_inverse_t *arch_get_inverse(const ir_node *irn, int i, arch_inverse_t *inverse, struct obstack *obstack)
-{
- const arch_irn_ops_t *ops = get_irn_ops(irn);
-
- if(ops->get_inverse) {
- return ops->get_inverse(irn, i, inverse, obstack);
- } else {
- return NULL;
- }
-}
-
int arch_possible_memory_operand(const ir_node *irn, unsigned int i)
{
const arch_irn_ops_t *ops = get_irn_ops(irn);
- if(ops->possible_memory_operand) {
+ if (ops->possible_memory_operand) {
return ops->possible_memory_operand(irn, i);
} else {
return 0;
void arch_perform_memory_operand(ir_node *irn, ir_node *spill, unsigned int i)
{
const arch_irn_ops_t *ops = get_irn_ops(irn);
-
- if(ops->perform_memory_operand) {
- ops->perform_memory_operand(irn, spill, i);
- } else {
- return;
- }
+ ops->perform_memory_operand(irn, spill, i);
}
int arch_get_op_estimated_cost(const ir_node *irn)
{
const arch_irn_ops_t *ops = get_irn_ops(irn);
- if(ops->get_op_estimated_cost) {
+ if (ops->get_op_estimated_cost) {
return ops->get_op_estimated_cost(irn);
} else {
return 1;
}
}
-void arch_put_non_ignore_regs(const arch_register_class_t *cls, bitset_t *bs)
-{
- unsigned i;
-
- for(i = 0; i < cls->n_regs; ++i) {
- if(!arch_register_type_is(&cls->regs[i], ignore))
- bitset_set(bs, i);
- }
-}
-
-int arch_reg_is_allocatable(const ir_node *irn, int pos, const arch_register_t *reg)
-{
- const arch_register_req_t *req = arch_get_register_req(irn, pos);
-
- if(req->type == arch_register_req_type_none)
- return 0;
-
- if(arch_register_req_is(req, limited)) {
- assert(arch_register_get_class(reg) == req->cls);
- return rbitset_is_set(req->limited, arch_register_get_index(reg));
- }
-
- return req->cls == reg->reg_class;
-}
-
-const arch_register_class_t *arch_get_irn_reg_class(const ir_node *irn, int pos)
-{
- const arch_register_req_t *req = arch_get_register_req(irn, pos);
-
- assert(req->type != arch_register_req_type_none || req->cls == NULL);
-
- return req->cls;
-}
-
-static inline reg_out_info_t *get_out_info(const ir_node *node)
-{
- int pos = 0;
- const backend_info_t *info;
-
- assert(get_irn_mode(node) != mode_T);
- if (is_Proj(node)) {
- pos = get_Proj_proj(node);
- node = get_Proj_pred(node);
- }
-
- info = be_get_info(node);
- assert(pos >= 0 && pos < ARR_LEN(info->out_infos));
- return &info->out_infos[pos];
-}
-
-
-static inline reg_out_info_t *get_out_info_n(const ir_node *node, int pos)
+static reg_out_info_t *get_out_info_n(const ir_node *node, unsigned pos)
{
const backend_info_t *info = be_get_info(node);
- assert(!is_Proj(node));
- assert(pos >= 0 && pos < ARR_LEN(info->out_infos));
+ assert(pos < (unsigned)ARR_LEN(info->out_infos));
return &info->out_infos[pos];
}
return out->reg;
}
-const arch_register_t *arch_irn_get_register(const ir_node *node, int pos)
+const arch_register_t *arch_get_irn_register_out(const ir_node *node,
+ unsigned pos)
{
const reg_out_info_t *out = get_out_info_n(node, pos);
return out->reg;
}
-void arch_irn_set_register(ir_node *node, int pos, const arch_register_t *reg)
+const arch_register_t *arch_get_irn_register_in(const ir_node *node, int pos)
+{
+ ir_node *op = get_irn_n(node, pos);
+ return arch_get_irn_register(op);
+}
+
+void arch_set_irn_register_out(ir_node *node, unsigned pos,
+ const arch_register_t *reg)
{
reg_out_info_t *out = get_out_info_n(node, pos);
out->reg = reg;
out->reg = reg;
}
-arch_irn_class_t arch_irn_classify(const ir_node *node)
+void arch_set_irn_flags(ir_node *node, arch_irn_flags_t flags)
{
- const arch_irn_ops_t *ops = get_irn_ops(node);
- return ops->classify(node);
+ backend_info_t *const info = be_get_info(node);
+ info->flags = flags;
}
-arch_irn_flags_t arch_irn_get_flags(const ir_node *node)
+void arch_add_irn_flags(ir_node *node, arch_irn_flags_t flags)
{
- backend_info_t *info = be_get_info(node);
- return info->flags;
+ backend_info_t *const info = be_get_info(node);
+ info->flags |= flags;
}
-void arch_irn_set_flags(ir_node *node, arch_irn_flags_t flags)
+bool arch_reg_is_allocatable(const arch_register_req_t *req,
+ const arch_register_t *reg)
{
- backend_info_t *info = be_get_info(node);
- info->flags = flags;
+ assert(req->type != arch_register_req_type_none);
+ if (req->cls != reg->reg_class)
+ return false;
+ if (reg->type & arch_register_type_virtual)
+ return true;
+ if (arch_register_req_is(req, limited))
+ return rbitset_is_set(req->limited, reg->index);
+ return true;
}
-void arch_irn_add_flags(ir_node *node, arch_irn_flags_t flags)
+/**
+ * Print information about a register requirement in human readable form
+ * @param F output stream/file
+ * @param req The requirements structure to format.
+ */
+static void arch_dump_register_req(FILE *F, const arch_register_req_t *req,
+ const ir_node *node)
{
- backend_info_t *info = be_get_info(node);
- info->flags |= flags;
-}
+ if (req == NULL || req->type == arch_register_req_type_none) {
+ fprintf(F, "n/a");
+ return;
+ }
-extern char *arch_register_req_format(char *buf, size_t len,
- const arch_register_req_t *req,
- const ir_node *node)
-{
- char tmp[128];
- snprintf(buf, len, "class: %s", req->cls->name);
+ fprintf(F, "%s", req->cls->name);
- if(arch_register_req_is(req, limited)) {
+ if (arch_register_req_is(req, limited)) {
unsigned n_regs = req->cls->n_regs;
unsigned i;
- strncat(buf, " limited:", len);
- for(i = 0; i < n_regs; ++i) {
- if(rbitset_is_set(req->limited, i)) {
+ fprintf(F, " limited to");
+ for (i = 0; i < n_regs; ++i) {
+ if (rbitset_is_set(req->limited, i)) {
const arch_register_t *reg = &req->cls->regs[i];
- strncat(buf, " ", len);
- strncat(buf, reg->name, len);
+ fprintf(F, " %s", reg->name);
}
}
}
- if(arch_register_req_is(req, should_be_same)) {
+ if (arch_register_req_is(req, should_be_same)) {
const unsigned other = req->other_same;
int i;
- ir_snprintf(tmp, sizeof(tmp), " same to:");
+ fprintf(F, " same as");
for (i = 0; 1U << i <= other; ++i) {
if (other & (1U << i)) {
- ir_snprintf(tmp, sizeof(tmp), " %+F", get_irn_n(skip_Proj_const(node), i));
- strncat(buf, tmp, len);
+ ir_fprintf(F, " #%d (%+F)", i, get_irn_n(skip_Proj_const(node), i));
}
}
}
const unsigned other = req->other_different;
int i;
- ir_snprintf(tmp, sizeof(tmp), " different from:");
+ fprintf(F, " different from");
for (i = 0; 1U << i <= other; ++i) {
if (other & (1U << i)) {
- ir_snprintf(tmp, sizeof(tmp), " %+F", get_irn_n(skip_Proj_const(node), i));
- strncat(buf, tmp, len);
+ ir_fprintf(F, " #%d (%+F)", i, get_irn_n(skip_Proj_const(node), i));
}
}
}
+ if (req->width != 1) {
+ fprintf(F, " width:%d", req->width);
+ }
+ if (arch_register_req_is(req, aligned)) {
+ fprintf(F, " aligned");
+ }
if (arch_register_req_is(req, ignore)) {
- strncat(buf, " ignore", len);
+ fprintf(F, " ignore");
}
if (arch_register_req_is(req, produces_sp)) {
- strncat(buf, " produces_sp", len);
+ fprintf(F, " produces_sp");
}
-
- return buf;
}
-static const arch_register_req_t no_requirement = {
- arch_register_req_type_none,
- NULL,
- NULL,
- 0,
- 0
-};
-const arch_register_req_t *arch_no_register_req = &no_requirement;
+void arch_dump_reqs_and_registers(FILE *F, const ir_node *node)
+{
+ backend_info_t *const info = be_get_info(node);
+ int const n_ins = get_irn_arity(node);
+ /* don't fail on invalid graphs */
+ if (!info || (!info->in_reqs && n_ins != 0) || !info->out_infos) {
+ fprintf(F, "invalid register requirements!!!\n");
+ return;
+ }
+
+ for (int i = 0; i < n_ins; ++i) {
+ const arch_register_req_t *req = arch_get_irn_register_req_in(node, i);
+ fprintf(F, "inreq #%d = ", i);
+ arch_dump_register_req(F, req, node);
+ fputs("\n", F);
+ }
+ be_foreach_out(node, o) {
+ const arch_register_req_t *req = arch_get_irn_register_req_out(node, o);
+ fprintf(F, "outreq #%u = ", o);
+ arch_dump_register_req(F, req, node);
+ const arch_register_t *reg = arch_get_irn_register_out(node, o);
+ fprintf(F, " [%s]\n", reg != NULL ? reg->name : "n/a");
+ }
+
+ fprintf(F, "flags =");
+ arch_irn_flags_t flags = arch_get_irn_flags(node);
+ if (flags == arch_irn_flags_none) {
+ fprintf(F, " none");
+ } else {
+ if (flags & arch_irn_flags_dont_spill) {
+ fprintf(F, " unspillable");
+ }
+ if (flags & arch_irn_flags_rematerializable) {
+ fprintf(F, " remat");
+ }
+ if (flags & arch_irn_flags_modify_flags) {
+ fprintf(F, " modify_flags");
+ }
+ if (flags & arch_irn_flags_simple_jump) {
+ fprintf(F, " simple_jump");
+ }
+ if (flags & arch_irn_flags_not_scheduled) {
+ fprintf(F, " not_scheduled");
+ }
+ }
+ fprintf(F, " (0x%x)\n", (unsigned)flags);
+}
projects / libfirm / blobdiff