4 * @author Sebastian Hack
6 * Backend node support.
8 * Copyright (C) 2005 Universitaet Karlsruhe
9 * Released under the GPL
15 #include "firm_config.h"
43 be_stack_dir_along = 0,
44 be_stack_dir_against = 1
47 #define BE_STACK_FRAME_SIZE ((unsigned) -1)
49 void be_node_init(void);
51 const arch_irn_handler_t be_node_irn_handler;
53 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);
54 ir_node *be_new_Reload(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, ir_mode *mode, ir_node *spill_node);
55 ir_node *be_new_Copy(const arch_register_class_t *cls, ir_graph *irg, ir_node *block, ir_node *in);
56 ir_node *be_new_Perm(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int arity, ir_node *in[]);
57 ir_node *be_new_Keep(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int arity, ir_node *in[]);
59 ir_node *be_new_AddSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *operand);
62 * Make a stack pointer increase/decrease node.
63 * @param sp The stack poitner register.
64 * @param irg The graph to insert the node to.
65 * @param bl The block to insert the node into.
66 * @param old_sp The node defining the former stack pointer.
67 * @param amount The mount of bytes the stack pointer shall be increased/decreased.
68 * @param dir The direction in which the stack pointer shall be modified:
69 * Along the stack's growing direction or against.
70 * @return A new stack pointer increment/decrement node.
71 * @note This node sets a register constraint to the @p sp register on its output.
73 ir_node *be_new_IncSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, unsigned amount, be_stack_dir_t dir);
75 void be_set_IncSP_offset(ir_node *irn, unsigned offset);
76 unsigned be_get_IncSP_offset(ir_node *irn);
78 void be_set_IncSP_direction(ir_node *irn, be_stack_dir_t dir);
79 be_stack_dir_t be_get_IncSP_direction(ir_node *irn);
81 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[]);
82 ir_node *be_new_Return(ir_graph *irg, ir_node *bl, int n, ir_node *in[]);
83 ir_node *be_new_StackParam(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, ir_mode *mode, ir_node *frame_pointer, unsigned offset);
84 ir_node *be_new_RegParams(ir_graph *irg, ir_node *bl, int n_out);
85 ir_node *be_new_NoReg(const arch_register_t *reg, ir_graph *irg, ir_node *bl);
87 ir_node *be_spill(const arch_env_t *arch_env, ir_node *irn,ir_node *spill_ctx);
88 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);
90 be_opcode_t be_get_irn_opcode(const ir_node *irn);
92 int be_is_Spill(const ir_node *irn);
93 int be_is_Reload(const ir_node *irn);
94 int be_is_Copy(const ir_node *irn);
95 int be_is_Perm(const ir_node *irn);
96 int be_is_Keep(const ir_node *irn);
97 int be_is_Call(const ir_node *irn);
98 int be_is_IncSP(const ir_node *irn);
99 int be_is_AddSP(const ir_node *irn);
100 int be_is_RegParams(const ir_node *irn);
101 int be_is_StackParam(const ir_node *irn);
102 int be_is_NoReg(const ir_node *irn);
105 void be_set_Spill_entity(ir_node *irn, entity *ent);
106 entity *be_get_spill_entity(ir_node *irn);
108 ir_node *be_get_Spill_context(const ir_node *irn);
111 * Impose a register constraint on a backend node.
112 * @param irn The node.
113 * @param pos The position of the argument/result. Results range from -1..-m and arguments form 0..n
114 * @param reg The register which is admissible for that node, argument/result and position.
116 void be_set_constr_single_reg(ir_node *irn, int pos, const arch_register_t *reg);
119 * Impose register constraints on a backend node.
120 * The register subsets given by the limited function in @p req are copied to the backend node.
121 * This requires that the constraint type of the @p req is arch_register_req_type_limited.
122 * @param irn The backend node.
123 * @param pos The position (@see be_set_constr_single_reg()).
124 * @param req The register requirements which shall be transferred.
126 void be_set_constr_limited(ir_node *irn, int pos, const arch_register_req_t *req);
128 void be_node_set_flags(ir_node *irn, int pos, arch_irn_flags_t flags);
130 void be_node_set_reg_class(ir_node *irn, int pos, const arch_register_class_t *cls);
133 * Insert a Perm node after a specific node in the schedule.
134 * The Perm permutes over all values live at the given node.
135 * This means that all liveness intervals are cut apart at this
136 * location in the program.
138 ir_node *insert_Perm_after(const arch_env_t *env,
139 const arch_register_class_t *cls,
140 dom_front_info_t *dom_front,
144 #endif /* _BENODE_T_H */