benode.h 7.27 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
 * Backend node support for generic backend nodes.
13
 * This file provides Perm, and Copy nodes.
Sebastian Hack's avatar
Sebastian Hack committed
14
 */
15
16
#ifndef FIRM_BE_BENODE_H
#define FIRM_BE_BENODE_H
17

18
#include "be_types.h"
19
#include "firm_types.h"
20
#include "irnode_t.h"
Sebastian Hack's avatar
Sebastian Hack committed
21

22
typedef enum be_opcode {
23
	beo_Asm,
Matthias Braun's avatar
Matthias Braun committed
24
	beo_first = beo_Asm,
25
26
27
	beo_Copy,
	beo_CopyKeep,
	beo_IncSP,
Matthias Braun's avatar
Matthias Braun committed
28
29
30
	beo_Keep,
	beo_MemPerm,
	beo_Perm,
31
32
	beo_Relocation,
	beo_last  = beo_Relocation
33
34
} be_opcode;

35
36
37
38
39
40
41
42
43
44
45
typedef struct be_node_attr_t {
	except_attr exc;
} be_node_attr_t;

typedef struct be_asm_attr_t {
	be_node_attr_t base;
	ident         *text;
	void          *operands;
} be_asm_attr_t;

extern ir_op *op_be_Asm;
46
extern ir_op *op_be_Copy;
Michael Beck's avatar
Michael Beck committed
47
extern ir_op *op_be_CopyKeep;
48
extern ir_op *op_be_IncSP;
Matthias Braun's avatar
Matthias Braun committed
49
50
51
extern ir_op *op_be_Keep;
extern ir_op *op_be_MemPerm;
extern ir_op *op_be_Perm;
52
extern ir_op *op_be_Relocation;
53

54
55
56
/**
 * Determines if irn is a be_node.
 */
57
58
bool is_be_node(const ir_node *irn);

59
60
61
/**
 * Create all BE specific opcodes.
 */
62
void be_init_op(void);
63

Matthias Braun's avatar
Matthias Braun committed
64
65
void be_finish_op(void);

66
67
68
/**
 * Position numbers for the be_Copy inputs.
 */
69
enum {
70
	n_be_Copy_op = 0
71
};
72
73
74
75

/**
 * Make a new Copy node.
 */
76
ir_node *be_new_Copy(ir_node *block, ir_node *in);
77
/** Returns the Copy Argument. */
78
79
ir_node *be_get_Copy_op(const ir_node *cpy);

80
81
82
/**
 * Make a new Perm node.
 */
Matthias Braun's avatar
Matthias Braun committed
83
84
ir_node *be_new_Perm(arch_register_class_t const *cls, ir_node *block, int n,
                     ir_node *const *in);
85

86
87
/**
 * Create a new MemPerm node.
88
89
90
 * A MemPerm node exchanges the values of memory locations. (Typically entities
 * used as spillslots). MemPerm nodes perform this operation without modifying
 * any register values.
91
 */
92
93
94
ir_node *be_new_MemPerm(ir_node *block, int n, ir_node *const *in);

ir_node *be_new_Keep(ir_node *block, int arity, ir_node *const *in);
95
ir_node *be_new_Keep_one(ir_node *kept);
Sebastian Hack's avatar
Sebastian Hack committed
96

Sebastian Hack's avatar
Sebastian Hack committed
97
98
/**
 * Make a stack pointer increase/decrease node.
99
100
 * @param sp     The stack pointer register.
 * @param block  The block to insert the node into.
Sebastian Hack's avatar
Sebastian Hack committed
101
 * @param old_sp The node defining the former stack pointer.
102
103
104
105
 * @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.
106
107
 * @param align  force stack alignment to this power of 2. (i.e. specifying 4
 *               results in a 2**4 = 16 bytes stack alignment)
Sebastian Hack's avatar
Sebastian Hack committed
108
 * @return       A new stack pointer increment/decrement node.
109
110
 * @note         This node sets a register constraint to the @p sp register on
 *               its output.
Sebastian Hack's avatar
Sebastian Hack committed
111
 */
112
ir_node *be_new_IncSP(const arch_register_t *sp, ir_node *block,
113
                      ir_node *old_sp, int offset, unsigned align);
Sebastian Hack's avatar
Sebastian Hack committed
114

Michael Beck's avatar
BugFix:    
Michael Beck committed
115
116
/** 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
117

118
/** Sets the previous node that computes the stack pointer. */
Matthias Braun's avatar
Matthias Braun committed
119
void be_set_IncSP_pred(ir_node *incsp, ir_node *pred);
120

121
122
123
124
125
126
/**
 * 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.
 */
Matthias Braun's avatar
Matthias Braun committed
127
void be_set_IncSP_offset(ir_node *irn, int offset);
Michael Beck's avatar
BugFix:    
Michael Beck committed
128
129

/** Gets the offset from a IncSP node. */
130
int be_get_IncSP_offset(const ir_node *irn);
131
132
133
/** Return requested stack alignment (as a logarithm of two, i.e. 4 means
 * the stack alignment will be 2**4=16 bytes) */
