Repository navigation
Use loops instead of recursion in the router's bbox tree - #317
Merged
Merged
Conversation
bbox_node.insert(), iterate_point() and iterate_shape() recursed down the tree. Inserting shapes one by one can make the tree very deep, and in large designs (e.g. sky130 macros with 1024 columns) it got deeper than Python's recursion limit, so routing failed with "RecursionError: maximum recursion depth exceeded". Walk the tree with a loop and an explicit stack instead. The tree, and the order in which shapes are found, stay the same.
This was referenced Oct 13, 2026
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
bbox_node.insert(), iterate_point() and iterate_shape() recursed down the tree. Inserting shapes one by one can make the tree very deep, and in large designs (e.g. sky130 macros with 1024 columns) it got deeper than Python's recursion limit, so routing failed with "RecursionError: maximum recursion depth exceeded". Walk the tree with a loop and an explicit stack instead. The tree, and the order in which shapes are found, stay the same.