lowering.h 19.4 KB
Newer Older
1
/*
Michael Beck's avatar
Michael Beck committed
2
 * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
 *
 * This file is part of libFirm.
 *
 * This file may be distributed and/or modified under the terms of the
 * GNU General Public License version 2 as published by the Free Software
 * Foundation and appearing in the file LICENSE.GPL included in the
 * packaging of this file.
 *
 * Licensees holding valid libFirm Professional Edition licenses may use
 * this file in accordance with the libFirm Commercial License.
 * Agreement provided with the Software.
 *
 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
 * PURPOSE.
 */

/**
 * @file
 * @brief   Lowering of high level constructs.
 * @author  Michael Beck
 * @version $Id$
 */
#ifndef FIRM_LOWERING_H
#define FIRM_LOWERING_H

29
#include "firm_types.h"
30
31
32
33
/**
 * A type telling where to add hidden parameters.
 */
typedef enum add_hidden_params {
Michael Beck's avatar
Michael Beck committed
34
35
36
	ADD_HIDDEN_ALWAYS_IN_FRONT = 0,   /**< always add hidden parameters in front (default). */
	ADD_HIDDEN_ALWAYS_LAST     = 1,   /**< always add hidden parameters last, did not work for variadic functions. */
	ADD_HIDDEN_SMART           = 2    /**< add hidden parameters last for non-variadic and first for variadic functions. */
37
38
39
40
41
42
} add_hidden;

/**
 * Additional flags for the lowering.
 */
enum lowering_flags {
Michael Beck's avatar
Michael Beck committed
43
44
45
46
47
	LF_NONE              = 0, /**< no additional flags */
	LF_COMPOUND_PARAM    = 1, /**< lower calls with compound parameters */
	LF_COMPOUND_RETURN   = 2, /**< lower calls with compound returns */
	LF_RETURN_HIDDEN     = 4, /**< return the hidden address instead of void */
	LF_SMALL_CMP_IN_REGS = 8  /**< return small compound values in registers */
48
49
50
51
52
53
54
55
56
57
};

/** Maximum number of registers that can be used to return compound values. */
#define MAX_REGISTER_RET_VAL 2

/**
 * A struct containing all control parameters for
 * lower_compound_ret_calls().
 */
typedef struct {
Michael Beck's avatar
Michael Beck committed
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
	int        def_ptr_alignment;   /**< Default alignment for data pointer. */
	unsigned   flags;               /**< A bitmask of enum lowering_flags. */
	add_hidden hidden_params;       /**< Where to add hidden parameters. */

	/**
	 * A function returning a pointer type for a given type.
	 * If this pointer is NULL, a new pointer type is always created.
	 */
	ir_type *(*find_pointer_type)(ir_type *e_type, ir_mode *mode, int alignment);

	/**
	 * If the LF_SMALL_CMP_IN_REGS flag is set, this function will be called
	 * to decide, whether a compound value should be returned in registers.
	 * This function must return the number of used registers and fill in the modes
	 * of the registers to use. Up to MAX_REGISTER_RET_VAL registers can be used.
	 */
	int (*ret_compound_in_regs)(ir_type *compound_tp, ir_mode **modes);
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
} lower_params_t;

/**
 * Lower calls with compound parameter and return types.
 * This function does the following transformations:
 *
 * If LF_COMPOUND_PARAM is set:
 *
 * - Copy compound parameters to a new location on the callers
 *   stack and transmit the address of this new location
 *
 * If LF_COMPOUND_RETURN is set:
 *
 * - Adds a new (hidden) pointer parameter for
 *   any return compound type. The return type is replaced by void
 *   or if LOWERING_FLAGS_RETURN_HIDDEN is set by the address.
 *
 * - Use of the hidden parameters in the function code.
 *
 * - Change all calls to functions with compound return
 *   by providing space for the hidden parameter on the callers
 *   stack.
 *
 * - Replace a possible block copy after the function call.
 *
 * General:
 *
 * - Changes the types of methods and calls to the lowered ones
 *
 * - lower all method types of existing entities
 *
 * In pseudo-code, the following transformation is done:
 *
   @code
   struct x ret = func(a, b);
   @endcode
 *
 * is translated into
   @code
   struct x ret;
   func(&ret, a, b);
   @endcode
 *
 * If the function returns only one possible result, the copy-on-return
 * optimization is done, ie.
   @code
   struct x func(a) {
     struct x ret;
     ret.a = a;
     return ret;
   }
   @endcode
 *
 * is transformed into
 *
   @code
   void func(struct x *ret, a) {
     ret->a = a;
   }
   @endcode
 *
 * @param params  A structure containing the control parameter for this
 *                transformation.
 *
 * During the transformation, pointer types must be created or reused.
 * The caller can provide params->find_pointer_type for this task to
 * reduce the number of created pointer types.
 * If params->find_pointer_type is NULL, new pointer types
 * are always created automatically.
 */
void lower_calls_with_compounds(const lower_params_t *params);

147
148
149
150
151
/**
 *  * Lower CopyB nodes of size smaller that max_size into Loads/Stores
 */
void lower_CopyB(ir_graph *irg, unsigned max_size, unsigned native_mode_bytes);

152
153
154
155
156
157
158
159
/**
 * Lowers all Switches (Cond nodes with non-boolean mode) depending on spare_size.
 * They will either remain the same or be converted into if-cascades.
 *
 * @param irg        The ir graph to be lowered.
 * @param spare_size Allowed spare size for table switches in machine words.
 *                   (Default in edgfe: 128)
 */
160
void lower_switch(ir_graph *irg, unsigned spare_size);
161

Michael Beck's avatar
Michael Beck committed
162
163
164
165
166
167
168
169
170
171
172
/**
 * Creates an ir_graph pass for lower_switch().
 *
 * @param name       the name of this pass or NULL
 * @param spare_size Allowed spare size for table switches in machine words.
 *                   (Default in edgfe: 128)
 *
 * @return  the newly created ir_graph pass
 */
ir_graph_pass_t *lower_switch_pass(const char *name, unsigned spare_size);

173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
/**
 * A callback type for creating an intrinsic entity for a given opcode.
 *
 * @param method   the method type of the emulation function entity
 * @param op       the emulated ir_op
 * @param imode    the input mode of the emulated opcode
 * @param omode    the output mode of the emulated opcode
 * @param context  the context parameter
 */
typedef ir_entity *(create_intrinsic_fkt)(ir_type *method, const ir_op *op,
                                          const ir_mode *imode, const ir_mode *omode,
                                          void *context);

/**
 * The lowering parameter description.
 */
typedef struct _lwrdw_param_t {
	int enable;                   /**< if true lowering is enabled */
	int little_endian;            /**< if true should be lowered for little endian, else big endian */
	ir_mode *high_signed;         /**< the double word signed mode to be lowered, typically Ls */
	ir_mode *high_unsigned;       /**< the double word unsigned mode to be lowered, typically Lu */
	ir_mode *low_signed;          /**< the word signed mode to be used, typically Is */
	ir_mode *low_unsigned;        /**< the word unsigned mode to be used, typically Iu */

	/** callback that creates the intrinsic entity */
	create_intrinsic_fkt *create_intrinsic;
	void *ctx;                    /**< context parameter for the creator function */
} lwrdw_param_t;

/**
 * Lower all double word operations.
Michael Beck's avatar
Michael Beck committed
204
205
 *
 * @param param  parameter for lowering
206
207
208
 */
void lower_dw_ops(const lwrdw_param_t *param);

Michael Beck's avatar
Michael Beck committed
209
210
211
212
213
214
215
216
217
218
/**
 * Creates an ir_prog pass for lower_dw_ops().
 *
 * @param name   the name of this pass or NULL
 * @param param  parameter for lowering
 *
 * @return  the newly created ir_prog pass
 */
ir_prog_pass_t *lower_dw_ops_pass(const char *name, const lwrdw_param_t *param);

219
220
221
222
223
224
225
226
227
228
/**
 * Default implementation. Context is unused.
 */
ir_entity *def_create_intrinsic_fkt(ir_type *method, const ir_op *op,
                                    const ir_mode *imode, const ir_mode *omode,
                                    void *context);

