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_CopyKeep;
36 extern ir_op *op_be_Call;
37 extern ir_op *op_be_Return;
38 extern ir_op *op_be_IncSP;
39 extern ir_op *op_be_AddSP;
40 extern ir_op *op_be_SetSP;
41 extern ir_op *op_be_RegParams;
42 extern ir_op *op_be_StackParam;
43 extern ir_op *op_be_FrameAddr;
44 extern ir_op *op_be_FrameLoad;
45 extern ir_op *op_be_FrameStore;
46 extern ir_op *op_be_Barrier;
70 /** Expresses the direction of the stack pointer increment of IncSP nodes. */
72 be_stack_dir_expand = 0,
73 be_stack_dir_shrink = 1
78 be_frame_flag_spill = 1,
79 be_frame_flag_local = 2,
84 * A "symbolic constant" for the size of the stack frame to use with IncSP nodes.
85 * It gets back-patched to the real size as soon it is known.
87 #define BE_STACK_FRAME_SIZE ((unsigned) -1)
90 * Create all BE specific opcodes.
92 void be_node_init(void);
95 be_pos_Spill_frame = 0,
98 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);
101 be_pos_Reload_frame = 0,
102 be_pos_Reload_mem = 1
104 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);
109 ir_node *be_new_Copy(const arch_register_class_t *cls, ir_graph *irg, ir_node *block, ir_node *in);
110 ir_node *be_get_Copy_op(const ir_node *cpy);
112 ir_node *be_new_Perm(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int arity, ir_node *in[]);
113 ir_node *be_new_Keep(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int arity, ir_node *in[]);
115 ir_node *be_new_FrameLoad(const arch_register_class_t *cls_frame, const arch_register_class_t *cls_data,
116 ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *frame, entity *ent);
117 ir_node *be_new_FrameStore(const arch_register_class_t *cls_frame, const arch_register_class_t *cls_data,
118 ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *frame, ir_node *data, entity *ent);
119 ir_node *be_new_FrameAddr(const arch_register_class_t *cls_frame, ir_graph *irg, ir_node *bl, ir_node *frame, entity *ent);
122 be_pos_AddSP_old_sp = 0,
123 be_pos_AddSP_size = 1,
124 be_pos_AddSP_last = 2
128 * Make a new AddSP node.
129 * An AddSP node expresses an increase of the stack pointer in the direction the stack
130 * grows. In contrast to IncSP, the amount of bytes the stack pointer is grown, is not
131 * given by a constant but an ordinary Firm node.
132 * @param sp The stack pointer register.
133 * @param irg The graph.
134 * @param bl The block.
135 * @param old_sp The node representing the old stack pointer value.
136 * @param sz The node expressing the size by which the stack pointer shall be grown.
137 * @return A new AddSP node.
139 ir_node *be_new_AddSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *sz);
141 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);
144 * Make a stack pointer increase/decrease node.
145 * @param sp The stack pointer register.
146 * @param irg The graph to insert the node to.
147 * @param bl The block to insert the node into.
148 * @param old_sp The node defining the former stack pointer.
149 * @param amount The mount of bytes the stack pointer shall be increased/decreased.
150 * @param dir The direction in which the stack pointer shall be modified:
151 * Along the stack's growing direction or against.
152 * @return A new stack pointer increment/decrement node.
153 * @note This node sets a register constraint to the @p sp register on its output.
155 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);
157 /** Returns the previous node that computes the stack pointer. */
158 ir_node *be_get_IncSP_pred(ir_node *incsp);
160 /** Sets a new offset to a IncSP node. */
161 void be_set_IncSP_offset(ir_node *irn, unsigned offset);
163 /** Gets the offset from a IncSP node. */
164 unsigned be_get_IncSP_offset(const ir_node *irn);
166 /** Sets a new direction to a IncSP node. */
167 void be_set_IncSP_direction(ir_node *irn, be_stack_dir_t dir);
169 /** Gets the direction from a IncSP node. */
170 be_stack_dir_t be_get_IncSP_direction(const ir_node *irn);
172 /** Gets the call entity or NULL if this is no static call. */
173 entity *be_Call_get_entity(const ir_node *call);
174 /** Sets the call entity. */
175 void be_Call_set_entity(ir_node *call, entity *ent);
176 /** Gets the call type. */
177 ir_type *be_Call_get_type(ir_node *call);
178 /** Sets the call type. */
179 void be_Call_set_type(ir_node *call, ir_type *call_tp);
182 be_pos_Call_mem = 0, /**< memory input of a be_Call node */
183 be_pos_Call_sp = 1, /**< stack pointer input of a be_Call node */
184 be_pos_Call_ptr = 2, /**< call pointer input of a be_Call node */
185 be_pos_Call_first_arg = 3 /**< first argument input of a be_Call node */
189 * Projection numbers for result of be_Call node: use for Proj nodes!
192 pn_be_Call_M_regular = pn_Call_M_regular, /**< The memory result of a be_Call. */
193 pn_be_Call_first_res = pn_Call_max /**< The first result proj number of a be_Call. */
197 * Construct a new be_Call
199 ir_node *be_new_Call(dbg_info *dbg, ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *sp, ir_node *ptr,
200 int n_outs, int n, ir_node *in[], ir_type *call_tp);
203 * Construct a new be_Return
205 ir_node *be_new_Return(dbg_info *dbg, ir_graph *irg, ir_node *bl, int n, ir_node *in[]);
206 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);
207 ir_node *be_new_RegParams(ir_graph *irg, ir_node *bl, int n_out);
209 ir_node *be_new_Barrier(ir_graph *irg, ir_node *bl, int n, ir_node *in[]);
211 ir_node *be_spill(const arch_env_t *arch_env, ir_node *irn,ir_node *spill_ctx);
212 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);
214 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);
215 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);
219 * Get the backend opcode of a backend node.
220 * @param irn The node.
221 * @return The backend opcode.
223 be_opcode_t be_get_irn_opcode(const ir_node *irn);
225 int be_is_Spill(const ir_node *irn);
226 int be_is_Reload(const ir_node *irn);
227 int be_is_Copy(const ir_node *irn);
228 int be_is_Perm(const ir_node *irn);
229 int be_is_Keep(const ir_node *irn);
230 int be_is_CopyKeep(const ir_node *irn);
231 int be_is_Call(const ir_node *irn);
232 int be_is_Return(const ir_node *irn);
233 int be_is_IncSP(const ir_node *irn);
234 int be_is_SetSP(const ir_node *irn);
235 int be_is_AddSP(const ir_node *irn);
236 int be_is_RegParams(const ir_node *irn);
237 int be_is_StackParam(const ir_node *irn);
238 int be_is_FrameAddr(const ir_node *irn);
239 int be_is_FrameLoad(const ir_node *irn);
240 int be_is_FrameStore(const ir_node *irn);
241 int be_is_Barrier(const ir_node *irn);
244 * Get the entity on the stack frame the given node uses.
245 * @param irn The node.
246 * @return The entity on the stack frame used by the node or NULL,
247 * if the node does not access the stack frame or is no back-end node.
250 entity *be_get_frame_entity(const ir_node *irn);
252 void be_set_Spill_entity(ir_node *irn, entity *ent);
253 entity *be_get_spill_entity(const ir_node *irn);
255 ir_node *be_get_Spill_context(const ir_node *irn);
258 * Set the entities of a Reload to the ones of the Spill it is pointing to.
259 * @param irg The graph.
261 void be_copy_entities_to_reloads(ir_graph *irg);
264 * Impose a register constraint on a backend node.
265 * @param irn The node.
266 * @param pos The position of the argument/result. Results range from -1..-m and arguments form 0..n
267 * @param reg The register which is admissible for that node, argument/result and position.
269 void be_set_constr_single_reg(ir_node *irn, int pos, const arch_register_t *reg);
272 * Impose register constraints on a backend node.
273 * The register subsets given by the limited function in @p req are copied to the backend node.
274 * This requires that the constraint type of the @p req is arch_register_req_type_limited.
275 * @param irn The backend node.
276 * @param pos The position (@see be_set_constr_single_reg()).
277 * @param req The register requirements which shall be transferred.
279 void be_set_constr_limited(ir_node *irn, int pos, const arch_register_req_t *req);
282 * Set the flags of a node.
283 * @param irn The node itself.
284 * @param pos The position (0..n) for arguments, (-1..-m) for results.
285 * @param flags The flags to set for that node and position.
287 void be_node_set_flags(ir_node *irn, int pos, arch_irn_flags_t flags);
290 * Set the register class of a node.
291 * @param irn The node itself.
292 * @param pos The position (0..n) for arguments, (-1..-m) for results.
293 * @param flags The register class to set for that node and position.
295 void be_node_set_reg_class(ir_node *irn, int pos, const arch_register_class_t *cls);
298 * Make a new phi handler.
299 * @param env The architecture environment.
300 * @return A new phi handler.
302 arch_irn_handler_t *be_phi_handler_new(const arch_env_t *arch_env);
305 * Free a phi handler.
306 * @param handler The handler to free.
308 void be_phi_handler_free(arch_irn_handler_t *handler);
311 * Reset the register data in the phi handler.
312 * This should be called on each new graph and deletes the register information of the current graph.
314 void be_phi_handler_reset(arch_irn_handler_t *handler);
317 * irn handler for common be nodes.
319 extern const arch_irn_handler_t be_node_irn_handler;
321 #endif /* _BENODE_T_H */