-
-
Notifications
You must be signed in to change notification settings - Fork 2.8k
fixtures: fix catastrophic performance problem in reorder_items
#12409
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
This makes some minor clarity and performance improvements to the code.
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.
LGTM, thanks for taking the time to look into this!
changelog/12355.bugfix.rst
Outdated
@@ -0,0 +1 @@ | |||
Fix possible catasrophic performance slowdown on a certain parametrization pattern involving many higher-scoped parameters. |
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.
Fix possible catasrophic performance slowdown on a certain parametrization pattern involving many higher-scoped parameters. | |
Fix possible catastrophic performance slowdown on a certain parametrization pattern involving many higher-scoped parameters. |
Fix pytest-dev#12355. In the issue, it was reported that the `reorder_items` has quadratic (or worse...) behavior with certain simple parametrizations. After some debugging I found that the problem happens because the "Fix items_by_argkey order" loop keeps adding the same item to the deque, and it reaches epic sizes which causes the slowdown. I don't claim to understand how the `reorder_items` algorithm works, but if as far as I understand, if an item already exists in the deque, the correct thing to do is to move it to the front. Since a deque doesn't have such an (efficient) operation, this switches to `OrderedDict` which can efficiently append from both sides, deduplicate and move to front.
7a230b0
to
e89d23b
Compare
other_scoped_items_by_argkey = items_by_argkey[other_scope] | ||
for argkey in argkeys_by_item[other_scope].get(i, ()): | ||
other_scoped_items_by_argkey[argkey][i] = None | ||
other_scoped_items_by_argkey[argkey].move_to_end( |
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.
@bluetech I've hit some corner case on PyPy where move_to_end()
seems to be raising a KeyError
and crashing the item collection entirely...
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.
Oh, nevermind. This is a regression of v8.2.2 and this PR only hit release in v8.3.0.
Nope, it was backported into 8.2.2: #13312
This patch temporarily restricts pytest version below 8.2.2 under PyPy due to a discovered regression that it introduced [[1]]. The regression has been observed on at least `pypy3.9-7.3.16`, `pypy3.10-7.3.19` and `pypy3.11-7.3.19`. It can be triggered by running the following in affected runtimes: pytest --collect-only --no-cov tests/test_abc.py tests/test_copy.py tests/test_incorrect_args.py tests/test_multidict.py tests/test_mypy.py tests/test_pickle.py tests/test_types.py tests/test_update.py tests/test_version.py [1]: pytest-dev/pytest#13312 [2]: pytest-dev/pytest#12414 [3]: pytest-dev/pytest#12409
First commit is a cleanup commit (no functional changes intended).
The second commit fixes #12355.
In the issue, it was reported that the
reorder_items
has quadratic (or worse...) behavior with certain simple parametrizations. After some debugging I found that the problem happens because the "Fix items_by_argkey order" loop keeps adding the same item to the deque, and it reaches epic sizes which causes the slowdown.I don't claim to understand how the
reorder_items
algorithm works, but if as far as I understand, if an item already exists in the deque, the correct thing to do is to move it to the front. Since a deque doesn't have such an (efficient) operation, this switches toOrderedDict
which can efficiently append from both sides, deduplicate and move to front.