X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;ds=sidebyside;f=ir%2Fbe%2Fbearch.c;h=e64ca431c2a0bdbc98953996a1efc9f877da0b78;hb=939b0af78227f2d14a4362a1b5518fd9e05b1053;hp=3749ace9f6e6378407889dfcd138e2d5049d1238;hpb=2f8c9ceec78590ae8e19118a3bb7286286bfcd86;p=libfirm

diff --git a/ir/be/bearch.c b/ir/be/bearch.c
index 3749ace9f..e64ca431c 100644
--- a/ir/be/bearch.c
+++ b/ir/be/bearch.c
@@ -1,322 +1,369 @@
-/**
- * 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.
  */
 
-#ifdef HAVE_CONFIG_H
+/**
+ * @file
+ * @brief       Processor architecture specification.
+ * @author      Sebastian Hack
+ * @version     $Id$
+ */
 #include "config.h"
-#endif
-
-#ifdef HAVE_ALLOCA_H
-#include <alloca.h>
-#endif
-
-#ifdef HAVE_MALLOC_H
-#include <malloc.h>
-#endif
 
 #include <string.h>
 
 #include "bearch.h"
+#include "benode.h"
+#include "beinfo.h"
 #include "ircons_t.h"
 #include "irnode_t.h"
+#include "irop_t.h"
 
 #include "bitset.h"
 #include "pset.h"
-#include "entity.h"
+#include "raw_bitset.h"
 
 #include "irprintf.h"
 
 /* Initialize the architecture environment struct. */
