c079e97492
inasmuch as it looks better before register allocation. Basic blocks now know their own successors and predecessors (after a certain point in the IR processing).
94 lines
2 KiB
C
94 lines
2 KiB
C
#include "mcg.h"
|
|
|
|
static void print_blocks(char k, struct procedure* proc)
|
|
{
|
|
int i;
|
|
|
|
tracef(k, "%c: procedure %s\n", k, proc->name);
|
|
for (int i=0; i<proc->blocks.count; i++)
|
|
{
|
|
struct basicblock* bb = proc->blocks.item[i];
|
|
int j;
|
|
|
|
tracef(k, "%c:\n", k);
|
|
tracef(k, "%c: %sBLOCK: %s\n", k,
|
|
bb->is_fake ? "FAKE " : "",
|
|
bb->name);
|
|
|
|
for (int j=0; j<bb->irs.count; j++)
|
|
ir_print(k, bb->irs.item[j]);
|
|
}
|
|
}
|
|
|
|
void procedure_compile(struct procedure* proc)
|
|
{
|
|
int i;
|
|
|
|
print_blocks('1', proc);
|
|
|
|
pass_group_irs(proc);
|
|
/* Passes from here on must preserve IR grouping */
|
|
|
|
pass_eliminate_trivial_blocks(proc);
|
|
pass_remove_dead_blocks(proc);
|
|
|
|
procedure_update_bb_graph(proc);
|
|
/* Passes from here on can't alter the BB graph */
|
|
|
|
print_blocks('2', proc);
|
|
pass_convert_stack_ops(proc);
|
|
print_blocks('3', proc);
|
|
pass_convert_locals_to_ssa(proc);
|
|
print_blocks('4', proc);
|
|
pass_promote_float_ops(proc);
|
|
print_blocks('5', proc);
|
|
|
|
|
|
pass_instruction_selector(proc);
|
|
}
|
|
|
|
static bool collect_outputs_cb(struct ir* ir, void* user)
|
|
{
|
|
struct basicblock* caller = user;
|
|
|
|
if (ir->opcode == IR_BLOCK)
|
|
{
|
|
array_appendu(&caller->nexts, ir->u.bvalue);
|
|
array_appendu(&ir->u.bvalue->prevs, caller);
|
|
}
|
|
return false;
|
|
}
|
|
|
|
void procedure_update_bb_graph(struct procedure* proc)
|
|
{
|
|
int i, j;
|
|
|
|
for (i=0; i<proc->blocks.count; i++)
|
|
{
|
|
struct basicblock* bb = proc->blocks.item[i];
|
|
bb->prevs.count = bb->nexts.count = 0;
|
|
}
|
|
|
|
for (i=0; i<proc->blocks.count; i++)
|
|
{
|
|
struct basicblock* bb = proc->blocks.item[i];
|
|
for (j=0; j<bb->irs.count; j++)
|
|
ir_walk(bb->irs.item[j], collect_outputs_cb, bb);
|
|
}
|
|
|
|
for (i=0; i<proc->blocks.count; i++)
|
|
{
|
|
struct basicblock* bb = proc->blocks.item[i];
|
|
|
|
for (j=0; j<bb->nexts.count; j++)
|
|
{
|
|
tracef('G', "G: graph %s -> %s\n",
|
|
bb->name,
|
|
bb->nexts.item[j]->name);
|
|
}
|
|
}
|
|
}
|
|
|
|
/* vim: set sw=4 ts=4 expandtab : */
|
|
|