2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Backend node support for generic backend nodes.
23 * @author Sebastian Hack
26 * Backend node support for generic backend nodes.
27 * This file provides Perm, Copy, Spill and Reload nodes.
29 #ifndef FIRM_BE_BENODE_T_H
30 #define FIRM_BE_BENODE_T_H
34 #include "firm_types.h"
39 * The benode op's. Must be available to register emitter function.
41 extern ir_op *op_be_Spill;
42 extern ir_op *op_be_Reload;
43 extern ir_op *op_be_Perm;
44 extern ir_op *op_be_MemPerm;
45 extern ir_op *op_be_Copy;
46 extern ir_op *op_be_Keep;
47 extern ir_op *op_be_CopyKeep;
48 extern ir_op *op_be_Call;
49 extern ir_op *op_be_Return;
50 extern ir_op *op_be_IncSP;
51 extern ir_op *op_be_AddSP;
52 extern ir_op *op_be_SubSP;
53 extern ir_op *op_be_Start;
54 extern ir_op *op_be_FrameAddr;
57 * Determines if irn is a be_node.
59 int is_be_node(const ir_node *irn);
62 * Create all BE specific opcodes.
64 void be_init_op(void);
66 void be_finish_op(void);
69 * Position numbers for the be_Spill inputs.
77 * Make a new Spill node.
79 ir_node *be_new_Spill(const arch_register_class_t *cls,
80 const arch_register_class_t *cls_frame, ir_node *block,
81 ir_node *frame, ir_node *to_spill);
84 * Position numbers for the be_Reload inputs.
87 n_be_Reload_frame = 0,
92 * Make a new Reload node.
94 ir_node *be_new_Reload(const arch_register_class_t *cls,
95 const arch_register_class_t *cls_frame, ir_node *block,
96 ir_node *frame, ir_node *mem, ir_mode *mode);
99 * Position numbers for the be_Copy inputs.
106 * Make a new Copy node.
108 ir_node *be_new_Copy(ir_node *block, ir_node *in);
109 /** Returns the Copy Argument. */
110 ir_node *be_get_Copy_op(const ir_node *cpy);
111 /** Sets the Copy Argument. */
112 void be_set_Copy_op(ir_node *cpy, ir_node *op);
115 * Make a new Perm node.
117 ir_node *be_new_Perm(const arch_register_class_t *cls, ir_node *block,
118 int n, ir_node *in[]);
122 * Basically, we provide a map to remap the Perm's arguments. If an entry in the
123 * map is -1, the argument gets deleted.
124 * This function takes care, that the register data and the input array reflects
125 * the changes described by the map.
126 * This is needed by the Perm optimization/movement in belower.c, see
127 * push_through_perm().
128 * @param perm The perm node.
129 * @param new_size The new number of arguments (must be smaller or equal to the
131 * @param map A map assigning each operand a new index (or -1 to indicate
134 void be_Perm_reduce(ir_node *perm, int new_size, int *map);
137 * Create a new MemPerm node.
138 * A MemPerm node exchanges the values of memory locations. (Typically entities
139 * used as spillslots). MemPerm nodes perform this operation without modifying
140 * any register values.
142 ir_node *be_new_MemPerm(ir_node *block, int n, ir_node *in[]);
143 ir_node *be_new_Keep(ir_node *block, int arity, ir_node *in[]);
145 void be_Keep_add_node(ir_node *keep, const arch_register_class_t *cls,
149 * Position numbers for the be_FrameAddr inputs
152 n_be_FrameAddr_ptr = 0
155 /** Create a new FrameAddr node. */
156 ir_node *be_new_FrameAddr(const arch_register_class_t *cls_frame,
157 ir_node *block, ir_node *frame, ir_entity *ent);
159 /** Return the frame input of a FrameAddr node. */
160 ir_node *be_get_FrameAddr_frame(const ir_node *node);
162 ir_entity *be_get_FrameAddr_entity(const ir_node *node);
165 * Position numbers for the be_AddSP inputs
168 n_be_AddSP_old_sp = 0,
181 * Make a new AddSP node.
182 * An AddSP node expresses an increase of the stack pointer in the direction
183 * the stack grows. In contrast to IncSP, the amount of bytes the stack pointer
184 * is grown, is not given by a constant but an ordinary Firm node.
185 * @param sp The stack pointer register.
186 * @param block The block.
187 * @param old_sp The node representing the old stack pointer value.
188 * @param size The node expressing the size by which the stack pointer shall
190 * @return A new AddSP node.
192 ir_node *be_new_AddSP(const arch_register_t *sp, ir_node *block,
193 ir_node *old_sp, ir_node *size);
196 * Position numbers for the be_SubSP inputs
199 n_be_SubSP_old_sp = 0,
211 * Make a new SubSP node.
212 * A SubSP node expresses a decrease of the stack pointer in the direction the
213 * stack grows. In contrast to IncSP, the amount of bytes the stack pointer is
214 * grown, is not given by a constant but an ordinary Firm node.
215 * @param sp The stack pointer register.
216 * @param block The block.
217 * @param old_sp The node representing the old stack pointer value.
218 * @param size The node expressing the size by which the stack pointer shall
220 * @return A new DecSP node.
222 ir_node *be_new_SubSP(const arch_register_t *sp, ir_node *block,
223 ir_node *old_sp, ir_node *size);
226 * Make a stack pointer increase/decrease node.
227 * @param sp The stack pointer register.
228 * @param block The block to insert the node into.
229 * @param old_sp The node defining the former stack pointer.
230 * @param offset amount the stack should expand (positive offset) or shrink
231 * (negative offset). Note that the offset is independent of the
232 * natural stack direction of the architecture but just specifies
233 * abstract expanding/shrinking of the stack area.
234 * @param align force stack alignment to this power of 2. (ie. specifying 3
235 * results in a 2^3 = 8byte stack alignment)
236 * @return A new stack pointer increment/decrement node.
237 * @note This node sets a register constraint to the @p sp register on
240 ir_node *be_new_IncSP(const arch_register_t *sp, ir_node *block,
241 ir_node *old_sp, int offset, int align);
243 /** Returns the previous node that computes the stack pointer. */
244 ir_node *be_get_IncSP_pred(ir_node *incsp);
246 /** Sets the previous node that computes the stack pointer. */
247 void be_set_IncSP_pred(ir_node *incsp, ir_node *pred);
250 * Sets a new offset to a IncSP node.
251 * A positive offset means expanding the stack, a negative offset shrinking
252 * an offset is == BE_STACK_FRAME_SIZE will be replaced by the real size of the
253 * stackframe in the fix_stack_offsets phase.
255 void be_set_IncSP_offset(ir_node *irn, int offset);
257 /** Gets the offset from a IncSP node. */
258 int be_get_IncSP_offset(const ir_node *irn);
259 int be_get_IncSP_align(const ir_node *irn);
261 /** Gets the call entity or NULL if this is no static call. */
262 ir_entity *be_Call_get_entity(const ir_node *call);
263 /** Sets the call entity. */
264 void be_Call_set_entity(ir_node *call, ir_entity *ent);
265 /** Gets the call type. */
266 ir_type *be_Call_get_type(ir_node *call);
267 /** Sets the call type. */
268 void be_Call_set_type(ir_node *call, ir_type *call_tp);
270 void be_Call_set_pop(ir_node *call, unsigned pop);
272 unsigned be_Call_get_pop(const ir_node *call);
275 * Position numbers for the be_Call inputs.
278 n_be_Call_mem = 0, /**< memory input of a be_Call node */
279 n_be_Call_sp = 1, /**< stack pointer input of a be_Call node */
280 n_be_Call_ptr = 2, /**< call pointer input of a be_Call node */
281 n_be_Call_first_arg = 3 /**< first argument input of a be_Call node */
285 * Projection numbers for result of be_Call node: use for Proj nodes!
288 pn_be_Call_M = pn_Call_M, /**< The memory result of a be_Call. */
289 pn_be_Call_X_regular = pn_Call_X_regular,
290 pn_be_Call_X_except = pn_Call_X_except,
291 pn_be_Call_sp = pn_Call_max+1,
292 pn_be_Call_first_res /**< The first result proj number of a be_Call. */
296 * Construct a new be_Call.
298 * @param dbg debug info
299 * @param irg the graph where the call is placed
300 * @param block the block where the call is placed
301 * @param mem the memory input of the call
302 * @param sp the stack pointer input of the call
303 * @param ptr the address of the called function, if immediate call set
305 * @param n_outs the number of outcoming values from this call
306 * @param n the number of (register) inputs of this call
307 * @param in the (register) inputs of this call
308 * @param call_tp the call type of this call
310 ir_node *be_new_Call(dbg_info *dbg, ir_graph *irg, ir_node *block, ir_node *mem,
311 ir_node *sp, ir_node *ptr, int n_outs,
312 int n, ir_node *in[], ir_type *call_tp);
315 * Position numbers for the be_Return inputs.
318 n_be_Return_mem = 0, /**< memory input of a be_Return node */
319 n_be_Return_sp = 1, /**< stack pointer input of a be_Return node */
320 n_be_Return_val = 2, /**< first "real" return value if any */
324 * Construct a new be_Return.
326 * @param dbg debug info
327 * @param irg the graph where the new node will be placed
328 * @param block the block where the new node will be placed
329 * @param n_res number of "real" results
330 * @param pop pop number of bytes on return
331 * @param n number of inputs
332 * @param in input array
334 ir_node *be_new_Return(dbg_info *dbg, ir_graph *irg, ir_node *block, int n_res,
335 unsigned pop, int n, ir_node *in[]);
337 /** Returns the number of real returns values */
338 int be_Return_get_n_rets(const ir_node *ret);
341 * Return the number of bytes that should be popped from stack when executing
344 * @param ret the be_Return node
346 unsigned be_Return_get_pop(const ir_node *ret);
349 * Return non-zero, if number of popped bytes must be always emitted.
351 * @param ret the be_Return node
353 int be_Return_get_emit_pop(const ir_node *ret);
356 * Set the emit_pop flag.
358 * @param ret the be_Return node
360 void be_Return_set_emit_pop(ir_node *ret, int emit_pop);
362 ir_node *be_new_Start(dbg_info *dbgi, ir_node *block, int n_out);
367 ir_node *be_new_CopyKeep(ir_node *block, ir_node *src,
368 int n, ir_node *in_keep[]);
370 ir_node *be_new_CopyKeep_single(ir_node *block, ir_node *src, ir_node *keep);
372 ir_node *be_get_CopyKeep_op(const ir_node *cpy);
374 void be_set_CopyKeep_op(ir_node *cpy, ir_node *op);
377 * Returns the frame entity of a be node.
378 * Try to avoid this function and better call arch_get_frame_entity!
380 * @return the frame entity used by the be node
382 ir_entity *be_get_frame_entity(const ir_node *irn);
384 void be_node_set_frame_entity(ir_node *node, ir_entity *entity);
387 * Returns the frame offset of this node.
389 int be_get_frame_offset(const ir_node *irn);
391 ir_node* be_get_Reload_mem(const ir_node *irn);
392 ir_node *be_get_Reload_frame(const ir_node *irn);
393 ir_node* be_get_Spill_val(const ir_node *irn);
394 ir_node *be_get_Spill_frame(const ir_node *irn);
396 void be_set_MemPerm_in_entity(const ir_node *irn, int n, ir_entity* ent);
397 ir_entity *be_get_MemPerm_in_entity(const ir_node *irn, int n);
399 void be_set_MemPerm_out_entity(const ir_node *irn, int n, ir_entity* ent);
400 ir_entity *be_get_MemPerm_out_entity(const ir_node *irn, int n);
402 int be_get_MemPerm_entity_arity(const ir_node *irn);
405 * Impose a register constraint on a backend node.
406 * @param irn The node.
407 * @param pos The position of the argument.
408 * @param reg The register which is admissible for that node, argument/result
411 void be_set_constr_single_reg_in(ir_node *irn, int pos,
412 const arch_register_t *reg, arch_register_req_type_t additional_flags);
413 void be_set_constr_single_reg_out(ir_node *irn, int pos,
414 const arch_register_t *reg, arch_register_req_type_t additional_flags);
416 const arch_register_req_t *be_create_reg_req(struct obstack *obst,
417 const arch_register_t *reg, arch_register_req_type_t additional_types);
420 * Impose register constraints on a backend node.
421 * The register subsets given by the limited function in @p req are copied to
422 * the backend node. This requires that the constraint type of the @p req is
423 * arch_register_req_type_limited.
424 * @param irn The backend node.
425 * @param pos The position (@see be_set_constr_single_reg()).
426 * @param req The register requirements which shall be transferred.
428 void be_set_constr_in(ir_node *irn, int pos, const arch_register_req_t *req);
429 void be_set_constr_out(ir_node *irn, int pos, const arch_register_req_t *req);
432 * Set the register class of a node.
433 * @param irn The node itself.
434 * @param pos The position (0..n) for arguments
435 * @param flags The register class to set for that node and position.
437 void be_node_set_reg_class_in(ir_node *irn, int pos,
438 const arch_register_class_t *cls);
439 void be_node_set_reg_class_out(ir_node *irn, int pos,
440 const arch_register_class_t *cls);
443 * Set the register requirements for a phi node.
445 void be_set_phi_reg_req(ir_node *phi, const arch_register_req_t *req);
447 void be_dump_phi_reg_reqs(FILE *out, const ir_node *node, dump_reason_t reason);
450 * Creates a new phi with associated backend informations
452 ir_node *be_new_Phi(ir_node *block, int n_ins, ir_node **ins, ir_mode *mode,
453 const arch_register_req_t *req);
456 * Search for output of start node with a specific register
458 ir_node *be_get_initial_reg_value(ir_graph *irg, const arch_register_t *reg);
461 * Search for input of a return node with a specific register and return
464 int be_find_return_reg_input(ir_node *ret, const arch_register_t *reg);
466 static inline int be_is_Spill (const ir_node *irn) { return get_irn_opcode(irn) == beo_Spill ; }
467 static inline int be_is_Reload (const ir_node *irn) { return get_irn_opcode(irn) == beo_Reload ; }
468 static inline int be_is_Copy (const ir_node *irn) { return get_irn_opcode(irn) == beo_Copy ; }
469 static inline int be_is_CopyKeep (const ir_node *irn) { return get_irn_opcode(irn) == beo_CopyKeep ; }
470 static inline int be_is_Perm (const ir_node *irn) { return get_irn_opcode(irn) == beo_Perm ; }
471 static inline int be_is_MemPerm (const ir_node *irn) { return get_irn_opcode(irn) == beo_MemPerm ; }
472 static inline int be_is_Keep (const ir_node *irn) { return get_irn_opcode(irn) == beo_Keep ; }
473 static inline int be_is_Call (const ir_node *irn) { return get_irn_opcode(irn) == beo_Call ; }
474 static inline int be_is_Return (const ir_node *irn) { return get_irn_opcode(irn) == beo_Return ; }
475 static inline int be_is_IncSP (const ir_node *irn) { return get_irn_opcode(irn) == beo_IncSP ; }
476 static inline int be_is_AddSP (const ir_node *irn) { return get_irn_opcode(irn) == beo_AddSP ; }
477 static inline int be_is_SubSP (const ir_node *irn) { return get_irn_opcode(irn) == beo_SubSP ; }
478 static inline int be_is_Start (const ir_node *irn) { return get_irn_opcode(irn) == beo_Start ; }
479 static inline int be_is_FrameAddr(const ir_node *irn) { return get_irn_opcode(irn) == beo_FrameAddr; }