Hacker News new | ask | show | jobs
by pcwalton 2826 days ago
Stack growth should work in 1:1 just as it does in M:N. If the size were a hard constraint then Go couldn't get around it either.
1 comments

That doesn’t appear to be true. The thing doing scheduling has to cooperate with the thing doing stack management, so that context can be switched.

What are those two things, in your proposition that we can simply use Linux threads?

The kernel has to restore registers, including the stack pointer, on a context switch. But it doesn't care about how big the allocation underpinning that stack is.