/**
 * Replaces SymConsts by a real constant if possible.
 * Replace Sel nodes by address computation.  Also resolves array access.
Michael Beck's avatar
Michael Beck committed
229
 * Handle bit fields by added And/Or calculations.
230
 *
231
232
233
 * @param irg               the graph to lower
 * @param lower_bitfields   the graph contains old-style bitfield
 *                          constructs
Michael Beck's avatar
Michael Beck committed
234
235
236
237
 *
 * @note: There is NO lowering ob objects oriented types. This is highly compiler
 *        and ABI specific and should be placed directly in the compiler.
 */
238
void lower_highlevel_graph(ir_graph *irg, int lower_bitfields);
Michael Beck's avatar
Michael Beck committed
239

240
241
242
243
244
245
246
247
248
249
250
/**
 * Creates an ir_graph pass for lower_highlevel_graph().
 *
 * @param name              the name of this pass or NULL
 * @param lower_bitfields   the graph contains old-style bitfield
 *                          constructs
 *
 * @return  the newly created ir_graph pass
 */
ir_graph_pass_t *lower_highlevel_graph_pass(const char *name, int lower_bitfields);

Michael Beck's avatar
Michael Beck committed
251
252
253
254
255
256
/**
 * Replaces SymConsts by a real constant if possible.
 * Replace Sel nodes by address computation.  Also resolves array access.
 * Handle bit fields by added And/Or calculations.
 * Lowers all graphs.
 *
Michael Beck's avatar
Michael Beck committed
257
 * @Note: There is NO lowering of objects oriented types. This is highly compiler
258
259
 *        and ABI specific and should be placed directly in the compiler.
 */
260
void lower_highlevel(int lower_bitfields);
261

262
263
264
265
266
/**
 * does the same as lower_highlevel for all nodes on the const code irg
 */
void lower_const_code(void);

267
268
269
270
271
/**
 * Creates an ir_prog pass for lower_const_code().
 *
 * @param name     the name of this pass or NULL
 *
Michael Beck's avatar
Michael Beck committed
272
 * @return  the newly created ir_prog pass
273
274
275
 */
ir_prog_pass_t *lower_const_code_pass(const char *name);

276
277
278
279
280
typedef struct lower_mode_b_config_t {
	/* mode that is used to transport 0/1 values */
	ir_mode *lowered_mode;
	/* preferred mode for the "set" operations (a psi that produces a 0 or 1) */
	ir_mode *lowered_set_mode;
281
	/* whether direct Cond -> Cmps should also be lowered */
282
283
284
	int lower_direct_cmp;
} lower_mode_b_config_t;

Matthias Braun's avatar
Matthias Braun committed
285
286
287
288
289
290
291
/**
 * Lowers mode_b operations to integer arithmetic. After the lowering the only
 * operations with mode_b are the Projs of Cmps; the only nodes with mode_b
 * inputs are Cond and Psi nodes.
 *
 * Example: Psi(a < 0, 1, 0) => a >> 31
 *
Michael Beck's avatar
Michael Beck committed
292
293
 * @param irg      the firm graph to lower
 * @param config   configuration for mode_b lowerer
Matthias Braun's avatar
Matthias Braun committed
294
 */
295
void ir_lower_mode_b(ir_graph *irg, const lower_mode_b_config_t *config);
Matthias Braun's avatar
Matthias Braun committed
296

Michael Beck's avatar
Michael Beck committed
297
298
299
300
301
302
303
304
305
306
307
/**
 * Creates an ir_graph pass for ir_lower_mode_b().
 *
 * @param name     the name of this pass or NULL
 * @param config   configuration for mode_b lowerer
 *
 * @return  the newly created ir_graph pass
 */
ir_graph_pass_t *ir_lower_mode_b_pass(
	const char *name, const lower_mode_b_config_t *config);

308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
/**
 * An intrinsic mapper function.
 *
 * @param node   the IR-node that will be mapped
 * @param ctx    a context
 *
 * @return  non-zero if the call was mapped
 */
