X7ROOT File Manager
Current Path:
/opt/alt/python313/include/python3.13/internal
opt
/
alt
/
python313
/
include
/
python3.13
/
internal
/
ðŸ“
..
ðŸ“
mimalloc
📄
pycore_abstract.h
(1.87 KB)
📄
pycore_asdl.h
(2.96 KB)
📄
pycore_ast.h
(30.78 KB)
📄
pycore_ast_state.h
(6.62 KB)
📄
pycore_atexit.h
(1.4 KB)
📄
pycore_backoff.h
(3.81 KB)
📄
pycore_bitutils.h
(5.88 KB)
📄
pycore_blocks_output_buffer.h
(8.57 KB)
📄
pycore_brc.h
(2.05 KB)
📄
pycore_bytes_methods.h
(3.84 KB)
📄
pycore_bytesobject.h
(4.75 KB)
📄
pycore_call.h
(5.99 KB)
📄
pycore_capsule.h
(397 B)
📄
pycore_cell.h
(1.03 KB)
📄
pycore_ceval.h
(10.9 KB)
📄
pycore_ceval_state.h
(3.83 KB)
📄
pycore_code.h
(19.4 KB)
📄
pycore_codecs.h
(2.41 KB)
📄
pycore_compile.h
(3.66 KB)
📄
pycore_complexobject.h
(588 B)
📄
pycore_condvar.h
(2.64 KB)
📄
pycore_context.h
(1.15 KB)
📄
pycore_critical_section.h
(7.78 KB)
📄
pycore_crossinterp.h
(11.84 KB)
📄
pycore_descrobject.h
(543 B)
📄
pycore_dict.h
(11.98 KB)
📄
pycore_dict_state.h
(732 B)
📄
pycore_dtoa.h
(1.69 KB)
📄
pycore_emscripten_signal.h
(685 B)
📄
pycore_emscripten_trampoline.h
(3.11 KB)
📄
pycore_exceptions.h
(900 B)
📄
pycore_faulthandler.h
(2.19 KB)
📄
pycore_fileutils.h
(9.25 KB)
📄
pycore_fileutils_windows.h
(2.65 KB)
📄
pycore_floatobject.h
(1.46 KB)
📄
pycore_flowgraph.h
(1.45 KB)
📄
pycore_format.h
(480 B)
📄
pycore_frame.h
(10.62 KB)
📄
pycore_freelist.h
(4.7 KB)
📄
pycore_function.h
(1.5 KB)
📄
pycore_gc.h
(12.66 KB)
📄
pycore_genobject.h
(859 B)
📄
pycore_getopt.h
(490 B)
📄
pycore_gil.h
(2.14 KB)
📄
pycore_global_objects.h
(3.02 KB)
📄
pycore_global_objects_fini_generated.h
(115.04 KB)
📄
pycore_global_strings.h
(26.08 KB)
📄
pycore_hamt.h
(3.65 KB)
📄
pycore_hashtable.h
(4.26 KB)
📄
pycore_identifier.h
(515 B)
📄
pycore_import.h
(7.55 KB)
📄
pycore_importdl.h
(3.96 KB)
📄
pycore_initconfig.h
(6.23 KB)
📄
pycore_instruction_sequence.h
(2.11 KB)
📄
pycore_instruments.h
(2.28 KB)
📄
pycore_interp.h
(14.71 KB)
📄
pycore_intrinsics.h
(1.71 KB)
📄
pycore_jit.h
(527 B)
📄
pycore_list.h
(1.82 KB)
📄
pycore_llist.h
(2.36 KB)
📄
pycore_lock.h
(8.34 KB)
📄
pycore_long.h
(9.73 KB)
📄
pycore_memoryobject.h
(427 B)
📄
pycore_mimalloc.h
(1.6 KB)
📄
pycore_modsupport.h
(3.27 KB)
📄
pycore_moduleobject.h
(1.54 KB)
📄
pycore_namespace.h
(435 B)
📄
pycore_object.h
(26.64 KB)
📄
pycore_object_alloc.h
(2.13 KB)
📄
pycore_object_stack.h
(2.33 KB)
📄
pycore_object_state.h
(942 B)
📄
pycore_obmalloc.h
(26.78 KB)
📄
pycore_obmalloc_init.h
(1.89 KB)
📄
pycore_opcode_metadata.h
(82.74 KB)
📄
pycore_opcode_utils.h
(2.07 KB)
📄
pycore_optimizer.h
(8.11 KB)
📄
pycore_parking_lot.h
(3.27 KB)
📄
pycore_parser.h
(2.04 KB)
📄
pycore_pathconfig.h
(658 B)
📄
pycore_pyarena.h
(2.79 KB)
📄
pycore_pyatomic_ft_wrappers.h
(7.87 KB)
📄
pycore_pybuffer.h
(510 B)
📄
pycore_pyerrors.h
(4.84 KB)
📄
pycore_pyhash.h
(2.75 KB)
📄
pycore_pylifecycle.h
(4.36 KB)
📄
pycore_pymath.h
(8.4 KB)
📄
pycore_pymem.h
(4.37 KB)
📄
pycore_pymem_init.h
(3.44 KB)
📄
pycore_pystate.h
(9.73 KB)
📄
pycore_pystats.h
(420 B)
📄
pycore_pythonrun.h
(758 B)
📄
pycore_pythread.h
(5.3 KB)
📄
pycore_qsbr.h
(4.81 KB)
📄
pycore_range.h
(346 B)
📄
pycore_runtime.h
(12.84 KB)
📄
pycore_runtime_init.h
(12.74 KB)
📄
pycore_runtime_init_generated.h
(45.72 KB)
📄
pycore_semaphore.h
(1.69 KB)
📄
pycore_setobject.h
(951 B)
📄
pycore_signal.h
(2.86 KB)
📄
pycore_sliceobject.h
(369 B)
📄
pycore_stackref.h
(5.06 KB)
📄
pycore_strhex.h
(1013 B)
📄
pycore_structseq.h
(963 B)
📄
pycore_symtable.h
(8.47 KB)
📄
pycore_sysmodule.h
(1.15 KB)
📄
pycore_time.h
(11.52 KB)
📄
pycore_token.h
(2.93 KB)
📄
pycore_traceback.h
(3.54 KB)
📄
pycore_tracemalloc.h
(4.43 KB)
📄
pycore_tstate.h
(1.32 KB)
📄
pycore_tuple.h
(820 B)
📄
pycore_typeobject.h
(8.67 KB)
📄
pycore_typevarobject.h
(924 B)
📄
pycore_ucnhash.h
(958 B)
📄
pycore_unicodeobject.h
(12.15 KB)
📄
pycore_unicodeobject_generated.h
(129.04 KB)
📄
pycore_unionobject.h
(742 B)
📄
pycore_uop_ids.h
(10.03 KB)
📄
pycore_uop_metadata.h
(38.54 KB)
📄
pycore_warnings.h
(840 B)
📄
pycore_weakref.h
(3.25 KB)
Editing: pycore_dict.h
#ifndef Py_INTERNAL_DICT_H #define Py_INTERNAL_DICT_H #ifdef __cplusplus extern "C" { #endif #ifndef Py_BUILD_CORE # error "this header requires Py_BUILD_CORE define" #endif #include "pycore_freelist.h" // _PyFreeListState #include "pycore_identifier.h" // _Py_Identifier #include "pycore_object.h" // PyManagedDictPointer #include "pycore_pyatomic_ft_wrappers.h" // FT_ATOMIC_LOAD_SSIZE_ACQUIRE // Unsafe flavor of PyDict_GetItemWithError(): no error checking extern PyObject* _PyDict_GetItemWithError(PyObject *dp, PyObject *key); // Delete an item from a dict if a predicate is true // Returns -1 on error, 1 if the item was deleted, 0 otherwise // Export for '_asyncio' shared extension PyAPI_FUNC(int) _PyDict_DelItemIf(PyObject *mp, PyObject *key, int (*predicate)(PyObject *value, void *arg), void *arg); // "KnownHash" variants // Export for '_asyncio' shared extension PyAPI_FUNC(int) _PyDict_SetItem_KnownHash(PyObject *mp, PyObject *key, PyObject *item, Py_hash_t hash); // Export for '_asyncio' shared extension PyAPI_FUNC(int) _PyDict_DelItem_KnownHash(PyObject *mp, PyObject *key, Py_hash_t hash); extern int _PyDict_Contains_KnownHash(PyObject *, PyObject *, Py_hash_t); // "Id" variants extern PyObject* _PyDict_GetItemIdWithError(PyObject *dp, _Py_Identifier *key); extern int _PyDict_ContainsId(PyObject *, _Py_Identifier *); extern int _PyDict_SetItemId(PyObject *dp, _Py_Identifier *key, PyObject *item); extern int _PyDict_DelItemId(PyObject *mp, _Py_Identifier *key); extern int _PyDict_Next( PyObject *mp, Py_ssize_t *pos, PyObject **key, PyObject **value, Py_hash_t *hash); extern int _PyDict_HasOnlyStringKeys(PyObject *mp); extern void _PyDict_MaybeUntrack(PyObject *mp); // Export for '_ctypes' shared extension PyAPI_FUNC(Py_ssize_t) _PyDict_SizeOf(PyDictObject *); #define _PyDict_HasSplitTable(d) ((d)->ma_values != NULL) /* Like PyDict_Merge, but override can be 0, 1 or 2. If override is 0, the first occurrence of a key wins, if override is 1, the last occurrence of a key wins, if override is 2, a KeyError with conflicting key as argument is raised. */ PyAPI_FUNC(int) _PyDict_MergeEx(PyObject *mp, PyObject *other, int override); extern void _PyDict_DebugMallocStats(FILE *out); /* _PyDictView */ typedef struct { PyObject_HEAD PyDictObject *dv_dict; } _PyDictViewObject; extern PyObject* _PyDictView_New(PyObject *, PyTypeObject *); extern PyObject* _PyDictView_Intersect(PyObject* self, PyObject *other); /* other API */ typedef struct { /* Cached hash code of me_key. */ Py_hash_t me_hash; PyObject *me_key; PyObject *me_value; /* This field is only meaningful for combined tables */ } PyDictKeyEntry; typedef struct { PyObject *me_key; /* The key must be Unicode and have hash. */ PyObject *me_value; /* This field is only meaningful for combined tables */ } PyDictUnicodeEntry; extern PyDictKeysObject *_PyDict_NewKeysForClass(void); extern PyObject *_PyDict_FromKeys(PyObject *, PyObject *, PyObject *); /* Gets a version number unique to the current state of the keys of dict, if possible. * Returns the version number, or zero if it was not possible to get a version number. */ extern uint32_t _PyDictKeys_GetVersionForCurrentState( PyInterpreterState *interp, PyDictKeysObject *dictkeys); extern size_t _PyDict_KeysSize(PyDictKeysObject *keys); extern void _PyDictKeys_DecRef(PyDictKeysObject *keys); /* _Py_dict_lookup() returns index of entry which can be used like DK_ENTRIES(dk)[index]. * -1 when no entry found, -3 when compare raises error. */ extern Py_ssize_t _Py_dict_lookup(PyDictObject *mp, PyObject *key, Py_hash_t hash, PyObject **value_addr); extern Py_ssize_t _Py_dict_lookup_threadsafe(PyDictObject *mp, PyObject *key, Py_hash_t hash, PyObject **value_addr); extern Py_ssize_t _PyDict_LookupIndex(PyDictObject *, PyObject *); extern Py_ssize_t _PyDictKeys_StringLookup(PyDictKeysObject* dictkeys, PyObject *key); PyAPI_FUNC(PyObject *)_PyDict_LoadGlobal(PyDictObject *, PyDictObject *, PyObject *); /* Consumes references to key and value */ PyAPI_FUNC(int) _PyDict_SetItem_Take2(PyDictObject *op, PyObject *key, PyObject *value); extern int _PyDict_SetItem_LockHeld(PyDictObject *dict, PyObject *name, PyObject *value); // Export for '_asyncio' shared extension PyAPI_FUNC(int) _PyDict_SetItem_KnownHash_LockHeld(PyDictObject *mp, PyObject *key, PyObject *value, Py_hash_t hash); // Export for '_asyncio' shared extension PyAPI_FUNC(int) _PyDict_GetItemRef_KnownHash_LockHeld(PyDictObject *op, PyObject *key, Py_hash_t hash, PyObject **result); extern int _PyDict_GetItemRef_KnownHash(PyDictObject *op, PyObject *key, Py_hash_t hash, PyObject **result); extern int _PyDict_GetItemRef_Unicode_LockHeld(PyDictObject *op, PyObject *key, PyObject **result); extern int _PyObjectDict_SetItem(PyTypeObject *tp, PyObject *obj, PyObject **dictptr, PyObject *name, PyObject *value); extern int _PyDict_Pop_KnownHash( PyDictObject *dict, PyObject *key, Py_hash_t hash, PyObject **result); #define DKIX_EMPTY (-1) #define DKIX_DUMMY (-2) /* Used internally */ #define DKIX_ERROR (-3) #define DKIX_KEY_CHANGED (-4) /* Used internally */ typedef enum { DICT_KEYS_GENERAL = 0, DICT_KEYS_UNICODE = 1, DICT_KEYS_SPLIT = 2 } DictKeysKind; /* See dictobject.c for actual layout of DictKeysObject */ struct _dictkeysobject { Py_ssize_t dk_refcnt; /* Size of the hash table (dk_indices). It must be a power of 2. */ uint8_t dk_log2_size; /* Size of the hash table (dk_indices) by bytes. */ uint8_t dk_log2_index_bytes; /* Kind of keys */ uint8_t dk_kind; #ifdef Py_GIL_DISABLED /* Lock used to protect shared keys */ PyMutex dk_mutex; #endif /* Version number -- Reset to 0 by any modification to keys */ uint32_t dk_version; /* Number of usable entries in dk_entries. */ Py_ssize_t dk_usable; /* Number of used entries in dk_entries. */ Py_ssize_t dk_nentries; /* Actual hash table of dk_size entries. It holds indices in dk_entries, or DKIX_EMPTY(-1) or DKIX_DUMMY(-2). Indices must be: 0 <= indice < USABLE_FRACTION(dk_size). The size in bytes of an indice depends on dk_size: - 1 byte if dk_size <= 0xff (char*) - 2 bytes if dk_size <= 0xffff (int16_t*) - 4 bytes if dk_size <= 0xffffffff (int32_t*) - 8 bytes otherwise (int64_t*) Dynamically sized, SIZEOF_VOID_P is minimum. */ char dk_indices[]; /* char is required to avoid strict aliasing. */ /* "PyDictKeyEntry or PyDictUnicodeEntry dk_entries[USABLE_FRACTION(DK_SIZE(dk))];" array follows: see the DK_ENTRIES() / DK_UNICODE_ENTRIES() functions below */ }; /* This must be no more than 250, for the prefix size to fit in one byte. */ #define SHARED_KEYS_MAX_SIZE 30 #define NEXT_LOG2_SHARED_KEYS_MAX_SIZE 6 /* Layout of dict values: * * The PyObject *values are preceded by an array of bytes holding * the insertion order and size. * [-1] = prefix size. [-2] = used size. size[-2-n...] = insertion order. */ struct _dictvalues { uint8_t capacity; uint8_t size; uint8_t embedded; uint8_t valid; PyObject *values[1]; }; #define DK_LOG_SIZE(dk) _Py_RVALUE((dk)->dk_log2_size) #if SIZEOF_VOID_P > 4 #define DK_SIZE(dk) (((int64_t)1)<<DK_LOG_SIZE(dk)) #else #define DK_SIZE(dk) (1<<DK_LOG_SIZE(dk)) #endif static inline void* _DK_ENTRIES(PyDictKeysObject *dk) { int8_t *indices = (int8_t*)(dk->dk_indices); size_t index = (size_t)1 << dk->dk_log2_index_bytes; return (&indices[index]); } static inline PyDictKeyEntry* DK_ENTRIES(PyDictKeysObject *dk) { assert(dk->dk_kind == DICT_KEYS_GENERAL); return (PyDictKeyEntry*)_DK_ENTRIES(dk); } static inline PyDictUnicodeEntry* DK_UNICODE_ENTRIES(PyDictKeysObject *dk) { assert(dk->dk_kind != DICT_KEYS_GENERAL); return (PyDictUnicodeEntry*)_DK_ENTRIES(dk); } #define DK_IS_UNICODE(dk) ((dk)->dk_kind != DICT_KEYS_GENERAL) #define DICT_VERSION_INCREMENT (1 << (DICT_MAX_WATCHERS + DICT_WATCHED_MUTATION_BITS)) #define DICT_WATCHER_MASK ((1 << DICT_MAX_WATCHERS) - 1) #define DICT_WATCHER_AND_MODIFICATION_MASK ((1 << (DICT_MAX_WATCHERS + DICT_WATCHED_MUTATION_BITS)) - 1) #ifdef Py_GIL_DISABLED #define THREAD_LOCAL_DICT_VERSION_COUNT 256 #define THREAD_LOCAL_DICT_VERSION_BATCH THREAD_LOCAL_DICT_VERSION_COUNT * DICT_VERSION_INCREMENT static inline uint64_t dict_next_version(PyInterpreterState *interp) { PyThreadState *tstate = PyThreadState_GET(); uint64_t cur_progress = (tstate->dict_global_version & (THREAD_LOCAL_DICT_VERSION_BATCH - 1)); if (cur_progress == 0) { uint64_t next = _Py_atomic_add_uint64(&interp->dict_state.global_version, THREAD_LOCAL_DICT_VERSION_BATCH); tstate->dict_global_version = next; } return tstate->dict_global_version += DICT_VERSION_INCREMENT; } #define DICT_NEXT_VERSION(INTERP) dict_next_version(INTERP) #else #define DICT_NEXT_VERSION(INTERP) \ ((INTERP)->dict_state.global_version += DICT_VERSION_INCREMENT) #endif void _PyDict_SendEvent(int watcher_bits, PyDict_WatchEvent event, PyDictObject *mp, PyObject *key, PyObject *value); static inline uint64_t _PyDict_NotifyEvent(PyInterpreterState *interp, PyDict_WatchEvent event, PyDictObject *mp, PyObject *key, PyObject *value) { assert(Py_REFCNT((PyObject*)mp) > 0); int watcher_bits = mp->ma_version_tag & DICT_WATCHER_MASK; if (watcher_bits) { RARE_EVENT_STAT_INC(watched_dict_modification); _PyDict_SendEvent(watcher_bits, event, mp, key, value); } return DICT_NEXT_VERSION(interp) | (mp->ma_version_tag & DICT_WATCHER_AND_MODIFICATION_MASK); } extern PyDictObject *_PyObject_MaterializeManagedDict(PyObject *obj); PyAPI_FUNC(PyObject *)_PyDict_FromItems( PyObject *const *keys, Py_ssize_t keys_offset, PyObject *const *values, Py_ssize_t values_offset, Py_ssize_t length); static inline uint8_t * get_insertion_order_array(PyDictValues *values) { return (uint8_t *)&values->values[values->capacity]; } static inline void _PyDictValues_AddToInsertionOrder(PyDictValues *values, Py_ssize_t ix) { assert(ix < SHARED_KEYS_MAX_SIZE); int size = values->size; uint8_t *array = get_insertion_order_array(values); assert(size < values->capacity); assert(((uint8_t)ix) == ix); array[size] = (uint8_t)ix; values->size = size+1; } static inline size_t shared_keys_usable_size(PyDictKeysObject *keys) { // dk_usable will decrease for each instance that is created and each // value that is added. dk_nentries will increase for each value that // is added. We want to always return the right value or larger. // We therefore increase dk_nentries first and we decrease dk_usable // second, and conversely here we read dk_usable first and dk_entries // second (to avoid the case where we read entries before the increment // and read usable after the decrement) Py_ssize_t dk_usable = FT_ATOMIC_LOAD_SSIZE_ACQUIRE(keys->dk_usable); Py_ssize_t dk_nentries = FT_ATOMIC_LOAD_SSIZE_ACQUIRE(keys->dk_nentries); return dk_nentries + dk_usable; } static inline size_t _PyInlineValuesSize(PyTypeObject *tp) { PyDictKeysObject *keys = ((PyHeapTypeObject*)tp)->ht_cached_keys; assert(keys != NULL); size_t size = shared_keys_usable_size(keys); size_t prefix_size = _Py_SIZE_ROUND_UP(size, sizeof(PyObject *)); assert(prefix_size < 256); return prefix_size + (size + 1) * sizeof(PyObject *); } int _PyDict_DetachFromObject(PyDictObject *dict, PyObject *obj); PyDictObject *_PyObject_MaterializeManagedDict_LockHeld(PyObject *); #ifdef __cplusplus } #endif #endif /* !Py_INTERNAL_DICT_H */
Upload File
Create Folder