-arch_env_t *arch_env_init(arch_env_t *env, const arch_isa_if_t *isa_if, FILE *file_handle, be_main_env_t *main_env)
-{
-  memset(env, 0, sizeof(*env));
-  env->isa                  = isa_if->init(file_handle);
-  env->isa->main_env        = main_env;
-  return env;
-}
-
-arch_env_t *arch_env_push_irn_handler(arch_env_t *env,
-    const arch_irn_handler_t *handler)
+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;
-}
-
-const arch_irn_handler_t *arch_env_pop_irn_handler(arch_env_t *env)
-{
-  assert(env->handlers_tos > 0 && env->handlers_tos <= ARCH_MAX_HANDLERS);
-  return env->handlers[--env->handlers_tos];
-}
-
-static const arch_irn_ops_t *fallback_irn_ops = NULL;
-
-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;
+	arch_env_t *arch_env = isa_if->init(file_handle);
+	arch_env->main_env   = main_env;
+	return arch_env;
 }
 
 /**
  * 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)
 {
-  int i;
+	const ir_op          *ops;
+	const arch_irn_ops_t *be_ops;
 
-  for(i = env->handlers_tos - 1; i >= 0; --i) {
-    const arch_irn_handler_t *handler = env->handlers[i];
-    const arch_irn_ops_t *ops = handler->get_irn_ops(handler, irn);
+	if (is_Proj(irn)) {
+		irn = get_Proj_pred(irn);
+		assert(!is_Proj(irn));
+	}
 
-    if(ops)
-      return ops;
-  }
+	ops    = get_irn_op(irn);
+	be_ops = get_op_ops(ops)->be_ops;
 
-  return fallback_irn_ops;
+	return be_ops;
 }
 
-const arch_irn_ops_t *arch_get_irn_ops(const arch_env_t *env, const ir_node *irn) {
-	return get_irn_ops(env, irn);
-}
-
-const arch_register_req_t *arch_get_register_req(const arch_env_t *env,
-    arch_register_req_t *req, const ir_node *irn, int pos)
+const arch_register_req_t *arch_get_register_req(const ir_node *irn, int pos)
 {
-  const arch_irn_ops_t *ops = get_irn_ops(env, irn);
-  req->type = arch_register_req_type_none;
-  return ops->impl->get_irn_reg_req(ops, req, irn, pos);
+	if (is_Proj(irn)) {
+		ir_node *pred = get_Proj_pred(irn);
+		long     pn   = get_Proj_proj(irn);
+		assert(pos == -1);
+		return arch_get_out_register_req(pred, pn);
+	}
+
+	if (pos < 0) {
+		return arch_get_out_register_req(irn, -pos-1);
+	} else {
+		return arch_get_in_register_req(irn, pos);
+	}
 }
 
-void arch_set_frame_offset(const arch_env_t *env, ir_node *irn, int offset)
+void arch_set_frame_offset(ir_node *irn, int offset)
 {
-  const arch_irn_ops_t *ops = get_irn_ops(env, irn);
-  ops->impl->set_frame_offset(ops, irn, offset);
+	const arch_irn_ops_t *ops = get_irn_ops(irn);
+	ops->set_frame_offset(irn, offset);
 }
 
-ir_entity *arch_get_frame_entity(const arch_env_t *env, ir_node *irn)
+ir_entity *arch_get_frame_entity(const ir_node *irn)
 {
-  const arch_irn_ops_t *ops = get_irn_ops(env, irn);
-  return ops->impl->get_frame_entity(ops, irn);
+	const arch_irn_ops_t *ops = get_irn_ops(irn);
+	return ops->get_frame_entity(irn);
 }
 
-void arch_set_frame_entity(const arch_env_t *env, ir_node *irn, ir_entity *ent)
+int arch_get_sp_bias(ir_node *irn)
 {
-	const arch_irn_ops_t *ops = get_irn_ops(env, irn);
-	ops->impl->set_frame_entity(ops, irn, ent);
+	const arch_irn_ops_t *ops = get_irn_ops(irn);
+	return ops->get_sp_bias(irn);
 }
 
-int arch_get_sp_bias(const arch_env_t *env, ir_node *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(env, irn);
-	return ops->impl->get_sp_bias(ops, irn);
+	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;
+	}
 }
 
-arch_inverse_t *arch_get_inverse(const arch_env_t *env, const ir_node *irn, int i, arch_inverse_t *inverse, struct obstack *obstack)
+int arch_possible_memory_operand(const ir_node *irn, unsigned int i)
 {
-  const arch_irn_ops_t *ops = get_irn_ops(env, irn);
-  if(ops->impl->get_inverse) {
-    return ops->impl->get_inverse(ops, irn, i, inverse, obstack);
-  } else {
-    return NULL;
-  }
-}
+	const arch_irn_ops_t *ops = get_irn_ops(irn);
 
-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(env, irn);
-	if(ops->impl->possible_memory_operand) {
-		return ops->impl->possible_memory_operand(ops, irn, i);
+	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(env, irn);
-	if(ops->impl->perform_memory_operand) {
-		ops->impl->perform_memory_operand(ops, irn, spill, i);
+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;
 	}
 }
 
-int arch_get_op_estimated_cost(const arch_env_t *env, const ir_node *irn)
+int arch_get_op_estimated_cost(const ir_node *irn)
 {
-  const arch_irn_ops_t *ops = get_irn_ops(env, irn);
-  if(ops->impl->get_op_estimated_cost) {
-    return ops->impl->get_op_estimated_cost(ops, irn);
-  } else {
-    return 1;
-  }
-}
+	const arch_irn_ops_t *ops = get_irn_ops(irn);
 
-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(env, irn);
-  if(ops->impl->possible_memory_operand) {
-    return ops->impl->possible_memory_operand(ops, irn, i);
-  } else {
-    return 0;
-  }
+	if (ops->get_op_estimated_cost) {
+		return ops->get_op_estimated_cost(irn);
+	} else {
+		return 1;
+	}
 }
 
-int arch_get_allocatable_regs(const arch_env_t *env, const ir_node *irn, int pos, bitset_t *bs)
+int arch_reg_is_allocatable(const ir_node *irn, int pos,
+                            const arch_register_t *reg)
 {
-  arch_register_req_t local_req;
-  const arch_irn_ops_t *ops = get_irn_ops(env, irn);
-  const arch_register_req_t *req = ops->impl->get_irn_reg_req(ops, &local_req, irn, pos);
-
-  if(req->type == arch_register_req_type_none) {
-	  bitset_clear_all(bs);
-	  return 0;
-  }
-
-  if(arch_register_req_is(req, limited)) {
-	  req->limited(req->limited_env, bs);
-	  return bitset_popcnt(bs);
-  }
-
-  arch_register_class_put(req->cls, bs);
-  return req->cls->n_regs;
-}
+	const arch_register_req_t *req = arch_get_register_req(irn, pos);
 
-void arch_put_non_ignore_regs(const arch_env_t *env, const arch_register_class_t *cls, bitset_t *bs)
-{
-	int i;
+	if (req->type == arch_register_req_type_none)
+		return 0;
 
-	for(i = 0; i < cls->n_regs; ++i) {
-		if(!arch_register_type_is(&cls->regs[i], ignore))
-			bitset_set(bs, i);
+	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 req->cls == reg->reg_class;
 }
 
-int arch_count_non_ignore_regs(const arch_env_t *env, const arch_register_class_t *cls)
+const arch_register_class_t *arch_get_irn_reg_class(const ir_node *irn, int pos)
 {
-	int i;
-	int result = 0;
+	const arch_register_req_t *req = arch_get_register_req(irn, pos);
 
-	for(i = 0; i < cls->n_regs; ++i) {
-		if(!arch_register_type_is(&cls->regs[i], ignore))
-			result++;
-	}
+	assert(req->type != arch_register_req_type_none || req->cls == NULL);
 
-	return result;
+	return req->cls;
 }
 
-int arch_is_register_operand(const arch_env_t *env,
-    const ir_node *irn, int pos)
+static inline reg_out_info_t *get_out_info(const ir_node *node)
 {
-	arch_register_req_t local_req;
-	const arch_irn_ops_t *ops = get_irn_ops(env, irn);
-	const arch_register_req_t *req = ops->impl->get_irn_reg_req(ops, &local_req, irn, pos);
-	return req != NULL;
+	size_t                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 < ARR_LEN(info->out_infos));
+	return &info->out_infos[pos];
 }
 
-int arch_reg_is_allocatable(const arch_env_t *env, const ir_node *irn,
-    int pos, const arch_register_t *reg)
-{
-	arch_register_req_t req;
 
-	arch_get_register_req(env, &req, irn, pos);
+static inline reg_out_info_t *get_out_info_n(const ir_node *node, int pos)
+{
+	const backend_info_t *info = be_get_info(node);
+	assert(!is_Proj(node));
+	assert(pos >= 0 && pos < (int)ARR_LEN(info->out_infos));
+	return &info->out_infos[pos];
+}
 
-	if(req.type == arch_register_req_type_none)
-		return 0;
 
-	if(arch_register_req_is(&req, limited)) {
-		bitset_t *bs = bitset_alloca(req.cls->n_regs);
-		req.limited(req.limited_env, bs);
-		return bitset_is_set(bs, arch_register_get_index(reg));
-	}
+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;
+}
 
-	return req.cls == reg->reg_class;
+const arch_register_t *arch_irn_get_register(const ir_node *node, int pos)
+{
+	const reg_out_info_t *out = get_out_info_n(node, pos);
+	return out->reg;
 }
 
-const arch_register_class_t *
-arch_get_irn_reg_class(const arch_env_t *env, const ir_node *irn, int pos)
+void arch_irn_set_register(ir_node *node, int pos, const arch_register_t *reg)
 {
-  arch_register_req_t local_req;
-  const arch_irn_ops_t *ops = get_irn_ops(env, irn);
-  const arch_register_req_t *req = ops->impl->get_irn_reg_req(ops, &local_req, irn, pos);
-  return req ? req->cls : NULL;
+	reg_out_info_t *out = get_out_info_n(node, pos);
+	out->reg            = reg;
 }
 
-extern const arch_register_t *
-arch_get_irn_register(const arch_env_t *env, const ir_node *irn)
+void arch_set_irn_register(ir_node *node, const arch_register_t *reg)
 {
-  const arch_irn_ops_t *ops = get_irn_ops(env, irn);
-  return ops->impl->get_irn_reg(ops, irn);
+	reg_out_info_t *out = get_out_info(node);
+	out->reg = reg;
 }
 
-extern void arch_set_irn_register(const arch_env_t *env,
-    ir_node *irn, const arch_register_t *reg)
+arch_irn_class_t arch_irn_classify(const ir_node *node)
 {
-  const arch_irn_ops_t *ops = get_irn_ops(env, irn);
-  ops->impl->set_irn_reg(ops, irn, reg);
+	const arch_irn_ops_t *ops = get_irn_ops(node);
+	return ops->classify(node);
 }
 
-extern arch_irn_class_t arch_irn_classify(const arch_env_t *env, const ir_node *irn)
+arch_irn_flags_t arch_irn_get_flags(const ir_node *node)
 {
-  const arch_irn_ops_t *ops = get_irn_ops(env, irn);
-  return ops->impl->classify(ops, irn);
+	backend_info_t *info = be_get_info(node);
+	return info->flags;
 }
 
-extern arch_irn_flags_t arch_irn_get_flags(const arch_env_t *env, const ir_node *irn)
+void arch_irn_set_flags(ir_node *node, arch_irn_flags_t flags)
 {
-  const arch_irn_ops_t *ops = get_irn_ops(env, irn);
-  return ops->impl->get_flags(ops, irn);
+	backend_info_t *info = be_get_info(node);
+	info->flags = flags;
 }
 
-extern const char *arch_irn_flag_str(arch_irn_flags_t fl)
+void arch_irn_add_flags(ir_node *node, arch_irn_flags_t flags)
 {
-	switch(fl) {
-#define XXX(x) case arch_irn_flags_ ## x: return #x;
-		XXX(dont_spill);
-		XXX(ignore);
-		XXX(rematerializable);
-		XXX(modify_sp);
-		XXX(none);
-#undef XXX
-	}
-	return "n/a";
+	backend_info_t *info = be_get_info(node);
+	info->flags |= flags;
 }
 
-extern char *arch_register_req_format(char *buf, size_t len, const arch_register_req_t *req)
+void arch_dump_register_req(FILE *F, 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)) {
-		bitset_pos_t elm;
-		bitset_t *bs = bitset_alloca(req->cls->n_regs);
-		req->limited(req->limited_env, bs);
-		strncat(buf, " limited:", len);
-		bitset_foreach(bs, elm) {
-			strncat(buf, " ", len);
-			strncat(buf, req->cls->regs[elm].name, len);
+	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);
+			}
+		}
+	}
+
+	if (arch_register_req_is(req, should_be_same)) {
+		const unsigned other = req->other_same;
+		int i;
+
+		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, should_be_same)) {
-		ir_snprintf(tmp, sizeof(tmp), " same to: %+F", req->other_different);
-		strncat(buf, tmp, len);
+	if (req->width != 1) {
+		fprintf(F, " width:%u", req->width);
 	}
+	if (arch_register_req_is(req, aligned)) {
+		fprintf(F, " aligned");
+	}
+	if (arch_register_req_is(req, ignore)) {
+		fprintf(F, " ignore");
+	}
+	if (arch_register_req_is(req, produces_sp)) {
+		fprintf(F, " produces_sp");
+	}
+}
 
-	if(arch_register_req_is(req, should_be_different)) {
-		ir_snprintf(tmp, sizeof(tmp), " different to: %+F", req->other_different);
-		strncat(buf, tmp, len);
+void arch_dump_reqs_and_registers(FILE *F, const ir_node *node)
+{
+	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");
 	}
 
-	return buf;
+	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");
+		}
+		if (flags & arch_irn_flags_simple_jump) {
+			fprintf(F, " simple_jump");
+		}
+		if (flags & arch_irn_flags_not_scheduled) {
+			fprintf(F, " not_scheduled");
+		}
+	}
+	fprintf(F, " (%d)\n", flags);
 }
+
+static const arch_register_req_t no_requirement = {
+	arch_register_req_type_none,
+	NULL,
+	NULL,
+	0,
+	0,
+	0
+};
+const arch_register_req_t *arch_no_register_req = &no_requirement;