bpo-38328: Speed up the creation time of constant list literals. #16498
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.
This PR contains a small change to the peephole optimizer that converts sequences of:
LOAD_CONST(a),LOAD_CONST(b), ...,BUILD_LIST(n)to
LOAD_CONST((a, b, ...)),BUILD_LIST_UNPACK(1)The improvement quickly becomes significant for lists larger than a few items:
This can be tested on any version of Python by comparing the performance of
[0, 1, 2, ...]vs[*(0, 1, 2, ...)]. The common cases of empty and single-element lists are not affected by this change.This is related to bpo-33325, but that was an invasive change for all collection literals that had an unknown affect on performance. I've limited this one to lists and kept it to a few lines in the peephole optimizer.
https://bugs.python.org/issue38328