benode.h 15 KB
Newer Older
Christian Würdig's avatar
Christian Würdig committed
1
2
/*
 * This file is part of libFirm.
3
 * Copyright (C) 2012 University of Karlsruhe.
Christian Würdig's avatar
Christian Würdig committed
4
5
 */

Sebastian Hack's avatar
Sebastian Hack committed
6
/**
Christian Würdig's avatar
Christian Würdig committed
7
8
9
10
 * @file
 * @brief       Backend node support for generic backend nodes.
 * @author      Sebastian Hack
 * @date        17.05.2005
Sebastian Hack's avatar
Sebastian Hack committed
11
 *
Christian Würdig's avatar
Christian Würdig committed
12
13
 * Backend node support for generic backend nodes.
 * This file provides Perm, Copy, Spill and Reload nodes.
Sebastian Hack's avatar
Sebastian Hack committed
14
 */
Christian Würdig's avatar
Christian Würdig committed
15
16
#ifndef FIRM_BE_BENODE_T_H
#define FIRM_BE_BENODE_T_H
17

18
19
#include <limits.h>

20
#include "firm_types.h"
21
#include "irnode_t.h"
Christian Würdig's avatar
Christian Würdig committed
22
#include "bearch.h"
Sebastian Hack's avatar
Sebastian Hack committed
23

24
25
26
27
28
29
/**
 * The benode op's.  Must be available to register emitter function.
 */
extern ir_op *op_be_Spill;
extern ir_op *op_be_Reload;
extern ir_op *op_be_Perm;
Matthias Braun's avatar
Matthias Braun committed
30
extern ir_op *op_be_MemPerm;
31
32
extern ir_op *op_be_Copy;
extern ir_op *op_be_Keep;
Michael Beck's avatar
Michael Beck committed
33
extern ir_op *op_be_CopyKeep;
34
35
36
extern ir_op *op_be_Call;
extern ir_op *op_be_Return;
extern ir_op *op_be_IncSP;
Sebastian Hack's avatar
Sebastian Hack committed
37
extern ir_op *op_be_AddSP;
Michael Beck's avatar
Michael Beck committed
38
extern ir_op *op_be_SubSP;
39
extern ir_op *op_be_Start;
40
41
extern ir_op *op_be_FrameAddr;

42
43
44
45
46
/**
 * Determines if irn is a be_node.
 */
int is_be_node(const ir_node *irn);

47
48
49
/**
 * Create all BE specific opcodes.
 */
50
void be_init_op(void);
51

Matthias Braun's avatar
Matthias Braun committed
52
53
void be_finish_op(void);

54
55
56
/**
 * Position numbers for the be_Spill inputs.
 */
57
enum {
58
59
	n_be_Spill_frame = 0,
	n_be_Spill_val   = 1
60
};
61
62
63
64

/**
 * Make a new Spill node.
 */
65
66
67
ir_node *be_new_Spill(const arch_register_class_t *cls,
                      const arch_register_class_t *cls_frame, ir_node *block,
                      ir_node *frame, ir_node *to_spill);
68

69
70
71
/**
 * Position numbers for the be_Reload inputs.
 */
72
enum {
73
74
	n_be_Reload_frame = 0,
	n_be_Reload_mem   = 1
75
};
76
77
78
79

/**
 * Make a new Reload node.
 */
80
81
82
ir_node *be_new_Reload(const arch_register_class_t *cls,
                       const arch_register_class_t *cls_frame, ir_node *block,
                       ir_node *frame, ir_node *mem, ir_mode *mode);
83

84
85
86
/**
 * Position numbers for the be_Copy inputs.
 */
87
enum {
88
	n_be_Copy_op = 0
89
};
90
91
92
93

/**
 * Make a new Copy node.
 */
94
ir_node *be_new_Copy(ir_node *block, ir_node *in);
95
/** Returns the Copy Argument. */
96
97
ir_node *be_get_Copy_op(const ir_node *cpy);

98
99
100
/**
 * Make a new Perm node.
 */
101
102
ir_node *be_new_Perm(const arch_register_class_t *cls, ir_node *block,
                     int n, ir_node *in[]);
103
104
105
106
107
108
109

/**
 * Reduce a Perm.
 * Basically, we provide a map to remap the Perm's arguments. If an entry in the
 * map is -1, the argument gets deleted.
 * This function takes care, that the register data and the input array reflects
 * the changes described by the map.
110
111
 * This is needed by the Perm optimization/movement in belower.c, see
 * push_through_perm().
112
 * @param perm     The perm node.
113
114
115
116
 * @param new_size The new number of arguments (must be smaller or equal to the
 *                 current one).
 * @param map      A map assigning each operand a new index (or -1 to indicate
 *                 deletion).
117
118
119
 */
