ack/mach/proto/mcg/hop.c
David Given 4572f1b774 Actually, I don't need vregs: hops work just as well. Particularly if I
restructure things so that I don't need to walk the blasted ir / burg tree
every time I look at an instruction.
2016-09-27 23:38:47 +02:00

105 lines
1.8 KiB
C

#include "mcg.h"
static int hop_count = 1;
static struct hop* current_hop;
static const struct burm_emitter_data emitter_data;
struct hop* new_hop(int insn_no, struct ir* ir)
{
struct hop* hop = calloc(1, sizeof *hop);
hop->id = hop_count++;
hop->insn_no = insn_no;
hop->ir = ir;
return hop;
}
static struct insel* new_insel(enum insel_type type)
{
struct insel* insel = calloc(1, sizeof(*insel));
insel->type = type;
return insel;
}
void hop_add_string_insel(struct hop* hop, const char* string)
{
struct insel* insel = new_insel(INSEL_STRING);
insel->u.string = string;
array_append(&hop->insels, insel);
}
void hop_add_reg_insel(struct hop* hop, struct hop* reg)
{
struct insel* insel = new_insel(INSEL_REG);
insel->u.reg = reg;
array_append(&hop->insels, insel);
}
void hop_add_value_insel(struct hop* hop, struct ir* ir)
{
struct insel* insel = new_insel(INSEL_VALUE);
insel->u.value = ir;
array_append(&hop->insels, insel);
}
void hop_add_eoi_insel(struct hop* hop)
{
struct insel* insel = new_insel(INSEL_EOI);
array_append(&hop->insels, insel);
}
void hop_print(char k, struct hop* hop)
{
int i;
bool soi = true;
i = 0;
for (i=0; i<hop->insels.count; i++)
{
struct insel* insel = hop->insels.item[i];
if (soi)
{
tracef(k, "%c: %d: ", k, hop->id);
soi = false;
}
switch (insel->type)
{
case INSEL_EOI:
tracef(k, "\n");
soi = true;
break;
case INSEL_REG:
tracef(k, "%%%d", insel->u.reg->id);
break;
case INSEL_STRING:
tracef(k, "%s", insel->u.string);
break;
case INSEL_VALUE:
{
struct ir* ir = insel->u.value;
switch (ir->opcode)
{
case IR_BLOCK:
tracef(k, "%s", ir->u.bvalue->name);
break;
case IR_LOCAL:
case IR_CONST:
tracef(k, "0x%d", ir->u.ivalue);
break;
}
break;
}
}
}
if (!soi)
tracef(k, "\n", k);
}