bearch.h 11.4 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
 */

Christian Würdig's avatar
Christian Würdig committed
6
7
8
9
10
11
12
/**
 * @file
 * @brief       Processor architecture specification.
 * @author      Sebastian Hack
 */
#ifndef FIRM_BE_BEARCH_H
#define FIRM_BE_BEARCH_H
13

14
15
#include <stdbool.h>

16
#include "firm_types.h"
17
#include "raw_bitset.h"
18

19
20
21
#include "be_types.h"
#include "beinfo.h"
#include "be.h"
22

23
24
extern arch_register_req_t const arch_no_requirement;
#define arch_no_register_req (&arch_no_requirement)
Matthias Braun's avatar
Matthias Braun committed
25

Sebastian Hack's avatar
Sebastian Hack committed
26
/**
27
 * Get the register allocated for a value.
Sebastian Hack's avatar
Sebastian Hack committed
28
 */
29
const arch_register_t *arch_get_irn_register(const ir_node *irn);
30

Sebastian Hack's avatar
Sebastian Hack committed
31
/**
32
 * Assign register to a value
Sebastian Hack's avatar
Sebastian Hack committed
33
 */
34
void arch_set_irn_register(ir_node *irn, const arch_register_t *reg);
35

Sebastian Hack's avatar
Sebastian Hack committed
36
/**
37
 * Set the register for a certain output operand.
Sebastian Hack's avatar
Sebastian Hack committed
38
 */
39
void arch_set_irn_register_out(ir_node *irn, unsigned pos, const arch_register_t *r);
Sebastian Hack's avatar
Sebastian Hack committed
40

41
const arch_register_t *arch_get_irn_register_out(const ir_node *irn, unsigned pos);
42
const arch_register_t *arch_get_irn_register_in(const ir_node *irn, int pos);
43

Sebastian Hack's avatar
Sebastian Hack committed
44
/**
45
 * Get register constraints for an operand at position @p
Sebastian Hack's avatar
Sebastian Hack committed
46
 */
47
48
49
50
51
52
static inline const arch_register_req_t *arch_get_irn_register_req_in(
		const ir_node *node, int pos)
{
	const backend_info_t *info = be_get_info(node);
	return info->in_reqs[pos];
}
Sebastian Hack's avatar
Sebastian Hack committed
53
54

/**
55
 * Get register constraint for a produced result (the @p pos result)
Sebastian Hack's avatar
Sebastian Hack committed
56
 */
57
static inline const arch_register_req_t *arch_get_irn_register_req_out(
58
		const ir_node *node, unsigned pos)
59
60
61
62
{
	const backend_info_t *info = be_get_info(node);
	return info->out_infos[pos].req;
}
Sebastian Hack's avatar
Sebastian Hack committed
63

64
static inline void arch_set_irn_register_req_out(ir_node *node, unsigned pos,
65
66
67
		const arch_register_req_t *req)
{
	backend_info_t *info = be_get_info(node);
68
	assert(pos < (unsigned)ARR_LEN(info->out_infos));
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
	info->out_infos[pos].req = req;
}

static inline void arch_set_irn_register_reqs_in(ir_node *node,
		const arch_register_req_t **reqs)
{
	backend_info_t *info = be_get_info(node);
	info->in_reqs = reqs;
}

static inline const arch_register_req_t **arch_get_irn_register_reqs_in(
		const ir_node *node)
{
	backend_info_t *info = be_get_info(node);
	return info->in_reqs;
}

86
87
88
static inline reg_out_info_t *get_out_info(const ir_node *node)
{
	assert(get_irn_mode(node) != mode_T);
89
	size_t pos = 0;
90
	if (is_Proj(node)) {
91
		pos  = get_Proj_num(node);
92
93
94
		node = get_Proj_pred(node);
	}

95
	const backend_info_t *info = be_get_info(node);
96
97
98
99
100
101
102
103
104
	assert(pos < ARR_LEN(info->out_infos));
	return &info->out_infos[pos];
}

static inline const arch_register_req_t *arch_get_irn_register_req(const ir_node *node)
{
	reg_out_info_t *out = get_out_info(node);
	return out->req;
}
105

Sebastian Hack's avatar
Sebastian Hack committed
106
107
108
109
110
/**
 * Get the flags of a node.
 * @param irn The node.
 * @return The flags.
 */
111
112
static inline arch_irn_flags_t arch_get_irn_flags(const ir_node *node)
{
113
	backend_info_t const *const info = be_get_info(node);
114
115
	return info->flags;
}
Sebastian Hack's avatar
Sebastian Hack committed
116

117
118
119
120
121
static inline void arch_add_irn_flags(ir_node *const node, arch_irn_flags_t const flags)
{
	backend_info_t *const info = be_get_info(node);
	info->flags |= flags;
}
Sebastian Hack's avatar
Sebastian Hack committed
122