void be_Perm_reduce(ir_node *perm, int new_size, int *map);

120
121
/**
 * Create a new MemPerm node.
122
123
124
 * A MemPerm node exchanges the values of memory locations. (Typically entities
 * used as spillslots). MemPerm nodes perform this operation without modifying
 * any register values.
125
 */
126
ir_node *be_new_MemPerm(ir_node *block, int n, ir_node *in[]);
127
ir_node *be_new_Keep(ir_node *block, int arity, ir_node *in[]);
Sebastian Hack's avatar
Sebastian Hack committed
128

129
130
void be_Keep_add_node(ir_node *keep, const arch_register_class_t *cls,
                      ir_node *node);
131

132
133
134
135
/**
 * Position numbers for the be_FrameAddr inputs
 */
enum {
136
	n_be_FrameAddr_ptr = 0
137
138
};

Michael Beck's avatar
Michael Beck committed
139
/** Create a new FrameAddr node. */
140
141
ir_node *be_new_FrameAddr(const arch_register_class_t *cls_frame,
                          ir_node *block, ir_node *frame, ir_entity *ent);
142

Michael Beck's avatar
Michael Beck committed
143
/** Return the frame input of a FrameAddr node. */
Matthias Braun's avatar
Matthias Braun committed
144
145
146
ir_node *be_get_FrameAddr_frame(const ir_node *node);

ir_entity *be_get_FrameAddr_entity(const ir_node *node);
Michael Beck's avatar
Michael Beck committed
147

148
149
150
/**
 * Position numbers for the be_AddSP inputs
 */
Sebastian Hack's avatar
Sebastian Hack committed
151
enum {
152
153
154
	n_be_AddSP_old_sp = 0,
	n_be_AddSP_size   = 1,
	n_be_AddSP_last   = 2
Sebastian Hack's avatar
Sebastian Hack committed
155
156
};

Sebastian Hack's avatar
Sebastian Hack committed
157
enum {
158
159
160
161
	pn_be_AddSP_sp   = 0,
	pn_be_AddSP_res  = 1,
	pn_be_AddSP_M    = 2,
	pn_be_AddSP_last = 3
Sebastian Hack's avatar
Sebastian Hack committed
162
163
};

Sebastian Hack's avatar
Sebastian Hack committed
164
165
/**
 * Make a new AddSP node.
166
167
168
 * An AddSP node expresses an increase of the stack pointer in the direction
 * the stack grows. In contrast to IncSP, the amount of bytes the stack pointer
 * is grown, is not given by a constant but an ordinary Firm node.
Sebastian Hack's avatar
Sebastian Hack committed
169
 * @param sp     The stack pointer register.
170
 * @param block  The block.
Sebastian Hack's avatar
Sebastian Hack committed
171
 * @param old_sp The node representing the old stack pointer value.
172
173
 * @param size   The node expressing the size by which the stack pointer shall
 *               be grown.
Sebastian Hack's avatar
Sebastian Hack committed
174
175
 * @return       A new AddSP node.
 */
176
177
ir_node *be_new_AddSP(const arch_register_t *sp, ir_node *block,
                      ir_node *old_sp, ir_node *size);
Sebastian Hack's avatar
Sebastian Hack committed
178

Michael Beck's avatar
Michael Beck committed
179
180
181
182
/**
 * Position numbers for the be_SubSP inputs
 */
enum {
183
184
185
	n_be_SubSP_old_sp = 0,
	n_be_SubSP_size   = 1,
	n_be_SubSP_last   = 2
Michael Beck's avatar
Michael Beck committed
186
187
188
};

enum {
189
	pn_be_SubSP_sp   = 0,
Michael Beck's avatar
Michael Beck committed
190
191
192
193
194
195
	pn_be_SubSP_M    = 1,
	pn_be_SubSP_last = 2
};

/**
 * Make a new SubSP node.
196
197
198
 * A SubSP node expresses a decrease of the stack pointer in the direction the
 * stack grows. In contrast to IncSP, the amount of bytes the stack pointer is
 * grown, is not given by a constant but an ordinary Firm node.
Michael Beck's avatar
Michael Beck committed
199
 * @param sp     The stack pointer register.
200
 * @param block  The block.
Michael Beck's avatar
Michael Beck committed
201
 * @param old_sp The node representing the old stack pointer value.
202
203
 * @param size   The node expressing the size by which the stack pointer shall
 *               be grown.
Michael Beck's avatar
Michael Beck committed
204
205
 * @return       A new DecSP node.
 */
