d0p1/ack - Cute Engineering : Cute solutions to hard problems

d0p1/ack

Fork 0

Commit graph

Author	SHA1	Message	Date
David Given	21034c0d65	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 23:52:54 +02:00
David Given	68f98cbad7	Instruction selection now happens on a shadow tree, rather than on the IR tree itself. Currently it's semantically the same but the implementation is cleaner.	2016-10-03 20:52:36 +02:00
David Given	c079e97492	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 17:50:34 +02:00

Author

SHA1

Message

Date

David Given

21034c0d65

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 23:52:54 +02:00

David Given

68f98cbad7

Instruction selection now happens on a shadow tree, rather than on the IR tree

itself. Currently it's semantically the same but the implementation is cleaner.

2016-10-03 20:52:36 +02:00

David Given

c079e97492

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 17:50:34 +02:00

3 commits