typedef int (*i_mapper_func)(ir_node *node, void *ctx);

enum ikind {
	INTRINSIC_CALL  = 0,  /**< the record represents an intrinsic call */
	INTRINSIC_INSTR       /**< the record represents an intrinsic instruction */
};

/**
 * An intrinsic call record.
 */
typedef struct _i_call_record {
	enum ikind    kind;       /**< must be INTRINSIC_CALL */
	ir_entity     *i_ent;     /**< the entity representing an intrinsic call */
	i_mapper_func i_mapper;   /**< the mapper function to call */
	void          *ctx;       /**< mapper context */
	void          *link;      /**< used in the construction algorithm, must be NULL */
} i_call_record;

/**
 * An intrinsic instruction record.
 */
typedef struct _i_instr_record {
	enum ikind    kind;       /**< must be INTRINSIC_INSTR */
	ir_op         *op;        /**< the opcode that must be mapped. */
	i_mapper_func i_mapper;   /**< the mapper function to call */
	void          *ctx;       /**< mapper context */
	void          *link;      /**< used in the construction algorithm, must be NULL */
} i_instr_record;

/**
 * An intrinsic record.
 */
typedef union _i_record {
	i_call_record  i_call;
	i_instr_record i_instr;
} i_record;

/**
 * Go through all graphs and map calls to intrinsic functions and instructions.
 *
 * Every call or instruction is reported to its mapper function,
 * which is responsible for rebuilding the graph.
 *
 * current_ir_graph is always set.
 *
361
362
363
 * @param list             an array of intrinsic map records
 * @param length           the length of the array
 * @param part_block_used  set to true if part_block() must be using during lowering
364
365
366
 *
 * @return number of found intrinsics.
 */
367
unsigned lower_intrinsics(i_record *list, int length, int part_block_used);
368

369
370
371
372
373
374
375
376
377
378
/**
 * Creates an irprog pass for lower_intrinsics.
 *
 * @param name             the name of this pass or NULL
 * @param list             an array of intrinsic map records
 * @param length           the length of the array
 * @param part_block_used  set to true if part_block() must be using during lowering
 */
ir_prog_pass_t *lower_intrinsics_pass(
	const char *name,
Michael Beck's avatar
Michael Beck committed
379
	i_record *list, int length, int part_block_used);
380

381
/**
382
 * A mapper for the integer/float absolute value: type abs(type v).
383
384
385
386
 * Replaces the call by a Abs node.
 *
 * @return always 1
 */
387
int i_mapper_abs(ir_node *call, void *ctx);
388

Michael Beck's avatar
Michael Beck committed
389
390
391
392
393
394
395
396
/**
 * A mapper for the integer byte swap value: type bswap(type v).
 * Replaces the call by a builtin[ir_bk_bswap] node.
 *
 * @return always 1
 */
int i_mapper_bswap(ir_node *call, void *ctx);

397
/**
398
 * A mapper for the floating point sqrt(v): floattype sqrt(floattype v);
399
 *
400
 * @return 1 if the sqrt call was removed, 0 else.
401
 */
402
int i_mapper_sqrt(ir_node *call, void *ctx);
403

Michael Beck's avatar
Michael Beck committed
404
405
406
/**
 * A mapper for the floating point cbrt(v): floattype sqrt(floattype v);
 *
407
 * @return 1 if the cbrt call was removed, 0 else.
Michael Beck's avatar
Michael Beck committed
408
409
410
 */
int i_mapper_cbrt(ir_node *call, void *ctx);

411
/**
412
 * A mapper for the floating point pow(a, b): floattype pow(floattype a, floattype b);
413
 *
414
 * @return 1 if the pow call was removed, 0 else.
415
 */
416
int i_mapper_pow(ir_node *call, void *ctx);
417

418
419
420
/**
 * A mapper for the floating point exp(a): floattype exp(floattype a);
 *
421
 * @return 1 if the exp call was removed, 0 else.
422
 */
423
424
int i_mapper_exp(ir_node *call, void *ctx);

Michael Beck's avatar
Michael Beck committed
425
426
427
428
429
430
#define i_mapper_exp2   i_mapper_exp
#define i_mapper_exp10  i_mapper_exp

