#include "irprintf.h"
-static const arch_register_req_t no_requirement = {
+arch_register_req_t const arch_no_requirement = {
arch_register_req_type_none,
NULL,
NULL,
0,
0
};
-const arch_register_req_t *arch_no_register_req = &no_requirement;
-
-static reg_out_info_t dummy_info = {
- NULL,
- &no_requirement
-};
/* Initialize the architecture environment struct. */
arch_env_t *arch_env_begin_codegeneration(const arch_isa_if_t *isa_if,
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);
}
}
-static reg_out_info_t *get_out_info(const ir_node *node)
-{
- 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);
- /* We have a problem with the switch-node where there can be arbitrary
- * Proj-numbers, so we can't easily allocate an array big-enough to hold
- * all of them. So until we rewrite Switch-nodes we need this special case
- */
- if (info->out_infos == NULL)
- return &dummy_info;
- assert(pos < ARR_LEN(info->out_infos));
- return &info->out_infos[pos];
-}
-
-static 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 < (int)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_get_irn_register_out(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;
return arch_get_irn_register(op);
}
-void arch_set_irn_register_out(ir_node *node, int pos,
+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;
}
-const arch_register_req_t *arch_get_irn_register_req(const ir_node *node)
-{
- reg_out_info_t *out = get_out_info(node);
- return out->req;
-}
-
-arch_irn_flags_t arch_get_irn_flags(const ir_node *node)
-{
- backend_info_t *info;
- if (is_Proj(node))
- return arch_irn_flags_not_scheduled;
-
- info = be_get_info(node);
- return info->flags;
-}
-
void arch_set_irn_flags(ir_node *node, arch_irn_flags_t flags)
{
backend_info_t *info;
bool arch_reg_is_allocatable(const arch_register_req_t *req,
const arch_register_t *reg)
{
- if (reg->type & arch_register_type_joker)
- return true;
- if (req->type == arch_register_req_type_none)
+ assert(req->type != arch_register_req_type_none);
+ if (req->cls != reg->reg_class)
return false;
- if (req->type & arch_register_req_type_limited) {
- if (arch_register_get_class(reg) != req->cls)
- return false;
- return rbitset_is_set(req->limited, arch_register_get_index(reg));
- }
- return req->cls == arch_register_get_class(reg);
+ if (reg->type & arch_register_type_virtual)
+ return true;
+ if (req->type & arch_register_req_type_limited)
+ return rbitset_is_set(req->limited, reg->index);
+ return true;
}
void arch_dump_register_req(FILE *F, const arch_register_req_t *req,
void arch_dump_reqs_and_registers(FILE *F, const ir_node *node)
{
- int n_ins = get_irn_arity(node);
- int n_outs = arch_get_irn_n_outs(node);
- arch_irn_flags_t flags = arch_get_irn_flags(node);
- int i;
-
- for (i = 0; i < n_ins; ++i) {
+ int n_ins = get_irn_arity(node);
+ 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);
}
- for (i = 0; i < n_outs; ++i) {
- const arch_register_req_t *req = arch_get_irn_register_req_out(node, i);
- fprintf(F, "outreq #%d = ", i);
+ unsigned n_outs = arch_get_irn_n_outs(node);
+ for (unsigned o = 0; o < n_outs; ++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);
fputs("\n", F);
}
- for (i = 0; i < n_outs; ++i) {
- const arch_register_t *reg = arch_get_irn_register_out(node, i);
- const arch_register_req_t *req = arch_get_irn_register_req_out(node, i);
+ for (unsigned o = 0; o < n_outs; ++o) {
+ const arch_register_t *reg = arch_get_irn_register_out(node, o);
+ const arch_register_req_t *req = arch_get_irn_register_req_out(node, o);
if (req->cls == NULL)
continue;
- fprintf(F, "reg #%d = %s\n", i, reg != NULL ? reg->name : "n/a");
+ fprintf(F, "reg #%u = %s\n", o, 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 {
fprintf(F, " not_scheduled");
}
}
- fprintf(F, " (%d)\n", (int)flags);
+ fprintf(F, " (0x%x)\n", (unsigned)flags);
}