unsigned be_get_IncSP_align(const ir_node *irn);
Sebastian Hack's avatar
Sebastian Hack committed
134

Sebastian Hack's avatar
Sebastian Hack committed
135
enum {
Matthias Braun's avatar
Matthias Braun committed
136
137
	n_be_CopyKeep_op,
	n_be_CopyKeep_max = n_be_CopyKeep_op
Sebastian Hack's avatar
Sebastian Hack committed
138
};
139
ir_node *be_new_CopyKeep(ir_node *block, ir_node *src, int n, ir_node *const *in_keep);
140

141
ir_node *be_get_CopyKeep_op(const ir_node *cpy);
Sebastian Hack's avatar
Sebastian Hack committed
142

143
144
void be_set_MemPerm_in_entity(const ir_node *irn, unsigned n, ir_entity* ent);
ir_entity *be_get_MemPerm_in_entity(const ir_node *irn, unsigned n);
Matthias Braun's avatar
Matthias Braun committed
145

146
147
void be_set_MemPerm_out_entity(const ir_node *irn, unsigned n, ir_entity* ent);
ir_entity *be_get_MemPerm_out_entity(const ir_node *irn, unsigned n);
148

149
150
151
void be_set_MemPerm_offset(ir_node *irn, int offset);
int be_get_MemPerm_offset(const ir_node *irn);

152
unsigned be_get_MemPerm_entity_arity(const ir_node *irn);
153

154
155
arch_register_req_t const **be_allocate_in_reqs(ir_graph *irg, unsigned n);

156
const arch_register_req_t *be_create_reg_req(struct obstack *obst,
157
158
                                             const arch_register_t *reg,
                                             bool ignore);
159

160
161
162
/**
 * Set the register requirements for a phi node.
 */
163
164
void be_set_phi_reg_req(ir_node *phi, const arch_register_req_t *req);

165
166
167
168
/**
 * 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,
169
                    const arch_register_req_t *req);
170

171
172
173
174
175
176
177
178
179
180
181
/**
 * Create a new Phi with backend info and without inputs.
 * Inputs are added later with @see be_complete_Phi().
 */
ir_node *be_new_Phi0(ir_node *block, ir_mode *mode, arch_register_req_t const *req);

/**
 * Add inputs to a inputless Phi created by @see be_new_Phi0().
 */
ir_node *be_complete_Phi(ir_node *phi, unsigned n_ins, ir_node **ins);

182
183
ir_node *be_new_Asm(dbg_info *dbgi, ir_node *block, int n_ins, ir_node **ins, int n_outs, ident *text, void *operands);

184
185
186
187
188
189
190
191
192
193
194
195
/**
 * Create a new Relocation node. The node returns the reference to an entity
 * with a specific linker relocation kind. The relocation kind is backend
 * specific. This node is meant to be used in preparation phases for position
 * independent code.
 */
ir_node *be_new_Relocation(ir_graph *irg, unsigned kind, ir_entity *entity);

ir_entity *be_get_Relocation_entity(ir_node const* node);

unsigned be_get_Relocation_kind(ir_node const* node);

196
197
198
199
200
201
/**
 * Create a new Proj node.  Its mode is determined from the out requirement
 * @p pos of @p pred.
 */
ir_node *be_new_Proj(ir_node *pred, unsigned pos);

202
203
204
205
206
/**
 * 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);

207
208
209
210
211
212
/**
 * Gets the Proj with number pn from irn.
 * Creates the Proj, if it does not exist, yet.
 */
ir_node *be_get_or_make_Proj_for_pn(ir_node *irn, unsigned pn);

213
214
215
216
217
218
219
220
static inline bool be_is_Asm       (const ir_node *irn) { return get_irn_op(irn) == op_be_Asm       ; }
static inline bool be_is_Copy      (const ir_node *irn) { return get_irn_op(irn) == op_be_Copy      ; }
static inline bool be_is_CopyKeep  (const ir_node *irn) { return get_irn_op(irn) == op_be_CopyKeep  ; }
static inline bool be_is_Perm      (const ir_node *irn) { return get_irn_op(irn) == op_be_Perm      ; }
static inline bool be_is_MemPerm   (const ir_node *irn) { return get_irn_op(irn) == op_be_MemPerm   ; }
static inline bool be_is_Keep      (const ir_node *irn) { return get_irn_op(irn) == op_be_Keep      ; }
static inline bool be_is_IncSP     (const ir_node *irn) { return get_irn_op(irn) == op_be_IncSP     ; }
static inline bool be_is_Relocation(const ir_node *irn) { return get_irn_op(irn) == op_be_Relocation; }
221

222
223
224
225
226
227
static inline be_asm_attr_t const *get_be_asm_attr_const(ir_node const *const asmn)
{
	assert(be_is_Asm(asmn));
	return (be_asm_attr_t const*)get_irn_generic_attr_const(asmn);
}

228
#endif