mirror of
https://github.com/python/cpython.git
synced 2025-10-29 12:44:56 +00:00
de2f7da77d
Add free-threaded versions of existing specialization for FOR_ITER (list, tuples, fast range iterators and generators), without significantly affecting their thread-safety. (Iterating over shared lists/tuples/ranges should be fine like before. Reusing iterators between threads is not fine, like before. Sharing generators between threads is a recipe for significant crashes, like before.)
78 lines
2.3 KiB
C
78 lines
2.3 KiB
C
#ifndef Py_INTERNAL_LIST_H
|
|
#define Py_INTERNAL_LIST_H
|
|
#ifdef __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
|
|
#ifndef Py_BUILD_CORE
|
|
# error "this header requires Py_BUILD_CORE define"
|
|
#endif
|
|
|
|
#ifdef Py_GIL_DISABLED
|
|
#include "pycore_stackref.h"
|
|
#endif
|
|
|
|
PyAPI_FUNC(PyObject*) _PyList_Extend(PyListObject *, PyObject *);
|
|
extern void _PyList_DebugMallocStats(FILE *out);
|
|
// _PyList_GetItemRef should be used only when the object is known as a list
|
|
// because it doesn't raise TypeError when the object is not a list, whereas PyList_GetItemRef does.
|
|
extern PyObject* _PyList_GetItemRef(PyListObject *, Py_ssize_t i);
|
|
#ifdef Py_GIL_DISABLED
|
|
// Returns -1 in case of races with other threads.
|
|
extern int _PyList_GetItemRefNoLock(PyListObject *, Py_ssize_t, _PyStackRef *);
|
|
#endif
|
|
|
|
#define _PyList_ITEMS(op) _Py_RVALUE(_PyList_CAST(op)->ob_item)
|
|
|
|
PyAPI_FUNC(int)
|
|
_PyList_AppendTakeRefListResize(PyListObject *self, PyObject *newitem);
|
|
|
|
// In free-threaded build: self should be locked by the caller, if it should be thread-safe.
|
|
static inline int
|
|
_PyList_AppendTakeRef(PyListObject *self, PyObject *newitem)
|
|
{
|
|
assert(self != NULL && newitem != NULL);
|
|
assert(PyList_Check(self));
|
|
Py_ssize_t len = Py_SIZE(self);
|
|
Py_ssize_t allocated = self->allocated;
|
|
assert((size_t)len + 1 < PY_SSIZE_T_MAX);
|
|
if (allocated > len) {
|
|
#ifdef Py_GIL_DISABLED
|
|
_Py_atomic_store_ptr_release(&self->ob_item[len], newitem);
|
|
#else
|
|
PyList_SET_ITEM(self, len, newitem);
|
|
#endif
|
|
Py_SET_SIZE(self, len + 1);
|
|
return 0;
|
|
}
|
|
return _PyList_AppendTakeRefListResize(self, newitem);
|
|
}
|
|
|
|
// Repeat the bytes of a buffer in place
|
|
static inline void
|
|
_Py_memory_repeat(char* dest, Py_ssize_t len_dest, Py_ssize_t len_src)
|
|
{
|
|
assert(len_src > 0);
|
|
Py_ssize_t copied = len_src;
|
|
while (copied < len_dest) {
|
|
Py_ssize_t bytes_to_copy = Py_MIN(copied, len_dest - copied);
|
|
memcpy(dest + copied, dest, (size_t)bytes_to_copy);
|
|
copied += bytes_to_copy;
|
|
}
|
|
}
|
|
|
|
typedef struct {
|
|
PyObject_HEAD
|
|
Py_ssize_t it_index;
|
|
PyListObject *it_seq; /* Set to NULL when iterator is exhausted */
|
|
} _PyListIterObject;
|
|
|
|
union _PyStackRef;
|
|
|
|
PyAPI_FUNC(PyObject *)_PyList_FromStackRefStealOnSuccess(const union _PyStackRef *src, Py_ssize_t n);
|
|
PyAPI_FUNC(PyObject *)_PyList_AsTupleAndClear(PyListObject *v);
|
|
|
|
#ifdef __cplusplus
|
|
}
|
|
#endif
|
|
#endif /* !Py_INTERNAL_LIST_H */
|