#include "irprintf.h"
#include "irgwalk.h"
#include "iropt_t.h"
+#include "irbackedge_t.h"
+#include "irverify_t.h"
#include "be_t.h"
#include "belive_t.h"
}
}
-static void add_register_req_in(ir_node *node)
+static void add_register_req_in(ir_node *node, const arch_register_req_t *req)
{
backend_info_t *info = be_get_info(node);
- ARR_APP1(const arch_register_req_t*, info->in_reqs, arch_no_register_req);
+ ARR_APP1(const arch_register_req_t*, info->in_reqs, req);
}
ir_node *be_new_Spill(const arch_register_class_t *cls,
attr->exc.pin_state = op_pin_state_pinned;
for (i = 0; i < n; ++i) {
- add_irn_n(res, in[i]);
- add_register_req_in(res);
+ ir_node *pred = in[i];
+ add_irn_n(res, pred);
+ const arch_register_req_t *req = arch_get_irn_register_req(pred);
+ req = req->cls != NULL ? req->cls->class_req : arch_no_register_req;
+ add_register_req_in(res, req);
}
keep_alive(res);
void be_Keep_add_node(ir_node *keep, const arch_register_class_t *cls, ir_node *node)
{
- int n;
-
assert(be_is_Keep(keep));
- n = add_irn_n(keep, node);
- add_register_req_in(keep);
- be_node_set_reg_class_in(keep, n, cls);
+ add_irn_n(keep, node);
+ add_register_req_in(keep, cls->class_req);
}
ir_node *be_new_Call(dbg_info *dbg, ir_graph *irg, ir_node *bl, ir_node *mem,
- ir_node *sp, ir_node *ptr, int n_outs, int n, ir_node *in[],
- ir_type *call_tp)
+ const arch_register_req_t *sp_req, ir_node *sp,
+ const arch_register_req_t *ptr_req, ir_node *ptr,
+ int n_outs, int n, ir_node *in[], ir_type *call_tp)
{
be_call_attr_t *a;
int real_n = n_be_Call_first_arg + n;
a->call_tp = call_tp;
a->pop = 0;
a->base.exc.pin_state = op_pin_state_pinned;
+ be_set_constr_in(irn, n_be_Call_sp, sp_req);
+ be_set_constr_in(irn, n_be_Call_ptr, ptr_req);
return irn;
}
attr->exc.pin_state = op_pin_state_floats;
be_node_set_reg_class_in(irn, 0, cls);
be_node_set_reg_class_out(irn, 0, cls);
+ for (int i = 0; i < n; ++i) {
+ ir_node *pred = in_keep[i];
+ const arch_register_req_t *req = arch_get_irn_register_req(pred);
+ req = req->cls != NULL ? req->cls->class_req : arch_no_register_req;
+ be_set_constr_in(irn, i+1, req);
+ }
return irn;
}
backend_info_t *info;
int i;
- ir_node *phi = new_r_Phi(block, n_ins, ins, mode);
+ ir_node *phi = new_ir_node(NULL, irg, block, op_Phi, mode, n_ins, ins);
+ phi->attr.phi.u.backedge = new_backedge_arr(irg->obst, n_ins);
info = be_get_info(phi);
info->out_infos = NEW_ARR_D(reg_out_info_t, obst, 1);
memset(info->out_infos, 0, 1 * sizeof(info->out_infos[0]));
for (i = 0; i < n_ins; ++i) {
info->in_reqs[i] = req;
}
-
+ irn_verify_irg(phi, irg);
+ phi = optimize_node(phi);
return phi;
}