feat(frontend): fearless recursion on deep plans

[BugenZhao]

Signed-off-by: Bugen Zhao [email protected]I hereby agree to the terms of the RisingWave Labs, Inc. Contributor License Agreement.

What's changed and what's your intention?

Use stacker to dynamically grow the stack for deep recursion. Check the documentation on the source code for the usage.

Considering that growing the stack may lead to performance overhead, and we may fail to wrap all recursion when handling a deep plan. We warn to users if we find the recursion too deep in to_stream_prost or to_batch_prost.

Hide the whitespaces for better review experience.

Resolve #15916.

dev=> CREATE MATERIALIZED VIEW ..

- stack overflow
+ NOTICE: The plan is too deep. Consider simplifying or splitting the query if you encounter any issues.
+ CREATE_MATERIALIZED_VIEW

Checklist

• I have written necessary rustdoc comments
• I have added necessary unit tests and integration tests
• All checks passed in ./risedev check (or alias, ./risedev c)

Documentation

• My PR needs documentation updates. (Please use the Release note section below to summarize the impact on users)

Release note

If this PR includes changes that directly affect users or other significant modifications relevant to the community, kindly draft a release note to provide a concise summary of these changes. Please prioritize highlighting the impact these changes will have on users.

Signed-off-by: Bugen Zhao

[chenzl25]

Looks very cool! A common case of stack overflow is Lots of Unions, e.g. select 1 union all select 1 ..... union all select, Could you please test against it whether this PR could help?

[BugenZhao]

A common case of stack overflow is Lots of Unions, e.g. select 1 union all select 1 ..... union all select, Could you please test against it whether this PR could help?

Unfortunately not. 😕 I guess the most heaviest part of this query resides in other steps (like parsing or optimization), which are not covered in this PR. We have to find them out and wrap them with recurse in a progressive manner.

[BugenZhao]

We have to find them out and wrap them with recurse in a progressive manner.

Will do this in following PRs.

[chenzl25]

LGTM!

[stdrc]

LGTM, Ancient Greek God of Recursion!

[TennyZhuang]

LGTM.

BTW, IIRC in TiKV, the recursion limit of plan always exceeded when encode/decode from/to protobuf. To resolve that, they use reverse polish notation in the plan proto definitions.