Tim Peters | 1221c0a | 2002-03-23 00:20:15 +0000 | [diff] [blame] | 1 | #include "Python.h" |
Victor Stinner | 621cebe | 2018-11-12 16:53:38 +0100 | [diff] [blame] | 2 | #include "pycore_pymem.h" |
Tim Peters | 1221c0a | 2002-03-23 00:20:15 +0000 | [diff] [blame] | 3 | |
Benjamin Peterson | 3924f93 | 2016-09-18 19:12:48 -0700 | [diff] [blame] | 4 | #include <stdbool.h> |
| 5 | |
Victor Stinner | 0611c26 | 2016-03-15 22:22:13 +0100 | [diff] [blame] | 6 | |
| 7 | /* Defined in tracemalloc.c */ |
| 8 | extern void _PyMem_DumpTraceback(int fd, const void *ptr); |
| 9 | |
| 10 | |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 11 | /* Python's malloc wrappers (see pymem.h) */ |
| 12 | |
Victor Stinner | 34be807 | 2016-03-14 12:04:26 +0100 | [diff] [blame] | 13 | #undef uint |
| 14 | #define uint unsigned int /* assuming >= 16 bits */ |
| 15 | |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 16 | /* Forward declaration */ |
Victor Stinner | c4aec36 | 2016-03-14 22:26:53 +0100 | [diff] [blame] | 17 | static void* _PyMem_DebugRawMalloc(void *ctx, size_t size); |
| 18 | static void* _PyMem_DebugRawCalloc(void *ctx, size_t nelem, size_t elsize); |
| 19 | static void* _PyMem_DebugRawRealloc(void *ctx, void *ptr, size_t size); |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 20 | static void _PyMem_DebugRawFree(void *ctx, void *ptr); |
Victor Stinner | c4aec36 | 2016-03-14 22:26:53 +0100 | [diff] [blame] | 21 | |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 22 | static void* _PyMem_DebugMalloc(void *ctx, size_t size); |
Victor Stinner | db067af | 2014-05-02 22:31:14 +0200 | [diff] [blame] | 23 | static void* _PyMem_DebugCalloc(void *ctx, size_t nelem, size_t elsize); |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 24 | static void* _PyMem_DebugRealloc(void *ctx, void *ptr, size_t size); |
Victor Stinner | c4aec36 | 2016-03-14 22:26:53 +0100 | [diff] [blame] | 25 | static void _PyMem_DebugFree(void *ctx, void *p); |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 26 | |
| 27 | static void _PyObject_DebugDumpAddress(const void *p); |
| 28 | static void _PyMem_DebugCheckAddress(char api_id, const void *p); |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 29 | |
Victor Stinner | 5d39e04 | 2017-11-29 17:20:38 +0100 | [diff] [blame] | 30 | static void _PyMem_SetupDebugHooksDomain(PyMemAllocatorDomain domain); |
| 31 | |
Nick Coghlan | 6ba64f4 | 2013-09-29 00:28:55 +1000 | [diff] [blame] | 32 | #if defined(__has_feature) /* Clang */ |
Alexey Izbyshev | fd3a91c | 2018-11-12 02:14:51 +0300 | [diff] [blame] | 33 | # if __has_feature(address_sanitizer) /* is ASAN enabled? */ |
| 34 | # define _Py_NO_ADDRESS_SAFETY_ANALYSIS \ |
Benjamin Peterson | 3924f93 | 2016-09-18 19:12:48 -0700 | [diff] [blame] | 35 | __attribute__((no_address_safety_analysis)) |
Alexey Izbyshev | fd3a91c | 2018-11-12 02:14:51 +0300 | [diff] [blame] | 36 | # endif |
| 37 | # if __has_feature(thread_sanitizer) /* is TSAN enabled? */ |
| 38 | # define _Py_NO_SANITIZE_THREAD __attribute__((no_sanitize_thread)) |
| 39 | # endif |
| 40 | # if __has_feature(memory_sanitizer) /* is MSAN enabled? */ |
| 41 | # define _Py_NO_SANITIZE_MEMORY __attribute__((no_sanitize_memory)) |
| 42 | # endif |
| 43 | #elif defined(__GNUC__) |
| 44 | # if defined(__SANITIZE_ADDRESS__) /* GCC 4.8+, is ASAN enabled? */ |
| 45 | # define _Py_NO_ADDRESS_SAFETY_ANALYSIS \ |
Benjamin Peterson | 3924f93 | 2016-09-18 19:12:48 -0700 | [diff] [blame] | 46 | __attribute__((no_address_safety_analysis)) |
Alexey Izbyshev | fd3a91c | 2018-11-12 02:14:51 +0300 | [diff] [blame] | 47 | # endif |
| 48 | // TSAN is supported since GCC 4.8, but __SANITIZE_THREAD__ macro |
| 49 | // is provided only since GCC 7. |
| 50 | # if __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ >= 8) |
| 51 | # define _Py_NO_SANITIZE_THREAD __attribute__((no_sanitize_thread)) |
| 52 | # endif |
| 53 | #endif |
| 54 | |
| 55 | #ifndef _Py_NO_ADDRESS_SAFETY_ANALYSIS |
| 56 | # define _Py_NO_ADDRESS_SAFETY_ANALYSIS |
| 57 | #endif |
| 58 | #ifndef _Py_NO_SANITIZE_THREAD |
| 59 | # define _Py_NO_SANITIZE_THREAD |
| 60 | #endif |
| 61 | #ifndef _Py_NO_SANITIZE_MEMORY |
| 62 | # define _Py_NO_SANITIZE_MEMORY |
Nick Coghlan | 6ba64f4 | 2013-09-29 00:28:55 +1000 | [diff] [blame] | 63 | #endif |
| 64 | |
Tim Peters | 1221c0a | 2002-03-23 00:20:15 +0000 | [diff] [blame] | 65 | #ifdef WITH_PYMALLOC |
| 66 | |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 67 | #ifdef MS_WINDOWS |
| 68 | # include <windows.h> |
| 69 | #elif defined(HAVE_MMAP) |
| 70 | # include <sys/mman.h> |
| 71 | # ifdef MAP_ANONYMOUS |
| 72 | # define ARENAS_USE_MMAP |
| 73 | # endif |
Antoine Pitrou | 6f26be0 | 2011-05-03 18:18:59 +0200 | [diff] [blame] | 74 | #endif |
| 75 | |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 76 | /* Forward declaration */ |
| 77 | static void* _PyObject_Malloc(void *ctx, size_t size); |
Victor Stinner | db067af | 2014-05-02 22:31:14 +0200 | [diff] [blame] | 78 | static void* _PyObject_Calloc(void *ctx, size_t nelem, size_t elsize); |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 79 | static void _PyObject_Free(void *ctx, void *p); |
| 80 | static void* _PyObject_Realloc(void *ctx, void *ptr, size_t size); |
Martin v. Löwis | cd83fa8 | 2013-06-27 12:23:29 +0200 | [diff] [blame] | 81 | #endif |
| 82 | |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 83 | |
Victor Stinner | 9e00e80 | 2018-10-25 13:31:16 +0200 | [diff] [blame] | 84 | /* bpo-35053: Declare tracemalloc configuration here rather than |
| 85 | Modules/_tracemalloc.c because _tracemalloc can be compiled as dynamic |
| 86 | library, whereas _Py_NewReference() requires it. */ |
| 87 | struct _PyTraceMalloc_Config _Py_tracemalloc_config = _PyTraceMalloc_Config_INIT; |
| 88 | |
| 89 | |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 90 | static void * |
| 91 | _PyMem_RawMalloc(void *ctx, size_t size) |
| 92 | { |
Victor Stinner | db067af | 2014-05-02 22:31:14 +0200 | [diff] [blame] | 93 | /* PyMem_RawMalloc(0) means malloc(1). Some systems would return NULL |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 94 | for malloc(0), which would be treated as an error. Some platforms would |
| 95 | return a pointer with no memory behind it, which would break pymalloc. |
| 96 | To solve these problems, allocate an extra byte. */ |
| 97 | if (size == 0) |
| 98 | size = 1; |
| 99 | return malloc(size); |
| 100 | } |
| 101 | |
| 102 | static void * |
Victor Stinner | db067af | 2014-05-02 22:31:14 +0200 | [diff] [blame] | 103 | _PyMem_RawCalloc(void *ctx, size_t nelem, size_t elsize) |
| 104 | { |
| 105 | /* PyMem_RawCalloc(0, 0) means calloc(1, 1). Some systems would return NULL |
| 106 | for calloc(0, 0), which would be treated as an error. Some platforms |
| 107 | would return a pointer with no memory behind it, which would break |
| 108 | pymalloc. To solve these problems, allocate an extra byte. */ |
| 109 | if (nelem == 0 || elsize == 0) { |
| 110 | nelem = 1; |
| 111 | elsize = 1; |
| 112 | } |
| 113 | return calloc(nelem, elsize); |
| 114 | } |
| 115 | |
| 116 | static void * |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 117 | _PyMem_RawRealloc(void *ctx, void *ptr, size_t size) |
| 118 | { |
| 119 | if (size == 0) |
| 120 | size = 1; |
| 121 | return realloc(ptr, size); |
| 122 | } |
| 123 | |
| 124 | static void |
| 125 | _PyMem_RawFree(void *ctx, void *ptr) |
| 126 | { |
| 127 | free(ptr); |
| 128 | } |
| 129 | |
| 130 | |
| 131 | #ifdef MS_WINDOWS |
| 132 | static void * |
| 133 | _PyObject_ArenaVirtualAlloc(void *ctx, size_t size) |
| 134 | { |
| 135 | return VirtualAlloc(NULL, size, |
| 136 | MEM_COMMIT | MEM_RESERVE, PAGE_READWRITE); |
| 137 | } |
| 138 | |
| 139 | static void |
| 140 | _PyObject_ArenaVirtualFree(void *ctx, void *ptr, size_t size) |
| 141 | { |
Victor Stinner | 725e668 | 2013-07-07 03:06:16 +0200 | [diff] [blame] | 142 | VirtualFree(ptr, 0, MEM_RELEASE); |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 143 | } |
| 144 | |
| 145 | #elif defined(ARENAS_USE_MMAP) |
| 146 | static void * |
| 147 | _PyObject_ArenaMmap(void *ctx, size_t size) |
| 148 | { |
| 149 | void *ptr; |
| 150 | ptr = mmap(NULL, size, PROT_READ|PROT_WRITE, |
| 151 | MAP_PRIVATE|MAP_ANONYMOUS, -1, 0); |
| 152 | if (ptr == MAP_FAILED) |
| 153 | return NULL; |
| 154 | assert(ptr != NULL); |
| 155 | return ptr; |
| 156 | } |
| 157 | |
| 158 | static void |
| 159 | _PyObject_ArenaMunmap(void *ctx, void *ptr, size_t size) |
| 160 | { |
| 161 | munmap(ptr, size); |
| 162 | } |
| 163 | |
| 164 | #else |
| 165 | static void * |
| 166 | _PyObject_ArenaMalloc(void *ctx, size_t size) |
| 167 | { |
| 168 | return malloc(size); |
| 169 | } |
| 170 | |
| 171 | static void |
| 172 | _PyObject_ArenaFree(void *ctx, void *ptr, size_t size) |
| 173 | { |
| 174 | free(ptr); |
| 175 | } |
| 176 | #endif |
| 177 | |
Victor Stinner | 5d39e04 | 2017-11-29 17:20:38 +0100 | [diff] [blame] | 178 | #define MALLOC_ALLOC {NULL, _PyMem_RawMalloc, _PyMem_RawCalloc, _PyMem_RawRealloc, _PyMem_RawFree} |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 179 | #ifdef WITH_PYMALLOC |
Victor Stinner | 5d39e04 | 2017-11-29 17:20:38 +0100 | [diff] [blame] | 180 | # define PYMALLOC_ALLOC {NULL, _PyObject_Malloc, _PyObject_Calloc, _PyObject_Realloc, _PyObject_Free} |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 181 | #endif |
Victor Stinner | 5d39e04 | 2017-11-29 17:20:38 +0100 | [diff] [blame] | 182 | |
| 183 | #define PYRAW_ALLOC MALLOC_ALLOC |
| 184 | #ifdef WITH_PYMALLOC |
| 185 | # define PYOBJ_ALLOC PYMALLOC_ALLOC |
| 186 | #else |
| 187 | # define PYOBJ_ALLOC MALLOC_ALLOC |
| 188 | #endif |
| 189 | #define PYMEM_ALLOC PYOBJ_ALLOC |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 190 | |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 191 | typedef struct { |
| 192 | /* We tag each block with an API ID in order to tag API violations */ |
| 193 | char api_id; |
Victor Stinner | d8f0d92 | 2014-06-02 21:57:10 +0200 | [diff] [blame] | 194 | PyMemAllocatorEx alloc; |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 195 | } debug_alloc_api_t; |
| 196 | static struct { |
| 197 | debug_alloc_api_t raw; |
| 198 | debug_alloc_api_t mem; |
| 199 | debug_alloc_api_t obj; |
| 200 | } _PyMem_Debug = { |
Victor Stinner | 5d39e04 | 2017-11-29 17:20:38 +0100 | [diff] [blame] | 201 | {'r', PYRAW_ALLOC}, |
| 202 | {'m', PYMEM_ALLOC}, |
| 203 | {'o', PYOBJ_ALLOC} |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 204 | }; |
| 205 | |
Victor Stinner | 5d39e04 | 2017-11-29 17:20:38 +0100 | [diff] [blame] | 206 | #define PYDBGRAW_ALLOC \ |
| 207 | {&_PyMem_Debug.raw, _PyMem_DebugRawMalloc, _PyMem_DebugRawCalloc, _PyMem_DebugRawRealloc, _PyMem_DebugRawFree} |
| 208 | #define PYDBGMEM_ALLOC \ |
| 209 | {&_PyMem_Debug.mem, _PyMem_DebugMalloc, _PyMem_DebugCalloc, _PyMem_DebugRealloc, _PyMem_DebugFree} |
| 210 | #define PYDBGOBJ_ALLOC \ |
| 211 | {&_PyMem_Debug.obj, _PyMem_DebugMalloc, _PyMem_DebugCalloc, _PyMem_DebugRealloc, _PyMem_DebugFree} |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 212 | |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 213 | #ifdef Py_DEBUG |
Victor Stinner | 5d39e04 | 2017-11-29 17:20:38 +0100 | [diff] [blame] | 214 | static PyMemAllocatorEx _PyMem_Raw = PYDBGRAW_ALLOC; |
| 215 | static PyMemAllocatorEx _PyMem = PYDBGMEM_ALLOC; |
| 216 | static PyMemAllocatorEx _PyObject = PYDBGOBJ_ALLOC; |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 217 | #else |
Victor Stinner | 5d39e04 | 2017-11-29 17:20:38 +0100 | [diff] [blame] | 218 | static PyMemAllocatorEx _PyMem_Raw = PYRAW_ALLOC; |
| 219 | static PyMemAllocatorEx _PyMem = PYMEM_ALLOC; |
| 220 | static PyMemAllocatorEx _PyObject = PYOBJ_ALLOC; |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 221 | #endif |
Eric Snow | 2ebc5ce | 2017-09-07 23:51:28 -0600 | [diff] [blame] | 222 | |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 223 | |
Victor Stinner | 5d39e04 | 2017-11-29 17:20:38 +0100 | [diff] [blame] | 224 | static int |
| 225 | pymem_set_default_allocator(PyMemAllocatorDomain domain, int debug, |
| 226 | PyMemAllocatorEx *old_alloc) |
| 227 | { |
| 228 | if (old_alloc != NULL) { |
| 229 | PyMem_GetAllocator(domain, old_alloc); |
| 230 | } |
Victor Stinner | f7e5b56 | 2017-11-15 15:48:08 -0800 | [diff] [blame] | 231 | |
Victor Stinner | 5d39e04 | 2017-11-29 17:20:38 +0100 | [diff] [blame] | 232 | |
| 233 | PyMemAllocatorEx new_alloc; |
| 234 | switch(domain) |
| 235 | { |
| 236 | case PYMEM_DOMAIN_RAW: |
| 237 | new_alloc = (PyMemAllocatorEx)PYRAW_ALLOC; |
| 238 | break; |
| 239 | case PYMEM_DOMAIN_MEM: |
| 240 | new_alloc = (PyMemAllocatorEx)PYMEM_ALLOC; |
| 241 | break; |
| 242 | case PYMEM_DOMAIN_OBJ: |
| 243 | new_alloc = (PyMemAllocatorEx)PYOBJ_ALLOC; |
| 244 | break; |
| 245 | default: |
| 246 | /* unknown domain */ |
| 247 | return -1; |
| 248 | } |
| 249 | PyMem_SetAllocator(domain, &new_alloc); |
| 250 | if (debug) { |
| 251 | _PyMem_SetupDebugHooksDomain(domain); |
| 252 | } |
| 253 | return 0; |
| 254 | } |
| 255 | |
| 256 | |
| 257 | int |
| 258 | _PyMem_SetDefaultAllocator(PyMemAllocatorDomain domain, |
| 259 | PyMemAllocatorEx *old_alloc) |
Victor Stinner | f7e5b56 | 2017-11-15 15:48:08 -0800 | [diff] [blame] | 260 | { |
Victor Stinner | ccb0442 | 2017-11-16 03:20:31 -0800 | [diff] [blame] | 261 | #ifdef Py_DEBUG |
Victor Stinner | 5d39e04 | 2017-11-29 17:20:38 +0100 | [diff] [blame] | 262 | const int debug = 1; |
Victor Stinner | ccb0442 | 2017-11-16 03:20:31 -0800 | [diff] [blame] | 263 | #else |
Victor Stinner | 5d39e04 | 2017-11-29 17:20:38 +0100 | [diff] [blame] | 264 | const int debug = 0; |
Victor Stinner | ccb0442 | 2017-11-16 03:20:31 -0800 | [diff] [blame] | 265 | #endif |
Victor Stinner | 5d39e04 | 2017-11-29 17:20:38 +0100 | [diff] [blame] | 266 | return pymem_set_default_allocator(domain, debug, old_alloc); |
Victor Stinner | f7e5b56 | 2017-11-15 15:48:08 -0800 | [diff] [blame] | 267 | } |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 268 | |
Victor Stinner | 5d39e04 | 2017-11-29 17:20:38 +0100 | [diff] [blame] | 269 | |
Victor Stinner | 34be807 | 2016-03-14 12:04:26 +0100 | [diff] [blame] | 270 | int |
Victor Stinner | b16b4e4 | 2019-05-17 15:20:52 +0200 | [diff] [blame] | 271 | _PyMem_GetAllocatorName(const char *name, PyMemAllocatorName *allocator) |
Victor Stinner | 34be807 | 2016-03-14 12:04:26 +0100 | [diff] [blame] | 272 | { |
Victor Stinner | b16b4e4 | 2019-05-17 15:20:52 +0200 | [diff] [blame] | 273 | if (name == NULL || *name == '\0') { |
Victor Stinner | 34be807 | 2016-03-14 12:04:26 +0100 | [diff] [blame] | 274 | /* PYTHONMALLOC is empty or is not set or ignored (-E/-I command line |
Victor Stinner | b16b4e4 | 2019-05-17 15:20:52 +0200 | [diff] [blame] | 275 | nameions): use default memory allocators */ |
| 276 | *allocator = PYMEM_ALLOCATOR_DEFAULT; |
Victor Stinner | 34be807 | 2016-03-14 12:04:26 +0100 | [diff] [blame] | 277 | } |
Victor Stinner | b16b4e4 | 2019-05-17 15:20:52 +0200 | [diff] [blame] | 278 | else if (strcmp(name, "default") == 0) { |
| 279 | *allocator = PYMEM_ALLOCATOR_DEFAULT; |
| 280 | } |
| 281 | else if (strcmp(name, "debug") == 0) { |
| 282 | *allocator = PYMEM_ALLOCATOR_DEBUG; |
| 283 | } |
| 284 | #ifdef WITH_PYMALLOC |
| 285 | else if (strcmp(name, "pymalloc") == 0) { |
| 286 | *allocator = PYMEM_ALLOCATOR_PYMALLOC; |
| 287 | } |
| 288 | else if (strcmp(name, "pymalloc_debug") == 0) { |
| 289 | *allocator = PYMEM_ALLOCATOR_PYMALLOC_DEBUG; |
| 290 | } |
| 291 | #endif |
| 292 | else if (strcmp(name, "malloc") == 0) { |
| 293 | *allocator = PYMEM_ALLOCATOR_MALLOC; |
| 294 | } |
| 295 | else if (strcmp(name, "malloc_debug") == 0) { |
| 296 | *allocator = PYMEM_ALLOCATOR_MALLOC_DEBUG; |
| 297 | } |
| 298 | else { |
| 299 | /* unknown allocator */ |
| 300 | return -1; |
| 301 | } |
| 302 | return 0; |
| 303 | } |
Victor Stinner | 34be807 | 2016-03-14 12:04:26 +0100 | [diff] [blame] | 304 | |
Victor Stinner | b16b4e4 | 2019-05-17 15:20:52 +0200 | [diff] [blame] | 305 | |
| 306 | int |
| 307 | _PyMem_SetupAllocators(PyMemAllocatorName allocator) |
| 308 | { |
| 309 | switch (allocator) { |
| 310 | case PYMEM_ALLOCATOR_NOT_SET: |
| 311 | /* do nothing */ |
| 312 | break; |
| 313 | |
| 314 | case PYMEM_ALLOCATOR_DEFAULT: |
Victor Stinner | 5d39e04 | 2017-11-29 17:20:38 +0100 | [diff] [blame] | 315 | (void)_PyMem_SetDefaultAllocator(PYMEM_DOMAIN_RAW, NULL); |
| 316 | (void)_PyMem_SetDefaultAllocator(PYMEM_DOMAIN_MEM, NULL); |
| 317 | (void)_PyMem_SetDefaultAllocator(PYMEM_DOMAIN_OBJ, NULL); |
Victor Stinner | b16b4e4 | 2019-05-17 15:20:52 +0200 | [diff] [blame] | 318 | break; |
| 319 | |
| 320 | case PYMEM_ALLOCATOR_DEBUG: |
Victor Stinner | 5d39e04 | 2017-11-29 17:20:38 +0100 | [diff] [blame] | 321 | (void)pymem_set_default_allocator(PYMEM_DOMAIN_RAW, 1, NULL); |
| 322 | (void)pymem_set_default_allocator(PYMEM_DOMAIN_MEM, 1, NULL); |
| 323 | (void)pymem_set_default_allocator(PYMEM_DOMAIN_OBJ, 1, NULL); |
Victor Stinner | b16b4e4 | 2019-05-17 15:20:52 +0200 | [diff] [blame] | 324 | break; |
| 325 | |
Victor Stinner | 34be807 | 2016-03-14 12:04:26 +0100 | [diff] [blame] | 326 | #ifdef WITH_PYMALLOC |
Victor Stinner | b16b4e4 | 2019-05-17 15:20:52 +0200 | [diff] [blame] | 327 | case PYMEM_ALLOCATOR_PYMALLOC: |
| 328 | case PYMEM_ALLOCATOR_PYMALLOC_DEBUG: |
| 329 | { |
Victor Stinner | 5d39e04 | 2017-11-29 17:20:38 +0100 | [diff] [blame] | 330 | PyMemAllocatorEx malloc_alloc = MALLOC_ALLOC; |
| 331 | PyMem_SetAllocator(PYMEM_DOMAIN_RAW, &malloc_alloc); |
Victor Stinner | 34be807 | 2016-03-14 12:04:26 +0100 | [diff] [blame] | 332 | |
Victor Stinner | 5d39e04 | 2017-11-29 17:20:38 +0100 | [diff] [blame] | 333 | PyMemAllocatorEx pymalloc = PYMALLOC_ALLOC; |
| 334 | PyMem_SetAllocator(PYMEM_DOMAIN_MEM, &pymalloc); |
| 335 | PyMem_SetAllocator(PYMEM_DOMAIN_OBJ, &pymalloc); |
Victor Stinner | 34be807 | 2016-03-14 12:04:26 +0100 | [diff] [blame] | 336 | |
Victor Stinner | b16b4e4 | 2019-05-17 15:20:52 +0200 | [diff] [blame] | 337 | if (allocator == PYMEM_ALLOCATOR_PYMALLOC_DEBUG) { |
Victor Stinner | 34be807 | 2016-03-14 12:04:26 +0100 | [diff] [blame] | 338 | PyMem_SetupDebugHooks(); |
Victor Stinner | 5d39e04 | 2017-11-29 17:20:38 +0100 | [diff] [blame] | 339 | } |
Victor Stinner | b16b4e4 | 2019-05-17 15:20:52 +0200 | [diff] [blame] | 340 | break; |
Victor Stinner | 34be807 | 2016-03-14 12:04:26 +0100 | [diff] [blame] | 341 | } |
| 342 | #endif |
Victor Stinner | b16b4e4 | 2019-05-17 15:20:52 +0200 | [diff] [blame] | 343 | |
| 344 | case PYMEM_ALLOCATOR_MALLOC: |
| 345 | case PYMEM_ALLOCATOR_MALLOC_DEBUG: |
| 346 | { |
Victor Stinner | 5d39e04 | 2017-11-29 17:20:38 +0100 | [diff] [blame] | 347 | PyMemAllocatorEx malloc_alloc = MALLOC_ALLOC; |
| 348 | PyMem_SetAllocator(PYMEM_DOMAIN_RAW, &malloc_alloc); |
| 349 | PyMem_SetAllocator(PYMEM_DOMAIN_MEM, &malloc_alloc); |
| 350 | PyMem_SetAllocator(PYMEM_DOMAIN_OBJ, &malloc_alloc); |
| 351 | |
Victor Stinner | b16b4e4 | 2019-05-17 15:20:52 +0200 | [diff] [blame] | 352 | if (allocator == PYMEM_ALLOCATOR_MALLOC_DEBUG) { |
Victor Stinner | 5d39e04 | 2017-11-29 17:20:38 +0100 | [diff] [blame] | 353 | PyMem_SetupDebugHooks(); |
| 354 | } |
Victor Stinner | b16b4e4 | 2019-05-17 15:20:52 +0200 | [diff] [blame] | 355 | break; |
Victor Stinner | 5d39e04 | 2017-11-29 17:20:38 +0100 | [diff] [blame] | 356 | } |
Victor Stinner | b16b4e4 | 2019-05-17 15:20:52 +0200 | [diff] [blame] | 357 | |
| 358 | default: |
Victor Stinner | 34be807 | 2016-03-14 12:04:26 +0100 | [diff] [blame] | 359 | /* unknown allocator */ |
| 360 | return -1; |
| 361 | } |
| 362 | return 0; |
| 363 | } |
| 364 | |
Victor Stinner | 5d39e04 | 2017-11-29 17:20:38 +0100 | [diff] [blame] | 365 | |
| 366 | static int |
| 367 | pymemallocator_eq(PyMemAllocatorEx *a, PyMemAllocatorEx *b) |
| 368 | { |
| 369 | return (memcmp(a, b, sizeof(PyMemAllocatorEx)) == 0); |
| 370 | } |
| 371 | |
| 372 | |
| 373 | const char* |
Victor Stinner | b16b4e4 | 2019-05-17 15:20:52 +0200 | [diff] [blame] | 374 | _PyMem_GetCurrentAllocatorName(void) |
Victor Stinner | 5d39e04 | 2017-11-29 17:20:38 +0100 | [diff] [blame] | 375 | { |
| 376 | PyMemAllocatorEx malloc_alloc = MALLOC_ALLOC; |
| 377 | #ifdef WITH_PYMALLOC |
| 378 | PyMemAllocatorEx pymalloc = PYMALLOC_ALLOC; |
| 379 | #endif |
| 380 | |
| 381 | if (pymemallocator_eq(&_PyMem_Raw, &malloc_alloc) && |
| 382 | pymemallocator_eq(&_PyMem, &malloc_alloc) && |
| 383 | pymemallocator_eq(&_PyObject, &malloc_alloc)) |
| 384 | { |
| 385 | return "malloc"; |
| 386 | } |
| 387 | #ifdef WITH_PYMALLOC |
| 388 | if (pymemallocator_eq(&_PyMem_Raw, &malloc_alloc) && |
| 389 | pymemallocator_eq(&_PyMem, &pymalloc) && |
| 390 | pymemallocator_eq(&_PyObject, &pymalloc)) |
| 391 | { |
| 392 | return "pymalloc"; |
| 393 | } |
| 394 | #endif |
| 395 | |
| 396 | PyMemAllocatorEx dbg_raw = PYDBGRAW_ALLOC; |
| 397 | PyMemAllocatorEx dbg_mem = PYDBGMEM_ALLOC; |
| 398 | PyMemAllocatorEx dbg_obj = PYDBGOBJ_ALLOC; |
| 399 | |
| 400 | if (pymemallocator_eq(&_PyMem_Raw, &dbg_raw) && |
| 401 | pymemallocator_eq(&_PyMem, &dbg_mem) && |
| 402 | pymemallocator_eq(&_PyObject, &dbg_obj)) |
| 403 | { |
| 404 | /* Debug hooks installed */ |
| 405 | if (pymemallocator_eq(&_PyMem_Debug.raw.alloc, &malloc_alloc) && |
| 406 | pymemallocator_eq(&_PyMem_Debug.mem.alloc, &malloc_alloc) && |
| 407 | pymemallocator_eq(&_PyMem_Debug.obj.alloc, &malloc_alloc)) |
| 408 | { |
| 409 | return "malloc_debug"; |
| 410 | } |
| 411 | #ifdef WITH_PYMALLOC |
| 412 | if (pymemallocator_eq(&_PyMem_Debug.raw.alloc, &malloc_alloc) && |
| 413 | pymemallocator_eq(&_PyMem_Debug.mem.alloc, &pymalloc) && |
| 414 | pymemallocator_eq(&_PyMem_Debug.obj.alloc, &pymalloc)) |
| 415 | { |
| 416 | return "pymalloc_debug"; |
| 417 | } |
| 418 | #endif |
| 419 | } |
| 420 | return NULL; |
| 421 | } |
| 422 | |
| 423 | |
| 424 | #undef MALLOC_ALLOC |
| 425 | #undef PYMALLOC_ALLOC |
| 426 | #undef PYRAW_ALLOC |
| 427 | #undef PYMEM_ALLOC |
| 428 | #undef PYOBJ_ALLOC |
| 429 | #undef PYDBGRAW_ALLOC |
| 430 | #undef PYDBGMEM_ALLOC |
| 431 | #undef PYDBGOBJ_ALLOC |
| 432 | |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 433 | |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 434 | static PyObjectArenaAllocator _PyObject_Arena = {NULL, |
Victor Stinner | f7e5b56 | 2017-11-15 15:48:08 -0800 | [diff] [blame] | 435 | #ifdef MS_WINDOWS |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 436 | _PyObject_ArenaVirtualAlloc, _PyObject_ArenaVirtualFree |
Victor Stinner | f7e5b56 | 2017-11-15 15:48:08 -0800 | [diff] [blame] | 437 | #elif defined(ARENAS_USE_MMAP) |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 438 | _PyObject_ArenaMmap, _PyObject_ArenaMunmap |
Victor Stinner | f7e5b56 | 2017-11-15 15:48:08 -0800 | [diff] [blame] | 439 | #else |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 440 | _PyObject_ArenaMalloc, _PyObject_ArenaFree |
Victor Stinner | f7e5b56 | 2017-11-15 15:48:08 -0800 | [diff] [blame] | 441 | #endif |
| 442 | }; |
| 443 | |
Victor Stinner | 0621e0e | 2016-04-19 17:02:55 +0200 | [diff] [blame] | 444 | #ifdef WITH_PYMALLOC |
Victor Stinner | 34be807 | 2016-03-14 12:04:26 +0100 | [diff] [blame] | 445 | static int |
| 446 | _PyMem_DebugEnabled(void) |
| 447 | { |
| 448 | return (_PyObject.malloc == _PyMem_DebugMalloc); |
| 449 | } |
| 450 | |
Victor Stinner | 6bf992a | 2017-12-06 17:26:10 +0100 | [diff] [blame] | 451 | static int |
Victor Stinner | 34be807 | 2016-03-14 12:04:26 +0100 | [diff] [blame] | 452 | _PyMem_PymallocEnabled(void) |
| 453 | { |
| 454 | if (_PyMem_DebugEnabled()) { |
| 455 | return (_PyMem_Debug.obj.alloc.malloc == _PyObject_Malloc); |
| 456 | } |
| 457 | else { |
| 458 | return (_PyObject.malloc == _PyObject_Malloc); |
| 459 | } |
| 460 | } |
| 461 | #endif |
| 462 | |
Victor Stinner | 5d39e04 | 2017-11-29 17:20:38 +0100 | [diff] [blame] | 463 | |
| 464 | static void |
| 465 | _PyMem_SetupDebugHooksDomain(PyMemAllocatorDomain domain) |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 466 | { |
Victor Stinner | d8f0d92 | 2014-06-02 21:57:10 +0200 | [diff] [blame] | 467 | PyMemAllocatorEx alloc; |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 468 | |
Victor Stinner | 5d39e04 | 2017-11-29 17:20:38 +0100 | [diff] [blame] | 469 | if (domain == PYMEM_DOMAIN_RAW) { |
| 470 | if (_PyMem_Raw.malloc == _PyMem_DebugRawMalloc) { |
| 471 | return; |
| 472 | } |
Victor Stinner | 34be807 | 2016-03-14 12:04:26 +0100 | [diff] [blame] | 473 | |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 474 | PyMem_GetAllocator(PYMEM_DOMAIN_RAW, &_PyMem_Debug.raw.alloc); |
Victor Stinner | 5d39e04 | 2017-11-29 17:20:38 +0100 | [diff] [blame] | 475 | alloc.ctx = &_PyMem_Debug.raw; |
| 476 | alloc.malloc = _PyMem_DebugRawMalloc; |
| 477 | alloc.calloc = _PyMem_DebugRawCalloc; |
| 478 | alloc.realloc = _PyMem_DebugRawRealloc; |
| 479 | alloc.free = _PyMem_DebugRawFree; |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 480 | PyMem_SetAllocator(PYMEM_DOMAIN_RAW, &alloc); |
| 481 | } |
Victor Stinner | 5d39e04 | 2017-11-29 17:20:38 +0100 | [diff] [blame] | 482 | else if (domain == PYMEM_DOMAIN_MEM) { |
| 483 | if (_PyMem.malloc == _PyMem_DebugMalloc) { |
| 484 | return; |
| 485 | } |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 486 | |
Victor Stinner | ad52437 | 2016-03-16 12:12:53 +0100 | [diff] [blame] | 487 | PyMem_GetAllocator(PYMEM_DOMAIN_MEM, &_PyMem_Debug.mem.alloc); |
Victor Stinner | 5d39e04 | 2017-11-29 17:20:38 +0100 | [diff] [blame] | 488 | alloc.ctx = &_PyMem_Debug.mem; |
| 489 | alloc.malloc = _PyMem_DebugMalloc; |
| 490 | alloc.calloc = _PyMem_DebugCalloc; |
| 491 | alloc.realloc = _PyMem_DebugRealloc; |
| 492 | alloc.free = _PyMem_DebugFree; |
Victor Stinner | ad52437 | 2016-03-16 12:12:53 +0100 | [diff] [blame] | 493 | PyMem_SetAllocator(PYMEM_DOMAIN_MEM, &alloc); |
| 494 | } |
Victor Stinner | 5d39e04 | 2017-11-29 17:20:38 +0100 | [diff] [blame] | 495 | else if (domain == PYMEM_DOMAIN_OBJ) { |
| 496 | if (_PyObject.malloc == _PyMem_DebugMalloc) { |
| 497 | return; |
| 498 | } |
Victor Stinner | ad52437 | 2016-03-16 12:12:53 +0100 | [diff] [blame] | 499 | |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 500 | PyMem_GetAllocator(PYMEM_DOMAIN_OBJ, &_PyMem_Debug.obj.alloc); |
Victor Stinner | 5d39e04 | 2017-11-29 17:20:38 +0100 | [diff] [blame] | 501 | alloc.ctx = &_PyMem_Debug.obj; |
| 502 | alloc.malloc = _PyMem_DebugMalloc; |
| 503 | alloc.calloc = _PyMem_DebugCalloc; |
| 504 | alloc.realloc = _PyMem_DebugRealloc; |
| 505 | alloc.free = _PyMem_DebugFree; |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 506 | PyMem_SetAllocator(PYMEM_DOMAIN_OBJ, &alloc); |
| 507 | } |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 508 | } |
| 509 | |
Victor Stinner | 5d39e04 | 2017-11-29 17:20:38 +0100 | [diff] [blame] | 510 | |
| 511 | void |
| 512 | PyMem_SetupDebugHooks(void) |
| 513 | { |
| 514 | _PyMem_SetupDebugHooksDomain(PYMEM_DOMAIN_RAW); |
| 515 | _PyMem_SetupDebugHooksDomain(PYMEM_DOMAIN_MEM); |
| 516 | _PyMem_SetupDebugHooksDomain(PYMEM_DOMAIN_OBJ); |
| 517 | } |
| 518 | |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 519 | void |
Victor Stinner | d8f0d92 | 2014-06-02 21:57:10 +0200 | [diff] [blame] | 520 | PyMem_GetAllocator(PyMemAllocatorDomain domain, PyMemAllocatorEx *allocator) |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 521 | { |
| 522 | switch(domain) |
| 523 | { |
| 524 | case PYMEM_DOMAIN_RAW: *allocator = _PyMem_Raw; break; |
| 525 | case PYMEM_DOMAIN_MEM: *allocator = _PyMem; break; |
| 526 | case PYMEM_DOMAIN_OBJ: *allocator = _PyObject; break; |
| 527 | default: |
Victor Stinner | db067af | 2014-05-02 22:31:14 +0200 | [diff] [blame] | 528 | /* unknown domain: set all attributes to NULL */ |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 529 | allocator->ctx = NULL; |
| 530 | allocator->malloc = NULL; |
Victor Stinner | db067af | 2014-05-02 22:31:14 +0200 | [diff] [blame] | 531 | allocator->calloc = NULL; |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 532 | allocator->realloc = NULL; |
| 533 | allocator->free = NULL; |
| 534 | } |
| 535 | } |
| 536 | |
| 537 | void |
Victor Stinner | d8f0d92 | 2014-06-02 21:57:10 +0200 | [diff] [blame] | 538 | PyMem_SetAllocator(PyMemAllocatorDomain domain, PyMemAllocatorEx *allocator) |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 539 | { |
| 540 | switch(domain) |
| 541 | { |
| 542 | case PYMEM_DOMAIN_RAW: _PyMem_Raw = *allocator; break; |
| 543 | case PYMEM_DOMAIN_MEM: _PyMem = *allocator; break; |
| 544 | case PYMEM_DOMAIN_OBJ: _PyObject = *allocator; break; |
| 545 | /* ignore unknown domain */ |
| 546 | } |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 547 | } |
| 548 | |
| 549 | void |
| 550 | PyObject_GetArenaAllocator(PyObjectArenaAllocator *allocator) |
| 551 | { |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 552 | *allocator = _PyObject_Arena; |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 553 | } |
| 554 | |
| 555 | void |
| 556 | PyObject_SetArenaAllocator(PyObjectArenaAllocator *allocator) |
| 557 | { |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 558 | _PyObject_Arena = *allocator; |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 559 | } |
| 560 | |
| 561 | void * |
| 562 | PyMem_RawMalloc(size_t size) |
| 563 | { |
| 564 | /* |
| 565 | * Limit ourselves to PY_SSIZE_T_MAX bytes to prevent security holes. |
| 566 | * Most python internals blindly use a signed Py_ssize_t to track |
| 567 | * things without checking for overflows or negatives. |
| 568 | * As size_t is unsigned, checking for size < 0 is not required. |
| 569 | */ |
| 570 | if (size > (size_t)PY_SSIZE_T_MAX) |
| 571 | return NULL; |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 572 | return _PyMem_Raw.malloc(_PyMem_Raw.ctx, size); |
| 573 | } |
| 574 | |
Victor Stinner | db067af | 2014-05-02 22:31:14 +0200 | [diff] [blame] | 575 | void * |
| 576 | PyMem_RawCalloc(size_t nelem, size_t elsize) |
| 577 | { |
| 578 | /* see PyMem_RawMalloc() */ |
| 579 | if (elsize != 0 && nelem > (size_t)PY_SSIZE_T_MAX / elsize) |
| 580 | return NULL; |
| 581 | return _PyMem_Raw.calloc(_PyMem_Raw.ctx, nelem, elsize); |
| 582 | } |
| 583 | |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 584 | void* |
| 585 | PyMem_RawRealloc(void *ptr, size_t new_size) |
| 586 | { |
| 587 | /* see PyMem_RawMalloc() */ |
| 588 | if (new_size > (size_t)PY_SSIZE_T_MAX) |
| 589 | return NULL; |
| 590 | return _PyMem_Raw.realloc(_PyMem_Raw.ctx, ptr, new_size); |
| 591 | } |
| 592 | |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 593 | void PyMem_RawFree(void *ptr) |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 594 | { |
| 595 | _PyMem_Raw.free(_PyMem_Raw.ctx, ptr); |
| 596 | } |
| 597 | |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 598 | |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 599 | void * |
| 600 | PyMem_Malloc(size_t size) |
| 601 | { |
| 602 | /* see PyMem_RawMalloc() */ |
| 603 | if (size > (size_t)PY_SSIZE_T_MAX) |
| 604 | return NULL; |
| 605 | return _PyMem.malloc(_PyMem.ctx, size); |
| 606 | } |
| 607 | |
| 608 | void * |
Victor Stinner | db067af | 2014-05-02 22:31:14 +0200 | [diff] [blame] | 609 | PyMem_Calloc(size_t nelem, size_t elsize) |
| 610 | { |
| 611 | /* see PyMem_RawMalloc() */ |
| 612 | if (elsize != 0 && nelem > (size_t)PY_SSIZE_T_MAX / elsize) |
| 613 | return NULL; |
| 614 | return _PyMem.calloc(_PyMem.ctx, nelem, elsize); |
| 615 | } |
| 616 | |
| 617 | void * |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 618 | PyMem_Realloc(void *ptr, size_t new_size) |
| 619 | { |
| 620 | /* see PyMem_RawMalloc() */ |
| 621 | if (new_size > (size_t)PY_SSIZE_T_MAX) |
| 622 | return NULL; |
| 623 | return _PyMem.realloc(_PyMem.ctx, ptr, new_size); |
| 624 | } |
| 625 | |
| 626 | void |
| 627 | PyMem_Free(void *ptr) |
| 628 | { |
| 629 | _PyMem.free(_PyMem.ctx, ptr); |
| 630 | } |
| 631 | |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 632 | |
Victor Stinner | 46972b7 | 2017-11-24 22:55:40 +0100 | [diff] [blame] | 633 | wchar_t* |
| 634 | _PyMem_RawWcsdup(const wchar_t *str) |
| 635 | { |
Victor Stinner | b64de46 | 2017-12-01 18:27:09 +0100 | [diff] [blame] | 636 | assert(str != NULL); |
| 637 | |
Victor Stinner | 46972b7 | 2017-11-24 22:55:40 +0100 | [diff] [blame] | 638 | size_t len = wcslen(str); |
| 639 | if (len > (size_t)PY_SSIZE_T_MAX / sizeof(wchar_t) - 1) { |
| 640 | return NULL; |
| 641 | } |
| 642 | |
| 643 | size_t size = (len + 1) * sizeof(wchar_t); |
| 644 | wchar_t *str2 = PyMem_RawMalloc(size); |
| 645 | if (str2 == NULL) { |
| 646 | return NULL; |
| 647 | } |
| 648 | |
| 649 | memcpy(str2, str, size); |
| 650 | return str2; |
| 651 | } |
| 652 | |
Victor Stinner | 49fc8ec | 2013-07-07 23:30:24 +0200 | [diff] [blame] | 653 | char * |
| 654 | _PyMem_RawStrdup(const char *str) |
| 655 | { |
Victor Stinner | b64de46 | 2017-12-01 18:27:09 +0100 | [diff] [blame] | 656 | assert(str != NULL); |
| 657 | size_t size = strlen(str) + 1; |
| 658 | char *copy = PyMem_RawMalloc(size); |
| 659 | if (copy == NULL) { |
Victor Stinner | 49fc8ec | 2013-07-07 23:30:24 +0200 | [diff] [blame] | 660 | return NULL; |
Victor Stinner | b64de46 | 2017-12-01 18:27:09 +0100 | [diff] [blame] | 661 | } |
Victor Stinner | 49fc8ec | 2013-07-07 23:30:24 +0200 | [diff] [blame] | 662 | memcpy(copy, str, size); |
| 663 | return copy; |
| 664 | } |
| 665 | |
| 666 | char * |
| 667 | _PyMem_Strdup(const char *str) |
| 668 | { |
Victor Stinner | b64de46 | 2017-12-01 18:27:09 +0100 | [diff] [blame] | 669 | assert(str != NULL); |
| 670 | size_t size = strlen(str) + 1; |
| 671 | char *copy = PyMem_Malloc(size); |
| 672 | if (copy == NULL) { |
Victor Stinner | 49fc8ec | 2013-07-07 23:30:24 +0200 | [diff] [blame] | 673 | return NULL; |
Victor Stinner | b64de46 | 2017-12-01 18:27:09 +0100 | [diff] [blame] | 674 | } |
Victor Stinner | 49fc8ec | 2013-07-07 23:30:24 +0200 | [diff] [blame] | 675 | memcpy(copy, str, size); |
| 676 | return copy; |
| 677 | } |
| 678 | |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 679 | void * |
| 680 | PyObject_Malloc(size_t size) |
| 681 | { |
| 682 | /* see PyMem_RawMalloc() */ |
| 683 | if (size > (size_t)PY_SSIZE_T_MAX) |
| 684 | return NULL; |
| 685 | return _PyObject.malloc(_PyObject.ctx, size); |
| 686 | } |
| 687 | |
| 688 | void * |
Victor Stinner | db067af | 2014-05-02 22:31:14 +0200 | [diff] [blame] | 689 | PyObject_Calloc(size_t nelem, size_t elsize) |
| 690 | { |
| 691 | /* see PyMem_RawMalloc() */ |
| 692 | if (elsize != 0 && nelem > (size_t)PY_SSIZE_T_MAX / elsize) |
| 693 | return NULL; |
| 694 | return _PyObject.calloc(_PyObject.ctx, nelem, elsize); |
| 695 | } |
| 696 | |
| 697 | void * |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 698 | PyObject_Realloc(void *ptr, size_t new_size) |
| 699 | { |
| 700 | /* see PyMem_RawMalloc() */ |
| 701 | if (new_size > (size_t)PY_SSIZE_T_MAX) |
| 702 | return NULL; |
| 703 | return _PyObject.realloc(_PyObject.ctx, ptr, new_size); |
| 704 | } |
| 705 | |
| 706 | void |
| 707 | PyObject_Free(void *ptr) |
| 708 | { |
| 709 | _PyObject.free(_PyObject.ctx, ptr); |
| 710 | } |
| 711 | |
| 712 | |
| 713 | #ifdef WITH_PYMALLOC |
| 714 | |
Benjamin Peterson | 05159c4 | 2009-12-03 03:01:27 +0000 | [diff] [blame] | 715 | #ifdef WITH_VALGRIND |
| 716 | #include <valgrind/valgrind.h> |
| 717 | |
| 718 | /* If we're using GCC, use __builtin_expect() to reduce overhead of |
| 719 | the valgrind checks */ |
| 720 | #if defined(__GNUC__) && (__GNUC__ > 2) && defined(__OPTIMIZE__) |
| 721 | # define UNLIKELY(value) __builtin_expect((value), 0) |
| 722 | #else |
| 723 | # define UNLIKELY(value) (value) |
| 724 | #endif |
| 725 | |
| 726 | /* -1 indicates that we haven't checked that we're running on valgrind yet. */ |
| 727 | static int running_on_valgrind = -1; |
| 728 | #endif |
| 729 | |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 730 | |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 731 | /* An object allocator for Python. |
| 732 | |
| 733 | Here is an introduction to the layers of the Python memory architecture, |
| 734 | showing where the object allocator is actually used (layer +2), It is |
| 735 | called for every object allocation and deallocation (PyObject_New/Del), |
| 736 | unless the object-specific allocators implement a proprietary allocation |
| 737 | scheme (ex.: ints use a simple free list). This is also the place where |
| 738 | the cyclic garbage collector operates selectively on container objects. |
| 739 | |
| 740 | |
| 741 | Object-specific allocators |
| 742 | _____ ______ ______ ________ |
| 743 | [ int ] [ dict ] [ list ] ... [ string ] Python core | |
| 744 | +3 | <----- Object-specific memory -----> | <-- Non-object memory --> | |
| 745 | _______________________________ | | |
| 746 | [ Python's object allocator ] | | |
| 747 | +2 | ####### Object memory ####### | <------ Internal buffers ------> | |
| 748 | ______________________________________________________________ | |
| 749 | [ Python's raw memory allocator (PyMem_ API) ] | |
| 750 | +1 | <----- Python memory (under PyMem manager's control) ------> | | |
| 751 | __________________________________________________________________ |
| 752 | [ Underlying general-purpose allocator (ex: C library malloc) ] |
| 753 | 0 | <------ Virtual memory allocated for the python process -------> | |
| 754 | |
| 755 | ========================================================================= |
| 756 | _______________________________________________________________________ |
| 757 | [ OS-specific Virtual Memory Manager (VMM) ] |
| 758 | -1 | <--- Kernel dynamic storage allocation & management (page-based) ---> | |
| 759 | __________________________________ __________________________________ |
| 760 | [ ] [ ] |
| 761 | -2 | <-- Physical memory: ROM/RAM --> | | <-- Secondary storage (swap) --> | |
| 762 | |
| 763 | */ |
| 764 | /*==========================================================================*/ |
| 765 | |
| 766 | /* A fast, special-purpose memory allocator for small blocks, to be used |
| 767 | on top of a general-purpose malloc -- heavily based on previous art. */ |
| 768 | |
| 769 | /* Vladimir Marangozov -- August 2000 */ |
| 770 | |
| 771 | /* |
| 772 | * "Memory management is where the rubber meets the road -- if we do the wrong |
| 773 | * thing at any level, the results will not be good. And if we don't make the |
| 774 | * levels work well together, we are in serious trouble." (1) |
| 775 | * |
| 776 | * (1) Paul R. Wilson, Mark S. Johnstone, Michael Neely, and David Boles, |
| 777 | * "Dynamic Storage Allocation: A Survey and Critical Review", |
| 778 | * in Proc. 1995 Int'l. Workshop on Memory Management, September 1995. |
| 779 | */ |
| 780 | |
| 781 | /* #undef WITH_MEMORY_LIMITS */ /* disable mem limit checks */ |
| 782 | |
| 783 | /*==========================================================================*/ |
| 784 | |
| 785 | /* |
| 786 | * Allocation strategy abstract: |
| 787 | * |
| 788 | * For small requests, the allocator sub-allocates <Big> blocks of memory. |
| 789 | * Requests greater than SMALL_REQUEST_THRESHOLD bytes are routed to the |
| 790 | * system's allocator. |
| 791 | * |
| 792 | * Small requests are grouped in size classes spaced 8 bytes apart, due |
| 793 | * to the required valid alignment of the returned address. Requests of |
| 794 | * a particular size are serviced from memory pools of 4K (one VMM page). |
| 795 | * Pools are fragmented on demand and contain free lists of blocks of one |
| 796 | * particular size class. In other words, there is a fixed-size allocator |
| 797 | * for each size class. Free pools are shared by the different allocators |
| 798 | * thus minimizing the space reserved for a particular size class. |
| 799 | * |
| 800 | * This allocation strategy is a variant of what is known as "simple |
| 801 | * segregated storage based on array of free lists". The main drawback of |
| 802 | * simple segregated storage is that we might end up with lot of reserved |
| 803 | * memory for the different free lists, which degenerate in time. To avoid |
| 804 | * this, we partition each free list in pools and we share dynamically the |
| 805 | * reserved space between all free lists. This technique is quite efficient |
| 806 | * for memory intensive programs which allocate mainly small-sized blocks. |
| 807 | * |
| 808 | * For small requests we have the following table: |
| 809 | * |
| 810 | * Request in bytes Size of allocated block Size class idx |
| 811 | * ---------------------------------------------------------------- |
| 812 | * 1-8 8 0 |
| 813 | * 9-16 16 1 |
| 814 | * 17-24 24 2 |
| 815 | * 25-32 32 3 |
| 816 | * 33-40 40 4 |
| 817 | * 41-48 48 5 |
| 818 | * 49-56 56 6 |
| 819 | * 57-64 64 7 |
| 820 | * 65-72 72 8 |
| 821 | * ... ... ... |
| 822 | * 497-504 504 62 |
| 823 | * 505-512 512 63 |
| 824 | * |
| 825 | * 0, SMALL_REQUEST_THRESHOLD + 1 and up: routed to the underlying |
| 826 | * allocator. |
| 827 | */ |
| 828 | |
| 829 | /*==========================================================================*/ |
| 830 | |
| 831 | /* |
| 832 | * -- Main tunable settings section -- |
| 833 | */ |
| 834 | |
| 835 | /* |
| 836 | * Alignment of addresses returned to the user. 8-bytes alignment works |
| 837 | * on most current architectures (with 32-bit or 64-bit address busses). |
| 838 | * The alignment value is also used for grouping small requests in size |
| 839 | * classes spaced ALIGNMENT bytes apart. |
| 840 | * |
| 841 | * You shouldn't change this unless you know what you are doing. |
| 842 | */ |
Inada Naoki | f0be4bb | 2019-05-14 18:51:15 +0900 | [diff] [blame] | 843 | |
| 844 | #if SIZEOF_VOID_P > 4 |
| 845 | #define ALIGNMENT 16 /* must be 2^N */ |
| 846 | #define ALIGNMENT_SHIFT 4 |
| 847 | #else |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 848 | #define ALIGNMENT 8 /* must be 2^N */ |
| 849 | #define ALIGNMENT_SHIFT 3 |
Inada Naoki | f0be4bb | 2019-05-14 18:51:15 +0900 | [diff] [blame] | 850 | #endif |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 851 | |
| 852 | /* Return the number of bytes in size class I, as a uint. */ |
| 853 | #define INDEX2SIZE(I) (((uint)(I) + 1) << ALIGNMENT_SHIFT) |
| 854 | |
| 855 | /* |
| 856 | * Max size threshold below which malloc requests are considered to be |
| 857 | * small enough in order to use preallocated memory pools. You can tune |
| 858 | * this value according to your application behaviour and memory needs. |
| 859 | * |
| 860 | * Note: a size threshold of 512 guarantees that newly created dictionaries |
| 861 | * will be allocated from preallocated memory pools on 64-bit. |
| 862 | * |
| 863 | * The following invariants must hold: |
| 864 | * 1) ALIGNMENT <= SMALL_REQUEST_THRESHOLD <= 512 |
| 865 | * 2) SMALL_REQUEST_THRESHOLD is evenly divisible by ALIGNMENT |
| 866 | * |
| 867 | * Although not required, for better performance and space efficiency, |
| 868 | * it is recommended that SMALL_REQUEST_THRESHOLD is set to a power of 2. |
| 869 | */ |
| 870 | #define SMALL_REQUEST_THRESHOLD 512 |
| 871 | #define NB_SMALL_SIZE_CLASSES (SMALL_REQUEST_THRESHOLD / ALIGNMENT) |
| 872 | |
| 873 | /* |
| 874 | * The system's VMM page size can be obtained on most unices with a |
| 875 | * getpagesize() call or deduced from various header files. To make |
| 876 | * things simpler, we assume that it is 4K, which is OK for most systems. |
| 877 | * It is probably better if this is the native page size, but it doesn't |
| 878 | * have to be. In theory, if SYSTEM_PAGE_SIZE is larger than the native page |
| 879 | * size, then `POOL_ADDR(p)->arenaindex' could rarely cause a segmentation |
| 880 | * violation fault. 4K is apparently OK for all the platforms that python |
| 881 | * currently targets. |
| 882 | */ |
| 883 | #define SYSTEM_PAGE_SIZE (4 * 1024) |
| 884 | #define SYSTEM_PAGE_SIZE_MASK (SYSTEM_PAGE_SIZE - 1) |
| 885 | |
| 886 | /* |
| 887 | * Maximum amount of memory managed by the allocator for small requests. |
| 888 | */ |
| 889 | #ifdef WITH_MEMORY_LIMITS |
| 890 | #ifndef SMALL_MEMORY_LIMIT |
| 891 | #define SMALL_MEMORY_LIMIT (64 * 1024 * 1024) /* 64 MB -- more? */ |
| 892 | #endif |
| 893 | #endif |
| 894 | |
| 895 | /* |
| 896 | * The allocator sub-allocates <Big> blocks of memory (called arenas) aligned |
| 897 | * on a page boundary. This is a reserved virtual address space for the |
| 898 | * current process (obtained through a malloc()/mmap() call). In no way this |
| 899 | * means that the memory arenas will be used entirely. A malloc(<Big>) is |
| 900 | * usually an address range reservation for <Big> bytes, unless all pages within |
| 901 | * this space are referenced subsequently. So malloc'ing big blocks and not |
| 902 | * using them does not mean "wasting memory". It's an addressable range |
| 903 | * wastage... |
| 904 | * |
| 905 | * Arenas are allocated with mmap() on systems supporting anonymous memory |
| 906 | * mappings to reduce heap fragmentation. |
| 907 | */ |
| 908 | #define ARENA_SIZE (256 << 10) /* 256KB */ |
| 909 | |
| 910 | #ifdef WITH_MEMORY_LIMITS |
| 911 | #define MAX_ARENAS (SMALL_MEMORY_LIMIT / ARENA_SIZE) |
| 912 | #endif |
| 913 | |
| 914 | /* |
| 915 | * Size of the pools used for small blocks. Should be a power of 2, |
| 916 | * between 1K and SYSTEM_PAGE_SIZE, that is: 1k, 2k, 4k. |
| 917 | */ |
| 918 | #define POOL_SIZE SYSTEM_PAGE_SIZE /* must be 2^N */ |
| 919 | #define POOL_SIZE_MASK SYSTEM_PAGE_SIZE_MASK |
| 920 | |
Tim Peters | 1c263e3 | 2019-05-31 21:16:04 -0500 | [diff] [blame] | 921 | #define MAX_POOLS_IN_ARENA (ARENA_SIZE / POOL_SIZE) |
| 922 | #if MAX_POOLS_IN_ARENA * POOL_SIZE != ARENA_SIZE |
| 923 | # error "arena size not an exact multiple of pool size" |
| 924 | #endif |
| 925 | |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 926 | /* |
| 927 | * -- End of tunable settings section -- |
| 928 | */ |
| 929 | |
| 930 | /*==========================================================================*/ |
| 931 | |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 932 | /* When you say memory, my mind reasons in terms of (pointers to) blocks */ |
| 933 | typedef uint8_t block; |
| 934 | |
| 935 | /* Pool for small blocks. */ |
| 936 | struct pool_header { |
| 937 | union { block *_padding; |
| 938 | uint count; } ref; /* number of allocated blocks */ |
| 939 | block *freeblock; /* pool's free list head */ |
| 940 | struct pool_header *nextpool; /* next pool of this size class */ |
| 941 | struct pool_header *prevpool; /* previous pool "" */ |
| 942 | uint arenaindex; /* index into arenas of base adr */ |
| 943 | uint szidx; /* block size class index */ |
| 944 | uint nextoffset; /* bytes to virgin block */ |
| 945 | uint maxnextoffset; /* largest valid nextoffset */ |
| 946 | }; |
| 947 | |
| 948 | typedef struct pool_header *poolp; |
| 949 | |
| 950 | /* Record keeping for arenas. */ |
| 951 | struct arena_object { |
| 952 | /* The address of the arena, as returned by malloc. Note that 0 |
| 953 | * will never be returned by a successful malloc, and is used |
| 954 | * here to mark an arena_object that doesn't correspond to an |
| 955 | * allocated arena. |
| 956 | */ |
| 957 | uintptr_t address; |
| 958 | |
| 959 | /* Pool-aligned pointer to the next pool to be carved off. */ |
| 960 | block* pool_address; |
| 961 | |
| 962 | /* The number of available pools in the arena: free pools + never- |
| 963 | * allocated pools. |
| 964 | */ |
| 965 | uint nfreepools; |
| 966 | |
| 967 | /* The total number of pools in the arena, whether or not available. */ |
| 968 | uint ntotalpools; |
| 969 | |
| 970 | /* Singly-linked list of available pools. */ |
| 971 | struct pool_header* freepools; |
| 972 | |
| 973 | /* Whenever this arena_object is not associated with an allocated |
| 974 | * arena, the nextarena member is used to link all unassociated |
| 975 | * arena_objects in the singly-linked `unused_arena_objects` list. |
| 976 | * The prevarena member is unused in this case. |
| 977 | * |
| 978 | * When this arena_object is associated with an allocated arena |
| 979 | * with at least one available pool, both members are used in the |
| 980 | * doubly-linked `usable_arenas` list, which is maintained in |
| 981 | * increasing order of `nfreepools` values. |
| 982 | * |
| 983 | * Else this arena_object is associated with an allocated arena |
| 984 | * all of whose pools are in use. `nextarena` and `prevarena` |
| 985 | * are both meaningless in this case. |
| 986 | */ |
| 987 | struct arena_object* nextarena; |
| 988 | struct arena_object* prevarena; |
| 989 | }; |
| 990 | |
| 991 | #define POOL_OVERHEAD _Py_SIZE_ROUND_UP(sizeof(struct pool_header), ALIGNMENT) |
| 992 | |
| 993 | #define DUMMY_SIZE_IDX 0xffff /* size class of newly cached pools */ |
| 994 | |
| 995 | /* Round pointer P down to the closest pool-aligned address <= P, as a poolp */ |
| 996 | #define POOL_ADDR(P) ((poolp)_Py_ALIGN_DOWN((P), POOL_SIZE)) |
| 997 | |
| 998 | /* Return total number of blocks in pool of size index I, as a uint. */ |
| 999 | #define NUMBLOCKS(I) ((uint)(POOL_SIZE - POOL_OVERHEAD) / INDEX2SIZE(I)) |
| 1000 | |
| 1001 | /*==========================================================================*/ |
| 1002 | |
| 1003 | /* |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1004 | * Pool table -- headed, circular, doubly-linked lists of partially used pools. |
| 1005 | |
| 1006 | This is involved. For an index i, usedpools[i+i] is the header for a list of |
| 1007 | all partially used pools holding small blocks with "size class idx" i. So |
| 1008 | usedpools[0] corresponds to blocks of size 8, usedpools[2] to blocks of size |
| 1009 | 16, and so on: index 2*i <-> blocks of size (i+1)<<ALIGNMENT_SHIFT. |
| 1010 | |
| 1011 | Pools are carved off an arena's highwater mark (an arena_object's pool_address |
| 1012 | member) as needed. Once carved off, a pool is in one of three states forever |
| 1013 | after: |
| 1014 | |
| 1015 | used == partially used, neither empty nor full |
| 1016 | At least one block in the pool is currently allocated, and at least one |
| 1017 | block in the pool is not currently allocated (note this implies a pool |
| 1018 | has room for at least two blocks). |
| 1019 | This is a pool's initial state, as a pool is created only when malloc |
| 1020 | needs space. |
| 1021 | The pool holds blocks of a fixed size, and is in the circular list headed |
| 1022 | at usedpools[i] (see above). It's linked to the other used pools of the |
| 1023 | same size class via the pool_header's nextpool and prevpool members. |
| 1024 | If all but one block is currently allocated, a malloc can cause a |
| 1025 | transition to the full state. If all but one block is not currently |
| 1026 | allocated, a free can cause a transition to the empty state. |
| 1027 | |
| 1028 | full == all the pool's blocks are currently allocated |
| 1029 | On transition to full, a pool is unlinked from its usedpools[] list. |
| 1030 | It's not linked to from anything then anymore, and its nextpool and |
| 1031 | prevpool members are meaningless until it transitions back to used. |
| 1032 | A free of a block in a full pool puts the pool back in the used state. |
| 1033 | Then it's linked in at the front of the appropriate usedpools[] list, so |
| 1034 | that the next allocation for its size class will reuse the freed block. |
| 1035 | |
| 1036 | empty == all the pool's blocks are currently available for allocation |
| 1037 | On transition to empty, a pool is unlinked from its usedpools[] list, |
| 1038 | and linked to the front of its arena_object's singly-linked freepools list, |
| 1039 | via its nextpool member. The prevpool member has no meaning in this case. |
| 1040 | Empty pools have no inherent size class: the next time a malloc finds |
| 1041 | an empty list in usedpools[], it takes the first pool off of freepools. |
| 1042 | If the size class needed happens to be the same as the size class the pool |
| 1043 | last had, some pool initialization can be skipped. |
| 1044 | |
| 1045 | |
| 1046 | Block Management |
| 1047 | |
| 1048 | Blocks within pools are again carved out as needed. pool->freeblock points to |
| 1049 | the start of a singly-linked list of free blocks within the pool. When a |
| 1050 | block is freed, it's inserted at the front of its pool's freeblock list. Note |
| 1051 | that the available blocks in a pool are *not* linked all together when a pool |
| 1052 | is initialized. Instead only "the first two" (lowest addresses) blocks are |
| 1053 | set up, returning the first such block, and setting pool->freeblock to a |
| 1054 | one-block list holding the second such block. This is consistent with that |
| 1055 | pymalloc strives at all levels (arena, pool, and block) never to touch a piece |
| 1056 | of memory until it's actually needed. |
| 1057 | |
| 1058 | So long as a pool is in the used state, we're certain there *is* a block |
| 1059 | available for allocating, and pool->freeblock is not NULL. If pool->freeblock |
| 1060 | points to the end of the free list before we've carved the entire pool into |
| 1061 | blocks, that means we simply haven't yet gotten to one of the higher-address |
| 1062 | blocks. The offset from the pool_header to the start of "the next" virgin |
| 1063 | block is stored in the pool_header nextoffset member, and the largest value |
| 1064 | of nextoffset that makes sense is stored in the maxnextoffset member when a |
| 1065 | pool is initialized. All the blocks in a pool have been passed out at least |
| 1066 | once when and only when nextoffset > maxnextoffset. |
| 1067 | |
| 1068 | |
| 1069 | Major obscurity: While the usedpools vector is declared to have poolp |
| 1070 | entries, it doesn't really. It really contains two pointers per (conceptual) |
| 1071 | poolp entry, the nextpool and prevpool members of a pool_header. The |
| 1072 | excruciating initialization code below fools C so that |
| 1073 | |
| 1074 | usedpool[i+i] |
| 1075 | |
| 1076 | "acts like" a genuine poolp, but only so long as you only reference its |
| 1077 | nextpool and prevpool members. The "- 2*sizeof(block *)" gibberish is |
| 1078 | compensating for that a pool_header's nextpool and prevpool members |
| 1079 | immediately follow a pool_header's first two members: |
| 1080 | |
| 1081 | union { block *_padding; |
| 1082 | uint count; } ref; |
| 1083 | block *freeblock; |
| 1084 | |
| 1085 | each of which consume sizeof(block *) bytes. So what usedpools[i+i] really |
| 1086 | contains is a fudged-up pointer p such that *if* C believes it's a poolp |
| 1087 | pointer, then p->nextpool and p->prevpool are both p (meaning that the headed |
| 1088 | circular list is empty). |
| 1089 | |
| 1090 | It's unclear why the usedpools setup is so convoluted. It could be to |
| 1091 | minimize the amount of cache required to hold this heavily-referenced table |
| 1092 | (which only *needs* the two interpool pointer members of a pool_header). OTOH, |
| 1093 | referencing code has to remember to "double the index" and doing so isn't |
| 1094 | free, usedpools[0] isn't a strictly legal pointer, and we're crucially relying |
| 1095 | on that C doesn't insert any padding anywhere in a pool_header at or before |
| 1096 | the prevpool member. |
| 1097 | **************************************************************************** */ |
| 1098 | |
| 1099 | #define PTA(x) ((poolp )((uint8_t *)&(usedpools[2*(x)]) - 2*sizeof(block *))) |
| 1100 | #define PT(x) PTA(x), PTA(x) |
| 1101 | |
| 1102 | static poolp usedpools[2 * ((NB_SMALL_SIZE_CLASSES + 7) / 8) * 8] = { |
| 1103 | PT(0), PT(1), PT(2), PT(3), PT(4), PT(5), PT(6), PT(7) |
| 1104 | #if NB_SMALL_SIZE_CLASSES > 8 |
| 1105 | , PT(8), PT(9), PT(10), PT(11), PT(12), PT(13), PT(14), PT(15) |
| 1106 | #if NB_SMALL_SIZE_CLASSES > 16 |
| 1107 | , PT(16), PT(17), PT(18), PT(19), PT(20), PT(21), PT(22), PT(23) |
| 1108 | #if NB_SMALL_SIZE_CLASSES > 24 |
| 1109 | , PT(24), PT(25), PT(26), PT(27), PT(28), PT(29), PT(30), PT(31) |
| 1110 | #if NB_SMALL_SIZE_CLASSES > 32 |
| 1111 | , PT(32), PT(33), PT(34), PT(35), PT(36), PT(37), PT(38), PT(39) |
| 1112 | #if NB_SMALL_SIZE_CLASSES > 40 |
| 1113 | , PT(40), PT(41), PT(42), PT(43), PT(44), PT(45), PT(46), PT(47) |
| 1114 | #if NB_SMALL_SIZE_CLASSES > 48 |
| 1115 | , PT(48), PT(49), PT(50), PT(51), PT(52), PT(53), PT(54), PT(55) |
| 1116 | #if NB_SMALL_SIZE_CLASSES > 56 |
| 1117 | , PT(56), PT(57), PT(58), PT(59), PT(60), PT(61), PT(62), PT(63) |
| 1118 | #if NB_SMALL_SIZE_CLASSES > 64 |
| 1119 | #error "NB_SMALL_SIZE_CLASSES should be less than 64" |
| 1120 | #endif /* NB_SMALL_SIZE_CLASSES > 64 */ |
| 1121 | #endif /* NB_SMALL_SIZE_CLASSES > 56 */ |
| 1122 | #endif /* NB_SMALL_SIZE_CLASSES > 48 */ |
| 1123 | #endif /* NB_SMALL_SIZE_CLASSES > 40 */ |
| 1124 | #endif /* NB_SMALL_SIZE_CLASSES > 32 */ |
| 1125 | #endif /* NB_SMALL_SIZE_CLASSES > 24 */ |
| 1126 | #endif /* NB_SMALL_SIZE_CLASSES > 16 */ |
| 1127 | #endif /* NB_SMALL_SIZE_CLASSES > 8 */ |
| 1128 | }; |
| 1129 | |
| 1130 | /*========================================================================== |
| 1131 | Arena management. |
| 1132 | |
| 1133 | `arenas` is a vector of arena_objects. It contains maxarenas entries, some of |
| 1134 | which may not be currently used (== they're arena_objects that aren't |
| 1135 | currently associated with an allocated arena). Note that arenas proper are |
| 1136 | separately malloc'ed. |
| 1137 | |
| 1138 | Prior to Python 2.5, arenas were never free()'ed. Starting with Python 2.5, |
| 1139 | we do try to free() arenas, and use some mild heuristic strategies to increase |
| 1140 | the likelihood that arenas eventually can be freed. |
| 1141 | |
| 1142 | unused_arena_objects |
| 1143 | |
| 1144 | This is a singly-linked list of the arena_objects that are currently not |
| 1145 | being used (no arena is associated with them). Objects are taken off the |
| 1146 | head of the list in new_arena(), and are pushed on the head of the list in |
| 1147 | PyObject_Free() when the arena is empty. Key invariant: an arena_object |
| 1148 | is on this list if and only if its .address member is 0. |
| 1149 | |
| 1150 | usable_arenas |
| 1151 | |
| 1152 | This is a doubly-linked list of the arena_objects associated with arenas |
| 1153 | that have pools available. These pools are either waiting to be reused, |
| 1154 | or have not been used before. The list is sorted to have the most- |
| 1155 | allocated arenas first (ascending order based on the nfreepools member). |
| 1156 | This means that the next allocation will come from a heavily used arena, |
| 1157 | which gives the nearly empty arenas a chance to be returned to the system. |
| 1158 | In my unscientific tests this dramatically improved the number of arenas |
| 1159 | that could be freed. |
| 1160 | |
| 1161 | Note that an arena_object associated with an arena all of whose pools are |
| 1162 | currently in use isn't on either list. |
Tim Peters | 1c263e3 | 2019-05-31 21:16:04 -0500 | [diff] [blame] | 1163 | |
| 1164 | Changed in Python 3.8: keeping usable_arenas sorted by number of free pools |
| 1165 | used to be done by one-at-a-time linear search when an arena's number of |
| 1166 | free pools changed. That could, overall, consume time quadratic in the |
| 1167 | number of arenas. That didn't really matter when there were only a few |
| 1168 | hundred arenas (typical!), but could be a timing disaster when there were |
| 1169 | hundreds of thousands. See bpo-37029. |
| 1170 | |
| 1171 | Now we have a vector of "search fingers" to eliminate the need to search: |
| 1172 | nfp2lasta[nfp] returns the last ("rightmost") arena in usable_arenas |
| 1173 | with nfp free pools. This is NULL if and only if there is no arena with |
| 1174 | nfp free pools in usable_arenas. |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1175 | */ |
| 1176 | |
| 1177 | /* Array of objects used to track chunks of memory (arenas). */ |
| 1178 | static struct arena_object* arenas = NULL; |
| 1179 | /* Number of slots currently allocated in the `arenas` vector. */ |
| 1180 | static uint maxarenas = 0; |
| 1181 | |
| 1182 | /* The head of the singly-linked, NULL-terminated list of available |
| 1183 | * arena_objects. |
| 1184 | */ |
| 1185 | static struct arena_object* unused_arena_objects = NULL; |
| 1186 | |
| 1187 | /* The head of the doubly-linked, NULL-terminated at each end, list of |
| 1188 | * arena_objects associated with arenas that have pools available. |
| 1189 | */ |
| 1190 | static struct arena_object* usable_arenas = NULL; |
| 1191 | |
Tim Peters | 1c263e3 | 2019-05-31 21:16:04 -0500 | [diff] [blame] | 1192 | /* nfp2lasta[nfp] is the last arena in usable_arenas with nfp free pools */ |
| 1193 | static struct arena_object* nfp2lasta[MAX_POOLS_IN_ARENA + 1] = { NULL }; |
| 1194 | |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1195 | /* How many arena_objects do we initially allocate? |
| 1196 | * 16 = can allocate 16 arenas = 16 * ARENA_SIZE = 4MB before growing the |
| 1197 | * `arenas` vector. |
| 1198 | */ |
| 1199 | #define INITIAL_ARENA_OBJECTS 16 |
| 1200 | |
| 1201 | /* Number of arenas allocated that haven't been free()'d. */ |
| 1202 | static size_t narenas_currently_allocated = 0; |
| 1203 | |
| 1204 | /* Total number of times malloc() called to allocate an arena. */ |
| 1205 | static size_t ntimes_arena_allocated = 0; |
| 1206 | /* High water mark (max value ever seen) for narenas_currently_allocated. */ |
| 1207 | static size_t narenas_highwater = 0; |
| 1208 | |
| 1209 | static Py_ssize_t _Py_AllocatedBlocks = 0; |
| 1210 | |
Antoine Pitrou | f9d0b12 | 2012-12-09 14:28:26 +0100 | [diff] [blame] | 1211 | Py_ssize_t |
| 1212 | _Py_GetAllocatedBlocks(void) |
| 1213 | { |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1214 | return _Py_AllocatedBlocks; |
Antoine Pitrou | f9d0b12 | 2012-12-09 14:28:26 +0100 | [diff] [blame] | 1215 | } |
| 1216 | |
| 1217 | |
Thomas Wouters | a977329 | 2006-04-21 09:43:23 +0000 | [diff] [blame] | 1218 | /* Allocate a new arena. If we run out of memory, return NULL. Else |
| 1219 | * allocate a new arena, and return the address of an arena_object |
| 1220 | * describing the new arena. It's expected that the caller will set |
| 1221 | * `usable_arenas` to the return value. |
| 1222 | */ |
| 1223 | static struct arena_object* |
Tim Peters | d97a1c0 | 2002-03-30 06:09:22 +0000 | [diff] [blame] | 1224 | new_arena(void) |
| 1225 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1226 | struct arena_object* arenaobj; |
| 1227 | uint excess; /* number of bytes above pool alignment */ |
Victor Stinner | ba10882 | 2012-03-10 00:21:44 +0100 | [diff] [blame] | 1228 | void *address; |
Victor Stinner | 34be807 | 2016-03-14 12:04:26 +0100 | [diff] [blame] | 1229 | static int debug_stats = -1; |
Tim Peters | d97a1c0 | 2002-03-30 06:09:22 +0000 | [diff] [blame] | 1230 | |
Victor Stinner | 34be807 | 2016-03-14 12:04:26 +0100 | [diff] [blame] | 1231 | if (debug_stats == -1) { |
Serhiy Storchaka | 4ae06c5 | 2017-12-12 13:55:04 +0200 | [diff] [blame] | 1232 | const char *opt = Py_GETENV("PYTHONMALLOCSTATS"); |
Victor Stinner | 34be807 | 2016-03-14 12:04:26 +0100 | [diff] [blame] | 1233 | debug_stats = (opt != NULL && *opt != '\0'); |
| 1234 | } |
| 1235 | if (debug_stats) |
David Malcolm | 49526f4 | 2012-06-22 14:55:41 -0400 | [diff] [blame] | 1236 | _PyObject_DebugMallocStats(stderr); |
Victor Stinner | 34be807 | 2016-03-14 12:04:26 +0100 | [diff] [blame] | 1237 | |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1238 | if (unused_arena_objects == NULL) { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1239 | uint i; |
| 1240 | uint numarenas; |
| 1241 | size_t nbytes; |
Tim Peters | 0e87118 | 2002-04-13 08:29:14 +0000 | [diff] [blame] | 1242 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1243 | /* Double the number of arena objects on each allocation. |
| 1244 | * Note that it's possible for `numarenas` to overflow. |
| 1245 | */ |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1246 | numarenas = maxarenas ? maxarenas << 1 : INITIAL_ARENA_OBJECTS; |
| 1247 | if (numarenas <= maxarenas) |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1248 | return NULL; /* overflow */ |
Martin v. Löwis | 5aca882 | 2008-09-11 06:55:48 +0000 | [diff] [blame] | 1249 | #if SIZEOF_SIZE_T <= SIZEOF_INT |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1250 | if (numarenas > SIZE_MAX / sizeof(*arenas)) |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1251 | return NULL; /* overflow */ |
Martin v. Löwis | 5aca882 | 2008-09-11 06:55:48 +0000 | [diff] [blame] | 1252 | #endif |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1253 | nbytes = numarenas * sizeof(*arenas); |
| 1254 | arenaobj = (struct arena_object *)PyMem_RawRealloc(arenas, nbytes); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1255 | if (arenaobj == NULL) |
| 1256 | return NULL; |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1257 | arenas = arenaobj; |
Thomas Wouters | a977329 | 2006-04-21 09:43:23 +0000 | [diff] [blame] | 1258 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1259 | /* We might need to fix pointers that were copied. However, |
| 1260 | * new_arena only gets called when all the pages in the |
| 1261 | * previous arenas are full. Thus, there are *no* pointers |
| 1262 | * into the old array. Thus, we don't have to worry about |
| 1263 | * invalid pointers. Just to be sure, some asserts: |
| 1264 | */ |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1265 | assert(usable_arenas == NULL); |
| 1266 | assert(unused_arena_objects == NULL); |
Thomas Wouters | a977329 | 2006-04-21 09:43:23 +0000 | [diff] [blame] | 1267 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1268 | /* Put the new arenas on the unused_arena_objects list. */ |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1269 | for (i = maxarenas; i < numarenas; ++i) { |
| 1270 | arenas[i].address = 0; /* mark as unassociated */ |
| 1271 | arenas[i].nextarena = i < numarenas - 1 ? |
| 1272 | &arenas[i+1] : NULL; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1273 | } |
Thomas Wouters | a977329 | 2006-04-21 09:43:23 +0000 | [diff] [blame] | 1274 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1275 | /* Update globals. */ |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1276 | unused_arena_objects = &arenas[maxarenas]; |
| 1277 | maxarenas = numarenas; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1278 | } |
Tim Peters | d97a1c0 | 2002-03-30 06:09:22 +0000 | [diff] [blame] | 1279 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1280 | /* Take the next available arena object off the head of the list. */ |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1281 | assert(unused_arena_objects != NULL); |
| 1282 | arenaobj = unused_arena_objects; |
| 1283 | unused_arena_objects = arenaobj->nextarena; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1284 | assert(arenaobj->address == 0); |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1285 | address = _PyObject_Arena.alloc(_PyObject_Arena.ctx, ARENA_SIZE); |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 1286 | if (address == NULL) { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1287 | /* The allocation failed: return NULL after putting the |
| 1288 | * arenaobj back. |
| 1289 | */ |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1290 | arenaobj->nextarena = unused_arena_objects; |
| 1291 | unused_arena_objects = arenaobj; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1292 | return NULL; |
| 1293 | } |
Benjamin Peterson | 5d4b09c | 2016-09-18 19:24:52 -0700 | [diff] [blame] | 1294 | arenaobj->address = (uintptr_t)address; |
Tim Peters | d97a1c0 | 2002-03-30 06:09:22 +0000 | [diff] [blame] | 1295 | |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1296 | ++narenas_currently_allocated; |
| 1297 | ++ntimes_arena_allocated; |
| 1298 | if (narenas_currently_allocated > narenas_highwater) |
| 1299 | narenas_highwater = narenas_currently_allocated; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1300 | arenaobj->freepools = NULL; |
| 1301 | /* pool_address <- first pool-aligned address in the arena |
| 1302 | nfreepools <- number of whole pools that fit after alignment */ |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1303 | arenaobj->pool_address = (block*)arenaobj->address; |
Tim Peters | 1c263e3 | 2019-05-31 21:16:04 -0500 | [diff] [blame] | 1304 | arenaobj->nfreepools = MAX_POOLS_IN_ARENA; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1305 | excess = (uint)(arenaobj->address & POOL_SIZE_MASK); |
| 1306 | if (excess != 0) { |
| 1307 | --arenaobj->nfreepools; |
| 1308 | arenaobj->pool_address += POOL_SIZE - excess; |
| 1309 | } |
| 1310 | arenaobj->ntotalpools = arenaobj->nfreepools; |
Thomas Wouters | a977329 | 2006-04-21 09:43:23 +0000 | [diff] [blame] | 1311 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1312 | return arenaobj; |
Tim Peters | d97a1c0 | 2002-03-30 06:09:22 +0000 | [diff] [blame] | 1313 | } |
| 1314 | |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1315 | |
Thomas Wouters | a977329 | 2006-04-21 09:43:23 +0000 | [diff] [blame] | 1316 | /* |
Benjamin Peterson | 3924f93 | 2016-09-18 19:12:48 -0700 | [diff] [blame] | 1317 | address_in_range(P, POOL) |
Thomas Wouters | a977329 | 2006-04-21 09:43:23 +0000 | [diff] [blame] | 1318 | |
| 1319 | Return true if and only if P is an address that was allocated by pymalloc. |
| 1320 | POOL must be the pool address associated with P, i.e., POOL = POOL_ADDR(P) |
| 1321 | (the caller is asked to compute this because the macro expands POOL more than |
| 1322 | once, and for efficiency it's best for the caller to assign POOL_ADDR(P) to a |
Benjamin Peterson | 3924f93 | 2016-09-18 19:12:48 -0700 | [diff] [blame] | 1323 | variable and pass the latter to the macro; because address_in_range is |
Thomas Wouters | a977329 | 2006-04-21 09:43:23 +0000 | [diff] [blame] | 1324 | called on every alloc/realloc/free, micro-efficiency is important here). |
| 1325 | |
| 1326 | Tricky: Let B be the arena base address associated with the pool, B = |
| 1327 | arenas[(POOL)->arenaindex].address. Then P belongs to the arena if and only if |
| 1328 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1329 | B <= P < B + ARENA_SIZE |
Thomas Wouters | a977329 | 2006-04-21 09:43:23 +0000 | [diff] [blame] | 1330 | |
| 1331 | Subtracting B throughout, this is true iff |
| 1332 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1333 | 0 <= P-B < ARENA_SIZE |
Thomas Wouters | a977329 | 2006-04-21 09:43:23 +0000 | [diff] [blame] | 1334 | |
| 1335 | By using unsigned arithmetic, the "0 <=" half of the test can be skipped. |
| 1336 | |
| 1337 | Obscure: A PyMem "free memory" function can call the pymalloc free or realloc |
| 1338 | before the first arena has been allocated. `arenas` is still NULL in that |
| 1339 | case. We're relying on that maxarenas is also 0 in that case, so that |
| 1340 | (POOL)->arenaindex < maxarenas must be false, saving us from trying to index |
| 1341 | into a NULL arenas. |
| 1342 | |
| 1343 | Details: given P and POOL, the arena_object corresponding to P is AO = |
| 1344 | arenas[(POOL)->arenaindex]. Suppose obmalloc controls P. Then (barring wild |
| 1345 | stores, etc), POOL is the correct address of P's pool, AO.address is the |
| 1346 | correct base address of the pool's arena, and P must be within ARENA_SIZE of |
| 1347 | AO.address. In addition, AO.address is not 0 (no arena can start at address 0 |
Benjamin Peterson | 3924f93 | 2016-09-18 19:12:48 -0700 | [diff] [blame] | 1348 | (NULL)). Therefore address_in_range correctly reports that obmalloc |
Thomas Wouters | a977329 | 2006-04-21 09:43:23 +0000 | [diff] [blame] | 1349 | controls P. |
| 1350 | |
| 1351 | Now suppose obmalloc does not control P (e.g., P was obtained via a direct |
| 1352 | call to the system malloc() or realloc()). (POOL)->arenaindex may be anything |
| 1353 | in this case -- it may even be uninitialized trash. If the trash arenaindex |
| 1354 | is >= maxarenas, the macro correctly concludes at once that obmalloc doesn't |
| 1355 | control P. |
| 1356 | |
| 1357 | Else arenaindex is < maxarena, and AO is read up. If AO corresponds to an |
| 1358 | allocated arena, obmalloc controls all the memory in slice AO.address : |
| 1359 | AO.address+ARENA_SIZE. By case assumption, P is not controlled by obmalloc, |
| 1360 | so P doesn't lie in that slice, so the macro correctly reports that P is not |
| 1361 | controlled by obmalloc. |
| 1362 | |
| 1363 | Finally, if P is not controlled by obmalloc and AO corresponds to an unused |
| 1364 | arena_object (one not currently associated with an allocated arena), |
| 1365 | AO.address is 0, and the second test in the macro reduces to: |
| 1366 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1367 | P < ARENA_SIZE |
Thomas Wouters | a977329 | 2006-04-21 09:43:23 +0000 | [diff] [blame] | 1368 | |
| 1369 | If P >= ARENA_SIZE (extremely likely), the macro again correctly concludes |
| 1370 | that P is not controlled by obmalloc. However, if P < ARENA_SIZE, this part |
| 1371 | of the test still passes, and the third clause (AO.address != 0) is necessary |
| 1372 | to get the correct result: AO.address is 0 in this case, so the macro |
| 1373 | correctly reports that P is not controlled by obmalloc (despite that P lies in |
| 1374 | slice AO.address : AO.address + ARENA_SIZE). |
| 1375 | |
| 1376 | Note: The third (AO.address != 0) clause was added in Python 2.5. Before |
| 1377 | 2.5, arenas were never free()'ed, and an arenaindex < maxarena always |
| 1378 | corresponded to a currently-allocated arena, so the "P is not controlled by |
| 1379 | obmalloc, AO corresponds to an unused arena_object, and P < ARENA_SIZE" case |
| 1380 | was impossible. |
| 1381 | |
| 1382 | Note that the logic is excruciating, and reading up possibly uninitialized |
| 1383 | memory when P is not controlled by obmalloc (to get at (POOL)->arenaindex) |
| 1384 | creates problems for some memory debuggers. The overwhelming advantage is |
| 1385 | that this test determines whether an arbitrary address is controlled by |
| 1386 | obmalloc in a small constant time, independent of the number of arenas |
| 1387 | obmalloc controls. Since this test is needed at every entry point, it's |
| 1388 | extremely desirable that it be this fast. |
| 1389 | */ |
Thomas Wouters | a977329 | 2006-04-21 09:43:23 +0000 | [diff] [blame] | 1390 | |
Alexey Izbyshev | fd3a91c | 2018-11-12 02:14:51 +0300 | [diff] [blame] | 1391 | static bool _Py_NO_ADDRESS_SAFETY_ANALYSIS |
| 1392 | _Py_NO_SANITIZE_THREAD |
| 1393 | _Py_NO_SANITIZE_MEMORY |
Benjamin Peterson | 3924f93 | 2016-09-18 19:12:48 -0700 | [diff] [blame] | 1394 | address_in_range(void *p, poolp pool) |
| 1395 | { |
| 1396 | // Since address_in_range may be reading from memory which was not allocated |
| 1397 | // by Python, it is important that pool->arenaindex is read only once, as |
| 1398 | // another thread may be concurrently modifying the value without holding |
| 1399 | // the GIL. The following dance forces the compiler to read pool->arenaindex |
| 1400 | // only once. |
| 1401 | uint arenaindex = *((volatile uint *)&pool->arenaindex); |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1402 | return arenaindex < maxarenas && |
| 1403 | (uintptr_t)p - arenas[arenaindex].address < ARENA_SIZE && |
| 1404 | arenas[arenaindex].address != 0; |
Benjamin Peterson | 3924f93 | 2016-09-18 19:12:48 -0700 | [diff] [blame] | 1405 | } |
Tim Peters | 338e010 | 2002-04-01 19:23:44 +0000 | [diff] [blame] | 1406 | |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1407 | |
Neil Schemenauer | a35c688 | 2001-02-27 04:45:05 +0000 | [diff] [blame] | 1408 | /*==========================================================================*/ |
| 1409 | |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1410 | /* pymalloc allocator |
Neil Schemenauer | a35c688 | 2001-02-27 04:45:05 +0000 | [diff] [blame] | 1411 | |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1412 | The basic blocks are ordered by decreasing execution frequency, |
| 1413 | which minimizes the number of jumps in the most common cases, |
| 1414 | improves branching prediction and instruction scheduling (small |
| 1415 | block allocations typically result in a couple of instructions). |
| 1416 | Unless the optimizer reorders everything, being too smart... |
Neil Schemenauer | a35c688 | 2001-02-27 04:45:05 +0000 | [diff] [blame] | 1417 | |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1418 | Return 1 if pymalloc allocated memory and wrote the pointer into *ptr_p. |
| 1419 | |
| 1420 | Return 0 if pymalloc failed to allocate the memory block: on bigger |
| 1421 | requests, on error in the code below (as a last chance to serve the request) |
| 1422 | or when the max memory limit has been reached. */ |
| 1423 | static int |
| 1424 | pymalloc_alloc(void *ctx, void **ptr_p, size_t nbytes) |
Neil Schemenauer | a35c688 | 2001-02-27 04:45:05 +0000 | [diff] [blame] | 1425 | { |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1426 | block *bp; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1427 | poolp pool; |
| 1428 | poolp next; |
| 1429 | uint size; |
Neil Schemenauer | a35c688 | 2001-02-27 04:45:05 +0000 | [diff] [blame] | 1430 | |
Benjamin Peterson | 05159c4 | 2009-12-03 03:01:27 +0000 | [diff] [blame] | 1431 | #ifdef WITH_VALGRIND |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1432 | if (UNLIKELY(running_on_valgrind == -1)) { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1433 | running_on_valgrind = RUNNING_ON_VALGRIND; |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1434 | } |
| 1435 | if (UNLIKELY(running_on_valgrind)) { |
| 1436 | return 0; |
| 1437 | } |
Benjamin Peterson | 05159c4 | 2009-12-03 03:01:27 +0000 | [diff] [blame] | 1438 | #endif |
| 1439 | |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1440 | if (nbytes == 0) { |
| 1441 | return 0; |
| 1442 | } |
| 1443 | if (nbytes > SMALL_REQUEST_THRESHOLD) { |
| 1444 | return 0; |
| 1445 | } |
T. Wouters | 06bb487 | 2017-03-31 10:10:19 -0700 | [diff] [blame] | 1446 | |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1447 | /* |
| 1448 | * Most frequent paths first |
| 1449 | */ |
| 1450 | size = (uint)(nbytes - 1) >> ALIGNMENT_SHIFT; |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1451 | pool = usedpools[size + size]; |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1452 | if (pool != pool->nextpool) { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1453 | /* |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1454 | * There is a used pool for this size class. |
| 1455 | * Pick up the head block of its free list. |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1456 | */ |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1457 | ++pool->ref.count; |
| 1458 | bp = pool->freeblock; |
| 1459 | assert(bp != NULL); |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1460 | if ((pool->freeblock = *(block **)bp) != NULL) { |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1461 | goto success; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1462 | } |
Thomas Wouters | a977329 | 2006-04-21 09:43:23 +0000 | [diff] [blame] | 1463 | |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1464 | /* |
| 1465 | * Reached the end of the free list, try to extend it. |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1466 | */ |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1467 | if (pool->nextoffset <= pool->maxnextoffset) { |
| 1468 | /* There is room for another block. */ |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1469 | pool->freeblock = (block*)pool + |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1470 | pool->nextoffset; |
| 1471 | pool->nextoffset += INDEX2SIZE(size); |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1472 | *(block **)(pool->freeblock) = NULL; |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1473 | goto success; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1474 | } |
Thomas Wouters | a977329 | 2006-04-21 09:43:23 +0000 | [diff] [blame] | 1475 | |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1476 | /* Pool is full, unlink from used pools. */ |
| 1477 | next = pool->nextpool; |
| 1478 | pool = pool->prevpool; |
| 1479 | next->prevpool = pool; |
| 1480 | pool->nextpool = next; |
| 1481 | goto success; |
| 1482 | } |
Thomas Wouters | a977329 | 2006-04-21 09:43:23 +0000 | [diff] [blame] | 1483 | |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1484 | /* There isn't a pool of the right size class immediately |
| 1485 | * available: use a free pool. |
| 1486 | */ |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1487 | if (usable_arenas == NULL) { |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1488 | /* No arena has a free pool: allocate a new arena. */ |
| 1489 | #ifdef WITH_MEMORY_LIMITS |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1490 | if (narenas_currently_allocated >= MAX_ARENAS) { |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1491 | goto failed; |
| 1492 | } |
| 1493 | #endif |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1494 | usable_arenas = new_arena(); |
| 1495 | if (usable_arenas == NULL) { |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1496 | goto failed; |
| 1497 | } |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1498 | usable_arenas->nextarena = |
| 1499 | usable_arenas->prevarena = NULL; |
Tim Peters | 1c263e3 | 2019-05-31 21:16:04 -0500 | [diff] [blame] | 1500 | assert(nfp2lasta[usable_arenas->nfreepools] == NULL); |
| 1501 | nfp2lasta[usable_arenas->nfreepools] = usable_arenas; |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1502 | } |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1503 | assert(usable_arenas->address != 0); |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1504 | |
Tim Peters | 1c263e3 | 2019-05-31 21:16:04 -0500 | [diff] [blame] | 1505 | /* This arena already had the smallest nfreepools value, so decreasing |
| 1506 | * nfreepools doesn't change that, and we don't need to rearrange the |
| 1507 | * usable_arenas list. However, if the arena becomes wholly allocated, |
| 1508 | * we need to remove its arena_object from usable_arenas. |
| 1509 | */ |
| 1510 | assert(usable_arenas->nfreepools > 0); |
| 1511 | if (nfp2lasta[usable_arenas->nfreepools] == usable_arenas) { |
| 1512 | /* It's the last of this size, so there won't be any. */ |
| 1513 | nfp2lasta[usable_arenas->nfreepools] = NULL; |
| 1514 | } |
| 1515 | /* If any free pools will remain, it will be the new smallest. */ |
| 1516 | if (usable_arenas->nfreepools > 1) { |
| 1517 | assert(nfp2lasta[usable_arenas->nfreepools - 1] == NULL); |
| 1518 | nfp2lasta[usable_arenas->nfreepools - 1] = usable_arenas; |
| 1519 | } |
| 1520 | |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1521 | /* Try to get a cached free pool. */ |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1522 | pool = usable_arenas->freepools; |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1523 | if (pool != NULL) { |
| 1524 | /* Unlink from cached pools. */ |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1525 | usable_arenas->freepools = pool->nextpool; |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1526 | --usable_arenas->nfreepools; |
| 1527 | if (usable_arenas->nfreepools == 0) { |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1528 | /* Wholly allocated: remove. */ |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1529 | assert(usable_arenas->freepools == NULL); |
| 1530 | assert(usable_arenas->nextarena == NULL || |
| 1531 | usable_arenas->nextarena->prevarena == |
| 1532 | usable_arenas); |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1533 | usable_arenas = usable_arenas->nextarena; |
| 1534 | if (usable_arenas != NULL) { |
| 1535 | usable_arenas->prevarena = NULL; |
| 1536 | assert(usable_arenas->address != 0); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1537 | } |
| 1538 | } |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1539 | else { |
| 1540 | /* nfreepools > 0: it must be that freepools |
| 1541 | * isn't NULL, or that we haven't yet carved |
| 1542 | * off all the arena's pools for the first |
| 1543 | * time. |
| 1544 | */ |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1545 | assert(usable_arenas->freepools != NULL || |
| 1546 | usable_arenas->pool_address <= |
| 1547 | (block*)usable_arenas->address + |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1548 | ARENA_SIZE - POOL_SIZE); |
| 1549 | } |
Thomas Wouters | a977329 | 2006-04-21 09:43:23 +0000 | [diff] [blame] | 1550 | |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1551 | init_pool: |
| 1552 | /* Frontlink to used pools. */ |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1553 | next = usedpools[size + size]; /* == prev */ |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1554 | pool->nextpool = next; |
| 1555 | pool->prevpool = next; |
| 1556 | next->nextpool = pool; |
| 1557 | next->prevpool = pool; |
| 1558 | pool->ref.count = 1; |
| 1559 | if (pool->szidx == size) { |
| 1560 | /* Luckily, this pool last contained blocks |
| 1561 | * of the same size class, so its header |
| 1562 | * and free list are already initialized. |
| 1563 | */ |
| 1564 | bp = pool->freeblock; |
| 1565 | assert(bp != NULL); |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1566 | pool->freeblock = *(block **)bp; |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1567 | goto success; |
| 1568 | } |
| 1569 | /* |
| 1570 | * Initialize the pool header, set up the free list to |
| 1571 | * contain just the second block, and return the first |
| 1572 | * block. |
| 1573 | */ |
| 1574 | pool->szidx = size; |
| 1575 | size = INDEX2SIZE(size); |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1576 | bp = (block *)pool + POOL_OVERHEAD; |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1577 | pool->nextoffset = POOL_OVERHEAD + (size << 1); |
| 1578 | pool->maxnextoffset = POOL_SIZE - size; |
| 1579 | pool->freeblock = bp + size; |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1580 | *(block **)(pool->freeblock) = NULL; |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1581 | goto success; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1582 | } |
Neil Schemenauer | a35c688 | 2001-02-27 04:45:05 +0000 | [diff] [blame] | 1583 | |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1584 | /* Carve off a new pool. */ |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1585 | assert(usable_arenas->nfreepools > 0); |
| 1586 | assert(usable_arenas->freepools == NULL); |
| 1587 | pool = (poolp)usable_arenas->pool_address; |
| 1588 | assert((block*)pool <= (block*)usable_arenas->address + |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1589 | ARENA_SIZE - POOL_SIZE); |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1590 | pool->arenaindex = (uint)(usable_arenas - arenas); |
| 1591 | assert(&arenas[pool->arenaindex] == usable_arenas); |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1592 | pool->szidx = DUMMY_SIZE_IDX; |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1593 | usable_arenas->pool_address += POOL_SIZE; |
| 1594 | --usable_arenas->nfreepools; |
Neil Schemenauer | a35c688 | 2001-02-27 04:45:05 +0000 | [diff] [blame] | 1595 | |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1596 | if (usable_arenas->nfreepools == 0) { |
| 1597 | assert(usable_arenas->nextarena == NULL || |
| 1598 | usable_arenas->nextarena->prevarena == |
| 1599 | usable_arenas); |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1600 | /* Unlink the arena: it is completely allocated. */ |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1601 | usable_arenas = usable_arenas->nextarena; |
| 1602 | if (usable_arenas != NULL) { |
| 1603 | usable_arenas->prevarena = NULL; |
| 1604 | assert(usable_arenas->address != 0); |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1605 | } |
Antoine Pitrou | f9d0b12 | 2012-12-09 14:28:26 +0100 | [diff] [blame] | 1606 | } |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1607 | |
| 1608 | goto init_pool; |
| 1609 | |
| 1610 | success: |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1611 | assert(bp != NULL); |
| 1612 | *ptr_p = (void *)bp; |
| 1613 | return 1; |
| 1614 | |
| 1615 | failed: |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1616 | return 0; |
Neil Schemenauer | a35c688 | 2001-02-27 04:45:05 +0000 | [diff] [blame] | 1617 | } |
| 1618 | |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1619 | |
Victor Stinner | db067af | 2014-05-02 22:31:14 +0200 | [diff] [blame] | 1620 | static void * |
| 1621 | _PyObject_Malloc(void *ctx, size_t nbytes) |
| 1622 | { |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1623 | void* ptr; |
| 1624 | if (pymalloc_alloc(ctx, &ptr, nbytes)) { |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1625 | _Py_AllocatedBlocks++; |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1626 | return ptr; |
| 1627 | } |
| 1628 | |
| 1629 | ptr = PyMem_RawMalloc(nbytes); |
| 1630 | if (ptr != NULL) { |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1631 | _Py_AllocatedBlocks++; |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1632 | } |
| 1633 | return ptr; |
Victor Stinner | db067af | 2014-05-02 22:31:14 +0200 | [diff] [blame] | 1634 | } |
| 1635 | |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1636 | |
Victor Stinner | db067af | 2014-05-02 22:31:14 +0200 | [diff] [blame] | 1637 | static void * |
| 1638 | _PyObject_Calloc(void *ctx, size_t nelem, size_t elsize) |
| 1639 | { |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1640 | void* ptr; |
| 1641 | |
| 1642 | assert(elsize == 0 || nelem <= (size_t)PY_SSIZE_T_MAX / elsize); |
| 1643 | size_t nbytes = nelem * elsize; |
| 1644 | |
| 1645 | if (pymalloc_alloc(ctx, &ptr, nbytes)) { |
| 1646 | memset(ptr, 0, nbytes); |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1647 | _Py_AllocatedBlocks++; |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1648 | return ptr; |
| 1649 | } |
| 1650 | |
| 1651 | ptr = PyMem_RawCalloc(nelem, elsize); |
| 1652 | if (ptr != NULL) { |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1653 | _Py_AllocatedBlocks++; |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1654 | } |
| 1655 | return ptr; |
Victor Stinner | db067af | 2014-05-02 22:31:14 +0200 | [diff] [blame] | 1656 | } |
| 1657 | |
Neil Schemenauer | a35c688 | 2001-02-27 04:45:05 +0000 | [diff] [blame] | 1658 | |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1659 | /* Free a memory block allocated by pymalloc_alloc(). |
| 1660 | Return 1 if it was freed. |
| 1661 | Return 0 if the block was not allocated by pymalloc_alloc(). */ |
| 1662 | static int |
| 1663 | pymalloc_free(void *ctx, void *p) |
Neil Schemenauer | a35c688 | 2001-02-27 04:45:05 +0000 | [diff] [blame] | 1664 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1665 | poolp pool; |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1666 | block *lastfree; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1667 | poolp next, prev; |
| 1668 | uint size; |
Neil Schemenauer | a35c688 | 2001-02-27 04:45:05 +0000 | [diff] [blame] | 1669 | |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1670 | assert(p != NULL); |
Antoine Pitrou | f9d0b12 | 2012-12-09 14:28:26 +0100 | [diff] [blame] | 1671 | |
Benjamin Peterson | 05159c4 | 2009-12-03 03:01:27 +0000 | [diff] [blame] | 1672 | #ifdef WITH_VALGRIND |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1673 | if (UNLIKELY(running_on_valgrind > 0)) { |
| 1674 | return 0; |
| 1675 | } |
Benjamin Peterson | 05159c4 | 2009-12-03 03:01:27 +0000 | [diff] [blame] | 1676 | #endif |
| 1677 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1678 | pool = POOL_ADDR(p); |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1679 | if (!address_in_range(p, pool)) { |
| 1680 | return 0; |
| 1681 | } |
| 1682 | /* We allocated this address. */ |
Thomas Wouters | a977329 | 2006-04-21 09:43:23 +0000 | [diff] [blame] | 1683 | |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1684 | /* Link p to the start of the pool's freeblock list. Since |
| 1685 | * the pool had at least the p block outstanding, the pool |
| 1686 | * wasn't empty (so it's already in a usedpools[] list, or |
| 1687 | * was full and is in no list -- it's not in the freeblocks |
| 1688 | * list in any case). |
| 1689 | */ |
| 1690 | assert(pool->ref.count > 0); /* else it was empty */ |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1691 | *(block **)p = lastfree = pool->freeblock; |
| 1692 | pool->freeblock = (block *)p; |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1693 | if (!lastfree) { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1694 | /* Pool was full, so doesn't currently live in any list: |
| 1695 | * link it to the front of the appropriate usedpools[] list. |
| 1696 | * This mimics LRU pool usage for new allocations and |
| 1697 | * targets optimal filling when several pools contain |
| 1698 | * blocks of the same size class. |
| 1699 | */ |
| 1700 | --pool->ref.count; |
| 1701 | assert(pool->ref.count > 0); /* else the pool is empty */ |
| 1702 | size = pool->szidx; |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1703 | next = usedpools[size + size]; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1704 | prev = next->prevpool; |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1705 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1706 | /* insert pool before next: prev <-> pool <-> next */ |
| 1707 | pool->nextpool = next; |
| 1708 | pool->prevpool = prev; |
| 1709 | next->prevpool = pool; |
| 1710 | prev->nextpool = pool; |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1711 | goto success; |
| 1712 | } |
| 1713 | |
| 1714 | struct arena_object* ao; |
| 1715 | uint nf; /* ao->nfreepools */ |
| 1716 | |
| 1717 | /* freeblock wasn't NULL, so the pool wasn't full, |
| 1718 | * and the pool is in a usedpools[] list. |
| 1719 | */ |
| 1720 | if (--pool->ref.count != 0) { |
| 1721 | /* pool isn't empty: leave it in usedpools */ |
| 1722 | goto success; |
| 1723 | } |
| 1724 | /* Pool is now empty: unlink from usedpools, and |
| 1725 | * link to the front of freepools. This ensures that |
| 1726 | * previously freed pools will be allocated later |
| 1727 | * (being not referenced, they are perhaps paged out). |
| 1728 | */ |
| 1729 | next = pool->nextpool; |
| 1730 | prev = pool->prevpool; |
| 1731 | next->prevpool = prev; |
| 1732 | prev->nextpool = next; |
| 1733 | |
| 1734 | /* Link the pool to freepools. This is a singly-linked |
| 1735 | * list, and pool->prevpool isn't used there. |
| 1736 | */ |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1737 | ao = &arenas[pool->arenaindex]; |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1738 | pool->nextpool = ao->freepools; |
| 1739 | ao->freepools = pool; |
Tim Peters | 1c263e3 | 2019-05-31 21:16:04 -0500 | [diff] [blame] | 1740 | nf = ao->nfreepools; |
| 1741 | /* If this is the rightmost arena with this number of free pools, |
| 1742 | * nfp2lasta[nf] needs to change. Caution: if nf is 0, there |
| 1743 | * are no arenas in usable_arenas with that value. |
| 1744 | */ |
| 1745 | struct arena_object* lastnf = nfp2lasta[nf]; |
| 1746 | assert((nf == 0 && lastnf == NULL) || |
| 1747 | (nf > 0 && |
| 1748 | lastnf != NULL && |
| 1749 | lastnf->nfreepools == nf && |
| 1750 | (lastnf->nextarena == NULL || |
| 1751 | nf < lastnf->nextarena->nfreepools))); |
| 1752 | if (lastnf == ao) { /* it is the rightmost */ |
| 1753 | struct arena_object* p = ao->prevarena; |
| 1754 | nfp2lasta[nf] = (p != NULL && p->nfreepools == nf) ? p : NULL; |
| 1755 | } |
| 1756 | ao->nfreepools = ++nf; |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1757 | |
| 1758 | /* All the rest is arena management. We just freed |
| 1759 | * a pool, and there are 4 cases for arena mgmt: |
| 1760 | * 1. If all the pools are free, return the arena to |
| 1761 | * the system free(). |
| 1762 | * 2. If this is the only free pool in the arena, |
| 1763 | * add the arena back to the `usable_arenas` list. |
| 1764 | * 3. If the "next" arena has a smaller count of free |
| 1765 | * pools, we have to "slide this arena right" to |
| 1766 | * restore that usable_arenas is sorted in order of |
| 1767 | * nfreepools. |
| 1768 | * 4. Else there's nothing more to do. |
| 1769 | */ |
| 1770 | if (nf == ao->ntotalpools) { |
| 1771 | /* Case 1. First unlink ao from usable_arenas. |
| 1772 | */ |
| 1773 | assert(ao->prevarena == NULL || |
| 1774 | ao->prevarena->address != 0); |
| 1775 | assert(ao ->nextarena == NULL || |
| 1776 | ao->nextarena->address != 0); |
| 1777 | |
| 1778 | /* Fix the pointer in the prevarena, or the |
| 1779 | * usable_arenas pointer. |
| 1780 | */ |
| 1781 | if (ao->prevarena == NULL) { |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1782 | usable_arenas = ao->nextarena; |
| 1783 | assert(usable_arenas == NULL || |
| 1784 | usable_arenas->address != 0); |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1785 | } |
| 1786 | else { |
| 1787 | assert(ao->prevarena->nextarena == ao); |
| 1788 | ao->prevarena->nextarena = |
| 1789 | ao->nextarena; |
| 1790 | } |
| 1791 | /* Fix the pointer in the nextarena. */ |
| 1792 | if (ao->nextarena != NULL) { |
| 1793 | assert(ao->nextarena->prevarena == ao); |
| 1794 | ao->nextarena->prevarena = |
| 1795 | ao->prevarena; |
| 1796 | } |
| 1797 | /* Record that this arena_object slot is |
| 1798 | * available to be reused. |
| 1799 | */ |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1800 | ao->nextarena = unused_arena_objects; |
| 1801 | unused_arena_objects = ao; |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1802 | |
| 1803 | /* Free the entire arena. */ |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1804 | _PyObject_Arena.free(_PyObject_Arena.ctx, |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1805 | (void *)ao->address, ARENA_SIZE); |
| 1806 | ao->address = 0; /* mark unassociated */ |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1807 | --narenas_currently_allocated; |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1808 | |
| 1809 | goto success; |
| 1810 | } |
| 1811 | |
| 1812 | if (nf == 1) { |
| 1813 | /* Case 2. Put ao at the head of |
| 1814 | * usable_arenas. Note that because |
| 1815 | * ao->nfreepools was 0 before, ao isn't |
| 1816 | * currently on the usable_arenas list. |
| 1817 | */ |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1818 | ao->nextarena = usable_arenas; |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1819 | ao->prevarena = NULL; |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1820 | if (usable_arenas) |
| 1821 | usable_arenas->prevarena = ao; |
| 1822 | usable_arenas = ao; |
| 1823 | assert(usable_arenas->address != 0); |
Tim Peters | 1c263e3 | 2019-05-31 21:16:04 -0500 | [diff] [blame] | 1824 | if (nfp2lasta[1] == NULL) { |
| 1825 | nfp2lasta[1] = ao; |
| 1826 | } |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1827 | |
| 1828 | goto success; |
| 1829 | } |
| 1830 | |
| 1831 | /* If this arena is now out of order, we need to keep |
| 1832 | * the list sorted. The list is kept sorted so that |
| 1833 | * the "most full" arenas are used first, which allows |
| 1834 | * the nearly empty arenas to be completely freed. In |
| 1835 | * a few un-scientific tests, it seems like this |
| 1836 | * approach allowed a lot more memory to be freed. |
| 1837 | */ |
Tim Peters | 1c263e3 | 2019-05-31 21:16:04 -0500 | [diff] [blame] | 1838 | /* If this is the only arena with nf, record that. */ |
| 1839 | if (nfp2lasta[nf] == NULL) { |
| 1840 | nfp2lasta[nf] = ao; |
| 1841 | } /* else the rightmost with nf doesn't change */ |
| 1842 | /* If this was the rightmost of the old size, it remains in place. */ |
| 1843 | if (ao == lastnf) { |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1844 | /* Case 4. Nothing to do. */ |
| 1845 | goto success; |
| 1846 | } |
Tim Peters | 1c263e3 | 2019-05-31 21:16:04 -0500 | [diff] [blame] | 1847 | /* If ao were the only arena in the list, the last block would have |
| 1848 | * gotten us out. |
| 1849 | */ |
| 1850 | assert(ao->nextarena != NULL); |
| 1851 | |
| 1852 | /* Case 3: We have to move the arena towards the end of the list, |
| 1853 | * because it has more free pools than the arena to its right. It needs |
| 1854 | * to move to follow lastnf. |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1855 | * First unlink ao from usable_arenas. |
| 1856 | */ |
| 1857 | if (ao->prevarena != NULL) { |
| 1858 | /* ao isn't at the head of the list */ |
| 1859 | assert(ao->prevarena->nextarena == ao); |
| 1860 | ao->prevarena->nextarena = ao->nextarena; |
| 1861 | } |
| 1862 | else { |
| 1863 | /* ao is at the head of the list */ |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1864 | assert(usable_arenas == ao); |
| 1865 | usable_arenas = ao->nextarena; |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1866 | } |
| 1867 | ao->nextarena->prevarena = ao->prevarena; |
Tim Peters | 1c263e3 | 2019-05-31 21:16:04 -0500 | [diff] [blame] | 1868 | /* And insert after lastnf. */ |
| 1869 | ao->prevarena = lastnf; |
| 1870 | ao->nextarena = lastnf->nextarena; |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1871 | if (ao->nextarena != NULL) { |
| 1872 | ao->nextarena->prevarena = ao; |
| 1873 | } |
Tim Peters | 1c263e3 | 2019-05-31 21:16:04 -0500 | [diff] [blame] | 1874 | lastnf->nextarena = ao; |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1875 | /* Verify that the swaps worked. */ |
| 1876 | assert(ao->nextarena == NULL || nf <= ao->nextarena->nfreepools); |
| 1877 | assert(ao->prevarena == NULL || nf > ao->prevarena->nfreepools); |
| 1878 | assert(ao->nextarena == NULL || ao->nextarena->prevarena == ao); |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1879 | assert((usable_arenas == ao && ao->prevarena == NULL) |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1880 | || ao->prevarena->nextarena == ao); |
| 1881 | |
| 1882 | goto success; |
| 1883 | |
| 1884 | success: |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1885 | return 1; |
| 1886 | } |
| 1887 | |
| 1888 | |
| 1889 | static void |
| 1890 | _PyObject_Free(void *ctx, void *p) |
| 1891 | { |
| 1892 | /* PyObject_Free(NULL) has no effect */ |
| 1893 | if (p == NULL) { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1894 | return; |
| 1895 | } |
Neil Schemenauer | a35c688 | 2001-02-27 04:45:05 +0000 | [diff] [blame] | 1896 | |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 1897 | _Py_AllocatedBlocks--; |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1898 | if (!pymalloc_free(ctx, p)) { |
| 1899 | /* pymalloc didn't allocate this address */ |
| 1900 | PyMem_RawFree(p); |
| 1901 | } |
Neil Schemenauer | a35c688 | 2001-02-27 04:45:05 +0000 | [diff] [blame] | 1902 | } |
| 1903 | |
Neil Schemenauer | a35c688 | 2001-02-27 04:45:05 +0000 | [diff] [blame] | 1904 | |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1905 | /* pymalloc realloc. |
| 1906 | |
| 1907 | If nbytes==0, then as the Python docs promise, we do not treat this like |
| 1908 | free(p), and return a non-NULL result. |
| 1909 | |
| 1910 | Return 1 if pymalloc reallocated memory and wrote the new pointer into |
| 1911 | newptr_p. |
| 1912 | |
| 1913 | Return 0 if pymalloc didn't allocated p. */ |
| 1914 | static int |
| 1915 | pymalloc_realloc(void *ctx, void **newptr_p, void *p, size_t nbytes) |
Neil Schemenauer | a35c688 | 2001-02-27 04:45:05 +0000 | [diff] [blame] | 1916 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1917 | void *bp; |
| 1918 | poolp pool; |
| 1919 | size_t size; |
Neil Schemenauer | a35c688 | 2001-02-27 04:45:05 +0000 | [diff] [blame] | 1920 | |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1921 | assert(p != NULL); |
Georg Brandl | d492ad8 | 2008-07-23 16:13:07 +0000 | [diff] [blame] | 1922 | |
Benjamin Peterson | 05159c4 | 2009-12-03 03:01:27 +0000 | [diff] [blame] | 1923 | #ifdef WITH_VALGRIND |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1924 | /* Treat running_on_valgrind == -1 the same as 0 */ |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1925 | if (UNLIKELY(running_on_valgrind > 0)) { |
| 1926 | return 0; |
| 1927 | } |
Benjamin Peterson | 05159c4 | 2009-12-03 03:01:27 +0000 | [diff] [blame] | 1928 | #endif |
| 1929 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1930 | pool = POOL_ADDR(p); |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1931 | if (!address_in_range(p, pool)) { |
| 1932 | /* pymalloc is not managing this block. |
| 1933 | |
| 1934 | If nbytes <= SMALL_REQUEST_THRESHOLD, it's tempting to try to take |
| 1935 | over this block. However, if we do, we need to copy the valid data |
| 1936 | from the C-managed block to one of our blocks, and there's no |
| 1937 | portable way to know how much of the memory space starting at p is |
| 1938 | valid. |
| 1939 | |
| 1940 | As bug 1185883 pointed out the hard way, it's possible that the |
| 1941 | C-managed block is "at the end" of allocated VM space, so that a |
| 1942 | memory fault can occur if we try to copy nbytes bytes starting at p. |
| 1943 | Instead we punt: let C continue to manage this block. */ |
| 1944 | return 0; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1945 | } |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 1946 | |
| 1947 | /* pymalloc is in charge of this block */ |
| 1948 | size = INDEX2SIZE(pool->szidx); |
| 1949 | if (nbytes <= size) { |
| 1950 | /* The block is staying the same or shrinking. |
| 1951 | |
| 1952 | If it's shrinking, there's a tradeoff: it costs cycles to copy the |
| 1953 | block to a smaller size class, but it wastes memory not to copy it. |
| 1954 | |
| 1955 | The compromise here is to copy on shrink only if at least 25% of |
| 1956 | size can be shaved off. */ |
| 1957 | if (4 * nbytes > 3 * size) { |
| 1958 | /* It's the same, or shrinking and new/old > 3/4. */ |
| 1959 | *newptr_p = p; |
| 1960 | return 1; |
| 1961 | } |
| 1962 | size = nbytes; |
| 1963 | } |
| 1964 | |
| 1965 | bp = _PyObject_Malloc(ctx, nbytes); |
| 1966 | if (bp != NULL) { |
| 1967 | memcpy(bp, p, size); |
| 1968 | _PyObject_Free(ctx, p); |
| 1969 | } |
| 1970 | *newptr_p = bp; |
| 1971 | return 1; |
| 1972 | } |
| 1973 | |
| 1974 | |
| 1975 | static void * |
| 1976 | _PyObject_Realloc(void *ctx, void *ptr, size_t nbytes) |
| 1977 | { |
| 1978 | void *ptr2; |
| 1979 | |
| 1980 | if (ptr == NULL) { |
| 1981 | return _PyObject_Malloc(ctx, nbytes); |
| 1982 | } |
| 1983 | |
| 1984 | if (pymalloc_realloc(ctx, &ptr2, ptr, nbytes)) { |
| 1985 | return ptr2; |
| 1986 | } |
| 1987 | |
| 1988 | return PyMem_RawRealloc(ptr, nbytes); |
Neil Schemenauer | a35c688 | 2001-02-27 04:45:05 +0000 | [diff] [blame] | 1989 | } |
| 1990 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 1991 | #else /* ! WITH_PYMALLOC */ |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 1992 | |
| 1993 | /*==========================================================================*/ |
Neil Schemenauer | d2560cd | 2002-04-12 03:10:20 +0000 | [diff] [blame] | 1994 | /* pymalloc not enabled: Redirect the entry points to malloc. These will |
| 1995 | * only be used by extensions that are compiled with pymalloc enabled. */ |
Tim Peters | 62c06ba | 2002-03-23 22:28:18 +0000 | [diff] [blame] | 1996 | |
Antoine Pitrou | 9284053 | 2012-12-17 23:05:59 +0100 | [diff] [blame] | 1997 | Py_ssize_t |
| 1998 | _Py_GetAllocatedBlocks(void) |
| 1999 | { |
| 2000 | return 0; |
| 2001 | } |
| 2002 | |
Tim Peters | 1221c0a | 2002-03-23 00:20:15 +0000 | [diff] [blame] | 2003 | #endif /* WITH_PYMALLOC */ |
| 2004 | |
Victor Stinner | 34be807 | 2016-03-14 12:04:26 +0100 | [diff] [blame] | 2005 | |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2006 | /*==========================================================================*/ |
Tim Peters | 62c06ba | 2002-03-23 22:28:18 +0000 | [diff] [blame] | 2007 | /* A x-platform debugging allocator. This doesn't manage memory directly, |
| 2008 | * it wraps a real allocator, adding extra debugging info to the memory blocks. |
| 2009 | */ |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2010 | |
Tim Peters | f6fb501 | 2002-04-12 07:38:53 +0000 | [diff] [blame] | 2011 | /* Special bytes broadcast into debug memory blocks at appropriate times. |
| 2012 | * Strings of these are unlikely to be valid addresses, floats, ints or |
Victor Stinner | 2b00db6 | 2019-04-11 11:33:27 +0200 | [diff] [blame] | 2013 | * 7-bit ASCII. If modified, _PyMem_IsPtrFreed() should be updated as well. |
Victor Stinner | 4c409be | 2019-04-11 13:01:15 +0200 | [diff] [blame] | 2014 | * |
| 2015 | * Byte patterns 0xCB, 0xBB and 0xFB have been replaced with 0xCD, 0xDD and |
| 2016 | * 0xFD to use the same values than Windows CRT debug malloc() and free(). |
Tim Peters | f6fb501 | 2002-04-12 07:38:53 +0000 | [diff] [blame] | 2017 | */ |
| 2018 | #undef CLEANBYTE |
| 2019 | #undef DEADBYTE |
| 2020 | #undef FORBIDDENBYTE |
Victor Stinner | 4c409be | 2019-04-11 13:01:15 +0200 | [diff] [blame] | 2021 | #define CLEANBYTE 0xCD /* clean (newly allocated) memory */ |
| 2022 | #define DEADBYTE 0xDD /* dead (newly freed) memory */ |
| 2023 | #define FORBIDDENBYTE 0xFD /* untouchable bytes at each end of a block */ |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2024 | |
Victor Stinner | e8f9acf | 2019-04-12 21:54:06 +0200 | [diff] [blame] | 2025 | /* Uncomment this define to add the "serialno" field */ |
| 2026 | /* #define PYMEM_DEBUG_SERIALNO */ |
| 2027 | |
| 2028 | #ifdef PYMEM_DEBUG_SERIALNO |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 2029 | static size_t serialno = 0; /* incremented on each debug {m,re}alloc */ |
| 2030 | |
Tim Peters | e085017 | 2002-03-24 00:34:21 +0000 | [diff] [blame] | 2031 | /* serialno is always incremented via calling this routine. The point is |
Thomas Wouters | 73e5a5b | 2006-06-08 15:35:45 +0000 | [diff] [blame] | 2032 | * to supply a single place to set a breakpoint. |
| 2033 | */ |
Tim Peters | e085017 | 2002-03-24 00:34:21 +0000 | [diff] [blame] | 2034 | static void |
Neil Schemenauer | bd02b14 | 2002-03-28 21:05:38 +0000 | [diff] [blame] | 2035 | bumpserialno(void) |
Tim Peters | e085017 | 2002-03-24 00:34:21 +0000 | [diff] [blame] | 2036 | { |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 2037 | ++serialno; |
Tim Peters | e085017 | 2002-03-24 00:34:21 +0000 | [diff] [blame] | 2038 | } |
Victor Stinner | e8f9acf | 2019-04-12 21:54:06 +0200 | [diff] [blame] | 2039 | #endif |
Tim Peters | e085017 | 2002-03-24 00:34:21 +0000 | [diff] [blame] | 2040 | |
Thomas Wouters | 73e5a5b | 2006-06-08 15:35:45 +0000 | [diff] [blame] | 2041 | #define SST SIZEOF_SIZE_T |
Tim Peters | e085017 | 2002-03-24 00:34:21 +0000 | [diff] [blame] | 2042 | |
Victor Stinner | e8f9acf | 2019-04-12 21:54:06 +0200 | [diff] [blame] | 2043 | #ifdef PYMEM_DEBUG_SERIALNO |
| 2044 | # define PYMEM_DEBUG_EXTRA_BYTES 4 * SST |
| 2045 | #else |
| 2046 | # define PYMEM_DEBUG_EXTRA_BYTES 3 * SST |
| 2047 | #endif |
| 2048 | |
Thomas Wouters | 73e5a5b | 2006-06-08 15:35:45 +0000 | [diff] [blame] | 2049 | /* Read sizeof(size_t) bytes at p as a big-endian size_t. */ |
| 2050 | static size_t |
| 2051 | read_size_t(const void *p) |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2052 | { |
Benjamin Peterson | 19517e4 | 2016-09-18 19:22:22 -0700 | [diff] [blame] | 2053 | const uint8_t *q = (const uint8_t *)p; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2054 | size_t result = *q++; |
| 2055 | int i; |
Thomas Wouters | 73e5a5b | 2006-06-08 15:35:45 +0000 | [diff] [blame] | 2056 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2057 | for (i = SST; --i > 0; ++q) |
| 2058 | result = (result << 8) | *q; |
| 2059 | return result; |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2060 | } |
| 2061 | |
Thomas Wouters | 73e5a5b | 2006-06-08 15:35:45 +0000 | [diff] [blame] | 2062 | /* Write n as a big-endian size_t, MSB at address p, LSB at |
| 2063 | * p + sizeof(size_t) - 1. |
| 2064 | */ |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2065 | static void |
Thomas Wouters | 73e5a5b | 2006-06-08 15:35:45 +0000 | [diff] [blame] | 2066 | write_size_t(void *p, size_t n) |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2067 | { |
Benjamin Peterson | 19517e4 | 2016-09-18 19:22:22 -0700 | [diff] [blame] | 2068 | uint8_t *q = (uint8_t *)p + SST - 1; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2069 | int i; |
Thomas Wouters | 73e5a5b | 2006-06-08 15:35:45 +0000 | [diff] [blame] | 2070 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2071 | for (i = SST; --i >= 0; --q) { |
Benjamin Peterson | 19517e4 | 2016-09-18 19:22:22 -0700 | [diff] [blame] | 2072 | *q = (uint8_t)(n & 0xff); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2073 | n >>= 8; |
| 2074 | } |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2075 | } |
| 2076 | |
Victor Stinner | e8f9acf | 2019-04-12 21:54:06 +0200 | [diff] [blame] | 2077 | /* Let S = sizeof(size_t). The debug malloc asks for 4 * S extra bytes and |
Thomas Wouters | 73e5a5b | 2006-06-08 15:35:45 +0000 | [diff] [blame] | 2078 | fills them with useful stuff, here calling the underlying malloc's result p: |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2079 | |
Thomas Wouters | 73e5a5b | 2006-06-08 15:35:45 +0000 | [diff] [blame] | 2080 | p[0: S] |
| 2081 | Number of bytes originally asked for. This is a size_t, big-endian (easier |
| 2082 | to read in a memory dump). |
Georg Brandl | 7cba5fd | 2013-09-25 09:04:23 +0200 | [diff] [blame] | 2083 | p[S] |
Tim Peters | df099f5 | 2013-09-19 21:06:37 -0500 | [diff] [blame] | 2084 | API ID. See PEP 445. This is a character, but seems undocumented. |
| 2085 | p[S+1: 2*S] |
Tim Peters | f6fb501 | 2002-04-12 07:38:53 +0000 | [diff] [blame] | 2086 | Copies of FORBIDDENBYTE. Used to catch under- writes and reads. |
Thomas Wouters | 73e5a5b | 2006-06-08 15:35:45 +0000 | [diff] [blame] | 2087 | p[2*S: 2*S+n] |
Tim Peters | f6fb501 | 2002-04-12 07:38:53 +0000 | [diff] [blame] | 2088 | The requested memory, filled with copies of CLEANBYTE. |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2089 | Used to catch reference to uninitialized memory. |
Thomas Wouters | 73e5a5b | 2006-06-08 15:35:45 +0000 | [diff] [blame] | 2090 | &p[2*S] is returned. Note that this is 8-byte aligned if pymalloc |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2091 | handled the request itself. |
Thomas Wouters | 73e5a5b | 2006-06-08 15:35:45 +0000 | [diff] [blame] | 2092 | p[2*S+n: 2*S+n+S] |
Tim Peters | f6fb501 | 2002-04-12 07:38:53 +0000 | [diff] [blame] | 2093 | Copies of FORBIDDENBYTE. Used to catch over- writes and reads. |
Thomas Wouters | 73e5a5b | 2006-06-08 15:35:45 +0000 | [diff] [blame] | 2094 | p[2*S+n+S: 2*S+n+2*S] |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 2095 | A serial number, incremented by 1 on each call to _PyMem_DebugMalloc |
| 2096 | and _PyMem_DebugRealloc. |
Thomas Wouters | 73e5a5b | 2006-06-08 15:35:45 +0000 | [diff] [blame] | 2097 | This is a big-endian size_t. |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2098 | If "bad memory" is detected later, the serial number gives an |
| 2099 | excellent way to set a breakpoint on the next run, to capture the |
| 2100 | instant at which this block was passed out. |
Victor Stinner | e8f9acf | 2019-04-12 21:54:06 +0200 | [diff] [blame] | 2101 | |
| 2102 | If PYMEM_DEBUG_SERIALNO is not defined (default), the debug malloc only asks |
| 2103 | for 3 * S extra bytes, and omits the last serialno field. |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2104 | */ |
| 2105 | |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 2106 | static void * |
Victor Stinner | c4aec36 | 2016-03-14 22:26:53 +0100 | [diff] [blame] | 2107 | _PyMem_DebugRawAlloc(int use_calloc, void *ctx, size_t nbytes) |
Kristján Valur Jónsson | ae4cfb1 | 2009-09-28 13:45:02 +0000 | [diff] [blame] | 2108 | { |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 2109 | debug_alloc_api_t *api = (debug_alloc_api_t *)ctx; |
Serhiy Storchaka | 3cc4c53 | 2017-11-07 12:46:42 +0200 | [diff] [blame] | 2110 | uint8_t *p; /* base address of malloc'ed pad block */ |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 2111 | uint8_t *data; /* p + 2*SST == pointer to data bytes */ |
| 2112 | uint8_t *tail; /* data + nbytes == pointer to tail pad bytes */ |
Victor Stinner | e8f9acf | 2019-04-12 21:54:06 +0200 | [diff] [blame] | 2113 | size_t total; /* nbytes + PYMEM_DEBUG_EXTRA_BYTES */ |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 2114 | |
Victor Stinner | e8f9acf | 2019-04-12 21:54:06 +0200 | [diff] [blame] | 2115 | if (nbytes > (size_t)PY_SSIZE_T_MAX - PYMEM_DEBUG_EXTRA_BYTES) { |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 2116 | /* integer overflow: can't represent total as a Py_ssize_t */ |
| 2117 | return NULL; |
| 2118 | } |
Victor Stinner | e8f9acf | 2019-04-12 21:54:06 +0200 | [diff] [blame] | 2119 | total = nbytes + PYMEM_DEBUG_EXTRA_BYTES; |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 2120 | |
| 2121 | /* Layout: [SSSS IFFF CCCC...CCCC FFFF NNNN] |
Victor Stinner | e8f9acf | 2019-04-12 21:54:06 +0200 | [diff] [blame] | 2122 | ^--- p ^--- data ^--- tail |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 2123 | S: nbytes stored as size_t |
| 2124 | I: API identifier (1 byte) |
| 2125 | F: Forbidden bytes (size_t - 1 bytes before, size_t bytes after) |
| 2126 | C: Clean bytes used later to store actual data |
Victor Stinner | e8f9acf | 2019-04-12 21:54:06 +0200 | [diff] [blame] | 2127 | N: Serial number stored as size_t |
| 2128 | |
| 2129 | If PYMEM_DEBUG_SERIALNO is not defined (default), the last NNNN field |
| 2130 | is omitted. */ |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 2131 | |
| 2132 | if (use_calloc) { |
| 2133 | p = (uint8_t *)api->alloc.calloc(api->alloc.ctx, 1, total); |
| 2134 | } |
| 2135 | else { |
| 2136 | p = (uint8_t *)api->alloc.malloc(api->alloc.ctx, total); |
| 2137 | } |
| 2138 | if (p == NULL) { |
| 2139 | return NULL; |
| 2140 | } |
| 2141 | data = p + 2*SST; |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2142 | |
Victor Stinner | e8f9acf | 2019-04-12 21:54:06 +0200 | [diff] [blame] | 2143 | #ifdef PYMEM_DEBUG_SERIALNO |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2144 | bumpserialno(); |
Victor Stinner | e8f9acf | 2019-04-12 21:54:06 +0200 | [diff] [blame] | 2145 | #endif |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2146 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2147 | /* at p, write size (SST bytes), id (1 byte), pad (SST-1 bytes) */ |
| 2148 | write_size_t(p, nbytes); |
Benjamin Peterson | 19517e4 | 2016-09-18 19:22:22 -0700 | [diff] [blame] | 2149 | p[SST] = (uint8_t)api->api_id; |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 2150 | memset(p + SST + 1, FORBIDDENBYTE, SST-1); |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2151 | |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 2152 | if (nbytes > 0 && !use_calloc) { |
| 2153 | memset(data, CLEANBYTE, nbytes); |
| 2154 | } |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2155 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2156 | /* at tail, write pad (SST bytes) and serialno (SST bytes) */ |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 2157 | tail = data + nbytes; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2158 | memset(tail, FORBIDDENBYTE, SST); |
Victor Stinner | e8f9acf | 2019-04-12 21:54:06 +0200 | [diff] [blame] | 2159 | #ifdef PYMEM_DEBUG_SERIALNO |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 2160 | write_size_t(tail + SST, serialno); |
Victor Stinner | e8f9acf | 2019-04-12 21:54:06 +0200 | [diff] [blame] | 2161 | #endif |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2162 | |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 2163 | return data; |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2164 | } |
| 2165 | |
Victor Stinner | db067af | 2014-05-02 22:31:14 +0200 | [diff] [blame] | 2166 | static void * |
Victor Stinner | c4aec36 | 2016-03-14 22:26:53 +0100 | [diff] [blame] | 2167 | _PyMem_DebugRawMalloc(void *ctx, size_t nbytes) |
Victor Stinner | db067af | 2014-05-02 22:31:14 +0200 | [diff] [blame] | 2168 | { |
Victor Stinner | c4aec36 | 2016-03-14 22:26:53 +0100 | [diff] [blame] | 2169 | return _PyMem_DebugRawAlloc(0, ctx, nbytes); |
Victor Stinner | db067af | 2014-05-02 22:31:14 +0200 | [diff] [blame] | 2170 | } |
| 2171 | |
| 2172 | static void * |
Victor Stinner | c4aec36 | 2016-03-14 22:26:53 +0100 | [diff] [blame] | 2173 | _PyMem_DebugRawCalloc(void *ctx, size_t nelem, size_t elsize) |
Victor Stinner | db067af | 2014-05-02 22:31:14 +0200 | [diff] [blame] | 2174 | { |
| 2175 | size_t nbytes; |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 2176 | assert(elsize == 0 || nelem <= (size_t)PY_SSIZE_T_MAX / elsize); |
Victor Stinner | db067af | 2014-05-02 22:31:14 +0200 | [diff] [blame] | 2177 | nbytes = nelem * elsize; |
Victor Stinner | c4aec36 | 2016-03-14 22:26:53 +0100 | [diff] [blame] | 2178 | return _PyMem_DebugRawAlloc(1, ctx, nbytes); |
Victor Stinner | db067af | 2014-05-02 22:31:14 +0200 | [diff] [blame] | 2179 | } |
| 2180 | |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 2181 | |
Thomas Wouters | 73e5a5b | 2006-06-08 15:35:45 +0000 | [diff] [blame] | 2182 | /* The debug free first checks the 2*SST bytes on each end for sanity (in |
Kristján Valur Jónsson | ae4cfb1 | 2009-09-28 13:45:02 +0000 | [diff] [blame] | 2183 | particular, that the FORBIDDENBYTEs with the api ID are still intact). |
Tim Peters | f6fb501 | 2002-04-12 07:38:53 +0000 | [diff] [blame] | 2184 | Then fills the original bytes with DEADBYTE. |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2185 | Then calls the underlying free. |
| 2186 | */ |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 2187 | static void |
Victor Stinner | c4aec36 | 2016-03-14 22:26:53 +0100 | [diff] [blame] | 2188 | _PyMem_DebugRawFree(void *ctx, void *p) |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2189 | { |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 2190 | /* PyMem_Free(NULL) has no effect */ |
| 2191 | if (p == NULL) { |
| 2192 | return; |
| 2193 | } |
| 2194 | |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 2195 | debug_alloc_api_t *api = (debug_alloc_api_t *)ctx; |
Benjamin Peterson | 19517e4 | 2016-09-18 19:22:22 -0700 | [diff] [blame] | 2196 | uint8_t *q = (uint8_t *)p - 2*SST; /* address returned from malloc */ |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2197 | size_t nbytes; |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2198 | |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 2199 | _PyMem_DebugCheckAddress(api->api_id, p); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2200 | nbytes = read_size_t(q); |
Victor Stinner | e8f9acf | 2019-04-12 21:54:06 +0200 | [diff] [blame] | 2201 | nbytes += PYMEM_DEBUG_EXTRA_BYTES; |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 2202 | memset(q, DEADBYTE, nbytes); |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 2203 | api->alloc.free(api->alloc.ctx, q); |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2204 | } |
| 2205 | |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 2206 | |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 2207 | static void * |
Victor Stinner | c4aec36 | 2016-03-14 22:26:53 +0100 | [diff] [blame] | 2208 | _PyMem_DebugRawRealloc(void *ctx, void *p, size_t nbytes) |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2209 | { |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 2210 | if (p == NULL) { |
| 2211 | return _PyMem_DebugRawAlloc(0, ctx, nbytes); |
| 2212 | } |
| 2213 | |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 2214 | debug_alloc_api_t *api = (debug_alloc_api_t *)ctx; |
Serhiy Storchaka | 3cc4c53 | 2017-11-07 12:46:42 +0200 | [diff] [blame] | 2215 | uint8_t *head; /* base address of malloc'ed pad block */ |
| 2216 | uint8_t *data; /* pointer to data bytes */ |
| 2217 | uint8_t *r; |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 2218 | uint8_t *tail; /* data + nbytes == pointer to tail pad bytes */ |
| 2219 | size_t total; /* 2 * SST + nbytes + 2 * SST */ |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2220 | size_t original_nbytes; |
Serhiy Storchaka | 3cc4c53 | 2017-11-07 12:46:42 +0200 | [diff] [blame] | 2221 | #define ERASED_SIZE 64 |
| 2222 | uint8_t save[2*ERASED_SIZE]; /* A copy of erased bytes. */ |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2223 | |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 2224 | _PyMem_DebugCheckAddress(api->api_id, p); |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 2225 | |
Serhiy Storchaka | 3cc4c53 | 2017-11-07 12:46:42 +0200 | [diff] [blame] | 2226 | data = (uint8_t *)p; |
| 2227 | head = data - 2*SST; |
| 2228 | original_nbytes = read_size_t(head); |
Victor Stinner | e8f9acf | 2019-04-12 21:54:06 +0200 | [diff] [blame] | 2229 | if (nbytes > (size_t)PY_SSIZE_T_MAX - PYMEM_DEBUG_EXTRA_BYTES) { |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 2230 | /* integer overflow: can't represent total as a Py_ssize_t */ |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2231 | return NULL; |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 2232 | } |
Victor Stinner | e8f9acf | 2019-04-12 21:54:06 +0200 | [diff] [blame] | 2233 | total = nbytes + PYMEM_DEBUG_EXTRA_BYTES; |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2234 | |
Serhiy Storchaka | 3cc4c53 | 2017-11-07 12:46:42 +0200 | [diff] [blame] | 2235 | tail = data + original_nbytes; |
Victor Stinner | e8f9acf | 2019-04-12 21:54:06 +0200 | [diff] [blame] | 2236 | #ifdef PYMEM_DEBUG_SERIALNO |
| 2237 | size_t block_serialno = read_size_t(tail + SST); |
| 2238 | #endif |
Serhiy Storchaka | 3cc4c53 | 2017-11-07 12:46:42 +0200 | [diff] [blame] | 2239 | /* Mark the header, the trailer, ERASED_SIZE bytes at the begin and |
| 2240 | ERASED_SIZE bytes at the end as dead and save the copy of erased bytes. |
| 2241 | */ |
| 2242 | if (original_nbytes <= sizeof(save)) { |
| 2243 | memcpy(save, data, original_nbytes); |
Victor Stinner | e8f9acf | 2019-04-12 21:54:06 +0200 | [diff] [blame] | 2244 | memset(data - 2 * SST, DEADBYTE, |
| 2245 | original_nbytes + PYMEM_DEBUG_EXTRA_BYTES); |
Serhiy Storchaka | 3cc4c53 | 2017-11-07 12:46:42 +0200 | [diff] [blame] | 2246 | } |
| 2247 | else { |
| 2248 | memcpy(save, data, ERASED_SIZE); |
Victor Stinner | e8f9acf | 2019-04-12 21:54:06 +0200 | [diff] [blame] | 2249 | memset(head, DEADBYTE, ERASED_SIZE + 2 * SST); |
Serhiy Storchaka | 3cc4c53 | 2017-11-07 12:46:42 +0200 | [diff] [blame] | 2250 | memcpy(&save[ERASED_SIZE], tail - ERASED_SIZE, ERASED_SIZE); |
Victor Stinner | e8f9acf | 2019-04-12 21:54:06 +0200 | [diff] [blame] | 2251 | memset(tail - ERASED_SIZE, DEADBYTE, |
| 2252 | ERASED_SIZE + PYMEM_DEBUG_EXTRA_BYTES - 2 * SST); |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 2253 | } |
Tim Peters | 85cc1c4 | 2002-04-12 08:52:50 +0000 | [diff] [blame] | 2254 | |
Serhiy Storchaka | 3cc4c53 | 2017-11-07 12:46:42 +0200 | [diff] [blame] | 2255 | /* Resize and add decorations. */ |
| 2256 | r = (uint8_t *)api->alloc.realloc(api->alloc.ctx, head, total); |
| 2257 | if (r == NULL) { |
Victor Stinner | e8f9acf | 2019-04-12 21:54:06 +0200 | [diff] [blame] | 2258 | /* if realloc() failed: rewrite header and footer which have |
| 2259 | just been erased */ |
Serhiy Storchaka | 3cc4c53 | 2017-11-07 12:46:42 +0200 | [diff] [blame] | 2260 | nbytes = original_nbytes; |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 2261 | } |
Serhiy Storchaka | 3cc4c53 | 2017-11-07 12:46:42 +0200 | [diff] [blame] | 2262 | else { |
| 2263 | head = r; |
Victor Stinner | e8f9acf | 2019-04-12 21:54:06 +0200 | [diff] [blame] | 2264 | #ifdef PYMEM_DEBUG_SERIALNO |
Serhiy Storchaka | 3cc4c53 | 2017-11-07 12:46:42 +0200 | [diff] [blame] | 2265 | bumpserialno(); |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 2266 | block_serialno = serialno; |
Victor Stinner | e8f9acf | 2019-04-12 21:54:06 +0200 | [diff] [blame] | 2267 | #endif |
Serhiy Storchaka | 3cc4c53 | 2017-11-07 12:46:42 +0200 | [diff] [blame] | 2268 | } |
Victor Stinner | e8f9acf | 2019-04-12 21:54:06 +0200 | [diff] [blame] | 2269 | data = head + 2*SST; |
Serhiy Storchaka | 3cc4c53 | 2017-11-07 12:46:42 +0200 | [diff] [blame] | 2270 | |
| 2271 | write_size_t(head, nbytes); |
| 2272 | head[SST] = (uint8_t)api->api_id; |
| 2273 | memset(head + SST + 1, FORBIDDENBYTE, SST-1); |
Victor Stinner | c426636 | 2013-07-09 00:44:43 +0200 | [diff] [blame] | 2274 | |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 2275 | tail = data + nbytes; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2276 | memset(tail, FORBIDDENBYTE, SST); |
Victor Stinner | e8f9acf | 2019-04-12 21:54:06 +0200 | [diff] [blame] | 2277 | #ifdef PYMEM_DEBUG_SERIALNO |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 2278 | write_size_t(tail + SST, block_serialno); |
Victor Stinner | e8f9acf | 2019-04-12 21:54:06 +0200 | [diff] [blame] | 2279 | #endif |
Serhiy Storchaka | 3cc4c53 | 2017-11-07 12:46:42 +0200 | [diff] [blame] | 2280 | |
| 2281 | /* Restore saved bytes. */ |
| 2282 | if (original_nbytes <= sizeof(save)) { |
| 2283 | memcpy(data, save, Py_MIN(nbytes, original_nbytes)); |
| 2284 | } |
| 2285 | else { |
| 2286 | size_t i = original_nbytes - ERASED_SIZE; |
| 2287 | memcpy(data, save, Py_MIN(nbytes, ERASED_SIZE)); |
| 2288 | if (nbytes > i) { |
| 2289 | memcpy(data + i, &save[ERASED_SIZE], |
| 2290 | Py_MIN(nbytes - i, ERASED_SIZE)); |
| 2291 | } |
| 2292 | } |
| 2293 | |
| 2294 | if (r == NULL) { |
| 2295 | return NULL; |
| 2296 | } |
Tim Peters | 85cc1c4 | 2002-04-12 08:52:50 +0000 | [diff] [blame] | 2297 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2298 | if (nbytes > original_nbytes) { |
Victor Stinner | e8f9acf | 2019-04-12 21:54:06 +0200 | [diff] [blame] | 2299 | /* growing: mark new extra memory clean */ |
Serhiy Storchaka | 3cc4c53 | 2017-11-07 12:46:42 +0200 | [diff] [blame] | 2300 | memset(data + original_nbytes, CLEANBYTE, nbytes - original_nbytes); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2301 | } |
Tim Peters | 85cc1c4 | 2002-04-12 08:52:50 +0000 | [diff] [blame] | 2302 | |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 2303 | return data; |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2304 | } |
| 2305 | |
Victor Stinner | c4aec36 | 2016-03-14 22:26:53 +0100 | [diff] [blame] | 2306 | static void |
| 2307 | _PyMem_DebugCheckGIL(void) |
| 2308 | { |
Victor Stinner | c4aec36 | 2016-03-14 22:26:53 +0100 | [diff] [blame] | 2309 | if (!PyGILState_Check()) |
| 2310 | Py_FatalError("Python memory allocator called " |
| 2311 | "without holding the GIL"); |
Victor Stinner | c4aec36 | 2016-03-14 22:26:53 +0100 | [diff] [blame] | 2312 | } |
| 2313 | |
| 2314 | static void * |
| 2315 | _PyMem_DebugMalloc(void *ctx, size_t nbytes) |
| 2316 | { |
| 2317 | _PyMem_DebugCheckGIL(); |
| 2318 | return _PyMem_DebugRawMalloc(ctx, nbytes); |
| 2319 | } |
| 2320 | |
| 2321 | static void * |
| 2322 | _PyMem_DebugCalloc(void *ctx, size_t nelem, size_t elsize) |
| 2323 | { |
| 2324 | _PyMem_DebugCheckGIL(); |
| 2325 | return _PyMem_DebugRawCalloc(ctx, nelem, elsize); |
| 2326 | } |
| 2327 | |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 2328 | |
Victor Stinner | c4aec36 | 2016-03-14 22:26:53 +0100 | [diff] [blame] | 2329 | static void |
| 2330 | _PyMem_DebugFree(void *ctx, void *ptr) |
| 2331 | { |
| 2332 | _PyMem_DebugCheckGIL(); |
Victor Stinner | 0aed3a4 | 2016-03-23 11:30:43 +0100 | [diff] [blame] | 2333 | _PyMem_DebugRawFree(ctx, ptr); |
Victor Stinner | c4aec36 | 2016-03-14 22:26:53 +0100 | [diff] [blame] | 2334 | } |
| 2335 | |
Victor Stinner | 9ed83c4 | 2017-10-31 12:18:10 -0700 | [diff] [blame] | 2336 | |
Victor Stinner | c4aec36 | 2016-03-14 22:26:53 +0100 | [diff] [blame] | 2337 | static void * |
| 2338 | _PyMem_DebugRealloc(void *ctx, void *ptr, size_t nbytes) |
| 2339 | { |
| 2340 | _PyMem_DebugCheckGIL(); |
| 2341 | return _PyMem_DebugRawRealloc(ctx, ptr, nbytes); |
| 2342 | } |
| 2343 | |
Tim Peters | 7ccfadf | 2002-04-01 06:04:21 +0000 | [diff] [blame] | 2344 | /* Check the forbidden bytes on both ends of the memory allocated for p. |
Neil Schemenauer | d2560cd | 2002-04-12 03:10:20 +0000 | [diff] [blame] | 2345 | * If anything is wrong, print info to stderr via _PyObject_DebugDumpAddress, |
Tim Peters | 7ccfadf | 2002-04-01 06:04:21 +0000 | [diff] [blame] | 2346 | * and call Py_FatalError to kill the program. |
Kristján Valur Jónsson | ae4cfb1 | 2009-09-28 13:45:02 +0000 | [diff] [blame] | 2347 | * The API id, is also checked. |
Tim Peters | 7ccfadf | 2002-04-01 06:04:21 +0000 | [diff] [blame] | 2348 | */ |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 2349 | static void |
| 2350 | _PyMem_DebugCheckAddress(char api, const void *p) |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2351 | { |
Benjamin Peterson | 19517e4 | 2016-09-18 19:22:22 -0700 | [diff] [blame] | 2352 | const uint8_t *q = (const uint8_t *)p; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2353 | char msgbuf[64]; |
Serhiy Storchaka | e2f92de | 2017-11-11 13:06:26 +0200 | [diff] [blame] | 2354 | const char *msg; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2355 | size_t nbytes; |
Benjamin Peterson | 19517e4 | 2016-09-18 19:22:22 -0700 | [diff] [blame] | 2356 | const uint8_t *tail; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2357 | int i; |
| 2358 | char id; |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2359 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2360 | if (p == NULL) { |
| 2361 | msg = "didn't expect a NULL pointer"; |
| 2362 | goto error; |
| 2363 | } |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2364 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2365 | /* Check the API id */ |
| 2366 | id = (char)q[-SST]; |
| 2367 | if (id != api) { |
| 2368 | msg = msgbuf; |
Serhiy Storchaka | e2f92de | 2017-11-11 13:06:26 +0200 | [diff] [blame] | 2369 | snprintf(msgbuf, sizeof(msgbuf), "bad ID: Allocated using API '%c', verified using API '%c'", id, api); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2370 | msgbuf[sizeof(msgbuf)-1] = 0; |
| 2371 | goto error; |
| 2372 | } |
Kristján Valur Jónsson | ae4cfb1 | 2009-09-28 13:45:02 +0000 | [diff] [blame] | 2373 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2374 | /* Check the stuff at the start of p first: if there's underwrite |
| 2375 | * corruption, the number-of-bytes field may be nuts, and checking |
| 2376 | * the tail could lead to a segfault then. |
| 2377 | */ |
| 2378 | for (i = SST-1; i >= 1; --i) { |
| 2379 | if (*(q-i) != FORBIDDENBYTE) { |
| 2380 | msg = "bad leading pad byte"; |
| 2381 | goto error; |
| 2382 | } |
| 2383 | } |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2384 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2385 | nbytes = read_size_t(q - 2*SST); |
| 2386 | tail = q + nbytes; |
| 2387 | for (i = 0; i < SST; ++i) { |
| 2388 | if (tail[i] != FORBIDDENBYTE) { |
| 2389 | msg = "bad trailing pad byte"; |
| 2390 | goto error; |
| 2391 | } |
| 2392 | } |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2393 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2394 | return; |
Tim Peters | d1139e0 | 2002-03-28 07:32:11 +0000 | [diff] [blame] | 2395 | |
| 2396 | error: |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2397 | _PyObject_DebugDumpAddress(p); |
| 2398 | Py_FatalError(msg); |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2399 | } |
| 2400 | |
Tim Peters | 7ccfadf | 2002-04-01 06:04:21 +0000 | [diff] [blame] | 2401 | /* Display info to stderr about the memory block at p. */ |
Victor Stinner | 0507bf5 | 2013-07-07 02:05:46 +0200 | [diff] [blame] | 2402 | static void |
Neil Schemenauer | d2560cd | 2002-04-12 03:10:20 +0000 | [diff] [blame] | 2403 | _PyObject_DebugDumpAddress(const void *p) |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2404 | { |
Benjamin Peterson | 19517e4 | 2016-09-18 19:22:22 -0700 | [diff] [blame] | 2405 | const uint8_t *q = (const uint8_t *)p; |
| 2406 | const uint8_t *tail; |
Victor Stinner | e8f9acf | 2019-04-12 21:54:06 +0200 | [diff] [blame] | 2407 | size_t nbytes; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2408 | int i; |
| 2409 | int ok; |
| 2410 | char id; |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2411 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2412 | fprintf(stderr, "Debug memory block at address p=%p:", p); |
| 2413 | if (p == NULL) { |
| 2414 | fprintf(stderr, "\n"); |
| 2415 | return; |
| 2416 | } |
| 2417 | id = (char)q[-SST]; |
| 2418 | fprintf(stderr, " API '%c'\n", id); |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2419 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2420 | nbytes = read_size_t(q - 2*SST); |
| 2421 | fprintf(stderr, " %" PY_FORMAT_SIZE_T "u bytes originally " |
| 2422 | "requested\n", nbytes); |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2423 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2424 | /* In case this is nuts, check the leading pad bytes first. */ |
| 2425 | fprintf(stderr, " The %d pad bytes at p-%d are ", SST-1, SST-1); |
| 2426 | ok = 1; |
| 2427 | for (i = 1; i <= SST-1; ++i) { |
| 2428 | if (*(q-i) != FORBIDDENBYTE) { |
| 2429 | ok = 0; |
| 2430 | break; |
| 2431 | } |
| 2432 | } |
| 2433 | if (ok) |
| 2434 | fputs("FORBIDDENBYTE, as expected.\n", stderr); |
| 2435 | else { |
| 2436 | fprintf(stderr, "not all FORBIDDENBYTE (0x%02x):\n", |
| 2437 | FORBIDDENBYTE); |
| 2438 | for (i = SST-1; i >= 1; --i) { |
Benjamin Peterson | 19517e4 | 2016-09-18 19:22:22 -0700 | [diff] [blame] | 2439 | const uint8_t byte = *(q-i); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2440 | fprintf(stderr, " at p-%d: 0x%02x", i, byte); |
| 2441 | if (byte != FORBIDDENBYTE) |
| 2442 | fputs(" *** OUCH", stderr); |
| 2443 | fputc('\n', stderr); |
| 2444 | } |
Tim Peters | 449b5a8 | 2002-04-28 06:14:45 +0000 | [diff] [blame] | 2445 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2446 | fputs(" Because memory is corrupted at the start, the " |
| 2447 | "count of bytes requested\n" |
| 2448 | " may be bogus, and checking the trailing pad " |
| 2449 | "bytes may segfault.\n", stderr); |
| 2450 | } |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2451 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2452 | tail = q + nbytes; |
Zackery Spytz | 1a2252e | 2019-05-06 10:56:51 -0600 | [diff] [blame] | 2453 | fprintf(stderr, " The %d pad bytes at tail=%p are ", SST, (void *)tail); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2454 | ok = 1; |
| 2455 | for (i = 0; i < SST; ++i) { |
| 2456 | if (tail[i] != FORBIDDENBYTE) { |
| 2457 | ok = 0; |
| 2458 | break; |
| 2459 | } |
| 2460 | } |
| 2461 | if (ok) |
| 2462 | fputs("FORBIDDENBYTE, as expected.\n", stderr); |
| 2463 | else { |
| 2464 | fprintf(stderr, "not all FORBIDDENBYTE (0x%02x):\n", |
Stefan Krah | 735bb12 | 2010-11-26 10:54:09 +0000 | [diff] [blame] | 2465 | FORBIDDENBYTE); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2466 | for (i = 0; i < SST; ++i) { |
Benjamin Peterson | 19517e4 | 2016-09-18 19:22:22 -0700 | [diff] [blame] | 2467 | const uint8_t byte = tail[i]; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2468 | fprintf(stderr, " at tail+%d: 0x%02x", |
Stefan Krah | 735bb12 | 2010-11-26 10:54:09 +0000 | [diff] [blame] | 2469 | i, byte); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2470 | if (byte != FORBIDDENBYTE) |
| 2471 | fputs(" *** OUCH", stderr); |
| 2472 | fputc('\n', stderr); |
| 2473 | } |
| 2474 | } |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2475 | |
Victor Stinner | e8f9acf | 2019-04-12 21:54:06 +0200 | [diff] [blame] | 2476 | #ifdef PYMEM_DEBUG_SERIALNO |
| 2477 | size_t serial = read_size_t(tail + SST); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2478 | fprintf(stderr, " The block was made by call #%" PY_FORMAT_SIZE_T |
| 2479 | "u to debug malloc/realloc.\n", serial); |
Victor Stinner | e8f9acf | 2019-04-12 21:54:06 +0200 | [diff] [blame] | 2480 | #endif |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2481 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2482 | if (nbytes > 0) { |
| 2483 | i = 0; |
| 2484 | fputs(" Data at p:", stderr); |
| 2485 | /* print up to 8 bytes at the start */ |
| 2486 | while (q < tail && i < 8) { |
| 2487 | fprintf(stderr, " %02x", *q); |
| 2488 | ++i; |
| 2489 | ++q; |
| 2490 | } |
| 2491 | /* and up to 8 at the end */ |
| 2492 | if (q < tail) { |
| 2493 | if (tail - q > 8) { |
| 2494 | fputs(" ...", stderr); |
| 2495 | q = tail - 8; |
| 2496 | } |
| 2497 | while (q < tail) { |
| 2498 | fprintf(stderr, " %02x", *q); |
| 2499 | ++q; |
| 2500 | } |
| 2501 | } |
| 2502 | fputc('\n', stderr); |
| 2503 | } |
Victor Stinner | 0611c26 | 2016-03-15 22:22:13 +0100 | [diff] [blame] | 2504 | fputc('\n', stderr); |
| 2505 | |
| 2506 | fflush(stderr); |
| 2507 | _PyMem_DumpTraceback(fileno(stderr), p); |
Tim Peters | ddea208 | 2002-03-23 10:03:50 +0000 | [diff] [blame] | 2508 | } |
| 2509 | |
David Malcolm | 49526f4 | 2012-06-22 14:55:41 -0400 | [diff] [blame] | 2510 | |
Thomas Wouters | 73e5a5b | 2006-06-08 15:35:45 +0000 | [diff] [blame] | 2511 | static size_t |
David Malcolm | 49526f4 | 2012-06-22 14:55:41 -0400 | [diff] [blame] | 2512 | printone(FILE *out, const char* msg, size_t value) |
Tim Peters | 16bcb6b | 2002-04-05 05:45:31 +0000 | [diff] [blame] | 2513 | { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2514 | int i, k; |
| 2515 | char buf[100]; |
| 2516 | size_t origvalue = value; |
Tim Peters | 16bcb6b | 2002-04-05 05:45:31 +0000 | [diff] [blame] | 2517 | |
David Malcolm | 49526f4 | 2012-06-22 14:55:41 -0400 | [diff] [blame] | 2518 | fputs(msg, out); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2519 | for (i = (int)strlen(msg); i < 35; ++i) |
David Malcolm | 49526f4 | 2012-06-22 14:55:41 -0400 | [diff] [blame] | 2520 | fputc(' ', out); |
| 2521 | fputc('=', out); |
Tim Peters | 49f2681 | 2002-04-06 01:45:35 +0000 | [diff] [blame] | 2522 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2523 | /* Write the value with commas. */ |
| 2524 | i = 22; |
| 2525 | buf[i--] = '\0'; |
| 2526 | buf[i--] = '\n'; |
| 2527 | k = 3; |
| 2528 | do { |
| 2529 | size_t nextvalue = value / 10; |
Benjamin Peterson | 2dba1ee | 2013-02-20 16:54:30 -0500 | [diff] [blame] | 2530 | unsigned int digit = (unsigned int)(value - nextvalue * 10); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2531 | value = nextvalue; |
| 2532 | buf[i--] = (char)(digit + '0'); |
| 2533 | --k; |
| 2534 | if (k == 0 && value && i >= 0) { |
| 2535 | k = 3; |
| 2536 | buf[i--] = ','; |
| 2537 | } |
| 2538 | } while (value && i >= 0); |
Tim Peters | 49f2681 | 2002-04-06 01:45:35 +0000 | [diff] [blame] | 2539 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2540 | while (i >= 0) |
| 2541 | buf[i--] = ' '; |
David Malcolm | 49526f4 | 2012-06-22 14:55:41 -0400 | [diff] [blame] | 2542 | fputs(buf, out); |
Tim Peters | 49f2681 | 2002-04-06 01:45:35 +0000 | [diff] [blame] | 2543 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2544 | return origvalue; |
Tim Peters | 16bcb6b | 2002-04-05 05:45:31 +0000 | [diff] [blame] | 2545 | } |
| 2546 | |
David Malcolm | 49526f4 | 2012-06-22 14:55:41 -0400 | [diff] [blame] | 2547 | void |
| 2548 | _PyDebugAllocatorStats(FILE *out, |
| 2549 | const char *block_name, int num_blocks, size_t sizeof_block) |
| 2550 | { |
| 2551 | char buf1[128]; |
| 2552 | char buf2[128]; |
| 2553 | PyOS_snprintf(buf1, sizeof(buf1), |
Tim Peters | eaa3bcc | 2013-09-05 22:57:04 -0500 | [diff] [blame] | 2554 | "%d %ss * %" PY_FORMAT_SIZE_T "d bytes each", |
David Malcolm | 49526f4 | 2012-06-22 14:55:41 -0400 | [diff] [blame] | 2555 | num_blocks, block_name, sizeof_block); |
| 2556 | PyOS_snprintf(buf2, sizeof(buf2), |
| 2557 | "%48s ", buf1); |
| 2558 | (void)printone(out, buf2, num_blocks * sizeof_block); |
| 2559 | } |
| 2560 | |
Victor Stinner | 34be807 | 2016-03-14 12:04:26 +0100 | [diff] [blame] | 2561 | |
David Malcolm | 49526f4 | 2012-06-22 14:55:41 -0400 | [diff] [blame] | 2562 | #ifdef WITH_PYMALLOC |
| 2563 | |
Victor Stinner | 34be807 | 2016-03-14 12:04:26 +0100 | [diff] [blame] | 2564 | #ifdef Py_DEBUG |
| 2565 | /* Is target in the list? The list is traversed via the nextpool pointers. |
| 2566 | * The list may be NULL-terminated, or circular. Return 1 if target is in |
| 2567 | * list, else 0. |
| 2568 | */ |
| 2569 | static int |
| 2570 | pool_is_in_list(const poolp target, poolp list) |
| 2571 | { |
| 2572 | poolp origlist = list; |
| 2573 | assert(target != NULL); |
| 2574 | if (list == NULL) |
| 2575 | return 0; |
| 2576 | do { |
| 2577 | if (target == list) |
| 2578 | return 1; |
| 2579 | list = list->nextpool; |
| 2580 | } while (list != NULL && list != origlist); |
| 2581 | return 0; |
| 2582 | } |
| 2583 | #endif |
| 2584 | |
David Malcolm | 49526f4 | 2012-06-22 14:55:41 -0400 | [diff] [blame] | 2585 | /* Print summary info to "out" about the state of pymalloc's structures. |
Tim Peters | 08d8215 | 2002-04-18 22:25:03 +0000 | [diff] [blame] | 2586 | * In Py_DEBUG mode, also perform some expensive internal consistency |
| 2587 | * checks. |
Victor Stinner | 6bf992a | 2017-12-06 17:26:10 +0100 | [diff] [blame] | 2588 | * |
| 2589 | * Return 0 if the memory debug hooks are not installed or no statistics was |
Leo Arias | c3d9508 | 2018-02-03 18:36:10 -0600 | [diff] [blame] | 2590 | * written into out, return 1 otherwise. |
Tim Peters | 08d8215 | 2002-04-18 22:25:03 +0000 | [diff] [blame] | 2591 | */ |
Victor Stinner | 6bf992a | 2017-12-06 17:26:10 +0100 | [diff] [blame] | 2592 | int |
David Malcolm | 49526f4 | 2012-06-22 14:55:41 -0400 | [diff] [blame] | 2593 | _PyObject_DebugMallocStats(FILE *out) |
Tim Peters | 7ccfadf | 2002-04-01 06:04:21 +0000 | [diff] [blame] | 2594 | { |
Victor Stinner | 6bf992a | 2017-12-06 17:26:10 +0100 | [diff] [blame] | 2595 | if (!_PyMem_PymallocEnabled()) { |
| 2596 | return 0; |
| 2597 | } |
| 2598 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2599 | uint i; |
| 2600 | const uint numclasses = SMALL_REQUEST_THRESHOLD >> ALIGNMENT_SHIFT; |
| 2601 | /* # of pools, allocated blocks, and free blocks per class index */ |
| 2602 | size_t numpools[SMALL_REQUEST_THRESHOLD >> ALIGNMENT_SHIFT]; |
| 2603 | size_t numblocks[SMALL_REQUEST_THRESHOLD >> ALIGNMENT_SHIFT]; |
| 2604 | size_t numfreeblocks[SMALL_REQUEST_THRESHOLD >> ALIGNMENT_SHIFT]; |
| 2605 | /* total # of allocated bytes in used and full pools */ |
| 2606 | size_t allocated_bytes = 0; |
| 2607 | /* total # of available bytes in used pools */ |
| 2608 | size_t available_bytes = 0; |
| 2609 | /* # of free pools + pools not yet carved out of current arena */ |
| 2610 | uint numfreepools = 0; |
| 2611 | /* # of bytes for arena alignment padding */ |
| 2612 | size_t arena_alignment = 0; |
| 2613 | /* # of bytes in used and full pools used for pool_headers */ |
| 2614 | size_t pool_header_bytes = 0; |
| 2615 | /* # of bytes in used and full pools wasted due to quantization, |
| 2616 | * i.e. the necessarily leftover space at the ends of used and |
| 2617 | * full pools. |
| 2618 | */ |
| 2619 | size_t quantization = 0; |
| 2620 | /* # of arenas actually allocated. */ |
| 2621 | size_t narenas = 0; |
| 2622 | /* running total -- should equal narenas * ARENA_SIZE */ |
| 2623 | size_t total; |
| 2624 | char buf[128]; |
Tim Peters | 7ccfadf | 2002-04-01 06:04:21 +0000 | [diff] [blame] | 2625 | |
David Malcolm | 49526f4 | 2012-06-22 14:55:41 -0400 | [diff] [blame] | 2626 | fprintf(out, "Small block threshold = %d, in %u size classes.\n", |
Stefan Krah | 735bb12 | 2010-11-26 10:54:09 +0000 | [diff] [blame] | 2627 | SMALL_REQUEST_THRESHOLD, numclasses); |
Tim Peters | 7ccfadf | 2002-04-01 06:04:21 +0000 | [diff] [blame] | 2628 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2629 | for (i = 0; i < numclasses; ++i) |
| 2630 | numpools[i] = numblocks[i] = numfreeblocks[i] = 0; |
Tim Peters | 7ccfadf | 2002-04-01 06:04:21 +0000 | [diff] [blame] | 2631 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2632 | /* Because full pools aren't linked to from anything, it's easiest |
| 2633 | * to march over all the arenas. If we're lucky, most of the memory |
| 2634 | * will be living in full pools -- would be a shame to miss them. |
| 2635 | */ |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 2636 | for (i = 0; i < maxarenas; ++i) { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2637 | uint j; |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 2638 | uintptr_t base = arenas[i].address; |
Thomas Wouters | a977329 | 2006-04-21 09:43:23 +0000 | [diff] [blame] | 2639 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2640 | /* Skip arenas which are not allocated. */ |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 2641 | if (arenas[i].address == (uintptr_t)NULL) |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2642 | continue; |
| 2643 | narenas += 1; |
Thomas Wouters | a977329 | 2006-04-21 09:43:23 +0000 | [diff] [blame] | 2644 | |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 2645 | numfreepools += arenas[i].nfreepools; |
Tim Peters | 7ccfadf | 2002-04-01 06:04:21 +0000 | [diff] [blame] | 2646 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2647 | /* round up to pool alignment */ |
Benjamin Peterson | 5d4b09c | 2016-09-18 19:24:52 -0700 | [diff] [blame] | 2648 | if (base & (uintptr_t)POOL_SIZE_MASK) { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2649 | arena_alignment += POOL_SIZE; |
Benjamin Peterson | 5d4b09c | 2016-09-18 19:24:52 -0700 | [diff] [blame] | 2650 | base &= ~(uintptr_t)POOL_SIZE_MASK; |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2651 | base += POOL_SIZE; |
| 2652 | } |
Tim Peters | 7ccfadf | 2002-04-01 06:04:21 +0000 | [diff] [blame] | 2653 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2654 | /* visit every pool in the arena */ |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 2655 | assert(base <= (uintptr_t) arenas[i].pool_address); |
| 2656 | for (j = 0; base < (uintptr_t) arenas[i].pool_address; |
Benjamin Peterson | 19517e4 | 2016-09-18 19:22:22 -0700 | [diff] [blame] | 2657 | ++j, base += POOL_SIZE) { |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2658 | poolp p = (poolp)base; |
| 2659 | const uint sz = p->szidx; |
| 2660 | uint freeblocks; |
Tim Peters | 08d8215 | 2002-04-18 22:25:03 +0000 | [diff] [blame] | 2661 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2662 | if (p->ref.count == 0) { |
| 2663 | /* currently unused */ |
Victor Stinner | 34be807 | 2016-03-14 12:04:26 +0100 | [diff] [blame] | 2664 | #ifdef Py_DEBUG |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 2665 | assert(pool_is_in_list(p, arenas[i].freepools)); |
Victor Stinner | 34be807 | 2016-03-14 12:04:26 +0100 | [diff] [blame] | 2666 | #endif |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2667 | continue; |
| 2668 | } |
| 2669 | ++numpools[sz]; |
| 2670 | numblocks[sz] += p->ref.count; |
| 2671 | freeblocks = NUMBLOCKS(sz) - p->ref.count; |
| 2672 | numfreeblocks[sz] += freeblocks; |
Tim Peters | 08d8215 | 2002-04-18 22:25:03 +0000 | [diff] [blame] | 2673 | #ifdef Py_DEBUG |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2674 | if (freeblocks > 0) |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 2675 | assert(pool_is_in_list(p, usedpools[sz + sz])); |
Tim Peters | 08d8215 | 2002-04-18 22:25:03 +0000 | [diff] [blame] | 2676 | #endif |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2677 | } |
| 2678 | } |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 2679 | assert(narenas == narenas_currently_allocated); |
Tim Peters | 7ccfadf | 2002-04-01 06:04:21 +0000 | [diff] [blame] | 2680 | |
David Malcolm | 49526f4 | 2012-06-22 14:55:41 -0400 | [diff] [blame] | 2681 | fputc('\n', out); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2682 | fputs("class size num pools blocks in use avail blocks\n" |
| 2683 | "----- ---- --------- ------------- ------------\n", |
David Malcolm | 49526f4 | 2012-06-22 14:55:41 -0400 | [diff] [blame] | 2684 | out); |
Tim Peters | 7ccfadf | 2002-04-01 06:04:21 +0000 | [diff] [blame] | 2685 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2686 | for (i = 0; i < numclasses; ++i) { |
| 2687 | size_t p = numpools[i]; |
| 2688 | size_t b = numblocks[i]; |
| 2689 | size_t f = numfreeblocks[i]; |
| 2690 | uint size = INDEX2SIZE(i); |
| 2691 | if (p == 0) { |
| 2692 | assert(b == 0 && f == 0); |
| 2693 | continue; |
| 2694 | } |
David Malcolm | 49526f4 | 2012-06-22 14:55:41 -0400 | [diff] [blame] | 2695 | fprintf(out, "%5u %6u " |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2696 | "%11" PY_FORMAT_SIZE_T "u " |
| 2697 | "%15" PY_FORMAT_SIZE_T "u " |
| 2698 | "%13" PY_FORMAT_SIZE_T "u\n", |
Stefan Krah | 735bb12 | 2010-11-26 10:54:09 +0000 | [diff] [blame] | 2699 | i, size, p, b, f); |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2700 | allocated_bytes += b * size; |
| 2701 | available_bytes += f * size; |
| 2702 | pool_header_bytes += p * POOL_OVERHEAD; |
| 2703 | quantization += p * ((POOL_SIZE - POOL_OVERHEAD) % size); |
| 2704 | } |
David Malcolm | 49526f4 | 2012-06-22 14:55:41 -0400 | [diff] [blame] | 2705 | fputc('\n', out); |
Victor Stinner | e8f9acf | 2019-04-12 21:54:06 +0200 | [diff] [blame] | 2706 | #ifdef PYMEM_DEBUG_SERIALNO |
| 2707 | if (_PyMem_DebugEnabled()) { |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 2708 | (void)printone(out, "# times object malloc called", serialno); |
Victor Stinner | e8f9acf | 2019-04-12 21:54:06 +0200 | [diff] [blame] | 2709 | } |
| 2710 | #endif |
Victor Stinner | 9e87e77 | 2017-11-24 12:09:24 +0100 | [diff] [blame] | 2711 | (void)printone(out, "# arenas allocated total", ntimes_arena_allocated); |
| 2712 | (void)printone(out, "# arenas reclaimed", ntimes_arena_allocated - narenas); |
| 2713 | (void)printone(out, "# arenas highwater mark", narenas_highwater); |
David Malcolm | 49526f4 | 2012-06-22 14:55:41 -0400 | [diff] [blame] | 2714 | (void)printone(out, "# arenas allocated current", narenas); |
Thomas Wouters | a977329 | 2006-04-21 09:43:23 +0000 | [diff] [blame] | 2715 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2716 | PyOS_snprintf(buf, sizeof(buf), |
| 2717 | "%" PY_FORMAT_SIZE_T "u arenas * %d bytes/arena", |
| 2718 | narenas, ARENA_SIZE); |
David Malcolm | 49526f4 | 2012-06-22 14:55:41 -0400 | [diff] [blame] | 2719 | (void)printone(out, buf, narenas * ARENA_SIZE); |
Tim Peters | 16bcb6b | 2002-04-05 05:45:31 +0000 | [diff] [blame] | 2720 | |
David Malcolm | 49526f4 | 2012-06-22 14:55:41 -0400 | [diff] [blame] | 2721 | fputc('\n', out); |
Tim Peters | 16bcb6b | 2002-04-05 05:45:31 +0000 | [diff] [blame] | 2722 | |
David Malcolm | 49526f4 | 2012-06-22 14:55:41 -0400 | [diff] [blame] | 2723 | total = printone(out, "# bytes in allocated blocks", allocated_bytes); |
| 2724 | total += printone(out, "# bytes in available blocks", available_bytes); |
Tim Peters | 49f2681 | 2002-04-06 01:45:35 +0000 | [diff] [blame] | 2725 | |
Antoine Pitrou | f95a1b3 | 2010-05-09 15:52:27 +0000 | [diff] [blame] | 2726 | PyOS_snprintf(buf, sizeof(buf), |
| 2727 | "%u unused pools * %d bytes", numfreepools, POOL_SIZE); |
David Malcolm | 49526f4 | 2012-06-22 14:55:41 -0400 | [diff] [blame] | 2728 | total += printone(out, buf, (size_t)numfreepools * POOL_SIZE); |
Tim Peters | 16bcb6b | 2002-04-05 05:45:31 +0000 | [diff] [blame] | 2729 | |
David Malcolm | 49526f4 | 2012-06-22 14:55:41 -0400 | [diff] [blame] | 2730 | total += printone(out, "# bytes lost to pool headers", pool_header_bytes); |
| 2731 | total += printone(out, "# bytes lost to quantization", quantization); |
| 2732 | total += printone(out, "# bytes lost to arena alignment", arena_alignment); |
| 2733 | (void)printone(out, "Total", total); |
Victor Stinner | 6bf992a | 2017-12-06 17:26:10 +0100 | [diff] [blame] | 2734 | return 1; |
Tim Peters | 7ccfadf | 2002-04-01 06:04:21 +0000 | [diff] [blame] | 2735 | } |
| 2736 | |
David Malcolm | 49526f4 | 2012-06-22 14:55:41 -0400 | [diff] [blame] | 2737 | #endif /* #ifdef WITH_PYMALLOC */ |