2 * Copyright (C) 1995-2008 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 Processor architecture specification.
23 * @author Sebastian Hack
39 #include "raw_bitset.h"
43 /* Initialize the architecture environment struct. */
44 arch_env_t *arch_env_init(const arch_isa_if_t *isa_if, FILE *file_handle, be_main_env_t *main_env)
46 arch_env_t *arch_env = isa_if->init(file_handle);
47 arch_env->main_env = main_env;
52 * Get the isa responsible for a node.
53 * @param irn The node to get the responsible isa for.
54 * @return The irn operations given by the responsible isa.
56 static inline const arch_irn_ops_t *get_irn_ops(const ir_node *irn)
59 const arch_irn_ops_t *be_ops;
62 irn = get_Proj_pred(irn);
63 assert(!is_Proj(irn));
66 ops = get_irn_op(irn);
67 be_ops = get_op_ops(ops)->be_ops;
72 const arch_register_req_t *arch_get_register_req(const ir_node *irn, int pos)
76 pos = -1-get_Proj_proj(irn);
77 irn = get_Proj_pred(irn);
81 return arch_get_out_register_req(irn, -pos-1);
83 const arch_irn_ops_t *ops = get_irn_ops_simple(irn);
84 return ops->get_irn_reg_req_in(irn, pos);
88 void arch_set_frame_offset(ir_node *irn, int offset)
90 const arch_irn_ops_t *ops = get_irn_ops(irn);
91 ops->set_frame_offset(irn, offset);
94 ir_entity *arch_get_frame_entity(const ir_node *irn)
96 const arch_irn_ops_t *ops = get_irn_ops(irn);
97 return ops->get_frame_entity(irn);
100 int arch_get_sp_bias(ir_node *irn)
102 const arch_irn_ops_t *ops = get_irn_ops(irn);
103 return ops->get_sp_bias(irn);
106 arch_inverse_t *arch_get_inverse(const ir_node *irn, int i, arch_inverse_t *inverse, struct obstack *obstack)
108 const arch_irn_ops_t *ops = get_irn_ops(irn);
110 if (ops->get_inverse) {
111 return ops->get_inverse(irn, i, inverse, obstack);
117 int arch_possible_memory_operand(const ir_node *irn, unsigned int i)
119 const arch_irn_ops_t *ops = get_irn_ops(irn);
121 if (ops->possible_memory_operand) {
122 return ops->possible_memory_operand(irn, i);
128 void arch_perform_memory_operand(ir_node *irn, ir_node *spill, unsigned int i)
130 const arch_irn_ops_t *ops = get_irn_ops(irn);
132 if (ops->perform_memory_operand) {
133 ops->perform_memory_operand(irn, spill, i);
139 int arch_get_op_estimated_cost(const ir_node *irn)
141 const arch_irn_ops_t *ops = get_irn_ops(irn);
143 if (ops->get_op_estimated_cost) {
144 return ops->get_op_estimated_cost(irn);
150 void arch_put_non_ignore_regs(const arch_register_class_t *cls, bitset_t *bs)
154 for (i = 0; i < cls->n_regs; ++i) {
155 if (!arch_register_type_is(&cls->regs[i], ignore))
160 int arch_reg_is_allocatable(const ir_node *irn, int pos,
161 const arch_register_t *reg)
163 const arch_register_req_t *req = arch_get_register_req(irn, pos);
165 if (req->type == arch_register_req_type_none)
168 if (arch_register_req_is(req, limited)) {
169 if (arch_register_get_class(reg) != req->cls)
171 return rbitset_is_set(req->limited, arch_register_get_index(reg));
174 return req->cls == reg->reg_class;
177 const arch_register_class_t *arch_get_irn_reg_class(const ir_node *irn, int pos)
179 const arch_register_req_t *req = arch_get_register_req(irn, pos);
181 assert(req->type != arch_register_req_type_none || req->cls == NULL);
186 static inline reg_out_info_t *get_out_info(const ir_node *node)
189 const backend_info_t *info;
191 assert(get_irn_mode(node) != mode_T);
193 pos = get_Proj_proj(node);
194 node = get_Proj_pred(node);
197 info = be_get_info(node);
198 assert(pos >= 0 && pos < ARR_LEN(info->out_infos));
199 return &info->out_infos[pos];
203 static inline reg_out_info_t *get_out_info_n(const ir_node *node, int pos)
205 const backend_info_t *info = be_get_info(node);
206 assert(!is_Proj(node));
207 assert(pos >= 0 && pos < ARR_LEN(info->out_infos));
208 return &info->out_infos[pos];
212 const arch_register_t *arch_get_irn_register(const ir_node *node)
214 const reg_out_info_t *out = get_out_info(node);
218 const arch_register_t *arch_irn_get_register(const ir_node *node, int pos)
220 const reg_out_info_t *out = get_out_info_n(node, pos);
224 void arch_irn_set_register(ir_node *node, int pos, const arch_register_t *reg)
226 reg_out_info_t *out = get_out_info_n(node, pos);
230 void arch_set_irn_register(ir_node *node, const arch_register_t *reg)
232 reg_out_info_t *out = get_out_info(node);
236 arch_irn_class_t arch_irn_classify(const ir_node *node)
238 const arch_irn_ops_t *ops = get_irn_ops(node);
239 return ops->classify(node);
242 arch_irn_flags_t arch_irn_get_flags(const ir_node *node)
244 backend_info_t *info = be_get_info(node);
248 void arch_irn_set_flags(ir_node *node, arch_irn_flags_t flags)
250 backend_info_t *info = be_get_info(node);
254 void arch_irn_add_flags(ir_node *node, arch_irn_flags_t flags)
256 backend_info_t *info = be_get_info(node);
257 info->flags |= flags;
260 void arch_dump_register_req(FILE *F, const arch_register_req_t *req,
263 if (req == NULL || req->type == arch_register_req_type_none) {
268 fprintf(F, "%s", req->cls->name);
270 if (arch_register_req_is(req, limited)) {
271 unsigned n_regs = req->cls->n_regs;
274 fprintf(F, " limited to");
275 for (i = 0; i < n_regs; ++i) {
276 if (rbitset_is_set(req->limited, i)) {
277 const arch_register_t *reg = &req->cls->regs[i];
278 fprintf(F, " %s", reg->name);
283 if (arch_register_req_is(req, should_be_same)) {
284 const unsigned other = req->other_same;
287 fprintf(F, " same as");
288 for (i = 0; 1U << i <= other; ++i) {
289 if (other & (1U << i)) {
290 ir_fprintf(F, " %+F", get_irn_n(skip_Proj_const(node), i));
295 if (arch_register_req_is(req, must_be_different)) {
296 const unsigned other = req->other_different;
299 fprintf(F, " different from");
300 for (i = 0; 1U << i <= other; ++i) {
301 if (other & (1U << i)) {
302 ir_fprintf(F, " %+F", get_irn_n(skip_Proj_const(node), i));
307 if (req->width != 1) {
308 fprintf(F, " width:%u", req->width);
310 if (arch_register_req_is(req, aligned)) {
311 fprintf(F, " aligned");
313 if (arch_register_req_is(req, ignore)) {
314 fprintf(F, " ignore");
316 if (arch_register_req_is(req, produces_sp)) {
317 fprintf(F, " produces_sp");
321 void arch_dump_reqs_and_registers(FILE *F, const ir_node *node)
323 int n_ins = get_irn_arity(node);
324 int n_outs = arch_irn_get_n_outs(node);
325 arch_irn_flags_t flags = arch_irn_get_flags(node);
328 for (i = 0; i < n_ins; ++i) {
329 const arch_register_req_t *req = arch_get_in_register_req(node, i);
330 fprintf(F, "inreq #%d = ", i);
331 arch_dump_register_req(F, req, node);
334 for (i = 0; i < n_outs; ++i) {
335 const arch_register_req_t *req = arch_get_out_register_req(node, i);
336 fprintf(F, "outreq #%d = ", i);
337 arch_dump_register_req(F, req, node);
340 for (i = 0; i < n_outs; ++i) {
341 const arch_register_t *reg = arch_irn_get_register(node, i);
342 const arch_register_req_t *req = arch_get_out_register_req(node, i);
343 if (req->cls == NULL)
345 fprintf(F, "reg #%d = %s\n", i, reg != NULL ? reg->name : "n/a");
348 fprintf(F, "flags =");
349 if (flags == arch_irn_flags_none) {
352 if (flags & arch_irn_flags_dont_spill) {
353 fprintf(F, " unspillable");
355 if (flags & arch_irn_flags_rematerializable) {
356 fprintf(F, " remat");
358 if (flags & arch_irn_flags_modify_flags) {
359 fprintf(F, " modify_flags");
362 fprintf(F, " (%d)\n", flags);
365 static const arch_register_req_t no_requirement = {
366 arch_register_req_type_none,
373 const arch_register_req_t *arch_no_register_req = &no_requirement;