-
Couldn't load subscription status.
- Fork 3
Fix: Avoid infinite loop when merging siblings #282
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
Conversation
The logic for merging sibling fetch steps was missing a check to prevent cycles in the fetch graph, leading to infinite loops. This commit adds a check to ensure that two steps are not ancestors/descendants of each other before merging them.
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.
Summary of Changes
Hello @kamilkisiela, I'm Gemini Code Assist1! I'm currently reviewing this pull request and will post my feedback shortly. In the meantime, here's a summary to help you and other reviewers quickly get up to speed!
This pull request delivers a critical fix to the query planner by addressing an infinite loop bug that arose during the merging of sibling fetch steps. The core of the solution involves enhancing the merge logic to detect and prevent cyclical dependencies in the fetch graph, ensuring the stability and correctness of query plan generation. The changes are accompanied by a new, targeted test case to validate the fix.
Highlights
- Cycle Prevention: Implemented a new check within the
can_merge_withlogic for fetch steps. Merges are now prevented if the two steps are found to be ancestors or descendants of each other, thereby avoiding the creation of problematic cycles. - New Utility Function: Added a new public method,
is_ancestor_or_descendant, to theFetchGraphstruct. This function efficiently determines if a given pair of nodes in the graph has an ancestor-descendant relationship, which is crucial for the cycle prevention logic. - Test Coverage: Introduced a new test case,
issue_281_test, along with a dedicated supergraph fixture (281.supergraph.graphql). This test specifically targets the scenario that previously led to the infinite loop, ensuring the fix is effective and prevents future regressions.
Using Gemini Code Assist
The full guide for Gemini Code Assist can be found on our documentation page, here are some quick tips.
Invoking Gemini
You can request assistance from Gemini at any point in your pull request via creating an issue comment (i.e. comment on the pull request page) using either /gemini <command> or @gemini-code-assist <command>. Below is a summary of the supported commands.
| Feature | Command | Description |
|---|---|---|
| Code Review | /gemini review |
Performs a code review for the current pull request in its current state. |
| Pull Request Summary | /gemini summary |
Provides a summary of the current pull request in its current state. |
| Comment | @gemini-code-assist | Responds in comments when explicitly tagged, both in issue comments and review comments. |
| Help | /gemini help |
Displays a list of available commands. |
Customization
To customize Gemini Code Assist for GitHub experience, repository maintainers can create a configuration file and/or provide a custom code review style guide (such as PEP-8 for Python) by creating and adding files to a .gemini/ folder in the base of the repository. Detailed instructions can be found here.
Limitations & Feedback
Gemini Code Assist is currently in preview and may make mistakes. Please leave feedback on any instances where its feedback is incorrect or counter productive. You can react with 👍 and 👎 on @gemini-code-assist comments to provide feedback.
You can also get AI-powered code generation, chat, as well as code reviews directly in the IDE at no cost with the Gemini Code Assist IDE Extension.
Footnotes
-
Review the Privacy Notices, Generative AI Prohibited Use Policy, Terms of Service, and learn how to configure Gemini Code Assist in GitHub here. Gemini can make mistakes, so double check it and use code with caution. ↩
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.
Code Review
This pull request effectively fixes a potential infinite loop during the sibling merge optimization in the query planner. The approach of checking for an ancestor-descendant relationship before merging is sound and directly addresses the root cause of the issue. The addition of a dedicated test case and GraphQL fixture ensures this scenario is covered against regressions. The changes are clear and well-implemented.
|
✅
|
The logic for merging sibling fetch steps was missing a check to prevent cycles in the fetch graph, leading to infinite loops. This commit adds a check to ensure that two steps are not ancestors/descendants of each other before merging them.
Closes #281