206
207
ir_node *be_new_SubSP(const arch_register_t *sp, ir_node *block,
                      ir_node *old_sp, ir_node *size);
Michael Beck's avatar
Michael Beck committed
208

Sebastian Hack's avatar
Sebastian Hack committed
209
210
/**
 * Make a stack pointer increase/decrease node.
211
212
 * @param sp     The stack pointer register.
 * @param block  The block to insert the node into.
Sebastian Hack's avatar
Sebastian Hack committed
213
 * @param old_sp The node defining the former stack pointer.
214
215
216
217
 * @param offset amount the stack should expand (positive offset) or shrink
 *               (negative offset). Note that the offset is independent of the
 *               natural stack direction of the architecture but just specifies
 *               abstract expanding/shrinking of the stack area.
yb9976's avatar
yb9976 committed
218
 * @param align  force stack alignment to this power of 2. (i.e. specifying 3
219
 *               results in a 2^3 = 8byte stack alignment)
Sebastian Hack's avatar
Sebastian Hack committed
220
 * @return       A new stack pointer increment/decrement node.
221
222
 * @note         This node sets a register constraint to the @p sp register on
 *               its output.
Sebastian Hack's avatar
Sebastian Hack committed
223
 */
224
ir_node *be_new_IncSP(const arch_register_t *sp, ir_node *block,
225
                      ir_node *old_sp, int offset, int align);
Sebastian Hack's avatar
Sebastian Hack committed
226

Michael Beck's avatar
BugFix:    
Michael Beck committed
227
228
/** Returns the previous node that computes the stack pointer. */
ir_node *be_get_IncSP_pred(ir_node *incsp);
Sebastian Hack's avatar
Sebastian Hack committed
229

230
/** Sets the previous node that computes the stack pointer. */
231
void     be_set_IncSP_pred(ir_node *incsp, ir_node *pred);
232

233
234
235
236
237
238
239
/**
 * Sets a new offset to a IncSP node.
 * A positive offset means expanding the stack, a negative offset shrinking
 * an offset is == BE_STACK_FRAME_SIZE will be replaced by the real size of the
 * stackframe in the fix_stack_offsets phase.
 */
void     be_set_IncSP_offset(ir_node *irn, int offset);
Michael Beck's avatar
BugFix:    
Michael Beck committed
240
241

/** Gets the offset from a IncSP node. */
242
int be_get_IncSP_offset(const ir_node *irn);
243
int be_get_IncSP_align(const ir_node *irn);
Sebastian Hack's avatar
Sebastian Hack committed
244

245
/** Gets the call entity or NULL if this is no static call. */
246
ir_entity  *be_Call_get_entity(const ir_node *call);
247
/** Sets the call entity. */
248
void     be_Call_set_entity(ir_node *call, ir_entity *ent);
249
250
251
252
/** Gets the call type. */
ir_type *be_Call_get_type(ir_node *call);
/** Sets the call type. */
void     be_Call_set_type(ir_node *call, ir_type *call_tp);
253

Matthias Braun's avatar
Matthias Braun committed
254
255
256
257
void     be_Call_set_pop(ir_node *call, unsigned pop);

unsigned be_Call_get_pop(const ir_node *call);

258
259
260
/**
 * Position numbers for the be_Call inputs.
 */
261
enum {
262
263
264
265
	n_be_Call_mem       = 0,  /**< memory input of a be_Call node */
	n_be_Call_sp        = 1,  /**< stack pointer input of a be_Call node */
	n_be_Call_ptr       = 2,  /**< call pointer input of a be_Call node */
	n_be_Call_first_arg = 3   /**< first argument input of a be_Call node */
266
267
};

268
269
270
271
/**
 * Projection numbers for result of be_Call node: use for Proj nodes!
 */
typedef enum {
272
273
274
	pn_be_Call_M         = pn_Call_M, /**< The memory result of a be_Call. */
	pn_be_Call_X_regular = pn_Call_X_regular,
	pn_be_Call_X_except  = pn_Call_X_except,
275
	pn_be_Call_sp        = pn_Call_max+1,
276
	pn_be_Call_first_res     /**< The first result proj number of a be_Call. */
277
278
279
} pn_be_Call;

/**
Michael Beck's avatar
Michael Beck committed
280
281
282
 * Construct a new be_Call.
 *
 * @param dbg      debug info
283
 * @param block    the block where the call is placed
Michael Beck's avatar
Michael Beck committed
284
285
 * @param mem      the memory input of the call
 * @param sp       the stack pointer input of the call
286
287
 * @param ptr      the address of the called function, if immediate call set
 *                 to sp
Michael Beck's avatar
Michael Beck committed
288
289
290
291
 * @param n_outs   the number of outcoming values from this call
 * @param n        the number of (register) inputs of this call
 * @param in       the (register) inputs of this call
 * @param call_tp  the call type of this call
292
 */
