reify
Generate code to create the current continuation, with a nil caller, then L2_RETURN_FROM_REIFICATION_HANDLER – so the calling frames will also get a chance to add their own nil-caller continuations to the current StackReifier. The execution machinery will then assemble the chain of continuations, connecting them to any already reified continuations in the interpreter.
After reification, the interpreter's next activity depends on the flags set in the StackReifier (which was created via code generated prior to this clause). If it was for interrupt processing, the continuation will be stored in the fiber while an interrupt is processed, then most likely resumed at a later time. If it was for getting into a state suitable for creating an L1 label, the top continuation's chunk is resumed immediately, whereupon the continuation will be popped and exploded back into registers, and the actual label will be created from the continuation that was just resumed.
Parameters
A constant type to replace the top-of-stack in the reified continuation. If null, don't replace the top-of-stack.
The kind of ChunkEntryPoint to re-enter at.