4 * @author Sebastian Hack
6 * Backend node support.
8 * Copyright (C) 2005 Universitaet Karlsruhe
9 * Released under the GPL
15 #include "firm_config.h"
25 #define BE_OUT_POS(p) (-((p) + 1))
28 * The benode op's. Must be available to register emitter function.
30 extern ir_op *op_be_Spill;
31 extern ir_op *op_be_Reload;
32 extern ir_op *op_be_Perm;
33 extern ir_op *op_be_Copy;
34 extern ir_op *op_be_Keep;
35 extern ir_op *op_be_Call;
36 extern ir_op *op_be_Return;
37 extern ir_op *op_be_IncSP;
38 extern ir_op *op_be_AddSP;
39 extern ir_op *op_be_SetSP;
40 extern ir_op *op_be_RegParams;
41 extern ir_op *op_be_StackParam;
42 extern ir_op *op_be_FrameAddr;
43 extern ir_op *op_be_FrameLoad;
44 extern ir_op *op_be_FrameStore;
45 extern ir_op *op_be_Barrier;
69 /** Expresses the direction of the stack pointer increment of IncSP nodes. */
71 be_stack_dir_expand = 0,
72 be_stack_dir_shrink = 1
77 be_frame_flag_spill = 1,
78 be_frame_flag_local = 2,
83 * A "symbolic constant" for the size of the stack frame to use with IncSP nodes.
84 * It gets back-patched to the real size as soon it is known.
86 #define BE_STACK_FRAME_SIZE ((unsigned) -1)
89 * Create all BE specific opcodes.
91 void be_node_init(void);
94 be_pos_Spill_frame = 0,
97 ir_node *be_new_Spill(const arch_register_class_t *cls, const arch_register_class_t *cls_frame, ir_graph *irg, ir_node *bl, ir_node *frame, ir_node *node_to_spill, ir_node *ctx);
100 be_pos_Reload_frame = 0,
101 be_pos_Reload_mem = 1
103 ir_node *be_new_Reload(const arch_register_class_t *cls, const arch_register_class_t *cls_frame, ir_graph *irg, ir_node *bl, ir_node *frame, ir_node *spill_node, ir_mode *mode);
108 ir_node *be_new_Copy(const arch_register_class_t *cls, ir_graph *irg, ir_node *block, ir_node *in);
109 ir_node *be_new_Perm(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int arity, ir_node *in[]);
110 ir_node *be_new_Keep(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int arity, ir_node *in[]);
112 ir_node *be_new_FrameLoad(const arch_register_class_t *cls_frame, const arch_register_class_t *cls_data,
113 ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *frame, entity *ent);
114 ir_node *be_new_FrameStore(const arch_register_class_t *cls_frame, const arch_register_class_t *cls_data,
115 ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *frame, ir_node *data, entity *ent);
116 ir_node *be_new_FrameAddr(const arch_register_class_t *cls_frame, ir_graph *irg, ir_node *bl, ir_node *frame, entity *ent);
119 be_pos_AddSP_old_sp = 0,
120 be_pos_AddSP_size = 1,
121 be_pos_AddSP_last = 2
125 * Make a new AddSP node.
126 * An AddSP node expresses an increase of the stack pointer in the direction the stack
127 * grows. In contrast to IncSP, the amount of bytes the stack pointer is grown, is not
128 * given by a constant but an ordinary Firm node.
129 * @param sp The stack pointer register.
130 * @param irg The graph.
131 * @param bl The block.
132 * @param old_sp The node representing the old stack pointer value.
133 * @param sz The node expressing the size by which the stack pointer shall be grown.
134 * @return A new AddSP node.
136 ir_node *be_new_AddSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *sz);
138 ir_node *be_new_SetSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *operand, ir_node *mem);
141 * Make a stack pointer increase/decrease node.
142 * @param sp The stack pointer register.
143 * @param irg The graph to insert the node to.
144 * @param bl The block to insert the node into.
145 * @param old_sp The node defining the former stack pointer.
146 * @param amount The mount of bytes the stack pointer shall be increased/decreased.
147 * @param dir The direction in which the stack pointer shall be modified:
148 * Along the stack's growing direction or against.
149 * @return A new stack pointer increment/decrement node.
150 * @note This node sets a register constraint to the @p sp register on its output.
152 ir_node *be_new_IncSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *mem, unsigned amount, be_stack_dir_t dir);
156 void be_set_IncSP_offset(ir_node *irn, unsigned offset);
157 unsigned be_get_IncSP_offset(const ir_node *irn);
159 void be_set_IncSP_direction(ir_node *irn, be_stack_dir_t dir);
160 be_stack_dir_t be_get_IncSP_direction(const ir_node *irn);
162 /** Gets the call entity or NULL if this is no static call. */
163 entity *be_Call_get_entity(const ir_node *call);
164 /** Sets the call entity. */
165 void be_Call_set_entity(ir_node *call, entity *ent);
166 /** Gets the call type. */
167 ir_type *be_Call_get_type(ir_node *call);
168 /** Sets the call type. */
169 void be_Call_set_type(ir_node *call, ir_type *call_tp);
172 be_pos_Call_mem = 0, /**< memory input of a be_Call node */
173 be_pos_Call_sp = 1, /**< stack pointer input of a be_Call node */
174 be_pos_Call_ptr = 2, /**< call pointer input of a be_Call node */
175 be_pos_Call_first_arg = 3 /**< first argument input of a be_Call node */
179 * Projection numbers for result of be_Call node: use for Proj nodes!
182 pn_be_Call_M_regular = pn_Call_M_regular, /**< The memory result of a be_Call. */
183 pn_be_Call_first_res = pn_Call_max /**< The first result proj number of a be_Call. */
187 * Construct a new be_Call
189 ir_node *be_new_Call(dbg_info *dbg, ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *sp, ir_node *ptr,
190 int n_outs, int n, ir_node *in[], ir_type *call_tp);
193 * Construct a new be_Return
195 ir_node *be_new_Return(dbg_info *dbg, ir_graph *irg, ir_node *bl, int n, ir_node *in[]);
196 ir_node *be_new_StackParam(const arch_register_class_t *cls, const arch_register_class_t *cls_frame, ir_graph *irg, ir_node *bl, ir_mode *mode, ir_node *frame_pointer, entity *ent);
197 ir_node *be_new_RegParams(ir_graph *irg, ir_node *bl, int n_out);
199 ir_node *be_new_Barrier(ir_graph *irg, ir_node *bl, int n, ir_node *in[]);
201 ir_node *be_spill(const arch_env_t *arch_env, ir_node *irn,ir_node *spill_ctx);
202 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);
204 ir_node *be_new_CopyKeep(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, ir_node *src, int n, ir_node *in_keep[], ir_mode *mode);
205 ir_node *be_new_CopyKeep_single(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, ir_node *src, ir_node *keep, ir_mode *mode);
209 * Get the backend opcode of a backend node.
210 * @param irn The node.
211 * @return The backend opcode.
213 be_opcode_t be_get_irn_opcode(const ir_node *irn);
215 int be_is_Spill(const ir_node *irn);
216 int be_is_Reload(const ir_node *irn);
217 int be_is_Copy(const ir_node *irn);
218 int be_is_Perm(const ir_node *irn);
219 int be_is_Keep(const ir_node *irn);
220 int be_is_CopyKeep(const ir_node *irn);
221 int be_is_Call(const ir_node *irn);
222 int be_is_Return(const ir_node *irn);
223 int be_is_IncSP(const ir_node *irn);
224 int be_is_SetSP(const ir_node *irn);
225 int be_is_AddSP(const ir_node *irn);
226 int be_is_RegParams(const ir_node *irn);
227 int be_is_StackParam(const ir_node *irn);
228 int be_is_FrameAddr(const ir_node *irn);
229 int be_is_FrameLoad(const ir_node *irn);
230 int be_is_FrameStore(const ir_node *irn);
231 int be_is_Barrier(const ir_node *irn);
234 * Get the entity on the stack frame the given node uses.
235 * @param irn The node.
236 * @return The entity on the stack frame used by the node or NULL,
237 * if the node does not access the stack frame or is no back-end node.
240 entity *be_get_frame_entity(const ir_node *irn);
242 void be_set_Spill_entity(ir_node *irn, entity *ent);
243 entity *be_get_spill_entity(const ir_node *irn);
245 ir_node *be_get_Spill_context(const ir_node *irn);
248 * Set the entities of a Reload to the ones of the Spill it is pointing to.
249 * @param irg The graph.
251 void be_copy_entities_to_reloads(ir_graph *irg);
254 * Impose a register constraint on a backend node.
255 * @param irn The node.
256 * @param pos The position of the argument/result. Results range from -1..-m and arguments form 0..n
257 * @param reg The register which is admissible for that node, argument/result and position.
259 void be_set_constr_single_reg(ir_node *irn, int pos, const arch_register_t *reg);
262 * Impose register constraints on a backend node.
263 * The register subsets given by the limited function in @p req are copied to the backend node.
264 * This requires that the constraint type of the @p req is arch_register_req_type_limited.
265 * @param irn The backend node.
266 * @param pos The position (@see be_set_constr_single_reg()).
267 * @param req The register requirements which shall be transferred.
269 void be_set_constr_limited(ir_node *irn, int pos, const arch_register_req_t *req);
272 * Set the flags of a node.
273 * @param irn The node itself.
274 * @param pos The position (0..n) for arguments, (-1..-m) for results.
275 * @param flags The flags to set for that node and position.
277 void be_node_set_flags(ir_node *irn, int pos, arch_irn_flags_t flags);
280 * Set the register class of a node.
281 * @param irn The node itself.
282 * @param pos The position (0..n) for arguments, (-1..-m) for results.
283 * @param flags The register class to set for that node and position.
285 void be_node_set_reg_class(ir_node *irn, int pos, const arch_register_class_t *cls);
288 * Make a new phi handler.
289 * @param env The architecture environment.
290 * @return A new phi handler.
292 arch_irn_handler_t *be_phi_handler_new(const arch_env_t *arch_env);
295 * Free a phi handler.
296 * @param handler The handler to free.
298 void be_phi_handler_free(arch_irn_handler_t *handler);
301 * Reset the register data in the phi handler.
302 * This should be called on each new graph and deletes the register information of the current graph.
304 void be_phi_handler_reset(arch_irn_handler_t *handler);
307 * irn handler for common be nodes.
309 extern const arch_irn_handler_t be_node_irn_handler;
311 #endif /* _BENODE_T_H */