293
ir_node *be_new_Call(dbg_info *dbg, ir_node *block, ir_node *mem,
294
295
296
                     const arch_register_req_t *sp_req, ir_node *sp,
                     const arch_register_req_t *ptr_req, ir_node *ptr,
                     int n_outs, int n, ir_node *in[], ir_type *call_tp);
297
298

/**
299
300
301
 * Position numbers for the be_Return inputs.
 */
enum {
302
303
304
	n_be_Return_mem  = 0,     /**< memory input of a be_Return node */
	n_be_Return_sp   = 1,     /**< stack pointer input of a be_Return node */
	n_be_Return_val  = 2,     /**< first "real" return value if any */
305
306
307
308
};

/**
 * Construct a new be_Return.
Michael Beck's avatar
Michael Beck committed
309
310
 *
 * @param dbg    debug info
311
 * @param block  the block where the new node will be placed
312
 * @param n_res  number of "real" results
313
 * @param pop    pop number of bytes on return
314
 * @param n      number of inputs
315
316
 * @param in     input array
 */
317
ir_node *be_new_Return(dbg_info *dbg, ir_node *block, int n_res, unsigned pop, int n, ir_node *in[]);
318
319

/** Returns the number of real returns values */
320
321
int be_Return_get_n_rets(const ir_node *ret);

Michael Beck's avatar
Michael Beck committed
322
/**
323
324
 * Return the number of bytes that should be popped from stack when executing
 * the Return.
Michael Beck's avatar
Michael Beck committed
325
326
327
 *
 * @param ret  the be_Return node
 */
328
unsigned be_Return_get_pop(const ir_node *ret);
329

330
331
332
333
334
335
336
337
338
339
340
341
342
/**
 * Return non-zero, if number of popped bytes must be always emitted.
 *
 * @param ret  the be_Return node
 */
int be_Return_get_emit_pop(const ir_node *ret);

/**
 * Set the emit_pop flag.
 *
 * @param ret  the be_Return node
 */
void be_Return_set_emit_pop(ir_node *ret, int emit_pop);
343

344
ir_node *be_new_Start(dbg_info *dbgi, ir_node *block, int n_out);
Sebastian Hack's avatar
Sebastian Hack committed
345

Sebastian Hack's avatar
Sebastian Hack committed
346
enum {
347
	n_be_CopyKeep_op = 0
Sebastian Hack's avatar
Sebastian Hack committed
348
};
349
350
ir_node *be_new_CopyKeep(ir_node *block, ir_node *src,
                         int n, ir_node *in_keep[]);
351

352
ir_node *be_new_CopyKeep_single(ir_node *block, ir_node *src, ir_node *keep);
353

354
ir_node *be_get_CopyKeep_op(const ir_node *cpy);
Sebastian Hack's avatar
Sebastian Hack committed
355

356
void be_set_CopyKeep_op(ir_node *cpy, ir_node *op);
Sebastian Hack's avatar
Sebastian Hack committed
357

358
/**
Michael Beck's avatar
Michael Beck committed
359
 * Returns the frame entity of a be node.
360
 * Try to avoid this function and better call arch_get_frame_entity!
361
 *
Michael Beck's avatar
Michael Beck committed
362
 * @return the frame entity used by the be node
363
 */
364
365
ir_entity *be_get_frame_entity(const ir_node *irn);

366
367
void be_node_set_frame_entity(ir_node *node, ir_entity *entity);

368
369
370
371
/**
 * Returns the frame offset of this node.
 */
int be_get_frame_offset(const ir_node *irn);
372
373

ir_node* be_get_Reload_mem(const ir_node *irn);
374
ir_node *be_get_Reload_frame(const ir_node *irn);
375
ir_node* be_get_Spill_val(const ir_node *irn);
376
ir_node *be_get_Spill_frame(const ir_node *irn);
377

378
379
void be_set_MemPerm_in_entity(const ir_node *irn, int n, ir_entity* ent);
ir_entity *be_get_MemPerm_in_entity(const ir_node *irn, int n);
Matthias Braun's avatar
Matthias Braun committed
380

381
382
void be_set_MemPerm_out_entity(const ir_node *irn, int n, ir_entity* ent);
ir_entity *be_get_MemPerm_out_entity(const ir_node *irn, int n);
383

