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
40 #include "raw_bitset.h"
44 /* Initialize the architecture environment struct. */
45 arch_env_t *arch_env_init(const arch_isa_if_t *isa_if, FILE *file_handle, be_main_env_t *main_env)
47 arch_env_t *arch_env = isa_if->init(file_handle);
48 arch_env->main_env = main_env;
53 * Put all registers in a class into a bitset.
54 * @param cls The class.
55 * @param bs The bitset.
56 * @return The number of registers in the class.
58 static int arch_register_class_put(const arch_register_class_t *cls, bitset_t *bs)
60 int i, n = cls->n_regs;
61 for (i = n - 1; i >= 0; --i)
67 * Get the isa responsible for a node.
68 * @param env The arch environment with the isa stack.
69 * @param irn The node to get the responsible isa for.
70 * @return The irn operations given by the responsible isa.
72 static INLINE const arch_irn_ops_t *
73 get_irn_ops(const arch_env_t *env, const ir_node *irn)
76 const arch_irn_ops_t *be_ops;
80 irn = get_Proj_pred(irn);
81 assert(!is_Proj(irn));
84 ops = get_irn_op(irn);
85 be_ops = get_op_ops(ops)->be_ops;
91 const arch_irn_ops_t *arch_get_irn_ops(const arch_env_t *env, const ir_node *irn) {
92 return get_irn_ops(env, irn);
95 const arch_register_req_t *arch_get_register_req(const arch_env_t *env,
96 const ir_node *irn, int pos)
98 const arch_irn_ops_t *ops = get_irn_ops(env, irn);
99 return ops->get_irn_reg_req(irn, pos);
102 void arch_set_frame_offset(const arch_env_t *env, ir_node *irn, int offset)
104 const arch_irn_ops_t *ops = get_irn_ops(env, irn);
105 ops->set_frame_offset(irn, offset);
108 ir_entity *arch_get_frame_entity(const arch_env_t *env, const ir_node *irn)
110 const arch_irn_ops_t *ops = get_irn_ops(env, irn);
111 return ops->get_frame_entity(irn);
114 void arch_set_frame_entity(const arch_env_t *env, ir_node *irn, ir_entity *ent)
116 const arch_irn_ops_t *ops = get_irn_ops(env, irn);
117 ops->set_frame_entity(irn, ent);
120 int arch_get_sp_bias(const arch_env_t *env, ir_node *irn)
122 const arch_irn_ops_t *ops = get_irn_ops(env, irn);
123 return ops->get_sp_bias(irn);
126 arch_inverse_t *arch_get_inverse(const arch_env_t *env, const ir_node *irn, int i, arch_inverse_t *inverse, struct obstack *obstack)
128 const arch_irn_ops_t *ops = get_irn_ops(env, irn);
130 if(ops->get_inverse) {
131 return ops->get_inverse(irn, i, inverse, obstack);
137 int arch_possible_memory_operand(const arch_env_t *env, const ir_node *irn, unsigned int i) {
138 const arch_irn_ops_t *ops = get_irn_ops(env, irn);
140 if(ops->possible_memory_operand) {
141 return ops->possible_memory_operand(irn, i);
147 void arch_perform_memory_operand(const arch_env_t *env, ir_node *irn, ir_node *spill, unsigned int i) {
148 const arch_irn_ops_t *ops = get_irn_ops(env, irn);
150 if(ops->perform_memory_operand) {
151 ops->perform_memory_operand(irn, spill, i);
157 int arch_get_op_estimated_cost(const arch_env_t *env, const ir_node *irn)
159 const arch_irn_ops_t *ops = get_irn_ops(env, irn);
161 if(ops->get_op_estimated_cost) {
162 return ops->get_op_estimated_cost(irn);
168 int arch_is_possible_memory_operand(const arch_env_t *env, const ir_node *irn, int i)
170 const arch_irn_ops_t *ops = get_irn_ops(env, irn);
172 if(ops->possible_memory_operand) {
173 return ops->possible_memory_operand(irn, i);
179 int arch_get_allocatable_regs(const arch_env_t *env, const ir_node *irn, int pos, bitset_t *bs)
181 const arch_irn_ops_t *ops = get_irn_ops(env, irn);
182 const arch_register_req_t *req = ops->get_irn_reg_req(irn, pos);
184 if(req->type == arch_register_req_type_none) {
185 bitset_clear_all(bs);
189 if(arch_register_req_is(req, limited)) {
190 rbitset_copy_to_bitset(req->limited, bs);
191 return bitset_popcnt(bs);
194 arch_register_class_put(req->cls, bs);
195 return req->cls->n_regs;
198 void arch_put_non_ignore_regs(const arch_env_t *env,
199 const arch_register_class_t *cls, bitset_t *bs)
204 for(i = 0; i < cls->n_regs; ++i) {
205 if(!arch_register_type_is(&cls->regs[i], ignore))
210 int arch_count_non_ignore_regs(const arch_env_t *env,
211 const arch_register_class_t *cls)
217 for(i = 0; i < cls->n_regs; ++i) {
218 if(!arch_register_type_is(&cls->regs[i], ignore))
225 int arch_is_register_operand(const arch_env_t *env,
226 const ir_node *irn, int pos)
228 const arch_irn_ops_t *ops = get_irn_ops(env, irn);
229 const arch_register_req_t *req = ops->get_irn_reg_req(irn, pos);
234 int arch_reg_is_allocatable(const arch_env_t *env, const ir_node *irn,
235 int pos, const arch_register_t *reg)
237 const arch_register_req_t *req;
239 req = arch_get_register_req(env, irn, pos);
241 if(req->type == arch_register_req_type_none)
244 if(arch_register_req_is(req, limited)) {
245 assert(arch_register_get_class(reg) == req->cls);
246 return rbitset_is_set(req->limited, arch_register_get_index(reg));
249 return req->cls == reg->reg_class;
252 const arch_register_class_t *
253 arch_get_irn_reg_class(const arch_env_t *env, const ir_node *irn, int pos)
255 const arch_irn_ops_t *ops = get_irn_ops(env, irn);
256 const arch_register_req_t *req = ops->get_irn_reg_req(irn, pos);
258 assert(req->type != arch_register_req_type_none || req->cls == NULL);
263 extern const arch_register_t *
264 arch_get_irn_register(const arch_env_t *env, const ir_node *irn)
266 const arch_irn_ops_t *ops = get_irn_ops(env, irn);
267 return ops->get_irn_reg(irn);
270 extern void arch_set_irn_register(const arch_env_t *env,
271 ir_node *irn, const arch_register_t *reg)
273 const arch_irn_ops_t *ops = get_irn_ops(env, irn);
274 ops->set_irn_reg(irn, reg);
277 extern arch_irn_class_t arch_irn_classify(const arch_env_t *env, const ir_node *irn)
279 const arch_irn_ops_t *ops = get_irn_ops(env, irn);
280 return ops->classify(irn);
283 extern arch_irn_flags_t arch_irn_get_flags(const arch_env_t *env, const ir_node *irn)
285 const arch_irn_ops_t *ops = get_irn_ops(env, irn);
286 return ops->get_flags(irn);
289 extern const char *arch_irn_flag_str(arch_irn_flags_t fl)
292 #define XXX(x) case arch_irn_flags_ ## x: return #x;
295 XXX(rematerializable);
304 extern char *arch_register_req_format(char *buf, size_t len,
305 const arch_register_req_t *req,
309 snprintf(buf, len, "class: %s", req->cls->name);
311 if(arch_register_req_is(req, limited)) {
312 unsigned n_regs = req->cls->n_regs;
315 strncat(buf, " limited:", len);
316 for(i = 0; i < n_regs; ++i) {
317 if(rbitset_is_set(req->limited, i)) {
318 const arch_register_t *reg = &req->cls->regs[i];
319 strncat(buf, " ", len);
320 strncat(buf, reg->name, len);
325 if(arch_register_req_is(req, should_be_same)) {
326 const unsigned other = req->other_same;
329 ir_snprintf(tmp, sizeof(tmp), " same to:");
330 for (i = 0; 1U << i <= other; ++i) {
331 if (other & (1U << i)) {
332 ir_snprintf(tmp, sizeof(tmp), " %+F", get_irn_n(skip_Proj_const(node), i));
333 strncat(buf, tmp, len);
338 if (arch_register_req_is(req, must_be_different)) {
339 const unsigned other = req->other_different;
342 ir_snprintf(tmp, sizeof(tmp), " different from:");
343 for (i = 0; 1U << i <= other; ++i) {
344 if (other & (1U << i)) {
345 ir_snprintf(tmp, sizeof(tmp), " %+F", get_irn_n(skip_Proj_const(node), i));
346 strncat(buf, tmp, len);
354 static const arch_register_req_t no_requirement = {
355 arch_register_req_type_none,
361 const arch_register_req_t *arch_no_register_req = &no_requirement;