/**
 * A mapper for the floating point log(a): floattype log(floattype a);
 *
431
 * @return 1 if the log call was removed, 0 else.
Michael Beck's avatar
Michael Beck committed
432
433
434
435
436
437
 */
int i_mapper_log(ir_node *call, void *ctx);

#define i_mapper_log2   i_mapper_log
#define i_mapper_log10  i_mapper_log

438
439
440
/**
 * A mapper for the floating point sin(a): floattype sin(floattype a);
 *
441
 * @return 1 if the sin call was removed, 0 else.
442
443
444
445
446
447
 */
int i_mapper_sin(ir_node *call, void *ctx);

/**
 * A mapper for the floating point sin(a): floattype cos(floattype a);
 *
448
 * @return 1 if the cos call was removed, 0 else.
449
450
451
452
453
454
 */
int i_mapper_cos(ir_node *call, void *ctx);

/**
 * A mapper for the floating point tan(a): floattype tan(floattype a);
 *
455
 * @return 1 if the tan call was removed, 0 else.
456
457
458
459
460
461
 */
int i_mapper_tan(ir_node *call, void *ctx);

/**
 * A mapper for the floating point asin(a): floattype asin(floattype a);
 *
462
 * @return 1 if the asin call was removed, 0 else.
463
464
465
466
467
468
 */
int i_mapper_asin(ir_node *call, void *ctx);

/**
 * A mapper for the floating point acos(a): floattype acos(floattype a);
 *
469
 * @return 1 if the tan call was removed, 0 else.
470
471
472
473
474
475
 */
int i_mapper_acos(ir_node *call, void *ctx);

/**
 * A mapper for the floating point atan(a): floattype atan(floattype a);
 *
476
 * @return 1 if the atan call was removed, 0 else.
477
478
 */
int i_mapper_atan(ir_node *call, void *ctx);
479

480
481
482
/**
 * A mapper for the floating point sinh(a): floattype sinh(floattype a);
 *
483
 * @return 1 if the sinh call was removed, 0 else.
484
485
486
487
488
489
 */
int i_mapper_sinh(ir_node *call, void *ctx);

/**
 * A mapper for the floating point cosh(a): floattype cosh(floattype a);
 *
490
 * @return 1 if the cosh call was removed, 0 else.
491
492
493
494
495
496
 */
int i_mapper_cosh(ir_node *call, void *ctx);

/**
 * A mapper for the floating point tanh(a): floattype tanh(floattype a);
 *
497
 * @return 1 if the tanh call was removed, 0 else.
498
499
500
 */
int i_mapper_tanh(ir_node *call, void *ctx);

501
502
503
/**
 * A mapper for the strcmp-Function: inttype strcmp(char pointer a, char pointer b);
 *
504
 * @return 1 if the strcmp call was removed, 0 else.
505
 */
506
int i_mapper_strcmp(ir_node *call, void *ctx);
507
508

/**
Michael Beck's avatar
Michael Beck committed
509
 * A mapper for the strncmp-Function: inttype strncmp(char pointer a, char pointer b, inttype len);
510
 *
511
 * @return 1 if the strncmp call was removed, 0 else.
512
 */
513
int i_mapper_strncmp(ir_node *call, void *ctx);
514

515
516
517
/**
 * A mapper for the strcpy-Function: char pointer strcpy(char pointer a, char pointer b);
 *
518
 * @return 1 if the strcpy call was removed, 0 else.
519
520
521
 */
int i_mapper_strcpy(ir_node *call, void *ctx);

Michael Beck's avatar
Michael Beck committed
522
523
524
/**
 * A mapper for the strlen-Function: inttype strlen(char pointer a);
 *
525
 * @return 1 if the strlen call was removed, 0 else.
Michael Beck's avatar
Michael Beck committed
526
527
528
 */
int i_mapper_strlen(ir_node *call, void *ctx);

529
530
/**
 * A mapper for the memcpy-Function: void pointer memcpy(void pointer d, void pointer s, inttype c);
531
 *
532
 * @return 1 if the memcpy call was removed, 0 else.
533
 */
