Skip to content
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

Mock default enabling recursive planning for identifying compatibility issues. #670

Open
wants to merge 1 commit into
base: master
Choose a base branch
from

Conversation

copybara-service[bot]
Copy link

Mock default enabling recursive planning for identifying compatibility issues.

Do not merge.

@copybara-service copybara-service bot force-pushed the test_623213699 branch 7 times, most recently from 22a299d to 38e0a1c Compare April 15, 2024 19:18
…y issues.

Do not merge.

PiperOrigin-RevId: 623213699
@@ -991,6 +1404,18 @@ class FlatExprVisitor : public cel::ast_internal::AstVisitor {
}
}

void SetRecursiveStep(std::unique_ptr<DirectExpressionStep> step, int depth) {
if (!progress_status_.ok() || PlanningSuppressed()) {
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

What happens if planning is suppressed and this call is encountered. I would think that normally we wouldn't get here.

Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

It would just ignore the recursive step argument (so it just gets freed when the caller returns). The program builder will still build up the ast structure, but it won't have any program steps associated with it.

This is only really applies for bind expressions -- we still traverse the iter_range and condition subexpressions, but just ignore any of the program steps that the visitor emits.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants