2020-06-22 12:27:35 -03:00
|
|
|
#ifndef Py_INTERNAL_TUPLE_H
|
|
|
|
#define Py_INTERNAL_TUPLE_H
|
2018-11-25 18:56:17 -04:00
|
|
|
#ifdef __cplusplus
|
|
|
|
extern "C" {
|
|
|
|
#endif
|
|
|
|
|
2019-04-17 18:02:26 -03:00
|
|
|
#ifndef Py_BUILD_CORE
|
|
|
|
# error "this header requires Py_BUILD_CORE define"
|
2018-11-25 18:56:17 -04:00
|
|
|
#endif
|
|
|
|
|
2023-07-23 16:16:21 -03:00
|
|
|
extern void _PyTuple_MaybeUntrack(PyObject *);
|
|
|
|
extern void _PyTuple_DebugMallocStats(FILE *out);
|
2021-12-09 15:59:26 -04:00
|
|
|
|
|
|
|
/* runtime lifecycle */
|
|
|
|
|
|
|
|
extern PyStatus _PyTuple_InitGlobalObjects(PyInterpreterState *);
|
|
|
|
extern void _PyTuple_Fini(PyInterpreterState *);
|
|
|
|
|
|
|
|
|
|
|
|
/* other API */
|
|
|
|
|
2022-02-28 18:15:48 -04:00
|
|
|
// PyTuple_MAXSAVESIZE - largest tuple to save on free list
|
|
|
|
// PyTuple_MAXFREELIST - maximum number of tuples of each size to save
|
2021-12-09 15:59:26 -04:00
|
|
|
|
2022-02-28 18:15:48 -04:00
|
|
|
#if defined(PyTuple_MAXSAVESIZE) && PyTuple_MAXSAVESIZE <= 0
|
|
|
|
// A build indicated that tuple freelists should not be used.
|
|
|
|
# define PyTuple_NFREELISTS 0
|
|
|
|
# undef PyTuple_MAXSAVESIZE
|
|
|
|
# undef PyTuple_MAXFREELIST
|
|
|
|
|
|
|
|
#elif !defined(WITH_FREELISTS)
|
|
|
|
# define PyTuple_NFREELISTS 0
|
|
|
|
# undef PyTuple_MAXSAVESIZE
|
|
|
|
# undef PyTuple_MAXFREELIST
|
|
|
|
|
|
|
|
#else
|
|
|
|
// We are using a freelist for tuples.
|
|
|
|
# ifndef PyTuple_MAXSAVESIZE
|
|
|
|
# define PyTuple_MAXSAVESIZE 20
|
|
|
|
# endif
|
|
|
|
# define PyTuple_NFREELISTS PyTuple_MAXSAVESIZE
|
|
|
|
# ifndef PyTuple_MAXFREELIST
|
|
|
|
# define PyTuple_MAXFREELIST 2000
|
|
|
|
# endif
|
2021-12-09 15:59:26 -04:00
|
|
|
#endif
|
|
|
|
|
|
|
|
struct _Py_tuple_state {
|
2022-02-28 18:15:48 -04:00
|
|
|
#if PyTuple_NFREELISTS > 0
|
|
|
|
/* There is one freelist for each size from 1 to PyTuple_MAXSAVESIZE.
|
|
|
|
The empty tuple is handled separately.
|
|
|
|
|
|
|
|
Each tuple stored in the array is the head of the linked list
|
|
|
|
(and the next available tuple) for that size. The actual tuple
|
|
|
|
object is used as the linked list node, with its first item
|
|
|
|
(ob_item[0]) pointing to the next node (i.e. the previous head).
|
|
|
|
Each linked list is initially NULL. */
|
|
|
|
PyTupleObject *free_list[PyTuple_NFREELISTS];
|
|
|
|
int numfree[PyTuple_NFREELISTS];
|
|
|
|
#else
|
|
|
|
char _unused; // Empty structs are not allowed.
|
2021-12-09 15:59:26 -04:00
|
|
|
#endif
|
|
|
|
};
|
|
|
|
|
2022-11-28 12:42:22 -04:00
|
|
|
#define _PyTuple_ITEMS(op) _Py_RVALUE(_PyTuple_CAST(op)->ob_item)
|
2020-06-22 12:27:35 -03:00
|
|
|
|
2021-05-25 10:58:14 -03:00
|
|
|
extern PyObject *_PyTuple_FromArray(PyObject *const *, Py_ssize_t);
|
2021-10-09 12:51:30 -03:00
|
|
|
extern PyObject *_PyTuple_FromArraySteal(PyObject *const *, Py_ssize_t);
|
2018-11-25 18:56:17 -04:00
|
|
|
|
2022-12-09 06:27:01 -04:00
|
|
|
|
|
|
|
typedef struct {
|
|
|
|
PyObject_HEAD
|
|
|
|
Py_ssize_t it_index;
|
|
|
|
PyTupleObject *it_seq; /* Set to NULL when iterator is exhausted */
|
|
|
|
} _PyTupleIterObject;
|
|
|
|
|
2018-11-25 18:56:17 -04:00
|
|
|
#ifdef __cplusplus
|
|
|
|
}
|
|
|
|
#endif
|
2020-06-22 12:27:35 -03:00
|
|
|
#endif /* !Py_INTERNAL_TUPLE_H */
|