534
int i_mapper_memcpy(ir_node *call, void *ctx);
535

536
537
538
/**
 * A mapper for the mempcpy-Function: void pointer mempcpy(void pointer d, void pointer s, inttype c);
 *
539
 * @return 1 if the mempcpy call was removed, 0 else.
540
541
542
543
544
545
 */
int i_mapper_mempcpy(ir_node *call, void *ctx);

/**
 * A mapper for the memmove-Function: void pointer memmove(void pointer d, void pointer s, inttype c);
 *
546
 * @return 1 if the memmove call was removed, 0 else.
547
548
549
 */
int i_mapper_memmove(ir_node *call, void *ctx);

550
551
552
/**
 * A mapper for the memset-Function: void pointer memset(void pointer d, inttype C, inttype len);
 *
553
 * @return 1 if the memset call was removed, 0 else.
554
 */
555
int i_mapper_memset(ir_node *call, void *ctx);
556

557
558
559
/**
 * A mapper for the strncmp-Function: inttype memcmp(void pointer a, void pointer b, inttype len);
 *
560
 * @return 1 if the strncmp call was removed, 0 else.
561
562
563
 */
int i_mapper_memcmp(ir_node *call, void *ctx);

564
565
566
567
568
569
/**
 * A mapper for the alloca() function: pointer alloca(inttype size)
 * Replaces the call by a Alloca(stack_alloc) node.
 *
 * @return always 1
 */
570
int i_mapper_alloca(ir_node *call, void *ctx);
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647

/**
 * A runtime routine description.
 */
typedef struct _runtime_rt {
	ir_entity *ent;            /**< The entity representing the runtime routine. */
	ir_mode   *mode;           /**< The operation mode of the mapped instruction. */
	ir_mode   *res_mode;       /**< The result mode of the mapped instruction or NULL. */
	long      mem_proj_nr;     /**< if >= 0, create a memory ProjM() */
	long      regular_proj_nr; /**< if >= 0, create a regular ProjX() */
	long      exc_proj_nr;     /**< if >= 0, create a exception ProjX() */
	long      exc_mem_proj_nr; /**< if >= 0, create a exception memory ProjM() */
	long      res_proj_nr;     /**< if >= 0, first result projection number */
} runtime_rt;

/**
 * A mapper for mapping unsupported instructions to runtime calls.
 * Maps a op(arg_0, ..., arg_n) into a call to a runtime function
 * rt(arg_0, ..., arg_n).
 *
 * The mapping is only done, if the modes of all arguments matches the
 * modes of rt's argument.
 * Further, if op has a memory input, the generated Call uses it, else
 * it gets a NoMem.
 * The pinned state of the Call will be set to the pinned state of op.
 *
 * Note that i_mapper_RuntimeCall() must be used with a i_instr_record.
 *
 * @return 1 if an op was mapped, 0 else
 *
 * Some examples:
 *
 * - Maps signed Div nodes to calls to rt_Div():
   @code
  runtime_rt rt_Div = {
    ent("int rt_Div(int, int)"),
    mode_T,
    mode_Is,
    pn_Div_M,
    pn_Div_X_regular,
    pn_Div_X_except,
    pn_Div_M,
    pn_Div_res
  };
  i_instr_record map_Div = {
    INTRINSIC_INSTR,
    op_Div,
    i_mapper_RuntimeCall,
    &rt_Div,
    NULL
  };
  @endcode
 *
 * - Maps ConvD(F) to calls to rt_Float2Div():
  @code
  runtime_rt rt_Float2Double = {
    ent("double rt_Float2Div(float)"),
    get_type_mode("double"),
    NULL,
    -1,
    -1,
    -1,
    -1,
    -1
  };
  i_instr_record map_Float2Double = {
    INTRINSIC_INSTR,
    op_Conv,
    i_mapper_RuntimeCall,
    &rt_Float2Double,
    NULL
  };
  @endcode
 */
int i_mapper_RuntimeCall(ir_node *node, runtime_rt *rt);

#endif /* FIRM_LOWERING_H */