X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbearch.c;h=ec4aee0189b0856be3f0859b2d6fb113aebe6d87;hb=780d1704bdcc2332c68a5161cfaa0f15cee9c352;hp=c00de537a82547d1f37daaf41ba4df3756b9a4a9;hpb=2f5aa6031a432c4e49bb900243808d24a76f3cfb;p=libfirm

diff --git a/ir/be/bearch.c b/ir/be/bearch.c
index c00de537a..ec4aee018 100644
--- a/ir/be/bearch.c
+++ b/ir/be/bearch.c
@@ -1,293 +1,372 @@
-/**
- * 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.
  */
 
-#include <string.h>
-
-#include "bearch_t.h"
+/**
+ * @file
+ * @brief       Processor architecture specification.
+ * @author      Sebastian Hack
+ * @version     $Id$
+ */
+#include "config.h"
 
-#include "firm_config.h"
-#include "set.h"
+#include <string.h>
 
-#include "entity.h"
+#include "bearch.h"
+#include "benode.h"
+#include "beinfo.h"
 #include "ircons_t.h"
+#include "irnode_t.h"
+#include "irop_t.h"
 
-#if 1 /* HAVE_ALLOCA_H */
-#include <alloca.h>
-#endif /* HAVE_ALLOCA_H */
+#include "bitset.h"
+#include "pset.h"
+#include "raw_bitset.h"
 
-#define INIT_HEADER(tgt, kind_suffix, a_isa, str) \
-	do { \
-		arch_header_t *h = (arch_header_t *) (tgt); \
-		memset(tgt, 0, sizeof(*(tgt))); \
-		h->kind = arch_kind_ ## kind_suffix; \
-		h->name = new_id_from_str(str); \
-		h->isa = a_isa; \
-	} while(0)
+#include "irprintf.h"
 
-static INLINE int hash_header(const arch_header_t *header)
+/* 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)
 {
-	int res = HASH_PTR(header->isa);
-	res = 37 * res + HASH_STR(header->name, strlen(header->name));
-	res = 37 * res + header->kind;
-	return res;
+	arch_env_t *arch_env = isa_if->init(file_handle);
+	arch_env->main_env   = main_env;
+	return arch_env;
 }
 
-static int cmp_header(const void *a, const void *b, size_t size)
+/**
+ * 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)
 {
-	const arch_header_t *h1 = a;
-	const arch_header_t *h2 = b;
+	const ir_op          *ops;
+	const arch_irn_ops_t *be_ops;
 
-	return !(h1->kind == h2->kind && strcmp(h1->name, h2->name) == 0);
-}
+	if (is_Proj(irn)) {
+		irn = get_Proj_pred(irn);
+		assert(!is_Proj(irn));
+	}
 
-static set *arch_data = NULL;
+	ops    = get_irn_op(irn);
+	be_ops = get_op_ops(ops)->be_ops;
 
-static set *get_arch_data(void)
-{
-	if(!arch_data)
-		arch_data = new_set(cmp_header, 256);
-
-	return arch_data;
+	return be_ops;
 }
 
-typedef struct _obj_info_t {
-	const char *name;
-	int listed_in_isa;
-	size_t size;
-} obj_info_t;
-
-static const obj_info_t obj_info[] = {
-#define ARCH_OBJ(name,listed_in_isa)		{ #name, listed_in_isa, sizeof(arch_ ## name ## _t) },
-#include "bearch_obj.def"
-#undef ARCH_OBJ
-	{ 0 }
-};
-
-/**
- * Insert an arch object to the global arch obj storage.
- *
- * If the object has already been created there, nothing is done and
- * the old object is created.
- *
- * @param kind The kind of the arch object.
- * @param isa The isa the object belongs to or NULL if it is the isa
- * itself.
- * @param name The name of the object.
- * @param was_new A pointer to an int where 1/0 is stored if the
- * object was created or already present. If NULL, it is simply ignored.
- * @return A pointer to the object.
- */
-static INLINE void *_arch_data_insert(arch_kind_t kind, arch_isa_t *isa,
-		const char *name, size_t size, int *was_new)
+const arch_register_req_t *arch_get_register_req(const ir_node *irn, int pos)
 {
-	const obj_info_t *info = &obj_info[kind];
-	arch_header_t *data = alloca(size);
-	arch_header_t *res = NULL;
-
-	memset(data, 0, size);
-	data->kind = kind;
-	data->isa = isa;
-	data->name = get_id_str(new_id_from_str(name));
-	data->is_new = 1;
-
-	res = set_insert(get_arch_data(), data, size, hash_header(data));
-
-	/* If the object is newly created and thus not yet present
-	 * in the set, add it to the isa */
-	if(res->is_new) {
-
-		/*
-		 * The inserted object was no isa, list it in the isa if this is
-		 * desired.
-		 */
-		if(isa && info->listed_in_isa)
-			list_add(&res->list, &isa->heads[kind]);
-
-		/* The inserted object is an isa, so initialize all its list heads. */
-		else {
-			int i;
-			arch_isa_t *isa = (arch_isa_t *) res;
-
-			for(i = 0; i < arch_kind_last; ++i)
-				INIT_LIST_HEAD(&isa->heads[i]);
-		}
+	if (is_Proj(irn)) {
+		assert(pos == -1);
+		pos = -1-get_Proj_proj(irn);
+		irn = get_Proj_pred(irn);
 	}
 
-	/*
-	 * If the caller wants to know, of the object was newly created,
-	 * give it to him.
-	 */
-	if(was_new)
-		*was_new = res->is_new;
+	if (pos < 0) {
+		return arch_get_out_register_req(irn, -pos-1);
+	} else {
+		const arch_irn_ops_t *ops = get_irn_ops_simple(irn);
+		return ops->get_irn_reg_req_in(irn, pos);
+	}
+}
 
-	/* Mark the object as NOT new. */
-	res->is_new = 0;
+void arch_set_frame_offset(ir_node *irn, int offset)
+{
+	const arch_irn_ops_t *ops = get_irn_ops(irn);
+	ops->set_frame_offset(irn, offset);
+}
 
-	return res;
+ir_entity *arch_get_frame_entity(const ir_node *irn)
+{
+	const arch_irn_ops_t *ops = get_irn_ops(irn);
+	return ops->get_frame_entity(irn);
 }
 
-#define arch_data_insert(type_suffix, isa, name, was_new) \
-	_arch_data_insert(arch_kind_ ## type_suffix, isa, name, sizeof(arch_ ## type_suffix ## _t), was_new)
+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);
+}
 
