2 * Copyright (C) 1995-2010 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 Peephole optimization and legalization of a sparc function
23 * @author Matthias Braun
25 * A note on sparc stackpointer (sp) behaviour:
26 * The ABI expects SPARC_MIN_STACKSIZE bytes to be available at the
27 * stackpointer. This space will be used to spill register windows,
28 * and for spilling va_arg arguments (maybe we can optimize this away for
29 * statically known not-va-arg-functions...)
30 * This in effect means that we allocate that extra space at the function begin
31 * which is easy. But this space isn't really fixed at the beginning of the
32 * stackframe. Instead you should rather imagine the space as always being the
33 * last-thing on the stack.
34 * So when addressing anything stack-specific we have to account for this
35 * area, while our compiler thinks the space is occupied at the beginning
36 * of the stack frame. The code here among other things adjusts these offsets
41 #include "bearch_sparc_t.h"
42 #include "gen_sparc_regalloc_if.h"
43 #include "sparc_new_nodes.h"
44 #include "sparc_transform.h"
51 #include "bepeephole.h"
54 #include "bespillslots.h"
58 static ir_heights_t *heights;
60 static void kill_unused_stacknodes(ir_node *node)
62 if (get_irn_n_edges(node) > 0)
65 if (be_is_IncSP(node)) {
68 } else if (is_Phi(node)) {
69 int arity = get_irn_arity(node);
70 ir_node **ins = ALLOCAN(ir_node*, arity);
73 memcpy(ins, get_irn_in(node), arity*sizeof(ins[0]));
76 for (i = 0; i < arity; ++i)
77 kill_unused_stacknodes(ins[i]);
81 static void introduce_epilog(ir_node *ret)
83 const arch_register_t *sp_reg = &sparc_registers[REG_SP];
84 ir_graph *irg = get_irn_irg(ret);
85 be_stack_layout_t *layout = be_get_irg_stack_layout(irg);
86 ir_node *block = get_nodes_block(ret);
87 ir_type *frame_type = get_irg_frame_type(irg);
88 unsigned frame_size = get_type_size_bytes(frame_type);
89 int sp_idx = be_find_return_reg_input(ret, sp_reg);
90 ir_node *sp = get_irn_n(ret, sp_idx);
92 if (!layout->sp_relative) {
93 const arch_register_t *fp_reg = &sparc_registers[REG_FRAME_POINTER];
94 const arch_register_t *sp_reg = &sparc_registers[REG_SP];
95 ir_node *fp = be_get_initial_reg_value(irg, fp_reg);
96 ir_node *sp = be_get_initial_reg_value(irg, sp_reg);
97 ir_node *restore = new_bd_sparc_RestoreZero(NULL, block, sp, fp);
98 sched_add_before(ret, restore);
99 arch_set_irn_register(restore, sp_reg);
100 set_irn_n(ret, sp_idx, restore);
102 kill_unused_stacknodes(sp);
104 ir_node *incsp = be_new_IncSP(sp_reg, block, sp, -frame_size, 0);
105 set_irn_n(ret, sp_idx, incsp);
106 sched_add_before(ret, incsp);
110 void sparc_introduce_prolog_epilog(ir_graph *irg)
112 const arch_register_t *sp_reg = &sparc_registers[REG_SP];
113 ir_node *start = get_irg_start(irg);
114 be_stack_layout_t *layout = be_get_irg_stack_layout(irg);
115 ir_node *block = get_nodes_block(start);
116 ir_node *initial_sp = be_get_initial_reg_value(irg, sp_reg);
117 ir_node *sp = initial_sp;
118 ir_node *schedpoint = start;
119 ir_type *frame_type = get_irg_frame_type(irg);
120 unsigned frame_size = get_type_size_bytes(frame_type);
122 /* introduce epilog for every return node */
124 ir_node *end_block = get_irg_end_block(irg);
125 int arity = get_irn_arity(end_block);
128 for (i = 0; i < arity; ++i) {
129 ir_node *ret = get_irn_n(end_block, i);
130 assert(is_sparc_Return(ret));
131 introduce_epilog(ret);
135 while (be_is_Keep(sched_next(schedpoint)))
136 schedpoint = sched_next(schedpoint);
138 if (!layout->sp_relative) {
139 ir_node *save = new_bd_sparc_Save_imm(NULL, block, sp, NULL,
140 -SPARC_MIN_STACKSIZE-frame_size);
141 arch_set_irn_register(save, sp_reg);
142 sched_add_after(schedpoint, save);
145 edges_reroute(initial_sp, save);
146 set_irn_n(save, n_sparc_Save_stack, initial_sp);
148 /* we still need the Save even if noone is explicitely using the
149 * value. (TODO: this isn't 100% correct yet, something at the end of
150 * the function should hold the Save, even if we use a restore
151 * which just overrides it instead of using the value)
153 if (get_irn_n_edges(save) == 0) {
154 ir_node *in[] = { save };
155 ir_node *keep = be_new_Keep(block, 1, in);
156 sched_add_after(schedpoint, keep);
159 ir_node *incsp = be_new_IncSP(sp_reg, block, sp, frame_size, 0);
160 edges_reroute(initial_sp, incsp);
161 be_set_IncSP_pred(incsp, sp);
162 sched_add_after(schedpoint, incsp);
167 * Creates a constant from an immediate value.
169 static ir_node *create_constant_from_immediate(ir_node *node, int offset)
171 dbg_info *dbgi = get_irn_dbg_info(node);
172 ir_node *block = get_nodes_block(node);
173 ir_node *high = new_bd_sparc_SetHi(dbgi, block, NULL, offset);
175 sched_add_before(node, high);
176 arch_set_irn_register(high, &sparc_registers[REG_G4]);
178 if ((offset & 0x3ff) != 0) {
179 ir_node *low = new_bd_sparc_Or_imm(dbgi, block, high, NULL, offset & 0x3ff);
181 sched_add_before(node, low);
182 arch_set_irn_register(low, &sparc_registers[REG_G4]);
190 static void finish_sparc_Save(ir_node *node)
192 sparc_attr_t *attr = get_sparc_attr(node);
193 int offset = attr->immediate_value;
195 if (! sparc_is_value_imm_encodeable(offset)) {
196 ir_node *base = get_irn_n(node, n_sparc_Save_stack);
197 dbg_info *dbgi = get_irn_dbg_info(node);
198 ir_node *block = get_nodes_block(node);
199 ir_node *constant = create_constant_from_immediate(node, offset);
200 ir_node *new_save = new_bd_sparc_Save_reg(dbgi, block, base, constant);
201 const arch_register_t *reg = arch_get_irn_register(node);
203 /* we have a Save with immediate */
204 assert(get_irn_arity(node) == 1);
206 sched_add_before(node, new_save);
207 arch_set_irn_register(new_save, reg);
208 be_peephole_exchange(node, new_save);
213 * SPARC immediates are limited. Split IncSP with bigger immediates if
216 static void finish_be_IncSP(ir_node *node)
218 int offset = be_get_IncSP_offset(node);
220 /* we might have to break the IncSP apart if the constant has become too big */
221 if (! sparc_is_value_imm_encodeable(offset) && ! sparc_is_value_imm_encodeable(-offset)) {
222 ir_node *sp = be_get_IncSP_pred(node);
223 dbg_info *dbgi = get_irn_dbg_info(node);
224 ir_node *block = get_nodes_block(node);
225 ir_node *constant = create_constant_from_immediate(node, offset);
226 ir_node *sub = new_bd_sparc_Sub_reg(dbgi, block, sp, constant);
228 sched_add_before(node, sub);
229 arch_set_irn_register(sub, &sparc_registers[REG_SP]);
230 be_peephole_exchange(node, sub);
235 * Adjust sp-relative offsets.
237 * Split into multiple instructions if offset exceeds SPARC immediate range.
239 static void finish_sparc_FrameAddr(ir_node *node)
241 sparc_attr_t *attr = get_sparc_attr(node);
242 int offset = attr->immediate_value;
244 if (! sparc_is_value_imm_encodeable(offset)) {
245 ir_node *base = get_irn_n(node, n_sparc_FrameAddr_base);
246 dbg_info *dbgi = get_irn_dbg_info(node);
247 ir_node *block = get_nodes_block(node);
248 ir_node *constant = create_constant_from_immediate(node, offset);
249 ir_node *new_frameaddr = new_bd_sparc_Add_reg(dbgi, block, base, constant);
250 const arch_register_t *reg = arch_get_irn_register(node);
252 sched_add_before(node, new_frameaddr);
253 arch_set_irn_register(new_frameaddr, reg);
254 exchange(node, new_frameaddr);
258 static void finish_sparc_Ld(ir_node *node)
260 sparc_attr_t *attr = get_sparc_attr(node);
261 int offset = attr->immediate_value;
262 const sparc_load_store_attr_t *load_store_attr = get_sparc_load_store_attr_const(node);
264 if (! load_store_attr->is_frame_entity)
267 if (! sparc_is_value_imm_encodeable(offset)) {
268 ir_node *ptr = get_irn_n(node, n_sparc_Ld_ptr);
269 dbg_info *dbgi = get_irn_dbg_info(node);
270 ir_node *block = get_nodes_block(node);
271 ir_node *mem = get_irn_n(node, n_sparc_Ld_mem);
272 ir_mode *load_store_mode = load_store_attr->load_store_mode;
273 ir_node *constant = create_constant_from_immediate(node, offset);
274 ir_node *new_load = new_bd_sparc_Ld_reg(dbgi, block, ptr, constant, mem, load_store_mode);
275 sparc_load_store_attr_t *new_load_attr = get_sparc_load_store_attr(new_load);
276 unsigned n_outs = arch_get_irn_n_outs(node);
279 new_load_attr->is_frame_entity = load_store_attr->is_frame_entity;
280 new_load_attr->is_reg_reg = load_store_attr->is_reg_reg;
282 sched_add_before(node, new_load);
283 for (i = 0; i < n_outs; i++) {
284 arch_set_irn_register_out(new_load, i, arch_get_irn_register_out(node, i));
286 exchange(node, new_load);
291 static void finish_sparc_Ldf(ir_node *node)
293 sparc_attr_t *attr = get_sparc_attr(node);
294 int offset = attr->immediate_value;
295 const sparc_load_store_attr_t *load_store_attr = get_sparc_load_store_attr_const(node);
297 if (! load_store_attr->is_frame_entity)
300 if (! sparc_is_value_imm_encodeable(offset)) {
301 ir_node *ptr = get_irn_n(node, n_sparc_Ldf_ptr);
302 dbg_info *dbgi = get_irn_dbg_info(node);
303 ir_node *block = get_nodes_block(node);
304 ir_node *mem = get_irn_n(node, n_sparc_Ldf_mem);
305 ir_mode *load_store_mode = load_store_attr->load_store_mode;
306 ir_node *constant = create_constant_from_immediate(node, offset);
307 ir_node *new_ptr = new_bd_sparc_Add_reg(dbgi, block, ptr, constant);
308 ir_node *new_load = new_bd_sparc_Ldf_s(dbgi, block, new_ptr, mem, load_store_mode, NULL, 0, true);
309 sparc_load_store_attr_t *new_load_attr = get_sparc_load_store_attr(new_load);
310 unsigned n_outs = arch_get_irn_n_outs(node);
313 new_load_attr->is_frame_entity = load_store_attr->is_frame_entity;
314 new_load_attr->is_reg_reg = load_store_attr->is_reg_reg;
316 sched_add_before(node, new_load);
317 for (i = 0; i < n_outs; i++) {
318 arch_set_irn_register_out(new_load, i, arch_get_irn_register_out(node, i));
320 exchange(node, new_load);
325 static void finish_sparc_St(ir_node *node)
327 sparc_attr_t *attr = get_sparc_attr(node);
328 int offset = attr->immediate_value;
329 const sparc_load_store_attr_t *load_store_attr = get_sparc_load_store_attr_const(node);
331 if (! load_store_attr->is_frame_entity)
334 if (! sparc_is_value_imm_encodeable(offset)) {
335 ir_node *ptr = get_irn_n(node, n_sparc_St_ptr);
336 dbg_info *dbgi = get_irn_dbg_info(node);
337 ir_node *block = get_nodes_block(node);
338 ir_node *mem = get_irn_n(node, n_sparc_St_mem);
339 ir_node *value = get_irn_n(node, n_sparc_St_val);
340 ir_mode *load_store_mode = load_store_attr->load_store_mode;
341 ir_node *constant = create_constant_from_immediate(node, offset);
342 ir_node *new_load = new_bd_sparc_St_reg(dbgi, block, value, ptr, constant, mem, load_store_mode);
343 sparc_load_store_attr_t *new_load_attr = get_sparc_load_store_attr(new_load);
344 unsigned n_outs = arch_get_irn_n_outs(node);
347 new_load_attr->is_frame_entity = load_store_attr->is_frame_entity;
348 new_load_attr->is_reg_reg = load_store_attr->is_reg_reg;
350 sched_add_before(node, new_load);
351 for (i = 0; i < n_outs; i++) {
352 arch_set_irn_register_out(new_load, i, arch_get_irn_register_out(node, i));
354 exchange(node, new_load);
359 static void finish_sparc_Stf(ir_node *node)
361 sparc_attr_t *attr = get_sparc_attr(node);
362 int offset = attr->immediate_value;
363 const sparc_load_store_attr_t *load_store_attr = get_sparc_load_store_attr_const(node);
365 if (! load_store_attr->is_frame_entity)
368 if (! sparc_is_value_imm_encodeable(offset)) {
369 ir_node *ptr = get_irn_n(node, n_sparc_Stf_ptr);
370 dbg_info *dbgi = get_irn_dbg_info(node);
371 ir_node *block = get_nodes_block(node);
372 ir_node *mem = get_irn_n(node, n_sparc_Stf_mem);
373 ir_node *value = get_irn_n(node, n_sparc_Stf_val);
374 ir_mode *load_store_mode = load_store_attr->load_store_mode;
375 ir_node *constant = create_constant_from_immediate(node, offset);
376 ir_node *new_ptr = new_bd_sparc_Add_reg(dbgi, block, ptr, constant);
377 ir_node *new_load = new_bd_sparc_Stf_s(dbgi, block, value, new_ptr, mem, load_store_mode, NULL, 0, true);
378 sparc_load_store_attr_t *new_load_attr = get_sparc_load_store_attr(new_load);
379 unsigned n_outs = arch_get_irn_n_outs(node);
382 new_load_attr->is_frame_entity = load_store_attr->is_frame_entity;
383 new_load_attr->is_reg_reg = load_store_attr->is_reg_reg;
385 sched_add_before(node, new_load);
386 for (i = 0; i < n_outs; i++) {
387 arch_set_irn_register_out(new_load, i, arch_get_irn_register_out(node, i));
389 exchange(node, new_load);
394 static void peephole_be_IncSP(ir_node *node)
397 node = be_peephole_IncSP_IncSP(node);
398 if (!be_is_IncSP(node))
401 pred = be_get_IncSP_pred(node);
402 if (is_sparc_Save(pred) && be_has_only_one_user(pred)) {
403 int offset = -be_get_IncSP_offset(node);
404 sparc_attr_t *attr = get_sparc_attr(pred);
405 attr->immediate_value += offset;
406 be_peephole_exchange(node, pred);
410 static void peephole_sparc_FrameAddr(ir_node *node)
412 /* the peephole code currently doesn't allow this since it changes
413 * the register. Find out why and how to workaround this... */
415 const sparc_attr_t *attr = get_sparc_attr_const(node);
416 if (attr->immediate_value == 0) {
417 ir_node *base = get_irn_n(node, n_sparc_FrameAddr_base);
418 be_peephole_exchange(node, base);
424 /* output must not be local, or out reg. Since the destination of the restore
425 * is the rotated register-file where only the old in-registers are still
426 * visible (as out-registers) */
427 static bool is_restorezeroopt_reg(const arch_register_t *reg)
429 unsigned index = reg->global_index;
430 return (index >= REG_G0 && index <= REG_G7)
431 || (index >= REG_I0 && index <= REG_I7);
434 static void replace_with_restore_reg(ir_node *node, ir_node *replaced,
435 ir_node *op0, ir_node *op1)
437 dbg_info *dbgi = get_irn_dbg_info(node);
438 ir_node *stack_in = get_irn_n(node, n_sparc_RestoreZero_stack);
439 ir_node *fp = get_irn_n(node, n_sparc_RestoreZero_frame_pointer);
440 ir_node *block = get_nodes_block(node);
441 ir_mode *mode = get_irn_mode(node);
442 ir_node *new_node = new_bd_sparc_Restore_reg(dbgi, block, stack_in, fp,
444 ir_node *stack = new_r_Proj(new_node, mode, pn_sparc_Restore_stack);
445 ir_node *res = new_r_Proj(new_node, mode, pn_sparc_Restore_res);
446 const arch_register_t *reg = arch_get_irn_register(replaced);
447 const arch_register_t *sp = &sparc_registers[REG_SP];
448 arch_set_irn_register_out(new_node, pn_sparc_Restore_stack, sp);
449 arch_set_irn_register_out(new_node, pn_sparc_Restore_res, reg);
451 sched_add_before(node, new_node);
452 be_peephole_exchange(node, stack);
453 be_peephole_exchange(replaced, res);
456 static void replace_with_restore_imm(ir_node *node, ir_node *replaced,
457 ir_node *op, ir_entity *imm_entity,
460 dbg_info *dbgi = get_irn_dbg_info(node);
461 ir_node *stack_in = get_irn_n(node, n_sparc_RestoreZero_stack);
462 ir_node *fp = get_irn_n(node, n_sparc_RestoreZero_frame_pointer);
463 ir_node *block = get_nodes_block(node);
464 ir_mode *mode = get_irn_mode(node);
465 ir_node *new_node = new_bd_sparc_Restore_imm(dbgi, block, stack_in, fp,
466 op, imm_entity, immediate);
467 ir_node *stack = new_r_Proj(new_node, mode, pn_sparc_Restore_stack);
468 ir_node *res = new_r_Proj(new_node, mode, pn_sparc_Restore_res);
469 const arch_register_t *reg = arch_get_irn_register(replaced);
470 const arch_register_t *sp = &sparc_registers[REG_SP];
471 arch_set_irn_register_out(new_node, pn_sparc_Restore_stack, sp);
472 arch_set_irn_register_out(new_node, pn_sparc_Restore_res, reg);
474 sched_add_before(node, new_node);
475 be_peephole_exchange(node, stack);
476 be_peephole_exchange(replaced, res);
479 static void peephole_sparc_RestoreZero(ir_node *node)
481 /* restore gives us a free "add" instruction, let's try to use that to fold
482 * an instruction in. We can do the following:
484 * - Copy values (g0 + reg)
485 * - Produce constants (g0 + immediate)
486 * - Perform an add (reg + reg)
487 * - Perform a sub with immediate (reg + (-immediate))
489 * Note: In an ideal world, this would not be a peephole optimization but
490 * already performed during code selection. Since about all foldable ops are
491 * arguments of the return node. However we have a hard time doing this
492 * since we construct epilogue code only after register allocation
493 * (and therefore after code selection).
495 int n_tries = 10; /* limit our search */
496 ir_node *schedpoint = node;
498 while (sched_has_prev(schedpoint)) {
499 const arch_register_t *reg;
500 schedpoint = sched_prev(schedpoint);
505 if (arch_get_irn_n_outs(schedpoint) == 0)
508 if (!mode_is_data(get_irn_mode(schedpoint)))
511 reg = arch_get_irn_register(schedpoint);
512 if (!is_restorezeroopt_reg(reg))
515 if (be_is_Copy(schedpoint) && be_can_move_before(heights, schedpoint, node)) {
516 ir_node *op = get_irn_n(schedpoint, n_be_Copy_op);
517 replace_with_restore_imm(node, schedpoint, op, NULL, 0);
518 } else if (is_sparc_Or(schedpoint) &&
519 arch_get_irn_flags(schedpoint) & ((arch_irn_flags_t)sparc_arch_irn_flag_immediate_form) &&
520 arch_get_irn_register_in(schedpoint, 0) == &sparc_registers[REG_G0] &&
521 be_can_move_before(heights, schedpoint, node)) {
522 /* it's a constant */
523 const sparc_attr_t *attr = get_sparc_attr_const(schedpoint);
524 ir_entity *entity = attr->immediate_value_entity;
525 int32_t immediate = attr->immediate_value;
526 ir_node *g0 = get_irn_n(schedpoint, 0);
527 replace_with_restore_imm(node, schedpoint, g0, entity, immediate);
528 } else if (is_sparc_Add(schedpoint) &&
529 be_can_move_before(heights, schedpoint, node)) {
530 if (arch_get_irn_flags(schedpoint) & ((arch_irn_flags_t)sparc_arch_irn_flag_immediate_form)) {
531 ir_node *op = get_irn_n(schedpoint, 0);
532 const sparc_attr_t *attr = get_sparc_attr_const(schedpoint);
533 ir_entity *entity = attr->immediate_value_entity;
534 int32_t imm = attr->immediate_value;
535 replace_with_restore_imm(node, schedpoint, op, entity, imm);
537 ir_node *op0 = get_irn_n(schedpoint, 0);
538 ir_node *op1 = get_irn_n(schedpoint, 1);
539 replace_with_restore_reg(node, schedpoint, op0, op1);
541 } else if (is_sparc_Sub(schedpoint) &&
542 arch_get_irn_flags(schedpoint) & ((arch_irn_flags_t)sparc_arch_irn_flag_immediate_form) &&
543 arch_get_irn_register_in(schedpoint, 0) == &sparc_registers[REG_G0] &&
544 be_can_move_before(heights, schedpoint, node)) {
545 /* it's a constant */
546 const sparc_attr_t *attr = get_sparc_attr_const(schedpoint);
547 ir_entity *entity = attr->immediate_value_entity;
548 int32_t imm = attr->immediate_value;
549 if (entity == NULL && sparc_is_value_imm_encodeable(-imm)) {
550 ir_node *g0 = get_irn_n(schedpoint, 0);
551 replace_with_restore_imm(node, schedpoint, g0, NULL, -imm);
556 /* when we're here then we performed a folding and are done */
561 static void finish_sparc_Return(ir_node *node)
563 ir_node *schedpoint = node;
565 /* see that there is no code between Return and restore, if there is move
566 * it in front of the restore */
568 if (!sched_has_prev(schedpoint))
570 schedpoint = sched_prev(schedpoint);
571 if (is_sparc_Restore(schedpoint) || is_sparc_RestoreZero(schedpoint))
574 restore = schedpoint;
575 schedpoint = sched_prev(node);
576 /* move all code between return and restore up */
577 while (schedpoint != restore) {
578 ir_node *next_schedpoint = sched_prev(schedpoint);
579 sched_remove(schedpoint);
580 sched_add_before(restore, schedpoint);
581 schedpoint = next_schedpoint;
585 static void register_peephole_optimisation(ir_op *op, peephole_opt_func func)
587 assert(op->ops.generic == NULL);
588 op->ops.generic = (op_func) func;
591 static void sparc_collect_frame_entity_nodes(ir_node *node, void *data)
593 be_fec_env_t *env = (be_fec_env_t*)data;
597 const sparc_load_store_attr_t *attr;
599 if (be_is_Reload(node) && be_get_frame_entity(node) == NULL) {
600 mode = get_irn_mode(node);
601 align = get_mode_size_bytes(mode);
602 be_node_needs_frame_entity(env, node, mode, align);
606 if (!is_sparc_Ld(node) && !is_sparc_Ldf(node))
609 attr = get_sparc_load_store_attr_const(node);
610 entity = attr->base.immediate_value_entity;
611 mode = attr->load_store_mode;
614 if (!attr->is_frame_entity)
616 if (arch_get_irn_flags(node) & sparc_arch_irn_flag_needs_64bit_spillslot)
618 align = get_mode_size_bytes(mode);
619 be_node_needs_frame_entity(env, node, mode, align);
622 static void sparc_set_frame_entity(ir_node *node, ir_entity *entity)
624 if (is_be_node(node)) {
625 be_node_set_frame_entity(node, entity);
627 /* we only say be_node_needs_frame_entity on nodes with load_store
628 * attributes, so this should be fine */
629 sparc_load_store_attr_t *attr = get_sparc_load_store_attr(node);
630 assert(attr->is_frame_entity);
631 assert(attr->base.immediate_value_entity == NULL);
632 attr->base.immediate_value_entity = entity;
636 void sparc_finish_graph(ir_graph *irg)
638 be_stack_layout_t *stack_layout = be_get_irg_stack_layout(irg);
639 bool at_begin = stack_layout->sp_relative ? true : false;
640 be_fec_env_t *fec_env = be_new_frame_entity_coalescer(irg);
642 irg_walk_graph(irg, NULL, sparc_collect_frame_entity_nodes, fec_env);
643 be_assign_entities(fec_env, sparc_set_frame_entity, at_begin);
644 be_free_frame_entity_coalescer(fec_env);
645 sparc_adjust_stack_entity_offsets(irg);
647 sparc_introduce_prolog_epilog(irg);
649 /* fix stack entity offsets */
650 be_abi_fix_stack_nodes(irg);
651 sparc_fix_stack_bias(irg);
653 heights = heights_new(irg);
655 /* perform peephole optimizations */
656 ir_clear_opcodes_generic_func();
657 register_peephole_optimisation(op_be_IncSP, peephole_be_IncSP);
658 register_peephole_optimisation(op_sparc_FrameAddr, peephole_sparc_FrameAddr);
659 register_peephole_optimisation(op_sparc_RestoreZero,
660 peephole_sparc_RestoreZero);
661 be_peephole_opt(irg);
663 /* perform legalizations (mostly fix nodes with too big immediates) */
664 ir_clear_opcodes_generic_func();
665 register_peephole_optimisation(op_be_IncSP, finish_be_IncSP);
666 register_peephole_optimisation(op_sparc_FrameAddr, finish_sparc_FrameAddr);
667 register_peephole_optimisation(op_sparc_Ld, finish_sparc_Ld);
668 register_peephole_optimisation(op_sparc_Ldf, finish_sparc_Ldf);
669 register_peephole_optimisation(op_sparc_Return, finish_sparc_Return);
670 register_peephole_optimisation(op_sparc_Save, finish_sparc_Save);
671 register_peephole_optimisation(op_sparc_St, finish_sparc_St);
672 register_peephole_optimisation(op_sparc_Stf, finish_sparc_Stf);
673 be_peephole_opt(irg);
675 heights_free(heights);
677 be_remove_dead_nodes_from_schedule(irg);