2 * Copyright (C) 1995-2011 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 Lowering of high level constructs.
23 * @author Michael Beck
26 #ifndef FIRM_LOWERING_H
27 #define FIRM_LOWERING_H
31 #include "firm_types.h"
36 * A type telling where to add hidden parameters.
38 typedef enum add_hidden_params {
39 ADD_HIDDEN_ALWAYS_IN_FRONT = 0, /**< always add hidden parameters in front (default). */
40 ADD_HIDDEN_ALWAYS_LAST = 1, /**< always add hidden parameters last, did not work for variadic functions. */
41 ADD_HIDDEN_SMART = 2 /**< add hidden parameters last for non-variadic and first for variadic functions. */
45 * Additional flags for the lowering.
48 LF_NONE = 0, /**< no additional flags */
49 LF_COMPOUND_PARAM = 1, /**< lower calls with compound parameters */
50 LF_COMPOUND_RETURN = 2, /**< lower calls with compound returns */
51 LF_RETURN_HIDDEN = 4, /**< return the hidden address instead of void */
52 LF_SMALL_CMP_IN_REGS = 8 /**< return small compound values in registers */
55 /** Maximum number of registers that can be used to return compound values. */
56 #define MAX_REGISTER_RET_VAL 2
59 * A struct containing all control parameters for
60 * lower_compound_ret_calls().
63 int def_ptr_alignment; /**< Default alignment for data pointer. */
64 unsigned flags; /**< A bitmask of enum lowering_flags. */
65 add_hidden hidden_params; /**< Where to add hidden parameters. */
68 * A function returning a pointer type for a given type.
69 * If this pointer is NULL, a new pointer type is always created.
71 ir_type *(*find_pointer_type)(ir_type *e_type, ir_mode *mode, int alignment);
74 * If the LF_SMALL_CMP_IN_REGS flag is set, this function will be called
75 * to decide, whether a compound value should be returned in registers.
76 * This function must return the number of used registers and fill in the modes
77 * of the registers to use. Up to MAX_REGISTER_RET_VAL registers can be used.
79 int (*ret_compound_in_regs)(ir_type *compound_tp, ir_mode **modes);
83 * Lower calls with compound parameter and return types.
84 * This function does the following transformations:
86 * If LF_COMPOUND_PARAM is set:
88 * - Copy compound parameters to a new location on the callers
89 * stack and transmit the address of this new location
91 * If LF_COMPOUND_RETURN is set:
93 * - Adds a new (hidden) pointer parameter for
94 * any return compound type. The return type is replaced by void
95 * or if LOWERING_FLAGS_RETURN_HIDDEN is set by the address.
97 * - Use of the hidden parameters in the function code.
99 * - Change all calls to functions with compound return
100 * by providing space for the hidden parameter on the callers
103 * - Replace a possible block copy after the function call.
107 * - Changes the types of methods and calls to the lowered ones
109 * - lower all method types of existing entities
111 * In pseudo-code, the following transformation is done:
114 struct x ret = func(a, b);
123 * If the function returns only one possible result, the copy-on-return
124 * optimization is done, ie.
133 * is transformed into
136 void func(struct x *ret, a) {
141 * @param params A structure containing the control parameter for this
144 * During the transformation, pointer types must be created or reused.
145 * The caller can provide params->find_pointer_type for this task to
146 * reduce the number of created pointer types.
147 * If params->find_pointer_type is NULL, new pointer types
148 * are always created automatically.
150 FIRM_API void lower_calls_with_compounds(const lower_params_t *params);
153 * Lower CopyB nodes of size smaller that max_size into Loads/Stores
155 FIRM_API void lower_CopyB(ir_graph *irg, unsigned max_size,
156 unsigned native_mode_bytes);
159 * Lowers all Switches (Cond nodes with non-boolean mode) depending on spare_size.
160 * They will either remain the same or be converted into if-cascades.
162 * @param irg The ir graph to be lowered.
163 * @param spare_size Allowed spare size for table switches in machine words.
164 * (Default in edgfe: 128)
165 * @param allow_out_of_bounds backend can handle out-of-bounds values
166 * (values bigger than minimum and maximum proj
169 FIRM_API void lower_switch(ir_graph *irg, unsigned spare_size,
170 int allow_out_of_bounds);
173 * Replaces SymConsts by a real constant if possible.
174 * Replace Sel nodes by address computation. Also resolves array access.
175 * Handle bit fields by added And/Or calculations.
177 * @param irg the graph to lower
178 * @param lower_bitfields the graph contains old-style bitfield
181 * @note: There is NO lowering ob objects oriented types. This is highly compiler
182 * and ABI specific and should be placed directly in the compiler.
184 FIRM_API void lower_highlevel_graph(ir_graph *irg, int lower_bitfields);
187 * Creates an ir_graph pass for lower_highlevel_graph().
189 * @param name the name of this pass or NULL
190 * @param lower_bitfields the graph contains old-style bitfield
193 * @return the newly created ir_graph pass
195 FIRM_API ir_graph_pass_t *lower_highlevel_graph_pass(const char *name,
196 int lower_bitfields);
199 * Replaces SymConsts by a real constant if possible.
200 * Replace Sel nodes by address computation. Also resolves array access.
201 * Handle bit fields by added And/Or calculations.
204 * @note There is NO lowering of objects oriented types. This is highly compiler
205 * and ABI specific and should be placed directly in the compiler.
207 FIRM_API void lower_highlevel(int lower_bitfields);
210 * does the same as lower_highlevel for all nodes on the const code irg
212 FIRM_API void lower_const_code(void);
215 * Creates an ir_prog pass for lower_const_code().
217 * @param name the name of this pass or NULL
219 * @return the newly created ir_prog pass
221 FIRM_API ir_prog_pass_t *lower_const_code_pass(const char *name);
224 * Function which creates a "set" instraction. A "set" instruction takes a
225 * condition value (a value with mode_b) as input and produces a value in a
226 * general purpose integer mode.
227 * Most architectures have special intrinsics for this. But if all else fails
228 * you can just produces the an if-like construct.
230 typedef ir_node* (*create_set_func)(ir_node *cond);
233 * implementation of create_set_func which produces a Mux node with 0/1 input
235 ir_node *ir_create_mux_set(ir_node *cond, ir_mode *dest_mode);
238 * implementation of create_set_func which produces a cond with control
241 ir_node *ir_create_cond_set(ir_node *cond, ir_mode *dest_mode);
243 typedef struct lower_mode_b_config_t {
244 /* mode that is used to transport 0/1 values */
245 ir_mode *lowered_mode;
246 /* callback for creating set-like instructions */
247 create_set_func create_set;
248 /* whether direct Cond(Cmp) should also be lowered */
249 int lower_direct_cmp;
250 } lower_mode_b_config_t;
253 * Lowers mode_b operations to integer arithmetic. After the lowering the only
254 * operations with mode_b are the Projs of Cmps; the only nodes with mode_b
255 * inputs are Cond and Psi nodes.
257 * Example: Psi(a < 0, 1, 0) => a >> 31
259 * @param irg the firm graph to lower
260 * @param config configuration for mode_b lowerer
262 FIRM_API void ir_lower_mode_b(ir_graph *irg,
263 const lower_mode_b_config_t *config);
266 * Used as callback, whenever a lowerable mux is found. The return value
267 * indicates, whether the mux should be lowered. This may be used, to lower
268 * floating point muxes, while keeping mux nodes for integers, for example.
270 * @param mux The mux node that may be lowered.
271 * @return A non-zero value indicates that the mux should be lowered.
273 typedef int lower_mux_callback(ir_node* mux);
276 * Lowers all mux nodes in the given graph. A callback function may be
277 * given, to select the mux nodes to lower.
279 * @param irg The graph to lower mux nodes in.
280 * @param cb_func The callback function for mux selection. Can be NULL,
281 * to lower all mux nodes.
283 FIRM_API void lower_mux(ir_graph *irg, lower_mux_callback *cb_func);
286 * Creates an ir_graph pass for lower_mux().
288 * @param name the name of this pass or NULL
289 * @param cb_func The callback function for mux selection. Can be NULL,
290 * to lower all mux nodes.
292 * @return the newly created ir_graph pass
294 FIRM_API ir_graph_pass_t *lower_mux_pass(const char *name,
295 lower_mux_callback *cb_func);
298 * An intrinsic mapper function.
300 * @param node the IR-node that will be mapped
301 * @param ctx a context
303 * @return non-zero if the call was mapped
305 typedef int (*i_mapper_func)(ir_node *node, void *ctx);
308 INTRINSIC_CALL = 0, /**< the record represents an intrinsic call */
309 INTRINSIC_INSTR /**< the record represents an intrinsic instruction */
313 * An intrinsic call record.
315 typedef struct i_call_record {
316 enum ikind kind; /**< must be INTRINSIC_CALL */
317 ir_entity *i_ent; /**< the entity representing an intrinsic call */
318 i_mapper_func i_mapper; /**< the mapper function to call */
319 void *ctx; /**< mapper context */
320 void *link; /**< used in the construction algorithm, must be NULL */
324 * An intrinsic instruction record.
326 typedef struct i_instr_record {
327 enum ikind kind; /**< must be INTRINSIC_INSTR */
328 ir_op *op; /**< the opcode that must be mapped. */
329 i_mapper_func i_mapper; /**< the mapper function to call */
330 void *ctx; /**< mapper context */
331 void *link; /**< used in the construction algorithm, must be NULL */
335 * An intrinsic record.
337 typedef union i_record {
338 i_call_record i_call;
339 i_instr_record i_instr;
343 * Go through all graphs and map calls to intrinsic functions and instructions.
345 * Every call or instruction is reported to its mapper function,
346 * which is responsible for rebuilding the graph.
348 * current_ir_graph is always set.
350 * @param list an array of intrinsic map records
351 * @param length the length of the array
352 * @param part_block_used set to true if part_block() must be using during lowering
354 * @return number of found intrinsics.
356 FIRM_API size_t lower_intrinsics(i_record *list, size_t length,
357 int part_block_used);
360 * Creates an irprog pass for lower_intrinsics.
362 * @param name the name of this pass or NULL
363 * @param list an array of intrinsic map records
364 * @param length the length of the array
365 * @param part_block_used set to true if part_block() must be using during lowering
367 FIRM_API ir_prog_pass_t *lower_intrinsics_pass(const char *name, i_record *list,
368 size_t length, int part_block_used);
371 * A mapper for the integer/float absolute value: type abs(type v).
372 * Replaces the call by a Abs node.
376 FIRM_API int i_mapper_abs(ir_node *call, void *ctx);
379 * A mapper for the integer byte swap value: type bswap(type v).
380 * Replaces the call by a builtin[ir_bk_bswap] node.
384 FIRM_API int i_mapper_bswap(ir_node *call, void *ctx);
387 * A mapper for the floating point sqrt(v): floattype sqrt(floattype v);
389 * @return 1 if the sqrt call was removed, 0 else.
391 FIRM_API int i_mapper_sqrt(ir_node *call, void *ctx);
394 * A mapper for the floating point cbrt(v): floattype sqrt(floattype v);
396 * @return 1 if the cbrt call was removed, 0 else.
398 FIRM_API int i_mapper_cbrt(ir_node *call, void *ctx);
401 * A mapper for the floating point pow(a, b): floattype pow(floattype a, floattype b);
403 * @return 1 if the pow call was removed, 0 else.
405 FIRM_API int i_mapper_pow(ir_node *call, void *ctx);
408 * A mapper for the floating point exp(a): floattype exp(floattype a);
410 * @return 1 if the exp call was removed, 0 else.
412 FIRM_API int i_mapper_exp(ir_node *call, void *ctx);
414 #define i_mapper_exp2 i_mapper_exp
415 #define i_mapper_exp10 i_mapper_exp
418 * A mapper for the floating point log(a): floattype log(floattype a);
420 * @return 1 if the log call was removed, 0 else.
422 FIRM_API int i_mapper_log(ir_node *call, void *ctx);
424 #define i_mapper_log2 i_mapper_log
425 #define i_mapper_log10 i_mapper_log
428 * A mapper for the floating point sin(a): floattype sin(floattype a);
430 * @return 1 if the sin call was removed, 0 else.
432 FIRM_API int i_mapper_sin(ir_node *call, void *ctx);
435 * A mapper for the floating point sin(a): floattype cos(floattype a);
437 * @return 1 if the cos call was removed, 0 else.
439 FIRM_API int i_mapper_cos(ir_node *call, void *ctx);
442 * A mapper for the floating point tan(a): floattype tan(floattype a);
444 * @return 1 if the tan call was removed, 0 else.
446 FIRM_API int i_mapper_tan(ir_node *call, void *ctx);
449 * A mapper for the floating point asin(a): floattype asin(floattype a);
451 * @return 1 if the asin call was removed, 0 else.
453 FIRM_API int i_mapper_asin(ir_node *call, void *ctx);
456 * A mapper for the floating point acos(a): floattype acos(floattype a);
458 * @return 1 if the tan call was removed, 0 else.
460 FIRM_API int i_mapper_acos(ir_node *call, void *ctx);
463 * A mapper for the floating point atan(a): floattype atan(floattype a);
465 * @return 1 if the atan call was removed, 0 else.
467 FIRM_API int i_mapper_atan(ir_node *call, void *ctx);
470 * A mapper for the floating point sinh(a): floattype sinh(floattype a);
472 * @return 1 if the sinh call was removed, 0 else.
474 FIRM_API int i_mapper_sinh(ir_node *call, void *ctx);
477 * A mapper for the floating point cosh(a): floattype cosh(floattype a);
479 * @return 1 if the cosh call was removed, 0 else.
481 FIRM_API int i_mapper_cosh(ir_node *call, void *ctx);
484 * A mapper for the floating point tanh(a): floattype tanh(floattype a);
486 * @return 1 if the tanh call was removed, 0 else.
488 FIRM_API int i_mapper_tanh(ir_node *call, void *ctx);
491 * A mapper for the strcmp-Function: inttype strcmp(char pointer a, char pointer b);
493 * @return 1 if the strcmp call was removed, 0 else.
495 FIRM_API int i_mapper_strcmp(ir_node *call, void *ctx);
498 * A mapper for the strncmp-Function: inttype strncmp(char pointer a, char pointer b, inttype len);
500 * @return 1 if the strncmp call was removed, 0 else.
502 FIRM_API int i_mapper_strncmp(ir_node *call, void *ctx);
505 * A mapper for the strcpy-Function: char pointer strcpy(char pointer a, char pointer b);
507 * @return 1 if the strcpy call was removed, 0 else.
509 FIRM_API int i_mapper_strcpy(ir_node *call, void *ctx);
512 * A mapper for the strlen-Function: inttype strlen(char pointer a);
514 * @return 1 if the strlen call was removed, 0 else.
516 FIRM_API int i_mapper_strlen(ir_node *call, void *ctx);
519 * A mapper for the memcpy-Function: void pointer memcpy(void pointer d, void pointer s, inttype c);
521 * @return 1 if the memcpy call was removed, 0 else.
523 FIRM_API int i_mapper_memcpy(ir_node *call, void *ctx);
526 * A mapper for the mempcpy-Function: void pointer mempcpy(void pointer d, void pointer s, inttype c);
528 * @return 1 if the mempcpy call was removed, 0 else.
530 FIRM_API int i_mapper_mempcpy(ir_node *call, void *ctx);
533 * A mapper for the memmove-Function: void pointer memmove(void pointer d, void pointer s, inttype c);
535 * @return 1 if the memmove call was removed, 0 else.
537 FIRM_API int i_mapper_memmove(ir_node *call, void *ctx);
540 * A mapper for the memset-Function: void pointer memset(void pointer d, inttype C, inttype len);
542 * @return 1 if the memset call was removed, 0 else.
544 FIRM_API int i_mapper_memset(ir_node *call, void *ctx);
547 * A mapper for the strncmp-Function: inttype memcmp(void pointer a, void pointer b, inttype len);
549 * @return 1 if the strncmp call was removed, 0 else.
551 FIRM_API int i_mapper_memcmp(ir_node *call, void *ctx);
554 * A mapper for the alloca() function: pointer alloca(inttype size)
555 * Replaces the call by a Alloca(stack_alloc) node.
559 FIRM_API int i_mapper_alloca(ir_node *call, void *ctx);
562 * A runtime routine description.
564 typedef struct runtime_rt {
565 ir_entity *ent; /**< The entity representing the runtime routine. */
566 ir_mode *mode; /**< The operation mode of the mapped instruction. */
567 ir_mode *res_mode; /**< The result mode of the mapped instruction or NULL. */
568 long mem_proj_nr; /**< if >= 0, create a memory ProjM() */
569 long regular_proj_nr; /**< if >= 0, create a regular ProjX() */
570 long exc_proj_nr; /**< if >= 0, create a exception ProjX() */
571 long exc_mem_proj_nr; /**< if >= 0, create a exception memory ProjM() */
572 long res_proj_nr; /**< if >= 0, first result projection number */
576 * A mapper for mapping unsupported instructions to runtime calls.
577 * Maps a op(arg_0, ..., arg_n) into a call to a runtime function
578 * rt(arg_0, ..., arg_n).
580 * The mapping is only done, if the modes of all arguments matches the
581 * modes of rt's argument.
582 * Further, if op has a memory input, the generated Call uses it, else
584 * The pinned state of the Call will be set to the pinned state of op.
586 * Note that i_mapper_RuntimeCall() must be used with a i_instr_record.
588 * @return 1 if an op was mapped, 0 else
592 * - Maps signed Div nodes to calls to rt_Div():
594 runtime_rt rt_Div = {
595 ent("int rt_Div(int, int)"),
604 i_instr_record map_Div = {
607 i_mapper_RuntimeCall,
613 * - Maps ConvD(F) to calls to rt_Float2Div():
615 runtime_rt rt_Float2Double = {
616 ent("double rt_Float2Div(float)"),
617 get_type_mode("double"),
625 i_instr_record map_Float2Double = {
628 i_mapper_RuntimeCall,
634 FIRM_API int i_mapper_RuntimeCall(ir_node *node, runtime_rt *rt);