-static INLINE void *_arch_data_find(arch_kind_t kind, const arch_isa_t *isa, const char *name)
+int arch_get_sp_bias(ir_node *irn)
 {
-	arch_header_t header;
+	const arch_irn_ops_t *ops = get_irn_ops(irn);
+	return ops->get_sp_bias(irn);
+}
 
-	memset(&header, 0, sizeof(header));
-	header.kind = kind;
-	header.isa = (arch_isa_t *) isa;
-	header.name = name;
+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);
 
-	return set_find(get_arch_data(), &header, sizeof(header), hash_header(&header));
+	if (ops->get_inverse) {
+		return ops->get_inverse(irn, i, inverse, obstack);
+	} else {
+		return NULL;
+	}
 }
 
-#define arch_data_find(type_suffix, isa, name) \
-	_arch_data_find(arch_kind_ ## type_suffix, isa, name)
+int arch_possible_memory_operand(const ir_node *irn, unsigned int i)
+{
+	const arch_irn_ops_t *ops = get_irn_ops(irn);
 
-arch_isa_t *arch_add_isa(const char *name)
+	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)
 {
-	return arch_data_insert(isa, NULL, name, NULL);
+	const arch_irn_ops_t *ops = get_irn_ops(irn);
+
+	if (ops->perform_memory_operand) {
+		ops->perform_memory_operand(irn, spill, i);
+	} else {
+		return;
+	}
 }
 
-arch_register_class_t *arch_add_register_class(arch_isa_t *isa, const char *name, int n_regs)
+int arch_get_op_estimated_cost(const ir_node *irn)
 {
-	arch_register_class_t *cls =
-		_arch_data_insert(arch_kind_register_class, isa, name,
-				sizeof(arch_register_class_t) + n_regs * sizeof(arch_register_t *), NULL);
+	const arch_irn_ops_t *ops = get_irn_ops(irn);
 
-	cls->n_regs = n_regs;
+	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;
 
-	return cls;
+	for (i = 0; i < cls->n_regs; ++i) {
+		if (!arch_register_type_is(&cls->regs[i], ignore))
+			bitset_set(bs, i);
+	}
 }
 
-arch_register_t *arch_add_register(arch_register_class_t *cls, int index, const char *name)
+int arch_reg_is_allocatable(const ir_node *irn, int pos,
+                            const arch_register_t *reg)
 {
-	arch_register_t *reg = NULL;
+	const arch_register_req_t *req = arch_get_register_req(irn, pos);
 
-	assert(index >= 0 && index < cls->n_regs);
-	reg = _arch_data_insert(arch_kind_register, arch_obj_get_isa(cls), name,
-			sizeof(arch_register_t), NULL);
-	cls->regs[index] = reg;
+	if (req->type == arch_register_req_type_none)
+		return 0;
 
-	reg->index = index;
-	reg->reg_class = cls;
-	reg->flags = arch_register_flag_none;
+	if (arch_register_req_is(req, limited)) {
+		if (arch_register_get_class(reg) != req->cls)
+			return 0;
+		return rbitset_is_set(req->limited, arch_register_get_index(reg));
+	}
 
-	return reg;
+	return req->cls == reg->reg_class;
 }
 
-arch_immediate_t *arch_add_immediate(arch_isa_t *isa, const char *name, ir_mode *mode)
+const arch_register_class_t *arch_get_irn_reg_class(const ir_node *irn, int pos)
 {
-	arch_immediate_t *imm = arch_data_insert(immediate, isa, name, NULL);
-	imm->mode = mode;
-	return imm;
-}
+	const arch_register_req_t *req = arch_get_register_req(irn, pos);
 
-static const size_t operand_sizes[] = {
-	0,
-	0,
-	sizeof(entity *),
-	sizeof(arch_register_t *),
-	sizeof(tarval *)
-};
+	assert(req->type != arch_register_req_type_none || req->cls == NULL);
 
-arch_insn_format_t *arch_add_insn_format(arch_isa_t *isa, const char *name, int n_in, int n_out)
+	return req->cls;
+}
+
+static inline reg_out_info_t *get_out_info(const ir_node *node)
 {
-	int i;
-
-	arch_insn_format_t *fmt =
-		_arch_data_insert(arch_kind_insn_format, isa, name,
-				sizeof(arch_insn_format_t) + (n_in + n_out) * sizeof(arch_operand_type_t), NULL);
-
-	fmt->n_in = n_in;
-	fmt->n_out = n_out;
-	fmt->irn_data_size = 0;
-
-	/*
-	 * Compute the number of bytes which must be extra allocated if this
-	 * opcode is instantiated.
-	 */
-	for(i = 0; i < fmt->n_in; ++i) {
-		arch_operand_t *op = arch_get_in_operand(fmt, i);
-		op->offset_in_irn_data = fmt->irn_data_size;
-		fmt->irn_data_size += operand_sizes[op->type];
-	}
+	int                   pos  = 0;
+	const backend_info_t *info;
 
-	if(fmt->n_out == 1) {
-		arch_operand_t *op = arch_get_in_operand(fmt, i);
-		op->offset_in_irn_data = fmt->irn_data_size;
-		fmt->irn_data_size += operand_sizes[op->type];
+	assert(get_irn_mode(node) != mode_T);
+	if (is_Proj(node)) {
+		pos  = get_Proj_proj(node);
+		node = get_Proj_pred(node);
 	}
 
-	return fmt;
+	info = be_get_info(node);
+	assert(pos >= 0 && pos < ARR_LEN(info->out_infos));
+	return &info->out_infos[pos];
 }
 
-arch_insn_t *arch_add_insn(arch_insn_format_t *fmt, const char *name)
+
+static inline reg_out_info_t *get_out_info_n(const ir_node *node, int pos)
 {
-	/* Insert the insn into the isa. */
-	arch_insn_t *insn = arch_data_insert(insn, arch_obj_get_isa(fmt), name, NULL);
+	const backend_info_t *info = be_get_info(node);
+	assert(!is_Proj(node));
+	assert(pos >= 0 && pos < ARR_LEN(info->out_infos));
+	return &info->out_infos[pos];
+}
 
-	insn->format = fmt;
-	insn->op = new_ir_op(get_next_ir_opcode(), name, op_pin_state_pinned, 0,
-			oparity_dynamic, 0, sizeof(arch_irn_data_t) + fmt->irn_data_size);
 
-	return insn;
+const arch_register_t *arch_get_irn_register(const ir_node *node)
+{
+	const reg_out_info_t *out = get_out_info(node);
+	return out->reg;
 }
 
-arch_insn_format_t *arch_find_insn_format(const arch_isa_t *isa, const char *name)
+const arch_register_t *arch_irn_get_register(const ir_node *node, int pos)
 {
-	return arch_data_find(insn_format, isa, name);
+	const reg_out_info_t *out = get_out_info_n(node, pos);
+	return out->reg;
 }
 
-arch_isa_t *arch_find_isa(const char *name)
+void arch_irn_set_register(ir_node *node, int pos, const arch_register_t *reg)
 {
-	return arch_data_find(isa, NULL, name);
+	reg_out_info_t *out = get_out_info_n(node, pos);
+	out->reg            = reg;
 }
 
-arch_insn_t *arch_find_insn(const arch_isa_t *isa, const char *name)
+void arch_set_irn_register(ir_node *node, const arch_register_t *reg)
 {
-	return arch_data_find(insn, isa, name);
+	reg_out_info_t *out = get_out_info(node);
+	out->reg = reg;
 }
 
-arch_register_class_t *arch_find_register_class_t(arch_isa_t *isa, const char *name)
+arch_irn_class_t arch_irn_classify(const ir_node *node)
 {
-	return arch_data_find(register_class, isa, name);
+	const arch_irn_ops_t *ops = get_irn_ops(node);
+	return ops->classify(node);
 }
 
-arch_register_set_t *arch_get_register_set_for_class(arch_register_class_t *cls)
+arch_irn_flags_t arch_irn_get_flags(const ir_node *node)
 {
-	return _arch_get_register_set_for_class(cls);
+	backend_info_t *info = be_get_info(node);
+	return info->flags;
 }
 
-ir_node *arch_new_node(const arch_insn_t *insn, ir_graph *irg, ir_node *block,
-		ir_mode *mode, int arity, ir_node **in)
+void arch_irn_set_flags(ir_node *node, arch_irn_flags_t flags)
 {
-	ir_node *irn = new_ir_node(NULL, irg, block, insn->op, mode, arity, in);
-	arch_irn_data_t *data = (void *) &irn->attr;
-
-	data->magic = ARCH_IRN_FOURCC;
-	data->insn = insn;
+	backend_info_t *info = be_get_info(node);
+	info->flags = flags;
+}
 
-	return irn;
+void arch_irn_add_flags(ir_node *node, arch_irn_flags_t flags)
+{
+	backend_info_t *info = be_get_info(node);
+	info->flags |= flags;
 }
 
-ir_node *arch_new_node_bare(const arch_insn_t *insn, ir_graph *irg, int arity)
+void arch_dump_register_req(FILE *F, const arch_register_req_t *req,
+                            const ir_node *node)
 {
-	int i;
-	ir_node **in = alloca(sizeof(in[0]) * arity);
+	if (req == NULL || req->type == arch_register_req_type_none) {
+		fprintf(F, "n/a");
+		return;
+	}
+
+	fprintf(F, "%s", req->cls->name);
+
+	if (arch_register_req_is(req, limited)) {
+		unsigned n_regs = req->cls->n_regs;
+		unsigned 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];
+				fprintf(F, " %s", reg->name);
+			}
+		}
+	}
 