123
124
/**
 * Returns true if the given node should not be scheduled (has
125
 * arch_irn_flag_not_scheduled flag set)
126
127
128
129
130
131
132
 */
static inline bool arch_is_irn_not_scheduled(const ir_node *node)
{
	return is_Proj(node)
	    || (arch_get_irn_flags(node) & arch_irn_flag_not_scheduled);
}

133
#define arch_irn_is(irn, flag) ((arch_get_irn_flags(irn) & arch_irn_flag_ ## flag) != 0)
134
135
136

static inline unsigned arch_get_irn_n_outs(const ir_node *node)
{
137
	backend_info_t *const info = be_get_info(node);
138
139
140
	return (unsigned)ARR_LEN(info->out_infos);
}

141
142
143
#define be_foreach_out(node, i) \
	for (unsigned i = 0, i##__n = arch_get_irn_n_outs(node); i != i##__n; ++i)

144
145
146
147
148
/**
 * Register an instruction set architecture
 */
void be_register_isa_if(const char *name, const arch_isa_if_t *isa);

149
150
151
152
/**
 * A register.
 */
struct arch_register_t {
Michael Beck's avatar
Michael Beck committed
153
	const char                  *name;         /**< The name of the register. */
154
	arch_register_class_t const *cls;          /**< The class of the register */
155
156
	/** register constraint allowing just this register */
	const arch_register_req_t   *single_req;
Michael Beck's avatar
Michael Beck committed
157
158
	unsigned short               index;        /**< The index of the register in
	                                                the class. */
159
160
161
162
	unsigned short               global_index; /**< The global index this
												    register in the architecture. */
	/** register number in dwarf debugging format */
	unsigned short               dwarf_number;
163
164
	/** register number in instruction encoding */
	unsigned short               encoding;
165
166
167
168
	/** This is just a virtual register. Virtual registers fulfill any register
	 * constraints as long as the register class matches. It is allowed to
	 * have multiple definitions for the same virtual register at a point */
	bool                         is_virtual : 1;
169
170
171
172
173
174
175
};

/**
 * A class of registers.
 * Like general purpose or floating point.
 */
struct arch_register_class_t {
176
177
178
179
180
181
182
183
184
	const char                *name;   /**< The name of the register class.*/
	ir_mode                   *mode;   /**< The mode of the register class.*/
	const arch_register_t     *regs;   /**< The array of registers. */
	const arch_register_req_t *class_req;
	unsigned                   index;  /**< index of this register class */
	unsigned                   n_regs; /**< Number of registers in this
	                                        class. */
	/** don't do register allocation for this class */
	bool                       manual_ra : 1;
185
186
};

187
static inline const arch_register_t *arch_register_for_index(
188
		const arch_register_class_t *cls, unsigned idx)
189
190
191
192
193
194
195
196
197
{
	assert(idx < cls->n_regs);
	return &cls->regs[idx];
}

/**
 * Expresses requirements to register allocation for an operand.
 */
struct arch_register_req_t {
198
199
200
	/** The register class this constraint belongs to. */
	const arch_register_class_t *cls;
	/** allowed register bitset (in case of wide-values this is only about the
201
	 * first register). NULL if all registers are allowed. */
202
	const unsigned              *limited;
203
204
	/** Bitmask of ins which should use the same register. */
	unsigned                     should_be_same;
205
	/** Bitmask of ins which shall use a different register (must_be_different) */
206
	unsigned                     must_be_different;
207
208
	/** Specifies how many sequential registers are required */
	unsigned char                width;
209
210
211
212
	/** ignore this input/output while allocating registers */
	bool                         ignore : 1;
	/** The registernumber should be aligned (in case of multiregister values)*/
	bool                         aligned : 1;
213
214
};

215
216
static inline bool reg_reqs_equal(const arch_register_req_t *req1,
                                  const arch_register_req_t *req2)
217
218
{
	if (req1 == req2)
219
		return true;
220

221
222
	if (req1->cls               != req2->cls               ||
	    req1->should_be_same    != req2->should_be_same    ||
223
	    req1->must_be_different != req2->must_be_different ||
224
225
	    req1->ignore            != req2->ignore            ||
	    req1->aligned           != req2->aligned           ||
Christoph Mallon's avatar
Christoph Mallon committed
226
	    (req1->limited != NULL) != (req2->limited != NULL))
227
		return false;
228
229

	if (req1->limited != NULL) {
230
		if (!rbitsets_equal(req1->limited, req2->limited, req1->cls->n_regs))
231
			return false;
232
233
	}

234
	return true;
235
236
}

237
238
static inline bool reg_req_has_constraint(const arch_register_req_t *req)
{
239
	return req->limited || req->must_be_different != 0 || req->ignore || req->aligned;
240
241
}

242
243
244
245
/**
 * Architecture interface.
 */
struct arch_isa_if_t {
246
247
248
249
250
	unsigned                     n_registers;        /**< number of registers */
	arch_register_t       const *registers;          /**< register array */
	unsigned                     n_register_classes; /**< number of register classes */
	arch_register_class_t const *register_classes;   /**< register classes */

251
	/**
252
253
254
255
256
	 * Initializes the isa interface. This is necessary before calling any
	 * other functions from this interface.
	 */
	void (*init)(void);

Matthias Braun's avatar
Matthias Braun committed
257
258
259
260
261
	/**
	 * Fress resources allocated by this isa interface.
	 */
	void (*finish)(void);

262
263
	/**
	 * Returns the frontend settings needed for this backend.
264
	 */
265
	const backend_params *(*get_params)(void);
266

267
268
269
270
271
	/**
	 * Generate code for the current firm program.
	 */
	void (*generate_code)(FILE *output, const char *cup_name);

272
273
274
275
276
277
	/**
	 * lowers current program for target. See the documentation for
	 * be_lower_for_target() for details.
	 */
	void (*lower_for_target)(void);

278
279
280
281
282
283
	/**
	 * returns true if the string is a valid clobbered (register) in this
	 * backend
	 */
	int (*is_valid_clobber)(const char *clobber);

284
	/**
285
286
	 * Called directly after initialization. Backend should handle all
	 * intrinsics here.
287
	 */
Matthias Braun's avatar
Matthias Braun committed
288
	void (*handle_intrinsics)(ir_graph *irg);
289
290
291
292
293
294

	/**
	 * Get a cost estimation for node @p irn. The cost should be similar to the
	 * number of cycles necessary to execute the instruction.
	 */
	unsigned (*get_op_estimated_cost)(const ir_node *irn);
295
296
297
298
};

static inline bool arch_irn_is_ignore(const ir_node *irn)
{
299
	const arch_register_req_t *req = arch_get_irn_register_req(irn);
300
	return req->ignore;
301
302
}

303
304
static inline bool arch_irn_consider_in_reg_alloc(
		const arch_register_class_t *cls, const ir_node *node)
305
{
306
	const arch_register_req_t *req = arch_get_irn_register_req(node);
307
	return req->cls == cls && !req->ignore;
308
309
}

310
arch_register_t const *arch_find_register(char const *name);
311

312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
#define be_foreach_value(node, value, code) \
	do { \
		if (get_irn_mode(node) == mode_T) { \
			foreach_out_edge(node, node##__edge) { \
				ir_node *const value = get_edge_src_irn(node##__edge); \
				if (!is_Proj(value)) \
					continue; \
				code \
			} \
		} else { \
			ir_node *const value = node; \
			code \
		} \
	} while (0)

327
#define be_foreach_definition_(node, ccls, value, req, code) \
328
329
330
331
332
333
	be_foreach_value(node, value, \
		arch_register_req_t const *const req = arch_get_irn_register_req(value); \
		if (req->cls != ccls) \
			continue; \
		code \
	)
334

335
336
337
338
339
340
/**
 * Iterate over all values defined by an instruction.
 * Only looks at values in a certain register class where the requirements
 * are not marked as ignore.
 * Executes @p code for each definition.
 */
341
342
#define be_foreach_definition(node, ccls, value, req, code) \
	be_foreach_definition_(node, ccls, value, req, \
343
		if (req->ignore) \
344
345
			continue; \
		code \
346
347
	)

348
349
350
351
352
353
354
355
#define be_foreach_use(node, ccls, in_req, value, value_req, code)           \
	do {                                                                     \
	for (int i_ = 0, n_ = get_irn_arity(node); i_ < n_; ++i_) {              \
		const arch_register_req_t *in_req = arch_get_irn_register_req_in(node, i_); \
		if (in_req->cls != ccls)                                             \
			continue;                                                        \
		ir_node                   *value     = get_irn_n(node, i_);              \
		const arch_register_req_t *value_req = arch_get_irn_register_req(value); \
356
		if (value_req->ignore)                                               \
357
358
359
360
361
			continue;                                                        \
		code                                                                 \
	}                                                                        \
	} while (0)

362
363
364
bool arch_reg_is_allocatable(const arch_register_req_t *req,
                             const arch_register_t *reg);

365
366
367
368
369
370
371
typedef struct be_start_info_t {
	unsigned pos;
	ir_node *irn;
} be_start_info_t;

void be_make_start_mem(be_start_info_t *info, ir_node *start, unsigned pos);

372
373
void be_make_start_out(be_start_info_t *info, ir_node *start, unsigned pos,
                       arch_register_t const *reg, bool ignore);
374
375
376

ir_node *be_get_start_proj(ir_graph *irg, be_start_info_t *info);

377
378
void arch_copy_irn_out_info(ir_node *dst, unsigned dst_pos, ir_node const *src);

379
#endif