ack/mach/proto/mcg/pass_phigroups.c

#include "mcg.h"

static PMAPOF(struct vreg, struct vreg) phimap;

static void make_phimap(void)
{
	int i, j;

	phimap.count = 0;
	for (i=0; i<cfg.preorder.count; i++)
	{
		struct basicblock* bb = cfg.preorder.item[i];
		
		for (j=0; j<bb->phis.count; j++)
		{
			struct vreg* vreg = bb->phis.item[j].left;
			struct phi* phi = bb->phis.item[j].right;
			struct vreg* prevvreg = phi->ir->result;

			pmap_add(&phimap, vreg, prevvreg);
		}
	}
}

static void recursively_associate_group(struct phicongruence* c, struct vreg* vreg)
{
	int i;

	vreg->congruence = c;
	array_appendu(&c->vregs, vreg);
    tracef('V', "V: %%%d is a member of congruence group %d\n",
        vreg->id, c->id);

    if (vreg->defined)
    {
        struct constraint* constraint = pmap_findleft(&vreg->defined->constraints, vreg);
        if (c->type == 0)
            c->type = vreg->type;
        assert(c->type == vreg->type);

        array_appendu(&c->definitions, vreg->defined);
    }

	for (;;)
	{
		struct vreg* child = pmap_findleft(&phimap, vreg);
        if (!child)
            break;

        pmap_remove(&phimap, vreg, child);
        recursively_associate_group(c, child);
    }
		
    for (;;)
    {
		struct vreg* child = pmap_findright(&phimap, vreg);
		if (!child)
            break;

        pmap_remove(&phimap, child, vreg);
        recursively_associate_group(c, child);
	}
}

static void associate_groups(void)
{
    static int number = 0;

	while (phimap.count > 0)
	{
		struct phicongruence* c = calloc(1, sizeof(*c));
        c->id = number++;
		recursively_associate_group(c, phimap.item[0].left);
	}
}

void pass_find_phi_congruence_groups(void)
{
	make_phimap();
	associate_groups();
}

/* vim: set sw=4 ts=4 expandtab : */