/*
- * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
+ * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
*
* This file is part of libFirm.
*
#include "bemachine.h"
#include "beirg.h"
#include "beabi.h"
+#include "raw_bitset.h"
/**
* A register.
struct arch_register_t {
const char *name; /**< The name of the register. */
const arch_register_class_t *reg_class; /**< The class the register belongs to. */
- int index; /**< The index of the register in the class. */
+ unsigned index; /**< The index of the register in the class. */
arch_register_type_t type; /**< The type of the register. */
void *data; /**< Custom data. */
};
return reg->reg_class;
}
-static INLINE int _arch_register_get_index(const arch_register_t *reg)
+static INLINE
+unsigned _arch_register_get_index(const arch_register_t *reg)
{
return reg->index;
}
-static INLINE const char *_arch_register_get_name(const arch_register_t *reg)
+static INLINE
+const char *_arch_register_get_name(const arch_register_t *reg)
{
return reg->name;
}
* Like general purpose or floating point.
*/
struct arch_register_class_t {
- const char *name; /**< The name of the register class. */
- int n_regs; /**< Number of registers in this class. */
- ir_mode *mode; /**< The mode of the register class. */
- const arch_register_t *regs; /**< The array of registers. */
+ unsigned index; /**< index of this register class */
+ const char *name; /**< The name of the register class.*/
+ unsigned n_regs; /**< Number of registers in this
+ class. */
+ ir_mode *mode; /**< The mode of the register class.*/
+ const arch_register_t *regs; /**< The array of registers. */
+ arch_register_class_flags_t flags; /**< register class flags. */
};
/** return the number of registers in this register class */
/** return the name of this register class */
#define arch_register_class_name(cls) ((cls)->name)
+/** return the index of this register class */
+#define arch_register_class_index(cls) ((cls)->index)
+
+/** return the register class flags */
+#define arch_register_class_flags(cls) ((cls)->flags)
+
static INLINE const arch_register_t *
-_arch_register_for_index(const arch_register_class_t *cls, int idx)
+_arch_register_for_index(const arch_register_class_t *cls, unsigned idx)
{
- assert(0 <= idx && idx < cls->n_regs);
+ assert(idx < cls->n_regs);
return &cls->regs[idx];
}
const unsigned *limited; /**< allowed register bitset */
- int other_same; /**< The in number which shall have
- the same res (should_be_same)*/
- int other_different; /**< The other node from which this
- one's register must be different
- (case must_be_different). */
+ unsigned other_same; /**< Bitmask of ins which should use the
+ same register (should_be_same). */
+ unsigned other_different; /**< Bitmask of ins which shall use a
+ different register
+ (must_be_different) */
};
-struct arch_flag_t {
- const char *name;
- unsigned index;
-};
+static INLINE int reg_reqs_equal(const arch_register_req_t *req1,
+ const arch_register_req_t *req2)
+{
+ if (req1 == req2)
+ return 1;
+
+ if (req1->type != req2->type
+ || req1->cls != req2->cls
+ || req1->other_same != req2->other_same
+ || req1->other_different != req2->other_different)
+ return 0;
+
+ if (req1->limited != NULL) {
+ size_t n_regs;
+
+ if (req2->limited == NULL)
+ return 0;
+
+ n_regs = arch_register_class_n_regs(req1->cls);
+ if (!rbitset_equal(req1->limited, req2->limited, n_regs))
+ return 0;
+ }
+
+ return 1;
+}
/**
* An inverse operation returned by the backend
*/
void *(*init)(be_irg_t *birg);
+ /**
+ * return node used as base in pic code addresses
+ */
+ ir_node* (*get_pic_base)(void *self);
+
/**
* Called before abi introduce.
*/
#define arch_code_generator_done(cg) _arch_cg_call(cg, done)
#define arch_code_generator_spill(cg, birg) _arch_cg_call_env(cg, birg, spill)
#define arch_code_generator_has_spiller(cg) ((cg)->impl->spill != NULL)
+#define arch_code_generator_get_pic_base(cg) \
+ ((cg)->impl->get_pic_base != NULL ? (cg)->impl->get_pic_base(cg) : NULL)
/**
* Code generator base class.
const arch_isa_if_t *impl;
const arch_register_t *sp; /** The stack pointer register. */
const arch_register_t *bp; /** The base pointer register. */
- const int stack_dir; /** -1 for decreasing, 1 for increasing. */
+ int stack_dir; /** -1 for decreasing, 1 for increasing. */
+ int stack_alignment; /** stack alignment */
const be_main_env_t *main_env; /** the be main environment */
+ int spill_cost; /** cost for a be_Spill node */
+ int reload_cost; /** cost for a be_Reload node */
};
#define arch_isa_stack_dir(isa) ((isa)->stack_dir)
* Get the the number of register classes in the isa.
* @return The number of register classes.
*/
- int (*get_n_reg_class)(const void *self);
+ unsigned (*get_n_reg_class)(const void *self);
/**
* Get the i-th register class.
* @param i The number of the register class.
* @return The register class.
*/
- const arch_register_class_t *(*get_reg_class)(const void *self, int i);
+ const arch_register_class_t *(*get_reg_class)(const void *self, unsigned i);
/**
* Get the register class which shall be used to store a value of a given mode.
/**
* Get the ABI restrictions for procedure calls.
* @param self The this pointer.
- * @param method_type The type of the method (procedure) in question.
+ * @param call_type The call type of the method (procedure) in question.
* @param p The array of parameter locations to be filled.
*/
- void (*get_call_abi)(const void *self, ir_type *method_type, be_abi_call_t *abi);
+ void (*get_call_abi)(const void *self, ir_type *call_type, be_abi_call_t *abi);
/**
* The irn handler for this architecture.
/**
* Returns an 2-dim array of execution units, @p irn can be executed on.
- * The first dimension is the type, the second the allowed units of this type.
+ * The first dimension is the type, the second the allowed units of this
+ * type.
* Each dimension is a NULL terminated list.
* @param self The isa object.
* @param irn The node.
/**
* Return an ordered list of irgs where code should be generated for.
- * If NULL is returned, all irg will be taken into account and they will be
- * generated in an arbitrary order.
+ * If NULL is returned, all irg will be taken into account and they will be
+ * generated in an arbitrary order.
* @param self The isa object.
- * @param irgs A flexible array ARR_F of length 0 where the backend cann append the desired irgs.
+ * @param irgs A flexible array ARR_F of length 0 where the backend can append the desired irgs.
* @return A flexible array ARR_F containing all desired irgs in the desired order.
*/
ir_graph **(*get_backend_irg_list)(const void *self, ir_graph ***irgs);