-	for(i = 0; i < arity; ++i)
-		in[i] = new_Unknown(mode_Is);
+	if (arch_register_req_is(req, should_be_same)) {
+		const unsigned other = req->other_same;
+		int i;
 
-	return arch_new_node(insn, irg, new_Unknown(mode_BB), mode_Is, arity, in);
+		fprintf(F, " same as");
+		for (i = 0; 1U << i <= other; ++i) {
+			if (other & (1U << i)) {
+				ir_fprintf(F, " %+F", get_irn_n(skip_Proj_const(node), i));
+			}
+		}
+	}
+
+	if (arch_register_req_is(req, must_be_different)) {
+		const unsigned other = req->other_different;
+		int i;
+
+		fprintf(F, " different from");
+		for (i = 0; 1U << i <= other; ++i) {
+			if (other & (1U << i)) {
+				ir_fprintf(F, " %+F", get_irn_n(skip_Proj_const(node), i));
+			}
+		}
+	}
+
+	if (arch_register_req_is(req, ignore)) {
+		fprintf(F, " ignore");
+	}
+	if (arch_register_req_is(req, produces_sp)) {
+		fprintf(F, " produces_sp");
+	}
 }
 
-ir_mode *arch_get_unknown_mode(void)
+void arch_dump_reqs_and_registers(FILE *F, const ir_node *node)
 {
-	return mode_Is;
+	int              n_ins  = get_irn_arity(node);
+	int              n_outs = arch_irn_get_n_outs(node);
+	arch_irn_flags_t flags  = arch_irn_get_flags(node);
+	int              i;
+
+	for (i = 0; i < n_ins; ++i) {
+		const arch_register_req_t *req = arch_get_in_register_req(node, i);
+		fprintf(F, "inreq #%d = ", i);
+		arch_dump_register_req(F, req, node);
+		fputs("\n", F);
+	}
+	for (i = 0; i < n_outs; ++i) {
+		const arch_register_req_t *req = arch_get_out_register_req(node, i);
+		fprintf(F, "outreq #%d = ", i);
+		arch_dump_register_req(F, req, node);
+		fputs("\n", F);
+	}
+	for (i = 0; i < n_outs; ++i) {
+		const arch_register_t     *reg = arch_irn_get_register(node, i);
+		const arch_register_req_t *req = arch_get_out_register_req(node, i);
+		if (req->cls == NULL)
+			continue;
+		fprintf(F, "reg #%d = %s\n", i, reg != NULL ? reg->name : "n/a");
+	}
+
+	fprintf(F, "flags =");
+	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");
+		}
+	}
+	fprintf(F, " (%d)\n", flags);
 }
+
+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;