X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbenode.c;h=51d42e6af696681533f6b9fd14e38fee474f0e0f;hb=57202971c86386ad5bc2f4516f18b43ebfe3ad35;hp=925b658cea38c1a90993b452586f935482abddbe;hpb=a0619aec305bc8fb0d2aff10fa53a4427527c370;p=libfirm diff --git a/ir/be/benode.c b/ir/be/benode.c index 925b658ce..51d42e6af 100644 --- a/ir/be/benode.c +++ b/ir/be/benode.c @@ -5,7 +5,7 @@ * * Backend node support. * - * This file provdies Perm, Copy, Spill and Reload nodes. + * This file provides Perm, Copy, Spill and Reload nodes. * * Copyright (C) 2005 Universitaet Karlsruhe * Released under the GPL @@ -23,6 +23,7 @@ #include "util.h" #include "debug.h" #include "fourcc.h" +#include "offset.h" #include "bitfiddle.h" #include "irop_t.h" @@ -83,28 +84,34 @@ typedef struct { be_req_t in_req; } be_reg_data_t; +/** The generic be nodes attribute type. */ typedef struct { - int max_reg_data; - be_reg_data_t *reg_data; + int max_reg_data; + be_reg_data_t *reg_data; } be_node_attr_t; +/** The be_Stack attribute type. */ typedef struct { be_node_attr_t node_attr; int offset; /**< The offset by which the stack shall be increased/decreased. */ - be_stack_dir_t dir; /**< The direction in which the stack shall be modified (along or in the other direction). */ + be_stack_dir_t dir; /**< The direction in which the stack shall be modified (expand or shrink). */ } be_stack_attr_t; +/** The be_Frame attribute type. */ typedef struct { be_node_attr_t node_attr; entity *ent; int offset; } be_frame_attr_t; +/** The be_Call attribute type. */ typedef struct { be_node_attr_t node_attr; - entity *ent; + entity *ent; /**< The called entity if this is a static call. */ + ir_type *call_tp; /**< The call type, copied from the original Call node. */ } be_call_attr_t; +/** The be_Spill attribute type. */ typedef struct { be_frame_attr_t frame_attr; ir_node *spill_ctx; /**< The node in whose context this spill was introduced. */ @@ -142,6 +149,8 @@ static const ir_op_ops be_node_op_ops; #define H irop_flag_highlevel #define c irop_flag_constlike #define K irop_flag_keep +#define M irop_flag_machine + void be_node_init(void) { static int inited = 0; @@ -188,9 +197,12 @@ void be_node_init(void) { set_op_tag(op_be_FrameLoad, &be_node_tag); set_op_tag(op_be_FrameStore, &be_node_tag); set_op_tag(op_be_FrameAddr, &be_node_tag); - set_op_tag(op_be_Barrier, &be_node_tag); + set_op_tag(op_be_Barrier, &be_node_tag); } +/** + * Initializes the generic attribute of all be nodes and return ir. + */ static void *init_node_attr(ir_node* irn, int max_reg_data) { ir_graph *irg = get_irn_irg(irn); @@ -337,41 +349,59 @@ ir_node *be_new_Keep(const arch_register_class_t *cls, ir_graph *irg, ir_node *b return irn; } -ir_node *be_new_Call(ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *sp, ir_node *ptr, int n_outs, int n, ir_node *in[]) +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) { - int real_n = 3 + n; + be_call_attr_t *a; + int real_n = be_pos_Call_first_arg + n; ir_node *irn; ir_node **real_in; - real_in = malloc(sizeof(real_in[0]) * (real_n)); - - real_in[0] = mem; - real_in[1] = sp; - real_in[2] = ptr; - memcpy(&real_in[3], in, n * sizeof(in[0])); + NEW_ARR_A(ir_node *, real_in, real_n); + real_in[be_pos_Call_mem] = mem; + real_in[be_pos_Call_sp] = sp; + real_in[be_pos_Call_ptr] = ptr; + memcpy(&real_in[be_pos_Call_first_arg], in, n * sizeof(in[0])); irn = new_ir_node(NULL, irg, bl, op_be_Call, mode_T, real_n, real_in); - init_node_attr(irn, (n_outs > real_n ? n_outs : real_n)); + a = init_node_attr(irn, (n_outs > real_n ? n_outs : real_n)); + a->ent = NULL; + a->call_tp = call_tp; return irn; } -entity *be_Call_get_entity(const ir_node *call) -{ +/* Gets the call entity or NULL if this is no static call. */ +entity *be_Call_get_entity(const ir_node *call) { be_call_attr_t *a = get_irn_attr(call); assert(be_is_Call(call)); return a->ent; } -void be_Call_set_entity(ir_node *call, entity *ent) -{ +/* Sets the call entity. */ +void be_Call_set_entity(ir_node *call, entity *ent) { be_call_attr_t *a = get_irn_attr(call); assert(be_is_Call(call)); a->ent = ent; } -ir_node *be_new_Return(ir_graph *irg, ir_node *bl, int n, ir_node *in[]) +/* Gets the call type. */ +ir_type *be_Call_get_type(ir_node *call) { + be_call_attr_t *a = get_irn_attr(call); + assert(be_is_Call(call)); + return a->call_tp; +} + +/* Sets the call type. */ +void be_Call_set_type(ir_node *call, ir_type *call_tp) { + be_call_attr_t *a = get_irn_attr(call); + assert(be_is_Call(call)); + a->call_tp = call_tp; +} + + +ir_node *be_new_Return(dbg_info *dbg, ir_graph *irg, ir_node *bl, int n, ir_node *in[]) { - ir_node *irn = new_ir_node(NULL, irg, bl, op_be_Return, mode_X, n, in); + ir_node *irn = new_ir_node(dbg, irg, bl, op_be_Return, mode_X, n, in); init_node_attr(irn, n); return irn; @@ -530,7 +560,7 @@ ir_node *be_new_CopyKeep(const arch_register_class_t *cls, ir_graph *irg, ir_nod in[0] = src; memcpy(&in[1], in_keep, n * sizeof(in[0])); irn = new_ir_node(NULL, irg, bl, op_be_CopyKeep, mode, n + 1, in); - init_node_attr(irn, n); + init_node_attr(irn, n + 1); be_node_set_reg_class(irn, OUT_POS(0), cls); be_node_set_reg_class(irn, 0, cls); @@ -581,9 +611,9 @@ int be_has_frame_entity(const ir_node *irn) case beo_FrameLoad: case beo_FrameAddr: return 1; + default: + return 0; } - - return 0; } entity *be_get_frame_entity(const ir_node *irn) @@ -669,6 +699,12 @@ void be_node_set_reg_class(ir_node *irn, int pos, const arch_register_class_t *c r->req.type = arch_register_req_type_normal; } +void be_node_set_req_type(ir_node *irn, int pos, arch_register_req_type_t type) +{ + be_req_t *r = get_req(irn, pos); + r->req.type = type; +} + void be_set_IncSP_offset(ir_node *irn, unsigned offset) { be_stack_attr_t *a = get_irn_attr(irn); @@ -751,8 +787,6 @@ static INLINE ir_node *find_a_spill(const ir_node *irn) entity *be_get_spill_entity(const ir_node *irn) { - int opc = get_irn_opcode(irn); - switch(be_get_irn_opcode(irn)) { case beo_Reload: { @@ -820,7 +854,7 @@ ir_node *be_spill(const arch_env_t *arch_env, ir_node *irn, ir_node *ctx) */ insert = sched_next(irn); - if(bl == get_irg_start_block(irg) && insert != bl && sched_get_time_step(frame) >= sched_get_time_step(insert)) + if(insert != bl && bl == get_irg_start_block(irg) && sched_get_time_step(frame) >= sched_get_time_step(insert)) insert = sched_next(frame); while((is_Phi(insert) || is_Proj(insert)) && !sched_is_end(insert)) @@ -830,11 +864,11 @@ ir_node *be_spill(const arch_env_t *arch_env, ir_node *irn, ir_node *ctx) return spill; } -ir_node *be_reload(const arch_env_t *arch_env, const arch_register_class_t *cls, ir_node *reloader, ir_mode *mode, ir_node *spill) +ir_node *be_reload(const arch_env_t *arch_env, const arch_register_class_t *cls, ir_node *insert, ir_mode *mode, ir_node *spill) { ir_node *reload; - ir_node *bl = is_Block(reloader) ? reloader : get_nodes_block(reloader); + ir_node *bl = is_Block(insert) ? insert : get_nodes_block(insert); ir_graph *irg = get_irn_irg(bl); ir_node *frame = get_irg_frame(irg); const arch_register_class_t *cls_frame = arch_get_irn_reg_class(arch_env, frame, -1); @@ -843,16 +877,40 @@ ir_node *be_reload(const arch_env_t *arch_env, const arch_register_class_t *cls, reload = be_new_Reload(cls, cls_frame, irg, bl, frame, spill, mode); - sched_add_before(reloader, reload); + if(is_Block(insert)) { + insert = sched_skip(insert, 0, sched_skip_cf_predicator, (void *) arch_env); + sched_add_after(insert, reload); + } + + else + sched_add_before(insert, reload); + return reload; } +/* + ____ ____ + | _ \ ___ __ _ | _ \ ___ __ _ ___ + | |_) / _ \/ _` | | |_) / _ \/ _` / __| + | _ < __/ (_| | | _ < __/ (_| \__ \ + |_| \_\___|\__, | |_| \_\___|\__, |___/ + |___/ |_| + +*/ + + static void *put_out_reg_req(arch_register_req_t *req, const ir_node *irn, int out_pos) { const be_node_attr_t *a = get_irn_attr(irn); - if(out_pos < a->max_reg_data) + if(out_pos < a->max_reg_data) { memcpy(req, &a->reg_data[out_pos].req, sizeof(req[0])); + + if(be_is_Copy(irn)) { + req->type |= arch_register_req_type_should_be_same; + req->other_same = get_irn_n(irn, be_pos_Copy_orig); + } + } else { req->type = arch_register_req_type_none; req->cls = NULL; @@ -864,7 +922,6 @@ static void *put_out_reg_req(arch_register_req_t *req, const ir_node *irn, int o static void *put_in_reg_req(arch_register_req_t *req, const ir_node *irn, int pos) { const be_node_attr_t *a = get_irn_attr(irn); - int n = get_irn_arity(irn); if(pos < get_irn_arity(irn) && pos < a->max_reg_data) memcpy(req, &a->reg_data[pos].in_req, sizeof(req[0])); @@ -957,6 +1014,14 @@ static void be_node_set_frame_offset(const void *self, ir_node *irn, int offset) } } +/* + ___ ____ _ _ _ _ _ _ + |_ _| _ \| \ | | | | | | __ _ _ __ __| | | ___ _ __ + | || |_) | \| | | |_| |/ _` | '_ \ / _` | |/ _ \ '__| + | || _ <| |\ | | _ | (_| | | | | (_| | | __/ | + |___|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_| + +*/ static const arch_irn_ops_if_t be_node_irn_ops_if = { be_node_get_irn_reg_req, @@ -972,17 +1037,181 @@ static const arch_irn_ops_t be_node_irn_ops = { &be_node_irn_ops_if }; -const void *be_node_get_arch_ops(const arch_irn_handler_t *self, const ir_node *irn) +const void *be_node_get_irn_ops(const arch_irn_handler_t *self, const ir_node *irn) { redir_proj((const ir_node **) &irn, -1); return is_be_node(irn) ? &be_node_irn_ops : NULL; } const arch_irn_handler_t be_node_irn_handler = { - be_node_get_arch_ops + be_node_get_irn_ops +}; + +/* + ____ _ _ ___ ____ _ _ _ _ _ _ + | _ \| |__ (_) |_ _| _ \| \ | | | | | | __ _ _ __ __| | | ___ _ __ + | |_) | '_ \| | | || |_) | \| | | |_| |/ _` | '_ \ / _` | |/ _ \ '__| + | __/| | | | | | || _ <| |\ | | _ | (_| | | | | (_| | | __/ | + |_| |_| |_|_| |___|_| \_\_| \_| |_| |_|\__,_|_| |_|\__,_|_|\___|_| + +*/ + +typedef struct { + arch_irn_handler_t irn_handler; + arch_irn_ops_t irn_ops; + const arch_env_t *arch_env; + pmap *regs; +} phi_handler_t; + +#define get_phi_handler_from_handler(h) container_of(h, phi_handler_t, irn_handler) +#define get_phi_handler_from_ops(h) container_of(h, phi_handler_t, irn_ops) + +static const void *phi_get_irn_ops(const arch_irn_handler_t *handler, const ir_node *irn) +{ + const phi_handler_t *h = get_phi_handler_from_handler(handler); + return is_Phi(irn) && mode_is_datab(get_irn_mode(irn)) ? &h->irn_ops : NULL; +} + +/** + * Get register class of a Phi. + * + */ +static const arch_register_req_t *get_Phi_reg_req_recursive(const phi_handler_t *h, arch_register_req_t *req, const ir_node *phi, pset **visited) +{ + int n = get_irn_arity(phi); + ir_node *op; + int i; + + if(*visited && pset_find_ptr(*visited, phi)) + return NULL; + + for(i = 0; i < n; ++i) { + op = get_irn_n(phi, i); + if(!is_Phi(op)) + return arch_get_register_req(h->arch_env, req, op, BE_OUT_POS(0)); + } + + /* + The operands of that Phi were all Phis themselves. + We have to start a DFS for a non-Phi argument now. + */ + if(!*visited) + *visited = pset_new_ptr(16); + + pset_insert_ptr(*visited, phi); + + for(i = 0; i < n; ++i) { + op = get_irn_n(phi, i); + if(get_Phi_reg_req_recursive(h, req, op, visited)) + return req; + } + + return NULL; +} + +static const arch_register_req_t *phi_get_irn_reg_req(const void *self, arch_register_req_t *req, const ir_node *irn, int pos) +{ + phi_handler_t *phi_handler = get_phi_handler_from_ops(self); + pset *visited = NULL; + + get_Phi_reg_req_recursive(phi_handler, req, irn, &visited); + /* Set the requirements type to normal, since an operand of the Phi could have had constraints. */ + req->type = arch_register_req_type_normal; + if(visited) + del_pset(visited); + + return req; +} + +static void phi_set_irn_reg(const void *self, ir_node *irn, const arch_register_t *reg) +{ + phi_handler_t *h = get_phi_handler_from_ops(self); + pmap_insert(h->regs, irn, (void *) reg); +} + +static const arch_register_t *phi_get_irn_reg(const void *self, const ir_node *irn) +{ + phi_handler_t *h = get_phi_handler_from_ops(self); + return pmap_get(h->regs, (void *) irn); +} + +static arch_irn_class_t phi_classify(const void *_self, const ir_node *irn) +{ + return arch_irn_class_normal; +} + +static arch_irn_flags_t phi_get_flags(const void *_self, const ir_node *irn) +{ + return arch_irn_flags_none; +} + +static entity *phi_get_frame_entity(const void *_self, const ir_node *irn) +{ + return NULL; +} + +static void phi_set_frame_offset(const void *_self, ir_node *irn, int bias) +{ +} + +static const arch_irn_ops_if_t phi_irn_ops = { + phi_get_irn_reg_req, + phi_set_irn_reg, + phi_get_irn_reg, + phi_classify, + phi_get_flags, + phi_get_frame_entity, + phi_set_frame_offset }; +static const arch_irn_handler_t phi_irn_handler = { + phi_get_irn_ops +}; + +arch_irn_handler_t *be_phi_handler_new(const arch_env_t *arch_env) +{ + phi_handler_t *h = xmalloc(sizeof(h[0])); + h->irn_handler.get_irn_ops = phi_get_irn_ops; + h->irn_ops.impl = &phi_irn_ops; + h->arch_env = arch_env; + h->regs = pmap_create(); + return (arch_irn_handler_t *) h; +} + +void be_phi_handler_free(arch_irn_handler_t *handler) +{ + phi_handler_t *h = (void *) handler; + pmap_destroy(h->regs); + free(handler); +} + +const void *be_phi_get_irn_ops(const arch_irn_handler_t *self, const ir_node *irn) +{ + phi_handler_t *phi_handler = get_phi_handler_from_handler(self); + return is_Phi(irn) ? &phi_handler->irn_ops : NULL; +} + +void be_phi_handler_reset(arch_irn_handler_t *handler) +{ + phi_handler_t *h = get_phi_handler_from_handler(handler); + if(h->regs) + pmap_destroy(h->regs); + h->regs = pmap_create(); +} + +/* + _ _ _ ____ _ + | \ | | ___ __| | ___ | _ \ _ _ _ __ ___ _ __ (_)_ __ __ _ + | \| |/ _ \ / _` |/ _ \ | | | | | | | '_ ` _ \| '_ \| | '_ \ / _` | + | |\ | (_) | (_| | __/ | |_| | |_| | | | | | | |_) | | | | | (_| | + |_| \_|\___/ \__,_|\___| |____/ \__,_|_| |_| |_| .__/|_|_| |_|\__, | + |_| |___/ +*/ + +/** + * Dumps a register requirement to a file. + */ static void dump_node_req(FILE *f, int idx, be_req_t *req) { unsigned i; @@ -1017,6 +1246,9 @@ static void dump_node_req(FILE *f, int idx, be_req_t *req) fprintf(f, "\n"); } +/** + * Dumps node register requirements to a file. + */ static void dump_node_reqs(FILE *f, ir_node *irn) { int i; @@ -1040,6 +1272,9 @@ static void dump_node_reqs(FILE *f, ir_node *irn) } } +/** + * ir_op-Operation: dump a be node to file + */ static int dump_node(ir_node *irn, FILE *f, dump_reason_t reason) { be_node_attr_t *at = get_irn_attr(irn); @@ -1060,8 +1295,11 @@ static int dump_node(ir_node *irn, FILE *f, dump_reason_t reason) if(be_has_frame_entity(irn)) { be_frame_attr_t *a = (be_frame_attr_t *) at; - if (a->ent) - ir_fprintf(f, "frame entity: %+F offset %x (%d)\n", a->ent, a->offset, a->offset); + if (a->ent) { + int bits = get_type_size_bits(get_entity_type(a->ent)); + ir_fprintf(f, "frame entity: %+F offset 0x%x (%d) size 0x%x %d\n", + a->ent, a->offset, a->offset, bits, bits); + } } @@ -1077,17 +1315,19 @@ static int dump_node(ir_node *irn, FILE *f, dump_reason_t reason) { be_stack_attr_t *a = (be_stack_attr_t *) at; fprintf(f, "offset: %u\n", a->offset); - fprintf(f, "direction: %s\n", a->dir == be_stack_dir_along ? "along" : "against"); + fprintf(f, "direction: %s\n", a->dir == be_stack_dir_expand ? "expand" : "shrink"); } break; + default: + break; } - } return 0; } /** + * ir_op-Operation: * Copies the backend specific attributes from old node to new node. */ static void copy_attr(const ir_node *old_node, ir_node *new_node)