ack/mach/proto/mcg/basicblock.h

#ifndef BASICBLOCK_H
#define BASICBLOCK_H

struct basicblock
{
    const char* name;
    ARRAYOF(struct em) ems;
    ARRAYOF(struct ir) irs;
    ARRAYOF(struct hop) hops;

    ARRAYOF(struct basicblock) prevs;
    ARRAYOF(struct basicblock) nexts;
    int order; /* used by dominance graph code */

	ARRAYOF(struct vreg) liveins;

    bool is_fake : 1;
    bool is_root : 1;
    bool is_terminated : 1;
};

extern void bb_init(void);
extern struct basicblock* bb_get(const char* name);
extern void bb_alias(struct basicblock* block, const char* name);

#endif

/* vim: set sw=4 ts=4 expandtab : */
Perform SSA conversion of locals. Much, much better code now, at least 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). 2016-10-02 15:50:34 +00:00			`#ifndef BASICBLOCK_H`
			`#define BASICBLOCK_H`

			`struct basicblock`
			`{`
			`const char* name;`
			`ARRAYOF(struct em) ems;`
			`ARRAYOF(struct ir) irs;`
			`ARRAYOF(struct hop) hops;`

			`ARRAYOF(struct basicblock) prevs;`
			`ARRAYOF(struct basicblock) nexts;`
No, dammit, for register allocation I need to walk the blocks in dominance order. Since the dominance tree has changed when I fiddled with the graph, I need to recompute it, so factor it out of the SSA pass. Code is uglier than I'd like but at least the RET statement goes last in the generated code now. 2016-10-05 21:52:54 +00:00			`int order; /* used by dominance graph code */`
Perform SSA conversion of locals. Much, much better code now, at least 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). 2016-10-02 15:50:34 +00:00
Bodge in enough phi support to let the instruction generator complete on basic programs. 2016-10-04 19:58:31 +00:00			`ARRAYOF(struct vreg) liveins;`

Perform SSA conversion of locals. Much, much better code now, at least 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). 2016-10-02 15:50:34 +00:00			`bool is_fake : 1;`
			`bool is_root : 1;`
			`bool is_terminated : 1;`
			`};`

			`extern void bb_init(void);`
			`extern struct basicblock* bb_get(const char* name);`
			`extern void bb_alias(struct basicblock* block, const char* name);`

			`#endif`

Made sure that all files end in vim magic. 2016-10-05 19:07:29 +00:00			`/* vim: set sw=4 ts=4 expandtab : */`