4 * @author Sebastian Hack
6 * Backend node support.
8 * Copyright (C) 2005 Universitaet Karlsruhe
9 * Released under the GPL
15 #include "firm_config.h"
39 void be_node_init(void);
41 const arch_irn_handler_t be_node_irn_handler;
43 ir_node *be_new_Spill(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, ir_node *node_to_spill, ir_node *ctx);
44 ir_node *be_new_Reload(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, ir_mode *mode, ir_node *spill_node);
45 ir_node *be_new_Copy(const arch_register_class_t *cls, ir_graph *irg, ir_node *block, ir_node *in);
46 ir_node *be_new_Perm(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int arity, ir_node *in[]);
47 ir_node *be_new_Keep(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int arity, ir_node *in[]);
49 ir_node *be_new_AddSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *operand);
50 ir_node *be_new_IncSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, int amount);
51 ir_node *be_new_Call(ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *sp, ir_node *ptr, int n, ir_node *in[]);
52 ir_node *be_new_StackParam(ir_graph *irg);
53 ir_node *be_new_RegParams(ir_graph *irg, int n_out);
55 ir_node *be_spill(const arch_env_t *arch_env, ir_node *irn,ir_node *spill_ctx);
56 ir_node *be_reload(const arch_env_t *arch_env, const arch_register_class_t *cls, ir_node *irn, int pos, ir_mode *mode, ir_node *spill);
58 int be_is_Spill(const ir_node *irn);
59 int be_is_Reload(const ir_node *irn);
60 int be_is_Copy(const ir_node *irn);
61 int be_is_Perm(const ir_node *irn);
62 int be_is_Keep(const ir_node *irn);
63 int be_is_Call(const ir_node *irn);
64 int be_is_AddSP(const ir_node *irn);
65 int be_is_IncSP(const ir_node *irn);
67 void be_set_IncSP_offset(ir_node *irn, int offset);
68 int be_get_IncSP_offset(ir_node *irn);
70 void be_set_Spill_entity(ir_node *irn, entity *ent);
71 entity *be_get_spill_entity(ir_node *irn);
73 ir_node *be_get_Spill_context(const ir_node *irn);
76 * Impose a register constraint on a backend node.
77 * @param irn The node.
78 * @param pos The position of the argument/result. Results range from -1..-m and arguments form 0..n
79 * @param reg The register which is admissible for that node, argument/result and position.
81 void be_set_constr_single_reg(ir_node *irn, int pos, const arch_register_t *reg);
84 * Modify the output register requirements of a Perm.
85 * This function incur register constraints to an output value of a Perm.
86 * This is used when handling register constraints in general,
88 * @param irn The perm node.
89 * @param pos The position.
90 * @param req The requirements to set to.
91 * @param negate_limited When the requirements are limited, inverse the set of admissible registers.
93 void be_set_Perm_out_req(ir_node *irn, int pos, const arch_register_req_t *req, unsigned negate_limited);
96 * Insert a Perm node after a specific node in the schedule.
97 * The Perm permutes over all values live at the given node.
98 * This means that all liveness intervals are cut apart at this
99 * location in the program.
101 ir_node *insert_Perm_after(const arch_env_t *env,
102 const arch_register_class_t *cls,
103 dom_front_info_t *dom_front,
107 #endif /* _BENODE_T_H */