Noah Lavine <noah.b.lav...@gmail.com> writes:
>>> The register based VMs I've seen ignore this issue by allowing for an
>>> infinite set of registers. :)
>>
>> Indeed, that's the plan :) The first shot at an allocator will look a
>> lot like the one in (language tree-il analyze).
>
> That was a bit surprising to me. Do you mean that the register pool
> will grow and shrink for each function call? Is that why the stack
> frames can be fixed-size?
It's surprising to me for another reason: in order to make the
instructions reasonably compact, only a limited number of bits are
available in each instruction to specify which registers to use.
Mark