384
385
int be_get_MemPerm_entity_arity(const ir_node *irn);

Sebastian Hack's avatar
Sebastian Hack committed
386
387
388
/**
 * Impose a register constraint on a backend node.
 * @param irn The node.
389
 * @param pos The position of the argument.
390
391
 * @param reg The register which is admissible for that node, argument/result
 *            and position.
Sebastian Hack's avatar
Sebastian Hack committed
392
 */
393
394
395
396
void be_set_constr_single_reg_in(ir_node *irn, int pos,
		const arch_register_t *reg, arch_register_req_type_t additional_flags);
void be_set_constr_single_reg_out(ir_node *irn, int pos,
		const arch_register_t *reg, arch_register_req_type_t additional_flags);
397

398
399
400
const arch_register_req_t *be_create_reg_req(struct obstack *obst,
		const arch_register_t *reg, arch_register_req_type_t additional_types);

401
/**
402
 * Impose register constraints on a backend node.
403
404
405
 * The register subsets given by the limited function in @p req are copied to
 * the backend node. This requires that the constraint type of the @p req is
 * arch_register_req_type_limited.
406
407
408
 * @param irn The backend node.
 * @param pos The position (@see be_set_constr_single_reg()).
 * @param req The register requirements which shall be transferred.
409
 */
410
411
void be_set_constr_in(ir_node *irn, int pos, const arch_register_req_t *req);
void be_set_constr_out(ir_node *irn, int pos, const arch_register_req_t *req);
412

Sebastian Hack's avatar
Sebastian Hack committed
413
414
415
/**
 * Set the register class of a node.
 * @param irn The node itself.
416
 * @param pos The position (0..n) for arguments
Sebastian Hack's avatar
Sebastian Hack committed
417
418
 * @param flags The register class to set for that node and position.
 */
419
420
421
422
void be_node_set_reg_class_in(ir_node *irn, int pos,
                              const arch_register_class_t *cls);
void be_node_set_reg_class_out(ir_node *irn, int pos,
                               const arch_register_class_t *cls);
Sebastian Hack's avatar
Sebastian Hack committed
423

424
425
426
/**
 * Set the register requirements for a phi node.
 */
427
428
void be_set_phi_reg_req(ir_node *phi, const arch_register_req_t *req);

429
void be_dump_phi_reg_reqs(FILE *out, const ir_node *node, dump_reason_t reason);
430

431
432
433
434
/**
 * Creates a new phi with associated backend informations
 */
ir_node *be_new_Phi(ir_node *block, int n_ins, ir_node **ins, ir_mode *mode,
435
                    const arch_register_req_t *req);
436

437
438
439
440
441
/**
 * Search for output of start node with a specific register
 */
ir_node *be_get_initial_reg_value(ir_graph *irg, const arch_register_t *reg);

442
443
444
445
446
447
448
449
450
451
452
453
static inline int be_is_Spill    (const ir_node *irn) { return get_irn_opcode(irn) == beo_Spill    ; }
static inline int be_is_Reload   (const ir_node *irn) { return get_irn_opcode(irn) == beo_Reload   ; }
static inline int be_is_Copy     (const ir_node *irn) { return get_irn_opcode(irn) == beo_Copy     ; }
static inline int be_is_CopyKeep (const ir_node *irn) { return get_irn_opcode(irn) == beo_CopyKeep ; }
static inline int be_is_Perm     (const ir_node *irn) { return get_irn_opcode(irn) == beo_Perm     ; }
static inline int be_is_MemPerm  (const ir_node *irn) { return get_irn_opcode(irn) == beo_MemPerm  ; }
static inline int be_is_Keep     (const ir_node *irn) { return get_irn_opcode(irn) == beo_Keep     ; }
static inline int be_is_Call     (const ir_node *irn) { return get_irn_opcode(irn) == beo_Call     ; }
static inline int be_is_Return   (const ir_node *irn) { return get_irn_opcode(irn) == beo_Return   ; }
static inline int be_is_IncSP    (const ir_node *irn) { return get_irn_opcode(irn) == beo_IncSP    ; }
static inline int be_is_AddSP    (const ir_node *irn) { return get_irn_opcode(irn) == beo_AddSP    ; }
static inline int be_is_SubSP    (const ir_node *irn) { return get_irn_opcode(irn) == beo_SubSP    ; }
454
static inline int be_is_Start    (const ir_node *irn) { return get_irn_opcode(irn) == beo_Start    ; }
455
static inline int be_is_FrameAddr(const ir_node *irn) { return get_irn_opcode(irn) == beo_FrameAddr; }
456

457
#endif