ack/mach/proto/mcg/ir.h

#ifndef IR_H
#define IR_H

#include "ircodes.h"

struct ir
{
	int id;
	enum ir_opcode opcode;
	int size;
	struct ir* left;
	struct ir* right;
	union
	{
		arith ivalue;
		int rvalue;
		const char* lvalue;
		struct basicblock* bvalue;
	} u;

	void* state_label; /* used by the iburg instruction selector */
	int insn_no;       /* the table rule number for this instruction */
	ARRAYOF(struct hop) hops; /* only for root IRs */

	bool is_root : 1;
	bool is_generated : 1;
};

extern const char* ir_names[];

extern struct ir* new_ir0(int opcode, int size);
extern struct ir* new_ir1(int opcode, int size,
	struct ir* c1);
extern struct ir* new_ir2(int opcode, int size,
	struct ir* c1, struct ir* c2);

extern struct ir* new_labelir(const char* label);
extern struct ir* new_wordir(arith value);
extern struct ir* new_constir(int size, arith value);
extern struct ir* new_bbir(struct basicblock* bb);
extern struct ir* new_anyir(int size);
extern struct ir* new_localir(int offset);

typedef bool ir_walker_t(struct ir* node, void* user);
extern struct ir* ir_walk(struct ir* ir, ir_walker_t* callback, void* user);
extern struct ir* ir_find(struct ir* ir, int opcode);

extern void ir_print(char k, const struct ir* ir);

#endif
Archival checking of the half-written IR treebuilder. 2016-09-18 21:24:54 +00:00			`#ifndef IR_H`
			`#define IR_H`

Replaced the block splicer with a trivial block eliminator (which rewrites jumps to blocks which contain only a jump). Don't bother storing the bb graph in the ir nodes; we can find it on demand by walking the tree instead --- slower, but much easier to understand and more robust. Added a terrible map library. 2016-09-23 21:59:15 +00:00			`#include "ircodes.h"`

Archival checking of the half-written IR treebuilder. 2016-09-18 21:24:54 +00:00			`struct ir`
			`{`
			`int id;`
Replaced the block splicer with a trivial block eliminator (which rewrites jumps to blocks which contain only a jump). Don't bother storing the bb graph in the ir nodes; we can find it on demand by walking the tree instead --- slower, but much easier to understand and more robust. Added a terrible map library. 2016-09-23 21:59:15 +00:00			`enum ir_opcode opcode;`
Archival checking of the half-written IR treebuilder. 2016-09-18 21:24:54 +00:00			`int size;`
Store the EM code up front and build the basic block graph before generating the IR code. Lots more IR code. 2016-09-19 21:06:59 +00:00			`struct ir* left;`
			`struct ir* right;`
Add a bodged in algorithm for converting basic block communication from stacked variables to SSA. Also add dead block removal and block splicing. IR code is much better now. 2016-09-22 21:19:29 +00:00			`union`
			`{`
Archival checking of the half-written IR treebuilder. 2016-09-18 21:24:54 +00:00			`arith ivalue;`
			`int rvalue;`
			`const char* lvalue;`
			`struct basicblock* bvalue;`
			`} u;`
Some instruction selection is now happening. 2016-09-24 20:46:08 +00:00
			`void* state_label; /* used by the iburg instruction selector */`
Fleshed out hops and vregs. The result is almost looking like code now --- uncanny. 2016-09-26 22:19:45 +00:00			`int insn_no; /* the table rule number for this instruction */`
Much better handling of fragments (no run-time code needed to distinguish them from registers) and better handling of individual hops within a paragraph --- no more ghastly hacks to try and distinguish the input from the output. 2016-09-29 20:06:04 +00:00			`ARRAYOF(struct hop) hops; /* only for root IRs */`
Some instruction selection is now happening. 2016-09-24 20:46:08 +00:00
Much better handling of fragments (no run-time code needed to distinguish them from registers) and better handling of individual hops within a paragraph --- no more ghastly hacks to try and distinguish the input from the output. 2016-09-29 20:06:04 +00:00			`bool is_root : 1;`
Some instruction selection is now happening. 2016-09-24 20:46:08 +00:00			`bool is_generated : 1;`
Archival checking of the half-written IR treebuilder. 2016-09-18 21:24:54 +00:00			`};`

			`extern const char* ir_names[];`

			`extern struct ir* new_ir0(int opcode, int size);`
			`extern struct ir* new_ir1(int opcode, int size,`
			`struct ir* c1);`
			`extern struct ir* new_ir2(int opcode, int size,`
			`struct ir* c1, struct ir* c2);`

			`extern struct ir* new_labelir(const char* label);`
			`extern struct ir* new_wordir(arith value);`
Tracing cleanup. Simplified the IR code. Some more opcodes. 2016-09-21 22:15:48 +00:00			`extern struct ir* new_constir(int size, arith value);`
Archival checking of the half-written IR treebuilder. 2016-09-18 21:24:54 +00:00			`extern struct ir* new_bbir(struct basicblock* bb);`
			`extern struct ir* new_anyir(int size);`
Tracing cleanup. Simplified the IR code. Some more opcodes. 2016-09-21 22:15:48 +00:00			`extern struct ir* new_localir(int offset);`
Archival checking of the half-written IR treebuilder. 2016-09-18 21:24:54 +00:00
Replaced the block splicer with a trivial block eliminator (which rewrites jumps to blocks which contain only a jump). Don't bother storing the bb graph in the ir nodes; we can find it on demand by walking the tree instead --- slower, but much easier to understand and more robust. Added a terrible map library. 2016-09-23 21:59:15 +00:00			`typedef bool ir_walker_t(struct ir* node, void* user);`
			`extern struct ir* ir_walk(struct ir* ir, ir_walker_t* callback, void* user);`
Add a bodged in algorithm for converting basic block communication from stacked variables to SSA. Also add dead block removal and block splicing. IR code is much better now. 2016-09-22 21:19:29 +00:00			`extern struct ir* ir_find(struct ir* ir, int opcode);`

Tracing cleanup. Simplified the IR code. Some more opcodes. 2016-09-21 22:15:48 +00:00			`extern void ir_print(char k, const struct ir* ir);`

Archival checking of the half-written IR treebuilder. 2016-09-18 21:24:54 +00:00			`#endif`