-
Notifications
You must be signed in to change notification settings - Fork 1.3k
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Minimize stack space required to plan deeply nested binary expressions #4787
Conversation
@@ -343,7 +343,6 @@ async fn tpcds_logical_q63() -> Result<()> { | |||
create_logical_plan(63).await | |||
} | |||
|
|||
#[ignore] // thread 'q64' has overflowed its stack] |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I think these tests will likely still fail due to #4786 but I figured I would let the CI run and see if we can squeek by
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Benchmark runs are scheduled for baseline = f91f623 and contender = bf48122. bf48122 is a master commit associated with this PR. Results will be available as each benchmark for each run completes. |
Which issue does this PR close?
Re #4065 from @andygrove
Rationale for this change
This is a follow on to #4779 which reduced the stack space needed to plan in debug builds. This PR minimizes the stack required as much as I know how.
What changes are included in this PR?
Special case BinaryOp (see comments for explination)
Are these changes tested?
Yes (existing + new tests)
Are there any user-facing changes?
No