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
27 * Backend node support for generic backend nodes.
28 * This file provides Perm, Copy, Spill and Reload nodes.
30 #ifndef FIRM_BE_BENODE_T_H
31 #define FIRM_BE_BENODE_T_H
35 #include "firm_types.h"
39 #define BE_OUT_POS(p) (-((p) + 1))
42 * The benode op's. Must be available to register emitter function.
44 extern ir_op *op_be_Spill;
45 extern ir_op *op_be_Reload;
46 extern ir_op *op_be_Perm;
47 extern ir_op *op_be_MemPerm;
48 extern ir_op *op_be_Copy;
49 extern ir_op *op_be_Keep;
50 extern ir_op *op_be_CopyKeep;
51 extern ir_op *op_be_Call;
52 extern ir_op *op_be_Return;
53 extern ir_op *op_be_IncSP;
54 extern ir_op *op_be_AddSP;
55 extern ir_op *op_be_SubSP;
56 extern ir_op *op_be_RegParams;
57 extern ir_op *op_be_FrameAddr;
58 extern ir_op *op_be_Barrier;
59 extern ir_op *op_be_Unwind;
84 be_frame_flag_spill = 1,
85 be_frame_flag_local = 2,
90 * A "symbolic constant" for the size of the stack frame to use with IncSP nodes.
91 * It gets back-patched to the real size as soon it is known.
93 #define BE_STACK_FRAME_SIZE_EXPAND INT_MAX
94 #define BE_STACK_FRAME_SIZE_SHRINK INT_MIN
97 * Determines if irn is a be_node.
99 int is_be_node(const ir_node *irn);
102 * Create all BE specific opcodes.
104 void be_node_init(void);
107 * Position numbers for the be_Spill inputs.
110 be_pos_Spill_frame = 0,
115 * Make a new Spill node.
117 ir_node *be_new_Spill(const arch_register_class_t *cls, const arch_register_class_t *cls_frame,
118 ir_graph *irg, ir_node *bl, ir_node *frame, ir_node *to_spill);
121 * Position numbers for the be_Reload inputs.
124 be_pos_Reload_frame = 0,
125 be_pos_Reload_mem = 1
129 * Make a new Reload node.
131 ir_node *be_new_Reload(const arch_register_class_t *cls, const arch_register_class_t *cls_frame,
132 ir_graph *irg, ir_node *bl, ir_node *frame, ir_node *mem, ir_mode *mode);
135 * Position numbers for the be_Copy inputs.
142 * Make a new Copy node.
144 ir_node *be_new_Copy(const arch_register_class_t *cls, ir_graph *irg, ir_node *block, ir_node *in);
145 /** Returns the Copy Argument. */
146 ir_node *be_get_Copy_op(const ir_node *cpy);
147 /** Sets the Copy Argument. */
148 void be_set_Copy_op(ir_node *cpy, ir_node *op);
151 * Make a new Perm node.
153 ir_node *be_new_Perm(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int arity, ir_node *in[]);
157 * Basically, we provide a map to remap the Perm's arguments. If an entry in the
158 * map is -1, the argument gets deleted.
159 * This function takes care, that the register data and the input array reflects
160 * the changes described by the map.
161 * This is needed by the Perm optimization/movement in belower.c, see push_through_perm().
162 * @param perm The perm node.
163 * @param new_size The new number of arguments (must be smaller or equal to the current one).
164 * @param map A map assigning each operand a new index (or -1 to indicate deletion).
166 void be_Perm_reduce(ir_node *perm, int new_size, int *map);
169 * Create a new MemPerm node.
171 ir_node *be_new_MemPerm(const arch_env_t *arch_env, ir_graph *irg, ir_node *bl, int n, ir_node *in[]);
172 ir_node *be_new_Keep(const arch_register_class_t *cls, ir_graph *irg, ir_node *bl, int arity, ir_node *in[]);
174 void be_Keep_add_node(ir_node *keep, const arch_register_class_t *cls, ir_node *node);
177 * Position numbers for the be_FrameAddr inputs
180 be_pos_FrameAddr_ptr = 0
183 /** Create a new FrameAddr node. */
184 ir_node *be_new_FrameAddr(const arch_register_class_t *cls_frame, ir_graph *irg, ir_node *bl, ir_node *frame, ir_entity *ent);
186 /** Return the frame input of a FrameAddr node. */
187 ir_node *be_get_FrameAddr_frame(const ir_node *node);
189 ir_entity *be_get_FrameAddr_entity(const ir_node *node);
192 * Position numbers for the be_AddSP inputs
195 be_pos_AddSP_old_sp = 0,
196 be_pos_AddSP_size = 1,
197 be_pos_AddSP_last = 2
208 * Make a new AddSP node.
209 * An AddSP node expresses an increase of the stack pointer in the direction the stack
210 * grows. In contrast to IncSP, the amount of bytes the stack pointer is grown, is not
211 * given by a constant but an ordinary Firm node.
212 * @param sp The stack pointer register.
213 * @param irg The graph.
214 * @param bl The block.
215 * @param old_sp The node representing the old stack pointer value.
216 * @param sz The node expressing the size by which the stack pointer shall be grown.
217 * @return A new AddSP node.
219 ir_node *be_new_AddSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *sz);
222 * Position numbers for the be_SubSP inputs
225 be_pos_SubSP_old_sp = 0,
226 be_pos_SubSP_size = 1,
227 be_pos_SubSP_last = 2
237 * Make a new SubSP node.
238 * A SubSP node expresses a decrease of the stack pointer in the direction the stack
239 * grows. In contrast to IncSP, the amount of bytes the stack pointer is grown, is not
240 * given by a constant but an ordinary Firm node.
241 * @param sp The stack pointer register.
242 * @param irg The graph.
243 * @param bl The block.
244 * @param old_sp The node representing the old stack pointer value.
245 * @param sz The node expressing the size by which the stack pointer shall be grown.
246 * @return A new DecSP node.
248 ir_node *be_new_SubSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl, ir_node *old_sp, ir_node *sz);
251 * Make a stack pointer increase/decrease node.
252 * @param sp The stack pointer register.
253 * @param irg The graph to insert the node to.
254 * @param bl The block to insert the node into.
255 * @param old_sp The node defining the former stack pointer.
256 * @param amount The mount of bytes the stack shall be expanded/shrinked (see set_IncSP_offset)
257 * @param dir The direction in which the stack pointer shall be modified:
258 * Along the stack's growing direction or against.
259 * @return A new stack pointer increment/decrement node.
260 * @note This node sets a register constraint to the @p sp register on its output.
262 ir_node *be_new_IncSP(const arch_register_t *sp, ir_graph *irg, ir_node *bl,
263 ir_node *old_sp, int offset, int align);
265 /** Returns the previous node that computes the stack pointer. */
266 ir_node *be_get_IncSP_pred(ir_node *incsp);
268 /** Sets the previous node that computes the stack pointer. */
269 void be_set_IncSP_pred(ir_node *incsp, ir_node *pred);
272 * Sets a new offset to a IncSP node.
273 * A positive offset means expanding the stack, a negative offset shrinking
274 * an offset is == BE_STACK_FRAME_SIZE will be replaced by the real size of the
275 * stackframe in the fix_stack_offsets phase.
277 void be_set_IncSP_offset(ir_node *irn, int offset);
279 /** Gets the offset from a IncSP node. */
280 int be_get_IncSP_offset(const ir_node *irn);
281 int be_get_IncSP_align(const ir_node *irn);
283 /** Gets the call entity or NULL if this is no static call. */
284 ir_entity *be_Call_get_entity(const ir_node *call);
285 /** Sets the call entity. */
286 void be_Call_set_entity(ir_node *call, ir_entity *ent);
287 /** Gets the call type. */
288 ir_type *be_Call_get_type(ir_node *call);
289 /** Sets the call type. */
290 void be_Call_set_type(ir_node *call, ir_type *call_tp);
292 void be_Call_set_pop(ir_node *call, unsigned pop);
294 unsigned be_Call_get_pop(const ir_node *call);
297 * Position numbers for the be_Call inputs.
300 be_pos_Call_mem = 0, /**< memory input of a be_Call node */
301 be_pos_Call_sp = 1, /**< stack pointer input of a be_Call node */
302 be_pos_Call_ptr = 2, /**< call pointer input of a be_Call node */
303 be_pos_Call_first_arg = 3 /**< first argument input of a be_Call node */
307 * Projection numbers for result of be_Call node: use for Proj nodes!
310 pn_be_Call_M_regular = pn_Call_M_regular, /**< The memory result of a be_Call. */
311 pn_be_Call_sp = pn_Call_max,
312 pn_be_Call_first_res /**< The first result proj number of a be_Call. */
316 * Construct a new be_Call.
318 * @param dbg debug info
319 * @param irg the graph where the call is placed
320 * @param bl the block where the call is placed
321 * @param mem the memory input of the call
322 * @param sp the stack pointer input of the call
323 * @param ptr the address of the called function, if immediate call set to sp
324 * @param n_outs the number of outcoming values from this call
325 * @param n the number of (register) inputs of this call
326 * @param in the (register) inputs of this call
327 * @param call_tp the call type of this call
329 ir_node *be_new_Call(dbg_info *dbg, ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *sp, ir_node *ptr,
330 int n_outs, int n, ir_node *in[], ir_type *call_tp);
333 * Position numbers for the be_Return inputs.
336 be_pos_Return_mem = 0, /**< memory input of a be_Return node */
337 be_pos_Return_sp = 1, /**< stack pointer input of a be_Return node */
338 be_pos_Return_val = 2, /**< first "real" return value if any */
342 * Construct a new be_Return.
344 * @param dbg debug info
345 * @param irg the graph where the new node will be placed
346 * @param bl the block where the new node will be placed
347 * @param n_res number of "real" results
348 * @param n number of inputs
349 * @param pop pop number of bytes on return
350 * @param in input array
352 ir_node *be_new_Return(dbg_info *dbg, ir_graph *irg, ir_node *bl, int n_res, unsigned pop, int n, ir_node *in[]);
354 /** Returns the number of real returns values */
355 int be_Return_get_n_rets(const ir_node *ret);
358 * Return the number of bytes that should be popped from stack when executing the Return.
360 * @param ret the be_Return node
362 unsigned be_Return_get_pop(const ir_node *ret);
364 /** appends a node to the return node, returns the position of the node */
365 int be_Return_append_node(ir_node *ret, ir_node *node);
367 ir_node *be_new_RegParams(ir_graph *irg, ir_node *bl, int n_out);
369 ir_node *be_new_Barrier(ir_graph *irg, ir_node *bl, int n, ir_node *in[]);
372 * Appends a node to a barrier, returns the result proj of the node
374 ir_node *be_Barrier_append_node(ir_node *barrier, ir_node *node);
377 * Appends a register out requirement to a RegParams node
379 * @returns the proj node for the new register
381 ir_node *be_RegParams_append_out_reg(ir_node *regparams,
382 const arch_env_t *arch_env,
383 const arch_register_t *reg);
388 * @param arch_env The architecture environment.
389 * @param irn The node to be spilled.
390 * @param spill_ctx The context in which the spill is introduced (This is mostly == irn up to the case of Phis).
391 * @return The new spill node.
393 ir_node *be_spill(const arch_env_t *arch_env, ir_node *block, ir_node *irn);
396 * Make a reload and insert it into the schedule.
398 * @param arch_env The architecture environment.
399 * @param cls The register class of the reloaded value.
400 * @param insert The node in the schedule in front of which the reload is inserted.
401 * @param mode The mode of the original (spilled) value.
402 * @param spill The spill node corresponding to this reload.
403 * @return A freshly made reload.
405 ir_node *be_reload(const arch_env_t *arch_env, const arch_register_class_t *cls, ir_node *insert, ir_mode *mode, ir_node *spill);
408 be_pos_CopyKeep_op = 0
410 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);
411 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);
412 ir_node *be_get_CopyKeep_op(const ir_node *cpy);
413 void be_set_CopyKeep_op(ir_node *cpy, ir_node *op);
416 * Position numbers for the be_Unwind inputs.
419 be_pos_Unwind_mem = 0, /**< memory input of a be_Unwind node */
420 be_pos_Unwind_sp = 1, /**< stack pointer input of a be_Unwind node */
424 * Construct a new be_Unwind.
426 * @param dbg debug info
427 * @param irg the graph where the new node will be placed
428 * @param bl the block where the new node will be placed
429 * @param mem the memory input
430 * @param sp the stack pointer input
432 ir_node *be_new_Unwind(dbg_info *dbg, ir_graph *irg, ir_node *bl, ir_node *mem, ir_node *sp);
434 ir_node *be_get_Unwind_mem(const ir_node *irn);
435 ir_node *be_get_Unwind_sp(const ir_node *irn);
438 * Get the backend opcode of a backend node.
439 * @param irn The node.
440 * @return The backend opcode.
442 be_opcode_t be_get_irn_opcode(const ir_node *irn);
444 int be_is_Spill(const ir_node *irn);
445 int be_is_Reload(const ir_node *irn);
446 int be_is_Copy(const ir_node *irn);
447 int be_is_Perm(const ir_node *irn);
448 int be_is_MemPerm(const ir_node *irn);
449 int be_is_Keep(const ir_node *irn);
450 int be_is_CopyKeep(const ir_node *irn);
451 int be_is_Call(const ir_node *irn);
452 int be_is_Return(const ir_node *irn);
453 int be_is_IncSP(const ir_node *irn);
454 int be_is_AddSP(const ir_node *irn);
455 int be_is_SubSP(const ir_node *irn);
456 int be_is_RegParams(const ir_node *irn);
457 int be_is_FrameAddr(const ir_node *irn);
458 int be_is_Barrier(const ir_node *irn);
459 int be_is_Unwind(const ir_node *irn);
462 * Returns the frame entity of a be node.
463 * Try to avoid this function and better call arch_get_frame_entity!
465 * @return the frame entity used by the be node
467 ir_entity *be_get_frame_entity(const ir_node *irn);
470 * Returns the frame offset of this node.
472 int be_get_frame_offset(const ir_node *irn);
474 ir_node* be_get_Reload_mem(const ir_node *irn);
475 ir_node *be_get_Reload_frame(const ir_node *irn);
476 ir_node* be_get_Spill_val(const ir_node *irn);
477 ir_node *be_get_Spill_frame(const ir_node *irn);
479 void be_set_MemPerm_in_entity(const ir_node *irn, int n, ir_entity* ent);
480 ir_entity *be_get_MemPerm_in_entity(const ir_node *irn, int n);
482 void be_set_MemPerm_out_entity(const ir_node *irn, int n, ir_entity* ent);
483 ir_entity *be_get_MemPerm_out_entity(const ir_node *irn, int n);
485 int be_get_MemPerm_entity_arity(const ir_node *irn);
488 * Impose a register constraint on a backend node.
489 * @param irn The node.
490 * @param pos The position of the argument/result. Results range from -1..-m and arguments form 0..n
491 * @param reg The register which is admissible for that node, argument/result and position.
493 void be_set_constr_single_reg(ir_node *irn, int pos, const arch_register_t *reg);
496 * Impose register constraints on a backend node.
497 * The register subsets given by the limited function in @p req are copied to the backend node.
498 * This requires that the constraint type of the @p req is arch_register_req_type_limited.
499 * @param irn The backend node.
500 * @param pos The position (@see be_set_constr_single_reg()).
501 * @param req The register requirements which shall be transferred.
503 void be_set_constr_limited(ir_node *irn, int pos, const arch_register_req_t *req);
506 * Set the flags of a node.
507 * @param irn The node itself.
508 * @param pos The position (0..n) for arguments, (-1..-m) for results.
509 * @param flags The flags to set for that node and position.
511 void be_node_set_flags(ir_node *irn, int pos, arch_irn_flags_t flags);
513 void be_node_add_flags(ir_node *irn, int pos, arch_irn_flags_t flags);
516 * Set the register class of a node.
517 * @param irn The node itself.
518 * @param pos The position (0..n) for arguments, (-1..-m) for results.
519 * @param flags The register class to set for that node and position.
521 void be_node_set_reg_class(ir_node *irn, int pos, const arch_register_class_t *cls);
524 * Set the register requirement type of a node.
525 * @param irn The node itself.
526 * @param pos The position (0..n) for arguments, (-1..-m) for results.
527 * @param flags The register requirement type to set for that node and position.
529 void be_node_set_req_type(ir_node *irn, int pos, arch_register_req_type_t type);
532 * Make a new phi handler.
533 * @param env The architecture environment.
534 * @return A new phi handler.
536 arch_irn_handler_t *be_phi_handler_new(const arch_env_t *arch_env);
539 * Free a phi handler.
540 * @param handler The handler to free.
542 void be_phi_handler_free(arch_irn_handler_t *handler);
545 * Reset the register data in the phi handler.
546 * This should be called on each new graph and deletes the register information of the current graph.
548 void be_phi_handler_reset(arch_irn_handler_t *handler);
551 * Set the register requirements for a phi node.
553 void be_set_phi_reg_req(const arch_env_t *arch_env, ir_node *phi,
554 const arch_register_req_t *req);
557 * Set flags for a phi node
559 void be_set_phi_flags(const arch_env_t *arch_env, ir_node *phi,
560 arch_irn_flags_t flags);
563 * irn handler for common be nodes.
565 extern const arch_irn_handler_t be_node_irn_handler;
567 #endif /* FIRM_BE_BENODE_T_H */