Make concurrent iteration over pairwise, combinations, permutations, cwr, product, etc. from itertools safe under free-threading
@rhettinger 已經在處理了。
開始於 2024年9月9日。
- 主要語言
- Python
- 星號
- 77.2k
- 分支
- 36k
- PR 合併指標
- PR 指標待擷取
描述
Bug report
Bug description:
Several methods from the C implementation of the itertools module are not yet safe to use under the free-threading build. In this issue we list several issues to be addressed. The issues below are discussed for itertools.product, but the issues are similar for the other classes.
-
When iterating over
productthe result tuple is re-used when the reference count is 1. We can use the new_PyObject_IsUniquelyReferencedmethod to perform the check whether we can re-use the tuple. (this issue was also reported in https://github.com/python/cpython/issues/121464) -
On the first invocation of
producta new result is constructed.
This is not thread-safe, as multiple threads could have result == NULL evaluate to true. We could move the construction of the productobject.result to the constructor of product. This does mean that product will use more memory before the first invocation of next. This seems to be acceptable, as constructing a product without iterating over it seems rare in practice.
The tuple also needs to be filled with data. For product it seems safe to do this in the constructor, as the data is coming
from productobject->pools which is a tuple of tuples. But for pairwise the data is coming from an iterable
which could be a generator. Reading data from the iterator before the first invocation of pairwise_next seems like a behavior change we do not want to make.
An alternative is to use some kind of locking inside product_next, but the locking should not add any overhead in the common path otherwise the single-thread performance will suffer.
- In case iterables are exhausted some cleaning up is done. For example in
pairwise_nextat
This cleaning up is not safe in concurrent iteration. Instead we can defer the cleaning up untill the object itself is decallocated (this approach was used for reversed, see https://github.com/python/cpython/pull/120971/files#r1653313765)
- Actually constructing the new result requires some care as well. Even if we are fine with having funny results under concurrent iteration (see the discussion https://github.com/python/cpython/issues/120496), the concurrent iteration should not corrupt the interpreter. For example this code is not safe:
If two threads both increment indices[i] the check on line 2078 is never true end we end up indexing pool with PyTuple_GET_ITEM outside the bounds on line 2088. Here we could change the check into indices[i] >= PyTuple_GET_SIZE(pool). That is equivalent for the single-threaded case, but does not lead to out-of-bounds indexing in the multi-threaded case (although it does lead to funny results!)
@rhettinger @colesbury Any input on the points above would be welcome.
CPython versions tested on:
CPython main branch
Operating systems tested on:
No response
Linked PRs
- gh-123848
- gh-125417
- gh-129416
- gh-131212
- gh-131247
- gh-132814
- gh-135689
- gh-144402
- gh-144486
- gh-144489
- gh-144528
- gh-146021
- gh-146033
- gh-148348
- gh-153791
貢獻指南
從這裡開始
- 先讀完整個 Issue,再讀專案的貢獻指南。
- 在 Issue 下留言說明你要接手 —— 這能避免兩個人做同樣的事。
- Fork 儲存庫,在一個分支上完成修改。
- 送出 Pull Request,並在描述裡引用這個 Issue 編號。
評估
這個 Issue 還沒有評估資料。