Calls across stack chunks perform badly

The Python stack is composed of a series of chunks of memory. These chunks are large, so we cross the boundaries infrequently and assume that it will never be on the fast path.

Unfortunately, it is possible to cross the boundary repeatedly if looping deep in the stack.

We should adjust the stack when crossing the boundary, to avoid doing so repeatedly.

Possible options include:

1. Move the caller to the new chunk, so repeated calls do not cross the boundary.
2. Instead of using a chunked stack, double the size of the stack and copy the old stack.

Both of these assume that we can move the frame. This is only possible if there are no pointers into the frame.
If a frames calls a native function taking an array of arguments, then there will be pointers into the frame.
So if we do any moving, we need to check for these pointers.

While we cannot move the frame, we can copy it, as long as the original remains. This is a bit wasteful, but shouldn't happen too often or waste too much space.

Linked PRs

• gh-145789
• gh-145828
• gh-145829
• gh-146123
• gh-148681
• gh-149097

まず、リンクされている PR gh-145789、gh-145828、gh-145829、gh-146123、gh-148681、gh-149097 を確認してください。この issue にはファイルやテストが用意されていないためです。native calls が frames 内へのポインタを保持している間も正しさを維持しつつ、stack chunks 間の繰り返しの遷移を避けられれば完了です。