Thanks to visit codestin.com
Credit goes to github.com

Skip to content

bpo-38135: Fix depth-first-search computation in compile.c #16042

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

Merged
merged 1 commit into from
Sep 12, 2019

Conversation

markshannon
Copy link
Member

@markshannon markshannon commented Sep 12, 2019

With the current compiler it is impossible to expose the bug in the block ordering computation.
Consequently, there is no observable change in behavior and thus no news item is necessary.

https://bugs.python.org/issue38135

Copy link
Member

@gpshead gpshead left a comment

Choose a reason for hiding this comment

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

At a glance I believe this is correct. Looping Thomas in as a reviewer as I believe he's been working in the compile code recently.

@gpshead gpshead added the sprint label Sep 12, 2019
@Yhg1s
Copy link
Member

Yhg1s commented Sep 12, 2019

I won't say "recently" (I looked at peephole.c the last couple of days, but not compile.c), but I'm familiar enough. The new code does look a lot more sensible than reversing twice.

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

Successfully merging this pull request may close these issues.

5 participants