X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbearch.c;h=c7b0ad36fe193282994c53bb1552d01c87408493;hb=0f3e3e5388cf02a125924f2743c90e55f63ddede;hp=a5f8face066d798467fd5a422ad7dfed463e1eff;hpb=59ed1e97b0f1fe883886767ef2b643e6ecf5c19e;p=libfirm diff --git a/ir/be/bearch.c b/ir/be/bearch.c index a5f8face0..c7b0ad36f 100644 --- a/ir/be/bearch.c +++ b/ir/be/bearch.c @@ -1,131 +1,359 @@ -/** - * Processor architecture specification. - * @author Sebastian Hack - * @date 11.2.2005 +/* + * 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. * - * $Id$ + * 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. */ +/** + * @file + * @brief Processor architecture specification. + * @author Sebastian Hack + * @version $Id$ + */ #ifdef HAVE_CONFIG_H #include "config.h" #endif -#ifdef HAVE_ALLOCA_H -#include -#endif -#ifdef HAVE_MALLOC_H -#include -#endif - #include -#include "bearch.h" +#include "bearch_t.h" +#include "benode_t.h" #include "ircons_t.h" +#include "irnode_t.h" #include "bitset.h" #include "pset.h" -#include "entity.h" +#include "raw_bitset.h" -arch_env_t *arch_env_init(arch_env_t *env, const arch_isa_if_t *isa) -{ - memset(env, 0, sizeof(*env)); - env->isa = isa; - return env; -} +#include "irprintf.h" -arch_env_t *arch_env_add_irn_handler(arch_env_t *env, - const arch_irn_handler_t *handler) +/* 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) { - assert(env->handlers_tos <= ARCH_MAX_HANDLERS); - env->handlers[env->handlers_tos++] = handler; - return env; + arch_env_t *arch_env = isa_if->init(file_handle); + arch_env->main_env = main_env; + return arch_env; } -static const arch_irn_ops_t *fallback_irn_ops = NULL; - -int arch_register_class_put(const arch_register_class_t *cls, struct _bitset_t *bs) +/** + * Put all registers in a class into a bitset. + * @param cls The class. + * @param bs The bitset. + * @return The number of registers in the class. + */ +static int arch_register_class_put(const arch_register_class_t *cls, bitset_t *bs) { - if(bs) { - int i, n; - for(i = 0, n = cls->n_regs; i < n; ++i) - bitset_set(bs, i); - } - - return cls->n_regs; + int i, n = cls->n_regs; + for (i = n - 1; i >= 0; --i) + bitset_set(bs, i); + return n; } /** * Get the isa responsible for a node. - * @param env The arch environment with the isa stack. * @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 arch_env_t *env, const ir_node *irn) +static INLINE 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; + + assert(be_ops); + return be_ops; +} + +const arch_irn_ops_t *arch_get_irn_ops(const arch_env_t *env, const ir_node *irn) +{ + (void)env; // TODO remove parameter + return get_irn_ops(irn); +} + +const arch_register_req_t *arch_get_register_req(const arch_env_t *env, + const ir_node *irn, int pos) +{ + const arch_irn_ops_t *ops = get_irn_ops(irn); + (void)env; // TODO remove parameter + return ops->get_irn_reg_req(irn, pos); +} + +void arch_set_frame_offset(const arch_env_t *env, ir_node *irn, int offset) +{ + const arch_irn_ops_t *ops = get_irn_ops(irn); + (void)env; // TODO remove parameter + ops->set_frame_offset(irn, offset); +} + +ir_entity *arch_get_frame_entity(const arch_env_t *env, const ir_node *irn) +{ + const arch_irn_ops_t *ops = get_irn_ops(irn); + (void)env; // TODO remove parameter + return ops->get_frame_entity(irn); +} + +void arch_set_frame_entity(const arch_env_t *env, ir_node *irn, ir_entity *ent) +{ + const arch_irn_ops_t *ops = get_irn_ops(irn); + (void)env; // TODO remove parameter + ops->set_frame_entity(irn, ent); +} + +int arch_get_sp_bias(const arch_env_t *env, ir_node *irn) +{ + const arch_irn_ops_t *ops = get_irn_ops(irn); + (void)env; // TODO remove parameter + return ops->get_sp_bias(irn); +} + +arch_inverse_t *arch_get_inverse(const arch_env_t *env, const ir_node *irn, int i, arch_inverse_t *inverse, struct obstack *obstack) +{ + const arch_irn_ops_t *ops = get_irn_ops(irn); + (void)env; // TODO remove parameter + + if(ops->get_inverse) { + return ops->get_inverse(irn, i, inverse, obstack); + } else { + return NULL; + } +} + +int arch_possible_memory_operand(const arch_env_t *env, const ir_node *irn, unsigned int i) { + const arch_irn_ops_t *ops = get_irn_ops(irn); + (void)env; // TODO remove parameter + + if(ops->possible_memory_operand) { + return ops->possible_memory_operand(irn, i); + } else { + return 0; + } +} + +void arch_perform_memory_operand(const arch_env_t *env, ir_node *irn, ir_node *spill, unsigned int i) { + const arch_irn_ops_t *ops = get_irn_ops(irn); + (void)env; // TODO remove parameter + + if(ops->perform_memory_operand) { + ops->perform_memory_operand(irn, spill, i); + } else { + return; + } +} + +int arch_get_op_estimated_cost(const arch_env_t *env, const ir_node *irn) { - int i; + const arch_irn_ops_t *ops = get_irn_ops(irn); + (void)env; // TODO remove parameter - for(i = env->handlers_tos - 1; i >= 0; --i) { - const arch_irn_ops_t *ops = env->handlers[i]->get_irn_ops(irn); - if(ops) - return ops; - } + if(ops->get_op_estimated_cost) { + return ops->get_op_estimated_cost(irn); + } else { + return 1; + } +} - return fallback_irn_ops; +int arch_is_possible_memory_operand(const arch_env_t *env, const ir_node *irn, int i) +{ + const arch_irn_ops_t *ops = get_irn_ops(irn); + (void)env; // TODO remove parameter + + if(ops->possible_memory_operand) { + return ops->possible_memory_operand(irn, i); + } else { + return 0; + } } -int arch_get_allocatable_regs(const arch_env_t *env, const ir_node *irn, - int pos, const arch_register_class_t *cls, bitset_t *bs) +int arch_get_allocatable_regs(const arch_env_t *env, const ir_node *irn, int pos, bitset_t *bs) { - const arch_irn_ops_t *ops = get_irn_ops(env, irn); - const arch_register_req_t *req = ops->get_irn_reg_req(irn, pos); + const arch_irn_ops_t *ops = get_irn_ops(irn); + const arch_register_req_t *req = ops->get_irn_reg_req(irn, pos); + (void)env; // TODO remove parameter - switch(req->type) { - case arch_register_req_type_normal: - arch_register_class_put(req->cls, bs); - return req->cls->n_regs; + if(req->type == arch_register_req_type_none) { + bitset_clear_all(bs); + return 0; + } - case arch_register_req_type_limited: - return req->data.limited(irn, pos, bs); + if(arch_register_req_is(req, limited)) { + rbitset_copy_to_bitset(req->limited, bs); + return bitset_popcnt(bs); + } - default: - assert(0 && "This register requirement case is not covered"); - } + arch_register_class_put(req->cls, bs); + return req->cls->n_regs; +} - return 0; +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_is_register_operand(const arch_env_t *env, + const ir_node *irn, int pos) +{ + const arch_irn_ops_t *ops = get_irn_ops(irn); + const arch_register_req_t *req = ops->get_irn_reg_req(irn, pos); + (void)env; // TODO remove parameter + + return req != NULL; } int arch_reg_is_allocatable(const arch_env_t *env, const ir_node *irn, int pos, const arch_register_t *reg) { - const arch_register_class_t *cls = arch_register_get_class(reg); - int n_regs = arch_register_class_n_regs(cls); - bitset_t *bs = bitset_alloca(n_regs); + const arch_register_req_t *req; + + req = arch_get_register_req(env, irn, pos); + + if(req->type == arch_register_req_type_none) + return 0; - arch_get_allocatable_regs(env, irn, pos, cls, bs); - return bitset_is_set(bs, arch_register_get_index(reg)); + 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 arch_env_t *env, const ir_node *irn, int pos) { - const arch_irn_ops_t *ops = get_irn_ops(env, irn); - const arch_register_req_t *req = ops->get_irn_reg_req(irn, pos); - return req ? req->cls : NULL; + const arch_irn_ops_t *ops = get_irn_ops(irn); + const arch_register_req_t *req = ops->get_irn_reg_req(irn, pos); + (void)env; // TODO remove parameter + + assert(req->type != arch_register_req_type_none || req->cls == NULL); + + return req->cls; } extern const arch_register_t * -arch_get_irn_register(const arch_env_t *env, const ir_node *irn, int idx) +arch_get_irn_register(const arch_env_t *env, const ir_node *irn) { - const arch_irn_ops_t *ops = get_irn_ops(env, irn); - assert(idx >= 0); - return ops->get_irn_reg(irn, idx); + const arch_irn_ops_t *ops = get_irn_ops(irn); + (void)env; // TODO remove parameter + return ops->get_irn_reg(irn); } extern void arch_set_irn_register(const arch_env_t *env, - ir_node *irn, int idx, const arch_register_t *reg) + ir_node *irn, const arch_register_t *reg) +{ + const arch_irn_ops_t *ops = get_irn_ops(irn); + (void)env; // TODO remove parameter + ops->set_irn_reg(irn, reg); +} + +extern arch_irn_class_t arch_irn_classify(const arch_env_t *env, const ir_node *irn) { - const arch_irn_ops_t *ops = get_irn_ops(env, irn); - assert(idx >= 0); - ops->set_irn_reg(irn, idx, reg); + const arch_irn_ops_t *ops = get_irn_ops(irn); + (void)env; // TODO remove parameter + return ops->classify(irn); } + +extern arch_irn_flags_t arch_irn_get_flags(const arch_env_t *env, const ir_node *irn) +{ + const arch_irn_ops_t *ops = get_irn_ops(irn); + (void)env; // TODO remove parameter + return ops->get_flags(irn); +} + +extern const char *arch_irn_flag_str(arch_irn_flags_t fl) +{ + switch(fl) { +#define XXX(x) case arch_irn_flags_ ## x: return #x; + XXX(dont_spill); + XXX(ignore); + XXX(rematerializable); + XXX(modify_sp); + XXX(modify_flags); + XXX(none); +#undef XXX + } + return "n/a"; +} + +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); + + 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)) { + const arch_register_t *reg = &req->cls->regs[i]; + strncat(buf, " ", len); + strncat(buf, reg->name, len); + } + } + } + + if(arch_register_req_is(req, should_be_same)) { + const unsigned other = req->other_same; + int i; + + ir_snprintf(tmp, sizeof(tmp), " same to:"); + 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); + } + } + } + + if (arch_register_req_is(req, must_be_different)) { + const unsigned other = req->other_different; + int i; + + ir_snprintf(tmp, sizeof(tmp), " 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); + } + } + } + + 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;