From 8654ea28d6e567fea5a22f416d155ceb7a0f514a Mon Sep 17 00:00:00 2001 From: Jamie Reece Wilson Date: Thu, 26 Oct 2023 16:57:45 +0100 Subject: [PATCH] [*] Update from v1.6.7 (2020-09-24) to v2.1.2 (2023-04-24) --- .gitattributes | 2 + .gitignore | 1 + Aurora.json | 15 + CMakeLists.txt | 367 --- LICENSE | 2 +- azure-pipelines.yml | 168 -- bin/mimalloc-redirect.dll | Bin 55808 -> 0 bytes bin/mimalloc-redirect.lib | Bin 2874 -> 0 bytes bin/mimalloc-redirect32.dll | Bin 39424 -> 0 bytes bin/mimalloc-redirect32.lib | Bin 2928 -> 0 bytes cmake/mimalloc-config-version.cmake | 18 - cmake/mimalloc-config.cmake | 2 - .../bench-c5-18xlarge-2020-01-20-a.svg | 1 + .../bench-c5-18xlarge-2020-01-20-b.svg | 1 + .../bench-c5-18xlarge-2020-01-20-rss-a.svg | 1 + .../bench-c5-18xlarge-2020-01-20-rss-b.svg | 1 + doc/{ => bench-2020}/bench-r5a-1.svg | 1 + .../bench-r5a-12xlarge-2020-01-16-a.svg | 1 + .../bench-r5a-12xlarge-2020-01-16-b.svg | 1 + doc/{ => bench-2020}/bench-r5a-2.svg | 1 + doc/{ => bench-2020}/bench-r5a-rss-1.svg | 1 + doc/{ => bench-2020}/bench-r5a-rss-2.svg | 1 + doc/{ => bench-2020}/bench-spec-rss.svg | 0 doc/{ => bench-2020}/bench-spec.svg | 0 doc/{ => bench-2020}/bench-z4-1.svg | 0 doc/{ => bench-2020}/bench-z4-2.svg | 0 doc/{ => bench-2020}/bench-z4-rss-1.svg | 0 doc/{ => bench-2020}/bench-z4-rss-2.svg | 0 .../bench-amd5950x-2021-01-30-a.svg | 952 ++++++++ .../bench-amd5950x-2021-01-30-b.svg | 1255 +++++++++++ .../bench-c5-18xlarge-2021-01-30-a.svg | 955 ++++++++ .../bench-c5-18xlarge-2021-01-30-b.svg | 1269 +++++++++++ .../bench-c5-18xlarge-2021-01-30-rss-a.svg | 836 +++++++ .../bench-c5-18xlarge-2021-01-30-rss-b.svg | 1131 ++++++++++ doc/bench-2021/bench-macmini-2021-01-30.svg | 766 +++++++ doc/doxyfile | 281 ++- doc/ds-logo.jpg | Bin 0 -> 181497 bytes doc/ds-logo.png | Bin 0 -> 121150 bytes doc/mimalloc-doc.h | 90 +- doc/spades-logo.png | Bin 0 -> 34583 bytes doc/unreal-logo.svg | 43 + docs/annotated.html | 30 +- docs/bench.html | 36 +- docs/build.html | 55 +- docs/classes.html | 45 +- docs/doxygen.css | 234 +- docs/dynsections.js | 33 +- docs/environment.html | 35 +- docs/functions.html | 30 +- docs/functions_vars.html | 30 +- docs/group__aligned.html | 62 +- docs/group__aligned.js | 1 + docs/group__analysis.html | 42 +- docs/group__cpp.html | 51 +- docs/group__extended.html | 197 +- docs/group__extended.js | 2 + docs/group__heap.html | 64 +- docs/group__malloc.html | 58 +- docs/group__options.html | 74 +- docs/group__options.js | 1 + docs/group__posix.html | 76 +- docs/group__posix.js | 1 + docs/group__typed.html | 61 +- docs/group__zeroinit.html | 32 +- docs/index.html | 35 +- docs/jquery.js | 94 +- docs/mimalloc-doc_8h_source.html | 619 ++++-- docs/modules.html | 30 +- docs/navtree.css | 3 +- docs/navtree.js | 74 +- docs/navtreedata.js | 33 +- docs/navtreeindex0.js | 73 +- docs/overrides.html | 102 +- docs/pages.html | 30 +- docs/resize.js | 38 +- docs/search/all_0.html | 19 +- docs/search/all_0.js | 2 +- docs/search/all_1.html | 19 +- docs/search/all_1.js | 2 +- docs/search/all_2.html | 19 +- docs/search/all_2.js | 8 +- docs/search/all_3.html | 19 +- docs/search/all_3.js | 4 +- docs/search/all_4.html | 19 +- docs/search/all_4.js | 4 +- docs/search/all_5.html | 19 +- docs/search/all_5.js | 4 +- docs/search/all_6.html | 19 +- docs/search/all_6.js | 295 +-- docs/search/all_7.html | 19 +- docs/search/all_7.js | 2 +- docs/search/all_8.html | 19 +- docs/search/all_8.js | 4 +- docs/search/all_9.html | 19 +- docs/search/all_9.js | 4 +- docs/search/all_a.html | 19 +- docs/search/all_a.js | 2 +- docs/search/all_b.html | 19 +- docs/search/all_b.js | 4 +- docs/search/all_c.html | 19 +- docs/search/all_c.js | 2 +- docs/search/classes_0.html | 19 +- docs/search/classes_0.js | 4 +- docs/search/enums_0.html | 19 +- docs/search/enums_0.js | 2 +- docs/search/enumvalues_0.html | 19 +- docs/search/enumvalues_0.js | 2 +- docs/search/enumvalues_1.html | 19 +- docs/search/enumvalues_1.js | 31 +- docs/search/functions_0.html | 19 +- docs/search/functions_0.js | 223 +- docs/search/groups_0.html | 19 +- docs/search/groups_0.js | 2 +- docs/search/groups_1.html | 19 +- docs/search/groups_1.js | 2 +- docs/search/groups_2.html | 19 +- docs/search/groups_2.js | 2 +- docs/search/groups_3.html | 19 +- docs/search/groups_3.js | 2 +- docs/search/groups_4.html | 19 +- docs/search/groups_4.js | 4 +- docs/search/groups_5.html | 19 +- docs/search/groups_5.js | 2 +- docs/search/groups_6.html | 19 +- docs/search/groups_6.js | 2 +- docs/search/groups_7.html | 19 +- docs/search/groups_7.js | 2 +- docs/search/groups_8.html | 19 +- docs/search/groups_8.js | 2 +- docs/search/nomatches.html | 3 +- docs/search/pages_0.html | 19 +- docs/search/pages_0.js | 2 +- docs/search/pages_1.html | 19 +- docs/search/pages_1.js | 2 +- docs/search/pages_2.html | 19 +- docs/search/pages_2.js | 2 +- docs/search/pages_3.html | 19 +- docs/search/pages_3.js | 2 +- docs/search/pages_4.html | 19 +- docs/search/pages_4.js | 2 +- docs/search/search.css | 13 +- docs/search/search.js | 52 +- docs/search/searchdata.js | 1 - docs/search/typedefs_0.html | 19 +- docs/search/typedefs_0.js | 10 +- docs/search/variables_0.html | 19 +- docs/search/variables_0.js | 4 +- docs/search/variables_1.html | 19 +- docs/search/variables_1.js | 2 +- docs/search/variables_2.html | 19 +- docs/search/variables_2.js | 2 +- docs/search/variables_3.html | 19 +- docs/search/variables_3.js | 2 +- docs/tabs.css | 1 - docs/using.html | 79 +- ide/vs2017/mimalloc-override-test.vcxproj | 190 -- .../mimalloc-override-test.vcxproj.filters | 22 - ide/vs2017/mimalloc-override.vcxproj | 254 --- ide/vs2017/mimalloc-override.vcxproj.filters | 80 - ide/vs2017/mimalloc-test-stress.vcxproj | 159 -- .../mimalloc-test-stress.vcxproj.filters | 22 - ide/vs2017/mimalloc-test.vcxproj | 158 -- ide/vs2017/mimalloc-test.vcxproj.filters | 22 - ide/vs2017/mimalloc.sln | Bin 4493 -> 0 bytes ide/vs2017/mimalloc.vcxproj | 260 --- ide/vs2017/mimalloc.vcxproj.filters | 83 - ide/vs2019/mimalloc-override-test.vcxproj | 190 -- ide/vs2019/mimalloc-override.vcxproj | 257 --- ide/vs2019/mimalloc-override.vcxproj.filters | 81 - ide/vs2019/mimalloc-test-api.vcxproj | 155 -- ide/vs2019/mimalloc-test-stress.vcxproj | 159 -- ide/vs2019/mimalloc-test.vcxproj | 158 -- ide/vs2019/mimalloc.sln | Bin 5263 -> 0 bytes ide/vs2019/mimalloc.vcxproj | 253 --- ide/vs2019/mimalloc.vcxproj.filters | 84 - include/mimalloc-new-delete.h | 28 +- include/mimalloc-override.h | 7 +- include/mimalloc.h | 222 +- .../{mimalloc-atomic.h => mimalloc/atomic.h} | 109 +- .../internal.h} | 691 ++++-- include/mimalloc/prim.h | 323 +++ include/mimalloc/track.h | 147 ++ .../{mimalloc-types.h => mimalloc/types.h} | 358 ++- mimalloc.pc.in | 11 + readme.md | 463 +++- src/alloc-aligned.c | 265 ++- src/alloc-override.c | 297 +++ src/alloc-posix.c | 78 +- src/alloc.c | 791 ++++--- src/arena.c | 913 ++++++-- src/bitmap.c | 432 ++++ src/bitmap.h | 115 + src/bitmap.inc.c | 247 --- src/heap.c | 222 +- src/init.c | 461 ++-- src/options.c | 391 ++-- src/os.c | 1413 ++++-------- src/page-queue.c | 88 +- src/page.c | 292 ++- src/prim/osx/alloc-override-zone.c | 458 ++++ src/prim/osx/prim.c | 9 + src/prim/prim.c | 24 + src/prim/readme.md | 9 + src/prim/unix/prim.c | 859 ++++++++ src/prim/wasi/prim.c | 275 +++ src/prim/windows/etw-mimalloc.wprp | 61 + src/prim/windows/etw.h | 905 ++++++++ src/prim/windows/etw.man | Bin 0 -> 3926 bytes src/prim/windows/prim.c | 670 ++++++ src/prim/windows/readme.md | 17 + src/random.c | 46 +- src/region.c | 500 ----- src/segment-map.c | 153 ++ src/segment.c | 1958 ++++++++++------- src/static.c | 30 +- src/stats.c | 218 +- test/CMakeLists.txt | 46 - test/main-override-static.c | 168 -- test/main-override.c | 30 - test/main-override.cpp | 209 -- test/main.c | 46 - test/readme.md | 16 - test/test-api.c | 249 --- test/test-stress.c | 329 --- 224 files changed, 19984 insertions(+), 10297 deletions(-) create mode 100644 Aurora.json delete mode 100644 CMakeLists.txt delete mode 100644 azure-pipelines.yml delete mode 100644 bin/mimalloc-redirect.dll delete mode 100644 bin/mimalloc-redirect.lib delete mode 100644 bin/mimalloc-redirect32.dll delete mode 100644 bin/mimalloc-redirect32.lib delete mode 100644 cmake/mimalloc-config-version.cmake delete mode 100644 cmake/mimalloc-config.cmake rename doc/{ => bench-2020}/bench-c5-18xlarge-2020-01-20-a.svg (99%) rename doc/{ => bench-2020}/bench-c5-18xlarge-2020-01-20-b.svg (99%) rename doc/{ => bench-2020}/bench-c5-18xlarge-2020-01-20-rss-a.svg (99%) rename doc/{ => bench-2020}/bench-c5-18xlarge-2020-01-20-rss-b.svg (99%) rename doc/{ => bench-2020}/bench-r5a-1.svg (99%) rename doc/{ => bench-2020}/bench-r5a-12xlarge-2020-01-16-a.svg (99%) rename doc/{ => bench-2020}/bench-r5a-12xlarge-2020-01-16-b.svg (99%) rename doc/{ => bench-2020}/bench-r5a-2.svg (99%) rename doc/{ => bench-2020}/bench-r5a-rss-1.svg (99%) rename doc/{ => bench-2020}/bench-r5a-rss-2.svg (99%) rename doc/{ => bench-2020}/bench-spec-rss.svg (100%) rename doc/{ => bench-2020}/bench-spec.svg (100%) rename doc/{ => bench-2020}/bench-z4-1.svg (100%) rename doc/{ => bench-2020}/bench-z4-2.svg (100%) rename doc/{ => bench-2020}/bench-z4-rss-1.svg (100%) rename doc/{ => bench-2020}/bench-z4-rss-2.svg (100%) create mode 100644 doc/bench-2021/bench-amd5950x-2021-01-30-a.svg create mode 100644 doc/bench-2021/bench-amd5950x-2021-01-30-b.svg create mode 100644 doc/bench-2021/bench-c5-18xlarge-2021-01-30-a.svg create mode 100644 doc/bench-2021/bench-c5-18xlarge-2021-01-30-b.svg create mode 100644 doc/bench-2021/bench-c5-18xlarge-2021-01-30-rss-a.svg create mode 100644 doc/bench-2021/bench-c5-18xlarge-2021-01-30-rss-b.svg create mode 100644 doc/bench-2021/bench-macmini-2021-01-30.svg create mode 100644 doc/ds-logo.jpg create mode 100644 doc/ds-logo.png create mode 100644 doc/spades-logo.png create mode 100644 doc/unreal-logo.svg delete mode 100644 ide/vs2017/mimalloc-override-test.vcxproj delete mode 100644 ide/vs2017/mimalloc-override-test.vcxproj.filters delete mode 100644 ide/vs2017/mimalloc-override.vcxproj delete mode 100644 ide/vs2017/mimalloc-override.vcxproj.filters delete mode 100644 ide/vs2017/mimalloc-test-stress.vcxproj delete mode 100644 ide/vs2017/mimalloc-test-stress.vcxproj.filters delete mode 100644 ide/vs2017/mimalloc-test.vcxproj delete mode 100644 ide/vs2017/mimalloc-test.vcxproj.filters delete mode 100644 ide/vs2017/mimalloc.sln delete mode 100644 ide/vs2017/mimalloc.vcxproj delete mode 100644 ide/vs2017/mimalloc.vcxproj.filters delete mode 100644 ide/vs2019/mimalloc-override-test.vcxproj delete mode 100644 ide/vs2019/mimalloc-override.vcxproj delete mode 100644 ide/vs2019/mimalloc-override.vcxproj.filters delete mode 100644 ide/vs2019/mimalloc-test-api.vcxproj delete mode 100644 ide/vs2019/mimalloc-test-stress.vcxproj delete mode 100644 ide/vs2019/mimalloc-test.vcxproj delete mode 100644 ide/vs2019/mimalloc.sln delete mode 100644 ide/vs2019/mimalloc.vcxproj delete mode 100644 ide/vs2019/mimalloc.vcxproj.filters rename include/{mimalloc-atomic.h => mimalloc/atomic.h} (79%) rename include/{mimalloc-internal.h => mimalloc/internal.h} (50%) create mode 100644 include/mimalloc/prim.h create mode 100644 include/mimalloc/track.h rename include/{mimalloc-types.h => mimalloc/types.h} (56%) create mode 100644 mimalloc.pc.in create mode 100644 src/alloc-override.c create mode 100644 src/bitmap.c create mode 100644 src/bitmap.h delete mode 100644 src/bitmap.inc.c create mode 100644 src/prim/osx/alloc-override-zone.c create mode 100644 src/prim/osx/prim.c create mode 100644 src/prim/prim.c create mode 100644 src/prim/readme.md create mode 100644 src/prim/unix/prim.c create mode 100644 src/prim/wasi/prim.c create mode 100644 src/prim/windows/etw-mimalloc.wprp create mode 100644 src/prim/windows/etw.h create mode 100644 src/prim/windows/etw.man create mode 100644 src/prim/windows/prim.c create mode 100644 src/prim/windows/readme.md delete mode 100644 src/region.c create mode 100644 src/segment-map.c delete mode 100644 test/CMakeLists.txt delete mode 100644 test/main-override-static.c delete mode 100644 test/main-override.c delete mode 100644 test/main-override.cpp delete mode 100644 test/main.c delete mode 100644 test/readme.md delete mode 100644 test/test-api.c delete mode 100644 test/test-stress.c diff --git a/.gitattributes b/.gitattributes index acdbdbf..0332e03 100644 --- a/.gitattributes +++ b/.gitattributes @@ -2,9 +2,11 @@ * text eol=lf *.png binary *.pdn binary +*.jpg binary *.sln binary *.suo binary *.vcproj binary *.patch binary *.dll binary *.lib binary +*.exe binary diff --git a/.gitignore b/.gitignore index 3639d32..f8b7f5e 100644 --- a/.gitignore +++ b/.gitignore @@ -3,6 +3,7 @@ ide/vs20??/*.opendb ide/vs20??/*.user ide/vs20??/*.vcxproj.filters ide/vs20??/.vs +ide/vs20??/VTune* out/ docs/ *.zip diff --git a/Aurora.json b/Aurora.json new file mode 100644 index 0000000..6c0eeb2 --- /dev/null +++ b/Aurora.json @@ -0,0 +1,15 @@ +{ + "name": "mimalloc", + "type": "generic", + "sourcePaths": "src", + "include": "include", + "excludes": [ + "src/page-queue.c", + "src/alloc-override.c", + "src/prim/*/*.*", + "src/static.c" + ], + "sources": [ + "src/prim/prim.c" + ] +} \ No newline at end of file diff --git a/CMakeLists.txt b/CMakeLists.txt deleted file mode 100644 index 35460e8..0000000 --- a/CMakeLists.txt +++ /dev/null @@ -1,367 +0,0 @@ -cmake_minimum_required(VERSION 3.0) -project(libmimalloc C CXX) - -set(CMAKE_C_STANDARD 11) -set(CMAKE_CXX_STANDARD 17) - -option(MI_SECURE "Use full security mitigations (like guard pages, allocation randomization, double-free mitigation, and free-list corruption detection)" OFF) -option(MI_DEBUG_FULL "Use full internal heap invariant checking in DEBUG mode (expensive)" OFF) -option(MI_PADDING "Enable padding to detect heap block overflow (used only in DEBUG mode)" ON) -option(MI_OVERRIDE "Override the standard malloc interface (e.g. define entry points for malloc() etc)" ON) -option(MI_XMALLOC "Enable abort() call on memory allocation failure by default" OFF) -option(MI_SHOW_ERRORS "Show error and warning messages by default (only enabled by default in DEBUG mode)" OFF) -option(MI_USE_CXX "Use the C++ compiler to compile the library (instead of the C compiler)" OFF) -option(MI_SEE_ASM "Generate assembly files" OFF) -option(MI_INTERPOSE "Use interpose to override standard malloc on macOS" ON) -option(MI_OSX_ZONE "Use malloc zone to override standard malloc on macOS" OFF) # enables interpose as well -option(MI_LOCAL_DYNAMIC_TLS "Use slightly slower, dlopen-compatible TLS mechanism (Unix)" OFF) -option(MI_BUILD_SHARED "Build shared library" ON) -option(MI_BUILD_STATIC "Build static library" ON) -option(MI_BUILD_OBJECT "Build object library" ON) -option(MI_BUILD_TESTS "Build test executables" ON) -option(MI_DEBUG_TSAN "Build with thread sanitizer (needs clang)" OFF) -option(MI_DEBUG_UBSAN "Build with undefined-behavior sanitizer (needs clang++)" OFF) -option(MI_CHECK_FULL "Use full internal invariant checking in DEBUG mode (deprecated, use MI_DEBUG_FULL instead)" OFF) - -include("cmake/mimalloc-config-version.cmake") - -set(mi_sources - src/stats.c - src/random.c - src/os.c - src/arena.c - src/region.c - src/segment.c - src/page.c - src/alloc.c - src/alloc-aligned.c - src/alloc-posix.c - src/heap.c - src/options.c - src/init.c) - -# ----------------------------------------------------------------------------- -# Converience: set default build type depending on the build directory -# ----------------------------------------------------------------------------- - -if (NOT CMAKE_BUILD_TYPE) - if ("${CMAKE_BINARY_DIR}" MATCHES ".*(D|d)ebug$" OR MI_DEBUG_FULL MATCHES "ON") - message(STATUS "No build type selected, default to: Debug") - set(CMAKE_BUILD_TYPE "Debug") - else() - message(STATUS "No build type selected, default to: Release") - set(CMAKE_BUILD_TYPE "Release") - endif() -endif() - -if("${CMAKE_BINARY_DIR}" MATCHES ".*(S|s)ecure$") - message(STATUS "Default to secure build") - set(MI_SECURE "ON") -endif() - -# ----------------------------------------------------------------------------- -# Process options -# ----------------------------------------------------------------------------- - -if(CMAKE_C_COMPILER_ID MATCHES "MSVC|Intel") - set(MI_USE_CXX "ON") -endif() - -if(MI_OVERRIDE MATCHES "ON") - message(STATUS "Override standard malloc (MI_OVERRIDE=ON)") - if(APPLE) - if(MI_OSX_ZONE MATCHES "ON") - # use zone's on macOS - message(STATUS " Use malloc zone to override malloc (MI_OSX_ZONE=ON)") - list(APPEND mi_sources src/alloc-override-osx.c) - list(APPEND mi_defines MI_OSX_ZONE=1) - if(NOT MI_INTERPOSE MATCHES "ON") - message(STATUS " (enabling INTERPOSE as well since zone's require this)") - set(MI_INTERPOSE "ON") - endif() - endif() - if(MI_INTERPOSE MATCHES "ON") - # use interpose on macOS - message(STATUS " Use interpose to override malloc (MI_INTERPOSE=ON)") - list(APPEND mi_defines MI_INTERPOSE) - endif() - endif() -endif() - -if(MI_SECURE MATCHES "ON") - message(STATUS "Set full secure build (MI_SECURE=ON)") - list(APPEND mi_defines MI_SECURE=4) -endif() - -if(MI_SEE_ASM MATCHES "ON") - message(STATUS "Generate assembly listings (MI_SEE_ASM=ON)") - list(APPEND mi_cflags -save-temps) -endif() - -if(MI_CHECK_FULL MATCHES "ON") - message(STATUS "The MI_CHECK_FULL option is deprecated, use MI_DEBUG_FULL instead") - set(MI_DEBUG_FULL "ON") -endif() - -if(MI_DEBUG_FULL MATCHES "ON") - message(STATUS "Set debug level to full internal invariant checking (MI_DEBUG_FULL=ON)") - list(APPEND mi_defines MI_DEBUG=3) # full invariant checking -endif() - -if(MI_PADDING MATCHES "OFF") - message(STATUS "Disable padding of heap blocks in debug mode (MI_PADDING=OFF)") - list(APPEND mi_defines MI_PADDING=0) -endif() - -if(MI_XMALLOC MATCHES "ON") - message(STATUS "Enable abort() calls on memory allocation failure (MI_XMALLOC=ON)") - list(APPEND mi_defines MI_XMALLOC=1) -endif() - -if(MI_SHOW_ERRORS MATCHES "ON") - message(STATUS "Enable printing of error and warning messages by default (MI_SHOW_ERRORS=ON)") - list(APPEND mi_defines MI_SHOW_ERRORS=1) -endif() - -if(MI_DEBUG_TSAN MATCHES "ON") - if(CMAKE_C_COMPILER_ID MATCHES "Clang") - message(STATUS "Build with thread sanitizer (MI_DEBUG_TSAN=ON)") - list(APPEND mi_defines MI_TSAN=1) - list(APPEND mi_cflags -fsanitize=thread -g -O1) - list(APPEND CMAKE_EXE_LINKER_FLAGS -fsanitize=thread) - else() - message(WARNING "Can only use thread sanitizer with clang (MI_DEBUG_TSAN=ON but ignored)") - endif() -endif() - -if(MI_DEBUG_UBSAN MATCHES "ON") - if(CMAKE_BUILD_TYPE MATCHES "Debug") - if(CMAKE_CXX_COMPILER_ID MATCHES "Clang") - message(STATUS "Build with undefined-behavior sanitizer (MI_DEBUG_UBSAN=ON)") - list(APPEND mi_cflags -fsanitize=undefined -g) - list(APPEND CMAKE_EXE_LINKER_FLAGS -fsanitize=undefined) - if (MI_USE_CXX MATCHES "OFF") - message(STATUS "(switch to use C++ due to MI_DEBUG_UBSAN)") - set(MI_USE_CXX "ON") - endif() - else() - message(WARNING "Can only use undefined-behavior sanitizer with clang++ (MI_DEBUG_UBSAN=ON but ignored)") - endif() - else() - message(WARNING "Can only use thread sanitizer with a debug build (CMAKE_BUILD_TYPE=${CMAKE_BUILD_TYPE})") - endif() -endif() - -if(MI_USE_CXX MATCHES "ON") - message(STATUS "Use the C++ compiler to compile (MI_USE_CXX=ON)") - set_source_files_properties(${mi_sources} PROPERTIES LANGUAGE CXX ) - set_source_files_properties(src/static.c test/test-api.c test/test-stress PROPERTIES LANGUAGE CXX ) - if(CMAKE_CXX_COMPILER_ID MATCHES "AppleClang|Clang") - list(APPEND mi_cflags -Wno-deprecated) - endif() - if(CMAKE_CXX_COMPILER_ID MATCHES "Intel") - list(APPEND mi_cflags -Kc++) - endif() -endif() - -# Compiler flags -if(CMAKE_C_COMPILER_ID MATCHES "AppleClang|Clang|GNU") - list(APPEND mi_cflags -Wall -Wextra -Wno-unknown-pragmas -fvisibility=hidden) - if(CMAKE_C_COMPILER_ID MATCHES "GNU") - list(APPEND mi_cflags -Wno-invalid-memory-model) - endif() -endif() - -if(CMAKE_C_COMPILER_ID MATCHES "Intel") - list(APPEND mi_cflags -Wall -fvisibility=hidden) -endif() - -if(CMAKE_C_COMPILER_ID MATCHES "AppleClang|Clang|GNU|Intel" AND NOT CMAKE_SYSTEM_NAME MATCHES "Haiku") - if(MI_LOCAL_DYNAMIC_TLS MATCHES "ON") - list(APPEND mi_cflags -ftls-model=local-dynamic) - else() - list(APPEND mi_cflags -ftls-model=initial-exec) - endif() -endif() - -# Architecture flags -if(${CMAKE_HOST_SYSTEM_PROCESSOR} MATCHES "arm") - list(APPEND mi_cflags -march=native) -endif() - -# extra needed libraries -if(WIN32) - list(APPEND mi_libraries psapi shell32 user32 advapi32 bcrypt) -else() - if(NOT ${CMAKE_C_COMPILER} MATCHES "android") - list(APPEND mi_libraries pthread) - find_library(LIBRT rt) - if(LIBRT) - list(APPEND mi_libraries ${LIBRT}) - endif() - endif() -endif() - -# ----------------------------------------------------------------------------- -# Install and output names -# ----------------------------------------------------------------------------- - -set(mi_install_dir "${CMAKE_INSTALL_PREFIX}/lib/mimalloc-${mi_version}") -if(MI_SECURE MATCHES "ON") - set(mi_basename "mimalloc-secure") -else() - set(mi_basename "mimalloc") -endif() -string(TOLOWER "${CMAKE_BUILD_TYPE}" CMAKE_BUILD_TYPE_LC) -if(NOT(CMAKE_BUILD_TYPE_LC MATCHES "^(release|relwithdebinfo|minsizerel)$")) - set(mi_basename "${mi_basename}-${CMAKE_BUILD_TYPE_LC}") #append build type (e.g. -debug) if not a release version -endif() -if(MI_BUILD_SHARED) - list(APPEND mi_build_targets "shared") -endif() -if(MI_BUILD_STATIC) - list(APPEND mi_build_targets "static") -endif() -if(MI_BUILD_OBJECT) - list(APPEND mi_build_targets "object") -endif() -if(MI_BUILD_TESTS) - list(APPEND mi_build_targets "tests") -endif() -message(STATUS "") -message(STATUS "Library base name: ${mi_basename}") -message(STATUS "Build type : ${CMAKE_BUILD_TYPE_LC}") -if(MI_USE_CXX MATCHES "ON") - message(STATUS "Compiler : ${CMAKE_CXX_COMPILER}") -else() - message(STATUS "Compiler : ${CMAKE_C_COMPILER}") -endif() -message(STATUS "Install directory: ${mi_install_dir}") -message(STATUS "Build targets : ${mi_build_targets}") -message(STATUS "") - -# ----------------------------------------------------------------------------- -# Main targets -# ----------------------------------------------------------------------------- - -# shared library -if(MI_BUILD_SHARED) - add_library(mimalloc SHARED ${mi_sources}) - set_target_properties(mimalloc PROPERTIES VERSION ${mi_version} OUTPUT_NAME ${mi_basename} ) - target_compile_definitions(mimalloc PRIVATE ${mi_defines} MI_SHARED_LIB MI_SHARED_LIB_EXPORT) - target_compile_options(mimalloc PRIVATE ${mi_cflags}) - target_link_libraries(mimalloc PUBLIC ${mi_libraries}) - target_include_directories(mimalloc PUBLIC - $ - $ - ) - if(WIN32) - # On windows copy the mimalloc redirection dll too. - target_link_libraries(mimalloc PRIVATE ${CMAKE_CURRENT_SOURCE_DIR}/bin/mimalloc-redirect.lib) - add_custom_command(TARGET mimalloc POST_BUILD - COMMAND "${CMAKE_COMMAND}" -E copy "${CMAKE_CURRENT_SOURCE_DIR}/bin/mimalloc-redirect.dll" $ - COMMENT "Copy mimalloc-redirect.dll to output directory") - endif() - - install(TARGETS mimalloc EXPORT mimalloc DESTINATION ${mi_install_dir} LIBRARY) - install(EXPORT mimalloc DESTINATION ${mi_install_dir}/cmake) -endif() - -# static library -if (MI_BUILD_STATIC) - add_library(mimalloc-static STATIC ${mi_sources}) - set_property(TARGET mimalloc-static PROPERTY POSITION_INDEPENDENT_CODE ON) - target_compile_definitions(mimalloc-static PRIVATE ${mi_defines} MI_STATIC_LIB) - target_compile_options(mimalloc-static PRIVATE ${mi_cflags}) - target_link_libraries(mimalloc-static PUBLIC ${mi_libraries}) - target_include_directories(mimalloc-static PUBLIC - $ - $ - ) - if(WIN32) - # When building both static and shared libraries on Windows, a static library should use a - # different output name to avoid the conflict with the import library of a shared one. - string(REPLACE "mimalloc" "mimalloc-static" mi_output_name ${mi_basename}) - set_target_properties(mimalloc-static PROPERTIES OUTPUT_NAME ${mi_output_name}) - else() - set_target_properties(mimalloc-static PROPERTIES OUTPUT_NAME ${mi_basename}) - endif() - - install(TARGETS mimalloc-static EXPORT mimalloc DESTINATION ${mi_install_dir}) -endif() - -# install include files -install(FILES include/mimalloc.h DESTINATION ${mi_install_dir}/include) -install(FILES include/mimalloc-override.h DESTINATION ${mi_install_dir}/include) -install(FILES include/mimalloc-new-delete.h DESTINATION ${mi_install_dir}/include) -install(FILES cmake/mimalloc-config.cmake DESTINATION ${mi_install_dir}/cmake) -install(FILES cmake/mimalloc-config-version.cmake DESTINATION ${mi_install_dir}/cmake) - -if(NOT WIN32 AND MI_BUILD_SHARED) - # install a symlink in the /usr/local/lib to the versioned library - set(mi_symlink "${CMAKE_SHARED_MODULE_PREFIX}${mi_basename}${CMAKE_SHARED_LIBRARY_SUFFIX}") - set(mi_soname "mimalloc-${mi_version}/${mi_symlink}.${mi_version}") - install(CODE "execute_process(COMMAND ${CMAKE_COMMAND} -E create_symlink ${mi_soname} ${mi_symlink} WORKING_DIRECTORY ${mi_install_dir}/..)") - install(CODE "MESSAGE(\"-- Symbolic link: ${CMAKE_INSTALL_PREFIX}/lib/${mi_symlink} -> ${mi_soname}\")") -endif() - -# single object file for more predictable static overriding -if (MI_BUILD_OBJECT) - add_library(mimalloc-obj OBJECT src/static.c) - set_property(TARGET mimalloc-obj PROPERTY POSITION_INDEPENDENT_CODE ON) - target_compile_definitions(mimalloc-obj PRIVATE ${mi_defines}) - target_compile_options(mimalloc-obj PRIVATE ${mi_cflags}) - target_include_directories(mimalloc-obj PUBLIC - $ - $ - ) - - # the following seems to lead to cmake warnings/errors on some systems, disable for now :-( - # install(TARGETS mimalloc-obj EXPORT mimalloc DESTINATION ${mi_install_dir}) - - # the FILES expression can also be: $ - # but that fails cmake versions less than 3.10 so we leave it as is for now - install(FILES ${CMAKE_CURRENT_BINARY_DIR}/CMakeFiles/mimalloc-obj.dir/src/static.c${CMAKE_C_OUTPUT_EXTENSION} - DESTINATION ${mi_install_dir} - RENAME ${mi_basename}${CMAKE_C_OUTPUT_EXTENSION} ) -endif() - -# ----------------------------------------------------------------------------- -# API surface testing -# ----------------------------------------------------------------------------- - -if (MI_BUILD_TESTS MATCHES "ON") - add_executable(mimalloc-test-api test/test-api.c) - target_compile_definitions(mimalloc-test-api PRIVATE ${mi_defines}) - target_compile_options(mimalloc-test-api PRIVATE ${mi_cflags}) - target_include_directories(mimalloc-test-api PRIVATE include) - target_link_libraries(mimalloc-test-api PRIVATE mimalloc-static ${mi_libraries}) - - add_executable(mimalloc-test-stress test/test-stress.c) - target_compile_definitions(mimalloc-test-stress PRIVATE ${mi_defines}) - target_compile_options(mimalloc-test-stress PRIVATE ${mi_cflags}) - target_include_directories(mimalloc-test-stress PRIVATE include) - target_link_libraries(mimalloc-test-stress PRIVATE mimalloc ${mi_libraries}) - - enable_testing() - add_test(test_api, mimalloc-test-api) - add_test(test_stress, mimalloc-test-stress) -endif() - -# ----------------------------------------------------------------------------- -# Set override properties -# ----------------------------------------------------------------------------- -if (MI_OVERRIDE MATCHES "ON") - if (MI_BUILD_SHARED) - target_compile_definitions(mimalloc PRIVATE MI_MALLOC_OVERRIDE) - endif() - if(NOT WIN32) - # It is only possible to override malloc on Windows when building as a DLL. - if (MI_BUILD_STATIC) - target_compile_definitions(mimalloc-static PRIVATE MI_MALLOC_OVERRIDE) - endif() - if (MI_BUILD_OBJECT) - target_compile_definitions(mimalloc-obj PRIVATE MI_MALLOC_OVERRIDE) - endif() - endif() -endif() diff --git a/LICENSE b/LICENSE index 4151dbe..670b668 100644 --- a/LICENSE +++ b/LICENSE @@ -1,6 +1,6 @@ MIT License -Copyright (c) 2019 Microsoft Corporation, Daan Leijen +Copyright (c) 2018-2021 Microsoft Corporation, Daan Leijen Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal diff --git a/azure-pipelines.yml b/azure-pipelines.yml deleted file mode 100644 index 85e8942..0000000 --- a/azure-pipelines.yml +++ /dev/null @@ -1,168 +0,0 @@ -# Starter pipeline -# Start with a minimal pipeline that you can customize to build and deploy your code. -# Add steps that build, run tests, deploy, and more: -# https://aka.ms/yaml - -trigger: -- master -- dev - -jobs: -- job: - displayName: Windows - pool: - vmImage: - windows-2019 - strategy: - matrix: - Debug: - BuildType: debug - cmakeExtraArgs: -DCMAKE_BUILD_TYPE=Debug -DMI_DEBUG_FULL=ON - MSBuildConfiguration: Debug - Release: - BuildType: release - cmakeExtraArgs: -DCMAKE_BUILD_TYPE=Release - MSBuildConfiguration: Release - Secure: - BuildType: secure - cmakeExtraArgs: -DCMAKE_BUILD_TYPE=Release -DMI_SECURE=ON - MSBuildConfiguration: Release - steps: - - task: CMake@1 - inputs: - workingDirectory: $(BuildType) - cmakeArgs: .. $(cmakeExtraArgs) - - task: MSBuild@1 - inputs: - solution: $(BuildType)/libmimalloc.sln - configuration: '$(MSBuildConfiguration)' - msbuildArguments: -m - - script: ctest --verbose --timeout 120 - workingDirectory: $(BuildType) - displayName: CTest - #- script: $(BuildType)\$(BuildType)\mimalloc-test-stress - # displayName: TestStress - #- upload: $(Build.SourcesDirectory)/$(BuildType) - # artifact: mimalloc-windows-$(BuildType) - -- job: - displayName: Linux - pool: - vmImage: - ubuntu-18.04 - strategy: - matrix: - Debug: - CC: gcc - CXX: g++ - BuildType: debug - cmakeExtraArgs: -DCMAKE_BUILD_TYPE=Debug -DMI_DEBUG_FULL=ON - Release: - CC: gcc - CXX: g++ - BuildType: release - cmakeExtraArgs: -DCMAKE_BUILD_TYPE=Release - Secure: - CC: gcc - CXX: g++ - BuildType: secure - cmakeExtraArgs: -DCMAKE_BUILD_TYPE=Release -DMI_SECURE=ON - Debug++: - CC: gcc - CXX: g++ - BuildType: debug-cxx - cmakeExtraArgs: -DCMAKE_BUILD_TYPE=Debug -DMI_DEBUG_FULL=ON -DMI_USE_CXX=ON - Debug Clang: - CC: clang - CXX: clang++ - BuildType: debug-clang - cmakeExtraArgs: -DCMAKE_BUILD_TYPE=Debug -DMI_DEBUG_FULL=ON - Release Clang: - CC: clang - CXX: clang++ - BuildType: release-clang - cmakeExtraArgs: -DCMAKE_BUILD_TYPE=Release - Secure Clang: - CC: clang - CXX: clang++ - BuildType: secure-clang - cmakeExtraArgs: -DCMAKE_BUILD_TYPE=Release -DMI_SECURE=ON - Debug++ Clang: - CC: clang - CXX: clang++ - BuildType: debug-clang-cxx - cmakeExtraArgs: -DCMAKE_BUILD_TYPE=Debug -DMI_DEBUG_FULL=ON -DMI_USE_CXX=ON - steps: - - task: CMake@1 - inputs: - workingDirectory: $(BuildType) - cmakeArgs: .. $(cmakeExtraArgs) - - script: make -j$(nproc) -C $(BuildType) - displayName: Make - - script: ctest --verbose --timeout 120 - workingDirectory: $(BuildType) - displayName: CTest -# - upload: $(Build.SourcesDirectory)/$(BuildType) -# artifact: mimalloc-ubuntu-$(BuildType) - -- job: - displayName: macOS - pool: - vmImage: - macOS-10.14 - strategy: - matrix: - Debug: - BuildType: debug - cmakeExtraArgs: -DCMAKE_BUILD_TYPE=Debug -DMI_DEBUG_FULL=ON - Release: - BuildType: release - cmakeExtraArgs: -DCMAKE_BUILD_TYPE=Release - Secure: - BuildType: secure - cmakeExtraArgs: -DCMAKE_BUILD_TYPE=Release -DMI_SECURE=ON - steps: - - task: CMake@1 - inputs: - workingDirectory: $(BuildType) - cmakeArgs: .. $(cmakeExtraArgs) - - script: make -j$(sysctl -n hw.ncpu) -C $(BuildType) - displayName: Make - - script: ctest --verbose --timeout 120 - workingDirectory: $(BuildType) - displayName: CTest -# - upload: $(Build.SourcesDirectory)/$(BuildType) -# artifact: mimalloc-macos-$(BuildType) - -# - job: -# displayName: Windows-2017 -# pool: -# vmImage: -# vs2017-win2016 -# strategy: -# matrix: -# Debug: -# BuildType: debug -# cmakeExtraArgs: -A x64 -DCMAKE_BUILD_TYPE=Debug -DMI_DEBUG_FULL=ON -# MSBuildConfiguration: Debug -# Release: -# BuildType: release -# cmakeExtraArgs: -A x64 -DCMAKE_BUILD_TYPE=Release -# MSBuildConfiguration: Release -# Secure: -# BuildType: secure -# cmakeExtraArgs: -A x64 -DCMAKE_BUILD_TYPE=Release -DMI_SECURE=ON -# MSBuildConfiguration: Release -# steps: -# - task: CMake@1 -# inputs: -# workingDirectory: $(BuildType) -# cmakeArgs: .. $(cmakeExtraArgs) -# - task: MSBuild@1 -# inputs: -# solution: $(BuildType)/libmimalloc.sln -# configuration: '$(MSBuildConfiguration)' -# - script: | -# cd $(BuildType) -# ctest --verbose --timeout 120 -# displayName: CTest diff --git a/bin/mimalloc-redirect.dll b/bin/mimalloc-redirect.dll deleted file mode 100644 index b7bf1d099681fc73d15ee8dd1b86a48de0aca1d1..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 55808 zcmeHw3wT@Ao#&CU8z;oEff!7oaFZxRG$beq1?5#_u)_^?65$xerD-k2R$>)DgdRpP zVQ}hX>Wpzem(p*ueN0WB&fD#5Lufm!plM=SN>gU0{nM0epHoRU~{!A^JbN>hf#8^jTbK}K}3PEc3wj1JjUL`i&8O*qn3<=Umo)!Bal>- znHMD`F~K9qhi)?<1AQ^F&8hm#0%*5jsvv^tupy^+E*qS`sTF|rL=QIQ z^nQ>5cTajrF83<^hPS+zvEg58xU8Ck%U{`Xd4|fqOWDq=ahZ1~F8_^EYvC%x`FG&* zrFpolfW?PPr{O|oAMT>m8uX;$2PiwU5SP1d#O37$xO7uCaXl_!INI=w#N)%$aXF2q z82-|gxO|&{D~X49J}#fX371;{$0dE&U-Vs7_CkGEjlHC5SB1T-3Rz9>IPcQCE9|-?$*1D_O~#W7=+qio{@MIT}D5PO7cp*aL>0Yi;aI zejy-N|2>i{Qg#YgrauyAAiM)W#V_XDcE+Rm%i_stz%sTwWo0$9abi0iF7; zd^;svBy%C9+>|O2snG$-xb=>0_7WBW1_49y;*--m0gT*eTu~_GX%I=iK*&yL=Ex8u zi>9I|Q@%3ds<9}{y3Ouj(HSrqAJ~$Glp4hkZ1R&~SwD@NCD}k(Cu@6{gwTplvQD9( zCdEUORM;Ij$}U|u(va)d z33pNEFVoNFqx&(IywYMwr@lPj9xhYH*7Pd|^sbjk7)NJe^7TvOonj-bSTNj9PLrLd zXjR4NMYb~@xmVx5`nLPvXg~|!39q{0EP3Nhw0{lU`ik%CUEkKbN{awO&M*@WQ^1hn z#w_^l8XHS~0a!oBlmH+8AIJ+IzFfO0hpFg92dhAvm8ChcPOa@>krIk)S)`E1C2cns zzgS`SLXR0_H*bQb=r21HzeP0sC@zq;8ZzndZkHg@RWSbcfAZ=8d1?Y zMy5YCOQhmXAlQ>LW$rG@5d(YT3m}?C09BskK8qM_oHg<6Dtf&V{1;Nwk`zwj9n_a2 z6}|60UtZgFuByABh$H6P$~!Ac zMzbKkd722<*ynW4whey_T@_xdUtW(51S52Yk+ zVdrd&Y6UK2g&!}bRCmG60!%}Wyf~X4Ca*+878dhPw2CZKBGSBpshkE-lucjxQuIcu zH^xm4ESt9^d5YJW;1|A>jjytfi9gLk;Grj0jKJ>jEwmmk)Q&n;xDz{3feC{~R1NlE zd_>idU}CVK3Oi+ag`Gg)C3ZU+G3#WdgfPYCq0U7vtS7F|XEf+S223eXtoTKgVtBn? z6r3zfyoDu3@r!X;5uL^>l5-UTRMB`^8p$oBJ;BH0iwI`5j}QR^gqJAlqK#^JnmUX- za+}}^seD2z!5t!Fyi2STWw55UazM1BTS+B|(8LJB$!85Z*Bf;BB+BU&7i*_^ylfgUPAo z`oTW@GQ3-X@Fm1>zbx^v=(J_=;pZsJeU>j8(p``@wpdN@0aTY>z`fj~i`9gO&llv@ zbKviHP}VCNMo^P@o4VPHaWsWvKtI2;G74vkZQyOvU74iYoPv{n2` zA2hl2cCfh3m|1iG#Zm>s6r|&3fG7}?gnTJFgVfi^vkG|%RlBGusZewPtz(s)MbA);}2dha(fARsp0l751eXN$Vl$kt+}2vV>A@xCCdl5GyW` z(xM-vNy7;dmt3~+|ANJfq_Zfxf*A0%`ehm5(InR6vNRw^sXKD9yF5P5yvi7rd3&&dxWH} zrBS~&@%pde6W$bdFv2?_+$JUlA*7;5IvJ1G!jR3!YnmPeqwVJh(F5Rm5kw3FbON!hc;{0EjBP1Dm2cC#pS8!S zVY`c#5Uvc_~P{@iGG4Z+Qb(?P)7xIAScn`9mt6U`L$ClfN+{8EACLN?f|PfBr8@G z#XCQRdaJxWM7}B|FQ2S9b(bRIGRr&9BwB=UZ6?uZBP&E(MY2G&RYEj3WjR&1qUuf) z?KMn6R?+4Y`7b98Q&t#6uvZgpL5BvaEh1WmDLY1%@r{sf$fXmF)S9u%AX%kIR&^Hq z{;Qe7^nV1x*i*uI3`~#0^q7UYXuCc|1W*63RJ+y~Le@wjYlQLW^j{dSR53FHW6(I*(8Jv8mxkfRS>K&m6cY52zviV zh}JDctGl3%iZHvj0}ENN%+lfx*?`RUh-^q^cZ+O?%=U`x(=yvf*|R(B{fOzuC%d^- z-HJ)+6+Qr91v3Qs66+I?19KGCn%nF#R=nddP$26=L=E#|EHRfu6qK&RK}N^wB19~5 zE%o+!7%KR>loR^p|0IP<4|o}SffP?%0Xz`KG8@_h^ae1nv&d{%;3^PLd=CilA3I>l zd|2a8KT~i3J;av0mGXJfYXQ23K=%nyx=Y29Gf~=3rJq767UL11fcz{J@1o*YQOtop zPq}~q+8}_gg9aZ$5({b=fJW%i(pAV~s*dQ}PY{F-8i?U^BU)}*O$FAT5882i~g%|<+n8uVvG<`=2#Zrg2;_k4dyVU?x95$*49{M zSK=fA=Y-f9(>dYL`-vqms=D0R;MZUSigLc&ag3G}pNzxc(>cHycM0~ar%A?%b-}dr zE9^{gdQSrJ9a|%%TznH)1xX=X>5u=2LyuPy4?sZFIiRJ3ZM%jBE4N$%U9J<?NtcJlkFv^1MuWc)?I^p2fWD^0G^z}NuFQ)JnXUTb>mI|Akh18 zbVCptHGft2)Ak;at?G)?qOBcBFe?KQGC9oZV%y%UBo}uluGF`qM-y_04)G#FI& zh3cG`pWg$3P9gxA{2nKS{A|iQlF#td%f>%#W2*VcMXnF`f&t)fP!!|bXz8_erqS|A za_a&qFU?my)?tjW?>9zRr}T6;0Xq^g0E?j;1Dit(-GPr~ z6~;y5E4W;molN8D_Vawn2_gHq+VUv!EjvlR!`@4U)G(s)kaAPXt^7zH$`goA6}s{x z^kqV&=MZ2;kMbiEJdW#V6p3kAnZ7}=lU`3${PQo*rw8rMcD#|6$@{CvJnqmx5|;=WuOXpja{ zRANBx%HM9Oj1f{SIc>OH9K>%wP3FF|R(j{gt(1R5N_XPAABkayFTe2cME=rvlAkF$ zy4;QMxk6fW(~{_Nr^$=lW-}C0@-&KJolG}cdg3Ey&n_6AMgw7YQK1LxsgM7=kXR=K z-opB5>EBoo=s_EruDG+$Pb0Z)udA}ypvB%m|qhAD(mnR4?jC97!IJW_#`%_h{cAj z;AiX58e~A)uob+aa?}ekycPX-6eNBRLMF7C!p1<-lhWQDam_Tgpr(;v8mY`d4vOY9 zGrp1r3pfl`_|th(Ly|DKPhcja$0&Hq8_!nMiX}?S7>=LNyXBF%+Pnj+7UP;&|DL0< zIhJ_iWVf6sazG9dTFEH1A$-y4JNpjOz`#~>bkWAEqjARqAVfNFQJZ8XL>p^Dg#@l`2wrH8}De;h=OAEt-hzzXMh`L@+b zkc%!=i)X%y;T0Y6JbKs*kHeYA`r&;5AO0dP3IpzP**n(a%6@zT zz~EL!E(Wv5%CHqt=|YCPpz~x7-4JGRR&|vF_M9l}(hCzsKR|Ez6 zd1-iejN7(p{B^R4NAmZe(a=x@!~f3BLj#?haxkD^#2^;6rU%KWo%z_p8yqPYxv|D) z$A}M4@sp9UUQ4Wnpvn_@kptULqlCLLmCRQ#+=CrwY3G;fOWcJa1I^jHX4{g>zgA!{ zNc~A8YxoLLc{;nmS z`46-gveKFz*;o8y?Ef5<%U+>V7oD_l^VUu*`KL?pz09p-EH$z5H3uFZiIZF&J%Gyy zw<tzvtI-9cQRbo$Br!13_+aVzzQsK6oO{ddyo zaq*6CE4ZqzLMf`-ks+&#dM4;&rl*HRi+6lRp`nYRyU&)a+}uR9de?O7xoKu2eaQdQ zOQrj#^Z^0x6G9(ILQI8b!fsMXrJM(6okc%f1MOZt2kriVj)U&-Zn`a;>91%mc}VB_ z$|f)_)jUza)4pHb!Z;b#^a*$&4(MGHy$*S-e=-KDo9O%%1nXHme< z8R_^ztf}S_;C_@-zjF!GbJ#<4dmX9T#D@$lOl|_}_m#l<8Hk9m>gIz{UowJ~;!t`?ovZyP>=a`>K}7v;W&D(sD;h3Kg|c@Yi`BQJF6#%|;UA#kOe>%bUM#+S2$ibu8*v zUNuO;EzsSBLy^>CA|yK&$sx)?&AnVN;l`yQ64Yv0^k#BR0xx6HYj~RAcIhQReH~CR zkCu;^PF}F?a3d+_MM9%R&z;}pX9rkEqC}j2^NE*6p%=>GO3MHMnRftH@Px0^fzA#* z;FVlMMYd=OVSCi5<`f$q%4?)kst?Ew7@Z)}5j&^T^cFcYm`lmIsML0vMbf8V9UXl~ zJb1j;lh2o8#b3y8gpmJ0Fg!^N{pnUL6vk|FyYd|z1Oftm%#V8Epx3~1&%0r{x4(l` z0nV{l@@5In4s8(rPnJ zk9<2~J#z}6T+Ft#uA-?n;-qQTRCvVz=2&Qmwj4<0Vb~EWk`s56V#m2(@SaF)94KSy z1E7N_IxKARl0Twe;b3hmE!AlZKaB;8U?{pQcN6)fsU!K1str>8cl@2!`0YMcEq@;) z+oYh(I;P^#5D%kNlGI-A>#*?vi{Ozpqo8Z{0KDbL9iGBcdyb{HoI0F>ny6>ae8`_JbqV<4CY(wRlg0|c63<3E9 zY>|B_ZZ_+L)0X|grSwu=uDd@^tr9SGUp;k{tx3sg=6O`4yF7)|c<#i1Is6l<@cNL>g-a98FWY%TpqV-eV%F4c|>?NAHN)jPnC=cl{sn z7AFmMUq#GMDy+NNGW5X2N5rgXW?LhUnJq@k4@inY9~!KGDGNl z0kKuzG41NGAJ^wLcb~@Hdi3+n7YganA;-4H7-)JA|md?bRVh5M%CF%Z0;~rn=ITQ6(NF|T;=#{_4S%>3yPQaXPrNw2vqhqVj7>KT&1nk0m*=D=_%u^q&e& zLkYY|B#u8*<}y(h$rL?~_C+z!r4Um5`IAE?`&uCdJ&QhsL^G1vzSFZ~3j7K>{pLi> zn;L8$NU8sd2azo;!~KhIg2t5eg-ooJ87=|;(0KS+q`aOEzQ*#Olz!>*T8-2&2GdKB zH!ub&S2~Nl|9L$4OO^MIG5q}!M*^zrP& z^~=K4+Md78&R*OP%8HNmtCh$v#vqb%=W*zzcfy~IL27J$vdHt3F^F7T9t_g*kc%Hm z){>@t)v8l#xf98EEp?W4_Di^zOtz<2*%7SbV~8 zCq6?5EVm?aII#M!=;4J(8TUS8z#lCwNAX3c6mIWyewZk6kKjH1w&Z&*jO5*x7(aEsZRA zNQXZ3fTshOy`K2p3mBOIq9q%WcOeE}qW50HD(5$e6!#6-3MTJPUQIQs>`E$In7kG3 zcH$K~6>9eRa8ZWb3rP=IqGGhGzfeNvj8J+(o4jV`3|AJqC$*;fS z*Wd8#Tm1Sqzy1fVm%}Iro3lX90yzuhEReH6&H_0LV#yf4tLSnY=onzJ1Xl0MDAL>v0~!~TTdol8v5z| z`~K-$#Sg7|;C=M0+Py0_Js9?f!kZd=zLrf5{TFpSe2`o%I`t>)i!qZTnR^UnT?eZyfrSgu|ld>{HXpD67LPfcr7CT9vN>o#RN~~ zrFpE>wvyRq=CPT!bJ`1~^4N8@&k8vZd1u6K-_1VZV=gKwZRU0c;uHUe7!UmNuc+HlT~S%h*qD4h8Z@zy)9`<13dK+F%w?&s z!@r=_nV{y72+=U{5Bax7n|vWj?Dj1ozh9W`U3+bbz-F@1$#P0iny6v#z!Sa*ngagS z+7NB>!(X-5P=i0TA_Izhst&cnnKt|C9~s;C<}ikpOg&%l)RA_kyi~@hSNUcV zRRGuVG;m~0Aa(v&5FRP18F^LCqV=H&aZ(LslGh(@ZGwsB&JWL-AD&B2$rn;&KBL#A zjb_|BA%7dXwag~2MJLP9F%p;58NvC3rQ&g%|Y}@Lm2#9 zAXydpG7K2C5=ftE+az_Y-hXpF>7fz1mvzb}MgD5Sw)mMPpwzP&cLo2giZV8Yh3w=fJBAv$^UsHa9zCYbU6;carMeDD{m^Q16~es&}WYO*Z3sWyF}{ioS@!4lT>eA>g%1L z-WMjR-Z80f&jj_>swUPy{>;lY)+hBHn4sR?Nvijd()XJaYq#D>s&|>x*EK=ChbF1s z9;t6|f_iJ~Cgvx9?*9F>)OYs;_5O3qKT-bsq`v)sVS2}N%qHJ)N%Sg-P0fFQ#{i)U!;+4vXI2Dcas{si#NAUW?xDDXMow>e(*i9*f?=DXMp` z)U)5B@5TDZWUn8P`VRhu>3u=z`>phGe6qLa#pExM`f7h+dOM}QZW((l`cKt$OQX~? zCgXOC-cxnm(j)ckmGLR1zg(vcP0@MmoYZqj#v?NBmwK0Mn405V$r+)SCS#|Jy;AS^ z6m4%^>RBseHU9V3q_=aUvP;y~PS3hd_Fqiu(`nJWJzu<-D}Z% zP}aMrh~5dQ&xl3u$?nG&lfUGw@MnjN-7;2qy&Kd0U6oJv*emr6$~b1xd#bKmI;Eby zGCpO|J3d9*dr<0`Q2GuCzwUWJ#K9@5cbU}FDdWlBZ!cATUFz$Vam=Fs&=hU&Ua4nX z#zPjpnPuH}srG!g!xg?F`f-_zmAsxQx*t*cIi$WWi{9}muD3_(>$T|JKE?G8N`2cc zdNa?|T&F2N?~(fU%D7*~L8-SU=Wzu;RpJ4u=b(%)$k-|M9-5-z<)>OaDD@qYaoMZF-_J?Cy;HQk z-BM4lj5}ql$$fYG6xDmG`R}FbBi>t=ujJwlONGZ@XBWl1h~UI4-*p_y$VvpNH&ZdP zruvXyy!lH6P%pCrfbi+{Z$X{j&*xdZ>l;w7_$t2Qjb9VpDE}l%9e+_+sQ@%nF}*V! zsB7^*M(?6GhFTv}Y>1DkSil9ssIF`D`+|^hD_-$6pt)Qb)g%hhm-fM1;9Fb#4FV~n z*d({IhZzCzmSTZG^c9@(3bj%eAX%z8Vivi4k#v15V*4V5NO%@O>dc5)t0kV2vvtds zus;GaCdV+zX{m+|+&#G1q>qs`xgnLCvv{9bAf@CH_-6UlS8&Xq7XUoZ5*+tC2_&73 z_+I^>>^#WMgQke$u)*`{jQaUD_Y;E!O zJ@*^K&O}IcVpDyZy`hWf#1a5}R1+BbDv&fgaU(0LobPz{Prc6%2FmU!Y~i2ga`maB zl&uAHy8TlWGRp-8X?p{Z!=-(L0P>{riY=>-G;PF(3Umw_h8@gh*6%l%Hs^a@>>yU@Uo0l&McRHpt#CWN_CP9yJ1x1bS&`7 ze5w9nNW>A+_!=Xj=vpZ)O!hNi(z+v!HyNDG5ZU=;m&IInHX$Ut>i<#AqlHKtspqQ{Kf~BS@MRfrTV?Vl=7K4bF~D%@-gBm zDabyp*a|q&&v_ZAXXFjGDgQRv%CMhm8B?9nS{B=J`U>7smqE`|uOu<(nrumU@DJYe zh(529&Sk(GIuW#N4<*Ot^b@m9t#mAP8GOw3sy&npY5h-mpGD3rFou3czscg?79J+E ziuND7UYR}B{sy0PmrHBcF<>(6kp<3RNWi&Y&H_0LfQ-lj4MI#GgV45)9%;ZbLoNy@=;6Vr&3uFXA8IL#urRe>-D)os8{9 znk`{$CBh)m9>m{4=tTMg;zyS;)`RpA;`{Hwe<2_pM7;k4;Da=~ld+R`!G1_PU5q`8 z(2I0G;=bjuPXu%j-@5`fLAjS=gbPS(D;e8?PzIP@#0OV_9>F7Cv>G-*+Ko7Z;6}O! z@yWZ|>um=s_Cab7NmY*o`#4X~*6`=tUaeJ7d>X!Cpw?8(^#op&w~{ z7mIxw;S|#NRup>`A&xY@pTw?Ohc+d6#19~xBY4Cygh8a+5${15LK^RdvL7KNkjAr2 zY|eVbNaH&X>>$Dj(s*~04I(gnKN|1Nvb+swJEZY0DO-h5f;67vW^D*%NaGn_b`(KF z8qYbi^9T;4@eC}x5y6Qxo{wZc1Q*hHMwER4!HqPYA7rm0=t$$)Np{r(KtmeOkFqL+ zTBPx8A=`%FMHk^D zdo2%TseDcAgDrvj)&{?55l^T! zf`68KC=iN7eNF59&8_rb3@rp(*%EE`hj0V63SaK`H>~5|=nu2sl57t|{h`MzTiODl z)|O^`;r$_BD8T<#CrFrU@Tf&4{j0;8)=+sv13oSuzVvVMo7*Xuem7eH|K$ep5ZcqF zr2lZj+?1t!dOqeP)CHfju_seqH61;dGc2&`?pSk^hW}`xe~(zbV98=9{u-bKy&eO? z>IDzhtXbq*pou>bX~Mr@tzPiBKfK`X4;IZ>z2qO{I9?YU$}X3+mZ$N$BUN07JoSMkeM4uY1*ntC>oBeZQ0T)sm;9z zwPkZT9x(a;$OIyf%REX#{zs$W;&1ST0&VyQmaYDI_ZE0(L#2;FqMFZva^%z-JFWBO13i}smw;Oa;-99##Rkx?fwCZ+4IiRn)UD*v8 zqZM+AoCR_g;1+1dUIU49eS>`^hXxLvJ5+c$et6(8J96qs{K&|W{-dXkUO3u!tp8Zz zSnu(^<3q=HpXfa?c!KpX)&#ts-rc?DdOM%%d2Zmj_C1|@;(KCy+xMQ@8{8M$*T1iE ze{g@_e(!`amVqp6WR$d=>;D|CB0?6h0m2d$MzKNDcPg#8QH`37Va(EdtvX$Ube4r zU&+42z6<+C_Obni`-k=?_FvdPvY#CoJTP?N!U1-$@ZhR{5vRrCN03HINArRRBqGv$-#_CcLF#8pa)Z6=*>XcdRIc- zUlz^OR6O0e@ZyS7H4x%Epr=G5^;&FngiytNic!UHlwdH-SW#||BNk6$(TThlt z6?S4*dq5g?B-TOnW>SKFmrTji9^{tZJ*V?uYJtFL;~vU@_LQ_i(SVH;`EnYHbKj->xuQg4t+=3{%1KE>2reSLw-^ z6rVr@9Sh-E(v!?2U9u$^PKWK}%+j8ekc4IpWeiE_)=Ax#cIebe-R3!R8+Yny-Hd|w z_kH(0`Ps;ZB;a&+?Q`yv?)~ol{@?F@_rCXJ_x%T?EJ>0~D8s{&bR3`bSH{ya|&+>mjjRa%V}RkY5q;*-iIu3PzgrX*d*)satWSB6jy z+B2oHX*`I=(E$DwA08ifkUX9YX#s&ZWk@bk>e#=g45=SU^-KU?toU0L zz`y@jxDa0?>lperP+c6V@hRZ7k6@cnNZ_?7hQBhHf3fH$efu>4nox+@N)*FinIv^A z4vLN^NG9;eH1`=g;Vb%;Ee?f4)%eajfo_=Y-=^#5uWLld8sZPS;(m`^(r@MHmZ{nY z)xbIW>uWZ{BObjGmlL<(vV^|93D4+jg$4RPPv3qu9hbko9hbh@xRl?9OCzR3->W&e z{0n{SfaCWqq<()#!=5Icdy4~0kt`1;j);jKO>Tdsq_D$%Zm`D zZ`NmVk#cc)fX03U_?Xkb_=`8*U(qgGVsbL>PFBRd=E{JrNwTUYs3m&ZQaeL^JBz-V z&d5o!S^U=zes3b7fbZ%4`5D&EUFtt#UPnu*A}Jqx0UD9Ey(VS9{0IT|c0^2$j>NR% zRGA1P@J0JAaoNlqT4L^@xYru<4#s6`RLzLt+BzsHw}bh(cW7T`TL!*GPiDlp9zB&2 z^A06`fZ^lu&G^mHRCQ8F9b8T9{w8WS%GVCQbOds^D*L}LBt5J!rIl&oBb ztF?J<_RBJyM41UySu4~nP&|CF)~;?8-}=Z#@mWMU<{hBn&E??H@%o=4mNxG&Mh{1a zrax@Se%U=7J!y}*`x7&=U-k}1Pc4ag`(cBAk9w0pr4NhA=EO1dx9)v~$a<}n>N_9; zvMlIAc_1ba#@&NXcW!vDK{vVRn^UQNPxOt;gKUz)M7Qop)8px@*B+p<> zZ4PG9*5sH8PvCv>(D)h#y$ZMw$gLD{u}!uJVc>HXXP0st)sEd%soo*r*)Mm%sVvTu zk!fHjaT_Fs4tUO**((ryz{N{f7zsfCzLY}mO)0b-RGn^%vVhPZ%k-#+v3fxn*)I>o z-H18hht@N0>2MA};cksOP>5)iI6`=jnJd(Q-gAKP6Sn*Gma_|gAMgC)IJQXVT5KN* zjUM%XBAl{)hCmzv8u81UWZFq`1W-o3QZ40f6z@qf%BK*2J&-{FGZ{$6gf^3ipeHV) zH?kMUJ6dk;(CiLD5zT~C-jHGXPyk_*pxNenr z)q5E9uXyP|07KxSrNd53hev%?1R7YDmXQjT@(;Fam-FATydd(y-)MQsrGSS(ek0m0 zV$vb9TBYq#N5>a0CuBN9YHdRP5j{eQAY*a98o3Tq3Ae_~#zMsN2EvmMdH<`GepuoE?y={2>v1vVslW>a6#9i%fBne0cl05qZ zCQ4?Ou!<;|`Q(4H59<71CYgcEEU!(hPmsu?z9hVujXSN6wnk^x4$V_;hE<0vR7C`{zK1S1_KWDy zDZghsBM%T4o$|ZEPWd7}|5HP`P?-+B4oClNi_G8W9d7ep#B9rw2Q?2IeZ>+-a=ItyH z!NJVoolqhd4t)&CIxGeIs-sTGgaFEV%_(^^zUJH@m_@Qst9^L73u{>n3ITz zfk9%19Hl05A9#qKG{wLPq*

6rUmAn+JJv@rFLv$P9TAvP`uTo+PoWbeHP$<`=VdI@QTk(KlM@bhB$ z`4LubAFHM4yABe(Tj!&j#ztGanU5|VQ5PeUyPl!dM^JAk9ajW~i29G-F(~4kKIj|| z@}8qz3f6Pzy>Mi2yk{2Mr~@|AFy(#;nD#IxO*vcjUc)=;x^v-Gf zfi@#?C#so|TLNv=@rQcH!^C!CW}ur|Ul6U?$7azGu#g=Xp!V;Gc676bQT?jkjWNS_ zZ_!zwNh$j9ESBc9DJ~zzN^#2af5{=(N4WmHU(#4#M(w^RKc&Ny8LE`PSrs-`8HdP( zdMChz14*g{9WZ5eh@ed4`^~zK^}Vgl>Z`I>CJILUnQH7>;NRUp8&jFL8*?!`v~;}P zJ%}yiP-U%DD-F-GcyLf8n9h?$7B^# z2Z9nZTkK|HW2u}BPv6~| zB!h)$H@}W8*s}%cFAVr5TeTOqcO!I7*4Oz^qH*;c)1z3LKu|>?Ij3mgw9HZte6Ah?5n#B+izx)k!A)jn6N0fG2V6 zGN&!VrzX0Jc%VB0_8;U!!?R}d{2ZcntCehjTVxF?{ zux25{9@3+jA#KqWklG7Dh;a{U#C&U)dq+7EPqEf%ecys^0~-`%E;TwcDg^-AUh7V$ z_uWf&aQE`zQ4il?8g$A@}Z<0~;WFj0|!(eXab%?cB(E(*>% zNy{-anF{B;IP4sZSK!29fQA!58$~B%$=FI0sl+>o;cToV297K2L=#Jc@%(T>s{xe~ zw)$UbHV{E&THhxD0*4;;<2r;V9S&!*06}I+2lccQ9K>+m2`2F+?(MG(SV)hD-(*L_ zIz+iY;?fWz5&7y+^c12AIekn%52u43HA5n)H6x=0(vjVum7TsfMjn`4= z&*A^w-hP_aV|N$UV{cFN)LcyCa~^ebE?KE(loMUBfivD1-i0r5`GQ9b=0!W;BDR0~ z2C)qoTaXkkj=lJZ8Sa{N%ICB9R?_Xh52O9d8;JcCK9U1}wIUc9}>Z2d0 zHIEIl6Y3hh#1rqA=Z*1O^!+T~4KU3pO+eid8?W9c-=Kh%eati?+Cit0bexoh8xwVj zz{u(jxW&5r&wVuPcHVXIl46cqaO59im+n>jey z16!HnIT_JY(|AT<&|o6-!vq zqu$;_wzrJrI7TZmJ}imZj1@~Zurjg=#%qz9GZU+j3r%ajt#%sDCo2PZY{jZxCvcvT zEqIWC)*{N?R$E3Gz?4Un!3nt4qdxV^2^cUkgYUY022LEr$x_L**T&ey9QxOD4+$z~= zn$brGyy~k zZ_EYq(FZ$`-gL@u40pkg5=|nc&DfhWM<+sh9a^k^Sn&Viq zaiUtqSm?9?3dQ{=AU?x~eTe8oedl4$z;O;ESXN*Cg-&sEr`!dMuYuz0pztGn?*_#m zqyCdfr~FfEC!$`b{4>CQ4(k7k?-xM*7v|a<5#cb=yKulE_C4BbWk)x*om<8JH^lk3Jopg5Znt_z5 z9B#2q9^9EFV^fD^Mo%70t+#G-59N|sch0a$$_SjvOhn zmDcf0L<_pN2q&+=!##)-T7s_JvrPsntYYOENF71Yiz@kPe{8MQh6N9E5nDqV+|Sbz zed9M_Q`3z2(E6_=WNzQ%7?^!*8l8LX?a1Eq6;wqx9-D))+LZ3*8K&=1l}*fKuB70R z4kR1kV<3K0%xYi>f{d^UE&O_l1qKP7w85ytI2 z3+N!nj7c9jN2_?*dG-wm+Q8^JRI5*ldtZqnv}Hu_d;ldCP#-i&tE71PY*5>$E8t`R zNa1NK_|7nLJH!Yi17_N3!lykW+|&tfK8!z&orA1j(A3c$M5pg}GdjMh!otGh?i_^C>_C8!9A&sEp&i0Zu=5`4iRtT*zXH*p zeHTrYKDyHwD1alEsk3gJQ$w_i*VonZ8xb|4SVUc@Xj?%%>TW zvV*1tykBJ5(H)4Nv}n@ih!^BvzAjwMi{l8&lR3iXXdyJPiB`xbwJrq2?&}T!qdTx- z-O6~(0?*$Y@L2o4^no_hkO#}~7Mz%28TP0TiZ6~1efK8dt8{p2diZB__$SlDuhZf0 zan1*;j>i8R(dOCI{d-(<5%hM z()94p=b}G8t||Qh#hd>9Im=q#FbWA|a&R zd!_mb(KKSw(en=DN0bH771Ws?JwfeJFLE-fC7=jTp!a>zgu_>yi(E<-_*42i%G>-a z(AReDJRnV|A^H1}Zwvhz^yT0&>GZ{%*NBbkB@6;zD*4zX*49ydt_Tjz9G(cjSUy-? zF77vSm}A6WHXeQ8pOAk8{=0HxSI; z^C&eVRd~~?;MTbCC3R42X7p5T33o6nck}prs=n}LpS67Uda0+xg`akK6`>T*FeF+VXcTKX)@e4EaZ?%l() z2q3gf!QE;I?)s#9AD=uQcuEh?lW-Gqc%F%`X1>y61H<#Ie9hr&E??<(<@+Eq)pbe( zQyQ4kz?252G%%%sDGf|%U`hj18ko|+lm@0WFr|Sh4gCM90USGhus{8`vgnTWHWW`a z$~u8dhgnd~K{)}~2@NKCOkKxn04M*$)b>rEB+=t1^hhI>7S#8n974GtPwcKh`5Tn| zD0o~&I)(Obl;5Ddi!yUF1_48+l!c$wst?xt>hRlGi$eaIV8~ysIPw?Q)YYNAiralk zW2ma8vB5vOCD;&Ds6`)DRTB*RHrH{lRGYtHoTe(pAF3xVrv9!>1C{H`*GJy|!`_qL zjPj>n{msK~z4Wur3=F-eWTQ9i4}~|@_g*n$p0f8nCxWmqwNnn-cO>`%7$TVg694F*FWryD!ub zY}iWB^ndO(?iFj-uDhqIe9ih5E7!_Zm2&x-O8K4*=za-o-FsGBY;03ys>(n7(gHR~$ZY*=%@T(x%H zit?&;mE|&i=Wtwlo)sJJSzWcp?O9j3Vf_UCR;{bN#~|HUeD^js+w${m`S!e}(&k98 zuBOB`FATo)sKBA!P+!#847~^OP`%(W;Nt+7{LLH%GRP?QdvI^$&?i zqtmQ1E*Jg=CA345lz>0vw{52j+dpipiG*NjTa!Mo6=}Y*><#EO7req3~BHNqPD078yjp}e8D;l-5yl%+j+i_62$tp!{%#hstcl- z3HrmfMT=~{&5eM9HgsaEYxLFNJJ1<%rPvclrLf{_sPTnrY+^CB;rB}Q?*1C^kp^Cc zUoovR^qNDYBVnQ&@^6jQ`9d19ySIe=ewOAh@6w<^N1B02Q^X;q2GDKrA)f-Z!>1Z+ zB6WWFp{+4g;}4aL>I3aW8WyF7kh12n)82&vciA>$r7E%6Tjn927-@~C2{;ug5S|hC zHT&@+u{#cooH zgt?bu0>ADHZPQpDIMQGH5nz3o;tP=p=7nk2YyJj7?vQkO(X7!Rc^E`ZskoTRe#w_@ zVZXmVOq}9Jh7GQ1^KC)i3Mw;fwgm`I3N2_ms9#;MVVejn^L61yB5Pf6^L(4%7ebf` z*`Ofu#_GoUdiWa+^e=}3sssM&ZN%D^#*i%~jnO_^g5=0TP9Y)5I&S9wPM8g#oSpe0`R2i@`sXdk+Uv^RimU;^4b*N}D#=sq?9?T%|m`&rOE zJppZL`S^Z#r7>i@e&<1VU;^5>KT{eldSA(VpWur#>&?M4s0?nN$Z5r(ZlSum@XdXs+PNRKv5^0|X&2EjZ(GMo$ zy9&BP9}#WK6Owf{%4Ennmc|0mE&hmTmxJyGlua7_$&4)uXzoI3(`Zj-YA{+1T`_sK?*`3Ylpz!==62a6(zZScKS#L>r2}#gOk!*)2TczO`TwSJ?Gtr=2V(4` zxXSf9&}q?VcWAWRQ0F%yt}?B$=pG|F8g08Q9ST6R9A&LWdop9oM$l|R*`v`Om_)e`f#y+^)AYF#b9@qM zUjWTPl&fIA_l?5x-*D!E;zHrU+8lr1h(5r8O`y3GeCeSXM zM7f^>&2E$-lmnpcnMB$o`$zRBo;eY>^s8_OmH6PtP_(=J1Q(BN2xzK`egrd)OjR{l z$j^7Zc_3g~Rg9xYHVpLm2@b-i-JWMoQdJFKgdd=+qK6K2oQ5WWx52-io*M~-8n^3x z3{9d>Fbq&t!0&4UPg`+IUSkCGE&+iw%c>XeNAptUQ*_?P5C$a0|D_;J2Az20mMvkwl6ty=2O4-A1BUNt z4~L|51AO`eBWTmV;#mXH5pDWcmQQC$fBsc}v5L+Dj^Bppvm z0`S8$4gQ^iX;0ni&x)YmCH^H~qNA=OO=P3Z^d>1~#Sy)X9R|4>n0h7!bagdK`UDeC zyfE)69qO9X2eMom9Wk#3-johlaRL+iPNYvACEG;TrOpH4Hn!;xE05?=^yGdi#~!au zjMntZop>BSTO`;RQ`gB!l}g=u#DdkB$jqm)ZhRIB?W+)OjQvveG5sq2E9hBopCWn- zU&8oH+KuBNvINpgZ#=deLLlnEtwo&|eP+dJhh2qj*V0pfSF#k4V8& zsxZ#eOQ7j-i?Jy?X!EsZ^HwoGjCGx30+QV!L`n+1O+%L&Z>*C=t3*d0YpiRFV`|*^ zb)D6b=i-bwQ*+Wl$JnO(fS7~aiFp~fKF01weUSXREsX7YTRMHcPna%jijF~NAV2XO z87q@c`$~P>s5jl-I*u!a>H5~kjhZ*YaOwQgpw5x_lJaOVA5y+D2Dee|>2Mq1x_Z;l zFgWg5*;9PHzdk8qG;iLi&0ji z)Sx_q@_zqXfJgs3NaGE4y`4UrbE*VV1YJ0N&x`c%ffiYL^l;O*=Cf*~d1t8@G7 z8|nSHCh99UMC$z^Y}(i24J&_*o8PAjOYabG6%l`EhuqK{3^g{?<4v6Ve4!w}bRD9R zt8maL)0=jy8bd2;YVcABUIsMo?Txyd`aY$BYomb-iT<$$%C6D)={E=@$)2Wtx=E5& z1J>lrkXlEk{^;RTwUh>2%UkN}Y=X*D-T2wsWCSF3V z!*4m1&fnn=&tJZ5<_woF9QN05#*45(&=4-29|<*-gz-9By)V3|K3E-U3^#637U6xh z5?{D}adX~$yh+&*+~N-__Zg`HmCfc-LXohtreRB?hV72aU~}BT<1munHx4R0v^rWs z{x3y9#b4tI1)K5a?pA*|1vG-?7QCuVZz<5O|nJ&GsS-6`QP+;z9EH&jwqnEEoMfhi5J25^UcBfeDU z9nSk^-na6;m)Dh7?|9hpH;(;|#~cS8&p2)@h!n&M&KA5@@biMcf_Dlo7WfN8gyEjF1%;n0e7x1&JB7)@+#*lW>SFiOe_VQEX@AKrPN(w$=TDpo=YTWYHP>~gYqje^ z*JfAT^-r!BT%l5_Op@jTPg}uL1%E8Kq44d(tfGxYn~MTP4Mj@PLq)razEXr_PYR$< zQ?XKfpt!$ypxClBu(WPz+tS{p>QYn5rjnYHT_qPvdPE?rw1C_PsWSSS@Ck$^3N}SZuxQ2-!2rasdjsT z{aO1_`*Zda_62!&<=OL!VXY&1&*nXsXUm_PzaZb9e=z@0{^9&*^K%`uVYeq7)`FaZ z{RIaK%!QUhYhiBTp2D`m{e_PeN=2q3bCIRUTC@|g>?vw1+FvwOlq`~#n3kBAC`($F z>{`;cWdD+ZC4)mr#qy3RuCZdZBf>QYZ>2c$k%>RMK|Z1u9^EcNMSXO|T$C&|l}moGoc z(w|t4r?L-V`v4W(Ww+al?ME~n9JkNSBP|r<9n!RLG;cP3NrUuoSN;>w#NqrL2kF7) ZnCm#e+BoPq!v5l}E@+LaM6Jf>cBjq7cqbh|}UK!N{Z%xBh{i zIPx$054iM4^w2|pKsg~!Na>8d8#{hLB4DNU&d$#6?96<#Qz`|8@jXP^k*$B)scdR%tMygdZFCPbI#`oO zYPxaQ-0idx&J4=8_k-e+7bUIr+E#a1gR?~}4EEXPHhZR}8T&@h-r;A3$m-_4bAMOX zW{n%iT-uFef&zIF2dY!R@icHg16UN@GwMe~Uy=X?8VX`aU>Xyc#FU4Mldo?WQ8!pV zyTTS6e+`@y3~z90^r-pu6MkIQAW}h{UYtp7L7oGGk?_0Z3+Z*4naRmqZKxsnv8Z=C zSdwWhM6WwDpOeo)LoF$B^r^j4D2E9R42VU&z5DIU?6xxn%0&E-6EPN%{IF=~&0cdh zBbS~K@tgWT!65LVi1ewDD+o585pj?7Njc^hkvfgh_yPn?YEL7KeT~OS0yFq*ZV!>f ziSejxv@G+`{M<{usm-NI8te=33}5McZxYS;=K&{ge|iGP3R*F{8x(IbA5SsEzBvY})HV zCpZ6+0tX1;9=swq^U`SySI$ju^W%YWoQUzxJUxnc=jak6fpuI@7qafl3PLJS zqV(?f-`Z9ue5Kni$5AiD*m-i5ZiU`q{+037r`yw=54U@P?B+iK)*UE>x2N4x&%9pe fM=$QzE-G%6^06bn5^ni2>7EGJ?Ns)t3#k7AE#0W( diff --git a/cmake/mimalloc-config-version.cmake b/cmake/mimalloc-config-version.cmake deleted file mode 100644 index edffeea..0000000 --- a/cmake/mimalloc-config-version.cmake +++ /dev/null @@ -1,18 +0,0 @@ -set(mi_version_major 1) -set(mi_version_minor 6) -set(mi_version ${mi_version_major}.${mi_version_minor}) - -set(PACKAGE_VERSION ${mi_version}) -if(PACKAGE_FIND_VERSION_MAJOR) - if("${PACKAGE_FIND_VERSION_MAJOR}" EQUAL "${mi_version_major}") - if ("${PACKAGE_FIND_VERSION_MINOR}" EQUAL "${mi_version_minor}") - set(PACKAGE_VERSION_EXACT TRUE) - elseif("${PACKAGE_FIND_VERSION_MINOR}" LESS "${mi_version_minor}") - set(PACKAGE_VERSION_COMPATIBLE TRUE) - else() - set(PACKAGE_VERSION_UNSUITABLE TRUE) - endif() - else() - set(PACKAGE_VERSION_UNSUITABLE TRUE) - endif() -endif() diff --git a/cmake/mimalloc-config.cmake b/cmake/mimalloc-config.cmake deleted file mode 100644 index 12da076..0000000 --- a/cmake/mimalloc-config.cmake +++ /dev/null @@ -1,2 +0,0 @@ -include(${CMAKE_CURRENT_LIST_DIR}/mimalloc.cmake) -get_filename_component(MIMALLOC_TARGET_DIR "${CMAKE_CURRENT_LIST_DIR}" PATH) diff --git a/doc/bench-c5-18xlarge-2020-01-20-a.svg b/doc/bench-2020/bench-c5-18xlarge-2020-01-20-a.svg similarity index 99% rename from doc/bench-c5-18xlarge-2020-01-20-a.svg rename to doc/bench-2020/bench-c5-18xlarge-2020-01-20-a.svg index 0e55093..9005097 100644 --- a/doc/bench-c5-18xlarge-2020-01-20-a.svg +++ b/doc/bench-2020/bench-c5-18xlarge-2020-01-20-a.svg @@ -1,6 +1,7 @@ + diff --git a/doc/bench-c5-18xlarge-2020-01-20-b.svg b/doc/bench-2020/bench-c5-18xlarge-2020-01-20-b.svg similarity index 99% rename from doc/bench-c5-18xlarge-2020-01-20-b.svg rename to doc/bench-2020/bench-c5-18xlarge-2020-01-20-b.svg index 22bfa5c..2d853ed 100644 --- a/doc/bench-c5-18xlarge-2020-01-20-b.svg +++ b/doc/bench-2020/bench-c5-18xlarge-2020-01-20-b.svg @@ -1,6 +1,7 @@ + diff --git a/doc/bench-c5-18xlarge-2020-01-20-rss-a.svg b/doc/bench-2020/bench-c5-18xlarge-2020-01-20-rss-a.svg similarity index 99% rename from doc/bench-c5-18xlarge-2020-01-20-rss-a.svg rename to doc/bench-2020/bench-c5-18xlarge-2020-01-20-rss-a.svg index 6b15ebe..393bfad 100644 --- a/doc/bench-c5-18xlarge-2020-01-20-rss-a.svg +++ b/doc/bench-2020/bench-c5-18xlarge-2020-01-20-rss-a.svg @@ -1,6 +1,7 @@ + diff --git a/doc/bench-c5-18xlarge-2020-01-20-rss-b.svg b/doc/bench-2020/bench-c5-18xlarge-2020-01-20-rss-b.svg similarity index 99% rename from doc/bench-c5-18xlarge-2020-01-20-rss-b.svg rename to doc/bench-2020/bench-c5-18xlarge-2020-01-20-rss-b.svg index e3eb774..419dc25 100644 --- a/doc/bench-c5-18xlarge-2020-01-20-rss-b.svg +++ b/doc/bench-2020/bench-c5-18xlarge-2020-01-20-rss-b.svg @@ -1,6 +1,7 @@ + diff --git a/doc/bench-r5a-1.svg b/doc/bench-2020/bench-r5a-1.svg similarity index 99% rename from doc/bench-r5a-1.svg rename to doc/bench-2020/bench-r5a-1.svg index 127d6de..c296a04 100644 --- a/doc/bench-r5a-1.svg +++ b/doc/bench-2020/bench-r5a-1.svg @@ -1,6 +1,7 @@ + diff --git a/doc/bench-r5a-12xlarge-2020-01-16-a.svg b/doc/bench-2020/bench-r5a-12xlarge-2020-01-16-a.svg similarity index 99% rename from doc/bench-r5a-12xlarge-2020-01-16-a.svg rename to doc/bench-2020/bench-r5a-12xlarge-2020-01-16-a.svg index b110ff4..b8a2f20 100644 --- a/doc/bench-r5a-12xlarge-2020-01-16-a.svg +++ b/doc/bench-2020/bench-r5a-12xlarge-2020-01-16-a.svg @@ -1,6 +1,7 @@ + diff --git a/doc/bench-r5a-12xlarge-2020-01-16-b.svg b/doc/bench-2020/bench-r5a-12xlarge-2020-01-16-b.svg similarity index 99% rename from doc/bench-r5a-12xlarge-2020-01-16-b.svg rename to doc/bench-2020/bench-r5a-12xlarge-2020-01-16-b.svg index f7a3287..4a7e21e 100644 --- a/doc/bench-r5a-12xlarge-2020-01-16-b.svg +++ b/doc/bench-2020/bench-r5a-12xlarge-2020-01-16-b.svg @@ -1,6 +1,7 @@ + diff --git a/doc/bench-r5a-2.svg b/doc/bench-2020/bench-r5a-2.svg similarity index 99% rename from doc/bench-r5a-2.svg rename to doc/bench-2020/bench-r5a-2.svg index 8b7b2da..917ea57 100644 --- a/doc/bench-r5a-2.svg +++ b/doc/bench-2020/bench-r5a-2.svg @@ -1,6 +1,7 @@ + diff --git a/doc/bench-r5a-rss-1.svg b/doc/bench-2020/bench-r5a-rss-1.svg similarity index 99% rename from doc/bench-r5a-rss-1.svg rename to doc/bench-2020/bench-r5a-rss-1.svg index 1c7f856..375ebd2 100644 --- a/doc/bench-r5a-rss-1.svg +++ b/doc/bench-2020/bench-r5a-rss-1.svg @@ -1,6 +1,7 @@ + diff --git a/doc/bench-r5a-rss-2.svg b/doc/bench-2020/bench-r5a-rss-2.svg similarity index 99% rename from doc/bench-r5a-rss-2.svg rename to doc/bench-2020/bench-r5a-rss-2.svg index e819884..cb2bbc8 100644 --- a/doc/bench-r5a-rss-2.svg +++ b/doc/bench-2020/bench-r5a-rss-2.svg @@ -1,6 +1,7 @@ + diff --git a/doc/bench-spec-rss.svg b/doc/bench-2020/bench-spec-rss.svg similarity index 100% rename from doc/bench-spec-rss.svg rename to doc/bench-2020/bench-spec-rss.svg diff --git a/doc/bench-spec.svg b/doc/bench-2020/bench-spec.svg similarity index 100% rename from doc/bench-spec.svg rename to doc/bench-2020/bench-spec.svg diff --git a/doc/bench-z4-1.svg b/doc/bench-2020/bench-z4-1.svg similarity index 100% rename from doc/bench-z4-1.svg rename to doc/bench-2020/bench-z4-1.svg diff --git a/doc/bench-z4-2.svg b/doc/bench-2020/bench-z4-2.svg similarity index 100% rename from doc/bench-z4-2.svg rename to doc/bench-2020/bench-z4-2.svg diff --git a/doc/bench-z4-rss-1.svg b/doc/bench-2020/bench-z4-rss-1.svg similarity index 100% rename from doc/bench-z4-rss-1.svg rename to doc/bench-2020/bench-z4-rss-1.svg diff --git a/doc/bench-z4-rss-2.svg b/doc/bench-2020/bench-z4-rss-2.svg similarity index 100% rename from doc/bench-z4-rss-2.svg rename to doc/bench-2020/bench-z4-rss-2.svg diff --git a/doc/bench-2021/bench-amd5950x-2021-01-30-a.svg b/doc/bench-2021/bench-amd5950x-2021-01-30-a.svg new file mode 100644 index 0000000..86a97bf --- /dev/null +++ b/doc/bench-2021/bench-amd5950x-2021-01-30-a.svg @@ -0,0 +1,952 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/doc/bench-2021/bench-amd5950x-2021-01-30-b.svg b/doc/bench-2021/bench-amd5950x-2021-01-30-b.svg new file mode 100644 index 0000000..c748877 --- /dev/null +++ b/doc/bench-2021/bench-amd5950x-2021-01-30-b.svg @@ -0,0 +1,1255 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/doc/bench-2021/bench-c5-18xlarge-2021-01-30-a.svg b/doc/bench-2021/bench-c5-18xlarge-2021-01-30-a.svg new file mode 100644 index 0000000..bc91c21 --- /dev/null +++ b/doc/bench-2021/bench-c5-18xlarge-2021-01-30-a.svg @@ -0,0 +1,955 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/doc/bench-2021/bench-c5-18xlarge-2021-01-30-b.svg b/doc/bench-2021/bench-c5-18xlarge-2021-01-30-b.svg new file mode 100644 index 0000000..e8b04a0 --- /dev/null +++ b/doc/bench-2021/bench-c5-18xlarge-2021-01-30-b.svg @@ -0,0 +1,1269 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/doc/bench-2021/bench-c5-18xlarge-2021-01-30-rss-a.svg b/doc/bench-2021/bench-c5-18xlarge-2021-01-30-rss-a.svg new file mode 100644 index 0000000..6cd36aa --- /dev/null +++ b/doc/bench-2021/bench-c5-18xlarge-2021-01-30-rss-a.svg @@ -0,0 +1,836 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/doc/bench-2021/bench-c5-18xlarge-2021-01-30-rss-b.svg b/doc/bench-2021/bench-c5-18xlarge-2021-01-30-rss-b.svg new file mode 100644 index 0000000..c81072e --- /dev/null +++ b/doc/bench-2021/bench-c5-18xlarge-2021-01-30-rss-b.svg @@ -0,0 +1,1131 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/doc/bench-2021/bench-macmini-2021-01-30.svg b/doc/bench-2021/bench-macmini-2021-01-30.svg new file mode 100644 index 0000000..ece6418 --- /dev/null +++ b/doc/bench-2021/bench-macmini-2021-01-30.svg @@ -0,0 +1,766 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + \ No newline at end of file diff --git a/doc/doxyfile b/doc/doxyfile index 6c1e30a..55cae8b 100644 --- a/doc/doxyfile +++ b/doc/doxyfile @@ -1,4 +1,4 @@ -# Doxyfile 1.8.15 +# Doxyfile 1.9.1 # This file describes the settings to be used by the documentation system # doxygen (www.doxygen.org) for a project. @@ -38,7 +38,7 @@ PROJECT_NAME = mi-malloc # could be handy for archiving the generated documentation or if some version # control system is used. -PROJECT_NUMBER = 1.6 +PROJECT_NUMBER = 1.8/2.1 # Using the PROJECT_BRIEF tag one can provide an optional one line description # for a project that appears at the top of each page and should give viewer a @@ -197,6 +197,16 @@ SHORT_NAMES = NO JAVADOC_AUTOBRIEF = YES +# If the JAVADOC_BANNER tag is set to YES then doxygen will interpret a line +# such as +# /*************** +# as being the beginning of a Javadoc-style comment "banner". If set to NO, the +# Javadoc-style will behave just like regular comments and it will not be +# interpreted by doxygen. +# The default value is: NO. + +JAVADOC_BANNER = NO + # If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first # line (until the first dot) of a Qt-style comment as the brief description. If # set to NO, the Qt-style will behave just like regular Qt-style comments (thus @@ -217,6 +227,14 @@ QT_AUTOBRIEF = NO MULTILINE_CPP_IS_BRIEF = NO +# By default Python docstrings are displayed as preformatted text and doxygen's +# special commands cannot be used. By setting PYTHON_DOCSTRING to NO the +# doxygen's special commands can be used and the contents of the docstring +# documentation blocks is shown as doxygen documentation. +# The default value is: YES. + +PYTHON_DOCSTRING = YES + # If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the # documentation from any documented member that it re-implements. # The default value is: YES. @@ -253,12 +271,6 @@ TAB_SIZE = 2 ALIASES = -# This tag can be used to specify a number of word-keyword mappings (TCL only). -# A mapping has the form "name=value". For example adding "class=itcl::class" -# will allow you to use the command class in the itcl::class meaning. - -TCL_SUBST = - # Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources # only. Doxygen will then generate output that is more tailored for C. For # instance, some of the names that are used will be different. The list of all @@ -299,19 +311,22 @@ OPTIMIZE_OUTPUT_SLICE = NO # parses. With this tag you can assign which parser to use for a given # extension. Doxygen has a built-in mapping, but you can override or extend it # using this tag. The format is ext=language, where ext is a file extension, and -# language is one of the parsers supported by doxygen: IDL, Java, Javascript, -# Csharp (C#), C, C++, D, PHP, md (Markdown), Objective-C, Python, Slice, +# language is one of the parsers supported by doxygen: IDL, Java, JavaScript, +# Csharp (C#), C, C++, D, PHP, md (Markdown), Objective-C, Python, Slice, VHDL, # Fortran (fixed format Fortran: FortranFixed, free formatted Fortran: # FortranFree, unknown formatted Fortran: Fortran. In the later case the parser # tries to guess whether the code is fixed or free formatted code, this is the -# default for Fortran type files), VHDL, tcl. For instance to make doxygen treat -# .inc files as Fortran files (default is PHP), and .f files as C (default is -# Fortran), use: inc=Fortran f=C. +# default for Fortran type files). For instance to make doxygen treat .inc files +# as Fortran files (default is PHP), and .f files as C (default is Fortran), +# use: inc=Fortran f=C. # # Note: For files without extension you can use no_extension as a placeholder. # # Note that for custom extensions you also need to set FILE_PATTERNS otherwise -# the files are not read by doxygen. +# the files are not read by doxygen. When specifying no_extension you should add +# * to the FILE_PATTERNS. +# +# Note see also the list of default file extension mappings. EXTENSION_MAPPING = @@ -329,7 +344,7 @@ MARKDOWN_SUPPORT = YES # to that level are automatically included in the table of contents, even if # they do not have an id attribute. # Note: This feature currently applies only to Markdown headings. -# Minimum value: 0, maximum value: 99, default value: 0. +# Minimum value: 0, maximum value: 99, default value: 5. # This tag requires that the tag MARKDOWN_SUPPORT is set to YES. TOC_INCLUDE_HEADINGS = 0 @@ -445,6 +460,19 @@ TYPEDEF_HIDES_STRUCT = YES LOOKUP_CACHE_SIZE = 0 +# The NUM_PROC_THREADS specifies the number threads doxygen is allowed to use +# during processing. When set to 0 doxygen will based this on the number of +# cores available in the system. You can set it explicitly to a value larger +# than 0 to get more control over the balance between CPU load and processing +# speed. At this moment only the input processing can be done using multiple +# threads. Since this is still an experimental feature the default is set to 1, +# which efficively disables parallel processing. Please report any issues you +# encounter. Generating dot graphs in parallel is controlled by the +# DOT_NUM_THREADS setting. +# Minimum value: 0, maximum value: 32, default value: 1. + +NUM_PROC_THREADS = 1 + #--------------------------------------------------------------------------- # Build related configuration options #--------------------------------------------------------------------------- @@ -465,6 +493,12 @@ EXTRACT_ALL = YES EXTRACT_PRIVATE = NO +# If the EXTRACT_PRIV_VIRTUAL tag is set to YES, documented private virtual +# methods of a class will be included in the documentation. +# The default value is: NO. + +EXTRACT_PRIV_VIRTUAL = NO + # If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal # scope will be included in the documentation. # The default value is: NO. @@ -502,6 +536,13 @@ EXTRACT_LOCAL_METHODS = NO EXTRACT_ANON_NSPACES = NO +# If this flag is set to YES, the name of an unnamed parameter in a declaration +# will be determined by the corresponding definition. By default unnamed +# parameters remain unnamed in the output. +# The default value is: YES. + +RESOLVE_UNNAMED_PARAMS = YES + # If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all # undocumented members inside documented classes or files. If set to NO these # members will be included in the various overviews, but no documentation @@ -519,8 +560,8 @@ HIDE_UNDOC_MEMBERS = NO HIDE_UNDOC_CLASSES = NO # If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend -# (class|struct|union) declarations. If set to NO, these declarations will be -# included in the documentation. +# declarations. If set to NO, these declarations will be included in the +# documentation. # The default value is: NO. HIDE_FRIEND_COMPOUNDS = NO @@ -539,11 +580,18 @@ HIDE_IN_BODY_DOCS = NO INTERNAL_DOCS = NO -# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file -# names in lower-case letters. If set to YES, upper-case letters are also -# allowed. This is useful if you have classes or files whose names only differ -# in case and if your file system supports case sensitive file names. Windows -# and Mac users are advised to set this option to NO. +# With the correct setting of option CASE_SENSE_NAMES doxygen will better be +# able to match the capabilities of the underlying filesystem. In case the +# filesystem is case sensitive (i.e. it supports files in the same directory +# whose names only differ in casing), the option must be set to YES to properly +# deal with such files in case they appear in the input. For filesystems that +# are not case sensitive the option should be be set to NO to properly deal with +# output files written for symbols that only differ in casing, such as for two +# classes, one named CLASS and the other named Class, and to also support +# references to files without having to specify the exact matching casing. On +# Windows (including Cygwin) and MacOS, users should typically set this option +# to NO, whereas on Linux or other Unix flavors it should typically be set to +# YES. # The default value is: system dependent. CASE_SENSE_NAMES = NO @@ -782,7 +830,10 @@ WARN_IF_DOC_ERROR = YES WARN_NO_PARAMDOC = NO # If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when -# a warning is encountered. +# a warning is encountered. If the WARN_AS_ERROR tag is set to FAIL_ON_WARNINGS +# then doxygen will continue running as if WARN_AS_ERROR tag is set to NO, but +# at the end of the doxygen process doxygen will return with a non-zero status. +# Possible values are: NO, YES and FAIL_ON_WARNINGS. # The default value is: NO. WARN_AS_ERROR = NO @@ -818,8 +869,8 @@ INPUT = mimalloc-doc.h # This tag can be used to specify the character encoding of the source files # that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses # libiconv (or the iconv built into libc) for the transcoding. See the libiconv -# documentation (see: https://www.gnu.org/software/libiconv/) for the list of -# possible encodings. +# documentation (see: +# https://www.gnu.org/software/libiconv/) for the list of possible encodings. # The default value is: UTF-8. INPUT_ENCODING = UTF-8 @@ -832,11 +883,15 @@ INPUT_ENCODING = UTF-8 # need to set EXTENSION_MAPPING for the extension otherwise the files are not # read by doxygen. # +# Note the list of default checked file patterns might differ from the list of +# default file extension mappings. +# # If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp, # *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h, # *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc, -# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f95, *.f03, *.f08, -# *.f, *.for, *.tcl, *.vhd, *.vhdl, *.ucf, *.qsf and *.ice. +# *.m, *.markdown, *.md, *.mm, *.dox (to be provided as doxygen C comment), +# *.py, *.pyw, *.f90, *.f95, *.f03, *.f08, *.f18, *.f, *.for, *.vhd, *.vhdl, +# *.ucf, *.qsf and *.ice. FILE_PATTERNS = *.c \ *.cc \ @@ -1094,16 +1149,22 @@ USE_HTAGS = NO VERBATIM_HEADERS = YES # If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the -# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the -# cost of reduced performance. This can be particularly helpful with template -# rich C++ code for which doxygen's built-in parser lacks the necessary type -# information. +# clang parser (see: +# http://clang.llvm.org/) for more accurate parsing at the cost of reduced +# performance. This can be particularly helpful with template rich C++ code for +# which doxygen's built-in parser lacks the necessary type information. # Note: The availability of this option depends on whether or not doxygen was # generated with the -Duse_libclang=ON option for CMake. # The default value is: NO. CLANG_ASSISTED_PARSING = NO +# If clang assisted parsing is enabled and the CLANG_ADD_INC_PATHS tag is set to +# YES then doxygen will add the directory of each input to the include path. +# The default value is: YES. + +CLANG_ADD_INC_PATHS = YES + # If clang assisted parsing is enabled you can provide the compiler with command # line options that you would normally use when invoking the compiler. Note that # the include paths will already be set by doxygen for the files and directories @@ -1113,10 +1174,13 @@ CLANG_ASSISTED_PARSING = NO CLANG_OPTIONS = # If clang assisted parsing is enabled you can provide the clang parser with the -# path to the compilation database (see: -# http://clang.llvm.org/docs/HowToSetupToolingForLLVM.html) used when the files -# were built. This is equivalent to specifying the "-p" option to a clang tool, -# such as clang-check. These options will then be passed to the parser. +# path to the directory containing a file called compile_commands.json. This +# file is the compilation database (see: +# http://clang.llvm.org/docs/HowToSetupToolingForLLVM.html) containing the +# options used when the source files were built. This is equivalent to +# specifying the -p option to a clang tool, such as clang-check. These options +# will then be passed to the parser. Any options specified with CLANG_OPTIONS +# will be added as well. # Note: The availability of this option depends on whether or not doxygen was # generated with the -Duse_libclang=ON option for CMake. @@ -1133,13 +1197,6 @@ CLANG_DATABASE_PATH = ALPHABETICAL_INDEX = YES -# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in -# which the alphabetical index list will be split. -# Minimum value: 1, maximum value: 20, default value: 5. -# This tag requires that the tag ALPHABETICAL_INDEX is set to YES. - -COLS_IN_ALPHA_INDEX = 5 - # In case all classes in a project start with a common prefix, all classes will # be put under the same header in the alphabetical index. The IGNORE_PREFIX tag # can be used to specify a prefix (or a list of prefixes) that should be ignored @@ -1278,9 +1335,9 @@ HTML_TIMESTAMP = NO # If the HTML_DYNAMIC_MENUS tag is set to YES then the generated HTML # documentation will contain a main index with vertical navigation menus that -# are dynamically created via Javascript. If disabled, the navigation index will +# are dynamically created via JavaScript. If disabled, the navigation index will # consists of multiple levels of tabs that are statically embedded in every HTML -# page. Disable this option to support browsers that do not have Javascript, +# page. Disable this option to support browsers that do not have JavaScript, # like the Qt help browser. # The default value is: YES. # This tag requires that the tag GENERATE_HTML is set to YES. @@ -1310,10 +1367,11 @@ HTML_INDEX_NUM_ENTRIES = 100 # If the GENERATE_DOCSET tag is set to YES, additional index files will be # generated that can be used as input for Apple's Xcode 3 integrated development -# environment (see: https://developer.apple.com/xcode/), introduced with OSX -# 10.5 (Leopard). To create a documentation set, doxygen will generate a -# Makefile in the HTML output directory. Running make will produce the docset in -# that directory and running make install will install the docset in +# environment (see: +# https://developer.apple.com/xcode/), introduced with OSX 10.5 (Leopard). To +# create a documentation set, doxygen will generate a Makefile in the HTML +# output directory. Running make will produce the docset in that directory and +# running make install will install the docset in # ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at # startup. See https://developer.apple.com/library/archive/featuredarticles/Doxy # genXcode/_index.html for more information. @@ -1355,8 +1413,8 @@ DOCSET_PUBLISHER_NAME = Publisher # If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three # additional HTML index files: index.hhp, index.hhc, and index.hhk. The # index.hhp is a project file that can be read by Microsoft's HTML Help Workshop -# (see: https://www.microsoft.com/en-us/download/details.aspx?id=21138) on -# Windows. +# (see: +# https://www.microsoft.com/en-us/download/details.aspx?id=21138) on Windows. # # The HTML Help Workshop contains a compiler that can convert all HTML output # generated by doxygen into a single compiled HTML file (.chm). Compiled HTML @@ -1386,7 +1444,7 @@ CHM_FILE = HHC_LOCATION = # The GENERATE_CHI flag controls if a separate .chi index file is generated -# (YES) or that it should be included in the master .chm file (NO). +# (YES) or that it should be included in the main .chm file (NO). # The default value is: NO. # This tag requires that the tag GENERATE_HTMLHELP is set to YES. @@ -1431,7 +1489,8 @@ QCH_FILE = # The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help # Project output. For more information please see Qt Help Project / Namespace -# (see: http://doc.qt.io/archives/qt-4.8/qthelpproject.html#namespace). +# (see: +# https://doc.qt.io/archives/qt-4.8/qthelpproject.html#namespace). # The default value is: org.doxygen.Project. # This tag requires that the tag GENERATE_QHP is set to YES. @@ -1439,8 +1498,8 @@ QHP_NAMESPACE = org.doxygen.Project # The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt # Help Project output. For more information please see Qt Help Project / Virtual -# Folders (see: http://doc.qt.io/archives/qt-4.8/qthelpproject.html#virtual- -# folders). +# Folders (see: +# https://doc.qt.io/archives/qt-4.8/qthelpproject.html#virtual-folders). # The default value is: doc. # This tag requires that the tag GENERATE_QHP is set to YES. @@ -1448,30 +1507,30 @@ QHP_VIRTUAL_FOLDER = doc # If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom # filter to add. For more information please see Qt Help Project / Custom -# Filters (see: http://doc.qt.io/archives/qt-4.8/qthelpproject.html#custom- -# filters). +# Filters (see: +# https://doc.qt.io/archives/qt-4.8/qthelpproject.html#custom-filters). # This tag requires that the tag GENERATE_QHP is set to YES. QHP_CUST_FILTER_NAME = # The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the # custom filter to add. For more information please see Qt Help Project / Custom -# Filters (see: http://doc.qt.io/archives/qt-4.8/qthelpproject.html#custom- -# filters). +# Filters (see: +# https://doc.qt.io/archives/qt-4.8/qthelpproject.html#custom-filters). # This tag requires that the tag GENERATE_QHP is set to YES. QHP_CUST_FILTER_ATTRS = # The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this # project's filter section matches. Qt Help Project / Filter Attributes (see: -# http://doc.qt.io/archives/qt-4.8/qthelpproject.html#filter-attributes). +# https://doc.qt.io/archives/qt-4.8/qthelpproject.html#filter-attributes). # This tag requires that the tag GENERATE_QHP is set to YES. QHP_SECT_FILTER_ATTRS = -# The QHG_LOCATION tag can be used to specify the location of Qt's -# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the -# generated .qhp file. +# The QHG_LOCATION tag can be used to specify the location (absolute path +# including file name) of Qt's qhelpgenerator. If non-empty doxygen will try to +# run qhelpgenerator on the generated .qhp file. # This tag requires that the tag GENERATE_QHP is set to YES. QHG_LOCATION = @@ -1548,6 +1607,17 @@ TREEVIEW_WIDTH = 180 EXT_LINKS_IN_WINDOW = NO +# If the HTML_FORMULA_FORMAT option is set to svg, doxygen will use the pdf2svg +# tool (see https://github.com/dawbarton/pdf2svg) or inkscape (see +# https://inkscape.org) to generate formulas as SVG images instead of PNGs for +# the HTML output. These images will generally look nicer at scaled resolutions. +# Possible values are: png (the default) and svg (looks nicer but requires the +# pdf2svg or inkscape tool). +# The default value is: png. +# This tag requires that the tag GENERATE_HTML is set to YES. + +HTML_FORMULA_FORMAT = png + # Use this tag to change the font size of LaTeX formulas included as images in # the HTML documentation. When you change the font size after a successful # doxygen run you need to manually remove any form_*.png images from the HTML @@ -1568,8 +1638,14 @@ FORMULA_FONTSIZE = 10 FORMULA_TRANSPARENT = YES +# The FORMULA_MACROFILE can contain LaTeX \newcommand and \renewcommand commands +# to create new LaTeX commands to be used in formulas as building blocks. See +# the section "Including formulas" for details. + +FORMULA_MACROFILE = + # Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see -# https://www.mathjax.org) which uses client side Javascript for the rendering +# https://www.mathjax.org) which uses client side JavaScript for the rendering # instead of using pre-rendered bitmaps. Use this if you do not have LaTeX # installed or if you want to formulas look prettier in the HTML output. When # enabled you may also need to install MathJax separately and configure the path @@ -1581,7 +1657,7 @@ USE_MATHJAX = NO # When MathJax is enabled you can set the default output format to be used for # the MathJax output. See the MathJax site (see: -# http://docs.mathjax.org/en/latest/output.html) for more details. +# http://docs.mathjax.org/en/v2.7-latest/output.html) for more details. # Possible values are: HTML-CSS (which is slower, but has the best # compatibility), NativeMML (i.e. MathML) and SVG. # The default value is: HTML-CSS. @@ -1597,7 +1673,7 @@ MATHJAX_FORMAT = HTML-CSS # Content Delivery Network so you can quickly see the result without installing # MathJax. However, it is strongly recommended to install a local copy of # MathJax from https://www.mathjax.org before deployment. -# The default value is: https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.5/. +# The default value is: https://cdn.jsdelivr.net/npm/mathjax@2. # This tag requires that the tag USE_MATHJAX is set to YES. MATHJAX_RELPATH = http://cdn.mathjax.org/mathjax/latest @@ -1611,7 +1687,8 @@ MATHJAX_EXTENSIONS = # The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces # of code that will be used on startup of the MathJax code. See the MathJax site -# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an +# (see: +# http://docs.mathjax.org/en/v2.7-latest/output.html) for more details. For an # example see the documentation. # This tag requires that the tag USE_MATHJAX is set to YES. @@ -1639,7 +1716,7 @@ MATHJAX_CODEFILE = SEARCHENGINE = YES # When the SERVER_BASED_SEARCH tag is enabled the search engine will be -# implemented using a web server instead of a web client using Javascript. There +# implemented using a web server instead of a web client using JavaScript. There # are two flavors of web server based searching depending on the EXTERNAL_SEARCH # setting. When disabled, doxygen will generate a PHP script for searching and # an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing @@ -1658,7 +1735,8 @@ SERVER_BASED_SEARCH = NO # # Doxygen ships with an example indexer (doxyindexer) and search engine # (doxysearch.cgi) which are based on the open source search engine library -# Xapian (see: https://xapian.org/). +# Xapian (see: +# https://xapian.org/). # # See the section "External Indexing and Searching" for details. # The default value is: NO. @@ -1671,8 +1749,9 @@ EXTERNAL_SEARCH = NO # # Doxygen ships with an example indexer (doxyindexer) and search engine # (doxysearch.cgi) which are based on the open source search engine library -# Xapian (see: https://xapian.org/). See the section "External Indexing and -# Searching" for details. +# Xapian (see: +# https://xapian.org/). See the section "External Indexing and Searching" for +# details. # This tag requires that the tag SEARCHENGINE is set to YES. SEARCHENGINE_URL = @@ -1743,10 +1822,11 @@ LATEX_CMD_NAME = latex MAKEINDEX_CMD_NAME = makeindex # The LATEX_MAKEINDEX_CMD tag can be used to specify the command name to -# generate index for LaTeX. +# generate index for LaTeX. In case there is no backslash (\) as first character +# it will be automatically added in the LaTeX code. # Note: This tag is used in the generated output file (.tex). # See also: MAKEINDEX_CMD_NAME for the part in the Makefile / make.bat. -# The default value is: \makeindex. +# The default value is: makeindex. # This tag requires that the tag GENERATE_LATEX is set to YES. LATEX_MAKEINDEX_CMD = \makeindex @@ -1835,9 +1915,11 @@ LATEX_EXTRA_FILES = PDF_HYPERLINKS = YES -# If the USE_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate -# the PDF file directly from the LaTeX files. Set this option to YES, to get a -# higher quality PDF documentation. +# If the USE_PDFLATEX tag is set to YES, doxygen will use the engine as +# specified with LATEX_CMD_NAME to generate the PDF file directly from the LaTeX +# files. Set this option to YES, to get a higher quality PDF documentation. +# +# See also section LATEX_CMD_NAME for selecting the engine. # The default value is: YES. # This tag requires that the tag GENERATE_LATEX is set to YES. @@ -2076,6 +2158,10 @@ DOCBOOK_PROGRAMLISTING = NO GENERATE_AUTOGEN_DEF = NO +#--------------------------------------------------------------------------- +# Configuration options related to Sqlite3 output +#--------------------------------------------------------------------------- + #--------------------------------------------------------------------------- # Configuration options related to the Perl module output #--------------------------------------------------------------------------- @@ -2238,12 +2324,6 @@ EXTERNAL_GROUPS = YES EXTERNAL_PAGES = YES -# The PERL_PATH should be the absolute path and name of the perl script -# interpreter (i.e. the result of 'which perl'). -# The default file (with absolute path) is: /usr/bin/perl. - -PERL_PATH = /usr/bin/perl - #--------------------------------------------------------------------------- # Configuration options related to the dot tool #--------------------------------------------------------------------------- @@ -2257,15 +2337,6 @@ PERL_PATH = /usr/bin/perl CLASS_DIAGRAMS = YES -# You can define message sequence charts within doxygen comments using the \msc -# command. Doxygen will then run the mscgen tool (see: -# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the -# documentation. The MSCGEN_PATH tag allows you to specify the directory where -# the mscgen tool resides. If left empty the tool is assumed to be found in the -# default search path. - -MSCGEN_PATH = - # You can include diagrams made with dia in doxygen documentation. Doxygen will # then run dia to produce the diagram and insert it in the documentation. The # DIA_PATH tag allows you to specify the directory where the dia binary resides. @@ -2363,10 +2434,32 @@ UML_LOOK = NO # but if the number exceeds 15, the total amount of fields shown is limited to # 10. # Minimum value: 0, maximum value: 100, default value: 10. -# This tag requires that the tag HAVE_DOT is set to YES. +# This tag requires that the tag UML_LOOK is set to YES. UML_LIMIT_NUM_FIELDS = 10 +# If the DOT_UML_DETAILS tag is set to NO, doxygen will show attributes and +# methods without types and arguments in the UML graphs. If the DOT_UML_DETAILS +# tag is set to YES, doxygen will add type and arguments for attributes and +# methods in the UML graphs. If the DOT_UML_DETAILS tag is set to NONE, doxygen +# will not generate fields with class member information in the UML graphs. The +# class diagrams will look similar to the default class diagrams but using UML +# notation for the relationships. +# Possible values are: NO, YES and NONE. +# The default value is: NO. +# This tag requires that the tag UML_LOOK is set to YES. + +DOT_UML_DETAILS = NO + +# The DOT_WRAP_THRESHOLD tag can be used to set the maximum number of characters +# to display on a single line. If the actual line length exceeds this threshold +# significantly it will wrapped across multiple lines. Some heuristics are apply +# to avoid ugly line breaks. +# Minimum value: 0, maximum value: 1000, default value: 17. +# This tag requires that the tag HAVE_DOT is set to YES. + +DOT_WRAP_THRESHOLD = 17 + # If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and # collaboration graphs will show the relations between templates and their # instances. @@ -2556,9 +2649,11 @@ DOT_MULTI_TARGETS = NO GENERATE_LEGEND = YES -# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate dot +# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate # files that are used to generate the various graphs. +# +# Note: This setting is not only used for dot files but also for msc and +# plantuml temporary files. # The default value is: YES. -# This tag requires that the tag HAVE_DOT is set to YES. DOT_CLEANUP = YES diff --git a/doc/ds-logo.jpg b/doc/ds-logo.jpg new file mode 100644 index 0000000000000000000000000000000000000000..c9abb1a91f16d1e0c9f1e0cb35b9110d97e10a64 GIT binary patch literal 181497 zcmbTd2|SeT_dk9kgd`bjWu8b3A&fPQ(#XyjTZ24Bm=ThwgwaAZwk(mcFJm7nV^5wI zSxUB{5{W{{7P61uHR^euKA->p_5Ce+&BV-gU-xy+b|&pFq<`EK(Qw9DAQ$N*wt zfgl#}58C_y=|k*n+qP|EV+U{S?CczzJGOIzA3h!)t{wb*yLa>R@$(A^?G+Y)i3#%a zi|iK>+qVx6hYJWx9FPz{uvZ)|&YXk=T*}G8xpVvWo#HTlnE3zo&*onc|MqQl+YQ)Q zBp_CP7B+sC%@+_HtdpH(>j(Pv!@|n84XkoI7dHzyAr#U5jVanHHv$jhfd-zn)s&n>$%9#t-xwwUdMMTA<4ob@)WRa?B>Kd9_ z`p3}*Ck%~@vDP-WcJ?Q6F0Nmo8rkym2!u{MPL|q`3Hmdx=T+lgZgR zxs<&8g2JLl<+O^*s_L5BXU|_WzHDl4Y3=H!_w>Gf_r7mv`16;M(Xp@N6La6^7Z!gk zEw8LHk3*!Z`x?^oj3eH6oa+E+kA`Pz2a zvDmDKPq`#jtY!tzTP9Of92|fcCfL4&12(-P|$KK zNhXt(WXYu=c-5@Drml9^_#7>cl`o}3x}i#Ebymxg-C63o_uZ19v-#*3KE78W`^s9zS%%B*-LakdRWiZx?)WnPJmma7S!glpyS)jRH5UF_>Kzr_D(Yb`39 zP`&i>8H%__C#QpQ$fJhk-Zt1tfdH3H=$T43u|0`_CeGzB_|pU!K@H#KHle6<7<8<< z+lh5aE%^HKCiKN_6B4tTeHl(1Y1)J&!1WcHff!d|H`KbM*uNuCLn0lU(Acjb;1=xf zV>hAgPr^1KUDS%;CiL>|vWq_a`{zw4)_L92)zagU!sxMOhhwN;A9-v-Hyw^`LK*ON z(kArTLC!q8S>X&=rF`Zl)E>hy*jlC+CnJdX9S9ZWg&`ffKB_mHcLUr3z9PB_Ef+a2 zA76m4%x*%>?VC`eZEIJjtFRJr2-blbd%g)tqBbExb7w9OPUaXtMGd$LP!00 z82mbHj35+qfpa$UWjD38=h?kbl8id$w6+yyuEZ{OFmAWc_RGF52k`GSH=%Sen~gJr z-;9lIgYDNMom88Y;8be{Kl-j?qc{u*bd_&CauZs&fzOgW;0t_zOW4C)m-8|j$+yZ0 zw#t1I8ZH2O#OiHAnZ%zm7WmYGS>9C45^srL7NmW<#ffT&--Jl{=ua~{l{C8>M)C$1 zzhB&ho)lkr&d{Bj-{`hFuIsl6ImtZYNo{Pp`B=MZx5W4|G^;(1S}t;5mk8usUnXwd zt2nb}6N*VjeJm(=B=|mD8<9zD|Ebz^ZKf4)-&FVnwvvyoG;Zs2^3j- z=(_1>(lcH017jAy%YG7X5^MFu) zJHi06wfK*^|1y2B^6lxr4SJs)@&6eElt}(}dkL`xk9f+38T?NFST)!Sxqo)KvHcmuTEgy$v+tUv-2BMDAbQW0127Zvw5L$yAA=VOPOe7XXL&iTk&>v zlxcB%|1s5n+^Y-BRm$|~-(^)~V&E;XSO8jEI{%OFGiD>c{t}jH__dzQ)hf+CVJZ;5 zg}u4X++Vl(oo1?oIYJ+c2EbQ$xB&7BlCJgyE$p5z8%!U1H47L?Vn1f>e%O+4mg1~OSw{qj%vEF=OwsKx*ICE>ZlqZ#Y+=({z^AZY$> z{$Pc_!de+KjDQt#swmwGyZCRYvjP(R=9U1}G?V{Z>H0%XTP_C{H)m6h7Sd#AD=!)Ha>JCc?k&f8?j;H(n|omzbH+mM}8|9 zqntBadEGkRWeaWax1Ng$d;TIZzQNB;Da<=X{pW?(hSK;@b4+*wt96U77drZSEm;w` zA4|l~E17`)@?Y*$nL<%Pu2}l%jsjjL_OITUtgGQ~($#nn50ownS$WHQ>P{7yz2dPv*um-nM|DOpSxD}8X%>D~TbBQ~?o;DKFX&5VJvdC`NwJ63E zQ?LZ@b;Qs@+%9qmn~d}llkTX_+|)j@H}+=ttcc$llU4NA1HR$K_*7T{Uwp73^Ju4g z|A<96Qs+hRt%mhQ;#@AUIT!tZ$)VX&UtESP7}X5EaQ>GyV!(p_VYSrSvvLwOTYm87 z4%jp2Ehq$=Oy&EV>v~qeRxsM_HGnW||7}dz>~DWmB7~x?!4@WH|Eov}b3Omw7B`%@ zHH2wTzwH{+p1`es+TXb@w|~d{YeF&021wK|8&-WtRyo0x3b@Yi;_6>^|Cc$tAS18j z++!*~W5-wGFN?=F%tn39m>>CRP^SxJMwkW#|LsF2z4kc{G^n^muW<{Q)|+3phIkNv zUFV@I*0E;)i}AnBj<&Wy)-mVs_ym+r z>&u@ReGSX>rPYdi`MclLFg{J%+od1+lX58M^mLDMf}I{IWr9$3>mu5z{p^Fl#^*_Lf@p9xi;?(%(<_D}C9SuTaukpK^R0pBHS>3P{IE ztjPQFy$BJV8v^TXsxjIa%Mm{`tWtom_@SvLhcG5W$-WDrXN)mdxpA`IYypatJ)9IR zlET(+!d+=-VUdA|af8N%{I1OGPb#mRjkPNl3Vn^xf5m{`)f6cxm<;$F#J7N?R~E+c zuqRH!tU}h`8kQIL2zTY3&9du_xF+<1F*9j2QbsYCY&TXDQ`jbsTg8AsEvkB>5*&~J z{nw*-eD>%4-`{q{$Op@sRZ|*;`GpgoB%}y;QSu&)Mua{KU4X$jGxLYR^0*ZVYSPC3 z2R*8}9uhYU!fZGXc#GeXNJAfapor_o|9Q=qQp|^uW5UAw{4fO$-m(N@-#tL=YW(3- zn70LOxU^b%Q zf#c%LDjth*(L5F`+6CNR9hhA{lg{Pmhto_`-?ME(UI1K`-!>M!6Zr6%-rE*lk=K5= zJi8&QC^EZwsgrHl6TR=yPa|MjdBflCW8>sHB5L@9pkmV+2E2%AEPs0de(*PU@Wdil zZGZXM|KKA`_-BT*-hVOZcaKpm1C-={>#WR4qJx++{++N>|8WP;3aPCbIG+PUULkHJ z>^|#~WcBrxU(WoF;I%bE`uT4ky01(2{Win})4k;z8MD#A&*#UspoE}4I~r%sUZ>b) z0QlkiJoS%T(DSF!P?YAA$u}7WoGT=%bXeM+VCstPRE_WI4JUbd3t6~!wCoJJC$lB4 z?+9g}`rem^OWLYuSA4zSjT-KSw)@7W&Zl0`_@O#3THyU{N)daO&Ly2C8M~n4adAzk z=#uux=ZnyTPYZv1fj7~pV-(YFVS6i+Zch13+492m}g!qHqRzO=zP+d?nX8tPz-X+CLs_Whc0v% z(nc~_@C&W69xMot?9iPH3k86ICm~tn1;rBc-9q;n4j@zvJXmBs_cQLwiak6H7Q&;) zqw&IGv8cGKw4Yey0}27$&{;{VPCYL3DI+v=>JfbW{D$mh)LYcX#ezcsSBAMOpiRgy zo>6Pb;q`WPX_XvJN!hpxa(evzO!i!FS~BI7#{ry7_O%OPFwD`@Kt0E=lRW)%keo6T zXBF@sEKy5Dv3d~IO57Ld)1#hrm2M*Gy#%s>qc)WKp4@nZMcVHiDj)hCNuWIB{!)n&=T+>&1} zLkt=QVbHvK?C|Hux;ohFjLZBPl_l>Nohi1pn~=lN;}0 zY?5rKOg8B*w@h}ZmX|a`kC!o2db0Md86{&m|I4b_sKbnU@AXhCF`3M}nVo1zCO11t zRZoh8#LEi9;_=K0wq7iq8@+kzgN4{>v9KqLkXC&CK@S`h)Zk0dveU-Ou;M&}Csd5A zS>$`J-X&Jc2Aj-0UnnRezI6b9 zI51A}E%8EbRUdt*TH%vMde6x8iL;PecveBtE_tmK^GtS}?YLQP8zf2r<_QFX5LENL z3J8WlLlPj-Wd35LorP9Qtw6KGupTV9IFdmodvHd0k!|dekuEI?q>Fl4gw;b9(ax zq$`#$15P$RUL}vsR8Wu2#iXclW|s6R+1J$UG2r5ElAcjo?ZTi9pOIuRhODFznMO#N z6i9NS{dK0RyRws{r*_W(Z-bwpL9cxcWDWLOoe33y6)72KXOOr>jYuJgRvOd;n^8#3 z;m9DnM%s@nVTruzFsO~zi%Uj}WNxRQ$*9a2>00rc)Z6jB+|>WC!UvNdb2Mj;9zbH> z5zEa^;b8|=3|eFDVBfF@Zg{DNowR-vf^*Xt4VBXvPO;s~H{HEYV>tFWp(ZPyBS~Y* ze6lxGvQbLs7OW34M);y3DVU`U3#~|{FOdY5`vhO{Vw4U&Nv2*^ggL$Ny-?Rg^;@u+ zrye8s)e-Cybcz_ z!N9~w%WYn0u)NonEXO*Jb+Gk5^557gkKWO7ZC}UNfsA(`2z$!w;8lI|dYj1Yd+M6w zV-zN|XLw((`)@+mh^R8$y${P(#%rdmKL&h#ceQ-zNg!ez9jnh7q9TrjLr;IORjo|f z8`*!2EDgt?1*LX>nA+(?TEB6gb2;X8cls5{4za1ny!jjHjb#-0lj^S)mKhr%4fiex zsf|u}Iv^!gS`zXM_pyXmPUjUARxDx!}+$@a+R68aHCv8yIsqKtHMg?|RhNU{+D>q-!7;;gN zY1Ho26Z%GELMrEaP}{dJJr3~YHP~q53=&=Wzn)705@HlO3t$h(}#F;Qa+Q6Rt zdYN_%AZYyi>3s-ZwjIE*A%*kzt^!KyAWgU7SgRm{Ur%j97`@uGv$1cofW{s5N-Z2v zXKJ1@SrlcH`yO>36cq=y?57azNk6UG@+toz$UbF;7UkX4Kf@S!!iE^VS9 z7H6_!$^Ocb9c=SvE@(+h7V^(kTt5a-m}4}ugPxqp-X;pX-XGSJZwb+WN@Z%?uE34U zt}tlyAH*PHo#jU&70JTk(FW_|+DBF~LxPAzRsrxFNid8N+;g!|;;RR%rtXM}1|@zP ziwhO@=U(VDwKUwIyCeHdd!Y611p3K*5)?=dA!zv<9WSC|VVz_s9_eosVjeGtO%|T-H_K7FHn_cf|Q~I*unbS@D;!Lio zqRuqGWeI;zPr-v}I?V7iVWW{Zniwh=rH-Wa-QCgkuo;ZWa=988w+) z-~$S0xJ{_eYH;H#YBI%=jVQ`Cw3T z?k_;z0%aAGpP`f8#mqaU@I6DJ=U$Pgts3-A*EKz~Q|^zRZ}>5;`eh5OeP90VDXQ|_ z7&Y_My=Q8I9h~Z)oZ* zWJ%765j^*A^ZmfTE3{1#&2QZ%?j)Vq<7Jyx)psu(%Z*EwsmwI8?k0K6B(ZN-B7;mhVI;*{XG))RB?7g*@D*6Aw!W^^}(&`CZHo-Gf$; zK|=R)DY?KaUkoS3>NW?&<=>gQMGi-aM}gm&sp~11JrLOd|{snQKPmle$yNp}WJf!!kLkI`{|+ z9OU?2E^O`~IZ^AWMUBsSbpyXpQ25Xz>N|D&3nqP*uk<+QtRqY@7Tz*YE(KV*JTKsK+z47tZYHOqF|PzUa9(dmv5@oJtgKG472uG6 zWpXK?dQfXUm_VCC#?WfdDLO5MF7LhqB;ezT4Rdo|i^b;w_VqN;dyZHvJ_sg! zgU`+R>xoKlxNP7N7OPFGTRbw-1Mt4Wd`lKXk2Xm$uH69bwjmQ#4|>SpK;*c??%YLu z+tA~w8RhY{{|yst-&8g+j;X^JU)V{Pf-1$);==A|f1ZXV_6xP3E_)|A^Mb7OoK?#b zuM)3jJ8XM&3R+5u4P)kFl$gociB=2c$d^|GC|i)%skbv5uqsxPmuO}zz0b7El9lWw zFOta)ORyqA?6O_zI2+*O>qx9$BfIc9#xh96vmS3kID!f432LCgJ7%U0LYsNhCcL)Y zF*(XKMA2MIBea8HUn@q+)z{lWT=W+-99!}iuw?BTy-)AUJ~145CbByzodzWg>2sTQ zu(h!!#~bGX(u+H4Krn`{TZ39&LAm*>GuP2=Qff@B@9$D7Vl`}d+hhT%x-sFabd11Q z(_+4J#$W~&GQbaz$sX87z*{hSEL+Y1oA46+LyHWu6Rmwm80Z$c6vEeUeCyb5JN3Tn z*GV!(2bdA~Ujs4u-oa|6$_r?#Inao}(=9N~5bh`3d9rB8b7Btb;asoBO;1>1+V>uF zoRS$s7AyzSYql-tmp8vaY;( z)Z-hB8Zz|8r{2g&dJq`bXk@ocCOZM_GAr2hpDzRrnvlT(OC;b7GPh-uWLW4}yq_Kq znkT;Ne%EQ9eOa7#Iz@U~x*a8cHj8^EJw=wxByPO3RjV1+7<#QHKZ-J2Y&qrF=67&q zAZ=s9@f%)5)7z8qaeqy1t6os`+VDg5kymPtWKTcy5-GV91KA_I6dVq*13{ax6uQfc z!v!FQ(1%5`?^)#;HX0UG*a|D{iq5s4KyxD|WLJzt9=av96b|pDuLa{@9xz7pDWppl z^TD&b?-6RyuWjwe+XPSA;4Wl$w(f0IJQ$lrRg@tH#7ObYGCyFCPWuwyRazoLaE)N| z+M7M5@;DDxxW_i`8Fd|bMdT~(!uMO6`mHXO^>sIJ3|!1m9_=JUEZuTUIiNb{fNlJT zIKEdleLW3zClHuqyVuA=`Spgq)9~nf5)QjH1sxwheNCE@!v^&hD-u55bNcM+ZJTo@ z=YaZag3u|vZUt~YP-bdv!8WQ|w#hz`5k?dpu-)68Ag$k3p6H1Ak&!W~jXAHVef|eh zCeoVUjB9NQi+u3ITQ<}s`_JJlkGE${9~lIaQ2|#w*qzepFL`b6OS|QMf22Z=Gxn;h zmvTCM1Ecdqi*pwM`;? z$S_Z%$ylUfUtk9t-q+-si5@>0@me#NY0lNTnXE}=fEltm81zn`3$Y4%S2tD>pyi$A z6D$(P>G(N8bxc+2are_d$Xsgt<94Etq_(wN;?;>edDT^0@lRw<-+XMk2~|1mqYl(} zafaLI_B?jYJuQPYGsKI0nr}SlP;VcGOmIulW7otpv-&4f$9v?0`|cF!84E>Xtl4_g zX^oUj&MFL+W}=hYff|VA&d3reDhafC$2T3*6{?+X;~F*;@LV6U$G1OHU=v6yhsAiD zdu(!b48521+R)C@z=1bCgl4A`osuSf&Ccz5{@QmXMn+ea=booI;`=I>6gQzP^7|qO zE|46X{_O*Ifzit_d4vsxAu9uX?K~wHMuW1`wov<(S-w0ZuNjS}febma(@2kptkq>j zg+y{GSsu_!gdLS5F?65RN%+DwOSim705QTcxun-_P1^X`g6@Is;EauhG32jlrWRih zp{Ou!98~VksN|!bx)Bjkl!IqH;iEc5Fm%1Yvh9BY3QmC}_-eO`9$%ZJpOFz6x@4@5 zwePZongDf0Z;K$S7}EPYGy#l~RgP*uFGmAlg?e&wh^52=hJOkUr?|Sb2?e9l*tF6# zHlY`9rikwZUwQTue4KRCHlh6vgG=mw;(u&HcT+Y%1wzTHtt(FUWXO~f|7aY^&0`nU zEStmyuZ<%k=#Z7$4Wpy_1x%vV2D3Cw&UGR4NF-S1SbOC+^6rB#Nyk`idZHsV2ywg@1dxr4j?N2P(WCp2^%-j+X?GCpVwhogr~Qj z2gJBdUhVqPXuM2z0VkUA1VuF>G9GUbGyrOYej%Wh0IH8SA&a|`Kc?5qu&AJ!wA9c8 zWI&x{V_7{%@Gip^(){^(yq#voT{|=$6vO-Py;1CECO*gn8>lAhN^X`JE1U!W`;Sc67m@B*ACY0s_w7OgiNWm@A=U~jdTt#zQca$7F$}y$u~!ATF%^k(oeT) zdf;c%Dp9LUj&(KNn79#HiTLqAPIn&D>KNhKJRIh0k!Y9`<1uNoG?OoJ#=(9?W6DY* zpg?}w#_;s~w@Itu2hAhT&QN)*TAOaHBTHz_xr+1rq%_T>I)?=k}UnOB$_^^_r9a z%UG|6QRQRrda-@Fa{>q71a{8Gi_VM0aDNVvjhr2|sB_x!;|cbjbcH+eWL$YH&GoFs z>ALKBYj;|l(vl~Y^iGAYE))%qCTQ|rdEdNZ5LK=H_NXpdcx=Wx{R3aC^>bDdyZtHeCK+WE zg5gy00D(4M&I}j8NW)k%_raEtj|ts<`F0O1BD!?~nwH zpT2f8zK;sH|BQCeRugp@p>RlL?cJ4joMVnkO3ZL>p_IO8-=x`5a$LBTf3cAeKCbCe z=pT)0d5ua*FsL7c-k-@DAIU7bCcf-T?;W*w6!~&dvV)E+?hVz7l78VMnJbJ>|BLjM ze(Q^xXPe4ja&)n8L5d+&hj{|lzRG!6}h1x;qv6F2$E$LOzmrA?>=$fXzQH(F z9?X7`3^4Fcq_sq@#d;dWu0<3yV6;Xs$(_-VSg=g1ORiP@Ds`t=$sc zjY|08T=t(4J2sk0R#gl}Gdanpdc^Ud7~7FI z{r0FgahOb``b{peGm|{lf67&2Br(9y^SVY0SPDS$#6s^gK)U5}Wq+kNO`7n3>UNw5 zJqKeiO&J!~HCk&>MnJMPiy?g^uj(UcYT$(ub6KMoFnXM`ooEmgqL#!GW1oDsWS^XA z@LVWVv}ott@KXiW`mtgaTNbhoLIOyIpzJ2HH+~OQ%5Y~^A+z(rWG=s6ncNsNz+6VR ziZ?HkOR^wixEUaAe!z zXDih@jlL>v@-Om?%pJ)t&0U&TcK*<5JLsA2H>%|#xGOuFUL<=?sX9kcf)vn`x!usCQe(5|~ zHO8$aW+$(|k2#pOYh~5;x+Ltgmxh%}LTjX&uW?>p;`u|Ah?t@QbUhacA842nZ?wcRGW!RLJSbRiQs*aW{g36-rPnpv z0|WOHT2hllc^j3aWqnVUU4B2DTfrwcElaPNdFYs$_sns>MOsZ!{OfLAuJNw?>##_0 z)Jav@>CXJk;X4yyeE#u&q!uZsey%uqZQ3G-WR*yX%t~IIlmP5T{sY3C_T_9@rs&B@0&>djXzO}$+QaeYP^vhwd|Cat}Zi}n!-FXhar zy+^K%m?TWu`s||!<`owR10Di z-q;D2Arf-^GThDvVb@FKJuO({zk3Z>dtZyrc&5?v=n0}FwkvyHv+&%=^Yw*@#Kr{C zl~YNttiM>lH{xs2Z!Xfr)$eF6>d#2bweNg7h0$)dXgPKyokrSoNPEuq(6cfenr$xk z-t~h3=%mv%Tw7EzZqdRY=$DEv45*#oL%I_^U7_7*piP-m(hi?g6vV5G;FF%75Mox0~Xma{>4w2;Y8Y0d>%#Ha+hA6z2j zwF&heWh^>_5b>5c-NWO&2nayEod|<5^HqjTZW#?Dg&YO=h!^ShGo*9t?^&bEbyW@I z4PQUu7LL4r!<0P_WC2^GI>C}H0T6T1Omm9<(g_|vVXuQjW@ zHWqK2n?(orJct+R7z_ktK_(ZMeF96Tn=KU%=Q7LrrkPpxT^M89?nA^$fsF~!N?9Fz zN!DEr#)C4_q-#(5YoAlPjdAK`CsoEeFC&yA!7risubk&7jgLh zR%nz9R9q3-GilG&1+0PBEK~niy$=m(g=cv%7moprS{T)e4F`%(oQ)k_@CNgU9P0~U zF5Ct3Sxpa?H<$CU85HFLPI+FlHc@7XgmuwF|E~F4srM7MvZhlFD4nvdw5yCqpxQ;G zs;$lR1tZ=LPJ-TlsrzaN$5sE_d@C`?n5j+~U@_IS z%UAI}80)Iei}r9X6AXA}9s5_D(=C5TIo&+J?Am>fIGma8mk+e`ih57{h{40?v^Kxq z$|b4pZ*Mh={U+?l=ed-}KGuGg62Aq@9?1f9QzYlL*DX#RxqCgkbw)o;wM@umc}y!x z3S>XztguZowjH(p6Jc{p^J0EWO$#kX!i)ENFd_9}`IunY@E-dqzG(;2bBD5_GOduw zavd?N+FI#~Fay!virtq_M`VvaB#%W}^Qs7}+w7g#BX+^h+o#cQbT@r8ZTt83z(&%S zg5jLROWLC`1VvZ-$2@x*>U^mBV;bXTCzVsv&D3f}B<)|+v3DL9EzNnpAT*Vn#Dqoaxv9xB7ZcWna?_x zVO%V*a@*GC=?pq;JYs}+-==WbzbN(IiP z-)krQh}n_M^PSx4i;S!x^&!)p-nQ1Ks;C#2 zC8=ks21^(MhHK3gu(Hu0s;%?YrdPdzX{q!le&>qrXy@Juz4B?T=YHwoHMK7p1nOD5 zUqHz5l_Sj?MPtc6?)QgvFAfZLl?n@m-7!Xsuk7p|w||@DB{_8};nj!4E4l$KD2lCR zmoEJjL0b84r4!@$I@Fr2EmfXyLFhwF9FS>4FFw-S$eS3fh^o z2qD_nAF<>bU(f2`J`;@xwzSR*0c$qjMg3AKJt+oPaM{oIc|LetWxfcG#H{H1yU3&% zxE(1&My6Uv%;@t+%c&gWrH*4hlT*7z2|W8x8)h;lxnx;|GG?KV1YM%!wJ= z2sRXYo0{J4r2HthdT$JFUP@Evu&3Yi)ej#~@269ObYdu8Tnlb~w_F}hnP9ktjvtG8 z%>Q&>;e;oag&q#7XJRSlIf8m3Z)69mH$H607A+PBfX@2ITyU^?NsLZh{EPV246PUg zf{QAA<2-y-0Av5kFAvVG1?L2z=iijoQ|>7!pecYpDmYobphhK89^8*GLCaww91cwZ zM_6!P3ZUZyasmK^Zjl|V-ANR+d*(7M4&XmfL1S6K`WfegFG0AF4)j+CttyN~0ev_P zq(!`F)dH4R7J2fzKU?(703APWXrudc=z)=c9TeV3jn?IuClAA)&h<``Qg=%`a2GumquQ)y<-0 z1ac|R6GLLbTcb$kHmW=yLzi!De0@^$mS9%4?|I^&#hBik6f;o3Y+UNFQyE6B@R%%= zCYhn;G@h&imUIFXIq@M0p;>&mlSjJrdlStUwx5Mr4d3T7F#v~Sq<#k6qY})s1(Fx@ zx>G1>Aa9pg$O5^fN8V@>QxAqsFo=fr1KffBQ(+!$J3LsY%2uB)6fL3VW(l5HX6ovV zdRqZ0gGii&e5u{RWDss1pnGKm+UIQ6g_etjaiNk7Zi5`{GqF*C0FY(xaN8ggtV2N! z@GJ}_2in{+MG!MpyNmzOh((#X|7$Ee3-4@&PZK zFp}BQ2?K{7KnJc(UKwny3^?Qg2-(k8&p{7nBAlFqgq9hTSl2cBmk~2%i+Yf|;=D9H zp!jLhQ4{F_oEHSkjw5C6Lo>%SHOYI2H zhOEh812|om$BfK?0{}CzatmcM^gt#TK@?c>R>1(Mj0Y`sFxZ1-?*j(SeC|1CvfL0N z3ESkuLN>4j(nvb?o_%sRmv}&bka~RN^s~L+GG1tX7*LPr+qD|K7#2ykfhSQkFM|$K zno`uY-4w%myh^kO-snf+uEi+y4qr=TlvzK0TGz^rK&U_7-$A>PQ2y9zrMl=t{a2Sp zmR9p_RizQXbsJ$XdQYaN~lA-ZFbG+L0$UFN|nl&k#|+>BU6=Ph>ZE-SEU1nC;B)xp)yqix!bOL_NfKS zo}dvGgUn0QGa8+g;wvNHV4N@=_*%yMT|V!0RGdtg#^vvyy?F5P`->~5>Y=HI$;>BNcBlTvg}cu4h!52Etz?SGYC^L8bsn&y>{)UKI^i#BMz zp;<4g6nQTCCxO9H_iU{Dz@ zMn&1{`$WPV>f?LT9sQ&;ISQx$xP2s&9{1u-XA%1j6e+c4+V5nmBjx-2Vcdn(pl8V+ z)5!7WR&+b%>zY1qY6tl2!-w~Ks`EJ-lhYAm>N_=jKhh#=Ox=wPXB54x`0L#K`fbr) z3tmPIU--88{x~w6iDLUm{iy$g z_n66rns9Tpn30FU19wh;x7k+vNYdGxZJrnQsr#4apQ;qMT|5_KJZ8)LW$1E2g1>rX zLTquNfHv19Va!|D{)j)LdxVl?H`0c^^CQLbFOK6Co2@gBS`0}JcZ3uo&vJ8= zaIB399{Qf_`tkCQg139Y1F#kD2**C95jgjBknNkaJT8GL0pIPDmY0bZo-Nv=ZqXu) zm1108F;~*J2WfYuIrmLw3z6znQd84n#mfptQROGY3P}gWOXG-!Qn##M%rZ*PLPRyRF82u0>;B>r(_EIu-waJc6 zbS*!9MNwQ?348qAq!T>i;^l?9M-N&b9UGGgsd&>auru}T(F`TngAyv}m*Ki9I{Q{T zioY)pKN58m`}%l)VXob2g&16`uY$5hy@_eC?uByn%V0V2A()}5S>x3olpK8DO_q^6 z+a+(Dvia=1^I*#PQ}5?Rr%2B%)gz+~k_w7>+$A?Y;wR6w^p=mfJ$`vr5m{70u%GRL z8^_+&qRaPEAGGPseaEv1YQ@98Sz1~hKBa@lQ+q?zkh~|S4y+*uC))j-NcTLR8@%Uu z{Gkl@bsbUkXNpNUX!Mi&1irdx_-py+tEy`}7hiCf9>*o~!D#)%@&3?}dWYL*1Qv=E z2m>`6-5WA&*XNej!@-kArJ%xnjDXO->{kMUq$4NeCf#;-|M;zE(J}u;Aev^0>k)|! zv#1T;;#1Uf2jyWA=D0t3OwiJEVh}h59lFmfAEU>co%S=YW#+c9B0RHm8q7Q>$6{h+ zECc0ZK`>dkZw;TPWVzG38M*=+eNZB?8tA`pU6rs^56^h6 z$1V?gb*dmx)IxgO~Ykm{%~^o0kHI*#3L zUpE_F<^H-bv$DgPSSv>cNq+d*b<{n!SYvV8qf2>>gOe74T#}TZt`ZBX=90|A z9gxAe5y>A0VR6i)oR*wbD8n*wIV(yT98F?ouOPBUfiyU_P$rY7vSCtqqc8j`V}ahg z30(=fXFIv!XUXPg#Ehh9i7sZLJ4%no>ckR3jEt(&wEoE)5PbZ^pb2==W~(%4a^)G^_PYwYK5=A-<(aj-PCAD}Vl5o&WxSAYz*Anh}@= zA3(mG1kHRih<3 z!{c|TZ2pJfi;3FQ)te)^sDqbblp{M2Uw~659!=~{H;jZQ*k1Auyb5|SM)v#E9z>XD z38>1x%!#*B*2N>bQZE*)fPS=9fo{U+om+#sYzS+mue2d?dq`cNgL^7SY6xM&QCM)0 zUz0z5(KoC)^)q{bA78Fhqepp*IC$PIeQ{sUjlLJUZ`W%0j?Xxa-Cp!`5U9^SQG0RY zb@1JQGM)OgX?HxuOceiBd-g+B>G<;}Rx2Cr z5RxKT*)Kwq@4OemHuAGK8J&K&5 z8r;~_?s%n~@|pdXL|5|zP^s*SsCbXaEAyr?CoK=e7a#mxxN&ns`S;xY+ck1xZxRYc zqu!D=r)#y+wpIM*Jype$|>Jn_O#^vKEgy7z43W%rOJ<+f!f=d*u#koI&b zCZwW_Bj3ee{8hrcV6zLY%U|(BovdMphift|MHX7th8~ z)=YE#DmKPj@i+e*Zkh5a^}3I|P$iiAWdFQlaJJNeOC@`!iN=W^4>c?m8kBs_-a9T` z(}NqpKMHyc6KFHj4iJ!@elM3MWNI)}n{(RFr#nE7Na+3g>OJCIONHENScY6sh0%=w z*pC{wwGDj8@((M)A)018DQBRN6PiEU{6rNIe858D@dPI2m;)AK^NIPLhTR;DV zTKbZjl(=$DkX_>YBe3~nLCI52;1Ru<0WaM*@IZ~H9Jfg!lNyr+AGr))%Eiy=xvNev zfRjz4UncgDzIyk-*E0@F6|2h5eyqUZErM7vWMWo8Kr3F^6L`uP>I008j z87~V~T-xPNH1-d>PfV+|u8sOsbsN`Lx$}ZyQKap+H`uRH`_5VHyIa}4d~~UmxbH%9 zbb#Tq4PwKt*4KPzLA=`_2 zI)A)FK@3LcRaMOJIoY=m;-@Qi`|e2}&F`kheF&~t@V$~Th-z9W9#I~%!tLX@Go;8r zkuDr_>OuLMQz7a|Q;YG~7%jg2`>e`&my5a1ydkj>hr?N^!gBI^QXn)n2^et$}qCT|=_o)BGU(sm;hv$0>h>q{ON{y*Tx=3@-SWvjcEJH( zOiwcU__NsK7kl@17i4BtQ*6JtD(}_0lvRuMV5^*EWLNd3WA`?vp$T(+kC)7A6I;Jn zh<>gvoqjW-;ML`k@<+61pjF3cs-{!Rhv^R5Xu^t~S3x;WG}_O0>dhG<#nL6-j(TD` zV_a{qaCE~LrC-$!lg|w+JDUDSrs7``vmL&i@Ab1mQA@6PaG!=r?KEXgGXpflnAS_d zZpCR9p>RsBH+X`~HV*V7wsO#FaPBr?2t;j=_%ah&L?AOOHO`Jp(g1m$yhQ4+7Cy*K zcNQLc6-<@gORsciRz0pTCN~KAgmTRl=Sdsb97tT5>97J`#jpvPu-oBAE(+J+&nTVz zDyPM{BKae*vl>-hy~@og0N0UeJBV5kQ_^cePz~@ZM_Ie^en!l)3F%K5#=v8Xu7Fd* z^3V=h#w`%I`53E2tv4<>E#dVb6rI_$C;P02`Jh0V13U+@|IQ}FH{zs_=vOqb!BXn- z!kr;45R7JxHRhYN$e8XvgL;#O8pzyUZh!|znts-P*vgIT5y|<8;p=GcgygIzQ&LRs zuytwyJiO2*55y?J%ea6wF^d79Tm*_;!+tl z=6-9S$xTvXmOZvqvF#4CAs)(6D7jX#2b;47I!}gq_ipVeOp^`$`G|o>HYpAq>7cZ2 zy91i~5U7}#TCx?|l4;;5s+R)3X6r_7q2d`=bZOuzk$Ykr3*cN_E;tD6K!U>X#PF1i z;ry{LnH=l1v~dI=R&gXyyaDXTPmlX0v+p8#0ktB8`ebwGz2^mmpu-^*xB5bv$DCRJ z<7Em?FEG!A(X7DJ6*1El%7D=jK#hZ21_u3D0|%9f)d=te$luL$a7^IW^7Fv6A#8=z zu0-+}YpCL>jO9fpjR^!ahOp;z8#ur97^RH@=eIb5w^|;edCarV-Q|EWlT;$zNq709 zw->0&Rezg$9hds2D<3W(M?2uIsFe4OYm<%&g#~6r%`2jnJFn+mczFKSVKQYQ=`DNz z!&A=+{j*~zE;SuFuIl3VWOJ-?Ln@SGJN&E+-#vS&nU(zIh~y44o!I}y)L92K*|%?h zqJpA`0n#AND5V=zI+cb|0#ZY|q)}9qZe(-}HeetzI#i^)hO~4^gEaU1-R<-I-scZD z5cS%wfjh3_JdV$K={QAt1erHEHt}Ssy|AgwXXF~jK4(h(!;8+wiuJ-PmEkBWFH8!L z{>Ho3dtH>Ph6n@;zXYL;n|>$8P1-T8~`$&If{`cr#eq1TYBNwLcY?IgmSqQ*?)ZM@qu5A9c#AJ*oe>xQ2OcA{#~A7 zGTdiWcRr(HHJw3(pFhyH`p5l_e<0j#O|z!bf?N};)61G^RdI3aCU*~YW4ajp_qvz2 z*br;8i^=1Lw2M&<2G~I-$AGmLzN5PKc}6hEzzEJBQGQ z+^T{LT*AVCCK?}DwP+{GtDVood^wn| z+B|x7s%P3hl$v!l3XRtEE2*tUPf>A_OjjK1$agOoVH;u}xU6eU!rhcUPvOcIM)fGbeJAukZf@x8MPl!UMb1a0x5>|9 ztnI~~wmK`ynuvtWpE@SkqvghA+O|x+FK;Y(lsws1?}mLyV14%wM5hlvPX8xF$^hlN z#1ryKtM{G*_iM3rlccvogZs{-Fm1-;oT-JH?EANIuN>dfx1 z1<;IaEEyRl@ZPqHJ`}2d)vGN3?dS37k4I%)b#!YHS-YFJH(T5TxIRVdvAmFX4ZpVj zZNJ!XT%cw}cKUtP<6wizC=EFYuM?ae`Xa>eCC|g?GgUkbFZ$@W3HC#oG)E4klCC)b)@1GW7+N2(7qY6r%}R-8kGo2 z3StL`&|A+iFH{%;mW0N-9H~o%`~_%`Y5l4%(6kvd zB@en3eCElK`EV^mCAK$X*NV)g^-SQ#D}VZ^7^-Ze%$ahBTDqMk^+kT2(mg#sEBt9d z*?L!*3o+zpA{gtGb`c0$b>E_3bbfOI`yIuSw&|=w{s3cffyu78Z>_XAy>c9_U{CGb zcL__=5$$}b@Q|J*#JA#AhG=v6He8+k`A|#lo+7b#$K=q07MlP9mfT3Sz1S03co}}z z0yq%dd$_u=DAH+V-;2;LlETQxTLzx4E&fhI!&{%21E)gY&j0X<*S{o*>%7IM!KZm$ z#m(yp8dfB7*NDoK$%j5KBXcIuD#Vb{MzN^SJ79==aI)ugS&TeT72DYGX`FSI^eNQN zIUY8Eka1M)F!{FIu|lGLMFKh5vwJUyBTTg#`^1Ak>xyN*iW$E_wD*MgOUnj_ZnsX( zlRHxNZ2RA(ebO)%e9ENp$!)N1qu@W`&DGuh1s;jd9&I_QTk-T*x}}aVsw)2xn~6ho z*Be;(CGwfDE=DD@?e$@FYDm z$K_RLz{cI+Yu(+gfgiFG?B%n}_jJ82WPHlwRl~#osA^DW}Y$mkmn z3THQDe^(Juk#5dlUk;Z111b2}`J+=rG21VXFSt!p*&u*wxN(4Dj8&#yBLr8)w`HPv zn9yse(CuInbg_Dopf=JjGu$*79eJ%7@@NZazJibcYd^;y+JLD{^ z@~>57QF_J*t~ECP6RjL2w>Rh0OALhuX@fcxWTsgIW(Dfypk1ODbU#!VWGGz}prD=Z zqWlba1+uF6i+>5Ma1gQPUmxK4C0X}8FEj^)OiQaDbkRv};DU$~fo(Ljswo1C?Yoe^ zdL^#wkYQbC6ls`pZg?^RC%zA26cmqu<#G+dP@A!ZL$;myPW}U_Q51>zum_&CTzku##>=U0`QFw$mq z&)d#qUZzCkw2Ek9|#Nrf%wAfpcr(I8o68;aFH%2#>NSP!wtuS9Jx9{%5>Uz5G@d2 zSf0a^lMgbD88F1@R{s@-ZyFcGb{nc^gh4cb41fkNCH~QKWImB+%tnzM$t)N+VO|i= zQ~~sb!+M5kJY)?-RX|o#7Jr(-m`%yw(zIF zP=gGzD*Y>OuwyV8-xZUG00U7RoV35yG2jPfMYY@J`aqg|4>tm*fX`JF0xC|ChZiOR z2|UZw_)j2xS?G%Y$4(Cl>+UJFm%%)e^S_2U9PNS4TMMB%ZjE%{}q~ z8A#UFTWZ$j=#D^_CT`~6oROkg4YgW&6e5dX9!f#iTlt0u^Jx|Jcw#vMy+x$o2E_+= zM6>PngP*zcDZ}b&->9T);wX-L5kH3G?h;PTV4j)V2@N;u$g+ zV)S1-^pCH0ByG+W^D${xek@`R(FpGN6CCS~c`%wdm5r4KyUd~wN!vd3eZ zVtevY+j$`>yUCWP^so=((Bbyb-jd>LCGxe=_6joU>rw`(BrzI<(%d=OsV>w8pjpCYL})~ub6*6bU(vv|+>1rjaM8s+82_?4g{Tt_oRAf=9HZ9HYh zq{9nk>=e-8L%g(!Ei{LQ^7n0+R7PwEw$%0|xfM>zBaJ%Rr_T#r*Pk3YY_IZpxYjNq z!{5;c*)Bg!;OXPpbChftR9GQpW+uOR2v5c^++J%lXhPV|-F~VJWjG{4x>XS!DQe2) zine`rGp>`Fo-1OUZp12FnRzg?4pXv-5MKJ&IUi%#OCrA{4EOzHArZ8$!#eHbqTQ{< zBd~K=5MOq7CZzm@vc?DfZl>iKpUWraPM10lV{CHg3q4D>eT*ts*lWwFNIN+e&WTC2 z0}sI<%PD3ZE_9Lq-4qXWY^s#$2iQL6v|-W9_eLSrhiv%=+*c<@A}u`$j&zTFgbxFH{YgPpXbR{HEKRg z5zFv(82Q{vI?pqu{PSiaRj)s^v`_4__IZ%XQHV{0o}qr=W`t*L)Egm=Inui<8Ikr0 zO#>y|jv$2{nxVpa;|g1@zH^W6VwJ^+uO;DJrt9e%E4{_sW1LYdXZ)WDS1ya0*YSKb zh3Z922{$&rweV_KOOUu@w7&g^}t!OLM+HmGX|AHPaxz@F|(xYq2OX5!8cvI3Vg50@k;|NEZ0 zPiiQEJ~&cRwhH$4dKxK7i{YNmuD#N@f>soxVRU3d;jHhF13Ek8fv)cBD1c$uHDQTL zr5)gKUHcSYGm^Xt>((?g+@gy^>_xyvJL7@AB7tWc47{8uZEfqZJ}MaM@_G?g+Se{` zuSX1DSwOODc-k<IDrVdL+#7u%{P zq`8HNOGu#3zUrthG12p5Ro0(=*c@97S&Si6*EjJexXNdNFf$J+q4A-6+@Awg#%xC%23p6y?XSiE2!--OV#enGfml=^1c@9m+oc~K?xT@I^HJxT7HN-Vd@A-QUWSrZyls3@+^9?&TM!dRo^qU} zgg&673#Un=yy->mZ>0^jNOlcSPvb(?+sBuEp!qzDxXbS>Mt=9BTSFfi&fV~KQiMI} ztNz$B;y-%jRW*r9^AnUCji{=30aGrEZA7U}zlj&pXc}%+TabB4W&}zn@T)X$rs`YG zHHGMp8(TX>MP~Zw-`Y{W7a!06VpI|>>gfKxprC@ArQADc>)c-N`^C!&9g?@_0r2)- zNSolIpXT-Ick}K}|3F?%g~^5Wv?Y4C`PA2Dq;aaS_U@FP7beUgVyDfZhqn%j;D>yF zG^OG+`W+Sr*y>8-dJ)rnjP#AwXg}6sqj7oW_(|G%aM_q~{XmyG_fao{W!@tRTt>KH zbw!U~Pu_&+y9~a0FqYO7g*O`sx!FeQtZN*#j*cSDS zEvvp!maB!EYj_W)v?#A?U{U$8?!ARL^|xWQ?|#`k8%8n5#YYpL*Pn7-v-;?$MlI$Y z7JjUu1%0_2sh{DaRGc>SGVFcv+j%uj#$$d?EG|7odP!>4HHj)Gsj2kt!js2A%zujdi{Nrpnc+p`Hrb~Lj8RX7m)$RSu6J0^k+A%c=g;I z8?E8-+tCg7rXF`1`}uV8sfrda+qQRDEftD3USxxQJH5Wy~LpRj(%jRNp%fuB{ zkA_yMgIGefot)$3zo~4v*CjNRlTw-dax-R!^$(P!xBd?76Is{2ZqVtnB%!uU?)vb6 z^kPFZR4#F*H*Ax-f$07ZU%e&Te4_clW8#+o*kxL;CoZ1;uT*0$6F0jS*k1SFqDv(g z!*_;V-tqqn4FT(HF*mnI%q|ExWB8PiMItbJK*Pljsux5LwW~q)K!B|V!a;m3tUSCN zmpBBgbIl(U+Cc&70G|cH+iKTCVQP4r1O`fT;O!kmT0wF9U{zD6GH`t`h$Z7)AV#-O z1uJ$;iYxGWE*GM0Foeb&q9ED;E|-SchAEVlWNA4XCL+?Zmh5^DSc3d2Lz#O}B6kYC$tE zp-Di#N4y`Di0*@Iw?+$4WtwO1T7ma%2@W!*gtP*Idp34Hq{|9i+hItj+McS~7LaiA zKpHuSNB3V=S4-o(r_HVcCX1ChXcp881gQoWQ(&w~OGf&$j){S;LYmNp*b%fpgEbQ0(!K+;PA zyvo90fr{F-0dctI=hugm%0nhFF;pBS@3 zaIke&3(`T&r}%jwYAbLN--P@t=pa4#tdh>`tv8oJ1Sga9%IbdEw_eBw|7CRT2XUrR>aDz z>bj-C2u@ntKuHvT}WprN6=HezMS-PfzG)~j_}lsunFQKZtzGO>I+ zZF2A8AIKr!i4U%&kkKe}nW@;~33>ia_{C9FV`N<1{=kX8Ee@bkf3&H%So@6VcXlXI@Tfg%j1(iCpg z8aUh*`BKOwL{r1K?tZ;Y4!33=5}l`b_N9vMWxz;39QF=&>*3}IgQj~o2o`>WfKo0s z!uC(bxKFC;c}_SCgtht}`JVger>>17d(NACxXP2n{0{#V#@DD>QZV@&=~p*advCH% zZ>?(@*i(r6e?^RbB2sKq>5Nr*pZ97*BZ0Pc;LQj;oqy+k*8K^L-byCrW+fjkAV5?wo ze4Ue^EV0i}y4AGje$j!b6m*Nt&W#8vQ7vQy61+Boty7xNTYM~*ajNN@tW&C~#QI$E zX$%WX$-8kq3i+V|@*RtU4_?pHAHY^ern9XbhRr|aLm!08lErHq%wwKdqC40)r2*52 z#GZ7Tt+^l9lQ5j+d=#vExY%^_ znNV8BPO%oC?Go8LZ?FTxj6ws@_RVkz#W?{VJL)AoNLtTxY_cRW^AOjlhZ zdK6-qB@)mZo}SJlDe#K`skPm)XtA8nVmeCcGW=2#0zEeM++_@jRa*D&glqHi3`aLN zsAY?`x5QtfP|5qI?k=LIUhddCC2wVHB8l;~ zX!dfx9xwbHMh)}Kd?E9j9y=mmV6djQ(=32ueq*d8MmuDD+l!s3l1pjCodNkbV;d;10=Np;kzNU6(88vE1Ko|+At{nT;hDdt{6spv~9M;M-m%H?v&ylkgjnG!etflw8nes8+{(7o`6?>#3c)X#i_ zm+PS;I|>QEoT$dV$34E=!eTTWHbtNMM>w=+KEt|A?p8D+Iy$cnw~EJ1$DR7$NC+L% zltPV4@?dO71JpbDLXPNY7%vh&xsVN5{o%JfA`$KO3suy$!N{^*38vh%*W_i4eK@5a zeo!KA)H0TIIwDA&74FdEa8qk6x$DLVU1PZ`&P7(JaZWL7u0l}eUK{6?Bs;fn#WEVh zS_`>%l^dki<CI}l{YHN3RLm(ubKEWm;K>@<+)MRth3wUUDpNNn^Xk*5wRC5XGHvjp{sI~i% zaR%IudiD0k+k0Dql`!e<`EI#ZuIa^{r8gzE|3I9o<=;A1Z@^C2Fu%_2<%ADCqwAv7 z+%%lEU^$$+Hp(l0O}^X5OoNRx_I|yeJD#R-eXOl~G)Xr7lkRm%u}4=RA<(*0lq(i( z^Gf@MT8D6fR(zn)J zri{a=(kzLB`(VG3yjGUIEs6!gCDgsl3~}t6ZBkt6BUmF@-u;c?(X!Xg-}P|f4C5?V zxrny*i<***1A7KG<(vQtDSJEBWLwwo;%n};CM$^#wuKiqxvX(!5@Mn)&eSAbtA_-v zlUj8t*W+u=$&Q1W$rR)@uA+x7FHXWEhF{G)QdgP?P=0MAe>%S)iM2JqM{mTwp<6O= zpQOy8mv0a|RTW%T{?JmODWM#p^(ptIi+F|Rd1i3CP)MLHvtQ(gI*g5mQl=NQ$7M8j zdBJ4}>88Q%0iChD>+g+i#S!T=4!qPHJi=16udNWWUuqY5qHl+#(DI4@+qSe zd{1XGs#^HkihcF=`BB4AxW;iB5mV*66UtsX4ei#MUGo20dH?fqwow9I%+PC@3;Bt^ z<*pKgi`&4%@f^J%0=+P-y)Ncm%NC%;WsCzXWhZEBJ;Mjf|4Ku^_TfP05fFPQs#FBU zVcBeforES~B?P2SFjl*v4AM{d1QaL@#RFxA0YPOvVh$fx>u&?F9aS5k$_O%Hu^?EU z_*U5l&&>dKUJ~BU(-?-FfTEF#1BBNF5C4+e4lDqOJzUH3nYYMbDRAZVnt)s!J@Wyo zuK9u*N`VHC3U6}V28a9#IHo9|&p_fiI~mL-N&nu$2m58_m!2JwSm~97G|g{5`~D`4 zFd0l!@#@d%zv|B&CUf>4T%%8cdUVKzEMSe)<0YXI?VST5mL|`vsFHbY)k6-J55WBb zEhSLHWq|@d2N<8?F(LmJpK^Nyhu-7!OQ5o~lwb?`>shwBg1{2HkDsYhheBWyTGmNe zh)Fqk9`M|zb!rTV@D~WFH{qlptaupcRWeYQWAR|jMUs&T4tER!wt{GXIrs#S;WQfmff$0%Wln{j zQw?iF)gj`D-D4$_T4Fk!;B*^74a05thU?P!&x_4$t^Vq^ zq;xX+{i7T^)-i^M298dh(Zf{5quXhY zL;g2!uPY*Pf}R>KkLX(NGKlbXti`T1GF1nbwF$0VUkFc@#_}f3R#&VHn#gKZeUQzF zW_X13VJl}3er0jL*3v}sPWY?vH+@ayy{7h+_akM>1z$h8ILoX-EpD1gjFAa8aM~dS z>`vUvTS-NdXdfJ6><-dIo=&j1v0>1bm;Qmg zAp$inR){PwFoo+oxdnijUbNVGHJRim(4Qz)i1$j5F662$e%tIq|C z0~UB?sD(}VW_A44d0mf{tH)x!QO1Mkh=r<$_oYNE@`KgVH7{!K0IKx+XOGDCVEM^~OkR_r zg`3}K@Glaqvv+*$F&rxPD?Q|_rzjan3XPr9iIMTFABkaxb77-taVEP(u^V|tZNl1c zA$UW1>PuZeg}@tJW3AEg7L$7GZ&+*x(z!CKD_=(Y{RH9D*Z%JdvgPJ`&`e#Y-47-A zU=)cRe;D6eEDxr5zYM-5eo$EXg!ORW^9kQgS?t{_z>YyU+Q=rCh+t3@%NDw zgSgId_^~{+E>*5FT{YDi8u$I?ix|WTwn4^sk&7qug)nuerbu}Ax^v3KhPtQ%rC`*n zfiCSIncH@xDd;FK``sPG!HK;?`{Mg`ANsLcYv0~T>U3UhMR%y)=j67iDsewkj4@Qd zM^v;(aqo2xKTA^AS`E2n?}z7)nuPRiFRb(UzpS?0iMy__xKTrXgZ$$O?NVWGaZ`)x zl6M-sW|LQ2VN?e(u0DIb-}6ei+9_9kPm;xp8R?24&iJg|uM!-J8nM=TE2XF~TEhMO z=^*oX^@5UX)X^UdusKN$D)=Xigo=Xv7E-fHSl*t@Nnbw04jlQK-PsIXvwlZEpLH^- z#`R>y4cA;}LWWJ_rQs@z6}c6lPe)?&EWe9#hI)&9V!FlNFQ^^OVj}zFbf~z0SN_y{(^#4EP4nu>TSuhufzT;Wza1g>Uf#TA zK{oU&%cFqt%^x)OB{Sp8Om+VJwu9ZrO8pG57I{eMP}OUkw2_lg1E=u^q5NKXNetI< z8Q1ko%ai(I^M#_0^~r1!Ec?Yx*OxwAwST)4ld%!vQ>qd=pbVFkZ1T?Po3=ySxzJWt zNzAjyXs&yvYa`nyJ`su*r!TnZ9NksU8H3edP`!JM zEt(^|v$5N?5|YWseW-$aW!_P}PjXQ1!@uWn4hX3*Tol)a|b+F9m4kp`wOC|Kr=w-h<)@m*QL00SkS>$jHa}wq*x+X7|%N*`7Y8bjE zDLPkeM!ovX{$UEWIoI&7iaSdd^&NdeadVVfo9vNF`kUKu_ANR=o6bHan)*h&*wzxt zgW^bk#^BodaGd{U`gYpS;s8A_H#Aw%^{3jy78x!y3a2#4C!7g>BX!==BNXxaF>+SO z&u87}`2x&ts$P6u^Z9s*vujF(4YO@~?pbIF=ST<&QJPfmaJNuPC-3tJYXr^I zaL)sp-9uQZxtmb#KM>o9FGQN_nidHf-AhT2j+OoNx!ug3aN98cBHEc8*7I1gN|2?U zeSPwBz-am;8EIu%_dkqKkD)K=l z5nqel(d(rpl}@3;*}kKrl-0*{gfV#WHq(5pFEV#I%_8vdy?d=99&JOqz?D1-;)F88 z&-vs11E~>aHP72dchJbw_-ny<62T?)f59~1EZ_-nz@_52L;{F40E7!v4V^pyZULGM zUen=AZsZZHfN-Fi4uwhpK#TTijxOcJ&e|0Ee4xPLqI3n%1_NIXB^!u&d>uGt94vZE zxhkPZfTVQOMCSt%IWYu4$3Wq)hliCQ=zg4FMLgj2{!O?8sHrU=tO5QoYK1_BQ~drL z(x@%=(-EP=lg{^eD=&7x1i?Wdysr8auuxUgNg%8sZm6C~RGRx23zj#O7z7#+c=@(E zdE{4eN?3ygok&oU1n;-bqk`B6;^6}Ttu~fd3Pdq@2w)6U0eRj=rUm$_02Q600Qw4U z@=QCpBrag$!qe@JVHSX8h7j1LjyggEvZqi4J}9V&@aZQgor@Ec0is+&5Qk?*|4Tdm z-)90k`pD-LTeq}E0Bq+FFd0S#&f#1o2c8wDL#IFWtHVLxBU-?1Rbw*iMml62A+7Ut zIdk2(sWZTQBm>% zd3f&F&~{ehpDjr=nNlBfDufGn!SMPzW7TN@x|LAf^vLbkXZJ3TVeIYfCmmBi^;#Ry z%6=KvScS+@Pkx!m;@eA)(oElzI6e2){_T1BCG=a1-k0~^uU^i8H4q}0o-C2PI~|_Z zk4q#UqD-xy{1MIDhtMFx$OoME|2CEI9if>xecgEQefcy8(Oo@aeeLC)Tw9q)udipd zLrcst4H2S^7t)$h+J=b6lB?wxyD#Z#M`a4^6D9h_g(zy>26#UFVEFW{=;df*_bH}` zrwdr!#!Y)gi@MCVn*JJZ*R|~8{GLyW9^8&5oe%A)u4{7tCGSX7^tQ}N2&1(nZ8gE< zsdVw=M3?=1`J~tA=khU*zsR0i_+gi8yNEy1ZL)2;K&aDy>+?B0hmCZqMJhHYt$ipy zrbJ*+2nCznYa>gc9KuaS!P8!vz6-ESf8QkTnzU)OhmIYzJQK}7kCk5=-r#d%N=fY7 z32+ZJaJN2N8~!5Py_B{4>=3nR86HFb>@e#5Kx5CE!BvqVf`o?Ho;lDnKjFihCFMFc zeXu&AN6N97z%kM;q~EYY-8VlMEQxZ*&?V)*Un_xXRZiz{~fy?N1uw#c8YX^WyX zALoLoQMqpF;~$@AfeT6UMujh^xoq zRV=r+q7d4KO>wJGsr|d=Q&U;NAl0hSB-OaXH&6Gr^rrP*6I`9gC6523ee{aDIM1(l z9HDmO7Tid1f+PRQJzB3q7lk{=u$=4nS-Bsh2GwXC3T-d5J{^FZjkrcX;Wjm2Du4J( zClKj=hZ9la4KMRV^9qPbwoGpX?5gFo%i3qF514Apy&=H~FOGQ~5c>xW(sQB0&|&mZv4qrNigP zPMY3g8urD*?r)7}1$2zmt!R;MyELun?h59?OpkAKwIZdKsjOP*E!D@I#w7meh(uYv z7a2}7y37sFq~h|swaJMmma~T<-`g>1E-3fwxMqJM&as@%woR7a5b-4t(N(eF{pRas z$MJg6NzGGeVAW^gVKDpV!o@Ot*`jJMj;~RPs$hex?oS%%wkl``*9xSXOHr-j?!u<7 zxX;dH``|EX*oxlgjcqH6E~ehIQzjMO%tl9Q+sjmR@;9)AiZBv&tT?{%DLL8;RbRGj z=jV&lKo;~|iF~W(d4jta8@bdUoYFs!E&C&qZF`|c&j*Vry0Lz3F~C{_n-Iva?t0eAxG$%qAKk6NvZm>yS{mgd{=bOQ62DGX?hKoJP87#V^Q#q$Ew-u#Feyq|nrr*p>Z<@x;Z>E+VCWbitdM7M$mpPwx9aa0@sd2lt_j9pC zvxrl{w8Vs4d2s0Ft1OSlgI<_<=2(|S%Z)?sr%a;cuw6Dg#jY4w04zwLg+QwB(9Taz zuD!PG$*TYmDI#7LQYHFnD%D1h9XD;`ou&xwwAGLfthGyYse<|Vr;1UEEq(D*H^2D! z@+04V@x|IBOAbZ4Lbi*6m+EPSVl)aiaeWRCBy;q99Y6Tbes&vd;9P4RSIh5;F;4pE z-pAVI@U@8j2HkMM-ilVDU@Xr(y2$t2u zlRf{SQm%4|(flY_*Zi_nBy$KSq8(NmWa7xlmq%_q4UIjPGmW>Dvcp5qwHjDD1x5H2il&iY;XRZnpdI|F{Z1W3Q~gf=w*YAUr97GgWKpvz;x0 zd=|P;^-Kp+sEY6JsZ;<<1C=+3fhfz%CxZ3?sbl;&eqact1{1V@RSekLA`GB-f1~7Z zBblRP@>_6wa7T8D`5bpLOpleE0^?CYMl$|BAkS-i%N+2N-rNJz8noHry2jo)?3|02 z^uY4`WTfE~z`!$anyEmk;{?Bg*&O(TSIGcL8wSO@P;iI8-kTON3@97;k?;8{fbyX3 z!blPQ{fN+A94IBni{N7(Hy9|1vY&*m>|26Ks8Lhq#nYMwFHnzU(0oi5w{^jmm$a$F zHL(U)1nLP;P4T{w>f@`7$UJ;1zT&yk+JBrNQ2qqJ|DSpA-+O@Kfq@F3np52q)^(W! zg#w0yD7}qmn`vg4M-6Jfbhtm23m=ilQ#QjJl_lABtg~;2tE+j1DGo?^Cqxu zoJARJ=?wTcKL?z@zcwlDIW!)F?|O^_QxuqDpyc`Y7g%3}_vy?)no!q4YmI&RsZlOF zTUPB7mrv_XV_srRo5PJwFEu_ow2E;~RK3Mfl>W>`*ef3obK`k>4T%HfV#bGs10jp= zIQxk#2gj7LqhESj31dT)Ke>7GYHL*OZO0V@zBlB54Y*a=Uj*C}orz^n!sK5vH^z=U zyEYDIZ!Ww9EbBtljC2lrvOtk=PNrMbV8y$eoFfc@fi5U9rHQUL;+LjB82PHYEUT1m ziG3>$)Z4j=eJ7tY9^}rBKH~}k=Y?Xy|I=|_n)Ue5fr!#*kcU#+d9`zE_K!9&m2TfX&e>=ecnYIsFlw#N91gaF@LmlkZY&DsuAWOFoJ=qYa~(IOm&z z@J7bb@h|)X5r320!mQfzx4q8txPDgVp1Ng^>{1m*gdLar@^n>lQit0Jm!f3VWj15u z!SzCVpoitMRq27?^oPoD@BsO5(sK^W7sMjUFJT_YRq;BuC`u-i(8tI+u}4kr=YaMCO$ZUm|Uii5*F>WO7}Gq5l&8FAY3Uy03_Ve^Q7jk z?VqwhDh>OnB+tDJ*y`DqfE>0@^x3*`&(bV(AH!xvLcw{fL&1zgHix%m=uCARm8wnElQw zCLtV@64z}09%Q-QBCSo;-udOGqL6*NQ#}`F?>W$F6~$QqFtB`m3EBw@qohhgi-nfg+rqXta@pFGV^|Z7GK>@ zBx-fl>0bM5^1kEZy^T*~dE&Ufk2YRkl&$LxR1ZQLxd@DA1g~L2;;3)F^bktTjr=Hw z;cb^aM^@FW5W#!BF9k-w(B7h?>g!25Kv66?lP#QBlqD|f_zw%iiaU~KUF{8jYl${b zc7>M^puABbhxW&V@v0wxW+#YE4~+a=GPaZ)F*N?NFhubVNmX5jyvkyq+vu{(q80_K z_^_3`JXHfISJ?2)6Z14kfQ3wvxO9d?$URMKkV;jTsq0K z&mS#*hik9<;)1K*kWl$RcZ)|4YASYDJ&sMr7mhSuE}X|TsPOwG+9bfP_pX#9 zKdEF0#DqrbPdR(;L}K|Tb5(9SMcdP8rp-1fn8s?S9&0`djuT|Jp`)%bqhyJ(&^#Jd z8I`uoB@SyU_QdIj&3a>^tO;u1rz@*Do9eX8rCua;7^TE?&j9!v&8n-+G5VM;#^umG z<}F8`-Gsz<_t#k~>Yl08aiW}OeGUpWOrA6HGx)M@m-7o?SUC4xGz)&r{LS zvhlY5P8W`S!&s!b!D_$9fvoO|E587)5xJxH-eKp)?C77gyk^u`TN1?eOyAfVc_ZD# zK-@!6l43T_)L^Y(^`a>Cj_C~9mkRUU`pASOdg7sSXD#(FwY1{Cqk)dhUzKX0qe26e zyE(B%TM|jsOE~b><9D=_c5nG}nvxV3sbQ7fkI=%m6yf?bPIFR<@(obo!*E(x`2Hu_ z`Zko{D>p!@vDc~jX-K3aBpo+r&!fRu_A*j&4T|_7(XNyP!am`8ZuP2>e{6&b;Zejl zOMD#CbIX3{Y_RMX(DR2bO<4SHM+qvyEUAv)Y=!=q=F{U{6K-d{CqL0mz7(ILxa` zftT^th~bCRd6&x-z~~Fu9U#JwZUH-(g6L8Qhwx~n;~c?B06WmYzn$Z)mw)&BTm@M! zAeC<7@$8q}@Rk#>CxF@#P6D$q2&cUOe#c)TKKc()e>f=vD;&hA9s;$5xK1Gmbe0w| zaBS3W+@@^>_L9WVq0FREg3}?<=|MhNI5c`5{J7gwFdiofvSa_683K>*T89sN=LlY6 zv$HE41cSQ2MiX8(J;;RM@`5ia0}r{lap`X^YM0MD3Ein5p1m&ydWm?+qZywVi$WEr z$OD~#o#_u`G;XcITTxM{Ojl?=812`?ZB7%217V5JYM!td;@2?!I}X*NhROa5Z}>mW zM2ue;_18kl?IDZ>bp0A|R#*fS>_9lqtN}2VE$N{>Y8TXy2FE}TUDi3-ExlhrFX*y^ z;n-u6e7poATLdQnZys@6>d|7H%R=7`x)Zgz8ovax|LQ#uvfrR-@C4ts1RsF91?3!o zN8_CzJeBkBZB3pg;$IpjfL25`f?;9O%(`B-_Fg^?@aUTuR3L96)gNvTYW)Ktf!vUN zUZE2N>T2MimjqOmpY{`!fJ3;+L)^z*07m-3VUJs+3)i`Q_7`w=_ydG`Rq+t&>C6|c z$-o4={r~-<|4Ky?B>tHLCPi}Q_2=7gVPsST^K%001a)Dcr~zaA6ddn!4w47-Lp&ZJ z3&26ukz_YvYGCa7Hl}g5jr|KU*AjckkTm%x^SV%1ZrKoXwbL(JQf*T&U)NEuX99^V z7YT)P4bNvf6L&JEzO~^>H)a!Of85TIjQshPJbckD`_3XuX?gnYnuNX8^rp)j)1F^_ z*T;?mx{Xa=OvNO&Z>$;y+#GmSFJ|*+{b0sZ;i(td%$=i3j<`dc-sF=P=bb2)DuL9A z0UCP7kx_4N}4*m_4#%(6vKX z`yU*CQ6x{`4&#{WAKq=(NFct|*Q2>iSr8M&aWQOx$XUqkQEJ=IN5eiD9jVJKW?m=L zDf;mFL++kH%av>OIvL;8by&_)&pBT+dO6pTERnv$fzW)Ys5}V zZC0O*?5;c$ulX>kWd%114{mQqiLzz(dvN9payV@cZQD{7kixO#<<%%A4@Jzm*qr+X zHLC4%a#wt?>c^rqF6#%MoWloR267f&k_!+XSz%SLKOe^lf9er)qdC-@vHubR@>vGr z(VQbce2NfE2FhNKuo`;YI|hlcchMS>`IG4hlXl_>?-%ov+$yA{>}|(V2bbS0iYN5+ zM64>salB?G>$$#}JtBKHZFHcr@8G2HC5gYa-DS&o?nm@gcz)NYIYl2 zwA98YPMi6rZ}sT!(a_x9g}YZF^hqCX&R?8vLk}s0^+Fu7x%a$cPDqi=N{U%9uKQHp zGhG@B2id+ymd`l9lhc>U_@G?`jHQoFK5eO4**u9%KcGF2IF|T0Bw4nVoP5sVJQFC1 zuq5nJs?VF5L&fBCFdl4an2+bIc%w(-r>5UTTONh!d{N&eXVmaL(PkYF{E)Nqy5LAT z)zQ87*{9-H+<8OAfq_=eg!}AGmOA5h7ST5hVRCM%mPk$WTAr>Ba<3;2$CD!?DsCy* zUg)Vn#k)cli^NQ%|N|^km@xTCue2$FVdjz;jg~+ahjaLT0;yYa|@o> z$UHdjJFJ}bBqC%KhrH5ahAbbN;4TbOxj5M#53`_6P??3X6A11=A{$bOzeC{ zLma!KxA-EDFdIazE^1*;sBJ|mWTw3XiG#}B9fup~T&X)(3vS$Qkq%V(t!G>OK5{>l>eJ;FE-{Mh_F3Q75P>I*&OZ8li)D?!uub0n%v*9M!TlrTpHjrgdzc5_ z|tobwpUjgf*2e@l7rMWGecl(CMQj zYQ^HOrJ0(4bbpclNe>;w^(#*qk8XoV_kWZb((35hh5V@#9^q}TRbh0u4FJ0G0Vou2 z-uUzVyY>tC5*lRVFvyc<|GRP~Z!i?%wGAqUfLYC~iGXLo{{2gLP+&PS7?@Fqs`V4# zy%(KCu(b|Lr)mXaU3V@7?@F6hgRABeJ%&w@;SsYfZNQ((eoGKjt2Jax@Wae&7eh01 zbR2x%Y&hUQ(^)c;v0p7SDR?P*W&~XUoUS-B$oPMJB{~&o{NjJ;ns@^R#P30>3~yyw zwVfs;vrl12ZeHvL9&&K33Yr}gPn{F(!j`aG$2UOzvz{w=KxTp6YoDQApAVC|1`=0I z=Ntq@LM&-(9AM|#G6o|5-+$6N^ijohJY*>gALJ^Rr-X?Ep9YKqf!XBRe+jU#=l+fc zJwQGk^b%nlV3A!b5}$rD2|m}=$vC$%1pP-%-TZ&0*}rqe51_NaL)MLz3fO>D;jtJO#o3P8>1_+S|7OV4yPh-dN2mkTC|Jgd4~=~gjQ@bIOOihp4~3FIczBow z9$(f}0>sv?!=ZI8fFm!4MFgDq!|i7d=2suzuA0fg3JCt*0R|I(HwiH52=UuGv>^D! z+2TeF#{|tsqY^S_e##dIPGcEIacvjpFP?!H>TY1;@J%aVslCJVJt24_4Ujp3?)n>K z0}lq+RRGoYuo^CXz!K;_Y_f6*EU^IJ67Egz+E9?~0!|t}iS}RH56J0iFj|h6fwk`l z0U++@U~9#>isHQce-;;BaV${JVrdfVYrRvp$pt*+zl*%Q_CA&4X75yC-S$*ke#nMQ zMads!uLtLo0STR}uKp1hgR99hK_}FSYn%2pejT|sKAmjkyFv#%K1-XwejOAgkub70 zS|a4;<9dv$u(7jk=K4k9NZW+_!ZMu2cI6YS^@f&77}YVx(xA5cLn4?LlPZIBKNbcg z1WL-s9BbuxCgw8Y}MESmPAU z?&w%5;`rKPM;QaXgF?3TX|#wv#l2m+LUsZT|5=b!`|O9%8X=l;*g?xcn`TREDMjg1rYZxla?5$l|H*9ye9*Ho%1^`Sx?S5U#1|w(RjvJ@V3V1VM{b)2Vj9 zGuY($f^Y3#({<&1(WARN9baHen{7L0a_!~uC{tz80Sy%k$sxmZ&HI4Y=sTlcLYhg? za5R+eAnl+uL3;K?`|Js)I??7)F&*oJ&6~|T`5kDJ{XK)wq45=~-yYRfw>sE{)YMas z^SC=0rSW`n+jQHjm7cVNCyZe!2 zZV+*B>cn#8RD^r=uzWd|c?1{pmQDFwU(Gz2NbnEDy~-z&i6uZ>CnV&UOIEZ#8VrNO27UQzvIaG~4VB5=^< ztJj;t)SGTR@hSg~h9vTHZm8|{4PB#;ZoJdjK#g*9Pu(>0km(fE8q70;tBh&#)h}P% ziNR8Q+V9XxanVGRzTI2LMHtud@rQgoguA3H!%49CQ4ZGRvD>NdXkX|FU7*6^BgzeW zRa%F0!~~$2VipUlz}TDwauu>=a&z`rN1|s)LvyEV6A{a}ntg2V$~268w6B)Nf)e7o zoLLaM{f+V1@0ciHL}=DKn~PzyEmO)K+PhP6_FlpVC%O9DiJDg;k+(RvhRFBDt&g19 z=i~g}GrqO0Kgs{j=X0t(dx{w8?)D0k)8@MlA!Q;VGS$G2P%a@^GE z`3z9h@k|dyWnJmEWqQT=SlD#(=u+l&!QCd?>&)iYTMVk-t&YEG4%lcTm){GIY!k}c z?Lir4O~f$(&{|@flu7T0?`NujJ-5T;fl(I+7VKMzs#}lLU8iX!cpt|Yb+MCfnTQ)+ zb0Yb&AOkgRfcDz%!oSIq8IM}kE*whYwG>O#s{b%Du{w0 zsdNa4fP|zp7#IG9n98+XjA!ubY9%{zx>Do>T38g@dMHj*Jk-w*vL_3JuOdO@9$lF@)aT#-HI=}ytu`6ajfY0Wc zkSq*cLA`-3O*!xFznU*Az&1}%Ml^&C&z%HWJxh8z8{J>zauw(3IZwv-fGnIHYpEpO zu4ZCvo6pajVg=dqmy^1gjm~$(5*uwU{GlLgN ztwEc?j8oj(;RVl1IAa1f??*X>9~vyKq*dzQrrMRwqJ4BU0^RNq4LUyykG=fJIO6f_ zRJ=QLsApDs#a8t&sE95m`wrR@@~smY-dlhoK;JlXZ_4x7)!>Gn}%_& z=;HK^8)1&)h|{=vhtk4~Clyu5*Dk4Dm*(L-aZ$45{cH;ML?NZm!zPkSzxT<^4jkz} znAGgDtsOHfJu1}plMHz96lETC!2bJX$FrLAkuPTFe%%=|EEvG_r&QE;D4{Sq^{8-_ z&YR9XYm|7L>y-5YA8!pRuM!FuucI~n67Dh(#GCPYmXUJQtu#JmV3Iv_4(=zIrvaF~|2m0zYyl4l?Cg5`XmRJU)X!c6XM0b}}Q$c|A?ie^P%OsH0`V)Zy1Eg(@S`(3>4 z1nrMWDg;G*HXav;%bl7oBwTn3O}>p+A$Rs6YSZBQp%l(7{n@Q=bxAYl7@uv=Zm2&` z{D6aX(fjoMAk>pkfUm&GRJ)>d?A^X)R=HN?`KN78P-BT;$qqHs$j(=B4E}w>Q6Q~q zves<}a{@t2ZNe7+n#p?MV-kMCix~ggG#`KctJx2fSYiY6h7hvOiJm^9bw?Ps^4ThW z*P&+rzK%b|0zN4ka8KZm*Ps9m3~pY_mBa}Bz3z^T>F@1PEhvsuUjLMh==&J34sSZi zclMYA%D@q-AHe09dmwH`K=%@qPKrD-6n=_gK05mgk@NQaRe0LCa4BX6N?1CMnl7R- zVula6O#Ih9XRZso6fq>AOx=K?V&!f;0wEV@i4tUqD<2lEcq4kk5;pRHyKxI<7O;|X z`Lh>3IM{gEaS=^u=K{oQpOgMkYL%Yz=C3@fE?Kewgky3%)L&#lfSJW2o$$pWhB|wL zf(NHk8&Gu_uZhyC0;Z7A#2>9q1F@#pZbOIbfd- z;}W_w9*}o9;HHQHz%j5Y03&8DCisG1{{ozxL8-U^zuq5G2Hr`Vlq4XR!LmaE1dLVJ>-fWgjGL?7+vj&15Q>mGVJxGXM$eG~JRd(0nfO6=}J@uzB3dydZ!pCv8?V z{8K)=tfUyKOnfSm)7$yh>ZMw&I(zM#xcoxca1}SD`E3e!P>DTdB zcr!@qFvhCzq#cDgAMwesHza$CHRi`Hi33H?b`Cf#bEFn3kSyclT_=}0@uc{wbLc1ueg;K{KH zF`~L49nhOUnH%xBdS?OOPVA?r^ngKBKJqtB)r`wXNKr%`!UJWO{Y+lvBb4LGItWRu zh@w2AuHBh}Be*5Y7D6k4@%__`wgE8(Jo7+uXG=@F=AtKtx}VzqLy+72BF~575Tj-3 z;c_b;)|g^-migzjmMkWHnsl-)YMndhEvxN*aZQ|emM(&HTHnb$B zZ9r`$J0j`Rr|LsQEE84c%c^T<)(!~9@}U_!MZ7}8Sf35!urHD;uBe45g4S}t=Th^* za)My_WMfy{UU7kFtov&f?BC;kf)EOG;`U0%mnT_l#GNEZ01JN()nNM7TNTSG9Lcv5 zv{|^#RYW6uP^`zq@WtT1{jK^?E4|xfUDFH#O<5c}%Z}ZgHJegvniqO1T1r+%gGjP9 zZpL8zsjy$gHrlI2i@zCOG2`Q}bILA*3gBFOmfNOvFYw}vvNUAkm9t8ooGl~HPJDb1 z^QB-kQ;!&%1vm6q?1OIT*lsA;=~$8##M;+UjC@1Y#iWPQD15P1>L#tV;D$+b$xb4E zDAx><jz9OG7R^i^YSx4;4aiwNPV-G+OD+yYG%WGb0_i;ZaH74}2XFA00y%sdGryP!a|<&Y?niGp z3zR7ya$(>(Vb5e5eBqFK=Ape(niaf~iruQ=oN4gw;0=C)jmm5^=$qhKpczq531Bm* zY$E8cZf5?_k!4cdnO#DDvL(;C=*XGqT)}UE|Lf>pfMcY*M1u=O@z?hQTSv;B`=&V9 zIvNR+eG~pE7cCd7H(m6-EQb|$|M+gR6T^>p%jH&`G^;BD#8~9sZ=Uv zq2Al%A17N;VA-i&hqtPb|FM?lRDKgfsbO1wA+4+Z=OaiBK5z2dw%69;W>oUEZtRoL zcS-)arS!5s$Y*NYbk6fJ%*6tsIXkO$N1}_tM{}$q%|wmONq$!V&iZPzsyNc-&3z7S z7kR|^P_Pkm07GEca@O8)`JDZT-il zzZc%1P*q~;t&73s`cw2SPJf*KroLJ&8OSlMrMK_u$L1?{NgVTipR}>G zX5ET0OC+34frcwZ*zF4>h}oU1rxW!GdPVs^F5-Leq{9bPF%djrsAO(yOdXo?{qg}j zo7vfJgHL|fN3gSS!<~=K$}Isqu1{WElsj=f3p=mkc?|t%T4RUppA>ATl(sm9%Lw@X zWa`=E6QhITZt2sT^Op+x_u-sk28O|L7Aw}M{FTim`*}GY?WETn$Y{u_6BYEFOm~!U zQo`sC=;x>w!Iwtm2+t?>-wv^3l(K1TsP8W+h&3(dKCv@UY_}dF|+i68F>V>)ET=&ddJSXq>3hp@tC?Tw{ z;^!Im8Rxd7UsSYeX}Vv%59Ailny={C);e z>UF-=wAa);j`&deo3>0g#SV`JlYK(|j<$WJF6G;a=M<&Awk>|;I%33KqNslAs&dWu zlhDQzD>((O%Sz*eMpn(PgLkWg@1D0~Cvg+CqU`q)llk_d`Rl&~x)sn?sZo4)1d^|X zLyc`dJko4p)->^wHj>|$n`eo(!L4#_)A}g?QVwpkj;vc@l zRvZEDM8Lj*bbf#Ij)w*mQ`$5ROPYj-ayi;`h7>qKGeRzalq`-{e}LA_-RkPK?YL4p z)hR;Pvs(B|u|8m8zeFEmXnCBEM7sa{?5bLFRX8AZ@4wf?1maL$BsMt&0o_*ySd4!u zxq#SXGy(;@P@6$Hqp)b;aIEVk>xHn8aw?UA%vdRUSakgVqIeZ69MYo%6mMRr1g=M= z%#b3jt_rx-l>*Quw6X(|*Qp+09!+ls0k+TFe6v*yVQ;4JlRRxN!MvJ&=nXn_jn4H# z-(qD%C(=G`N5Eh;Ag)6NHu?noF=P}{p@cpdrb3X@A?N{W*0g6&PxZ4j#4Xm2@~rN- zr@Av@L^tHqaiR7^Zc8&U*(yWK2t#}Mb1}aRf)fkkOc0Q@BH=}R{EMT$DbJ49lpVzC z<}EwleoOPjlz9DhxVQuWzE408FwpUVWynR(@Bd4%1B(yI+>t?urQS}z@XyGj26w49 za&SRoJO+cb1;2ds1O$5T@&C>l6aV3c2o^aeh!;>cvbXPl%A&1PYxa(S#pcqSe#Cem z{$9su#Esx#h}+np)vG6Pic4Glo)a8hjkyhOQxQ84dhDr{k-t#?q0&y`ITP-cW}i>(C>^xVm&2 zTeU217Q`nNwI`pk5Fx`~4`g#AQY*$b#9{DTfPd{3O=X9wNQv8u{0L%H5q%Svg)fB= z7f{5^Uk))?Q$$5i4KUrF$s{7ly9o|2(?|q+lx`lwINEEa5tYOWxTb6*4Hui_$ z(BtG-{lkQ&XYS1kNv(=F3+pb!hW7}cFr0TBj{A#}q-;hY?>BU>&|IWBQ zbs!UIym8==it88~yC*LD;Ww2_xm%gX`sl^+EPD*uN8vG5zV#LFi7!OIWST6elua)O zp|!dt6IneeHWk@}o6D~u6A}$<2K$N2W-2?qu>N!%{3H1?SHtp^%9=_ynLAjrd|HNM z=kpKu0loD7T*!u-H_5f)3Qrg#F|sqlBmLd9Ojm^L)Qu${$=kka}iCQ$Gx1C=$~Sx#Q+_4Oi4_ zE{suE@4ps18yom2)t!|YI8qtB%@5;JYwpu&663y0AZ5M(He`jnJjYB$j~9HR*y0=L z-b~6u=6~=O${8z*K9kQ?w&6Uqcs3~py5AX)W*_p-rn`*9Cw{2d@c7Z)Qh%RqQ6OJ2 zT|dN_-z^d6t**rs!n{Cj{2-&GNWD5hn9I`>Y4$?Zgg;681(`v(3)}tO`P``=l>uY7 z@rlaq@vswvJFL~>)!$xlWh{DDUnP$!#b*8_@9anxW;*uZ1L2ef<=@vBe$(le;a9^; zVq5suU#U;EKUJ!3o>n&aOeRcfc2-s*i(RlS7lXwf!?q4$P1d{H%jws3zKj2bcrp$7 zT~vG_zvmyv%jG8WirgaG2r{&@!evGH9ho8jZHmb8&$#&?{D;t0N*amUgh!D{k=BSm zJdEu`PHDyDDQnuwt7q-mCDnE`A0Di`)|d4ETFAj z_!&Jt3nx5fWr+D{p(ugWtSY4i!TZd{Q`X@xTO~Ui*21|gKNe`jNyo|slUs2{b&5hO z_3%dNqwmOQnSA{V>86uK^x5aVSwKjrKIdN7kG%J5smjY~-rvMBpvx41gh9z>^imfQ(iGUY&zYa;^28KUidpcMBRRSGq%iOi*)(HCtkn*f- z-yh4xuS#v`t2(J1yK5I1u}=5>c=e$ul;%%~?ZzgBxki%uRRwm%~IFr7fxd-W~T>8`-JF6|X zv@zB{JGsbk5)|uIPb3AE)PtWsIIMG6^xt%hp|$!NKYFLuvmy;@(q8qp6nCD*$?clt z@meuR8->?I=vw(*5ueU#zn8Q-dP|9%ojFa>YYZSI_G5S}?>9^}l#uEaFyF)G(Rhl+^d4vUB`yf+7FJFIBf2x(Heh)9p4qNqwwN7Mb zb=*VRbq&SspuE-^i^pw4@absbo*jjj6hDUv6@j>2ii}HxC`9i-z07WS3)v>B+9aCl zC>^3r1zjveryq$+v8ulTq!eF%)uY(Y4>O-<8vRlm`oll$8_PocGMt^LZDd962d?cA z%tJzM-03#^jqJN9N0bm7GQaw98)mt)$2EKGwKqLx!9eh){Y8>_z<9mZ zyr8%<>HfaP0iK8DsJ2$cOT?E*!S5!8^(=XBA9p|S!9r}d>|SBv%$BCdb^drf!}h#_ z!AcI#W}Zh_Aj+y=Ns;3%Ih|QQe(W;mshR@&iw`B@&t=|P+w!eXcT$rr-YV2%yni4k zW>);XyB)4Qb|BxX2gw;wo?1d?Bt(PRpwStEX<|L5PDEVTK{!4=?}M4W2N3`@_o`4J zdFKsxmR95cvk5HCEJ)Imn;g6doU$_EYX1t2xIrHg zAjq!k4ku#&n}`yk<@jTOc(b75<_|Lb0{V_e9`+E?#s7s!65W$RCw<%zdGOOoc!#t| zrF-B~P89ei&|_S1!=S|uKrtVud(InRU&Oqo0_S4~x4{$W=@^BlQtzG#j|qbWkrfbc z2gb=3faL@7wVSxL=K4f{h80NVT zvT`5iU&Z}}uwF%D44Va9(Z}g;1B>X_F$I+DN^t`CnEX;Sdx4hrai^T!RuFxQ1M9fd z%3a8*IxiQcZ5&G^@QYH>TG1u7S{IZrRw&^Qmk(@Z0P_OK4*0NDho$@?-w#B7&(!&Ye| zT$;q<4i1C;2iv zr{}3S>dDOfPN_HBNYK>{m_a1Vk=OQw>y~N$V46^J&pMs%#7QWn22!>ZX5_s)lHVp z7qg6ePhqX?f}CxrP&I1}gs+mVV1*MLC+Il@m|DKEqKO#s2b!SicCTW*k;eieuhCwwISv18Q4iC90SYM7T zy@+6YZ2E{$*w2q*T(??r39xWu!o<`+$+k0H6r{i8TOtU9W9K1KUBWWFL7X*0;{r*+ zM2eR^C~403h?NeA_gP6Y3D574z*H5d%~F-nrPOzIP|?v!q5?m1bL_Gd>LjNb8Fhx( zpD`h+L!Q8IKHb!$$f$yrn&k7y&-!U#WX72l5X<@AXSb}l8!Fw!WDDiDqn3EkHHUrky6nkNetNlF6c|^sYWF6r)R|3=7{;_b8iH?(tJzr&lXX$(`T^>y~dEneiX}x!N z(j5=XRB{KapAENPH~pNtG}D%pjeq_|f+I22x{}m*bdQX{*S%{?S12h<8~VheZjquF zcIIkB$c!&42OJ;7q*4SNM&nfm%Ed$cMiZgYOR}m71jEs$S<h3q zRK3y#DY3b@AxJVhJ+pNxww$k#8EnG-Q5M?99n|^#&Zd|Iw0rn^&P1=D7=NE2rfE>B zuOe6qcwW=@%10p%`YoI{%3U?C)uHvh_TmEJ*?aO%IUIlXAD8yKgwP#mmd2!8MNws1Lbs)C*^+9ng8!Zv}y2 zS^90`=1CvPD1KFoE$PzIRP2gIqs2X0!?v}q8x3%$qW7^3U&MQSs(o+td)DXzJPgLJ+81@+7VgYYMqV3y=w88|yqf5Q zeOS|`+iP2uvX5)FEBJJ$XEuUjnw8(GV|KsPpjg)9E|U*giQmcrL;(1=k9`$+1F^V9KaZBT|WBnz8w^@3*6RrucQRQHkuzR)t#t_k84 zu2{GK!LA_q6X48Zedikkg4>&JA8L9u-}_us@B86Q!$DyzYxksGvWVTdY8Zv>vhK0? z`8HJwk?`d2HhTu&W}c0-(a`Sw3BsA;ll8&5+1-3M`Eg3=U)>K+4#ayr?CZ>T!?raa z+%^t1Wmx|ByF_izD%?#g&$Cmw<=X@?3B6-8)fkrtS?G{EnTd?k`#4heoL- zH)V4dPF=By`Nu3LS>>i*%{>aw)DE;NnRnicqw8?lK=JKv%rzv{)HjYjtM7T2(Zk~9 z^8-JZH%fhvKI@}`64_l(<}Cr?KkPS}EpL}qCtL0GZJSHiQzRHZz1Y+(`E^iW9d?Ur zlw9y-(PHp9Uf!-%3vqE3&+~3Jrv>Vw4XTHz+nGSdW44Omsyc8HyRERMbsiAFCCTR_ z?~8xJiP{JsT?m?3y6VftKEa%?$eF98v{hr7Hx*im37Wrx56AGko_H>XmFu4#5FMqQ z3;VBBxW{A8)m^==jyWA&=vONukCbQ;5_nNfKhsv~)A}HWj>jn{t zQe$a*m+5>}qeXE9)xS=UicMxrDy#9S40`QVz8jdy?`Fq!t|c1IUmhz( zs!c3+J*o4!$lm@O%~TIJe1t_lMz{DL>alWA9KP8Em+kzCjeNP^b~AOq9Y(yH?3mlK zazjfH#%id2@6G#^^=VGT>Z9h2(fT|UMrWdey$6ES<3EmdV>1E#4DQA-71uq zMbjVsbAlrN?p?r$eI~lbdat>2(A8LTGLnF@Ll*#mJblp6^yoU<_nO=ojz!cD1I^js z8}fgw(m=Ks#YAKXIy^08SQBX81%!b7Yudc-$lThVL@Y4?+di(5H#DaX&hQc zT|UY+Js;hAGRHltT%!3@GIIj5e2Z{ax4Pm znt+@TPzIF?n!`bqTkxfvYTTuAhg>scAkYLMol2!3A9D|kVpDIC zTJV83%YR-FAg}`>yT^bWM5pRv;xeK!TST6%9O&ZWk4NZ$T>!t#09Mpa$;Bw^3d)WB z0*Oh59w>t$y(BPa_@~H1-9Zqu33~1wGVtGXp}W}el4nB!vfD_qRReS)7sHvS4^c1E ze5TP_g-I0mYho~tuL!ahd7xs}iw-pYU(r{^H8hW|h&J(}3q<*+Uol4tAIT{lq7AK} zK`a%!YC0Q4_{k1{o;CD42fb*7M|o~Vg1>m^tJ|hLjC6%RXSUT_pCeYNmfX}idHh>r z_jbPEL#L5}Z-~iByS|0HTCD{QY2m#beN#hZ?{HgQ->jh0^k=ixkNk<&p`XF)&c_A& z9gRx&R|9-Dv@;&#`5j{?o#UA&jj{<1f7DbjuCe(tiDP8xIz~uPAMUGDTA0HYI7YCp zW|@tEYX?p+N%JTvk^T^G1{znmG%n*6sct~`49qK3E(?^O^O?aP`2*$U4@AY$^qL5s zDeqkVR-MOo?pCi>uyJQuRnn=PXuoCtYBZ1M9+afUO3O){gI&AGu z+PPeJZ~dzD;ACMhuV`*+jm(b9<5RGU-K+aQroR(I)`-Z{= zL;0rpMVL@u5OJMQvrI;+H6lZFrTX$F!~{=B(yx)Hr>_yVwsX;C!cqH z(NyjEXeY!Ryu)v{L~?#0rQ(^kyjm!F!~1l|S9wxmw#0e2dQ;hRmPr}FQKPZqGYq}oDA8%Tg@y~Qjs3P?AivxaAQ)^mHS056& z+z*uIvv?FOC=}wcA=~r?d;STNR6O}IVaVqBvIk5-GnDBrE~ryO6ohlF1U-HAE-mgVz9 zJEihDu1T42Ji@m1-CDb~lryZPEBX8{ zw&55oOYdg z3wb;58zVf2yB8W6n(*=13D527FXZGJzE0|gzx91Rt5F1qBb<`NGxIy;0pt-g4Yiyq z8bYo_GAhFlct*M2BHmmycNM>BElp6>DtOZ}k#vq^IUPvtebz)uo1$>U1OLetc zc4JmYJArpaziCQ?E?@7qDJ%T|+#K8Z6+soQ+qv+>{fZoe6!fI}F^-c%3ukb0WRs(4{l!irp;D*cF zSc{L@eAr#}Cq&Dyglw@A1>P?=yiy-!-PuAF6`D}lQWSjN6OZSPnR0acp>T4#ruUL9 zvPs~jU$_*%|l zx8wi9MOFXoNcni|!5xkkwcsv#_Vz!_455p1eKEoWCi=fRP-QL*$W}6~$=xE&46$&( z=3KfNnpb0SPqvM8v?UlNewQwMhe1Cm^%XCjB)gku56%ZDju=&Xl>Blx zJ1v;=Bb^Rmc~$f4Mf{qyQltO3BqU#w)sL~*#s@=Lu~swkHElMLYg<;kP1HiKqY7X9!4DD)$ZZT<@E5t51=BK*7jKKFJu4_^iw;@uJH!^RR2mu z9h8r=U*e3#nEXFm&|f6!iA>SyU(tRK%xn2#5?aiL4%#4+6NEpN2V>2~ElzY@1x66R z5`qz;(km2?4)g#vipQy6+6YY|zv3&`nHjCgrhDIlfehiB==?io8R64Yg)9kWpsnlp zp?G5`S@@xv_KwyA{=buM9mTtPcUQ>O-NzGtWW%7&2dl0Ou_sI&b-ZeWw3@0kc?I8-z4q5as9q8>v#> z_A-LMWayL3nCW7ElxGpQNynv}THK{Inv7)j`rna@=Ve^P+yMb56Ohox`2m<5Fx@hd z0(Y+D$h8#&tPsur_Qef&OT`K$5kKG@xy9_hcs??ovbWo`J;DSujw*Vd9X~*dugHB? zp?Db-z4uLiLdGKr^t2Tj0is zl{lW#+k|y0X59C}leEFPRwkY_kDaaHYSgyeY!jwM9ms6_c&(Q@C(cqR`r?Mkk8{Kf zy$$Q{k{Ghy*>ttsc*BtHI$B(E=E$#q?s{;Gud943nI>G?j-YaC8_7Hh&M1Yo(>mAnJ@Ah#H6XtH=Rkf-&9(3nB6; zk*T5rk9ygUY!(v%H@k&*j+LuJ?ra_QSy?o&IsTNYMG>P>wsGJNs&RAQ8x#lp;-1P1?Dy{OVlzvaxEqDybx3rN>Z5Gy_F*btYC(IREfsLj15 zie6=(6YF4~ap4-u!!wac(Z!B$RI|b=t1L2aOTi@Glb!FP30h+OVVI(?L4jeW7Kd6j zgds~d;J!%ffihzbwQ3MDK2!YpeB!4pAVo1&7>j2eEviDf^?149ibdv+A3G_G@3vo9W+GypssAhSz*0~Y1xL7ulQ;qq) z+SF4|Dra&PQ8beB{!_cDJIX6@2+3Vw6j_99!h$Zel{0ivG`37~rwD)M){;6q##qxe zPWci3P`3g`new9d$xR!Uif@-mD8(-PNe|ttX_lUnWMe0L=P?PFu05Mb-@=mOmCs$C zo_uFH(Rmv_YWl9^oO~xn`s!wXA?2iZ^!bHYO%UM!-ZRE8xYedT3+M;K77khf-y9be<<$!uG1)3pC$L3k`W4?Gis#Sx6)B# zIGtOln^d_2i;cyT_}N_R5wqO?VjkWlpG1VOZoc`E(D}iq@w%o(gVm;TymSLjJvae2 zjgVqL(U_C=vHk94f^*fxC+E}lF_(pej+6%`5>hDXu7`gicfp*Ubj4Ixd3$wwdc(!H ze+rxT%0BU%fY|31wLNLdpylUn25Z9=599>7#&_KDfuqn@W6spCSRhI7s*mR{1eRZg zVwlB2@fEN%<4<545dvBv$!V!QCTF@S$)0M0#Is+$S3Xv~^s@85yO=7kI;TdPM&iXG zPumJNGd;5Ws!{?8vc5=BPpx4qFn+G_7v8?JI64|}r#|zJ!8^;-SrZ**Nj|yX3&UAm znXgns@aJ^DvXOLuD_$o)8d>&-sV50RU7RDHy;wzQa zX<6J}e!0#^pJ;V4{Bb4rCYzisoi4_9*O{H%FTPKyZd zFqH`1gv7{jMwwQ>jyJN=&Q2W?>#(){Tk%Y1FBPeE&qAJV4W%0dkb#72pBkyGGS>ePB2CG$rpV1n!k6=yH;Q+vfqgrXP{1C0tWMzuyq}G* zQBP>}=R^z9cDy$mgS^i~A*}D*A?HT-OCtt6L6+K(DF(;V7AWq=(#;9^1}ln+&rL5} zRM@%Mzmz9B`$XudmM7@G=DWZASlm3n-rTi_nJ0K>yzcg@6Oq~P5>DUI7U;C>97j}y zdIg1A|b3~&ss7ik#v@1N0{gs`(e$w9%+F=YHS70 zYcq+jsH&XePJC^Wk>YEJ_mfmgWA!C-Go|@tfvj80vy(T*v!?Ve<5c#u-T1(N_OSK_ z#*2;sD0#@#fN?X^hRE4KXJ@5H~d*@n=)urB{b7L$CxNH9i>KKVr>fg!TVv$P>Xv3Z6Em~Vz`ya z+|usd6j`fhqYr3vxEr`w|Hm+@wf3?-XV2jk^_7l?V@cc_jpB>8+qi(Lb-7CRY4`cH^sNi8-e@KwJ zz#RqWxY{;mQ;R}K3Rfjk50|Lz{2;w1#!;Bj+okBy}z9L!w?Jz z*3~(jh3{2)EuuoHd@lS91Mm&sn+|E9_VNGEmdrZ?FmiqVpTS}{FS=$P?Y4*zhp8HZ zT)3A>0CW5wao>L&BH)>LxX=Y%vEGsZv*-*+f>33|JJ$c}fg_bod%H12LLr9MwCBTsy_95P61x#BMq_u45iPIl*wFVN_vR&fUe5!%-LPFexYIH{^XmRW z?9F)ug-M47n-*qvRvEE8!6nR>q@91$a4Rqk*A)Vi%ct6-fVcrUH;sj!^G3pBpMus- z@^%LE@~+AfFG)X%D_w)`YpPQkDCW?_GPr&E6a;)Uv}k!C*hJHs=vw4&1O~<<8UC zM(ZTSK*FDjExHH;(3t=3DX=^{Zx^Ke~XD`1Gx z!{8!l@QijyGhg3982h;tGZ3kiKtq9W#bb(jLbz_p^pla%lHV|+De7lMLd*ZP$3(QwvJ&Yc-RzW{VmN=xalXRth@ts!D4uAGYP(iwl^pI8Ii5v4r=H=LG zkQLl7#3Cqx;Tk@M+*Bb*cQx*{ddMUpI^0$IvPv&!LrY_S*Lo(!)vn}e2Z<0e$(n8b zbI(U_%*%7O_s_iVyvO_Gx4_k2SQAQ z)jAjpMH(*An3}u_wiO>c%p-zrh;*vC!*vTTC)BeCBpI=??hVCpRf7QD^w=0N<|2JY zZ|owWAm%d>V;WK&Wg`SF7VSk0h4eyDI8nUPqli2+P*F_?`UN4;U@;E;>Co6THqu+< z4oLo%5}Ch;T5tWTiRqYYxGdH$D*rSyE(qeDzpHbYBSNZGbp>%zS(+p_V4jI0zNN7+ z1ACx;3qejHR+23F}O6=Vh7_%zLGKtj;5N5AczfojN{o&n>Hys;#u3Ag(>^L;T znjx`%l6}$aIbD}48D^g44M|18Q~L1O)Sp7&YVoFBBjKsWZofj6QIYZ)JB$sR-G#K3phMhl1@HZjjZZ9 ze<*L|n@ms}!SFJQ(d^YA1pk7r6syOZJS-q_^ecXB zo!WhT1Fa69+?s>&B0f|b7;0_9c-*&7&S-|Ycf$A^em^jqAeDHsx{upif7-u?yWZWM z%tH2N@O_9aY9mOo?ZoPXi)ykyxd(D}XzoLP$OBcCBR%3#4Y$5uGV zvgZR|h~WGFn{BPj^9xF~Uz2M*kTB)M)Sx4#KOZYR18y`B2y2(1{z9xpE9xF63XF9z zq*<#+;uw*H5sGdyyK&@X+K={jmxh&DRORV+sS7*gXjbCM$rgA^wm9dVi2aoC=VDy2 zf=5|0ISg(`byMGz^MPAS4*HD39SB>L$urrQS?fm&RUSL18mr6N{9IShwm| zOkCw57>p|;N}+o@o1W6~)06{GWO)S|U4o{*d#gD-y4SU}CS4yoO1do}6n&NP5tZ*T zfE5xFM7XG2())Nm{f$qrB3|OVyUH?TUww1yRl{uJ+pQ-m>|{KvU?-21K-YMPl{^^U zBUNd7Hs3B8+cM9XR@TUCet697VBIKkHc8%;R(Q4$%Y+mEvdLv;x96k&Z#e^o^Q&)B zYSQ~|{`L+lFY5({)*mTY(c~d!!(4+l>_7@j51CNRvV$WJzj(m`NK3Qs$Srxjdo)2i z*h^;oYP`-HfheEa+xu48-iBhL@Yc|&X0W%O$dsgV6Amnqt*#(;af|%1{(`Tw_am|T zGLKz!uE1WtDePOSC%O96juv#UESPDUhY0Ui6y?XGFXJ}wpWIrO?wr6$aV~+ zqm8z%aeC9)?{Mys?)=-EK~EQh4rF$wr;PDjN4qJMnsFU5jtZX!S=X9G{WyRJ%mffy zEIV?Gt6HoqtvYcdJ!xM|;_sY~J*(pD(Z#tmPp;susbD)K$U2~Yo-DPd_Clg-$}vm4 zH7$?fE|s9;_|qn)aVKJ>+RBlq7aRukE^EIB-;q5;!ausJCZu&BzH-pnG}TPc&o}r*9V0j{3yW>%6p` z{W%xs&U2yVTB|$jmAg|o#>Oj+=7k4sBSkagO0N2Cf^9;bOjOSSk=ZM8(R>CQFl&eO*xx-k*<1hIEx9hEExxd4umL;_e4f=J|BGc@I{XD8n5we5v;xUm2K-YU?(?MDcdkf8Z&G)EDWn;-aqmE?2Bl0b(Uk^&hVY~uAG6I`8#`{u5rNyzZM zRP63cIS~MRvOMcf5#EhQ|Fdq3(pJv49Thk>?fr#dUwq2f_9PxFngN96Ce=1BB+nY1 z+j0r#ckeh~6GBozSkc*v*G6wN$6eB+WX?qBN@3{fsUhZ}28RoS> z5alg)r6RaK8i!1UT^aB%yuo*T4NAg(4$5 z*H97CgbsTKD#$tb%?q@>MR@Fr@NQTVimUA+7_DM`6600|0Ziav*kXQc;yLBB>i(7GIy8NA&f-qa>4Di5^~ zG{bOJwP$gkuz=7pgEs&rGG?ALFoP(6)}a(7?d+fJiboa?zLD$l8s8Co8dc+SN5XYy z=>=K1lngOITf)-!+->$`Ufdil{3R9WR@n4-O=0(7*#g#HL39PV`!aVX+fwNBfu{N& zc*}(fmV*{Q7r0Y?vrn_AKx6v3V(320wZje-v0f?#xzjV!8Y!!MRsPWX;%yGCbIutb z5p^+(W~)xiBLNjuEz}X7PW!qmNQX2wMncvxl`m*Z8u@B6+rud6v4PmdS*kIdL#1-2 zTd_-8L}UeFq|*DcoGVaCjEK$;aEq8eA~~eEt1p9~jI`1>S+5roKU!zLP|MS8)XgNv zbGq%DV`}POh`wVL(z2OEH+Uj5bLrqD$Q#+s-=o38Yd-W$s#Z2El0 zceB)`j&n?gdUv|In{HK9yi&Hj*V<4`NN5Io^chCbulzzzyG%TalM+=VzVHG^V!B|p z?*5Z4t)F7z0<97E7OZm?2m?8k*`Ym?(H~%l^7|~qR!efCD!B00v|!)oJS4O3^tMsh{fbU_Y6~rC-i_Ej=~P-YnpLkWHJalX*9~ zx2B+*^0GZ5BUOx@?dx9gMD5@RD=`;NUkpwL6`fur8^1}y5~IAB22;{cSEuFlWHxMT z4a5^TPiTPj>laJgo;esvLGI3>E(H7M-d2saDfwnfWmuP@3f$&XTcXgSgxr z3QycMw>R%2bb~Xg>Z}8bZPYL|e2>=-i>qbg$!)_~NTy+>mcnf7aPkKMB}OvD57Z*% zgSrm3^Y<@N=Oa60;k7nQk$%58L~e+eoVuV^uV|2sb~6!;y4Ws#!9z*x{Up{cX@JoA z7OfgFe!8OIzrHP#@cz5No{nE)zp+DMLfBI&DXA+tnU^Rco`0RUYV3G$i!r0x~!ZKOgT3ZM*`jp>wt%}vpgXNBn z*V@T}h{o;2j>FR3G}2-`ttJTSZ+Gmwdz4rku{?gCA?# z!*sqEVWW3ZLNr;g*I!l_-mCB2Yv94F`2Way?|3TM|9||bP$H?LWTc3Uka1*>WY6Q6 z$11Xpy|PzIIvLpL4gJoNvg>tr2bxJ7 zo36LSXKv-bs@Bm&Cz5*&+8{JPgdqd(6Vq^q4Sy`FHd73AuXGr|EQ^R2SQ`CCOWH8C z%if_+GHayEj6K|rG|%$ri|$E^HR-Lpkupw0y>`;!&N%v0Rez_LXEP@L(Hob;on;T1 z6G0Hj=X0x8QSa3gYhv;Hf~JJ35f?*N1T>%eZ}6 zpQ~W|gvCz#n&aYA?hL+gw0+523nTkV&Yy2(KGGE@n}W?Zqr_eg zdegT)q4n<4wAWpU!gPG;rBAsXZN|N?DloKjnC8o)l2lc2xfdtx5t8&~FI_IeG5qeG zk#`4Q^a|N^xs#5Cf`@t0<=r(rPQ42!URf?dAH^4@e1UE*V>4@f8pXdAI^0f<+Zoj6 zs}x20lJI-s$APf#!OhcGRtlwFJifECc7Gs1YStTKX;x@W3Xb|up({53R-gm^u}|VM zUM+{gcRT^MO#{F~XObwEdq`FmF!=%db|)({9V`*}*^K8a&$M1;$3}pNM1{f5JQ7gI zvTwcy8KMJ+%&$%*P!@{I25krkY?+!oN9CqBYT*#rTLN&6nj8T8(H&IbdJ2ZO8XP$X z_{XC`7!w`@+RgoW&jmUOei9e{e_fgXz%J32EZxAMG0qEyvRk16<2%LTFCP=uhqEJr zz{Zt$1WHh!=G$txfouE&NkuR0avfe&+=UJNG#9G>#}~l}B9AXM%HR zWs;ZXQzL{}tN$JUUHGYhpX2yaE%35{Vk>Si!d)IgSI$T|@a&EM(xa@^vq>0Rw^Xvr zzPp5ZiC`~f8>;>Tk%ehFZTFtHEc-Qp@)PPqgI5oa=}_L2ozERlAvk0qpiWRh0S5>k z=z&WErCho{7*79fJTJi`1A&$rBx6anP|^Fe;@<@0`qYaxwCYP}liQY4xdeHZJAEq1 zGcpkm+{k2hoy~7&YY;UK_!(`H^4>p?&W1k_NRgYb;*`61az%P}N)>P=Grkc-Q0XV{kmPaXaBHu(`qPt#bHZ32o zc%_~U^%byUee+I3EtDa_ZIvS!ED6ozK<|UE4fQUER|j_6q8BtttLR;!&2>6_e;~|U zpHOI7MzSr}jI8&EF0~A%)0SF7W#Jm{Zi>H1xvSrNBMh3XcRSiW!v@E?YQ0p!=6*h| zdu!AMd#BQD70GU_ij00>tU8xNg?f@{s%TTP89JCOQTPVUx8kH$9Vq58JeeD!K$5cN zJ6HAz;p+;s>k8hH&WDSlN#h)S%F4)$&Ac&)Z9?X27qmmvlxJJ?i&ll{#Px!XbQ`-No8OlU6H zQLntqyrNt6Pr~ON?E3mKFaAJwH7Y+IMntPbLm$S=1-pnU6W-+e=`+Cm2Xbg~Qye+@ z5l(v{d~h)pO#y{B-b4%+He7t4(~D!3b9l=UZw^qNosTlqOrQBi}}XS{FYa} z%xxLYEUi+grk2a5U?wdpvl5`Lv!Y@d6qqfk8%@#5tCfy?t{7QSkgn0%e=nRvC4AmV z{%T`Bg>%6IBOF~ePszYl$WG$_k~Ca(bZj#W%QLhF)v6NHHGZ<1K$&Kh)az2O&jm0LDu|SKDb-p`JbB$I8@irCEed&b zS;?XWr8OJB=%myQrx-bx-yMIhprJdO<|#UZC!Yv9Ill&b_RT}X?&f(u0z*xB;!Ymo zYpocvFUmU1axveRcq%`rg1ej@T2mS^nZwmuEIKqBb4y|EaNwoYP~s!9Np1SsLXlgF z#T|>}!xdSaf!780ru>dAp}tp-hj{O=@42c}=lV4{>BU_e6FT|1*0`+nwBx;dW9~vo z`rU?w_+>2w5vMAH-yO-;HC1>ZOAEsrY1U?X&Xe8?@9)Rk@m#6TOP6b`TJ6hQ%eQu# z2o!%~3X6$X zinCBOwCgV&O8RS9hAV=bC=?TB0)N`PiobjBC=4|oBZZ4=YgpDfz4HpWLOu^lYVNy< z8(MaV$J>%r9*-5psf_ps|M29~s??pI&UnGvV9Lt8C{q;Hq$bTEM~>((Kn*Lrk3g3f z*jK*pTtE)Y3wHgi`qJO+MAX-;RTae^u4K7gd0ZYVguK}?7}4G;&pGR)z5YP0r3DqH z;zEb|14-l#)|O^@JWe~1P;K<2JY->v{RgiB;lf+D5)`!ru{t+8K(6xbIz8!In{~T;Wk$hcezA&g%WaH~N+1D4WSgMIj`>WR`pY6LA+gFtY{(&gelqOipO7+*N z=qN}38g|4TB%-%VMqOkqi*mFsLqQl}?`U6fBI@d4_cuOK_I{*vG-LH^N(5bg+a2*b z$Roq()!Sr2lRu9yn?vETJS9|ByZqK%d)8hj-$#nwd=!;^o3<<~^_1&Rn2Gm1e%F2( z?q7pVcySM1Iec(0!90GuDe}YwoLcp|g=i_l*sB+6GI`vbG#mPgG&V}T14Nq*f7g09 ze62`|n8ab*c2s<`UKr7ok*~q+X7!$HR5>h6x6Fu!INm1v5bn%HfeL*=<3Me`zq`$y5QD>Qtsx76fic4v^d z_d+Em!s?ZV%R6O4*0DTq?hb^n8k%l?`O={_^hHlmPe*V!Y10 zMSH`ua3jHXJ8?GK;APCd2;6aE&h+>eE4A~>)F3qtZ#M)82DtFo!wEObI)gA$FPU!a z!ZeSDfNn}+kW@MyZKZa%Ls2RHrTm&lN}=AM_}m`(J|UuV^>W* z!xl3qUZS%2seNXY{CBpVDI5Si=&%$XPTzvblb`gi8AFoj<9hPJa%ot2=+ zg2t*$(2t-C=bBb66xznwosjt5QXI!jS%R!BiHocq%1~+$LEO$lume}NErS$-I(4`N z-Bm!-UHk)a{2-35j69W)!Zqpd%1iysE=Ib*@BX{4$j!V6uL0&&ASm)vFGeb`uz271 zQ0iB^fZbOnQwCs$^zk56u51&&m{BCx0 zI%J=%@nnNfw!@+%T{nvHc)VsVOCwN3|AM$1^^_dkdj7?VhnD?Y$5?h=7gn#)49WfL zh5TRI7O&v^a=(k2ez||_Qa52zHqJIjv(Bo}Aw|eB(q;CGOlf-NMHFsZRs!{=DkC+Y zKX)<`{&|Hv1z8c1+4<~U>O98GkzJ8ZW^y+->yy`-lv=x2nQa^)Q7RpzQJ1V!cc)o(#L8?U_BuwW= zhj#|^zqr3)7XAG0H{E;>gWD6dwA9@x%8B$-(Tx3}GD>FgW+Q5&aJ?*)yo(Kk{Xvmk zhg;~d619&WWv1OT$88z~&FzIxsH|@%xRvhhWX3AQ_-2>(L&xiU-tu{!pQ42fo-|oq zu@o~Hy2g^-1dSHShtH;A((g)hvNTJ2Uc!GOyrfW8_IIy*+;_tFPJ%qUkdomwh0TV< z1&Xpt0@X>%3_rpGSkS>EuU-_9%y z{4PZPNdO9|aNoX{baY=KxyzBX<)DZ19QpJ;QNP8a+);jXxAfO=X@%%(8dx#TQx;O3+OOy(^3-S*^`FXra)%n7-0CeAOWySEX+}&!;y(%-gL`HgZ9F zGE2(IFivntEe!8e$hwIQsd!r7E+ghn#0J2tI)-1Bcu?nv_=-U+sm5pJ=nVlSxhe*w!Fi4I1^W)tq>h3lyKMJwd5`!P!?`@$MmDYpsegfw$6v)A}u4yI1OPshjOnAJ#k z)W2)rHi($!iLkNz&R5R3z;{D-@WIPnHz7H-*XUtR76mDVQ8Qtm3BVsB3TnBB1kn^_khy<=bWqBBe_LYYOA~ zrN0VJs#e&0cWIt`%07;VeKneJS6MAR$S0Md51*VN*Hx7fYd1>duoP4e7%qLV7h3L+ z`9&)#D=kT9Dq;LyvdSgYm{m{8i=+9q1!I4W*&_Bjdvk9OXbEjz3mH;qa(Qi6*SL!G z4P!mPt|?NV3^Uf9r?;f(*($u3!1Ai!Eq!q2z`iqs`8=kF@+LBYR1~YFG#6nQOg>qx zabQ=VJ0T&mzrxp#EdOL^CJeX8%X+h%c;fVaxHS2kcWmuG)0ZvwY#(z5N{+dQX+C4x^l4 zEc`Z7aH9+U8#fq!agsi={>3z1?Z;z}nYgI9+^`yRj;5BBWqzbq3R6wX-oxZzWMXH*e;*{Om z#RQ|7l!%%cD*cw*`S*JoDVq$S%Ce$Ty=@s+5HSbw0Y!S@(?hDKVmk;Q#t$~A89PZ- z1~}MzuqXRo7gb>EmEIr?JBaviQ%LyVy+LER>6vm`ZnmsiGrq+~qS0~?kR56OMgW~k zggFSyvD73PfQ#di5B!8!Nc%#Re`<^)n905DGq;$7{)VIMj-$fM+Ld^cb?k^P{oxJLx5|{S zColf<4epm3(PE%O9*|OxaO;1{oY~|~z-=3d1^Lc8ylB|z)aC%}Myrh7eitD{T9!!^ z-(XHkmBl@DB=os@@7X#cW0C$+3N#QafgbR_GfV@YBK8k?a7H2^K-TWFT!PUqs^-fr zNFD(8C~e9}!@{5h9$-DtOu;?N=Wke9shjc6Jty)vl2s7{2#zCG9+uWTh+VC^H0ZYk zk>>bq!Gu~mE#&eU(r^waTENP+7!1mdE@MD;D@c{C%ECh|nS7up>c4B*@QJcaGe;|+ z1wbR#Xcb=(u6jyh;*#S_2!Sb+TBfH+Tsr%HaeM+WK(Q^$2zoy|rIGKGJ=MZBocO&t z4*bBTfN#yxkgLYG4uHNc%d+@XLX$3VLnL4X~^>xr0>SbPtV=ljd{~j zY2y0=u+p%p@Zk@;RPhuovnZzZz~kr#VMp?N%Sgvks*2$Usujx9>BX57{XufrC$c|W z;g!ywuerBSa&hi%8`>S6U-T~7-QI{QH!AgyrW1PZvZ2ZFnBG2rQ~oW2V>hQQ?b>9g zjzX*2(O}4JcCEcWr==@_xgU*#zUqG!7E>BjCXYYSbkJt4NF6IVKo+Sjvgu3C2Pd^G z!y6qe!j3r**#R~yO8OycBG{qAT47N4%3tS^h+6TXyqiw|0OSARP#ol za$U}{@|GzGz3uE+@Efj93Ps9xu}!IjQYq~0l)2MSXGW^Tlgo&|rY#VR;P^c4td}`I zX!|MJwww5>V*zW}?b|i(O4Vq`?5keonl0HYQ!kmso5JB!I#`+vWINm>xKjd|C4Uin zuhL~D`U-WrOu)$(kAV@(RrqW$OwvLN8dVm|dgBpzkFuQk5%IsBtYyDo!neyHciOP( zyiDJkPUwBo4eK-$>>EXU5E9q*AC9#gmGq~5cwJ=Lwv4g<1F3)iIEfwA4GZLxD8GaB zhbUd)R>-;E^(#rVi;?y`+6!{Mvi$u0$}nzX+u|;y#%x^O;9IqGx!5QNC4+K?aCOvc zEZhlRj4Zh^E+HsI5-qf?B!!75=z4B>?aOVp=dg3Q@$g$#VkT}+%F?snLN(MheqGr_ zcdI{o>j=qC3P`DiOC}3z7TAmVlt*P6ai(TuDTFU(Jh9pJnHB+6V^1+Rk?B;SjJEe8fE^NAVZqVswZ{-C~)yrBHth56ZgW2Dwh+#BS40F*rPCOkFB;G4s zHLr<(4@~3a4yjA+V6{}L(GTLioX^AH;i0*vBXpEjLf_9la)z0fUv@{h9TMzPCSVPl zX-(hs^q~5g9pe81$HCXHfzsLO&$tGnXuUhXdD_v9Awr_PUv z?RUT0%Gu0@?Jdy`ZBei$*m$)R^=T~BzvrGQ3q$oBO9*zDr6$X1^43SBaBy=QSLLyMk*cD9 zFrX!mcq``Xi!72@;>2a^KSPHr#7dB5&X$gi(tW|SxX`9`I%`#WnRNCH7rMvad9&PK z?e^%(8zA@LE$+Yw5_emmI`;B;sn@3y)96AR3>kwc$aWM`#ark4R5fSuGBR$J8Hxl1za$0-{m zDENn}La+buhLW36Jj1*<+dIz}SdK*t(`kV@Os+gfTcXEXJFeK*!qv+L=CAFxj_*yN z7q}QLY*jpj=IIp@RFY<^Xpl7@%98{WtI!Gsb4cR^;}w6E*9m|s~;ALS$!Z9UsnCp z3>@GtooX)HD|4#t5!KT1Z{PSi^|{$Y0696Lv|Xa%-20;_s!8yj>toqfbzS}XR0$tS`D!k z6HNJe6aqPXCI>H9+uvC`TGKV#d(^d>Z_A7bEWyfW$HryZlJX;6x3AmUJM~xRE9%j? zxmh}rO)S~G?OuObFD#k3>_fjDtn^UKYb4pi-aA86j{IKo&`%$}fprcMak9qnh?}%o z=I2r4Wue4hg%T_K+w9lMs(-Ry@mw6Isan;_iR|j>s3=(we(pRmTpATWM8){%Ya}jx z?@_nIReEfC+Hj<4yUXH3Uxc&?M|a$>(1a$Vtqb71?eF_jrp!wCf4@Qvf35$5woLOF zxVj>JHW=|TQFjt2kfUy%V`L7*lFLI4yo5SdkZ1q+~kJTevYqo@hX z1su$&$OLY$AY){c5{rj7J{*-pY%FHBXn+Ev$Wnhe2M91O`Ocu0osAC3rhG^EicG*m zzkdb7u`nceLoBHAfhUq0Qpocr^^Mje;~Z- zU<0Fk@(<%9Dft)V(C`CSNu9`BENrrZ3m=iBDx|)hh4uMv}`09(i6>;XOfVm%kYa+v8)!V zP+jbet7M`qW{Wk9*RL4sq(hhaf6e9QrpJO#z7DPp73#Ov6z@Q*z(fkSSP%cSkXc4u zWen>jnirZZS+c_97hDT3JIWH)HSQL?gtOgMcmLjtjm=6Pi`ek;7G+)G?bQm0*7w80 zmhvC6$q%PD?qqw-tq&(=Zr|v<+R*+2{dUdy$IyuAs@RI2e?PXsN$zC5puME3IA?-1 zEOF@mFhR<~+ZW`hfM3N6L$dyJqHOnX_A)|I6=_ResVsS&1YVIE-(|LihO&tnp>rQ@ zs9U5{vQ0g);{2h5&T9sGS5`yDU|W3b* zfz~C5WrpjRkHAhPM1I?_EV=~87A$+-0-N+9IXhj7!+mVFKw`9D^btkXP*(UGB&1gt zr4bvhn`}vU1*Ma1^bD5Q4%yA7ba)M409duiN`U{<78u=v{n0i#4(iMkQ-F6A3em=)A56!B^ z7aYMPf!^ycoO^EVusVAvWHBM08)b3ltqF2g` zXq#60W;w=Z8e;GQx#gM^XavDN)}MDO_gU#d?k!7Bo!jnvSq-eP>aB{B$M>XmR@kze z#UJK;ofVH_QsvCLRr$LhbW8fgO<-rYpfD~nG`eQa(!O5bE^KDdSE#K%L`$l4-G!)# zS)KmIq*H&~>H>~j0oV4_#`qt@`{los3R>=!&_dkZW0K^+|xGlttC`@{=qyDE$B_1Tmh zBfPhqMaU(8`p#>Hs+$kDFJyG87H3&?xal_~#JqUE=TRz4)TBsx%$ML_Ao39V-Aiky z&)H}OS0fdW7+~-yG|T&O--ECDCB%@Slna)z*Dc`f*UwW1 z%+~6D8kc+Vd8crW?8+5a)VRE#>4$7bo#a>yb3e;SND|d){@_T2b;f z-%0<_CCb>6MPVlNf^3-EY}+pvfxGXYCYaitxHo)3PacfjjGlc5>-Oyh`1!m%OA#t> zz+%0r0~4id)MS2o4@eWw?C7CZyiF-vL;-(wp?zuAh)Gu@HyYa8;=&yW!g5$y2-+>W zc=^m;$}R>ESY+QF%itTwhdF{HG`{{0gEZd6%RZs;*&z0fdo}^zo~YlC%?8F5dN41$ zI3Q5gX6V_On;XO&0S4ymZ(>@37l@=7liY#txt13{?L_5MmkOSmPB7&UihxQ)*oz`TO@(x*gM#Rw=bS(L9h^vr781A@Os$PxCQ>aI0j^q#75oae37T2VmXIe$do0dhtY{=81_^HYHQJQdf(M(w^N%7 zOTTm2FeBbwV{`pfO4}D)1p^35%deS@lqHF)X*nf_WZa$u6YJEM81PhxlVS}ZQD}0z zEz4H^lUaZR>ZSi=qDuWhJ~0SL79i>b%38BPJoUhGZUKv%(oQ^CEI8Xh2E6xDiOgca zUH!Yy38ma*h*y2Lt_k@D9S=WUJ0p?)V_1kRviEcT!s-9=AK>%3oTEn78u9w<`$vt6 zE~gcK)KeBc(6Ig7H3`CV=znD(?|c73E;PgDr%V*5;=>=vcVYErzO$P2b0;Csde4!7 zw#QUpl$T&ZfPQeo|19%ecmI*zlB>>U^8KtGxSg4*)huWjuL6bap=?(WN}v-NyhT7t zsGtgH8VBNGBFoT6rZ0X=i=l~}ZYq9sl^V}17121FClWmA>)p@WbGdqej%l73%>DrW zA0Tl;uMD>cO6%kw4LmA&KNJ|Yn77GJ6Pl>SQ`)cP}h9@_mD+)GEspMAGD$$pFz^OWYUr zI~G@yEw=guE+aIQo3<4r)vE(dF!Cl+LvGlT?iH&|&9*ddQ2th_`aL(1^mhY?o{xI| zhuM!&g32a5m(-|3>I!VOhGP)ufY{^2VMjC@Xa&GL6TUq!%cq~mYSD{Qf1MU=57i}4b%gibF zhz$0TOG=R05~^A!h}o8fKk0uom7j0da#?~@_FU|Po@T~x9Vf7RaJqQ5p=(rmzlc~x znsAe+Kn24!$eqozz2&frJ@+JX;qd0FiY~2&j!D?Es$^K43znecp>J#&_PcdbZ8ha( zW*NDq@fa=^Z_j>O<;%v7PTJ{SBpq+-+4|*mJDe;q!ymO0uRSMeERQHF%v^>uA`Hk2 zMTvxmo{KZDgg@^x>-w(mf9gGCViyOJ$tbl5lB3gXi^HQ(U(|(uT=NvzN|2pi!;JSc z=%4Oe$c>?R0eB5QOu{qS_r{(FGDgy{+1I7lvN5k#~#~u{C`)*lSJTZh@(+ zh_h)v+s{u%FpF)KJTpb>1f(x5eq(3XEqAR}H9VcX7G zUAbA;iB1*$v+7jpQriUcO4@El6UR~ql!}MwHN?w}`>46W9_v0-`&RpyI=9uq|AEzw z{aCwhZ}(>Yqh_YVx8I$qPRos_rNb|a^#VCUn*n!tkHCCv35Fvb3c{_$v?x=52} zt6Pi0FLR}~hT?Lq7^=7%rq7TvPgE{07`F9uC0LaL=YP4Dr@mK4aeobaz6K{h*{)HW ztM|fl6kA(7b1zjy;7G)~w~rZ8ThVUvo{9Nm_KpFAx!R1)O1efW^R{R666A53*mT zr7JX1Q*dq~YHecr)sqU|SvK{=21n^#!P|p_AsO$F2V&PTgROlvKt?F17}ssfAmFgN zq50Ii_xw)>#LxarTjD40pRHW{k`^v2aia0{)2j!L^BV6-83&b{FnUh!Q9-O7jVBg8 z$1q0Hr4iV9T6>QHW+|PyWjznw)Be7Bpx=*)Sz_%$eQ`oq-t>Joc(iB+BbsVDM(w{R+N^^!ZwFQvd^q$){wyX{B^nx6;J%)O1N4VhD(MXcfYo5+hE{`1!J>5V$_6}M>C2#ij zU7DB(*A5q0ndm^E*fx{S-7uU{H*24G_X|#L=~q^cB;QsW`V-!~s$v;~dS;!-#(3E= zf;@O7+Sx|&o##;+;y@|vk6gG6%`c$4Wd3N}y@NtNtANyc2fMisA-TsSTphi*z-v8z>13j+#9 z&>wsz&pd}GVa_HmH6areax(Dm+52qmkW?STJ7mwV`|O`w93;v~+3;ab1%71wJ*rb9 zA;~?sr(pLuI$#Tl2aR?^I9Z$*l;AOtqEe@0Z5u}FrT-hre?<>x3e7XE$GPH7A4+T% z*d1zo>;6F6Kk|;OuxkT<1e|{G4}=Xe0hE{Xk3cO;kvSaTEMva-r9+t%G}CMWZL0n> zV72H!0?~(W5+OyQ=%*jqTmVD}1omTT5K{x5#8pHHlaL?H-|>$xQ2w9i``=|rMajF0 z;}NeH{Wv90v-5lQS3I4LOVw2Of3k%BcO#b63otefnJk5LNw8-qEJkFWy=d?I&(sw7 z2yR7Do_N#X}t+=LarLNXWs&apCn{(4hm?4;!^B znJ5tK0}SOXEa5`bCLrwGnQ!=b5K=~B!`6HLSY53JZEHawEf&YJp$=!*%|WmNXLF{l z2OMLo2O4L*6}W^NTRgs$#*#P<(rPP)G}$;-!f}}2p?>90Dytp#%V19S$aw| zr(s(Z=|d>%;(F}oIgAumxNOwbHMk#WWsPY;*|4_0V$N?rYhu zho`%e98O9<{o1MHF)mMS+F`lCT;%^1blpg_U5gI6FTwh58;Gx~VYURXj)pYo>vk#g z&4~{AQx45XRuv>v?XI*wa?NMI-MX#*z{VeA(`YPR=j*kfc|q&LVgH72wKnxce<5;$ z?dx?LJspj(S_DJ-^FwHxjfSW-tRa1nXCiqwt~2F+5o^c|cImX1--BHA$1vJv$7pW3 z60gI2vfC_h*@x#yH9Fwt(Aqr3w~kYr+QyMtreB9pmjFc~()?tmGCbJDk#IUX+U%Eo z24+yJzJb(aavVde!;~&{F6OvAj4wBV&1IUl(B|kY&6fm zT7Yg<;mZ`oKIcl`K*5u?N>nhq*8FK-SY36ODeHyo0&_)Db$XBXhO*H^$^li9%v4;r z`+lBKbZrLjFI~pHHQlYqOA{s$i9mi{u2ICS_F5UW!e#Ba85kUfTH3u8$H>1KrmrC* zt7OLzGKe<9_*G^s_<{YC;63eC-B|5Z9r+Ct>n)Y!Z-5F&veO`ZiMX@$OGeOO# zOYfFr5={^0?ZV9G0*i9ypQx|ePm@)|qMR&PpVVbsic~%%RtQ*o7+zL-s>xFv-)FgE z!cvr;yOUF3OI|L>(1MIzxP+8ZVZIhog^s>IHX4i$F+GpXt{=a@so64pKf&NqAIbSo z87T*-{FxA(h3C(pZ!4b=hK^=rmG)V>H0Jdh$4HZnK{CgL(_Q#YKC%AqYkXttRkNk{ zlN_3yG?5#`$(HY?__gLbsbGeSu$g@ibY^UFqDF^PbvOeOpV8BYD4*TB-0oJYp( z2vIQEVbe0BkddQ2Kk2*61})VJhqR; zeto?D%h}x2n2tfVqL!9R)C%Pt@xIYxw@9!1d6l+IvyF~{aCYy>urmtFDW&jXMbbly zJ*D=QD2mK+`nstVpWSv!1M(4J*4w^5qgBmaD=lg@`zc|~?%Q(=*M_JlNC1b)9=MyP z!g~L(7sN^DPW}GzcK%^oUt=@M%~X>ab4gg7vRzk^tv#6j0`g@5n1f4c7N!4;TuOzWuREl{i|m!Hv;@3~@j zFg*85JK-`XFM8hYxt8#kUF?aID|4D#7|o-Z#nR}HL1FuOf=MCI=s1xBbwAg?hF1_; z*S+I2a$P!Q)Sr-t)qif8ETqx<^~JslCekP%+QWA6)n5b-q2FF?IHKuOKB#AupH+Ne z+hAgZBl}q_R{X8UmF$Ei`1i(%f9gME2)lSw!+*F$Z<@9KOTc}oJ_OSOFVMIECdR}6 zPTBuXb?}+APhJ9lYW+W89)R+JpymDyZ$PI2$t@`8xURb2a9xcW<6D1#dDVN)46Q&2 zAwrWu3GjjmIeKJ$?zRY}%mB_UAM+M>0wquZGyir*jz0a)n}0fg|L5RMfMLmmUgMww zK!csx3A;9khlZ0M_nhRjm-`5*U&vY{Bt1=J3Mz!A{fiMn)(Q#3!#9n_}x@nh^_`g^0lH~;|_ zv2K=*Mc@n|GC0|)Oa$iMaobLI%f1D{A&3$DKO_U+_zR%_aRBZN05}8e55($b;ODr$ z!8M#&gO_zS@3$NeF|{1ELu@z&GIL&}5^+z+59Ojzz2^tj`=lYvpk?-KdEqY*97sEA z*n)-5xPK}yc?OI~2cL>hLQDj4KaK{YfE&6G12U%>`g{Ma8@9yPZQuir{qRp4|KZ`x z_w9Ia=ada>1`t-Qh-g3sW$~vdp&*)kzqXZ-hPzB4LOV140@bwHxkX=im!Frk#N88Qr?kkbPuZ0CS3o$<#%;za#rMh2Lbx~j3w0e=HIPMP z8RyuM>aNTVy<^?RS+a-R@VmGvHtG#Q0Fq>M8@?7rJ&Lut_WoP@%I&n|1(W?e?brvV zv-u*yII9R34dowl7`>1s`|JmClysC)nO!E7&yK67l$|gN>^H0^z=kTB3X&1o5f*2f z2w!+bun8YlVUPg!%H7rcI9HrkPm6-jVMEj?Qn$h?ZVtY>NIgng^?3(-PRl!dgKvsc zoO^l^yix5vG#=f;=&TKZx`bz9n#-zDWS1SHC~cYY)a3mu3hz}F%(HwgD><*^#`{=_ z?Mb|{Br^Io36`TART}`W!RAJzLptT3!ZhdDtQ>WKjq{ZTW}9l=vfv>95rvb6sgfGc zS9Q%enzVwHN0bk)?_i_cWv>?wgvvF$An)0(v%l-V*WHQP5D^a*+blwT6ng4XqglIe z+H5zf$6}w6a5+wKx|#nrD@y(WjkAyhV_(25(?ka`21&0*2m zmrU!WLR(Y`x6EJ)bFt$TeuZs&_fJZ3?EHJyX_^Mf)zB;`OLOZYEJ4onxD&gBoZU^( zneB<%I%TM(GnC7m>uw57)TSxcceeo9Wa=nJt0d?2qtc)erU;(NLMK=4C&^ZNhSk#> z+vdsTZH6kYBT9^&l%{De>m|6A5L@18nL=N__3@RsCmIxSb3(|Rg&TJDvtKj4`p+PqS% zjm&VsvRyH()(g>`JQ|`YgqL(#QVEjF6{_TUYtujK(%q+?CZB0`x-7b|=au@IBw|LX z2D3&H9lF_NM=SoqgssimvZFYpWvQn>{dA`1@lZm(4ld}IbF)U}lZBE2%*^QLFK*Re zr{3whtMpZAMi1Ja^ByizE}~=N3_x$35PVPa{ANfq1WUM_pb@5Y%WeM7^;0KpT9JFE zA_me}%y>eCmcCjb6Ee%;uiX+ht&lxc;l?g%9SVj6+R>QbdqLO)- zGrwcuRN&;v=7>mxN12E?qpbZ;59KjHx0vo_+AqMJ~Go<<;_+BvFPP59y(hkP{X;L=bRe5 zMEQIu_YKXgDvgHl3k}SU1X$xp@n#jV?S~5v(jh@=rc|5qb|it92Vk_S+gomhIv0p| znrk$+-td;p`%)Y0c)=}#B{2F5r5=_FyX;*Df~Q_8!ST*+}uE5tD1%U zNWfM92pkxJGXx*WAOYqMQUSOM{;5LX5NkOVy8%ka@a3-ObWitZQPug^aT{Mj$E)A9 zvlF&VX6mIi-(iwUuvZl0<)733KufXvL5+~6_~5|9BF6wQ82BtR{C$%_%kY|te;@Ab zsQri!j)rKSa%G`Lee>SnT23`1>deZmeTN!P=kP$nD5!T8b^%5at?GoCgVWg48u}#z z{l4aYHIjz!Pj+kK?zF1 zUU%m}94t_pp?@IWr`Z(`eCO$jan9oHB{LfhgM(3kQ__%A8-z=c<(LH{04bBNlwC_7f+mO}%*H zgizLq$~gYPYbnWzZ-`147ujQ@!nLBC1y!LVFt7B*!7zce%+?8bbz5eEdpTEBG?~Fm zO{#(g*gajYE`8?NC+XIV0qSOX6TwW%$?P@P1WoDWp}$cfeIm0tx?;Ps`$v6T?iXBn zo|773G?A4K)B$jl{%WS%h&B${vZgsVGR-LEnkIE%Ys1wu$a#wkES~askkC#`Y zG&I;jq74zjn%~w^FZcGi5ce~PYe|Cog%s^j$Y@*MCS@o$+AcnFCwJ8Wb7RYf=6G;b z2;FXpiI7L*PFWSCf|WCCjF8cGYT9C@!nkq8z<7j$1WG&Y-;4^772LF`V4W4 zlwTGO7=Ekncz^u!dio&2%8>X(Zw~TD|JpY(A9BiP#d{{?DGAB!g7BnwAv$uaF>A`Q z9G_v`(zzbxx_aflvjy(@u6zsXqYc7XS}mK#RaMVq0aVU|vAo~}=+jwg4w;WO3~!(3 zQq6B8WgcCklL>GRl*s9?7yl9~aEGw?`hc0+IuUif=jV^^L7_goj>Z}7p#|a%&OMsH z4_uo*<`(4*Plev>e)fyd=@Y$DYSE`wW&e^P;w(oQrVhucLcF3hCi7?`U-3F;bC8(u z{2>3cY1Qf5#16=q-z|5qOos1Uyv@w$s78LTJ{0SUT-EW&wD4OO6m2Z(nw4ib{v{Sz z-Gzke&$Az6T%M&}E#DJa)sKeL^~1)AVM}6nYr>Z7?%yg_-n=-v@S;fcwR;K>(p!B@ z&^G^27zL<-%s$UL7?B|V)Z#Tm&##C9m80{yE*e0Pt3kzH{ zd4(L^sM_Z{xeLAuRgKr#BSf37I4PA@#;iMpy647nHhSaOGkdkDXw7%?6YHbov!sVc z(#n6V(OkS-_~MBFwXF;;ahN~B%6JSxUy5w{iAvK}@P@byQQlGBCrGO9R;@Rx zr=Yq_5(vN6*0QW7Y(7uoo^#7W``f@}VdCnLY0kk__j_pNkEGhFKRUP=dSeY$kpYGS z;oo^dK67cJv(V2Dgs7lWG4f-j9K*!`a^1Z!KY|m~_LGQj{4Pa^V&k>?X|@T21^)Gd zd(4lI*}~Va8Qo6OPR)m(+~Kxlo@|-kH;FBfqw*FWxZ7kD{Xw zmq$qi%?6*YU&F~l2ggM^o!2z4J-@cig0*J8aq75+z=X_o>a`$E8(7?sC8SDkyn?-1 zi!2ebUIR4iDf_t)N-NzlmcV%zP{*T{&;LH*gAK8|z){~d^U1WGd=Kk%;i}P{F3qPu z7w+j_wf_<~>AahF@cc>ryz|Z9c_=Pi8__QI7cZZ`q6YcH>av%rhZX@)Nf)5#sZC?D zN>s0|eqby>lQ;r%+17VhMY?Jq&rRqmF5cRIRx^-a6vQf<&u8r)%Gk`!d5uT@cvl4O zo006^{8W|wK@M&Ok-{MTSmf8w0H0qw(2;~$W30b*I zy`Qb|zOE+Ez|xue5>mvd61nen+sdeE>6H0{E&W|zOwA8obb(;_*vgS}pWJ~xx2$_@ z`aIWBGb7COxvqYtwG&c7;qknKEWzeuRo<^x`JLWr(jOf6X?l6ziPSg9dHss~#67o| zEu(I1tye4i-Sln1U5K1<7egy)Kej^{$ni-VC>-p=ybv%xAg-z}MxZZ%q*6dj{52)y zX5*tZ`Ufnv{OCYr{AVB?02lGd{)H|MfVzV*H!cB%KOTVO;Ais+@K|V67~ykO6)nLq zzI3_<5p(L9MG+kj@!@>G%cP+oyfT0XAqEBW{t@Fq7dNH2(Wp@$WM!l6*$GYU{ z>fimNYLjpT=S1ILov?9$OE}vM5BViBDfwBu^kWS9*_BHIVK|(wR64nufVye{= z6rg!PItZW5#amiI_SRoSK(4`M+4AOk zJw(3*2+TCs#Yf6jO;3yRCw&X~2KQ)Xqdl6e7sna4Z5*_h!rSDKtKpTXwky(DyQcXn|>384u*i=?KGcVDA#l<@goJLfz0Ewb_lODKk%*s4d@-v zhX92NMSD0YWxyn!9=v>@PfSN<#t3PF^;-2UPRi^53b;1x7+T3Dd^6Q+HibjVW*=oX zueCYatryKCF3N^+l8(*E)F0LlU1?M=Xu{h*kHqL=gHjhJw7Q`yd00fOe&h?Ruz_6 zy*@pSh#F0XWuWME3k@{L2$iW%g2qcYnE1P&z#9lP2O1jE!yKq$G6vsR<;Z?6+(+0B zmChKc1jH9nJp>J zm`xr}^e#@*Yf!b)0zh*D0uljg4`rRs{B|BygmnUAd_;vWfmB(}IAJ~4VhB?vcx-Y+Qp(nT=z3$=I1UJx^D(HVpYul>7A(2?phI znvEIrzGt_Hdykb=L@)v(&{8;M_jA`O(pj`289$9u;1uCLX~20nn~A=3SSCUkB&`2x z{we`zXo&PJ4Lsh`60wX_lXw|YoKyeaYs^eR9bag?Nf_~xcet^Rgu=qodA_vj3o3(F z*(Kg2iAY}fRDpR4#7Vk-q*8p(5Fd6n6g+BQr=T7G!#3z~i~7=l!V98)*td`6_~2II z#16IEANsCkQ61Rv-4>&s9+2JBsxFij*l|8hqr)1{=`xSsp)1^?_R;k7Se=9tO#k0- zhIrj*B~ENLcRgvn{klF}zVbw;xGrO>qqV21TH0ctZO(+o41nPT_LM-c?Kd?2rESfO z^)tZ#LXRw_i+xbf;?%A;uphUFg)Mdb17Enwvz$$@nvrd8g?syC#%Rto?5JG2Q^4zh zmAQoTO+JMZSaD2k@pd{&Yq$>oyK$XM(oIuD>sfv=_45~6M~My2QFv$=NTF2K;Z zJcpQ7)3~_(tj!cj5NmDNvXGi0J4m>IN}_44lf&{-_i zXycv$a+>qUrMOnExFx;xkNknP29DUsV2&6`Og{xLibUnMmk4%=QHCyfIGBxCZjKhnSE=eFL(l#?bq_FAd2#}wz=2n^i!D7(W)8ht5q!=d)pl)d3Elb%#e24kG> zF!$f0_HUgt9V~q8QagHF355#?&-PvmMELvF6xP1E%1J2vD8JOABn!G0?Dmy``;z?_ zBD*~2#W1{%U#P?z^qG`+bd$?pL}GF|IMiLZBcBb`aO412ZlKs0XfK}`9CVxq&E52T zb{v+4%rr$zkoCuSr)l(A?pu;7k&%CHBv+BpEk>xnYyQ?gY3Ukjf+2>)S}T|BV#LvI zNPNvquZrM6Ws;j%56pE%h%k&wugA%+tx4Eubo#{)={tOPqvxK`hfqTVAMfc+EMMAV z3&Q4K;eSPnnjT*td@nkxq1w^j&z%tX_Y8>{Cxth$r*O+tYkYvI2d`>-qk8 z(yDpB#Yh^O z-!+Fq-T8)Abc6*aMI$yg5$Gf?Yt|0{ZR@84h?21CXF9VFx}$5FaWpQ)tU-1-i8~s$ zO01~XId>La)nL-F}~Nmf9}Y(V=4%G6tiJ7Bw%Jhk5Ks&p-}BmH5h&u7lLh zYZ!0aY$_702GVbOShlUYcCFXbH1&)d3h7x$nvG+Io6IPsht&-BXkg`4@k)ZDy$en2 zrTL+2$hCJfBtzngJBqp711>mRr3&f@fdECUSCWy7`{b1IRp*q33C4PO2pLj9hsa;RD(v37;$l>0ns14c8q9{>uYIp!wEL1 z8DnbhT??d5em-*&k?xDIpWe<9L^&}#(o4|x>^qsy*BN@D=zYo z7eWPmQ0}m`E_40?DfFChX*tcM<6fw?Edg;oj{sEUpENHEEod+xHo*H=R{`agH#S%X znhf>EZ~+X&_~YL!$p6+sf|y2YIMUOGfptk8l*^?mgTe*Gxr5~X#qPkX59x#-onjh}DpI4BNDxXtjOR0%*hV#aR0 zZmsT$L_C-xDu8}RWW~1r`z*|vk9RSr(=q>$EWlI%SWtmyzh4>u&ld``?QYL%>h=OW zYt?@Smj|CE+#SV=A|lA{#3%2yn*Sgj!00h4ezQ|B$~U>+wv+O|Z`{P~1UMBdV^S?J z9f$)UGiL8AkfNogApp&hpY@3F9*cMhSZ(lO0N(K*rh$<(0S2-ah$XBBMaU}UbpdxI zq|W=ZOx<>9?n9BJmFDMI+6};3Z}E`SmH6+pgu%!uR}JEpe?C`~x<4KbWVz#Qg~|1B z^?{s8ZU664$^7H$_$QnFes)or5EWo+WdKq)@O+OX0PKTF)ciX#YYos&D_E z7hv=-2S$$~=uW-~0vG`Cp{>@&lXq_&fD<6s0}N_Wq2L8BP#=&^FZNgM@!t#&&_DXl z99S0BbE!Q07J1;(4?ua~yj&$fuT*!wiNZg#*~7p8?4R$SRHzSpi)N0GcMu6`T;C8` zAsR63SyQHV+qL?jhc=ZtHy$mU*rfq8d~JJHY||msJRzq4P?co`W=&B;gQ=+-`o;}8 zdaf`+5An|Dz_xN*Ph{gj_s%C74XH2QP-1Ell-7|GDqq_V!|xB-E|pW{&pSaAQh$T0 zu)g+n>7ljzMoRk3YKetsaou_veSRPVfrJ$#lBN0vdC2jl2Bm_V$C4?4TK%0`WgbEz zETmfw*HP^zPu+N@wm_9RDFDbtfWZ5Q`ZeD<>(#jPehwOuBuX}V3$%?Mi4uJ0L&&5n z(nZe)Wvrk$WI0m5z3z}@FrFpX`0`MiD#Bu`@qNP=p^8cdD()KQt%2N&(z20Vd)5`~ zCK_cOC8mHGNKgEedWtT6u{57SD1kH^BS9ulcQdH~c`|ns?Pa5DDRaS=_^n$DHuzWI z&~X_N4Bxq`EYFecC8H(os*`SF#VOXqtJlzWu}^n%rogsnyujux@07}Z({=gf;mX9;V*6uG%@KAIs&i&Zu>sPLH31tO(|-i4pZ z{&^Qt7raN{&ph6YWub<8Y3+ZA$Q60zJGBM-&GrOhTPJ3nNW}8mJ|K!^YSI$-Zr4%Y z%>M-{(Wm#RAe5BN>SY-c$YS*5k(KRq5To{PF3qdbsoNhZV|5WeWw4^2mj2?nTIPJ{Dc|8OAT;%=T*=FY4Js@ zcDNNe`QI~R?PZV%I6_7Y0051n*|04JpM_Yo6CWto7Z_Wmgg!sI+#1pIiz(2vDR|Yku*bv%r@r7VS&xr0Ect zPLVJM=PdRsc)Wa$kXNnaBY*+KP^w8_zlFtX%I(9bBHJL^6|O z-mu(R8q646SuhtZe9{4)jec;21RD9S_yh<2;vJ{k0qL-M!nuiNIgc#mgho#`LR;X& z*Zf|S;tx(@jA+Q>!9m(z9z=G>BR?+9Os_O0LmS^L>{~FoB&@Q^UT3;R8_fcLnrd5{ zn@)P?hk_byrr#eOTAq-P#z5V#(cXsNRPc2q5o!6<#aH$2qJfq4(%c{d!6%+$4lK1Wef zEj14L$Wcr!*YOX`$uxGKQX11_BDPel*izFsS~Se^!}BTZq~F8N@ro#RKCGNO)z!S8 z=`(4PM$5OK{~!eK3R<2q`GWXfv>b}*{Yi697V27evGcOO{iE#S_@Er-OV1p{K}=DqACRA&`#O__ zd$x_6;6!iV3y9a7l|y9;9~sRWXB^RZ8%FJp2!cjsrVP>ULGB zW3^j@A8E#eeo0`Kz+fl<)C<6N92+1~CSd`E)xgpPxIf+eDICwGk=gcb7aEiL z;6+U`Ah!S{$5{FoI6$`rPr}-Y&OY64XPe*EYhK@dg|>;3OoDeZcN7YNcV#*Bd^#C` zF_=dG+3DY}troz-$MC?C0mzxUe|gMGL$_uXw~kOZa%-9O zWHSdyn7G$Z-Y@%D>eA;-&x&)ds~?a#B2y)*|2qxb-~A|%P>mZPQ2;WFP*q$LXiZcb zk0a!!0ZhRq4}P9^2|xiVrS+n4=&mY23YaA5j{t)$de*~4u4$>P?903YILkfmqxL`& zOIDQ3t?d}|)9qF7zY_#^1<)V%q8GeS78Z5i1$iP0^wlth0x=y{K*Ad1Kbrg)gBw zt<}wyqK;GKmvYmY=IbQ2aY=XKI9H%ksN)LNq61JPmoxYUC`wt`Ii>F-@eypcQM6Wt{+ioi+nj?7 z{Oa+n##Wb_bi2k+I*B|(Hb%c!H%z1CD=a$2tODa(&hPr9qNCWq=08Al)zi_wFokr< zRxxSB-A=cwuW^NANyazOj?u>FU3zPv*Pm_8m*t6mDJt{bL6=Y3{){{H=JGMxs{G`1 zj<>7<^}_>{d>fr9W~Z}kq8v&zFUYTHbydEfyM|L||)wio>TY+%R)f$|*~4Pm&c^Yh=tXb&4Aq!6;# z@te*wTx}ii60f|DXBbn}GFdk==eKr`-k_)SXW&%zG{l0!$tUd{EyI_r(X=Z)_f{pZ zFM6*gx}{P#o%d^xbq1=yf+DIqyBfN|fx6W z^wO~=5M~dEDz#$^XNqmtC)*P@VD*)AOBt{o8TpFGgQq^-B%k#2y|-~~Xa}oD3ubOZgtpZmU@ha(=u!lEtMO8ZZYJM9p4~{vjvOa)$W_6 zQEsoEH2rk$Eqlhr(v-u``GTq&lpCMiXR*r7EJ5#JcfEHe04ZlMbR1cho!`3;XmVm}W5d!+C^vEYgn8WqKCu zA<>b3dhf?azV8RWSM$Y^WJtp{?iOY|P7$AHu42C<4Opk6iIV%4us=SR42^&H>AWP6 zA#EY_3m_;6>|u3aPN-Mt7w)HjyeTDol(HwJN&3<5qZj!k?Y>!co$4PD3v2(Rga|>3 z-)Xni;Sk2Vs5mqKz?qWmas4VuOH|cPg+OH5vb1Me5rLhHWy%+*p zL%~m9ofvb@Zimv`AD3;+@AKA5V(!Vl8?@cGCUy!wF5u;U#VI$ks8(}E@+7x~5aSE2 zK@DfAZ>IaaVu1@*HwWNx(4p8vyy+cl32on z3mW8Sev+9;N1c?o8l1C^+l6h5Topi$0G_)mfMH0>{@*#FMC5-D5hFJ8_d~;f0Q>)S zeGkhg1Ac5^y}Va@qW1lNR*t{Y&y1d1k0K^-wzD=lkn6@Q6$IEO}&+1iS^j_|qIZW^M2 zIowGCfq0q$aMyt-IuSqM_b4PWINdL@c*rE@1pF=sX1My}WnLnqt*%F5lJqb3xT*;W z)!6vfJkPRQRTEayaJ&Gzq?`8&`!wA#QZ_5v5&$iLnL|K@C(Q@&OsH#Cq1YM=Mh`Oj zrQgT3lZAf>tn#y3%sG-@f&I4_=}Sa%=rr~nEM5Me_>3cDyyK15DH!yhgS zB)ehtgD+75S&=?7<$cinACM2SD^WlLd^TEH4qjPSK1YB!5@Nz9?u{zE=_bx*>H zWnM)%VVU@RkM}y*a}&wrkW1}FBkI_ueVV9J-=z@tIit&`4o*i{Uxtt*qVHFQY4R7a zst#B(GHxdqnK>N?j3orhX%bNrS#D!J;Z(P2*QyNrn#U3EwhZ+ANxx~3)foGxG71-Q zSRPUgiIz}-}D~v_(61^SAl9&*5R;imWN>;5RUU19hra5HdS^q{nt<=L+ zo$itKR10N;_zbR>OhCM))A+9c(}6CgFkjia)iZJ8K4f5LhVg?fO}Jbdrb{vH^=U4( z8KqG~msr)C;*?w?RqAE7q>X$nEDo7!uo^8xZ-WYta(LNiPll< zamjk!>l|FHjsqkVPj5Cq)gyr6q%k9)25zEGiOYoZRtLFOHQ>pA3V)JMgLAy-S`;V! zG%;riUp*_HHw`R@$T-2NBljAY6CTf357%iAMi}nn>>7tUGs2na66qM>}bA*V=kR7aBu2RnS0Yq;w{FKb@X9=u?z}S z?%-73X0eT^OXF;bQqv@7R9Z-DReo%=iYw{s%KD&nmdxQB{xW_~SRB8O6D=89e;0>y zRK5Vsv2E8|7aXew8wrzQLU@;^ZQwbdx*Gpb|9olV8?PR<75q-=XjsehIq-Z5E=F~# zKbRY@S%Dr8LE}5EaMoKu8?HQ8+%PpnRE+=YgNSlM$q?n~n!9E#aeJW`DLAHdnSG6a zX9m^fHJ){5#t;E{;b>D&7=>pE?=yy>9>aX{qI%^-=l=a_nU5~${u}gb2k+dkBz`x3 z^ytP{a$+9mRunK~sB*p1lH5-_h6rS~W$f^Oz+}g6CnOX3;$-P zF`>`8w3qje*3?7qoTw;=Og9GYfMsJ_nArm%tGAR!>SiYRg>_~2h;|e@B*90WRrk#| zl{$9g)F=&E@!Llgyx%J0m0euPUHMq%5RD(DMw{31(GL9Br)9rBTPgALbxFS16cF}QY2!wECtyh!wyvIA4xmC(zluR3q6hco6D zd!}tvq@Zg#m=o3!Y>JJc;TExA(l>qEy)p1&W0&Y7ve_TeUqoIP5zGM+4p~jXyRQ%}>ho@mhx%n|fwzsnT7< zm-x)f1~Q4{H>{lbH%yLBi+qHw*R!IpNFJ2bNv7!Jv3yyHa@Lnn6))J5ZAy?i_A7*q z>JoPg4Q?FTK=52=!2%bt$nhUGqH7O^A(l-ksduAcKQysCM@hsqD_|*dc18 z?(FdAy}Nc7QHtT2HPSr>%<*Z?u+3)qBB5wcnYoj9*t~Ij(faRNrNIts?Q`O44FxCN zOePfEk7?KIBg>6oevVq?5pn(gSpiJ+Hn67SO{EnE!V*r|`K-!0%WVb?tN2_~QDrZ5 z(p(BgMBnO(OirF!(Pturh6Fo#=h8{^mb&1c;&2nL-?64&x)-T?FWUY^9{zc#DpJ8- zKWR&@uVYIgq*P=IERfvK20EbXE5e*P3Jtz)8y}G`;;8;!Jk&ol`Re~a|CHUL+`WAR zy|3QY-jS?)4Pk(g0`m`$gE_jMG#&?pW-L_2`T z-)kpv|H23V$R@rsbtPUMw3m(}4R^XgA}3i_<3P>DxuNq>0r)fz1t@G&xQ{LU82bz0 zXSys5|A6{&&UXZc?nIcS&hOp6r z6A4}VAYS&%GMsDYA=qDje%WYDUV7vAM3(IMfS z=-_L8zPv2)VvUtYPR^wfvBTPQe?U(TI@+$N5`k8e4}U<*4A|;|Zx1^mi66NaaC~wm?ketK__i- zcs2Y#xVQXJ4{O7Gmx^zc;fC_osI@e&xPJcR+cL1cu|BQPJ?y#pGG}tv3V5D|yZ9f7 zBpMxVTx;$0P1fMN$=b1jwl`$rUf}q~ch@c5s_SiGpvSGb?xA^e0);c^A3uQ0!)2_|JT+l=-|w*?@VCN0CsBp1Xky z?R7x)_&Hd!8@lo9{gimVEnBgukjqv8-3ebqC0 z>8MxAuM4P-K*K0PZzl(~+^n-EKiMzed7uS{O(sE_i>qr`)D) zYx92D^3s#Wadr@0*yS7tyhY~izi4sOy|t3Zf|JCL&3_qJ_*lm1bIKid2N&M$|2$o- zf8i26M1PrbLbuvR9-F3uX1k2@pc=wIDa2bWS!UUAyM%tdd6)b3hB@>nLvZ%qf&Rhw z(#xEquJSlugjw+?)B))%v=*lfnt=KKPIsghqLnKt&-^RlgG>O(e8lWFK~oVmxY> zA4=|I#_;a@pCUXmLtc)r~=`uhFnhR??7}!PVAtP|YaC zF`5&4#~9H~VZZpaPLquIEhtXgvg%<+=ha%yA5h_eyy6z}k+96oCZX@THWbr?UfkKX z;vzvetnJd00%nhwsd)2A!T`uT3E}+%YNuOPKKp`Fph?=(u@u$l>p z8MI{CH>t0S&P}0dA@_nkmM?iXXXzFGTRWPIb0$rZEZmQ}WHSH8HT0DT@q__g3Zf8&V!n|Fnj0{0~U5-E^o3>aNeR5+6ruo`vA9p z8TvVcxdmfnrl&|Zzf3!~WX#Ppx>yLSCLA&Eed?9#;zXy@o z|8UI`Sp7jhHFyb)?}xBJO6f`_R{xSAuAZgSvt+b`7qQ<8?X1UYl+istiC>r*Eg_yN zTe5Ov>RAz>fljZ3k7$kyJQCZd=f5512)00eEFw=uaj?-d$X)U*`?Hr>{k&}P!{xm-$e?;@B_3An34DGwZ6AJ`*!bnrv4=d9 z|2NS_BjWS)hhq1Ff$NQrhx>xVsLDM;E8IV7Igor#{XqL1JTgDz?$&O+@NPGFiS(ne5+R#(`K_~i;#fE<$p%v>H`2MgCL~Jcj$o_>n$yuqvn?s_3 zJ61sI_}Nitk4?|P){KH$BzPv;;N#-0!I<39e(ItkZt1k;p@QAI@}>Q&KA#`k9;i3e zlPdMqh7E*)1R~wpgZ!mlM}I(}dspYrIm}PEmDhTQGK)F-7fQmD_;Pg^#lrsUGu?9uaM0WjW(f$^a(=2K8M1no>37l z3)sJsW+W%aG~K~`$CN@iofxRpZLr0|PJCcL{bcR7YdY;R!^Mn!Yr2wbU!ClB)>}Ps zf8vSlz1R~FGCYJc1Cr2xGAFQ_a4u1$?`}}|p~30`k(^0R$alJTmVm((z| zZsTp2LhgVb-3P}bdN_X4$jI$dWV4E_N?8BwQi_ajOnG;A zkrgwT;s7O`QEqytWJ#oVnU$8C4hXQ z7oL#oAMRS*JWE-Vmc!~!eJV-xCiii^4*yJ3N>yE<@ilwI{XP zpHLBHjIloU9;^KFu*H19wVkelH@tY3Nov*3!0Jh8_5^!*4c(PX*O2bVw% za@}mv+Vi(FZ+LA>&O>H6;(h(rB$-e&`&}6JO=UAURUKqYV|z|Am{McP9crQ&)uK4a zqpHV?RyVlyP3ISl3k;gv)!w9eN_P@rLHZiw1?x-tL>#rWgeIgE`m{*CZJ;?D!&yfG z@q(DsczyeOtr2R~brJ^K8<#F_lZCW$rglue4-k6)=9$UDd_9wa@EaI@d#lcZPLwhB zN^RY|2v0mhV)#V8SDCSE8}ja?<4MvjGnK|jb|!tl&BsaZg*n}ol0$2O;}JE2uTGNY z3>MbtL)q)vDR%ulUwkiyM2)?--&N~2Gc2PKc_{Kv}48J{Uqv~H#O-^ax&nYJS;`GI>s8=1(0_#Sn9RN@!W)+ zDtmYUHWihewf<8}Ra)tvcW>$udU=h}y;lU&dE3E)tDjxPm}Hl#(;wEd=$$flGtxJ> z*mU0MbSrtoQs&p^E$S2j4=Z{u*hFyQn4{vg9l<&oJ=H>4@lqWJc`3?#V;zjI688i3 zSAcVH_pw8pPK#jl9#Y5p)cLW)6b0to9f?zXUc^nNV=@%CE8SwAKhZ7|=9EOT&6F#m zUiWKGA9dU|gTxJ`mm8%7UwP=*3&^S}4XpDXPvO@%AYVOXBKvquoE#@hPxj+d(Gs7I z;P3L;>#uPWVY0|RLT#p97L?&_LpD79^xONX2N36@ z&(DF-R}q@(>TDn7TB!C&Al3mp+ojG@sX`k2YNn!z%N#o~N8jIp{NhpoQJ(oG=e9dT z_tkChXKy#IZ_}3vs+Q*jes_iob25TB%A=*8coZ*9G81IV*=S;8f2Yh-ujLnD(ES$+Dg*TJHMm) zwv}JnXLP8A_O({^2~F0FW0QAgl9$>qXa!;MF$py}`Et7H8%xZDm4mwLiD!P&Ig59P zw@kc3^vE=~hv}~2tGyMH zFug`X$x;}TL`hN13Nh|2uj$;b%{h|J{!7EoQp4<n-&Myb17 ztV3Ti&<|9q?OE~Z`eXf3EjnAyVBkJFr@JeL%ln*gK# z+C<+1BcKBKK5c5^1{r4ju9_RL8os%=aiU(0s*wUUib@5e>j3ckUwPs`W&&UlV&s$; zMP(XQ1^9jW6uJK!O_4GL?9?!V3cdkb#i$Fc2Y7ak(C;PmLgSN$$ZWrA%==890N^>$ z%b+WZn%4`L=6AO$Rp2dj$aCoN(CrmyuyI-YeVGiczu;tkzc*TdAF;S)!CYR-U_&x} z3_VEzc;DN-g0ub)$iUCW$y>v7XuxZujf;rjtt-L?SE{nelohBYfhsw2~szce8m-^~fZWQz1|F`;c7{ z1pr7CnlLyw6R)o_tAe_nwLbbm)oT4tq`u2=R2% z^gA*yH^J%dnUwpseoet z_l#JdVA#jmz&~JGi({7($Q*5wYU$>t@+{7P{(0aNkWorI*BYngTyXDdz zROPOJ!bU`%d5VDX#oY!;&x(%v4eJrDJG7C9LwCPt+HZ!k^M*5XwBF|=b~xPg{i3g5 z^+iFnO7}OusDgnFFoa+9j6(1Z?++*_fphK;$OkAg``rE6`O*9j&d|@PqhfyVCB2lxARRp!IKYexrwzh#>-BW6 zU2Es=_M#d-J*!~ROWQwK7!AVE!~F&Byx38Wdt`F#*u;0Rv!!3y!A3aa;jPm0bt3zu zI$e$G)grdz46rSnvb~`cW`|kbe2!i~exdwS?8B3?EbhGItJI@a6}L`|=#!?#@mwd zi!L~&jwC+|)CJhHyyOt$-TJ0nCE<6$cE@cfeqrfs?~Jt&##ZLi^d#@GgI)C8SbaNz zfk%vh$l)))rXDMuwHWP%*9e-(ea;jV@#2f@W#VSp*}$s`=)By&?D4{bP4!cm66 zHrM)Ek&iYCy&Q@6xWBj6?OktP3ZuFkQtsy@E~n2S()$FAFy!$zJu8GavRCl}80?%A z-Ao4MO-E5$k19G_q&xkHz79{LejEWc#euMX?4=}%rJ!C=Ec21BzjUNKeav@$Eb3Ar zJm__@BYR@QAa6rYYYyX=93Yzap&UCsDW3HRepfG1Gy0OVhphf~HyzZoqDR5%(e02f zgHoI&^}A*H)>{+FdPY!e&~8V|Y9t$i7y14Dl~x6SMUq-U*g_T?$Jxruck@K_2h;}i z2*Hr$*cUi&)|vpc;^7QNhSM7hD)uoSwc)Z;Wg-N2sx#ql{JX2?vM9Th@%?7dV3^Ls zWGPJt0ZcU~Pv=Bo%hP*+)&D?*;v!1=uBYWNIP_85)MQ2L(>Ri2+Os>CTj?dg@<_6` z<6O5Nu#2hnY3-wacSK)lgQi|AO`*Lq z=k$C=tPVI8D^1PbliaNrIDivHr$3-;?RSmi7`rFy^oJ#O`@1@Gvu*ktT;ZI1QB9(Q znM(;_mgN^!Ph6SfYAWl1grXE#a?F+VPsgPO;G^>VvWo=kFtYwqdEz!lYjQQ42WS+H z=jGgCF0;Rcy;U=mw|eA2bHg|4^?ycxyYi|2p$BD73t5-8+s0yH&|;)VhDU+Z z(Wl-m1DmN!5w}Z0oo6qg*5VY3C#*&vN(O zq8pVv%-*0H-`hOWhs|-hg`holD{nGh1PG1(%h$$oeaJ%v0CyDcdwj?k+V*Y~3djl(HkLkHCbw5zaqBww68kt+NmW3w zaKE25_J5X07^mT1p9_Hc_xs!XFOV5+vyh(w`$)v(748L->t*E;-ki&NL zXEf-bvRno$6D%{+!Qjk@?A5o=5&8Ic2eCwIlEq(ERr#inb&1X4Ci_)Y>lr<(c?hCl z_SR*M5y#P#O7>zx+Z@4oYQ3v5y@;R`glgrSCVwn(AX6kGqsAov`}UalhP*D7#}>JS zy!R1}QjDGAmb6<+U0f5G5j}DdB^}{CDsRfx2*h{@(-{@%Wbi+Ii(Y`+0VsH>ay~Fv zJw&c0-?nSH%7t>=PU~M3sIljf=ZCE30r5Dct7E(>+Kdhg3-iTVAMVb~OUIB(o<(L- zuVVD5Am0eXy;253K54@*%OZ03Q_x?jTc5z{@cJHaS_MdTUFab{qd||KOatbqsb`zur)iQSgjZZ(&p$`}uTZguv_Q<4NKC z!UGg)V z65Cd5mO^{!QNmI1)~L%;fZW!r)DfEi*6qk9Ph23S`?aOyUA`8yO;!ln!hfKtGr(4_ zrI$CzB$elMbE~0QU9ZA#wSG6za9Qf0S9;R|+E(OCiwz3868Jf|&orPLcJj{BCwj>X zh`@C_f4%UAyZS?T{xb^)$BY`0E~+;rBQm11*H#{R?!+`i%?hUM{IMypWo`qjQOWMR zxTzU1>vYz(nI5jxXv5Dg^~NyhzRY?J-Dep;yC*^#PSd1AfbW^3e=_X(zk3LbS zvt*{?mmcFB!_(|uVz64mt=F2vDI&c!jtTf(_`UVt=-R8&5TBgmSee$s_KmQY1U`nJ zoB=e_1g*jf8j3XNQ6h80Bx%VsriF219Y)jVPsL^4VLB%6{KgMYyIiymFV&l*t~sZ+V!KEA z$vmlRkkUfFNC&Sk1LnrH&ZCtZ^am?(yOQpt@i|i1Uf0?bB~q0#Zh|JG36%m%c0rmy z)ES{HPAe%ei()ELm3hqE z$g%0^6wFD*cf9uT?j|_QLiv!sxQI=C&@*Pn<&(dj?}kXGT*A-wan|)Fi*Z>t&~J%d zW`p_hcR!-P4Q#RxW6%kbbdz7D?baF^duzY$ng##79mH}b9r(0CSR<$i_9J98ksSdWd6%`|!)Np0qjmzWDgOpaCS1kh@M7+}5VAb|PFXZo z$1R1%FLk|w8p!%cUT4k3gM_nU!rTG*7QgOfg|xHMdD3G79qIb(tPdqVa0?Y%Y;4cc zJFL-6og>U=#u8BoD&L`pjYe#~$zDo0_gahv`~QVgEX)`+d3!Z zo}2i*u*0&-V6DCw1=IbW`P_!h$o<$r`P+cBPn!7_f^#LUO4mmMX_QDMwA3w(fpTkI zHv_~UbL3mW=9Kv|4BzYtIV-q`hjU{meOb@MMR-;5(M-}E%>9qCpg|sTK()vYK<4$ z=9agaW+dd<_QG_{j^d_y&Zn5C#+ZG%r8vms@A^1=Om7%f_eZD{xJmMPAxG4?MOL1R z*Z*u%D>Nz40Q&fE54LtGz#jwJxc7u=>p+RLs+9A+R9wd5fn`5XQbZ*)4v@<5``iFm z8a2RJ#t#JM+-C$nS-Zzf0hL=$5+E2S1jJQ% zG#Bh@iN+A8rUvI|5DU7lR#|ZSh<{Hcw`&D%%mL8s;5`G{d8HLUIcs>eB_riJd9`xJ zO(gGpSJO7nO$5mF{!xiP1DY%U^$-5%8fOVCH}dID4A2Tr3Jk)D!K?IC*KwFLBW zEe;%#`hA@OfAPJek1+0D-mdmWFEE1rtYwwOJY~P7JcqMeNfa|weS%r549m=?HiS4TL5SA_i^7A5vlC&_{9I*V zH^4c~8W0B?_3cpMRs@m(UcV{$mYnm_t{SK}l6e@9q*=cP&bSFGoWz*nLQ&{Mb z3a)q7=~ov+GM4idyQxNEi4twq7f*4-4X|fDIYP)(s*h4DLSVB;$Kx_cku5@5*m#{5 zpGx%wT&QzZb4SM~0-06D;yDoAm8P({3tev^IIYx7ak;5%ICEJ=R z_4&ejbs5dn=U8M$o}4B1v3R%Ga>`Qco|SOvQ-|A9o<&=3r;mY5&1?K7`m-tduKsdC z2utOF_;ew252LY`_pVYhJ&oi@%`MgQjM@Ve{DdxJgU+I0qUdIufuE~*H%k{>y==!9 zSg~6>D*ARZgVN$%qQjS20^u#HLMc|ZbO#A54u3%YT3vzTuiy5Atb?tu!?dS3iXcta zMW(qDeQ5cnW&*5o8~Kn%8%dmKt=xt$qtK=5ma#S2R$+T+WWjw^k|mRX5(?= zOA+-T4LzOFntq(P@zg2Ympku{ls>Q3CjKto+aEP>ua&eUiS4uG3(3rcv$skP9cn1- zF1+y@Z+-tO#1O9H6zWjyzf>Ge6pskIa?{DHpk$I7@H}p4ibnkx}E#>IbLqRrDND&4d)+=OR7nC&P@h?zo$YHO4O=0ql zg$@pH%;#iGxgXXq*ATtI7gyoOYjFQSj|?n5C)%TG7)@?g6s<^ z;!DMdtU&?e*NLLtUVhumt6i!3sjaip+)_3o?q0Jw!D-7O$N1;&=IFa|jjq`(kz_L3 zX5r+ke?TOq({_osMSfFW;YJaaq}XQ_LI!%WYdoD4sIE#Sks&Mjl8AW|HNL%EbPOX@ z@z)JPr+aG3%ssvOoo8j&KOG_ue(b3}?M3=+a|+47RHnras!xD&EK7rbd||fMtLN-L z$v`!QgyXo|_z}%LInM2ZvwFtc8(Rc`Z%)^%ZU2B=^EljDnF@-kWZbd+{lOTuGg9$X zh!Zq8U1iK{UySfM2ivtPy$ri7-W+G&__>X+K_~9l<*eA-_r;ZgUOOIYY-E2JUhFC!dNaw)0#wsJ`!wb zCeA%Stu2>zE56Exj4IFK0kIyhE?|?LSLq44xVL{mQ+TXVrIFw-L_<5VWqnV|HbaRD znEY;|1OFdeUme$U-+n(pMG-{=6p&ClL_|6V(j^@dqVz~<7%>xM(%qwbfOMlG-8B#i z>F$or-y84y`99AdzdsiEVz|#|ah>a2=Q@Yd8#%vqeM{}Jn+g&US&44B!*w(wC+woZ z#(YC5s3xv*hakdcGte%UI%Or`l&g9#Q{sD`K}Qu_v40ng<1q0FL(L4goCMNmCg7}& zOPa7Rp@`R`9z({Y?-?D=MYWY)`-fNV)|~l&%%fZ%(jOw{5z3>!&4yR#nVr|8IG-}i z;bp&vgs5n0qZtkjf$o74@&a z>;fMcNK0Pm>rH_Ixd+Tz2Z688HQ6iwuBD}i4S=@u@6wnoLKBwHq{Hey3SZVw8}7PSQdF(}$s|30q)*&Bbg zO`~-zFw-p9ef@T8k?(J;FgPfKYo>EyJnE z7*S2QV$^VS?$?7m0b;6Lnh(#|%vu-*t0q&!L3{qs##ubb7Qnx#(7g zqbIOA)~TctT1G?whn@1jzpelhyd#i0e0UDS=l-en&;|;w;t76=(bEA*QcaLW3><_& z;pR~Wxz$&)KW9m6$sV!cg&@2X6ZFpZ$FJSx12#V(bkYKZP7Ge$1^aa%o7(!qp!y%E zLQYP^Mt&QF)uIfZw^|_34D`to6SG61ydO@$b(|`jH4U0uA)||71a22Ch-b|D0CvRIgn;G@p$Z#BgF}9@(q29zkKgaSfG+BFU;Nz}69- zMD4e@+as^m*KTXw9)F8Il5$JELzl)+yCO0{h>P2z43lZvLp-+^K3W+| z)zimR9(o0~$UdZT%@1;bQDuY=+xz#_*-}ZjIBggwpK~DmON!7GN#_lm!rp~zAEKh; zquuOct(J6bnnxaHSH^lyLG~#Ip2X2}4aS^j9)5f_Yf~Pcl(|wC_F3CHi~f;Gqh@6x z|C+1N*!<~D&V*5hGrkma**>&pS!46&<-L%D9&V?xm8b{&-gJ2uX!EqO=D{j1H)8uR zdp7uQz1Xo;GCZ1&z0|cH*Kyr6w$GhnjQc_v$w@laxvTI?dQv#^Wm#p>)`1+MqaJ5n z5AG)ONSE>Q_01nKn?XUZU)ws`y1JY_(sFqIg3pMd)>}JfH_-DW3a)F@5qH=+CUIcX zX;<>``_}0}`jg>!`KN}tan+2rE*eHMi2~7fOK5`_ekRD6&pzKdUM;&wN_6JaCmg-B zV%1Sg$g zI2?XH7hLLQH9JoSj)eSKn`K0Xx~3laSX;8^;WI&nIXoe6^i;)E$e2$t;w|ajYKiUQ zyhin()}l^RjAum+*Q&TLDVU2rm0acwY8rTP_l)R~`uUL-lnJFWTCu9jPGt9CW?OPD z%So@Y$K0PYIA@W$ZVSyQ%3wz45~;>vE1qT{6;0ig*P4eb+0y4 z+-$p~V}~>J11Gu-({i~qo>I{dUDI{rp6WtvB@u<(FNQ{l$VkA~g385yo|_uCefCX+ zJKJ))w2Pr9SPe!SV!NtL&mI3j7{2hv^%bPp%(9=Q|9}tjbS$Q1m{PBQdT~ zqY#FK84Ynrr_qi+0fql3Zu?Y2TT{gNe+qtn$j85aFuzSsNef2O$6`Q*$;Kc2xB6Wa zpsUuY|Jj8H)d+mQ10EnNl~6+^E7d6DqBnF70UPIdofn(>glwzqcVgaN2EhU4!#Z53 z(;=y+ldidalLj$!6_UeWFZ$riS&nszviM9Fg}?k%H>k-4NBA6r+BrmRVuG4h1J3q| zdlIpL3HBUf-$N8ZLDj#g#P|yrE%QH_MeIPo1@3{R{PZ^@+i1$B`G-wvE6=BA^kzVj z`;JH%CY}O)u&~=Pf@2Z9>~n{XM}2!mp%*1@Wb`b(rbiwJ1<=4Zm*&&l7U*>2>EU44 z{L&L}2q4b-!qOPH96>Yy9|BpG%iyzob2;lTxu0nUN;eD4I;#i5*AK*F7vTm`5Y0gi z$?FPisp^;Opw%NcmQFhp`ZoEcy>O*(7_xu|A;G_tK7>PGVnN16As3H+Yv>;OHg@&K z#gScX{$Cu+g_#ibe=F#JDkclwSXC?Fb_&@g&JYa%%z+7mQh5{zeJ%&DD9|8W zcm^mZTmxHt$ni=-E5_hq;mO5d<#*Se?&y=;|J6cu~a#xnT@a5a!iBE$pwsY!eBH4^C)5@BZ2uVM0Z_J90{NNfMI7k~5v+@4;ZA`t6Y>I<7pYd6a(R3Ym5%c@DC|UGU{WD7=CK zBk^)VkId2Q!x?xtm{bkFPO0cMc@zMnI2Jd^^v(!wKWIU~@_ZXObTH~H<32xjB?7do zf}2E-w{#`4d=}Hz- zPouqPaCVlRjP6}c;+PBBjMsG1aNDGn1^cAUOIsLmrA54Oi_@qSISIF))Us{Wu!fA4 zSQ;&7Nd3ekA`Y`PS!12=baN$>A_t5f&jo*D&)tg>RcoT53kxp@2B6658V^~gHot2A zFR$DO^6yr5d#!s>yww^p+A4e$59wSw^RJBAv`P@paFuauM$SFV7Hw|$UN7#BaIP#| zY~BiyNg*4CYumXfamcG#xt?viH)V5bVr0Ya?CzBOK3%Mt6j7*t@YrR|5L2beHTL`g zwpHR7o%-s@o^aR|m=`SxT3^xYB$D}xO%U0Gs5X|t`2BgE>_2;`l-g>IEfI`!EN)@$*uPX~lnZr-r(LAM8$58LhXP=@b3*DLih z_d94B(u*1U`IcpKD>n{BC?(Ge61*aNq2x|W3=n_);Ryy)1md*U38;gkw?2P zJC_*@<&AAWU25Q({}{HuV(cd$zu3K@sp0fmahC2~zLZW*{Lno9+3v zMInxT@XaExgLc82XMP48#>#=C7kly9ord>L@1DQ=ziyrOe~UNfM@c%8{S9cr{}S1j z7kw(IC=kl@n6Uo;Op@{BKnF<#O!J8#2KSKcH!eC^4Un@710--3uoAxg$i`dkAZJBq zwI%0tXg}5I&TOhp%vyyk>qP1+S@{GwcHDH~qVNhU0;+dz5!zX-kchMFIbN83@2h6PzCwZp~7p z-97iurK-q8wA-v<2aFbTfGJ%mFr~{F0QQ4CZn)(l7i|C(E~srn1`5C!T$lD8zee?M zMa2V2g|QV7K|aeMP{{yTxeSi{!vFW8*9Jdc0ox;z*A=;&na3jO1)ar#J zozEr*+y}Wmty54fh9t94aXkV8*L)8GDwW4L_LzyJNke{TOn z>c0z+$5m@~;VK%-!@;6HIjGTSNA#s2$IYRpcL|fQt|OZ_K(q(Ua>#Z5zEbKrz($w_ z7lxSCRl}6ToiDB0x?G?WEgb*5X-}-GqEvzbsI8#f;=j2QdGT`n_ej8VNd0?K3DbTL z@{?jQX}NecIb0V;zvv@a`QJLN^zW(uhd2N)00AH3R(fQ0>UDQorc-`JIKox@Q||gj zk&ZaSs?D+y+T5D8a_Zrzo8r8!xz)&%@CPu{24Slx>yG!yq*guzPaV_`YE zmg$>|nOZIKNS(s3;i{tKEjj(_ra|6Ac|1BV$@qx;#vO!P9%;DT)XO7ZOl!Vb!GRrr z%5;{V_7jzW3P%dgmNS`Y4Q26!tcDZl$T5Tgr-b7?%3OMQnv2c@nZRQ>(vN*NMV2YK zfV)(K;?C0DYYNt%fdwRtS6Xqz=lj%%C0?b7|8KJ!8(J;hK6=8L@;Orlq}sr0OPAa} zk1d|#yP^*H@DBA2Q-euOnPaix>qj;+LYYF5n|(^W$WW&JY*Ew9G^3>k-53?kx?;3; z(zc&X>OHY&6Jb8lVbPlOAF=lB_X0Cvceiv{6K&`d(w-lm4dXhJsszxB8s|FbS8%Ni zJ&uUE<9yFY@$@mX8Bv2zM9*$0z7Mf=p4KuIbSxIGs$c%Krg=ln)OWR0UF5;@AN$_M zCLu41SxTqf3`5ag<7r1axKTt#H~cZW+hZ+HSa@36##?CG$kpI8!Y@%G z?^BnfNpI<)Dx)<<-aX;_rHj)4#DvtaRoIR4fPWs|_c^`dY3|wd*y!B?&q(!#*FK9f zv=Dx@7_H*E%#JJDxdSes&gO;q(8jLVK_BMJ(#|;*u?q^8K5gh?7_jE#*sz2~(%?PK@hkg!2f z?DLar8R22~yRxjr8ecr%CVxYd@xDhH+CiE?VY;++HmYLol7Pf$@)ve6rn>BfAAOY1 zoqVVj*Zqtpg=U`-^JU}UI`dHX=sllrEW|Qx*EaO}(r&$P%&J3& zKiH%1rrn0?DjNY0I4s>IAu2-j?MdmT9``YM{Wf?3FstwS#qeQe*S+X@U))-dk;a`2 zFs|AC6^wn8ugFMHsX8O7lh}^2nC7tyc~@4H#Y!1TP-#nN3A@L~HJ8R{J6lr0j%SZ_ zhMcVK7jwwSnA*q58^^QSE_Fw^t?D)to1(8CnR%rYH_ap9Ls8> zyUiLO?;#U9qh-`v-{^{aYCnOC9yDnjBd|A`tvPWI>Lxqtb=oglm1kiv8mHPtv5=It z)`iORqdeVP$`;Yj^*W_JSZQ3v*KSNH*9GU+dlXfBh^}_}Bg~f+lSZ&|+A*&dvb%{*^ObmH zs#rv?4!%0v$elhLc8iEUb&_m{t*NxKuSuDWCL}y)r`pnq+Ebf+FPUl51g(|i6!$w2 z&azrlQEPgpS)D<;oAd`lp?d4Pj>m)vvLs9A3Ve`CSrZ7l>;FJV4*0YjODre}H;>X2 zIYeo1{%?yf{}hxN?SCZes}=vM0sd|GFQCK!_d*2p?4UXPztRUXkidcz{=&V4GBaEq zjzGsr>nCa&m4!!oWUQMOxry}s_FLQ8cO=!!8dTv6%|ORrqW{w$$P}9OEC5%lYYZHK zvRQ8dDAri9qYS4r~vVPZzZgQZ6!Z&?v&_)=auqwWrv*j&QKDgMI7r~29B z_(ETu@l6T-+*mJXLk*MR_*@9tcPuCls)7(!YQ&zgD!y7@;ZYiOL2Wb+#6EgmIIiuf zx*2;1ReGZ`{iRQ+WWvtbf;f;ckCa&uo@1mrh;Y`nJ9rzSUHeBCx#BoG+VS&hHnJUfC>JJ2&5htvM z+>`Z{+W8_u5E>9Wy&W(H(^#YN;>HtgTQlJ<8h8WW(Y~J^6A4Bv;MF$xzceewsp4aA z6vMiX&$q;$v^HwC4)vKD?50`m=O#3H6x97uVR-+sL@% z5b810M{c|{~TKu5sOfIop|ly{a{+77O1LxccQqyUhB8Xo2fhggrj0SnFh^l zCrrK*sNRy>(4PU7@o9cw>e!;uO_S52c9d6f=+tv~;ZIWOx|H&e2)CFhqAG!vjZk;I(ynKr7v0-AIGh26#*VIdQ=%O9-ezjRO zFvdT_YhSE^j?>Ex?vs3`E{f04Z?UkrrS^#O^k&rQm{Bc={AI&|ZE84Dnux7v?>9?m z_8Kr6Oy<=sLvD7O9E2F@J}7p^eyL}lnZ9~FCttda33tr;)syWtC{L8cdlJIi zS5ka4)wBgy0UP`aMVSz5AAusoa7_|yF@WH6%o@;>NHGH3oB9`#{|grdT~Q~O6!jx~ z55W_t*e^wtnipE0En!!~{`*@Q|MVLF={YWLj~iFAshxet&D>Hir}<&YlUpF-jacS~ zD0m_u#;pGb`CkNrhSwqu)aJb5$KG%zFXw-i1_qr)j1n}V7A(ARkDmD z8m;Bjn{u;){=d^Uo>Al#8JIuZ*+n2r(Y;3;wj>{>XX&2~r@UbMrPrzU__G>0gEq24 zSz%{4Wb-l;z3GJ%W5+ zBU0{B+)gkaQ3t{@M(V&mzD53f)UQa5T(hA{v^XV8MT+~p6$~^&r~Shd!*}e3CvTnV ze1=wYloR^aY9F?|-`LPkbmhv+$;*uz3di}`J_+P7xA_>%L6KT+EFG0KiF`{!qg5s) zo9V-{8aSOGD`vl;t~6YT$G)bW6?qIBZ1=S(OMuAp(^*^Pj`b5bgm!3~L%9tqUO$PJ z1?dx#A@+*DYt3i!2ivdy#voplA54g72z^jhC?fJGfcd`FPt03mZLngyyK`?PSEs;N znRYGiIbs|LWa(Qp)`QJ>OK?L!OuX$~PMbb4M?U`UnP1k$`)h-E1a)Y+gnV#yYF#tw zP)0K*evff6-E9fkL=hQ(`FX6GU1&_zVV}Nni%kS#X>N->+!TI4cynG(T=Q==Y+kyk9IkRKCCa z-U=9W@R{X}82EMQcNzNFnZ{8(8OK%#w5~-RY#H*7aY)*d7$vVCJ~nABORDh@egzL{ z_Xp1Q2~*tViVh2+weI;3Cl~`Q!fw7FtmP8bFN?T38(wPh8`)MHuzuw7jcWI#-B|<~ zs3`t9K+HIS>-prTB(FxNDQIZ%i~*)Jo#jFDwAk+hitaHnXW_s{zq;~`v*OL_DN4>kCFa#q9xzSo7QX{m1%dA6=Q zGAOIy&?18*-=S;Ym((L#)x~rNGv@N?D#%X*A_?ND4NcT1ZEsJlGCJXqo2;8PvxTzE zJ5lH#u#$s4Acl<$r%B2p*~*FiPw8N)cnQ-pZC3!&!oF z)7Y>3g`zzJ3qK0wvmEj17R6VEuar^$TAE~hsauGStg|A_+b=}R*7xklR?$w?{&vnYPsEIc9Ok!A8C)V=cY1Jf_Rb};GBm~(`T69d$gZn^Zp zZeInxV8uLeh%kr9M)w5h6@Jr=uzj!>?UjRQjaq{rT3ijH8x$ zsuC1?WK8Y!6r4S6K8|+zW*0upPrj2Hqq^ii{_Y*ydD}0Ul2Rhy0=q~zRW~+-4Z_@D zB1>V|G9oo?x>+ITN<_pP7QK^YtFB?;#hBcyTL=u$eP-77?w~dYRDC5Aa#XqCG+Rn#R_>TY-1+t$<2~u-^g=-oeP*7Y50#xvW)Y(!al%dDRp=$$a_%WLG{iS~?i^SL z(JzO%&%<7WDf=&x<8J~VjM9Y}YxoaCf6$-s_T0mLdyQDGJ+ASaMbv2B3M-Vl=M#0_ zcRZNt&o@cq89C~enU&A9=||zCwj=n~t(vv6F~gt+aB;~1hPQaW$-1zBxucX`d59wOnbFrE`K zjR&p9B#91;3HJgSk||Yb`~?ZW(5}Q6D`B&J#P9m!IHy;(vwzfJcWGYp_8k=S7qCc2 z#!7AJr7!7Q{((52>aaCo+71dz5befI)3_+&Nl>i+MT+mKKTK;G-vsFG0T@M2QuNt0 zU0}yKfE}CM1E96gO010>9bg-uRoQAdDcqb|#Bxj)R>t%fT(%oVG`%^{}wpWci9 z14&^ANSuBrW8vcNNdn~)v)8R~%aCMiJW7IdqLgZuSn;#D1(2!!519yn1cXQSUyE!N znzs{Go#G9)EA(T<-=MabN9R^~a_N{3BB{lj*uI5?lQo&4M-^z(!S5rqODV7L?Wn%8 z7O$CD`zSP(9gChpzh#V-vSfHb-d+`A?qk9|&xU@&!P0SK?FY!*#uiFZ~%pp3|vIxs=7xx4=gs2Au5E z=0hMb3pF7@d|jJg&Xb>^@fR3)U_Np4t4Ki|$pcQQ^1B1wwdYXYNK@R1ejw@}^N%YNFR5*c zCU@FxHa3tD;3mok;nlQ^PvBLH0~v4*)@Cidd|!35!^2?KJxT<6swe1x3WFE)ZdNNK zA1w+FK2!+=KD3+uD4xiVpAfFf5IDS}RB<~YT2U-2<2YA)N5wtWr=^J(zo7GH zHeY~++?FJ9)NHB?Fdz@C?bmP39!mI_8pGe#p>1JA-PnxucQw+Hk>#i02pMk4Gi4|b zH??>|ObbLo}MK_LhI zWhcGVijM2Z0aYHspv}SqQARd5p2=5XFYPbsiuZSaRNpVkHzx6Es+-`|Mf-5?Iy?vz z_bjvmm@R`Y=L%+50pX5DWjT7fG~d;84xXbqqF9!o-)^X;ir^lsO%_$HtVD$QMF-XQ zWPJMIcgfPzMauvCq+pS+-1y46UBDx)d0LL%#G8jq*uI(B;;b5l_8V>4>@IBUF3)`W zGz-HFKINH98hNUW}IE5=|XgxmcjjSgjtJ>WLA)Lz1PdrtC>{oWdLF+ItdRMsKdwB(s z`V$jTlQab^@CPc?3G9z5QBPW5#xMJ)1r}L44}3q{`7Qy0Co_8iV$jk1dD!`mU5~iJ z;sW=Ne#NpQ=d`xz6=bddM%vFC^ICQ*RALyFI{mE>tYzr&R|;~qtDV;>U5@tlh;G$* z1q)js6(La)JHu8q!hr_A?S%p<(IaF? z-=Fc`g0WN~mnVE>Eebhk>h>ON8EjEf{hTUW2(C;zEQ+Ji3QTsLGOv@D(rB;KvNE+9 zZ%xlg+`?qL^X$Ycx%aYD&hNeolsOrBMmolQ0nQbgsyP=DXxdPvmaaJK=bBr>sx=CqdFbL^Hiq+ENhcFRj_ zU}&nM0;WlcAvZ}r5y}s_)fTm4&@0%#^j4FrCf&M?+-xar!K6-$%#>Kth(LzJ@YV$Kcw% zsigOO*k~r{EBQR+z^UzSD?T>m(Mv!#atGKAZ}omY+x&juuemmq zZIFLGpg>*8zEp`=n?1z@6kniNUR*dmrW{0zVedbg#+qSO|4#gDlwSU2PcP6b`6n-W z1IU^DEXjHNA~55ASq+HSr7@o24)$}_rDp_Vjp}wjjz6w=hkqX--*;>o zXh-@4VZX(NW6OqOm^00BPwR<*9bWj3*bBDfiu|dkXESfG;XE5{`^5rzpK9bK5eWLT z*&;*KaUu$>^~Q1*derh9IP-?poQ_;w=4(2+t_H@g-n!slK7b9mcN2W-C5?FMPR{rgg>K>X=p71Q)R`a&@1f-g z!LDF0A$FU?T-$>Vbq9Cp>r(H){@^obLpAv&)^XGy$o0tItXRB#)Hwy1{*szdzSu!9 z;x|VCr#+ux(dn~|lfn6$W)n>?M`|CD9n0ufj=$?TIlVF>ef;l9(F6NP;)AnE@BVs% z_n7Dq_(-c*IuZK~LB6X>?8kts8d+1zY-O)WB^*!zcG}?j1hqhT>8QYfKe;t8Z+y&< zk!mSU?v}4L!7|BM@mI$}&zQ9zqpRPihCTs{OAzm3h$yd!MV?#C@z~P)I~4KN@%_Y; zI(J)vhkSXp&H6h#dEq(J(be~^FD&VvK7-@<7gf(pR$p#aZ9inD&+{%7KF{ZmC;jhI8}J)`rHhZ){~^|OXeX7HrAbopZi?k4nRRqX;HW+98L52;52{@zI~CUGQ&TR8zFx8mu(PBhtMU- zzAR7~rjHM{kIrv4K0`K^U>ig1#l-(W2#O;Iqx?wQ%>Ygngw|*9b^QBbm1ThyTI2N$ z#sk+I2z);?vI-N)7X(-5T}F**;gsYGzzhR=CNf%j42)Ol*ZTjAwRmDL4h0P5-~XlKFDsv)mTRX zJ0+Vpax3z$RC}dz+$rt@$)z?vwFQ(agZwrZd3@GiV);fgH%{t_E)&YHvV7S+=zXM&hPjej*D|9cCF-e%kz3=w+J#LdR$6Z%E-_w=X`Ga8OV~wTEg&`*I!0@i8Jx*#lRkmL-)#zaMa_U1j2~ zmZd;GnwoX-&Vihoe(W&dRo$w6r{b$_*Kp3k7nx#XY;Ec}J^KE6`!tkaY@%=|Hl8|= zjXao3Q#Z>JE!;6bTskf^^WX85n(3LP#+D(GGba&aAl?x=3R*|Z!D4jnvO=-? zVoYl3_X-7${DgS(Jba(u+IBy254E1J3JB-n%gv?b#+~oi9k)oQSkuTllt=l0oJ_b* zp~rU+lJX8EMNdkQ%~68aFGH*=V&|$*v z(7r=o7er+kOG&}lHQ)JIhXD8|tvyeUTE15WA5+|z{eD-Qwxh^_Gv-X%P{=&& zkp|Y*O5vyPXV~}H&A6pC4fcdRwq$|CJ12xuXZ?FEc3B@j1lXri=gq7+mdTK6z3#=^ zM|T)Y41AH8W$hMUOE4a5DCRAtdR5l*b)M)ak~xy;pbg$r_SuH4igwMQQzn{#TKy;` zb0j9=8dt#yURV(<20hO?VaI>GhGg*IYsO;0f|XKqu3x3@b-M|<0nx1+2pU4543g?`F^ zccfy66DPH}$K5G5S*M=hEH#8;Y@aWpP zp%CLLy9+~xE4n{AvpjGhLvAUFG=&43++9Er=aU*xqC(yJ+^6GOU^3pOR#VPkLJ!TG zHm)w|$7k7$SoXH|K6kqo=E3%(C;7F|3Cb0~ol;Ns~ zxob|`@szm7puDx%ve@)-{K`pSnBwWD&hvV0{+67!q`LRpFm-;F)8|ivwDaM+G$WjV zHFB(;YED|;&%aswzWW0-hMs+xy0w1z0V9^R=US4vdx73vC=BsfbzVYvZVO{qW&33& znslI##v?yS>ExEucKHX^t5_1W#Z+6+4DQun#Yq2;uafnz)v_$6Hg~IzdK^hUeRqB` z*62Z3&eKVqfY`F{wW-hiFlnqI%*sG`BCG4Cn772Cm5|42mSs;CqZfXu;_3FB(0)Ph z&oym_5}R~0ULK+k9JAq%Efxd)u(Z8*szTbJ8b=@8_wze>sq!q0Wcv*43@f!B`bd*j zFudMx_@biz3wx#&cDL|>N317Ri)%Q=RpirmHe5G0jtt96=AZSltTQ^cLXPW^BXrBAkh`-|fXf+vt*o^*}?04F}e1+tZbCQF-`QL(Y zabI&bBBg;1517rI0+yqP>v2Cp+|b4RPlpdk!uRB0|DWpu%o}8 z>@e3wOKm*uqB>>&wW~p^oys5#`n4iihcUh&rdJ+!V9h!exeCKWai0#U<^a!|ar2Kr z^(Liw_mM<-dHBxbRFZNrMBh3hoz*2vstSi4ZTbArluz~Kz6Y^&_oY_}BomS7L?8=N3^m`trxS$UEOqMhjV=@Xz z`D?m&087ZxO=FX@rh`U|w&9KoG!X3?jpcX^*{I_L0Ji(q=y%CdYHtYQo&uJumJ@|( znr9X#2sifIAQ{%u%Mw0C5=7biW}WeZS(m>}(^H=KC1LTaW6?YIzV>JQ$4lR+xxWE? zR7|>B`8fWO`7})=ME;rvZ;UYV1Nn02M4y(TuQjF|27rzSVs*j-70Lnp+D2fFpxx6M2mTjq)bD)9b5>}-Kg zo&1O$tF3pB$m}&p$Ia+dimc;|nUq{7i`+4_{V?4kv3soT_UoDSn*^r=y)-$CQD54V zO%Z2{8JbjroK}l%6sJ6M8-iakQ@0yyYX&yx_=3V@gccjG?brz<&I}jc-`#L93P15O5i!4aOnpTX(%!zbG^@U5Vtdac~=O=cyOV6SA&1j=^l^_6roN#$Z-m zbRlri{Os7>r_^5S=o1@`CF^o?V*b$+&*W?b6gwu@ptlnB2B2F=<3JoZ)8JzU@g+OE zWjpSN6a~@aBJ~`LwDVb%U`L{2{z6A=Xs;dh1NuKFTA$g9YO#Aax(%j_ZRS=NA2wSNx(EDW=XL7`_d{*`mlin<}V9 zl~f1cB{eN$fN1^ixP?uvCMX0$}{FRs!rBY2wwi>L!oJP5Xgw!WCX+Krh@D<>Sdl%H>0{w7`B1 zl+Q9=R^cAp3D{$6M!ElP)g#3iuvy-?BYume=+D{wMZ7g-{(W2r&6cd zM^I4sX%^%ky6fk>Wb>A6>C!)pf;Z0T&2u4MLrWo|qd zg;wB4@*nn`Q+H7EaBjRbe=2D#(tB?n9^=H3TtjxT|8?MsBDg^@H-L10+ zkzvFxn)kDZ^CU?$Dgpm;Mfr&1u1Q38Y!*-B!j*8&QcXL4W}_;OPqou6TEvv+6bas)ZSz%nbO_ zD~m3fcPO}n-oreJWiK5Yu4rTen+fZ$1k}6sIGG7+G?}f>^qJ`xZo~-2Bm|?IRVCEg&k6Cr48jaH zuM0E34n2}kN||-{dQ~1@U&HmNI;+iJ!0Cu?1hQsI%q=9*H>10czhJ=c4d57GH3#lygvgd5Ly~nWBk=@MctKXZ0B0+^l>nY_Mm|O-SMcNbAYIM|aQZLuy z#~E?;l>M40c`BG$9#Va;_A=PIXydB5mvRtI-VP0o&Ewjl&YZUTBGx%thUIN%&gp|NPqCBOUX#P1}-s9?GsQ%_(dF zp=PNZcH89fT#|dC6@d-^GpATyuMMgJgC6bznv zYeA<)+Pw7riaXSxeJv=wSB)vGcjsD?%dVq1tO)m<*i=i~Xi_(065({YTTs=<&rtMTN&-JkAEfgM2w;%dt~q#wlXEBsOj>NQIEmyRbI-XL;IV z^^$mumuN|f8({q*h&J$&**3}eoIBvklwGn}RiS2yO)&o!DP;pHBcAB!i%(^4X|Sj%7~OeX8T zmrayUmq~z0tDe8*;ip54M=B889O9xHBR7ul4mXe!N!m-`R0}^+)sCv#q4wEL{S~lS z@XT=QPLJc&q|$Jj;sm7n4dEIJf(mPMDJWHb5Y=vT_IL&Rn$DDZ7>&-4Kq?34CGz7y zZMYSSG!l+IG?-!))F>_5zci$ye`7LVesWQBek&SZ< zr44o)C8O0-3+M@b8HkUcyv=E&z61x+)XoLBy-MOn7#ypG^9>YW{DBozjo!vW*E;EN z@AtDCyS(KS5fB%>h2V!i?3dHPY_nkJFc6myQ)3nAVFz->IJC}gDq|*QHiB`&iU%TD!;X7Z+Rp7co_{>kY&hhIWY!)O% zhIe^(B|l?K!u>`ptIBGRZpva(%|RFAxN2P_60&QznT;k7_9eqffjP@x8xD??{{i+< zn6KY1Jfq?+b5Z`c_+Av^yL{!HI)5<`fZ_jh%YK}CMHA`H)(UuS5nYgwgdYtb)XK#h zVJ<#xR=3QlIBQ#xyyi0CSKhYDeq>B|HVke7g5l-69_LGrbWxW44mNuj0MS*!a5m(t zYWWk`cl`k9{?ne|@F0PJTI2MVhQbnX0Cs@AIc2|~-T%4XJlT?3LJRUO2&WPd48|bY z@C689!`vXQ9{`Eki`R8t%%-W$@}KhpuVfiyIY~ z3)~yqGfXfEs#i3#pO;4PeiwNld3?TxXGrKq)oO@&BNDr_6}TWxJc=~KEq;YYYdhXq zn>LI1j@j8r4O^7CO^@2?d1)TvAMsX6zTU5EN}$Q!+3}isvqmtN5wE)1>g>alJQdZEt|8LDK!Op2;4%bRe+kYSaMW;>+v4N3X;J;jiC zQ4V;3^wK!6!=&8Ehiu6*KeE0GnjuL-1EVE0i**kkDOjULUg3HK<5iRlWQgqyr*XS^ z!?$8PegC*@#<*!**>84PLd`d>_>+-O^r71N5s%}?1UvR!ugI6-TgdoJB;oZMWCorg z2cm)VSQ}&tXWDV%?dG{jQ=ayaB?A6l9X!*icqdGSTt z`+gWx`8votouL08RbL&~RNwwT1Vl=d5NV}DKuSVj2-4lsN{4`SGf)u8NlOmtMx77VE}>KZh|2UWZLWZ9&_w2!{ME+N}LOU!U@0P==d6D~(P7_1T=BG9Ujxrf(u)4!|M;9&cse(tvTP z0I7f)$<8wTLYK>bqvdc?>}7a;jc`xOjs%74=B*)GW=gUfNMlO&nta`GopJ~9s(zrv z17cl5U0sHh$+*T8abimF6)XZz@Wn`fal#Ln`{esxy29J#5rVUW9vst3rH(u22g*@ zR+q#xo_umAO=*xSALNg%6Mqu_?BGQEg@A+zjGWlvKuN7DTcc1+S&qE8!`Yzz0!M(K zm`y%*F5@SD%<{6Kc968;^%zTjnz;Yj{(dddfqZJ}nDFpL5q-Gl@Zf>!N69aI;{wEe znc#+4)lj_tv=wJG9Q}1}^e;Kb@Z=?~1#E#}c0Z=%rxt?WX8-8CW9T z9I4?bru2n2`NMx5vg7L+Z)y2J5i#N?es|e9WnSx<5oeJ&b>Y0*(>c&0JYvD<8qP5r z?2D{VONjiCx#X2ut2Y49>|;3xbRVs)51t&-N}4fLTx*^^{$4qf+rCfIjCs)wsOPoq zJgSMdm2?0~*%R9Ivm7$g*XD<_<=^)zc9N~)y}!I$@*jsaQ(w?7+GT!3b3D$fCub9D zs6C}$hH;NfQ{?aLIe+Sr5!Zh!?h^gmHY=e#L0PnG=ri9(+?@ld8LQG)Me~*K4(?tB zbP*c;Z0_aV_VmwiFB2L!x84ltt1}~T?{1s2_UsdiOjU7}N(nP;8EeW@@mfpI)bOTCOPsZTwb8i%AA zt|La>AA)Q0T^;V)4$qtPFLg>q5juMtm*p(w(ku0*%N^)&M-Ry0TEq*lt_!GN1PkrH zzo};spRCm)x*io93vGl|7Shfh8O}e>s-#z5GKJ9DW~~vboBxcG+QcMx6-`ceFd}>^ zn^r^V3kB!C*%OI52rXebGK-fpx}^U#f9VVfHl=ZK}oD7npwW zyz@cmy0a{*QfxpV@<;l)8Y_td= zAUa$guTsBhcj)H}M3;2iM(G)fn{A1&sZ4aeT@TTMj&gW*h!71ZqN`>X&I%KwF;nl# zQb$Zg`~N=PU2%z>O8YRbh-@Q;dXKR@+w8LxwZ>DNk{2@DQB!SXp0=RRtB;d~#g@I& zi%npw^*&oPdLBB=_B=I9*r-w4>WYmiW$Ou$pGhmrau`Nw2$6V$eC)`y-;WT`N&mWTSS3IE>c(g)7c2YcUkYfMmSB3bWJq}X8U<+qW47O z$_LvWg`VvqTFW}6QeOzD)b!~t(DSB1Xvwr}gs|JN#_%g*0 zKhZlbCI=4LO5;a0*~Ad0u@Ssduzr=SRO1~JSg*hpydbnWNwhav~Hy zFgz7-F8B>Q!T*=;T60TxmB#a|Hc1At``~Vn1rdaR*%Qm-G0p1sq^(B5rXV~dW#G?74$nbF~*UbHM!hg@m(J7<-j zeg?c&@^5oQF|2`b^uL5d;Kl84465i#x7M;BEtb8+jv@N`GPASJ80Vt8-ODc9=K_fC z{qLu~B2|!Uf9Tcdlh9LWXU`n?%k?f8=Rmt}+6115RtWh5-rK6fqsKaL+Nq(jnYw+n zzQg_>q-pFp19GY08Uxj&p zvqGVy0MKN?2hSlI(A-a^Kt^qA&`~Cq*HmC`uP~QZANxRW|(#%#&bW`PSKk_dk%m{F_YcJUiX@bv@#x> z{A}9LzDQY%e?8O|>4(zMSQw+%bU7U_hzom^UPU<(u7NqB)yMu&vjoHrml7n6a#Cw> zk_dHCUL1Tq_EwYreXPV)C<`Pe!=ypg<*N;>Rf1@7M}dezfZ77#oMmG-I3dg9HzL9URa9yCG`$+=`ChtQfO2^cK8V%jQ_DZ_ zT_=RuCNVyNt4X2DZ9VIl%M{-84nSl)Srk+wU7TxqLDiSw*W`FutSG4AZ zv1PKtPQ6j&w;|o7vSF+W*{!0o6N;?tVV&82agAvbOjP3zYE zag`VL&&uqGQPJHe1a6F{svlqIg}v8}BuRDWpC>$zT^23=?3pzaGTBR!yQC-(fDL#d z1~mKaC}2j^Rmy~XF59SXS;j9A24$yyB>Dp?tQ1gXK2ociD4sO?7K?ShJv~=v@DaIQ zUoGU>+k>DlTQnNvav;Aj)goqo`A~sTMf~PEnOs9GBht+H^(^fq*;K9@$;M)qEWK+i zoqt9P@$y`!6ZJeJgYT!2umQz9Nn*`FSc@hr@2a@zylM!E_fIPLq4N-082PUy0(G%lLTh$hV*8e%W>Q)s166fjn_hsK{8&dZ^+TS>~^>P!c(^7Fi7nHqO8Gv=A z)K3y|$t_8nEw)l6?7G?H^*L3SCy^6> z)A$qSu~aH*M|E&|Usma&aHxkW!FGz-aO{cJyQl86XJiDWr9n6+@VQ*K@CZJ?-7MEt z>iv>ck|^gb_C5P+ z?Gr+)Etz>wQiT#zZ%0k~=+;M#Z*n8s_yP@cCXN_OJ8F#McTAaN2@f@8ndoc`^nM~b z(csBby|ID)8_)bVv5Lm#dn!tY!A!)1pRt0W3P}sVxy>))rOC{;azI3O_c`no_hP6| zWu)uID5uozsO$GM>vb=6%327blo%Gr1ztO!eCmQ5lEr?~SW>Kd$RVXyb;>O|(n#4q z*`3I%6BGWCFCuOhCn;ntFSYCX?b8}1OBULhLUxyA)70j9e;K+pKpivvH&Al84IdaQFg_yrwuVh?+jYX zuYm3tJM!6&i38w|iG8;FJv^7;@*?ODIcJuO`D_L&a4hhua41a zL>JTqH|!R5>N8hAZxMw53^9O1wFExE;H`X>A_Lo4g-A(v%A_2bcATE@ZLN01a}9JtPOv;!-X@~;D_y`y?}y1`!8G9UN5F4 z>H**w_J>JzT#~tq+y%Eh{oBWkd-?xL5I8C>DICws!u_dhES3ll<-~jJA_l!#_E+gr z;AQQY=yXFmefl&AE|UmNEtd7tJK7Pv1~O$C=fa zDkx(r>kkOGxM_xAu2Q?=v2CAp2On_ky2&xEw$iz#=~YiewIb%RrCP{HPqqSyyySP3 z<7%iUXwA&5^PVM9scviC+2+5Dx|csQn!1*aYq$ZI2edEA&Z(0G+5ork&bU(;pI#up z>{yw^ES3Azd*}BB2V4Cbn991obHGDpTx+)GLY>K~ zcreb`k2dhvW?!EksreOoW1StTA|JSmj#NQ+{Z%Y1XR?$`2U??{i^ z{c>?et012*k5KP~%2}9(W}}y}Qx=ojN8RR`&TlfGbiX}9M*vi@&n>Q5cx)RgG4()E zs$B6>XLN$glHnoj(2s2{oKcYSeKZ-L+gG3KY33Rts^B57l?lzo0WK*=)2qE5J%zhJ zv(vjB{omC#e0=u zZEvn?vZ2jQ>E2V5CuU^@MfLAFNlPu}8Qo7vanY?u*SfsP$<+O$tvv!IR>k^}mP=cz zb?ooIVNT`pN9>-)&WC?PJUl(BNqrzTXt5;n`Y@*G8(m!Q2IX(l+REnYhN{Sk$1vaf zFLlJrat*yK?PtxVcNAQcf;gO;l(OrVSw9|}QriV=$FO@jls$W&&SBH?0TpF;-v}4HC3L}_{{NHFZ%<^f~9BWwFgHkA6GrjjFURW*JNs2?ek@iwK~Q$$`y9C zd7#g$eS9VrBeMv~e$ZC=n=oq;h%2YDH*MIy^+S5l#+%?8&ON?}E`JRGU84R?omwuF zDGo#*M6~xVV&osXvnjdgxg>t(?d_voiZ8~EE7nbytN3yO$Z1!$!F*aLy@996nJ0z9 z7Z;`9UT>y`Rh%LUNq)?C>z6xmCm@^bg!@j@tLE>e#(X`0rp(d%lU}}yT`1=zKAmyA ztYIAoUEIs5uTVa|)P0^qeZ?R2mfhaF{4u=_r}AB`ozD6aH!IzmQ}s{*W1jmTNDyTi z{mbli>!w))`=(1F2_6Y5@&YNMUjBCOd!TgSI13Z`i=@7d#a$^~k?CZ}ne3I(C;6+7Nn*cN zYNO%Nx?uf zXuT-EF-QMsBZ@-~&qA?lxQ|fkPAS^oRyAokx#b;Ry0R97I~y{;+@d4@=$A@-3H9Y% zH%wtjZlp(a@R!?;hM~g!M`WGe4-(mh@~A4fJIl6gt({d518$Vb?lv1Pb{T?v%Ta@5 z+fyDXR&HWXB9(#p(bs?HN48Pn0JhoF@|PGk!5J8Q3u64A5fNbM0%W)U-7c`(NteX8 zOIYj|i>%sc$tO_iYeM{sTr4p*a#$F@%1Ro^kEK?-+i#xP(F!F`*-hM$+8O|q5r$;Yy~*$={H=O!FDPp;r2-x;ac)Ux z&w(9q9Cz(1*Z5NQJu9Ji4?P-@nLJgZ`A4L@C{*#?beg;ZvVc`i9(r zJ*OjAH*Q5LdP09up6BI3+Hi>(*=WsY-@~u3r=jC_6ipC7P{Rm-SSRjI%1qyQ``PZB z_?r}D5L|($1gBy?T?|kCtpVPWmfuZ~jP^ZDlQ@uT9lma9nFHjP=e#3l_C6gRaNDVe zh7Zy@m9phe&o_lzcc#+jJ#3M&2JpmvnU50B7=;)<^^nOov!DkH z3!zqza8!ZMizam;^;K7Pj4kUo0V>6|;hW?Jec3;tk2^NK>%+4@k!ZvHmKFCHJmG-L zcyq~B48!zKQ|aw?`~F1V%PK^bkMmZc9ZkeOz&>fH-|qI~+ZdOK53SvXBl)F=+Hrb= zcxWNRO(w5G9gXzEL>^`fQcf~y;#o-d0^~?@zh&bIOy438<;Ns4jt0vj&oIVpmQP4) zZxJup6|SY=R?dY-H1inwC3qEzY4nYI1$7*%>%x5QoZ1H`d25 zUj4T9Jft;1(1-f^cHap`tk)Ozg^cveELJ8n;>Ra^D4ak!b6NC4oKs6%;< zxjb>occcN!G;-8amzAS0lu_}#yb|Wzc4ws$2(;Vl*q!B*2UUQ4wHLMb8!|WW2h>s6 zy?A-CV|>S_lP7<+!oWDLKnGrB*0v% zCT)RX?V#9SG&YMwqE5*-7~!jepHR}reSMSs4L&~M;iMcdmK5X4zBDs<@~IuOgmP6X zzoL%&`fZcpV|tv7RGgQJLkdu)QDEFx;rmrq_y=T`zu|~s`%Q-9d`4B}SL$?Ml4cM` zs*u11%YL-kdl+VRV<@R;tepHchUSx~?S612n2r*q)N+P^qCV*27=J>_N<*V)*-Wmz zmjQ-pr`M*Iq;!h$*?d%`{zY~zGHXxb;iz(E0L?9^#xdDqAw<~S6-m>!VGzpbax?t( z#IA2|4mb)eO}M1jN2|U{KcL!8cY^D}zBE5cx;%9g?xQ>U^mMBZvEp)8HUc5vX(4Rn zUJZh?gr0f6knfG{;iXRZ(Ip3jLVV}0)`51cKU5$abS#%zr$lj=$*~*_4qj(v)!7;J$^OgS*qQyQdhE3CRwr67L z*>diC>9lSyVz2mXdI#%rz;x~{93UNCNp&@oO`&K?hBNo7q0~K21huQ3TIQ;3!O3>& zJ$utlw~YiTXqOTQY9QUU2cC(Xyyl} zYcj9cPRSLy3L)stv{BO+{VBgiYG@TymXMF@0OWApCS|<>L?M768fc#6V0+SlXU{G4 zXr|fn`P;I48tQfwDmOtajNwv6&N8BDSZw|*@<)2WwB51D*h|3TsUACWfPBls1MNp&f{ic0-9QOxw964h!x2tpIHYc(cWiR^}hIilpXi!?&$Hv1fUn~dFFh5Mb z91)?#83A7k#AYJ>LD2t7CMO9$TkfdsZ3Ileza3P!PT$;idAjOIxMPChiriCXzLyu% zhvP-&9TOgFLi0puvEfOSSUxV1t)(u2P;W;NS;b31TH0K7-(@PnwNqlg;-WB<-f-Nx@*E_qR=uF@ z9LS!m4HlEkO-ohp!#bEs6xE`&CuAWFp74r^^^;2GQ;f@$vE)CqB*RMPFm{!qzTBvNqU-M%d17-}t0?st-9^X*C{?qEC#uO=#y ze|WO(wp4qd$L$swgy*vu%Vg1GGw@#VLsrfkgNYeluTr!J{4{CfI1 zr{7!!i125Iob%LeJ!*x-@kuC;%e!t($G@PR9A-RJ*4N9aizc}odB>;k^B{Wsjopi% z4c)xU1jUD~ng{GHUV~f!!?GUD<#+-ro(#}6~FX)1`Yt1Qi{Z$n{FKsHN_^Ywi zXym&g^OBuEXLq?jX?hP5hqP6cx!=Pqjyxn(^?FIHYTMOVHze(Nk3z+qoS4PmPUN@X zG7Z}WiB*YuEsVj|^~mT$=%DaVj?ewa3wWQNEidNv=~|JQL>n<Xo3YC?|svT@%Si95e@0aj%Z)znz5}G3Fr1lrUi@R8n~}bF3OZ~g;1{# z7Pzm%lZO*jylh>kDVPghT2>Wlxn_uM4Duu=DVGW>r*u78w23=azbICg#q*}ta)nDg zQg4<@t`aSB$t64dBp@%odKZSF7A)pjxHZxrm(R8*!}Ap9_`9vLJbhk`0OfdslA0`Q zoLYy+9 zFkTMl$UEz>EK5@~74}k6_VJh-cj`UqKIPZ2`(XUay~u~)Yn_C);RE-L)8Tb#XXPcO zo!~m{NPAL9$IpL6)(0B@gG+h{D876C*J1j<(9(Z+W&nfv7CQ8^L6TV~csm9nppO;} zvJ)RFNy>RWd8_-;*AjkMvab5rq-qj1rawOfZ-4Xwgp)^h2rf4XJGG1XR;N%%>pJ6x*VRF5#`Fz()_28awON2kee3zp+q}!_$H=M76 zwra_LWFNfha2a{}2gE(bEFNVSxX@f>*fzpyETUcqZm#T3U=mu&zQz;&BsD6IdD*RT z4C_#4T4_vpY0#hjQ7+`k##)olIsEvhs=46%-qeq5%T-F@9<<;t(FR91`p%`I23)p7 znWL{FZf@R?u}iYioO=4F|B}dp=JM}3QpdUjnJeKVD7xvj2gS)IfG7Wy-)~u8Wd#sI zC>(vm1XzUP8E^waV7j9b_0btfkH-2<>l^QFR50_k&SnTIm7E%iE1Wj^4T67=O zZm{WErOrq}eKK@@{_pEoiN5Cy%ICdu$v18{v%v3VjAD3<;K!3~@b6l}F?rxQr21fS z?kd?m_3pGk21LIBp0_pu_jRpl8avulq~Wq&;rYJ$3k?3P?0wKZgT_Y>87rwoFRNl~ z+&7lwSfiSaL@Zp4IeKvseZxhtq)s?cFXT;|ROJO_z#;A7L|-VW?U*JjZTNaZnAXK) z#44_JyZh8oeb2$LCch9Q{blBKCmoR+H|A~)zUU7Lcqdg6`yrObV7F88A4uN?9)Ruo_x)4UPlLK8Kpw* zbnobL_C|FN-Cm~u`Jw2fzYmM&P-|+=41~G*n!;7GR*3@jnH%zY*5t$o?hhaOrs}AM zot0p&FSqp|IKh2TqskzmC#a3JG^7I8@NAiKH#@w|kS?Pv361CbdcvQ^GZ+82xyO&M zf&8z}q|_h(*5&E36EQ+V^9SES@MQ%W;y%a-PO@Kb1AM*qrk86tK`Zc!PmKl4JXeW4 zd79kUxZX`pI8mfHgVV)ePw)A!GC{z8E6r_&V%%6qUwU&BpiCw?OQts(z_!2kO|bre zL{1IOa`#EnZG(VhcGd@#e^*BGqc~9r6cI7;Her>jP6MOgg>CXY&76h z6@Gq6<;%S)DdfoOxDgLW>o>REG`DPM9s^YF+*kU!LCOZ~66lQjn5OAq<@Zv%5HFVDD-JomvunIA9T_)!CnFL#^sFK^(?d#l5pFucuv zo0=az4w?H0Uomd%HdO-%+SiFbm;V8Q4R8NzQ^+~+3piaSAx`7_u^8zKVMz{J?g9`S z=;vx<_R(&rF9nwBR^(};EYK0*T?vOfo`k*k9BL!VFY~`iXnxlF-K2YE_+d*@mSN4xx6#_gH|PTS(GpT}fZ{ClEPSml_znKuf2J%=oc%Iky)zv= zDKMYtvfcCAsSX)Hq7LV6CN;ebc{5S9D1B6Aa8>3&r1uzs!XZmt_}K8xk5HgGL|BNf zy<6Woa*@L6(C1n^Mj+I@)$$#pL>2!s{LS%D9w9msB9PT}HRMb;6V|(U8h7~8szfgE z>hwhyc%D9xb{4L?KDiC`#kN_ktIU7bgz2_8C9^4m6sUZXs=>V~ylS7}bN-csB@K1n}KX|j?8j5s7wvV9O`kSdL`Eoz|V-@1U1ans= zo))Xbc%lyo+#@HXhx?`5{EzIPl37{M7jES_bMLE3zZv6M`$jZKkzbdY z#6#N^lai{j6?lp-QZ+PA%v+Ir=pd%%MD_a$vkP!Yqn-)AGhdDoz-j%$pNOJrTxj zDW(iY8lwPjL1@PJ(xc5iXTZJWb#COUOm?sc)_1;VefJL3n-jjI)+by~*(-tP+ zHYY7`0V}rT?t9Cc^oou!Qx+A3DgNVbUfxdzxY>0e)WT#wKeL#W0QY-)f+i21M^sKI zioC|>v|l-0&+8fdmN`yKIKcNQM5G#yi<>H=p!+j!LPYy;4hP)89jV_}bo4I9-z`>c zfQDqKUq8YBfp7dtT(U+Puf@l9S(nb1@>12;w%*p{Ar=1GhvlC7tgWYaoHQYAFNsT! z*qqc6)fNbL8Y)pD0TMw2EAK{Stx|abAoa zs+fU&mTF4Y2PEYZX=jV^4cKVe9yDZS9TUE{ndVI~^{w`ZSnX6=%eEM}kV%$n9m&IK zW?xR(l5x5SwmL*AaCA~VrEyuxuCaP8j4HaXth~;x8h9;a;Jdadq3R<2^646f1_Bo?oCm`Juj$Rv`$~y=Z#5w6} zKs78Fb>dDdwd`99U>{<>Z4Zb#=?&yZtEnC!fD_1=_qY5YJ8Z@qMNzFn zi1bZtr(aZme%)IWfcXME5557y4Nrs$*I2keLZ%D4cPLE)_}`@Cj5gMNz9ZI8d~^uP z7qx@qwMzgJR+Xe2gU~Fxm-|5Qu^hZB)MHKl(D!9-OJb@lQ|l1UdlzG$Lb;0zh+W!Z zZXD_m;hd06q0#1|f}lu&lN;5;?>5jNX4LjT5!j#)6i~;4%nDH{hpCIcVwd{ozmVp@ z)lW8X;F%C0l2z%g{^JvNq@0T+$QkdavJ~L5ioVqZnp$k zN!|~9l4rg3H`n{+LIH0G)`P&Si6lJuiIrlR-3lDMUg>*T+P?%UDQ#dbo7@LmRUnTDce zY1^8Wt~}pYV{A2ly9xC*D~vQgYSR_uev$f{fE5yux_zZFLzKK-b6c+E5X5%4%hP?Z z6*+^>87Nha`m-;Wlr6`hmLt7N)b3{nf6oU2WL021X9tAy71)bk<+IzFG*5tl&Zt-c zX>k4uqs6LW#hWSxwqrt~I>~XMI!lFC-ueSVHw@pfo8!Bz(^x(V(QF7f_B}=I7U?WQ zAsZhiA$#S;GI=9W8I=HD-OpSN?3uObs(%_v+jtntH*c!66X>>p011rrW&bcLK%M2C zqJ*PBZtRS}R=|Ym+O2kCqul8p#WK@;vZYu3gC0h6a~?Q{vtw0#DVV?>}~<*8Gx98dn)F$pX}zCW^OQrUIZDO$4&B zGW*eBKo;l!F)F4VU^IbW-8Q2^KuO|WUEH$4=5(pU{iS7t9kQ5#mzJM+i1+G(H7+o6 zkrgBU5LUh&xZHsjrL3BJUq062)q^~Q+-R>os-70qeK60?KW%~# zJ~>LLfTxJyWm14Xx(co~9G^LlK=aL?WT7dSyXelaf#uWOay?N+^kMjt^LTG<_@h7l z%pObI^p9EcS>YuSf4AR%K-Gx>Lp7`4MBiZ%ce`1A;*IWod|pb2rd;oWoZa~eZ0y&Q zd&^kO%#gPAd5>Bo?-Wnn33zzR_vqvw2hHe{`1 z>EYxb&??n5Gk2y@O~Usfr{vk2d^Cw{o*|^oZgoP_j72Cs`dW8bu>s6&Jc%IM?}dYv zr_SV?DLrconFqf%obk)WZ~6Xe*<&!}iNP(a{{ynXgwC$c01Lnrd=y-k47OJNtc%8i zv-!NX;rCh)Q4n!4kwN!asv|{|VqG>VP&MZ>Yz|=&ZsPB63UE-yVrIwS94|NT;R7x3 z+QAa^+7f!L8>`)s^p`nyMt7tM^rtMpS%LQSwoB002Ps^%%(SCrAf)NbGa8WJrj5jZ z2fM%+E+hi7kIRA%VmIfTg;))U^3Y$oH}uh_%U;fS(|`u>^AVrtHi2 z-!|Q=)HMv*wm@Y2GzGP8rGK|tk3a8@J?%atuVeSfbi@{S12?Ou077t|XVoV~-p%px zZeYe|o{ct>dZ*jL;8UdCmDIZEvIp1#3cmPNhU>9dLmR*7>jxLPtXS)+DadksB^XVC zz&(K|tb9I75wB98VH5#ma-^Vz@e1Gut~LP#sP`MB-vLbMAx~t_bZmLK7T(AN&wQW7WtOQ~O z4s{oQe!Oz&vrZHHa!bfOmPX`$)rq!hp7FxYbrAVfLvV-cH)?l&1<{V~MKPT9?sfxc zh%rZPO{m^J*U*{o2acgkpot8r@=IG0^LTX$KWeSF7UtZS@odyoEyq!Q5_`t8$C|5Ku)dZpYOyOHnLr==0Z#uynO8@hSLGds)zQ3ohcor|rd~pHy}lI&W~KOvtL2hA%0v zkt;LZ`$k1p=yXV$ug`)X_CwtJ*+=pU?4dMsF`sXvYyn9HP-SS~{cFwfm#z7A1alSm zYGC>;+}Atch2r0ksl2I5V9mYx13FZ@YtIIx`To5@$?PafgI@Uz#_Hhv%`G(o8!6u# zPId5?+UW6#an^hap}g!ccC0+@dr75_5`9@pbZr&BZgLjigG^S*KI6j}r%#yN9T(?N zF*fJ2j975z_@oda3m06mo$p|xb}KA-G~ScH$^C6+#0{5obDpC-Vp?*~k=KIi$uu2_ z_MSnKDVSy9$mn?@d-=*`SRFXM0kT7(&6aQ&AdT2w{^S zb=!_)8YhorH=T?`_rJ(_k^12EO}yr1A>Nqc3oCDADTw>@a3rp?TXa0wY2YB#77)(w zK9zFKRwpP?ql~Y;8x!!vu}NO@M{kxRnc*+V%(Ts|9PI)!8y5_N{!S{}r8(~$>a|U_ zXRZkS+H%b)_H@%QegRzOJ7i`7a^il`3es?K6{ag1Ps$Eg3Ita3pVx~d$whWkVL8cCu!D3r;b zNlRC7mPY0oU~Ji&Y0h_=QK!7q##u@ViXd?|V9Bd`#YNL*)B%OnJwJG(VwWLP*^nLT5K5-38QaR$tpR; zJ9OUZ)W41i>Mi(+N@*;NlxE|NooAF-6}lU(!*&nLwAe7K(I@NiR+e$dfXR|sSbk5G zHhoTqHDG{Ix}c+d5W#mRq?FLk$aSl*F&b-zJh{}FiPk8Js6&KT2EGtK!1@i+RX1yI z`Y0H5wI+<^t($H8yhvt$aGzvapwncgQ7?h8k6wre32a2~P3PybRYiJsLC}wW%4&9A zCE0)#KE@Sw6e7zt^-;BjD_Uq+UC)NA!?Rt~{7gK)(RWB(*K*VX>=LYe*{vTxL^2Rz z1uxuj9y18s=BpKAoFHU=c&h!lBv@FOocQf*AvuZfR@SN0X;hWIS54ZaVYVSl?59|5 zN@-BJH_w<5-Z0{RILok=;DuWy|a+qlJtmLbG znk1>5>aaqv;bZkw^LA8C-pj8mLVBuXPB!8o6glZ9<1%BNk+J@lsYBcOe?X>1xlMUC zaNLsbj#apVM*_Q}K~IW@nTxm87a#izj2*Zdy*ry>IYnjPz|Xu}8*MJBFu7HT}4 zRRynm?<+H<8e3R#TA91bz&~g0Pe$sQw`uo0QRRjzd^RRIoPvk2^Tb^xNlyz<5okxI zT4vbK?@?C22&B?5O;AwSimoTKwk1CtPdS{3<4uT3L1}@u@;KIF!f^WJ>!a&(*$PNY zSy|#juX5MY*SFS!NeQIoA$5u&IERz9o31t8i={QIjvv9RFD94fe0qvY9{8RJcLC?M z?!AR@cIl9CZ#ReT8IW#s-hYHJt8#7Tyo9)|rn%cG&Q7jGSTNz_mqG><8=@0tZRoJB zC!L*bE!Yb)M=n~3P*RFS`1%9&_Jw)|xeP=LH|$XSo4(>cE4(y7*MRY>x`B()Z!d^O9@e~m zMeGy;pvR%@iV9FWt!Jw|J6bu-jR|*R_?N-gZ6*TlZOqLLgU#zrC$`%i6#NH*iXX@N zZD2(=)^U*xOt^(M)PupL+)gg^Z>d*BG!ay1$(w7Dq>|#RoiF9m0dgJ7SJMko%Frz0 zygBVeNDfyr)sdKrT_=gx^pBJKJwWleK8WVm@_(vjFnJF|`-WvNR@(gH*YMGdY~^3KjTA@R9Hfpg0E{S{jA&y5FB*xt)+P0udFS6ZU@n~IvTJ|BoX z^jv}a0^P&|f$FB!@vi53n~tWZ=~Tb$q{fUq-RxJa4J#tVpl|#-H^yaFn|}DLorw8V z4&MYxqgB4Z{xSi|FJC&-R-A9tVVg2N(w^F*{+%RzLAK*<;FZ7j+$H2Z@)ELUcW)KG z6uPmPntR0Uz1}jGr+(<`@$C3$hOS?%KPqlBVZm>&1N_S5gY-M3uxGI7=0v4|3yV5u zpA1Cb?9$}i2`IVrimg@88X`t-L(r;q1ijN1Uex<#k12y61}X2cv{d=|AYb_Mr>u77 z97Qy~(ODe)Ng6IR8!;8}2Sn$~c=)`pOc8p_z7*OIn^E&4g4rO>AB{r@h*MdE2YsHvVer$!tK1?``6) ze)9B@m=s_@xP7gLX@$lE8ej>a0p8mb6GZ|IFzGOg3~{vYw`R|ZVxMT_*#e)(Ir4YD zpniL{l`9#w-JAZj-e=MIaLc~gJXYKZQAkm61hgJD3qDFKXg5r^wfyw&x8Lw1MO&v2 zF#QIgAe4g?6uxMIAH$BcXNaz)Zj?b*HA`T9)?t=C>F3y)(LilkmIHZ5cSVT+UvHWS z=vMpp8H*h+2fFR;l|3{PebDz!iW=w~0ph)^!h zoCz(8#|&<;Y6OjNwK(NE$T+3`z895&u7bPN@`^vq67Ej$j`#r4zs5N?yllSYeO){tt88<2_z9-~%Yi7D-4urc$Y{>T-3Myv3&Ka# zOH#0-Q8P5KB5JM2Th>pwFQ%_XaAbkc^wa>FYe&*ScLG$~0aJ^C0EE=kjf@XnBf7$c z{Ib6D4H;Jwxei&(rgILJaeBp4f$mPng^*sJ6S|)~@&SCZcw9zOFAyb;^NQW0drRE6 zbNM#MGi6Z>=A{PYACSWDW^$DJF-|};(eS%>ZmiQ5(5*X|5$jXU){_W|DrM6>t-7o2 zhOdo56CI_&R@4sSwR8#&hT?3^ zYEOsu#b1%i5tTvg%5d7ttdku(2q|C0-sO9W!_Y4Z+W`hl2fP}4tB{bR<-^BM7--j% zYmPsy3w|1I3l(Kr4=;l9StZi;o3YRZOCw*W{6DU~JP^vh3wt6dg=Ci+S+a%f5yrj@ zV(cU;>kuBvzKo^F*w^f29}L;D(`Mhopk&FOJ^MQIe81^=-uHXI?~l7NZFAqh`<~x9 z=Q`K9F4NXa_BzfcKN2oR#+}i#Bnia4saCbmEsG^Swf{QfAdO4#DqMWe0qz0uFFn;n zbyu&T_B)^p{BwmX(9@*7nT|m;;mWq;$LrKoNaJda;&xVt?PfB_kI3C4z&pg zG2wdj+S)EM2X&Rx53>d5xO?ucI#4h=Z~DFvSI)LR2+0L8YJre!$167-+$noMn zH7ms)^rZ!T^Y5@v{hFW09X{ULm9WE{N9~vXthnSAq5r$Q$pwoP6`53>=glDD--KTD zbN=0lK4S?+E@{Kn&)!7J|79Ly7Oq_1b)0ulr4lpORKF%rVz*zxR`C>%4Lf^8q;FRN z%EI5#a{Obg@1*QHJ%KjMg;D_N(54Xe)PTYYd<>Pgm|Wih1341_1gj^a%WfX zYz6CN_WslM5m+E-uRb_B7To&os7xI*V`>&MAhqLWN%wF|__l`&N0#G;Kk2;ZC+4%u z`St;9$&RmTs)CuV;`@8Z)jz<-axGt5R-^8`ziP#bdMhg+e^g}MHi_zaIk|hxE~OQg zd%gm2C}y7o3|Q{2fI_b@E1M3C6#L8ieS3EK-NMtZG`~K-qM)-IN8EEUOsivCzSaj5 zjuI9|Oh4T$HntBtStLJGhq-!De-@&35K&sZH()A?OIv7VBj9Mb5*zJ;#A@qajXc%T zf1>lL)nQcpKHkzW9Wg36z2yD;(d4om&QIZYl1YRAu!MDY_rB~(>4zU`L#`Vth+F@O zDJqaZBTU#q2&!uZ6nNvqDCy5w6xo!L)m*>e>SBu0jUGleJ2d2^;^0tmn&Nlwp($tQ z+_hF2i=+eU4R@5&JT&A4_Igit*F=7+WlDnPlLsh}a|&*tV`~r^Y1T0zc>7$Jqa!h8 zln<{hC{;q_Y0^9$Tx^Rxa?TeHX-)^qUOw=s&RUzl5cq_d#(XQ`+hg>8_K&@UxftsC z;`a&AlyaQ|rG}9gGmNW^V+7*$m*QFbUf(-&bUTC~B zUFQ~Qr+?n$vr+5_8#!x+XGIv}%k~$*Yq#0G!V7AmiDy~-M7pbzMX42N7v)Dghaz8P zL^vE=3%V+2dg)_@{b*g$hir18jM#OJplNA4)X})rENX(|Ln~LErqF9?Gu1^8?_iSs zRlRS1g5yBkQCqzKC5!&nUGJ*%^Vt@O4S{FBvm6ne-3L)y&GRIU6=7NDwk4x#BYd4W zv{Mu<596g-Y1S;wH1Y@oX>@Xa<0mrfRO%03x|!VM!{_-?&i0a5ANdxRc7^m_dCb%7 zc_I7m^E|6LwxL$)fC1y1S0&|aHs++&X#6s_x?%969R7<0+l9w=V~sjDym}vQmshz9 z*m`nvzTS-$HJ^qgc&tZWC2zwTsNCYoeRK4RgdS6KSoqI$CB-exG_9eu3t%2KH|TPj zDA3CUGE4wJW;|&>8C@CNg5rA$pfi?-B@1n9;AhBN;$D%)%WDtG(M2}oT&#f2fA1`K zT+M%O+rtQ$(3n?CKh{>C;6Q(%UZD}E5KdDP074UZgMyg z9U1-FeErz-Z2yii+%2^KiNNO?MW@zLe&?8;G?8yIMta|*`u9>Lm~}XgR9CCwRYYLl z>(tm*64E{nCh(X-d9zfss%nte`9&lGYBLIYEM=nOFJ{b(mj4d;%h5`;6+L16`Q0Gt za0B%H@oO0ZD|erMMq1XTyv90BZ^^vnFmfjGj9i#wpO1FSuM`G1+U!jjb7A?{Mb#nJ zOoffTa!pm-CR^5h-zJ-sy=X-*SkwzF?=}t(*eGRX`f2Nt8<}~=BAU44G(k= zu}sWem-+VTgX6tLlqAMD8c4DBKc>W{pQs*-W*6A;c!))wRNGj)UYMTW97&$fjQmzs zo7Cfc=kqGxeT-F*Xj9)|zYR}Xhvw6*iHQ4n%UMLE=k3{k-9{U7x2o+Gt=;!|x0f!I)Pz?rKTFVxw!^6=^P10lsMt<_ zX7w;}EL*nP zq+n_fv!iuyr{C2l3E#fondvI3-Z|EU>7aX3zD&0WCU2IPDBZ<|Q@K0@H8@Xko{ZGD zJtf?9UCvgT)3R)ly~Sr+GNVm*wkGZs-tvMkkUgDZBKM zh9_^*RP+Py;zp0Tbiug{MBlx3mC3YElF96^e$dONds}ZhXYxfg$52R~*0MgY{H*#BkiwEH}x#!MLpps!4_@Y&}G>clZ4=E7P!h=3HPMgStKs^0Hww?6#+cUug0P^ln$&4TMpY0YBx zRA_g0@HKWN7mCjca_2g7dCMK_Ck%Tn-tQwIEo;E0u719eGxg(1kcH%2M3d&=H3vzF zt2Gik1Dhe=vT8w+#flm^fQNT;4JewURKcZ zc$8(OmG6gm(HGQJGpCN;k)Rdxp5b3N6oGub2+^Tb2m3IDAP2?I8{Pr1!K_@Z1JV8j zlS2Xf5>TT%b$v|{C^ZpX$@lURAD;o<93Or{^$%u@hKNS`HQd-%vbqNtUc`yYLcyoL zP~ax@S^FKxwz^O=(1A=FLgn9(NwFW$BYYShU;uA*SvxhJ5R0koqP;T9tEetb0_j5| z=nj3u2@2jm-nIZx=W{tK!iT(EziRS;sMC-=^lql`&Qj>zG;F{i`vUPv942|oPBbAJQ8t@)3kO=D?2CmM++_f<36y;1XKN_#JdS7 z%2m%?04Hy)bC~*gABBe)1D^7m^>?nnvpZAf7horXz&bL0!dQ6S!^Q0CS+;i@p9A1U zjTKln$#>Q70i6Zpb!S+CpnZ;fXKv8ZkP00+53x7B2u9B`!3>=q3&f1a3;;L2YNsDZ zrSiqx$$+oZx;A^aIQ2K6wfaWHo0{DY-*dDbddU)g(m5-;1qRb>v~Ae|NyqN|b01er z9&JJ`@V*om=2N1)l^bH94%o+I1=7UyxvOn#r08$RL-{M~xJ}&5mVT2iDX#$#=)Q?P zm3x~t*#7Q?%lZ*3>gO|HN-EPu5Pwzo8!@uouYJm+mHqqO<{hpHmBoZYYCpffA*Wn! zGmHzqQHqyrY`Hg#y}1cZuKKw0FcMy~bQRrB;zfypM$`h+nUOeQtAmBO} zbR{eS66*rjbI0d7ie;MHNhG%|gW(v@EA6YJ#HI?4Zpj-B{`OB^CfD9C2584GFegO zTq;o+UEe5Eo)Xw~<``A! zrI$mLZTg@W6QfW0lzC#h@;xJbZIJ30{RR(^k)t-8?>ncS;q+2seh)#tthJC){Tl5Y zPQ{BPG6?dny|WPm9Q<}1w}Sd|nlmU7lPe{z>mam>3T{OVXVsMIAoNJ*v~a7n6zD8i zBTwvwX+9M#wztSt2Z)t`cqpHZ)a~5t95YB1Cd-z`HK<=cyy+Bo4he_sI2RwzN_Ne_ zou}e(&Yqb?!zpeIXQQ*H2H`A;9NVtsG8bf-78z9b@mn2-*9camYcJVtTGq=*_cc9(n#qMXB(dgL98qPFO=7J zxL*+O^E^`*frTEwX*;aSeV$XiqxgbS#)V>w6-B41<21j}YuQf@uVE5+CS%M7nloqk zIg1k?J)(><@k}7`dN!{0)QZ=QY%eCBe%Itpm6$?^JEo}NQ@wyeGY;mP?eYY@$`&UIdoneev6w`wKqUcmS|JkYM2-iK7nIpSZbXINYY&O-*+HPWCnd@8p zLQxKV4cpSjdF3UHp!csxypVRwsL*^}b(mkY*FkwiJFPw8`pA>vnynejSnbKym=%4m z3f+)T)cEYYzUt}o`29}@g9YAwyUjbyHnG)}y-Q8UPZSi1AR;T$~G3ek}x+te#FOD?pQnnK??LM3+GWDyG zamTJ`#`XmKKJ9*<^q|07Bm;N78ewGKSFD!ku3mew2vbIRiI=yb@asi4gnCU49i4y_ z8!o1*!jCuyS(9krb)}gREMwkAY1U zT4*nscX^^1_|;E~JB;0KBk5l1e}t>YqzX=yHXSwL-p@wyhw--78O`fFXLidl6u;;R zht?W;vG63YF6?29U;>hoK7Iqh{_3>^=efEU8;B_eE<*?HUnXpGMQ!MN8$(Isw__WV zCO3nWDC^C7lNGC24NJp?cW#b83XXNqeyrE*#`!j;kSD+Kx;5zp+WzbGe{-J_AIY2|rR=OHaA0%$)Ks!8ObeAzo^R6s*A$ys3vZpQk z(voE%U}Emy}n(2PjU$qpxA}vxLGx-paN8Ld*|^t$lDJ zpyL6&CBQiXAU^MZ8X*9*D$+;dy5eNtOef$!tAw2eeB7Kr9(fis$c=Xs+kg>ZkAZ$~TZ5o12Ld^txhhPdIt+D?% z`{Q4Mevdr1B$x5#S@;==`oO=`bE0$LY-AZ6Ao;vrjgxe32LW_19riG9HgT}_BZFS~ zE;m40&mrq){tunN9Apu%h>k7)IDUM3Q`EoG&&8LWVpjn17dn;eUk(_wkgDR2@U=^X zegLE>zY)ok@ssgZLcd5?z%{=I;f=Smz@S0v&1SN}E$XpCj@U%o5N&bgnAe0oy#bW3 z1`zsH={%W$Xbm3}+GbA#(u&yv+0i}J_o~^squ#e{Af2vYho0{2`8^ANGHUx8)hnxL z4NWbE+3DrY>xAx3d&BlLN86&Cy@J3qLz^a!?QMN1{4H&cW&sWU@~Dp7}Xed8b(IBDF)abOj=CdU-66J{nmwuOWZo z&usubIueAY3JHbqpRDLYAejuhjpumqG%2e^#lH9RE^*r0O8#x**MF?Rl{DZ;9;WX{ z;Vo;~sMdhmuQ1_V^D}@)tsz80CB;&T-WAp=JSC=AyzR1o6fz-T&>L-tIfqBCX(9A^ zu$Rbe=^6l^!RQVetE`ykZ}OVv0s4+R#uZ(xu-SgAOavJ%tcQE9zj&KdyIr|o#|=@d z+%nu4-7j98?_dQuB#D8Br?u=c@wxiDrv@7%Bn>tb24vlZjE^(bO* z78WUeD5e`pDkkZ$pVBSWuhu(Xg6!AQt0^;j9j3>tD(7HLRT=Dq>#xCCejEmLzB>m~ zY0g^-Y=UlR`T!pt0k@;C#=O#X-DhkuaQ5SO^IKV?=aob<-t!(4RzBX~CFk|#vj3UV zmEsr3>+-?da_WM5;lrNYnA`LA_lnH3_nf7ppQNW_Bz}zev#}l z?ab8YXIPwM{lJ*1IPt}8x!v1A?@lY*AJ%a$+*H^ye9A1JNv3_(K4!WHw^Qx)AuiQv_MWOC3~y z|8!eH^q`l-jFwS7{q2|85B=~C2|bWWRX*8{H*9Wi(&Ra>M5Gzl4^B?D77b(adm?r> z3&l#aA!dT$gLlu_6@rClindu21- z8+TfMeLB-!h}DmGg>>Dk$YtNxzvqavGqpx6y1Kdr)JkSM7@EGW+_1Day*GZvtCGH& z%R@@*Eg~551cj^Z%`lN3rG27^o(PlCFp-8bPQ!k_jA0nHVwPjgJH& zI;ND;7ANnrw``HWR_9>r;OCb_3e5r<^{O(%om$S6x>S}v&r2C0PVF>gpSSkrvS}0| zw-vaWc<2aw?v7j(?B>z6Pw3*g=~Wv2SDT8= zo7KOq=wB=FwSP8|GQG_acSJX(d`Yl}ds4|jz@yvaM*T9@(fqQn%KTxLofKBCyI;sX z(I)2FB8m?qcNpO7fqi(3ZlsXF$GcHoeAhxBkeu>3gn{*{s7{8rCpGgrG7`z6)&T## zgdl9tSp;)2gBOOV{_6yV$^cm3Xiq^NKv|@PI*-%p%ml)%iVKId$Zdhl%AXpHxKaG) zu=4jOKfS89AF$Z?zAW~92){0R)f)$XgdU-~h zch74(g?F7k`v$h~ek%>LRx!Yd{A|*BM(77nL0VVN6Cz0dzXwt6_fJu6klf~nbALKW zL`c*GUbInA$#L3K{teL?0^@#5i)#DPC^7eYjLRMyg<-uP zvZn11PJBIoROcFWxUQQWP`ki?h|c}9<{xb4X-2z zM9KDIlJplYSc$B^A>OS(DSLt!r%P&Igpj|0Ec4XIVC5SWL0AB1O=MEIpN}`iAGfWg z761$+_9b-xE5ZRbjv5zz0NxYv5xUEXzW{$)$aSv_MFZAZ?Kjp@==h2`s=AL7aU)&?C;s0}>c z97xwL%UKkX_+HU9(8+2C($6|P;7$S90JQsw=>qYe19dF<2IbBH{_iMT&@80A1dtk^ z?Y24kb<1k0fy%$`dtZYNhclSsD^LsmU|H9xp@c9luL57Y4SzrtU5cLBC)dGKu6?l& zzjnv$Fn4|vD>1SqF3{i8t#<;JB3bE1Eov60=!pnle#3s z9x%9>;b9In3ZE`@q_Hj4w#tOsBd>sRUFf1T2Ag?q;3 zu;i)kgp#JZ!|T{1)EHV2WPZhApi4MUkYfpC-_Ws09Kh|b07L~Le`9NX9{@htpPj%n z1$yo|pjtb0;8ldY;6lB)H&n*E7&3W`LdA zPdYKS43G=sepsiaro!J4PEzn)s&I_KXN6O6_mj8K-Q3d^CIS~D#2mr72BKFnlV4!j zrtoLDa7Awak8J5bw9P-XYS5L2o53NB#n|i7Gn+=w_v!Oo5A}hu2X-t-$z6;HR}_9F zNdpo%koq2D*?V6q_QjirUy*4)?s4P5J8-k-h)Mx3Vm`E4@N3L{TqHy4nE@SL>7l(# zlV1KaV=+j35rv_aM*)y8d0wR^WR}Xu$t*5SQGd}-vB-iq?iI$>?8|^WFEmIq!*BHb zj_(jJmGFi5^d;L|D-9F3YDbF6G}R(~hX(c7L~-%feU3D#Kr=p>G!gqm^y1A1;WbNbL~TZ1@b^Ikp~;EYd}Yq%tPH5#!}3GK=sS^ij1oTo_s4$ndMWpXGsbs&{vI zwV*I)7Hle_+UX#rk(esBGgrOL-Pi40bF7&?H)T*Hu(Yd__=sF5o5!|lYvCiSXDJ4j zdj0LZ-BgLBT7QV`nVf4{l{icM*^x7%qX&D{itTa}XB^r+LuAsN6Y(Z4=$EYHyAeOh z1H0(CO~aQkw(g0>-}M^fds5pb^}72aFMgOj)6;CqdUQcvyx&p!<)Np_f-PUb&%N@P zPGi@Hlm2O!{60pTdzK62+lqfT!?k&ycbnbPKa6}{$ZLI?h=`UdqwJ6r%jDgy@1&=4 zzn(P}Mv)&rNH6zSiuhk| zp4-rW&7AZo*{K!J-z%=_#L}kf1`2oQ=f-)9_u0$nW6GErGSgJZ=*DD5-e4i{W;H~` zv{^jjB|UZD#hlBLC=b4B!{p95Lz8URq+sIdsrk6 zO=LG#hca^Q6^bQD1i$*Sw2*z|@#{Quyyeu~EG%wQWDv<_HZm)m2%ku4pWYrIIFK32 zK4dDI>CNy#=k{&7HWsB`SCqbx^Re(e$^(sltY98#?F#g1T>$BIhbm&5V2d5q2EiE= zgMFiowUtDXjz3by|L*Dk6+95{P@~@)Uw3g?w$EZSbb2{R4pY0(YU`W?<~v@% zcZqO08SZ$b!*WM*b!Puik`U_1X;c^4w%|P4wszoxzcQwt^K|HcV*Gz%J@NHvnJIpE zuh_v6*18AjJ{fBZeAv646~A0N3>~ZDUNf_xzAu9)tSjh2NkjJ9CU#`A8GzzpVdiB5 zD1|>Y2ef1#eAYQ?IM`Y%cxbijvu(4|FBrTkosM>=>(Bt90;+_c_$TC+T-G@{vMewO z!Goym^_5KWw0}Rpz@<3=#9weGABYh`Sc$?+HJ{W~MH>B>!s~4V_$_B%975q5H$b(M zXZHKhPI16-3$!54R>oR5!D#x(v$pwF>cgK6PsB_z7 zS;bWVz3RI`X7GfqA&daHwakVgWYy{ui^x5Drp?7Ox~<&kYaZxu~l#C*<5Zhttifuj6$b&kW36U**mm zVd^Y_#)Hi8zfpyLU+B|ozwGaBdi7J8OG+_c(8ms~B}dk-r@R)+k>QnFr=OM4a)yJ@ z0`<_h`zN*V#A`$X6B{uM{ZpwI&LyKEynxF<3M|(q+)0*b#dxNFwTR$Yw0=6@P$88| zKRWm9^MUR5;?g>Kur(=kQissuH$ZeqJ8Ap5&i>;-bKBT1er!(h{?E>_)(6gogw^zFRQudhQ_{siFi zfFYr}4!4I+OZS`VxW`3pO9}lmI}e*BSC+f8Pj~jM4&pu>m7;F?$f4vMe3HKI!p)b` z;e4UQrALAY%GMyeCQ*~~r=#$XVl)}R9)J`Eh|mAE!k}sK7q)~eyPnF~NBcf}0F&L{ zMf^fhoJg-Uw|#F?L!DRw%%HRX8l6st$^OYun!}D%L5|ft2*F~-KEo^!QFxm-vZie+ z=XG?#mOgSzE9VIj+__*6J_^zR{6qi6IxcH~NeXrlgJF|81$IIRGg17P6Wt5W(s(2i zc2r^p;S~mdK?1F>A>TKp`V4LW0``jpRVmM{nmb3DV%<$U$YFeq_g@kxWE7sx(9 zV!Dci%qXB}LpmM|ok2VW?@>P87Cdf`jCEv`w~yDTSV=TNYv)JbR9#3rjHys242Wb? z*VjJ;8{dn&Dh%5-MSU_Tv#6)LXnucf+2zS4o+Fa{%dxOjnooX#KujtW_GWR=Y{2+& zFqdq=zTD4@#fNg17mBk&v1J7v-x+U<20M6a*>pOOKA5URa<-Q9^$%J7Roud=7n^HV z#8cAE;nF!>3irx)WTwc?tfQ{iElkdBcN6Yei)uo;MjPOs@eJ^JE9!A0Svx-qDBVd9 zW5wxkJS%kW>`77%>G|o@!N-tXrcKOd22xPRR0V%+Z(Y~ll*AflmjwewGyH^BG8%6 zYBYC#S~J6?-6!QvTc#WC+xG62Zp0z4!+`eQDU|9*htYSX^(D0}bD?lQ4RKrnX(>BP za~%49gvNfocaRXW%!^ZV&0x~$jONH>SYlA!%6mZFTj?De3xw@CsUfhep4M}`?S2GEbspH_|u7@?diVkNBr8Up@$5b zQ{$=5zBsvpjwk+G@u?o~xuW*nzobVfg*9(YCI(h@eP#xV)M7=rRuhlY(TlIs1lroC z^Q)3K2mHsXq>bVxd$e038kZvQnSZg{uBPvrMD4P5_L`YRzxDO1w=!suB1<4n@^$YheBRP7GsyWIRJd$W~{&(JnA2=!LDmY zEjAfCa`2knc67E|PV-Dy!cS8dm?zUP?_+AN8znC^SjI`^3ge{q8j?yrJ&vc7^~=#& zvM;^K?LU!4t|CvqWM3rE&$dO^I{`Zj$t7a6WwlPXada{4zSm$Uqaq-< z+vmoPUZDgS_J42+5;S=C2Ny9eI)k_fnZ~vKpkKP;I7GN0As%LFIuA|Fm3OzS%|(5g zS4EvXhxUz!88;C|=MM?c#C=~q>Yre(;OrW*ZQJ_Jt^3lr-^e=4fZ*3iQ3c?IF@Qvp zN%?$LPuiCZig|O&!*K$-0w?#zdr4dT@6Tdx3VpZu#5SqU4I(BgE1ZhE&$8p;Bo3oR zfPNVn4*J)t5&#dplmZfgi+_gt5E^hErW%9_>CsEENDsFa74Z%$zZ2aX)Yw+m?z#i# zZFUrn6!mL=$I4xN9~Qh|-%9RP@*OoAL!tQ7H~T)Ur_~tqx}8oE4reJ2rv~+OK{i2- zw-QxGw*qLr1iEvK4nBK@9z{a%3j(0Bz8P~W>AD@FjN0r1XMQg4Ad%^)vrOoagnBsr zR0^mI>AVa0^_&NvKd==k-Fq{i#K9-#?J`{nlBWcynCYuX2Z{mePpoxPx)}}hC`r~9 z^HcYqF9-1p@;?VGyp7_7+ccpE|7NcaAZ!z%tuL%TXFsu2@QPeM&>J4~i^1Peenq=H z&~P%O2IslDM<@JNngyBT_h}eypLg`@Dt4IY;Yws!P@ET_3rz;!i+nK%SSnzZHbBGy zi)Jjb_L_tW0;y?xM`YII0D2spArLSwBg_ounG| z?XT*w_}?7?8LJb7U$>@4@0^|%OQu6PpUDD%T%>Vv_*n#IN)H_$9$y%w*ymZM$GjNsp6jcA4%*!=A1Xe@hsl8O zV|U;9LP;ThGtf=XKc}T|1UFo1l1B}l*)n*L5C3riTAWL|)S&n6{Ia;|B9d#lMUz*3 z;~=IdD2-wGiPq6-eLgQ^HytrNr*v^SBLV%0oS9{;I`s2ispf4;tB>vVTn+Sg z{VDhKyHQQbRylB$r39F`%F?J>{r8=lHCgu53B&oVPe(MgkW3)$F%Q_?a@DpS)LE7f zzxh;0+~Ro=mLpukg>v|9M1NC4Z{79$y&S2R;Z*o^=8xqGpQjm-R=%ZquLn=+!^~{c z^P1If*Tb6ku*PE?LwU63gzbYxT6Z5WE%vZBlkIJ<@4b`xrfAK~3t|mz->U?5Ne|Z| zwo&2EwWVQ+O=>P**~;2zj-q!>aW}mm#obrE9t3P!>B>{*lDp9N9vBbGb|%xY?OwDP zMdUAGRV0%`=zCd89%c?lzucnW$1&=348g08W9oLoE83!7GimTTtHx}OwpJnu(||b#NH>}!w^r?W!c}1O?0hvTH+ZWHJ3Cg(9|;QP z0izR5I-NT!bdK@(SL)q&?vz)QU%PH%q2>k#y>6!e4p(`^I|ahzHy-+%kP5P zu&`GnCU2W!ukC0Iz@&SQisl3)m4jwA6B}E&uai4$z2YMC&U&`(T!zn}7TFf>uOXZJ z6o22CZpNpmtugInW0MOenik}kTy~r~1!sNjZV9|YNgMaubtxV)?U$Cx6dxS2SMLfw zdR=~9pove!yBHOTOF8C~(YspnS&u@MRgcF8Y%rIvOV>~Q&_*iwrAuhl%hje8(eZY+ znA<#oOG+~p);1U@)flj#)sVdQmiNahgZ@;5W4xRTO;*ztS-*PYr!>Z&EZ`(B+@3YQ zkSf$8fsTE5N-kS6{4`c&!JSkm9$2&Z%4hAp@y(!} ztZN%;uL)jB{@8gV;w~Z4pxZR_?i(@vJHP&0_Aiwnq5mQPh5|3!i9OVm%V}`12iYco zqT)ZnhxkhR2LIFwXFS$csr&t>RQk6H(;9GG9K|##|1Qhk{n~vN-x{Ew_J|AzXj3WOW&flFE+9vUQUH(v z)M`clBX}WS#hue`1u@SjJ_DG~6Y~Vy=o%oijd<`M55YeP6F@tiq|uP9zFqFq&5@q9fr-jH1dHmMsOW=pCuzGKr`Wynzac*l&qCMV zj3a6RYf>w4k9uN)H zH1axhc*zIN&@TeC!p5}hH8N>bi+rwV4tP%{+yuA?!9kH=l}LwCb_hU(yg3S<;0rp- z=!k>JM9pnaQ{Ep7%VUN3Ow>aDjjts%MJ|e*nICATS^(J_&AcQ+q?#yKrrp&itrKE8z z6rWP3vv31@7c0*Jrx&p@9|NyX6rj&ub1}AK5=qD6P8UjCjp{fAj7 zq@?$D3G-$D2_>(x&9^9cXbFb_dX&v{QdHZjUx9XU)s%`1A@d1SD7rArJ1;i6@YPsY zpc$QSS8!jrb^rSNn+|z?{aL|baq`z?UA2@Gdg>`M&LQs9Q<*P#(6df%k>tKEx=#R| z4|y~DQC+wc`EahO==0_PcXn3Ol#j=g!(|#YF@2{;IVs7*+A+1NZaNWuMcorcX&5$P z>ytf9S>8fD_&oEE>>at^UPOxqWrb80J`yDfzkVFnB5XbJ>m??0P^zR~==-#CRF%fs zF9)<(($LeJR=ZhAPkBw6`kN9rOx8G30$+4b5vnR|-Zn`=IpgNH3vPtRez$qD+vG0Q zFErs9_&F}E!1oqI`o*8Dh{py$s`d_ZsujHr*)=?@r8?=F=68C7zfjfc&7LU6?3`;Y zTk#my_HYWs_l1CR(CIsk6i;c@BZ9$ChCb(1tPqvv6=U+=h{Lc=))z%n4-Cki{9V2$#(8jb0e^LWsp;6OxUUW;&1QZo5yuHx!S&jDJC40!X?D-D zT(gqMzKlG2U>)}@jX{DVt2Td4DmsZ?gU-ZlZOe!)JjDP@h2tD?TKL%R*1_PDc`aMy zE86RQTDXq*^Pfv4#l;!V_5`mxNKs8At6Gr{H%GK@sXb>Xte{(UG*S&-N)**MdsTAo zd;e`d6*#LEJ!jlTfdbm_%7dY?qKDodb~btuRt+qzJyFNcapf0f@T>51Brz$*1%6yZ zFS`0WU;8O}I*~=yAJYsDa(^{W8;z0bx@ej~eQfK4U^YoDcencHhultO`LZI%_})vP zGDbq>;_^<#jpoMWRkdXAo2IM_)dnIvXZn0alCs?es&oP8rd&7RB^swS6t%W!o!bQt zNM4h+*)=G@>xMqiSpuGOzTEv6rD^Vy9zgbt2EMBz=!zSgEE$t(SRSx0^E%HG^yWf2 z{O(d|eOW$|S)`g(zcLQqtMnHi<;6;k2VxOfI65vqj)sYd>;fIKJdNF(nX5hhH*%lS zG?e7gxOs4B3h~N(&jf4@bMxf|l@EoQqCKYzG6n*N#V(aHEuZiB0613Ri3&X@LaYYz zEiUs@G5768MYZhXtSG}j_IyOa_83u=!zUH&zlgs4t^ zW$Mcp@NBMC*!%L_LlZ1v!Gove{+1iwzGQ~(8!X)5<+p%=oEZOp6&qN1=8J0v^G}mO z50mYv4Z7s8s6Px`M*hrF^ov(MqvYaX5!E95pZEn*459-fh=$jTZmg{WBb?>+iG6IF zSB;kf)HJ^$NkpxWe)~ku2+HXZ@13UdtXjRHw ztsijQ!;ZoJNj7dZln^OwXkmG(Tr{wN^JS6BB`SD3!bn*LUk0sDxnh;{f z3rKG}c4+`W;ug+hnxC#=$?b||KegFgM5hKkcbiu(|uqbFqg-fAZwpVD!Nub*+;S5bgprv(nS>WdXEGThNiHAA}o>aHgPUV^rO01NhiGR|CyO@HxfBh-@cwzWRMOPQ_P(zOj6sW6;oJx*fw|B>>(LwZfN&|?8Dh!KMg!TL=Pn0PT+p6@Ae>v^es0&KJ1>@ftgiUi{ftGu8CLH>o9`Y2W)jDO&@vf+dJyD?aM z$&*yM#B*6~9%yG*ReMIBRU5!_;=82;P$Bw&4GDuQ=`6`f0UIPqeGhx>!jCNYFo)$) zc}7|+1C8%M$8*d)Pt{@M%@%@PM1tulPZC-2-%_M z9%j{8;iiApag%g8nM9w`t%b)4iW}C#%ZXBSooYAkbr#4WUfj-zy`ofzTz}A|W8W_c zW4npVvfZT3buVN`?N@h8DrhX@v)E}`@kUtz65LqXk!SXUQy2!F9mw6b=1#NHzos8A z{^h3sNWz9`-i~y-RJa>&Pcr6a6LYXSH9FYEl-wDA4fB>FJnQAsOS@$M76ln!1g+GS zL>fAKo!_MW>-6Ico zz4_XYc9_zX3J92qCQmM~0OX6^gTyo3rock|VlO5b^Y z3&U`!;2Q+PwAiXryvTHOzlc4YCXQ6CllwO4_OL#obVRwjrv({bSBW1;|9A@KOTZ6*vz<4IayyTNIxDvUnto7XMi68hjzxO8y&16 z5>SIHQHpaa__iQIfv!a7P+#jSfPt3W7-p(gv7y#45Jh^WzO7KkV}X^7;9l7e^N z3X{`S{@WlRjuRkNAkvZgZXk7_BIXLuBQq!tV?xIX#$Pg>XRjZ+$Ys0^C=YJF$q^2u ziaxJpc)dS6S@khPExgEiq$9o!fB|%o(cszN5N#s;un!Am02Sa!DQbLg=7hOyNWT5w zH0a!)(pXH_o@gZv5)=|Ngs(k&8g=Nz^Cw51E z<)YudA_h68T(mrBWkKjh9*BYR7^o0F7CLk+`K=Xk*-V@JqWDGg>}TWL6OESCtjOQs zvT>+^U>zHLF;xK6>q(P;i3<>TTy_AmDyhsz?z1r`ry%626!>lZClz_&{f7Vn^V2V0eoStqcsazuDC=^6s_W{62aG8HBe8&GfH|uU($o{ERMcRvxZTht_1Rt%Cefqt& z&T_dMUarE2w@G*Ed=#TQ`}k0?7`@!b-=N~Mysw>Z0W=|)h#CCH)RFJn-wALm)BvKYYDs zKoeWIH5@@iQNRKU2t+};fJl=XrT1PWGzIAb0@6zmrA3N#siF6Bz|fl_RXPNaF1_~- zA$~iabM8I&{qg-sMiDcanLV@DUe8+VNu`7hle`5ZYoQLaehm z;i)`2sTTk@QIH;4MIWA_e?TzMU1B^0u?#;U90r}tAT&{=KxDv769IHHe-J$z=vaXn zK0`yIu|9LCveEoJx?Cg9HYPQ4^%r_mHz8m%$7% znj+2EFg4cVl=sK0q4TyxtrNrJ+H`QvonU{d^c%4m525a32PV(E3}Sxhn3cA5rv%hI z=fn-!g$Yp=q z){*VU6DUQYtn;g(Jp6pnIzDm}cSEFw9T86^6_tH#aL+BXr;RR|j9a&v*2S!-PE;OE z9A!m=Cdx@#)Sd5DB*L1v=v5Y8TNEiK`;ujUpjJlrep0z${o-MnJ0kSiqN78r6&LxI z&(V&iK3%>d)3cOvMkwFG$<2&bnK2i^wlY}r;KGI4z2m`Ds1Ro>ai_BM)#(+f^^5wl zaFCH%d#l!O2Rm`9k@qMrNZ?hk_>eY16Jc_5O3c7=f@s+Gv|;x5kW9q%>2P1>YW=m< zAvO4?6&i|>NbmHed0!VXqYCp8O$9Vt`7MhpRBPH>Sk*(q$Fd}Kf%9{z#mu{|RaNc} z7Je=jxeDcz^i9l!umrj0m3rzAZX;BAlZrKkM?S%RfW2 zpASyucXG`sy_h(+dSsK}4(1cj6^3+m?S=YMIfK$>opq- z?95HW$y^q6bjY_uYu&=(v&EW@TCBo@W)X6;iDRFKbnmco3RSNtt0%;05(Kr*Q6p`Y zzR%}cM!zPE4M?-J{sbjgaK2m>77@T6e0K^3oyuO~TX>RsC3>!iOpDpmJk27_Rm4}^ z(Ssz-F-n>us*6EQo+XtwVV_P!){yXfi93HK3c>!8>Nlj5XC)l|V>_ur_+r4}!EMiU zm}6jS5mU{OsCurD>{u-r~UREg$Y@i-cDg$x?@tl}AkNMndZXd7XJu?38im zBhYWh?~FU8*RPY$8H&H3`KU)8_uzW({Sf;|o9FG&EZL!+4vQOp z20P-0R+PLOiji}h6=MG0HrZIN!E(9m*e!{&6h7D*54d9QUYYQ-=-kdO7gYQ?JAOMfxX5oPDJ(3`u_X}%-TYDqKmn4*>vO4qX?nRdUT;sQ=vlguJ zZyAmM)Uz->$XwldZdUwwx5D5+ygcS%^+}*Y;jVdfel?9m2!m{H$70W2==bm?X=&Ir zRDqpz!_)=@Q-@#16F@`S1C4V{e=Hx!{?|ag?kw<`=+8P;9l)wTy=UYVheLq#Oq${X zQzLKA*%0VlTfIYcB8sZC$^rBL&AK1s=Z@YsgAKHyH5(_OozfZ<>-dWAYTgo#4QS|5 z+Ca%Z+PKfF*Mt^Ta6Jy!5U+HCV!eh)E>UQhhx8E)3_8hSAlQDT9AKjZK@Ak>p~Yl8 z=k)$5k*XCwQerayz+_~r`Y`p9{8+-I4BNl~+){L+Gbk3+Or!z z_syT#e=WH&9udyoKTkYzWuU<#l^|I@f%oYxfcX9}Kb5DW;^jsdKo+tL6zcEp0vTmy z;~G3s3cN)Df=9y~U;FP3yAka0SDYZSYyen46w~8_?eG z_T)?D7}O~z$CAhC-9vwI*QRrNqZGr@IoxQL*PiChnkaxsDeoA2eEd^r(!M}MQI+`z z36Vm{Azsh2vDJ8WEg(TC_qp4GOJ}^3w%wybRrqNRii;8;|SbQz4x5zUz9{<@#-zFSd*?MBm{< zK?b$1B@_+Z7;uFaDJgLDO}qHd6aEXn!1G8?VtY0i;I3Tj(;6UBE;!7%|qCTxF#ofRuB9(kFROyywSs$Gm8 z25K_0@GU_9RG#LE$0S4XP|Wl!56=YU0K<4U6T#wx>_IE1r~df+-tW)5@1;!q5~EW& zOY>>9zqM&-e@qTP69Er3H50o{+P3X3XWP$BgNKgZO`bY-8TP2DoCPf{^z(a;WY6|< zKfb{@Dpukl2+|P859;2AE8Ma^U#^x zJ)}qD8Q)DV%`Q_qf*3vTdTaT+JKb_l zHy`QFzafSj;Eo7C9Og#PIl3^U3|ta{v=XT~k(z6=(A`YFXv?_ODy#fHFZYAp(`Qo^ z`$2K4Fg#*z^flSRsVt2Bhf=vu-GM3xAM@QJ z7q`x7ZUuFm&n?A)xSFhozoaysJZjWmMf?D4P9Z< zCE|tUA~SSXK*qVFrCgbiH9ErUcnc&nU(6I>8rAV=wPsUkBZ$}(NIP*dyb-CW2@Q@x z<>g47>26}UnN=J#^<>PW?5!6r&D`Pzt0ciJsc!kCq3UI& zml*9Rd+l!EK;q;tV8Gv6=Dze93oFVdn1zT6+w4+PZO3O}R;+MsjkYV@a#yh0qUyGW zZ3#MoKfd$RMyhVV`-#CZX+U&^W$efHi zXSS$_(V?cnspYCwS56kh5BALJ=eCy4jXaM^WVWvf50^V#Wfv+B*~R(gN1vcY*LyD} z2~A7>EVrjO8XuRnxcrjw;0l(Yy7A6&^z&ua2VvoF=Q4IJcl?LKK2jyPQ}k$FxxR#g z?-gL`8bS1K%;snujKLzymi16{otaKczSor9$*JJS(Vh47!DE?2*?k!UbAhU|XV%x` zRF%%OKnlxa#@DZ2j0m~)Hk$h=EJatVW@Hfv&3}p%^Z54gf17`~F@ZM=~O#BX!pL>cgk zU+wgtu|Tl#f1Nz6S>Wl6$6e&Uv$LZ6Q@ln6zn*t_B=@s_OF1R)O9LHMq!3=ZWp3VH z$;!RO8NVTD(^PWSkuc}ZLx8yQVEepU)_C}F|Ks%O=5I*XkiwrOK5LE!4Mf2iud2PD zs?kS40)mW)C}`}!gu|(9gViQgv^nYpi*>~zYvD+v0wv9WYnFs7_7K~|nM<{o7ZwJW znmlGW7A>yP<{5<=D`D?8H_+T>!NId8fb!R8purxa+lk@2HDCcPg6L3y*!R!@U%U$^ z9H=Q=3dhb*#LIO$@$`}oz%TmT!@g{txbi&o7etY@x#a~+dVIng{HzGVO8!y)0%9)! zka>7wtJDmK1{{{Pi0bhP-pjM92s>!pCR86sv~|I@!k3gt$5l_R8UWR=mX|aT3*9(p z-zdTQ+krlcMtHmxBp&UX+UNq*zM00=#{-QMz)*{y1GD?3A*@+o2VxwPK2&>WPuz0o z15aqSOB9Y^{)k<>6n5Z30B8%Z=i#gw0CTjpq|(a-E0AMBCue0v`Ur3FB#73~0GZu* z6Xg*cvxK`*M}D%QXFLP%a+m>#)v$LzHEJ9u91}M~pZLJS<7%>L?y^k}_Cyg`zagbe9=dHOt~QTKa)Fsx%bCJOl&1k?0jnxllq{(#lt%Oe zAqv3m5KTBB@pvgrP|}dAN0#8|@u!&8Zn}tK6dzLMrHQEz~B>+2Wq{*33Yvy=Qm^!#J*hFDV_##Vif$%>lS;rb}4x#$b{S|1Shk@ z>oALFh4xA9(e9Ms=Z<5CA+f8{LT_jg2M#=KBqe}3Sir=}xWK`=(aWVENa?rMn8A>bXD74gpwva!|-k=9a~k zCAX>20#jZ}D=-qPsUB2L-blG6rs9;avZzxdBo=+Lu2VO#ec8Fi0$~>RrrcF#N6FR6 z9Ue(QzC$)t;$*f66=)fda_FN8)87ZvK{zrWJ_>6**H*=Vbr)P{EMCj4m{OAyO&eIAQZ?J|Xi%G9%xnYgg4 z626!8d0#J^KpjL&Z+U|uB*(yWux#$KkfU4nxGdiY!4sT2IfP_fj`OXX=vru*0qofd zTp}vA{&Et=Fm`rSmOj30ai43iT{oYmr+^6?$XeR=Q(ONm&o1Y2m(Tlw{M5b2QwP>1 zKLc9Tvr0sdE}nQeXl4c<#eY#R`=zDj^dydTB4JexEMxX_XT8(ozc6P%UvUx=3HZ@m zdR-$T%Yo}OR0We=3wo{W-(ls;nkY@1=KH}x%q*^Mqo^ptqt{e2YI~)s+}3}@;(#|_dJ@!4hn%jDLZrvvpp_64;xmAn~^*UAZLs|%gumU^t$ zH4(S18G|%AMjhAX-5G*@L?PRK4or4!+bFd|9fuR51heSX;54zEs1{}0+NxsHmv=Y& z(10w+VduG9s-#lRtWQPxlm~RYRid{{^X24La6~$`q^M4&H%GLlyqqm!(|6e2Rb~_p zd1!jR`dZz+65pDhm>Y9ypY8r6^CWY) zX^-qfPhFX@?v4soPV8O^RE#5=LRYi9#bnJ^R&tQ(*lD}qJ6tvS;a`&z??BpOlyX`5 zws&`Q{|e3RNYiJyvRBk4{N>f&8uR*!*8Sh^@OCgBoN6n}8c7Pqkk&}rA6;kMwMiF1 z{@h(qD3{0DE#+8=U*7hT+cg^1S8m4@OfakV%wxmB(_YNleN*YL^0;w}0ypIJH-~R+fqe}; z;f(L}ZcksW<0wk4s=7YL82alCkAe7?S)u4>hjj8>$=6?{49TpudaUO<2+xp_i44gM zGe7a@Kc=2G#IhY*+1PE`-LH~bUAZ?~we}lAj1_n!&+lKqFx-=(IDczJZw29AV4%OE zTWR(3CEFfzbV}96=}6jhFU@1anV=5>W1^LsaF)&KWBO-(DeN#;%<=~w!2#DNmm5e| z;>Mhe5H{m0kDV1gM+JnS3Ny~Cfky%Za)+nMG0m1|Fjr>xB3KaWh8k)QrCW31Mad*=av$cZq0F+KkYw*U~Ceh}1;V2PX>&5^tGiYH|KbeOZdyrp)% zs`Aynxd`OQz(MVX@To{{=1rL_xLoked8kL@2lO)5-jj5)H6`}h{M62c-6scW61PUf ziW#z@(|M&|u_D_lS+n)Z1Z@oPsLna$k?IX=57>8AQaYMWvzCJ$utxR|%i`DxT{)A?#|`6^dW zTk3xH)GGC}YX}Ci*}O@E_4%U}y{JjEHE~bIflx~4)U#3JBppsnn6U%D%j(>G;pnR= zn=5i_A1=(BVlcLfNNq~yq`C}k_LidBo-;<;g!1f_NJ9ml+7+Yl8AF2Mhob9w%;L|& zU^HVfEMh83I_wnci}W0WcNJ^PgM&Fa|B7Ck{ESfGP@Roj-(lcRrmdu+CJdjW7hdA#yc~3B^Nxqg3X`eZy^N%9;*E3MfhaiWwE~O;#E(= z90L7W*_n&Zv$jXj3Ee8a2(Fl!+R_2{Vp^aG_Jw6Z+~IynLZhUm*(x|8X!h2 zaLz`5xG_5Ae;~x)eM~hi|LlfXtD><*Z8p37tPMoEaa#x1IB9f_Wf;k&lBYLZnV8*E z3GTgVQ01`p$#=wet$kw2w&t-Pw2b*-YTb$X$lC(6It4@i09M zgBQhQFUA6!n}SjwA&{Cx>|lEPQtn3YsS+MbYK$UEu$Oa-KrHSi)PnFJ z`_cjm>tBqR$WH-KQlEUFXcV9fIEent0ekl59&a^m!y4ZM`p8!d}@CC4A4dfAI_{vFdiqdoh!* zq}kt_l!+%;IY-09_x7iO{->nraTF%Lc%(_J2@ainyGR#ssg@QvPt=N@aSL+5VtVE) zYJZyVrl(-Dpj87zPc)E=MFqjW?QvvGBbaz5{Jcw;`qSJFK^?na@CK-LCpsOq2;*(z z|5G&uDAUFGqPl9cH^1B*u#lzFtosNkY~?vu?J|YfY2wH{ z?q!Wq8#H*k%OyL@%#f2?Lob`)L1XH0qS1C_?ZVoftaD4(L3N0yU(JP<+Pnn48QI`w4&;Dq^5xToLGSG$V< zqxcC3WN=G^B;fXHks_!-=lkD5cF?n|>bJ^>$)$(q}ZijEl2> z#nr68mEPkBuCKSo#ph40?4HE#RnfIt2hpOeDI7HO>BF4{>jaB_+9=$wmy$0%3ilYR z+uo@7x&yopl173yd=;N|nM5 zuhnpj$clZiQ)vIFR|(gHuDa#MFg_oWA!?1XV3~9YU(t($^LM#h0xwBJu8oJA{XIl= zgz}k$#i!9iGkH3mf+tBI@*Ws7hWJn{XSS(FtQl&5l_%bMsn?eKYgoHAI?`+-9t_)F z!NM$g(EdkTtZOR*j1G#iw})|$P*YMr#H6L8)C^=zA_6HUF}$ zz8StYnMldL3p!}qn`@d?qcrQ!I@>2895S1yBQpN$`@JceN1L+y zMW$pWrqtRM9~~zm_1x_GXFt9={TQCy#sJH5Ji5bcsIVtDYC18<6xZdrfF<}*`>K59~U0D_U>reZm6hX=9P|eb}n0QQZh8Kg=o=g@@jYg zAe^_B7TuGN$yn%C%6fAnytjoew~cR}He}$hoBHWdds>lYIX}={UMOzLJ6)bbdyX8p zIvu6MyE^T%>kzQ1G<||BUwemcev6ksr1Tv$mab?hROJ`DGvpin%GkQ*6eTaQ?Ver9 z-(&elN1|COkA!IFEGCqe!%WG_^Wisnsq=X6M4-8hBCc;y%}r&x$eH49;?h4|w9c>1 z#O8%Fs}dtaCo>&elhQo3N?RGDXA8$V(3`Y0h3VPqZIl-ncDo$DgIgzAM8nNiAYgLC zpef7)gY0>4$qAP+=grJ47arar?Tz*MoNLlpEsq;nIEkc1dYk(F$oWgA}%Mn z0ePBf%aa~1v3yT=^J>{E>?uEc;Z05UGpjApk&=RQ!(k2zm)Ez<^;|vc{H!d*3AxPD$HlTecl=59Mu6Zq|K2XuA}8UH?uWrxQK$D)NoQr2 zV`DcOV{S}{JB;%WxJiB!o(|bWT2_qiw)MRFr9&2B7db^J$Qt;7{$Tl#p1TfeGJv)) z6qvkxQ<>_!X@lhl&500cy>IZ8CBqqRKl?0Dk+57HXQ?H=as$Qyg}VmVsoSU7_wDls zA5hCM#|uk|5t+CR&g$eL?9YQUjGp+BJ*X0U^<=}qupsDDskwX7!elReJpOg~>r!& zzBl=@)MfW8C5E$kO8tcTi{3zKL~qx`2w&LpSI>^dBB{LUW4H%*hpJpx*hOz^cV!vV zOK5a5&n6SK%q#x9)MaiidMVQl5AUA^^M>>WGVY4$)f%PC2OS&kteK?k-Zc}g)&G8+jpG{4@8e8;$M|& zD#CQ#EtGBQQ%Xn6vav~O8~;NN>i%zKmcLX9JkMYJJ^tYlJ_iu-{~);w0n#2v{&sK# zk(=#r$WqdgoOh$Ek;L@W{$l<6na~o{cE{qDZC>|jQ}l)Tk>8M=b0;vjK~FH0V!t6+ zpI-16^1a;u>r=zi6ZlsaMYI}WzP@n-VltOq-?+~5g4u?8iMmQ$IZqApg(r8Dm1ylz z;*&@67tWR6OjBug9>*7xpSpwA!bEQyE+lrwX`PNCmhAyG*SdAWR`dNZ@)aZQnBsj} zYrl+&1E{`0QhM>Epr-6m_;3LnffwLwwj52LuR{Fh&TVBCVN;jp$C{w#PL};u7*S(59VlILwAnuoWG^GQ2VdcEk6asx9Hs&CJ ziW_ldBrnud4-labP|j9&vK}_RQNzdV{jFBROA3YD?$>in$Q}?%$T^Mm1_%~^GV?h(?gNXGCqZR08%~X7w9# z*aixVx`ApJD}a(-x%zB2*&eGkj%r{fUrQOM)UbA+tjG4V=@=4+JIBr7V%#3_+dE7p-!&Q8UJ1z>ML~3$a6au!96PwhG=xW zbwIfcr6rEfvZ7qhB_4G<$Are>Y)RH64I+Tb*fv#SC-Oh*$rjt7a zmvHlsq1ZPgbhEsRZhq&#AuDyLQ#v|nhEM>OnvgV!PievdKll>xgF`2X`D^0kDQE~9 z0A7Lr+(P(;5iyJLSHQL$bj#wDTib9AutSesvfq&HTSoQyh>lut9S(qZ!XjNFcwP&* zDy~IX(ZpEM_}*2-N<_vT`$L2k%)}MU@Qf|NCjhwc>CA*ApufS>6X{HAHqr|}#Qqnm zy+U{+riz6AU^R1-^D!FaZC^Yg|KA1L#Vl|gWYY0TOf=w4;jO{7L3k2+j#FuAi?k}p za4Z&g|9R0a_QQ+C%7^p2C^LOruiv@CtulwBD=WzA?&#Z3NoztG)XS!k>D&Y^ZIj@qhhCGN)N1B-#;vdXD2 z8CWQHGJ;-USEQdcbtyhJeU=&bq z^YolUv#mRIWQ*u~I|Yx%oyZrStJ*Aj_0{aHX&M}OX#<6q=43J z@03j;*UFn$=Q}Lyc!6m>E6-eH9CFaMyHB_|tnseUTsxblv?8IOXSrN7JE@sZGev;* zMhh=hj*0t+^Z>e!B03Spn%bcD_peOz_#7+$0xd9E+wOMUlfE0C_142B!i*@Q9%G^9 zFfc){tR3ljS41tgu^x3izh77oJf+)FlwoOY!O<(7R)i?-c7mXN-EU`P%724tJ}*1O z8AW&X`+4X*j`ED7%3Y^m%gEX8D`%v8nyOifEFgK>Emz`aRV1(a`B_rG0=k@tG)G+_ z-S=h`-{EY!6a2OOV{uas)#nY*)MRz^c6~jyIkj8vhg0P=uSPc*cgXeUGtsnZ$aFGW zUpm7q&Vy#YI*u_v!fT{3V@}?u?20%27i-ALj~(}PI$O8Dk$A5#`EckOec7&v%4VuS zIiAL5g6Ox*@u0yK-S(~p?bl(vck{b$pRGzuUpaE4JGa_V{E}sR+4YK|GLgQt>gRe6 zsyW&{?I|B+-B{H}14#qN(o}mldmVb@}iwUPQ z4GCIMAhM=1a^7D2Cup0-%RaCm(}?66Xloj-dG%5*hA_p(e=7B+i_S<$wmg5{z@6!9 z#thyZ1nMo6X5Bn5XF60dgeCkr%Cck|?f5aN` zYy=0dp5ds8g(`k&X<1YdW)@UIS5zwRVAF&@@gnsZ95*_|OjOSiSu zh`pp!hT$~2T2Dg9t5z*}pQm}#k+@NeBeuFWU`iyHC`88en=5Q}=cm@`!D0@1&{i=g zziZMvT$J*yG_WS%;#H(NFLQ!39Jtqe+ecHxE`p%Mzg;4eO+rOD?` zQPQfjpT&ENDNKM(2dKgBspro4HKGgIz-9|3H8kZN#Y zj`Fr8VZSIFqpYjX`!s=*Qvz%9@Ea$H>s&mOpoXPjd@X6!)mr5H6>M-`0}RkHA7(D& zL|y@w&HY>;aUi7cVui)|J#Y4ALtMELz(%lN{3cw#A#g|$>~z(R%?uy~d?^da_kqBauGnv*S%|K5+90;JwKMsqh6svZYsYIH4$fL&hj^~Lp_Z&vfqxdhK$3Mcm9?1)(u2l%qQPw8umd7+~zEvgnE znL=TQ{jlUZtxxwb+e97Wl+LXPqWCuqVjKPk7Wp!^P-Uh2-lBN)3-D$jZwThI)eQd_ zmS-E2FD~f4`)#cZaZYO^`Rl>!)7GMUD|FeaOM2p*UK6svAqI=Eq=1~_H-yJ1ekW*2V&`Vc zd-xpgyv^w4_B2kmo_y>Sw#YFk&W$>bbPJz`1BA?&_lcf0M<_>dGShfA3-44M0@oS6 z;&Z@{7%mbvu74(Z7pTRG@UZCV6@2Cgx$JpLAC$UhsnA8^#)&R*0qv@5(fP>)s;3rw z-WE=#b9lcLW);uip^Y!`9_vG3Z3zv!Tu09Pe(ZX*mX z19iGDUe5mCkpvPdtPeJf!$()Y$*PLr-H7+?Rl!eQn;s(mk{rP|I0N}f?RjigT53F< za+rKJ7!sUz^s4=i8f1UW6A7YJ{|3NFpl|~xOG%^unS@D*21qe`zXXLhvYh7m#K^!J z#LL|qG4i+#h*}HN|NRR8{W|~tS)Q(Gy}1efaJuXAP9?vBdX1puAg#7OM_h&XhvA6i zpd_J)F*e0q-^unht*y6jtAo%Mw_JqQlm>Iu5@%nZ4u4d7z=JkC(siA>cmOM-fR^eyknhvYDz_nBcX_eR3)EZ+wh`d{ChGj z9HnsAQa-1K;fIZ0euhnz5g^<{Cee#YgoBg zv!ma{vwIV3y&$}nIIXbjpoP7?DNYnQ&&?WAJyqRpyK?6@#6dUhV)n<%R zzU;P-GtHf@uF8*t386y;(h5u2=+a5;WH=t=nrjs6ENdvic!@D=lPh$UwGiDLYkrkimnGRPd$B=dN5y=4xT2qt(><^*A3{*j$tXren8hfM<>!rxoePn; zmm_2?W8TAtd}CD}oQgG124+~5-;j6OSErb)j9*A>{N>V3%6s1TMvVQE(2B&)FzQio zf`ms3TPP!0bjWOERMdq+r(qO0W65L>r%UzFrcdv!>pB z5WOf*FWKWt<6y<9mUX4NKJ^1%3*`HkKX??fBiv7{RzIjg zkZnbJem~1XIQ0fz)BoC}BZe=(-p_s{)^ttgeViDFoaEvvDE*~BJ)hyX0L3L zjOurt;XArz2&-{}yIiKegudj}#qx^D%bxpIo~+EL6mM(Y?Jox~bX-lMA3Ys;_R{*H z@vGci!^4ZK%BnA441YCw6thx)O0P`5Tg~UEtA6)3SB$ideMH0$|6!Rw?yD!vXt% zM$zASIY_o5pq5fsO}$hynFH3&l$<3~{FFd3777uVE0?N^(3o(^)!kAfcAo(?l3O23 zEQt^DaAHn#tmNmyS(@8RSbwg@wMkf!-Z6067gPct08l~2r;@|EDG)c(eVG9P5*~g` z`ut<#Z~*{dZEe^~ImT7fTYW@;OB&JA%b7&9eaC1)R<(il3Mvf_*qh>qHYhDgYO-F~ z2hO!UIktgs^QEG4f0ipd~1q{2i=!4xSAvxA-^aY3lyjHfXl_2mKVx zlH<`&$%K6oSThDBG&(e(=`oOKaF}2T4|$9?$FoAL4<^ZU(8uyQEEXw?s{I`8iIwFZ zMKik%G;Ypfwp`QuVZNeAEvEF0_0SDu7kp?Zhn}e(NbOO5IvTrdzW;zxUob1ap!kz# zK>^x5IeaVlftZzL!Dv%Hxl|&>n*lvtW+fa3-2~2rt)@X-!@lrN{-Nrfoo(@Nut0?B zk2-T-mP#DEZSOS28e%qk;(P}LQzruVYmCPrfCuX5D8$^6F*v)>HG{2>s;3g%=RAmW zvPvA`j#IHI&P&;8iUpi$Ff0t9pazqw{&T)t3^s(ZKZ0G*00qoT_#o(ir`!LtmEi^H zO_mRqanxK}v{teMZ+=5^L5fv1pjNoABYpyO`6{dm@!?ACERmn7ue1w_mOLhBnne|D z9VUBzrVvlrx6^-=5O9WO{n}eZ`oB;|0M@9;J)N5N2j$>X6mT>UTfp4l(OZ%m2z~0MJ#k>u(685kygfW2A<~yb%t^e&D);OMouPs>_wgVbGw>m}Uate0UM< z_q=U{(Zz`Qn<#jXHRLuh4ga~I_>21Qi(r?i%>2;50XaIC@d2R`3spktNouly>{gdF6vW! z4Ej=@`BjHgN^w8z?x2b!3@oA;&Z-N(Uu~r6Ys0X+`P`W_DhCuoYKBYwsgy;&e15rm ziOzZ>`iBEW5UEa_r8~u27NlITZZS9719qe6$rq*j;pN);A1&wJhB#Uid+lj|_Bt?V zmbv$RNjy4+-AOr?nF2}0*5ogf)#|;f!2E98dhlYz6L@-UjaPb3Wz=QY;fRQvK@&5e z2ps_1QroKA4zVhV*iD{}kyj6@wj0mGnI3^B+`4%cv{nZOueZtQGH|a&+|s5hGh?Fb z%Ju>e7p;oLh2G7R;)vI_8PNJ&P3Xjy!jaCSwhGq1v*C!q_@tbEhAe;o=I*nFmbY-3 z_a?o;uJnu5@dq-5M+!snu6fg?v$E>zpixk!DZ6HT{T!!C6SYrEjzmW1ud3pwUjz(m z1}93rdq$b#4Zb8M3cr+p_FO?GE4_^Gt~7_n-*<;Zze*}W7=|P!kkYHhAd;Q!xd!No zp<$Zf^CUmSPL6~}UW0vTw_TD)hFx|x!&Egc8iH}R))C6qa=PXbyQO5>O`!=%v*J-m zPfhDSvecd&i+PG;_Y{!19dW;sqV){3ssORkC<0Web}CV(wKIP%z|&dC+pH>DBqR*# zQ>Ylb=tpgx!|_jVy5x`q6n(R6ooLv!Bw*Lh$$jmlaEH%tjz=Yr;U_tVLhfiPm$bCP z3d;H>|3Ur&0e{}7Us_>7r9(2J2@z7JN!8hv3iOEwsio5FArTT%y_4a8QKnWjXc5Tk znz~#nh>lli(V;i)h6_8#9^(c@a#a<=I4oG1BbfArs1oi+y$P{vmM>D6D;SGZy_vi6=v8n&N_ewjjZ!DiSJgi`3Z zRm&OYCCo39=XRU-=3B;2F?!l6w&>C;y%#sozg&s+f0Gb867X^-q)SvbZ_*0Z7V@5D z5Xq$dj4>dV-YvMgSGS>Sum)4UmJHJv*y68$Oi^*MTH;F7PbUMjl$_l2V9w2w&+rWQ zPw@661t&Fhf|hX7NQ!n#cd+CA;2!b{>w}TN8FA=fIePehf@1s+?@%GP02Nq_;|~?k zRVn0N;`vp3+oI)^howUY$^uivvd>&eOGDQ0gTi+k0+^Zp%F z92F`omy_@u?w<1N!{uwexWWs_upQf?{a&H$gj3O9(X{Q};xXu#KSEZAom`|6Kp+{@ z_sLf`!XI*O795sC2wYb}fe_zQC~|pRY<|Z0xQN%n=H$JzUJUhI4(% zh2L$hb|2u`tNnDzJMYK5M8Ea=tSExN>$JQs?or!S?|6y)x8v1~r~BH_nol@uP6{+6N z4Q~d0+$1b|m-LLkKWzb_btb+f6tl>Gx)cyECSdR>O#cn1)P$pwKm+Xr40dTn=~6G2 zpXPiu5;2pza$&;F(n7Q9D1hfAO2f-ZXvdHHi1U-CC>QzoCiywvJJ@4u?vP#g6p?y0 zr-f9>b%&?4Iv)KAcej2+zQ{klh1UeJo1KN?&ZSLpwKzhJ5=k6r=UfBk(!kt&{gUHj z52Wv%KRpKjiOE#RP6Ty~^?!RZ;3phqiReT;=q)DL0xcr3Hz`z0?Sp{9UNaXDk;eJx-p}*b)F1^`l%789Jenu zAAQFq5T5FQ3L~YJTjAyomJqdKBa2~n@!a20xmwc==;;(7g zUZ1(In0{MZ$1%*5Jo77p9pDt$N0!cGha3svlezG(x?%r7mA0uI{SJwxU2dc$3>fpf~S1q7IQ25 zjcB6wJGXD=^&ANjugdV8>KK2cbgdn7;gY`q6CHwuR;IXyPSKs5J+Pvt55y*|{OhgqKEZbwHyVcJ!%}2pYVTy!(7;O9iq8sHfr#57O@AJ9fF#8ek zP&q8cxAauGb!*$KCSmYR908)e-*wCK;QO(!sbNE}YB_9=UkqQHs>-xZd#`ELt(;1F zH~i#cmW57oFV+u)A^j=40>%dNkL=4pqof|f%-SLzMFAO}fzcfF-l9VhbDC^`)qmew z2d%?9qsrNLs1G_-`>N+;*`PXAmBX4QsWF$37M7XyErY^WK}oYz26ULpqFAH_qB3e} z7`TzBL;5RFNFJq2fR&kz^rdNv*QlJ#-2q8UT%btVf4*~2(2GmA&r-+x1dZ$uZX#-* zQt$r(rn?g&9AbIUW(wm9F z>VEMa4ixs0g{E78N#qaT)Ul*9BR(cp*G`Lsz1>!G##G>c6h7Rd)T|1{`w7h zo=Bcn{I2NNhdUvu{2I^K7pnJ)iz(aJNpJf5@w>_4soe{ipPVJS4A|ei*?!C+GL`c0LEq~n<%=lGX ziIYP(c-9%kq@LO~vy%2?QC8Dw*3*9Lij8B?I(yJTCFK>8loI11QqTHwVK?OcvAQb1 z3}eRk`!;!YT#5Z;7qA|KIU}6?1Xg1P0;#TVZwju-3bKh7%S28GNFFL)@yUFlEn9yN zg%(vuNeNlER@K!dp#&Co&cD8aam6TCx6tl#@wqF;#f3l2k_zkC|Kwj>m zc~U0I(iF?iF8H948E6eik8&679iH2eIY}Tj70Q`z%!X+E8pu6JjT9i22!|*8ZRC#I zs$KhsdPP@dP(b{$aWtV~%ciP{5>E%MXksHIxSTYcDJEt^F(-v`RT&PM-Ap{Y$X+G; zT1grkdN!wP1_K)Ea-c&=LOFW|S-PK0Zdw4_x^6j7D1_O{Nl6?Nb5A}&hR@83CwA>A z38p~uUF%&wydYA4d`olNN_YOGwAUJ9y@9ptfVQ+{agfi7YEt#7nMZ`OhwSG(c-^+y zN2ta-gcgUt*lf9S#kl6N)jF;BLBYa3nfnbdzh;ejYOqcZWbRJqW<(n_v5jKPGi4`^ z+0#)pRcm)?N-20mer*pKlrd|{g`5QMf=lDMY_g&v!xbVE|;Etc`y@b%{k+q zEfwsP5>vt)%oqE{fUjez^Ec!nB8X&g_cfo5F;Cc8#8(9e|BhrWw6wn4y}_c&j?yKu zl#EIa2cfF^>F^T^dhv5rqNv_081B1EEJqHyn!nDe!Ac2j_iGP|doDBgPQQuFlh)aW zUClO{Z$rQ{IchQ|!tU;TSdDyl_j!%g*sF&@!tH+LC44p=wC+K@qQ4 z&0hJ9u}Xnf%cdpuE;5n9Gqb!znWsrd0cbw30R=if8$v zsIe`M3MvKSelb+)evPVYdC7FtdG zg5#|x|6g6-9oNLxMH@gtsTPnfA{_)o=?I}nm)B6zN?- zdWQhgmEL=Y#CL-Ce&7Ax@4Y{S0h!5}nKQHZS$plZ7Ew3!6V?x0onzRgE%B@}T#wDfpZ5-&}Dz01p^0cq=##$49VOt{j~s#6x>x27I;S zXGtdf55Qz&TM+k8mWL=Siaiib?ogtYJrU-{e;jcI)LqmZ@SUPk$)9$iILBx#1Sx9w=L=jfDs@5Dq z$V-ds#5)Hu{_QV14?al~PY3qLY|OOYClV5Vkj^N72b24tk0{ms27jq-K~m5`0}$xq zN31V+$qgmEzUdBP;zifr5VFrL6?AyROFnWm1q3Y>P`hoDH0Q+4#9e9Hdrw_(jdg10 zd7KWv0%%_R4A3W2U{u}TFr9LV4?g>Ag*$u|D|It9<>GlDMyLQmPEHu;@x#@9aLs?X z7RBU2tkgg_^ypOMWC^;*4YWV!IW_+Llyp~^7dj^ZJ&iK>&a`?f&&_m)7S!2tW|;Pi zv8n!ziJKirf?mww?II%%wBAt-#k0-k{I6M~8Qi%E=0sYT&@J{Oy zQNJ4a0jD*#*f;!BT#YZ_ASdB&+U9JYvl?Q>J}fc?baxvdRY+d=M! z&5}~F{x&r9UHetM{Og&NhN+HWBM&78&7h3*z8HZ!;fYPFtW+RwTf<#`d5K!{;QK)OW> zp+6HLh?nsSI-?(zfIwG*f}7{CQy+nV0@t10K^IM!FB2yEZh<9gCi5=c@6R@j&ZtN9#`n1n_vTDCCnT z2W0aXq@6}U7gY{Nv|Yh_M?AM`mccwHC-uXE_oqCu1IpuA6y#L5tF{f@tQfXUCnogf zRHTi5(^AQxk0GA!gtK9`XWHS^3dQRgn6j#N=gV=0HmcSKV{3`jC=o?aR{QkKB6^db za7bjjh1D&8R81&y5~&eyT zL~iM+;n^3{1+}z+eyy;-Up9_VmnH~w*TUbWX5%MQ3vzp+;~<(!Lo^vy=4$53@t=t8 zKx$1QrwJtFwcF`bxTp+=aP(&LzDy${fMLEfoQV8Arb0{s{K9daEc_3o*mN=9;nHX+2A#S zj46p~QrBg@)QR~8SH>{Dy!^6s_2B2lT|_S%tCF-=MpFWKD?CE(3wztr3K{0CXH`q2 z<1?z+XYIW_SC@!RUHkmw9ioGf)>S?%?+aC`3T(q*W-Z@ts8&&Qhd@sH(`^ofMQ&7x zXQsKjW={ss!7_hC_!G^=W;0xOxnV5dqhL`n4@TOSN+sw6cSn`pC!NEu!rw{r!MsRl6B+jZhaBz z`2fl_;bWZ3=u2L8uh>{j*Iw>Og>Vdot2Zs;do8l2{NeIm&R!CqO~I|Guy*G}tA?Bc z=tsFFv>3ne;dSMr-9naVJ!d+`Stj>42F8>+D(um+_VgXnWOmmgpP2<0A+z9Z_b$7 zhj+9P(}shaBC44w+D>=`RQkUm+QY0h@e6hjWktU-n4wnmV@4iMDWWo3h&(_SW0y^t zVWm{Zp=lM-Cyfp}=wB-V897vQp*gki=S4s$Op5Dvv~}bdiM5Q+WluKMk2c@AUeCQn zf6g>vD}BgqDmVZ&*=L`~{<{4_gFJ&y=?W7oQ{*HK2E zK?4|d>rIrJRQ|{H0o1*a%8Gs#Xz&p{>j_TAVgqF^=A6Qd1u~E;qeXIdjK5MB%BOuDLzl7psTlR0bN{n5C}bJx_{jKCQaMserD6-o=H&yR2}61 zYvopzkvSOcOXV5rc|g+}^Gk!o2;R%12u&$u#4_&}KC8n_H`$9j9M5NpF?~v*U`|{x zkXne7V{8eU@g>z#uudTmj63()f#E#y0KTM`j)zbIYL^fzs;XaYXRT!#o0E!XtCt%P z)%=%8Cx1|!ya_!XB=~Yv!*Ql%!gTYC@>zg~rKd*oyWT)SR_v7>x?NjH{8WPD;qvg_ zcxZ$4)&6*{QpiRr|5Q2*2HB(V3&e7hpd~?JWEFi=F!V*V9cI4@sxd_u`g3hc1JTw) z(4shksM#ij@+}O(D_Jo{@iKk8!(xzAoxzPk!=S;4jX}IfTnuRj0^ZI4=?@^Bjd%U~ zI;$YPtcJtmK^ifOg1q5q+@15{tNgT|yp(d#!_y&DKAG3!Z7Q^SlMd6{czS`sqZ&a` z;AkS3!?5D~8&Yp;c0mM8K#4(R!wP5&~bG2bJKo?DXf) zg9fyuo6T`VCo-P2U`ZYcQ4~qT(UwXNz>vk`8$6Q$*7v7wb{XtxwXG8Xp-H1G1sG_Z z;&=YvkQ=%E@a0(O@wM8LI?urOy=O3xoBu?f-1~IX68M_~ya1Qvl$r$q6@P?)D!{C` zN>}WFAJ1gw;4)CS4Z5!?f0rJi;+RPXd8FeA1n_`udJL7D&S~I@9xKrEHOOFE+VSQj z5JwpOT?hgb7yo&5`2RyC4p5$?FXCqUMH4PK0)WAIRQ-w{pOGaF(K0_(vsS;CfHfi0 zuO!w~$tr|79R^{qOKCP8*<_a-hCs=exD29LqE5O!^>3&sSYzb z_~BJCLC^R4zC~Yd+9|qJH~un055~1BeHr0Ix~;4s-G;Ho%MS_!uIg3o3vtqy)ofjb z0Xqx0yF3*G(yBR~pv)?RFT{o`W~uksl;%kjIB~`1fcZFCYEHRArp5X^(kU*Z>3LM* z`(gydo{chC8!!G*zZ&qIik|>$Cva9-0RJJJ6|8aWvB8MzJl4C$(G4g$w$k+RM%r33 zvVapKh8ip2TG~F*OpFy5k^tkHv$eq)S34 zx(CA8Eq>6l(E-1`LiFwhzP^nA{eh(G_mmkva!g2kA)2_2n(BR>J4xTU`Yv9_*Fy5^ zvi!$|VkD*7aN&4MvdOQ*rJZQz$~-zH{F@5D3~1t1UqK~SMSv30T zLix$4^TI_+E6E&fSz~7=j(YB(vifu_g}?p^j`bXByK_16x=6HSv+8^kgQ1jBvU2z1 zl6ODa66P$lMLYGJ;(8vgT6!=x3gxkWr~vKAFKn8$KhQl{ANsNN_H;kW(t70HRkEE- zite8K2K!cMmrnQ54Xxepj&IvhEE_9My#{6tA6#S2{03B?@?ZK&UdMx|t_TxWW8v78 z@~Pu-@-`c=XJ6k4MCKY}*ESg*O6Da-ic7U?jaZovS1t0C^f&b%D81NRs5GM{>eK6H z(MUe{$x3ud>NMFuwWRz_+{0HJw5vM@sQsue<;=$yzMjr)$7_ZP=et^U-v{O{BsPOd|$U=(ETncms$<-3Cy>*NTMO?b~Ct0b})7b*a)#|Ooz!!VH?7-Kv zQW-E%0Uw5`%%w3R;X%GWALTQQt@V+dbjd&(-CxBYgY{)~vFn%50-mjog}&S0iw3A}__V6hpk)Ti-vU`^vfnLM zAD9u?XrhcB=|jzsK#Q7xLoTyN*^m_^ZoW6KPVfrxc5HSQiSJyw%sST8``WeSit}GG zd%5A06HSiv&>o^I=~<#TD^b58Bu8$Wdd@k<7dbT^m{WDq?ar>zmG-b5%D*_hi8 zR({mGnbkVCvS9pD|N4A9&mTrz?`>_Tx*EA#P{z-WcG|%-Iqsnp;#)=zM>y7sTe10% z8frhCM6M!QYU@fG>h3FAdc*H;k-ObGA=N&Wxh%21%VQ^S5)=Mp(ugW#=1tDT*85ndB+1+6 zs4?q>Ge^c9+kX0^*$_qFd%2`!H3?^AR7@Y&U)l@NgfE?SLoDf=?CBFi>RS+vhRMND zKk|Xr6H**ON>U~Rxkm$dKMS@!+{0g6z$^dj-(1u`RieMUn|K4I2wc*}J=a zBOY7Nwr3=Q;JpNA!53nE#1{3KwxAf&5veq$BnS7lMNL^x5UKX=KL(Y45NQANPa8N7 z%CmvEg4@s@!yKIG>hWe7q!9Lw#lPh{&#i>-#Dysu^$``U-bohcJ~(rjZq_E zyq;Ojm+QNKs?y7S3s+BWqQSb(^CbRJKUI5%EzWgaK0@DMTBXY{2iS^V-vt9GNT{fk z0mj8dp@sW9br?hi^bY@xRQ;!Xgl}kibfQ9ymD0gh^WK==-ewy11N$h0lHv_tArx@L zUa&xB^GL^Sy7-FdTKld;9R@e=@3b&`+$PW))PM2&8rP-K$F- zHjF-F?BY#l3O+WY!aOukfg zDuQ@nNyH?@Q+*U2cUk0c5lCu2&&s|Do7AYFoI5RT+1!lK(5TS`l3*ZbBsLlVm<;X< z&`+(?$VC0i6qzgEhNc|!+L;aXNHJQIta_6ovkTd3K@qqej%yiM8P0NOTEA3i(}$&{ znmfE0+%>(4T$CpLoDKBz4K`8Nyicgh?lgGy5lGrlOr&>999iR)f~oYHiBSE4B1oBx zpxFiR7P;3S92!;uqg#CP=z-&mSOduSUHxX|La$AmV?D0}%>&Aycur71{3tJ+Bu)1k zzC9-u6)8@P#+9R)_wt8MQ+=sy&_kd$zH*-Ur*~@N_n~>or11w3@}L{>?wmoUyDuQk zmjWVQ!DSrvsq1tk<9~m}Ma+>ffKa(ea1M4x2=WTqpdmm`EVEx(nnVeWyTfCy=S_4M z1S2!UV=oFU8=_d8rOCj0qRb6`bQrO$r|C6=(g0vG$eHjF$rnj&O8=YkD}($Ce_()@ z7XmzrH1T=CasXfZb=FJ*4q?JUO+cOwN0jsQ>;0Uo0^@oFv&9#=Flpw$k>LDGOOy(yYHhYuW|RGBZVM<;0L6> z-ks~^YQ?9Jm)+(S(^7F7ewf*5v>)FcDE|>Sl^s=#eu{qNtfI~FDqO8wEn|5A zd8M7Wi8h=ZFA%X7~yZZf5mGNI<#|3RW zb1pxzk!|H`K}v!xz`PJ2CGK8y`7_*73|4@Gy5t^TX@b*B=kX2nXul4CTu=jF!3eYJQqllyM0m zR#0$#!75(PFW!`^lbd~+H6oFC>2}#E=|d>>Lkpyg%9RE5l=EC)Qd-Ht-hw~-^eY7m z_{JMz!Pq`l=NIk0?a2i;)#M476qA$Vvl@EmMC7rxH&4M<2;!u<^&mm+;Ej9eiJ*l` ztLM^RMpJ=Fuu{%%!X*)b+W2G?pOp({$}?rJ)i!U&@YFhWDsV37r$oKj0prR@ zkPvzh)y2<|#Jm>VI%C%^WUoD|UFX5>wzJ#lMpXvO4WCnt`>PS%+&hN;v8TqbH|X-? ztXp=wYv+?2`6VXU1FhU2CWaroc{&EOLc@5v>*mhd3;C+!jei~|9DVH-Qc<=LHD0s3 zY*rPO?^)FOthd)&Ltf*iQST}8TFHvAV-Q=>FA~p0vnqR-^+v%$?K@GFc~}X908o9Z z5JIp;SYJ3Rdp^8-U3MVb`wPDN`ePOQC09A}oYf1jnJCT#gwxz(PLL;Mv`TYJpxtCo z*}M#)=~v(RlK#?LEDR|vK9VqYG-GJa5?qiVaA}ONqYF;IqFuVly%~p{W%_w@Dr$&! zFoT4pJMXXWGqz&A58v=&ldS0DK1WX&QMU6r&u68`Ocl>>Q&xL_Di?r8FABW>^k9d4 zbmgK48OVJ(QB!P5Shsf8IjpN>A!47$f`ar%0x~g$_etlKYI0hOfzrvI^?l&dp;5A2 zRM)pEghq;D9G}nyPZbjvj=4TI-wV0*cE3RJRBhgVurxg)Tyw`3O;@WW>cGa@dbYpt zB}$JiXNZ9(P)@NscyzvUH!F5;A%AS;zTC@a<#(Hs)phuvTwf`gP_7$)#`wuBbiLCu z6hqg|@@dP`jYH5mO<8-{T%OleHR@E_-zJTSt^I4>Yx3z)6PK9iqAPAB?t^@GjAbKt zJ+4i3E&pKtis4o&Ta%e@vUi}PnB}~Tv90RAm!W-1cfj;KfIu#Tr|pdPrRnAU7MqxZ z=o&Fk zA3@{ze0Zg`?$-=CsTl>s#QsOyuFXj;nV}XzVeh3S5{o%Fs?Ip`EvqI~e;QCLi+wRQ zvt6)*%D)(|J`skiH0YNTvU72vh0fn?|HfNz+xXB4sLHy}6~^RSpp@hWO%ZBwz2%u` zptbeIIQf?Aep$kAh_oP{T=SwxKNboqZLpDTt?oIv+*!8;oa!#%@_hOy&R;@nqW}AH zkB=VNgbt+UpnOifIq^yo%>XBJw=Cf?yx|rVX@i%3g@5X);>SCVW6z`+O{T_4H8G5Z96&KZ{CqZ?q5lz7_K}yPu$|0Fy^}X_mErS2;A0h2p|pNrx1_G zVVGAQ=#Id*clN0uY$Wm|(j>|V*nbkCfA}=`hQL!ebX5U5&z2qhBjvr=ogu8JkHt`YF?GYmK;*$~#8a67vIzLYL2j!z)J2;+406sCLfvBQLsB*FVuY`nsJ;XS1{6yGT!QU4 z&@f3fX{!B(Jdy!4drpG3@d8P%?cb2ROpz&v#&nH+m#^;-04aI?r@jk@{CdrDvFd(ds| zX?VSz)i18r_n<;uz%*Q3YufvM6Fv>7Q^2xhj5C);CxN-s3$t}P7v9QQ=9ONcU3530~SVm#(=@zT#NaKEuAHNUh&1XirUcdyp?Yj zpSp-HpbuqaC@@VC`e=FKs;{o z>CxWO#Lr#Gd^kEBvEe9-Z{n}Kbt&sCEW`#;>#U`Ei^^hW;)#WoD3BYIuL`cVqt=ryT)x!`8;jIml(eZt5!p6r+@9_X_^K{! zzMsF^7ST&${@q%PqfWyyC*gx!H!%w`B2=inI*$hrUK5pe(hAbBX4F&7(`>qt^abpou61Lf8pKaJSX3iD|8_2%BMb%rg}OnW?K|_Y@pp7{b8}4HO%zst#+p) z!Y})3wsvpcv&52oe9StfiQGS0^UhuG4_Va>RNOlD2zu*aGN}QEe^6RpQ)yVLA1^T9 z%Ji8^JM z8Y#5K_w2m{(iyg!EtBk0H2B@XXq<)T``BOF65}w5TCuKB4g;a?+Q5p*EWwT|znqk_ z8Ag)CoF$NQD&hWL7;7YL?0uVmHJ(}A!uBDSu@aeR4sJ+;k_&PU$ zLsDM9l#Ai*($0nHMUFus1$VDNu1_u17%PS9q6nAbB611+dobVA(fj*ZoK8!e`qk9} z29e(c=TB=Z2C7fJp^w6Qy*|yiuWN#a%pb@&X8Y1N9M4**$g>v)M9ib~f$MO85q95Y zx2_y{)&G(%64scM;9)~ZX2toVQqP%7c*bK=@pwOnjfIL)rs%cUvQl$#@Pyk;bXYdz zSmQ9TQjk*%vxcz&FV{@syCi3N#AZBqKifL(_Ja?7ciWg2S7Bv- zHXKoo3`u_9Q0qgEKcdN$<*8(ex$di;zZx#9!(MV({}bWxyfI=0X}`>@Oh28-aA1Ay zVqPL)tJoVswiPeM-)rookir3Rq0Q_I{icxJQ3F;koI>vLC|G6Tyj_TIfU1)XXZL?g z|C*)ReR%)i8HLjh84zKk%}1Uis#~>I%?Ayzg)A(o=g70I9NpEL(-zSbQU|&=_U)G$ z{D%wd#kRvaENVHu_c4cIyL!~;q=9Z6=cWj~dI()l$$kNBH^Q{7z}nNE6Q8H|=m@$A zP?M1}FCgbg1+W#c#yt1J;Qbr$|0m73CWoz)D&0Kx24D!{1$1?ARprbC5Z0O@b}(>m zwi+jkn(l8g7F3eJ)6N0}4_8ybzi>Ar874mvYI6MY-nt4!oF-%~_~oc9EmG+IKAka+Y_^m%Spr@^r5p=zRP5-v0YY zcz2D;#jhd`=+hS6uRx6q@s5eN*Sr$!&@N)h4)4C-R8j=W>K@L{p)Kj58)z?=Lm^hU zTO12`KNEvQ3`b1Lz)_Uafu8#xcj9yN8imu+Qjy6N3O%{dzW`$ed2A46kafT4NQ0@C z)gT6lV%ltWGHvT3n?NTMZc<1v1(@#KjKNj{aqPxoFH0bWPPK_~ zL4^h=VmWr;BTOqiOfATrdsBrNU_hI04zM;-uGL3bD2O%a*8_Nyi@rHrWw08$M6|>s z(2xNkQB^7}g^Zn}5L69rgGaGFBdVU07xHux$65M6d_&$34CYKGE# zn>rPst(SF?sLsU)n)nrypKab~XQy0DJIaPR0nJ10nJ7)|1v~*c zQk`wJXNq@^6)Gk(bz{>lGj9`R>gJbDmR@=R_tMMx4MDf><*rCM?&mp&PAc!Ekalo& zaW;cISppb5|4G__1&|P!fMox^*Z*v1bhEMlNdw*P322VhPi{9%_EHH6%#u67RW9Bd zn$;+2*-_Le4YS2a3Cn9X}7RoumSw4<0>=>;={w#ZLH6g$D3loAc3T~vUC8j z{G9~l8*L%l^psB-Fah;u%}X|Pkpn^(KFCwX^U8~VQFQ8l%HW}0s&XPTuDDJ4(^;h`#jICL<;W>#pwLW;x#F5& zAp7SGP@(hpM_#$}P2y(c(0F)jmhHeGD(re!qOgP(%_Ks5UcScA`auwF6vg&Tx`Wiv zV4GVQnLv8URb*Ig*E1=wI30U-<6+fk$i){IXxG`?pf@}zxZZOy7eM>Om2iQ z&CjrN`t^-2mptKF4zK&%H%Cz{^bGq}nQ!+#O01IjIr3KTyu#a5kDT;wIE-E^&Z?jc zPtvV6Gu}+T_@oY9X3DZ=Nl$?u4l925<@Jq;C$R^ZfJaS1p|F=ZY(*8ShKBMXR!A(=V0G3%}ljMZM@V*JdE){&92lt?j=pyrrBp#npiR^2i0Q6elpN)G&NC#Q|^P0+g9 z$$z8Rr%dR3%{(`uPU;)t7_Az)YldS1N}A>bC|FUsp&`XOPhq8d0L57;D(!l_&IWvvEV!DtbjI zvB9$&ZJ$3WlKzI_U@u=4N!2pkNMlbc6{;6w8ibj1JQ@zqyG$#08Ag5}PR|40+|h}6 z18J4vq9127%;AmlFNh}LJ=v41K2M(!yY6T75-9yz5r#F?N-t7{KIr-WX^5bs=a^Ty zy2_F#X)BQH!FG1=C9!PIiIyNVUBDl;6k1%f5JH7RL8*ypCgsxQc6NjccRQu0{&12= z!i#%8mOqEt9)Cf$#fog*q|s4tv>s0lVD`N=ck>;hFHArcl#aEO(0`zLUdqTn8>H?9 zgTJ0%oZp5Y&%mP`-P@olYd&-gs&6(gV|DR@XYm`xcMB`Avc)B5s|L+yNAG4qK_tME z|3V)=t`@EJfBoa-Wut_Y@#Y+N%V~pn#t6BVthi{5Y%Gk?uQUe*gLbOs%G2aUsvlk= z-qmlBo8LJ0Qpi=D6RH4%Rgz3G{z>oVf`frz2ZRp9wafXvn=1;Z$b*5@FQ5o!YYG;C zpn~vP5yOlv`)>(hKufj{PhJcVdvRFwf65wQTZ&>oXFm&i2B$b|7RGIV2F=xnSVB$$ z+YzkXHLyemz0>NeDLVNL z34pvJby^&B%;KL+bsgmiJ?I8@8F-QZT%-=8o#G{ZyY&FxObVf07e$>31 zRp{VpDdqz@i=#%)+>wnX_hGM1w->-USn^K^LckIa3{zS5&!l^u(Jhn>gZNnE>K%lq zWn;EG{AWBUesmR6PQm@0Gcs3L+Tt&46etxTPX-8LKC4k8o29R5YZJpDG8&X)z^BD6 zi!&YO*>_hHol6&xg$RF37)hArmI0H$40Je}X;KKyVjDA_DI=a5JbUy^pOz~qO2L8{ z>JC=Kj;C3Nun#(iZ&&sCh&Gn4MgtyYdNV1PAER(av&cWa(<(3(2v=!lxGyzjBu*v+ zm}mSQlK*b?`n!ndc76^FiK3Eq+&n|q6pSz@;bHZ^zIHQRE4~)0BhK3_70EC3;GmcE zb1&Wsy8`Tkd<-pf9T&~EyionRg-sWqb!NX(A00v=9W;~BIIGIvv$(yjAkUTEjn6t! z`aBJool&GF0LwsGAXkqls_Hnzmyl(qyBZc zi#kK^sUoa~H6?^QA#rXv$}H?|goVfF98TMLL1KGK-AKT}kSCL221$=3MC{m_Q$-v+ zB}ES9*U0OmjF}yihP;BW_QcU~pj5&l)OB;TUNicKXnuN#5J!hHFMZVUkOe($zaG86 zgK&h=?s8Evxv4K?Lr19`+K+o|*`-75#2!|Dx|^D~_b}NaMVqtOk|>EA{z`v3LC{@} zP|?=A;M4jwd4>-Q+DeDf_1+}~JDNcuL$&4>z@P2qw+CTH&BZK_r!$qBO-jn2y|=Fr zgD7dBwES*INWFP_-OupTWqY%0u#H=;YOt-=MFXrFKO@UCPlQc~JEo zk!!u#(NBWm-0|h#5QnNtrA_E-N($yr@o!i}JL4ugqE$aIzxJL|cO%+oL0Q_0NO^5% zAcVcWZRfGsCjr6bAMI{ZJ%`pZp6HLfeX+h5dW9K%)#&?QFC=$$XsT*lBrJwFg|V}? zyxNvKY=N4e*o7g&9l1nU)|6nvyHbl2di1}3Zr(^J?pFM`inI&u)5on-{t1s@%1Bw zn7BKb)5dNb6Kzg-qQ`Uvq!Z@6!%}9g3=VRFJgK>yeRel?enSHJWDOowTz-BOA?o3| zc48n_U`$&;`eqfbX}dl z-^J8uGd_q&iR&cZb4j_-O~safZ9=)6t=kCO87*{YRU_<+rC`vBdX(T>n{O)Ki8ASn z84PI)19QapwYt71rEiJrjjzcn5hM>K$;xS0f|u4;E*XFi@!O0fYh6|Gk?T9r&%PBD zBJUh!JFxxpSfiKe^9pywb%ky=#f#r{NYhA9ZkDkokB)9=)q0*$h82gldr{EQu%g?mROci>TwS9@9r0RR`6{qL*ue0&gxUne8x zTdi2xa09y5Fk^U=BDmCvNEl>+-=hWz+I-PMy#2o+$_cn=qosMFNXP1QZ;2DRIrz8s zELeE1*WXaCH$3&8e70<)=87b>*x7HV#(F9uAPf64C0dml%0O$_5kOLTbU#{(y`amu z(sn-533Q^K2lW5U01({&*}nPCS0WI=u|5qO#J^UnO{cu1cn9$-|3m@P4W0DUbu}!r z3I^s&585`;v#fwXDsJfuT5HI9ga)yT`}v?xb_}zLaf2_ypcE8m8t|V~F*EmpfW-Kw z4f42;(ED6~DY3zut2EcgaUB%WnYNdosKQEiEo;WU;G81PZ=*t*;GaRs_Jiz&d(c@` zn%uO`SSlSp<3HH2T2){i>=OS0fR;DEd9w@pE^_H7#On#--O5O(EQO>dmiDWg)=9VO z3tB$qZ*-A2e0mvJM^5T1xIe?TS7&YJOS3l5~Z$?e9VBOt^2f-8jkg^rQl zHR&`UmR2I}vl07YHxva+^w~&M78v!&{4#_pZDr8AR9K$Y3~N>__XW@PGd~>>s_RZ% zz8xxVU@bVNBa=Dv=cxdzZQy!w5u{$)|2sLY(?NI8#Vp?Yg7boqjXgLSWmO8{#7k@Z zWJg`2axoOc(3`e~_gc4Ac;vL?^x4w@RBWm2c;mbSJF?Wwk2E#v9TyJDmXn5Lq-XUJ zTofH}Nppp;xMU8V3_9v6@j?aP$K}w84~Vdu-{gLP4l1K}RMjN5ln@+~29J%h4A9YN zhVXH_vrKZzJiK~82wlFx0`$fEK4r|k(BP(Fd4I8uCO2m50cY%(+;ZcH&QtFd)_Si>$(y}t3-4ier0g*D>Bw9ct>on{O+47tnKJywtmFjg6^U~7-w>7Qfl;kK+Q4%gnaZNEfw z3`7DB63aK|)Y2axeb%U??Z21l6_a?+G$vBcHaG92DN-yR}^6(oXyJ{)} z)!jlyo?m$zym$J3%KrUp=_?McsOKz_O|1^(6IKMtQIV&N=x3eT(jO_c>MF>gDn%6r z*Gx!bJdgwt-Re(OmCjO~W^=OFBEN5X^f#XUg)K8m4Cqi%nX6}xyD_r%>kCV3BBuQy zPh1=zr%S<3MeiD_PD9{++!?5klPd!0iL%r^lHkdo3b{~O`A)$>T;zq~mG%9DRH@xX zG23=oh5$(p^~YhtvCXU)n9ZnD1~Mfg^slK9olL@HO+`&}x+nt%|E>#{wmPZ zQAe5#MpA2(zG#nuSgt|2VGI7#_|r`b zo#@Y6OS){inc9;#7g(oE0%)z$FF&xESi-NySQlR#Fh13L*iM)9~O{1i4(Uc+i-lU4SEb3`R3e0T8kpHDl6^_ z?$Xi+?GY4ZXQ!43or8^kBY2by4E{3vRJQcXgOIRWhpT#=sXuL7v%mYCd_i{Uw!6NZ zWYgN8DR#2a#RqMvRk8UFmsunkHTnkT3?$_l8jJh2jMgcgFNPoxi`HqecU-7O-AR3Z z3M|(xMWn4>C36X>p&H5eB!vKVoqS zw?Cx;6t`1KYSjtn0tw?qU~K8y)vtK>@iLN$-7aG*tTnL?+s%yCTZqIRC0G#)oyr?I z-zPP-Y7DoJeBrd<>>>20UdQ=j?X z1+2qYQ%Cf+mC}ZT0-K`;F%Ref|Fa?0?RMit2v`E^CK6vWCytu-kQ6XZ73= zw<|n4IS=fQ3Y-u|-^{c9KVbKr&abaHPvXCiA5w9K#~(BE81IF{1%u>%jl?@{Q=A(7 zrge-^FOAhF%ZEI1sUfe5`*Fjm@^4j?cRs(qxT7FNA1^I|e7}s! za3`wI4VHdwT3~XlEz3K)Xuq6itjxJlslr9R2v?_CL~BYUzb`FY)CEfEsQ`wasogpw9(?deEf^|4+;#Fn ze8pY1K5gRj@BO^I;O^jVgEMJxS+|y=s8jrimY~zC2Ci)S)4G)asswpnl2WrAEtRG! z$EXqo?j*`JYTkbEY=3haO{3CA+@ZdsrMCor@^p$v$=@J}h&T6M2?4)m(^=J6)mzHE z-62J$G=S1hE!Cr=Dyyv*?$LY7ds6meRH<(?@)yHk;%j zoyqCfdu6@)KqS4lxR7pi&ZLPdM{>P3v}kmVB_wKbPp`!*cUUarom0$xtJI8-&8J6h z=CtOUdNXye<_pY^-!Jj_r{;|vldN=avJ98flSw&p^mJUhAi8F!x0V&s#*13mGQDse zZSY=8Z~ZL9!*WA?!_;q$jIYr8lqKpfQI1vJ{H~G9j0c~0#%o8N-uR8xenG$=@9>F| z7*4G^*Nv1Z4!PRQ2Rx`G!LAcM)9SUfH@7G4Z?BhYZ?*lEovrs`(>(2mjYSWN?M+^! zOl6Lc(}BC@rTR009mk0igRAm4N8f&a?bfS0xSka<%2==bGWI%h!!56Z`pWpjTW_sj zi&jO)tV&zbrLHSAaBLBOF!6@ z%|qvKcl1kc@l2l9lgE=h*YSxn_D?Yc-Qr`$#+@1S*0;3gU<5i9A6%cJ>eB??{Ie5P<(=NAJ{l_Y7C&NVhd%j>dYHY l2>QT!tifjBrlVcQSUfH`}hwHa2tnXKg2Lw(ZS!C)cKvZJz8pxx4q_zTbHmyw1#L z=BwXt)$g+CD8wi*Ffi!ya#HFrFrSM4%`cG<{`DqaojU&pI5!D-O{9O#56LnD28I$w zUP@fkEBmbbDekMh2L$SEbwQ5pZM`_7wXrZlO8QgoLZMR;1xUd33H4KF$1nI|(TL|( zI91?X65MZ?w0+igNw5-B(|sugiXGmWCH!V;b#X|Jt*6&me5WX!&&c^@{k+A~Z>!Pz z>bJ-Y-Lq8Q5w3rs%H98S@xeLzId3kUz~)y@w|{98(V~8xw+$SOOAyZ9N zp@{!fh(6(q-_W8)AmL;|gaH;;n?=NS>?I}4v`vo6b3FAiR@EDeNLt)|zL>oY)oQf` z5R_pQz~{p40c+yS>E^#fCefwCp%f>=#Sak&Go#3e;o;dPMlK#6GHQ5$&ox?Iyaksl zUep7~SJ!Mo7g0_^3%4BmUFOl0{rNcXS7Vj}eGvu53tla0)yJa9ER8a%c(vqyq)186 zxNDipC3aAx3V(|`NhTFBKR|s&omVX%r1w|xPdvZu8`U0pvafG>+Jg=)<9&T1&YNB5 z#5_(wc{dV+-wYuDzl;>(!9JA=Ouz9Pk zUbMMtmi|KU*s1yMo7^QEb?XdSMOv&e6FEO-`fb#e`Gf=x_a7O2eP5DGN}AtD$e%Y# zb}%`Bawe8L=)heq?0Q|MBOA(U-9Z#;oCl%79!L5ud!0Yf|CHM46={&F)r#}s5XRjRs~<@QZOiW-e@fJM zxRO`&>U7IbRxcG#T6}{`9N^7sV*q~aNXZjXL>=R_^noJ9N>vDdY2jhN`HD1mcXn}R zrZ|3n&I0b70m@qd2@1zSnbQ^~z*?Ro9I%Ar910{;EkdG2 z`eI*RN>e_<)Yh-AO;d<|+iBpW!j_(A)X*kmUEelT&l;hW9Fmo)hLdP}379*T$9no3 zG5e6FMzM&WDrQTUb>>|L<=iZe^rizC)Hk+{^v&Q}jl`vsg455z<&lvs*Sct6Zr4}g z$)BGd%co4l$Y;9T%KJWommY)7_SDvph_yvY6`l^*N*sb7xy@nQSSrtnfW3u0Q14H( ziP?^b2A7twNv`?3o88t_s1Rk-JrMIR9l~};eZum)>ExS-K>9Ut%F{BqnAUyZ63ZE@ zcBiwCb)spDK1S2erZVQBgPk`K;GA9gRqD17Z)jCFJWc6GPq^kB7#?p9`Gzly)}1B= z7oU!;=jIUpINj2u*=1u*OiTf2 z;HX*qb~>TS9?j?X9(}wNFMn8$XhHhj=ygnHJfW?{=bWRu)|e`q$uVi{av=YXNn{)E zRD;mNzjfV$O1`SJRJXPqX;{DF7;do0uAgh3`*O=~WO8kZ*~#fo+PKp>W~!Cdp>GT< zLtf(9Qoc}V9*@YdZWeyje*}(L#V?#a#ahGp_JFp;#-1t z{U={fqMz>hZ#wd;N;Mmi1;Y_Z$wYr#USXRvN|8mXe`o3vSg(-bqIV}_qBbdX^@|2} zd&D=rO>nYcah%O79-PHSF9yyaCR&*7o`u`qrARDp0UQSJ?HBj^c`Z z>?)2m99apZdw{HqXl)4O&%P?JA><^JcF9E>#Yh?dfR#c3Ag3l*gvF!)B*Tqp0Q3pN z=wxHZ`BlX+a=ml{@LYD12;yC;3csYjUN<03d0!6v)HvqxG_H*LQSuJi`pvN|wCP=y zQWqf{RN$q$)(Q^^D-^g!jWE|mkWg*Z;a!n{{`qPQbVvU0YM(YmWx;)``g3+c;-HcM z0^!;`hH3UPM5$3*E1F{irazC`t5CZHa}r*QJH{?6ouO4I{Y;apU8~=3k7N6s3uULYb!3d)>w7T2`$hE}9NX>_GvB8?} z2@;RcbvZaVbTSSjLJ!BKVNCNLRT_iE9`q|z=PPZjSCtpYd`|!vTs2Cr^Ry* ztC_dMJ*fJ3{^v8)*zd94FDJfEwQM$72hUP|zeMx_!U6&PI-<|mj66PGN7j5CM@}2^ zT%ANN4so{grHj)CS6yGvzlmf7z;=utPX02oKwDgOYLpM5`#H`8m4t8P60!e^ zhf62Zm2WOE$;L88cWoRDb5RwcmL}n>8*C#`z)Av_7~NE`Q)$t+ z`}TPLb>wAriO+P4Dmp=&$O)~~`VuqOt%k(yQg}F>G9RHDpk9`M;AgfRw|vY#?0q@c zuk-`sB{BK)C4N_&8wIzN*qc{K$!Q|=iSFC9j|TUjDH$|yXOJi@l2u-eIO{skodNHF zTyOz#m1~^NN)z?-NRl~!;=9G0<(#k4)?en>`ug;D0QY)jVId!~OZ`l0<&v|Wp^2ND z+wks5Vi4Or+{y*FJ~zo)+KOGmOc|sK{XAt`X~5%UgK~6>8VCsH?w%^}rF+oR`r;hf zzY0f@>2rLj9*=aLb*&!k3KY9OTzzW_{O@{XkA339- zaJxGql2)6si_#cEs0W;w{^djmj;mI2eb{yhY?K)IMp{K}4!)U{b_%_W#y#%nxcEMh z*GewmN#3dT+X!S`J*Ba!)|Yz%EDABL+uG(wVgU_QlvTNwH$Ey|hD2Ar6whuguEz4y`ctw{+cRefGPnG(_qQ%5${U-D-pYuLLzKbU z8JfNha$Sl!luLbz)AgJ%DE@_@we>XnN^3^WfSys|@q?~pJOVia7U9e28HU|l8~)R)qg~PH;&O{fbl&H< z?y~cp-yjO(feTxLrFFw>j-GZ)j-C=d7P%l%tg^AHg23(oJSvX03>a43wv}&+uatTM z$DA?1zp_7?Ou|8@StzUM-=(X~oZq8Np{aoiCZS3pB3%<7~-Q9d5!xge7{;#r=}`K%P+ESI7lgx{SIqB^ zTh<6wG9l2m!}hOf)K~hitI@f2;GuNxA<>1LeQTU-@3jGyIB07A9~x8+XA{O1G?BT4 z!{cmJ{hsG-w%$2)z4TpPcp|k%1@`^J&fZ>@I^pwmbTvCz1zVi&Ab9~OX~x`%rR_0X@7VV@iuk zKF+v~KA4NVua7y`o|2O_Wq7(~)#y_WYa_%&RhNWyDuQ;!V>F7hNiCIdy0n;I!0Fry zgFoGS&!{w(mjsAJFD0Tb>Fz&uaQ&$}3Y@W-B<|=IK520xo$9+R_SX3ikG}lc*E|A* z^yv_b!ZdC_DncR3>g^#%3@y5UuhX5nn1cl6h~s-tfoz|Ed<^b$gb<96@(P6N$Td5u zAIAu#;5-a`GU^%di`&<$_#=bYf$yl>e#-NH-$enXW(Mx10R%^ZQ?R_$3Thqptq49+ z!k8@yA8|+Y+S;={M6H?H{OSIXyYQ3zv)9pU8yU?T%QNqQJ`#IcL|^9qDZ6R&9tl|P z3jWh()>S8Vv`?{|L>|E1y0C{cIu#K7XEp&B-9`2;!w0=C{F_amZ=fD#NjGT>&F&#J%5dnI{HI zV_6ePaySBS`QjC9RfhZc5fnX|>sG4`9>eCBS5N=Ru1#Vo*(y zyRC=>bP)P(A>Ovqp_E+ebrx~?aZw#2qA$X}sNCHX_h;WxR}!UxyXiLqsD@jNJ=YN@ ze$mz6b!_3Kb)vTRy5{0kZu}|NgTz7{U7xX#=g~lj!-fV9Ih0e8fSaIJL@XUJNRL1Q zmyUwBF-BDm9{tb|%M@J&|Lo_FJX*ptpfvxYa4PtK+Ow+h;%YcCzFBrs9Gk!X zv@;A5J4?d43VVytqNGOG78eJwLVRJcIgfcfjy+Ueo@5(ZU)uHFerH{#j+YK>`&Bw$ zz31c#ez^s<3exl?$Wq{vLo(Is)5teRLJaTAf~^fB=+ixalL!i~SlRzE9VE+X`*w(yjlY>g1;Qo(TYbp68O9+E) zAtO#%1P~)#lNsv%WV39|Ycj)Bzof_rR1lj9yjdv*2Qd}M6x*k#<_PWYU^`4xb$h4R z!0vPO6zDNCctnN10+|~AJ4qMv)$7}$O5H`noQD0>W5jO)=|1p`#$z~^%!}_!ACL#_ z?3Kkp$Qy<|r$=BQ=!<*rh@6~|l-oFibyGXLH_~VDX{X8_iI@*ZA#3_o{U(wt{9ISK ztokAXW`qwjk5dafU=*=LB>&72hx$ukDt4olx7{7?fm{4*bGwBofbQm#vNbz(@s|WD zfun-U`(!_v`sZ@9;U0@SwZ|pF)1*3abxn=4JUEK)zvQ@3mbozAbpJzqpq7^Mp1-7W zd*JvCKgdahJQnq+i~?20vTNmOtx72v`qrN*)A{4?^b-8{T2n`oz$9Vc9*Q#y=sc}i z)7uU};i9>5UT`>iR$tcNcXHtvp0MoF_H+%9k+EG`-gY3Y=&R1WxLlsBz0v1s56_^G zjrUkCR{XaWD}#XguOMF-h2jDNey!?Ayf5QM2D*z2{e%XKIyN7eRf?ST_8QL<#W&9mA6Gps+~ zo_{8D#H#G5`aP*oAhW1^-)HISVSz1U%gFU+pD1bNQ!-7(o1gO`E~bfSkcrO&#skGG zhL9?N2;0F{eunR`4?Rg$9D~gvLg?hAeI)HxEi1U#5o4$8g*n%iUGn`+zb=?cX7ejO zU9;XU>{u0Gw?E<%@suXlidI)kxaeG;BHfdGFQX~D+5H>dCHZd9qys5;i`xLe5$%Gq zQDOJ;jXI4x$^qB?v9)H2lzRBaql_OZdYyRboVFGPWBwVe5}(G&%8RMH0{-O&!wHXi zm#L1#{as=MGj|b>d8RL+J|_UM>o4j^-sAW_HQjoyJ?1~<=*xy&UO(hdAvJeS^?OXM z;jBS6_>x)XPeEJD!O3oP6t8Gq=2k&Xj1o5!?>j08Tg=@2#Ilz|5r%3fpjeYR(pebf(CTRMdlOVIl^8Kk2ww{COi;fr(Or zRro-gssIFL zhr)}ql*1n9rAW7Qo2&MRk#$3?PexMv;c#lkdHvc;dcP7RdJqyUa4;V99oSTpvgT~Y1n2QYg4ji}8a$-WQP_{Ph46BB;ADy2~M2TQ{Y1)U%+ z3Plw;3`a6lLv~M_k2@m6Os%S_oUpY{e>an6Tub@%BwqM4)>fgTCJ*XVp|R^J-d9bm z5VGG_+KuDB`A-#-G(`3XJP7 zuc)|EM47Q7l@Ypdw49|tM*nJ-!1<05@LS2ng}_P@Ye>?TB}{|~0*YCCSq&873x|0NGAoJlAUU~{>PwZKi1{)sBE-4|D-nSD_9Yp6%JvDg zXMopoPwX(pO+TyWwP67Y$E4ENwTu$g)5ySIhfZ4VH5j3I$uDZ%qY2|fF=nAZ1$8~A^#EBCN+z0vi0RXtbzB-J>}Jin@0!Tc>6pYv2_}| zy0#a_FLlArg)~E^9o@&`!>rqM0&%cFEYsHb`@yj6z(tQQR#CtPW~?zRK!HLLIfOWy z@q6+p7|%Z6okbl_sSFnnw~D!l($~iFU5kn`^`~drC^))v0cD9x?)17QXwi&VQSHKP zLga@AXHVAN+BRnY!t^|ngc)iyi!O6&U%y(3qd|Tj38KS?KaIwQ#XGDJxElS9hwcT`gCW*O; z&Rgfi?Dh)IKQC(ho`XeQOmi~1@@~jkXZ1#7mWUv)HK2#2rKHe|{YEKQniGd;D4!Uf zj?B^|DsFfuj)t8G3>LD+oIrz8hZs=sQoC5&{`X+FgcI$UukWoNG1OTYNkG z4BZJC38H-GL}7R7XQKXYW8%a-jxOI&Gs2!ZDwsZ?MhPJyimD>JW!>0x5SaoZKl3P_$$!=Z}E**ta)HhvvB_#TZ0xfo104_F^62PjxTV zE4{*Sc=q&w-~d3JNf{=`Nc|pj_}uW8fBEJoziH{2j5cqeH-8J9W(xIgTf0Z*#~GzS z5CS3X)Lfs7QT69>xo>W~Uv=GQe*XbW_o%t7D=-VX-J+Fm4IGOdv8yu?s!}N0CjbqY z`yB(CuLW~jidTXTC)O|LLXdWUQ;`KD4E16jxrj(Q+uAa-*-hiT#6vXJ=4+*B$xYYq znk)LGyWEq+>y^EU4A^!W{bK*yLm*Gd70%nFxM)r07ZbE?7oix9OQFtFx6I>6buE8- z{%^H9)!l0mYgtBaxWeYIJK>Ah`yn^v(pZg`C2JiZQgRc!XE`TS#D`YcN5}QM{Yk$E z&cekG+q(aW0)Nn;E5jUvA}D!z0k%5;6V(NQb_i{Y@1zu-4sW=yv_Bc2MZ$phan+)X zW|R1Ei4bsq^m7!d15t{7sGBpgLX@39&(?>eYlV(T{8(WrJJT8AQXZdN;7+R8zqlZ7 zG@NB7n0K5^#CP22Wy~f+p*jG@byZ_2GBi#@7I&(*D`4#vQOwi3l9%O!?jz@8e}4O6 z9hfKGSXfTx+exRYq+7*`ozKju58>dcp-6$D!g;Gho*X^=YLZlWz|sn-3?^CEU+BYaP+Fx!hUCK{T z1Xo|s5^2Duz5a^GrpPbTUsrQ10uApgI06S99*Ycwn{KLuLb6H6{90y}!lDz5;K=Pz zllUf^ClNOam?;$|_g5IDC|+SA4y~6`M6| zZ{UqgKI#9h4kOCrfG8;kW>u5k)$a&?w4CKL)5tG{!SMo$E3`x00zsR#mU9_+*%a1O zaSHe}ycA>P#QLVMXKbLaYD0APA-xU5~epDd*-T;{%tyG^k zOT9V6WQca@A4>fHJwdUFy6e%lrR$Ny@JV4u)m+9sLlIdnj;%>g<=JmbJ zC`c(bzox!ME3dWHS+PejV5=Q2rBz)xQGbIeB+v@3=bQjzXsPX9!1SO5&>L*~uOa{L zCFI(lTBBs@>VG=+%?{qPo=TteC_<&86rPjh_#F6vkdp)$o2N^k$J&A4`DrT&ZXF3(+6Q5wL!?7jjjksB^DKoi`f_&itACC}WMwOK~)4^&e_^jpU!T;g155;FtcG zk=uk;7L2Jdkq}?suQ_^AE{2{qI@|_-->7ueOWn3UNk!bf$BUzrz^e6=LXqvIpJ}@A z117jZj-Q*1eH{qPA5tIR7GDJR3H-`GnXjz_U-KPA{?=gX^n{b#`M1=A+>xv`jckHk z0hq(6w?ky2eo&UE$|!L964C*Hp`SVphb|JoPamr@JQI1d6<|b7P!(25fQC>>N%Qy< zm~JG+OkPl4iuYsGuGw^jd8Tm*DRs1uYOY&yqFAEB$OH69_8s)Z@Abp|Iq_h@cXc6q z;T+$`{r7Wb&c|DOTi92`zlhgXqv%F=c20GaXmu_G4|u=c=3_F*o0#-IL_SCCxdbvBF|oGV&;G_@oWt(nhi-dKW_0 zutMK?C5wEysBKsuvzI6EirBVdY*rL6*FE}_$!q$`1&1*XIH5L&lDS*uljL#dpfkmH zOhTC=;XIdTE#Ey}&RcxF5F6b(=OyTE&`jr3ukkU*8z z8ZXcF=eXtwO#TKLk|(#DG~*v;)NbXnrIU^g-`uwBeP~rxkM$2*JzuZRJ=Zr3L!<<3 z8DskJex&1ae)YwgScJay68p5o@{f$9QKlSzpUvC9_Pp3t*VMC{Hufw-J zr)Dv0T#vZCIy-IVG|wt0=a~(Q)rH6d^Vp1JJVDO8hcGLV5d(H?C~n z{rm%UtYGGa`+i3-s|pQ(QsR^=a|xxo5+}`i?3D7V5p3RKVK{y>LwQP%9a0VGmb6Ji zTa>>Mk6Ft^94{vBFk--AUaiW5s@3`p8GAS`Iw|*KWsdtNdGlQWK;zAeq{2#5&Q8Vx zukFgePe1PW1C7l+@H8N{jB7av4vCW>xNQG>bR(@`J> z*^3cwk3RCJscp2D_*h@&HFw5>J^Ct)^IHbB5&r2I;B;loD-R$Ob4~jYo0Cfv|Kx$e z`UUx<`Pcz;$*VMZj_Bbjj=hn{IuL5zw!l5CWJ8FtwQfF+qx0R?AZ{tO|JiG&Sh~x_ z*X=uZ*6w}8z%j;n|1L>*0%Et*EbN<=dG&gmJ$CJdIlNa$kn^cz9r+ zL-zRAHwM>QbzLfThUctM@w5M;kAu4ZUK&l5u%BgMrOP>_@#T+9P^t0t!(=Pz(iFef z4ZvbNAJ0>WnNV)$;KFZqi&u#**Tu*+avw*4B_PY?39AG$%)V9%<&|D>6olz)#$3sF zwy4VKkxm)zjK5#OuS7b=DyKE}HgV(H&rAASrR-5EF&K>OJrgon5Klqy zHUO`cda!+~+((6(Q&vAcR{L{VvnTG2%eY}X*3xzmkDmCV3VmfP$z3*(!`Q}DrzOI2 zQKEyIpMCy6-ef}MIULQ9zpl4$?Br3TaEenUcyf$CFVi6kGcL@N2tD9uw8PZy(n>_G z>V@^f4br!zaGf#^1=xxnTw6nv58sRE=(S7~#eT@gx^Dq))RS_r>BQgbuF{(6BX zWu*`7Apy8+>Sepo%{AF3NNXA~p-e)yf?$W6yhjg|sj%<1udbBwzi{VzJs?Lt(&#UF zQN&}Igbg$ddsjKnJfXKbn>4hEls(Q|s^$op{cIfHy+N~QS$L-!x=8*P3cONq6NJ3J z864i)Gn(8!4!LQwhVa!MGS$?u^7VL4>d1ktJh3N!{o+s;JmLyJG612NzH@nTBNyzscDOI^Dz3!Cbj`B|A}`0~wO9Wu*~5KbiJ_b%V4o~IAZI1`b3 zZIpZt*Lih)OxAQQ9gzJ-KVo~(UZfGI0>rTT{O$eUem1%Kwxl(;FFLM}Md)ovP$d0o z4-|(NslQlKcE>!-nlN`vT{kwmd4ADp8zQy;)oQXG-98o7?cy?}1Ls{(FxT2v!V~0V*$0HGN=Xxo!i@B{6w7>hB8Jr~h?<>G# zGHY&=DU2JM@Zf*Cu{T_Ec|H+b9U|Kl6nVMfj3xIE!nA< z2D#i)|87N^BP6aINCg2T0P*7QT@D}E&A!fH5;b?fPFvgDjU2=TyCbBfHOCCcuhYu< z8*kEnOyz&iqq&_JpM#;I5l{L-b-Wd~X_&G}6+q$s_y_JEoD4@k$5cKDS6xvCiuj9& z{3ldu*-jum(=B@EW(lOLWm?D~D1&xO_KjT5*)F2L#n>!~_5KrXpwMQ?6)r`)%t?RD z40MyDT#D+nK)L6-*%r`lSd){tZ6v9wf0a+UU|Qc(0HAd2L=-bsu`>5`PNT*+Fs@by zAg@7u;z*2c{lmP~Pg^>3#Ic{QbIEnt;=Fq6?pNGY7?UjC5_2y@4EETuh&saoIC_kH z+h5VmcXGVv9o4FHL>HwiqyA;zQ;c-n>XUS6bt#p+Yh&Rb9lVD8JNOFezr+`xY;6g6 zyFMn_ydQ2w_mAUxhQHJO%Se2QBCsW$%VC)E5Vdw)Vi#m>_qiq8dcQZhN)m0t6MRwn z_s_T5_47+I*w&S2x%meu_77(6|pG&&pKj<)%6tSDKjHSHdr!j&#;;;B2#V5dLUY1=~P6B3S1@@rfk}V7SrP(1z zFWiyvaA#1>0qz`84Kw5B!t=pg9*g>!r7MqBM9sX-dP;v=s?&%y%9CdW-s?k2#vs)FJ zVS2r~xTLqp0VyueCcAE>SdrxC$XBL9Hf(UTKhS3|WyT2LaU_y+fS%h~_#lv^KiOgq zV`KLhE4nFNX2SVf&h-s`o5_nET&p+}c44o<_iN6`0c$Sv87t|XHJ3Jx0W)uGRoojc z9>>X(=hT&Jju8`o>2CdLV-t-|{J30E$nhMcOVnRQgH6xa#O3*hciqsW&htN@Wcman zUU~*{t2M;X1Z39Ug+5_odU=gnsx`FY85jy>dWa?evJkQ|WAT7N-e^a>ULifNnv6@E zMAnq9PB^Bl;pXNFzCSkj#|xrau8rH;x(XH$>ceEjCqudiBnRR67GBcxF-el0pV4R# z=8Sv*SrPUmT?Tc&c!kuc>bonOqHNU5{Xd@%eOEi)^C%ib$(f@c;wZ%X6P9?u&zEaQ zprf{~>}$@wb=kGTfklbNnBxYf;+U0g+!VK%coj3$v5Mk9B!+Wge(2O*djt2d7S<+Z zzZDT#-~-w=d%FB(!(}H*IS(u0%OHdR4uHkzZQ8+Q1d`oRIKWcWTF06w0_dPQLJNxjnyC_FnJJc{gchLd6+S5X_+a3~T`(6pfr4(kEJ2Ry!Di zSR}aVVSXVS@XiP*B(F|8V9Fp{Y3>YQz1L^;)aBVQfLIv-ojtA%3mtO8e*&3s-kf1| zVuX2!->GE0xxJ*5GmuXgK%6Qc`>NxW3uHdWFPUaI`l@AwC&juz;#FlswC65z~JT|JO0l^X&Y=jn3Xf^E@gQ2) zWu&SET@e;3tzayjW4Ql0TA9|fbH3)O`-PO0TqA`BENHm4orz!==$+RL|CZ7RJNt$5 zIAftD@)}crcSBt|1lf`@HA%@Y`qE@b0kv-vwM0br*kscHi>%oH5v+@Kj3u6C}6L{&b5OoZ6KacRqA> z-Wnu{`c{8r!Chw#1oXm84o{8D_qlb;6Kp2TD~R%8Zs-M}DD{uIU~_8dnH)o@(h!)1{&sN()txT>4Y`+!-DU9>O;}( zM<3iJn_%O6xiA1d4Tze8Ok7>PhbI^CdmiuEysszY(rfh(b##=*($+V+C9}g|uuXm%*UvnCn)I|MgB>G zynN@KoK{0u_0Dc;MK=4|+RjyFEtY}$mNDX%j+!az=YQau*ScPp3RL1~H?OB4SmI8F zY1$yPkRC5N_Xw6q^-5Fk0!BU!(X=9_ospAK<5B&tKwL=fnPE4LrpS*IyknHKv6;A| zptj`k|G>(d^AFb_aa_KG%9x0aVC}ghA1AU);HA@FFV17NEKB=%A8GRK4vz($qbIJ( z$^A+PxzF6`NHFHlFXleO{exTP8SMxS@83mfZ6`#&S`KsNmhE#=yYnYZHvE)~%PHS2 zj0u)&L#k4Q5L1xOSDLDOfVf)L)}RG8lbV+;Pz#7p40%WAA2s3zpOTf5bzD05;aB|W1PhpFv zhw`3f`vu{SpX_qqpEFRCUn6Ktn%Z$p!YT$k>+tOXdn<&?w%&okBjEtj$^~vt;lsNV zAYoG8)k;*Ep;7nt?wkE#58r^GZVKYjSHmuAZqhd1X_?*JTU$Xpy z{=o$O;LT6fVRGGY=hQ5WYtWN)5ea}}EJ%UN%A9{r&Q|}T$Wh`&|V%aB(H={>e{W`Lw8ul)+V5twj*)M1p7<`2VJ04={^Dn>mGi|KJ6Ay-WZ=b-3O>KR^4bge)j6lqlQ8= z`;b$5?v2M|dITjdZWR8Jqv;|JMH}M(1pR5xtdvq@G}-R;5taqLl)RaKtYYXT_@TPk zWo;c87hEA!;Zh@k> z)?za^%Y(t)KTn`3`@-zR)(-Ls2NNn)$~UE>IqtP}w_63c;le4OV($eBJOd?n!3~+_ zs6)-@E$E;s0(gs}md)+2q>LU>@b@P=h9+G@U=MmhKusT!iezy0L!B=1QlU9E1emf% zdK;wydbtf8r+A$c-Q^um?RgXZz{KeB2djt%f{WNdJECtzAKBx)kcofd%EL`&lu1vq zNVlc7_X7omt6RV%xM+$Y7GxUWj!Zl;)*1DWa-@A=#^nWqjqF$apV9N)?mXK-UL#LX z(W^7-kBE&ui&&E`G5wvJ!{`=U@3(WP=1aIz90o&W<-?+g z{qP&a3CN$afvP-Usx-iNJ&75SbH#seVh(Ed!?~VRbkv>GB4?Lt+&lY znncPyt3aSBEn!R7#=mDA+#~tAzw&K#H23681{M$|itz`kTzn*Kfi@y5t5m_@ISx+< zAxxIOHVfJ)se5wiAJ1lpDcZWRZc(ez{rVv}$A!JB1g#tdx$n*L2gxPqSq7oE^OkcK zcAyN1&K%)wv8O+ImpR%~heGJ0T+TSZl{))+;{TQVo%y{CPkQDldiWF9Kh?rYyyO`% zpyF(UBc=%dlF8RlEL#ly%uI;xC(4ffCHX1=pAk zi!Z5_dUk$p;Sj3Ox3MC)Za4JrB)3goF+alCK#!54FLRJ#NwzFrzTs{~DbPsFX+Un=p3c_aAzI;H$cme4tv zyn_BP(hlMMp-o1VJrnU!;9i5jE=SjcQ=sThu9npCd|V*4wUoGKt@CYso98>A1SsHCWbHDrWZF6iV#v%8meT`cjVpERk8B+b_9JP177N_Q5~eod*6O@T1v}&v^c>kO%f{~8d6q+}%BIhVP453r)X+1Y)&un|M}j~uZ8vDb z<0y(+m)19pIoCFZzJ*$aRT|WQ2SS4?>I|!wZJn2e9}zg1s>IeCdl+KGBmG^xmn()NnMbOkeKB+(T7sZ`LBp11?l@YjyYNpE4W$|EFZK&6ALfR& zs!8Gf`jnZGYknaiOM#pQT~>ZkQCX$7NG}JX68e(w=)WD=e+IJlC}S+#z2DN<~nAaJdpe$q@ZGq z4(UVpk^wij_oQBwkEyY%4o95egvDlupejHIrm8u+YtLrQ35g3~M(@i@}UEN|nM;^mr#~CbgO`^mV z8G&sHPz?>{I#SIW2L9_9zuu!e%Mp@6iFzi0ko4Z4js!>iPzR@zle*rlq>%~*44?m$ z?yho;f*;m(Fk^@=$h@d)4U|*+UOu2hxL&iL4h+*$CIdV48&mH3ql+5cR~q5WU0ynRbn4tJagNB#DS zX~U@JJoR*EPm8VpD4BUwWJNjqu*<{Yy{H%$*{@GURu<|Cy3j8)WAL*);t%!7aMQtK z@qd^1^gf}pp_>a!FlN%U|N=_s#pOi=x- zm+`jA;kEJlmVcVjlCzXxP(y(taD1Y$*A^58%7!zrTl_mHQ0(kOEUVlDeUG`;Ck}TN z4G~~UBqxXKpzq~4*f?k7u&f3LjeZrW`WVG3+~^L zq#~Y(*1{@1|IzJ%akV}Kh5>w3WsUHbD0ad1A0OA&Ud)1sbbhyuQ;)|}fpPzU1nA|S zX|wBXS*8(C z^_Z!*%iFuV3#&;E$L$sR?>FAW!WwP0(dKgg`F7DQO{&U|IUoD~1CT&(zmK>*d&dud z_ty~$1m`ML6kAR?`22I`%WE#*eUI20T#Iu}SRmel`f%@$a~Q2@+$nBeU?;n{**>nA zV9P0mD|q+qulRER2}dt}!qxY$Se{+r?`q!t-7m1SJ!CTB;PG>wJ=tfua#VYVG-b(j zZx=f)nP|ho(Fs_X?UsD;^PeG7@$zr}9WVdtFMwbmQKEqxH5C zUQ3$2(rMMH%mH?2hVR^G5vBHh$d{3yGfK$hLxh4Y0;3qta}RfhcVobU25UZFSDOTA zqD@w?YVc`@NIYAU%1P#rbnu*N|F0jv(3a_R!em--dw0{lH}30w&|R)14W9`TxA&#> z<>g6Dw^_Cip(F(VU)tW}SC%9@^ZS{ZyNAbo$2Vl=%egWuvyxRLizPOPW~)f5MY7QV z!S00?0;IhJai_He=%3I=3qb%Eg4hrsH6TjeU8Gn=R(7$n#;lw(-~8U4Z%jVfpoN)x zc*Ko+-%YY*K<0}Z?%{6kZhnUEeCM1bi4j7gwe`7m>-SFh`z`PW(#hc?4jrwF`r>|;mhwR;Te3Uz`6>A^PW`(uw@(x$$WDTl z2~l^1jJlXIr^=?F6l&0CFdp&F*WTgR|LC6)kM}8O8Mat}sxaDOD=)ZfWu0z4&s*R6 z7BY#kBJuf6=f`xD9-U#IBu$Z>7%3E$Ggu+%47#4=u$W;gjkAt&krQ{iq{A(!a;oeM zr;Rrfg$c~Ky1T$~T{{;PiSxvf!C*vZFd|A~PLB`CX4C(FJR@r@QpnoBST682!SVOa z&$!NS*M55)lubJ80s7wXToE%bHRt3B3PkQZW6LSncY zMp{vHP_99BW9%RE3!6G@UR>8oL`^|9CIbEy}+ zaV>a*##$HPMAO>8?vZu%^=(qZo4u(Prt5jO%e&w7&$3uu@$}&X&W|3i{5tORdFd-( zMW$Vxa&!j+q9i6A^f-C&ghyX|#?Eth=8XZ-TFevQfbIUj%cF^@j~ zkbI$u;)w2GoBr-?qTztW^qhOY_>enqyv^6Y{Tux1Z~aHOw8L{>{TebIkk2M0O7rf& z`wO0Y_&)i;0f_@CEC-K1@%ORv|b zic)N~V3w7{-2vUv7EU;HdBVx#&nc>kBuYHl#Ff79QqrLmzCoWgK_0m!1J&V;ZL2kR zKmUlYjz%P%F{|*+)#J-~Mva5uHhKbZ(K}jVj-v6BF8l9Uis&i<&}_$re4gbC97Qq4 zT3;YggwivvR;NJ-3qh=6dc7W5mQj@+mZ-1HGmkb4@J;g&br4C2Mj45)ZD)I%P7*WE z3(n5HXCy<+XkDNqTEa-wwDfRKYh6}PL&^Y*tp>oa!@#S(iuyP8hyv5kv+33Zp%lyb z)mj%|rDU+q+tli1=h+oB@)8Jl)40sDw$?5^BWoKPdixn)Jk}Cgtw-ARFYa_Q4d1lN z6|KQxm(A_!`O7t>vNR6XS%90o*m@3ac(wgrc+aR4DlV9dY`WTG)Fnp`?{aqZbY=5+ zf0tkV?Qb)F?q%O;HBtsn{NPn6XLVXe&>w}E_zfT z#KkU{msLS;AG^Kna^pf$zp&1=l%De*xsia=96i3v$A&{tsok7>1=IdDuYmv_Qsfb&Tza*hUyDiP9mRZXX$?4ew*8G{Tlt9ea_B~IDhzv<0mH=V@L)m zMV4do1!tc<1B^4C=@tu5;ZA+!i}>kd=6OMq zbRf1=wxG(+h*TFDDQpF~491`FC^pezq&EtBW zQE&L)jkb4M@W(~=&pNZMc{QX8v7&$@aWUp_B?B#tO;+IgkRd2rvp-zeKZ+u(^@IU} zN8y8ROE*&rUsBzBMhhxkHIP^>>7)<{p)Odd?f=%V$GKI1LI7J^TXdp?MUiuQevWf4 z%+ZE($QFa|>ibd)-!?3{NhogmuI-7oYreJbXB?PWT5E3s)i_F5?9f?a(tt+k}xE}c%oWHJd?bTuhw-FvxM1!3); z%2lO$5lL_tj@v%YvtUxCe9P+kKGZD8I$^=-isJ`gaB{G!h`#d9FY(L&=r<^h#6$@~ zMZEFGo1h$@eEJbpRq)E!-r>2IU#CAFBe8t+!TUVEcb77sV#^$-eTf-sG>!`649*4R zBfME9t;1REl}juU#x^~T8l%DZeV}G)g?F?j6t#La2`PwFL=Ax=JPS-IMUq4ar6_el zo-aH#89|(MFi5)n5f+WJmeFtvjet&{@y(kgNe8WsCvOBJMyLpx_=a{Oj){~fSztY) zQE1N$jHDtGP~|fgXNR0Vz0cE!57Al0^faS0+U3TJFHjZ*GLgixpfsTAQ8@`_!S>EJ zTRZz?CZUumvuVX-HYcAhFu6tb#`LytQ|1dyK1Jx9yPti|D{p*_;r14T(KbmUDdrhZ z?>}NbE0CR-;dsbsG^E$>V6=x&_jboD7IVsCfr=C=0_zGoojw9zM#w49wgP8-J(UJ| z_te-LW$&0I;X$$3mS`~}^kAtkMjb^zjnl{B&t`vCQjPQk3!yJq; z&3#)D#Ot@?AK++Q)yL?{A)c|nz4%cyL<-mFiDk1l5n@FiO7`|{u(x-UCntyGlNs}~ zb54&BDCaXuqcQmcY=za~eULurA4P(smm=bney>lW6qBish@-!}J z9T$p|L_X_G2(0xnV4p0#Y}w+yCy#*C?~ub`oW|-If-X_o1spohP_be#-l5DgibYN_ znX$FMs6Lw#JgYDZdG9T_>idX2%2-V*s9c`1JpJ2NkVwIxe zKF|RXq0%m=`GV8)6JC1b9frF%sa(YACx1&>=FF#Oy!YkF0Rj%2$E7XwdQIM$Vf*Z&fu)Y1V)&sRgm=|SUol7}rV6Y+qAb*;;F_r4M})9H5rJx3*@CHD~3jv@GuzH4PYhl{%VvbD2P;XM3!2|=zGdh|)nZ3S{!d7=x)Uh{m`$GTVDUi;U9uRS}j zCjWXeh7%TpBSIjFm^^*T;gePR_Se7lE4=#Euk-lm3{*tFHy}wm5P6JEBsS}yRP32y#!v}|3bgSo z^BrVsOnhZ^IPdXFvHBdAFlTK5fDpc(qzJ6kN-uDgA?l@c2SWzqU5FB#6WFpsx^T`Y zA;Zu~V&cSNbxEXPw6)Db#zavLH5t9lbVsNEzf38as3$8RF+1pQ3 zD2SsDiRvM=VfOR^`TUH*_K5Dy7ZJNJAUX+g(npF8anwU4T`Hw;rKK!2MxWp!$zW?2 z_re_}PaYC?1|LHi9^2cw>v3w{J5$ zo8wf1&?TKXrW1ELIX)%YzQK)jfUZhTo<2gE5>sTjSdk1yREtvt#tS|Ln0jqmT>Tcx zCIhMNHHx%uBjIb)xOQ{BwsaJTWsS9Z&A4Sg#p=tm{C-{VwS%th@7nupQb?O#&; zEhn@xFW25CydZ3HiNZZtdMle>iIsaJVOcVDB^npzd2xMS)ggC%E!6GWH+fL&u-}*U z>il^eLM#iPI_EtKV+&@d$2@uTd9!~KNBrYI_(NWM>m7dn!RH_o`u!n^g0fst=>lD3 z6tg+=$tk5S$);!MD)W^M3Lo&6rSTOG!fjKLFJxjIph2T?0v2NK6-#&wi`krk69}VG z4qWTmtq&ymDvQQgQV zf8r}Jlx2xkifGUysSKqqF~%Y_IF~cmhR&eNV1G=vAG7F4viT``Izgcj9gQ>hc;q8~%d-GS2{V~I>+gL4`&L^JSAqu3 zE8_j^aV=%!0D{Z!>$=%Mp=O1-RljKM7j9iBv`5n)r}k<#Kogt(uE%A}s+H{?$HC_g z_?spPf^w-_{Qgq<24T+D$qSyhU^kz?9Ur(B8!!ki84kQoKfiKVV2#gqmB8AR>vYvv zQ7kNXO0>UUqYmb70iwgc=BMGN2I!f zKlm5_k{90mCGOolq_e%nP^L(2n4TXon`Jmtaenxe>Deg~FUYcNg0UsK(ttt=1H_Pn~zhA)EmLQQRTz56I@T<*IfU(dl&;SGK%X=jv4u`ejLp z)5fH1H4K?VMA3-uaKwBvBtAd&`A^!@)K!(CiyW5~pdHR>ifVzimMBS(y#Ym@VeWoP zuiNFh@hz&!DdQJjBN>l5IXs{$N)QewBcw4bo;+f4c%N8n%={F(b2^8+1zin;5@j6##8S|Qbo zWE~=EGs@Z);APbk*8jdPR(@Ttz!-xy24x(PTgwY|UXVKL1M|xH;F}8p(#Xjsi{Gt# z2UpDDvTKuoTK`SULtL?xSFg6&cf-aj$5jli<)PNR%)0&*0uw4%xb|-0aLsIMT*ZNN z5@QIszJidOA(JtZMVmg6!aW%E;At5CDouNZ-=IYG%hLD~c%X_V}lN z{Kvfb#ycEON|M148pCC%^<%blc-7Y)(w|HFK4{N~Hw$GBp7#>MY>cP3j9`GH3 zl{b)tBucu(ahGCthH#ZPmK6vUA>uA^(j`h1aiq|T1x`4UQA(7=$T&d@i_sM_mYzXo z4bBNvnzE&QRq=CqN-Psp9HVWCE_2^8HHuJ!nEu`#k(1;_L6$8@W)sT!0@s^i=X1)^ z;IyME3#=}YrbB1Ai;4#vADol@;ID|&ZRT0Q@VOV69Y3O@B9GFT3SmpK=_4ke{~WuR zp=?D~PU#HBbO$?FGoY9pF+Y63&wunT|HZfeTRypWpP&5YcOXi5^EZB-L6TynqjCx( zBcfQ4L={;vr^wE+reM(TQf39wU`Wy*!*q%g3Kd6~%3v`b5*3z6N`zZ|cj|D-mko3O zy<14E7ea-lr_Vpegn(B}OH00Pl;?$#H^mxwu{~w)8hBvN zT_h@Oy2kY(#A^BeB@W(FJeLTYRj;W9QC>L5vmbeTpOrZaeALPZ+Lm^|tRXZS;!+a} zYR{?_J6Yeh4DAG%)ERFn)%rmSus+k_s%5(Z#nqoh3-A*cA>(>(t7{|p@y+G7kLvSZ zd{VJ&?ccgi$4Z)6qZC(K&ObZ8Q|Ci%`u>8puaCK`AGGm0m!B=pDU1N+G_%tKo;>)t z*}lJboB!mG{{^ELU*`VAv%bzw54rcjk2raJpL{kYFE!F?RNX;K__pGe@$5EjAWmbH zO28RU3=#^Y0w*w~_KH>;-=&pM5Lj2BD_TqPDVY#cx3<8P;cj(4Fy} ze64L--AA#)=-_o4hm|E#dGp1uNsB2numgs>yF_V9m1V?0cQnAo3hkg1DbhH_8iTc( zD2gz~VJb}&#gxV(I*Q@`F2yXz8i&&cGtbDQh$!ulbo=xNyTozK$QX_vJtCjZNTP_v zR8v-!Z&;^dlGu?5h+IjPpJQBt>h7X#m*dAz$UDFA2u)cc2QfvF5t$4rAWk}z#SB?3 zh=wDg-T-4PD(>QhLaGj?$~pMrBYyC`@A5mp_fI)Hd_pA>rjv|#m@u1VWJSr=&X_?z zLff4A@e>|Dd_*ywbK~|c`n@jm#gy)F$VlJf^yn%5q=W5)E*;kR3h%D;t96-gB%9`; zt1J20<66pSsWiNBYS>_06v%C5vWd{J9yeNVov=;~Uq9|;(8iUXl#&=*QHCThDFe(C zBuXPc#IjsUeYD0t{!(yBI2hr0>-T5_joSJM>_)*_A8q3mUb>-m+$*QJftX-vlrUU` zO4ni6w#Tp;QVsCeY8b}5PqzK6FFxbeubU~`4N7@s`Yrf$d8}ouPlN=;HvB4TiYm)0 z<;}Gl%SNL?;!SjUkqFWr&t5yVe_Fr5tG-{oCd7vKLW*{Zg}~r2&QZ)xx&O)g&3;>> zEq?D${)DaDFY@$k!pY%No__uzPwsw5c6{Qqlbj&N_n|S)pj#DYon1nzLL^iglo24T zkAsFhIb)26#BJ^sxb=_~x)=A^63$v8EoxijAbz1;`Z||(;23G^1&x$#}hjJl&G74@PYRacS{UN{ihkwYo|I^>+hd+OW6_U(qPA4-y|L7M)z$2+~h zlg$=LsYnNXbT+56)u%8yYO1i#5cg7yi+w#oC9z5%ktm@sMtf8x1d#JfoZ>rr|lgphRthC!gPA`}@mjtB|P289;h7Ux;9QiXMCORD(D(fpOvukqaY$Zx>#NA5gSDZyqI6(DB?%Zyr8Nje5=9uPzo8$)rgwdF)q^vSjCV|1?J7k7@oE99{9+$#FYu{bP z^x8!IZVSG3R$cvhb-q9i)7StohS`S+7CL zSod~UX6{@=FsRu!?Q_?vuZc;)(hyj`=k34S-d8wEd#=kl*Eh;FJ1-T-^10S#K>hq} z!>III*Qaukkh2O|Z?b?!5_A9nAOJ~3K~xE@V$L=D)RZ)_Tn+1bY5hqEzy{aUIfrtV z`SBsghd!xw=f)nt`v-r*_~tD>`00=NT4gv$Z^j?PZ6;=cgMasW3DkkmkAmRj>bWur)OA>}#V{Cs&e{YBL zqsK%t!5K|L2VGUDPKtA&bw$$eBdlZc3=A`IFZva-bCn4O>C77KKy8SL*9#VJ!$ zVDbu#^>r(Sz&eQ(ia1J$(hij zg{~fr*uD@W+OTJR66}S0?XSJwGbpPsg?KN=W$e*5sb+n6rlDB>a`jJ^UQvC#+VHA} z&N3c<@d*HfVV7_I*6&bC&G*0i9lrSBeX7|x28|7HSj{*!*0NYEXu1QmhX^nxhB#6f zYY-yBN7y8FPYkO|q%M4g1t*ZA0;j|Kw@$ef6j_cfN-zd1TJI*H+8VH?bW4d+lBko? z>2J{)Y=h33A3vqi6~-E0VO%M1NIC~9CLZl066IS*P>`P(OTTe zDP^(1DT|XOMnYLiqTUT`b&un_AM)LQ{lD`E|M`E(%g?{g%vfY)8EkK%jp6oy>A-VQbw1wFWQ(tbd`cyCnsFRn%i84fAim0 zCC@snm#-Ft1rx0Brp}sk)B*L%dauZ_6mFM|6$@N=$kJXayn@wjEtOJeER`f++hGsu zHp4Cin95yD6TOaCv_iArFt2(Bc1=0f&+#e>@@3s=SDvfz*X^uCsHOEQqzfrst!oGt zxfQJScWYJDSbHX`aW@Ym`6}48Ma zENg?{UjcThO&UwvacVy^1!#_rpO6&=aUAjXH-3$ivl)-y{{<&U2fi?AoFXJdRq3n2 zJJ%e)DS%y%aBEcqdkTb#kw!H0Zel!GAKx(6$Cp&COneL~3WSxW4GET_oMZ7tM@4O) zgmYTsO9u%NpgSoM9Yt^Z2Hn99{qZh?-97TNW9FyF&037RT~rcN6$P%WFy(?OpU{zg zjMe12BuOeVBzJ%DKK;=aLc~ZcWj;s7{@KXIl&F*9j3J*E$VgDC6uGlU62)j!aQx_V zOqOAty;%IEBlciG>&!Hds7$HyPO&xb$#J01^4y#ChP>^}bzM-QH0 zvmD_p-E=`#mT2qf4sYQ~M=zEP#{2Y#dn9Q}lz=vx^ZA^!)5W#li+^whhRa~K3vrYU zp3$b!X5(#2lwB8&mnkAk5KIsjxTNW15OSpaCjYW1e4VNF#K!B;x4reh6uwPRzDc4C zb8^mShr2)t-Z1NnH)QECHTADA1m`cG=Q_coT@hl%^V{(A%W_}pdw$umH(o@uUkhSe zf!_Q-ror%9kgu~BezWPh*JX!oU~pTc1Fa~`fjTx!y4PffnezowZm6Zcw@jg zi-;2tans{V3V~Cx-`RK?H$r&Es`CoA_TG&(2ouy^aPK^9)w;r35!Lt8fie!9#zhJi zhJ`)GxpPu5vnH$o;ci}{R2wjjb{ z^9&g$h_s7xP|Y%gflhb8d|^mBDU9~%?e5Y|Vx}ht$kQXF=y+ybRnk#lv}Q4z`L)#G z)A;lf6?!8{PnMAav^H4fP_e{WP}U$+%y2m1?DP?8FeHl-;^Z|tTQ_)eI%9OJPd5>a zMq|`#uOrTHQJg)cI(~aVG6GGW&Dq`>BXorm zj&zjr{O}cSynKt}N00g8_kO_l{;z+-?OQhxF2hzi#X_U#u(LHrB`JwY*y+C+^35c( zvZ9EPGwV7VZ=Er>sRQWxG`%Qm z!$M2j(zSMU8!Y_x+@CeacD08U*hkt>o=t{K<<;N1V8PcA77+T($VPd!=Wtna@0Vxz zg*k*tUj{>6*YaP7l09& z5BfB7wbr3zh|`L|T?xu5mLQb$Z6feql{Oxe77ozhoWV(f$>!umMln6+{K-B4eN~|x zSZye0Gpeeh*XtpZF1_s@lyfi|)$REhv5kltY}g$Y|6eG$xz5X`Fbmt`Vr?3?_=i^#{17P9Q8Ole8M8rbdv%3?1bZk$IOpUnNOyiA0Kh{ z;m>*SlkfA$8PW(!6O;6Ba&!L_tUOS?jH&VwMU(Z<`2D8qO~p}p&HQ$vQdoDmg4Y4B#(q{jlf}0ZQ?c=U`NnifL>-FFaU%mgeViR?{`@l4tA0PN`p@0(!#Ue*U5i;$Q4)zdH z!s*Ff%wmSnzF=BS3^2yE;6WOUQ~**Y-rMYSu~Fjps~k>BoKh$pm=b3TjEO?XQ6Pnn zQA$K$)X@-4>YJ`wDP4675*zZ6R15T0%Kz3lN2Lu)7$Re^N>LV-S8mF8b@r_?H502=?mO)?A(>ZQ-Lf=`eQk+#@iHnMm{k^*8lu~G|R~W`k!ZskCrm8Zw_g*F! zG3nM#)aW*8++{L7CQ~uJH{L-G2K0qQ7)J~dBp7a3FZ70vnUV-q>AYcho~qbkzM-T9eSM(+jhpS zX-20rW7}rT2L<1Jt>X1JV|uqsUfI#S@L~k|6uzPOAO4$^AN-Hce06~9vgw?Uc?j^d zOfGhN-Siu{=q){K|MqB?+PP}K3rZ#Y&*B%hhpwH67o2yQ+oMiIY+EePhMq2gS_C-b zaUmDtPqlVxM6Gknj+^!MNZ*S3vINd&jZ0&1t!T7eW=(m|i~#vqLoM*_TH^9$3c5Bn zHr7*fb$*qvBJC%#d@f>L#5ekS8RrqgE|DsGQ6XHF*Hd4&ZM+VPtNDxdIyEq3G8qd5mpb~^oSnV6) zIU~^4)4in-_{X;_!z2i;vSrOat!qCLX!I6?04Xp!l#r=;4?>2wxV9}ESYL!$g#C;G zr!3Z$2y1YWL(k8c7c+{YK*vU7(w16pSv>aD#~Bcx7EQ za<0iqG`=l_w1}w7jhA0$A-gCOv32V?l8)f;;UQV|lzum2aPvi8{MK*s@>gHu@BZdJ zbT{G6U-}wn^PG>r`!kr@)pV6L@?Ew}+su*D8gD#M0fq9AR1? z*Yk{;mIvN_Zx^?`j#6sF6xU_owST+*-DRV(xg4$b;)+o%-1{Sk&gRD)MWoboIKq5Kp8Qugjvh^|1pYvZ4^3v($k_ z-*q>5D#8njrMq&uLfSN^_3fJ!d_6xGl0BugT;>?paTg~f*qpQD`&gjc8<7mhjCY?W zNfU~yVo_u)&W>Smjw-z(v7&w`-U?_F`TY6-p%lqri?}yJBdJV9{}I6|8WB_(C=0cE}mWJ>n$7YK;^MBL$>AA{*g!!PcO|d{MBlP~j^_)Ym8kR8>V3#f|YB zMRDLz2_H^!AZ^a{@C!P(-(WtSaOa(`;re4DVR`h!zvA@q0i;{l;RqK!X1jNjS6+IF zkKg?Pr=S0X&(0r!NN}eI==lVR#LT9A`tDz$q(a0UwjzO(2_!MjXcWFnu!_1w4$?@_ zzjYfqJ7+eVv0s+FRnFn<2+%+TA8Pm@hDQmE7vK!M+~LuC9qx}~zW1GS^CI3bzFciO zYgXRFnikp=(p=N@>oK48Y72E=muHP<6{Ga$1dtxLwia;MAULHr)p6F)CNH$-SkL>* zKx0jD(G5SjAg){xK4R7T@KM@}^Jy#M>kt*zbFwxKFM5KaX={SoTiD=YHjU33*H{Ft zbGt|0g8@7HH<8^gMP4DaBR@K!nokg>#5&&`ttRv|_oQ`iya6Fe24m8l9c*cQWdWUG z788_8h`Jr$Fi#t-4rl_#KczsZ@CWnvvvzV_>x6!Nx84E3;R1^;K!mjs5blJ-vj&qS zp)wU|r-QYYw5v$FU4#%6c}7-d=+fepKSrhf^AqJ9SC-ICiMu^S+M_$@GrqBljQW^L zqbDae`Djyv4 zELEr~jWL!u?ogHm!uMprg%nXGlt&llQ{-&Q?BIa?-CfR{=IGNeI6FL}JU^v8c#Lo* zC&f8WbjisRf@Hu9(zm~~R=g+$G@c*AOih-v9&N=J$K`Eu=Lv2$0o~po!HU-ZW9!`o&-vmM-x-4TPlc< zKYy8A4~nRT@;dU0oWc5oE3DZGvr`52CM3 zO)h1mSV^R*6@I%z>ryQSOkhcSc87sJ(9;}Evyg|;4CP#rbGSl>-&S22mE>n-?vz_rp@LV7-4-5J1Ikcpsjp-`t3 z=*rOTc1gP(k|ZJRMz~W$Zi~iPupV{A8dxkUTwWn2Q=*Q4#nsJgc>h*au>X7$Oc}p1Xq!s%&?()iS8SVi5;~_lCAs%x7$6bDU zx69exJN(7JPWj*<=l=Oqw&D?oMad%4l(|8M4!!;Dlq%O$*NnHqmy8)%;RBIPSH+g_ ztC=EjF_2rgpl%jf5RlKxPr8cL){ajsjk{LRoRG7Ehhv`c?ljJ*HR?+fImh$!T8^A@c^~-wNR}Jrs2GtmzXFi={78$+%kYqf@TE%2ukfuY5 z?3_h$hLhUIP(*0gA|0;PiEw4g0^&%agdm%q<8+BAOI%f=R6;V|L8%m7l{jY*&NSYB z?Y#;C(kYzK%{i7#Nt#@uWju`VxJ46JZLhO-Q7)wfaTKAoChc@6ijpXbh~t05T{2XE=DS{D}Bu%*)32yF70*v_{Esxsz*5v38S>D4!dY~} zarQHGMIs|PZpt$mGs}s07*EvS|w?dH*r;-$eNm5mbq^xx|*}&6_E?M7T%8b zeO(mB)-~Kjh&QQ5z|`e)zRbAbDY5Dm)$?~(9D9>`t%sCi6*OvlJ7IhKkqces8+8kG|vYF8Z z!)aL;arH#&M%TI$zjzHBphg6?Dwv)fVubHVtn-4>R;2wMP?E|RkO^rjs1^$daJ7}8 zR%7cb8ajysTb5XThOZ6l8rELYAEDyJH>ngFgkHu0gSrvUfiqZPydmM%=e@Mvm0KE% z;l~#ip0l2cZ-SW_DTOuK|Ev88k|d(r?VxpqwbnQNbG{^3+V3$Mj)-GLzuTuWnrt>_ zk!MWja~3)1aN0_P)etGTu^n?`dylRDfJA}7plWy;i3kf>y1E^@!$^rE@q{U1No7pF zm@|qZL@roZfpr37h0nRdVYQ_y3`#{9qrnItXOD%Bkeb1pDM#}&vUyIglTw^5=rYCF8IfAh??So1jb6;y+a57hn%pdi zjliNPi@7JzL@}nUxX$MZ(CaV$CMCLQzm0IBugfsCOG<1yYc0zpzH+l` zYrFM*FA?h3DG}A4-?N}J2ceZf$a!(KH?~fsxoEgN3reo{QA%Ba={6~-+DmL=hr)RQ zSe6_;xkr)B=#952OM}Fcc6$E4W58*Wq=SeAMK*8f;Pt#k>;Ef63I~{=tb%76MG0|| zf(?e13q7@K#Tf8URZlu>YI787&P2tsIeIXgu=rG*W<3ae>v!iG!=bL|V4YV$MP3rc zie9f9?yI4yO0q0NDPMqeI2=(qhsiUf6DTPej>nA0TinE=i;C%N%E@fPw6qLT#myVL z?2d*+ejy-4gcHg;D$bZ~-n~`!!AGj{wzfBG$U-g*Une4iwl za;w|n^%gu183GFui3(&V6LhAJH8^jn zxb>o)8{m_*IjvV2Xm4`>Cd^}l7gz6B!=;4mmoV4pK(GO}KSTCR3u&`eA2xmncpG{ab{J;hwFgfY>S0 zLCSD6;HJEd0n$hjIfJl)ofm4{DOKlW$)Jn^q%R?|j><@+h>%uLl$vQ)QE83V6|-5v zBDWMqvnUFr^TwwX0hW}Ku8oPMquYTrh8;O%Z`biV&pWoh;`rq)N9UD@*JDUuPvFo% zJmk3SW1ipR_^*5X`M-g8Pxr~5dz%-Ydz)ALFLM8tAs;_Hzbu=cfReY_lszHqclVuH@DGD&q_FgZEG0a;mcJUOSgb&H}bLHU~1&KQJK z=)A%f1;|#_#PFf#kUFqzmuqDGz%_(kcXJH|gmA5* z576x7jWp@KG!M@SRPCipK~Zb(Fedkry1DWjs8Zq8AlaczgUvkr7y# zl2S74IG$Gt`(4HD9m~tFc6eo5@X||`R|-ve(q;FXIomI57*vp3jvmCk_b}$YA4D9V z-Qq)P725y+AOJ~3K~#(Q8`!?9#FaekGD5#mgPw9{C*xwW>(c%?*d$0EDiL|rdnhVhueswkx5T7 z(|6Ek&_~jX%=9Fajm`Q%8;wlj45w$<&0ffE>_7v!+u5rsD>Gx!Lquj})v3DopxLH? zUDP>sa*2$L2zUSc-`$tg&)%mLg(@1FMWm@4P7aT`xT*2ZqX3LRbH7kbt0^INbgdv- zp$mg54>2gZ&aw zjv+T;_gMFne9%#|)iMm0^w8Aivu#**qki|bdp3HO{XiSa^az64Y@5urlzL00;K-bS zXS;32scqbu;jXd=-ix=(R*WsR{`XC*dUt}?+vA&Ked4I{D7RrW*|QF|Q%rrGe0BTU zaE%CU)6jOA0&En;bVdX`4y`S%b6APYug?j-A&T0_J~H@jM)29ITg0_1FrajqprlB) zw0kzh_}``y0ePK<5t%`as0r$}ecr>QK|r)7bPih1={lDNwzxS1gw`S{o$7 z$-xmul22z?_mb8cTF?SUbgFk0(;U>2m1jt$$_12)S%B(6kT%Y-Y8$TVC1)2)Zf0xkXMFd)Z*V_ap8WVfaQT(R)hB#- z{)|VD@16V|@5NR+m)%8Pm^y!s^9}vk(84>*t?xd|1*oE0%NNpgO=}Sv4yr z)}m(-+D?r<=$+@{LLkAzx_6i6vW_ZuCFP|8>-m^TmFuPQHmc3Ah~GO z9eh8-=DM{(+$E+*L!o$?N_Mn_OJOP*K)i zmfnfKZ+KtDoa+1O{klv=^dXgr4m&p3(a(c#C@6YBe?#8HbWjX2SK`eZ@~FYp;d)03y6VL=s>kReEgWRt1F&=`Hai2 zo^bTw9zh9Rbok|x?vDN+|chUifIO8R!5poAQAnQ$kO@9s@-~C0|IZG>&{g<45W( z!qJyu!(q*+M9x~s?l7W;BZALWH-Rhy(%)|Hl^LoFS-`AW8AAz(UP~UqYCUWkLfF-X zVWS@_0wJH(3dOUt=UAM0 zXCtdoBnk55fAIwGHvZNRa*XM?-p8r50!c;TVh#?5Fchtn{t6otD}B}9KM{`B({0#Q z@;wbelvLj-=6rMBqm8EX9&Ic|VKCWxxmjEfjJC=e4yRMJN$05yLyJm`Pop);Xi6ki zoQ=Y~^Z3<@vt~(Mchq&@vRTp9j`5<fvD<1um0}h_F z)IVwYpcT%n;WM$Ee{T8eXOXM+l#hO0^XzQJFP}TUx(KOqw((4jPHA-TNH{}VFm0gq zptR&dphA0nPV54cQnR{vpYu=dVGn=AO}D_U0?HIzfATZJ>Wur}_yMN}-=&(}r@a3V zzo>E38?Hb53I6<=*WdjEn)-~(Pe14V|NQT{|Mp}4;Lrb*7uQ#uU!7r!l7s01i^Vmj zsL~uzlBx$gSS@Sj^$mwV`~mmwozk5iaC-JSMjN_zi82MM(8xHV{}t_S^^E!-gthZ- z$L6sMBi|-6Z2OY7+a^u9-)tbp49mr2tqeKO`px1cZ4A5Za<<2qm_U-BRgD9a)Edr` z?G^ns+NJ>Rwf3Chc(~*U#|T@(bL)P$$>uL_Fa3Km3D&>n9bybk_CE}+hFcfhdb**&+$_Tf+#eM_0? zpK07;jwd63ZiL^CVA|X3BQZw1u0iKjTND)mjj{!%C{Z!c)^i%)FgZK{TM@iV!a_8I z_g5=yS)#R}TP`-Npw!9qg(yL(9F(OJ2}euvmq4a9XCWdn4nlHJI>uuVcR+$$uSNlV z9>U}+Qb>$BT~W%XSXe_@me`_TKA+Py9ZG9djNHF>4{cLSpHY(Y6M|6&rSr2yxa=Zl zH*=nyUvquEq|X4+_aTr3&-VpR?!!O*A^gcVg?Ii~aq_z2!6S=r1zB}`@RNd{d=CHb zzpSXvEFXV(#IO7jEdiwhrFd2`;*^EfFmDaQil91Nh?Ju7qznj<5~zyUB!tFuS9zju zSzWEL(?b-Vi?99*)oZ78IuffHb?X7o)h9p4`zFnoHZr+?f~hRUq0I3rkC&u4^7Xd7mqK3{$C z5p`43EoxeU;2gHFY0cgZ2L|q(fgx`mVbhN>hC*(~NUXKfmz90kZW|VjjOMGXH=PZt z^DFk6u^@ce#&pYbkayFKTlGGcfem*X4jQ*@ICK4C`m`^DopIaEKZ?8P#n<*7#=NFG zw_S5%E%Arn11YjT^Hl<3XBWdd%Dg{jTX6NeUE0p>z6f^p zRYdI-MElR#KQ0VCOTudqVEvm{sn;rGPgO{e*Eqx}gh23t5W(0Y`}G3FAi|hK5=ItVNxp2pFHF8*$YZrpsSLg71{^d#obDd!(9msy_TM1 zdA4)W!FsdV)_QkErSCgu`nCQ zGD1_dQd#hOLO*~(r)=CL&_GGnOmpr*6-HydH3a>9iX@2cHf3aOjSqdu;}lfHC=CJ1 za>AsV;JxGG>JslA%4%k_lIm!J=u~Q4$7Fe`Mc`_A#e1Pa$%5kpcg9wdpD8~0vf`(|HhfvXhy0s>3YJx+sj3OybjTx(_AMor4uw}M ztkd}5@CH=W1eeGXUKAoBm0~Xx_p1Y(5=1%{u1o&!eyu1?pC3^vn^?CYC8tJG0Z`qx zbgP=eST3J@!2R+eH!sea9iMXlt@ntl8@h`pH1iu4S1)jWMQ{sVd+YaE-OOpPF43{Y z>B!{Zi23}Q)#`@x^E2kFj%cAYE9Q$E%Bte|g(HgN_}(E}SDc)l@a)M~NQnIEgAaNA z?RQwl$i>Z)X1S!amT5V`Etfmq_Wt%;#TjkQ8(^&&?hEwW_4D}LUB65I-(Z;yI@;IM zTH&^k+|}nE1s^Y-;TKt3Mql^7`-vL2c-kZQE$-h1M2 zjn9oc`ZXwN!}DeG!#=1YMxZB#^blWIzgNibG(owm#SOuCpfsXOoDWz#!6+d#OI+9B zI)}u7Zx#gK4#t;Og0TkQb#!gFUOxHnJ(CO|4kg0%$oX%ET35t4l&}bqkt0$V&ym3i zH)_2eDLY<79Q|KwHTbq7P#VL*bc#}%>+5TlizQ0IbXswAct~kAIwtM)_026~4OWE8 zY8*MsOB9q%`%p6tT8DrN^Ol< zjOc6~S~Eq|ikpkCutz6pJeTLF@Ey$21JtC%oV-r4xTd)|Lzh#!<${azj}hmvx=68@ zxO%rCB4U0?I< zfBa|2#gbxn3X;mH`+7xm?spHOL}5aUq9E_w(v_qc|GhE67)HK3)?&1=GEwT zkG>dMTK=(D>AzOrAP#K7y(KKje!89rA^o$gpJ|shJhqIs-|_Zbc&VV-)$47mcFXs) z;W-Z*CvN<8&&B&QUjjz%=}WH+)Wv1S~D7TfmG#AHquAmio@p$KGx+Re6;TWxu zAWTe&4uQq>Iot(Eh8Ed%oiD%!~sAu`;Mq6SPLh35BcCqETX? z^b{gU3`__FYY=5p%vWC(SCU^bl9eurL@NZXKomYC0z`-@rIFSO2_ajO5v>*XPNpon zDfROUL=_lo(at3oh0fNUQiLv9|DqLkc8s=f(0%c1CQ4xrAMxcEf6v2{cQ}0SdraOu zK|lMF>Gd_MFMh@R^Iu@J#XtL)v+D~EA3Wmt@F5p38dST)Hyu`lu8S<5KjG{*A9H$g z#PjD@Os7*`fBXjTee+#@`ZxcX#pMzg8$#o$s)7fn_xRNpUobm8;^8~*aD8^p^>ZMs z=sHI$O-|c%xAyfaz2=#uj53|` z@^_a{OK&S*D|k;~Es!#6lvRcEft#Bfy!Xr|6Yf8F0Dx5nt0cYq7&!|k{4f8!;HkH? zs$epip|s&b98(2eA|YxNf)$O`9-|DR0!lh`0F?`TX;Eksi8z8pjLwQ+GLG;e=Ca~B zdwF(cDA5#FXq`vLE+>oDskoy=eCH{x;@yyvVVR(alH2!EUUWZ z+yC{S^FcdjdH$R?zVUn1D3)LRn)8GEoId^wPG5V>#TTDo4K(u`I;EK$JtVdbi?h#A zbz1xDOkN+6wfE(!HTmQ!T zttaBu+W3!ggbIvWzuE4~;;^w9=DV)NPyRM1SB-g{C9`|;S-;M|yZTDj53%+E^>D~7 zpUL)MjlSM)+bqIYCY{}J-mdGtY^;Yz*#Xn-gYEY9qYqX@HpR;J{RLobxy7_0_hUI8 zQz1FV`+tJ~Vy!^kRS<2D!FKwn;kbS0Z~Ys8mmKi9Kd6)^Fm(7BlCzr#3hMfrtLI-5 zn+D}T0;4h|GAt;qQ)U8Xb*8_k8zot#K^t^YCSg|;h%FIoL8}DYMF_zSW{&FdzYL9y zEvCQ*G79iYf^V;04SPUHdnI;iVrM*m@s#iV=#LP$iq#j~INE#=8W+KI*o&uV$aYI%W~9#b5> zMjIpb^)rYqXhYN`-b@G-;5@6R&-wgUKjZPE2lyCy^7IM8xBTG`zfG(!Xs<4~e)fd+ z`jU@+{SiO-(I4^YljlrkGhTc1P3}Ej{!;ugI;< z_bxEqJ|D-xFeE`Zi8`Hd=DT34JI89krL%|)yNmMew|cns{aAQxX!yB(U8r(=k5`H2 zO&`oFP|K~B9O>&=sAR=w%R~ANbmL~Z{B_<$f6M2BwXh$DEr?_`+D4u}8Q65gcY{z% z<<`eJEBa^l1bhhi5V2O_qsJBzzgQ8w226r^eCUW>Uj$RoN(ed8XXs;%`x}RBTWf=e zMZ|zaG?ElPlM?l66w1dzF#y4bE+xY>^|s{Slg8jOWXQsQDQ0nvu2 z5)^Nho4%NL#)MCClu8QZM~p<@iEL-)K5R-U}kvjjr)M6 zUak1<55B=SzVR9#{oSVsEz`2%m;dRnc<}I)Pgf0<`mcES;34&Di8-85UoZIZZ+}W# zFJ7^7Mswg!M@4c}|Jagv$wluFN3_mcmj1=je||WaLbbL&~wK5XKDKqjOOKj_%Zuk+u#yE}V###x;K1~r~9HpI# zpklVh`neo3#1(eD=a^SqjEKwWaiSyTyHbRh>J$O!$%N^{2S`y7qfV=6BZiIjAew?` zN@7u=$|<^AmEaf88RT4STyP9Z8;P`XP8?uMwx+! z&DcKDIAnATZBmAXquC)6VSaN%K&U2Djt&n|5-4mzL?K!yi$#;_43U^?gydDVQ78x) z2^1O%ZK+i9yBWzAh{VClK_?4KXDCm5uqdp`mQi1yEoNq;NwBW98lw%SsIY}amnEhw zDXJ=2Zd%aFV2wo=1=<+2(pXz^dU8ymbSnEELf(%8CXWN8oO(V&Xs&tk{(oYzI76C_ zFMj!Vl(Px3FmyLhIe-5bEWY@N?)n16BE;XrQe~+U#zl%LM z1)w=Q=db_8zheIEjHX`j?8O1AMxWS7jVp}2oY8`(WWivVgoH#VVTNYAG>#vrxr zVC*rh{B`_BYs+R03lDg5>^~w%Kwr!F$zl}ZfKjVzJ6oVF{MZql@vQgz@YQI zPW6aHQnFxW3_b^~>z>yh)B885l%7a~mz*3rY8)oTiG`4aUTFu5b!H0=W-D&yOSDe) z&Aj(H2sULKCnmCzmI$kJbnKw*s6T$6*~ux>M{ltB{8PgG47a>M)Rf}>eSEhdI`CmZ z42sF=yG%|V(Y6bWoics=T}oOGA3o&6fA_x;RyCjh;wR{XQzrHe&cA%Y$G`fFKl%M1 z@t6PnU-Rtgm&`cj!Gni%bwjwRdHT^O%&)GnlZv_7S__8Fjj_*B*3Ug3##!g&*6~9Lgejf+2omdI+W)^=(#TU5jco?shCsQah5IUh*q*c27Ev}qdId;EK{O$ZCl$sXp^YVE--V75X&XYjpsSaua(y=E)Ob;og;127{h?ob`B_vN zFM(T%UnKeTA~2m!S+y;z)rzvToF1J}DTDFJN26R;7&6OMj9Qm2R|)KllAt$b3`Q%o z7L-mQT3TmIHOKEri0A;K1!dARnJDNWbUt0n7$IssEVrN~6K(~i40w-oF{k&5NX}ZV zw8Dx_M3B&zp%AcZp1QqZ;yMNv@{DM@Tv*8zoNVpGYA&Ry~3 zr~iRBfAr_fyCw6pkI>Ax_uh}t$FH;e?C-ez@@FXqN?FXo5kV=;#Fdjvm~@ zmWGSp{FI9ie}?LASY4mmr6FMiG2j~?=m{^FnVfB&EV7Iej1-~UIPE$3l>Z11_t)Zwr{ksFbeA^ea{rmXw zc3&XRuRazirgs^35k7`f?kHTc^>LS@H?7G&t418UAeka2s;~FEW|$@K!aA$;_}#Bp z)%r8UZa@sQ5(+W6)e7Hq7;Ct`oTIHlTZ`y|s1>R#h_S==!VHMf;hW1;Z>Q_%T#I<0 zYACQS^`eUceQ=*@GQo$4cYzpuO2g#>5)x#kv;j$pM`O0Gvc8!zvX6Z%fQd0}$sGUy z03ZNKL_t&wjLr8xRDe!{Nm-;o-c?$M3xqo!PGw<=y5m6Kcc<&G~BmW^pG(}m^ zbRDg4G2NWA4}VEf8WxL7wDCj~<-rMVGE3G`b4Ab-;_8Ub&In?$$B*$|Q(twsS;z6a zKj89%pAmfrI41WWQ2Xaxytv?RfA({}`OahB`olkBGAViEoj3TKpZ%2f?27j0il%Eh zJUrs?-Z7tj@-g$P#gIMYF71w%QMS7!;*msq>^0CHI2ma;yBz0`Cg(8WHm;s(;q*pO zT>oLMwf75rhogO83o+(|l$lu-A%yXPH*_2^7yaWiE#*c?fbmRXycY&3vM&c)^J$v;Es07 zC$jao+g~QX#dy2|YYI28kzjP(mt7FsHVnEEme9Yen38TPQt<3}vs_y}G9126g_V0J z3^eDV2U%0!5Y)RQ@QyKw2%-W$`o!=Sh>~gG%NxqcA;rM~&3u8)7fNfC#AHzf zhZxE4X?-l&H)f*37A9pOuqh#HjFI3vy4DeM;#ltjeUycYf)_>9DG1mN6~I#VcbBb0 z=R9RmCJ0lhl5!$*X&qC9?s=E)M>c7(+oTdhC^s4uCXf1c_!nTBYNC}t(~Rm07b zC%pLVV~m~9)-}KS*)MTj&4X{g!*qH?b#TPN@l#d~nyX8?dQRw8{Q4I^=i~Q3WqEy* zl$ATSJ0B@IrX{G5N;nJ?I6F}D%o>O6ZOkr63u@!*G)r9;2;(G+GTLm$tzXc$H_i3N zGNy3%Yd*$xg4e)k!w(r-T|ODUbSRx^>O*d%M+}&HjfN$1(luW8j($2iz|yC3_kkq~pxb4p=3R9jtJU2*VLrfcNXL6P-~ig9xt^!Fzcf(-Mq7iQZf zF4p}FgeXjkW2*9qRkOq%970rdR~@GhU!w!MdX=spBUTxVwM0B_StBkYFtd>jKw&nWyB|1ht9%C#bl0P-Z_6S1CfNgSO(y@0jZjE{W ze8aok@~djC2d8~q*C-K=Pft@nL$ctMlEDu)d}b-CAVF+Gk8Y-HtxLb(Wf9R#6y>wFQA>5jLxq7$Pl!HUv5%oun~$zDt5b0&R$d;BW+73^?Zr zT_Ac-+a$JJP$ald45cwhNItdur$;QBmerzWzVbtCWY-0%sz_E_%;Vd39GHrlI>jdu zXzK-&vZ9_}&|W=Z{`?8$!?$>CdcaxKG|xW)@x*3{NQ1xlg1WhZVnR7NLQjt{C*MI| z{hXUm-{+%$_b>SNpZ<3gR#-0PeD%c{-}=GpJbv>LPoA97TwihV(feF{@j2#jf(@FV z{XakE=EWI0r1VU8ZFj6^wAmv4<~QE#N0Tn5Se=k(i`uh2_F#zYplaVPV7xnir~m91 z_Bi7Lq{$sfrmcsyb+PX`M+Q=e0eo_hrg}EF&wLsDGv0`I37T6mHCt_6izsPXNTT=> zc*!&Dy3VdXN`|*yJz3U$-z99)s$W|~@z!}`AIvQ>$FBSJJ?zhiB=vf-!Ja-2Pxgw< zZ~XK2TpCK#kNUAIEByL8IitspQYPC9Nn&8hXwAI5&yvk71)wdb4<2!T_7trQ%hd`m z$)WALkR0*i=%OQZHJx}0tCMrTEPxafAfw zyrdLFF|bJyG7maa(=!uq^gLr>yREqNl5Rt3uRA<&wb1A3j5A<$+2tcrs34k?Z>b_(^J zZZ&6Go)Ya52k*@Z8rszy=Mq7sP$|QQYi}R~riZUFee(w_fAe#E1Ks&^+QkJvM7qTS zSD$kB?2HhE`MhTS>(=6*-YiD2k8UzN#I`l9v zr!6=_MxQ=1V5mK#Mup8|pudFN`es1PavMV&yR44wSdoEE71u&+>^R=2B)i8_0U^lk zZ?{`71Yczxz)J2v;kMOshk)H(^I}`z?2G@}RBpD!(MZY4Ukr05_U8PaA>ZheB+FJZ{5bB< zE=48w*G&U}ElZ9bJRo?7TP=_f>AIHS6Z(4=Iwnux+< zv{0FXSy^&0ols6Iiqc?=Mp=s%jVD#jjdVn3@xH?oS#^=7X=y@-3xUoh^rdTS+SU^S zI3I{UqKr?8csrloZwM@wE4tP*olPi|qA-TTgBh3CH*|ij(1nz}HuFzN5Z)n&{s5J^tQ1 zl&A0DtRb`xr2-OKv??i!g5Vv#3(V&$E}lQ-`s_=bYw;q?PEUCH>ilozoA>z zG>hw3&V|0+9i~&H$B#Lgr>LO>c`9zzqr}-#k+okUmG;foiECoO=Dsk(=yq(*yC9hH z_q!lF^8I&GbjLT3eLlMJ2Apx_ejnQ7nC}@=+x^(3^$r%>c=wO_*o-5)oJm<^EeK`D zUbnHi#uU2^No9zV+~d2qg!Q-#+iiv;`{26G>=`K+mr}BqoDjmG>u=s^1e5Kv3itT{ z@5)+y*>U6N*oJk-f8Xr%=-R#C@YX%z`f=6zt6P`ahLT4bRv$~ZEkJjT!SJax)%2Lv z;taZ)(0STU@|P-6XgoRuL>vTzHYV9o-lKfLnuu}{Ekb1r4yKmr zq$Dbj&Vf&D+t9TwD<4@kj=E`RW27Z=cC%!$s9CK#mWvfWMuLQO=9ZwTn~u(Tyz^*n zp-cOvmSm*{BC+w*?KP8C$HXSudS&2XQgXFSezO=;^4Rpa$pTILoT4ZSh$Omy2>8`C z`rv>lo_PKlHy{2NX5X0-ePHt7Ehgt*5zanA`G)#(LEA2ovS8jVpt{fDgU3j5OkAFE zb#uk}XP@$|KlyK&JE1r_!5rNqXv^h`r`$aIg4lH^ZFu9Y$6R0Bu)4WIx)%R60$$;+ z!YKA-zmxO34_4bK6EGZ`eo~Q~W)Z|E)2QDb6^Spfo~~n)T{eCPc5Y^4Ys7oMG1>Q( zMen!Feeok>C~aLKwcob;K8>T}$H#15XIC5hwS4f|&Cr*qPVo!F<~_dCCi=B$Y4ya0 zEI&ifoQ>m@o12#3u=mBZh@%PwxecL>&$-o!jpm2r`cub3t!HSxEGxzB`~G%qTgdJ6 zC+)w$NUH`mYAe9j5X6Bhzk6&_>43h4%>E;v5<}dW6a6v!=BMPCn4*|rY(cx2)7CfG zN`o~B2GIsx6rc@_YdJWW(g}1;o2(nHi5@x+MRmyOqk<6HWTgYj7F4B9xzO~4wuyL2 zIq}M}pqL)g*b5fdm-ud#*L5P5WG`B>Y?R7=sWmjdZ58jT_m#*3k)xw2nvfvE5Q!pm zF=D&|(F6e(CB;W6@XDj2MM7ey8J)^E#O%M(I%VxsJrz54Xf%aYC~GJSL(vERx|XZu z4SpeXtD4X@EIQBAi%Z%lX>7a5)AMV(&fz-8a@pW~&ai+d3TS0n)+@YEt67NXoNrI5 zaG3RF~h<#UQW1n*_ z#iwxgHaAZ{Lro5Ft4myWjrATCT{0GwrYtL1Ub4EfSX&VR@8IhE8Bf1_#^k{xOgSMc zA*jG&zCbw$K2jbZ@y5H~qFsHMNF1vcZ!EOyG9|BSccyj+7y{ff`afDEGI+An+)|9U z=$QWyWlPL#t+_sudlxV^HtV;Yp1axxG(++~Fk0|0YdzzypF-Q6ja#1~WEK^>bJ30a zqDE(qOGs?6?Lt6loq~c#$HWkaH2xtbT6Q17A4kUo*2zGHraE9M{C#$<)xs%=yE^cGH=rGC~?*I#e27y2e_Q+m8lbmV@J zduzE5bnNHK#+>P)U6Qh2ON_iir$AVf%9uAzjSqqIvuCtkC`992$MtH(lbah{NPd|`8}PnBfMw@dMMsQ* z)pEhISs^;H_)`~VX5F9~3Yl~JT+PAR0 z#9-<2GO8~ZtmZf9(+4b8OX@CQwa{L@z|H4)Exhyn-=jg(2BDfBpl8QCI6Y!@dBx4M zFZV9Dal2y)2^ny;*uzXh3g{cLe)=uYkK+vUgbZ*?_^1(0s#h>$gy7fHS?k^Ylramb z@545Ep>Hw9ArD@Xcl+U*xFhhix02Klq?7xPB82R~mNi7Vs|}hjYpUx`pGp>kDf&MB z92mhme&k1qYwK+DUV)7(4-BtOf#3)1be&2l9rki*bQ^M8pSkAB?`BPHx8Icz+I8Js z7REjwP2YOxEQClzrMzah4voV*OhdTNo3OLVCd`|l?)06~qjW*+9*>Zz;X-DHxdh1t zt{^3mw5n>g5vGwpeXZWx(Wlp(E%R zQ92O3M~4C>HqQk`lq`(9K#)iX9xVo2TFOweShaah3kL@W)ODQ|Pr+s36e75;ODK!$ zSS)I0rw?hCXSC-Zr8&~pnAszAd7ox}ma<_eP#T(cMU+dd2~6)lX8Gh3EMUYlu?A^t zu0Q<*j3u-ymcRL&*wnbgBVPaJx4CINXBSsYA3f%K-~Jx)=!j=O{p;VcFk17uP+733 z2r{*~*ICQ5p{Xq&%=V_T!G0RSb+EbF?4(L(!7*+d*nYn- zw&1#6pyh+s=l1S{9X_JI4I4}jsO+8bamydE_CGP0qfw3GvPO@xi#4~`vf0q=8LX-y zx+v_9`4~f9Vb@sh>_F1`zpjvZ6|->X-Fm;^9xM4(mh-M-QVPW6cT4XpgVIA~)9ov* z=ca6U>P8UMun0!aNYXXZ{J!mT?E5&pgE5&ygrcf2N+FVS#Ce^S>;~^vX~XMkx}dXG zt(i;;8WBuU5`BSJ4j(kiIVJ}NZA+rHsP2fit%-D$s=`O1ja`bra&=bh3=}0X28;^H zSK%T;BIJzotdA9uadwU|#NNL{tcl%RSZa{(50oQCKT0#${4iOD6KJCSlrwYwIZk-lum*3fl?P>Jc}0U zt7}3`W7|4M&B_q4DSsREA-@$s?e}JBQDPH z8k}pG6&3d22&XiqvPfAG{R$r(U%dZwij(_@(TJ*;&JIu_6c68Ia&*AAzWY6{7LlX- zkLXrc*rNlan$fL(*DzfWe2fE$a)5y1n!ed`-ZqaXdwO-)wqBrkv$KKbQ#uyLK!MuP?QCBQlVoQ;3{QJ%BWpyykAl% zg~xDkFk^abSzcXn)^_;AV;Y~xAS+i8#1KUjX9lG$#smthD2zghL7OrOS`Chr!9oXx z3oT7!=(-NyLE9zl&V`Q7Cx)CAQuWuE)>K_DxPN@a{Axwi{T7px1jkf9NQox870vY- zv(rZ`u4~X0<-<3b+O4XG5u*3ZpM6ERc+SE7 z2efUZt|qwphS&b^pYZ70@A2k)?{fLePcV}isxW!X1y;=+Wcej}{u!h;j-*5X(cKy8F_R*>P)(fj`|JBQ&y79R?ueooD^>Sy|CZ84S zTcyT#)cX+F2(sK3R0EBDn?l=LRQo#C%Yc+SdHf{~I#LM;Mp<4#PQ{mi~rd zRf@t`in3(UblKR~NuWhTC@isU@#X-1^Z*?rZnb2&s-cL8?h!-5<_PFl)XXzD{Uhyo75^F8ddxG~^YqCDp zXTQjmk+n{HQ0z0AN1S&_anOQN9lDKJ5mZR*UrkEYR1}uUv|>6fnI0aX4-Lw9`1zdJ zf)9p?g02vhiF8YcRt{5;u3c&L$sxx_huo|h>QzncJg9=83t~|r)=+py6+NX9Okoiz z5YgDGAXr7`BRUG5?^x9(b=^`gI*fHRO-s;8Kq3N4VU(tIo+4-Ra9u}H6x3Py3c({i zBi1KousETN0adU>LCKSd%*W#Mrb(~R1lP#m@gI2F| ziuwfN4O1;|y6LyuC|QEtj4`)-3U}3L@7h9KC(rD>-`IoqZDubkfAP}xlD#oz@`lQv zy_Jz}6Oa*OE5(<5joXeaGuc&j@RfbsgeQSD%PTv4iE)5u@6w;KA94G}oActf!+#&^ zZl3_!C&2E~cAb}eb%8!hX-ssm!5g;G<6g3?gB3{dT!0)A-wPZWosyFcrPZV$_OReE zCTh2jO%nJeF=gML%uZM}&ymnUgeaC^BD(Z=(b)1BTONYW~ z1=XZNYlCY$j99D@f_R9LPOrn@6Ne;`CxY{-a;r}Mqlia&kLiR~J5a)efG!keRZ&d~ z%4tD$FlBZ$!5$lYC%8t_)Gh9&BN~m&8{*0lf)IQpHeGT@VWi20m@CldC&+*F@KD69>^Gz1Z z1ASa|1u1fuyKJ_7u|wOi-sXK|=eg<2B#e4W^4>vRGql$OL>&1T!?1wI@3^;l)*~as z_w>&n*M7oYc}uZ;`5L)js+ghV1-@B8F++?+L=nWI3WX}lv|hDARTE?dv8(A8&v8bf zwV~7%kw{n1Y3mCLbpp0XV7!XxXb6&nG(>?IloZJ)6f=WObp+oeDIqcCTg%U>Fg_WfNde7!QQciq9kn)2rn+CBFmrH>tB0lE8+K_~XmjEH+>nr>ul@+0F5D)G33$C9`sisq^gL||} z5j#g*EhucHk%*q&r)aNf7cc0^WlifixHrWf9`NAXKVWur!fOxi@#TlVW_f*?;NF#| zZfk5=pzYnW_kRsxB$-&b-oVzpDb}kjq+f2QL+vNwW4l@-)qZ`^uk>9*f#UjXEo zN_&@b4li#>Aa7WIKIgmZg;P$0v@aHB*QU8E!@#be2PGhG7V8`PZ#H1QEn}vyn(DnD zVq>-wl8&3|qn!I|g`^$#5a}Apdi9uw(dORw`Bm?tuT!-vRn)$5z1`xF=wa8h?%Gth zsUNpc(9mBwwQW(m{k;o`F_zgY8`oVk?y`^7rb2G*Vood%LFF_z87}v2li*=(P{jnJ z3!23_(q0pd!6U31kG3=BXP*nAs71#F%b)* zWUXS8#L%}jX(5eqWedu(NUS!k>73)>V8(1(VwDi^w64Q@4LTB|;FO~a0Uwim)H$}% z1(!04i>K?7peU;X4oZr$;^1(~;o+3o=@HY(6g5?-svvd|cO0o=N87%@UDqs@E9Ne6 zwW{%L+6#QwqNB$a1!5GoEQmV$rHmmK8f5}5)CiW=DO4K>u0xcfa~&Z-=UQS^_%`{4 zqChAsq|lUB{eQH*S+gX^mFM^KEtbr@OVzCc3I%Wh2sSrxZ?<($k4ZB<(__}sjHy48 z^eObBXPL&-FM6C8jYhIjuiTq#0we*VNi0=$>u$Nk=I%!i9+4TDH*eJ~5OSdG<`Nm< z;oSVRWzAULuLS9s#0@BB)jY`SN z`N7L%`2i9;+UlGuWx4y{v*dRk5`9av_$`Yk26y*!WW`a+Z!+bENLN9%yrgI2?>+&DO>qm2lLax3S!Q^Vn{? z@uPjQhJEKB=PiAbc*MxTwehqdTXlkzQftV1N?cRIhs7Tk^BjnBDboTEG_!ck#03ZNKL_t(ynaz%P za&?Jr7X)R%73dI>rmkxwM51wMXH(KAsd};mPd$GO)dHIx65176F+*#EggWuR#lFB_ z^oRv335wiw3u4!#=NxKGOcX(bs|b<)#eM;vo`+zJ!8u2k736t>b1SXL4<-riX4Cx_ zKGKCq@CCkW&|O33J)QTP%~(R8hZR6YjE+cf=%^^1{H?>V~FS(R#sG zk+zP+Hh@h}I|5M)3WtOQWD*HPvqU>hUN{bpPjHixG6rg?k+!37mMd)t5)*N)B!k>I zhe($|A4+WszpG@)YLl+pwk?G*c;$%mGgR~x(<1<-1@39Ao(iD{vle@w7b zY;j0Fy-TQOG*>BBXcTBQ@cY#)KmGvq`Ok6s@j1(7Ls?D|K*Vaosv>IL*Ydhud$Hnr z$%8-`5Jr%+s2e8T*5)$&9X7)~eOx1EZb+8gWyjt+-wo|WESz0e-ECr6+YsxWO>ZZ7 ztyPaTl5NfVrW})9MubmlMef^-$D6l;b$Ji1(uot8<#I%c^pLY{ zvp}{jW07^<^e4K%F=TjXgK{!v=XmZIu3akq(;Vjqu|d=Ao$&h>g4+4Z0Q!+3#I!k` zrr%gqk6hjIJ@f|W#xG$2@&aWvp;$t8`y2qr`Gz&$1T(MkMoUK}#2r(uG3ztDzY7V9a{$Pq^1sF|NFRAAh zezD|ov0&A-T-Ghi6;yr5B{N`WIob3O6I*Q8qLoiImc(G3qRDc)4yH$UFhxcPC3r!r zh_xAnRbrFy8nJ!BL>1P4tAYAhNMMGh@oDKvN4vV9xN}128k7-=!xPl>0FxgkN+~-5 zRVH_6p;4xQ>=1=POCrFHqVVk!Vqkgsgs_|=`3#8>H!YL3Y6K^ODNFLa+_O;jw-*vd z(l3}zbbxhCVPg@f(KqW~UEjxsIK+-M^P<}Rvjok)4eEJq4Q0N;{dMj5(Q;qgg2SdH zqYZcvD0(FDL^j&-vyI8kZ+_1t(Op7W*nS4<&sBOIC1RdgZu~jd6Im1GZsx~^Eqpw- zyVl0DKqmXf;YN4f8g{*TeWPF<=}M8f^*of)JbU;z%nG}06O&VYrPghz*A#c5=15XA8Y8E4r6M(PS9ddsa6p!E=r0Qg@&jN=nOFiqb(8ws;dy4h(kl~ z8Vo`bh^j+;O}IS6cT0#Jf=zH}oh&#dB%!qKre-KPvv-JlkV=+2T;>vJ!3##`WTrrO zk~I1*SrkzxS7WC8R96Er>kA1wOH);ZRiNvHE-2bgAgsuYLda5FDTnO9;Ecj4Ay*oe zXBeGfTSwM-!fJ`CI<$|3uBK`m=5tv1MEdM3O#4TyLy8lHRZVCbmgiSgmo-)8dAbZN zI;aH7vSi-&h_VtmZ+Q9Wm>45hmmi_&a8*ZXV47))yrpV7syZ+|xr53I$kPL{87N)# zikl$@jc)_K^K01qz;CGlmt{Q^yafV&b%B}A38E;c#{^dpeWb1`0*d_ZD@ib^lBgXa z!r{>?RFCeWtEU7Mu?KYHT}>&4hi|h-(XJ^BA{< zmQvSqkkaSZ?{i4h)oS4XV}0VJH0aH9>bo^uHibUbC@ULKqsqg(_j`+BP9;e|?Wumb z6{Aucnw_y*Z|nFdXq{q5IxlFdjv_YbkQ4i2J~1YGA0-}XYY4HY0y1l2(UjNgaBhOr z8N`mL3@RE#0uoxf)j7@bDLQzJ(TGiOa8M|TM6FU;2ErE5LaW^}Fhk#akcp&1oxbVl zqGDQRgwWyZhORRxt!Oof7K~FEEKX~*31B=fQ+Vw#DwPNKK3Q#T7w{cqwncozYK_(r zS7v180oEn3gwZ+5I64(*y9SySv8`C1opX6{%2gMrA~XRy4{ZmXf>w7l-6hMj3W8?Q zG|cCos)ma`$MfN5?sD|aiVL-g?S(Gfv}C%^ju?%biee9RRvYa++K z#kPUAjkIk|K08F`4$&@IQwqFDVy2Nm#1KS!L1YLa<@HF6gy6Ad32i{fkm7q`g;Itn zmc^3~sTXI=Pk%?}8?xCk!DSegCq<=O5JX{JNm$Y6xIt4bs21l;M7a9+eN+~x<_j=6 z<{-h_yUIgc&^4cSo)L;3lbrGbR1e<-hzWJIUk%!5*_-dvo1yf;C*3Ufq4ZwJYS`m; ziXzu`l}`k+h&!*PPvjjXn~pld5bo`H6GxEw_(B49pD_A;Kq6yii(R+nvjmn_eGprz zQKjA_p_2iiuNfu-dXIj>U+?!iVlo1L?0^T3W#8Hd$Y2E)qhj7nF#}B0+gns4$&H++^+Qh>;YJ&>B<@eYuG7ZK|kD)~M*|q9EGRH61>Bf{JviFDD;0QCe)~(aMm!jNA#LJj!MGXy{Z# zY(Oi)sDM|n>fpTUIH|e>%MKAkPBu9t%W`s8VpWE*CBCru`~n*^GH>Y4PU)(SY-*V) zg6mWed9t|0h8aIl~vL|A!PcCZ8-@U_=o;`J}R&Vw($MKgWCZ=Zh5@7}vgij8mh z>5u*)lZ>!j(li0B1NCY}SFI?j3OzYU`$Oo^#NLJL3C0q20xpCYA^1_% z=0qJPfVNqx^cxbW$QC(1G!(uf4~k{Gz*>cv0^hC(VMQ^!OViaf^K+E6v=VUw)<74b zX)bWNW4W>v)jbaG-e*3)AmULzPxZDI6`im5u7!Q=h23;|y)wq%sNw(ZO=@TDsorFe z(O0AFft_RfbFQr?+4}ZbB_?jl&L55&7!K4BQyBj?{c!KOZ`#yvW1(!$uD0c}+Qb5e z%~kqf@Zc(Y(YBAG|E9i%v`uBL zu^m=2P#TFI-ON*5#FdE4(ivle4lRK$ZH5sfEbyU4+Z=5i5(9xmLF4QcCXwi?ejww} z8FW;A9819TRc}QR`)aJB6115J5y82XtZI!xJB1H|4-GNY_}F1W+m}MuR6eq-6Z+IB z$fr=al9>e)Jw;KIIgK&_d;$guiMlFwFkb{7oh^~3B~uy3W>{TfeIRp!o0Md;W7-g@ zmKS9CgiJJ{4jh&TFfFn3B`dRHl|`y$%c=rtQyd7A|EB?JAOk)ReDQw4og$}bDzbde zXYZfz!9RmcGdMa%mPMZMuGgwIE}6LVwD2GU~Vwd;0dg zHr{x~?8I;#)Q~=tWCF|R{;s({pWkl7Mt)PuepffsM~=TY@tMNx;~U5>d`eLYbd!w z_wGC}MS;m3-KrzTE(vvQ5$WN*s@I%{x>ce!zzn0%SfbHj3otHiVzI-=1|=4(LxmDV z(5f%j5<{}(wICsFfC>-;VaSu}y^X`&Xh0c*c#lzuZMte&VhltH;JcJ)?F`xB5wY%Q zt2qFjK)nEekn!3V|A3$W^vAf%n&X^=x|8He>mr0Ujg@cVvTa$kLI?^QHO6;XYcM7! z%Lo=nok`m=y)#4QQ%Y^I-N#%8;qYEb(|ML3UofAy)BzfS7}C9EzzK@GGfPmO zWxZnl=zZGD3l8oc@$mC+^1*xW!K4AJ(hq$LG4k5yUgqxclst!c=P(Hgt#Aj9Sa;B+ zcb$O;ZuQ#zsYT@tEc5DdpikvZF(y|CFKKV@-ZY zdficKpV>AGQr3QXy$%KsVy?G#^jP~#7wE-Sa*-rw|Ju!Sn@w{Z16r3}=-Y6mUFMSC zHwS9p?{6(bKlx>!+itS*o>fO@Y$-jfUDNW%e!cX_oVVDJ;>V> zn5;yZ9K@uoe@Sr46l)rCw-WKOmV}BF6%l;WkYi$tHp(P3h`5Gz%SaGO?^5wGtVgkH z6VtVqRD4cp&B5^j6z~Q_sQil!q_BMCmkk zI%8r!%hh7e#rzDxlNpB!8WUow&jeU)F@1=m@q&t*@iE5Wy-$oOD$TjJX_(zTVfm;+ zhd_OGPBuG1#Xw#d4({BgXzn6Frcp@$+OdOmISy#-o^02`y1vb?lYHYkWW*q-uAk?IUT)p*X6}BH=QKXm z_U%f4Y9Y&JtkmT?(NPJY4Px?iX`6$ja@9VxXf0qIm>FVw_-(tS^({sxt~0IDcq*mP zXo6Cyw1Z0IpISn{a0~{6BH|HgfXX~MFnwp>g{3i*?*IOmEhlnDBzGOr4dKd+kRDdt@5mi?hHAOp* zrbUGnRuoZ#bq4Dq*`eh?%_t5JkSY-G9gzEm&K3B>j8Zk^xx+lU;8@?G>pG@Z^Web) z?!NL8<>4{SVo7LfbY|(KLaUm4_h!8D%3ThR??T)1{%_u6RWH;1`-ln&B0rf;!C9hs z+T|72XiS!)@(CRZjiJa3z|*0@dz8{xlh)TojRV~5 zguEgduWr8 zo6%t<1^a`yX}&}fYeT3YR7ewuwnS7%6oqjH2`2HiMMsPZqb){RR7f?4l!+)~&_SW7 z`g8WynPv;YsED8~2!t3wDWVrLqnVYH#OtO!MjCSC`0T@1c(1Bxs|w0Vy6up-_>@Er zR69fH8tC6{^fBjN!O6Xe)%+B#;B3eTVZkwsW)yDmR$pjES6(=XdC|rpXuF zdvG6BFIhDUn(i1|958)&!tCxGzie4tF36+i#5pph@NJ8oICSCYqEH@Au$jZ!1B@$} zKRG3?D(=OK%P^;jk**P<*R-)kFccV$X9sjyhH5%u>rpDAtwD4Et+2}C`^gY`QrWQw zBhqs`O2ovDZn;2ZGeW(>>4450xI9&;tuDzXCD;Nj25gSfis0LIg8tU5jzR(_!D?}Z zwT7n5@tvVrEl_}uHL=}|#Xh^;N*KjH%AS&3xpA%C;tjW>mHL~8umvzmG? zoOZ}FT9;ht(P8WU^yR&W)95k!Yxr#R{x(|en&@-fx#40A5-s~E> z#yBz5bQ+(F>oE0C!-^W8Z(p+RKG)vfB*+_2uE(=~=ezNXVeX_LdWt^?5HQi)!n1b6 zgqE8KtzcutKWiL!1>OGR_a%2<@81nAEhA#osj_Hp@r?i}&Y)a@b_FU%Bs74H6t_|eWwK-e>9qEe5EBre;vgv#g`sL@LOqV}DV2>; z#w0qR!HuU9RGAnk$}H7tayiyI%7X)D(<7GW7pb;Rs8JzcyM`>ZqUu|igt5Ifqo#pV+%Cgl~o4s4*a4&Ah71C{wh|-035bs@_d&mJ(nJ*-b9bD*|E%BaZF^wiH?@7qx$!w} z$)Ra9vCm0ifIO!!K9#mx>H}^TLc8r*iNiNO#x1LPAEm+Wk5wA$(WbA)b#(Upe3OuQ z^Z07jmoL8&40Icp-3@bW4>Iw#ak-nip#bA@P;;bR5_Q1o3}rHqC0$qH%mk&1l(%CP zgay)7pc_o+5_L;xz^_uGb5^8r=$E|dbBm%RZaJe!pa)t62r3c{eSLKL`(ph@NVptl z93ggzwb~jcvqL7+1F~sB8v=1rLu{~4VKc>p+~6J@VuC|SvW{ZtP%*HaUlQt;Viviq zmUN9K7@^YOg6H1x3CH&iaR((fvsh9QI-Qls^q4?LtS>R4qbz2K&QoHr(O63Ky@=M4 z{PZbx9f{g9?`k>$Gs(%b0$nw@AP61S*Weqvx<;D}lUv9g+Ef@(NHnyu!w9Hlhl!Dx zY1Ax3J4Q!s1`I*HL2Sd1HCvwQ7*ltII>yY*AX?Iz^h??uHk z7D&Cdv<|M`5XXXK;jAI_!{5>E>=Tq@_6u3RXOF9CWW9~rO=G`1RySIiY>(CR1o;hO zX4t*f_cDyZ`qSYW!yII=i3VA$K|%`9tDYoaeL=OJcWLJB2*@=mX8p*AP zczANa?65=|g+XJLO=w=1Op(ym=(a+)E1b)i6$gp(#;?c^4k?Nw+~kx$a_BXMIwRK#m1SI2bCmCJnWO7Ev~_DGc5C|+Ffq_YpCJ1&(pGb_ z?2xuy;L0hkm{8A8F);&g@)h3_lzMiq(t{{mo0 zZOaH$FhFK*CgvQy94)eRcyF<&c*D;0{Prw5p?wAX1`YH@N?ZJ1O}4kZvEyQ&+iF1i zMcB4(hQnmk-<>^c-v%%7W?;uBY0pY9-WSK)8$-M4?a zD?(L4sc_{TP#HF61QCLTQgSRB9W=69A%&xAJnG^K>suNkzHpRxj{%LkTp^tYqsgox z)GdM{n@+H^5|`&Jt2td1bMJAU^I+1hKj1=ursbloSt z)8ifObFhwX;}Y3T1pTzyO>q>Z6zIO>^7`QCoNVL*xi({V+OsygXC)BB24(n31lo|4 zckP;+t8M=5xURHP$=uO>iR*oRm)QHu6Ng?(86DqDUvq0D6jdMieC8BT{U$2w-L&sw z5=7fWeUm$Gzt9=1pj}02eDAkzF>TpOBHB5MqdUDY^0d`CP6>FQz-M)Z?*yE|WH~W( zJuG`zM}3jMeyv;a3AhwJiX5#Xs8lgknV77Akn&u#!~_c$>7U~;-Xme(D^f-qFouZ6 zxdNjUv@KXqs}xqiio$qJXf=)Q2-=frjnS4;S&Gb(9o@xDEzx(B7b`?vAj=99Bl*m5 zr!Y*#ku`>Vl4=^6vZvN@j&5;9tXC+3=yO7)FcX8Glo%XM(~uF-rO?G0S_Cy$n8slj z9o75qq1p!JCP}!5KyZfq{s~rTx_U+Q5i0`~(G1aws1(+MTV3F*hCC{CW@(kiTZ^No zIq37TLX2cZK~NRBvmE3Ts?`!fljjACDskUQh-6ttj1k|jg7vnbIz$`9NN=zPirEoY zkAFv4JRvMCNQWl$aW#d}B@#VRMnXko?O`&;B$ulag0JX05(#fF6<#Da6JDT%#M&eO z`x+5y@H)luN7pa-%r!ZVCyaZyX=4F&TY<7~BUror(gC+R&-2c?+XjlI@VsLOKaoxr z&oz(H`1RfydV9FgQ1%>7U<*-fz#XP3~LY?Ps_?!%m=iU+I(E0oWd$xT>Dn5) zn(pcmh+5Yt!q*Tr!7EhPVPZ;LO$uSMBZpN5dgK;O39re%@)(t>|DuE_A(cY_G#wjP zzO0qY!8nxYQ7Dv-IHf5vo7{o4bZw35VuFxMBv*oS1$hQy0(zQCO=RVSVlpF}9YAT( zN)XN{+6M0|7NM9}rbW)gS#oPBCo^1LV51_-GBggYBdyUyN^}m^#ANXSMp+6S(Bd(9 zN#;t-#6qD_^9myic=(XjQJw)vT~+GLpsAwjJ5wAn7Gh$Mj>v9?S_6Gt_PM4;;e%JlPC0a0k4 zeuQ)fxIBY~zFdyFQHk8wZcUWB&tvo=ZM{DvxAWG|g)XMJti)vou?1FX2m$W}4TV1iJh>7-4lyKKVoYv1JR;t_2)9pqJV59)~4p|2jhz4}u4Tc_iP zdSz`(Grz#AlmP9FLt^6N+$9vasl9N_Xw#(^TXE~7W71aFk&(VKkUnj z-e}~h1xDECmXz4jS8chR_5oY2Dhyi^ zYxkWNLzYMyhzx9#Y1l0(uSlZwR_o?rsDA2dz}gI>6XSxxBff`|45<}S0FBk4bpU5^ zvqMxiK`DcXqH8^EQ#?@D;n(x+9pVP4CG8GbdGZwh0A6R=d?{txO{>X7U!lE zMMkhKG0V`CDK-XjZHXF8o`G_>k3MGc@e>vo3qrTVIfHE^!P}3H5UseXD_RK{ZCKVT zLhQJI=N?W}a(k{-Qq~MMF~)VeNAgl=v`WkqDhSe5grG=9j3b(qzoo4M5pKgmDW@gVvLuAa)jTmy zr|`8Va|WB|REre@Y}*(`S!C2zOBWPHS)hnCb&XbVba24r;E)glbx1B(%j?uD@K3u21NQJEve zCRs^hP*Pw_L8Jo`bxpc=ot~WtDrSJ&7*xG)R1l&uX;Y7qTs&Ky1bRL}mAHh`m<36N z{H#mCdLqs$Or|NyjAAxRCC`0=BzIj)7naa9cu};~oXQK5X9$sK5)a++Y|7EWglRdU zbQ5MS$C;w10rDsjf(I>z*5(9dP~spcr1M0rFp^<>Om4NJ#My!v0$HBnj|=RgplWK& z;Q{5*G0oW-^UE{**~etZFC)_f+|eN_)qcQQhjEI@bcSRlM8~~Xawd20aA$GVmwPa% zR)LSS%Zfl`Wi44|IGW73IG=NvIbJSHo?Km#$Dzl&zT3JLC_<;Cs<7wzUea1PgwS6tN2vP8{Lr_SJ7_AWk-N3x?0&Cz_ zl&VEu{Ey{iny5i!Sfb#MUw^c_Ue)NI zj6c{cZml)WSvudM*NSfHmD+ey5fNOLk!2ZmTM>Lh5PkjYZ}IQ`{LlIIuYN^S*S$ut z-Cld`HD3GdXLFFunduG!q-}~P8c>g!=BSG<{FTKeheeb(W$_aPx zo?w*W@#$lX)_mp5U*l@$TwO3!|&Ye4a{xhFradpM2 zsCa=Ew8BXrr;f>c{r(P_XFP2;5 zIxVOC@%O&Rd;k1C0B?Qes~pT`e02Hn*f--0g-+Jq7 z{Mow@D^}pucy%VMf zQzp}r^RtU>%e8OGb;#Bn*?cZIYsvGR<#LG-dm%73AP2#^Z7ppxc5h9}Yl3EL{_o7y zv?fNvN49^n8%r9FTf0eP#9E6|k?QIkbYHPkEMyj=HA)Fsjj|I|UoOI^L>`LEl5Q&v z5ufKGkdq>9{9UL${JfJ9Y^4#HU zhE@(0BC)BF80pZ6NmiZE^VTWBn8c2)l*MK_N*lC*(GKk#E-SFMASP?N)Gy2*h$ z3qvGvSf$R%weNtnd*)hx45WO5-lsV>bRzv`GTu<)4gW?WaZ4EX?vJ&FHg zFT?RkMmx$`#uwgroe%=w`ObH)Z3xmMOD2;E-+AjB{L#0+%O8ICyL|DBU&J{FfOC!q zuRK`a)^sxA>FGH?``It}r(gV>FMjz=ilRV(gTq4(4iA}MUGeju{fzm1jsW-W-Q(W< z`~2VsKj0@n`3Y^?^107{4rlGC&w@nA^O85;e4W4i%YR2^6{lxsM5j5qbB8xR^ErO> z;~(+;?|+~7e)B$m@-O~$JrKkFSZ8_o;6Xps!ok4-)7gxOV3gwc_?SQWlRxI+s}K3Z z?|zr#6I8 zkUx0+3rw};TW@`xNKD$EwtVjMuk-b9e3jQ9mbC-v(&fROTRbblr+> zwV?F@uQgQ=I%8>#q4f~FhBor@-9zpk9xPVNnP z3nr#gE>VTv4V+lMb8B%yVM4@Z1xioIVnJc1O!H%=lVc8!?=!o5mxFuvxc}O#Of!Y` z7nC+~GMSMD!4a|InW{*>TH)G?yi80JrOq&3h)*x5AANvYEqi7L$IKO!%1~qlO2N^c zW9k@D)-ov^lgy%e_J_6&y^tB^UL=Nqgrr zE3mzLt}G{rM7pj+BvoNB%Ho{EYJ=9QSMEX&WVl_sC4iw{87c_~z0U0z9r6i~X3(!e z886e+*7D`nF2|jC&fr3eBu!A*UfjEH)v%aVGBG6bl{f!@*B-vYM;|}tTi^N?|Md3T zeDv|hTS83hgg9C(mOOd-lp@QxcmJgn2U9&zL!|`FsM8`HVixop{JN|`jLfgDxSG$m zXg!QEXa${bh*8n`jt~OD`(%!Z3_0`vS^5_v?`SREJr(eIzJHL8&6eCQo18X$Za*ok(a_@w%eeEqi{P05-ixqEu z?aMrT?K3?7;3NL%yWivOci-dm>?uks-udOPI61z{8=wCIfA{^rXH_-nxrxxVEoV=j zvRW?t0DUU%w)Ugn05iQFGEC0;Dv3O*(VfG7|{;NC3fjR!AreB_wS9C=}rThJJEFqo(bTA{7O_WBVgDsF)J7Vn1-ZKiz=xhG20(E5-ez`~21a{#Tryo%6;QzQAW* zeU(RjP*?_^tO%>R=H2(-*s;+tEm6yqilBQ{R z=bc~CwJp{dnmUnOzWU$+FQ1(7>v!Mf;{2S`(^D=k&iKPW{2p!FaxgpO$3OmYg5VD0 zENK!nbtFu^-~7fm_{_ssdHVR2)6=K?_R)uY@7v#@?OKkH@9;N&^Vc9k zrVZcy&bPU^xZwEkh@b!bXAJSE`Fu{>DlC>50~hBPyz}-u{O0|4IXivID-T~G#(;B< zlamwvx4-%;PEVim2VeRU_wV25onO5V68hLh8vdXD^r!skzx)@J(+MEF{r20`b%oY2 zoz3`P|Koq;?ChMce)TJS_TfXGoIb&KEssBX#4q1{m&tUB(Hd^DfIV4qAF10=4`HnVZ- z4c3ClIzdXSQAgMSa1{C)^~?4(hvU+(q6TAAEI@?_F(AsKOok2-33dOw07|1mMC%R} zyFN*>?~gX4oUF9=qUsqebeG~R3PfpCOr8a;1W9OyRBB>KFh=9M0L9?!i*&I?M5987 z#3YmiFe=h1PgI6dJ1`pWGzx>&7Huucq^fT|MuKn16})=yE{C%c<1EG+vb-cO3aprf zC=`p1ptMObpti+jmbMXm)e?e7OMzHL)D5ixr!~eXoOM{^ATz`+)q+wn5SKMZdpyF? z;axl)$qXlxjOYVJXVN~TEJu^Ow9AN8D~$4(STVClG^L?wG)<;4r6Y7TYT4jB&%Ew< zbb5-NOgYX9r0sADCb|32l|iWoZzbCF?lC;lUwSt0fF60KMfOgN%SyX$BfJeg{PLtaj@> zBcKods}XMF`EA$)27mZ97u`)v2;*4Dx)U2e{4@JG{C+^GJ@Z$4&Z851_TPX1ADAx} z1cY~g{cDP%xW?W9@WBTk@aWMaeAf{};HN+N39Ho#i9%h~{O#ZVO)4rE;r;i2gNlK2 zddQO}Pk85@cY5MO#XE1m&4(X;*asbjs;W?0Q&kl|_`y#&JUYS{!(#CcSC^N`0N)wU zj~_ka^yyQ&R`}^penFO5jM0SX`TqC6&%L|H7~}ZmJ8yG#afwJ|v0CwWfA{xH%aZrn zcYD`aiUs`gSHDK%Kos7${Oo5x!+XzfKl}h=3};t!+Ag7Re)z*5aJ83Y9ooaO-4Mp z`XZt8C>o4*5VEv+yPU|1p;)-0cTH+gp-FT=p}nD#JL5K7wqKe;>XX)+YO(8s`q%@K z1g?@KgjI}52n}w2HJmuP%d~YEmk?-~XgXyOt8gYIntI>#&r3L(&Uo$RSIJcl48_+8S|?YN!Z^!WzTD(IJ-~eVANvq&SlFV1_7hi`ZEpJ?QW$3Zo=d zhYJWd<(_Q)VkhThU*hF9J=z;NxoM^q&0ly$GuMb>wu zrKhv+!Kz9p56#o7i**iA>pksa0XHZ9%|!g@0u5KdQ@S3S*&P*n}T`|v~V z+-Z68_%R^_tV(;qYgI1|w4fB@XebyUT!`}Zat7WUn&R>S#-w?uG%hR~N)*vgl ztgk^fDG;p*q0hkzHFOT`I+V@mi*v8@`)pAXl}Qf1&=3bClp3tZi0;ciK;ofO(Lt(S zL>gC(Q9>%{mr%4(XZ=RB352_TT`Ext?9jWAVxJ?EYUe~Wfe-^$gEAK7G$zj|rZY_D z5M%H$;8!hO>?G0_dzHGY&J+__m`{fvK@{(W53UVq4nA z6GdaP3?-hUqeH@Cg?2e&GlJ4MGbOZvay6$qH#9-0g6FqqXRMkQ7c{=AdF_>Z+@BWI z%@W_Xtm>Lf8#-bSfA1}0r6H#H&475-8fYR8Mcb^fdB*Esd5hov=C}Ot|M^eo<`Qjf z^12yP?JA`?I=ajG({n=Sv1`Wjn98J+QY!*s~J_lk2{ECH?B(ws(ZBw_8?H&~flc_Zv!rsA_ayFMjZGOTW?gi^&*7r`5d+6CSk5 z+dvolGoVNaL6M#=!!z)p1 zLXSiPkDv(aIkxUAJAr>#m+ek*0=40`8jk71je|x`KfY@#PqRjC4bC!RVgU|p=Gop^ z6Vv9Fh!Er^x$k~=evGN|9{NAd$4_5R@e8L zbFRmJopXM_-+lIjD|90b-Ix%mn1Bz2m>61!JQ_t1h?Q9Wp-K5FTT-T?iB*bPs3cWJ zEQk?HglG^8Oau`Xf+6bImp99AkXP7~gTZYqugAPCG^JGU5P(V9pAdk#TP7{_aVk!$}Wen_*pazPVZU zSvHV7P-Z`7uNSlqOg$<|7Rhuz9uW`8X>=KhWJ*AJ)RK5zUz4e5MR2B2VQRrx&3j5o zeX4`ZHyCBFc80=f^ww-Xr<|1Y^feNZkfw3{^4D z6i0=wok}QtPi#A?!jY0t*peU-S5>&#g0d`#=cm}xW2*(l$uUtZzVE3omK?24SQigz z*Dv$1Pu%YUJvFZHdHb90aksW~O-CCIkK0JoduG;Q3e7uG#(9S;s!95RQgg*5#33m* zc*M=v6enDym-y*_@goRpWIm^GGmLC0Tt!`0xT>N#J4Ip|Negy0)MQ8fH7>8g2YS2q zWJ#~)$}jnzy9IQeb~jx-x0RMQ%LteV+Z|?iu`Y1(PdLxi~3m?k=C3viYe; zOqTdwpQi%gN#MVM>3W)Ne~7u@+IH33zBdxngwsR)eUiQoO+<7Po`w`p6c01@3qZ#A zw12<-_jT>t8%?&W_U}z&G^IGYzCAf8cA5QP^eT9JnPD*+h|oo7Be4j$c?}{217=oYkB>;Ez@3TuGhI@?Hs^3d#Z(_KUW?0}_YL!{ zBXvEoPjstDy;>5BlFC&`8L8Y%S>j!(KBpA0u_r}?5H(pCi`asr=iWj!KVoe@itB2` z)kt}Skf@ErFJ|~zNp-ZqElVCgx=%EYwynN9SqhV1M^xh+4 zN5NpNA;w)8epOZYjFym8u_#jF#gBZH=KL||4?c*i3f$3KpiK~33@|&M6VlGQ(x8Za z-brJPmgjKFv6)P~yb;{kUKazyA?m1gwiA4=jJ zCdV*#mpRXd{vNve6(;RlyuTrw{nCfm_B-ZqW8knMVy3?urj)2x{EL{Y6Z?rb_oS3QoRfz62`L(o1Jh??9hcI9-D%0%tv$CX%9bL49 zxW&pHj1aWvx*3Vn*R3^JalGJw@RNZpP-}BQ~#| zQ`RqIj#nH#`z*&#JxyPhxUy!sx`(whT;CzKBjKs4xfaChdfhK#g|(6Hd_%c+11XAa@=n@Zm!za(SY+B7lDy?I+ za3qO@&SQ+r3H%DWJ7=)gkVNOY$rMraYc~Jxrx6SiAR0qeozVBMVCgl$!NA#OLx=%H z;eAs$s_ICs>l6TGiub{1=7uqg^Hy{GmSx9v!VLiohuUokHE-JNF4OHOJdmTBE;*Ek zd<<)LV#~5q(pA_PoXPc5CXix6eTg<}W7-@Bm-8rOG%u&h>}^XVjO{>f)8LCRX(xzo zY-YDf-_!=;(ImCTAy}@Gw;pPFM(pl1 zz*O1d+$U%?Ts2wtfJ0tuu?$DL19N|{q4$C%MAeMOwRL}a9d2?UsY99RZU$wmQ@8t(Tc+AT8%ysx(@HvGKwjZyr*yu zv2fmODNDn#pVRq3Aks<;eIWIYm3tEsh2XdNeuL>7QfdiFuvI}3msG2om8~hA;q2iV zMZKbUcFFnatDL_035u6q!r#A7c>a0ndv{o!tZ0&_sP8Z<3@J2NlW5CGSegmm4?D%fe}ZIL32ioElVQ001BWNklA*A#h@DJHDK;*3fo%<%C$>~kG&QQuKm@^|YH?b!flh=N}NHSnj_NxLWk_cc6gt=zl(_fnBLJXd& zs@0#Ali;0G8mqFZsLF!ES*&q5XDN(Te@@Cdbvg4tX4oi(KxrMm^ITYAUX^URo~CQ) z{ES(EE>uXrr8|9v*j_;25;j{%o=AhEpr~dPwxlRaih6+~;z%@IpqKP#a}F_{7<-E7HNr3ruRG^bzTp83 zucJNbf`Z8+&CrKT>leeGLThEvrUnpicbw#iIT`6@i}A!uk*ENVKybghc#Q@qNQ{`w z)-Z0ulL#rj{qFDSGfpjuE7sB^|6_<=6Fp$J9ayUs5-05t?aOszHofO{%;AU5d!ySv z58V*eIruJKTaewRUwcPPgq}X?uFB;VkCfL*R0#b@~P*zID5eQ!6yjuK0ZQkOO8W;Wkc`h%x5)KIU|Tr z&Q@Rqu>n(6xN=T372+fPcEhZm6GeIay!TjJkm#r@$K8_?Y78^q@aoo66$UmD-}X3X zxl_zIUvDu6N-NZb<$T@HrwFdZxssGRM0ORfMZ(_vGDf3=OKY_ntPv7cixAEVrTL16 zkT$wn^7M{qG-U8Sk~$KR*yp<4x$L-d4ZOiHUGDa+FFLf>BandIE|OrcfRY@rho&%8 z{x{_R${xs;7p+lz!6uEHnauB3EMIUekwhX^f|38{Q~^ z^Q0Eq*ylkr(wFiEbmY>{D_;y_ap|3ZDz_X2>tsAHQ~3;UXov>XJ7?uYa_JJeULZ}c zdFXxL^d7H%ryz9_p{mNsSWU-7z+@KZ3=wI!YBc2>20L0d&=4{zk5PCThT2a zW84Gc#~;%dbB>;UEA94z&1Q`}I){2j>9o3SkrEPmVx5>B&+%=GwSj0YDa}C)si-Iy z$N07H=LjNXW5gggj29(Wjrfm;Of@494mp}%H#Y+i)MYR&fPMmG8$4r~D9 zCXsemxg5y%#6b+hbw&Ga^53r+z;I39rh@0P&*)dW4e*Pk9gY2gxPdpk*_>Z$?Oz14XvKsZ=%Z`5+*X$v`=H2Q)iX6J|kuQG+2xB1MBW32QaKMUv8BT~S|+GTg_M@G)wa zOrh&52`Q)rW(BY@E0<0oIV{*xOCCh6qmxq5p9VVdI4{^%7wn@xQEYpx-BQFzwW*oa z1=YMJZnQ>EQJ2IJ!6Z88sBMXpHBD9FW|sQtdn{&0*yWNsbgb4L{?s$CSJ?TAJ{{ zR7WQiXC1DJ6asY;s>;!?J6vI@E62L&=~Do47%b7myeAm!5bljyLz1l*K~qe~v!Sd? zs^tn}Av6urcB7S(M1~9#r3hkB#x?)bTIHxTWeL_$xRNL>vHukoMsJi>K5q32+>e^u zp8YTTCQ~Af+sh6V(|>UkPD9QFjG3^xYUL0#Fc_J7%`sAS3~msvLMqq6X?w>^%4jDB zUG{eS^L6B&hyH#e+9BraYnx1~&+f)(9FI?>ds7$8rE86;9g6aVfeYN2~o3L88;Pdq;Ns=Zc!e@d?|Di`=&XO3v)~CSqLF0-po?JbCG$+kS*tyS=hISXuXd)&Wf}V_8UlB`LprvI* zh)FaZBN}XxDVt0p^#LCuG3Yx8eI$jLOL;riZBI-cQ3Chtxvs0w;hP0V%aY|1ipnWt zh}Vh$wkk1&CUsiz*d`IzTSQviy}R6b`wQH=^AxibnXi@v+tbD^v*m)u&k5Ux_2vxw z*b)7b<-Ecaj-s4niiW1DFcxY7Qxv44#H50dJhSDJ!dRk9NV52@rKk*DlaQ*!m2+Hg zC`OeDJkS14D zX6Yvg*tpW+>GiW<{w1d+%@5kn3MZu1iyTaHq z%5p0ST%iT{Qp#b%nK0I<<%Nxyq!69OWtvQfNF*8qg{3h0?MOxjjPf>$Bqje9s{mm# z6h`%K1X7H|5Hs_K5IjV2IO_( zzBcgq(J8M!z93#)FgtBHTGSlBX~mm<{X2Qn+diFpC(n?!5wqP;bpcx}=&Qt|i#0I> z?8y<~sM4G)ZwP%yAW<()h}$)@r{*Mah;K*^WnJ*1WxQ=9rj8&z+xC>udrVyrQy}(R zT+)zg$@`H=V%v5sstS^_AcQV3D`tqOI&QkC7Lb}*IiO{~1j-O)heVPwxU$3)B_{S7 z#FZ<}jJ>M{qWsuj^|*a z{t~rB+GA39W7@u8ygj_T4>ezvbarywfx8LRWldTh6MPQ6o?bmkPShMGqY{7WC|HHz zQbLBXT^uHdOsV{FNUn@&OsOzl42a1BCaF>~);tq%cDELdksQ&bsRNRdQVmI_U&>>Z z$YpAx=D78~BZLeyr9=$Sgbguuln#Q8gdRHY*|vf9sHc|5u`?Xo3OBb@MZkuD-!?ot z-SSf(f5#QN1&*giVPE@lV?k}PMB z&M87-8CQsTM4CtDeZW-}U~nc-x`>y6lf-u0k!->Ri)k;2;R2sJy!0y2iL~bpeM+QO zOGBj65gqgdEy->T^SYwx6EQ?8VCE_=VvEHp#Fs?F?DPB1#0>j^FEPjIS0$mWu|@LALMhd5NP>CH^K#J-jNnJe);Oe-T1HTK}Pm_~16w2Cd zJws^ZE*LLey2|SkfqPBwVbv+7u`vgI7&lzunvZlNQ@y}}q}vM`rhw{xGimZ!nrzRP zL)IC9xdHsVezs1(v0SoV-;j1)RGeWfv%v0sr*wIQ4voasHuwNw;;R##Kh`;xt7B3U zwvS)Nx{72i&J+rLiH2)SGD8}sY9u78gMMi zn(*Ku4?h0$ESD!##uNH2U5ZEn-Z^~gNmxSY@O{u^-w;U2ki_C+rwrZJAkNVGp4IV^ zzKImh;d?(8yt77$k_`r9_w&}AF$&`)p{Q5b;Z{i9YO=!g;OsIxVALX>oK-Qxp!HblD8r)^3UCh$d$lc@=W4qm;;H z&@Bl|G`mPUH*6NDrbiO0SwTIYT}jmKeWK|)Bo3g@&UcbT_N)tq3-+6cP!$#Pd5xJQ zjST`!_X1_~_HhFC-=ghXR))o5Mb~fCnSAT3sHJJps!jQBnWhEOS5f; zTi&{l#u?`GIZfL^*s)Bgz!pkZP*oL8)9iA>l9n^br7u(V!)=Jm{fU7nMhNU|CJ0VMIre_feO7$RzF&3DJEiewi_e#Xy(5q z5l93P`V{GdCrZdE)w+&Ci1-NNBOxS~C8QK6VuNc9C5Ce>4~q?TGp7^J$6h?+esi<# z-T|Kk+E+SE|1z{a_ZBlwo_?NUIVaVyxHBikr)f89{OLn39z7<+L?kj}K?L0Dgj$4I zS+e$l^OrtBzun-TeGAN1gb=V*LEH9VEy-A-Nd&Rr96m%4t9ekS$5_j8&2#8rb3tfgMw#m<(*^#z3yD!0JI9x1gvh3`8k z3yOM0>@HNP5cLxds&o{=CPB==Uw8Zc>Gs0NB5XL z?yQSTw;z&FB|~TV-6=yu6jcllAS%E43x6Yj@DKh0sLoO<%~L{G)$_AYM&nVTASs_?e&mFyH#E-^xob zzjAvs_)_4*bI&}(U;PW;!gqbo_wa*1{7s+3G`{19{_lUrU;As{L6qAU*-F64>V*IPPyBKI`gis{}BC%^qa|LuJHxBm?upPt_0`MDJaD3V4;?=Mvoxe5jD)`dKQfwu398m@V{?;=83 zmdsWQHtVhWVax)o(}+Q9Fs1~PeLhCZBv@OFF&UOfluoa&Jw`}G0UIJEmLM|vcXv^u z(|!PwFt*V8H#?UtVwAAhNF+uTNP=h*XM_+EeTYP_g(W3FXA&XGE=@xKywDDCR39it zUC1zZ5x4C*ZF}xFdiNPn<>#t_IZ#zll$O*b%1kVBsk&u1i)+kbu>qV(Q$bm6Ln@F=c z^_@G2jrhL7ni9e3F=$1DAg~IayCTY%{)@L^71~+Tzm;LG<|=V-&=sX?0h_=f3l^`L%C*JAdul zzn#A8Nl9?d^1=%*@Q44*rbp(Z5eu@Kejog^Z{yWaWP zyyG38#h?2N-;zr}Sgcb`Qn0-A%6%@@YkjU;j^prHDJ9C%@eN=1yZNFo{!J`Tj`+!+ zejhJ?^5wnSQq$uvH=7~M^Yxk^`|+RPV;}o@M1;?I*SmPnSAGS5`CGq@P1g`o$A^FJ z=ecd30gUk?%;!sf&+mE<-~SJPkdJ)qBe_$%_wnhU{%QQqFaI+B_TTw#9-o~}-t+JP zCWk&wt}IvI=b`pm9Cc3yXC7+%b8%Wn>EO}V-eVd$XePf85a6Uf6PDTW(}eyL7#}h7 z0d`XF92OOB)xcPV`l4vPtD(GH zaDmzw>eBKSNmNN#)dj1nz*)nhDmj|Zu=5!qc{Zo#^k*AF2Q*-g;m)&fV)fjoQ9pGL zo6c$1r@ZvOpW^7bH?dfhT-Z*NMT>$iL|lSyy&(pJbp_SY9qjQ5?WSepJynq?N;^hry+^zI^MJ?)%|en>k&jxMnSU^mG7FRIrZU>e2D-3yZ#QRXG8rW#lXM&d%l;y^__p6Km6bRH~bHO_Ak);UNfL2 z?}x)XGP`UKj37~~!GzfJp^tuu|MhSDZ}^}Vg~3piN(vicEIVO#JJ8KTGvp#6eAe6F z#_#`q-^8E!)Bh7+`whRBFZ+@&<~#oOcaNQu{Sy!7L7C{exCs2i|LcdbfcKs+`I6tt zmweH0;je$^cd>0Z>O0tT)?f1;MHkIb)*vRpB(3X}Pt|cSBx9(Z!x^XwtEH?}O-9Cd z$mlz?X6Hl|@?82=h%m!pC2pE3aFzB*e_E^I(@Kh<51-Nw4H$@W%h{4U&%c$&FMR^U z;fkdO6qo|6Rmx$f#n+rINFkEM;H+-yDJesV@x!g(R)HgLE4aSh8o9UD4_65*K zVLqF2_wF$>A240RtX^<;F=vM6RxOH(qAuzChK)QTlnO^aeR9I*e*VA5v+wvUW+yA^ zS&1p1V*ZYI(YJx#H!R=!JTiMscfMiUxA@8tIw+lEUM#Scq3<@N=m=2|V=0m$_K}zp z{ko->PJj0S-vyd&&&Ky`+Madm*@nPH=)pPWrQuQ2A{eUD(KZcrp$lgdI#pm}#2HIK z$HNWm^9~|`YH^o(d53nhg*H%C6)vIGlubqGQ!a}ReY?f?TO`E1SK58#$f#(FfGtZ* zl#!$Gwb~OD*VB;aD`cT&n3lVCS#vy;ka_E}3FGxLtaa^vCI^M$^?5Rv@iz?&kfaNF z3Zq<=?`j3WZm zolx^W?wEn6@5yFI{teS=fE8|1a1P~0+*0P>svWd8^Lx9(R6gnFRVelFd$`<;F*&LY zOtoZn_f4E_w%DS^P-g#)MwseqHXsSb zz<2{~!lpn`&!`ti6tfwnNz99ad0A2i!H0&Udrwn4$DKDn$5U^5mS>)Op88}(J##n$ zZnh*GzmjM@`^-{PFb6-R`w*-f%MD@4daEskh*b70RGYL)rH*&1hO_yQ!{4x+!MFw&@- z;if}0#&z(*RM1R0+osEl1CcWl0 zWZ7NfI)ih!fMMsDDEOB@@&DofNaQo$@tOSWM?b8P(KMWQgj4ca)*?PauBY^l&wLxd z_v^oglyr3=w}0n%^62alfA{Zx zFTdwKU&R-E;TQ7Hf9(Gm1<186Z*0@YFey)Bo!)Q(x40txE~A z@A;~C^RCbR?403W;G;$Weg5bD`^;BME%T95Rx1XOPoW`T0%fM%-}$Jkj1}q~83g%s zGu4fM0%Lv(lIc**sex@9*=MtUtvX=(^-jrAMak~!c@mJ3#k6@^$%@hv z%F56_I;HD-jB|tll!mZvwVJFG+SDOwNtFf$1V;)9>*ka*$JzP}?>#;xn%1+u*b;*f z`b0>HWF0ZW%;k!+DUd9h7@Xo*@mnh%qiBzSbsD_lj4F`j@`$RcIJfiZp-u4-v!3%GBGk@S4zm8cwXS?nB)BoLj`RcFxMjkzWbSo6=s+0UuzsxX_yK1dd zY*~*ndnU&;hhd<5`jRjDjePcJy;C#f3rCC|W8kfC`81Y`1-ts&1M`3|I9zqMCWa(X zksU+CJ}Ws)1$RnX0$u%p`wGpVh&_pAzq`-j<28pS?T43}T_0bIxOG}mY3OJEcDQ@i zuN0=Wg_c(7+s8;1u*~UWkBxzpB1KHt&=68U!~X?~S8F$^kQva0NSeGP2IyKe8cVD|NJxk~^doDD##vn9)R68yf|e-{X`F5tF%;HO&kV*z zssQtv@Ia*b$76r@WnyOqu619qsPKfgb zwpo+<7AqB|T;Zjs?;S_aK1J{z*A@7XXgBIdvPLjIU=0M(%Cehg12}A1VbDCHKtPPa zcZsI$m64*-9Y>6{9xB^pD)JJzneRJy| zt0xmiNu{8*hlx0!WN}`$l&-tZu*n%y4xe1Q(#=k?T{(fPOajxhB$1O|?EzYteRFiD zFbh6t!kLq))@(RAIpNO938$~#$Hg7}kI0VFC{2V$O#4p$k9_3k`CVWC`)J#2I-3IT zRamCUrh2GNpL6>A^UpoYH+|FBBQfxszVM6qg8w*Soncm$eA+uclmFzmegWV6eLt`l zw{eIH=d!R%!*dNarch!~&GMgW^t;V<1Fkbc2VtY|eL_OZ5*uX`MTK*{^K?7){Yt(lWJd_#&Z=#O7k6l*I^0*=@ z(qseK`Sxbt7F$xFn=3PWmRASb&^Hry;$eFUFC>+kH;t)*0 z7^kHWqAIA-=(t*xDAd&zGgmU7*DU4>s(DGWfm8;p7^+lL)-$!f`<4sokXem$C!E|p zrYZ_jb3t+m>%{4xVE_Oi07*naRBEc~7;7rdU;Zdn7je%%OWC(c*JA{E^k^k*N2moNUq}O*-xXG*K8lYN@Xou05=f}&OuNX1{(q?B;4{I zUEg7PuLwj!BQJ{?sj6_c!c|ME#WCUR5x0$_ePYXqbh99NJ#FeBzgkmgCkU)PwD|YS zEbQf2yhfJ$bSX`?fyw{%D7!CIKJkqzJga?e2MqH?*mGoA-iWC z_=E;Rat-yhJ6=r-V&TDqGn%%+U|21VurAjh$yw~is*`cAPkSSip&m&%Yxv5q{Bq7N z)_lc(`TP0BPrgdmo>Ny9MN#rU{;Bu!P2cnl{K!xIOJ4ot{e$9t6g~sqFM`Er|3x>e zC_=OuO5v){Y3S?p9gpviVWS%=zB;x(@OXW$UP}QaVao#FM@-DleWT-%vJYb4N)slk z0A{beM&fF!R?6^F!k9Gr?xxnz)j)!q{7?HZ^-vmopk~?a?E5Oup(|b=b!QkN>(XEq zOs=>SNcjn);9RM93LV%2E1LM2k|#;7OT=KY+p%BMdkz9=0xU8RaNg8HOvFNAok5U_ zh$eL!o0aYCgG#~>0;VN7K&)1U9sbjICY09Dr|h?|NueX>z$u$RS=6|BO){d4-w}G> z<5Nv%ELBy|6WKK9cnh;=*_=D>e)(et9PoH3$ip~bSfbkKDi3{J55Slh%k|jjX%+?ycQ`e*J$bNC{Fzd{iG?l(7(`F(}`lL={9Cu@++}<_qR0&(rtk%q={4E7Jpa>O6t_kI;8ObfFs$<$>cJpMIv|lxJK(FO{Vo0F7 zWg9n$0S+5a*2T3;>)2gXaq8?fF^4w<{Yn>LT~(Z%oB+jW0^hlJhcA2gf5z|r`uFhO z_x>p!o?ehJh!M&`vo-3|NEQ$+zpQYaj9ce&b;R4>{sP8W?%lmdRaYc|?Pg2cb-euQ ztF%qKH*S~V(qVIV2HyT@Z{-jE{{Nak|CjzUANbjyrEN2{yHPFbhky7-`RcFwYQFf3 zehc68-G6@+62s=Zr|phT;a|#?IEVfo5=28gTvv$E`Wb)5EWl&h zn_yS0u0w$d*KYE{08yI!K1BxDa__3yI!su%6EG555+)1CwEqI!aE*aLRqr(fAPmXn z`N^;A;9l#!P?d(-2}3I&}NA>3Ig9a7Tp=W=d&=50&*_JVj0p{tnnbG-A2bCjWDeSS{uR#*Wag;as9 zEwO9pH!U$3IuGkE(DfaqFOkAQVe!7hM}v=PL`=j+@CgZ8#z8G1oevnv#qdC!P|ok* z?mR~ffv{~TV^YeYq&~s&>8DuTyF=Tw_^zYPT3g|?pwa*xZPCob7{W`ww+rAAS zRbwm4k~>F76s6@a{?Gpl|M;K%^PPYgG!=VE%S^h=EvnH52PsD0{Or?w|KI-}PEPK! zTI{q7L3rimm-#c_@~!;9Kl&kJ-{xnV>{MbH_%0E_8OQJV(sy%qcER`mqkoKuFsluT zS|Jc4{Njr*0`Omb{WtOt{?8wz>keFZIwrFJCl*fbp5%zCDReVfJ}Ll)G2AH&`?EFW zghny2ZCXvN6Q$J`z$Hsc3N3X_J8I>l1;a!bIH&N0u{Um*(?Eq?g#Ug@!8DNIGBPj~ z*u!TBqc{adQmIReR73S|vgGA3LVe{qc6~P!KbZ_pJQ5g#5jQz6M^O&@zR8fF8%l}~ zWVd-7CFJv_5mkrVB~U@1HR`5Sxe`PnL~CXA{a$6l*Pla*h`dijgRyxvJH`0a3mZ)sJ|(QLDRZ&{$kRCq@{KEWOh#2qyNJvCHF$SU-irEZFkD2C*9?#da( zY=J3yqQAIteoWgF3!}^0_igfk4h1+|u2^|pd%ZB=;2zioH|Ua7pWC3}PkkQ~crPDK zhJ`No&=|u%`KLdsk$0}j=Om1AJbd^nKlT3i@pB*f7+o86fHiCgi`7ukqu2pZwNl2=exc?=F;y|bs+hKI037I zMAzl8Dr96?P^)JrkoLwBwKBEByCd2(I`fS&l!YdmxuPKW4vZ#_x}s3}BGD9tB#v#< zaJIhS-qDQ8dyEl+725ThXBJCLd&Va|^blJ)V$rc#N1l4>X=d>lVbnH>m)2_D^red~OVY@ZXI5y%)W`=}w3ab@$gHOcJ zBRSdG7)$f`5k={Uy++hYiUgA|E@@bKQ7HSjGj!+o*`7bT^>lq=Vf3l^h;DKQztL@n zMVstc1!G;t!^c%W_GM7UthLGscUkkFVE@)yKKQ{8^T7{(c<*^KdQFHC!;rVJGr){t zsKY%rF&ds~3kyC{h~Z~{=I8jCfBQiI%Ch9>Xocw$ZSr&>@a`}DPx)=X?MtX@N3$Nc z8r?pGG13W8r*%yH#E<{K7z64lFi3`7B&oo9e75F?e&k2^4gcZivs$fq@ZiBNvDxfH zrs}U6ED_z%JkW)nmtT6BzHc#?u;T09{dK;suG#YUzV8Rd@f*%@`C1=;@e_Rf#ZT;6 zBhxoFz-tLcrQ_;dE`1_$(4sly-+gbCD#GC{V}@YlRRKE;D2&iBvO3 z*KR;ON5=~`ttWh^y}jV>*;}}CvLqQtRcxti$D&HaAh6wX+67YSuzpME zTD8PniJKk6ofFzuU%@(IR+sb-4gLKKWtOl?SuES0=%aGG6;2^H?-3kbAMnwr%Od4> zYd~;BWAIMTEsSC2N`keBvqW$4B%0o1XEO>{BcUaDkEs?kr;l>Rh+3CEcw$lpb8Ady z@J^W2({FddBm>;-ijtGN&jN;IEvb3T=`Va3o`B!+mldXaJ(W>!(_Y&;(}izfbgYxL zZD-7tZRs){%y9hB4p|At4Al7QB%kWB7LcjWAy>m3qo>Ry3T)8m^Dlkh^Z4N@Atjm| z*8G8=`2b)0weMj*n=!JoiIB2DbU7+;*n9?S9bp$FG3lQ{2qEz3(IZkyoE#lpo7Zx1 z3`D~_H`@&%PrlcahjZOIw^dxG*2um!bqL=&e6Pzv0)vIUvjXfv!EsXr*$@G?GeIVT zWYUePAiObr+zgh>WR8x1UKP$}68JN2?%4{zdi5QAx)(i{A-T&;^*1%S^mE!$(n6M{ zb=eo3wRazKI-ZOQo-sBvd}kUh8Q@p}6A?6YIRuYL)aX-ZGXq31S`Wr5jgU8<${Knp zsG>4M3O$vXLsinJpbX)@qb@8>pRiq`_dV5e!TncX<@B*(_22<_@7<%EIi5pkw;Rf+ zfdnj9#4d1gddkuntR%X}4YTL(;fhFEIHW9yJ|H2|U2KU`D)iNQEw(3-SXfe7kY+Wp z6?}+v!P7@AESN}$g+QiOicV?GT!q*5S7^?)0F^xF+^mckZVF&%}a#W^$JE%S9Jw}PQ+N%94yx1?1KlBv)Gmd`eWd#N}P?`DlGo1YT&jjZvXBDn66v@&wJ+`j!F=CUBMUa4)0&#|rdiogYy{GNH z@`aANLqwtwI3`ppd_Bk8n%+a-Gz9;c+9is`g4Mkf3h6Q1GuCZOwd^pVqbw3dS<>gw zcx!Yv=pg5OqQt1&8EYtAO`km0IJ&;2TCV8M9?+eiag)+_s6CM|8Wg$ZXDG4hUBw`5 z+OLoXxu={U^f*aI-)WoU5>>&;JLtf5%02z?7F?j9}s z*L3VIMb=@m7cvX0EB?2^wO~AT?kK

x9bx{#wOF;}`2-SsF8m`>oKd;RtZjLCwq|vD!E$~=*fz9}wmiBxMJ_y41+%jr zv$Pt4C;H4~3B3)N8A!~oLuZMi7Lg~?rw$*~D#AvsBV`-2a( zG5nlbGlPvMqRvTUcRs04rHvcEK+`s04MkNw*){T5*Hy)Oy)(^U4^(&92lT{O0VdYs zv^wv=O{X2a{pBW`vc>K!lWV$ZQbICg@=Z(Ra$ekZ7R?n@PlR1$o{Uh`05M`haRKf7cMRtl_%8{H?c6Ei{BF?$p z+|Tqz18HhZY6S=hlaqOM-%vqR6q#N}BHnunS5ge@)yD3WgA~-tGD7eXGpp!)Vlj8r zMPj*J(Y0&V0haRxF7<@%nzNVgGdu1vuAu1yX}uu;sV+Er_D!6>@-ndxJbdw0>e+^R zUb1}lIV!+iTwsn?Y%Vs;Vugv8*=j}fP*;-uMv3UrinmD!J`sGPZ+b$26oljq7(+-x zSKVW?`h5D;e?YkS1nKPGkWPPr7|yVga2CWD_~g}BxK&GVesq^USftw!yAFwgK17V& z6-FFN`tA6ly#+5R50gWO~cUC3JVm3y1XKQd0fTi}QKchfUWuR0vJ z6Sl(|lyQwGGZF2>f|+Xa!&h%~S!|(pAKu< z27z=r>Tpz2Cf3jXSYGCV8|Hl)gLuqT>ltjm!f}PiGL8Q`@K9L-A3SFGdw>R9h9n37 zkfZF^2mj!4_Yru97g)G_s9MI%ryR+z!Zeo zM}lNBT~|Vk7^nGU=joWt+`_WB_iO0S zU&No?#{{Jy5)2d$T+Z#ZnpTm-=RI`i5{W5kB7RD2H*00|pro1|Q@V-*p}RVh4z}CX zGa8VA1Dg0DYv*#iZQ#OfwBbW=-|*S)KKl;nsX$7Hc8ykU*jX?bIsX5RO{#TuAbmA=P=th8579do4a-96&`;_(0| z?#65~bk`+^PCpxuc?}rtdSNw;VGg6dVpiXV^n# zM#SnrR%Gts>~rtAK))BC&%I~Lof#P!8L`%H{nl@(cNCc>lg>ig(+6QiC3vhq%Q=)_ zw{q$;C)Z=F$L7+Jxw18+>1HHAQ%78>8%1XvbepCoP-7s3K+{B0&;>Qdpmu^Wq&T$* zI^}j8qSQGshKSMX!{bd>*ZNrFvC`lRhwrab8=*7N_4JB0LX|MiGHw#( z`hJRDk1$x#dPUObsgBe?=a2QHpK-O;|Bx$N=YR_ z>q!~IxM}d-QS>aKju`I--yh|OX__ubo`VLEl6^VcsSaJkg-W$#$}UVe8bO{{r5 zdim9rHIllG$(S!O$74zBw7nO)7_Gi^(J4!6F7~kG${km4hl;@RHXlov!kN%-Zm|Bs@1%0;ZNtWxMpYA>vH=f<@X-fHK9-AghGi6w1ehlWvL?q%eE6*Bp+Iu~l zW?P6SlMA|-UH7`R&pY=cMMNAXO*I>5V@#41(Fma-)(K@2W^X4c^xg>rb+K$ZB1}pO z)fq3isOK}$;cbC4hPnzgsiCw5CUv3~&8TWZVp0nsC46CNlIP^fQ`nXLtayW@A-$C~LOMXK9mFxXF;;3~ zt?sWN`TIzkY!kK)L#(mJkxbLA56PJP7%apI)z*pbskCKnl#62_3UORxivfPHjxG8S zMohLgX~zExl3qJ2km;iO<+f?4Q+ML&YrVJxw{e8ipKs<>>-yWutEOz=Djl?yvdQYh z8A6b(5IX-N%fh+yPc40VrlpzPt_=V?Gc7FG(zg|_mg&ZqkvMhBTjN`2#ZE8N11LVsoP_dmYBva7aKC{+(cSfGv(^KR%VZ%*)&p8IhJR~Xh-`b@-9kAyG|h)V=BA=c0@ zEvDyien{Gm`14lTchTic#tkQq+|SmeVO(3%q$W)^*uOr&CQnt5*<_O<3QP+8{uNRX z7!1G`7?VH(k`v665$YJU+YaVt>AC1jiAk)Mea<=OT-NrjkrIqX+Z;P_f@)Ifyp!cGXqzvg zisB|GuqRdr11>mlE=5@|91n>>*#g$?Pq&5);NI;)6ZBP0PlSsht$bA8 z+gsQ)HA*^PU=OlbvmQ)p4WilS&?;K*5|5g~>{-w>L2s~5J!xo0oB1NZ>ANw#|I_}V zwekcgF-|=N$Or|Fh*oed>VQ}cQz)(7VU3UoNF;AWR%zeu<{fA9kenmr*D%(hE9GMH zJChs@?X8nEL+JSdjYPJ$H`%vufVZA{oY)LQSnE?J==CaG5XJ%eg~c{CF$hgE zh$#p(R4FnEkx?zwjk4$rhRLwuY(m&3rZG0EW}~rfxG$Fq zPY^>*9O-97Na$+T6V9_xB2zo8o?9>6UL<2UZwoT8z1`^%Cd(bgu3D5*L{L(-}1NIaQzo(nmCtF zwBs~PJqZzb^rOF#XFv0qU|~ESQIrJ+sGESXmQyEA@xm9rh+A&C`3xQG{1rqRuDId~ zUhsk!FenEYX9$fh3dRZB!!17Yv5)dsZ~Plh9NSpRj_wqjb3iCbnkv?`$0R5U$J2iN zhxw{&uHiSI|6-0EJ4ymV-Bxit{bTMRFhGpq{BzIc<-h*|-uRYldB=O+w<9_Fq6;r% zeRUo0T@Eu(V-7ooMW@Z8@*fvobP+%H!#~2^ci*i#Va8&dstnwI#~u9Do37@x5=#KkbjI}UBW;02^B>uy9K8bJnrf=a7Ui4z_ zy7$oBeYwK%@Bh#5qG@XW^4h-v+A6!VHJKJ#?t4es2YUTJ-}xO+;ya%71g^O9N_u5U zRoC2m=sw>3mTUR&M?TK>_V!ZqZnw0C4&~~O17?&kW`kqX1jX6l)sAmEuXAN(z{Y4Z z&qtHXb)-FSO0&&5i*=r&98fp43c?Ctb54x4n8snEdZl7?Gx5&0W@#7ql>{Nhykjg~ zpa1|M07*naRQM-~LaWEd5HYqjVhmzqhkV#HeN64`1OXc%1+XN7ZE#J@-gTmAB7#Bc z2{9(TjMU?IkQ%5X1VF*9Hu|hT^iDPSQ^(blFeYSJ|rnrwI^i6r9~r9_HQtgiqgq&kWaiB&^t zHjri;kp?8N2&z)h%siWy)iR4jWsyyXhI^z2&Pn{V7!TJ zZz4?%g(Jni(igtOq}Q*Ek2GzAUdaoe|2(dI;1#^(+PCtl&whroEP2S4SMYt`{oOqL zs;l{xXZ<>N-gVEO`UYwN-Fx4?{PTZ*2ZBnj|HM$iaRLPZkKfb*NYP#R-MF|xkC z#(5R-^j@mCveyPP4^Pc>gVm~-7Kq8U~SOnXMg6W`RSkeN&fW%@8k8ae?2Ep zo@C#FgFNc%AITrQ=tcbTpZ+H0G361B(7Y)tKnIfpjq)dn?w zT1K@m`Z%u%)pThMXP?w+P*lQML)q^!Sl>r7x$Hp_CZkFhK_8G9FwF!>0c^^#Qay{H zkf^l|mlsX-V6E0zG7!aL+jw2A(5;baHkgsl*;m~=I@>Qx)Wq)RHft)O8;;3eQ={j~ zqF96_tKRHV+g{TEUW8ONtPIvLQKfxOY*eKEC53P37bC1SxW*8JCxsrSfN>KUHi_-+ zicuA`o>7yi>#PBZ)-P(3QT;mu&18u2k<=JMJ;5|v*c5O^wEocy6fMlNNKG#1Zdyb) zvysGFLZk6x7UH}{^`uA%n!3&#SVOgWglZ!(xZnT}did9J?s*q*^Z$4+_kZz@JFhX&);|}?MvV+y!JJ3;KBp%Vr?|uKfkw)-^ z!(bS^;#EB7SAU5YJnz47&pn6u)Mq}cLo%y^$#gU7;%1=b3Uc?$(jg%bL+o~jMbX|C zR-26-sZro4jpxMCV|@KLd@VoylTYPkFMl~it>I!3ya8`D)+Z8hZNm1#9nYS--K?B* z{N&S~!qb2Lr}*)w{1hMf&_^}!p2cKe`^Go(xVQWr`wtu-z4GBkCq*1OTzXA*E7 zjHIIy4G2OPEz1Bz1zK;&Sgb@$0*}!+k@u{Y4(mOU0MalTH#Bu*y&SMwT1uBR9#to- z2+l;d>xNoX=W$>i>%BhxwLY%z7*2*9-`rw6*1S83V8t`349)%?!yv@XAuDAM34w78 z;0v~!n$67#8yiEmMl}?k5F$;Tv_fmLj2dX7!xaUwiu4OltR2ZjsE0tK@#<(WCLtzi z-7}{Mfk{f5O5_-+F{-mymeipp3bBeTP2|+6Eecm?Kz}@% z8mF_1xS9Dk_ji>Fdf+9O^XSJunwP!e75v+0Kf|{?@!NUKBOl3a_Z(4}%kF*bXB99u zM?+rv%0K4E|KpGIYtQ&Oe&ct3j}sePglfX6QyMq0-NHCyLBSkLZl>2cP9ifNPHSRm z%t)*z)V}VGf6cf5yC?93Cp>{qede>f_IH^=gO1NsD#u#8r}?)y=1GL>Z~OwUf8(3@ z_1}0lAN%-6`M~=>1er}N?{h=1f>n=S@VC%?ge}zH6U|lhk9X1tV&l6up8KV_7k( z!`3fLihU(zufPs0Wxt2@g_f!DP_CAkeh(=NnpkuE&=GFC<32Vvh8PRmnRrkKN8Kwm zo-;}KazKcxbg;2KW>g1aau`&%ubBubs&PTV?XFmJ6X=SC!%*`^D2=L+dPxt$d5(~&ePrb^r>2FdBCNYa>4oM@~{8;LFy*bG=W}Oa>>OP(q9>1 zt;_69;mEP$)OC&XzKij6GF!Q??KNO#VeJ-)Gj?xJO(87RYowWCdkLrsDp2Y@r5~u0 za}yvLoK^5gQoz|hy~43_&bj#WSJ^&sg3<5#$ZbBT#Y2#QeM7ZeDX6lT2|9XQp4v1g2@Q5^*u&61ZW&jFbj%tf60)^m`?1 zEBhGuf`Rv}lqD;Jl77FWTw9~Je+|>KF!1zBL#(wn5mvx?T+yTMm(($_zg)u^!{Nh+ zFs9&WlN8o#8sbEt?}^6K7>Hu1CpF_L(9}@{ovmdus;R1ow-C$#R?fk>nzUU*Q|Y_s z)o@4v!4svyxk7V>(3~V)`*MkQr|+>tjWd0Hm4f3OcwZnPb~$f0p*5R~!HO#Mmj@2; zZNK<)T>N#9;P@@~aO>y)jlNsu&X0eV>)-J%jvPIXTUp1ft;6=-=-qqVjOG`hWeW!E zzA5cU>{|$^4Y!B<(2xEI-}Bwy$Jc)C*Kyh9mr;1n+S(ew`ix)V#v5S|x9qmnR^ker-3%Zl6WUR$LEYYo?2brtXWmw#cny-i&; z6lIU|&p!u%k6-sme(gEWp$ZMom~H`D922_n&?<~6rZoT=Os{ zlL^O5g%jf8Kdx#n5H!hUW#)92P( zU-T-vVu|^`loDmx2P|9L+sgd3j_-W(llb*#J(DZ1d?402R#sOyboV{{$WwoU+wZt% zE?%}whWBuaG>5tDPgo>t~Fd1*-tW$T?6Y~gSMedFo-f`Kd8KUiUX z&}X&ivE~P?t@l}5UuFH^8tdnuLs41?BV0;Emq-OTFL*y78jJ0fqyW*DSYJ?&$26Cf z^!viTwLaU!38oq`v6k^>g%}9I5=&22S2!_L^@OI5G*zOCiMm!@JtKx-3;cx-X6>Sf zaOvuPZu;;$sZMPXMewGCvZpB(enss^sep)xRhDO-JJuN$M$U{mn^ciI#;AocO`h9E z^UqpuO5X**L~xG%mt2lnS>?`;e4O!c!u_}2!Mz{<3`MBf+S+98;!D^XZ9<%3?4F^W zRnn{4Ofw00i^uFCp>OebA_BE=`)&8~l9#;_(sVIdTkUhr!yd}ZU-nX-_Ozei+0TB? z86mW}1kbD@&|N19YpbjH!V_9LH?vTV2IZF0yQQVmDvUE6j(Ohi{vNm8emlv6agJYq z*0b2RzRoZG(l2qxq5Eb^W78$%0n;pdnTL^*5peJWKkz;5TO07GM|>UEJmjHZU{Y1Y z(D2JY{|kKh!=J!8Pw7wd_}V~pSH3`Hl6t)!WJ>IZKl)+b_O`e3%fIx?+<4=S_`I2v zWw``C-1S1V`C8rcjR}ciJ{E$~)Gxd2a_&2HFLl#QA;6hUW9b~qV`tipp}lOrW~Vo| ztsNAcP>yq-^e_H!6(`QNU&hM#}>f8HUN)VAH&bTC7tI0I(bCGGCw z-L=|}^A&d&&KVP!ND`y)RmwavYmuI#H(1A{9?@=+CYAa$Rp8j&Uu5;*K~~ldW@#yp zFA5|Yir#>t^w`qtlnf2cq+**yvvEvsOLSpOLRT(4(AHiiUBLVl9iPe_Vw3U=@kr|XRX(xKj=}c6`1o^2z^Hw zkEq5cahVCXGAJm$#}+-DGg$AbM>Sp|CP0*i;1g^6*Ez4MnS}dUp`ac&^j*Q&fHPX3 zNXfB**hI!nqKc6)PBcxUYmqB(2QOvyvWF0)PmG4iaFaxXT{{=Q|2)JNq_I-HO|aPL zP=V7Kd!s`ll%;4fN_9se$|U(`YX~u~S;o*`Sw)QJ;KdiSd2$0Uf$dYr`M0Ll-&*&~}wTGKIc$6a@E!!5V+V?X}Gyz|}fAw{9zAMlyaUe9%(`ZUHk z`bDASih)W;Vn` zs%ylllCyII%xX#9G@6M&++-_MOop3S>v7Jre$Kh{*Z1RmkD}1RZPjSZWVFp>GDMOV zy|YP$Lfd*@T2Co4!@a<{se|Z@!8k2-U@TbYI>f2oo??S54W<^PX>h55 z*pO0WurlDldFQcl{}I@(iS>j@9g&{LUn7mG``RNOCQLI`wqdR z;=Yq7Nt099!ch(mQuNko!URKuHIZln$;M3O+GP$WFjhBeElDpbpJX)1+o{_-OAy1# zzVrCT@BAK)9=o6G-uo}ec$<4a_c^Zo>W6X1O*d0l6AoT}8MlA_X1qXcN(L+IY?lLQ z>g9b{XnWd>bg@aNU7x-bg=W|DJm%5g$e;YtD|p`rKgf$;`Vwxr=~lLfBfNKcTLWxt>-3ihq8aqcBomKQS5CY;KLFbmN?(G=(E|eiaLsnlqV}ct5kb zPP;K67bSv#Oj)+mdzpTSE`v0yMkEB9hFUf-){|1i^m~*m16|BSkPxZ2Hi^mNY>9|r zZQp)|)h6S^TZ~SgB!rr#o?uhL#5xOXCVi7~OgE;8vvh*0*5*7Wt7B%37TYs`^=67< z8gM@6xmgd^V4TOe0^>>$EyGe*YBWu%icOdB-r!AvlL=k|WzVv?wZWvKJui)(|HFDLm!D0~{2`#`c|ze1nOJW>kX_>f{L4Lo(D= zO>7d994q|-xBqe;@HLO;w(G9rjhQkgGxU32ZV*YfR8{5HP%@sH=)x4c!=gO|h{W_#Cuf5}A`^0>!7mN&fN z4Qy{|(68U?8_Anmwz{|D9%4y;ai~53)DBM(6;a7j< zFXh;YlY8jx&L&YIoPK{=RB%Tvsa=}Euy1W2S6}lm?!5huYz*Ytk>Jyx{yeYz!&mWw z=Rc1S!xUaU?KyKFroG|1>psadp7Bhc{p-)-agX~(uDSYZ9&qU;Y@9g3l@GcSXACcY zx)@lc4fECepV2;qfP8M)^wek>z_%aRBKYD zF_`FaMTsrEo+AblRn8p}MjJ!!y6NT|1Bxo#85+FkJEgZGm?(&wj<~S~lQeHBB3g1h zdxWL4oy?VUnVe+pbgYa46Nxb(VyKA3)KE!BNFd~mT#z~;)-f^rSi9ok+;!WXY~A-oOdLP%wicF}RF-7b%I(eKB6Q%FrR|~c_H&yzmZir(A6k@X2 zsv*T1^S?Ujby-`?lb9`+(6-cC4CuTLP2i%7FXkQZd>7+M&8I&339h>8!CZFPrGyZ< z{m#32+uQ$%|M8&@apc%B^o7aif-_?0xo4P+Lx18EpX?S=E7KUjVgOx5Qe)ohrb|xB zWyNp3^^3gZB`@XZ(PMi4Y{`Le%PqI?+rRbOY;BElc6@$=TT5GMiL?^-7$vM(V7NWz zPyXc3`OGIjJD1REFo?C3)^qng_whTw`#hfh^rz#j@5aNxt|cGZ`#W;~QJ(Xgzr{U= z4nY_DGdKq~-*g+#dCvdCvwroNYN_uS#k>y95Co=PqXp*~kH);2sUW@!PFw7(uUh^ypFk?cYAjrI%j<*L`xwvpZ88^n2WW*IitH z!wp$Kue~{o2>jjOy`8P?Z4MtkLW*Guw(qIwSSArZ{Na!Ci@*2`9{rd{@hi{z70Q0e z{l`!6(NBDWk6-r*?z#Iuny87K?fHwGL?}_`g^4o^?snf<7^vAeTl*|#-?!Ze4D<6{ zJ7KNH3YgP7OmwBmXRAF*t2eKml8}f&aNc7`BrBNAQ#DDCjn$ae8&*|-ptlth5*s?R zM%rP|t71-0^;QGw#t7CsthIP+(e+l99K7`%WQsAlj|$7iD2k3mQ7;dpMdx}YuI#Bn z86pJDz1gS}$rh~k3RWA#sd5W@j%C$Btj266&sx6(3B;zR8E#^Yp>!TGhV4)hW1wyl zqfumREW>e)h{eSMk%njt!5BgcIYmol!XyC)E`Wm;v zXPZ7mnOQB2X<-rJ_|X%*_r3350(m5wCh-3Ee{gz}`5l%S_*SDs`lB&f-Lg7634?W>stWw|oBoDFhYl%~zVO|#S{O~HDgk=3JRa-lGI^nPQe+6 zm84}?@`CAoK@%HNutWmM7dUGO6G2=gnZR0qh2Hu)#u&z%r%1lQuC7vg%jTvaCJ~#l z<}_N*C^o8-=be_8XdoF-cxMDzYa6fel6eWl_q9ja6TFRZkWIUlh3;o@_#f-WIBCoD3gdt|v z^UHdakUk+ys0o{3@^rR>8%x6B6t*vdM2vyx=>pbJ=GcV9GIhxZpL-*P3(U77j zD1FH|oNmW%J(|{d-x;@9Wc9V4E=<{YVhpi`Te47Nw7PhAXEl~!b?(HdW2RJeyI={M zd<~�+VVCPTlGmsC>z-OtJwgh3r^o;RAOJ~3 zK~$4S)Ls1?lML22kkn%gG4EO?rwv%mfsq_5!kR86!&tTW+mrwYG$Ck7?HCCmU|oSR zSxzXlwD$sEfN_?lnvh~d9ISY+-kLFN4!7v_OAH03iS*ZdOeQrI2^SN_tAHz^L7Jd- zhkULzR$4|?pl%|Yql)d#A>$@8MupT6zcGg>_5GA0j9VVpB<7K!P^+TPk! z>qZ3cGVZHd6x}&zuM5lbik4od?PpTczK=F%JxNTPvvBf5~MY%nApctQ*q6FN_)?RiSATEMh2tVmmaU9`xa$w}*?WE}%o z@3GzyVnj$qvEwG7HW5)+%JwxC|c?d!vEMByCHLLaM@ z07#@dVv{9#OA;*>SdSYfbPFFQ}1E*)OOZMuL{X7XY$PD_$&>E z&i<~=A29TKeYPhflGO}f$b+@eX1%OM7-C28R@(9a`R@YNq{eyO<#)eN(=C`{20=8t*}?8=KL%7^tKC@gfh`2nK9jkzU^?0IoJG_U zcar_j441f~z=Q=VrfL7%eJqU0Zh8wDF&l%Q5uo4YG|Li}=PsYy{f7^8&DGb;ZIZJJ zAMMY}Hi@d5u(7p)FUvCkd^7#pMMmdz&49k>Ru^1vT60xT6^(j)#DtxJD%&xG>E`2d zK)-u_r|WB)s&&tPuicrB=-jrI)WDg7uBSP_q&cTL37HI_3tEg5-MmFmDX4%-OB;y# zPD?V>GRcr+hW%RW*<=A>B95#it+L+w=b4yT%KCE7dEHC}Xkjlr))u<(nwa4#x(!M) zOm4kJqD30P+JdSc(?ml|5#xoXi445Og+wzNu^lU;KIj#2b-1f#eexHnp1}mEXfww{u-uS0m@vT ztO66U-ePSZlPs~?22%lbCOfsp!}2w>HF%X#myLl0DZjUxZUTbE6pnJOL?#Nesyu0= zEIndNR@V=(y?GpiqZ*C~b)!ax&C*n7f)!@kS+MDhKIkN!rJH1aGurjzyTy5u?z$VB z8yr7=V$Tai7dT(UzGr`DrjMfiT~$?BV^jol;hfgCp1|})KAV`q&NhYmbOTUggsR%K zui^BLPgkNrm|u`*J&M-zo5mt$@WS2BHAf?yo;)VO;4SxG64)y&)$ zGp|&8%);01vl*srdpmo#rz_z;t4DbHCfN&HxUSCFCGWMx+C+;+wy{McHY-0Th0IJ3 zSMEbPJvvb@R~%x-AT>~sWa|BNRiVV`@w71@!K9R>fu`?yl0*n?iFIu)lqX3@&H@e> zg;Y0c;7NoSRf5YJu!Y8^j3Hu)VkqfRq==6?3dRZ{)Hv%H19cPeMGx-{DFh-adTgDA z5J|>R163nT8lkEhCc_Fb1@&aCNxkUeZ`aPFch#fWJ~igS zwS_*UG{~s{NufCt!56sxIS@`koFGD{P9Zb%q%+#O5l=W*AVFbpYucPk-Sn+f@mK-s z5C|!gtxALSj%rll2NAncV(Nmj=NN8pQq^N@*a-=rsqLM>V3vG8bEUJXQrUhsA@uqs zH{5VT4kpWKKYP00&%$=I-kHo;%du(j-e+2~h0K_1Z=*f?>`T71woJR@=ROO}Y23l= zGMA@>D0Z7tYnQ1ixw6HjWB0Y7Lu*C1W^9}}vC4OdP9#hw2hUv5fSbW}TIi=cVrJp# z))bk>y4>t0Y-TLy#f2$DT^3E0HP&P)63GSq=BG;BtF-}iv937}H!&QK389(mOM73l zb6~fHIEoImWL4|MW308^zrD7lka6zbva@tVC$&qb@M(K5i`Q;{mRSbi-Uf5={!*IO z>+E`LEY@Vj?ksb#yKR|NoWV?A0abJM7-R9izc3P=G-B`GDMfH#KFsH9Fz5JF;9*HleXWrayikOwcNiM~?Zd=)RGjL55 z!Fh+XZn}iWILCzAlSOIr1I)o+WLjQ4pJncT+j=4q2#WZE)eLJRLK}HBOdm-1=`?S@ zw-YSX;B1-k;q2|0b}YcnoTK$lEK~TW^V`~cn7OXWp08HZn2D3j9s?S;0wftq=de*b zW2e;}nCTWvPc%Df3ozqiGIL4_t$^ut0^4bBpo67m$uo1XaS|j(eO9|x^gX+_(<3om zJYZRy_kgCKP1ysQJ*I14;ybZOAnG>i*<-MXSCtGS1~Hh3>im=6$C9>CkQ45Wp|n0Bt!L zbZS)9n4U9CHcl~~G}xjbilZzC*rJb2v}}dxN)n#Aodva9K?3dk*_gP~Hf40^dAuv= z^-A>?_PBd4J>M>WYZs$gqJ_0CS05EzUMUwT<7ZR_V2W}{XW`B+BH60XFa{Z^b^=B; z?^&Us)}v|5cgqsbUwOp{)jSpeIdfyL2D(6OfgW?90T|CMy2Ta$5h zS(-q-2pM9aC<-tThy)8_A*2}tKJD~E$P3E!WYgHe`~sEl%NhoQ6*VSI&Tnd6vxR<6 zrI%*UqxYpkqRYLO*#dow?M&X%^zYI=)upFO(8(n^tD1ZNe>JP+){PBloo;JKkB2f9U%q4Sx21|M)bbGIfr*WoGtOLPw5?f3sNR55ibcV2J2go zB3t@d{ayWK9EG#5UM!Gj*l_T9IVHgCte8nLCq zk=AFUq*1R~oWheyNU;F|S^fp*`^0L3jWrS`kTlktvOS^imp3Q9^(``a&2jeoEH}+#84@nny4F`DL}l= z52MMhDG9DC=&kQl5~XJseu_A>#q`u8YFAt43`$9oEqjv-@hL{2;XjKBj$Y4G79~w+ z=nqz~w!~m@HdBnerLam8GC{B=>V_biCznDZ(Wumr(Ve(yA}MJ#*w92x1a5>>)jCg7 zjjZm+Jmhigd&oCYpWJ40{~gF=3vqp>nH-6j!ZgV0JjOW08glBYvfqeF>tJ+*Ll)l6|Rim(yXlb>(wK>?J{W=59&3l?tV_|J&1!G&7A)Rrqw=fN&$_8b> zM{JrdkhUz5`pYA(%v`%e9OvQZjuFOmcFlskiu^9dpmxICJFd5j5w=v#T>k<|7!HTj z)qG-QS}-IqV9OQ!>Up}+)FV<;;f+=KC0o6+l$uOr zuAZ)eIwgFzX{JfN;GN4Q$J>9?jtUy~(sTxu2~r}8B_*LO48CyGb%paKWZJ#NKvgGf zuZKg~aMn6Z0iYfOA_SwcUQEght|Lj*3aL?3K_n*Xsv^`Anr4h~j;enV7d-a+i059; zksH6j@cNI^9KQoAQ4y4w)KiSr%*4@o8ztmgV&Gg)E7rOdBqk&bF)3)g2RfiYqSi?2 zVy{5L;arc1V7$`YQy_~R>+@DmRO51Pu*NwTT}n0DV*BWQIA;klb)ZEQfmq`UOR5sa zMpCS)>jqPRcLPkYG-0@OUM{vhZAJ=+v{9BN*5+Q$F_)JDSY@^KdwqOSEI;;3#L5@* zFJ{>!&grC%Q7E$!erCqe;@{_eMg6#&`>V;ZojKA#i{FYubf?u-+oekeh*-^$aA)fG ze6!QeYCrNlwAy(h`hw9a_LAW{nKBF)nPDxFsVJO!xhXR)_nM>G(sgI(rfqz!z2Dib z;oS4i&n!8#(^ii-Q)wrY@yWHdRjQ^sol^uX-=y~33>}ppfytzr%gdWNjJED#N-b3S zrMKM}rn__zjKbA*U3bZe3CPyc{7dc}wp=CIQWr}Xks#DI;H{3YO#!NHq7|UfG!2RQ zoNdf9LrK}Iu}O1sU^=hb^(7?;P0FzwGrh;8M1YyMJd+r*N<$0B8r8BhIhJIt!Qcr^ zgCwDFj=HHxF%qI+ODzjwY*KH)8;UINqw`BhF%eQkj3r4_9ln%n0yTjUg;>|b&`{Sk zu?D&LDlYhrr?Gz3Be?1B|CZr(?ysaebgc z;s{beSDWl%w_!Gyy_+^%kT)9d3PPCZd~4y*?DQC;+!EsqMZZt*P_C{JCF%x7!g>t_ zn%Om@uCZo9^aZ9Yan?W$gLBRyj3zWEzk-|5&elHe)3;>_h;z-76Z@7g%BO?e_S$A+ z0D3N)sn837+%M}oW{%36vSNV#DW~MMW^lWH@})067S-A-{d5!GQEqy-w%c(=H>dHW zVr6Zm{nb3An9uILVk{vAg^V%`7BE;z6w&BJj}6d(1dK_z zmKc$siJ~m9_MAeumb7Ehaaa;G-NH;Z?vi>22p&}>G30kCk1L|_9g`t63>Yy)5khRR zK(F6pT-79FNM?o+7h_geQL3}YBRQ~-(Ri~2tAva+)w?sI5TVq8rmhvDOqO`@!&raZ z_p@@@)f{@?KeF-Z4-nZvDdln@m*ztBR#(MUuiqIXOPZ$@NPp3P_ z*;uQcoXt!;$T>6rl+VyQ3w-$%W{#5`ziXTAC}l|@v3!Vay@Io93QxsUQ^W~ zJ10`m#6YIR4FOfvo_1TuB+dV-y?)yyt3w!LX+pqA>ORxvX)Qu&XX72s9@R~moX=EG zS}b2H3%B>HN*cL;c4nT=Fze>VWkK;|@qKHVgo~*Oi|Q1emqCVLp({TW`5a1u?OMRAb$cLPTODrU|hu@eg=3<%7S8DmiX`+uySN`47Wn3vrHO^-`j7 zBpH#at*(AhYzM2Y+mxrsR4E0ex*NI@RBaQ4{{9QN^x@yY{>!f9?k{|X?Ndjln74yE zRY>-xbV|+`P&ou(5>#6wNCoA3pJH`CgMA0tJaL$!QH*Xw?&-$6{P$mCbKX&uNpV<;d^*KABlnXT0MZF*kr7&=c9+9K}HrN!ea5x-xc;T(R@Sotd*LK)m zcqJ_?MQA}$E_T<5t^^@lg1t+}_L zam{%ed?oi=7&YS#$_@@m$Z%;>b)mf!Q+xCru?iCbyA#@|52w2$fYJu0bE}Zu@ z!vTo4?5!vSjwYW=hPep?Z$rd)Y3GlUOn&b@d9gyaUKwktg9!I6LC}t&IoJDYbzOb& z-+c`Ea=)!(!+k{fyjVX{j4?5WqAF#4;kPc9PAQF1L#!+DhC-SGhcQ^VN9^RyvXDUo~j zfhaV|vH-zeGe`%NRfWx0Xg|RE5;f5HVl9cSW`sr%f7+Fj5&}3Yb6=Gum92zXVYr8V z`RgQa{aq4mc=#v(iuIijsMZg`I*d6K>%v!P>jGOuc$ZaJ?M{QywH4W3hDoBaQg|I$ zH{XxOeEYxuA9(q#Z}Gi<^M^e6`H!*db>rbsnrgkm;hKCi)i@vO)uX{UPqms+tmo*b z8EH1AESDrcltS;U(W0HCO}F|F0;mRxcu*n!B42sh2+R7$w8OhdhPuWE!c3(d!e}osQtzbts>H)% z;M_%zTt^Ly=>*&FUyCA6S$UEK5*-IBCWAM=Hm$XabU!X=`Etd^V=k4Qt3q6LS}E3f zjt}lX?Hx*`pcSt4RMv+0r^Y%d1D;@UWsV}a>6}HXQdyjG6v=?$=YJc2^g8+N54it> zKVkXcJ+XW#i8Kb)d<9WHFQcaC?(_8I>ot$hg7E-Z~W?S@{ND+ zAM@AW`8WLZJAZ&(oYv$yJp%czYv{;?CbhrRwXzLOl z&{kZx$JcMNT+Ff7Gr4li>7DtOr@Ps97DkH36{TzM<|k|pl#!S7(?T%SUH1sBnlU`m zigdn*ez(S^^ZePH)5iX_VI;+V9nQsa0*>fV+I92OTI1|)!uz7uxGxb1D2k#g$O8P6 z7P_rt+sNn0*nq->e2a52sg|MGC(=Fg=0c|79X^|256&o z8%j^~6V(E#yWd6&V_U5AqB0jvsS>v_Pu_MUBaK_qhFFd7nV08jU4>_3?6icxm4t*i z<}4ditxGJqJaZdkB&{29iZWkdost+t5d1pqN^;*Gyh7O~Y1$(K#YQ6HI5yQ4!X1x7 z>uVp}SK2AO7WAEV8kIzW7m{Ej!V+rtk+=^XP9>yfNaBPMVx6z?I8>UTtRv5J(s3$h zS0$r#h|LSU^*Cj5SrK9^CFOD@UausuN|*$%6Py|14qt|&*T^3};PKmkN&fMBD8I&M zL&)~f%pqSwU`$ z-{Ijg;}>3GFdg&pd++e_*S>{4d&KFTTj!r^Pup1-xz_H`??l+%&Tp_G=`}SNqiGnk z{e|c4;)=Vdxd7!hF?T^VeeL3o(OR9`Yg?lWeYN99-Rnn)ZxhSfje2G?KIfg}U}VWB zN9J$j&Hz>bCRX1!n%zTozTPSTH0!`wC-s~{y$ywwm2lQ!sqjiuq9kz?g;Eyf z!716?%f*}|NvNulqR2%J9HgOElEG2psuFx6u6*msi-OcRmWw4S9gyHzE#_#Y84d?H zTTmt`TzdnTj9J^1{HK4x)A!$j^$MRQC^tl>6U<;w_WSY_Jd~m6r>=$R=Ch5l$C_?Z zfgu5{V<5MJG*y!L zD$hkaP9{@E<9*69r`oIe<*%IQe3Snc0G#j!Gm1J>jB>4q>JZ#DiDG-Fbu;DoC z2^&Cj5$~GcKdt6Hg5av`h9aRhDyGVsw0J?+N#av~hhbOlvbo!Ke-eNK6>Ip$?_2$b zKAaNE)_Wnx9S%oSWsb{Z7Qb(49*RUm>3u*vgz^Q^1s&dNPov2D_`Q=S+E}Z>5(jEr zJ06q{$(22~9uD(BWo5q7Ktd|Sy!;d(*a|`7x zdNf82u3)PKUKVLob1M1Jll7d< z7Lw;cv+1{~D=zH!Ir5Q)gCV2QNKi2yMK{K+b`DyfbBjFdIPo#Z3G^YJu&vK+HDDW~HCL zdpSRp+HDn)UJ%@N)`#a~Hvtfcg{8xbQU}O&$dB`YQ&+!l4D|gB^HuP@wmXO05-&G

2Dur4Shx&f5LyKb^^y}XwcQE_-WAfP?Gn}IJkZdf7vei5kzXQ}D z!`KN}i?J1MIFMM}>`_B-pbU_qvk?|yb3j|jM!0M$)M-wb&5cTg4a02!w3}uN-1?05 z;tXXH(oBFDLW&_*bXdGMsANDgnvkX$`D#g#2e%xxhg%doC-1yU5=@$*la$Jp9NxIb z?9NA!!7u#!Z}arQW9BDM&yQ(K+tD(T76~Bxa~HO^4YNBI84GQGHp7*6`F;09Ma|IQ#pzwY{095M++Oa@D+#aDTZ^bf-D77eNYgb@&z^j%JjXk&Bx6TE^oXumjjW-?M zop5aZ`-WdEUS0BWocDFUoyTL+jQ#yXR`V5Qp3@c(g%ySdat0DwS$ztXiap~A4_Njd8%s+Cyj&XW&Dq@VjGl9#_kes;#=AN?6+ zu|iLe8BTAKm0)o#3&8@Bk;MK-F#`_ZCrNol6VA7%3suAd-K9E zpLxF>JN{gJ28bnvH(&DedZzca;T>FUl7q8YuCN{VXkTmRH#y}FWFet)_ya(eg9};zmnV*~a41YC{NJ1OkZ4&nEn(IZlc(20`OA7|(pZ z#CG$d;-(thgR0X{y&h`;hRmhy=)S?2(y<&vq_`q{?~%M9WS??M)iF9C6vC5(g?wA1 zlM#BFQ6)Lc^*p$Un#X9%B_^9dI+P7^y}-E=l&f8IeO676&AH{XOwfk>kIPhv0;R&v zXe*CSJQfp_WG6(#PN7N}uti*9O&Ja?bC`tKms4ovsft1bg|!R@L!7T9eBdmY3|EN- zk*XB0hfLr26%M}oYnN$<=G@zxpzd-uWrN{7b*Z zul&xp`S6{evv~ASP_a93LRUT_$wOU9e({K&%wAcmKZ-5WZcNVPI)||(H_Qw5b(f(aTx#c~+NVm$CJAPkQk5|_*LKm$;53m&uo9NOD$E@XtCxR}LFU)c)lN@@~Ym4dC%+ObZj3|@ST@wLzK_($L4%jxOCV*;X7%6Fg?O1lQ2fCo~JzWjC4<7+5m*njCdcYgQ-X77JUbvmc2a=dk< zS_`iunhFo=97@ah$_=jl;xBM^@`$g#`6a&n?SIHW|F_@a-p_x^*@N4-`I24Rjxi%K zSK|V>jOEa5+8v7uaMpAG{(V-fRh_{1X+pgF#+l~@2L}g;dqu|8mn_%^>Fu^%1(Niy z0!7Pa-opmvM=N`NYu_#RncsL>+lTZa!Q^ju&uwc{T4@&ZnUEp2w)l(6D!7n-Jsgb? z0Td8ITU?;$oHD*8qI-OL4%xio)$=@OGMN(f?Fi*Qr;U5rSi7S*Jv-en*5Z6`Saj_n zs0Ih8O;aJ*wfs@FFbi{TeSpMk&FO3gCM0@l1wPi;3AbRvKYVMGj;*`rt} z273w0l@yCPzE}ehI^Scxs^%Y3aVRziBp8#`^W%IdT^^2?$W&l-P%=M`5F^6lyusx~ zh*cSEBA^Ik9VAj?sVFUGkYG}Sa~5SSc}UhyOp26KFv6UzH6Fuay&%noxZyPp-uhL{ z=z#m*|6_`~?=%V7CLu|NB;MneXB5kOP%h()Re;eo26SUzdiS(0Lu!xl@_ zV1&*xY;NmyqP!Oi^FgJGV{|D zUjO^Q!|)4VWcug{lK~`?jKOTh-S7N=6w4(;4OKD6tqaaRKIQ4t1(U-Gi+hhS%Qd%F zAM(HcPyZvQkDpMjBw6?}D&A+#+P%&7<$|6t=l3Q)I=q}4(Q5JY?@M>%d)id(d+^SCl#fq1{`{LqPH4f>x!+dRPKiubdMi;%p(=I zM#plwU@#bBjF44!87`V!uFXDT?WWaYS*r$8%cWUE-Ss3%l(KQvP-i?IsSau+xn?u2 zR7crGPhG87;-+hlMh8+&8E`!}@yWU{R;&dh)`RhE%&m`>P4yO>P}!o}+?w=aoSzkG2*k z^;LpPPPZ(mBovWzXkQTl8M4Gx5IVMYMVWw=NkLezAwawYkfOY&T2+!9o+UU}2^hg> zyo0JLQP$zTluOCd46RJq^M$j{S0!E@V$gA5np zYot86r$9L=L!rXL)(Mz2tt-SBqaau0od+W_?6Lcz|v0M+3Of}X|17zsB=C(gSrFFwvyaUousm7{u&a+(3H*&_F z)dZq0>YHpfZHuiv;!t_kd!9Ub!qux+fKW(n2kxr~VpB>{;GG}x>bHKAy=yl~vH@jPKs6MlXMT!ZuQ5hZp~0;KHIkPN zQyUT3I=VQ6Op5HfaZN;}r|r%Tb-_e;X}Io`midn5%&oJ+!jNdOnt-ybuuhRE7-&OL zd7RNwSJf6m2CEfSnPZ)2c=aY%zx3LRz^Qy#JoQ2UozV!I@97173ZAxKPC`FJ<$?m@91^sOuI9snFuRt3} zbb_)Ggd|eiDTu@)qk{v|VamzfTX+v;0W8`AL!*EEW0HZ!u9qakl%M~fa5~S~yLp4^ zXCHFz>nh?%CNHqtU3h|7Y>zZ4*eBY4LJRU%q9f?cTTZcEiHdS_#Cnh8LSl zSY5I$dhe*Jin6pMrklxg!C0ImPA&>z16E4!wpM(Amb(x-34RF?a(x@7VqN51xpGws zeN~&DJs)B#eOLC#bme(Lvn}^;$>;dqphgb}#j2_EblRBXu2Q6QsDsnmNo%Vt#I(+h zLdmtFq843rn~vCB-N#OnLBm+Om+70QIQO2$9c;a8@@kb~uy;)L@+*rGg-$M5%z>3nPp5x&lgD6xd)M zC~ag@_jLhxv=40OCKR?*&0KpW6^y;IVo5kfj>VaPI1B2$bz#npB0YKuv-bjbe)K); zyh3FIs%jywM-R%3Q0X3+FhP+G`n zgBL(6_~89pQ0;EK>`n(1W<~(PpGF)75~K>FwRY#&%+^49%bnK8FBdloYb{BV)bWpa z-5QeH*-*NS441WfHk*X%B}f{_)%+Tn5T4y^_^;9Ew^0!7(&F7J72-l(p^Vv3{I{YC zy(2RT*&xF{b;0Kz*ra=|BYU_f)UMueO|@NBu(?^r&#Tp%beNEhMy&E8#%1fBb6ZIb z72*vJUmJb#j@t3C3l)+e`BWIc?a8Z({c3_MOhw*7iSIZi@ZQi#sz3cFe|fASQ{QUtE4a9C7GkX1f#twpx30O1!`8qwqw<Pzyb}ZMl z5{GhXOhQIgE}>fCt2|g`R$$QCKBy^Wu_iH)C@6~xSBe|3qN*Q+3ra|MK^n`Qi2aZE z+L*OUgRf+XrCCZ+fx|F({S|)izxglu>VNQU-g|Vyd_H3|GK}}99A7!W7A22wJ>+;a z!n=}3ckXcKC+{&TE%(3wJ>LJx+nhdnD%40oc4f+M{CEE?)x6+G|Mt5KT!LH7s8(}| zVojCjcq}Ts4+f-M`rZ-BDtNSFmv%`v-KS?60c2UmXf&d#s;$TD%EA!aMFgqdd#b7; zO;d)$Va@yi!5z|yjr8SHeR2qJ8|MA|Jy@hXc-&Qeqq;v=YXca(lU%ISB%$xknozxC zGKTSF!YaQVTxZ*nbkPMB^Ls7}5P93W!DHS5B*cJA57 zzj3V2Zxj*iof{|nR|B>P?k20yCiGePdP%fhbMfB*R>eqT9pZ1oYpu`QqJhS$<_kkt z!t}QG;ql+jgRvrw6`-<&YBZ)?t@!wZ_wZH43vYalbULN*CHwnF*eh2k<_qQz9lT*r7h4&?iFR=Nt&Sx^lh=)Mw082J?0xHhe#T`9?&ZlGX=^zWdk%E5S zLseOfgTyFQDrBgYbzmJD5!NEC6p9qHe-pER#M!MM<7ab}%J87&Fo3s5RB#G)ZutjeIq!8wEP` zWNC`4DoT^_(y#p%H~;o;@bvJQ@BZuWayDBsP8Bzk2BBFrTkjpUoH# z_xL;i>3_k$|L6Y~XY-tFe8kN!zs8l9U&duAzw}@IC*1qV&w2k3{xxZF#$s)8#S+RK zT`n<|K#o@qWq01XihuiJIKK1WwiaA^Ayn-lyogf2{u9Z_cm=Jn-ceQO z>*j2$nFF#}8Dq%vLNvUdRx1ScwRHWD3u^|qUT}wJKA)o;OebR;jub7FFPvWo4WUuf zOw#ZJMos!MO)Rf1*4LKUU-yQTBcR`?CD4USKS-)JZn6uDX?k}!Ohl14_ZPj1Q6qT9 zQWLabBk~$>We|T#lZ{76Sv|{>`*&G9e8{VBeVvnAw^*D!;`l3HCp$V~a_u_K=4c$F zg9EbZVW7yVP{oS;>@meE#}+xZvO$Oo@0<@2eCNb^iI%BD;dQuo9W00-uw>p<1`KX|o-|3BJ@`3(HN%?}qX&3b;C(4W&?zPzq0zW17Z5?5 zpD?$cM6SHJ2g?&G?eXOTnI6e(33NJQ{P{6T(GXq5;Ph;g`3*?4^A zm}D^I@sHo*^yeQ6P0wP<*~w#O`xCTID69nxi}?!gJqO1VK6mYyKl)eyg1`Lkcd-v2 zW3gCeIC|?1e(^v1hunYvLvDTN-{Go)a)|mQX?B#R?@!8Qgq!9v??f8)Zatwlzm@Vu_C%bw?g)?XCGxlJNkJ$>MX_PC=v?;_;g=JDs5 zzI|lttu3*5&1XpzvE>~Kqco`zD5<=XQIBml+UIH3T2^_1(J3P6o>huli#YJGD%MCL z3f~Lqjjk|bq#Ech@-uEG;)+(1b&uxYU>}c1dsWvX+jf5Y^B^0vT(pEZ+p|Za;t9J- z{SYfk(**DBx!=5#9pAMM?~WG`?bmMmv3;0~%TlKwwGy~GR@0@IhK5kHC}P|ciiC{O zAZ2YFlgTk>x8CKQKm9|zuW)!~|LzZ&T)D{$Z+(-ue&cVkSgt7+OIGtU5(^5);9#HW z(J@uArZ_ueadJYwp5w}bloXYw;Ea?m4=k~QY!s8xJBxDiR`|H46oPULp95w>;{DFb z{MYVnFy5iegyYw~04C$%t#@$68D1rVki)fHvSDJaOs=&#PzeuflqU*IIs#W<^970Z zl&%0$l+#eIac+&O8ZeFTybq0N(zupAY)pd1qB4WB7GD;4K z0Cr|`jI%twUBbE`(SkxHH82?P(!m$`qkr;GDVGb%RgM{tIC$ereEuK&E{9)uliPp! zBObnc8=WcgVokAJLb;+?Ed^~Duucw*$_9+C-{9)kzDag`#Cm>8wOs7H%KpZMQ5)fA zjHzQrpLL6ybDrnSW@k*NQ)aW-Iq(DYBjmb*DUSIf>r7%yo6eJF<7@g80K*n{Pkn6o z%^_LTN(C2?sAG*lYhqxR7uEuGjxoGlz#1BabQU2U^})yQG4(C>-PiLPa)m8<^5hZI zy}e%H&}Z4krW_$3Di*$@UW*sqYrRoyi$`rSYZT&&rVsHKG~62e(CU8!IY!I58@12g zYpK?I)b2oazp1U#ZR$XTolBgn(^qQ_wAW}Ypc9e|Gnrx+o5Yxl$M<>nPyPia@m&AP zH?h~Qku8_(Ef(ZwOIGuzpmUs>kli?Bc>P7H#gh4>d*q85Wl^EMln;q;c^ONJP7L0b zQh+WBmxy`{uR=T1ptQoufTKnzI&Cn6jKi1SB)6Wk5C0lh72&NaaUQA|r%@>;NO&XV`Dfv-aqf|n*UZboC zLA0=zyX6A4EGW-TSf>Ml(+?7c<1y<;Pf$h0y0Q|h$_5J9q54 z4eS{)sf#wU#@d3m8%`EgTXhw3$Efg~Z!I@oNG7n>%0^fJe!lH2kizNKT5MHrSZ&X2 zN&?MFE6S>*#+J zFN|V)=R5zB`#<_VSKjzM$1lA~HrQi$e1-k1hpZM$iqjeSY(}MW{J=22mN49(v!0() zuGUnQ!`f1muF8ThL@=oE4k=gXl0hAc3FB--MwHg(FbTOW^%yk3SX5{vilkF zjZfO5plV`85d{a%X^e^1hYo_{A`8*gf5l;3_9mU69@3FW>~0s{kGiZuIsxGIUDJbVo7<8B%nH5kqo93CIeeY zS&?i=WfjUhl(L*Xy2tF%J?@UDq~imU(U@%SfZ^dGqwxXLo7b=wiq(qKhxc);Nv2oP z!;*n3gw=tPDlaJ4D|`V}<-vgVCB7BgvYZ!4AW5=vBSWsf`86Dl*`s?b9^J)DMG&>7WfOd&@wO6xPCCXZ2hO1}_-c)g)qp)J6s*q@)6v_%Kg>>YIrFyhdsH&v$g|JDy6?BCgnqMFy|U5>$C1fTJSwMk2bp3&Dg&7E=?&# zNNz_V7V9p8!+RgxbRrPfdESh*!`S`YmPh9_r8KkooWfd+(Loq_wwaaf>qcZ-w8l}Y zW>@I0mu&)K=P?HtU`xjDc51NVq64VAnKq$CFMO9}gHkXMP)(`{Z-kRPyFY^_(R5R= z$L5hu&Kaqpqm)BcYn&c(aN~2V=8uTu9A9aDkRw0<03ZNKL_t&vSK%xqnI=oepbW-V_%g>A zYizj?Gtwxj@k2<(h(lK%l7zwJh~e~*`NySdy znKP}^;N7rTU!c^GG#P@g1a{<0sv?)*XX1&q36+wlYc?G-K0IJPTR@>8+rwo0c)P&n zGpg085D}|7EG5rE$vc53(5i(*@NnDSI;_&@3Q*!1@CIBqVE@_;?)~h?6#0sx1m$yz zyaf_!?Kf@$2YUUSRLV>-e*Wm^*j4|Mm|V&XyFX zCp)dT*e)lGT5Gw_o%JjTaJN}++1r~k8VoKqjLWt*IKWmVr>CbTv2ts7 zhU4_~v_|mZ%L~_KLxk!AZIQuQyBR}iBbI0cQu0a5y1Ov&O9&%L+*OUH-EnyW;u`e` z=_L>;e(37KJ2H6~VA6<68m*%^b;5UtfYHv}~I(zc8~ z4cFb~FvT+R-Ui|U5lBjzjo+j7*}7pI3Y{dBdAVT$?e3DhxLpcRqBY8EtS#&L{)5D#iBM~`^JzZf{sGkuLq}f zQ`V*aebZY0G!=t5y7uKv*g`yx)N6{xie$Ra@wL~$F3F$V%`)sd#pP?!)@>DP4{5wHVUrhx zT_OP$Dpiq957i~sHGcXB8 zWm4+CETvMhR+5bDwA7d~3S&J_?%d_$4?e6*SqMK}C6!v0T&4}}2eFc)U^F_#6=h@# z1Fst1##l$m`I<19yyWE8Z7S!v`qnonpPumW)_Zs>0#8}cCU|ocB#FYL1N>mX;NXbq zwUIA70w$fwczyLdn6{K$_tcIq|*bYM@M9PB9w}JjjBok9oUr0W_Vpm`3;+6ox>WK z>|bLzPB?vdmwbMPq6=UNNc#H5ZTVt}jK1lX|RE zXrri3Pe_U!tvxPL%udeadhsG5W+u;dz-a%NY_bowpqL&o`N~%qy?TSmV$RRM|L2tN z-eP_G1H3j2ZoIzw2!Qa;R1k^mieK5(UvlMO8Rw z;az$|_wky|4ieq1TB~!`Y zAsLO?d+AMHO)~C%?@uU}GeB6it*fYV$9OQHunK3ZuyvK#%A(dwOq!9TBhmhsPgvU= zWip&ECC5mC^A?ZBq(gM#13%p{I!#E66?Q%6$=&-|CRnzy8)(NpMb( zv;=D%R0j;2Cr_Vr;#nI;JS~UM)@yH$qXDB_q`hwnapAE;XISf-jpnmbmAu8g;9WZ$+&c7m1yQ@Hc-iJ%X)8-@;nBX{hH|wz{O;{EZrr~a8Pwmr z5+IO+Y%pZKoN;ph4rVZ6l8&(ol7l@)*KSaLxWrYKY?_dcCX|I01_2-I`XDRFmf$K; z@=b>InzQv&lCvjLio#cD4B8|T)OQ}T5$XOR(`zqr{K}gsTkzoz{ynR+hu|w2W6$I4 zm)|8=iA@I5auE=^*|1$KYNey7P~arLPTO2SQSrn+nlbm^n%TF0iCv{&et~DcFl-fm2 z)&G+Z-U&F_mK8-=oXZL9bxXBA_Z50;EVS(|mbl55WmyNOw~@YHB=EXp?HfTAiA4npJmj3=JmPZzp5;`ghl>bEwa3i zMiCwhnHy=OUVUt);c}3%Wc+U9Y3!?GTKPtHr1?wwkM%^q%J6Ajb9&vvJ*q& zt(sr$v3WilSKKZwteDm}O1R0Alwy^0`rsbPaLn}D4VJ5dWH`o*M%eY7aRRtgqot@gXpf`B$3$GOXl$CM`7m|u zJhb@yH_V_Y327`drD!ZQFA1+oIZR>%s1f@MN%7trlvh$t!${Q&Z!J}6rQ}AqCmYUD zSqiR%EW>3ZMu$ffIb8qUzsu;A7qPc*vwZsp-2K7#8O#=#@q`;+{2H^t2%jVz7=yQ# z`O_21b;JMpthSqFF3)G-T;ZE)LY(pbpS?+S?#+7be{(%Z+s{?wJq^3LBO8=iP=o4dF8qP`xhrXtf6RgDe|jy#`-!djA&1Y{}ku zNU>OAbx71K3M%EmhQPm0NV5UXC3u@R6XB_A8;f|YTe#UC{0IFPesygP~vL!d($@aX(8wJQD?ZR2CWG;nAo1j!igzjr&P$X#Yuzn4( zIG~4`3ZiE*M+Nen!gB%UL|AL|M%f(?WLbhv(!il74@K!jn902cGMxA56wsDpu_RUr zhzeyg-eWwOVtq+s4EowN_OHG|?mRF4&aZOii?1_#`)8>8AF%xJZOY{t2M5=fzVr%b zYRKg1h-x|K^zjLc#f)T}QB|L|Fj5dJFUGsy78-~#hd!`D_dAE9tV$t1v`)0t9zoQ# z!gecYCmMGeSLS~-tF%%qd7;G1vv-$c+tB3T?Eb$7GDQQa8$Ic zczpZw_7>;4Ynkm_*24=`OKEM0=zKcTXxo*uBxN|t$cw6G-&O%NwGH6XZd!|GXj`uA zK30uSiV76H!(m;+Xbi!9qN2hP-N(>L?%` zW!NMk8H^~-9<%l%RGN_tr{Y?(B}KWGev$+*B*PJSPg$l^RnBlQVmRG{(o&Qq+0ZZ; zPZ>@Qa7LrOL**5-hmSa$onoCw`&1MSFSu#3E_H~>v|Z*GnbNvB#s{Z(R4lx>{xvSZ ztS!!4sZQ%G+WS^j;Mk(%gWBxH1^1Y+C&)W^!87yJ?|0j45iKmM1R1PIPztk{^I{-asMN(z3>`Lk0~ctFj`}jM-MZKqF}IEU{g;z98j*7+wZH@E)g>d-b=@Z zyRL7;ipaROR^N@y#O&^}tOVNKu~7Op=_oX|x#-#&kM~gna^Z6vuZ$dJAzllP$nMZ+)0_Khdu$hPPSFwrv5v~J?9H|5)r_4W z6#Kv=@wxZq|7=Yb-ZC-HJF+Z6DaFHw52-@XR-px*bV0w~Hj!a1Wikc&dcm|@7CG4n zi`JOy_?xfemth!N*T?1Aojs#D+n&Wkf z!f|r<7PeTUh6B`KkAqiUq$<}ePM?sv6f+t#n4}c*In&7=$`+6py&(I2OQj*D-!)sTWua;m^4!-SOUJmk-{I~Le~AC! zeeB%_+<4(llAEu<(J?+T3|zt4{kv3UPI)rJovx@9xN>);Xm?@cT(9}K%>wFfN_9-4 z72x(BY*jJH23t!=?~*&y|NVJaRoh>`Ty9G1%epn%_t+mxYMbHb&h8xRH-tgE&u!!C zlFT;u77;lvj3FujZK1SXU`7E_mgR;}>;~MsmaDi5H?7MylSMqPeU0uKspm6%*C&)> zeD3214?_G$(}ulvkFDnualb1fvFo!Hj$PY1*D^r~j$j2XRebB9Gi}%Hv)5fjSUPuc z{?o1~&+gcFZ5N?W+ny2yQt{PWY_TF6?USSlcD<%ttVz-#+9VttzskY!4Q5YINrnT8 z^(m<_l(Q$ypFSj03Nsp$?2X0!S6NI|adzi6)uNJkhj+AwAuhT0pxQpuK)V&+2`MD$ zf)}lAH7Ohxt;*VZiJlgvJsxp|X{SNO6oYEJUZcZWh=M4F5!xrX@bAt-R!U(^3f`fW zs^g?m@=22<1H2g^uy}_z8l{El+YLsT(U9!Q0i&a1m{&Z#{Q+gZ0_#v&%C*-%N1;+y zt0mJbH%Ja%Wc>ASF+4nCbTDA;7R>+bhb(^d9)$w)G!(;T&!1@%* zlB6ujyl3VshKGAB*6X_d)GqCBzMhc+6XQB;TbxJ(;1MLUj+@@?4ZsqBS~$ zQVCiMKUg17V<)!qEu^dvH)BCaIS-kKROebI~?5Ysq8!xR5X)?s<44))eC3ldd31&FPCmCim zg3$=Qzeic*6b~P>e)1R>Km|q_a-iE}70inn!@-cgiqG5H&cet8bV?$( z+qT5ezKx7}Qbju%4ToE=+eL3ZPg5;b$r!_AGGVn^^^UC#l|JWw>Dj1(-p#f6w1%7diU%Z;@TS$?D^KFfP#d z?vkhls+e)-FaC;ZzQSY!_Fn%2tNlX`4v#2{B@Tlg9FQFkaElcvP32)cny_Bya3T5g zW_zxr*KIM3zGE-?9fY`am^IvVp9D&~?fNlx;+$hV9tT*okod*TsLOEO*6O=L=~*vx zzw5H?#9-rd8&>_S{<~J22n{)}9RO`xL(OIt^B6Xq&f(hfdzy+c>bmB(x#&Q0cZ@L? z#@wv6q-nbGdsq0^ziEBWMHgm@qvKzS5&)mhhjaX}eHCHoo2X<-OxoGac~Su+ zu=#D<^k|0)+DFCb>zaSon1|+JHmM^QR99BQauBcGH%3wJ+gFdZnuL5f9SqPqp_s3r zv;;f`$|%y|h$I`LRLa_}F-d~co^&+C491KPk4cY?N%m9n`}g_idq2RQoz{1o9UroH z^(K{bqz4Bae)DVWf9-2L{mGBHGBw=1F=74D9e(;x{~3?&ypNu((R#@KYhPe+{W>Iu z!WAqQGfZi*t2NG6oIQO^s$3}cmol6V(8)vCG4J&f!l-}dKT!bH#~M1_+901^>uQi$ zmXRb0^Z9(^xVT|;H;Jww>bA?d4{gwJLP_G*wJ&QWw2^>)t|sTYFPkWcUG|5~<5h6| zod=0@uib7{RgxtMNs?SBNV^+%Hy(K5T!wB(!;zF7ap!r(`cQH0@tRPIIv}byfH>_I zEyMWCyF#|_dVQ`krDG!F#cQO`%IeOIJZo{qM*5nrfNZ<%c4=*8ahG-6*Kc3?MeIpX z(IrO5%~pfafw&Zsbii;l1*Nh1oGM?Vk+R?bP7#PdYjvydE+7aO`6PgabLkyU{D&H` zXcQK_ZgKyGSdkOO%10Xejz!eWb$24_|4FWq_e8+gMlj9O2)d2CXb#e&5h@f8Or2^x zgGP~zC+Kv5OAKjhNJ@n=3ZEL%@c^GCFdm@BBUTUZ@%XQQ0B5K5JCR-{#h@rudb zA*b)Zk6+EHRu!Ys9!fdPBxQcKW|)moNd|oCXu2?ymoQqky%ddJ?y=reeukA^8;w}5 znx-jLRZ$d0J;pvXT^CT$7f0$^G#9sc9f{LKOCiQr`eH*{dkULXRaIMrMx8OYwU0JO zn|Mw|o6oY0JYQc3Gwlj!8<1)ySU&Bsw=K_IEz0)!G3pk!O-6$O^ZA^zJg<>olzbdP z9NxOE)6!@0$8qoSjO+E|!4uGh_StC(+rB>!@Q4=dd5ft1H;(mL%1s~8sC(V+Z`=Cm z`z$Qd9&AC9rBr$dc@8eeD6wAhz$CyzpO};r+ z4GbhO{B>2$h^kn@x+(_6xgP&oNro7OcIb{bg(IiXnn4iV03M^JR0K>$#?|C zivPd8Gy9PoITQQuiy)atWgUHYtF>c|W@ja>7AwOZ*lWvx;e}x={ODKzg?_dD=;OtZ zv9_SKu(EYnnw4gHrf0gl?#v{UWJLHOB9crdnU&SuAbclZ1nV3Dv4ZWf>|R;ZhB0Mlv~IJex7GHThRxBFp)D4$}t@7~g+_sVmZx zM~r{;4^Th&A75d~&~^K6py80UR+ME$Q`SOS_je_& z;A&sjgoawE;`mUT=nI}>$bP+tPk0f93a+`0+k3#jd03h@p;g& ztH$dvsHvKLkX{L~JwLy%EtQ-oug+4e%V{`|Vp?r@f}@lW^IOC)5T5}-VV&~<)jd=0 zE`zsaiI>KF4{W?E65d2<-oI@XqL&yY(TrzP>T-oy7KjzDi;{)0jAn;e3zhY1%GK2Z zL@^#8phjcrL^C-!rq&5{k@NYdzvghhz^r_@Zg%7g8ln>(e*aHNzyGJC&z^Jk=?fk| zxyOluuYdA0u3mmghVb?8K4tQ~AMorieoS)wfXUGetqkV!oWz*@6m=ZYM89~fgO>y?k%9#A)Sx%W7hC^fY~20BwB zXq8fy1`&-?+h=AM5_K3XRq$+!0gU~7yT7+vkJ?VaDlp=F^4Nj)+n$Gg#G^lCz-~B0 zM3?ctd%NqfuTw^!&9i-dmz`;YK>)yeQzgzj2IzE(Srr&sS+1Q!oVT-VX}{W%R^I{a z@JJd@0F{dl3HadG)-XLmQZ1?5pw{^@8Qim8h)|iihAa&$C%mMNQfNJ5G?`$< zV)C3iU*Ie_5p*KxGyzFK3_6g|M5UzT2~KHWuSjcbnlVaJu0Q|3RIgs}^1AYlA=!xI z557ya$jOe5$UgcQ{rDMYzxX9nosrv$uYUClvelBSmoJ%r`a2GO@O}R1-~3x9kM5IF zQ=eZ@EpryH&&j_!h1Hc$&y|fKNw9g18>J+N6GR}DG1G%%7Rgt8FXi6ENHK)o-U1ri z-dbg)WcwiY!P_A4Hitf&%{V_l-%z`C+Z^hnkNbREh-$F6l?0Vi>%iT&f$sbzq%E=5 zc~{%uy|b&n+}bnGIgG0}92DBW@47a~!FN(PziA^ClwnHg4WGjd49cf{juo=u~4@HR&j0 zwM?+KW-|oE5)=Byb!)%3ZDz4yY{Z*o!uGay&ocz=B8m=gTWP7Et+i`YPvhL9TA3DZ zn6%&v)wOM}af}2fJUhr1hH)lHqJ8FZTT!i+gmPO*nxe-eP@1x?Ns<(6OGJFNR;LB0 z73p-0&L(7u=K9OubNSofL2W&0)ENg4o?@@UgE5&5rwL+(oI*I!|m*POk64aSigi>@ka98zme9-c6-%OI9! z%xmZO^A@%0ZkK^U4X*6%z=1zSj;bsvbqbZ6eVi@ilG_83F3Db-02ob4L_t*k40(vP_jf}&3OV%rwf^FY-SPD~UbF*xV>xp# zwFnBIycXyCi_neFihXo#Kke&%grd3R5pvhnyU*d`wyx@NZTp-e+Jti#5%ofgx7KUX z7@bfV!}#cs#k>fqkpzsxX^jdJxG3>lcaPNDZ@a}ODUF^f(N3{7l{1=OFu}3}M(K#r(+@Fq$-&e6Oh5i}ra$@-7yt98y!wy- z4s&)%-8aVK4KMz~zvspEg1Wc>Yq6S;h*gn}$4IKsq!{hs)Utf>IYw!}7b2)sqb2d~ z-h0A+S-Y*lYgpeiI53sLWkHsf%_@>>8|6)+dbinud$iVTPr7f)HnlIb5#2ud@M3zU zi2R1U=-zQu0U<_PktaZ2YTC5M#w~HqU<~B>iY!f9zi-A%Md-5)_1Tl!f7{T{)?+t0TNMAxAq{*A=fTIW@O0?L63&N*G?rcGqp$hCcsitfoB_3yrS7)_nW?y7eC~C3p!y5K^tlR|V6PWAfEClq<+G4Bml31X2X& zymwrmBg|I+(IMJa-dj(6zHPTf34+qF$F3I(&&B+6zQ5RhcoVeGz^+B%oWa@PHMq6| zHS=CK;Mx}gs35&28R!h91#K(pqHMJVq+=$JpOK756c-j#*4}&WZ4M zWQWJ7dP()>6{j!0^g+hJ@rNH_$QX@}$iDM2$q#=>efkxrKmBj4&M!9v3k@V%Q5j2J zuCQNyPW1V8g!tat;H=LRC=%>s3ZmnogqjyNco90KsEYS&Gx8akZ&uXp8?yi*NKI_; zZ1Wt6wNZ<^t;)GcH8O;_+Bx#Z<1wq%iagH;#}|>!H-qdqq0e==4a4f0;W7{JIv%AI zWm&e2<8eQ>xypu^ILcMYY&Jv1m#w2>iJ!au4eeWOzpEmPHkLkj=m@>UU7ei;TN4f! z#s4Ts=#XxtyQD@+!|3jw2qPp$H%fPjgdn54yAf%SAtECtAcGN7QX3__e1`Wv_dDGC zJm;L>iTM%A5|KM?3P@0d9n;YQ)>h> zvIC;Z9CQc%k;dsUeSpEh2Hc-F43+(TqhG6J*crG0TvdRYU9!_Wc6KCu`V0}5Tob;r zh_737Oc`lvZ*t76@3$JO?~bs}^W176>$T!RzQ4P#?_T|NJCdK>@kvcf zV+oW1q}0v63b)I*x#>9ery?(q&`BGOTyTU0nFq%)GVnX>y z+%8TmyXVNTw4tq|<6m76C(L3vIGe!|To#`BKE$qf@CL|A>WNWCVDU4_WzTU7>JByN zeS83luJvCLJ-hmac;%C100dZT)1jGFk$hH6#_D8ybVuDLQ`;#E{?$3Uoz4isuJ__) zcfg3R2pZMem`A6|LViB!P@z{?R4JO>4)*nCQcei=(Y-@G)xF0=1oj%|x}5&yNxM54 zRA6FkxxUugnvVV{ee~-7KL}-fae-aS?P*M>!H;pV_RS_sGtY!VOb4xnn|?`1g0@*b z^aHe8OYDtJ;p?Tx2VqOjne4^fi2?~FI$g2pM>o;&w;sVKH@^4oTOs5I{QwmgH8-6? ziQu)cZI9$)ey!s#MSVAI2L$I2UA-*F^_Ny=<>C}tKTQHuVGYhqhRy{z`xHoa2Xdal ze(+!dS1ZCGU`h~MLt;fzewC}E#600uxQEqjym%m!MM&&VbNCX=<(PNR%AbW#R#T)YPyJ5Q72rk$YQ>UaO!5h97nG;eO$#H zF6YxMm}pc;%wtq&L|6j=u(0$Bm){TWivHE`n-Hc)`@zf4QuwyLYxl3ma(t_1kiqkQ zXOm{La5!c_zG2)IJ~YhUI1Ez8Ezvvy#t=O=BB760HXa*1*DW@A`4MT}ruR}nCJscb zNZM_RK9t*cXT2K$=W`SCUT|poW|oXQ{OMuMAcY6RLj>B}K8socCoTrR-}Ss`P$2*B z>D=B_d+x6;kGpOvpT%%aV0$<>Sx>?Ar%yV_Y;VQ-&=EdY=;{DfN&Cf5@ zCtZhP2X;>-I(Qn$;rx`LXo@38{+`FOQd|BuWJ?uq8P`|oGyUoO)9uEAFM>Pl4X10Y z^t`C;R;&BjVSyh%a5|aQR0~U6-wxkYrQnuaJLiPBGBxjNX|KeF{i^QW++E2UPhlWGvCns3kiBTp2k6+Qx>tww7>P9-fnSm4kIb5p|FLF~M7MTIDS&VVgw2iFP$bpMehe$AoXUR(#K@s@;zVRI(Ac?2!lY@V zKCb*6uafCbx9*McmZxy>cnbV>s3PBvC|@*JRIgu1M9H9)@`P7Iw<@6=ec@#tX)&WE z%(_6icCRB?u;sbnZVVes=9_4_+;<3lE9*jsKP6yp66=z@f?pt~xPb@OF?60V84}NZ z8k$-UhK9%RJ?jJ7Q)T6Na#Q;lOTWe(Jf2D_IM`6GX<>g=Sdx}HF&H>>dcl`j@@0v$ zHoAs?@Som2o{Fe6P3z^%Z1oh;D>}tYdrjqjYx^k<)>OKx`ep5!CdGF8J6)Hd9kC@C zDKekN#3Z#sKgg9Kl$+F%B~L4vXVX+>=trHuB$aKv=hb_nQClKG}3&*zR4R zC-sV@#P3!C+UxLqxTT~-c1BpR4YoN5;X4(NJz*@yZvoLG9kYJ% zhZ4NOpegB_N4O>A77(N{v;PnEdZ-PYP9S&g(eG; zf~Zcx?)L{#67n}zQ&*2BDKt%J-1IkTN0+70i;Z4>F+=Z-CRP%-h}ZOIsg3z>v8v1i zC*0jL#|Gm3uNs5e#-#&#TR2aa`-^##F0`nM^&YUzZO17S zKq?5{9vdtGI+gL?s#@nj+7{)4$%$tOLl|!*<`dw89L8u_YeTl|YVy|FO|}(fwRD?w zCX|@j1EfdOu2EhS9JscxOvuieB1cXFBHX^bW{q2&2hpz#HLd>JwbHt8?ALu!LV^GG z07^}Pv&VyO#fcBRNS)`d*Vn{%0ky;J)8A#O;jy+CMg+>OaS8ZiID1V3bmA6$XjYCj z8~@RKpJE+LPe&Du1xb-a>2D^a4f`z3H4o*azT3?zQANJ2|*@8FG(H zt2ddW)w0Pp^?>UrCI5C2iH5+MEv;D*Pi}H;8f~Hh`?+tmpD$)AZDKLQ#9o^35d>49 zNeE9ErKm@wRrzB}!3K>M!UWw#Yr2pZaJl$`mLY@yi>U)4$8GQYJ)@Zt!F;u zG)5uORJJwlLf?Qpzn=FZ+71l`zS@f*>s9(5vaQ^4T?*;GS@B9108f?E!??RF)88YD zC!}e{WN41KimdpjI4uS(1K?tRg+%5P-L z3+#&a$qqwNFT`cOND8ec`)P8}anV^(+KTgdUH&E9>&M?RdunZv&M@R!|zWqM}Pu)g<-cO)QU34XWnY z{2&^MuJF;fw(|+}CL@kDOK!Mm?2L{#Mgrdf`;rvfwW?6lqHoSUk=`itwODn(otI*% zEJr>?CMcKqnwbVM+K3S9&SOdVE)J*LNaaRsblez?XBM&RVm<>7uz2U^xSjM3iJO2s zPi=sLjDwQPGhD0(q3N+s^;BnXwI))~c!^~AP*}nN(hqWP*AMYPm3-2`1Efp1@)-=A zN8-{NZwy+!e58xZH(;7dl|+Va+-PED*WC0~s@B4_i~XVna#CJhsccw<9QXVg13LWd z00sBvfUc2{A6kr-il363I>we((q^wFd(Exkk2ITx8XWrW+-vVKYv)IVfrMj0k+Gr! z;fCP}6O@PrN%B^YxOg}t^P{ThgTJ^E(kgslzl$gCl)SX>*?)F7^6E&BNv?CiiwlOI zR6fpk+#SvI^-q?ji83rBRv({`1dH3fK4tI=8oHPk(w8ph7nHn_mmd|FrDbALlxCBm z8Gc}{o`_Gk=5Py?sr9Wiw7(9Pc0Aps-TVNOgYTUK7M9(#P2Tw+#cV$fn(}dCUqFx3 zBHqn#dR-IAz}PmQm6Io;(QtA4NGmQ)f!cz7t#M!fEk0UHdRx{7n#*8PaA;8Hf`^~Y z^OZdRAwdY?`XcB1r1j2jaKtQ0XJ?~FSk4ytg6Iu-QWa{+7QUnw!B{$$S2mawMjB{E zSshQQ7Wail*=F&$VEHw24A15(Ik}}YHTKkLgz!%FE%{&0d6lzInCh5->UJO&G9%B1 zT5Z^TA%5twqR#ORe4ds^`c*6DIiSAD3ueah=(aWk^ z<$um(>gNTB{au0eTznO-vmkv3+Mt2(bWhSh4*4yGz$7-=nvS0RE-z>gmd~b4lk&5- z^7hX5ukZvhdXRc?mU()&5it(MGTHc0`58wz@xUp5YDJMJX^DL_Df>W(;!nW)NMJJX z<>M29Y~H{^-Q)G~>a5@a6~meHA#&dO<_ogsPf;Nt8UqSy>ZMw(12kT_N%H*TDRkn& z@66ElH{SQc3=HY;RC60U{lf5+>TF3Xwu+JESd#9!+-3ZA2h1)q-SLfwYV1bOw~dwG ze_9r|_yRe>x0k&Ip{LKg?^n~LZqPz`gEbk$A?zKj@*z-#uhU9#Sc) zjz9m?(u}ldhO;}iwYc79b~FUtq{iOd2#%ym5Z)K}j97co=!uky)S1D~lax98xXF25 zI18vY|MB|Oi)khw7xv9@9Tkvd>fJ1F+|{3>sqa1e^TBonBNd@13gc`E?WFseHi zU(~3_POj)oPDsNHIYj`1b?*#q0Xrk0?Z(n;Wz(aH-5{`T=?He`>CpR8(WgWyritux zk`N7Tf(BnQ+4I{F!^J`p)rwK_*?|W@f{XK+)Eb`^_8|7f*M|T2m$^rK2>GlO&&!^6 ze10&7FWc*68Lr8RZMCBn_Ws^UE#fYaiOH1h`bKjOFBAD1Z{jn8?V{p^=!?bnoRdev zg79VnP8|hiMhJU#Q(vFL6i0=jzFQmA+)*F#@Vn*81!)F*y|Y{}=P;(>9LH8)keWDJ zxWrg&HSuSt>UMvdbb8M6irGi1!Zw{zmsUP3wXn=MXR)hRqHEtrjIx0@)aCT$^&1h# z>$&H7;kS^N7+ShNi?9zcTNc&5JPLs!^__d(Q1fJI>5U;Sc_$3Dywml$@WldUo^y*> zxh>kdKU}KG>1IggV|rC0o=G$F9H9%4Lqmi~py6Uge@V{AT^jw|LFGFzG&OS)Ny4TS z@p(tplVs!xsjA5=kb03O&r>wDqepv*Uv%x0q?`bti%Jj47;)RTngr8QK3|!Tw)LFv zDxO6isy&potp>5yWHHqmR^+JP2nR=-W~-_Pkb%`l=e#zMYNs2**YvE|wE`jPm+eIA z^};l5)vCVNRnDRScr~Ep807R=_=ri#I(FmYEv(wPGrCR0+&|nTLgmjiT}5yzhb)JlxJ=MRktQJoDby$!s4{3Y)?Y>C zTi^o|jLrsD>u8C;*>%m*Z64Yn>_?01S!YDveg>OP+i!ZQ?0jPZgNl_5`gPQP%=J+H zt!=D#PH*C})zo~CJ5*xKc;Hg8unByxhWpWR_pN50onpUI?PC=SYZS-=E|ejHzvLmQ#S|bz^8g!DC87Z-#+DUdY zO4iB!6@ja%Y+?9$0DLk^ZEjRr5ZG?7BL9JK{`p<>=J73UvfczIt$+B~)%w3DqJv)z zBB|=;3wg-&3FE0M^zL&*?$2RoyLSIL%+8)}!|t-rVE2H3hsfw3R3{M zYpT7w1KL$ZWGRL`e(gkV*_Qy_7!`>A$Nm2fk6K0Gxvzq>yZPtFWJ;)~Ie2w)x struct mi_stl_allocator { } /*! \page build Building -Checkout the sources from Github: +Checkout the sources from GitHub: ``` git clone https://github.com/microsoft/mimalloc ``` @@ -1036,7 +1080,7 @@ or via environment variables. - `MIMALLOC_PAGE_RESET=0`: by default, mimalloc will reset (or purge) OS pages when not in use to signal to the OS that the underlying physical memory can be reused. This can reduce memory fragmentation in long running (server) programs. By setting it to `0` no such page resets will be done which can improve performance for programs that are not long - running. As an alternative, the `MIMALLOC_RESET_DELAY=` can be set higher (100ms by default) to make the page + running. As an alternative, the `MIMALLOC_DECOMMIT_DELAY=` can be set higher (100ms by default) to make the page reset occur less frequently instead of turning it off completely. - `MIMALLOC_LARGE_OS_PAGES=1`: use large OS pages (2MiB) when available; for some workloads this can significantly improve performance. Use `MIMALLOC_VERBOSE` to check if the large OS pages are enabled -- usually one needs @@ -1053,6 +1097,8 @@ or via environment variables. `MIMALLOC_EAGER_COMMIT_DELAY=N` (`N` is 1 by default) to delay the initial `N` segments (of 4MiB) of a thread to not allocate in the huge OS pages; this prevents threads that are short lived and allocate just a little to take up space in the huge OS page area (which cannot be reset). +- `MIMALLOC_RESERVE_HUGE_OS_PAGES_AT=N`: where N is the numa node. This reserves the huge pages at a specific numa node. + (`N` is -1 by default to reserve huge pages evenly among the given number of numa nodes (or use the available ones as detected)) Use caution when using `fork` in combination with either large or huge OS pages: on a fork, the OS uses copy-on-write for all pages in the original process including the huge OS pages. When any memory is now written in that area, the @@ -1158,6 +1204,12 @@ void* calloc(size_t size, size_t n); void* realloc(void* p, size_t newsize); void free(void* p); +void* aligned_alloc(size_t alignment, size_t size); +char* strdup(const char* s); +char* strndup(const char* s, size_t n); +char* realpath(const char* fname, char* resolved_name); + + // C++ void operator delete(void* p); void operator delete[](void* p); @@ -1177,16 +1229,24 @@ int posix_memalign(void** p, size_t alignment, size_t size); // Linux void* memalign(size_t alignment, size_t size); -void* aligned_alloc(size_t alignment, size_t size); void* valloc(size_t size); void* pvalloc(size_t size); size_t malloc_usable_size(void *p); +void* reallocf(void* p, size_t newsize); + +// macOS +void vfree(void* p); +size_t malloc_size(const void* p); +size_t malloc_good_size(size_t size); // BSD void* reallocarray( void* p, size_t count, size_t size ); void* reallocf(void* p, size_t newsize); void cfree(void* p); +// NetBSD +int reallocarr(void* p, size_t count, size_t size); + // Windows void* _expand(void* p, size_t newsize); size_t _msize(void* p); @@ -1209,7 +1269,7 @@ synthetic benchmarks that see how the allocator behaves under more extreme circumstances. In our benchmarks, _mimalloc_ always outperforms all other leading -allocators (_jemalloc_, _tcmalloc_, _Hoard_, etc) (Apr 2019), +allocators (_jemalloc_, _tcmalloc_, _Hoard_, etc) (Jan 2021), and usually uses less memory (up to 25% more in the worst case). A nice property is that it does *consistently* well over the wide range of benchmarks. diff --git a/doc/spades-logo.png b/doc/spades-logo.png new file mode 100644 index 0000000000000000000000000000000000000000..d8c73fef436b101d2a89b70466a00ad18633bf50 GIT binary patch literal 34583 zcmcF~g;$hs(DuS29U|Q#B`w{dNJ&dK(%s#tfOI!3sWeD;NaxbsAS~St3*Y1Kd*46d zBKNz%L}153*{g zz?Uzo=?@U-HAwd3do|C@!xaxt{F!@{)04EcBgTR_2#ByuOZj&M{$5eeQ_pIz^U-Rl zXZc*k+^WxsYXK21!EkSgF#>H{0)%x6dJ^+eA$i3V&)q!!@WBi6pqG|*=&$O&CSsw8 zfJ*)S<%j=+AD6l}zS?d{GbI0Ht3F;#4LNOzF|8B%es)fq(MAoU`#OVw8m3OidhYiE zi_`jXQAERnnl@Q^gQf=&$Dyow9ahr$C9m^$+k4qICxzY%4U0Fl8vp(G0KHX-Sr7%B z;}l)V+%~-;`$M+q6xX`@AuT*+{)5u zc-5qsz9~fv2B>}pCA!_-u2(V{iH0`hpWu&%$==Tsv^K@L&==gtx8;2SO$%wLVLWQL zs2qc4!=IE&&h`qegfG3YbNULgIxMyK#1yckWFm9Bq<_ekJnnzv5hW-~ut_JN=v6pp z{T2L%7Fh)li!@ip=HqUYC9H-o$m~-N*8h|~jR0e1(>D9e{lOTUK=cFV_5Dpc+5(ODA0+bA((&D-OyFrwzwGmdopm8v>}yBO^>w6GWd z^zR(C8KzuorE%0cb%F+UbLnTx#=i?iFfy`?y($Nt4)tW3IOEw0d5*tM6+76b)+}T4 z8BSdP-U9;k{kXtIR$Az6>4JXwa|3O$da0>~m??=edo{)CVsVhyW zNv^knkY-%09r9brK2(}uTB7c1=^pw`oSy!V0u#j;;X8>u#Z7-Al)>Wud3F~r3_Byp zAmn6}T6?*~U3|o&O5JxN0iQH7|IRGcJ$yt~<7N(dt>5z4;>Mlx@0}_$TO1~r>$eCLbXq%gd<3_SK8$NAuHSDIU-WJF zci;&hv`J2AtK@$Qj)`3n2Y$TexBD^?6CCyFoNc(q(P&=0U+IP-gQN6l9M-EaRhKpT zp$`<=Gp!tRcZx=0fum3lpMRp(KG1>47P7v56y0A#qUQLDPDS0a*Gl)(C144cn9$cy z2_|mvwfyX8& z2s_NVp5u9_O@~5YgH-}C*m5quGf%|e*9Ur92Gh>ncx%&<3sDZ=VpAmm15xT2Zg$jA z=g=Wh%?ZSA#95E6irqn!4PiK^9nFF-`o{D2zqAN0wekquG>W`BTKcA&tWXW9Eh*S; zKQ3gTbq9jI00pY2_9$yr<1KUQlm#AC#KlAIABD7QJ~k^G>MrK>AP7nOq6bPWx(Q0W z#jyB`GZ>aaTIW8av?cD8&$-!UM(1#OC`3(r4fsq!Munm7^`p|vldR6^cad7c>a7cr zu@y(pMU0L1c8;9qna!FAOz^UA${ywhCdGOq=L{X3r^CS_g`vIjGTR3RBd86aqQ=eX zl9u5UK2@I?Ek$ol30{=X0uw`a?vL9|CM$OjIgk*b_0RPfm`?Gmo3McUp0WlMx_QHz zh77(xASAWu?H8;!qR)Ou1wW`FV~HgJGoh~BNp6Q-G;qVY)Z}nL=bLssD5mq3dxsp5 z=L+-4UlNEQNAXw0!p5m6m|I810z^B#a%4+XCYVJyyQvL7&qj}h38|}o0G@<^K6n)Fgw;FQIs*JrpCUv(Pk&@iLGSyF4&;jH)86q}AmFCkz>*tMJs8#0H zF3VhUsG^J*YkYq^52W+Yv-ip!zCoMN0`{=0e!LNp5Q};FF8P|~12ny@;yh%<%l5-P zGmy1hH}}=ID+6>UIn|fVaG|raGX~&8b#{e;1)<6Q(o<`vAt*;CX5dhxhsU{yqh8;z zM8Z)e5{~;B6ZwH$233&KB5y2&Xf*J(8t=@AX=V2`m(zgfWLjx!s3wW5 z=EXA>65p9H;fej>9s@WZlGowVzKWQd*P1ov?r|*9yY(L|HzlFcW~(bJ{ns|jEA0q- zk&ZLTGAyZ(Y!3bjY*tGoMW=*n*hnzlbHwb$%gH$)TxbW*za}Sbvz83FA8jCkFy)+V z{mpGPVw!PuOBJqonN2qZ7m^Dm;TE}#an?RE7vD9$o~EV;{8!hyt&<5`+}zm zKLZwfhd&vH?_A(c5&_zn7M@YrJ-0W?4x$Nst#MOb2r;P^A-cIdbI{TBdSl{PCq`d2 z-corIUD$6X=BD-Qp!ZrqqYtFLb(=dBa0UPb_XV2RSgjAiF)u+}I|P2JlLeII$G&+I zr%?lrdLCOFjLbgwwuDOI}26XHQ1w${&@{#vfZFtH3~5el!``U zvjsOPVRmXi1Om}l7f{2`)f*`kL9uw#0zi_!1Qc^v^|RfvX}J()MgOdW|1>vGh}>Ce z+A! za_OYzB!_H39)P^Rl3q#lDLeuz;i^N|S4h_=s^y_E%gaLN_{j(7_w#J~jfRo9R|Gv= zkHQnS%3i`icK7)GQcCSsW<=18PX*+Q`cN@7sbFgtH>h=rfx$64xC`l#-wv9oh3}a z93qa{`Mx;%#2_u!#kv+!Gg(Ui&XwG;D`$AZ`w?0u?032vhMijhZ(x3xQ!S~Gb|c-5 zF&1Db28{%~9{HbUO}5&5HXYLgQ(qap8&a~3n0;+Nt)5znI(#d$Xn1bu4D@WluR}Z3 zZ!*$4zvL%V{n~NFl%0Mzn0>{bp7iZyDc~9$+si-c#(dQ`L=3T}rljhnRQIvXv2I}4PQs7M2(;w5%}>%9d%F63aQSLLju)KtGTrepG@HP5Wi zISr;_hHJhR{JrGo{ANDF{79o9PvXOplwd&pN5_1w?=S~&v!_#>_8 zG|vAdZ=3FU;WM-0&t2ieHJ=i>&H>E1I=(1*pSdFPI)ALALV|aJLf>~;Kd(@X#SHtq zeGIwaMW9HLp8_yrQDi1ZrDGgH6DkLoKy zxWT{dMHjB{Zd7je|Ep=NZb2AO9lgioq&rj&L_j9{C{VR;*@ga=`jJZi;3@ngupUp` z_ty*Jz0*@h774AXQ&BX1Kcl&|ytb=39OZvp(aKMKL)HD6qEetB+65Dy9&KoiXp!Ai zG#~2&`K}d=PPOO3rla9IcTyK*V;U8zllTH;L`2fJ)8F>IUKCk6I-vHM9fo4DLB7bG z;F6Md_NedW_8A(C@>3w?cl6Ec++FgHX{29S7qWw7$-y+VL;vn&JKn6f;aQoWQDj*} z1oRs%GG@S$&CgP;Prk-kz;=^b*z!OGJ5@BVhO1I(D9v|39Ht{{L=j(-iIHLR2!pgW z{xulx!hIzP#6*YFPF~)#za~K=GaxH^R(2~C)3w6S=>wG3W$NtjI;({?JF_q7boTG^ zL^rbFPRm#1)?2`ES3wIzER5~L&92`+qWm*lrfA3RouSS4fv_VZ#v zCWkr926H!h-I@iJrKF`&dRRBXS!sc<_sr>3q~lj$v;t4ik~u3okL@KhwK)J$?ptdJ ziA3+Dzxk$>ohf69fXXEuY$33V!ag$!3-fy3B!d|Oy;w=YW#mJVRY<(gV*6k;55*1z zXJ?`FwYt|Zfo2(t-#nn#AtjSH2|c$?CV2+ zu0vqGeigKI?XkvUBA#W4*HL;c<_a&|ZqO!;jkV7M44278L{Rb6 zrU)rGKV=nx236f1N3lnb33N?6Qrng!<4L?QTTd>VTEMGR7!cix4XWs^cjtp6A#)Gv z>FCZoKa3s>o&0`BNxcFTu1iKDR@S@6P-`z&i;MwuOyabo$NS={h0wGVmR94+bi953 zZ%w+djw(_ZOqD3&_H;;m$CPFpYnumz9u{YQKK}-c_OIEvBmpYS{r)iL+C-MyOLWY6 zvEKHLI<%(bhRa1yq>WDHn_GU@VZx&0;*>s%Y){u;HWfm*knFsrj&e+4-NXlKIV_e&GKN2P)|EWbvw8xTYB1mfJSyt zX0g-G3$fYiA54+2so!U}?oDx$o__G=0i0qkUs^Ma zF)!DbzZdykgXVzQiK|@^#h#fu#eBT?qV(MAcw91rnO-`q1lDh1=;fJwA*muBnzals zvDa;0@#v2#9j>SY4E_ZuENzon2PM%NoDDgy7tx)uzjax1>XND)!nc;@7_OmtC?JLE zV{A7)Bfo~;xt(AqffS0gJ^yJ&j`FQVNb}J!`ZHLw{B4?H7|N`x-^2om7nc%mpPZ42ZM+rh8onETP`$w6Vb{MY zXSO88`W;)z6*@15P6cWeWxV+VS3Rm(sqg4u2tsf}7(Mf{8iqgX={m&#+14rs2q>PX z3(1+{1G(0dncLdf{MSp4*pVZS_TFa3#|Y+T2gM3*qJ>b24yZ8pfH{m~k{QpLN|3Yv zE{AsgU;e&TV=HH|eww?o89J#4tQY`{U%Z14=92a5O?@t;XGB>KUzv77eY^*+PgXNC zg+^LkMH-rPWTyp)B(hwtC+))A`&IK@>?x99UgHF=|J?Udve@Ig42bz!AV|xB=5#o# zp?0_Zsy7IB045bYSp7>r?-B@a5h(nN!^ggI9Onk3Vf_uBM=378oSPx1I-H` zj^n#JIPHy;Hc>!X@=1rO_TJI#Pnz%OR8{l6a&l{{YIM(2rTf%;v3B|UXrG7|r0NYq|=zQSQ+w#Su>Ov@1k z$Qwy2{Y2!iek{VA6MT$rTjL^`Y`B_{KF83^x1`G5$p4}8r(Mdup{9ioyZnIn=C0n@ zO0;{vriZ;bv+dg}1NXuBYFOEbv@sEZsBsuDJ}T4EU(Z^c5fTIc)~r5ix%stobsxl% z%U#l}k8`20`0;WN?J&;MRc$9gk$lsCoDrR3mO#_(2boQ44HRB*OFi5bmkPv1>hWK% z7d9O%H&M7Pw+CAwWV*$6UC*H$(V4b|RqV>0iEi84ii;=1ThRKSt!jG_`hKqiP-s!@ z^UHNje*f|$2SFRB2@}9(|Jp;2ndumefCZh($o+jBr7iM@U-JRl!ucnJA|TY=#Xv_^ zQAbY&ER$S@K2tHzQ}O;QS!@-njx@W7ysbHk^EwN^&%*tafwaGXR{B>OZ$plg?zdLM zROE3(S11R|=-ESN!uf;gjkyo@dwJ}eqx!e4J=5<9ecbh~r)apc8d^SH&$-KEii>Z} zt8I&!?R3Qx5cbh<0GG+pTOjb_{G`s=*TUs8u-?ZzdX!3Wc&$It2pNxAtyIchYW%9`aa&7!e7MT&TK6uO0lIQqotx zgt+a=umA-V(`6V&FeS=<-KMgdNAIS7p$4tejQ4wp2ij(ChAaWZ^kdYUa+ivm!6?i8 zjR_U)8yq<|gOtCf)(^quV5a_A!MjM+9fFE#?$>*BKnzF-U)x=cxCOIP9iCcQ>Fbv| zM+0S#?m}sh%2jn4sY5!BHjGZudN2dv-FXnXqrp|Y{Nvnx;Om(S3= z%}TnHc?MkLN%yX7yz0PTe;UIf_4K2vz4>k)Up7ol!K-@6Ffl{+j18pn=C=+zQ-;e zz}w)sK+D0ySHalg;Ab_guTahAu71f4t&+}b^Yw+m5M3tI*gI1dFjTLQ`d%`i!_CFo zSFZl19tz>eyDcZK|2y&cB3AoPMS+dKO~GqgDbbgF0LW5XzB8LqwTWnZwoY{O(Zmvw zgz>-b-P7l%5j)t&wK|YTvqb19S;UVD)hkLska0z`{-MfokQ62mbCj}~eq`N{#wu|T zT2PL4zJVvkwru-Fcrpg?nwBF7J9Bo%gHN}*Xq1P*m-i^Y1H$vqwh}Ic%}r}Q=Tj*P z=q1D;fNc@o+>pK8jIXumMCz-8F7=4KW95_b5s`~H5*eBoT*sJjsucJNk0fpa5RM|uUe`dN-D){JfdgJwt z4Q_pW#lI>P5E>GXMGrSW{+7Qn3ByJ>ipcH@D!&TKSAuBX1_MrQC=C?a0fmF1?1z$( zfGo|K7V_5OeR3a$1wV$9ILG@AY$a{0Pn`yxCJD}hLMQmer*1pJcs2I?+@p7qoGr|eXYTt-n+7;64xi2mcYq5gER`m~z;PS&I(|Ja-06~z z#h4yAA{#k=EjRCioH3AQmGW7C_M8Wrt-K%pZD60;R&I`m!?-l4q;bdYxF5@>R(D)$8n>0##jV4~ z0_reg&Q8kITIpr&267(9G?F{-d_qZ&?*}8MksPE`3nBnq6!ZfI!b_AHr<$rwc48d> z(pOc~2k4U_-+~h$yEMDbr4X=J&aXNL8*b}kn@+e!=MG}~okjY>ctU^mU6RG=8|`Je znWJZ_MpR}PkYu|+{Rgk<>fO1dbWvIzAM3lt?jwVHZ2(wzj}G7p)fzG8fb0CVbhgQs zMP9$c_hHw4!BZE-9Nfguz##SmJc2$Vcp=+G>K`*pNaQWhb3Fy+0E1G@H7F;xTXxe~kS{?DwUXj|? zJmBF{ljqTN{i`p?Hs(8t#1_MvyIP;ID&jS6`0O65@Glijn7vPc&T8cQuu0D16{UEN z&Qj<9YIAq`d1#rOv^OwDEcoWrUe@jobr`+5=V=>Wm?0N$)>Zq3?XJ}Ln4`AH#rk7J zD0{uqhC4`vbSF#L(pd59rNToDE@oh!%e9s4up3_mTgOnfV}T~nC_FijE>_nNJuNtP zuzw}c1{noPSn>;Z`yJQOOr?-fR^Y^Umo1Ni92HkGCu&Xm*5kgtIub*AZuDbH;Z?h( zY<`+LpJG9i@&=|DNFc}V#p;9()(eq^H!c>mtRgWA%F!d|%Vz^zI&u!QvWYkO!N6yIc<4;SjHV5v?GzRARI%UaFbqH8MY=4g zsMrSCBEB;lyM;aZeCWfY?>VSRRBRR$07cd3Mm6IoLWLZ&P5ZC0dt(r0L`Q21a?BuR ze`G3w?#1XSIoVBJw0z2qZb=5waR`Fuu zX!HG6SuEB=0_#V4?1`5nKSSxug}h=KBc}8=qpv#<`vQjud8{`3Ut|D|?hR)0<*@bo zGHla38m=2@q}J9G=of!@A|l57fQXlO<>ldT;3jVY69`1s&R5AoZgTcq%;RXPaN!a* zHaSI!ouoHg+q;P1)xwXuL{z&qo=$9fA(qI^_>IO3woN|IH`BBSxALlGlKZ|%UY4*u zq!aK<0X=^%JIG#$-evIp9`vGm)3)Vsv;8NVV^6T0oUwI)%sHR;MsJRbDC51iO_sAV z?c6^3Ji~&)!=LHpFH*35C0f*DMGUIIX7d$u4T#p&Et>WPj-tzI((dl9Mxo34f%Dpg zW(Cv3K%QmK2SB9}V1PR7uX;>1F(cB(+jRDMVOjNDHBw>b8TBihn>*xNzK({aV+0x{ zMS>S>93M999(Q!EZR%HbGi{@pBxWheW=sJX>2E7tFO~hUZ!y&q+E>V(DDjkaU* zTM1WUy}b}H&G?LFDV#?bGLS=+vE_aHv^8b;PEa?X_w{#!$})<$ zKPI2atEVuwYC^E&T=0>`xQoxNkFnI-Q&;%~03Q1QcKlF%e_J`+<}mZ(jjpSXac7)1 zL=u?4HP1x)!gXQ8PK!uV!DEP2kVHOyA;mJQ0C}U%Y^-XN`^P-%QfJ(Ye==tA`8qTw zK{b0S|GNu-zkuW>Ycwx5Q?(g67W`Lz={ zJudig|IgNBwh+@4Ja9lO)V--QP;CEi{unSM`(?KAW25NwN_A?7uvK@l?2u|tqj1l@ z*xlBC*{<(bI7M?GnHEvjFhbIluqcKIr{Kl4ti+}Uvct=t`{cU&e_hygRpbvQu2t1; z?{no+QdU(K%b?S5md{4bOrG*<^q!l)d}LZ#j)^CXQg`!;Dw{eOGsdCJcG`RordUI! za?o&n)X5k1f3TQIC?AlFlw@!9-?`^88E2$DBymGve4a zmfcMk3-#fT2LvnjpNJ=mZwhy!2BI30>Yn}3FpJKa=9MSTtIYoV_yQb@rt(ou=qv;M znHiXK;x5mALtPJ4>t|Mq9&MjIb>t{2U3+g5h;Hb>A>8eiKOB;L-TyHtw^r6E`nhOb z6Sy)H;L4;|?|wdo33enC%T7!QIEtrl&GFI03~YU?=ci|K-bkMKYI7Mwd}2mD9UgOT z8@|PGAt&-NKV%A52J%)NNdsEo6|%DEXl>11hhN@D@>e~!6?;99q%qFQ8WVBd@fY>Z zMJ&76_Lb4ptUO~-9_BgalxYjy<(d6_uB9gl<7M)NcLLE~!EUMis{|L@+-V8vZk-#} z-S_KFJ)4d%CQF|FNtl-bWwzg~foy%(dXj#+DaF!07-zY$-nootP=;G&<6w*OHt(>p z{OTM$>O99>Q!C(^126BFvJf%1e1{l1AZT~afvi(nLnQc?<~Xm6pK-kX7BHrz%EB+w zHMW)9f|J~?x&Cri3}3aQnPzJ}5J(N`WEpa?l+rilC&D%VV%AEtuw=?LWOesA|Fb3z zrBTP4$-(UbE{TL}LcFM-!G;H+B#p`k_Eyou%V0_7aMGEeIBfF;t_ey{o6pCnTM4+J z-w|0It)?QA+b@1B{5y@N!Pi>qX$MQ)HsA3(xrl6DF@i8cCSSklx>C85M>lCBJzB{a zu#79}5P(c-Fma@wCMCb&ghThP<|0N#1fGl3Qnc`VJCwFxJ{2X6wS7@A>sj)RTMahw z^c(M(O`^E5lUxs9Co<)a2Z_>7Tz7Tn*X$5yMAr6$enwnOjs(BRA03itc33tV!vc8U zKb3VMft1fS^1W~^hr$$bzLi`nOYNmH}jN=znN9tD7yfAq@$~?mZSO@Tp813?RH0@YrRcFV|D0M zdtA_NB<0_8@gQ?~t5#lH)8Z)~C}APP!;ZTb2J46Ebr^=5*f^Fd!8&i$pGa!oSOW6+>;9ICsntWO`j#677*EsVg!y!y8qv}=(B2BQ3>P{@TUSa6abF@>DL!B^ zvQ1F=>do?N5b~`!NYYQb01+J9`(m_m_V#LEcEhyuz16j314WX5%h{mJTQuImr3DLo z1(Xt9z@c9#Wv5m-j?wPH*9luY14%2*vw0gV|5F4A7#gUS)~$wigkV8w)^yP9tidno z#p}L;R;v&cnlE1Dwkd=kd<0>rmd#6L!lpN^q8uk*sl)2`mA?&r%Gl0l)6#K{xGR=X z0wjSebW{ZGe7*^?dSd-?6n=HFO+SCk$xE;o4v;!EhW~b58X9A)f(Gm}IBB2A8)^@P z39^TRH|e*{mF!I>)oK0cfX-1w6i|%yfbB)b&4H~q{r7(c~i?3pu_NKxQ0GRbgD!4Lb zNspqDCU0e0;H85_>brTr1jauyDX+-C&JkE6&MT6OXDSd|8@zeNy5O|gfk$4}9r6}4 zP;=w9dHI2=)H!Ydut+aJ6)m=QS4PA|ZX$uPNp^iNl5zJ=h$$mK($27Y>r)@2)Xn8N zkJSnUOJ@*;l(5V-CgLVm}YpH2Dl6@aF3t){B)dFb|`}UXmlbH zz;|b#_b|3xpj@IPVTo_@b!NQ$8V#wz<9WL>9&#vYX%Qd$Z(DB*mw9tJrkggU?oOFC z)yG*w4Z_h4*{|HRhp}+$E|m!e5R4YT)F#y;#oI1ve&+5gGELJ$#(w;=&@3U7uG^}~cMT-hf5+;N4P z(SwK2Zm6Wp&E_Z$0uzTG z*P{(Vz_tV^g$pN*_8;%{XlgE{8U8lfmza#WNVX$(+Yq zik#4pF^}E5ggW2+BK49fHw2r2z^;xJT=b|Q3vweniSwnW0Lyp<0hT4d*$!#!$G1A# z#(%uB6Mf+d!44l!4>Y#OrA?c~{QN#c(Pn9Ba+M=0Qy6WPEu=nQxMG`n^_Vkxx9Nsp z90>HQgFdi{cY=_(qoW8`6F`UV8!g6?3oA(mSK&<^^#!}@tYO$^g}H;*YoGP=*jK5O z7ibL*HE%_u5d6f|BOspvSg@_>Wgn5(f=Jr$;1*tq3!z7y&>#q+$!+nX*!~mNOuoGU=aFjZd0h0rDwoOKaXPnVjrbs=&waxWO6hqg z$bP&JEEx!!DGE-iO1HO_7pPzdjA?9jiZVv`-7&!Et}g}HZVPV1^31Pl>9vQ+caxb^ z^)|^K=!8<>2R~}-^!<+P4AnAK=5rugN9szd`>2MS92F9|qb+l*VGJ(b$7L$AMh0CQ+z=MOuHHP^DjZXIgUSfFX- z+S>-+xs|)+8@GISn3Kt$(NG+{W`~lk7G;=eR79}CK1&T(+&FMk7@2jAe`m98d_79M z=Wg^!z|O+;b;F8O+>4R6w1UxI9%PkQd%L#M*Zi_Y@cU(v&w@Ug2O7x+${RDst7>Ee zal{fDnU_oR?~hR`#BA5eCZN8+HcwQ?EHd_tK?VKagZeE(afVw;>e-e}GD zxrk-axhQ7AC-A~4Mq$@=MKKDP(wzSVM(wQ)uDac{pxcw@k_rfCq0!VF!4pIMEHh08 zK1DZ|o}{#SqoTjphuLi@7(fXgQv(Y+ORXgUXFXJ#F_#j}b1(4F3;?k#Vg8AbbzLGv z@KAbEVyQ;bgdbo8&B9*#fL3^+7}+$KCau8&kGMjF*6r{P1xw4$m-Ce!KovUNw-0#) z&T9u)FdrwTQd;04*7>jebb-1bx93I=Mfp7cQ6Yh)#x=CbQW06|9+++9a2G!3C!Fh< ziv<|ETn$yjGzjWO(4W)~$ccB8f7|aEd7sq1th;4#J-8oI1s1TtE&f!tet*bgceJD> zD^ExhO*?2t=@@Y%zZi=qMW`E$j{ZrL!$$;oyntI6E+bdjTW`=i{t0)NR{c(P9t4p-K?-=)mvCV+%W)#F`DscdNree!aqKd_oJ;WH_SmSXoka#!0KvoczFbQGYYi zco>S(+^YaO^-~W#R+W4WW%GM!t;lAA*>M`eDt6gQqgeuGs3Z0C-2Az^g;V5G+^T$e{?I=fI!}Sr;X!$ay`@ zlus|>-vy_7J|J?L+Da~{N{1{36^O2hU$Z*Pj*$6gB3LH#+&r_gc+Y&*LUN56;{@2n z`|X>>PJjKCr7h5B{a4qdMr02|J>>g4hYS#SvAL~!K5v`BY`-ibEdI5BoGnp(ztF<3 zVI0LQ3%7Ph>;Mz^p_X1;y2nI8TZIN0?<5p9E*Z(A{IB#bRB?fjDzb`;`Qhrt z8Kdyl)6N-+(MSJ=ma~C8?#VV!BG7QFC`EmLKeCe=OmQK>X3!bC-u ze*5~#ND*JuZsmWuxQ8emH8=GmG}+akWxm26UY4f5 zH|jibJEvs#H56L7ROX08&mJT-wUaNvo5hiJVdoOXrCv$c!+kcwEV>EyW@gAe%=qis zM`C>ZO5&ic-OX&24^S4^8ReP~h>)XP*ifZ`{C?{CepvhqiKc)I*}KOail7Z^ysJ4c zErU)GExV6&YH|vH)-UpTh(yq}As~Hg`i9AuzT}coQ*&LnJEEqFOQ_WQQ_8pd1dvd=*!&QKDp5J=#zzBItqGbs4>mxcLgPY8K zg>MQTbW9bDEsvrdlwC7syzaw2Ga4NOX)bjupnslhV`I1lK9A&eS;X_aU`_d0tpkFI zhxBVa@1hA*l4XU(LW<6dA@vk)@N~rpqmR2k!xm1sjC30>Si?mvXNNd-x~Bk#lLz2I zWMn}d19~86)h4CvO~GvGb{(8i4zVrRRk}oO`PH$X_-tcgiKM{l^2e&MCu;>D^s5&T zk|N^t4qm>X>t(Ir6U3ty*^d3b;S0llb;et@urKT4dpOII!p< z|NAHJJ3`#2GCRaiK%Tfs|K|u*Lxgm}9LPZ&jYnm(z$XU*$~8M4iTdTSZ$jRQgE>S? zGI$J0RAG%do?r-IKUz*}CcIGhik0el<=@(=$V!G{~KGz=6me zA;Z8J-`=|j*jyenVi;v_7T*%)0R-Ugvc<)AyUYQK*PLqes&Pb_c z1z5QKYPUWy4b{Y%SQ{i(rWywr<%Lngo^TT2xjQd|Y2GmUz5>6}+r$e&c~cNNi_bka z?na9kI1uRCpk)kvc!;s8K`T|##|=8ca*&cr&InMeT;sjNLlx!c*0|-P0-edh#usq^$Y5zdKe;LE|DSDUIYixmVz%Wctp)U(at%6 z7}>(4T&`7b?1}_WV!XZN6UuyA!yzp1Dm-b6|Ja$Z?%D6fs5Bjq(I3Z+m(H2D8Jq2? zuO&V_ky^8(m7T+jy{NR(irHI^Pit@Jef3W5zkK_;j&>A@pn$OA{*ao#z zS(LI3wFKTyRP9XQakABOyAmgj?*C*(5AD{!CAn?^QHfjoWi=eBn&&sWw*6X zH{)XV1%wBhhAiWs)Do~ljbm_cF(nD$+^Fo1g4>jq_M&5+8&C7f%0@@sZ_Y+btc)sw z?w08fW;Uu4qlmgAH3QB zc|)1~6rGfI56+Hc7tR_9w$->3$J^?`XYxh1O04_A8)t_3^2G*O{>96S$F;7!Isyaz z_%|%xM;yp9h~G+FY>U-51B$No+p8w|EGGMx#9Hjt7i__s?$+o1FFMrfEu9c;j zUNb$wgc8>npO6Pv>!1xn;XkTAT|oI@1<<(+zNZ!otl8?q^$#(tb%QSG8iYKI4|OvR zSuW(MJGWSyfIads?^G-(ubrb`ihIz=wlWC3;bTqn#Cdf6TrS;YHvj^XCzM z$;>!<0e__C?8;r`t1p*2JV&$kkF0jbd)5!L#p z15qiI(S2J99UMUp1SC@5?=vR&QBXosvrC@yyDWfRW46dkV2yBQEGxAMIw0Ib4!qZr zsXbkUjqb6^inh417i|F{%XZN(x&U^3{H?WX1lxxSA-a=givrT~i1Xf=xvkogk~M-H zgN%ygHyhUrgNkRv-=?xk9Y_}7cZPG7Y%PCbi=7l}>UTBT%5vOdf3AlC3+=5MB%1m3 zq?Zs9RM*>VPYJvnf1|q&am67J1wU$6ntt>y@AE2-)BfQ_OcZ@tEd2KfjBGSU`%t*? zuaR;6u+t9`MRpv-Dji;1s_hPt`eJf0Fz&dLYZqL_mXpgC2rg|~3<{WKwotmYd{~h{ zo(~YT&AG_O!1;97Sb7Kx_$&;I;9M&(m-MLb;9C(4S3PG>g(%&mW99_G5wXQU7N-K( zuXD~#FI2Arfb{ui>P^!pBk__c4Kr6#<7j%xrI?G^iUFhefkfQBXz4dc5sxRSBWWP> z)!)B-7edaHIj|5`_iXBp7zwf@CYt(}3Qkm~3yv?et8OkisBCX6`sI@B$(AS?K6Nm( ze1BCrw6zc4e~LmEyNy{C-vK%XeRBgxY}%%een%wV^l|&>S6m0gH8+&h{Yj{SHLQ6$ z-hpXx;BB331XI@P?9$HEWC|q=_%#tL`WV^__fivK>GM4QR# z7Zl?DUyp7eqQ_PeTN)h#bQa6S5?f>Q>3ct*S5CYGdn*Tt7 zPhtel?r6dB@7@5Xw2HBw{H?RVbjpl9Fi6E?e?Q~Z^Wrx%sly7T4L}qvY?6FC&%Y=t zU|yiqRlQ}zQn}xb$1XaR)c%r?No@UH<1MDVsMT0O9kTQr`U!rV1q4RU_1o6QB74q9 zpp!_@fQY67h+!k?@uTe0O8=C=Zx|@Ucl9@ds$p8J-QFv!D)T@&OY9~JAsw+uz2>sN zNG^E)Tqlp^4>e|Zfy-C$smzFtE2S~zGxUlDK>de#fiBoG{$oF2tNDXBwD)$CVGpof;rrb0ZA2rid(>6S@r_tI+}n=7C-(*q*F((In8X*CfA&@?rY)J8dSgL4W;J ziJYT7Lqp0X{zf{OeP|!CL};=>K*8dfiyM<8iTqbDkp*A-Y2D3XV;PFP--l}5ke~eN zqRjT#ZSE8(>FO&c-bMb=&4T%nK@5_v6yOs0xzxW>Qbc`x*l`l6pfb)$u!7vp8z(&Tq}&mi~SON49aj_P6<6 zL}mygmjmtk9OUU=3jeUed+3Hg^@lJy029-&ONXyLdAI@uk}%o5M(^UumDu_>$jZo03QQ#j%2RvK!J%7#)PS<4LU6ZGggMD%Pt|){OCy^6#%Nu96o!)lkr-bG^%%5Q%CCU> z_m-Bheqo??dHshPi;E9;Pww*F2}&Mlmx-B6K(Pbxknq3uk*oQHhR^4V1m@5eb{-LV%$zPFNyYb= zP4^$(l9LA$fLS72HQe@k=m z(uE`B_l=2Z*48AQ8AEzn=p~jq0xQ=v1AQEarQVXYf8Nu-$MD?Vj>SER3xH%Nakw~f zI5Z>jl7e+(LtRis^{Gs)Ur#b5)((W_M#~|3hIeaNxkI%6x!r1Jd>hkb(f|@DV3rYA z$&;ZiyUawo(IxV|%!N$Ro}Mx*8y|K3>5V}VlMwPOf|!iVE`I6{!${E~G= zUHy%L=a^HblFx``N(3}mV$)8AJ=UYpSIod|q>T@PLXE0_VVpebWgD9UnJ`7c64k>V zw$p7z-$(7&GwUtDqb8v9D{%i$c*pb`GC;}en}z~^QLtb1JUKsoOxP>2abQknj+ zamyjrI>P7>!USFKb0nVfEbpm5{ZQBaoYnO}*b@fyWO=qSU+qjh>R-hX4~uzNoiQRy zy`lHA@^wrVXZhb zG6ObLpOs-hJfEVJw(HHc*ZK$KdxUurzQE3l1*KaR^453|Kzg^bgJprgaBKr2U4XF} zP;8O^K|ox~uuC0vm}R`xUiDKKW7wCqT32kxitRMOD-A}Q{e2^rt1=Q0h}U1ibQ9jX z1Fa9Dgh@flKKaYeXg*GCju@p0A${Gd$x^S8p%31C*P zBMe~LkY%bPaAO9HL9OWhl5%noj(4v(WJCH520Od#-?7*T4~_^Icre*&JmD$}xx0iT z8kyJzOU4>5XiuMa z4oNEf{qQ6I$M;H3vM1X3|Mk5xtqRI-Sp5;f;Q;lA<6kQDXI#0*F|@Gh6S3BOlW%oj z++X}Xh&^VDxx&H)76Qee;iUy6joa(QOr~X;km^GZ89suMxa_wN z!`fG1`>?w%_>LR4CvA|!WvYsYY^4$wg`RS26rB z#NV3XaIx8fa0LJ-C*oN=6tx&`sou8NXe4Lbf21^y7D1L->bi2~0wF|gZB#P-KhC~_ zAa|xDKR;28L4%rboBEvS(O`)i-7w=|eB6-#SeXI5EIcQ~DE)hYSG(cM5M`t1o-ZVr8bl0_;s-ctGMiOs7C$|>7-nGw zSGamU9iC5*jL3}Kj6kRf;SJ#NIPiu59=P`PH&tPif(NwVIWS{cXg)PQAvw5O^e=u> zHCI=6u1=q%U-3fFi30*smfN3J&{&^BAEHvD;2Ob1GnxMiGq=xTX()?MLL?m5{XiBg ziKIhs}zrfr6)h24(Qrs%5B*2BuqyH(|)6HD+ zbYgH2!P@~51QI^wjyA)G|9-TN#cDO1oTb6tdeaVYW=r*Y^iUR3$RKwPz0IqGwNvaN zDPu}2dn`sx6~8!qKt;jbw*p+NHH_CW5#3=Dg9x!zYF9VWJBL?MP~k6lSZ3Cgcqj0b zMyT_ynweVXxIMCYjp?cT*4u_eym@|58C~p}xvkc$kLwD^LOP%+J&09osV8gbFF8xw zUnF#U&e%+T-ghcj+wOL52zlcbq&RGF^%^AmQdajSGqF373F6s;CUf8TYdIr(X>%I? zvCV6ltafF}0bUMr4PWE!V9!Z(o!9BW7~l`vz!2i8`M;x_Equ-Ysv0;C$3i^y`~1j+ zh#q+R*?HGFiHBqfu2`fetgWed7vvboM({7-46jFhiS-tJXlyf{Z!PNzgI57R+sSYe z1i*0ehM2?FGvIv_IF!Zwq7RWuDL+>_e8OKgKI~-@T%6_{=F(&s!97HjxySYI_?`)G zR-Z&d5cCgs0yuR(N<}YSBdEoW8ubfD^ToOBA6|?|o87NPmRd`=en*yIb?NZaML9SF zFYwGADsb8jj%OWuXg~91nSc0FdHD3E#afRb=Ig(d%fIeLcy_DkCigmTt-39+1mi<_ zHLlBI-|Q?;?$Hdvd#K$vL5{^cJI&hGBc6haAGK_Qp;4{8-=~f`Iej|pyRHz z*;I`Y&SRpVmFcrNwUvW~A(ziQ&-gPM5wpdB8tGsB)7%t>m1Lg4n$}WsHmvgL`Fp7D z5dnB@@ESU*Cff?fjG44XX7zGwjiWlHqRDO9O3+6Cuo8%ejwF(xnAPDg)tbv5aV+EN z>o|TOVPssL#GCt#J&HR8o<3*_58VJ`WuT)OPHf-FH+ahG2%a1vg@@tR{mvV(x*?xm z`szS$0vU#C6n=<-1TM@`k$bb|5gv7EbAJurri>ph_=l zhU&hFFZOpy#70YBZh8a)0y;8uCS(O~`mbaTgO_W5{3gE2JPJ;UZLf8mYAZc0y|QoO z+mckLvfQV#-YNxl`aiz&YZ84}Sz8frssq+pTjg*wgIn07FyFUfF*w-&hIK{VFIx@q zcZm-TGA0H^1VTugPq(fx1y_IThZ0bqx8V+BN>tmVo-_$>Ig=#?AAxqKk=ld&cs7UST;`T#l z`hk}E>8Q26iAD#pYgu{R?W+7w`Rteb``55!#`K5nfefQ(Z)xy|uY`OD84uGa?8)9b z{>QsR@vlss;uC0HWIxjmKX_!VcJ^4^x7KdN;BHdn0g_??80t|?k~)H@AR8*66aIr|_sAFamH zc67GxDjWYuVJ=3H zQ#j|^x(kk?lrYl18Ju!_ewNI&J#Uy=I-q_NnrB?hN_vmQ@Z*NOZC~j}|9KFJ1 zuZ}K0>KHw`8G1RNOgH5E;cyXW2UQ{eVOI5Y`^W?K)Hh);-MarBS>-hwPN{nDnRHr7 zojoVmcoe~xVkaaZx>G8OL+kFkl@IN3dZ|53{suh^YWvl5NLfm1oG3l3I;@)Qv6m2< z6WuTZ&ej{9#TL*TJ3vSF^`a4edq9dyBk^|kyq6j_b7;9NcI{0!@kr7c%|xiBYCIp6 zBv)u85%6($IqOZ3v+FaIGElE`6u4Gw+SsrLPq;vE$0>#Vz4~7hD2?4-yS#urZ6UUD#KCqlDtrc>HyO(t|QgfwXf8=fs=f#-R$> zV%8yD4Hz80JQ4utE-g7}cO|d8q1^Cgoh_x18ZD24$15P=P-rpr!x6}0o+CX4E7EfResJ|kn3E%3BGA=Jw{h5=SsS{E*Scrcr-a+N$B zF=Ir+I4YU0VXBjUcMuY~62IbdwkE!Dy{jf@_z1`N&Q8PJj7X4!$`F>xhuWH}0^_(7 zT4*3=K-XjP_}u(> z>V{m_`xH|X3f|rY<#{EwED?i~!b!|ONn_HF5Xg`2VQ%WNC;kVdCrTCid5aKU57H@a>t&|`bDrmEWU@%tuk{#w{j zwTIr3pR<`Q6#!sj;!Qiik~eS)`ut&Yc`t@a*fRHlxal3b#6ul_K|AEVam}dLq<*=5 z_S23%wCnElM!))KGh&DqI&=ZgP|i(~mjyu5bq%cR`YG*+Pq5e{Xte=$?Xn)KMM zZwXr*l9C z#y2U3pyN2LxYF)B-IK!rG^SPGrx4v6FTObORS#Ni(2J!kn0z*S&g*@=43Jx>|1#@m zl8D>&^Ha{@IiTN(F|ry>bmv;jHBBFz-4w7GkXha7HWmRikKJ6bp7Yn%bv`Dw z?cxl*R0k(Iz3kOU@Ac`eoswuhUT4jE+#qys5NQNm4y()QLvx+&6v; zbMIL=84pyclgFXlQ1Sn5s)5uNx88@Iqop|C7}n-NK7XLJ_S#fNp~>1bxI0f{gn0P` zn>E1!2{yciKl@u4@DEM4OJ@HD!cl|v9K0KX6 z%PEfF4b2rfpJw&xJ}9fC3jk{ql`V?X#dmlZFW@D0f&xD*fXN!5dkb6ixw??-gaDxdiI7S+WpBOZ<= zXck`9`hKik(XcPNo`gf~$MxI5O43)%vKrs{{Khj_~KGg)Ux z?}Lo@m8pnPFodjJ~JZ96}7AdZf72)hVy6MowwHR zEC-kqAq>PRcOHkBhpiDn8%etipJfIG#;Y6s98%TU;;g#q==$@71{HTglSZ~+x+iMR z!tUMcW~<{T=he=Qk7b2Rem#eFFE;Uxdo#BSG5ni6h#CVbBkoRvr+b}$8yQhMmUa-L z|M4cN@b)i{*X-p1goHmIr6K^b4%iBwe99xA0|F+x|Lz6-Oo6$W-4Jx$%pHpy4WHj@ zXgORMHu|@5%~mfirm0H4>h62HcW$jl%R_&;fKu(4souV-VG&MD)=E5jT4eR~`5r_* z4*BTWlR?S#Vj8^%slS*G{wIp$#HhZ1y+qQW6ieZD)eA=n??)N*dzS{V%fR>#S()V7V(;6Z6 zsS8`2hQo5qfxmqe7tisPTOwU@T}((h9vdTdzbHu^JAEf1OA^QDharK~Pn^i~AwVX; zh)ep{cZ1Af#lnXgDp!Xa?gf`&NN5oMUGj3_=(0GVib!kOT-OUpe86RxVc>v3JZkrc z+|==1urT)2lK~{mmQkbX5pF!My>}lm8)u5FP7yiiZ!p%J(+T%>jI%GRQ;;(D9g&Pm z;%4fXNi6MDbt|*%yL8kltGTLTL={h3=s*;N!^ZQD(;gikr>fxygQhF{<0otL6g6oe zICm`I&KC6})hqDF(HCk#-W@eX_U%8#T3qW}H3Q#HzaS|8`Me6-I#}dc4?oTw z(5|e!g5q<~;>KX}B}mX6G(W_X6HVhK!7j9UB~!m2lm*>Y95u7FX2T$m<+=I$vGs## z;j2KoimZ3;XY%+6E)=hxl8EnHm06{}8DD%Ze%H1V^)@B+?KB;(q^KAFf_?4>Ya}{4 z;ZaSn^0&7c@O-kv+(W~3vCnTszEVi_YFj&nXorAQR*NRpsaI_%TxDtPSP9WQo??KX zXJH>@)aG{m-ShW+ANCk=JGMH880SyUISm@XYRvtC0p;RfyFF;}HfqSqJ#P^<=rlHS zEi^_I)?|gw4`yF9WtOL@G@+gpl=rEcDMxhdgQhx8()>b1pE6|h7xJ2VOCd2joOY;?7BJGQb>}T!X3oDxbm@WdY%o2kGKslpr0Se?*1~*!SCiO zZx&(IQwn}Y+~7*-Y;(Pz^9|TOH0(5pHVn-i^G1Anj86}@R2&b z^)0wE*_`D%{xWmG3`@~f4dqNv`5Q{Sedw=wcc!pwG5_A*@(5!0(!))D z7l)5jZiJufZ&-fJ0J=#%Sc8@=-G5kh+v1%ASE1Lm`_H3SXji9a9v>##6tc)IRc3s-$w3xtLt(1fq?@HW#TpwQfy4t7# zG94}8)f#6|sYUr-Gir1ae_hSPdPf`&k!`WmQ?v5Cnp(EVDj#yH*vdg)`@>`&6q3F*hMjm&$O-1Q()L?drw-Sz5o-a9e z{vz|%&d(~6c-3bdM$ue+>+UJRLxZRMlo5g(;*S|`bxDcucCtHW#$saJn zM*I96mtNcSOI?;x8?05ynZPE|0!u-FM`-p@Xn5y#ysH>Hu(Pg?2l!hZc!-~TiymCr zGP?LtPsBlINnT#8W2vcO&9hONC_Tizc=CkqGT8uCmwL6R?%C~VVjiI#2SD1TALyT@ zX8dux4tM2XmJzNE7pPJR^z)zuc{t1>++bV0+C-H?(Sre^rn@6T7TmTv`)f8|OgQms z_Eg6~Q~;}vI@s*b<$z-6swR z1Mv%gKx0`MQ0N0C$5<1FWUQK(O{XdYBEEdvtZ_=ZSMS6PLOZQq=hcNuibF-i`07Vz zYMoEc#iwTrl}<5~c2*HPxee_Q%4TsqZlOgPt3-8SI>i7uW?^R>5|p=r^}Jtg6bW*= z9|^;=5CHQ*nnq_}t@YKP9$F#@a_u+I%c~K9P?OmG?S;=1xqnlf#N4|-MYhkY8ih?; z;~kvYCt-DeC<7}Nk2!ZKb**_E<*M~0y;_Cc&!3s752AW=o8Tnv z6o;!u5nU#LQHJaKR;9L4U659rn|YXTx36QH^gOv&%A&@7SD2@73COtBeCb**h$Nww zH&gD)hY{|^}$n_xaT2GwbK#L)Eu@L;cM-zm+CJuYL311(x=mGP0jmw zbPdnmsh9@QO8T1Qen1)JQArc!(sWiv2F%E7fbN*wTspv1rX&`5jdgVbRgiLUSeMd}W3qKnLD~{IMnRJswlgLxNGR4hNgb7b}M!=WA9s2AjsMO9R%O@ zIN+J;d4X120#gsH56Wy*?EQH>u-HsZlY$??l0WSMr^2)R#wn>^jf zg(5amZO~Wr0EI0=jL-Axq17lZj{49?Xpnwf+0}9>4tRq|kbfjQ^J>!R6<0|5dQBGk ze$LjyY+9l+k};js7E-X@Fb#SQAK~Vrn^;yCyA32vMo7_uQ`2e zi05?%onu7&Wz{W>-sQ!g&`4#!4(W*&8Kobnexo*ut;BBhPyQB>U>8J8j|>oNYrnVI zEgDxgDZ=aJ*QgVLhxe?J0(J%TgODSG;m$TA6Y8(jiII{U`?t5Y1NCEl^nGh`1UYy- zdbNY6*Y>OK%n-@+@(b`D4aoH@<0&yFBFW{!j7sL9$tR8B%eYlV#kJ~*JGa!4EE5a^ zzaZ9Qt<%IVvq~9>?1w`izxgYmv+d#z3pX}}%YgQ$fu^Po+leMg6NadCpe9_LY!-FoB=E%>C-;%Z?Wg|Mi zF@fmK>RZNCo8ZrWaY$>#Ucr7W4p<&V%*+g86*f z!>@%wPBg$bm&>7yIOW}f`anEHyQqUn>V~ z9a;Y<@q5)Adu?+zcF)QwiJNY)Mr`df+}+t|Q=H=v_*GxfUhemtE0cs?X$@^X2auC9tq7vKVZi^aLNY<%z zGkmXxUIxnhzgmF&A=*@jK=6p?@Bnc_T9#Fx|F!4DM&YYUa+-{q(jF(TY&H68t^aIg z*B5$wmi%W>_e79D_t_MjXvbi6DT~gfeywmo3fE{hmFh&$RMbYJQU+%06kZ084sm&Fv16gBinqbqeR@3>W{i zKR1`Y5eF$*WJ+C<{QEc9D?@C$C**<$)m*c+ppgA~nrpBmnoqZ3z|Lnne}4tX_cX%v z4J{9%qVJC9Ixz;8dW4ZQ{P2#fYlm41MCp8brZTM;Jyi?i8=Bzdb4Vaox4FlWXAmJT z^?2-i+)SpbWq2bzG-&x10bw3qM>w3l@|zC}&e@*?ije?hWOD;GSB+p)&I-IfHrtGn!m z4P5%$EcIj~0|2{#rF|P+!uyu>Q>cI>^4s;3(ZIhChXn*g|M%^}<}8{{PttEDjZbPL zpT(CyJ-qjvyy4*5#SJFZ^X|0bdI5lBtBN!YDI7gG44}!*`nb=>uo9WYsA5c= zao|IayL0VPGa3^m^3o^4Ro2d0MfYw0^*?m&hI)v`y%g1&*5;v8!~{HuDp{!>J=~rw zc%^GJ*d1GJ#bN)&oaS2eKdH#97es(3b8CFtUQS`MtTLx`a4EzcPddMHgkiJ{-4o!k zl^nWivtKV&ojoMMPR2GCv!vnWvwZ&h?8F6lyLv+HKR&O|8DA_$?~4TIb7b)vhvoX5 zMqk_y$gGHvOAmh$zxP&BP6CwCMBxZHY5~aHHGi$Nw+7m7t+)R3Zwpw97v zs`S1h|5oT|&AI|F@s#Q$PStwWBB1G&y&T$qgDq92TxotQ&%g_$Y3sQ@m?W~fAmg?P@ySBwBfFDFG zhQ9wL#U)RF%v+|L!@Bp>0Jp%B-^i%J1u!~bxcsTB;(93!@ZF-URYUG-@wn;IcCj=m z;=7e+r<+pqy6T{>t#@l(6vB-6Rr8l7fwjzt&)@bV;dDpHt(^->_=RA#ab`MbZ1_Fp zdF&)EBtmR78R6136+_XVGs!43E#*0Xm~Q5tf5@JL9R5h9UgB+^(dqfkkVHvEogqa` zW@j8+l+yScc=h#c+@Dz@em`;u2wfTz0SZ2q*)o1qdP-OSZTVOfr{@8k}K{8k`I?J?3j2*ASwD>1~UG93-rpJa5s}d_yd6 zF?7=RpQr@Iu3!PRD?eqvzRnO&a(eN1p88*Mv7}#iE0?Yd)Uynw2)4+B6c#3R22jK6PHJbC`d4ZARs3-Iq z7C7FnMS||@&;JaG1k@M<6RBR2s*W`OYBNU!ByHe$Y+3+tLXQ&;PN)qVy4I<`U)`*9 zs^-kkm6Y8WKZeJ%$Dfo1VAQa{4gYHq;)Xf!PD5boDpX%ms z;o(H(^JZn=&hl$PxmM=U8q}|d8yexM2b%r=F2W}0UwhDbS|(^hVKY+7VO13-S?>4n*X-_B(C(e z=+S+)DIT+B3!#X22S-=>!p$yY-86|Xk*P)&za3l!T0Mx%V58bfhpGV>!+>w9L*C~ z2^_e+rRbkO|Ik_X95SRgob}UU;|m7)4Grk+&gMznn?w<%P`qYxM~SA8mA5xe$Byr1 zoJX^#P8$cGR$I%)K9e|Ky_YAQWQQN8W9ieWc6(dDwS8VmFkjlcu|^82UwzF<2W|Dl@W)&HIWH4X}|g~x+^NN z_(3oha3nEd=(~&`8o0X3Bdf991hjjkkO^7FZ~1Xw(Pq{{SAEJc5UUUXb|mO5b+}#3 z9526)aE+5~IFFsaJPu8R!6!gB#whK^n1nuo2^#?Cm(CSzxj1%+KuwjUd7^O4K+N${5<>LmE8LMDA)Ds zrUiTGHXbp^#|=bE*J%P8(E!7Z{Fg|8(e4R8G}K>dtLe7@lk?m{A8qABuf5-VXmcl* z*2cHHVQO&P(i6a$Z~xP-f6KwRv6i=LEx(JF)6y2)yUki(<>@y&R(<)}y*f`GUF>f7b?)Aa(BADB!>Hy5-;g-lI6| z^stzV1m|QOej6HGR3iMTRXbR!vV4<=lkLGsO~9)$^5wk%#4}6TCt9Zmv*BN>)Jb^o zls$`YY?Ib;YFk4Oq*-~db-3vAN!n{*8lTe6UzOp@FdaOULl8KB<-O{17Hm6U!4jkn zo!4p3yO!_@sJmMDx1BNGHcys!C! z`Yz#P@E5CJ-KZgW&E;*VMDId~gS%N#kY1S(`zw=AsD2FmD0Z}0U7^N+crQd8Rw#5& zBaFk$v%0??NYA!!J^<&6UlaEQQ^uee{GHi1x-3K7&F`U66 zlUdS+gvVe6Tw6NZ++rK&G1V}HFxtHd;qmMlA)#_6y_W!J<#oMj#sSFYIqH@}_9Bp= z2&f_ap^X9yILPyAuB;gVyY@F6Na^HQ!SDJ;CVB>hFJCq;5_;qIOk|`1=l5-$f!Fm% zp>6s8aC~LLB59nZV}H(#JN_V0=f!tpJ;1{+mrOJTD3|e&A4m$&VgI%YQ$fy%5aKo^ zLu^v~P)OV@L-)n(10ByB8@v!Ah49*_cTs7n(u%R<6)}>aSAE?h!8pI@Q4k6Fcor!f zcC31>xY<=u2_t%<$dyArMC7IBMWzwqN07Zo0w5`e0BcPSHK@dp^JGd8B!TWGsdTo% zQW6Aw5%6w7X5_JxFBm@}5WdV+ybD83CF?^ri_M~FFP*Dy@*1RM`~RLL7CBcApQWT- zZ-oa=QF4eut&b0xEh?RR^j06+J&996r|-+o8(`^l%P}|CbzJ;~HG;rRH)J;qXdOOY zhs`vl9G}M5OBtCi9s`W=z?=bq_wVYdmI7-n=9*vE^rdO*+_MEgPSi4cY}KZjzc*hL zfSi{Dn$Z_N7<_M2%O4_^I!a?EscMgr^g>DAFG~E98RS)z+1@+#sYfDO>DA|Pg%93- ze6y|vah91qzcFLb_BNWmBYt}~%&ZDrp=cbz`|2s9)zYH$|}po(;HMR(_0y5@#o zq>qIZA{4>bY0I2>IA0#&YtHJA5SS1`5YnwFAP2B8TaPWbh-#D}(!?MfCcc3G++YD{ zX8Tqty3D4K#3SAdj#TxBk90GeFhA`E)s$R*#G|G(un4ZoP8HeB+Z!*i!eDzzm_=Hg zx#;nKf0p;u9@n}IFd%Jk*|mOe6)WDg0~S{MajkgHpoXL&*^CrotPeO_j{L@+W2nb{ z4NYFoe4wIKvLEJ*`kgZAgE@r5o|bUogTH3vbR7%2z^fSQwXV=y@TdT-~>Y}I+qyu8-bHEzys zwl-S68mfGhM5CW*2K^C`<`eM|615dA_k_&g6g0fi2=b!A8bT;nHZ!tKZM7J@blu5{ ze4Y4+^2^*|v_Sb+nManF?4a|xov5Ciwb3^HxT69hV1A1CWxy@25wKArj5#_A4m&Qu z`WtHdNv{n0z%@>}hNpz3vB&A@JyIVDIF|nk0%+CQKI(j)Ouee<+bplDmCC9)C;bsu zlXlIMs*yIkB=U=-I!kznuyeIj)}GgY34|P_p)zdrxcz#2zK?(f&p0bWcC9^8SztsA zg`a>z6}!v?5@uNk`O#OK<9%qzaOfa*W$V=$FPWsW? z!CR2E%szKdSVd;a@{-!v(=SeIidFe;aub@BORP$iOFttP!_#w9QN(#F_V=$ohs&{9 zOQ|39M8S-atD?h<*DFzfDZwhax{->ukAbv#r$^D<3vEN@*mf}k(|Q}!` zFW7y{*JOd)g|vYP&^1+?1=<+-mO;Y|8?v1d3PaQlc-e0XWjZ14D3;;xF026n2%{7G zPCBamssZAd+(rec5ApW|v`@H)BzSK3_s}qB8%B2yLNh}JjDuY69qe*aqLCbJGQ*-& z*J0rTkhx?w`wEYfD=qEezVL2%z?L`L%tV6kMcEm3@-i_^_*5o_5H=gBbEMJyxt`er zm^v>1*IXU7SNb*Z^E2@QCSSI1N`y$p_xl;yQ*$HrgVUa7!QZ$mk^-c4`BL>K`}2~0 zL2TIxenExinc6xO-Z6IriMr-2EayUe?6jAOj<@hJ8r%56W3NCRg@trp>k7*rzi5_Q zz6Iy>COc8T?AM|bw+$|(6^Oy>U~t*q{1MMBq`L_|DG?cP2kZ8G+p$F zg1reIw0Y{hL2+p{dzuA(`z0^O)(idP9h`O|-N*G^@@@K=EnG7Ha_q=fU>4UBFj2bx zjSF~2N@o!VC@`PRw%Lh0BcuXM$j~bZ{W7Z)7M=8Rz8`zcaO6v(6(&>XDFX)D{Jlj_ zdlF}ocaF4mmL#0L5Bva5vVXaJ0jWcc9YS3;JI>27p+2mX*8?_BmKXr(Zf_Ci=OJj9{J*T@f9>Bc_8EqEEx$BVUv}Nrre_t1vQAq=~h`? zWQCgH9Z28=NxLS09v<&Qen#FX*eF1&C$=}*EW;%C7yM%V2heF*1dVXPN59E?V{2`< z@sv#Lz4cg|MCPx%|LY5P4tdvHdOWfXYB24W@if4T@eDnqx{bs*c2F!JIe6bG`1w_@ zV9!9@;n4g-FGdd+9o{xEb89-fAmXinLzZ;H-}K4P(zIui-o@;QqbRqCRwCrxj(|#Z z(4I+=-+7c)=_rH-Z@Q#F3;=Z0zG3IyR||fiF4140uj}Gq&IlZVm*%6DM7l zFY($k4okSGftd(^!w45fd^L?2X^dt(^lW?tz_wt|xMl%d7PWf_^b8aauMKd6@oquu zs@?0UF#BL<)ZWgNRJAvy939QEyn2fJuIT=pMW`un5u-3}s~BNS@8dfl^2x5El-H2} z2r}*AfJ`02$hFX+zt1=JE`)tI?#|yT(2JdE76+xiz>D3V76iiMQ!yC`Ujtze4IkCQ zt5aV73}IkV5gAzU&L-vU5p4>ip2%&aWF`G^r3rp%T+xOza~_tHauwam2QlDH)$dQw zAlJaf1{r^~dhg<~N`>nWhSM&Xkf3|#h1=y1`l7)D7qq%hUIItB2!9b=Ym3kjW6pzET&o)X;~BxFB7g!7dylwM1W+-K$!W(u z&X)bNjjm#(X<*C{77We<$!;9YB5#|HY=$m3uNlY+&>H#=E?CAsq#3u8eC_&HsUaN( zt2-;2hFdj+fUoJ0>-8oZ6$ma+{&>H4dzNC`IyQ)1B(K>Acb6+Zz3wcHV-XCJK6A_G zr^YhzvH1qSIk9EWNtoj816j}f(y4^~q9q}_G;T~r*W(M-kasA#JOB`~tL*DANGM^% z*HRU$Gx==*q3=;rPj8CWyhCe^*!PIs81}lLoXDFZ{pA&|E8-;(5QMz>2`nJEM_gs_ zLtDr5K;4a`G3O|9Y>@qJWz1PM>QGB8#swh82L2La(A^~uJ2=`zdK6v%QK(&7+V$NS zDtD)iK?C0$1)LQNqFEei#tqrs%hA#JSnsXJ5G!mN&Bdn#f1WDb zU9o2&qj&64Pw|hv13Bp}*QO#aptHk4L7Y&0NfQ~{whsA7M7RTMt3{HaML6NS)FJ~aXQD^Ve=X}7alK7TyPye%a0ya&zRT-s+wz9b zYW;H<0zgG=G9I3fJARoKQBZt2$dkcWg-lCtkuJtmTqgg_HLGKPy&x*$b z;;^{|wLYM(I`_)^Mt;}3@Kbq9987f)-O$IFB8Mq5&&RlMOP?_f<_qTt3{FxG; z(Ir;7cwP57=k1$6S(+cei@r&XG4I_dRl&Tko}6QJDKDhel6$PKX`xWPY7#+012lTv zrq~Sox_{XAEo5}U1xOh2!e8R0$hhOXY-TNAa$1i=;hUwgMDD&>f_sEG?dV}MZ9G|xX8XWZbJSLTwNNzX(hqc#Kt1CDz&YGMLJ^XO9y2RS z5psPchxJ!l*f>?h3x?t74r>57#GYr8ekBGZ6P($(tdDM&>IZyz1&!#H89sld#L}o! zsr!01#+Y$}9ue@{Y%j`zOs>Rmbx3K{kg7%t>FnW{mO8Ga%M>C2$(woS^X->oRxCda zu9clgLBpM;mS%AGqB1X`xJ7TXV0DQDz3mf5=z6rr*p$nISW8v)_5D36sTbVXdg58A zZX~9JsJ&8`&*^)j$S~EEqck&PbHIwuhg|@lCoP{$7#W-Qbw%7(@&(L-t?om*Lv~qY zCkc#Y|B9sl#TCVntj%f{*_!KHSy(A%Z3oMk#cLDg)y2bIE@@J@*x3lsy-;9?LFP{E zNkWjxvSWucq;;0cCG4Q=hR1ta1%?;VsLA_LlUpNs3z*T5aP{$K(o=+9#hih_QTTan?iWV= zGYqghY<}jqKYuo5CNQrI4MQB^euN_cuhh&+@Ho-Bp3v9ZJJ!0XpEN!I*!BBT5NjpA zNF)hsS0i}fIiQF#RE!e<7c z;0b9&o;Ogdi(PS!iDc|=Pk%Z!XPjEuO*Ja|Euu(9BP}MGA0IlW&j4D(_O;NkUTY^t zQ)SijIRBdeiDgf`k*%%LLwkh6SRHPSo`yNnV$oHEVm2)j)?U>7wD@cybr?64_Ca%L zfk{RtAR{}tD2+z(cKSaJUK>wpz9!qguQC8`;VL zNV#sD70dcQPX<|@tWAwMNZmtQGT8^WgBBW>p&IhGTa7H+8&+UNGwPw)ovXsO%RfNS$3v0+djo(;#xv$d z)OF(>ED>gZzMBHV?EMMo9x(*kBxY_Rd3XU>?X07t@u;i|5j9c+h;Q{PHz9F>D^|r{ zOo00JRuR6)1NjN2%5i))B3eDTjus1oI^Ua^90R8ek;^bER_bXqGm9yGz)1A4N z*H3Fd9J=yVC8rBkzhx1+?H~?!+--unRTH5HBIsUw1Jv1_p9{)a-svMDbngH=@2+ck zMBPrfJX)p^=kx1T^#A#;;sE4~ux!9t-%Lw1wGr@1j(LUP?O}I>s7>Db{rQ!CZMZJ_ z47j4P)sAxHp#cWut(qrOsyHrXbn|$nPZ6T^i@q~5b*et?x8le zW*umo;p{u@Ni~P8sNOc;p;VpovSNz9@>3c4jpXKH>$($7!m}p}3`234;E! z2>>Z+djI4`M(n`@-nKn&^=T7#OPNew$HSF=9KM|9+<&-S6KP|aDULJih51|zeP$3( zfnN}sOkSO?qjUhVMw! zN0X=Bxb(US_te82n^uxKzL^Sqsvxpf*43^;t51DZLxfR7*GL;!oSqivM-W$6I)kS1 zFSVtcYT57zOQ54THl3gz0<04vL!ax4#XxAKmZ{xpJnR9HXsw`)07KZ$znFwqtXc_D zS3~LyyLzQ^&HHz>!nWgciGMi$|5D7{Zwv!K>96G@AB@Gd*$3?IHJI)pG6Jwpw zwPtkTR|F(+7p8oP$(I3+Ga5Qgy70+(3KHG_7wF)y5y0zMtrG`yQ%&&&?O^ukS_2@Z zdCXlRmTM`!bHwPERqsQ0Z!R#0PXMsJik~Q3gk+B_^)RF&i@DVCe=>xILi$|j&R}f5BG&L2%#N*%8f0Rb z*jo(Oxk099q%voTMWqhgY{*uQ2!Jk?>-8npTBW0+?JMlyOv$@u7P$5$;xWQ-x7h-3 zf_-dY=3x=IIYQN!t4w~@uD>6G#ICBQmrveYl@c<~&-iwx33XlaBL)q;$FAYXjw`b5 z)ghOo+z!cr_6+11iu1w{Bw-^pr+cJ7*ZN}g@x7`0z5)?42bDvVyL+;`H_1-vM*RZy z!AK(J_SX}H`01sH!OX<^TS(nuz9i|^XrzXLjpImXXaBryI z$qVu-0lJAi<|*U`I!A-?unt^Aa|&WI!Qk64^dt)&9w&V*?%m2WG-`|I#ql{^bgV5e z;H}eC^YRX6-{jWPG8^VKc1`DX15n=Q9CMh{;>-XC?$+URF>DobD~rs0s)BN+hKK?+tDA*JsQ+#^>0Oc;z>ls18HG8nTTnu5 z(K9Dshu-<3eld=UMKePqJYmEcSp(-LDQ;TePT?S)sr(nTIC|J7d`NdPf6&l5M6~q) zRr~vkI=EsuJO>FXS@dw@?35{k1;OSfP!-u9rRYH6A`9Qvg_nn4wI3{_HN3YBE)1k; zy!DWG+WE*EFhYt>`5-%C{q@;M#C#;YF%Jh>Pwfl!0uM;g;XwhAw_B@KLu$<1`l_@u zl*}JD9~a%%_>D-ex7JB!vf3lJ+YAm02utQTYf#*BLC6knb{~80Ig=Q}rGZn|5Yo1U z4G6U=1hK;)D85J)9Z;%8I<_4U8>Y26z;XCctx_<0_1SGDdHz0x^%m*F>) zX0hPKc`H7Zce8SaJCHrBUwSJ1#N#l#@%WS&V{oC`yWCJ2r9eQAYdBkoI=1@`XE(VoNIu)`D3VM0ZrF8w9BoVu#6=GdZmRd-0 z3*fZQspfZ=Z1B6s7{Z%pA zp8Yvs|DV93zWkT(16U~x{s-s3{0Tui5C0^JBRHHow@2EfM8)Ye&RK8Fo#21wzqfn) zxp#tJHQgr5#~NPAU%A-fgjztW((l*v(|TejcKo_FxzD+}%J-45?d2msQ`G|t)Hn}s zyVqZ~{Uva8W_|jidIkoG|2i|LR=>^T3Ff%i{pCh>&7$&vu6og3W$D^qc^blkkNRpv zO+CG4efFKU54ZAo0y!?82Cm1s`!-hLMrP}aJAV#sO1gHh-AnJ>?RnpCtjdY_<>2t2 z*;lr_?gy}9m@VwUt>_ZHWMy#4>WQw|cUEq=$9q@9xJNw0Y`?;RKZ|p39anj^?2uE( z-r)XsS2e5lfijv6-yF7Q=@<5-M^{`*X4>~Dx@L`vt)k1GCq4de3_r<5Pdz)Wb`n!B zg8@g2QN#cALm&5N6jyL5l0Dx7oFAaO-Z#1bzopr0KUAw A-~a#s literal 0 HcmV?d00001 diff --git a/doc/unreal-logo.svg b/doc/unreal-logo.svg new file mode 100644 index 0000000..5d5192a --- /dev/null +++ b/doc/unreal-logo.svg @@ -0,0 +1,43 @@ + + + + + + + + + + + + + + diff --git a/docs/annotated.html b/docs/annotated.html index feba243..948a886 100644 --- a/docs/annotated.html +++ b/docs/annotated.html @@ -3,7 +3,7 @@ - + mi-malloc: Data Structures @@ -13,10 +13,6 @@ - @@ -37,21 +33,21 @@ Logo

@@ -60,10 +56,10 @@ - + @@ -73,13 +69,13 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); -
@@ -92,7 +88,7 @@ $(document).ready(function(){initNavTree('annotated.html','');});
-
@@ -113,9 +109,7 @@ $(document).ready(function(){initNavTree('annotated.html','');}); diff --git a/docs/bench.html b/docs/bench.html index f39fade..d54f5fd 100644 --- a/docs/bench.html +++ b/docs/bench.html @@ -3,7 +3,7 @@ - + mi-malloc: Performance @@ -13,10 +13,6 @@ - @@ -37,21 +33,21 @@ Logo
mi-malloc -  1.6 +  1.7/2.0
- - +
@@ -60,10 +56,10 @@
- + @@ -73,13 +69,13 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); -
@@ -92,7 +88,7 @@ $(document).ready(function(){initNavTree('bench.html','');});
-
@@ -103,17 +99,15 @@ $(document).ready(function(){initNavTree('bench.html','');});

We tested mimalloc against many other top allocators over a wide range of benchmarks, ranging from various real world programs to synthetic benchmarks that see how the allocator behaves under more extreme circumstances.

-

In our benchmarks, mimalloc always outperforms all other leading allocators (jemalloc, tcmalloc, Hoard, etc) (Apr 2019), and usually uses less memory (up to 25% more in the worst case). A nice property is that it does consistently well over the wide range of benchmarks.

+

In our benchmarks, mimalloc always outperforms all other leading allocators (jemalloc, tcmalloc, Hoard, etc) (Jan 2021), and usually uses less memory (up to 25% more in the worst case). A nice property is that it does consistently well over the wide range of benchmarks.

See the Performance section in the mimalloc repository for benchmark results, or the the technical report for detailed benchmark results.

-
- + + diff --git a/docs/build.html b/docs/build.html index 2bd06f1..41e0199 100644 --- a/docs/build.html +++ b/docs/build.html @@ -3,7 +3,7 @@ - + mi-malloc: Building @@ -13,10 +13,6 @@ - @@ -37,21 +33,21 @@ Logo
mi-malloc -  1.6 +  1.7/2.0
- - +
@@ -60,10 +56,10 @@ - + @@ -73,13 +69,13 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); -
@@ -92,7 +88,7 @@ $(document).ready(function(){initNavTree('build.html','');});
-
@@ -102,28 +98,39 @@ $(document).ready(function(){initNavTree('build.html','');});
Building
-

Checkout the sources from Github:

git clone https://github.com/microsoft/mimalloc

Windows

+

Checkout the sources from GitHub:

git clone https://github.com/microsoft/mimalloc
+

Windows

Open ide/vs2019/mimalloc.sln in Visual Studio 2019 and build (or ide/vs2017/mimalloc.sln). The mimalloc project builds a static library (in out/msvc-x64), while the mimalloc-override project builds a DLL for overriding malloc in the entire program.

macOS, Linux, BSD, etc.

We use cmake1 as the build system:

-
> mkdir -p out/release
> cd out/release
> cmake ../..
> make

This builds the library as a shared (dynamic) library (.so or .dylib), a static library (.a), and as a single object file (.o).

+
> mkdir -p out/release
+
> cd out/release
+
> cmake ../..
+
> make
+

This builds the library as a shared (dynamic) library (.so or .dylib), a static library (.a), and as a single object file (.o).

> sudo make install (install the library and header files in /usr/local/lib and /usr/local/include)

You can build the debug version which does many internal checks and maintains detailed statistics as:

-
> mkdir -p out/debug
> cd out/debug
> cmake -DCMAKE_BUILD_TYPE=Debug ../..
> make

This will name the shared library as libmimalloc-debug.so.

-

Finally, you can build a secure version that uses guard pages, encrypted free lists, etc, as:

> mkdir -p out/secure
> cd out/secure
> cmake -DMI_SECURE=ON ../..
> make

This will name the shared library as libmimalloc-secure.so. Use ccmake2 instead of cmake to see and customize all the available build options.

+
> mkdir -p out/debug
+
> cd out/debug
+
> cmake -DCMAKE_BUILD_TYPE=Debug ../..
+
> make
+

This will name the shared library as libmimalloc-debug.so.

+

Finally, you can build a secure version that uses guard pages, encrypted free lists, etc, as:

> mkdir -p out/secure
+
> cd out/secure
+
> cmake -DMI_SECURE=ON ../..
+
> make
+

This will name the shared library as libmimalloc-secure.so. Use ccmake2 instead of cmake to see and customize all the available build options.

Notes:

  1. Install CMake: sudo apt-get install cmake
  2. Install CCMake: sudo apt-get install cmake-curses-gui
-
-
+ + diff --git a/docs/classes.html b/docs/classes.html index e74a0a2..3baa0db 100644 --- a/docs/classes.html +++ b/docs/classes.html @@ -3,7 +3,7 @@ - + mi-malloc: Data Structure Index @@ -13,10 +13,6 @@ - @@ -37,21 +33,21 @@ Logo
mi-malloc -  1.6 +  1.7/2.0
- - +
@@ -60,10 +56,10 @@ - + @@ -73,13 +69,13 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); -
@@ -92,7 +88,7 @@ $(document).ready(function(){initNavTree('classes.html','');});
-
@@ -102,23 +98,18 @@ $(document).ready(function(){initNavTree('classes.html','');});
Data Structure Index
-
m
- - - - - -
  m  
-		mi_stl_allocator   
mi_heap_area_t   
-
m
+
M
+
+
+
M
+
mi_heap_area_t
mi_stl_allocator
+
diff --git a/docs/doxygen.css b/docs/doxygen.css index 7238471..3809180 100644 --- a/docs/doxygen.css +++ b/docs/doxygen.css @@ -1,4 +1,4 @@ -/* The standard CSS for doxygen 1.8.15 */ +/* The standard CSS for doxygen 1.9.1 */ body, table, div, p, dl { font: 400 14px/22px Roboto,sans-serif; @@ -53,17 +53,24 @@ dt { font-weight: bold; } -div.multicol { +ul.multicol { -moz-column-gap: 1em; -webkit-column-gap: 1em; + column-gap: 1em; -moz-column-count: 3; -webkit-column-count: 3; + column-count: 3; } p.startli, p.startdd { margin-top: 2px; } +th p.starttd, th p.intertd, th p.endtd { + font-size: 100%; + font-weight: 700; +} + p.starttd { margin-top: 0px; } @@ -96,30 +103,96 @@ caption { } span.legend { - font-size: 70%; - text-align: center; -} - -h3.version { - font-size: 90%; - text-align: center; -} - -div.qindex, div.navtab{ - background-color: #D6D9D9; - border: 1px solid #636C6D; + font-size: 70%; text-align: center; } -div.qindex, div.navpath { - width: 100%; - line-height: 140%; +h3.version { + font-size: 90%; + text-align: center; } div.navtab { - margin-right: 15px; + border-right: 1px solid #636C6D; + padding-right: 15px; + text-align: right; + line-height: 110%; } +div.navtab table { + border-spacing: 0; +} + +td.navtab { + padding-right: 6px; + padding-left: 6px; +} +td.navtabHL { + background-image: url('tab_a.png'); + background-repeat:repeat-x; + padding-right: 6px; + padding-left: 6px; +} + +td.navtabHL a, td.navtabHL a:visited { + color: #fff; + text-shadow: 0px 1px 1px rgba(0, 0, 0, 1.0); +} + +a.navtab { + font-weight: bold; +} + +div.qindex{ + text-align: center; + width: 100%; + line-height: 140%; + font-size: 130%; + color: #A0A0A0; +} + +dt.alphachar{ + font-size: 180%; + font-weight: bold; +} + +.alphachar a{ + color: black; +} + +.alphachar a:hover, .alphachar a:visited{ + text-decoration: none; +} + +.classindex dl { + padding: 25px; + column-count:1 +} + +.classindex dd { + display:inline-block; + margin-left: 50px; + width: 90%; + line-height: 1.15em; +} + +.classindex dl.odd { + background-color: #F0F1F1; +} + +@media(min-width: 1120px) { + .classindex dl { + column-count:2 + } +} + +@media(min-width: 1320px) { + .classindex dl { + column-count:3 + } +} + + /* @group Link Styling */ a { @@ -136,17 +209,6 @@ a:hover { text-decoration: underline; } -a.qindex { - font-weight: bold; -} - -a.qindexHL { - font-weight: bold; - background-color: #5B6364; - color: #FFFFFF; - border: 1px double #464C4D; -} - .contents a.qindexHL:visited { color: #FFFFFF; } @@ -159,11 +221,11 @@ a.elRef { } a.code, a.code:visited, a.line, a.line:visited { - color: #171919; + color: #171919; } a.codeRef, a.codeRef:visited, a.lineRef, a.lineRef:visited { - color: #171919; + color: #171919; } /* @end */ @@ -349,7 +411,7 @@ p.formulaDsp { } img.formulaDsp { - + } img.formulaInl, img.inline { @@ -407,20 +469,20 @@ span.charliteral { color: #008080 } -span.vhdldigit { - color: #ff00ff +span.vhdldigit { + color: #ff00ff } -span.vhdlchar { - color: #000000 +span.vhdlchar { + color: #000000 } -span.vhdlkeyword { - color: #700070 +span.vhdlkeyword { + color: #700070 } -span.vhdllogic { - color: #ff0000 +span.vhdllogic { + color: #ff0000 } blockquote { @@ -533,7 +595,7 @@ table.memberdecls { white-space: nowrap; } -.memItemRight { +.memItemRight, .memTemplItemRight { width: 100%; } @@ -645,9 +707,9 @@ table.memberdecls { } .memdoc, dl.reflist dd { - border-bottom: 1px solid #697273; - border-left: 1px solid #697273; - border-right: 1px solid #697273; + border-bottom: 1px solid #697273; + border-left: 1px solid #697273; + border-right: 1px solid #697273; padding: 6px 10px 2px 10px; background-color: #F7F8F8; border-top-width: 0; @@ -699,18 +761,18 @@ dl.reflist dd { .params, .retval, .exception, .tparams { margin-left: 0px; padding-left: 0px; -} +} -.params .paramname, .retval .paramname, .tparams .paramname { +.params .paramname, .retval .paramname, .tparams .paramname, .exception .paramname { font-weight: bold; vertical-align: top; } - + .params .paramtype, .tparams .paramtype { font-style: italic; vertical-align: top; -} - +} + .params .paramdir, .tparams .paramdir { font-family: "courier new",courier,monospace; vertical-align: top; @@ -966,8 +1028,8 @@ table.fieldtable { .fieldtable td.fielddoc p:first-child { margin-top: 0px; -} - +} + .fieldtable td.fielddoc p:last-child { margin-bottom: 2px; } @@ -1042,7 +1104,7 @@ table.fieldtable { color: #040404; font-family: 'Lucida Grande',Geneva,Helvetica,Arial,sans-serif; text-shadow: 0px 1px 1px rgba(255, 255, 255, 0.9); - text-decoration: none; + text-decoration: none; } .navpath li.navelem a:hover @@ -1071,7 +1133,7 @@ div.summary padding-right: 5px; width: 50%; text-align: right; -} +} div.summary a { @@ -1086,7 +1148,7 @@ table.classindex margin-right: 3%; width: 94%; border: 0; - border-spacing: 0; + border-spacing: 0; padding: 0; } @@ -1266,12 +1328,12 @@ dl.section dd { vertical-align: bottom; border-collapse: separate; } - + #projectlogo img -{ +{ border: 0px none; } - + #projectalign { vertical-align: middle; @@ -1283,7 +1345,7 @@ dl.section dd { margin: 0px; padding: 2px 0px; } - + #projectbrief { font: 120% Tahoma, Arial,sans-serif; @@ -1351,10 +1413,12 @@ dl.citelist dt { font-weight:bold; margin-right:10px; padding:5px; + text-align:right; + width:52px; } dl.citelist dd { - margin:2px 0; + margin:2px 0 2px 72px; padding:5px 0; } @@ -1399,7 +1463,7 @@ div.toc ul { list-style: none outside none; border: medium none; padding: 0px; -} +} div.toc li.level1 { margin-left: 0px; @@ -1417,6 +1481,12 @@ div.toc li.level4 { margin-left: 45px; } +span.emoji { + /* font family used at the site: https://unicode.org/emoji/charts/full-emoji-list.html + * font-family: "Noto Color Emoji", "Apple Color Emoji", "Segoe UI Emoji", Times, Symbola, Aegyptus, Code2000, Code2001, Code2002, Musica, serif, LastResort; + */ +} + .PageDocRTL-title div.toc li.level1 { margin-left: 0 !important; margin-right: 0; @@ -1654,47 +1724,6 @@ tr.heading h2 { /* @group Markdown */ -/* -table.markdownTable { - border-collapse:collapse; - margin-top: 4px; - margin-bottom: 4px; -} - -table.markdownTable td, table.markdownTable th { - border: 1px solid #060606; - padding: 3px 7px 2px; -} - -table.markdownTableHead tr { -} - -table.markdownTableBodyLeft td, table.markdownTable th { - border: 1px solid #060606; - padding: 3px 7px 2px; -} - -th.markdownTableHeadLeft th.markdownTableHeadRight th.markdownTableHeadCenter th.markdownTableHeadNone { - background-color: #0B0C0C; - color: #FFFFFF; - font-size: 110%; - padding-bottom: 4px; - padding-top: 5px; -} - -th.markdownTableHeadLeft { - text-align: left -} - -th.markdownTableHeadRight { - text-align: right -} - -th.markdownTableHeadCenter { - text-align: center -} -*/ - table.markdownTable { border-collapse:collapse; margin-top: 4px; @@ -1754,11 +1783,10 @@ table.DocNodeLTR { tt, code, kbd, samp { display: inline-block; - direction:ltr; + direction:ltr; } /* @end */ u { text-decoration: underline; } - diff --git a/docs/dynsections.js b/docs/dynsections.js index ea0a7b3..3174bd7 100644 --- a/docs/dynsections.js +++ b/docs/dynsections.js @@ -1,25 +1,26 @@ /* - @licstart The following is the entire license notice for the - JavaScript code in this file. + @licstart The following is the entire license notice for the JavaScript code in this file. - Copyright (C) 1997-2017 by Dimitri van Heesch + The MIT License (MIT) - This program is free software; you can redistribute it and/or modify - it under the terms of the GNU General Public License as published by - the Free Software Foundation; either version 2 of the License, or - (at your option) any later version. + Copyright (C) 1997-2020 by Dimitri van Heesch - This program is distributed in the hope that it will be useful, - but WITHOUT ANY WARRANTY; without even the implied warranty of - MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - GNU General Public License for more details. + Permission is hereby granted, free of charge, to any person obtaining a copy of this software + and associated documentation files (the "Software"), to deal in the Software without restriction, + including without limitation the rights to use, copy, modify, merge, publish, distribute, + sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is + furnished to do so, subject to the following conditions: - You should have received a copy of the GNU General Public License along - with this program; if not, write to the Free Software Foundation, Inc., - 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. + The above copyright notice and this permission notice shall be included in all copies or + substantial portions of the Software. - @licend The above is the entire license notice - for the JavaScript code in this file + THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING + BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND + NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, + DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, + OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. + + @licend The above is the entire license notice for the JavaScript code in this file */ function toggleVisibility(linkObj) { diff --git a/docs/environment.html b/docs/environment.html index 87d67e4..58d20e1 100644 --- a/docs/environment.html +++ b/docs/environment.html @@ -3,7 +3,7 @@ - + mi-malloc: Environment Options @@ -13,10 +13,6 @@ - @@ -37,21 +33,21 @@ Logo
mi-malloc -  1.6 +  1.7/2.0
- - +
@@ -60,10 +56,10 @@ - + @@ -73,13 +69,13 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); -
@@ -92,7 +88,7 @@ $(document).ready(function(){initNavTree('environment.html','');});
-
@@ -110,17 +106,16 @@ $(document).ready(function(){initNavTree('environment.html','');});
  • MIMALLOC_PAGE_RESET=0: by default, mimalloc will reset (or purge) OS pages when not in use to signal to the OS that the underlying physical memory can be reused. This can reduce memory fragmentation in long running (server) programs. By setting it to 0 no such page resets will be done which can improve performance for programs that are not long running. As an alternative, the MIMALLOC_RESET_DELAY=<msecs> can be set higher (100ms by default) to make the page reset occur less frequently instead of turning it off completely.
  • MIMALLOC_LARGE_OS_PAGES=1: use large OS pages (2MiB) when available; for some workloads this can significantly improve performance. Use MIMALLOC_VERBOSE to check if the large OS pages are enabled – usually one needs to explicitly allow large OS pages (as on Windows and Linux). However, sometimes the OS is very slow to reserve contiguous physical memory for large OS pages so use with care on systems that can have fragmented memory (for that reason, we generally recommend to use MIMALLOC_RESERVE_HUGE_OS_PAGES instead when possible).
  • MIMALLOC_RESERVE_HUGE_OS_PAGES=N: where N is the number of 1GiB huge OS pages. This reserves the huge pages at startup and sometimes this can give a large (latency) performance improvement on big workloads. Usually it is better to not use MIMALLOC_LARGE_OS_PAGES in combination with this setting. Just like large OS pages, use with care as reserving contiguous physical memory can take a long time when memory is fragmented (but reserving the huge pages is done at startup only once). Note that we usually need to explicitly enable huge OS pages (as on Windows and Linux)). With huge OS pages, it may be beneficial to set the setting MIMALLOC_EAGER_COMMIT_DELAY=N (N is 1 by default) to delay the initial N segments (of 4MiB) of a thread to not allocate in the huge OS pages; this prevents threads that are short lived and allocate just a little to take up space in the huge OS page area (which cannot be reset).
    • +
  • MIMALLOC_RESERVE_HUGE_OS_PAGES_AT=N: where N is the numa node. This reserves the huge pages at a specific numa node. (N is -1 by default to reserve huge pages evenly among the given number of numa nodes (or use the available ones as detected))

    • Use caution when using fork in combination with either large or huge OS pages: on a fork, the OS uses copy-on-write for all pages in the original process including the huge OS pages. When any memory is now written in that area, the OS will copy the entire 1GiB huge page (or 2MiB large page) which can cause the memory usage to grow in big increments.

    -
    - + + diff --git a/docs/functions.html b/docs/functions.html index 6202121..0419c96 100644 --- a/docs/functions.html +++ b/docs/functions.html @@ -3,7 +3,7 @@ - + mi-malloc: Data Fields @@ -13,10 +13,6 @@ - @@ -37,21 +33,21 @@ Logo
    mi-malloc -  1.6 +  1.7/2.0
    - - +
    @@ -60,10 +56,10 @@ - + @@ -73,13 +69,13 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); -
    @@ -92,7 +88,7 @@ $(document).ready(function(){initNavTree('functions.html','');});
    -
    @@ -120,9 +116,7 @@ $(document).ready(function(){initNavTree('functions.html','');}); diff --git a/docs/functions_vars.html b/docs/functions_vars.html index 7d41d10..d5252ae 100644 --- a/docs/functions_vars.html +++ b/docs/functions_vars.html @@ -3,7 +3,7 @@ - + mi-malloc: Data Fields - Variables @@ -13,10 +13,6 @@ - @@ -37,21 +33,21 @@ Logo
    mi-malloc -  1.6 +  1.7/2.0
    - - +
    @@ -60,10 +56,10 @@
    - + @@ -73,13 +69,13 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); -
    @@ -92,7 +88,7 @@ $(document).ready(function(){initNavTree('functions_vars.html','');});
    -
    @@ -120,9 +116,7 @@ $(document).ready(function(){initNavTree('functions_vars.html','');}); diff --git a/docs/group__aligned.html b/docs/group__aligned.html index a3eaacf..c9ad48e 100644 --- a/docs/group__aligned.html +++ b/docs/group__aligned.html @@ -3,7 +3,7 @@ - + mi-malloc: Aligned Allocation @@ -13,10 +13,6 @@ - @@ -37,21 +33,21 @@ Logo
    mi-malloc -  1.6 +  1.7/2.0
    - - +
    @@ -60,10 +56,10 @@
    - + @@ -73,13 +69,13 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); -
    @@ -92,26 +88,33 @@ $(document).ready(function(){initNavTree('group__aligned.html','');});
    -
    +Macros | Functions
    Aligned Allocation
    -

    Allocating aligned memory blocks. +

    Allocating aligned memory blocks. More...

    + + + + +

    +Macros

    #define MI_ALIGNMENT_MAX
     The maximum supported alignment size (currently 1MiB). More...
     
    - + @@ -120,7 +123,7 @@ Functions - + @@ -131,6 +134,23 @@ Functions

    Functions

    void * mi_malloc_aligned (size_t size, size_t alignment)
     Allocate size bytes aligned by alignment. More...
     Allocate size bytes aligned by alignment. More...
     
    void * mi_zalloc_aligned (size_t size, size_t alignment)
     
    void * mi_realloc_aligned (void *p, size_t newsize, size_t alignment)
     
    void * mi_malloc_aligned_at (size_t size, size_t alignment, size_t offset)
     Allocate size bytes aligned by alignment at a specified offset. More...
     Allocate size bytes aligned by alignment at a specified offset. More...
     
    void * mi_zalloc_aligned_at (size_t size, size_t alignment, size_t offset)
     

    Detailed Description

    Allocating aligned memory blocks.

    +

    Macro Definition Documentation

    + +

    ◆ MI_ALIGNMENT_MAX

    + +
    +
    + + + + +
    #define MI_ALIGNMENT_MAX
    +
    + +

    The maximum supported alignment size (currently 1MiB).

    + +
    +

    Function Documentation

    ◆ mi_calloc_aligned()

    @@ -236,7 +256,7 @@ Functions
    Parameters
    - +
    sizenumber of bytes to allocate.
    alignmentthe minimal alignment of the allocated memory.
    alignmentthe minimal alignment of the allocated memory. Must be less than MI_ALIGNMENT_MAX.
    @@ -438,9 +458,7 @@ Functions diff --git a/docs/group__aligned.js b/docs/group__aligned.js index 0a5aa5c..06ccb0c 100644 --- a/docs/group__aligned.js +++ b/docs/group__aligned.js @@ -1,5 +1,6 @@ var group__aligned = [ + [ "MI_ALIGNMENT_MAX", "group__aligned.html#ga83c03016066b438f51a8095e9140be06", null ], [ "mi_calloc_aligned", "group__aligned.html#ga53dddb4724042a90315b94bc268fb4c9", null ], [ "mi_calloc_aligned_at", "group__aligned.html#ga08647c4593f3b2eef24a919a73eba3a3", null ], [ "mi_malloc_aligned", "group__aligned.html#ga68930196751fa2cca9e1fd0d71bade56", null ], diff --git a/docs/group__analysis.html b/docs/group__analysis.html index 2487c24..6ceb4d5 100644 --- a/docs/group__analysis.html +++ b/docs/group__analysis.html @@ -3,7 +3,7 @@ - + mi-malloc: Heap Introspection @@ -13,10 +13,6 @@ - @@ -37,21 +33,21 @@ Logo
    mi-malloc -  1.6 +  1.7/2.0
    - - +
    @@ -60,10 +56,10 @@
    - +
    @@ -73,13 +69,13 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); -
    @@ -92,7 +88,7 @@ $(document).ready(function(){initNavTree('group__analysis.html','');});
    -
    @@ -107,7 +103,7 @@ $(document).ready(function(){initNavTree('group__analysis.html','');});
    -

    Inspect the heap at runtime. +

    Inspect the heap at runtime. More...

    - +

    @@ -119,22 +115,22 @@ Data Structures

    Typedefs

    typedef bool() mi_block_visit_fun(const mi_heap_t *heap, const mi_heap_area_t *area, void *block, size_t block_size, void *arg)
     Visitor function passed to mi_heap_visit_blocks() More...
     Visitor function passed to mi_heap_visit_blocks() More...
     
    - + - + - + - +

    Functions

    bool mi_heap_contains_block (mi_heap_t *heap, const void *p)
     Does a heap contain a pointer to a previously allocated block? More...
     Does a heap contain a pointer to a previously allocated block? More...
     
    bool mi_heap_check_owned (mi_heap_t *heap, const void *p)
     Check safely if any pointer is part of a heap. More...
     Check safely if any pointer is part of a heap. More...
     
    bool mi_check_owned (const void *p)
     Check safely if any pointer is part of the default heap of this thread. More...
     Check safely if any pointer is part of the default heap of this thread. More...
     
    bool mi_heap_visit_blocks (const mi_heap_t *heap, bool visit_all_blocks, mi_block_visit_fun *visitor, void *arg)
     Visit all areas and blocks in a heap. More...
     Visit all areas and blocks in a heap. More...
     

    Detailed Description

    @@ -376,9 +372,7 @@ bytes in use by allocated blocks diff --git a/docs/group__cpp.html b/docs/group__cpp.html index 88c7588..2ad5303 100644 --- a/docs/group__cpp.html +++ b/docs/group__cpp.html @@ -3,7 +3,7 @@ - + mi-malloc: C++ wrappers @@ -13,10 +13,6 @@ - @@ -37,21 +33,21 @@ Logo
    mi-malloc -  1.6 +  1.7/2.0
    - - +
    @@ -60,10 +56,10 @@
    - + @@ -73,13 +69,13 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); -
    @@ -92,7 +88,7 @@ $(document).ready(function(){initNavTree('group__cpp.html','');});
    -
    @@ -106,7 +102,7 @@ $(document).ready(function(){initNavTree('group__cpp.html','');});
    -

    mi_ prefixed implementations of various allocation functions that use C++ semantics on out-of-memory, generally calling std::get_new_handler and raising a std::bad_alloc exception on failure. +

    mi_ prefixed implementations of various allocation functions that use C++ semantics on out-of-memory, generally calling std::get_new_handler and raising a std::bad_alloc exception on failure. More...

    - + - + - + - + - + - + - +

    @@ -118,25 +114,25 @@ Data Structures

    Functions

    void * mi_new (std::size_t n) noexcept(false)
     like mi_malloc(), but when out of memory, use std::get_new_handler and raise std::bad_alloc exception on failure. More...
     like mi_malloc(), but when out of memory, use std::get_new_handler and raise std::bad_alloc exception on failure. More...
     
    void * mi_new_n (size_t count, size_t size) noexcept(false)
     like mi_mallocn(), but when out of memory, use std::get_new_handler and raise std::bad_alloc exception on failure. More...
     like mi_mallocn(), but when out of memory, use std::get_new_handler and raise std::bad_alloc exception on failure. More...
     
    void * mi_new_aligned (std::size_t n, std::align_val_t alignment) noexcept(false)
     like mi_malloc_aligned(), but when out of memory, use std::get_new_handler and raise std::bad_alloc exception on failure. More...
     like mi_malloc_aligned(), but when out of memory, use std::get_new_handler and raise std::bad_alloc exception on failure. More...
     
    void * mi_new_nothrow (size_t n)
     like mi_malloc, but when out of memory, use std::get_new_handler but return NULL on failure. More...
     like mi_malloc, but when out of memory, use std::get_new_handler but return NULL on failure. More...
     
    void * mi_new_aligned_nothrow (size_t n, size_t alignment)
     like mi_malloc_aligned, but when out of memory, use std::get_new_handler but return NULL on failure. More...
     like mi_malloc_aligned, but when out of memory, use std::get_new_handler but return NULL on failure. More...
     
    void * mi_new_realloc (void *p, size_t newsize)
     like mi_realloc(), but when out of memory, use std::get_new_handler and raise std::bad_alloc exception on failure. More...
     like mi_realloc(), but when out of memory, use std::get_new_handler and raise std::bad_alloc exception on failure. More...
     
    void * mi_new_reallocn (void *p, size_t newcount, size_t size)
     like mi_reallocn(), but when out of memory, use std::get_new_handler and raise std::bad_alloc exception on failure. More...
     like mi_reallocn(), but when out of memory, use std::get_new_handler and raise std::bad_alloc exception on failure. More...
     

    Detailed Description

    @@ -158,7 +154,10 @@ Functions struct mi_stl_allocator< T >

    std::allocator implementation for mimalloc for use in STL containers.

    -

    For example:

    std::vector<int, mi_stl_allocator<int> > vec;
    vec.push_back(1);
    vec.pop_back();
    +

    For example:

    std::vector<int, mi_stl_allocator<int> > vec;
    +
    vec.push_back(1);
    +
    vec.pop_back();
    +

    Function Documentation

    @@ -387,9 +386,7 @@ struct mi_stl_allocator< T > diff --git a/docs/group__extended.html b/docs/group__extended.html index 12e51cb..bf71e92 100644 --- a/docs/group__extended.html +++ b/docs/group__extended.html @@ -3,7 +3,7 @@ - + mi-malloc: Extended Functions @@ -13,10 +13,6 @@ - @@ -37,21 +33,21 @@ Logo
    mi-malloc -  1.6 +  1.7/2.0
    - - +
    @@ -60,10 +56,10 @@ - + @@ -73,13 +69,13 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); -
    @@ -92,7 +88,7 @@ $(document).ready(function(){initNavTree('group__extended.html','');});
    -
    @@ -107,88 +103,94 @@ $(document).ready(function(){initNavTree('group__extended.html','');});
    -

    Extended functionality. +

    Extended functionality. More...

    - +

    Macros

    #define MI_SMALL_SIZE_MAX
     Maximum size allowed for small allocations in mi_malloc_small and mi_zalloc_small (usually 128*sizeof(void*) (= 1KB on 64-bit systems)) More...
     Maximum size allowed for small allocations in mi_malloc_small and mi_zalloc_small (usually 128*sizeof(void*) (= 1KB on 64-bit systems)) More...
     
    - + - + - +

    Typedefs

    typedef void() mi_deferred_free_fun(bool force, unsigned long long heartbeat, void *arg)
     Type of deferred free functions. More...
     Type of deferred free functions. More...
     
    typedef void() mi_output_fun(const char *msg, void *arg)
     Type of output functions. More...
     Type of output functions. More...
     
    typedef void() mi_error_fun(int err, void *arg)
     Type of error callback functions. More...
     Type of error callback functions. More...
     
    - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + + + + + + + - + - + - + - +

    Functions

    void * mi_malloc_small (size_t size)
     Allocate a small object. More...
     Allocate a small object. More...
     
    void * mi_zalloc_small (size_t size)
     Allocate a zero initialized small object. More...
     Allocate a zero initialized small object. More...
     
    size_t mi_usable_size (void *p)
     Return the available bytes in a memory block. More...
     Return the available bytes in a memory block. More...
     
    size_t mi_good_size (size_t size)
     Return the used allocation size. More...
     Return the used allocation size. More...
     
    void mi_collect (bool force)
     Eagerly free memory. More...
     Eagerly free memory. More...
     
    void mi_stats_print (void *out)
     Deprecated. More...
     Deprecated. More...
     
    void mi_stats_print_out (mi_output_fun *out, void *arg)
     Print the main statistics. More...
     Print the main statistics. More...
     
    void mi_stats_reset (void)
     Reset statistics. More...
     Reset statistics. More...
     
    void mi_stats_merge (void)
     Merge thread local statistics with the main statistics and reset. More...
     Merge thread local statistics with the main statistics and reset. More...
     
    void mi_thread_init (void)
     Initialize mimalloc on a thread. More...
     Initialize mimalloc on a thread. More...
     
    void mi_thread_done (void)
     Uninitialize mimalloc on a thread. More...
     Uninitialize mimalloc on a thread. More...
     
    void mi_thread_stats_print_out (mi_output_fun *out, void *arg)
     Print out heap statistics for this thread. More...
     Print out heap statistics for this thread. More...
     
    void mi_register_deferred_free (mi_deferred_free_fun *deferred_free, void *arg)
     Register a deferred free function. More...
     Register a deferred free function. More...
     
    void mi_register_output (mi_output_fun *out, void *arg)
     Register an output function. More...
     Register an output function. More...
     
    void mi_register_error (mi_error_fun *errfun, void *arg)
     Register an error callback function. More...
     Register an error callback function. More...
     
    bool mi_is_in_heap_region (const void *p)
     Is a pointer part of our heap? More...
     Is a pointer part of our heap? More...
     
    int mi_reserve_os_memory (size_t size, bool commit, bool allow_large)
     Reserve OS memory for use by mimalloc. More...
     
    bool mi_manage_os_memory (void *start, size_t size, bool is_committed, bool is_large, bool is_zero, int numa_node)
     Manage a particular memory area for use by mimalloc. More...
     
    int mi_reserve_huge_os_pages_interleave (size_t pages, size_t numa_nodes, size_t timeout_msecs)
     Reserve pages of huge OS pages (1GiB) evenly divided over numa_nodes nodes, but stops after at most timeout_msecs seconds. More...
     Reserve pages of huge OS pages (1GiB) evenly divided over numa_nodes nodes, but stops after at most timeout_msecs seconds. More...
     
    int mi_reserve_huge_os_pages_at (size_t pages, int numa_node, size_t timeout_msecs)
     Reserve pages of huge OS pages (1GiB) at a specific numa_node, but stops after at most timeout_msecs seconds. More...
     Reserve pages of huge OS pages (1GiB) at a specific numa_node, but stops after at most timeout_msecs seconds. More...
     
    bool mi_is_redirected ()
     Is the C runtime malloc API redirected? More...
     Is the C runtime malloc API redirected? More...
     
    void mi_process_info (size_t *elapsed_msecs, size_t *user_msecs, size_t *system_msecs, size_t *current_rss, size_t *peak_rss, size_t *current_commit, size_t *peak_commit, size_t *page_faults)
     Return process information (time and memory usage). More...
     Return process information (time and memory usage). More...
     

    Detailed Description

    @@ -414,6 +416,72 @@ Functions
    Returns
    a pointer to newly allocated memory of at least size bytes, or NULL if out of memory. This function is meant for use in run-time systems for best performance and does not check if size was indeed small – use with care!
    +
    + + +

    ◆ mi_manage_os_memory()

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    bool mi_manage_os_memory (void * start,
    size_t size,
    bool is_committed,
    bool is_large,
    bool is_zero,
    int numa_node 
    )
    +
    + +

    Manage a particular memory area for use by mimalloc.

    +

    This is just like mi_reserve_os_memory except that the area should already be allocated in some manner and available for use my mimalloc.

    Parameters
    + + + + + + + +
    startStart of the memory area
    sizeThe size of the memory area.
    commitIs the area already committed?
    is_largeDoes it consist of large OS pages? Set this to true as well for memory that should not be decommitted or protected (like rdma etc.)
    is_zeroDoes the area consists of zero's?
    numa_nodePossible associated numa node or -1.
    +
    +
    +
    Returns
    true if successful, and false on error.
    +
    @@ -706,6 +774,51 @@ Functions
    Returns
    0 if successfull, ENOMEM if running out of memory, or ETIMEDOUT if timed out.

    The reserved memory is used by mimalloc to satisfy allocations. May quit before timeout_msecs are expired if it estimates it will take more than 1.5 times timeout_msecs. The time limit is needed because on some operating systems it can take a long time to reserve contiguous memory if the physical memory is fragmented.

    + + + +

    ◆ mi_reserve_os_memory()

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + + + + +
    int mi_reserve_os_memory (size_t size,
    bool commit,
    bool allow_large 
    )
    +
    + +

    Reserve OS memory for use by mimalloc.

    +

    Reserved areas are used before allocating from the OS again. By reserving a large area upfront, allocation can be more efficient, and can be better managed on systems without mmap/VirtualAlloc (like WASM for example).

    Parameters
    + + + + +
    sizeThe size to reserve.
    commitCommit the memory upfront.
    allow_largeAllow large OS pages (2MiB) to be used?
    +
    +
    +
    Returns
    0 if successful, and an error code otherwise (e.g. ENOMEM).
    +
    @@ -958,9 +1071,7 @@ Functions diff --git a/docs/group__extended.js b/docs/group__extended.js index ed4a8b4..c217aac 100644 --- a/docs/group__extended.js +++ b/docs/group__extended.js @@ -9,12 +9,14 @@ var group__extended = [ "mi_is_in_heap_region", "group__extended.html#ga5f071b10d4df1c3658e04e7fd67a94e6", null ], [ "mi_is_redirected", "group__extended.html#gaad25050b19f30cd79397b227e0157a3f", null ], [ "mi_malloc_small", "group__extended.html#ga7136c2e55cb22c98ecf95d08d6debb99", null ], + [ "mi_manage_os_memory", "group__extended.html#ga4c6486a1fdcd7a423b5f25fe4be8e0cf", null ], [ "mi_process_info", "group__extended.html#ga7d862c2affd5790381da14eb102a364d", null ], [ "mi_register_deferred_free", "group__extended.html#ga3460a6ca91af97be4058f523d3cb8ece", null ], [ "mi_register_error", "group__extended.html#gaa1d55e0e894be240827e5d87ec3a1f45", null ], [ "mi_register_output", "group__extended.html#gae5b17ff027cd2150b43a33040250cf3f", null ], [ "mi_reserve_huge_os_pages_at", "group__extended.html#ga7795a13d20087447281858d2c771cca1", null ], [ "mi_reserve_huge_os_pages_interleave", "group__extended.html#ga3132f521fb756fc0e8ec0b74fb58df50", null ], + [ "mi_reserve_os_memory", "group__extended.html#ga00ec3324b6b2591c7fe3677baa30a767", null ], [ "mi_stats_merge", "group__extended.html#ga854b1de8cb067c7316286c28b2fcd3d1", null ], [ "mi_stats_print", "group__extended.html#ga2d126e5c62d3badc35445e5d84166df2", null ], [ "mi_stats_print_out", "group__extended.html#ga537f13b299ddf801e49a5a94fde02c79", null ], diff --git a/docs/group__heap.html b/docs/group__heap.html index 1a38c93..5f97698 100644 --- a/docs/group__heap.html +++ b/docs/group__heap.html @@ -3,7 +3,7 @@ - + mi-malloc: Heap Allocation @@ -13,10 +13,6 @@ - @@ -37,21 +33,21 @@ Logo
    mi-malloc -  1.6 +  1.7/2.0
    - - +
    @@ -60,10 +56,10 @@ - + @@ -73,13 +69,13 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); -
    @@ -92,7 +88,7 @@ $(document).ready(function(){initNavTree('group__heap.html','');});
    -
    @@ -106,61 +102,61 @@ $(document).ready(function(){initNavTree('group__heap.html','');});
    -

    First-class heaps that can be destroyed in one go. +

    First-class heaps that can be destroyed in one go. More...

    - +

    Typedefs

    typedef struct mi_heap_s mi_heap_t
     Type of first-class heaps. More...
     Type of first-class heaps. More...
     
    - + - + - + - + - + - + - + - + - + - + - + - + - + - + - + @@ -1071,9 +1067,7 @@ Functions diff --git a/docs/group__malloc.html b/docs/group__malloc.html index 224c4b0..c110fdb 100644 --- a/docs/group__malloc.html +++ b/docs/group__malloc.html @@ -3,7 +3,7 @@ - +mi-malloc: Basic Allocation @@ -13,10 +13,6 @@ - @@ -37,21 +33,21 @@ @@ -60,10 +56,10 @@

    Functions

    mi_heap_t * mi_heap_new ()
     Create a new heap that can be used for allocation. More...
     Create a new heap that can be used for allocation. More...
     
    void mi_heap_delete (mi_heap_t *heap)
     Delete a previously allocated heap. More...
     Delete a previously allocated heap. More...
     
    void mi_heap_destroy (mi_heap_t *heap)
     Destroy a heap, freeing all its still allocated blocks. More...
     Destroy a heap, freeing all its still allocated blocks. More...
     
    mi_heap_t * mi_heap_set_default (mi_heap_t *heap)
     Set the default heap to use for mi_malloc() et al. More...
     Set the default heap to use for mi_malloc() et al. More...
     
    mi_heap_t * mi_heap_get_default ()
     Get the default heap that is used for mi_malloc() et al. More...
     Get the default heap that is used for mi_malloc() et al. More...
     
    mi_heap_t * mi_heap_get_backing ()
     Get the backing heap. More...
     Get the backing heap. More...
     
    void mi_heap_collect (mi_heap_t *heap, bool force)
     Release outstanding resources in a specific heap. More...
     Release outstanding resources in a specific heap. More...
     
    void * mi_heap_malloc (mi_heap_t *heap, size_t size)
     Allocate in a specific heap. More...
     Allocate in a specific heap. More...
     
    void * mi_heap_malloc_small (mi_heap_t *heap, size_t size)
     Allocate a small object in a specific heap. More...
     Allocate a small object in a specific heap. More...
     
    void * mi_heap_zalloc (mi_heap_t *heap, size_t size)
     Allocate zero-initialized in a specific heap. More...
     Allocate zero-initialized in a specific heap. More...
     
    void * mi_heap_calloc (mi_heap_t *heap, size_t count, size_t size)
     Allocate count zero-initialized elements in a specific heap. More...
     Allocate count zero-initialized elements in a specific heap. More...
     
    void * mi_heap_mallocn (mi_heap_t *heap, size_t count, size_t size)
     Allocate count elements in a specific heap. More...
     Allocate count elements in a specific heap. More...
     
    char * mi_heap_strdup (mi_heap_t *heap, const char *s)
     Duplicate a string in a specific heap. More...
     Duplicate a string in a specific heap. More...
     
    char * mi_heap_strndup (mi_heap_t *heap, const char *s, size_t n)
     Duplicate a string of at most length n in a specific heap. More...
     Duplicate a string of at most length n in a specific heap. More...
     
    char * mi_heap_realpath (mi_heap_t *heap, const char *fname, char *resolved_name)
     Resolve a file path name using a specific heap to allocate the result. More...
     Resolve a file path name using a specific heap to allocate the result. More...
     
    void * mi_heap_realloc (mi_heap_t *heap, void *p, size_t newsize)
     
    mi-malloc -  1.6 +  1.7/2.0
    - - +
    - + @@ -73,13 +69,13 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); -
    @@ -92,7 +88,7 @@ $(document).ready(function(){initNavTree('group__malloc.html','');});
    -
    @@ -105,49 +101,49 @@ $(document).ready(function(){initNavTree('group__malloc.html','');});
    -

    The basic allocation interface. +

    The basic allocation interface. More...

    - + - + - + - + - + - + - + - + - + - + - + - + - +

    Functions

    void mi_free (void *p)
     Free previously allocated memory. More...
     Free previously allocated memory. More...
     
    void * mi_malloc (size_t size)
     Allocate size bytes. More...
     Allocate size bytes. More...
     
    void * mi_zalloc (size_t size)
     Allocate zero-initialized size bytes. More...
     Allocate zero-initialized size bytes. More...
     
    void * mi_calloc (size_t count, size_t size)
     Allocate zero-initialized count elements of size bytes. More...
     Allocate zero-initialized count elements of size bytes. More...
     
    void * mi_realloc (void *p, size_t newsize)
     Re-allocate memory to newsize bytes. More...
     Re-allocate memory to newsize bytes. More...
     
    void * mi_recalloc (void *p, size_t count, size_t size)
     Re-allocate memory to count elements of size bytes, with extra memory initialized to zero. More...
     Re-allocate memory to count elements of size bytes, with extra memory initialized to zero. More...
     
    void * mi_expand (void *p, size_t newsize)
     Try to re-allocate memory to newsize bytes in place. More...
     Try to re-allocate memory to newsize bytes in place. More...
     
    void * mi_mallocn (size_t count, size_t size)
     Allocate count elements of size bytes. More...
     Allocate count elements of size bytes. More...
     
    void * mi_reallocn (void *p, size_t count, size_t size)
     Re-allocate memory to count elements of size bytes. More...
     Re-allocate memory to count elements of size bytes. More...
     
    void * mi_reallocf (void *p, size_t newsize)
     Re-allocate memory to newsize bytes,. More...
     Re-allocate memory to newsize bytes,. More...
     
    char * mi_strdup (const char *s)
     Allocate and duplicate a string. More...
     Allocate and duplicate a string. More...
     
    char * mi_strndup (const char *s, size_t n)
     Allocate and duplicate a string up to n bytes. More...
     Allocate and duplicate a string up to n bytes. More...
     
    char * mi_realpath (const char *fname, char *resolved_name)
     Resolve a file path name. More...
     Resolve a file path name. More...
     

    Detailed Description

    @@ -635,9 +631,7 @@ mi_zallocn() diff --git a/docs/group__options.html b/docs/group__options.html index 9425765..6c63e17 100644 --- a/docs/group__options.html +++ b/docs/group__options.html @@ -3,7 +3,7 @@ - + mi-malloc: Runtime Options @@ -13,10 +13,6 @@ - @@ -37,21 +33,21 @@ Logo
    mi-malloc -  1.6 +  1.7/2.0
    - - +
    @@ -60,10 +56,10 @@
    - + @@ -73,13 +69,13 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); -
    @@ -92,7 +88,7 @@ $(document).ready(function(){initNavTree('group__options.html','');});
    -
    @@ -106,31 +102,33 @@ $(document).ready(function(){initNavTree('group__options.html','');});
    -

    Set runtime behavior. +

    Set runtime behavior. More...

    @@ -186,6 +184,8 @@ Functions + diff --git a/docs/group__options.js b/docs/group__options.js index 9aaf231..c8836cd 100644 --- a/docs/group__options.js +++ b/docs/group__options.js @@ -8,6 +8,7 @@ var group__options = [ "mi_option_eager_region_commit", "group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca32ce97ece29f69e82579679cf8a307ad", null ], [ "mi_option_large_os_pages", "group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca4192d491200d0055df0554d4cf65054e", null ], [ "mi_option_reserve_huge_os_pages", "group__options.html#ggafebf7ed116adb38ae5218bc3ce06884caca7ed041be3b0b9d0b82432c7bf41af2", null ], + [ "mi_option_reserve_huge_os_pages_at", "group__options.html#ggafebf7ed116adb38ae5218bc3ce06884caa13e7926d4339d2aa6fbf61d4473fd5c", null ], [ "mi_option_segment_cache", "group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca2ecbe7ef32f5c84de3739aa4f0b805a1", null ], [ "mi_option_page_reset", "group__options.html#ggafebf7ed116adb38ae5218bc3ce06884cada854dd272c66342f18a93ee254a2968", null ], [ "mi_option_segment_reset", "group__options.html#ggafebf7ed116adb38ae5218bc3ce06884cafb121d30d87591850d5410ccc3a95c6d", null ], diff --git a/docs/group__posix.html b/docs/group__posix.html index fe3a88e..37c8702 100644 --- a/docs/group__posix.html +++ b/docs/group__posix.html @@ -3,7 +3,7 @@ - +mi-malloc: Posix @@ -13,10 +13,6 @@ - @@ -37,21 +33,21 @@ @@ -60,10 +56,10 @@

    Enumerations

    enum  mi_option_t {
    -  mi_option_show_errors, -mi_option_show_stats, -mi_option_verbose, -mi_option_eager_commit, -
    -  mi_option_eager_region_commit, -mi_option_large_os_pages, -mi_option_reserve_huge_os_pages, -mi_option_segment_cache, -
    -  mi_option_page_reset, -mi_option_segment_reset, -mi_option_reset_delay, -mi_option_use_numa_nodes, -
    -  mi_option_reset_decommits, -mi_option_eager_commit_delay, -mi_option_os_tag, -_mi_option_last +  mi_option_show_errors +, mi_option_show_stats +, mi_option_verbose +, mi_option_eager_commit +,
    +  mi_option_eager_region_commit +, mi_option_large_os_pages +, mi_option_reserve_huge_os_pages +, mi_option_reserve_huge_os_pages_at +,
    +  mi_option_segment_cache +, mi_option_page_reset +, mi_option_segment_reset +, mi_option_reset_delay +,
    +  mi_option_use_numa_nodes +, mi_option_reset_decommits +, mi_option_eager_commit_delay +, mi_option_os_tag +,
    +  _mi_option_last
    }
     Runtime options. More...
    mi_option_reserve_huge_os_pages 

    The number of huge OS pages (1GiB in size) to reserve at the start of the program.

    mi_option_reserve_huge_os_pages_at 

    Reserve huge OS pages at node N.

    +
    mi_option_segment_cache 

    The number of segments per thread to keep cached.

    mi_option_page_reset 

    Reset page memory after mi_option_reset_delay milliseconds when it becomes free.

    @@ -397,9 +397,7 @@ Functions
    mi-malloc -  1.6 +  1.7/2.0
    - - +
    - + @@ -73,13 +69,13 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); -
    @@ -92,7 +88,7 @@ $(document).ready(function(){initNavTree('group__posix.html','');});
    -
    @@ -105,7 +101,7 @@ $(document).ready(function(){initNavTree('group__posix.html','');});
    -

    mi_ prefixed implementations of various Posix, Unix, and C++ allocation functions. +

    mi_ prefixed implementations of various Posix, Unix, and C++ allocation functions. More...

    - + @@ -130,7 +126,11 @@ Functions + + + + @@ -428,6 +428,42 @@ Functions

    @@ -115,7 +111,7 @@ Functions

    size_t mi_malloc_usable_size (const void *p)
     
    void mi_cfree (void *p)
     Just as free but also checks if the pointer p belongs to our heap. More...
     Just as free but also checks if the pointer p belongs to our heap. More...
     
    int mi_posix_memalign (void **p, size_t alignment, size_t size)
     
    void * mi_aligned_alloc (size_t alignment, size_t size)
     
    void * mi_reallocarray (void *p, size_t count, size_t size)
     Correspond s to reallocarray in FreeBSD. More...
     
    int mi_reallocarr (void *p, size_t count, size_t size)
     Corresponds to reallocarr in NetBSD. More...
     
    void mi_free_size (void *p, size_t size)
     
    void mi_free_size_aligned (void *p, size_t size, size_t alignment)
    +
    + + +

    ◆ mi_reallocarr()

    + +
    +
    + + + + + + + + + + + + + + + + + + + + + + + + +
    int mi_reallocarr (void * p,
    size_t count,
    size_t size 
    )
    +
    + +

    Corresponds to reallocarr in NetBSD.

    +
    @@ -462,6 +498,8 @@ Functions
    +

    Correspond s to reallocarray in FreeBSD.

    +
    @@ -487,9 +525,7 @@ Functions diff --git a/docs/group__posix.js b/docs/group__posix.js index e43453d..50c248c 100644 --- a/docs/group__posix.js +++ b/docs/group__posix.js @@ -11,6 +11,7 @@ var group__posix = [ "mi_memalign", "group__posix.html#gaab7fa71ea93b96873f5d9883db57d40e", null ], [ "mi_posix_memalign", "group__posix.html#gacff84f226ba9feb2031b8992e5579447", null ], [ "mi_pvalloc", "group__posix.html#gaeb325c39b887d3b90d85d1eb1712fb1e", null ], + [ "mi_reallocarr", "group__posix.html#ga7e1934d60a3e697950eeb48e042bfad5", null ], [ "mi_reallocarray", "group__posix.html#ga48fad8648a2f1dab9c87ea9448a52088", null ], [ "mi_valloc", "group__posix.html#ga73baaf5951f5165ba0763d0c06b6a93b", null ] ]; \ No newline at end of file diff --git a/docs/group__typed.html b/docs/group__typed.html index 5cbfbd6..3c00adb 100644 --- a/docs/group__typed.html +++ b/docs/group__typed.html @@ -3,7 +3,7 @@ - + mi-malloc: Typed Macros @@ -13,10 +13,6 @@ - @@ -37,21 +33,21 @@ Logo
    mi-malloc -  1.6 +  1.7/2.0
    - - +
    @@ -60,10 +56,10 @@ - + @@ -73,13 +69,13 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); -
    @@ -92,7 +88,7 @@ $(document).ready(function(){initNavTree('group__typed.html','');});
    -
    @@ -105,48 +101,50 @@ $(document).ready(function(){initNavTree('group__typed.html','');});
    -

    Typed allocation macros. +

    Typed allocation macros. More...

    - + - + - + - + - + - + - + - + - + - + - +

    Macros

    #define mi_malloc_tp(tp)
     Allocate a block of type tp. More...
     Allocate a block of type tp. More...
     
    #define mi_zalloc_tp(tp)
     Allocate a zero-initialized block of type tp. More...
     Allocate a zero-initialized block of type tp. More...
     
    #define mi_calloc_tp(tp, count)
     Allocate count zero-initialized blocks of type tp. More...
     Allocate count zero-initialized blocks of type tp. More...
     
    #define mi_mallocn_tp(tp, count)
     Allocate count blocks of type tp. More...
     Allocate count blocks of type tp. More...
     
    #define mi_reallocn_tp(p, tp, count)
     Re-allocate to count blocks of type tp. More...
     Re-allocate to count blocks of type tp. More...
     
    #define mi_heap_malloc_tp(hp, tp)
     Allocate a block of type tp in a heap hp. More...
     Allocate a block of type tp in a heap hp. More...
     
    #define mi_heap_zalloc_tp(hp, tp)
     Allocate a zero-initialized block of type tp in a heap hp. More...
     Allocate a zero-initialized block of type tp in a heap hp. More...
     
    #define mi_heap_calloc_tp(hp, tp, count)
     Allocate count zero-initialized blocks of type tp in a heap hp. More...
     Allocate count zero-initialized blocks of type tp in a heap hp. More...
     
    #define mi_heap_mallocn_tp(hp, tp, count)
     Allocate count blocks of type tp in a heap hp. More...
     Allocate count blocks of type tp in a heap hp. More...
     
    #define mi_heap_reallocn_tp(hp, p, tp, count)
     Re-allocate to count blocks of type tp in a heap hp. More...
     Re-allocate to count blocks of type tp in a heap hp. More...
     
    #define mi_heap_recalloc_tp(hp, p, tp, count)
     Re-allocate to count zero initialized blocks of type tp in a heap hp. More...
     Re-allocate to count zero initialized blocks of type tp in a heap hp. More...
     

    Detailed Description

    Typed allocation macros.

    -

    For example:

    int* p = mi_malloc_tp(int)

    Macro Definition Documentation

    +

    For example:

    int* p = mi_malloc_tp(int)
    +
    mi_malloc_tp
    #define mi_malloc_tp(tp)
    Allocate a block of type tp.
    Definition: mimalloc-doc.h:692
    +

    Macro Definition Documentation

    ◆ mi_calloc_tp

    @@ -417,7 +415,8 @@ Macros
    Returns
    A pointer to an object of type tp, or NULL if out of memory.
    -

    Example:

    int* p = mi_malloc_tp(int)
    See also
    mi_malloc()
    +

    Example:

    int* p = mi_malloc_tp(int)
    +
    See also
    mi_malloc()
    @@ -512,9 +511,7 @@ Macros diff --git a/docs/group__zeroinit.html b/docs/group__zeroinit.html index 3c04a5a..41af9a2 100644 --- a/docs/group__zeroinit.html +++ b/docs/group__zeroinit.html @@ -3,7 +3,7 @@ - + mi-malloc: Zero initialized re-allocation @@ -13,10 +13,6 @@ - @@ -37,21 +33,21 @@ Logo
    mi-malloc -  1.6 +  1.7/2.0
    - - +
    @@ -60,10 +56,10 @@ - + @@ -73,13 +69,13 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); -
    @@ -92,7 +88,7 @@ $(document).ready(function(){initNavTree('group__zeroinit.html','');});
    -
    @@ -105,7 +101,7 @@ $(document).ready(function(){initNavTree('group__zeroinit.html','');});
    -

    The zero-initialized re-allocations are only valid on memory that was originally allocated with zero initialization too. +

    The zero-initialized re-allocations are only valid on memory that was originally allocated with zero initialization too. More...

    diff --git a/docs/index.html b/docs/index.html index 01af9be..6cc439d 100644 --- a/docs/index.html +++ b/docs/index.html @@ -3,7 +3,7 @@ - +mi-malloc: Main Page @@ -13,10 +13,6 @@ - @@ -37,21 +33,21 @@ @@ -60,10 +56,10 @@

    @@ -588,9 +584,7 @@ Functions

    mi-malloc -  1.6 +  1.7/2.0
    - - +
    - + @@ -73,13 +69,13 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); -
    @@ -92,7 +88,7 @@ $(document).ready(function(){initNavTree('index.html','');});
    -
    @@ -103,13 +99,14 @@ $(document).ready(function(){initNavTree('index.html','');});

    This is the API documentation of the mimalloc allocator (pronounced "me-malloc") – a general purpose allocator with excellent performance characteristics. Initially developed by Daan Leijen for the run-time systems of the Koka and Lean languages.

    -

    It is a drop-in replacement for malloc and can be used in other programs without code changes, for example, on Unix you can use it as:

    > LD_PRELOAD=/usr/bin/libmimalloc.so myprogram

    Notable aspects of the design include:

    +

    It is a drop-in replacement for malloc and can be used in other programs without code changes, for example, on Unix you can use it as:

    > LD_PRELOAD=/usr/bin/libmimalloc.so myprogram
    +

    Notable aspects of the design include:

    • small and consistent: the library is about 8k LOC using simple and consistent data structures. This makes it very suitable to integrate and adapt in other projects. For runtime systems it provides hooks for a monotonic heartbeat and deferred freeing (for bounded worst-case times with reference counting).
    • free list sharding: instead of one big free list (per size class) we have many smaller lists per "mimalloc page" which reduces fragmentation and increases locality – things that are allocated close in time get allocated close in memory. (A mimalloc page contains blocks of one size class and is usually 64KiB on a 64-bit system).
    • free list multi-sharding: the big idea! Not only do we shard the free list per mimalloc page, but for each page we have multiple free lists. In particular, there is one list for thread-local free operations, and another one for concurrent free operations. Free-ing from another thread can now be a single CAS without needing sophisticated coordination between threads. Since there will be thousands of separate free lists, contention is naturally distributed over the heap, and the chance of contending on a single location will be low – this is quite similar to randomized algorithms like skip lists where adding a random oracle removes the need for a more complex algorithm.
    • eager page reset: when a "page" becomes empty (with increased chance due to free list sharding) the memory is marked to the OS as unused ("reset" or "purged") reducing (real) memory pressure and fragmentation, especially in long running programs.
      • -
    • secure: mimalloc can be build in secure mode, adding guard pages, randomized allocation, encrypted free lists, etc. to protect against various heap vulnerabilities. The performance penalty is only around 3% on average over our benchmarks.
      • +
    • secure: mimalloc can be build in secure mode, adding guard pages, randomized allocation, encrypted free lists, etc. to protect against various heap vulnerabilities. The performance penalty is only around 5% on average over our benchmarks.
    • first-class heaps: efficiently create and use multiple heaps to allocate across different regions. A heap can be destroyed at once instead of deallocating each object separately.
    • bounded: it does not suffer from blowup [1], has bounded worst-case allocation times (wcat), bounded space overhead (~0.2% meta-data, with at most 12.5% waste in allocation sizes), and has no internal points of contention using only atomic operations.
    • fast: In our benchmarks (see below), mimalloc outperforms all other leading allocators (jemalloc, tcmalloc, Hoard, etc), and usually uses less memory (up to 25% more in the worst case). A nice property is that it does consistently well over a wide range of benchmarks.
      • @@ -138,9 +135,7 @@ $(document).ready(function(){initNavTree('index.html','');}); diff --git a/docs/jquery.js b/docs/jquery.js index 1ee895c..103c32d 100644 --- a/docs/jquery.js +++ b/docs/jquery.js @@ -1,71 +1,26 @@ +/*! jQuery v3.4.1 | (c) JS Foundation and other contributors | jquery.org/license */ +!function(e,t){"use strict";"object"==typeof module&&"object"==typeof module.exports?module.exports=e.document?t(e,!0):function(e){if(!e.document)throw new Error("jQuery requires a window with a document");return t(e)}:t(e)}("undefined"!=typeof window?window:this,function(C,e){"use strict";var t=[],E=C.document,r=Object.getPrototypeOf,s=t.slice,g=t.concat,u=t.push,i=t.indexOf,n={},o=n.toString,v=n.hasOwnProperty,a=v.toString,l=a.call(Object),y={},m=function(e){return"function"==typeof e&&"number"!=typeof e.nodeType},x=function(e){return null!=e&&e===e.window},c={type:!0,src:!0,nonce:!0,noModule:!0};function b(e,t,n){var r,i,o=(n=n||E).createElement("script");if(o.text=e,t)for(r in c)(i=t[r]||t.getAttribute&&t.getAttribute(r))&&o.setAttribute(r,i);n.head.appendChild(o).parentNode.removeChild(o)}function w(e){return null==e?e+"":"object"==typeof e||"function"==typeof e?n[o.call(e)]||"object":typeof e}var f="3.4.1",k=function(e,t){return new k.fn.init(e,t)},p=/^[\s\uFEFF\xA0]+|[\s\uFEFF\xA0]+$/g;function d(e){var t=!!e&&"length"in e&&e.length,n=w(e);return!m(e)&&!x(e)&&("array"===n||0===t||"number"==typeof t&&0+~]|"+M+")"+M+"*"),U=new RegExp(M+"|>"),X=new RegExp($),V=new RegExp("^"+I+"$"),G={ID:new RegExp("^#("+I+")"),CLASS:new RegExp("^\\.("+I+")"),TAG:new RegExp("^("+I+"|[*])"),ATTR:new RegExp("^"+W),PSEUDO:new RegExp("^"+$),CHILD:new RegExp("^:(only|first|last|nth|nth-last)-(child|of-type)(?:\\("+M+"*(even|odd|(([+-]|)(\\d*)n|)"+M+"*(?:([+-]|)"+M+"*(\\d+)|))"+M+"*\\)|)","i"),bool:new RegExp("^(?:"+R+")$","i"),needsContext:new RegExp("^"+M+"*[>+~]|:(even|odd|eq|gt|lt|nth|first|last)(?:\\("+M+"*((?:-\\d)?\\d*)"+M+"*\\)|)(?=[^-]|$)","i")},Y=/HTML$/i,Q=/^(?:input|select|textarea|button)$/i,J=/^h\d$/i,K=/^[^{]+\{\s*\[native \w/,Z=/^(?:#([\w-]+)|(\w+)|\.([\w-]+))$/,ee=/[+~]/,te=new RegExp("\\\\([\\da-f]{1,6}"+M+"?|("+M+")|.)","ig"),ne=function(e,t,n){var r="0x"+t-65536;return r!=r||n?t:r<0?String.fromCharCode(r+65536):String.fromCharCode(r>>10|55296,1023&r|56320)},re=/([\0-\x1f\x7f]|^-?\d)|^-$|[^\0-\x1f\x7f-\uFFFF\w-]/g,ie=function(e,t){return t?"\0"===e?"\ufffd":e.slice(0,-1)+"\\"+e.charCodeAt(e.length-1).toString(16)+" ":"\\"+e},oe=function(){T()},ae=be(function(e){return!0===e.disabled&&"fieldset"===e.nodeName.toLowerCase()},{dir:"parentNode",next:"legend"});try{H.apply(t=O.call(m.childNodes),m.childNodes),t[m.childNodes.length].nodeType}catch(e){H={apply:t.length?function(e,t){L.apply(e,O.call(t))}:function(e,t){var n=e.length,r=0;while(e[n++]=t[r++]);e.length=n-1}}}function se(t,e,n,r){var i,o,a,s,u,l,c,f=e&&e.ownerDocument,p=e?e.nodeType:9;if(n=n||[],"string"!=typeof t||!t||1!==p&&9!==p&&11!==p)return n;if(!r&&((e?e.ownerDocument||e:m)!==C&&T(e),e=e||C,E)){if(11!==p&&(u=Z.exec(t)))if(i=u[1]){if(9===p){if(!(a=e.getElementById(i)))return n;if(a.id===i)return n.push(a),n}else if(f&&(a=f.getElementById(i))&&y(e,a)&&a.id===i)return n.push(a),n}else{if(u[2])return H.apply(n,e.getElementsByTagName(t)),n;if((i=u[3])&&d.getElementsByClassName&&e.getElementsByClassName)return H.apply(n,e.getElementsByClassName(i)),n}if(d.qsa&&!A[t+" "]&&(!v||!v.test(t))&&(1!==p||"object"!==e.nodeName.toLowerCase())){if(c=t,f=e,1===p&&U.test(t)){(s=e.getAttribute("id"))?s=s.replace(re,ie):e.setAttribute("id",s=k),o=(l=h(t)).length;while(o--)l[o]="#"+s+" "+xe(l[o]);c=l.join(","),f=ee.test(t)&&ye(e.parentNode)||e}try{return H.apply(n,f.querySelectorAll(c)),n}catch(e){A(t,!0)}finally{s===k&&e.removeAttribute("id")}}}return g(t.replace(B,"$1"),e,n,r)}function ue(){var r=[];return function e(t,n){return r.push(t+" ")>b.cacheLength&&delete e[r.shift()],e[t+" "]=n}}function le(e){return e[k]=!0,e}function ce(e){var t=C.createElement("fieldset");try{return!!e(t)}catch(e){return!1}finally{t.parentNode&&t.parentNode.removeChild(t),t=null}}function fe(e,t){var n=e.split("|"),r=n.length;while(r--)b.attrHandle[n[r]]=t}function pe(e,t){var n=t&&e,r=n&&1===e.nodeType&&1===t.nodeType&&e.sourceIndex-t.sourceIndex;if(r)return r;if(n)while(n=n.nextSibling)if(n===t)return-1;return e?1:-1}function de(t){return function(e){return"input"===e.nodeName.toLowerCase()&&e.type===t}}function he(n){return function(e){var t=e.nodeName.toLowerCase();return("input"===t||"button"===t)&&e.type===n}}function ge(t){return function(e){return"form"in e?e.parentNode&&!1===e.disabled?"label"in e?"label"in e.parentNode?e.parentNode.disabled===t:e.disabled===t:e.isDisabled===t||e.isDisabled!==!t&&ae(e)===t:e.disabled===t:"label"in e&&e.disabled===t}}function ve(a){return le(function(o){return o=+o,le(function(e,t){var n,r=a([],e.length,o),i=r.length;while(i--)e[n=r[i]]&&(e[n]=!(t[n]=e[n]))})})}function ye(e){return e&&"undefined"!=typeof e.getElementsByTagName&&e}for(e in d=se.support={},i=se.isXML=function(e){var t=e.namespaceURI,n=(e.ownerDocument||e).documentElement;return!Y.test(t||n&&n.nodeName||"HTML")},T=se.setDocument=function(e){var t,n,r=e?e.ownerDocument||e:m;return r!==C&&9===r.nodeType&&r.documentElement&&(a=(C=r).documentElement,E=!i(C),m!==C&&(n=C.defaultView)&&n.top!==n&&(n.addEventListener?n.addEventListener("unload",oe,!1):n.attachEvent&&n.attachEvent("onunload",oe)),d.attributes=ce(function(e){return e.className="i",!e.getAttribute("className")}),d.getElementsByTagName=ce(function(e){return e.appendChild(C.createComment("")),!e.getElementsByTagName("*").length}),d.getElementsByClassName=K.test(C.getElementsByClassName),d.getById=ce(function(e){return a.appendChild(e).id=k,!C.getElementsByName||!C.getElementsByName(k).length}),d.getById?(b.filter.ID=function(e){var t=e.replace(te,ne);return function(e){return e.getAttribute("id")===t}},b.find.ID=function(e,t){if("undefined"!=typeof t.getElementById&&E){var n=t.getElementById(e);return n?[n]:[]}}):(b.filter.ID=function(e){var n=e.replace(te,ne);return function(e){var t="undefined"!=typeof e.getAttributeNode&&e.getAttributeNode("id");return t&&t.value===n}},b.find.ID=function(e,t){if("undefined"!=typeof t.getElementById&&E){var n,r,i,o=t.getElementById(e);if(o){if((n=o.getAttributeNode("id"))&&n.value===e)return[o];i=t.getElementsByName(e),r=0;while(o=i[r++])if((n=o.getAttributeNode("id"))&&n.value===e)return[o]}return[]}}),b.find.TAG=d.getElementsByTagName?function(e,t){return"undefined"!=typeof t.getElementsByTagName?t.getElementsByTagName(e):d.qsa?t.querySelectorAll(e):void 0}:function(e,t){var n,r=[],i=0,o=t.getElementsByTagName(e);if("*"===e){while(n=o[i++])1===n.nodeType&&r.push(n);return r}return o},b.find.CLASS=d.getElementsByClassName&&function(e,t){if("undefined"!=typeof t.getElementsByClassName&&E)return t.getElementsByClassName(e)},s=[],v=[],(d.qsa=K.test(C.querySelectorAll))&&(ce(function(e){a.appendChild(e).innerHTML="",e.querySelectorAll("[msallowcapture^='']").length&&v.push("[*^$]="+M+"*(?:''|\"\")"),e.querySelectorAll("[selected]").length||v.push("\\["+M+"*(?:value|"+R+")"),e.querySelectorAll("[id~="+k+"-]").length||v.push("~="),e.querySelectorAll(":checked").length||v.push(":checked"),e.querySelectorAll("a#"+k+"+*").length||v.push(".#.+[+~]")}),ce(function(e){e.innerHTML="";var t=C.createElement("input");t.setAttribute("type","hidden"),e.appendChild(t).setAttribute("name","D"),e.querySelectorAll("[name=d]").length&&v.push("name"+M+"*[*^$|!~]?="),2!==e.querySelectorAll(":enabled").length&&v.push(":enabled",":disabled"),a.appendChild(e).disabled=!0,2!==e.querySelectorAll(":disabled").length&&v.push(":enabled",":disabled"),e.querySelectorAll("*,:x"),v.push(",.*:")})),(d.matchesSelector=K.test(c=a.matches||a.webkitMatchesSelector||a.mozMatchesSelector||a.oMatchesSelector||a.msMatchesSelector))&&ce(function(e){d.disconnectedMatch=c.call(e,"*"),c.call(e,"[s!='']:x"),s.push("!=",$)}),v=v.length&&new RegExp(v.join("|")),s=s.length&&new RegExp(s.join("|")),t=K.test(a.compareDocumentPosition),y=t||K.test(a.contains)?function(e,t){var n=9===e.nodeType?e.documentElement:e,r=t&&t.parentNode;return e===r||!(!r||1!==r.nodeType||!(n.contains?n.contains(r):e.compareDocumentPosition&&16&e.compareDocumentPosition(r)))}:function(e,t){if(t)while(t=t.parentNode)if(t===e)return!0;return!1},D=t?function(e,t){if(e===t)return l=!0,0;var n=!e.compareDocumentPosition-!t.compareDocumentPosition;return n||(1&(n=(e.ownerDocument||e)===(t.ownerDocument||t)?e.compareDocumentPosition(t):1)||!d.sortDetached&&t.compareDocumentPosition(e)===n?e===C||e.ownerDocument===m&&y(m,e)?-1:t===C||t.ownerDocument===m&&y(m,t)?1:u?P(u,e)-P(u,t):0:4&n?-1:1)}:function(e,t){if(e===t)return l=!0,0;var n,r=0,i=e.parentNode,o=t.parentNode,a=[e],s=[t];if(!i||!o)return e===C?-1:t===C?1:i?-1:o?1:u?P(u,e)-P(u,t):0;if(i===o)return pe(e,t);n=e;while(n=n.parentNode)a.unshift(n);n=t;while(n=n.parentNode)s.unshift(n);while(a[r]===s[r])r++;return r?pe(a[r],s[r]):a[r]===m?-1:s[r]===m?1:0}),C},se.matches=function(e,t){return se(e,null,null,t)},se.matchesSelector=function(e,t){if((e.ownerDocument||e)!==C&&T(e),d.matchesSelector&&E&&!A[t+" "]&&(!s||!s.test(t))&&(!v||!v.test(t)))try{var n=c.call(e,t);if(n||d.disconnectedMatch||e.document&&11!==e.document.nodeType)return n}catch(e){A(t,!0)}return 0":{dir:"parentNode",first:!0}," ":{dir:"parentNode"},"+":{dir:"previousSibling",first:!0},"~":{dir:"previousSibling"}},preFilter:{ATTR:function(e){return e[1]=e[1].replace(te,ne),e[3]=(e[3]||e[4]||e[5]||"").replace(te,ne),"~="===e[2]&&(e[3]=" "+e[3]+" "),e.slice(0,4)},CHILD:function(e){return e[1]=e[1].toLowerCase(),"nth"===e[1].slice(0,3)?(e[3]||se.error(e[0]),e[4]=+(e[4]?e[5]+(e[6]||1):2*("even"===e[3]||"odd"===e[3])),e[5]=+(e[7]+e[8]||"odd"===e[3])):e[3]&&se.error(e[0]),e},PSEUDO:function(e){var t,n=!e[6]&&e[2];return G.CHILD.test(e[0])?null:(e[3]?e[2]=e[4]||e[5]||"":n&&X.test(n)&&(t=h(n,!0))&&(t=n.indexOf(")",n.length-t)-n.length)&&(e[0]=e[0].slice(0,t),e[2]=n.slice(0,t)),e.slice(0,3))}},filter:{TAG:function(e){var t=e.replace(te,ne).toLowerCase();return"*"===e?function(){return!0}:function(e){return e.nodeName&&e.nodeName.toLowerCase()===t}},CLASS:function(e){var t=p[e+" "];return t||(t=new RegExp("(^|"+M+")"+e+"("+M+"|$)"))&&p(e,function(e){return t.test("string"==typeof e.className&&e.className||"undefined"!=typeof e.getAttribute&&e.getAttribute("class")||"")})},ATTR:function(n,r,i){return function(e){var t=se.attr(e,n);return null==t?"!="===r:!r||(t+="","="===r?t===i:"!="===r?t!==i:"^="===r?i&&0===t.indexOf(i):"*="===r?i&&-1:\x20\t\r\n\f]*)[\x20\t\r\n\f]*\/?>(?:<\/\1>|)$/i;function j(e,n,r){return m(n)?k.grep(e,function(e,t){return!!n.call(e,t,e)!==r}):n.nodeType?k.grep(e,function(e){return e===n!==r}):"string"!=typeof n?k.grep(e,function(e){return-1)[^>]*|#([\w-]+))$/;(k.fn.init=function(e,t,n){var r,i;if(!e)return this;if(n=n||q,"string"==typeof e){if(!(r="<"===e[0]&&">"===e[e.length-1]&&3<=e.length?[null,e,null]:L.exec(e))||!r[1]&&t)return!t||t.jquery?(t||n).find(e):this.constructor(t).find(e);if(r[1]){if(t=t instanceof k?t[0]:t,k.merge(this,k.parseHTML(r[1],t&&t.nodeType?t.ownerDocument||t:E,!0)),D.test(r[1])&&k.isPlainObject(t))for(r in t)m(this[r])?this[r](t[r]):this.attr(r,t[r]);return this}return(i=E.getElementById(r[2]))&&(this[0]=i,this.length=1),this}return e.nodeType?(this[0]=e,this.length=1,this):m(e)?void 0!==n.ready?n.ready(e):e(k):k.makeArray(e,this)}).prototype=k.fn,q=k(E);var H=/^(?:parents|prev(?:Until|All))/,O={children:!0,contents:!0,next:!0,prev:!0};function P(e,t){while((e=e[t])&&1!==e.nodeType);return e}k.fn.extend({has:function(e){var t=k(e,this),n=t.length;return this.filter(function(){for(var e=0;e\x20\t\r\n\f]*)/i,he=/^$|^module$|\/(?:java|ecma)script/i,ge={option:[1,""],thead:[1,"","
      "],col:[2,"","
      "],tr:[2,"","
      "],td:[3,"","
      "],_default:[0,"",""]};function ve(e,t){var n;return n="undefined"!=typeof e.getElementsByTagName?e.getElementsByTagName(t||"*"):"undefined"!=typeof e.querySelectorAll?e.querySelectorAll(t||"*"):[],void 0===t||t&&A(e,t)?k.merge([e],n):n}function ye(e,t){for(var n=0,r=e.length;nx",y.noCloneChecked=!!me.cloneNode(!0).lastChild.defaultValue;var Te=/^key/,Ce=/^(?:mouse|pointer|contextmenu|drag|drop)|click/,Ee=/^([^.]*)(?:\.(.+)|)/;function ke(){return!0}function Se(){return!1}function Ne(e,t){return e===function(){try{return E.activeElement}catch(e){}}()==("focus"===t)}function Ae(e,t,n,r,i,o){var a,s;if("object"==typeof t){for(s in"string"!=typeof n&&(r=r||n,n=void 0),t)Ae(e,s,n,r,t[s],o);return e}if(null==r&&null==i?(i=n,r=n=void 0):null==i&&("string"==typeof n?(i=r,r=void 0):(i=r,r=n,n=void 0)),!1===i)i=Se;else if(!i)return e;return 1===o&&(a=i,(i=function(e){return k().off(e),a.apply(this,arguments)}).guid=a.guid||(a.guid=k.guid++)),e.each(function(){k.event.add(this,t,i,r,n)})}function De(e,i,o){o?(Q.set(e,i,!1),k.event.add(e,i,{namespace:!1,handler:function(e){var t,n,r=Q.get(this,i);if(1&e.isTrigger&&this[i]){if(r.length)(k.event.special[i]||{}).delegateType&&e.stopPropagation();else if(r=s.call(arguments),Q.set(this,i,r),t=o(this,i),this[i](),r!==(n=Q.get(this,i))||t?Q.set(this,i,!1):n={},r!==n)return e.stopImmediatePropagation(),e.preventDefault(),n.value}else r.length&&(Q.set(this,i,{value:k.event.trigger(k.extend(r[0],k.Event.prototype),r.slice(1),this)}),e.stopImmediatePropagation())}})):void 0===Q.get(e,i)&&k.event.add(e,i,ke)}k.event={global:{},add:function(t,e,n,r,i){var o,a,s,u,l,c,f,p,d,h,g,v=Q.get(t);if(v){n.handler&&(n=(o=n).handler,i=o.selector),i&&k.find.matchesSelector(ie,i),n.guid||(n.guid=k.guid++),(u=v.events)||(u=v.events={}),(a=v.handle)||(a=v.handle=function(e){return"undefined"!=typeof k&&k.event.triggered!==e.type?k.event.dispatch.apply(t,arguments):void 0}),l=(e=(e||"").match(R)||[""]).length;while(l--)d=g=(s=Ee.exec(e[l])||[])[1],h=(s[2]||"").split(".").sort(),d&&(f=k.event.special[d]||{},d=(i?f.delegateType:f.bindType)||d,f=k.event.special[d]||{},c=k.extend({type:d,origType:g,data:r,handler:n,guid:n.guid,selector:i,needsContext:i&&k.expr.match.needsContext.test(i),namespace:h.join(".")},o),(p=u[d])||((p=u[d]=[]).delegateCount=0,f.setup&&!1!==f.setup.call(t,r,h,a)||t.addEventListener&&t.addEventListener(d,a)),f.add&&(f.add.call(t,c),c.handler.guid||(c.handler.guid=n.guid)),i?p.splice(p.delegateCount++,0,c):p.push(c),k.event.global[d]=!0)}},remove:function(e,t,n,r,i){var o,a,s,u,l,c,f,p,d,h,g,v=Q.hasData(e)&&Q.get(e);if(v&&(u=v.events)){l=(t=(t||"").match(R)||[""]).length;while(l--)if(d=g=(s=Ee.exec(t[l])||[])[1],h=(s[2]||"").split(".").sort(),d){f=k.event.special[d]||{},p=u[d=(r?f.delegateType:f.bindType)||d]||[],s=s[2]&&new RegExp("(^|\\.)"+h.join("\\.(?:.*\\.|)")+"(\\.|$)"),a=o=p.length;while(o--)c=p[o],!i&&g!==c.origType||n&&n.guid!==c.guid||s&&!s.test(c.namespace)||r&&r!==c.selector&&("**"!==r||!c.selector)||(p.splice(o,1),c.selector&&p.delegateCount--,f.remove&&f.remove.call(e,c));a&&!p.length&&(f.teardown&&!1!==f.teardown.call(e,h,v.handle)||k.removeEvent(e,d,v.handle),delete u[d])}else for(d in u)k.event.remove(e,d+t[l],n,r,!0);k.isEmptyObject(u)&&Q.remove(e,"handle events")}},dispatch:function(e){var t,n,r,i,o,a,s=k.event.fix(e),u=new Array(arguments.length),l=(Q.get(this,"events")||{})[s.type]||[],c=k.event.special[s.type]||{};for(u[0]=s,t=1;t\x20\t\r\n\f]*)[^>]*)\/>/gi,qe=/\s*$/g;function Oe(e,t){return A(e,"table")&&A(11!==t.nodeType?t:t.firstChild,"tr")&&k(e).children("tbody")[0]||e}function Pe(e){return e.type=(null!==e.getAttribute("type"))+"/"+e.type,e}function Re(e){return"true/"===(e.type||"").slice(0,5)?e.type=e.type.slice(5):e.removeAttribute("type"),e}function Me(e,t){var n,r,i,o,a,s,u,l;if(1===t.nodeType){if(Q.hasData(e)&&(o=Q.access(e),a=Q.set(t,o),l=o.events))for(i in delete a.handle,a.events={},l)for(n=0,r=l[i].length;n")},clone:function(e,t,n){var r,i,o,a,s,u,l,c=e.cloneNode(!0),f=oe(e);if(!(y.noCloneChecked||1!==e.nodeType&&11!==e.nodeType||k.isXMLDoc(e)))for(a=ve(c),r=0,i=(o=ve(e)).length;r").attr(n.scriptAttrs||{}).prop({charset:n.scriptCharset,src:n.url}).on("load error",i=function(e){r.remove(),i=null,e&&t("error"===e.type?404:200,e.type)}),E.head.appendChild(r[0])},abort:function(){i&&i()}}});var Vt,Gt=[],Yt=/(=)\?(?=&|$)|\?\?/;k.ajaxSetup({jsonp:"callback",jsonpCallback:function(){var e=Gt.pop()||k.expando+"_"+kt++;return this[e]=!0,e}}),k.ajaxPrefilter("json jsonp",function(e,t,n){var r,i,o,a=!1!==e.jsonp&&(Yt.test(e.url)?"url":"string"==typeof e.data&&0===(e.contentType||"").indexOf("application/x-www-form-urlencoded")&&Yt.test(e.data)&&"data");if(a||"jsonp"===e.dataTypes[0])return r=e.jsonpCallback=m(e.jsonpCallback)?e.jsonpCallback():e.jsonpCallback,a?e[a]=e[a].replace(Yt,"$1"+r):!1!==e.jsonp&&(e.url+=(St.test(e.url)?"&":"?")+e.jsonp+"="+r),e.converters["script json"]=function(){return o||k.error(r+" was not called"),o[0]},e.dataTypes[0]="json",i=C[r],C[r]=function(){o=arguments},n.always(function(){void 0===i?k(C).removeProp(r):C[r]=i,e[r]&&(e.jsonpCallback=t.jsonpCallback,Gt.push(r)),o&&m(i)&&i(o[0]),o=i=void 0}),"script"}),y.createHTMLDocument=((Vt=E.implementation.createHTMLDocument("").body).innerHTML="
      ",2===Vt.childNodes.length),k.parseHTML=function(e,t,n){return"string"!=typeof e?[]:("boolean"==typeof t&&(n=t,t=!1),t||(y.createHTMLDocument?((r=(t=E.implementation.createHTMLDocument("")).createElement("base")).href=E.location.href,t.head.appendChild(r)):t=E),o=!n&&[],(i=D.exec(e))?[t.createElement(i[1])]:(i=we([e],t,o),o&&o.length&&k(o).remove(),k.merge([],i.childNodes)));var r,i,o},k.fn.load=function(e,t,n){var r,i,o,a=this,s=e.indexOf(" ");return-1").append(k.parseHTML(e)).find(r):e)}).always(n&&function(e,t){a.each(function(){n.apply(this,o||[e.responseText,t,e])})}),this},k.each(["ajaxStart","ajaxStop","ajaxComplete","ajaxError","ajaxSuccess","ajaxSend"],function(e,t){k.fn[t]=function(e){return this.on(t,e)}}),k.expr.pseudos.animated=function(t){return k.grep(k.timers,function(e){return t===e.elem}).length},k.offset={setOffset:function(e,t,n){var r,i,o,a,s,u,l=k.css(e,"position"),c=k(e),f={};"static"===l&&(e.style.position="relative"),s=c.offset(),o=k.css(e,"top"),u=k.css(e,"left"),("absolute"===l||"fixed"===l)&&-1<(o+u).indexOf("auto")?(a=(r=c.position()).top,i=r.left):(a=parseFloat(o)||0,i=parseFloat(u)||0),m(t)&&(t=t.call(e,n,k.extend({},s))),null!=t.top&&(f.top=t.top-s.top+a),null!=t.left&&(f.left=t.left-s.left+i),"using"in t?t.using.call(e,f):c.css(f)}},k.fn.extend({offset:function(t){if(arguments.length)return void 0===t?this:this.each(function(e){k.offset.setOffset(this,t,e)});var e,n,r=this[0];return r?r.getClientRects().length?(e=r.getBoundingClientRect(),n=r.ownerDocument.defaultView,{top:e.top+n.pageYOffset,left:e.left+n.pageXOffset}):{top:0,left:0}:void 0},position:function(){if(this[0]){var e,t,n,r=this[0],i={top:0,left:0};if("fixed"===k.css(r,"position"))t=r.getBoundingClientRect();else{t=this.offset(),n=r.ownerDocument,e=r.offsetParent||n.documentElement;while(e&&(e===n.body||e===n.documentElement)&&"static"===k.css(e,"position"))e=e.parentNode;e&&e!==r&&1===e.nodeType&&((i=k(e).offset()).top+=k.css(e,"borderTopWidth",!0),i.left+=k.css(e,"borderLeftWidth",!0))}return{top:t.top-i.top-k.css(r,"marginTop",!0),left:t.left-i.left-k.css(r,"marginLeft",!0)}}},offsetParent:function(){return this.map(function(){var e=this.offsetParent;while(e&&"static"===k.css(e,"position"))e=e.offsetParent;return e||ie})}}),k.each({scrollLeft:"pageXOffset",scrollTop:"pageYOffset"},function(t,i){var o="pageYOffset"===i;k.fn[t]=function(e){return _(this,function(e,t,n){var r;if(x(e)?r=e:9===e.nodeType&&(r=e.defaultView),void 0===n)return r?r[i]:e[t];r?r.scrollTo(o?r.pageXOffset:n,o?n:r.pageYOffset):e[t]=n},t,e,arguments.length)}}),k.each(["top","left"],function(e,n){k.cssHooks[n]=ze(y.pixelPosition,function(e,t){if(t)return t=_e(e,n),$e.test(t)?k(e).position()[n]+"px":t})}),k.each({Height:"height",Width:"width"},function(a,s){k.each({padding:"inner"+a,content:s,"":"outer"+a},function(r,o){k.fn[o]=function(e,t){var n=arguments.length&&(r||"boolean"!=typeof e),i=r||(!0===e||!0===t?"margin":"border");return _(this,function(e,t,n){var r;return x(e)?0===o.indexOf("outer")?e["inner"+a]:e.document.documentElement["client"+a]:9===e.nodeType?(r=e.documentElement,Math.max(e.body["scroll"+a],r["scroll"+a],e.body["offset"+a],r["offset"+a],r["client"+a])):void 0===n?k.css(e,t,i):k.style(e,t,n,i)},s,n?e:void 0,n)}})}),k.each("blur focus focusin focusout resize scroll click dblclick mousedown mouseup mousemove mouseover mouseout mouseenter mouseleave change select submit keydown keypress keyup contextmenu".split(" "),function(e,n){k.fn[n]=function(e,t){return 0a;a++)for(i in o[a])n=o[a][i],o[a].hasOwnProperty(i)&&void 0!==n&&(e[i]=t.isPlainObject(n)?t.isPlainObject(e[i])?t.widget.extend({},e[i],n):t.widget.extend({},n):n);return e},t.widget.bridge=function(e,i){var n=i.prototype.widgetFullName||e;t.fn[e]=function(o){var a="string"==typeof o,r=s.call(arguments,1),h=this;return a?this.length||"instance"!==o?this.each(function(){var i,s=t.data(this,n);return"instance"===o?(h=s,!1):s?t.isFunction(s[o])&&"_"!==o.charAt(0)?(i=s[o].apply(s,r),i!==s&&void 0!==i?(h=i&&i.jquery?h.pushStack(i.get()):i,!1):void 0):t.error("no such method '"+o+"' for "+e+" widget instance"):t.error("cannot call methods on "+e+" prior to initialization; "+"attempted to call method '"+o+"'")}):h=void 0:(r.length&&(o=t.widget.extend.apply(null,[o].concat(r))),this.each(function(){var e=t.data(this,n);e?(e.option(o||{}),e._init&&e._init()):t.data(this,n,new i(o,this))})),h}},t.Widget=function(){},t.Widget._childConstructors=[],t.Widget.prototype={widgetName:"widget",widgetEventPrefix:"",defaultElement:"
      ",options:{classes:{},disabled:!1,create:null},_createWidget:function(e,s){s=t(s||this.defaultElement||this)[0],this.element=t(s),this.uuid=i++,this.eventNamespace="."+this.widgetName+this.uuid,this.bindings=t(),this.hoverable=t(),this.focusable=t(),this.classesElementLookup={},s!==this&&(t.data(s,this.widgetFullName,this),this._on(!0,this.element,{remove:function(t){t.target===s&&this.destroy()}}),this.document=t(s.style?s.ownerDocument:s.document||s),this.window=t(this.document[0].defaultView||this.document[0].parentWindow)),this.options=t.widget.extend({},this.options,this._getCreateOptions(),e),this._create(),this.options.disabled&&this._setOptionDisabled(this.options.disabled),this._trigger("create",null,this._getCreateEventData()),this._init()},_getCreateOptions:function(){return{}},_getCreateEventData:t.noop,_create:t.noop,_init:t.noop,destroy:function(){var e=this;this._destroy(),t.each(this.classesElementLookup,function(t,i){e._removeClass(i,t)}),this.element.off(this.eventNamespace).removeData(this.widgetFullName),this.widget().off(this.eventNamespace).removeAttr("aria-disabled"),this.bindings.off(this.eventNamespace)},_destroy:t.noop,widget:function(){return this.element},option:function(e,i){var s,n,o,a=e;if(0===arguments.length)return t.widget.extend({},this.options);if("string"==typeof e)if(a={},s=e.split("."),e=s.shift(),s.length){for(n=a[e]=t.widget.extend({},this.options[e]),o=0;s.length-1>o;o++)n[s[o]]=n[s[o]]||{},n=n[s[o]];if(e=s.pop(),1===arguments.length)return void 0===n[e]?null:n[e];n[e]=i}else{if(1===arguments.length)return void 0===this.options[e]?null:this.options[e];a[e]=i}return this._setOptions(a),this},_setOptions:function(t){var e;for(e in t)this._setOption(e,t[e]);return this},_setOption:function(t,e){return"classes"===t&&this._setOptionClasses(e),this.options[t]=e,"disabled"===t&&this._setOptionDisabled(e),this},_setOptionClasses:function(e){var i,s,n;for(i in e)n=this.classesElementLookup[i],e[i]!==this.options.classes[i]&&n&&n.length&&(s=t(n.get()),this._removeClass(n,i),s.addClass(this._classes({element:s,keys:i,classes:e,add:!0})))},_setOptionDisabled:function(t){this._toggleClass(this.widget(),this.widgetFullName+"-disabled",null,!!t),t&&(this._removeClass(this.hoverable,null,"ui-state-hover"),this._removeClass(this.focusable,null,"ui-state-focus"))},enable:function(){return this._setOptions({disabled:!1})},disable:function(){return this._setOptions({disabled:!0})},_classes:function(e){function i(i,o){var a,r;for(r=0;i.length>r;r++)a=n.classesElementLookup[i[r]]||t(),a=e.add?t(t.unique(a.get().concat(e.element.get()))):t(a.not(e.element).get()),n.classesElementLookup[i[r]]=a,s.push(i[r]),o&&e.classes[i[r]]&&s.push(e.classes[i[r]])}var s=[],n=this;return e=t.extend({element:this.element,classes:this.options.classes||{}},e),this._on(e.element,{remove:"_untrackClassesElement"}),e.keys&&i(e.keys.match(/\S+/g)||[],!0),e.extra&&i(e.extra.match(/\S+/g)||[]),s.join(" ")},_untrackClassesElement:function(e){var i=this;t.each(i.classesElementLookup,function(s,n){-1!==t.inArray(e.target,n)&&(i.classesElementLookup[s]=t(n.not(e.target).get()))})},_removeClass:function(t,e,i){return this._toggleClass(t,e,i,!1)},_addClass:function(t,e,i){return this._toggleClass(t,e,i,!0)},_toggleClass:function(t,e,i,s){s="boolean"==typeof s?s:i;var n="string"==typeof t||null===t,o={extra:n?e:i,keys:n?t:e,element:n?this.element:t,add:s};return o.element.toggleClass(this._classes(o),s),this},_on:function(e,i,s){var n,o=this;"boolean"!=typeof e&&(s=i,i=e,e=!1),s?(i=n=t(i),this.bindings=this.bindings.add(i)):(s=i,i=this.element,n=this.widget()),t.each(s,function(s,a){function r(){return e||o.options.disabled!==!0&&!t(this).hasClass("ui-state-disabled")?("string"==typeof a?o[a]:a).apply(o,arguments):void 0}"string"!=typeof a&&(r.guid=a.guid=a.guid||r.guid||t.guid++);var h=s.match(/^([\w:-]*)\s*(.*)$/),l=h[1]+o.eventNamespace,c=h[2];c?n.on(l,c,r):i.on(l,r)})},_off:function(e,i){i=(i||"").split(" ").join(this.eventNamespace+" ")+this.eventNamespace,e.off(i).off(i),this.bindings=t(this.bindings.not(e).get()),this.focusable=t(this.focusable.not(e).get()),this.hoverable=t(this.hoverable.not(e).get())},_delay:function(t,e){function i(){return("string"==typeof t?s[t]:t).apply(s,arguments)}var s=this;return setTimeout(i,e||0)},_hoverable:function(e){this.hoverable=this.hoverable.add(e),this._on(e,{mouseenter:function(e){this._addClass(t(e.currentTarget),null,"ui-state-hover")},mouseleave:function(e){this._removeClass(t(e.currentTarget),null,"ui-state-hover")}})},_focusable:function(e){this.focusable=this.focusable.add(e),this._on(e,{focusin:function(e){this._addClass(t(e.currentTarget),null,"ui-state-focus")},focusout:function(e){this._removeClass(t(e.currentTarget),null,"ui-state-focus")}})},_trigger:function(e,i,s){var n,o,a=this.options[e];if(s=s||{},i=t.Event(i),i.type=(e===this.widgetEventPrefix?e:this.widgetEventPrefix+e).toLowerCase(),i.target=this.element[0],o=i.originalEvent)for(n in o)n in i||(i[n]=o[n]);return this.element.trigger(i,s),!(t.isFunction(a)&&a.apply(this.element[0],[i].concat(s))===!1||i.isDefaultPrevented())}},t.each({show:"fadeIn",hide:"fadeOut"},function(e,i){t.Widget.prototype["_"+e]=function(s,n,o){"string"==typeof n&&(n={effect:n});var a,r=n?n===!0||"number"==typeof n?i:n.effect||i:e;n=n||{},"number"==typeof n&&(n={duration:n}),a=!t.isEmptyObject(n),n.complete=o,n.delay&&s.delay(n.delay),a&&t.effects&&t.effects.effect[r]?s[e](n):r!==e&&s[r]?s[r](n.duration,n.easing,o):s.queue(function(i){t(this)[e](),o&&o.call(s[0]),i()})}}),t.widget,function(){function e(t,e,i){return[parseFloat(t[0])*(u.test(t[0])?e/100:1),parseFloat(t[1])*(u.test(t[1])?i/100:1)]}function i(e,i){return parseInt(t.css(e,i),10)||0}function s(e){var i=e[0];return 9===i.nodeType?{width:e.width(),height:e.height(),offset:{top:0,left:0}}:t.isWindow(i)?{width:e.width(),height:e.height(),offset:{top:e.scrollTop(),left:e.scrollLeft()}}:i.preventDefault?{width:0,height:0,offset:{top:i.pageY,left:i.pageX}}:{width:e.outerWidth(),height:e.outerHeight(),offset:e.offset()}}var n,o=Math.max,a=Math.abs,r=/left|center|right/,h=/top|center|bottom/,l=/[\+\-]\d+(\.[\d]+)?%?/,c=/^\w+/,u=/%$/,d=t.fn.position;t.position={scrollbarWidth:function(){if(void 0!==n)return n;var e,i,s=t("
      "),o=s.children()[0];return t("body").append(s),e=o.offsetWidth,s.css("overflow","scroll"),i=o.offsetWidth,e===i&&(i=s[0].clientWidth),s.remove(),n=e-i},getScrollInfo:function(e){var i=e.isWindow||e.isDocument?"":e.element.css("overflow-x"),s=e.isWindow||e.isDocument?"":e.element.css("overflow-y"),n="scroll"===i||"auto"===i&&e.widthi?"left":e>0?"right":"center",vertical:0>r?"top":s>0?"bottom":"middle"};l>p&&p>a(e+i)&&(u.horizontal="center"),c>f&&f>a(s+r)&&(u.vertical="middle"),u.important=o(a(e),a(i))>o(a(s),a(r))?"horizontal":"vertical",n.using.call(this,t,u)}),h.offset(t.extend(D,{using:r}))})},t.ui.position={fit:{left:function(t,e){var i,s=e.within,n=s.isWindow?s.scrollLeft:s.offset.left,a=s.width,r=t.left-e.collisionPosition.marginLeft,h=n-r,l=r+e.collisionWidth-a-n;e.collisionWidth>a?h>0&&0>=l?(i=t.left+h+e.collisionWidth-a-n,t.left+=h-i):t.left=l>0&&0>=h?n:h>l?n+a-e.collisionWidth:n:h>0?t.left+=h:l>0?t.left-=l:t.left=o(t.left-r,t.left)},top:function(t,e){var i,s=e.within,n=s.isWindow?s.scrollTop:s.offset.top,a=e.within.height,r=t.top-e.collisionPosition.marginTop,h=n-r,l=r+e.collisionHeight-a-n;e.collisionHeight>a?h>0&&0>=l?(i=t.top+h+e.collisionHeight-a-n,t.top+=h-i):t.top=l>0&&0>=h?n:h>l?n+a-e.collisionHeight:n:h>0?t.top+=h:l>0?t.top-=l:t.top=o(t.top-r,t.top)}},flip:{left:function(t,e){var i,s,n=e.within,o=n.offset.left+n.scrollLeft,r=n.width,h=n.isWindow?n.scrollLeft:n.offset.left,l=t.left-e.collisionPosition.marginLeft,c=l-h,u=l+e.collisionWidth-r-h,d="left"===e.my[0]?-e.elemWidth:"right"===e.my[0]?e.elemWidth:0,p="left"===e.at[0]?e.targetWidth:"right"===e.at[0]?-e.targetWidth:0,f=-2*e.offset[0];0>c?(i=t.left+d+p+f+e.collisionWidth-r-o,(0>i||a(c)>i)&&(t.left+=d+p+f)):u>0&&(s=t.left-e.collisionPosition.marginLeft+d+p+f-h,(s>0||u>a(s))&&(t.left+=d+p+f))},top:function(t,e){var i,s,n=e.within,o=n.offset.top+n.scrollTop,r=n.height,h=n.isWindow?n.scrollTop:n.offset.top,l=t.top-e.collisionPosition.marginTop,c=l-h,u=l+e.collisionHeight-r-h,d="top"===e.my[1],p=d?-e.elemHeight:"bottom"===e.my[1]?e.elemHeight:0,f="top"===e.at[1]?e.targetHeight:"bottom"===e.at[1]?-e.targetHeight:0,m=-2*e.offset[1];0>c?(s=t.top+p+f+m+e.collisionHeight-r-o,(0>s||a(c)>s)&&(t.top+=p+f+m)):u>0&&(i=t.top-e.collisionPosition.marginTop+p+f+m-h,(i>0||u>a(i))&&(t.top+=p+f+m))}},flipfit:{left:function(){t.ui.position.flip.left.apply(this,arguments),t.ui.position.fit.left.apply(this,arguments)},top:function(){t.ui.position.flip.top.apply(this,arguments),t.ui.position.fit.top.apply(this,arguments)}}}}(),t.ui.position,t.extend(t.expr[":"],{data:t.expr.createPseudo?t.expr.createPseudo(function(e){return function(i){return!!t.data(i,e)}}):function(e,i,s){return!!t.data(e,s[3])}}),t.fn.extend({disableSelection:function(){var t="onselectstart"in document.createElement("div")?"selectstart":"mousedown";return function(){return this.on(t+".ui-disableSelection",function(t){t.preventDefault()})}}(),enableSelection:function(){return this.off(".ui-disableSelection")}}),t.ui.focusable=function(i,s){var n,o,a,r,h,l=i.nodeName.toLowerCase();return"area"===l?(n=i.parentNode,o=n.name,i.href&&o&&"map"===n.nodeName.toLowerCase()?(a=t("img[usemap='#"+o+"']"),a.length>0&&a.is(":visible")):!1):(/^(input|select|textarea|button|object)$/.test(l)?(r=!i.disabled,r&&(h=t(i).closest("fieldset")[0],h&&(r=!h.disabled))):r="a"===l?i.href||s:s,r&&t(i).is(":visible")&&e(t(i)))},t.extend(t.expr[":"],{focusable:function(e){return t.ui.focusable(e,null!=t.attr(e,"tabindex"))}}),t.ui.focusable,t.fn.form=function(){return"string"==typeof this[0].form?this.closest("form"):t(this[0].form)},t.ui.formResetMixin={_formResetHandler:function(){var e=t(this);setTimeout(function(){var i=e.data("ui-form-reset-instances");t.each(i,function(){this.refresh()})})},_bindFormResetHandler:function(){if(this.form=this.element.form(),this.form.length){var t=this.form.data("ui-form-reset-instances")||[];t.length||this.form.on("reset.ui-form-reset",this._formResetHandler),t.push(this),this.form.data("ui-form-reset-instances",t)}},_unbindFormResetHandler:function(){if(this.form.length){var e=this.form.data("ui-form-reset-instances");e.splice(t.inArray(this,e),1),e.length?this.form.data("ui-form-reset-instances",e):this.form.removeData("ui-form-reset-instances").off("reset.ui-form-reset")}}},"1.7"===t.fn.jquery.substring(0,3)&&(t.each(["Width","Height"],function(e,i){function s(e,i,s,o){return t.each(n,function(){i-=parseFloat(t.css(e,"padding"+this))||0,s&&(i-=parseFloat(t.css(e,"border"+this+"Width"))||0),o&&(i-=parseFloat(t.css(e,"margin"+this))||0)}),i}var n="Width"===i?["Left","Right"]:["Top","Bottom"],o=i.toLowerCase(),a={innerWidth:t.fn.innerWidth,innerHeight:t.fn.innerHeight,outerWidth:t.fn.outerWidth,outerHeight:t.fn.outerHeight};t.fn["inner"+i]=function(e){return void 0===e?a["inner"+i].call(this):this.each(function(){t(this).css(o,s(this,e)+"px")})},t.fn["outer"+i]=function(e,n){return"number"!=typeof e?a["outer"+i].call(this,e):this.each(function(){t(this).css(o,s(this,e,!0,n)+"px")})}}),t.fn.addBack=function(t){return this.add(null==t?this.prevObject:this.prevObject.filter(t))}),t.ui.keyCode={BACKSPACE:8,COMMA:188,DELETE:46,DOWN:40,END:35,ENTER:13,ESCAPE:27,HOME:36,LEFT:37,PAGE_DOWN:34,PAGE_UP:33,PERIOD:190,RIGHT:39,SPACE:32,TAB:9,UP:38},t.ui.escapeSelector=function(){var t=/([!"#$%&'()*+,./:;<=>?@[\]^`{|}~])/g;return function(e){return e.replace(t,"\\$1")}}(),t.fn.labels=function(){var e,i,s,n,o;return this[0].labels&&this[0].labels.length?this.pushStack(this[0].labels):(n=this.eq(0).parents("label"),s=this.attr("id"),s&&(e=this.eq(0).parents().last(),o=e.add(e.length?e.siblings():this.siblings()),i="label[for='"+t.ui.escapeSelector(s)+"']",n=n.add(o.find(i).addBack(i))),this.pushStack(n))},t.fn.scrollParent=function(e){var i=this.css("position"),s="absolute"===i,n=e?/(auto|scroll|hidden)/:/(auto|scroll)/,o=this.parents().filter(function(){var e=t(this);return s&&"static"===e.css("position")?!1:n.test(e.css("overflow")+e.css("overflow-y")+e.css("overflow-x"))}).eq(0);return"fixed"!==i&&o.length?o:t(this[0].ownerDocument||document)},t.extend(t.expr[":"],{tabbable:function(e){var i=t.attr(e,"tabindex"),s=null!=i;return(!s||i>=0)&&t.ui.focusable(e,s)}}),t.fn.extend({uniqueId:function(){var t=0;return function(){return this.each(function(){this.id||(this.id="ui-id-"+ ++t)})}}(),removeUniqueId:function(){return this.each(function(){/^ui-id-\d+$/.test(this.id)&&t(this).removeAttr("id")})}}),t.ui.ie=!!/msie [\w.]+/.exec(navigator.userAgent.toLowerCase());var n=!1;t(document).on("mouseup",function(){n=!1}),t.widget("ui.mouse",{version:"1.12.1",options:{cancel:"input, textarea, button, select, option",distance:1,delay:0},_mouseInit:function(){var e=this;this.element.on("mousedown."+this.widgetName,function(t){return e._mouseDown(t)}).on("click."+this.widgetName,function(i){return!0===t.data(i.target,e.widgetName+".preventClickEvent")?(t.removeData(i.target,e.widgetName+".preventClickEvent"),i.stopImmediatePropagation(),!1):void 0}),this.started=!1},_mouseDestroy:function(){this.element.off("."+this.widgetName),this._mouseMoveDelegate&&this.document.off("mousemove."+this.widgetName,this._mouseMoveDelegate).off("mouseup."+this.widgetName,this._mouseUpDelegate)},_mouseDown:function(e){if(!n){this._mouseMoved=!1,this._mouseStarted&&this._mouseUp(e),this._mouseDownEvent=e;var i=this,s=1===e.which,o="string"==typeof this.options.cancel&&e.target.nodeName?t(e.target).closest(this.options.cancel).length:!1;return s&&!o&&this._mouseCapture(e)?(this.mouseDelayMet=!this.options.delay,this.mouseDelayMet||(this._mouseDelayTimer=setTimeout(function(){i.mouseDelayMet=!0},this.options.delay)),this._mouseDistanceMet(e)&&this._mouseDelayMet(e)&&(this._mouseStarted=this._mouseStart(e)!==!1,!this._mouseStarted)?(e.preventDefault(),!0):(!0===t.data(e.target,this.widgetName+".preventClickEvent")&&t.removeData(e.target,this.widgetName+".preventClickEvent"),this._mouseMoveDelegate=function(t){return i._mouseMove(t)},this._mouseUpDelegate=function(t){return i._mouseUp(t)},this.document.on("mousemove."+this.widgetName,this._mouseMoveDelegate).on("mouseup."+this.widgetName,this._mouseUpDelegate),e.preventDefault(),n=!0,!0)):!0}},_mouseMove:function(e){if(this._mouseMoved){if(t.ui.ie&&(!document.documentMode||9>document.documentMode)&&!e.button)return this._mouseUp(e);if(!e.which)if(e.originalEvent.altKey||e.originalEvent.ctrlKey||e.originalEvent.metaKey||e.originalEvent.shiftKey)this.ignoreMissingWhich=!0;else if(!this.ignoreMissingWhich)return this._mouseUp(e)}return(e.which||e.button)&&(this._mouseMoved=!0),this._mouseStarted?(this._mouseDrag(e),e.preventDefault()):(this._mouseDistanceMet(e)&&this._mouseDelayMet(e)&&(this._mouseStarted=this._mouseStart(this._mouseDownEvent,e)!==!1,this._mouseStarted?this._mouseDrag(e):this._mouseUp(e)),!this._mouseStarted)},_mouseUp:function(e){this.document.off("mousemove."+this.widgetName,this._mouseMoveDelegate).off("mouseup."+this.widgetName,this._mouseUpDelegate),this._mouseStarted&&(this._mouseStarted=!1,e.target===this._mouseDownEvent.target&&t.data(e.target,this.widgetName+".preventClickEvent",!0),this._mouseStop(e)),this._mouseDelayTimer&&(clearTimeout(this._mouseDelayTimer),delete this._mouseDelayTimer),this.ignoreMissingWhich=!1,n=!1,e.preventDefault()},_mouseDistanceMet:function(t){return Math.max(Math.abs(this._mouseDownEvent.pageX-t.pageX),Math.abs(this._mouseDownEvent.pageY-t.pageY))>=this.options.distance},_mouseDelayMet:function(){return this.mouseDelayMet},_mouseStart:function(){},_mouseDrag:function(){},_mouseStop:function(){},_mouseCapture:function(){return!0}}),t.ui.plugin={add:function(e,i,s){var n,o=t.ui[e].prototype;for(n in s)o.plugins[n]=o.plugins[n]||[],o.plugins[n].push([i,s[n]])},call:function(t,e,i,s){var n,o=t.plugins[e];if(o&&(s||t.element[0].parentNode&&11!==t.element[0].parentNode.nodeType))for(n=0;o.length>n;n++)t.options[o[n][0]]&&o[n][1].apply(t.element,i)}},t.widget("ui.resizable",t.ui.mouse,{version:"1.12.1",widgetEventPrefix:"resize",options:{alsoResize:!1,animate:!1,animateDuration:"slow",animateEasing:"swing",aspectRatio:!1,autoHide:!1,classes:{"ui-resizable-se":"ui-icon ui-icon-gripsmall-diagonal-se"},containment:!1,ghost:!1,grid:!1,handles:"e,s,se",helper:!1,maxHeight:null,maxWidth:null,minHeight:10,minWidth:10,zIndex:90,resize:null,start:null,stop:null},_num:function(t){return parseFloat(t)||0},_isNumber:function(t){return!isNaN(parseFloat(t))},_hasScroll:function(e,i){if("hidden"===t(e).css("overflow"))return!1;var s=i&&"left"===i?"scrollLeft":"scrollTop",n=!1;return e[s]>0?!0:(e[s]=1,n=e[s]>0,e[s]=0,n)},_create:function(){var e,i=this.options,s=this;this._addClass("ui-resizable"),t.extend(this,{_aspectRatio:!!i.aspectRatio,aspectRatio:i.aspectRatio,originalElement:this.element,_proportionallyResizeElements:[],_helper:i.helper||i.ghost||i.animate?i.helper||"ui-resizable-helper":null}),this.element[0].nodeName.match(/^(canvas|textarea|input|select|button|img)$/i)&&(this.element.wrap(t("
      ").css({position:this.element.css("position"),width:this.element.outerWidth(),height:this.element.outerHeight(),top:this.element.css("top"),left:this.element.css("left")})),this.element=this.element.parent().data("ui-resizable",this.element.resizable("instance")),this.elementIsWrapper=!0,e={marginTop:this.originalElement.css("marginTop"),marginRight:this.originalElement.css("marginRight"),marginBottom:this.originalElement.css("marginBottom"),marginLeft:this.originalElement.css("marginLeft")},this.element.css(e),this.originalElement.css("margin",0),this.originalResizeStyle=this.originalElement.css("resize"),this.originalElement.css("resize","none"),this._proportionallyResizeElements.push(this.originalElement.css({position:"static",zoom:1,display:"block"})),this.originalElement.css(e),this._proportionallyResize()),this._setupHandles(),i.autoHide&&t(this.element).on("mouseenter",function(){i.disabled||(s._removeClass("ui-resizable-autohide"),s._handles.show())}).on("mouseleave",function(){i.disabled||s.resizing||(s._addClass("ui-resizable-autohide"),s._handles.hide())}),this._mouseInit()},_destroy:function(){this._mouseDestroy();var e,i=function(e){t(e).removeData("resizable").removeData("ui-resizable").off(".resizable").find(".ui-resizable-handle").remove()};return this.elementIsWrapper&&(i(this.element),e=this.element,this.originalElement.css({position:e.css("position"),width:e.outerWidth(),height:e.outerHeight(),top:e.css("top"),left:e.css("left")}).insertAfter(e),e.remove()),this.originalElement.css("resize",this.originalResizeStyle),i(this.originalElement),this},_setOption:function(t,e){switch(this._super(t,e),t){case"handles":this._removeHandles(),this._setupHandles();break;default:}},_setupHandles:function(){var e,i,s,n,o,a=this.options,r=this;if(this.handles=a.handles||(t(".ui-resizable-handle",this.element).length?{n:".ui-resizable-n",e:".ui-resizable-e",s:".ui-resizable-s",w:".ui-resizable-w",se:".ui-resizable-se",sw:".ui-resizable-sw",ne:".ui-resizable-ne",nw:".ui-resizable-nw"}:"e,s,se"),this._handles=t(),this.handles.constructor===String)for("all"===this.handles&&(this.handles="n,e,s,w,se,sw,ne,nw"),s=this.handles.split(","),this.handles={},i=0;s.length>i;i++)e=t.trim(s[i]),n="ui-resizable-"+e,o=t("
      "),this._addClass(o,"ui-resizable-handle "+n),o.css({zIndex:a.zIndex}),this.handles[e]=".ui-resizable-"+e,this.element.append(o);this._renderAxis=function(e){var i,s,n,o;e=e||this.element;for(i in this.handles)this.handles[i].constructor===String?this.handles[i]=this.element.children(this.handles[i]).first().show():(this.handles[i].jquery||this.handles[i].nodeType)&&(this.handles[i]=t(this.handles[i]),this._on(this.handles[i],{mousedown:r._mouseDown})),this.elementIsWrapper&&this.originalElement[0].nodeName.match(/^(textarea|input|select|button)$/i)&&(s=t(this.handles[i],this.element),o=/sw|ne|nw|se|n|s/.test(i)?s.outerHeight():s.outerWidth(),n=["padding",/ne|nw|n/.test(i)?"Top":/se|sw|s/.test(i)?"Bottom":/^e$/.test(i)?"Right":"Left"].join(""),e.css(n,o),this._proportionallyResize()),this._handles=this._handles.add(this.handles[i])},this._renderAxis(this.element),this._handles=this._handles.add(this.element.find(".ui-resizable-handle")),this._handles.disableSelection(),this._handles.on("mouseover",function(){r.resizing||(this.className&&(o=this.className.match(/ui-resizable-(se|sw|ne|nw|n|e|s|w)/i)),r.axis=o&&o[1]?o[1]:"se")}),a.autoHide&&(this._handles.hide(),this._addClass("ui-resizable-autohide"))},_removeHandles:function(){this._handles.remove()},_mouseCapture:function(e){var i,s,n=!1;for(i in this.handles)s=t(this.handles[i])[0],(s===e.target||t.contains(s,e.target))&&(n=!0);return!this.options.disabled&&n},_mouseStart:function(e){var i,s,n,o=this.options,a=this.element;return this.resizing=!0,this._renderProxy(),i=this._num(this.helper.css("left")),s=this._num(this.helper.css("top")),o.containment&&(i+=t(o.containment).scrollLeft()||0,s+=t(o.containment).scrollTop()||0),this.offset=this.helper.offset(),this.position={left:i,top:s},this.size=this._helper?{width:this.helper.width(),height:this.helper.height()}:{width:a.width(),height:a.height()},this.originalSize=this._helper?{width:a.outerWidth(),height:a.outerHeight()}:{width:a.width(),height:a.height()},this.sizeDiff={width:a.outerWidth()-a.width(),height:a.outerHeight()-a.height()},this.originalPosition={left:i,top:s},this.originalMousePosition={left:e.pageX,top:e.pageY},this.aspectRatio="number"==typeof o.aspectRatio?o.aspectRatio:this.originalSize.width/this.originalSize.height||1,n=t(".ui-resizable-"+this.axis).css("cursor"),t("body").css("cursor","auto"===n?this.axis+"-resize":n),this._addClass("ui-resizable-resizing"),this._propagate("start",e),!0},_mouseDrag:function(e){var i,s,n=this.originalMousePosition,o=this.axis,a=e.pageX-n.left||0,r=e.pageY-n.top||0,h=this._change[o];return this._updatePrevProperties(),h?(i=h.apply(this,[e,a,r]),this._updateVirtualBoundaries(e.shiftKey),(this._aspectRatio||e.shiftKey)&&(i=this._updateRatio(i,e)),i=this._respectSize(i,e),this._updateCache(i),this._propagate("resize",e),s=this._applyChanges(),!this._helper&&this._proportionallyResizeElements.length&&this._proportionallyResize(),t.isEmptyObject(s)||(this._updatePrevProperties(),this._trigger("resize",e,this.ui()),this._applyChanges()),!1):!1},_mouseStop:function(e){this.resizing=!1;var i,s,n,o,a,r,h,l=this.options,c=this;return this._helper&&(i=this._proportionallyResizeElements,s=i.length&&/textarea/i.test(i[0].nodeName),n=s&&this._hasScroll(i[0],"left")?0:c.sizeDiff.height,o=s?0:c.sizeDiff.width,a={width:c.helper.width()-o,height:c.helper.height()-n},r=parseFloat(c.element.css("left"))+(c.position.left-c.originalPosition.left)||null,h=parseFloat(c.element.css("top"))+(c.position.top-c.originalPosition.top)||null,l.animate||this.element.css(t.extend(a,{top:h,left:r})),c.helper.height(c.size.height),c.helper.width(c.size.width),this._helper&&!l.animate&&this._proportionallyResize()),t("body").css("cursor","auto"),this._removeClass("ui-resizable-resizing"),this._propagate("stop",e),this._helper&&this.helper.remove(),!1},_updatePrevProperties:function(){this.prevPosition={top:this.position.top,left:this.position.left},this.prevSize={width:this.size.width,height:this.size.height}},_applyChanges:function(){var t={};return this.position.top!==this.prevPosition.top&&(t.top=this.position.top+"px"),this.position.left!==this.prevPosition.left&&(t.left=this.position.left+"px"),this.size.width!==this.prevSize.width&&(t.width=this.size.width+"px"),this.size.height!==this.prevSize.height&&(t.height=this.size.height+"px"),this.helper.css(t),t},_updateVirtualBoundaries:function(t){var e,i,s,n,o,a=this.options;o={minWidth:this._isNumber(a.minWidth)?a.minWidth:0,maxWidth:this._isNumber(a.maxWidth)?a.maxWidth:1/0,minHeight:this._isNumber(a.minHeight)?a.minHeight:0,maxHeight:this._isNumber(a.maxHeight)?a.maxHeight:1/0},(this._aspectRatio||t)&&(e=o.minHeight*this.aspectRatio,s=o.minWidth/this.aspectRatio,i=o.maxHeight*this.aspectRatio,n=o.maxWidth/this.aspectRatio,e>o.minWidth&&(o.minWidth=e),s>o.minHeight&&(o.minHeight=s),o.maxWidth>i&&(o.maxWidth=i),o.maxHeight>n&&(o.maxHeight=n)),this._vBoundaries=o},_updateCache:function(t){this.offset=this.helper.offset(),this._isNumber(t.left)&&(this.position.left=t.left),this._isNumber(t.top)&&(this.position.top=t.top),this._isNumber(t.height)&&(this.size.height=t.height),this._isNumber(t.width)&&(this.size.width=t.width)},_updateRatio:function(t){var e=this.position,i=this.size,s=this.axis;return this._isNumber(t.height)?t.width=t.height*this.aspectRatio:this._isNumber(t.width)&&(t.height=t.width/this.aspectRatio),"sw"===s&&(t.left=e.left+(i.width-t.width),t.top=null),"nw"===s&&(t.top=e.top+(i.height-t.height),t.left=e.left+(i.width-t.width)),t},_respectSize:function(t){var e=this._vBoundaries,i=this.axis,s=this._isNumber(t.width)&&e.maxWidth&&e.maxWidtht.width,a=this._isNumber(t.height)&&e.minHeight&&e.minHeight>t.height,r=this.originalPosition.left+this.originalSize.width,h=this.originalPosition.top+this.originalSize.height,l=/sw|nw|w/.test(i),c=/nw|ne|n/.test(i);return o&&(t.width=e.minWidth),a&&(t.height=e.minHeight),s&&(t.width=e.maxWidth),n&&(t.height=e.maxHeight),o&&l&&(t.left=r-e.minWidth),s&&l&&(t.left=r-e.maxWidth),a&&c&&(t.top=h-e.minHeight),n&&c&&(t.top=h-e.maxHeight),t.width||t.height||t.left||!t.top?t.width||t.height||t.top||!t.left||(t.left=null):t.top=null,t},_getPaddingPlusBorderDimensions:function(t){for(var e=0,i=[],s=[t.css("borderTopWidth"),t.css("borderRightWidth"),t.css("borderBottomWidth"),t.css("borderLeftWidth")],n=[t.css("paddingTop"),t.css("paddingRight"),t.css("paddingBottom"),t.css("paddingLeft")];4>e;e++)i[e]=parseFloat(s[e])||0,i[e]+=parseFloat(n[e])||0;return{height:i[0]+i[2],width:i[1]+i[3]}},_proportionallyResize:function(){if(this._proportionallyResizeElements.length)for(var t,e=0,i=this.helper||this.element;this._proportionallyResizeElements.length>e;e++)t=this._proportionallyResizeElements[e],this.outerDimensions||(this.outerDimensions=this._getPaddingPlusBorderDimensions(t)),t.css({height:i.height()-this.outerDimensions.height||0,width:i.width()-this.outerDimensions.width||0})},_renderProxy:function(){var e=this.element,i=this.options;this.elementOffset=e.offset(),this._helper?(this.helper=this.helper||t("
      "),this._addClass(this.helper,this._helper),this.helper.css({width:this.element.outerWidth(),height:this.element.outerHeight(),position:"absolute",left:this.elementOffset.left+"px",top:this.elementOffset.top+"px",zIndex:++i.zIndex}),this.helper.appendTo("body").disableSelection()):this.helper=this.element +},_change:{e:function(t,e){return{width:this.originalSize.width+e}},w:function(t,e){var i=this.originalSize,s=this.originalPosition;return{left:s.left+e,width:i.width-e}},n:function(t,e,i){var s=this.originalSize,n=this.originalPosition;return{top:n.top+i,height:s.height-i}},s:function(t,e,i){return{height:this.originalSize.height+i}},se:function(e,i,s){return t.extend(this._change.s.apply(this,arguments),this._change.e.apply(this,[e,i,s]))},sw:function(e,i,s){return t.extend(this._change.s.apply(this,arguments),this._change.w.apply(this,[e,i,s]))},ne:function(e,i,s){return t.extend(this._change.n.apply(this,arguments),this._change.e.apply(this,[e,i,s]))},nw:function(e,i,s){return t.extend(this._change.n.apply(this,arguments),this._change.w.apply(this,[e,i,s]))}},_propagate:function(e,i){t.ui.plugin.call(this,e,[i,this.ui()]),"resize"!==e&&this._trigger(e,i,this.ui())},plugins:{},ui:function(){return{originalElement:this.originalElement,element:this.element,helper:this.helper,position:this.position,size:this.size,originalSize:this.originalSize,originalPosition:this.originalPosition}}}),t.ui.plugin.add("resizable","animate",{stop:function(e){var i=t(this).resizable("instance"),s=i.options,n=i._proportionallyResizeElements,o=n.length&&/textarea/i.test(n[0].nodeName),a=o&&i._hasScroll(n[0],"left")?0:i.sizeDiff.height,r=o?0:i.sizeDiff.width,h={width:i.size.width-r,height:i.size.height-a},l=parseFloat(i.element.css("left"))+(i.position.left-i.originalPosition.left)||null,c=parseFloat(i.element.css("top"))+(i.position.top-i.originalPosition.top)||null;i.element.animate(t.extend(h,c&&l?{top:c,left:l}:{}),{duration:s.animateDuration,easing:s.animateEasing,step:function(){var s={width:parseFloat(i.element.css("width")),height:parseFloat(i.element.css("height")),top:parseFloat(i.element.css("top")),left:parseFloat(i.element.css("left"))};n&&n.length&&t(n[0]).css({width:s.width,height:s.height}),i._updateCache(s),i._propagate("resize",e)}})}}),t.ui.plugin.add("resizable","containment",{start:function(){var e,i,s,n,o,a,r,h=t(this).resizable("instance"),l=h.options,c=h.element,u=l.containment,d=u instanceof t?u.get(0):/parent/.test(u)?c.parent().get(0):u;d&&(h.containerElement=t(d),/document/.test(u)||u===document?(h.containerOffset={left:0,top:0},h.containerPosition={left:0,top:0},h.parentData={element:t(document),left:0,top:0,width:t(document).width(),height:t(document).height()||document.body.parentNode.scrollHeight}):(e=t(d),i=[],t(["Top","Right","Left","Bottom"]).each(function(t,s){i[t]=h._num(e.css("padding"+s))}),h.containerOffset=e.offset(),h.containerPosition=e.position(),h.containerSize={height:e.innerHeight()-i[3],width:e.innerWidth()-i[1]},s=h.containerOffset,n=h.containerSize.height,o=h.containerSize.width,a=h._hasScroll(d,"left")?d.scrollWidth:o,r=h._hasScroll(d)?d.scrollHeight:n,h.parentData={element:d,left:s.left,top:s.top,width:a,height:r}))},resize:function(e){var i,s,n,o,a=t(this).resizable("instance"),r=a.options,h=a.containerOffset,l=a.position,c=a._aspectRatio||e.shiftKey,u={top:0,left:0},d=a.containerElement,p=!0;d[0]!==document&&/static/.test(d.css("position"))&&(u=h),l.left<(a._helper?h.left:0)&&(a.size.width=a.size.width+(a._helper?a.position.left-h.left:a.position.left-u.left),c&&(a.size.height=a.size.width/a.aspectRatio,p=!1),a.position.left=r.helper?h.left:0),l.top<(a._helper?h.top:0)&&(a.size.height=a.size.height+(a._helper?a.position.top-h.top:a.position.top),c&&(a.size.width=a.size.height*a.aspectRatio,p=!1),a.position.top=a._helper?h.top:0),n=a.containerElement.get(0)===a.element.parent().get(0),o=/relative|absolute/.test(a.containerElement.css("position")),n&&o?(a.offset.left=a.parentData.left+a.position.left,a.offset.top=a.parentData.top+a.position.top):(a.offset.left=a.element.offset().left,a.offset.top=a.element.offset().top),i=Math.abs(a.sizeDiff.width+(a._helper?a.offset.left-u.left:a.offset.left-h.left)),s=Math.abs(a.sizeDiff.height+(a._helper?a.offset.top-u.top:a.offset.top-h.top)),i+a.size.width>=a.parentData.width&&(a.size.width=a.parentData.width-i,c&&(a.size.height=a.size.width/a.aspectRatio,p=!1)),s+a.size.height>=a.parentData.height&&(a.size.height=a.parentData.height-s,c&&(a.size.width=a.size.height*a.aspectRatio,p=!1)),p||(a.position.left=a.prevPosition.left,a.position.top=a.prevPosition.top,a.size.width=a.prevSize.width,a.size.height=a.prevSize.height)},stop:function(){var e=t(this).resizable("instance"),i=e.options,s=e.containerOffset,n=e.containerPosition,o=e.containerElement,a=t(e.helper),r=a.offset(),h=a.outerWidth()-e.sizeDiff.width,l=a.outerHeight()-e.sizeDiff.height;e._helper&&!i.animate&&/relative/.test(o.css("position"))&&t(this).css({left:r.left-n.left-s.left,width:h,height:l}),e._helper&&!i.animate&&/static/.test(o.css("position"))&&t(this).css({left:r.left-n.left-s.left,width:h,height:l})}}),t.ui.plugin.add("resizable","alsoResize",{start:function(){var e=t(this).resizable("instance"),i=e.options;t(i.alsoResize).each(function(){var e=t(this);e.data("ui-resizable-alsoresize",{width:parseFloat(e.width()),height:parseFloat(e.height()),left:parseFloat(e.css("left")),top:parseFloat(e.css("top"))})})},resize:function(e,i){var s=t(this).resizable("instance"),n=s.options,o=s.originalSize,a=s.originalPosition,r={height:s.size.height-o.height||0,width:s.size.width-o.width||0,top:s.position.top-a.top||0,left:s.position.left-a.left||0};t(n.alsoResize).each(function(){var e=t(this),s=t(this).data("ui-resizable-alsoresize"),n={},o=e.parents(i.originalElement[0]).length?["width","height"]:["width","height","top","left"];t.each(o,function(t,e){var i=(s[e]||0)+(r[e]||0);i&&i>=0&&(n[e]=i||null)}),e.css(n)})},stop:function(){t(this).removeData("ui-resizable-alsoresize")}}),t.ui.plugin.add("resizable","ghost",{start:function(){var e=t(this).resizable("instance"),i=e.size;e.ghost=e.originalElement.clone(),e.ghost.css({opacity:.25,display:"block",position:"relative",height:i.height,width:i.width,margin:0,left:0,top:0}),e._addClass(e.ghost,"ui-resizable-ghost"),t.uiBackCompat!==!1&&"string"==typeof e.options.ghost&&e.ghost.addClass(this.options.ghost),e.ghost.appendTo(e.helper)},resize:function(){var e=t(this).resizable("instance");e.ghost&&e.ghost.css({position:"relative",height:e.size.height,width:e.size.width})},stop:function(){var e=t(this).resizable("instance");e.ghost&&e.helper&&e.helper.get(0).removeChild(e.ghost.get(0))}}),t.ui.plugin.add("resizable","grid",{resize:function(){var e,i=t(this).resizable("instance"),s=i.options,n=i.size,o=i.originalSize,a=i.originalPosition,r=i.axis,h="number"==typeof s.grid?[s.grid,s.grid]:s.grid,l=h[0]||1,c=h[1]||1,u=Math.round((n.width-o.width)/l)*l,d=Math.round((n.height-o.height)/c)*c,p=o.width+u,f=o.height+d,m=s.maxWidth&&p>s.maxWidth,g=s.maxHeight&&f>s.maxHeight,_=s.minWidth&&s.minWidth>p,v=s.minHeight&&s.minHeight>f;s.grid=h,_&&(p+=l),v&&(f+=c),m&&(p-=l),g&&(f-=c),/^(se|s|e)$/.test(r)?(i.size.width=p,i.size.height=f):/^(ne)$/.test(r)?(i.size.width=p,i.size.height=f,i.position.top=a.top-d):/^(sw)$/.test(r)?(i.size.width=p,i.size.height=f,i.position.left=a.left-u):((0>=f-c||0>=p-l)&&(e=i._getPaddingPlusBorderDimensions(this)),f-c>0?(i.size.height=f,i.position.top=a.top-d):(f=c-e.height,i.size.height=f,i.position.top=a.top+o.height-f),p-l>0?(i.size.width=p,i.position.left=a.left-u):(p=l-e.width,i.size.width=p,i.position.left=a.left+o.width-p))}}),t.ui.resizable});/** + * Copyright (c) 2007 Ariel Flesler - aflesler ○ gmail • com | https://github.com/flesler + * Licensed under MIT + * @author Ariel Flesler + * @version 2.1.2 + */ +;(function(f){"use strict";"function"===typeof define&&define.amd?define(["jquery"],f):"undefined"!==typeof module&&module.exports?module.exports=f(require("jquery")):f(jQuery)})(function($){"use strict";function n(a){return!a.nodeName||-1!==$.inArray(a.nodeName.toLowerCase(),["iframe","#document","html","body"])}function h(a){return $.isFunction(a)||$.isPlainObject(a)?a:{top:a,left:a}}var p=$.scrollTo=function(a,d,b){return $(window).scrollTo(a,d,b)};p.defaults={axis:"xy",duration:0,limit:!0};$.fn.scrollTo=function(a,d,b){"object"=== typeof d&&(b=d,d=0);"function"===typeof b&&(b={onAfter:b});"max"===a&&(a=9E9);b=$.extend({},p.defaults,b);d=d||b.duration;var u=b.queue&&1=f[g]?0:Math.min(f[g],n));!a&&1)[^>]*$|#([\w\-]*)$)/,bM=/\S/,bI=/^\s+/,bE=/\s+$/,bA=/^<(\w+)\s*\/?>(?:<\/\1>)?$/,bN=/^[\],:{}\s]*$/,bW=/\\(?:["\\\/bfnrt]|u[0-9a-fA-F]{4})/g,bP=/"[^"\\\n\r]*"|true|false|null|-?\d+(?:\.\d*)?(?:[eE][+\-]?\d+)?/g,bJ=/(?:^|:|,)(?:\s*\[)+/g,by=/(webkit)[ \/]([\w.]+)/,bR=/(opera)(?:.*version)?[ \/]([\w.]+)/,bQ=/(msie) ([\w.]+)/,bS=/(mozilla)(?:.*? rv:([\w.]+))?/,bB=/-([a-z]|[0-9])/ig,bZ=/^-ms-/,bT=function(b0,b1){return(b1+"").toUpperCase()},bX=bu.userAgent,bV,bC,e,bL=Object.prototype.toString,bG=Object.prototype.hasOwnProperty,bz=Array.prototype.push,bK=Array.prototype.slice,bO=String.prototype.trim,bv=Array.prototype.indexOf,bx={};bF.fn=bF.prototype={constructor:bF,init:function(b0,b4,b3){var b2,b5,b1,b6;if(!b0){return this}if(b0.nodeType){this.context=this[0]=b0;this.length=1;return this}if(b0==="body"&&!b4&&av.body){this.context=av;this[0]=av.body;this.selector=b0;this.length=1;return this}if(typeof b0==="string"){if(b0.charAt(0)==="<"&&b0.charAt(b0.length-1)===">"&&b0.length>=3){b2=[null,b0,null]}else{b2=bY.exec(b0)}if(b2&&(b2[1]||!b4)){if(b2[1]){b4=b4 instanceof bF?b4[0]:b4;b6=(b4?b4.ownerDocument||b4:av);b1=bA.exec(b0);if(b1){if(bF.isPlainObject(b4)){b0=[av.createElement(b1[1])];bF.fn.attr.call(b0,b4,true)}else{b0=[b6.createElement(b1[1])]}}else{b1=bF.buildFragment([b2[1]],[b6]);b0=(b1.cacheable?bF.clone(b1.fragment):b1.fragment).childNodes}return bF.merge(this,b0)}else{b5=av.getElementById(b2[2]);if(b5&&b5.parentNode){if(b5.id!==b2[2]){return b3.find(b0)}this.length=1;this[0]=b5}this.context=av;this.selector=b0;return this}}else{if(!b4||b4.jquery){return(b4||b3).find(b0)}else{return this.constructor(b4).find(b0)}}}else{if(bF.isFunction(b0)){return b3.ready(b0)}}if(b0.selector!==L){this.selector=b0.selector;this.context=b0.context}return bF.makeArray(b0,this)},selector:"",jquery:"1.7.2",length:0,size:function(){return this.length},toArray:function(){return bK.call(this,0)},get:function(b0){return b0==null?this.toArray():(b0<0?this[this.length+b0]:this[b0])},pushStack:function(b1,b3,b0){var b2=this.constructor();if(bF.isArray(b1)){bz.apply(b2,b1)}else{bF.merge(b2,b1)}b2.prevObject=this;b2.context=this.context;if(b3==="find"){b2.selector=this.selector+(this.selector?" ":"")+b0}else{if(b3){b2.selector=this.selector+"."+b3+"("+b0+")"}}return b2},each:function(b1,b0){return bF.each(this,b1,b0)},ready:function(b0){bF.bindReady();bC.add(b0);return this},eq:function(b0){b0=+b0;return b0===-1?this.slice(b0):this.slice(b0,b0+1)},first:function(){return this.eq(0)},last:function(){return this.eq(-1)},slice:function(){return this.pushStack(bK.apply(this,arguments),"slice",bK.call(arguments).join(","))},map:function(b0){return this.pushStack(bF.map(this,function(b2,b1){return b0.call(b2,b1,b2)}))},end:function(){return this.prevObject||this.constructor(null)},push:bz,sort:[].sort,splice:[].splice};bF.fn.init.prototype=bF.fn;bF.extend=bF.fn.extend=function(){var b9,b2,b0,b1,b6,b7,b5=arguments[0]||{},b4=1,b3=arguments.length,b8=false;if(typeof b5==="boolean"){b8=b5;b5=arguments[1]||{};b4=2}if(typeof b5!=="object"&&!bF.isFunction(b5)){b5={}}if(b3===b4){b5=this;--b4}for(;b40){return}bC.fireWith(av,[bF]);if(bF.fn.trigger){bF(av).trigger("ready").off("ready")}}},bindReady:function(){if(bC){return}bC=bF.Callbacks("once memory");if(av.readyState==="complete"){return setTimeout(bF.ready,1)}if(av.addEventListener){av.addEventListener("DOMContentLoaded",e,false);bd.addEventListener("load",bF.ready,false)}else{if(av.attachEvent){av.attachEvent("onreadystatechange",e);bd.attachEvent("onload",bF.ready);var b0=false;try{b0=bd.frameElement==null}catch(b1){}if(av.documentElement.doScroll&&b0){bw()}}}},isFunction:function(b0){return bF.type(b0)==="function"},isArray:Array.isArray||function(b0){return bF.type(b0)==="array"},isWindow:function(b0){return b0!=null&&b0==b0.window},isNumeric:function(b0){return !isNaN(parseFloat(b0))&&isFinite(b0)},type:function(b0){return b0==null?String(b0):bx[bL.call(b0)]||"object"},isPlainObject:function(b2){if(!b2||bF.type(b2)!=="object"||b2.nodeType||bF.isWindow(b2)){return false}try{if(b2.constructor&&!bG.call(b2,"constructor")&&!bG.call(b2.constructor.prototype,"isPrototypeOf")){return false}}catch(b1){return false}var b0;for(b0 in b2){}return b0===L||bG.call(b2,b0)},isEmptyObject:function(b1){for(var b0 in b1){return false}return true},error:function(b0){throw new Error(b0)},parseJSON:function(b0){if(typeof b0!=="string"||!b0){return null}b0=bF.trim(b0);if(bd.JSON&&bd.JSON.parse){return bd.JSON.parse(b0)}if(bN.test(b0.replace(bW,"@").replace(bP,"]").replace(bJ,""))){return(new Function("return "+b0))()}bF.error("Invalid JSON: "+b0)},parseXML:function(b2){if(typeof b2!=="string"||!b2){return null}var b0,b1;try{if(bd.DOMParser){b1=new DOMParser();b0=b1.parseFromString(b2,"text/xml")}else{b0=new ActiveXObject("Microsoft.XMLDOM");b0.async="false";b0.loadXML(b2)}}catch(b3){b0=L}if(!b0||!b0.documentElement||b0.getElementsByTagName("parsererror").length){bF.error("Invalid XML: "+b2)}return b0},noop:function(){},globalEval:function(b0){if(b0&&bM.test(b0)){(bd.execScript||function(b1){bd["eval"].call(bd,b1)})(b0)}},camelCase:function(b0){return b0.replace(bZ,"ms-").replace(bB,bT)},nodeName:function(b1,b0){return b1.nodeName&&b1.nodeName.toUpperCase()===b0.toUpperCase()},each:function(b3,b6,b2){var b1,b4=0,b5=b3.length,b0=b5===L||bF.isFunction(b3);if(b2){if(b0){for(b1 in b3){if(b6.apply(b3[b1],b2)===false){break}}}else{for(;b40&&b0[0]&&b0[b1-1])||b1===0||bF.isArray(b0));if(b3){for(;b21?aK.call(arguments,0):bG;if(!(--bw)){bC.resolveWith(bC,bx)}}}function bz(bF){return function(bG){bB[bF]=arguments.length>1?aK.call(arguments,0):bG;bC.notifyWith(bE,bB)}}if(e>1){for(;bv
      a";bH=bv.getElementsByTagName("*");bE=bv.getElementsByTagName("a")[0];if(!bH||!bH.length||!bE){return{}}bF=av.createElement("select");bx=bF.appendChild(av.createElement("option"));bD=bv.getElementsByTagName("input")[0];bI={leadingWhitespace:(bv.firstChild.nodeType===3),tbody:!bv.getElementsByTagName("tbody").length,htmlSerialize:!!bv.getElementsByTagName("link").length,style:/top/.test(bE.getAttribute("style")),hrefNormalized:(bE.getAttribute("href")==="/a"),opacity:/^0.55/.test(bE.style.opacity),cssFloat:!!bE.style.cssFloat,checkOn:(bD.value==="on"),optSelected:bx.selected,getSetAttribute:bv.className!=="t",enctype:!!av.createElement("form").enctype,html5Clone:av.createElement("nav").cloneNode(true).outerHTML!=="<:nav>",submitBubbles:true,changeBubbles:true,focusinBubbles:false,deleteExpando:true,noCloneEvent:true,inlineBlockNeedsLayout:false,shrinkWrapBlocks:false,reliableMarginRight:true,pixelMargin:true};b.boxModel=bI.boxModel=(av.compatMode==="CSS1Compat");bD.checked=true;bI.noCloneChecked=bD.cloneNode(true).checked;bF.disabled=true;bI.optDisabled=!bx.disabled;try{delete bv.test}catch(bB){bI.deleteExpando=false}if(!bv.addEventListener&&bv.attachEvent&&bv.fireEvent){bv.attachEvent("onclick",function(){bI.noCloneEvent=false});bv.cloneNode(true).fireEvent("onclick")}bD=av.createElement("input");bD.value="t";bD.setAttribute("type","radio");bI.radioValue=bD.value==="t";bD.setAttribute("checked","checked");bD.setAttribute("name","t");bv.appendChild(bD);bC=av.createDocumentFragment();bC.appendChild(bv.lastChild);bI.checkClone=bC.cloneNode(true).cloneNode(true).lastChild.checked;bI.appendChecked=bD.checked;bC.removeChild(bD);bC.appendChild(bv);if(bv.attachEvent){for(by in {submit:1,change:1,focusin:1}){bA="on"+by;bw=(bA in bv);if(!bw){bv.setAttribute(bA,"return;");bw=(typeof bv[bA]==="function")}bI[by+"Bubbles"]=bw}}bC.removeChild(bv);bC=bF=bx=bv=bD=null;b(function(){var bM,bV,bW,bU,bO,bP,bR,bL,bK,bQ,bN,e,bT,bS=av.getElementsByTagName("body")[0];if(!bS){return}bL=1;bT="padding:0;margin:0;border:";bN="position:absolute;top:0;left:0;width:1px;height:1px;";e=bT+"0;visibility:hidden;";bK="style='"+bN+bT+"5px solid #000;";bQ="
      ";bM=av.createElement("div");bM.style.cssText=e+"width:0;height:0;position:static;top:0;margin-top:"+bL+"px";bS.insertBefore(bM,bS.firstChild);bv=av.createElement("div");bM.appendChild(bv);bv.innerHTML="
      t
      ";bz=bv.getElementsByTagName("td");bw=(bz[0].offsetHeight===0);bz[0].style.display="";bz[1].style.display="none";bI.reliableHiddenOffsets=bw&&(bz[0].offsetHeight===0);if(bd.getComputedStyle){bv.innerHTML="";bR=av.createElement("div");bR.style.width="0";bR.style.marginRight="0";bv.style.width="2px";bv.appendChild(bR);bI.reliableMarginRight=(parseInt((bd.getComputedStyle(bR,null)||{marginRight:0}).marginRight,10)||0)===0}if(typeof bv.style.zoom!=="undefined"){bv.innerHTML="";bv.style.width=bv.style.padding="1px";bv.style.border=0;bv.style.overflow="hidden";bv.style.display="inline";bv.style.zoom=1;bI.inlineBlockNeedsLayout=(bv.offsetWidth===3);bv.style.display="block";bv.style.overflow="visible";bv.innerHTML="
      ";bI.shrinkWrapBlocks=(bv.offsetWidth!==3)}bv.style.cssText=bN+e;bv.innerHTML=bQ;bV=bv.firstChild;bW=bV.firstChild;bO=bV.nextSibling.firstChild.firstChild;bP={doesNotAddBorder:(bW.offsetTop!==5),doesAddBorderForTableAndCells:(bO.offsetTop===5)};bW.style.position="fixed";bW.style.top="20px";bP.fixedPosition=(bW.offsetTop===20||bW.offsetTop===15);bW.style.position=bW.style.top="";bV.style.overflow="hidden";bV.style.position="relative";bP.subtractsBorderForOverflowNotVisible=(bW.offsetTop===-5);bP.doesNotIncludeMarginInBodyOffset=(bS.offsetTop!==bL);if(bd.getComputedStyle){bv.style.marginTop="1%";bI.pixelMargin=(bd.getComputedStyle(bv,null)||{marginTop:0}).marginTop!=="1%"}if(typeof bM.style.zoom!=="undefined"){bM.style.zoom=1}bS.removeChild(bM);bR=bv=bM=null;b.extend(bI,bP)});return bI})();var aT=/^(?:\{.*\}|\[.*\])$/,aA=/([A-Z])/g;b.extend({cache:{},uuid:0,expando:"jQuery"+(b.fn.jquery+Math.random()).replace(/\D/g,""),noData:{embed:true,object:"clsid:D27CDB6E-AE6D-11cf-96B8-444553540000",applet:true},hasData:function(e){e=e.nodeType?b.cache[e[b.expando]]:e[b.expando];return !!e&&!S(e)},data:function(bx,bv,bz,by){if(!b.acceptData(bx)){return}var bG,bA,bD,bE=b.expando,bC=typeof bv==="string",bF=bx.nodeType,e=bF?b.cache:bx,bw=bF?bx[bE]:bx[bE]&&bE,bB=bv==="events";if((!bw||!e[bw]||(!bB&&!by&&!e[bw].data))&&bC&&bz===L){return}if(!bw){if(bF){bx[bE]=bw=++b.uuid}else{bw=bE}}if(!e[bw]){e[bw]={};if(!bF){e[bw].toJSON=b.noop}}if(typeof bv==="object"||typeof bv==="function"){if(by){e[bw]=b.extend(e[bw],bv)}else{e[bw].data=b.extend(e[bw].data,bv)}}bG=bA=e[bw];if(!by){if(!bA.data){bA.data={}}bA=bA.data}if(bz!==L){bA[b.camelCase(bv)]=bz}if(bB&&!bA[bv]){return bG.events}if(bC){bD=bA[bv];if(bD==null){bD=bA[b.camelCase(bv)]}}else{bD=bA}return bD},removeData:function(bx,bv,by){if(!b.acceptData(bx)){return}var bB,bA,bz,bC=b.expando,bD=bx.nodeType,e=bD?b.cache:bx,bw=bD?bx[bC]:bC;if(!e[bw]){return}if(bv){bB=by?e[bw]:e[bw].data;if(bB){if(!b.isArray(bv)){if(bv in bB){bv=[bv]}else{bv=b.camelCase(bv);if(bv in bB){bv=[bv]}else{bv=bv.split(" ")}}}for(bA=0,bz=bv.length;bA1,null,false)},removeData:function(e){return this.each(function(){b.removeData(this,e)})}});function a6(bx,bw,by){if(by===L&&bx.nodeType===1){var bv="data-"+bw.replace(aA,"-$1").toLowerCase();by=bx.getAttribute(bv);if(typeof by==="string"){try{by=by==="true"?true:by==="false"?false:by==="null"?null:b.isNumeric(by)?+by:aT.test(by)?b.parseJSON(by):by}catch(bz){}b.data(bx,bw,by)}else{by=L}}return by}function S(bv){for(var e in bv){if(e==="data"&&b.isEmptyObject(bv[e])){continue}if(e!=="toJSON"){return false}}return true}function bj(by,bx,bA){var bw=bx+"defer",bv=bx+"queue",e=bx+"mark",bz=b._data(by,bw);if(bz&&(bA==="queue"||!b._data(by,bv))&&(bA==="mark"||!b._data(by,e))){setTimeout(function(){if(!b._data(by,bv)&&!b._data(by,e)){b.removeData(by,bw,true);bz.fire()}},0)}}b.extend({_mark:function(bv,e){if(bv){e=(e||"fx")+"mark";b._data(bv,e,(b._data(bv,e)||0)+1)}},_unmark:function(by,bx,bv){if(by!==true){bv=bx;bx=by;by=false}if(bx){bv=bv||"fx";var e=bv+"mark",bw=by?0:((b._data(bx,e)||1)-1);if(bw){b._data(bx,e,bw)}else{b.removeData(bx,e,true);bj(bx,bv,"mark")}}},queue:function(bv,e,bx){var bw;if(bv){e=(e||"fx")+"queue";bw=b._data(bv,e);if(bx){if(!bw||b.isArray(bx)){bw=b._data(bv,e,b.makeArray(bx))}else{bw.push(bx)}}return bw||[]}},dequeue:function(by,bx){bx=bx||"fx";var bv=b.queue(by,bx),bw=bv.shift(),e={};if(bw==="inprogress"){bw=bv.shift()}if(bw){if(bx==="fx"){bv.unshift("inprogress")}b._data(by,bx+".run",e);bw.call(by,function(){b.dequeue(by,bx)},e)}if(!bv.length){b.removeData(by,bx+"queue "+bx+".run",true);bj(by,bx,"queue")}}});b.fn.extend({queue:function(e,bv){var bw=2;if(typeof e!=="string"){bv=e;e="fx";bw--}if(arguments.length1)},removeAttr:function(e){return this.each(function(){b.removeAttr(this,e)})},prop:function(e,bv){return b.access(this,b.prop,e,bv,arguments.length>1)},removeProp:function(e){e=b.propFix[e]||e;return this.each(function(){try{this[e]=L;delete this[e]}catch(bv){}})},addClass:function(by){var bA,bw,bv,bx,bz,bB,e;if(b.isFunction(by)){return this.each(function(bC){b(this).addClass(by.call(this,bC,this.className))})}if(by&&typeof by==="string"){bA=by.split(ag);for(bw=0,bv=this.length;bw-1){return true}}return false},val:function(bx){var e,bv,by,bw=this[0];if(!arguments.length){if(bw){e=b.valHooks[bw.type]||b.valHooks[bw.nodeName.toLowerCase()];if(e&&"get" in e&&(bv=e.get(bw,"value"))!==L){return bv}bv=bw.value;return typeof bv==="string"?bv.replace(aV,""):bv==null?"":bv}return}by=b.isFunction(bx);return this.each(function(bA){var bz=b(this),bB;if(this.nodeType!==1){return}if(by){bB=bx.call(this,bA,bz.val())}else{bB=bx}if(bB==null){bB=""}else{if(typeof bB==="number"){bB+=""}else{if(b.isArray(bB)){bB=b.map(bB,function(bC){return bC==null?"":bC+""})}}}e=b.valHooks[this.type]||b.valHooks[this.nodeName.toLowerCase()];if(!e||!("set" in e)||e.set(this,bB,"value")===L){this.value=bB}})}});b.extend({valHooks:{option:{get:function(e){var bv=e.attributes.value;return !bv||bv.specified?e.value:e.text}},select:{get:function(e){var bA,bv,bz,bx,by=e.selectedIndex,bB=[],bC=e.options,bw=e.type==="select-one";if(by<0){return null}bv=bw?by:0;bz=bw?by+1:bC.length;for(;bv=0});if(!e.length){bv.selectedIndex=-1}return e}}},attrFn:{val:true,css:true,html:true,text:true,data:true,width:true,height:true,offset:true},attr:function(bA,bx,bB,bz){var bw,e,by,bv=bA.nodeType;if(!bA||bv===3||bv===8||bv===2){return}if(bz&&bx in b.attrFn){return b(bA)[bx](bB)}if(typeof bA.getAttribute==="undefined"){return b.prop(bA,bx,bB)}by=bv!==1||!b.isXMLDoc(bA);if(by){bx=bx.toLowerCase();e=b.attrHooks[bx]||(ao.test(bx)?aZ:bf)}if(bB!==L){if(bB===null){b.removeAttr(bA,bx);return}else{if(e&&"set" in e&&by&&(bw=e.set(bA,bB,bx))!==L){return bw}else{bA.setAttribute(bx,""+bB);return bB}}}else{if(e&&"get" in e&&by&&(bw=e.get(bA,bx))!==null){return bw}else{bw=bA.getAttribute(bx);return bw===null?L:bw}}},removeAttr:function(by,bA){var bz,bB,bw,e,bv,bx=0;if(bA&&by.nodeType===1){bB=bA.toLowerCase().split(ag);e=bB.length;for(;bx=0)}}})});var be=/^(?:textarea|input|select)$/i,n=/^([^\.]*)?(?:\.(.+))?$/,J=/(?:^|\s)hover(\.\S+)?\b/,aP=/^key/,bg=/^(?:mouse|contextmenu)|click/,T=/^(?:focusinfocus|focusoutblur)$/,U=/^(\w*)(?:#([\w\-]+))?(?:\.([\w\-]+))?$/,Y=function(e){var bv=U.exec(e);if(bv){bv[1]=(bv[1]||"").toLowerCase();bv[3]=bv[3]&&new RegExp("(?:^|\\s)"+bv[3]+"(?:\\s|$)")}return bv},j=function(bw,e){var bv=bw.attributes||{};return((!e[1]||bw.nodeName.toLowerCase()===e[1])&&(!e[2]||(bv.id||{}).value===e[2])&&(!e[3]||e[3].test((bv["class"]||{}).value)))},bt=function(e){return b.event.special.hover?e:e.replace(J,"mouseenter$1 mouseleave$1")};b.event={add:function(bx,bC,bJ,bA,by){var bD,bB,bK,bI,bH,bF,e,bG,bv,bz,bw,bE;if(bx.nodeType===3||bx.nodeType===8||!bC||!bJ||!(bD=b._data(bx))){return}if(bJ.handler){bv=bJ;bJ=bv.handler;by=bv.selector}if(!bJ.guid){bJ.guid=b.guid++}bK=bD.events;if(!bK){bD.events=bK={}}bB=bD.handle;if(!bB){bD.handle=bB=function(bL){return typeof b!=="undefined"&&(!bL||b.event.triggered!==bL.type)?b.event.dispatch.apply(bB.elem,arguments):L};bB.elem=bx}bC=b.trim(bt(bC)).split(" ");for(bI=0;bI=0){bG=bG.slice(0,-1);bw=true}if(bG.indexOf(".")>=0){bx=bG.split(".");bG=bx.shift();bx.sort()}if((!bA||b.event.customEvent[bG])&&!b.event.global[bG]){return}bv=typeof bv==="object"?bv[b.expando]?bv:new b.Event(bG,bv):new b.Event(bG);bv.type=bG;bv.isTrigger=true;bv.exclusive=bw;bv.namespace=bx.join(".");bv.namespace_re=bv.namespace?new RegExp("(^|\\.)"+bx.join("\\.(?:.*\\.)?")+"(\\.|$)"):null;by=bG.indexOf(":")<0?"on"+bG:"";if(!bA){e=b.cache;for(bC in e){if(e[bC].events&&e[bC].events[bG]){b.event.trigger(bv,bD,e[bC].handle.elem,true)}}return}bv.result=L;if(!bv.target){bv.target=bA}bD=bD!=null?b.makeArray(bD):[];bD.unshift(bv);bF=b.event.special[bG]||{};if(bF.trigger&&bF.trigger.apply(bA,bD)===false){return}bB=[[bA,bF.bindType||bG]];if(!bJ&&!bF.noBubble&&!b.isWindow(bA)){bI=bF.delegateType||bG;bH=T.test(bI+bG)?bA:bA.parentNode;bz=null;for(;bH;bH=bH.parentNode){bB.push([bH,bI]);bz=bH}if(bz&&bz===bA.ownerDocument){bB.push([bz.defaultView||bz.parentWindow||bd,bI])}}for(bC=0;bCbC){bv.push({elem:this,matches:bD.slice(bC)})}for(bJ=0;bJ0?this.on(e,null,bx,bw):this.trigger(e)};if(b.attrFn){b.attrFn[e]=true}if(aP.test(e)){b.event.fixHooks[e]=b.event.keyHooks}if(bg.test(e)){b.event.fixHooks[e]=b.event.mouseHooks}}); -/*! - * Sizzle CSS Selector Engine - * Copyright 2011, The Dojo Foundation - * Released under the MIT, BSD, and GPL Licenses. - * More information: http://sizzlejs.com/ - */ -(function(){var bH=/((?:\((?:\([^()]+\)|[^()]+)+\)|\[(?:\[[^\[\]]*\]|['"][^'"]*['"]|[^\[\]'"]+)+\]|\\.|[^ >+~,(\[\\]+)+|[>+~])(\s*,\s*)?((?:.|\r|\n)*)/g,bC="sizcache"+(Math.random()+"").replace(".",""),bI=0,bL=Object.prototype.toString,bB=false,bA=true,bK=/\\/g,bO=/\r\n/g,bQ=/\W/;[0,0].sort(function(){bA=false;return 0});var by=function(bV,e,bY,bZ){bY=bY||[];e=e||av;var b1=e;if(e.nodeType!==1&&e.nodeType!==9){return[]}if(!bV||typeof bV!=="string"){return bY}var bS,b3,b6,bR,b2,b5,b4,bX,bU=true,bT=by.isXML(e),bW=[],b0=bV;do{bH.exec("");bS=bH.exec(b0);if(bS){b0=bS[3];bW.push(bS[1]);if(bS[2]){bR=bS[3];break}}}while(bS);if(bW.length>1&&bD.exec(bV)){if(bW.length===2&&bE.relative[bW[0]]){b3=bM(bW[0]+bW[1],e,bZ)}else{b3=bE.relative[bW[0]]?[e]:by(bW.shift(),e);while(bW.length){bV=bW.shift();if(bE.relative[bV]){bV+=bW.shift()}b3=bM(bV,b3,bZ)}}}else{if(!bZ&&bW.length>1&&e.nodeType===9&&!bT&&bE.match.ID.test(bW[0])&&!bE.match.ID.test(bW[bW.length-1])){b2=by.find(bW.shift(),e,bT);e=b2.expr?by.filter(b2.expr,b2.set)[0]:b2.set[0]}if(e){b2=bZ?{expr:bW.pop(),set:bF(bZ)}:by.find(bW.pop(),bW.length===1&&(bW[0]==="~"||bW[0]==="+")&&e.parentNode?e.parentNode:e,bT);b3=b2.expr?by.filter(b2.expr,b2.set):b2.set;if(bW.length>0){b6=bF(b3)}else{bU=false}while(bW.length){b5=bW.pop();b4=b5;if(!bE.relative[b5]){b5=""}else{b4=bW.pop()}if(b4==null){b4=e}bE.relative[b5](b6,b4,bT)}}else{b6=bW=[]}}if(!b6){b6=b3}if(!b6){by.error(b5||bV)}if(bL.call(b6)==="[object Array]"){if(!bU){bY.push.apply(bY,b6)}else{if(e&&e.nodeType===1){for(bX=0;b6[bX]!=null;bX++){if(b6[bX]&&(b6[bX]===true||b6[bX].nodeType===1&&by.contains(e,b6[bX]))){bY.push(b3[bX])}}}else{for(bX=0;b6[bX]!=null;bX++){if(b6[bX]&&b6[bX].nodeType===1){bY.push(b3[bX])}}}}}else{bF(b6,bY)}if(bR){by(bR,b1,bY,bZ);by.uniqueSort(bY)}return bY};by.uniqueSort=function(bR){if(bJ){bB=bA;bR.sort(bJ);if(bB){for(var e=1;e0};by.find=function(bX,e,bY){var bW,bS,bU,bT,bV,bR;if(!bX){return[]}for(bS=0,bU=bE.order.length;bS":function(bW,bR){var bV,bU=typeof bR==="string",bS=0,e=bW.length;if(bU&&!bQ.test(bR)){bR=bR.toLowerCase();for(;bS=0)){if(!bS){e.push(bV)}}else{if(bS){bR[bU]=false}}}}return false},ID:function(e){return e[1].replace(bK,"")},TAG:function(bR,e){return bR[1].replace(bK,"").toLowerCase()},CHILD:function(e){if(e[1]==="nth"){if(!e[2]){by.error(e[0])}e[2]=e[2].replace(/^\+|\s*/g,"");var bR=/(-?)(\d*)(?:n([+\-]?\d*))?/.exec(e[2]==="even"&&"2n"||e[2]==="odd"&&"2n+1"||!/\D/.test(e[2])&&"0n+"+e[2]||e[2]);e[2]=(bR[1]+(bR[2]||1))-0;e[3]=bR[3]-0}else{if(e[2]){by.error(e[0])}}e[0]=bI++;return e},ATTR:function(bU,bR,bS,e,bV,bW){var bT=bU[1]=bU[1].replace(bK,"");if(!bW&&bE.attrMap[bT]){bU[1]=bE.attrMap[bT]}bU[4]=(bU[4]||bU[5]||"").replace(bK,"");if(bU[2]==="~="){bU[4]=" "+bU[4]+" "}return bU},PSEUDO:function(bU,bR,bS,e,bV){if(bU[1]==="not"){if((bH.exec(bU[3])||"").length>1||/^\w/.test(bU[3])){bU[3]=by(bU[3],null,null,bR)}else{var bT=by.filter(bU[3],bR,bS,true^bV);if(!bS){e.push.apply(e,bT)}return false}}else{if(bE.match.POS.test(bU[0])||bE.match.CHILD.test(bU[0])){return true}}return bU},POS:function(e){e.unshift(true);return e}},filters:{enabled:function(e){return e.disabled===false&&e.type!=="hidden"},disabled:function(e){return e.disabled===true},checked:function(e){return e.checked===true},selected:function(e){if(e.parentNode){e.parentNode.selectedIndex}return e.selected===true},parent:function(e){return !!e.firstChild},empty:function(e){return !e.firstChild},has:function(bS,bR,e){return !!by(e[3],bS).length},header:function(e){return(/h\d/i).test(e.nodeName)},text:function(bS){var e=bS.getAttribute("type"),bR=bS.type;return bS.nodeName.toLowerCase()==="input"&&"text"===bR&&(e===bR||e===null)},radio:function(e){return e.nodeName.toLowerCase()==="input"&&"radio"===e.type},checkbox:function(e){return e.nodeName.toLowerCase()==="input"&&"checkbox"===e.type},file:function(e){return e.nodeName.toLowerCase()==="input"&&"file"===e.type},password:function(e){return e.nodeName.toLowerCase()==="input"&&"password"===e.type},submit:function(bR){var e=bR.nodeName.toLowerCase();return(e==="input"||e==="button")&&"submit"===bR.type},image:function(e){return e.nodeName.toLowerCase()==="input"&&"image"===e.type},reset:function(bR){var e=bR.nodeName.toLowerCase();return(e==="input"||e==="button")&&"reset"===bR.type},button:function(bR){var e=bR.nodeName.toLowerCase();return e==="input"&&"button"===bR.type||e==="button"},input:function(e){return(/input|select|textarea|button/i).test(e.nodeName)},focus:function(e){return e===e.ownerDocument.activeElement}},setFilters:{first:function(bR,e){return e===0},last:function(bS,bR,e,bT){return bR===bT.length-1},even:function(bR,e){return e%2===0},odd:function(bR,e){return e%2===1},lt:function(bS,bR,e){return bRe[3]-0},nth:function(bS,bR,e){return e[3]-0===bR},eq:function(bS,bR,e){return e[3]-0===bR}},filter:{PSEUDO:function(bS,bX,bW,bY){var e=bX[1],bR=bE.filters[e];if(bR){return bR(bS,bW,bX,bY)}else{if(e==="contains"){return(bS.textContent||bS.innerText||bw([bS])||"").indexOf(bX[3])>=0}else{if(e==="not"){var bT=bX[3];for(var bV=0,bU=bT.length;bV=0)}}},ID:function(bR,e){return bR.nodeType===1&&bR.getAttribute("id")===e},TAG:function(bR,e){return(e==="*"&&bR.nodeType===1)||!!bR.nodeName&&bR.nodeName.toLowerCase()===e},CLASS:function(bR,e){return(" "+(bR.className||bR.getAttribute("class"))+" ").indexOf(e)>-1},ATTR:function(bV,bT){var bS=bT[1],e=by.attr?by.attr(bV,bS):bE.attrHandle[bS]?bE.attrHandle[bS](bV):bV[bS]!=null?bV[bS]:bV.getAttribute(bS),bW=e+"",bU=bT[2],bR=bT[4];return e==null?bU==="!=":!bU&&by.attr?e!=null:bU==="="?bW===bR:bU==="*="?bW.indexOf(bR)>=0:bU==="~="?(" "+bW+" ").indexOf(bR)>=0:!bR?bW&&e!==false:bU==="!="?bW!==bR:bU==="^="?bW.indexOf(bR)===0:bU==="$="?bW.substr(bW.length-bR.length)===bR:bU==="|="?bW===bR||bW.substr(0,bR.length+1)===bR+"-":false},POS:function(bU,bR,bS,bV){var e=bR[2],bT=bE.setFilters[e];if(bT){return bT(bU,bS,bR,bV)}}}};var bD=bE.match.POS,bx=function(bR,e){return"\\"+(e-0+1)};for(var bz in bE.match){bE.match[bz]=new RegExp(bE.match[bz].source+(/(?![^\[]*\])(?![^\(]*\))/.source));bE.leftMatch[bz]=new RegExp(/(^(?:.|\r|\n)*?)/.source+bE.match[bz].source.replace(/\\(\d+)/g,bx))}bE.match.globalPOS=bD;var bF=function(bR,e){bR=Array.prototype.slice.call(bR,0);if(e){e.push.apply(e,bR);return e}return bR};try{Array.prototype.slice.call(av.documentElement.childNodes,0)[0].nodeType}catch(bP){bF=function(bU,bT){var bS=0,bR=bT||[];if(bL.call(bU)==="[object Array]"){Array.prototype.push.apply(bR,bU)}else{if(typeof bU.length==="number"){for(var e=bU.length;bS";e.insertBefore(bR,e.firstChild);if(av.getElementById(bS)){bE.find.ID=function(bU,bV,bW){if(typeof bV.getElementById!=="undefined"&&!bW){var bT=bV.getElementById(bU[1]);return bT?bT.id===bU[1]||typeof bT.getAttributeNode!=="undefined"&&bT.getAttributeNode("id").nodeValue===bU[1]?[bT]:L:[]}};bE.filter.ID=function(bV,bT){var bU=typeof bV.getAttributeNode!=="undefined"&&bV.getAttributeNode("id");return bV.nodeType===1&&bU&&bU.nodeValue===bT}}e.removeChild(bR);e=bR=null})();(function(){var e=av.createElement("div");e.appendChild(av.createComment(""));if(e.getElementsByTagName("*").length>0){bE.find.TAG=function(bR,bV){var bU=bV.getElementsByTagName(bR[1]);if(bR[1]==="*"){var bT=[];for(var bS=0;bU[bS];bS++){if(bU[bS].nodeType===1){bT.push(bU[bS])}}bU=bT}return bU}}e.innerHTML="";if(e.firstChild&&typeof e.firstChild.getAttribute!=="undefined"&&e.firstChild.getAttribute("href")!=="#"){bE.attrHandle.href=function(bR){return bR.getAttribute("href",2)}}e=null})();if(av.querySelectorAll){(function(){var e=by,bT=av.createElement("div"),bS="__sizzle__";bT.innerHTML="

      ";if(bT.querySelectorAll&&bT.querySelectorAll(".TEST").length===0){return}by=function(b4,bV,bZ,b3){bV=bV||av;if(!b3&&!by.isXML(bV)){var b2=/^(\w+$)|^\.([\w\-]+$)|^#([\w\-]+$)/.exec(b4);if(b2&&(bV.nodeType===1||bV.nodeType===9)){if(b2[1]){return bF(bV.getElementsByTagName(b4),bZ)}else{if(b2[2]&&bE.find.CLASS&&bV.getElementsByClassName){return bF(bV.getElementsByClassName(b2[2]),bZ)}}}if(bV.nodeType===9){if(b4==="body"&&bV.body){return bF([bV.body],bZ)}else{if(b2&&b2[3]){var bY=bV.getElementById(b2[3]);if(bY&&bY.parentNode){if(bY.id===b2[3]){return bF([bY],bZ)}}else{return bF([],bZ)}}}try{return bF(bV.querySelectorAll(b4),bZ)}catch(b0){}}else{if(bV.nodeType===1&&bV.nodeName.toLowerCase()!=="object"){var bW=bV,bX=bV.getAttribute("id"),bU=bX||bS,b6=bV.parentNode,b5=/^\s*[+~]/.test(b4);if(!bX){bV.setAttribute("id",bU)}else{bU=bU.replace(/'/g,"\\$&")}if(b5&&b6){bV=bV.parentNode}try{if(!b5||b6){return bF(bV.querySelectorAll("[id='"+bU+"'] "+b4),bZ)}}catch(b1){}finally{if(!bX){bW.removeAttribute("id")}}}}}return e(b4,bV,bZ,b3)};for(var bR in e){by[bR]=e[bR]}bT=null})()}(function(){var e=av.documentElement,bS=e.matchesSelector||e.mozMatchesSelector||e.webkitMatchesSelector||e.msMatchesSelector;if(bS){var bU=!bS.call(av.createElement("div"),"div"),bR=false;try{bS.call(av.documentElement,"[test!='']:sizzle")}catch(bT){bR=true}by.matchesSelector=function(bW,bY){bY=bY.replace(/\=\s*([^'"\]]*)\s*\]/g,"='$1']");if(!by.isXML(bW)){try{if(bR||!bE.match.PSEUDO.test(bY)&&!/!=/.test(bY)){var bV=bS.call(bW,bY);if(bV||!bU||bW.document&&bW.document.nodeType!==11){return bV}}}catch(bX){}}return by(bY,null,null,[bW]).length>0}}})();(function(){var e=av.createElement("div");e.innerHTML="
      ";if(!e.getElementsByClassName||e.getElementsByClassName("e").length===0){return}e.lastChild.className="e";if(e.getElementsByClassName("e").length===1){return}bE.order.splice(1,0,"CLASS");bE.find.CLASS=function(bR,bS,bT){if(typeof bS.getElementsByClassName!=="undefined"&&!bT){return bS.getElementsByClassName(bR[1])}};e=null})();function bv(bR,bW,bV,bZ,bX,bY){for(var bT=0,bS=bZ.length;bT0){bU=e;break}}}e=e[bR]}bZ[bT]=bU}}}if(av.documentElement.contains){by.contains=function(bR,e){return bR!==e&&(bR.contains?bR.contains(e):true)}}else{if(av.documentElement.compareDocumentPosition){by.contains=function(bR,e){return !!(bR.compareDocumentPosition(e)&16)}}else{by.contains=function(){return false}}}by.isXML=function(e){var bR=(e?e.ownerDocument||e:0).documentElement;return bR?bR.nodeName!=="HTML":false};var bM=function(bS,e,bW){var bV,bX=[],bU="",bY=e.nodeType?[e]:e;while((bV=bE.match.PSEUDO.exec(bS))){bU+=bV[0];bS=bS.replace(bE.match.PSEUDO,"")}bS=bE.relative[bS]?bS+"*":bS;for(var bT=0,bR=bY.length;bT0){for(bB=bA;bB=0:b.filter(e,this).length>0:this.filter(e).length>0)},closest:function(by,bx){var bv=[],bw,e,bz=this[0];if(b.isArray(by)){var bB=1;while(bz&&bz.ownerDocument&&bz!==bx){for(bw=0;bw-1:b.find.matchesSelector(bz,by)){bv.push(bz);break}else{bz=bz.parentNode;if(!bz||!bz.ownerDocument||bz===bx||bz.nodeType===11){break}}}}bv=bv.length>1?b.unique(bv):bv;return this.pushStack(bv,"closest",by)},index:function(e){if(!e){return(this[0]&&this[0].parentNode)?this.prevAll().length:-1}if(typeof e==="string"){return b.inArray(this[0],b(e))}return b.inArray(e.jquery?e[0]:e,this)},add:function(e,bv){var bx=typeof e==="string"?b(e,bv):b.makeArray(e&&e.nodeType?[e]:e),bw=b.merge(this.get(),bx);return this.pushStack(B(bx[0])||B(bw[0])?bw:b.unique(bw))},andSelf:function(){return this.add(this.prevObject)}});function B(e){return !e||!e.parentNode||e.parentNode.nodeType===11}b.each({parent:function(bv){var e=bv.parentNode;return e&&e.nodeType!==11?e:null},parents:function(e){return b.dir(e,"parentNode")},parentsUntil:function(bv,e,bw){return b.dir(bv,"parentNode",bw)},next:function(e){return b.nth(e,2,"nextSibling")},prev:function(e){return b.nth(e,2,"previousSibling")},nextAll:function(e){return b.dir(e,"nextSibling")},prevAll:function(e){return b.dir(e,"previousSibling")},nextUntil:function(bv,e,bw){return b.dir(bv,"nextSibling",bw)},prevUntil:function(bv,e,bw){return b.dir(bv,"previousSibling",bw)},siblings:function(e){return b.sibling((e.parentNode||{}).firstChild,e)},children:function(e){return b.sibling(e.firstChild)},contents:function(e){return b.nodeName(e,"iframe")?e.contentDocument||e.contentWindow.document:b.makeArray(e.childNodes)}},function(e,bv){b.fn[e]=function(by,bw){var bx=b.map(this,bv,by);if(!ab.test(e)){bw=by}if(bw&&typeof bw==="string"){bx=b.filter(bw,bx)}bx=this.length>1&&!ay[e]?b.unique(bx):bx;if((this.length>1||bb.test(bw))&&aq.test(e)){bx=bx.reverse()}return this.pushStack(bx,e,P.call(arguments).join(","))}});b.extend({filter:function(bw,e,bv){if(bv){bw=":not("+bw+")"}return e.length===1?b.find.matchesSelector(e[0],bw)?[e[0]]:[]:b.find.matches(bw,e)},dir:function(bw,bv,by){var e=[],bx=bw[bv];while(bx&&bx.nodeType!==9&&(by===L||bx.nodeType!==1||!b(bx).is(by))){if(bx.nodeType===1){e.push(bx)}bx=bx[bv]}return e},nth:function(by,e,bw,bx){e=e||1;var bv=0;for(;by;by=by[bw]){if(by.nodeType===1&&++bv===e){break}}return by},sibling:function(bw,bv){var e=[];for(;bw;bw=bw.nextSibling){if(bw.nodeType===1&&bw!==bv){e.push(bw)}}return e}});function aH(bx,bw,e){bw=bw||0;if(b.isFunction(bw)){return b.grep(bx,function(bz,by){var bA=!!bw.call(bz,by,bz);return bA===e})}else{if(bw.nodeType){return b.grep(bx,function(bz,by){return(bz===bw)===e})}else{if(typeof bw==="string"){var bv=b.grep(bx,function(by){return by.nodeType===1});if(bp.test(bw)){return b.filter(bw,bv,!e)}else{bw=b.filter(bw,bv)}}}}return b.grep(bx,function(bz,by){return(b.inArray(bz,bw)>=0)===e})}function a(e){var bw=aS.split("|"),bv=e.createDocumentFragment();if(bv.createElement){while(bw.length){bv.createElement(bw.pop())}}return bv}var aS="abbr|article|aside|audio|bdi|canvas|data|datalist|details|figcaption|figure|footer|header|hgroup|mark|meter|nav|output|progress|section|summary|time|video",ah=/ jQuery\d+="(?:\d+|null)"/g,ar=/^\s+/,R=/<(?!area|br|col|embed|hr|img|input|link|meta|param)(([\w:]+)[^>]*)\/>/ig,d=/<([\w:]+)/,v=/]","i"),o=/checked\s*(?:[^=]|=\s*.checked.)/i,bn=/\/(java|ecma)script/i,aO=/^\s*",""],legend:[1,"
      ","
      "],thead:[1,"","
      "],tr:[2,"","
      "],td:[3,"","
      "],col:[2,"","
      "],area:[1,"",""],_default:[0,"",""]},ac=a(av);ax.optgroup=ax.option;ax.tbody=ax.tfoot=ax.colgroup=ax.caption=ax.thead;ax.th=ax.td;if(!b.support.htmlSerialize){ax._default=[1,"div
      ","
      "]}b.fn.extend({text:function(e){return b.access(this,function(bv){return bv===L?b.text(this):this.empty().append((this[0]&&this[0].ownerDocument||av).createTextNode(bv))},null,e,arguments.length)},wrapAll:function(e){if(b.isFunction(e)){return this.each(function(bw){b(this).wrapAll(e.call(this,bw))})}if(this[0]){var bv=b(e,this[0].ownerDocument).eq(0).clone(true);if(this[0].parentNode){bv.insertBefore(this[0])}bv.map(function(){var bw=this;while(bw.firstChild&&bw.firstChild.nodeType===1){bw=bw.firstChild}return bw}).append(this)}return this},wrapInner:function(e){if(b.isFunction(e)){return this.each(function(bv){b(this).wrapInner(e.call(this,bv))})}return this.each(function(){var bv=b(this),bw=bv.contents();if(bw.length){bw.wrapAll(e)}else{bv.append(e)}})},wrap:function(e){var bv=b.isFunction(e);return this.each(function(bw){b(this).wrapAll(bv?e.call(this,bw):e)})},unwrap:function(){return this.parent().each(function(){if(!b.nodeName(this,"body")){b(this).replaceWith(this.childNodes)}}).end()},append:function(){return this.domManip(arguments,true,function(e){if(this.nodeType===1){this.appendChild(e)}})},prepend:function(){return this.domManip(arguments,true,function(e){if(this.nodeType===1){this.insertBefore(e,this.firstChild)}})},before:function(){if(this[0]&&this[0].parentNode){return this.domManip(arguments,false,function(bv){this.parentNode.insertBefore(bv,this)})}else{if(arguments.length){var e=b.clean(arguments);e.push.apply(e,this.toArray());return this.pushStack(e,"before",arguments)}}},after:function(){if(this[0]&&this[0].parentNode){return this.domManip(arguments,false,function(bv){this.parentNode.insertBefore(bv,this.nextSibling)})}else{if(arguments.length){var e=this.pushStack(this,"after",arguments);e.push.apply(e,b.clean(arguments));return e}}},remove:function(e,bx){for(var bv=0,bw;(bw=this[bv])!=null;bv++){if(!e||b.filter(e,[bw]).length){if(!bx&&bw.nodeType===1){b.cleanData(bw.getElementsByTagName("*"));b.cleanData([bw])}if(bw.parentNode){bw.parentNode.removeChild(bw)}}}return this},empty:function(){for(var e=0,bv;(bv=this[e])!=null;e++){if(bv.nodeType===1){b.cleanData(bv.getElementsByTagName("*"))}while(bv.firstChild){bv.removeChild(bv.firstChild)}}return this},clone:function(bv,e){bv=bv==null?false:bv;e=e==null?bv:e;return this.map(function(){return b.clone(this,bv,e)})},html:function(e){return b.access(this,function(by){var bx=this[0]||{},bw=0,bv=this.length;if(by===L){return bx.nodeType===1?bx.innerHTML.replace(ah,""):null}if(typeof by==="string"&&!ae.test(by)&&(b.support.leadingWhitespace||!ar.test(by))&&!ax[(d.exec(by)||["",""])[1].toLowerCase()]){by=by.replace(R,"<$1>");try{for(;bw1&&bw0?this.clone(true):this).get();b(bC[bA])[bv](by);bz=bz.concat(by)}return this.pushStack(bz,e,bC.selector)}}});function bh(e){if(typeof e.getElementsByTagName!=="undefined"){return e.getElementsByTagName("*")}else{if(typeof e.querySelectorAll!=="undefined"){return e.querySelectorAll("*")}else{return[]}}}function az(e){if(e.type==="checkbox"||e.type==="radio"){e.defaultChecked=e.checked}}function D(e){var bv=(e.nodeName||"").toLowerCase();if(bv==="input"){az(e)}else{if(bv!=="script"&&typeof e.getElementsByTagName!=="undefined"){b.grep(e.getElementsByTagName("input"),az)}}}function am(e){var bv=av.createElement("div");ac.appendChild(bv);bv.innerHTML=e.outerHTML;return bv.firstChild}b.extend({clone:function(by,bA,bw){var e,bv,bx,bz=b.support.html5Clone||b.isXMLDoc(by)||!ai.test("<"+by.nodeName+">")?by.cloneNode(true):am(by);if((!b.support.noCloneEvent||!b.support.noCloneChecked)&&(by.nodeType===1||by.nodeType===11)&&!b.isXMLDoc(by)){aj(by,bz);e=bh(by);bv=bh(bz);for(bx=0;e[bx];++bx){if(bv[bx]){aj(e[bx],bv[bx])}}}if(bA){s(by,bz);if(bw){e=bh(by);bv=bh(bz);for(bx=0;e[bx];++bx){s(e[bx],bv[bx])}}}e=bv=null;return bz},clean:function(bI,bw,bv,bx){var bA,bH,bD,bJ=[];bw=bw||av;if(typeof bw.createElement==="undefined"){bw=bw.ownerDocument||bw[0]&&bw[0].ownerDocument||av}for(var bE=0,bG;(bG=bI[bE])!=null;bE++){if(typeof bG==="number"){bG+=""}if(!bG){continue}if(typeof bG==="string"){if(!W.test(bG)){bG=bw.createTextNode(bG)}else{bG=bG.replace(R,"<$1>");var bN=(d.exec(bG)||["",""])[1].toLowerCase(),bz=ax[bN]||ax._default,bK=bz[0],bB=bw.createElement("div"),bL=ac.childNodes,bM;if(bw===av){ac.appendChild(bB)}else{a(bw).appendChild(bB)}bB.innerHTML=bz[1]+bG+bz[2];while(bK--){bB=bB.lastChild}if(!b.support.tbody){var by=v.test(bG),e=bN==="table"&&!by?bB.firstChild&&bB.firstChild.childNodes:bz[1]===""&&!by?bB.childNodes:[];for(bD=e.length-1;bD>=0;--bD){if(b.nodeName(e[bD],"tbody")&&!e[bD].childNodes.length){e[bD].parentNode.removeChild(e[bD])}}}if(!b.support.leadingWhitespace&&ar.test(bG)){bB.insertBefore(bw.createTextNode(ar.exec(bG)[0]),bB.firstChild)}bG=bB.childNodes;if(bB){bB.parentNode.removeChild(bB);if(bL.length>0){bM=bL[bL.length-1];if(bM&&bM.parentNode){bM.parentNode.removeChild(bM)}}}}}var bF;if(!b.support.appendChecked){if(bG[0]&&typeof(bF=bG.length)==="number"){for(bD=0;bD1)};b.extend({cssHooks:{opacity:{get:function(bw,bv){if(bv){var e=Z(bw,"opacity");return e===""?"1":e}else{return bw.style.opacity}}}},cssNumber:{fillOpacity:true,fontWeight:true,lineHeight:true,opacity:true,orphans:true,widows:true,zIndex:true,zoom:true},cssProps:{"float":b.support.cssFloat?"cssFloat":"styleFloat"},style:function(bx,bw,bD,by){if(!bx||bx.nodeType===3||bx.nodeType===8||!bx.style){return}var bB,bC,bz=b.camelCase(bw),bv=bx.style,bE=b.cssHooks[bz];bw=b.cssProps[bz]||bz;if(bD!==L){bC=typeof bD;if(bC==="string"&&(bB=I.exec(bD))){bD=(+(bB[1]+1)*+bB[2])+parseFloat(b.css(bx,bw));bC="number"}if(bD==null||bC==="number"&&isNaN(bD)){return}if(bC==="number"&&!b.cssNumber[bz]){bD+="px"}if(!bE||!("set" in bE)||(bD=bE.set(bx,bD))!==L){try{bv[bw]=bD}catch(bA){}}}else{if(bE&&"get" in bE&&(bB=bE.get(bx,false,by))!==L){return bB}return bv[bw]}},css:function(by,bx,bv){var bw,e;bx=b.camelCase(bx);e=b.cssHooks[bx];bx=b.cssProps[bx]||bx;if(bx==="cssFloat"){bx="float"}if(e&&"get" in e&&(bw=e.get(by,true,bv))!==L){return bw}else{if(Z){return Z(by,bx)}}},swap:function(by,bx,bz){var e={},bw,bv;for(bv in bx){e[bv]=by.style[bv];by.style[bv]=bx[bv]}bw=bz.call(by);for(bv in bx){by.style[bv]=e[bv]}return bw}});b.curCSS=b.css;if(av.defaultView&&av.defaultView.getComputedStyle){aJ=function(bA,bw){var bv,bz,e,by,bx=bA.style;bw=bw.replace(y,"-$1").toLowerCase();if((bz=bA.ownerDocument.defaultView)&&(e=bz.getComputedStyle(bA,null))){bv=e.getPropertyValue(bw);if(bv===""&&!b.contains(bA.ownerDocument.documentElement,bA)){bv=b.style(bA,bw)}}if(!b.support.pixelMargin&&e&&aE.test(bw)&&a1.test(bv)){by=bx.width;bx.width=bv;bv=e.width;bx.width=by}return bv}}if(av.documentElement.currentStyle){aY=function(bz,bw){var bA,e,by,bv=bz.currentStyle&&bz.currentStyle[bw],bx=bz.style;if(bv==null&&bx&&(by=bx[bw])){bv=by}if(a1.test(bv)){bA=bx.left;e=bz.runtimeStyle&&bz.runtimeStyle.left;if(e){bz.runtimeStyle.left=bz.currentStyle.left}bx.left=bw==="fontSize"?"1em":bv;bv=bx.pixelLeft+"px";bx.left=bA;if(e){bz.runtimeStyle.left=e}}return bv===""?"auto":bv}}Z=aJ||aY;function af(by,bw,bv){var bz=bw==="width"?by.offsetWidth:by.offsetHeight,bx=bw==="width"?1:0,e=4;if(bz>0){if(bv!=="border"){for(;bx=1&&b.trim(bw.replace(al,""))===""){bx.removeAttribute("filter");if(bv&&!bv.filter){return}}bx.filter=al.test(bw)?bw.replace(al,e):bw+" "+e}}}b(function(){if(!b.support.reliableMarginRight){b.cssHooks.marginRight={get:function(bv,e){return b.swap(bv,{display:"inline-block"},function(){if(e){return Z(bv,"margin-right")}else{return bv.style.marginRight}})}}}});if(b.expr&&b.expr.filters){b.expr.filters.hidden=function(bw){var bv=bw.offsetWidth,e=bw.offsetHeight;return(bv===0&&e===0)||(!b.support.reliableHiddenOffsets&&((bw.style&&bw.style.display)||b.css(bw,"display"))==="none")};b.expr.filters.visible=function(e){return !b.expr.filters.hidden(e)}}b.each({margin:"",padding:"",border:"Width"},function(e,bv){b.cssHooks[e+bv]={expand:function(by){var bx,bz=typeof by==="string"?by.split(" "):[by],bw={};for(bx=0;bx<4;bx++){bw[e+G[bx]+bv]=bz[bx]||bz[bx-2]||bz[0]}return bw}}});var k=/%20/g,ap=/\[\]$/,bs=/\r?\n/g,bq=/#.*$/,aD=/^(.*?):[ \t]*([^\r\n]*)\r?$/mg,a0=/^(?:color|date|datetime|datetime-local|email|hidden|month|number|password|range|search|tel|text|time|url|week)$/i,aN=/^(?:about|app|app\-storage|.+\-extension|file|res|widget):$/,aR=/^(?:GET|HEAD)$/,c=/^\/\//,M=/\?/,a7=/)<[^<]*)*<\/script>/gi,p=/^(?:select|textarea)/i,h=/\s+/,br=/([?&])_=[^&]*/,K=/^([\w\+\.\-]+:)(?:\/\/([^\/?#:]*)(?::(\d+))?)?/,z=b.fn.load,aa={},q={},aF,r,aW=["*/"]+["*"];try{aF=bm.href}catch(aw){aF=av.createElement("a");aF.href="";aF=aF.href}r=K.exec(aF.toLowerCase())||[];function f(e){return function(by,bA){if(typeof by!=="string"){bA=by;by="*"}if(b.isFunction(bA)){var bx=by.toLowerCase().split(h),bw=0,bz=bx.length,bv,bB,bC;for(;bw=0){var e=bw.slice(by,bw.length);bw=bw.slice(0,by)}var bx="GET";if(bz){if(b.isFunction(bz)){bA=bz;bz=L}else{if(typeof bz==="object"){bz=b.param(bz,b.ajaxSettings.traditional);bx="POST"}}}var bv=this;b.ajax({url:bw,type:bx,dataType:"html",data:bz,complete:function(bC,bB,bD){bD=bC.responseText;if(bC.isResolved()){bC.done(function(bE){bD=bE});bv.html(e?b("
      ").append(bD.replace(a7,"")).find(e):bD)}if(bA){bv.each(bA,[bD,bB,bC])}}});return this},serialize:function(){return b.param(this.serializeArray())},serializeArray:function(){return this.map(function(){return this.elements?b.makeArray(this.elements):this}).filter(function(){return this.name&&!this.disabled&&(this.checked||p.test(this.nodeName)||a0.test(this.type))}).map(function(e,bv){var bw=b(this).val();return bw==null?null:b.isArray(bw)?b.map(bw,function(by,bx){return{name:bv.name,value:by.replace(bs,"\r\n")}}):{name:bv.name,value:bw.replace(bs,"\r\n")}}).get()}});b.each("ajaxStart ajaxStop ajaxComplete ajaxError ajaxSuccess ajaxSend".split(" "),function(e,bv){b.fn[bv]=function(bw){return this.on(bv,bw)}});b.each(["get","post"],function(e,bv){b[bv]=function(bw,by,bz,bx){if(b.isFunction(by)){bx=bx||bz;bz=by;by=L}return b.ajax({type:bv,url:bw,data:by,success:bz,dataType:bx})}});b.extend({getScript:function(e,bv){return b.get(e,L,bv,"script")},getJSON:function(e,bv,bw){return b.get(e,bv,bw,"json")},ajaxSetup:function(bv,e){if(e){an(bv,b.ajaxSettings)}else{e=bv;bv=b.ajaxSettings}an(bv,e);return bv},ajaxSettings:{url:aF,isLocal:aN.test(r[1]),global:true,type:"GET",contentType:"application/x-www-form-urlencoded; charset=UTF-8",processData:true,async:true,accepts:{xml:"application/xml, text/xml",html:"text/html",text:"text/plain",json:"application/json, text/javascript","*":aW},contents:{xml:/xml/,html:/html/,json:/json/},responseFields:{xml:"responseXML",text:"responseText"},converters:{"* text":bd.String,"text html":true,"text json":b.parseJSON,"text xml":b.parseXML},flatOptions:{context:true,url:true}},ajaxPrefilter:f(aa),ajaxTransport:f(q),ajax:function(bz,bx){if(typeof bz==="object"){bx=bz;bz=L}bx=bx||{};var bD=b.ajaxSetup({},bx),bS=bD.context||bD,bG=bS!==bD&&(bS.nodeType||bS instanceof b)?b(bS):b.event,bR=b.Deferred(),bN=b.Callbacks("once memory"),bB=bD.statusCode||{},bC,bH={},bO={},bQ,by,bL,bE,bI,bA=0,bw,bK,bJ={readyState:0,setRequestHeader:function(bT,bU){if(!bA){var e=bT.toLowerCase();bT=bO[e]=bO[e]||bT;bH[bT]=bU}return this},getAllResponseHeaders:function(){return bA===2?bQ:null},getResponseHeader:function(bT){var e;if(bA===2){if(!by){by={};while((e=aD.exec(bQ))){by[e[1].toLowerCase()]=e[2]}}e=by[bT.toLowerCase()]}return e===L?null:e},overrideMimeType:function(e){if(!bA){bD.mimeType=e}return this},abort:function(e){e=e||"abort";if(bL){bL.abort(e)}bF(0,e);return this}};function bF(bZ,bU,b0,bW){if(bA===2){return}bA=2;if(bE){clearTimeout(bE)}bL=L;bQ=bW||"";bJ.readyState=bZ>0?4:0;var bT,b4,b3,bX=bU,bY=b0?bk(bD,bJ,b0):L,bV,b2;if(bZ>=200&&bZ<300||bZ===304){if(bD.ifModified){if((bV=bJ.getResponseHeader("Last-Modified"))){b.lastModified[bC]=bV}if((b2=bJ.getResponseHeader("Etag"))){b.etag[bC]=b2}}if(bZ===304){bX="notmodified";bT=true}else{try{b4=F(bD,bY);bX="success";bT=true}catch(b1){bX="parsererror";b3=b1}}}else{b3=bX;if(!bX||bZ){bX="error";if(bZ<0){bZ=0}}}bJ.status=bZ;bJ.statusText=""+(bU||bX);if(bT){bR.resolveWith(bS,[b4,bX,bJ])}else{bR.rejectWith(bS,[bJ,bX,b3])}bJ.statusCode(bB);bB=L;if(bw){bG.trigger("ajax"+(bT?"Success":"Error"),[bJ,bD,bT?b4:b3])}bN.fireWith(bS,[bJ,bX]);if(bw){bG.trigger("ajaxComplete",[bJ,bD]);if(!(--b.active)){b.event.trigger("ajaxStop")}}}bR.promise(bJ);bJ.success=bJ.done;bJ.error=bJ.fail;bJ.complete=bN.add;bJ.statusCode=function(bT){if(bT){var e;if(bA<2){for(e in bT){bB[e]=[bB[e],bT[e]]}}else{e=bT[bJ.status];bJ.then(e,e)}}return this};bD.url=((bz||bD.url)+"").replace(bq,"").replace(c,r[1]+"//");bD.dataTypes=b.trim(bD.dataType||"*").toLowerCase().split(h);if(bD.crossDomain==null){bI=K.exec(bD.url.toLowerCase());bD.crossDomain=!!(bI&&(bI[1]!=r[1]||bI[2]!=r[2]||(bI[3]||(bI[1]==="http:"?80:443))!=(r[3]||(r[1]==="http:"?80:443))))}if(bD.data&&bD.processData&&typeof bD.data!=="string"){bD.data=b.param(bD.data,bD.traditional)}aX(aa,bD,bx,bJ);if(bA===2){return false}bw=bD.global;bD.type=bD.type.toUpperCase();bD.hasContent=!aR.test(bD.type);if(bw&&b.active++===0){b.event.trigger("ajaxStart")}if(!bD.hasContent){if(bD.data){bD.url+=(M.test(bD.url)?"&":"?")+bD.data;delete bD.data}bC=bD.url;if(bD.cache===false){var bv=b.now(),bP=bD.url.replace(br,"$1_="+bv);bD.url=bP+((bP===bD.url)?(M.test(bD.url)?"&":"?")+"_="+bv:"")}}if(bD.data&&bD.hasContent&&bD.contentType!==false||bx.contentType){bJ.setRequestHeader("Content-Type",bD.contentType)}if(bD.ifModified){bC=bC||bD.url;if(b.lastModified[bC]){bJ.setRequestHeader("If-Modified-Since",b.lastModified[bC])}if(b.etag[bC]){bJ.setRequestHeader("If-None-Match",b.etag[bC])}}bJ.setRequestHeader("Accept",bD.dataTypes[0]&&bD.accepts[bD.dataTypes[0]]?bD.accepts[bD.dataTypes[0]]+(bD.dataTypes[0]!=="*"?", "+aW+"; q=0.01":""):bD.accepts["*"]);for(bK in bD.headers){bJ.setRequestHeader(bK,bD.headers[bK])}if(bD.beforeSend&&(bD.beforeSend.call(bS,bJ,bD)===false||bA===2)){bJ.abort();return false}for(bK in {success:1,error:1,complete:1}){bJ[bK](bD[bK])}bL=aX(q,bD,bx,bJ);if(!bL){bF(-1,"No Transport")}else{bJ.readyState=1;if(bw){bG.trigger("ajaxSend",[bJ,bD])}if(bD.async&&bD.timeout>0){bE=setTimeout(function(){bJ.abort("timeout")},bD.timeout)}try{bA=1;bL.send(bH,bF)}catch(bM){if(bA<2){bF(-1,bM)}else{throw bM}}}return bJ},param:function(e,bw){var bv=[],by=function(bz,bA){bA=b.isFunction(bA)?bA():bA;bv[bv.length]=encodeURIComponent(bz)+"="+encodeURIComponent(bA)};if(bw===L){bw=b.ajaxSettings.traditional}if(b.isArray(e)||(e.jquery&&!b.isPlainObject(e))){b.each(e,function(){by(this.name,this.value)})}else{for(var bx in e){u(bx,e[bx],bw,by)}}return bv.join("&").replace(k,"+")}});function u(bw,by,bv,bx){if(b.isArray(by)){b.each(by,function(bA,bz){if(bv||ap.test(bw)){bx(bw,bz)}else{u(bw+"["+(typeof bz==="object"?bA:"")+"]",bz,bv,bx)}})}else{if(!bv&&b.type(by)==="object"){for(var e in by){u(bw+"["+e+"]",by[e],bv,bx)}}else{bx(bw,by)}}}b.extend({active:0,lastModified:{},etag:{}});function bk(bD,bC,bz){var bv=bD.contents,bB=bD.dataTypes,bw=bD.responseFields,by,bA,bx,e;for(bA in bw){if(bA in bz){bC[bw[bA]]=bz[bA]}}while(bB[0]==="*"){bB.shift();if(by===L){by=bD.mimeType||bC.getResponseHeader("content-type")}}if(by){for(bA in bv){if(bv[bA]&&bv[bA].test(by)){bB.unshift(bA);break}}}if(bB[0] in bz){bx=bB[0]}else{for(bA in bz){if(!bB[0]||bD.converters[bA+" "+bB[0]]){bx=bA;break}if(!e){e=bA}}bx=bx||e}if(bx){if(bx!==bB[0]){bB.unshift(bx)}return bz[bx]}}function F(bH,bz){if(bH.dataFilter){bz=bH.dataFilter(bz,bH.dataType)}var bD=bH.dataTypes,bG={},bA,bE,bw=bD.length,bB,bC=bD[0],bx,by,bF,bv,e;for(bA=1;bA=bw.duration+this.startTime){this.now=this.end;this.pos=this.state=1;this.update();bw.animatedProperties[this.prop]=true;for(bA in bw.animatedProperties){if(bw.animatedProperties[bA]!==true){e=false}}if(e){if(bw.overflow!=null&&!b.support.shrinkWrapBlocks){b.each(["","X","Y"],function(bC,bD){bz.style["overflow"+bD]=bw.overflow[bC]})}if(bw.hide){b(bz).hide()}if(bw.hide||bw.show){for(bA in bw.animatedProperties){b.style(bz,bA,bw.orig[bA]);b.removeData(bz,"fxshow"+bA,true);b.removeData(bz,"toggle"+bA,true)}}bv=bw.complete;if(bv){bw.complete=false;bv.call(bz)}}return false}else{if(bw.duration==Infinity){this.now=bx}else{bB=bx-this.startTime;this.state=bB/bw.duration;this.pos=b.easing[bw.animatedProperties[this.prop]](this.state,bB,0,1,bw.duration);this.now=this.start+((this.end-this.start)*this.pos)}this.update()}return true}};b.extend(b.fx,{tick:function(){var bw,bv=b.timers,e=0;for(;e").appendTo(e),bw=bv.css("display");bv.remove();if(bw==="none"||bw===""){if(!ba){ba=av.createElement("iframe");ba.frameBorder=ba.width=ba.height=0}e.appendChild(ba);if(!m||!ba.createElement){m=(ba.contentWindow||ba.contentDocument).document;m.write((b.support.boxModel?"":"")+"");m.close()}bv=m.createElement(bx);m.body.appendChild(bv);bw=b.css(bv,"display");e.removeChild(ba)}Q[bx]=bw}return Q[bx]}var a8,V=/^t(?:able|d|h)$/i,ad=/^(?:body|html)$/i;if("getBoundingClientRect" in av.documentElement){a8=function(by,bH,bw,bB){try{bB=by.getBoundingClientRect()}catch(bF){}if(!bB||!b.contains(bw,by)){return bB?{top:bB.top,left:bB.left}:{top:0,left:0}}var bC=bH.body,bD=aL(bH),bA=bw.clientTop||bC.clientTop||0,bE=bw.clientLeft||bC.clientLeft||0,bv=bD.pageYOffset||b.support.boxModel&&bw.scrollTop||bC.scrollTop,bz=bD.pageXOffset||b.support.boxModel&&bw.scrollLeft||bC.scrollLeft,bG=bB.top+bv-bA,bx=bB.left+bz-bE;return{top:bG,left:bx}}}else{a8=function(bz,bE,bx){var bC,bw=bz.offsetParent,bv=bz,bA=bE.body,bB=bE.defaultView,e=bB?bB.getComputedStyle(bz,null):bz.currentStyle,bD=bz.offsetTop,by=bz.offsetLeft;while((bz=bz.parentNode)&&bz!==bA&&bz!==bx){if(b.support.fixedPosition&&e.position==="fixed"){break}bC=bB?bB.getComputedStyle(bz,null):bz.currentStyle;bD-=bz.scrollTop;by-=bz.scrollLeft;if(bz===bw){bD+=bz.offsetTop;by+=bz.offsetLeft;if(b.support.doesNotAddBorder&&!(b.support.doesAddBorderForTableAndCells&&V.test(bz.nodeName))){bD+=parseFloat(bC.borderTopWidth)||0;by+=parseFloat(bC.borderLeftWidth)||0}bv=bw;bw=bz.offsetParent}if(b.support.subtractsBorderForOverflowNotVisible&&bC.overflow!=="visible"){bD+=parseFloat(bC.borderTopWidth)||0;by+=parseFloat(bC.borderLeftWidth)||0}e=bC}if(e.position==="relative"||e.position==="static"){bD+=bA.offsetTop;by+=bA.offsetLeft}if(b.support.fixedPosition&&e.position==="fixed"){bD+=Math.max(bx.scrollTop,bA.scrollTop);by+=Math.max(bx.scrollLeft,bA.scrollLeft)}return{top:bD,left:by}}}b.fn.offset=function(e){if(arguments.length){return e===L?this:this.each(function(bx){b.offset.setOffset(this,e,bx)})}var bv=this[0],bw=bv&&bv.ownerDocument;if(!bw){return null}if(bv===bw.body){return b.offset.bodyOffset(bv)}return a8(bv,bw,bw.documentElement)};b.offset={bodyOffset:function(e){var bw=e.offsetTop,bv=e.offsetLeft;if(b.support.doesNotIncludeMarginInBodyOffset){bw+=parseFloat(b.css(e,"marginTop"))||0;bv+=parseFloat(b.css(e,"marginLeft"))||0}return{top:bw,left:bv}},setOffset:function(bx,bG,bA){var bB=b.css(bx,"position");if(bB==="static"){bx.style.position="relative"}var bz=b(bx),bv=bz.offset(),e=b.css(bx,"top"),bE=b.css(bx,"left"),bF=(bB==="absolute"||bB==="fixed")&&b.inArray("auto",[e,bE])>-1,bD={},bC={},bw,by;if(bF){bC=bz.position();bw=bC.top;by=bC.left}else{bw=parseFloat(e)||0;by=parseFloat(bE)||0}if(b.isFunction(bG)){bG=bG.call(bx,bA,bv)}if(bG.top!=null){bD.top=(bG.top-bv.top)+bw}if(bG.left!=null){bD.left=(bG.left-bv.left)+by}if("using" in bG){bG.using.call(bx,bD)}else{bz.css(bD)}}};b.fn.extend({position:function(){if(!this[0]){return null}var bw=this[0],bv=this.offsetParent(),bx=this.offset(),e=ad.test(bv[0].nodeName)?{top:0,left:0}:bv.offset();bx.top-=parseFloat(b.css(bw,"marginTop"))||0;bx.left-=parseFloat(b.css(bw,"marginLeft"))||0;e.top+=parseFloat(b.css(bv[0],"borderTopWidth"))||0;e.left+=parseFloat(b.css(bv[0],"borderLeftWidth"))||0;return{top:bx.top-e.top,left:bx.left-e.left}},offsetParent:function(){return this.map(function(){var e=this.offsetParent||av.body;while(e&&(!ad.test(e.nodeName)&&b.css(e,"position")==="static")){e=e.offsetParent}return e})}});b.each({scrollLeft:"pageXOffset",scrollTop:"pageYOffset"},function(bw,bv){var e=/Y/.test(bv);b.fn[bw]=function(bx){return b.access(this,function(by,bB,bA){var bz=aL(by);if(bA===L){return bz?(bv in bz)?bz[bv]:b.support.boxModel&&bz.document.documentElement[bB]||bz.document.body[bB]:by[bB]}if(bz){bz.scrollTo(!e?bA:b(bz).scrollLeft(),e?bA:b(bz).scrollTop())}else{by[bB]=bA}},bw,bx,arguments.length,null)}});function aL(e){return b.isWindow(e)?e:e.nodeType===9?e.defaultView||e.parentWindow:false}b.each({Height:"height",Width:"width"},function(bw,bx){var bv="client"+bw,e="scroll"+bw,by="offset"+bw;b.fn["inner"+bw]=function(){var bz=this[0];return bz?bz.style?parseFloat(b.css(bz,bx,"padding")):this[bx]():null};b.fn["outer"+bw]=function(bA){var bz=this[0];return bz?bz.style?parseFloat(b.css(bz,bx,bA?"margin":"border")):this[bx]():null};b.fn[bx]=function(bz){return b.access(this,function(bC,bB,bD){var bF,bE,bG,bA;if(b.isWindow(bC)){bF=bC.document;bE=bF.documentElement[bv];return b.support.boxModel&&bE||bF.body&&bF.body[bv]||bE}if(bC.nodeType===9){bF=bC.documentElement;if(bF[bv]>=bF[e]){return bF[bv]}return Math.max(bC.body[e],bF[e],bC.body[by],bF[by])}if(bD===L){bG=b.css(bC,bB);bA=parseFloat(bG);return b.isNumeric(bA)?bA:bG}b(bC).css(bB,bD)},bx,bz,arguments.length,null)}});bd.jQuery=bd.$=b;if(typeof define==="function"&&define.amd&&define.amd.jQuery){define("jquery",[],function(){return b})}})(window);/*! - * jQuery UI 1.8.18 - * - * Copyright 2011, AUTHORS.txt (http://jqueryui.com/about) - * Dual licensed under the MIT or GPL Version 2 licenses. - * http://jquery.org/license - * - * http://docs.jquery.com/UI - */ -(function(a,d){a.ui=a.ui||{};if(a.ui.version){return}a.extend(a.ui,{version:"1.8.18",keyCode:{ALT:18,BACKSPACE:8,CAPS_LOCK:20,COMMA:188,COMMAND:91,COMMAND_LEFT:91,COMMAND_RIGHT:93,CONTROL:17,DELETE:46,DOWN:40,END:35,ENTER:13,ESCAPE:27,HOME:36,INSERT:45,LEFT:37,MENU:93,NUMPAD_ADD:107,NUMPAD_DECIMAL:110,NUMPAD_DIVIDE:111,NUMPAD_ENTER:108,NUMPAD_MULTIPLY:106,NUMPAD_SUBTRACT:109,PAGE_DOWN:34,PAGE_UP:33,PERIOD:190,RIGHT:39,SHIFT:16,SPACE:32,TAB:9,UP:38,WINDOWS:91}});a.fn.extend({propAttr:a.fn.prop||a.fn.attr,_focus:a.fn.focus,focus:function(e,f){return typeof e==="number"?this.each(function(){var g=this;setTimeout(function(){a(g).focus();if(f){f.call(g)}},e)}):this._focus.apply(this,arguments)},scrollParent:function(){var e;if((a.browser.msie&&(/(static|relative)/).test(this.css("position")))||(/absolute/).test(this.css("position"))){e=this.parents().filter(function(){return(/(relative|absolute|fixed)/).test(a.curCSS(this,"position",1))&&(/(auto|scroll)/).test(a.curCSS(this,"overflow",1)+a.curCSS(this,"overflow-y",1)+a.curCSS(this,"overflow-x",1))}).eq(0)}else{e=this.parents().filter(function(){return(/(auto|scroll)/).test(a.curCSS(this,"overflow",1)+a.curCSS(this,"overflow-y",1)+a.curCSS(this,"overflow-x",1))}).eq(0)}return(/fixed/).test(this.css("position"))||!e.length?a(document):e},zIndex:function(h){if(h!==d){return this.css("zIndex",h)}if(this.length){var f=a(this[0]),e,g;while(f.length&&f[0]!==document){e=f.css("position");if(e==="absolute"||e==="relative"||e==="fixed"){g=parseInt(f.css("zIndex"),10);if(!isNaN(g)&&g!==0){return g}}f=f.parent()}}return 0},disableSelection:function(){return this.bind((a.support.selectstart?"selectstart":"mousedown")+".ui-disableSelection",function(e){e.preventDefault()})},enableSelection:function(){return this.unbind(".ui-disableSelection")}});a.each(["Width","Height"],function(g,e){var f=e==="Width"?["Left","Right"]:["Top","Bottom"],h=e.toLowerCase(),k={innerWidth:a.fn.innerWidth,innerHeight:a.fn.innerHeight,outerWidth:a.fn.outerWidth,outerHeight:a.fn.outerHeight};function j(m,l,i,n){a.each(f,function(){l-=parseFloat(a.curCSS(m,"padding"+this,true))||0;if(i){l-=parseFloat(a.curCSS(m,"border"+this+"Width",true))||0}if(n){l-=parseFloat(a.curCSS(m,"margin"+this,true))||0}});return l}a.fn["inner"+e]=function(i){if(i===d){return k["inner"+e].call(this)}return this.each(function(){a(this).css(h,j(this,i)+"px")})};a.fn["outer"+e]=function(i,l){if(typeof i!=="number"){return k["outer"+e].call(this,i)}return this.each(function(){a(this).css(h,j(this,i,true,l)+"px")})}});function c(g,e){var j=g.nodeName.toLowerCase();if("area"===j){var i=g.parentNode,h=i.name,f;if(!g.href||!h||i.nodeName.toLowerCase()!=="map"){return false}f=a("img[usemap=#"+h+"]")[0];return !!f&&b(f)}return(/input|select|textarea|button|object/.test(j)?!g.disabled:"a"==j?g.href||e:e)&&b(g)}function b(e){return !a(e).parents().andSelf().filter(function(){return a.curCSS(this,"visibility")==="hidden"||a.expr.filters.hidden(this)}).length}a.extend(a.expr[":"],{data:function(g,f,e){return !!a.data(g,e[3])},focusable:function(e){return c(e,!isNaN(a.attr(e,"tabindex")))},tabbable:function(g){var e=a.attr(g,"tabindex"),f=isNaN(e);return(f||e>=0)&&c(g,!f)}});a(function(){var e=document.body,f=e.appendChild(f=document.createElement("div"));f.offsetHeight;a.extend(f.style,{minHeight:"100px",height:"auto",padding:0,borderWidth:0});a.support.minHeight=f.offsetHeight===100;a.support.selectstart="onselectstart" in f;e.removeChild(f).style.display="none"});a.extend(a.ui,{plugin:{add:function(f,g,j){var h=a.ui[f].prototype;for(var e in j){h.plugins[e]=h.plugins[e]||[];h.plugins[e].push([g,j[e]])}},call:function(e,g,f){var j=e.plugins[g];if(!j||!e.element[0].parentNode){return}for(var h=0;h0){return true}h[e]=1;g=(h[e]>0);h[e]=0;return g},isOverAxis:function(f,e,g){return(f>e)&&(f<(e+g))},isOver:function(j,f,i,h,e,g){return a.ui.isOverAxis(j,i,e)&&a.ui.isOverAxis(f,h,g)}})})(jQuery);/*! - * jQuery UI Widget 1.8.18 - * - * Copyright 2011, AUTHORS.txt (http://jqueryui.com/about) - * Dual licensed under the MIT or GPL Version 2 licenses. - * http://jquery.org/license - * - * http://docs.jquery.com/UI/Widget - */ -(function(b,d){if(b.cleanData){var c=b.cleanData;b.cleanData=function(f){for(var g=0,h;(h=f[g])!=null;g++){try{b(h).triggerHandler("remove")}catch(j){}}c(f)}}else{var a=b.fn.remove;b.fn.remove=function(e,f){return this.each(function(){if(!f){if(!e||b.filter(e,[this]).length){b("*",this).add([this]).each(function(){try{b(this).triggerHandler("remove")}catch(g){}})}}return a.call(b(this),e,f)})}}b.widget=function(f,h,e){var g=f.split(".")[0],j;f=f.split(".")[1];j=g+"-"+f;if(!e){e=h;h=b.Widget}b.expr[":"][j]=function(k){return !!b.data(k,f)};b[g]=b[g]||{};b[g][f]=function(k,l){if(arguments.length){this._createWidget(k,l)}};var i=new h();i.options=b.extend(true,{},i.options);b[g][f].prototype=b.extend(true,i,{namespace:g,widgetName:f,widgetEventPrefix:b[g][f].prototype.widgetEventPrefix||f,widgetBaseClass:j},e);b.widget.bridge(f,b[g][f])};b.widget.bridge=function(f,e){b.fn[f]=function(i){var g=typeof i==="string",h=Array.prototype.slice.call(arguments,1),j=this;i=!g&&h.length?b.extend.apply(null,[true,i].concat(h)):i;if(g&&i.charAt(0)==="_"){return j}if(g){this.each(function(){var k=b.data(this,f),l=k&&b.isFunction(k[i])?k[i].apply(k,h):k;if(l!==k&&l!==d){j=l;return false}})}else{this.each(function(){var k=b.data(this,f);if(k){k.option(i||{})._init()}else{b.data(this,f,new e(i,this))}})}return j}};b.Widget=function(e,f){if(arguments.length){this._createWidget(e,f)}};b.Widget.prototype={widgetName:"widget",widgetEventPrefix:"",options:{disabled:false},_createWidget:function(f,g){b.data(g,this.widgetName,this);this.element=b(g);this.options=b.extend(true,{},this.options,this._getCreateOptions(),f);var e=this;this.element.bind("remove."+this.widgetName,function(){e.destroy()});this._create();this._trigger("create");this._init()},_getCreateOptions:function(){return b.metadata&&b.metadata.get(this.element[0])[this.widgetName]},_create:function(){},_init:function(){},destroy:function(){this.element.unbind("."+this.widgetName).removeData(this.widgetName);this.widget().unbind("."+this.widgetName).removeAttr("aria-disabled").removeClass(this.widgetBaseClass+"-disabled ui-state-disabled")},widget:function(){return this.element},option:function(f,g){var e=f;if(arguments.length===0){return b.extend({},this.options)}if(typeof f==="string"){if(g===d){return this.options[f]}e={};e[f]=g}this._setOptions(e);return this},_setOptions:function(f){var e=this;b.each(f,function(g,h){e._setOption(g,h)});return this},_setOption:function(e,f){this.options[e]=f;if(e==="disabled"){this.widget()[f?"addClass":"removeClass"](this.widgetBaseClass+"-disabled ui-state-disabled").attr("aria-disabled",f)}return this},enable:function(){return this._setOption("disabled",false)},disable:function(){return this._setOption("disabled",true)},_trigger:function(e,f,g){var j,i,h=this.options[e];g=g||{};f=b.Event(f);f.type=(e===this.widgetEventPrefix?e:this.widgetEventPrefix+e).toLowerCase();f.target=this.element[0];i=f.originalEvent;if(i){for(j in i){if(!(j in f)){f[j]=i[j]}}}this.element.trigger(f,g);return !(b.isFunction(h)&&h.call(this.element[0],f,g)===false||f.isDefaultPrevented())}}})(jQuery);/*! - * jQuery UI Mouse 1.8.18 - * - * Copyright 2011, AUTHORS.txt (http://jqueryui.com/about) - * Dual licensed under the MIT or GPL Version 2 licenses. - * http://jquery.org/license - * - * http://docs.jquery.com/UI/Mouse - * - * Depends: - * jquery.ui.widget.js - */ -(function(b,c){var a=false;b(document).mouseup(function(d){a=false});b.widget("ui.mouse",{options:{cancel:":input,option",distance:1,delay:0},_mouseInit:function(){var d=this;this.element.bind("mousedown."+this.widgetName,function(e){return d._mouseDown(e)}).bind("click."+this.widgetName,function(e){if(true===b.data(e.target,d.widgetName+".preventClickEvent")){b.removeData(e.target,d.widgetName+".preventClickEvent");e.stopImmediatePropagation();return false}});this.started=false},_mouseDestroy:function(){this.element.unbind("."+this.widgetName)},_mouseDown:function(f){if(a){return}(this._mouseStarted&&this._mouseUp(f));this._mouseDownEvent=f;var e=this,g=(f.which==1),d=(typeof this.options.cancel=="string"&&f.target.nodeName?b(f.target).closest(this.options.cancel).length:false);if(!g||d||!this._mouseCapture(f)){return true}this.mouseDelayMet=!this.options.delay;if(!this.mouseDelayMet){this._mouseDelayTimer=setTimeout(function(){e.mouseDelayMet=true},this.options.delay)}if(this._mouseDistanceMet(f)&&this._mouseDelayMet(f)){this._mouseStarted=(this._mouseStart(f)!==false);if(!this._mouseStarted){f.preventDefault();return true}}if(true===b.data(f.target,this.widgetName+".preventClickEvent")){b.removeData(f.target,this.widgetName+".preventClickEvent")}this._mouseMoveDelegate=function(h){return e._mouseMove(h)};this._mouseUpDelegate=function(h){return e._mouseUp(h)};b(document).bind("mousemove."+this.widgetName,this._mouseMoveDelegate).bind("mouseup."+this.widgetName,this._mouseUpDelegate);f.preventDefault();a=true;return true},_mouseMove:function(d){if(b.browser.msie&&!(document.documentMode>=9)&&!d.button){return this._mouseUp(d)}if(this._mouseStarted){this._mouseDrag(d);return d.preventDefault()}if(this._mouseDistanceMet(d)&&this._mouseDelayMet(d)){this._mouseStarted=(this._mouseStart(this._mouseDownEvent,d)!==false);(this._mouseStarted?this._mouseDrag(d):this._mouseUp(d))}return !this._mouseStarted},_mouseUp:function(d){b(document).unbind("mousemove."+this.widgetName,this._mouseMoveDelegate).unbind("mouseup."+this.widgetName,this._mouseUpDelegate);if(this._mouseStarted){this._mouseStarted=false;if(d.target==this._mouseDownEvent.target){b.data(d.target,this.widgetName+".preventClickEvent",true)}this._mouseStop(d)}return false},_mouseDistanceMet:function(d){return(Math.max(Math.abs(this._mouseDownEvent.pageX-d.pageX),Math.abs(this._mouseDownEvent.pageY-d.pageY))>=this.options.distance)},_mouseDelayMet:function(d){return this.mouseDelayMet},_mouseStart:function(d){},_mouseDrag:function(d){},_mouseStop:function(d){},_mouseCapture:function(d){return true}})})(jQuery);(function(c,d){c.widget("ui.resizable",c.ui.mouse,{widgetEventPrefix:"resize",options:{alsoResize:false,animate:false,animateDuration:"slow",animateEasing:"swing",aspectRatio:false,autoHide:false,containment:false,ghost:false,grid:false,handles:"e,s,se",helper:false,maxHeight:null,maxWidth:null,minHeight:10,minWidth:10,zIndex:1000},_create:function(){var f=this,k=this.options;this.element.addClass("ui-resizable");c.extend(this,{_aspectRatio:!!(k.aspectRatio),aspectRatio:k.aspectRatio,originalElement:this.element,_proportionallyResizeElements:[],_helper:k.helper||k.ghost||k.animate?k.helper||"ui-resizable-helper":null});if(this.element[0].nodeName.match(/canvas|textarea|input|select|button|img/i)){this.element.wrap(c('
      ').css({position:this.element.css("position"),width:this.element.outerWidth(),height:this.element.outerHeight(),top:this.element.css("top"),left:this.element.css("left")}));this.element=this.element.parent().data("resizable",this.element.data("resizable"));this.elementIsWrapper=true;this.element.css({marginLeft:this.originalElement.css("marginLeft"),marginTop:this.originalElement.css("marginTop"),marginRight:this.originalElement.css("marginRight"),marginBottom:this.originalElement.css("marginBottom")});this.originalElement.css({marginLeft:0,marginTop:0,marginRight:0,marginBottom:0});this.originalResizeStyle=this.originalElement.css("resize");this.originalElement.css("resize","none");this._proportionallyResizeElements.push(this.originalElement.css({position:"static",zoom:1,display:"block"}));this.originalElement.css({margin:this.originalElement.css("margin")});this._proportionallyResize()}this.handles=k.handles||(!c(".ui-resizable-handle",this.element).length?"e,s,se":{n:".ui-resizable-n",e:".ui-resizable-e",s:".ui-resizable-s",w:".ui-resizable-w",se:".ui-resizable-se",sw:".ui-resizable-sw",ne:".ui-resizable-ne",nw:".ui-resizable-nw"});if(this.handles.constructor==String){if(this.handles=="all"){this.handles="n,e,s,w,se,sw,ne,nw"}var l=this.handles.split(",");this.handles={};for(var g=0;g
      ');if(/sw|se|ne|nw/.test(j)){h.css({zIndex:++k.zIndex})}if("se"==j){h.addClass("ui-icon ui-icon-gripsmall-diagonal-se")}this.handles[j]=".ui-resizable-"+j;this.element.append(h)}}this._renderAxis=function(q){q=q||this.element;for(var n in this.handles){if(this.handles[n].constructor==String){this.handles[n]=c(this.handles[n],this.element).show()}if(this.elementIsWrapper&&this.originalElement[0].nodeName.match(/textarea|input|select|button/i)){var o=c(this.handles[n],this.element),p=0;p=/sw|ne|nw|se|n|s/.test(n)?o.outerHeight():o.outerWidth();var m=["padding",/ne|nw|n/.test(n)?"Top":/se|sw|s/.test(n)?"Bottom":/^e$/.test(n)?"Right":"Left"].join("");q.css(m,p);this._proportionallyResize()}if(!c(this.handles[n]).length){continue}}};this._renderAxis(this.element);this._handles=c(".ui-resizable-handle",this.element).disableSelection();this._handles.mouseover(function(){if(!f.resizing){if(this.className){var i=this.className.match(/ui-resizable-(se|sw|ne|nw|n|e|s|w)/i)}f.axis=i&&i[1]?i[1]:"se"}});if(k.autoHide){this._handles.hide();c(this.element).addClass("ui-resizable-autohide").hover(function(){if(k.disabled){return}c(this).removeClass("ui-resizable-autohide");f._handles.show()},function(){if(k.disabled){return}if(!f.resizing){c(this).addClass("ui-resizable-autohide");f._handles.hide()}})}this._mouseInit()},destroy:function(){this._mouseDestroy();var e=function(g){c(g).removeClass("ui-resizable ui-resizable-disabled ui-resizable-resizing").removeData("resizable").unbind(".resizable").find(".ui-resizable-handle").remove()};if(this.elementIsWrapper){e(this.element);var f=this.element;f.after(this.originalElement.css({position:f.css("position"),width:f.outerWidth(),height:f.outerHeight(),top:f.css("top"),left:f.css("left")})).remove()}this.originalElement.css("resize",this.originalResizeStyle);e(this.originalElement);return this},_mouseCapture:function(f){var g=false;for(var e in this.handles){if(c(this.handles[e])[0]==f.target){g=true}}return !this.options.disabled&&g},_mouseStart:function(g){var j=this.options,f=this.element.position(),e=this.element;this.resizing=true;this.documentScroll={top:c(document).scrollTop(),left:c(document).scrollLeft()};if(e.is(".ui-draggable")||(/absolute/).test(e.css("position"))){e.css({position:"absolute",top:f.top,left:f.left})}this._renderProxy();var k=b(this.helper.css("left")),h=b(this.helper.css("top"));if(j.containment){k+=c(j.containment).scrollLeft()||0;h+=c(j.containment).scrollTop()||0}this.offset=this.helper.offset();this.position={left:k,top:h};this.size=this._helper?{width:e.outerWidth(),height:e.outerHeight()}:{width:e.width(),height:e.height()};this.originalSize=this._helper?{width:e.outerWidth(),height:e.outerHeight()}:{width:e.width(),height:e.height()};this.originalPosition={left:k,top:h};this.sizeDiff={width:e.outerWidth()-e.width(),height:e.outerHeight()-e.height()};this.originalMousePosition={left:g.pageX,top:g.pageY};this.aspectRatio=(typeof j.aspectRatio=="number")?j.aspectRatio:((this.originalSize.width/this.originalSize.height)||1);var i=c(".ui-resizable-"+this.axis).css("cursor");c("body").css("cursor",i=="auto"?this.axis+"-resize":i);e.addClass("ui-resizable-resizing");this._propagate("start",g);return true},_mouseDrag:function(e){var h=this.helper,g=this.options,m={},q=this,j=this.originalMousePosition,n=this.axis;var r=(e.pageX-j.left)||0,p=(e.pageY-j.top)||0;var i=this._change[n];if(!i){return false}var l=i.apply(this,[e,r,p]),k=c.browser.msie&&c.browser.version<7,f=this.sizeDiff;this._updateVirtualBoundaries(e.shiftKey);if(this._aspectRatio||e.shiftKey){l=this._updateRatio(l,e)}l=this._respectSize(l,e);this._propagate("resize",e);h.css({top:this.position.top+"px",left:this.position.left+"px",width:this.size.width+"px",height:this.size.height+"px"});if(!this._helper&&this._proportionallyResizeElements.length){this._proportionallyResize()}this._updateCache(l);this._trigger("resize",e,this.ui());return false},_mouseStop:function(h){this.resizing=false;var i=this.options,m=this;if(this._helper){var g=this._proportionallyResizeElements,e=g.length&&(/textarea/i).test(g[0].nodeName),f=e&&c.ui.hasScroll(g[0],"left")?0:m.sizeDiff.height,k=e?0:m.sizeDiff.width;var n={width:(m.helper.width()-k),height:(m.helper.height()-f)},j=(parseInt(m.element.css("left"),10)+(m.position.left-m.originalPosition.left))||null,l=(parseInt(m.element.css("top"),10)+(m.position.top-m.originalPosition.top))||null;if(!i.animate){this.element.css(c.extend(n,{top:l,left:j}))}m.helper.height(m.size.height);m.helper.width(m.size.width);if(this._helper&&!i.animate){this._proportionallyResize()}}c("body").css("cursor","auto");this.element.removeClass("ui-resizable-resizing");this._propagate("stop",h);if(this._helper){this.helper.remove()}return false},_updateVirtualBoundaries:function(g){var j=this.options,i,h,f,k,e;e={minWidth:a(j.minWidth)?j.minWidth:0,maxWidth:a(j.maxWidth)?j.maxWidth:Infinity,minHeight:a(j.minHeight)?j.minHeight:0,maxHeight:a(j.maxHeight)?j.maxHeight:Infinity};if(this._aspectRatio||g){i=e.minHeight*this.aspectRatio;f=e.minWidth/this.aspectRatio;h=e.maxHeight*this.aspectRatio;k=e.maxWidth/this.aspectRatio;if(i>e.minWidth){e.minWidth=i}if(f>e.minHeight){e.minHeight=f}if(hl.width),s=a(l.height)&&i.minHeight&&(i.minHeight>l.height);if(h){l.width=i.minWidth}if(s){l.height=i.minHeight}if(t){l.width=i.maxWidth}if(m){l.height=i.maxHeight}var f=this.originalPosition.left+this.originalSize.width,p=this.position.top+this.size.height;var k=/sw|nw|w/.test(q),e=/nw|ne|n/.test(q);if(h&&k){l.left=f-i.minWidth}if(t&&k){l.left=f-i.maxWidth}if(s&&e){l.top=p-i.minHeight}if(m&&e){l.top=p-i.maxHeight}var n=!l.width&&!l.height;if(n&&!l.left&&l.top){l.top=null}else{if(n&&!l.top&&l.left){l.left=null}}return l},_proportionallyResize:function(){var k=this.options;if(!this._proportionallyResizeElements.length){return}var g=this.helper||this.element;for(var f=0;f');var e=c.browser.msie&&c.browser.version<7,g=(e?1:0),h=(e?2:-1);this.helper.addClass(this._helper).css({width:this.element.outerWidth()+h,height:this.element.outerHeight()+h,position:"absolute",left:this.elementOffset.left-g+"px",top:this.elementOffset.top-g+"px",zIndex:++i.zIndex});this.helper.appendTo("body").disableSelection()}else{this.helper=this.element}},_change:{e:function(g,f,e){return{width:this.originalSize.width+f}},w:function(h,f,e){var j=this.options,g=this.originalSize,i=this.originalPosition;return{left:i.left+f,width:g.width-f}},n:function(h,f,e){var j=this.options,g=this.originalSize,i=this.originalPosition;return{top:i.top+e,height:g.height-e}},s:function(g,f,e){return{height:this.originalSize.height+e}},se:function(g,f,e){return c.extend(this._change.s.apply(this,arguments),this._change.e.apply(this,[g,f,e]))},sw:function(g,f,e){return c.extend(this._change.s.apply(this,arguments),this._change.w.apply(this,[g,f,e]))},ne:function(g,f,e){return c.extend(this._change.n.apply(this,arguments),this._change.e.apply(this,[g,f,e]))},nw:function(g,f,e){return c.extend(this._change.n.apply(this,arguments),this._change.w.apply(this,[g,f,e]))}},_propagate:function(f,e){c.ui.plugin.call(this,f,[e,this.ui()]);(f!="resize"&&this._trigger(f,e,this.ui()))},plugins:{},ui:function(){return{originalElement:this.originalElement,element:this.element,helper:this.helper,position:this.position,size:this.size,originalSize:this.originalSize,originalPosition:this.originalPosition}}});c.extend(c.ui.resizable,{version:"1.8.18"});c.ui.plugin.add("resizable","alsoResize",{start:function(f,g){var e=c(this).data("resizable"),i=e.options;var h=function(j){c(j).each(function(){var k=c(this);k.data("resizable-alsoresize",{width:parseInt(k.width(),10),height:parseInt(k.height(),10),left:parseInt(k.css("left"),10),top:parseInt(k.css("top"),10)})})};if(typeof(i.alsoResize)=="object"&&!i.alsoResize.parentNode){if(i.alsoResize.length){i.alsoResize=i.alsoResize[0];h(i.alsoResize)}else{c.each(i.alsoResize,function(j){h(j)})}}else{h(i.alsoResize)}},resize:function(g,i){var f=c(this).data("resizable"),j=f.options,h=f.originalSize,l=f.originalPosition;var k={height:(f.size.height-h.height)||0,width:(f.size.width-h.width)||0,top:(f.position.top-l.top)||0,left:(f.position.left-l.left)||0},e=function(m,n){c(m).each(function(){var q=c(this),r=c(this).data("resizable-alsoresize"),p={},o=n&&n.length?n:q.parents(i.originalElement[0]).length?["width","height"]:["width","height","top","left"];c.each(o,function(s,u){var t=(r[u]||0)+(k[u]||0);if(t&&t>=0){p[u]=t||null}});q.css(p)})};if(typeof(j.alsoResize)=="object"&&!j.alsoResize.nodeType){c.each(j.alsoResize,function(m,n){e(m,n)})}else{e(j.alsoResize)}},stop:function(e,f){c(this).removeData("resizable-alsoresize")}});c.ui.plugin.add("resizable","animate",{stop:function(i,n){var p=c(this).data("resizable"),j=p.options;var h=p._proportionallyResizeElements,e=h.length&&(/textarea/i).test(h[0].nodeName),f=e&&c.ui.hasScroll(h[0],"left")?0:p.sizeDiff.height,l=e?0:p.sizeDiff.width;var g={width:(p.size.width-l),height:(p.size.height-f)},k=(parseInt(p.element.css("left"),10)+(p.position.left-p.originalPosition.left))||null,m=(parseInt(p.element.css("top"),10)+(p.position.top-p.originalPosition.top))||null;p.element.animate(c.extend(g,m&&k?{top:m,left:k}:{}),{duration:j.animateDuration,easing:j.animateEasing,step:function(){var o={width:parseInt(p.element.css("width"),10),height:parseInt(p.element.css("height"),10),top:parseInt(p.element.css("top"),10),left:parseInt(p.element.css("left"),10)};if(h&&h.length){c(h[0]).css({width:o.width,height:o.height})}p._updateCache(o);p._propagate("resize",i)}})}});c.ui.plugin.add("resizable","containment",{start:function(f,r){var t=c(this).data("resizable"),j=t.options,l=t.element;var g=j.containment,k=(g instanceof c)?g.get(0):(/parent/.test(g))?l.parent().get(0):g;if(!k){return}t.containerElement=c(k);if(/document/.test(g)||g==document){t.containerOffset={left:0,top:0};t.containerPosition={left:0,top:0};t.parentData={element:c(document),left:0,top:0,width:c(document).width(),height:c(document).height()||document.body.parentNode.scrollHeight}}else{var n=c(k),i=[];c(["Top","Right","Left","Bottom"]).each(function(p,o){i[p]=b(n.css("padding"+o))});t.containerOffset=n.offset();t.containerPosition=n.position();t.containerSize={height:(n.innerHeight()-i[3]),width:(n.innerWidth()-i[1])};var q=t.containerOffset,e=t.containerSize.height,m=t.containerSize.width,h=(c.ui.hasScroll(k,"left")?k.scrollWidth:m),s=(c.ui.hasScroll(k)?k.scrollHeight:e);t.parentData={element:k,left:q.left,top:q.top,width:h,height:s}}},resize:function(g,q){var t=c(this).data("resizable"),i=t.options,f=t.containerSize,p=t.containerOffset,m=t.size,n=t.position,r=t._aspectRatio||g.shiftKey,e={top:0,left:0},h=t.containerElement;if(h[0]!=document&&(/static/).test(h.css("position"))){e=p}if(n.left<(t._helper?p.left:0)){t.size.width=t.size.width+(t._helper?(t.position.left-p.left):(t.position.left-e.left));if(r){t.size.height=t.size.width/i.aspectRatio}t.position.left=i.helper?p.left:0}if(n.top<(t._helper?p.top:0)){t.size.height=t.size.height+(t._helper?(t.position.top-p.top):t.position.top);if(r){t.size.width=t.size.height*i.aspectRatio}t.position.top=t._helper?p.top:0}t.offset.left=t.parentData.left+t.position.left;t.offset.top=t.parentData.top+t.position.top;var l=Math.abs((t._helper?t.offset.left-e.left:(t.offset.left-e.left))+t.sizeDiff.width),s=Math.abs((t._helper?t.offset.top-e.top:(t.offset.top-p.top))+t.sizeDiff.height);var k=t.containerElement.get(0)==t.element.parent().get(0),j=/relative|absolute/.test(t.containerElement.css("position"));if(k&&j){l-=t.parentData.left}if(l+t.size.width>=t.parentData.width){t.size.width=t.parentData.width-l;if(r){t.size.height=t.size.width/t.aspectRatio}}if(s+t.size.height>=t.parentData.height){t.size.height=t.parentData.height-s;if(r){t.size.width=t.size.height*t.aspectRatio}}},stop:function(f,n){var q=c(this).data("resizable"),g=q.options,l=q.position,m=q.containerOffset,e=q.containerPosition,i=q.containerElement;var j=c(q.helper),r=j.offset(),p=j.outerWidth()-q.sizeDiff.width,k=j.outerHeight()-q.sizeDiff.height;if(q._helper&&!g.animate&&(/relative/).test(i.css("position"))){c(this).css({left:r.left-e.left-m.left,width:p,height:k})}if(q._helper&&!g.animate&&(/static/).test(i.css("position"))){c(this).css({left:r.left-e.left-m.left,width:p,height:k})}}});c.ui.plugin.add("resizable","ghost",{start:function(g,h){var e=c(this).data("resizable"),i=e.options,f=e.size;e.ghost=e.originalElement.clone();e.ghost.css({opacity:0.25,display:"block",position:"relative",height:f.height,width:f.width,margin:0,left:0,top:0}).addClass("ui-resizable-ghost").addClass(typeof i.ghost=="string"?i.ghost:"");e.ghost.appendTo(e.helper)},resize:function(f,g){var e=c(this).data("resizable"),h=e.options;if(e.ghost){e.ghost.css({position:"relative",height:e.size.height,width:e.size.width})}},stop:function(f,g){var e=c(this).data("resizable"),h=e.options;if(e.ghost&&e.helper){e.helper.get(0).removeChild(e.ghost.get(0))}}});c.ui.plugin.add("resizable","grid",{resize:function(e,m){var p=c(this).data("resizable"),h=p.options,k=p.size,i=p.originalSize,j=p.originalPosition,n=p.axis,l=h._aspectRatio||e.shiftKey;h.grid=typeof h.grid=="number"?[h.grid,h.grid]:h.grid;var g=Math.round((k.width-i.width)/(h.grid[0]||1))*(h.grid[0]||1),f=Math.round((k.height-i.height)/(h.grid[1]||1))*(h.grid[1]||1);if(/^(se|s|e)$/.test(n)){p.size.width=i.width+g;p.size.height=i.height+f}else{if(/^(ne)$/.test(n)){p.size.width=i.width+g;p.size.height=i.height+f;p.position.top=j.top-f}else{if(/^(sw)$/.test(n)){p.size.width=i.width+g;p.size.height=i.height+f;p.position.left=j.left-g}else{p.size.width=i.width+g;p.size.height=i.height+f;p.position.top=j.top-f;p.position.left=j.left-g}}}}});var b=function(e){return parseInt(e,10)||0};var a=function(e){return !isNaN(parseInt(e,10))}})(jQuery);/*! - * jQuery hashchange event - v1.3 - 7/21/2010 - * http://benalman.com/projects/jquery-hashchange-plugin/ - * - * Copyright (c) 2010 "Cowboy" Ben Alman - * Dual licensed under the MIT and GPL licenses. - * http://benalman.com/about/license/ - */ -(function($,e,b){var c="hashchange",h=document,f,g=$.event.special,i=h.documentMode,d="on"+c in e&&(i===b||i>7);function a(j){j=j||location.href;return"#"+j.replace(/^[^#]*#?(.*)$/,"$1")}$.fn[c]=function(j){return j?this.bind(c,j):this.trigger(c)};$.fn[c].delay=50;g[c]=$.extend(g[c],{setup:function(){if(d){return false}$(f.start)},teardown:function(){if(d){return false}$(f.stop)}});f=(function(){var j={},p,m=a(),k=function(q){return q},l=k,o=k;j.start=function(){p||n()};j.stop=function(){p&&clearTimeout(p);p=b};function n(){var r=a(),q=o(m);if(r!==m){l(m=r,q);$(e).trigger(c)}else{if(q!==m){location.href=location.href.replace(/#.*/,"")+q}}p=setTimeout(n,$.fn[c].delay)}$.browser.msie&&!d&&(function(){var q,r;j.start=function(){if(!q){r=$.fn[c].src;r=r&&r+a();q=$(' @@ -102,154 +98,463 @@ $(document).ready(function(){initNavTree('mimalloc-doc_8h_source.html','');});
      mimalloc-doc.h
      -
      1 /* ----------------------------------------------------------------------------
      2 Copyright (c) 2018, Microsoft Research, Daan Leijen
      3 This is free software; you can redistribute it and/or modify it under the
      4 terms of the MIT license. A copy of the license can be found in the file
      5 "LICENSE" at the root of this distribution.
      6 -----------------------------------------------------------------------------*/
      7 
      8 #error "documentation file only!"
      9 
      10 
      91 
      95 
      99 void mi_free(void* p);
      100 
      105 void* mi_malloc(size_t size);
      106 
      111 void* mi_zalloc(size_t size);
      112 
      122 void* mi_calloc(size_t count, size_t size);
      123 
      136 void* mi_realloc(void* p, size_t newsize);
      137 
      148 void* mi_recalloc(void* p, size_t count, size_t size);
      149 
      163 void* mi_expand(void* p, size_t newsize);
      164 
      174 void* mi_mallocn(size_t count, size_t size);
      175 
      185 void* mi_reallocn(void* p, size_t count, size_t size);
      186 
      203 void* mi_reallocf(void* p, size_t newsize);
      204 
      205 
      214 char* mi_strdup(const char* s);
      215 
      225 char* mi_strndup(const char* s, size_t n);
      226 
      239 char* mi_realpath(const char* fname, char* resolved_name);
      240 
      242 
      243 // ------------------------------------------------------
      244 // Extended functionality
      245 // ------------------------------------------------------
      246 
      250 
      253 #define MI_SMALL_SIZE_MAX (128*sizeof(void*))
      254 
      262 void* mi_malloc_small(size_t size);
      263 
      271 void* mi_zalloc_small(size_t size);
      272 
      287 size_t mi_usable_size(void* p);
      288 
      298 size_t mi_good_size(size_t size);
      299 
      307 void mi_collect(bool force);
      308 
      313 void mi_stats_print(void* out);
      314 
      320 void mi_stats_print_out(mi_output_fun* out, void* arg);
      321 
      323 void mi_stats_reset(void);
      324 
      326 void mi_stats_merge(void);
      327 
      331 void mi_thread_init(void);
      332 
      337 void mi_thread_done(void);
      338 
      344 void mi_thread_stats_print_out(mi_output_fun* out, void* arg);
      345 
      352 typedef void (mi_deferred_free_fun)(bool force, unsigned long long heartbeat, void* arg);
      353 
      369 void mi_register_deferred_free(mi_deferred_free_fun* deferred_free, void* arg);
      370 
      376 typedef void (mi_output_fun)(const char* msg, void* arg);
      377 
      384 void mi_register_output(mi_output_fun* out, void* arg);
      385 
      391 typedef void (mi_error_fun)(int err, void* arg);
      392 
      408 void mi_register_error(mi_error_fun* errfun, void* arg);
      409 
      414 bool mi_is_in_heap_region(const void* p);
      415 
      416 
      429 int mi_reserve_huge_os_pages_interleave(size_t pages, size_t numa_nodes, size_t timeout_msecs);
      430 
      443 int mi_reserve_huge_os_pages_at(size_t pages, int numa_node, size_t timeout_msecs);
      444 
      445 
      450 bool mi_is_redirected();
      451 
      465 void mi_process_info(size_t* elapsed_msecs, size_t* user_msecs, size_t* system_msecs, size_t* current_rss, size_t* peak_rss, size_t* current_commit, size_t* peak_commit, size_t* page_faults);
      466 
      468 
      469 // ------------------------------------------------------
      470 // Aligned allocation
      471 // ------------------------------------------------------
      472 
      478 
      491 void* mi_malloc_aligned(size_t size, size_t alignment);
      492 void* mi_zalloc_aligned(size_t size, size_t alignment);
      493 void* mi_calloc_aligned(size_t count, size_t size, size_t alignment);
      494 void* mi_realloc_aligned(void* p, size_t newsize, size_t alignment);
      495 
      506 void* mi_malloc_aligned_at(size_t size, size_t alignment, size_t offset);
      507 void* mi_zalloc_aligned_at(size_t size, size_t alignment, size_t offset);
      508 void* mi_calloc_aligned_at(size_t count, size_t size, size_t alignment, size_t offset);
      509 void* mi_realloc_aligned_at(void* p, size_t newsize, size_t alignment, size_t offset);
      510 
      512 
      518 
      523 struct mi_heap_s;
      524 
      529 typedef struct mi_heap_s mi_heap_t;
      530 
      532 mi_heap_t* mi_heap_new();
      533 
      541 void mi_heap_delete(mi_heap_t* heap);
      542 
      550 void mi_heap_destroy(mi_heap_t* heap);
      551 
      555 mi_heap_t* mi_heap_set_default(mi_heap_t* heap);
      556 
      559 mi_heap_t* mi_heap_get_default();
      560 
      566 mi_heap_t* mi_heap_get_backing();
      567 
      569 void mi_heap_collect(mi_heap_t* heap, bool force);
      570 
      573 void* mi_heap_malloc(mi_heap_t* heap, size_t size);
      574 
      578 void* mi_heap_malloc_small(mi_heap_t* heap, size_t size);
      579 
      582 void* mi_heap_zalloc(mi_heap_t* heap, size_t size);
      583 
      586 void* mi_heap_calloc(mi_heap_t* heap, size_t count, size_t size);
      587 
      590 void* mi_heap_mallocn(mi_heap_t* heap, size_t count, size_t size);
      591 
      594 char* mi_heap_strdup(mi_heap_t* heap, const char* s);
      595 
      598 char* mi_heap_strndup(mi_heap_t* heap, const char* s, size_t n);
      599 
      602 char* mi_heap_realpath(mi_heap_t* heap, const char* fname, char* resolved_name);
      603 
      604 void* mi_heap_realloc(mi_heap_t* heap, void* p, size_t newsize);
      605 void* mi_heap_reallocn(mi_heap_t* heap, void* p, size_t count, size_t size);
      606 void* mi_heap_reallocf(mi_heap_t* heap, void* p, size_t newsize);
      607 
      608 void* mi_heap_malloc_aligned(mi_heap_t* heap, size_t size, size_t alignment);
      609 void* mi_heap_malloc_aligned_at(mi_heap_t* heap, size_t size, size_t alignment, size_t offset);
      610 void* mi_heap_zalloc_aligned(mi_heap_t* heap, size_t size, size_t alignment);
      611 void* mi_heap_zalloc_aligned_at(mi_heap_t* heap, size_t size, size_t alignment, size_t offset);
      612 void* mi_heap_calloc_aligned(mi_heap_t* heap, size_t count, size_t size, size_t alignment);
      613 void* mi_heap_calloc_aligned_at(mi_heap_t* heap, size_t count, size_t size, size_t alignment, size_t offset);
      614 void* mi_heap_realloc_aligned(mi_heap_t* heap, void* p, size_t newsize, size_t alignment);
      615 void* mi_heap_realloc_aligned_at(mi_heap_t* heap, void* p, size_t newsize, size_t alignment, size_t offset);
      616 
      618 
      619 
      628 
      629 void* mi_rezalloc(void* p, size_t newsize);
      630 void* mi_recalloc(void* p, size_t newcount, size_t size) ;
      631 
      632 void* mi_rezalloc_aligned(void* p, size_t newsize, size_t alignment);
      633 void* mi_rezalloc_aligned_at(void* p, size_t newsize, size_t alignment, size_t offset);
      634 void* mi_recalloc_aligned(void* p, size_t newcount, size_t size, size_t alignment);
      635 void* mi_recalloc_aligned_at(void* p, size_t newcount, size_t size, size_t alignment, size_t offset);
      636 
      637 void* mi_heap_rezalloc(mi_heap_t* heap, void* p, size_t newsize);
      638 void* mi_heap_recalloc(mi_heap_t* heap, void* p, size_t newcount, size_t size);
      639 
      640 void* mi_heap_rezalloc_aligned(mi_heap_t* heap, void* p, size_t newsize, size_t alignment);
      641 void* mi_heap_rezalloc_aligned_at(mi_heap_t* heap, void* p, size_t newsize, size_t alignment, size_t offset);
      642 void* mi_heap_recalloc_aligned(mi_heap_t* heap, void* p, size_t newcount, size_t size, size_t alignment);
      643 void* mi_heap_recalloc_aligned_at(mi_heap_t* heap, void* p, size_t newcount, size_t size, size_t alignment, size_t offset);
      644 
      646 
      655 
      667 #define mi_malloc_tp(tp) ((tp*)mi_malloc(sizeof(tp)))
      668 
      670 #define mi_zalloc_tp(tp) ((tp*)mi_zalloc(sizeof(tp)))
      671 
      673 #define mi_calloc_tp(tp,count) ((tp*)mi_calloc(count,sizeof(tp)))
      674 
      676 #define mi_mallocn_tp(tp,count) ((tp*)mi_mallocn(count,sizeof(tp)))
      677 
      679 #define mi_reallocn_tp(p,tp,count) ((tp*)mi_reallocn(p,count,sizeof(tp)))
      680 
      682 #define mi_heap_malloc_tp(hp,tp) ((tp*)mi_heap_malloc(hp,sizeof(tp)))
      683 
      685 #define mi_heap_zalloc_tp(hp,tp) ((tp*)mi_heap_zalloc(hp,sizeof(tp)))
      686 
      688 #define mi_heap_calloc_tp(hp,tp,count) ((tp*)mi_heap_calloc(hp,count,sizeof(tp)))
      689 
      691 #define mi_heap_mallocn_tp(hp,tp,count) ((tp*)mi_heap_mallocn(hp,count,sizeof(tp)))
      692 
      694 #define mi_heap_reallocn_tp(hp,p,tp,count) ((tp*)mi_heap_reallocn(p,count,sizeof(tp)))
      695 
      697 #define mi_heap_recalloc_tp(hp,p,tp,count) ((tp*)mi_heap_recalloc(p,count,sizeof(tp)))
      698 
      700 
      706 
      713 bool mi_heap_contains_block(mi_heap_t* heap, const void* p);
      714 
      723 bool mi_heap_check_owned(mi_heap_t* heap, const void* p);
      724 
      732 bool mi_check_owned(const void* p);
      733 
      736 typedef struct mi_heap_area_s {
      737  void* blocks;
      738  size_t reserved;
      739  size_t committed;
      740  size_t used;
      741  size_t block_size;
      742 } mi_heap_area_t;
      743 
      751 typedef bool (mi_block_visit_fun)(const mi_heap_t* heap, const mi_heap_area_t* area, void* block, size_t block_size, void* arg);
      752 
      764 bool mi_heap_visit_blocks(const mi_heap_t* heap, bool visit_all_blocks, mi_block_visit_fun* visitor, void* arg);
      765 
      767 
      773 
      775 typedef enum mi_option_e {
      776  // stable options
      777  mi_option_show_errors,
      778  mi_option_show_stats,
      779  mi_option_verbose,
      780  // the following options are experimental
      781  mi_option_eager_commit,
      782  mi_option_eager_region_commit,
      783  mi_option_large_os_pages,
      784  mi_option_reserve_huge_os_pages,
      785  mi_option_segment_cache,
      786  mi_option_page_reset,
      787  mi_option_segment_reset,
      788  mi_option_reset_delay,
      789  mi_option_use_numa_nodes,
      790  mi_option_reset_decommits,
      791  mi_option_eager_commit_delay,
      792  mi_option_os_tag,
      793  _mi_option_last
      794 } mi_option_t;
      795 
      796 
      797 bool mi_option_is_enabled(mi_option_t option);
      798 void mi_option_enable(mi_option_t option);
      799 void mi_option_disable(mi_option_t option);
      800 void mi_option_set_enabled(mi_option_t option, bool enable);
      801 void mi_option_set_enabled_default(mi_option_t option, bool enable);
      802 
      803 long mi_option_get(mi_option_t option);
      804 void mi_option_set(mi_option_t option, long value);
      805 void mi_option_set_default(mi_option_t option, long value);
      806 
      807 
      809 
      816 
      817 void* mi_recalloc(void* p, size_t count, size_t size);
      818 size_t mi_malloc_size(const void* p);
      819 size_t mi_malloc_usable_size(const void *p);
      820 
      822 void mi_cfree(void* p);
      823 
      824 int mi_posix_memalign(void** p, size_t alignment, size_t size);
      825 int mi__posix_memalign(void** p, size_t alignment, size_t size);
      826 void* mi_memalign(size_t alignment, size_t size);
      827 void* mi_valloc(size_t size);
      828 
      829 void* mi_pvalloc(size_t size);
      830 void* mi_aligned_alloc(size_t alignment, size_t size);
      831 void* mi_reallocarray(void* p, size_t count, size_t size);
      832 
      833 void mi_free_size(void* p, size_t size);
      834 void mi_free_size_aligned(void* p, size_t size, size_t alignment);
      835 void mi_free_aligned(void* p, size_t alignment);
      836 
      838 
      851 
      853 void* mi_new(std::size_t n) noexcept(false);
      854 
      856 void* mi_new_n(size_t count, size_t size) noexcept(false);
      857 
      859 void* mi_new_aligned(std::size_t n, std::align_val_t alignment) noexcept(false);
      860 
      862 void* mi_new_nothrow(size_t n);
      863 
      865 void* mi_new_aligned_nothrow(size_t n, size_t alignment);
      866 
      868 void* mi_new_realloc(void* p, size_t newsize);
      869 
      871 void* mi_new_reallocn(void* p, size_t newcount, size_t size);
      872 
      880 template<class T> struct mi_stl_allocator { }
      881 
      883 
      mi_usable_size
      size_t mi_usable_size(void *p)
      Return the available bytes in a memory block.
      -
      mi_new_nothrow
      void * mi_new_nothrow(size_t n)
      like mi_malloc, but when out of memory, use std::get_new_handler but return NULL on failure.
      -
      mi_reallocn
      void * mi_reallocn(void *p, size_t count, size_t size)
      Re-allocate memory to count elements of size bytes.
      -
      mi_malloc_aligned
      void * mi_malloc_aligned(size_t size, size_t alignment)
      Allocate size bytes aligned by alignment.
      -
      mi_recalloc_aligned_at
      void * mi_recalloc_aligned_at(void *p, size_t newcount, size_t size, size_t alignment, size_t offset)
      -
      mi_stats_reset
      void mi_stats_reset(void)
      Reset statistics.
      -
      mi_heap_realloc_aligned
      void * mi_heap_realloc_aligned(mi_heap_t *heap, void *p, size_t newsize, size_t alignment)
      -
      mi_option_is_enabled
      bool mi_option_is_enabled(mi_option_t option)
      -
      mi_new_realloc
      void * mi_new_realloc(void *p, size_t newsize)
      like mi_realloc(), but when out of memory, use std::get_new_handler and raise std::bad_alloc exceptio...
      -
      mi_recalloc
      void * mi_recalloc(void *p, size_t count, size_t size)
      Re-allocate memory to count elements of size bytes, with extra memory initialized to zero.
      -
      mi_mallocn
      void * mi_mallocn(size_t count, size_t size)
      Allocate count elements of size bytes.
      -
      mi_malloc_size
      size_t mi_malloc_size(const void *p)
      -
      mi_option_set_enabled
      void mi_option_set_enabled(mi_option_t option, bool enable)
      -
      mi_posix_memalign
      int mi_posix_memalign(void **p, size_t alignment, size_t size)
      -
      mi_stats_merge
      void mi_stats_merge(void)
      Merge thread local statistics with the main statistics and reset.
      -
      mi_new_n
      void * mi_new_n(size_t count, size_t size) noexcept(false)
      like mi_mallocn(), but when out of memory, use std::get_new_handler and raise std::bad_alloc exceptio...
      -
      mi_option_set_default
      void mi_option_set_default(mi_option_t option, long value)
      -
      mi_stats_print_out
      void mi_stats_print_out(mi_output_fun *out, void *arg)
      Print the main statistics.
      -
      mi_error_fun
      void() mi_error_fun(int err, void *arg)
      Type of error callback functions.
      Definition: mimalloc-doc.h:391
      -
      mi_rezalloc
      void * mi_rezalloc(void *p, size_t newsize)
      -
      mi_option_eager_commit
      Eagerly commit segments (4MiB) (enabled by default).
      Definition: mimalloc-doc.h:781
      -
      mi_heap_zalloc
      void * mi_heap_zalloc(mi_heap_t *heap, size_t size)
      Allocate zero-initialized in a specific heap.
      -
      mi_option_set
      void mi_option_set(mi_option_t option, long value)
      -
      mi_option_eager_region_commit
      Eagerly commit large (256MiB) memory regions (enabled by default, except on Windows)
      Definition: mimalloc-doc.h:782
      -
      mi_cfree
      void mi_cfree(void *p)
      Just as free but also checks if the pointer p belongs to our heap.
      -
      mi_recalloc_aligned
      void * mi_recalloc_aligned(void *p, size_t newcount, size_t size, size_t alignment)
      -
      _mi_option_last
      Definition: mimalloc-doc.h:793
      -
      mi_realloc_aligned_at
      void * mi_realloc_aligned_at(void *p, size_t newsize, size_t alignment, size_t offset)
      -
      mi_heap_area_t::blocks
      void * blocks
      start of the area containing heap blocks
      Definition: mimalloc-doc.h:737
      -
      mi_realloc_aligned
      void * mi_realloc_aligned(void *p, size_t newsize, size_t alignment)
      -
      mi_option_enable
      void mi_option_enable(mi_option_t option)
      -
      mi__posix_memalign
      int mi__posix_memalign(void **p, size_t alignment, size_t size)
      -
      mi_free
      void mi_free(void *p)
      Free previously allocated memory.
      -
      mi_heap_strdup
      char * mi_heap_strdup(mi_heap_t *heap, const char *s)
      Duplicate a string in a specific heap.
      -
      mi_heap_realpath
      char * mi_heap_realpath(mi_heap_t *heap, const char *fname, char *resolved_name)
      Resolve a file path name using a specific heap to allocate the result.
      -
      mi_heap_calloc_aligned_at
      void * mi_heap_calloc_aligned_at(mi_heap_t *heap, size_t count, size_t size, size_t alignment, size_t offset)
      -
      mi_process_info
      void mi_process_info(size_t *elapsed_msecs, size_t *user_msecs, size_t *system_msecs, size_t *current_rss, size_t *peak_rss, size_t *current_commit, size_t *peak_commit, size_t *page_faults)
      Return process information (time and memory usage).
      -
      mi_calloc_aligned
      void * mi_calloc_aligned(size_t count, size_t size, size_t alignment)
      -
      mi_heap_zalloc_aligned
      void * mi_heap_zalloc_aligned(mi_heap_t *heap, size_t size, size_t alignment)
      -
      mi_zalloc_small
      void * mi_zalloc_small(size_t size)
      Allocate a zero initialized small object.
      -
      mi_strndup
      char * mi_strndup(const char *s, size_t n)
      Allocate and duplicate a string up to n bytes.
      -
      mi_expand
      void * mi_expand(void *p, size_t newsize)
      Try to re-allocate memory to newsize bytes in place.
      -
      mi_pvalloc
      void * mi_pvalloc(size_t size)
      -
      mi_option_set_enabled_default
      void mi_option_set_enabled_default(mi_option_t option, bool enable)
      -
      mi_heap_rezalloc_aligned_at
      void * mi_heap_rezalloc_aligned_at(mi_heap_t *heap, void *p, size_t newsize, size_t alignment, size_t offset)
      -
      mi_zalloc
      void * mi_zalloc(size_t size)
      Allocate zero-initialized size bytes.
      -
      mi_heap_rezalloc
      void * mi_heap_rezalloc(mi_heap_t *heap, void *p, size_t newsize)
      -
      mi_option_segment_cache
      The number of segments per thread to keep cached.
      Definition: mimalloc-doc.h:785
      -
      mi_heap_calloc
      void * mi_heap_calloc(mi_heap_t *heap, size_t count, size_t size)
      Allocate count zero-initialized elements in a specific heap.
      -
      mi_heap_calloc_aligned
      void * mi_heap_calloc_aligned(mi_heap_t *heap, size_t count, size_t size, size_t alignment)
      -
      mi_is_redirected
      bool mi_is_redirected()
      Is the C runtime malloc API redirected?
      -
      mi_heap_area_t::block_size
      size_t block_size
      size in bytes of one block
      Definition: mimalloc-doc.h:741
      -
      mi_reallocarray
      void * mi_reallocarray(void *p, size_t count, size_t size)
      -
      mi_reserve_huge_os_pages_interleave
      int mi_reserve_huge_os_pages_interleave(size_t pages, size_t numa_nodes, size_t timeout_msecs)
      Reserve pages of huge OS pages (1GiB) evenly divided over numa_nodes nodes, but stops after at most t...
      -
      mi_deferred_free_fun
      void() mi_deferred_free_fun(bool force, unsigned long long heartbeat, void *arg)
      Type of deferred free functions.
      Definition: mimalloc-doc.h:352
      -
      mi_is_in_heap_region
      bool mi_is_in_heap_region(const void *p)
      Is a pointer part of our heap?
      -
      mi_new_aligned
      void * mi_new_aligned(std::size_t n, std::align_val_t alignment) noexcept(false)
      like mi_malloc_aligned(), but when out of memory, use std::get_new_handler and raise std::bad_alloc e...
      -
      mi_realloc
      void * mi_realloc(void *p, size_t newsize)
      Re-allocate memory to newsize bytes.
      -
      mi_option_reserve_huge_os_pages
      The number of huge OS pages (1GiB in size) to reserve at the start of the program.
      Definition: mimalloc-doc.h:784
      -
      mi_heap_reallocf
      void * mi_heap_reallocf(mi_heap_t *heap, void *p, size_t newsize)
      -
      mi_free_size_aligned
      void mi_free_size_aligned(void *p, size_t size, size_t alignment)
      -
      mi_rezalloc_aligned_at
      void * mi_rezalloc_aligned_at(void *p, size_t newsize, size_t alignment, size_t offset)
      -
      mi_option_page_reset
      Reset page memory after mi_option_reset_delay milliseconds when it becomes free.
      Definition: mimalloc-doc.h:786
      -
      mi_thread_done
      void mi_thread_done(void)
      Uninitialize mimalloc on a thread.
      -
      mi_heap_visit_blocks
      bool mi_heap_visit_blocks(const mi_heap_t *heap, bool visit_all_blocks, mi_block_visit_fun *visitor, void *arg)
      Visit all areas and blocks in a heap.
      -
      mi_option_use_numa_nodes
      Pretend there are at most N NUMA nodes.
      Definition: mimalloc-doc.h:789
      -
      mi_malloc
      void * mi_malloc(size_t size)
      Allocate size bytes.
      -
      mi_register_error
      void mi_register_error(mi_error_fun *errfun, void *arg)
      Register an error callback function.
      -
      mi_option_reset_decommits
      Experimental.
      Definition: mimalloc-doc.h:790
      -
      mi_heap_strndup
      char * mi_heap_strndup(mi_heap_t *heap, const char *s, size_t n)
      Duplicate a string of at most length n in a specific heap.
      -
      mi_block_visit_fun
      bool() mi_block_visit_fun(const mi_heap_t *heap, const mi_heap_area_t *area, void *block, size_t block_size, void *arg)
      Visitor function passed to mi_heap_visit_blocks()
      Definition: mimalloc-doc.h:751
      -
      mi_heap_recalloc
      void * mi_heap_recalloc(mi_heap_t *heap, void *p, size_t newcount, size_t size)
      -
      mi_heap_malloc_aligned_at
      void * mi_heap_malloc_aligned_at(mi_heap_t *heap, size_t size, size_t alignment, size_t offset)
      -
      mi_realpath
      char * mi_realpath(const char *fname, char *resolved_name)
      Resolve a file path name.
      -
      mi_option_show_errors
      Print error messages to stderr.
      Definition: mimalloc-doc.h:777
      -
      mi_option_segment_reset
      Experimental.
      Definition: mimalloc-doc.h:787
      -
      mi_heap_rezalloc_aligned
      void * mi_heap_rezalloc_aligned(mi_heap_t *heap, void *p, size_t newsize, size_t alignment)
      -
      mi_new_aligned_nothrow
      void * mi_new_aligned_nothrow(size_t n, size_t alignment)
      like mi_malloc_aligned, but when out of memory, use std::get_new_handler but return NULL on failure.
      -
      mi_memalign
      void * mi_memalign(size_t alignment, size_t size)
      -
      mi_rezalloc_aligned
      void * mi_rezalloc_aligned(void *p, size_t newsize, size_t alignment)
      -
      mi_heap_contains_block
      bool mi_heap_contains_block(mi_heap_t *heap, const void *p)
      Does a heap contain a pointer to a previously allocated block?
      -
      mi_heap_collect
      void mi_heap_collect(mi_heap_t *heap, bool force)
      Release outstanding resources in a specific heap.
      -
      mi_heap_recalloc_aligned_at
      void * mi_heap_recalloc_aligned_at(mi_heap_t *heap, void *p, size_t newcount, size_t size, size_t alignment, size_t offset)
      -
      mi_option_verbose
      Print verbose messages to stderr.
      Definition: mimalloc-doc.h:779
      -
      mi_zalloc_aligned_at
      void * mi_zalloc_aligned_at(size_t size, size_t alignment, size_t offset)
      -
      mi_malloc_aligned_at
      void * mi_malloc_aligned_at(size_t size, size_t alignment, size_t offset)
      Allocate size bytes aligned by alignment at a specified offset.
      -
      mi_heap_delete
      void mi_heap_delete(mi_heap_t *heap)
      Delete a previously allocated heap.
      -
      mi_option_os_tag
      OS tag to assign to mimalloc'd memory.
      Definition: mimalloc-doc.h:792
      -
      mi_heap_get_default
      mi_heap_t * mi_heap_get_default()
      Get the default heap that is used for mi_malloc() et al.
      -
      mi_reserve_huge_os_pages_at
      int mi_reserve_huge_os_pages_at(size_t pages, int numa_node, size_t timeout_msecs)
      Reserve pages of huge OS pages (1GiB) at a specific numa_node, but stops after at most timeout_msecs ...
      -
      mi_option_disable
      void mi_option_disable(mi_option_t option)
      -
      mi_aligned_alloc
      void * mi_aligned_alloc(size_t alignment, size_t size)
      -
      mi_valloc
      void * mi_valloc(size_t size)
      -
      mi_thread_init
      void mi_thread_init(void)
      Initialize mimalloc on a thread.
      -
      mi_good_size
      size_t mi_good_size(size_t size)
      Return the used allocation size.
      -
      mi_stats_print
      void mi_stats_print(void *out)
      Deprecated.
      -
      mi_option_eager_commit_delay
      Experimental.
      Definition: mimalloc-doc.h:791
      -
      mi_heap_recalloc_aligned
      void * mi_heap_recalloc_aligned(mi_heap_t *heap, void *p, size_t newcount, size_t size, size_t alignment)
      -
      mi_heap_mallocn
      void * mi_heap_mallocn(mi_heap_t *heap, size_t count, size_t size)
      Allocate count elements in a specific heap.
      -
      mi_heap_area_t
      An area of heap space contains blocks of a single size.
      Definition: mimalloc-doc.h:736
      -
      mi_thread_stats_print_out
      void mi_thread_stats_print_out(mi_output_fun *out, void *arg)
      Print out heap statistics for this thread.
      -
      mi_option_show_stats
      Print statistics to stderr when the program is done.
      Definition: mimalloc-doc.h:778
      -
      mi_zalloc_aligned
      void * mi_zalloc_aligned(size_t size, size_t alignment)
      -
      mi_heap_area_t::reserved
      size_t reserved
      bytes reserved for this area
      Definition: mimalloc-doc.h:738
      -
      mi_heap_t
      struct mi_heap_s mi_heap_t
      Type of first-class heaps.
      Definition: mimalloc-doc.h:529
      -
      mi_heap_area_t::used
      size_t used
      bytes in use by allocated blocks
      Definition: mimalloc-doc.h:740
      -
      mi_register_deferred_free
      void mi_register_deferred_free(mi_deferred_free_fun *deferred_free, void *arg)
      Register a deferred free function.
      -
      mi_free_size
      void mi_free_size(void *p, size_t size)
      -
      mi_collect
      void mi_collect(bool force)
      Eagerly free memory.
      -
      mi_new_reallocn
      void * mi_new_reallocn(void *p, size_t newcount, size_t size)
      like mi_reallocn(), but when out of memory, use std::get_new_handler and raise std::bad_alloc excepti...
      -
      mi_heap_destroy
      void mi_heap_destroy(mi_heap_t *heap)
      Destroy a heap, freeing all its still allocated blocks.
      -
      mi_calloc_aligned_at
      void * mi_calloc_aligned_at(size_t count, size_t size, size_t alignment, size_t offset)
      -
      mi_option_large_os_pages
      Use large OS pages (2MiB in size) if possible.
      Definition: mimalloc-doc.h:783
      -
      mi_heap_reallocn
      void * mi_heap_reallocn(mi_heap_t *heap, void *p, size_t count, size_t size)
      -
      mi_register_output
      void mi_register_output(mi_output_fun *out, void *arg)
      Register an output function.
      -
      mi_stl_allocator
      std::allocator implementation for mimalloc for use in STL containers.
      Definition: mimalloc-doc.h:880
      -
      mi_heap_malloc_small
      void * mi_heap_malloc_small(mi_heap_t *heap, size_t size)
      Allocate a small object in a specific heap.
      -
      mi_heap_realloc
      void * mi_heap_realloc(mi_heap_t *heap, void *p, size_t newsize)
      -
      mi_malloc_usable_size
      size_t mi_malloc_usable_size(const void *p)
      -
      mi_output_fun
      void() mi_output_fun(const char *msg, void *arg)
      Type of output functions.
      Definition: mimalloc-doc.h:376
      -
      mi_strdup
      char * mi_strdup(const char *s)
      Allocate and duplicate a string.
      -
      mi_heap_realloc_aligned_at
      void * mi_heap_realloc_aligned_at(mi_heap_t *heap, void *p, size_t newsize, size_t alignment, size_t offset)
      -
      mi_reallocf
      void * mi_reallocf(void *p, size_t newsize)
      Re-allocate memory to newsize bytes,.
      -
      mi_calloc
      void * mi_calloc(size_t count, size_t size)
      Allocate zero-initialized count elements of size bytes.
      -
      mi_heap_zalloc_aligned_at
      void * mi_heap_zalloc_aligned_at(mi_heap_t *heap, size_t size, size_t alignment, size_t offset)
      -
      mi_malloc_small
      void * mi_malloc_small(size_t size)
      Allocate a small object.
      -
      mi_check_owned
      bool mi_check_owned(const void *p)
      Check safely if any pointer is part of the default heap of this thread.
      -
      mi_heap_malloc_aligned
      void * mi_heap_malloc_aligned(mi_heap_t *heap, size_t size, size_t alignment)
      -
      mi_option_get
      long mi_option_get(mi_option_t option)
      -
      mi_heap_get_backing
      mi_heap_t * mi_heap_get_backing()
      Get the backing heap.
      -
      mi_free_aligned
      void mi_free_aligned(void *p, size_t alignment)
      -
      mi_new
      void * mi_new(std::size_t n) noexcept(false)
      like mi_malloc(), but when out of memory, use std::get_new_handler and raise std::bad_alloc exception...
      -
      mi_option_reset_delay
      Delay in milli-seconds before resetting a page (100ms by default)
      Definition: mimalloc-doc.h:788
      -
      mi_heap_new
      mi_heap_t * mi_heap_new()
      Create a new heap that can be used for allocation.
      -
      mi_heap_malloc
      void * mi_heap_malloc(mi_heap_t *heap, size_t size)
      Allocate in a specific heap.
      -
      mi_heap_area_t::committed
      size_t committed
      current committed bytes of this area
      Definition: mimalloc-doc.h:739
      -
      mi_option_t
      mi_option_t
      Runtime options.
      Definition: mimalloc-doc.h:775
      -
      mi_heap_check_owned
      bool mi_heap_check_owned(mi_heap_t *heap, const void *p)
      Check safely if any pointer is part of a heap.
      -
      mi_heap_set_default
      mi_heap_t * mi_heap_set_default(mi_heap_t *heap)
      Set the default heap to use for mi_malloc() et al.
      +
      1 /* ----------------------------------------------------------------------------
      +
      2 Copyright (c) 2018-2021, Microsoft Research, Daan Leijen
      +
      3 This is free software; you can redistribute it and/or modify it under the
      +
      4 terms of the MIT license. A copy of the license can be found in the file
      +
      5 "LICENSE" at the root of this distribution.
      +
      6 -----------------------------------------------------------------------------*/
      +
      7 
      +
      8 #error "documentation file only!"
      +
      9 
      +
      10 
      +
      94 
      +
      95 
      +
      99 void mi_free(void* p);
      +
      100 
      +
      105 void* mi_malloc(size_t size);
      +
      106 
      +
      111 void* mi_zalloc(size_t size);
      +
      112 
      +
      122 void* mi_calloc(size_t count, size_t size);
      +
      123 
      +
      136 void* mi_realloc(void* p, size_t newsize);
      +
      137 
      +
      148 void* mi_recalloc(void* p, size_t count, size_t size);
      +
      149 
      +
      163 void* mi_expand(void* p, size_t newsize);
      +
      164 
      +
      174 void* mi_mallocn(size_t count, size_t size);
      +
      175 
      +
      185 void* mi_reallocn(void* p, size_t count, size_t size);
      +
      186 
      +
      203 void* mi_reallocf(void* p, size_t newsize);
      +
      204 
      +
      205 
      +
      214 char* mi_strdup(const char* s);
      +
      215 
      +
      225 char* mi_strndup(const char* s, size_t n);
      +
      226 
      +
      239 char* mi_realpath(const char* fname, char* resolved_name);
      +
      240 
      +
      242 
      +
      243 // ------------------------------------------------------
      +
      244 // Extended functionality
      +
      245 // ------------------------------------------------------
      +
      246 
      +
      250 
      +
      253 #define MI_SMALL_SIZE_MAX (128*sizeof(void*))
      +
      254 
      +
      262 void* mi_malloc_small(size_t size);
      +
      263 
      +
      271 void* mi_zalloc_small(size_t size);
      +
      272 
      +
      287 size_t mi_usable_size(void* p);
      +
      288 
      +
      298 size_t mi_good_size(size_t size);
      +
      299 
      +
      307 void mi_collect(bool force);
      +
      308 
      +
      313 void mi_stats_print(void* out);
      +
      314 
      +
      320 void mi_stats_print_out(mi_output_fun* out, void* arg);
      +
      321 
      +
      323 void mi_stats_reset(void);
      +
      324 
      +
      326 void mi_stats_merge(void);
      +
      327 
      +
      331 void mi_thread_init(void);
      +
      332 
      +
      337 void mi_thread_done(void);
      +
      338 
      +
      344 void mi_thread_stats_print_out(mi_output_fun* out, void* arg);
      +
      345 
      +
      352 typedef void (mi_deferred_free_fun)(bool force, unsigned long long heartbeat, void* arg);
      +
      353 
      +
      369 void mi_register_deferred_free(mi_deferred_free_fun* deferred_free, void* arg);
      +
      370 
      +
      376 typedef void (mi_output_fun)(const char* msg, void* arg);
      +
      377 
      +
      384 void mi_register_output(mi_output_fun* out, void* arg);
      +
      385 
      +
      391 typedef void (mi_error_fun)(int err, void* arg);
      +
      392 
      +
      408 void mi_register_error(mi_error_fun* errfun, void* arg);
      +
      409 
      +
      414 bool mi_is_in_heap_region(const void* p);
      +
      415 
      +
      424 int mi_reserve_os_memory(size_t size, bool commit, bool allow_large);
      +
      425 
      +
      437 bool mi_manage_os_memory(void* start, size_t size, bool is_committed, bool is_large, bool is_zero, int numa_node);
      +
      438 
      +
      451 int mi_reserve_huge_os_pages_interleave(size_t pages, size_t numa_nodes, size_t timeout_msecs);
      +
      452 
      +
      465 int mi_reserve_huge_os_pages_at(size_t pages, int numa_node, size_t timeout_msecs);
      +
      466 
      +
      467 
      +
      472 bool mi_is_redirected();
      +
      473 
      +
      487 void mi_process_info(size_t* elapsed_msecs, size_t* user_msecs, size_t* system_msecs, size_t* current_rss, size_t* peak_rss, size_t* current_commit, size_t* peak_commit, size_t* page_faults);
      +
      488 
      +
      490 
      +
      491 // ------------------------------------------------------
      +
      492 // Aligned allocation
      +
      493 // ------------------------------------------------------
      +
      494 
      +
      500 
      +
      502 #define MI_ALIGNMENT_MAX (1024*1024UL)
      +
      503 
      +
      516 void* mi_malloc_aligned(size_t size, size_t alignment);
      +
      517 void* mi_zalloc_aligned(size_t size, size_t alignment);
      +
      518 void* mi_calloc_aligned(size_t count, size_t size, size_t alignment);
      +
      519 void* mi_realloc_aligned(void* p, size_t newsize, size_t alignment);
      +
      520 
      +
      531 void* mi_malloc_aligned_at(size_t size, size_t alignment, size_t offset);
      +
      532 void* mi_zalloc_aligned_at(size_t size, size_t alignment, size_t offset);
      +
      533 void* mi_calloc_aligned_at(size_t count, size_t size, size_t alignment, size_t offset);
      +
      534 void* mi_realloc_aligned_at(void* p, size_t newsize, size_t alignment, size_t offset);
      +
      535 
      +
      537 
      +
      543 
      +
      548 struct mi_heap_s;
      +
      549 
      +
      554 typedef struct mi_heap_s mi_heap_t;
      +
      555 
      +
      557 mi_heap_t* mi_heap_new();
      +
      558 
      +
      566 void mi_heap_delete(mi_heap_t* heap);
      +
      567 
      +
      575 void mi_heap_destroy(mi_heap_t* heap);
      +
      576 
      +
      580 mi_heap_t* mi_heap_set_default(mi_heap_t* heap);
      +
      581 
      +
      584 mi_heap_t* mi_heap_get_default();
      +
      585 
      +
      591 mi_heap_t* mi_heap_get_backing();
      +
      592 
      +
      594 void mi_heap_collect(mi_heap_t* heap, bool force);
      +
      595 
      +
      598 void* mi_heap_malloc(mi_heap_t* heap, size_t size);
      +
      599 
      +
      603 void* mi_heap_malloc_small(mi_heap_t* heap, size_t size);
      +
      604 
      +
      607 void* mi_heap_zalloc(mi_heap_t* heap, size_t size);
      +
      608 
      +
      611 void* mi_heap_calloc(mi_heap_t* heap, size_t count, size_t size);
      +
      612 
      +
      615 void* mi_heap_mallocn(mi_heap_t* heap, size_t count, size_t size);
      +
      616 
      +
      619 char* mi_heap_strdup(mi_heap_t* heap, const char* s);
      +
      620 
      +
      623 char* mi_heap_strndup(mi_heap_t* heap, const char* s, size_t n);
      +
      624 
      +
      627 char* mi_heap_realpath(mi_heap_t* heap, const char* fname, char* resolved_name);
      +
      628 
      +
      629 void* mi_heap_realloc(mi_heap_t* heap, void* p, size_t newsize);
      +
      630 void* mi_heap_reallocn(mi_heap_t* heap, void* p, size_t count, size_t size);
      +
      631 void* mi_heap_reallocf(mi_heap_t* heap, void* p, size_t newsize);
      +
      632 
      +
      633 void* mi_heap_malloc_aligned(mi_heap_t* heap, size_t size, size_t alignment);
      +
      634 void* mi_heap_malloc_aligned_at(mi_heap_t* heap, size_t size, size_t alignment, size_t offset);
      +
      635 void* mi_heap_zalloc_aligned(mi_heap_t* heap, size_t size, size_t alignment);
      +
      636 void* mi_heap_zalloc_aligned_at(mi_heap_t* heap, size_t size, size_t alignment, size_t offset);
      +
      637 void* mi_heap_calloc_aligned(mi_heap_t* heap, size_t count, size_t size, size_t alignment);
      +
      638 void* mi_heap_calloc_aligned_at(mi_heap_t* heap, size_t count, size_t size, size_t alignment, size_t offset);
      +
      639 void* mi_heap_realloc_aligned(mi_heap_t* heap, void* p, size_t newsize, size_t alignment);
      +
      640 void* mi_heap_realloc_aligned_at(mi_heap_t* heap, void* p, size_t newsize, size_t alignment, size_t offset);
      +
      641 
      +
      643 
      +
      644 
      +
      653 
      +
      654 void* mi_rezalloc(void* p, size_t newsize);
      +
      655 void* mi_recalloc(void* p, size_t newcount, size_t size) ;
      +
      656 
      +
      657 void* mi_rezalloc_aligned(void* p, size_t newsize, size_t alignment);
      +
      658 void* mi_rezalloc_aligned_at(void* p, size_t newsize, size_t alignment, size_t offset);
      +
      659 void* mi_recalloc_aligned(void* p, size_t newcount, size_t size, size_t alignment);
      +
      660 void* mi_recalloc_aligned_at(void* p, size_t newcount, size_t size, size_t alignment, size_t offset);
      +
      661 
      +
      662 void* mi_heap_rezalloc(mi_heap_t* heap, void* p, size_t newsize);
      +
      663 void* mi_heap_recalloc(mi_heap_t* heap, void* p, size_t newcount, size_t size);
      +
      664 
      +
      665 void* mi_heap_rezalloc_aligned(mi_heap_t* heap, void* p, size_t newsize, size_t alignment);
      +
      666 void* mi_heap_rezalloc_aligned_at(mi_heap_t* heap, void* p, size_t newsize, size_t alignment, size_t offset);
      +
      667 void* mi_heap_recalloc_aligned(mi_heap_t* heap, void* p, size_t newcount, size_t size, size_t alignment);
      +
      668 void* mi_heap_recalloc_aligned_at(mi_heap_t* heap, void* p, size_t newcount, size_t size, size_t alignment, size_t offset);
      +
      669 
      +
      671 
      +
      680 
      +
      692 #define mi_malloc_tp(tp) ((tp*)mi_malloc(sizeof(tp)))
      +
      693 
      +
      695 #define mi_zalloc_tp(tp) ((tp*)mi_zalloc(sizeof(tp)))
      +
      696 
      +
      698 #define mi_calloc_tp(tp,count) ((tp*)mi_calloc(count,sizeof(tp)))
      +
      699 
      +
      701 #define mi_mallocn_tp(tp,count) ((tp*)mi_mallocn(count,sizeof(tp)))
      +
      702 
      +
      704 #define mi_reallocn_tp(p,tp,count) ((tp*)mi_reallocn(p,count,sizeof(tp)))
      +
      705 
      +
      707 #define mi_heap_malloc_tp(hp,tp) ((tp*)mi_heap_malloc(hp,sizeof(tp)))
      +
      708 
      +
      710 #define mi_heap_zalloc_tp(hp,tp) ((tp*)mi_heap_zalloc(hp,sizeof(tp)))
      +
      711 
      +
      713 #define mi_heap_calloc_tp(hp,tp,count) ((tp*)mi_heap_calloc(hp,count,sizeof(tp)))
      +
      714 
      +
      716 #define mi_heap_mallocn_tp(hp,tp,count) ((tp*)mi_heap_mallocn(hp,count,sizeof(tp)))
      +
      717 
      +
      719 #define mi_heap_reallocn_tp(hp,p,tp,count) ((tp*)mi_heap_reallocn(p,count,sizeof(tp)))
      +
      720 
      +
      722 #define mi_heap_recalloc_tp(hp,p,tp,count) ((tp*)mi_heap_recalloc(p,count,sizeof(tp)))
      +
      723 
      +
      725 
      +
      731 
      +
      738 bool mi_heap_contains_block(mi_heap_t* heap, const void* p);
      +
      739 
      +
      748 bool mi_heap_check_owned(mi_heap_t* heap, const void* p);
      +
      749 
      +
      757 bool mi_check_owned(const void* p);
      +
      758 
      +
      761 typedef struct mi_heap_area_s {
      +
      762  void* blocks;
      +
      763  size_t reserved;
      +
      764  size_t committed;
      +
      765  size_t used;
      +
      766  size_t block_size;
      +
      767 } mi_heap_area_t;
      +
      768 
      +
      776 typedef bool (mi_block_visit_fun)(const mi_heap_t* heap, const mi_heap_area_t* area, void* block, size_t block_size, void* arg);
      +
      777 
      +
      789 bool mi_heap_visit_blocks(const mi_heap_t* heap, bool visit_all_blocks, mi_block_visit_fun* visitor, void* arg);
      +
      790 
      +
      792 
      +
      798 
      +
      800 typedef enum mi_option_e {
      +
      801  // stable options
      +
      802  mi_option_show_errors,
      +
      803  mi_option_show_stats,
      +
      804  mi_option_verbose,
      +
      805  // the following options are experimental
      +
      806  mi_option_eager_commit,
      +
      807  mi_option_eager_region_commit,
      +
      808  mi_option_large_os_pages,
      +
      809  mi_option_reserve_huge_os_pages,
      +
      810  mi_option_reserve_huge_os_pages_at,
      +
      811  mi_option_segment_cache,
      +
      812  mi_option_page_reset,
      +
      813  mi_option_segment_reset,
      +
      814  mi_option_reset_delay,
      +
      815  mi_option_use_numa_nodes,
      +
      816  mi_option_reset_decommits,
      +
      817  mi_option_eager_commit_delay,
      +
      818  mi_option_os_tag,
      +
      819  _mi_option_last
      +
      820 } mi_option_t;
      +
      821 
      +
      822 
      +
      823 bool mi_option_is_enabled(mi_option_t option);
      +
      824 void mi_option_enable(mi_option_t option);
      +
      825 void mi_option_disable(mi_option_t option);
      +
      826 void mi_option_set_enabled(mi_option_t option, bool enable);
      +
      827 void mi_option_set_enabled_default(mi_option_t option, bool enable);
      +
      828 
      +
      829 long mi_option_get(mi_option_t option);
      +
      830 void mi_option_set(mi_option_t option, long value);
      +
      831 void mi_option_set_default(mi_option_t option, long value);
      +
      832 
      +
      833 
      +
      835 
      +
      842 
      +
      843 void* mi_recalloc(void* p, size_t count, size_t size);
      +
      844 size_t mi_malloc_size(const void* p);
      +
      845 size_t mi_malloc_usable_size(const void *p);
      +
      846 
      +
      848 void mi_cfree(void* p);
      +
      849 
      +
      850 int mi_posix_memalign(void** p, size_t alignment, size_t size);
      +
      851 int mi__posix_memalign(void** p, size_t alignment, size_t size);
      +
      852 void* mi_memalign(size_t alignment, size_t size);
      +
      853 void* mi_valloc(size_t size);
      +
      854 
      +
      855 void* mi_pvalloc(size_t size);
      +
      856 void* mi_aligned_alloc(size_t alignment, size_t size);
      +
      857 
      +
      860 void* mi_reallocarray(void* p, size_t count, size_t size);
      +
      861 
      +
      863 int mi_reallocarr(void* p, size_t count, size_t size);
      +
      864 
      +
      865 void mi_free_size(void* p, size_t size);
      +
      866 void mi_free_size_aligned(void* p, size_t size, size_t alignment);
      +
      867 void mi_free_aligned(void* p, size_t alignment);
      +
      868 
      +
      870 
      +
      883 
      +
      885 void* mi_new(std::size_t n) noexcept(false);
      +
      886 
      +
      888 void* mi_new_n(size_t count, size_t size) noexcept(false);
      +
      889 
      +
      891 void* mi_new_aligned(std::size_t n, std::align_val_t alignment) noexcept(false);
      +
      892 
      +
      894 void* mi_new_nothrow(size_t n);
      +
      895 
      +
      897 void* mi_new_aligned_nothrow(size_t n, size_t alignment);
      +
      898 
      +
      900 void* mi_new_realloc(void* p, size_t newsize);
      +
      901 
      +
      903 void* mi_new_reallocn(void* p, size_t newcount, size_t size);
      +
      904 
      +
      912 template<class T> struct mi_stl_allocator { }
      +
      913 
      +
      915 
      +
      mi_calloc_aligned_at
      void * mi_calloc_aligned_at(size_t count, size_t size, size_t alignment, size_t offset)
      +
      mi_zalloc_aligned
      void * mi_zalloc_aligned(size_t size, size_t alignment)
      +
      mi_realloc_aligned
      void * mi_realloc_aligned(void *p, size_t newsize, size_t alignment)
      +
      mi_calloc_aligned
      void * mi_calloc_aligned(size_t count, size_t size, size_t alignment)
      +
      mi_malloc_aligned_at
      void * mi_malloc_aligned_at(size_t size, size_t alignment, size_t offset)
      Allocate size bytes aligned by alignment at a specified offset.
      +
      mi_zalloc_aligned_at
      void * mi_zalloc_aligned_at(size_t size, size_t alignment, size_t offset)
      +
      mi_malloc_aligned
      void * mi_malloc_aligned(size_t size, size_t alignment)
      Allocate size bytes aligned by alignment.
      +
      mi_realloc_aligned_at
      void * mi_realloc_aligned_at(void *p, size_t newsize, size_t alignment, size_t offset)
      +
      mi_heap_area_t::block_size
      size_t block_size
      size in bytes of one block
      Definition: mimalloc-doc.h:766
      +
      mi_heap_area_t::committed
      size_t committed
      current committed bytes of this area
      Definition: mimalloc-doc.h:764
      +
      mi_heap_area_t::used
      size_t used
      bytes in use by allocated blocks
      Definition: mimalloc-doc.h:765
      +
      mi_heap_area_t::blocks
      void * blocks
      start of the area containing heap blocks
      Definition: mimalloc-doc.h:762
      +
      mi_heap_area_t::reserved
      size_t reserved
      bytes reserved for this area
      Definition: mimalloc-doc.h:763
      +
      mi_heap_check_owned
      bool mi_heap_check_owned(mi_heap_t *heap, const void *p)
      Check safely if any pointer is part of a heap.
      +
      mi_check_owned
      bool mi_check_owned(const void *p)
      Check safely if any pointer is part of the default heap of this thread.
      +
      mi_heap_visit_blocks
      bool mi_heap_visit_blocks(const mi_heap_t *heap, bool visit_all_blocks, mi_block_visit_fun *visitor, void *arg)
      Visit all areas and blocks in a heap.
      +
      mi_heap_contains_block
      bool mi_heap_contains_block(mi_heap_t *heap, const void *p)
      Does a heap contain a pointer to a previously allocated block?
      +
      mi_block_visit_fun
      bool() mi_block_visit_fun(const mi_heap_t *heap, const mi_heap_area_t *area, void *block, size_t block_size, void *arg)
      Visitor function passed to mi_heap_visit_blocks()
      Definition: mimalloc-doc.h:776
      +
      mi_heap_area_t
      An area of heap space contains blocks of a single size.
      Definition: mimalloc-doc.h:761
      +
      mi_new_reallocn
      void * mi_new_reallocn(void *p, size_t newcount, size_t size)
      like mi_reallocn(), but when out of memory, use std::get_new_handler and raise std::bad_alloc excepti...
      +
      mi_new_realloc
      void * mi_new_realloc(void *p, size_t newsize)
      like mi_realloc(), but when out of memory, use std::get_new_handler and raise std::bad_alloc exceptio...
      +
      mi_new
      void * mi_new(std::size_t n) noexcept(false)
      like mi_malloc(), but when out of memory, use std::get_new_handler and raise std::bad_alloc exception...
      +
      mi_new_aligned_nothrow
      void * mi_new_aligned_nothrow(size_t n, size_t alignment)
      like mi_malloc_aligned, but when out of memory, use std::get_new_handler but return NULL on failure.
      +
      mi_new_n
      void * mi_new_n(size_t count, size_t size) noexcept(false)
      like mi_mallocn(), but when out of memory, use std::get_new_handler and raise std::bad_alloc exceptio...
      +
      mi_new_nothrow
      void * mi_new_nothrow(size_t n)
      like mi_malloc, but when out of memory, use std::get_new_handler but return NULL on failure.
      +
      mi_new_aligned
      void * mi_new_aligned(std::size_t n, std::align_val_t alignment) noexcept(false)
      like mi_malloc_aligned(), but when out of memory, use std::get_new_handler and raise std::bad_alloc e...
      +
      mi_stl_allocator
      std::allocator implementation for mimalloc for use in STL containers.
      Definition: mimalloc-doc.h:912
      +
      mi_reserve_os_memory
      int mi_reserve_os_memory(size_t size, bool commit, bool allow_large)
      Reserve OS memory for use by mimalloc.
      +
      mi_usable_size
      size_t mi_usable_size(void *p)
      Return the available bytes in a memory block.
      +
      mi_thread_done
      void mi_thread_done(void)
      Uninitialize mimalloc on a thread.
      +
      mi_zalloc_small
      void * mi_zalloc_small(size_t size)
      Allocate a zero initialized small object.
      +
      mi_error_fun
      void() mi_error_fun(int err, void *arg)
      Type of error callback functions.
      Definition: mimalloc-doc.h:391
      +
      mi_deferred_free_fun
      void() mi_deferred_free_fun(bool force, unsigned long long heartbeat, void *arg)
      Type of deferred free functions.
      Definition: mimalloc-doc.h:352
      +
      mi_stats_print
      void mi_stats_print(void *out)
      Deprecated.
      +
      mi_reserve_huge_os_pages_interleave
      int mi_reserve_huge_os_pages_interleave(size_t pages, size_t numa_nodes, size_t timeout_msecs)
      Reserve pages of huge OS pages (1GiB) evenly divided over numa_nodes nodes, but stops after at most t...
      +
      mi_register_deferred_free
      void mi_register_deferred_free(mi_deferred_free_fun *deferred_free, void *arg)
      Register a deferred free function.
      +
      mi_stats_reset
      void mi_stats_reset(void)
      Reset statistics.
      +
      mi_collect
      void mi_collect(bool force)
      Eagerly free memory.
      +
      mi_manage_os_memory
      bool mi_manage_os_memory(void *start, size_t size, bool is_committed, bool is_large, bool is_zero, int numa_node)
      Manage a particular memory area for use by mimalloc.
      +
      mi_stats_print_out
      void mi_stats_print_out(mi_output_fun *out, void *arg)
      Print the main statistics.
      +
      mi_is_in_heap_region
      bool mi_is_in_heap_region(const void *p)
      Is a pointer part of our heap?
      +
      mi_malloc_small
      void * mi_malloc_small(size_t size)
      Allocate a small object.
      +
      mi_reserve_huge_os_pages_at
      int mi_reserve_huge_os_pages_at(size_t pages, int numa_node, size_t timeout_msecs)
      Reserve pages of huge OS pages (1GiB) at a specific numa_node, but stops after at most timeout_msecs ...
      +
      mi_process_info
      void mi_process_info(size_t *elapsed_msecs, size_t *user_msecs, size_t *system_msecs, size_t *current_rss, size_t *peak_rss, size_t *current_commit, size_t *peak_commit, size_t *page_faults)
      Return process information (time and memory usage).
      +
      mi_stats_merge
      void mi_stats_merge(void)
      Merge thread local statistics with the main statistics and reset.
      +
      mi_register_error
      void mi_register_error(mi_error_fun *errfun, void *arg)
      Register an error callback function.
      +
      mi_is_redirected
      bool mi_is_redirected()
      Is the C runtime malloc API redirected?
      +
      mi_thread_stats_print_out
      void mi_thread_stats_print_out(mi_output_fun *out, void *arg)
      Print out heap statistics for this thread.
      +
      mi_good_size
      size_t mi_good_size(size_t size)
      Return the used allocation size.
      +
      mi_output_fun
      void() mi_output_fun(const char *msg, void *arg)
      Type of output functions.
      Definition: mimalloc-doc.h:376
      +
      mi_register_output
      void mi_register_output(mi_output_fun *out, void *arg)
      Register an output function.
      +
      mi_thread_init
      void mi_thread_init(void)
      Initialize mimalloc on a thread.
      +
      mi_heap_realpath
      char * mi_heap_realpath(mi_heap_t *heap, const char *fname, char *resolved_name)
      Resolve a file path name using a specific heap to allocate the result.
      +
      mi_heap_calloc_aligned_at
      void * mi_heap_calloc_aligned_at(mi_heap_t *heap, size_t count, size_t size, size_t alignment, size_t offset)
      +
      mi_heap_strdup
      char * mi_heap_strdup(mi_heap_t *heap, const char *s)
      Duplicate a string in a specific heap.
      +
      mi_heap_malloc_aligned_at
      void * mi_heap_malloc_aligned_at(mi_heap_t *heap, size_t size, size_t alignment, size_t offset)
      +
      mi_heap_delete
      void mi_heap_delete(mi_heap_t *heap)
      Delete a previously allocated heap.
      +
      mi_heap_t
      struct mi_heap_s mi_heap_t
      Type of first-class heaps.
      Definition: mimalloc-doc.h:554
      +
      mi_heap_zalloc_aligned_at
      void * mi_heap_zalloc_aligned_at(mi_heap_t *heap, size_t size, size_t alignment, size_t offset)
      +
      mi_heap_reallocf
      void * mi_heap_reallocf(mi_heap_t *heap, void *p, size_t newsize)
      +
      mi_heap_calloc_aligned
      void * mi_heap_calloc_aligned(mi_heap_t *heap, size_t count, size_t size, size_t alignment)
      +
      mi_heap_get_backing
      mi_heap_t * mi_heap_get_backing()
      Get the backing heap.
      +
      mi_heap_new
      mi_heap_t * mi_heap_new()
      Create a new heap that can be used for allocation.
      +
      mi_heap_collect
      void mi_heap_collect(mi_heap_t *heap, bool force)
      Release outstanding resources in a specific heap.
      +
      mi_heap_mallocn
      void * mi_heap_mallocn(mi_heap_t *heap, size_t count, size_t size)
      Allocate count elements in a specific heap.
      +
      mi_heap_get_default
      mi_heap_t * mi_heap_get_default()
      Get the default heap that is used for mi_malloc() et al.
      +
      mi_heap_strndup
      char * mi_heap_strndup(mi_heap_t *heap, const char *s, size_t n)
      Duplicate a string of at most length n in a specific heap.
      +
      mi_heap_zalloc
      void * mi_heap_zalloc(mi_heap_t *heap, size_t size)
      Allocate zero-initialized in a specific heap.
      +
      mi_heap_malloc
      void * mi_heap_malloc(mi_heap_t *heap, size_t size)
      Allocate in a specific heap.
      +
      mi_heap_destroy
      void mi_heap_destroy(mi_heap_t *heap)
      Destroy a heap, freeing all its still allocated blocks.
      +
      mi_heap_malloc_small
      void * mi_heap_malloc_small(mi_heap_t *heap, size_t size)
      Allocate a small object in a specific heap.
      +
      mi_heap_zalloc_aligned
      void * mi_heap_zalloc_aligned(mi_heap_t *heap, size_t size, size_t alignment)
      +
      mi_heap_calloc
      void * mi_heap_calloc(mi_heap_t *heap, size_t count, size_t size)
      Allocate count zero-initialized elements in a specific heap.
      +
      mi_heap_realloc
      void * mi_heap_realloc(mi_heap_t *heap, void *p, size_t newsize)
      +
      mi_heap_malloc_aligned
      void * mi_heap_malloc_aligned(mi_heap_t *heap, size_t size, size_t alignment)
      +
      mi_heap_set_default
      mi_heap_t * mi_heap_set_default(mi_heap_t *heap)
      Set the default heap to use for mi_malloc() et al.
      +
      mi_heap_reallocn
      void * mi_heap_reallocn(mi_heap_t *heap, void *p, size_t count, size_t size)
      +
      mi_heap_realloc_aligned_at
      void * mi_heap_realloc_aligned_at(mi_heap_t *heap, void *p, size_t newsize, size_t alignment, size_t offset)
      +
      mi_heap_realloc_aligned
      void * mi_heap_realloc_aligned(mi_heap_t *heap, void *p, size_t newsize, size_t alignment)
      +
      mi_realpath
      char * mi_realpath(const char *fname, char *resolved_name)
      Resolve a file path name.
      +
      mi_mallocn
      void * mi_mallocn(size_t count, size_t size)
      Allocate count elements of size bytes.
      +
      mi_recalloc
      void * mi_recalloc(void *p, size_t count, size_t size)
      Re-allocate memory to count elements of size bytes, with extra memory initialized to zero.
      +
      mi_malloc
      void * mi_malloc(size_t size)
      Allocate size bytes.
      +
      mi_reallocn
      void * mi_reallocn(void *p, size_t count, size_t size)
      Re-allocate memory to count elements of size bytes.
      +
      mi_calloc
      void * mi_calloc(size_t count, size_t size)
      Allocate zero-initialized count elements of size bytes.
      +
      mi_strndup
      char * mi_strndup(const char *s, size_t n)
      Allocate and duplicate a string up to n bytes.
      +
      mi_expand
      void * mi_expand(void *p, size_t newsize)
      Try to re-allocate memory to newsize bytes in place.
      +
      mi_strdup
      char * mi_strdup(const char *s)
      Allocate and duplicate a string.
      +
      mi_realloc
      void * mi_realloc(void *p, size_t newsize)
      Re-allocate memory to newsize bytes.
      +
      mi_free
      void mi_free(void *p)
      Free previously allocated memory.
      +
      mi_zalloc
      void * mi_zalloc(size_t size)
      Allocate zero-initialized size bytes.
      +
      mi_reallocf
      void * mi_reallocf(void *p, size_t newsize)
      Re-allocate memory to newsize bytes,.
      +
      mi_option_enable
      void mi_option_enable(mi_option_t option)
      +
      mi_option_is_enabled
      bool mi_option_is_enabled(mi_option_t option)
      +
      mi_option_set_enabled_default
      void mi_option_set_enabled_default(mi_option_t option, bool enable)
      +
      mi_option_get
      long mi_option_get(mi_option_t option)
      +
      mi_option_set_default
      void mi_option_set_default(mi_option_t option, long value)
      +
      mi_option_set_enabled
      void mi_option_set_enabled(mi_option_t option, bool enable)
      +
      mi_option_disable
      void mi_option_disable(mi_option_t option)
      +
      mi_option_set
      void mi_option_set(mi_option_t option, long value)
      +
      mi_option_t
      mi_option_t
      Runtime options.
      Definition: mimalloc-doc.h:800
      +
      mi_option_show_stats
      @ mi_option_show_stats
      Print statistics to stderr when the program is done.
      Definition: mimalloc-doc.h:803
      +
      mi_option_use_numa_nodes
      @ mi_option_use_numa_nodes
      Pretend there are at most N NUMA nodes.
      Definition: mimalloc-doc.h:815
      +
      mi_option_reset_delay
      @ mi_option_reset_delay
      Delay in milli-seconds before resetting a page (100ms by default)
      Definition: mimalloc-doc.h:814
      +
      mi_option_eager_commit_delay
      @ mi_option_eager_commit_delay
      Experimental.
      Definition: mimalloc-doc.h:817
      +
      mi_option_eager_commit
      @ mi_option_eager_commit
      Eagerly commit segments (4MiB) (enabled by default).
      Definition: mimalloc-doc.h:806
      +
      mi_option_segment_cache
      @ mi_option_segment_cache
      The number of segments per thread to keep cached.
      Definition: mimalloc-doc.h:811
      +
      mi_option_eager_region_commit
      @ mi_option_eager_region_commit
      Eagerly commit large (256MiB) memory regions (enabled by default, except on Windows)
      Definition: mimalloc-doc.h:807
      +
      mi_option_large_os_pages
      @ mi_option_large_os_pages
      Use large OS pages (2MiB in size) if possible.
      Definition: mimalloc-doc.h:808
      +
      mi_option_os_tag
      @ mi_option_os_tag
      OS tag to assign to mimalloc'd memory.
      Definition: mimalloc-doc.h:818
      +
      _mi_option_last
      @ _mi_option_last
      Definition: mimalloc-doc.h:819
      +
      mi_option_verbose
      @ mi_option_verbose
      Print verbose messages to stderr.
      Definition: mimalloc-doc.h:804
      +
      mi_option_reserve_huge_os_pages_at
      @ mi_option_reserve_huge_os_pages_at
      Reserve huge OS pages at node N.
      Definition: mimalloc-doc.h:810
      +
      mi_option_reset_decommits
      @ mi_option_reset_decommits
      Experimental.
      Definition: mimalloc-doc.h:816
      +
      mi_option_reserve_huge_os_pages
      @ mi_option_reserve_huge_os_pages
      The number of huge OS pages (1GiB in size) to reserve at the start of the program.
      Definition: mimalloc-doc.h:809
      +
      mi_option_page_reset
      @ mi_option_page_reset
      Reset page memory after mi_option_reset_delay milliseconds when it becomes free.
      Definition: mimalloc-doc.h:812
      +
      mi_option_segment_reset
      @ mi_option_segment_reset
      Experimental.
      Definition: mimalloc-doc.h:813
      +
      mi_option_show_errors
      @ mi_option_show_errors
      Print error messages to stderr.
      Definition: mimalloc-doc.h:802
      +
      mi_malloc_usable_size
      size_t mi_malloc_usable_size(const void *p)
      +
      mi_free_aligned
      void mi_free_aligned(void *p, size_t alignment)
      +
      mi_aligned_alloc
      void * mi_aligned_alloc(size_t alignment, size_t size)
      +
      mi_malloc_size
      size_t mi_malloc_size(const void *p)
      +
      mi_reallocarray
      void * mi_reallocarray(void *p, size_t count, size_t size)
      Correspond s to reallocarray in FreeBSD.
      +
      mi_cfree
      void mi_cfree(void *p)
      Just as free but also checks if the pointer p belongs to our heap.
      +
      mi_free_size_aligned
      void mi_free_size_aligned(void *p, size_t size, size_t alignment)
      +
      mi_valloc
      void * mi_valloc(size_t size)
      +
      mi_reallocarr
      int mi_reallocarr(void *p, size_t count, size_t size)
      Corresponds to reallocarr in NetBSD.
      +
      mi_memalign
      void * mi_memalign(size_t alignment, size_t size)
      +
      mi_posix_memalign
      int mi_posix_memalign(void **p, size_t alignment, size_t size)
      +
      mi__posix_memalign
      int mi__posix_memalign(void **p, size_t alignment, size_t size)
      +
      mi_free_size
      void mi_free_size(void *p, size_t size)
      +
      mi_pvalloc
      void * mi_pvalloc(size_t size)
      +
      mi_heap_rezalloc_aligned
      void * mi_heap_rezalloc_aligned(mi_heap_t *heap, void *p, size_t newsize, size_t alignment)
      +
      mi_recalloc_aligned
      void * mi_recalloc_aligned(void *p, size_t newcount, size_t size, size_t alignment)
      +
      mi_heap_recalloc_aligned_at
      void * mi_heap_recalloc_aligned_at(mi_heap_t *heap, void *p, size_t newcount, size_t size, size_t alignment, size_t offset)
      +
      mi_recalloc_aligned_at
      void * mi_recalloc_aligned_at(void *p, size_t newcount, size_t size, size_t alignment, size_t offset)
      +
      mi_heap_recalloc
      void * mi_heap_recalloc(mi_heap_t *heap, void *p, size_t newcount, size_t size)
      +
      mi_rezalloc
      void * mi_rezalloc(void *p, size_t newsize)
      +
      mi_heap_recalloc_aligned
      void * mi_heap_recalloc_aligned(mi_heap_t *heap, void *p, size_t newcount, size_t size, size_t alignment)
      +
      mi_heap_rezalloc_aligned_at
      void * mi_heap_rezalloc_aligned_at(mi_heap_t *heap, void *p, size_t newsize, size_t alignment, size_t offset)
      +
      mi_rezalloc_aligned
      void * mi_rezalloc_aligned(void *p, size_t newsize, size_t alignment)
      +
      mi_heap_rezalloc
      void * mi_heap_rezalloc(mi_heap_t *heap, void *p, size_t newsize)
      +
      mi_rezalloc_aligned_at
      void * mi_rezalloc_aligned_at(void *p, size_t newsize, size_t alignment, size_t offset)
      diff --git a/docs/modules.html b/docs/modules.html index 9858d6a..0129057 100644 --- a/docs/modules.html +++ b/docs/modules.html @@ -3,7 +3,7 @@ - + mi-malloc: Modules @@ -13,10 +13,6 @@ - @@ -37,21 +33,21 @@       @@ -60,10 +56,10 @@
      mi-malloc -  1.6 +  1.7/2.0
      - - +
      - +
      @@ -73,13 +69,13 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search');
    -
    @@ -92,7 +88,7 @@ $(document).ready(function(){initNavTree('modules.html','');});
    -
    @@ -121,9 +117,7 @@ $(document).ready(function(){initNavTree('modules.html','');}); diff --git a/docs/navtree.css b/docs/navtree.css index 046366c..a270571 100644 --- a/docs/navtree.css +++ b/docs/navtree.css @@ -67,7 +67,7 @@ #nav-tree { padding: 0px 0px; - background-color: #FAFAFF; + background-color: #FAFAFF; font-size:14px; overflow:auto; } @@ -143,4 +143,3 @@ #nav-tree { display: none; } div.ui-resizable-handle { display: none; position: relative; } } - diff --git a/docs/navtree.js b/docs/navtree.js index 7ce2935..1e272d3 100644 --- a/docs/navtree.js +++ b/docs/navtree.js @@ -1,25 +1,26 @@ /* - @licstart The following is the entire license notice for the - JavaScript code in this file. + @licstart The following is the entire license notice for the JavaScript code in this file. - Copyright (C) 1997-2017 by Dimitri van Heesch + The MIT License (MIT) - This program is free software; you can redistribute it and/or modify - it under the terms of the GNU General Public License as published by - the Free Software Foundation; either version 2 of the License, or - (at your option) any later version. + Copyright (C) 1997-2020 by Dimitri van Heesch - This program is distributed in the hope that it will be useful, - but WITHOUT ANY WARRANTY; without even the implied warranty of - MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - GNU General Public License for more details. + Permission is hereby granted, free of charge, to any person obtaining a copy of this software + and associated documentation files (the "Software"), to deal in the Software without restriction, + including without limitation the rights to use, copy, modify, merge, publish, distribute, + sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is + furnished to do so, subject to the following conditions: - You should have received a copy of the GNU General Public License along - with this program; if not, write to the Free Software Foundation, Inc., - 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. + The above copyright notice and this permission notice shall be included in all copies or + substantial portions of the Software. - @licend The above is the entire license notice - for the JavaScript code in this file + THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING + BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND + NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, + DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, + OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. + + @licend The above is the entire license notice for the JavaScript code in this file */ var navTreeSubIndices = new Array(); var arrowDown = '▼'; @@ -70,7 +71,6 @@ function localStorageSupported() } } - function storeLink(link) { if (!$("#nav-sync").hasClass('sync') && localStorageSupported()) { @@ -102,14 +102,6 @@ function getScript(scriptName,func,show) script.type = 'text/javascript'; script.onload = func; script.src = scriptName+'.js'; - if ($.browser.msie && $.browser.version<=8) { - // script.onload does not work with older versions of IE - script.onreadystatechange = function() { - if (script.readyState=='complete' || script.readyState=='loaded') { - func(); if (show) showRoot(); - } - } - } head.appendChild(script); } @@ -153,6 +145,7 @@ function gotoAnchor(anchor,aname,updateLocation) var pos, docContent = $('#doc-content'); var ancParent = $(anchor.parent()); if (ancParent.hasClass('memItemLeft') || + ancParent.hasClass('memtitle') || ancParent.hasClass('fieldname') || ancParent.hasClass('fieldtype') || ancParent.is(':header')) @@ -265,7 +258,7 @@ function showRoot() (function (){ // retry until we can scroll to the selected item try { var navtree=$('#nav-tree'); - navtree.scrollTo('#selected',0,{offset:-windowHeight/2}); + navtree.scrollTo('#selected',100,{offset:-windowHeight/2}); } catch (err) { setTimeout(arguments.callee, 0); } @@ -284,12 +277,8 @@ function expandNode(o, node, imm, showRoot) } else { if (!node.childrenVisited) { getNode(o, node); - } if (imm || ($.browser.msie && $.browser.version>8)) { - // somehow slideDown jumps to the start of tree for IE9 :-( - $(node.getChildrenUL()).show(); - } else { - $(node.getChildrenUL()).slideDown("fast"); } + $(node.getChildrenUL()).slideDown("fast"); node.plus_img.innerHTML = arrowDown; node.expanded = true; } @@ -319,7 +308,6 @@ function highlightAnchor() } else { glowEffect(anchor.next(),1000); // normal member } - gotoAnchor(anchor,aname,false); } function selectAndHighlight(hash,n) @@ -481,6 +469,18 @@ function toggleSyncButton(relpath) } } +var loadTriggered = false; +var readyTriggered = false; +var loadObject,loadToRoot,loadUrl,loadRelPath; + +$(window).on('load',function(){ + if (readyTriggered) { // ready first + navTo(loadObject,loadToRoot,loadUrl,loadRelPath); + showRoot(); + } + loadTriggered=true; +}); + function initNavTree(toroot,relpath) { var o = new Object(); @@ -511,10 +511,16 @@ function initNavTree(toroot,relpath) navSync.click(function(){ toggleSyncButton(relpath); }); } - $(window).load(function(){ + if (loadTriggered) { // load before ready navTo(o,toroot,hashUrl(),relpath); showRoot(); - }); + } else { // ready before load + loadObject = o; + loadToRoot = toroot; + loadUrl = hashUrl(); + loadRelPath = relpath; + readyTriggered=true; + } $(window).bind('hashchange', function(){ if (window.location.hash && window.location.hash.length>1){ diff --git a/docs/navtreedata.js b/docs/navtreedata.js index e6dc7bc..8dd5a55 100644 --- a/docs/navtreedata.js +++ b/docs/navtreedata.js @@ -1,25 +1,26 @@ /* -@ @licstart The following is the entire license notice for the -JavaScript code in this file. + @licstart The following is the entire license notice for the JavaScript code in this file. -Copyright (C) 1997-2017 by Dimitri van Heesch + The MIT License (MIT) -This program is free software; you can redistribute it and/or modify -it under the terms of the GNU General Public License as published by -the Free Software Foundation; either version 2 of the License, or -(at your option) any later version. + Copyright (C) 1997-2020 by Dimitri van Heesch -This program is distributed in the hope that it will be useful, -but WITHOUT ANY WARRANTY; without even the implied warranty of - MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - GNU General Public License for more details. + Permission is hereby granted, free of charge, to any person obtaining a copy of this software + and associated documentation files (the "Software"), to deal in the Software without restriction, + including without limitation the rights to use, copy, modify, merge, publish, distribute, + sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is + furnished to do so, subject to the following conditions: -You should have received a copy of the GNU General Public License along -with this program; if not, write to the Free Software Foundation, Inc., -51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. + The above copyright notice and this permission notice shall be included in all copies or + substantial portions of the Software. -@licend The above is the entire license notice -for the JavaScript code in this file + THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING + BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND + NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, + DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, + OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. + + @licend The above is the entire license notice for the JavaScript code in this file */ var NAVTREE = [ diff --git a/docs/navtreeindex0.js b/docs/navtreeindex0.js index 4a1e93f..7218170 100644 --- a/docs/navtreeindex0.js +++ b/docs/navtreeindex0.js @@ -8,14 +8,15 @@ var NAVTREEINDEX0 = "functions.html":[6,2,0], "functions_vars.html":[6,2,1], "group__aligned.html":[5,2], -"group__aligned.html#ga08647c4593f3b2eef24a919a73eba3a3":[5,2,1], -"group__aligned.html#ga0cadbcf5b89a7b6fb171bc8df8734819":[5,2,6], -"group__aligned.html#ga4028d1cf4aa4c87c880747044a8322ae":[5,2,4], -"group__aligned.html#ga53dddb4724042a90315b94bc268fb4c9":[5,2,0], -"group__aligned.html#ga5850da130c936bd77db039dcfbc8295d":[5,2,3], -"group__aligned.html#ga5f8c2353766db522565e642fafd8a3f8":[5,2,7], -"group__aligned.html#ga68930196751fa2cca9e1fd0d71bade56":[5,2,2], -"group__aligned.html#gaf66a9ae6c6f08bd6be6fb6ea771faffb":[5,2,5], +"group__aligned.html#ga08647c4593f3b2eef24a919a73eba3a3":[5,2,2], +"group__aligned.html#ga0cadbcf5b89a7b6fb171bc8df8734819":[5,2,7], +"group__aligned.html#ga4028d1cf4aa4c87c880747044a8322ae":[5,2,5], +"group__aligned.html#ga53dddb4724042a90315b94bc268fb4c9":[5,2,1], +"group__aligned.html#ga5850da130c936bd77db039dcfbc8295d":[5,2,4], +"group__aligned.html#ga5f8c2353766db522565e642fafd8a3f8":[5,2,8], +"group__aligned.html#ga68930196751fa2cca9e1fd0d71bade56":[5,2,3], +"group__aligned.html#ga83c03016066b438f51a8095e9140be06":[5,2,0], +"group__aligned.html#gaf66a9ae6c6f08bd6be6fb6ea771faffb":[5,2,6], "group__analysis.html":[5,6], "group__analysis.html#a332a6c14d736a99699d5453a1cb04b41":[5,6,0,0], "group__analysis.html#ab47526df656d8837ec3e97f11b83f835":[5,6,0,2], @@ -38,30 +39,32 @@ var NAVTREEINDEX0 = "group__cpp.html#gaef2c2bdb4f70857902d3c8903ac095f3":[5,9,2], "group__cpp.html#structmi__stl__allocator":[5,9,0], "group__extended.html":[5,1], -"group__extended.html#ga089c859d9eddc5f9b4bd946cd53cebee":[5,1,22], -"group__extended.html#ga0ae4581e85453456a0d658b2b98bf7bf":[5,1,19], +"group__extended.html#ga00ec3324b6b2591c7fe3677baa30a767":[5,1,16], +"group__extended.html#ga089c859d9eddc5f9b4bd946cd53cebee":[5,1,24], +"group__extended.html#ga0ae4581e85453456a0d658b2b98bf7bf":[5,1,21], "group__extended.html#ga1ea64283508718d9d645c38efc2f4305":[5,1,0], -"group__extended.html#ga220f29f40a44404b0061c15bc1c31152":[5,1,23], +"group__extended.html#ga220f29f40a44404b0061c15bc1c31152":[5,1,25], "group__extended.html#ga251d369cda3f1c2a955c555486ed90e5":[5,1,2], "group__extended.html#ga299dae78d25ce112e384a98b7309c5be":[5,1,1], -"group__extended.html#ga2d126e5c62d3badc35445e5d84166df2":[5,1,16], -"group__extended.html#ga3132f521fb756fc0e8ec0b74fb58df50":[5,1,14], -"group__extended.html#ga3460a6ca91af97be4058f523d3cb8ece":[5,1,10], -"group__extended.html#ga3bb8468b8cfcc6e2a61d98aee85c5f99":[5,1,18], +"group__extended.html#ga2d126e5c62d3badc35445e5d84166df2":[5,1,18], +"group__extended.html#ga3132f521fb756fc0e8ec0b74fb58df50":[5,1,15], +"group__extended.html#ga3460a6ca91af97be4058f523d3cb8ece":[5,1,11], +"group__extended.html#ga3bb8468b8cfcc6e2a61d98aee85c5f99":[5,1,20], "group__extended.html#ga421430e2226d7d468529cec457396756":[5,1,4], -"group__extended.html#ga537f13b299ddf801e49a5a94fde02c79":[5,1,17], +"group__extended.html#ga4c6486a1fdcd7a423b5f25fe4be8e0cf":[5,1,9], +"group__extended.html#ga537f13b299ddf801e49a5a94fde02c79":[5,1,19], "group__extended.html#ga5f071b10d4df1c3658e04e7fd67a94e6":[5,1,6], "group__extended.html#ga7136c2e55cb22c98ecf95d08d6debb99":[5,1,8], -"group__extended.html#ga7795a13d20087447281858d2c771cca1":[5,1,13], -"group__extended.html#ga7d862c2affd5790381da14eb102a364d":[5,1,9], -"group__extended.html#ga854b1de8cb067c7316286c28b2fcd3d1":[5,1,15], -"group__extended.html#gaa1d55e0e894be240827e5d87ec3a1f45":[5,1,11], +"group__extended.html#ga7795a13d20087447281858d2c771cca1":[5,1,14], +"group__extended.html#ga7d862c2affd5790381da14eb102a364d":[5,1,10], +"group__extended.html#ga854b1de8cb067c7316286c28b2fcd3d1":[5,1,17], +"group__extended.html#gaa1d55e0e894be240827e5d87ec3a1f45":[5,1,12], "group__extended.html#gaad25050b19f30cd79397b227e0157a3f":[5,1,7], -"group__extended.html#gab1dac8476c46cb9eecab767eb40c1525":[5,1,21], +"group__extended.html#gab1dac8476c46cb9eecab767eb40c1525":[5,1,23], "group__extended.html#gac057927cd06c854b45fe7847e921bd47":[5,1,5], "group__extended.html#gad823d23444a4b77a40f66bf075a98a0c":[5,1,3], -"group__extended.html#gae5b17ff027cd2150b43a33040250cf3f":[5,1,12], -"group__extended.html#gaf8e73efc2cbca9ebfdfb166983a04c17":[5,1,20], +"group__extended.html#gae5b17ff027cd2150b43a33040250cf3f":[5,1,13], +"group__extended.html#gaf8e73efc2cbca9ebfdfb166983a04c17":[5,1,22], "group__heap.html":[5,3], "group__heap.html#ga00e95ba1e01acac3cfd95bb7a357a6f0":[5,3,20], "group__heap.html#ga08ca6419a5c057a4d965868998eef487":[5,3,3], @@ -115,30 +118,32 @@ var NAVTREEINDEX0 = "group__options.html#gaf84921c32375e25754dc2ee6a911fa60":[5,7,5], "group__options.html#gafebf7ed116adb38ae5218bc3ce06884c":[5,7,0], "group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca0957ef73b2550764b4840edf48422fda":[5,7,0,1], -"group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca0ac33a18f6b659fcfaf44efb0bab1b74":[5,7,0,11], -"group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca154fe170131d5212cff57e22b99523c5":[5,7,0,10], -"group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca17a190c25be381142d87e0468c4c068c":[5,7,0,13], +"group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca0ac33a18f6b659fcfaf44efb0bab1b74":[5,7,0,12], +"group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca154fe170131d5212cff57e22b99523c5":[5,7,0,11], +"group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca17a190c25be381142d87e0468c4c068c":[5,7,0,14], "group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca1e8de72c93da7ff22d91e1e27b52ac2b":[5,7,0,3], -"group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca2ecbe7ef32f5c84de3739aa4f0b805a1":[5,7,0,7], +"group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca2ecbe7ef32f5c84de3739aa4f0b805a1":[5,7,0,8], "group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca32ce97ece29f69e82579679cf8a307ad":[5,7,0,4], "group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca4192d491200d0055df0554d4cf65054e":[5,7,0,5], -"group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca4b74ae2a69e445de6c2361b73c1d14bf":[5,7,0,14], -"group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca5b4357b74be0d87568036c32eb1a2e4a":[5,7,0,15], +"group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca4b74ae2a69e445de6c2361b73c1d14bf":[5,7,0,15], +"group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca5b4357b74be0d87568036c32eb1a2e4a":[5,7,0,16], "group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca7c8b7bf5281c581bad64f5daa6442777":[5,7,0,2], -"group__options.html#ggafebf7ed116adb38ae5218bc3ce06884cac81ee965b130fa81238913a3c239d536":[5,7,0,12], +"group__options.html#ggafebf7ed116adb38ae5218bc3ce06884caa13e7926d4339d2aa6fbf61d4473fd5c":[5,7,0,7], +"group__options.html#ggafebf7ed116adb38ae5218bc3ce06884cac81ee965b130fa81238913a3c239d536":[5,7,0,13], "group__options.html#ggafebf7ed116adb38ae5218bc3ce06884caca7ed041be3b0b9d0b82432c7bf41af2":[5,7,0,6], -"group__options.html#ggafebf7ed116adb38ae5218bc3ce06884cada854dd272c66342f18a93ee254a2968":[5,7,0,8], -"group__options.html#ggafebf7ed116adb38ae5218bc3ce06884cafb121d30d87591850d5410ccc3a95c6d":[5,7,0,9], +"group__options.html#ggafebf7ed116adb38ae5218bc3ce06884cada854dd272c66342f18a93ee254a2968":[5,7,0,9], +"group__options.html#ggafebf7ed116adb38ae5218bc3ce06884cafb121d30d87591850d5410ccc3a95c6d":[5,7,0,10], "group__options.html#ggafebf7ed116adb38ae5218bc3ce06884cafbf4822e5c00732c5984b32a032837f0":[5,7,0,0], "group__posix.html":[5,8], "group__posix.html#ga06d07cf357bbac5c73ba5d0c0c421e17":[5,8,7], "group__posix.html#ga0d28d5cf61e6bfbb18c63092939fe5c9":[5,8,3], "group__posix.html#ga1326d2e4388630b5f81ca7206318b8e5":[5,8,1], "group__posix.html#ga4531c9e775bb3ae12db57c1ba8a5d7de":[5,8,6], -"group__posix.html#ga48fad8648a2f1dab9c87ea9448a52088":[5,8,11], +"group__posix.html#ga48fad8648a2f1dab9c87ea9448a52088":[5,8,12], "group__posix.html#ga705dc7a64bffacfeeb0141501a5c35d7":[5,8,2], "group__posix.html#ga72e9d7ffb5fe94d69bc722c8506e27bc":[5,8,5], -"group__posix.html#ga73baaf5951f5165ba0763d0c06b6a93b":[5,8,12], +"group__posix.html#ga73baaf5951f5165ba0763d0c06b6a93b":[5,8,13], +"group__posix.html#ga7e1934d60a3e697950eeb48e042bfad5":[5,8,11], "group__posix.html#gaab7fa71ea93b96873f5d9883db57d40e":[5,8,8], "group__posix.html#gacff84f226ba9feb2031b8992e5579447":[5,8,9], "group__posix.html#gad5a69c8fea96aa2b7a7c818c2130090a":[5,8,0], diff --git a/docs/overrides.html b/docs/overrides.html index 2a6c51e..9c249a3 100644 --- a/docs/overrides.html +++ b/docs/overrides.html @@ -3,7 +3,7 @@ - + mi-malloc: Overriding Malloc @@ -13,10 +13,6 @@ - @@ -37,21 +33,21 @@ Logo
    mi-malloc -  1.6 +  1.7/2.0
    - - +
    @@ -60,10 +56,10 @@
    - + @@ -73,13 +69,13 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); -
    @@ -92,7 +88,7 @@ $(document).ready(function(){initNavTree('overrides.html','');});
    -
    @@ -110,7 +106,9 @@ $(document).ready(function(){initNavTree('overrides.html','');});
    • env LD_PRELOAD=/usr/lib/libmimalloc.so myprogram
    -

    You can set extra environment variables to check that mimalloc is running, like:

    env MIMALLOC_VERBOSE=1 LD_PRELOAD=/usr/lib/libmimalloc.so myprogram

    or run with the debug version to get detailed statistics:

    env MIMALLOC_SHOW_STATS=1 LD_PRELOAD=/usr/lib/libmimalloc-debug.so myprogram

    MacOS

    +

    You can set extra environment variables to check that mimalloc is running, like:

    env MIMALLOC_VERBOSE=1 LD_PRELOAD=/usr/lib/libmimalloc.so myprogram
    +

    or run with the debug version to get detailed statistics:

    env MIMALLOC_SHOW_STATS=1 LD_PRELOAD=/usr/lib/libmimalloc-debug.so myprogram
    +

    MacOS

    On macOS we can also preload the mimalloc shared library so all calls to the standard malloc interface are resolved to the mimalloc library.

    • env DYLD_FORCE_FLAT_NAMESPACE=1 DYLD_INSERT_LIBRARIES=/usr/lib/libmimalloc.dylib myprogram
      • @@ -120,22 +118,80 @@ $(document).ready(function(){initNavTree('overrides.html','');});

      Windows

      Overriding on Windows is robust and has the particular advantage to be able to redirect all malloc/free calls that go through the (dynamic) C runtime allocator, including those from other DLL's or libraries.

      The overriding on Windows requires that you link your program explicitly with the mimalloc DLL and use the C-runtime library as a DLL (using the /MD or /MDd switch). Also, the mimalloc-redirect.dll (or mimalloc-redirect32.dll) must be available in the same folder as the main mimalloc-override.dll at runtime (as it is a dependency). The redirection DLL ensures that all calls to the C runtime malloc API get redirected to mimalloc (in mimalloc-override.dll).

      -

      To ensure the mimalloc DLL is loaded at run-time it is easiest to insert some call to the mimalloc API in the main function, like mi_version() (or use the /INCLUDE:mi_version switch on the linker). See the mimalloc-override-test project for an example on how to use this. For best performance on Windows with C++, it is also recommended to also override the new/delete operations (by including mimalloc-new-delete.h a single(!) source file in your project).

      +

      To ensure the mimalloc DLL is loaded at run-time it is easiest to insert some call to the mimalloc API in the main function, like mi_version() (or use the /INCLUDE:mi_version switch on the linker). See the mimalloc-override-test project for an example on how to use this. For best performance on Windows with C++, it is also recommended to also override the new/delete operations (by including mimalloc-new-delete.h a single(!) source file in your project without linking to the mimalloc library).

      The environment variable MIMALLOC_DISABLE_REDIRECT=1 can be used to disable dynamic overriding at run-time. Use MIMALLOC_VERBOSE=1 to check if mimalloc was successfully redirected.

      (Note: in principle, it is possible to even patch existing executables without any recompilation if they are linked with the dynamic C runtime (ucrtbase.dll) – just put the mimalloc-override.dll into the import table (and put mimalloc-redirect.dll in the same folder) Such patching can be done for example with CFF Explorer).

      Static override

      On Unix systems, you can also statically link with mimalloc to override the standard malloc interface. The recommended way is to link the final program with the mimalloc single object file (mimalloc-override.o). We use an object file instead of a library file as linkers give preference to that over archives to resolve symbols. To ensure that the standard malloc interface resolves to the mimalloc library, link it as the first object file. For example:

      -
      gcc -o myprogram mimalloc-override.o myfile1.c ...

      List of Overrides:

      +
      gcc -o myprogram mimalloc-override.o myfile1.c ...
      +

      List of Overrides:

      The specific functions that get redirected to the mimalloc library are:

      -
      // C
      void* malloc(size_t size);
      void* calloc(size_t size, size_t n);
      void* realloc(void* p, size_t newsize);
      void free(void* p);
      // C++
      void operator delete(void* p);
      void operator delete[](void* p);
      void* operator new(std::size_t n) noexcept(false);
      void* operator new[](std::size_t n) noexcept(false);
      void* operator new( std::size_t n, std::align_val_t align) noexcept(false);
      void* operator new[]( std::size_t n, std::align_val_t align) noexcept(false);
      void* operator new ( std::size_t count, const std::nothrow_t& tag);
      void* operator new[]( std::size_t count, const std::nothrow_t& tag);
      void* operator new ( std::size_t count, std::align_val_t al, const std::nothrow_t&);
      void* operator new[]( std::size_t count, std::align_val_t al, const std::nothrow_t&);
      // Posix
      int posix_memalign(void** p, size_t alignment, size_t size);
      // Linux
      void* memalign(size_t alignment, size_t size);
      void* aligned_alloc(size_t alignment, size_t size);
      void* valloc(size_t size);
      void* pvalloc(size_t size);
      size_t malloc_usable_size(void *p);
      // BSD
      void* reallocarray( void* p, size_t count, size_t size );
      void* reallocf(void* p, size_t newsize);
      void cfree(void* p);
      // Windows
      void* _expand(void* p, size_t newsize);
      size_t _msize(void* p);
      void* _malloc_dbg(size_t size, int block_type, const char* fname, int line);
      void* _realloc_dbg(void* p, size_t newsize, int block_type, const char* fname, int line);
      void* _calloc_dbg(size_t count, size_t size, int block_type, const char* fname, int line);
      void* _expand_dbg(void* p, size_t size, int block_type, const char* fname, int line);
      size_t _msize_dbg(void* p, int block_type);
      void _free_dbg(void* p, int block_type);
    - +
    // C
    +
    void* malloc(size_t size);
    +
    void* calloc(size_t size, size_t n);
    +
    void* realloc(void* p, size_t newsize);
    +
    void free(void* p);
    +
    +
    void* aligned_alloc(size_t alignment, size_t size);
    +
    char* strdup(const char* s);
    +
    char* strndup(const char* s, size_t n);
    +
    char* realpath(const char* fname, char* resolved_name);
    +
    +
    +
    // C++
    +
    void operator delete(void* p);
    +
    void operator delete[](void* p);
    +
    +
    void* operator new(std::size_t n) noexcept(false);
    +
    void* operator new[](std::size_t n) noexcept(false);
    +
    void* operator new( std::size_t n, std::align_val_t align) noexcept(false);
    +
    void* operator new[]( std::size_t n, std::align_val_t align) noexcept(false);
    +
    +
    void* operator new ( std::size_t count, const std::nothrow_t& tag);
    +
    void* operator new[]( std::size_t count, const std::nothrow_t& tag);
    +
    void* operator new ( std::size_t count, std::align_val_t al, const std::nothrow_t&);
    +
    void* operator new[]( std::size_t count, std::align_val_t al, const std::nothrow_t&);
    +
    +
    // Posix
    +
    int posix_memalign(void** p, size_t alignment, size_t size);
    +
    +
    // Linux
    +
    void* memalign(size_t alignment, size_t size);
    +
    void* valloc(size_t size);
    +
    void* pvalloc(size_t size);
    +
    size_t malloc_usable_size(void *p);
    +
    void* reallocf(void* p, size_t newsize);
    +
    +
    // macOS
    +
    void vfree(void* p);
    +
    size_t malloc_size(const void* p);
    +
    size_t malloc_good_size(size_t size);
    +
    +
    // BSD
    +
    void* reallocarray( void* p, size_t count, size_t size );
    +
    void* reallocf(void* p, size_t newsize);
    +
    void cfree(void* p);
    +
    +
    // NetBSD
    +
    int reallocarr(void* p, size_t count, size_t size);
    +
    +
    // Windows
    +
    void* _expand(void* p, size_t newsize);
    +
    size_t _msize(void* p);
    +
    +
    void* _malloc_dbg(size_t size, int block_type, const char* fname, int line);
    +
    void* _realloc_dbg(void* p, size_t newsize, int block_type, const char* fname, int line);
    +
    void* _calloc_dbg(size_t count, size_t size, int block_type, const char* fname, int line);
    +
    void* _expand_dbg(void* p, size_t size, int block_type, const char* fname, int line);
    +
    size_t _msize_dbg(void* p, int block_type);
    +
    void _free_dbg(void* p, int block_type);
    +
    + diff --git a/docs/pages.html b/docs/pages.html index 8fcd6f0..60b7fc3 100644 --- a/docs/pages.html +++ b/docs/pages.html @@ -3,7 +3,7 @@ - + mi-malloc: Related Pages @@ -13,10 +13,6 @@ - @@ -37,21 +33,21 @@ Logo
    mi-malloc -  1.6 +  1.7/2.0
    - - +
    @@ -60,10 +56,10 @@ - + @@ -73,13 +69,13 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); -
    @@ -92,7 +88,7 @@ $(document).ready(function(){initNavTree('pages.html','');});
    -
    @@ -116,9 +112,7 @@ $(document).ready(function(){initNavTree('pages.html','');}); diff --git a/docs/resize.js b/docs/resize.js index 6617aee..e1ad0fe 100644 --- a/docs/resize.js +++ b/docs/resize.js @@ -1,25 +1,26 @@ /* - @licstart The following is the entire license notice for the - JavaScript code in this file. + @licstart The following is the entire license notice for the JavaScript code in this file. - Copyright (C) 1997-2017 by Dimitri van Heesch + The MIT License (MIT) - This program is free software; you can redistribute it and/or modify - it under the terms of the GNU General Public License as published by - the Free Software Foundation; either version 2 of the License, or - (at your option) any later version. + Copyright (C) 1997-2020 by Dimitri van Heesch - This program is distributed in the hope that it will be useful, - but WITHOUT ANY WARRANTY; without even the implied warranty of - MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - GNU General Public License for more details. + Permission is hereby granted, free of charge, to any person obtaining a copy of this software + and associated documentation files (the "Software"), to deal in the Software without restriction, + including without limitation the rights to use, copy, modify, merge, publish, distribute, + sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is + furnished to do so, subject to the following conditions: - You should have received a copy of the GNU General Public License along - with this program; if not, write to the Free Software Foundation, Inc., - 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. + The above copyright notice and this permission notice shall be included in all copies or + substantial portions of the Software. - @licend The above is the entire license notice - for the JavaScript code in this file + THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING + BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND + NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, + DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, + OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. + + @licend The above is the entire license notice for the JavaScript code in this file */ function initResizable() { @@ -91,6 +92,9 @@ function initResizable() } collapsedWidth=width; } + if (location.hash.slice(1)) { + (document.getElementById(location.hash.slice(1))||document.body).scrollIntoView(); + } } function collapseExpand() @@ -131,6 +135,6 @@ function initResizable() var _preventDefault = function(evt) { evt.preventDefault(); }; $("#splitbar").bind("dragstart", _preventDefault).bind("selectstart", _preventDefault); $(".ui-resizable-handle").dblclick(collapseExpand); - $(window).load(resizeHeight); + $(window).on('load',resizeHeight); } /* @license-end */ diff --git a/docs/search/all_0.html b/docs/search/all_0.html index 5330204..1ec5b2d 100644 --- a/docs/search/all_0.html +++ b/docs/search/all_0.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/all_0.js b/docs/search/all_0.js index 7054b6d..cd7bb41 100644 --- a/docs/search/all_0.js +++ b/docs/search/all_0.js @@ -1,4 +1,4 @@ var searchData= [ - ['_5fmi_5foption_5flast',['_mi_option_last',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca5b4357b74be0d87568036c32eb1a2e4a',1,'mimalloc-doc.h']]] + ['_5fmi_5foption_5flast_0',['_mi_option_last',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca5b4357b74be0d87568036c32eb1a2e4a',1,'mimalloc-doc.h']]] ]; diff --git a/docs/search/all_1.html b/docs/search/all_1.html index 2f46793..9f80e90 100644 --- a/docs/search/all_1.html +++ b/docs/search/all_1.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/all_1.js b/docs/search/all_1.js index bbb4b54..7f1097c 100644 --- a/docs/search/all_1.js +++ b/docs/search/all_1.js @@ -1,4 +1,4 @@ var searchData= [ - ['aligned_20allocation',['Aligned Allocation',['../group__aligned.html',1,'']]] + ['aligned_20allocation_1',['Aligned Allocation',['../group__aligned.html',1,'']]] ]; diff --git a/docs/search/all_2.html b/docs/search/all_2.html index 4c33d85..02cfffc 100644 --- a/docs/search/all_2.html +++ b/docs/search/all_2.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/all_2.js b/docs/search/all_2.js index 829288c..00576d7 100644 --- a/docs/search/all_2.js +++ b/docs/search/all_2.js @@ -1,7 +1,7 @@ var searchData= [ - ['block_5fsize',['block_size',['../group__analysis.html#a332a6c14d736a99699d5453a1cb04b41',1,'mi_heap_area_t']]], - ['blocks',['blocks',['../group__analysis.html#ae0085e6e1cf059a4eb7767e30e9991b8',1,'mi_heap_area_t']]], - ['building',['Building',['../build.html',1,'']]], - ['basic_20allocation',['Basic Allocation',['../group__malloc.html',1,'']]] + ['basic_20allocation_2',['Basic Allocation',['../group__malloc.html',1,'']]], + ['block_5fsize_3',['block_size',['../group__analysis.html#a332a6c14d736a99699d5453a1cb04b41',1,'mi_heap_area_t']]], + ['blocks_4',['blocks',['../group__analysis.html#ae0085e6e1cf059a4eb7767e30e9991b8',1,'mi_heap_area_t']]], + ['building_5',['Building',['../build.html',1,'']]] ]; diff --git a/docs/search/all_3.html b/docs/search/all_3.html index b634070..39767b8 100644 --- a/docs/search/all_3.html +++ b/docs/search/all_3.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/all_3.js b/docs/search/all_3.js index 2e08411..9a029ee 100644 --- a/docs/search/all_3.js +++ b/docs/search/all_3.js @@ -1,5 +1,5 @@ var searchData= [ - ['committed',['committed',['../group__analysis.html#ab47526df656d8837ec3e97f11b83f835',1,'mi_heap_area_t']]], - ['c_2b_2b_20wrappers',['C++ wrappers',['../group__cpp.html',1,'']]] + ['c_2b_2b_20wrappers_6',['C++ wrappers',['../group__cpp.html',1,'']]], + ['committed_7',['committed',['../group__analysis.html#ab47526df656d8837ec3e97f11b83f835',1,'mi_heap_area_t']]] ]; diff --git a/docs/search/all_4.html b/docs/search/all_4.html index dd062ae..fc40463 100644 --- a/docs/search/all_4.html +++ b/docs/search/all_4.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/all_4.js b/docs/search/all_4.js index 059f44c..5dc5128 100644 --- a/docs/search/all_4.js +++ b/docs/search/all_4.js @@ -1,5 +1,5 @@ var searchData= [ - ['environment_20options',['Environment Options',['../environment.html',1,'']]], - ['extended_20functions',['Extended Functions',['../group__extended.html',1,'']]] + ['environment_20options_8',['Environment Options',['../environment.html',1,'']]], + ['extended_20functions_9',['Extended Functions',['../group__extended.html',1,'']]] ]; diff --git a/docs/search/all_5.html b/docs/search/all_5.html index f0780fd..9dd9344 100644 --- a/docs/search/all_5.html +++ b/docs/search/all_5.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/all_5.js b/docs/search/all_5.js index e7e4093..7441d85 100644 --- a/docs/search/all_5.js +++ b/docs/search/all_5.js @@ -1,5 +1,5 @@ var searchData= [ - ['heap_20introspection',['Heap Introspection',['../group__analysis.html',1,'']]], - ['heap_20allocation',['Heap Allocation',['../group__heap.html',1,'']]] + ['heap_20allocation_10',['Heap Allocation',['../group__heap.html',1,'']]], + ['heap_20introspection_11',['Heap Introspection',['../group__analysis.html',1,'']]] ]; diff --git a/docs/search/all_6.html b/docs/search/all_6.html index 39b0f55..f1e516d 100644 --- a/docs/search/all_6.html +++ b/docs/search/all_6.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/all_6.js b/docs/search/all_6.js index 491883f..6d32b7b 100644 --- a/docs/search/all_6.js +++ b/docs/search/all_6.js @@ -1,148 +1,153 @@ var searchData= [ - ['mi_5f_5fposix_5fmemalign',['mi__posix_memalign',['../group__posix.html#gad5a69c8fea96aa2b7a7c818c2130090a',1,'mimalloc-doc.h']]], - ['mi_5faligned_5falloc',['mi_aligned_alloc',['../group__posix.html#ga1326d2e4388630b5f81ca7206318b8e5',1,'mimalloc-doc.h']]], - ['mi_5fblock_5fvisit_5ffun',['mi_block_visit_fun',['../group__analysis.html#gadfa01e2900f0e5d515ad5506b26f6d65',1,'mimalloc-doc.h']]], - ['mi_5fcalloc',['mi_calloc',['../group__malloc.html#ga97fedb4f7107c592fd7f0f0a8949a57d',1,'mimalloc-doc.h']]], - ['mi_5fcalloc_5faligned',['mi_calloc_aligned',['../group__aligned.html#ga53dddb4724042a90315b94bc268fb4c9',1,'mimalloc-doc.h']]], - ['mi_5fcalloc_5faligned_5fat',['mi_calloc_aligned_at',['../group__aligned.html#ga08647c4593f3b2eef24a919a73eba3a3',1,'mimalloc-doc.h']]], - ['mi_5fcalloc_5ftp',['mi_calloc_tp',['../group__typed.html#gae80c47c9d4cab10961fff1a8ac98fc07',1,'mimalloc-doc.h']]], - ['mi_5fcfree',['mi_cfree',['../group__posix.html#ga705dc7a64bffacfeeb0141501a5c35d7',1,'mimalloc-doc.h']]], - ['mi_5fcheck_5fowned',['mi_check_owned',['../group__analysis.html#ga628c237489c2679af84a4d0d143b3dd5',1,'mimalloc-doc.h']]], - ['mi_5fcollect',['mi_collect',['../group__extended.html#ga421430e2226d7d468529cec457396756',1,'mimalloc-doc.h']]], - ['mi_5fdeferred_5ffree_5ffun',['mi_deferred_free_fun',['../group__extended.html#ga299dae78d25ce112e384a98b7309c5be',1,'mimalloc-doc.h']]], - ['mi_5ferror_5ffun',['mi_error_fun',['../group__extended.html#ga251d369cda3f1c2a955c555486ed90e5',1,'mimalloc-doc.h']]], - ['mi_5fexpand',['mi_expand',['../group__malloc.html#gaaee66a1d483c3e28f585525fb96707e4',1,'mimalloc-doc.h']]], - ['mi_5ffree',['mi_free',['../group__malloc.html#gaf2c7b89c327d1f60f59e68b9ea644d95',1,'mimalloc-doc.h']]], - ['mi_5ffree_5faligned',['mi_free_aligned',['../group__posix.html#ga0d28d5cf61e6bfbb18c63092939fe5c9',1,'mimalloc-doc.h']]], - ['mi_5ffree_5fsize',['mi_free_size',['../group__posix.html#gae01389eedab8d67341ff52e2aad80ebb',1,'mimalloc-doc.h']]], - ['mi_5ffree_5fsize_5faligned',['mi_free_size_aligned',['../group__posix.html#ga72e9d7ffb5fe94d69bc722c8506e27bc',1,'mimalloc-doc.h']]], - ['mi_5fgood_5fsize',['mi_good_size',['../group__extended.html#gac057927cd06c854b45fe7847e921bd47',1,'mimalloc-doc.h']]], - ['mi_5fheap_5farea_5ft',['mi_heap_area_t',['../group__analysis.html#structmi__heap__area__t',1,'']]], - ['mi_5fheap_5fcalloc',['mi_heap_calloc',['../group__heap.html#gaa6702b3c48e9e53e50e81b36f5011d55',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fcalloc_5faligned',['mi_heap_calloc_aligned',['../group__heap.html#ga4af03a6e2b93fae77424d93f889705c3',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fcalloc_5faligned_5fat',['mi_heap_calloc_aligned_at',['../group__heap.html#ga08ca6419a5c057a4d965868998eef487',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fcalloc_5ftp',['mi_heap_calloc_tp',['../group__typed.html#ga4e5d1f1707c90e5f55e023ac5f45fe74',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fcheck_5fowned',['mi_heap_check_owned',['../group__analysis.html#ga0d67c1789faaa15ff366c024fcaf6377',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fcollect',['mi_heap_collect',['../group__heap.html#ga7922f7495cde30b1984d0e6072419298',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fcontains_5fblock',['mi_heap_contains_block',['../group__analysis.html#gaa862aa8ed8d57d84cae41fc1022d71af',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fdelete',['mi_heap_delete',['../group__heap.html#ga2ab1af8d438819b55319c7ef51d1e409',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fdestroy',['mi_heap_destroy',['../group__heap.html#ga9f9c0844edb9717f4feacd79116b8e0d',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fget_5fbacking',['mi_heap_get_backing',['../group__heap.html#ga5d03fbe062ffcf38f0f417fd968357fc',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fget_5fdefault',['mi_heap_get_default',['../group__heap.html#ga8db4cbb87314a989a9a187464d6b5e05',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fmalloc',['mi_heap_malloc',['../group__heap.html#ga9cbed01e42c0647907295de92c3fa296',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fmalloc_5faligned',['mi_heap_malloc_aligned',['../group__heap.html#gab5b87e1805306f70df38789fcfcf6653',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fmalloc_5faligned_5fat',['mi_heap_malloc_aligned_at',['../group__heap.html#ga23acd7680fb0976dde3783254c6c874b',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fmalloc_5fsmall',['mi_heap_malloc_small',['../group__heap.html#gaa1a1c7a1f4da6826b5a25b70ef878368',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fmalloc_5ftp',['mi_heap_malloc_tp',['../group__typed.html#ga653bcb24ac495bc19940ecd6898f9cd7',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fmallocn',['mi_heap_mallocn',['../group__heap.html#ga851da6c43fe0b71c1376cee8aef90db0',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fmallocn_5ftp',['mi_heap_mallocn_tp',['../group__typed.html#ga6b75cb9c4b9c647661d0924552dc6e83',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fnew',['mi_heap_new',['../group__heap.html#ga766f672ba56f2fbfeb9d9dbb0b7f6b11',1,'mimalloc-doc.h']]], - ['mi_5fheap_5frealloc',['mi_heap_realloc',['../group__heap.html#gaaef3395f66be48f37bdc8322509c5d81',1,'mimalloc-doc.h']]], - ['mi_5fheap_5frealloc_5faligned',['mi_heap_realloc_aligned',['../group__heap.html#gafc603b696bd14cae6da28658f950d98c',1,'mimalloc-doc.h']]], - ['mi_5fheap_5frealloc_5faligned_5fat',['mi_heap_realloc_aligned_at',['../group__heap.html#gaf96c788a1bf553fe2d371de9365e047c',1,'mimalloc-doc.h']]], - ['mi_5fheap_5freallocf',['mi_heap_reallocf',['../group__heap.html#ga4a21070eb4e7cce018133c8d5f4b0527',1,'mimalloc-doc.h']]], - ['mi_5fheap_5freallocn',['mi_heap_reallocn',['../group__heap.html#gac74e94ad9b0c9b57c1c4d88b8825b7a8',1,'mimalloc-doc.h']]], - ['mi_5fheap_5freallocn_5ftp',['mi_heap_reallocn_tp',['../group__typed.html#gaf213d5422ec35e7f6caad827c79bc948',1,'mimalloc-doc.h']]], - ['mi_5fheap_5frealpath',['mi_heap_realpath',['../group__heap.html#ga00e95ba1e01acac3cfd95bb7a357a6f0',1,'mimalloc-doc.h']]], - ['mi_5fheap_5frecalloc',['mi_heap_recalloc',['../group__zeroinit.html#ga8648c5fbb22a80f0262859099f06dfbd',1,'mimalloc-doc.h']]], - ['mi_5fheap_5frecalloc_5faligned',['mi_heap_recalloc_aligned',['../group__zeroinit.html#ga9f3f999396c8f77ca5e80e7b40ac29e3',1,'mimalloc-doc.h']]], - ['mi_5fheap_5frecalloc_5faligned_5fat',['mi_heap_recalloc_aligned_at',['../group__zeroinit.html#ga496452c96f1de8c500be9fddf52edaf7',1,'mimalloc-doc.h']]], - ['mi_5fheap_5frecalloc_5ftp',['mi_heap_recalloc_tp',['../group__typed.html#ga3e50a1600958fcaf1a7f3560c9174f9e',1,'mimalloc-doc.h']]], - ['mi_5fheap_5frezalloc',['mi_heap_rezalloc',['../group__zeroinit.html#gacfad83f14eb5d6a42a497a898e19fc76',1,'mimalloc-doc.h']]], - ['mi_5fheap_5frezalloc_5faligned',['mi_heap_rezalloc_aligned',['../group__zeroinit.html#ga375fa8a611c51905e592d5d467c49664',1,'mimalloc-doc.h']]], - ['mi_5fheap_5frezalloc_5faligned_5fat',['mi_heap_rezalloc_aligned_at',['../group__zeroinit.html#gac90da54fa7e5d10bdc97ce0b51dce2eb',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fset_5fdefault',['mi_heap_set_default',['../group__heap.html#gab8631ec88c8d26641b68b5d25dcd4422',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fstrdup',['mi_heap_strdup',['../group__heap.html#ga139d6b09dbf50c3c2523d0f4d1cfdeb5',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fstrndup',['mi_heap_strndup',['../group__heap.html#ga8e3dbd46650dd26573cf307a2c8f1f5a',1,'mimalloc-doc.h']]], - ['mi_5fheap_5ft',['mi_heap_t',['../group__heap.html#ga34a47cde5a5b38c29f1aa3c5e76943c2',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fvisit_5fblocks',['mi_heap_visit_blocks',['../group__analysis.html#ga70c46687dc6e9dc98b232b02646f8bed',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fzalloc',['mi_heap_zalloc',['../group__heap.html#ga903104592c8ed53417a3762da6241133',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fzalloc_5faligned',['mi_heap_zalloc_aligned',['../group__heap.html#gaa450a59c6c7ae5fdbd1c2b80a8329ef0',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fzalloc_5faligned_5fat',['mi_heap_zalloc_aligned_at',['../group__heap.html#ga45fb43a62776fbebbdf1edd99b527954',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fzalloc_5ftp',['mi_heap_zalloc_tp',['../group__typed.html#gad6e87e86e994aa14416ae9b5d4c188fe',1,'mimalloc-doc.h']]], - ['mi_5fis_5fin_5fheap_5fregion',['mi_is_in_heap_region',['../group__extended.html#ga5f071b10d4df1c3658e04e7fd67a94e6',1,'mimalloc-doc.h']]], - ['mi_5fis_5fredirected',['mi_is_redirected',['../group__extended.html#gaad25050b19f30cd79397b227e0157a3f',1,'mimalloc-doc.h']]], - ['mi_5fmalloc',['mi_malloc',['../group__malloc.html#ga3406e8b168bc74c8637b11571a6da83a',1,'mimalloc-doc.h']]], - ['mi_5fmalloc_5faligned',['mi_malloc_aligned',['../group__aligned.html#ga68930196751fa2cca9e1fd0d71bade56',1,'mimalloc-doc.h']]], - ['mi_5fmalloc_5faligned_5fat',['mi_malloc_aligned_at',['../group__aligned.html#ga5850da130c936bd77db039dcfbc8295d',1,'mimalloc-doc.h']]], - ['mi_5fmalloc_5fsize',['mi_malloc_size',['../group__posix.html#ga4531c9e775bb3ae12db57c1ba8a5d7de',1,'mimalloc-doc.h']]], - ['mi_5fmalloc_5fsmall',['mi_malloc_small',['../group__extended.html#ga7136c2e55cb22c98ecf95d08d6debb99',1,'mimalloc-doc.h']]], - ['mi_5fmalloc_5ftp',['mi_malloc_tp',['../group__typed.html#ga0619a62c5fd886f1016030abe91f0557',1,'mimalloc-doc.h']]], - ['mi_5fmalloc_5fusable_5fsize',['mi_malloc_usable_size',['../group__posix.html#ga06d07cf357bbac5c73ba5d0c0c421e17',1,'mimalloc-doc.h']]], - ['mi_5fmallocn',['mi_mallocn',['../group__malloc.html#ga0b05e2bf0f73e7401ae08597ff782ac6',1,'mimalloc-doc.h']]], - ['mi_5fmallocn_5ftp',['mi_mallocn_tp',['../group__typed.html#gae5cb6e0fafc9f23169c5622e077afe8b',1,'mimalloc-doc.h']]], - ['mi_5fmemalign',['mi_memalign',['../group__posix.html#gaab7fa71ea93b96873f5d9883db57d40e',1,'mimalloc-doc.h']]], - ['mi_5fnew',['mi_new',['../group__cpp.html#gaad048a9fce3d02c5909cd05c6ec24545',1,'mimalloc-doc.h']]], - ['mi_5fnew_5faligned',['mi_new_aligned',['../group__cpp.html#gaef2c2bdb4f70857902d3c8903ac095f3',1,'mimalloc-doc.h']]], - ['mi_5fnew_5faligned_5fnothrow',['mi_new_aligned_nothrow',['../group__cpp.html#gab5e29558926d934c3f1cae8c815f942c',1,'mimalloc-doc.h']]], - ['mi_5fnew_5fn',['mi_new_n',['../group__cpp.html#gae7bc4f56cd57ed3359060ff4f38bda81',1,'mimalloc-doc.h']]], - ['mi_5fnew_5fnothrow',['mi_new_nothrow',['../group__cpp.html#gaeaded64eda71ed6b1d569d3e723abc4a',1,'mimalloc-doc.h']]], - ['mi_5fnew_5frealloc',['mi_new_realloc',['../group__cpp.html#gaab78a32f55149e9fbf432d5288e38e1e',1,'mimalloc-doc.h']]], - ['mi_5fnew_5freallocn',['mi_new_reallocn',['../group__cpp.html#ga756f4b2bc6a7ecd0a90baea8e90c7907',1,'mimalloc-doc.h']]], - ['mi_5foption_5fdisable',['mi_option_disable',['../group__options.html#gaebf6ff707a2e688ebb1a2296ca564054',1,'mimalloc-doc.h']]], - ['mi_5foption_5feager_5fcommit',['mi_option_eager_commit',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca1e8de72c93da7ff22d91e1e27b52ac2b',1,'mimalloc-doc.h']]], - ['mi_5foption_5feager_5fcommit_5fdelay',['mi_option_eager_commit_delay',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca17a190c25be381142d87e0468c4c068c',1,'mimalloc-doc.h']]], - ['mi_5foption_5feager_5fregion_5fcommit',['mi_option_eager_region_commit',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca32ce97ece29f69e82579679cf8a307ad',1,'mimalloc-doc.h']]], - ['mi_5foption_5fenable',['mi_option_enable',['../group__options.html#ga04180ae41b0d601421dd62ced40ca050',1,'mimalloc-doc.h']]], - ['mi_5foption_5fget',['mi_option_get',['../group__options.html#ga7e8af195cc81d3fa64ccf2662caa565a',1,'mimalloc-doc.h']]], - ['mi_5foption_5fis_5fenabled',['mi_option_is_enabled',['../group__options.html#ga459ad98f18b3fc9275474807fe0ca188',1,'mimalloc-doc.h']]], - ['mi_5foption_5flarge_5fos_5fpages',['mi_option_large_os_pages',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca4192d491200d0055df0554d4cf65054e',1,'mimalloc-doc.h']]], - ['mi_5foption_5fos_5ftag',['mi_option_os_tag',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca4b74ae2a69e445de6c2361b73c1d14bf',1,'mimalloc-doc.h']]], - ['mi_5foption_5fpage_5freset',['mi_option_page_reset',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884cada854dd272c66342f18a93ee254a2968',1,'mimalloc-doc.h']]], - ['mi_5foption_5freserve_5fhuge_5fos_5fpages',['mi_option_reserve_huge_os_pages',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884caca7ed041be3b0b9d0b82432c7bf41af2',1,'mimalloc-doc.h']]], - ['mi_5foption_5freset_5fdecommits',['mi_option_reset_decommits',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884cac81ee965b130fa81238913a3c239d536',1,'mimalloc-doc.h']]], - ['mi_5foption_5freset_5fdelay',['mi_option_reset_delay',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca154fe170131d5212cff57e22b99523c5',1,'mimalloc-doc.h']]], - ['mi_5foption_5fsegment_5fcache',['mi_option_segment_cache',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca2ecbe7ef32f5c84de3739aa4f0b805a1',1,'mimalloc-doc.h']]], - ['mi_5foption_5fsegment_5freset',['mi_option_segment_reset',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884cafb121d30d87591850d5410ccc3a95c6d',1,'mimalloc-doc.h']]], - ['mi_5foption_5fset',['mi_option_set',['../group__options.html#gaf84921c32375e25754dc2ee6a911fa60',1,'mimalloc-doc.h']]], - ['mi_5foption_5fset_5fdefault',['mi_option_set_default',['../group__options.html#ga7ef623e440e6e5545cb08c94e71e4b90',1,'mimalloc-doc.h']]], - ['mi_5foption_5fset_5fenabled',['mi_option_set_enabled',['../group__options.html#ga9a13d05fcb77489cb06d4d017ebd8bed',1,'mimalloc-doc.h']]], - ['mi_5foption_5fset_5fenabled_5fdefault',['mi_option_set_enabled_default',['../group__options.html#ga65518b69ec5d32336b50e07f74b3f629',1,'mimalloc-doc.h']]], - ['mi_5foption_5fshow_5ferrors',['mi_option_show_errors',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884cafbf4822e5c00732c5984b32a032837f0',1,'mimalloc-doc.h']]], - ['mi_5foption_5fshow_5fstats',['mi_option_show_stats',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca0957ef73b2550764b4840edf48422fda',1,'mimalloc-doc.h']]], - ['mi_5foption_5ft',['mi_option_t',['../group__options.html#gafebf7ed116adb38ae5218bc3ce06884c',1,'mimalloc-doc.h']]], - ['mi_5foption_5fuse_5fnuma_5fnodes',['mi_option_use_numa_nodes',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca0ac33a18f6b659fcfaf44efb0bab1b74',1,'mimalloc-doc.h']]], - ['mi_5foption_5fverbose',['mi_option_verbose',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca7c8b7bf5281c581bad64f5daa6442777',1,'mimalloc-doc.h']]], - ['mi_5foutput_5ffun',['mi_output_fun',['../group__extended.html#gad823d23444a4b77a40f66bf075a98a0c',1,'mimalloc-doc.h']]], - ['mi_5fposix_5fmemalign',['mi_posix_memalign',['../group__posix.html#gacff84f226ba9feb2031b8992e5579447',1,'mimalloc-doc.h']]], - ['mi_5fprocess_5finfo',['mi_process_info',['../group__extended.html#ga7d862c2affd5790381da14eb102a364d',1,'mimalloc-doc.h']]], - ['mi_5fpvalloc',['mi_pvalloc',['../group__posix.html#gaeb325c39b887d3b90d85d1eb1712fb1e',1,'mimalloc-doc.h']]], - ['mi_5frealloc',['mi_realloc',['../group__malloc.html#gaf11eb497da57bdfb2de65eb191c69db6',1,'mimalloc-doc.h']]], - ['mi_5frealloc_5faligned',['mi_realloc_aligned',['../group__aligned.html#ga4028d1cf4aa4c87c880747044a8322ae',1,'mimalloc-doc.h']]], - ['mi_5frealloc_5faligned_5fat',['mi_realloc_aligned_at',['../group__aligned.html#gaf66a9ae6c6f08bd6be6fb6ea771faffb',1,'mimalloc-doc.h']]], - ['mi_5freallocarray',['mi_reallocarray',['../group__posix.html#ga48fad8648a2f1dab9c87ea9448a52088',1,'mimalloc-doc.h']]], - ['mi_5freallocf',['mi_reallocf',['../group__malloc.html#gafe68ac7c5e24a65cd55c9d6b152211a0',1,'mimalloc-doc.h']]], - ['mi_5freallocn',['mi_reallocn',['../group__malloc.html#ga61d57b4144ba24fba5c1e9b956d13853',1,'mimalloc-doc.h']]], - ['mi_5freallocn_5ftp',['mi_reallocn_tp',['../group__typed.html#ga1158b49a55dfa81f58a4426a7578f523',1,'mimalloc-doc.h']]], - ['mi_5frealpath',['mi_realpath',['../group__malloc.html#ga08cec32dd5bbe7da91c78d19f1b5bebe',1,'mimalloc-doc.h']]], - ['mi_5frecalloc',['mi_recalloc',['../group__malloc.html#ga23a0fbb452b5dce8e31fab1a1958cacc',1,'mimalloc-doc.h']]], - ['mi_5frecalloc_5faligned',['mi_recalloc_aligned',['../group__zeroinit.html#ga3e7e5c291acf1c7fd7ffd9914a9f945f',1,'mimalloc-doc.h']]], - ['mi_5frecalloc_5faligned_5fat',['mi_recalloc_aligned_at',['../group__zeroinit.html#ga4ff5e92ad73585418a072c9d059e5cf9',1,'mimalloc-doc.h']]], - ['mi_5fregister_5fdeferred_5ffree',['mi_register_deferred_free',['../group__extended.html#ga3460a6ca91af97be4058f523d3cb8ece',1,'mimalloc-doc.h']]], - ['mi_5fregister_5ferror',['mi_register_error',['../group__extended.html#gaa1d55e0e894be240827e5d87ec3a1f45',1,'mimalloc-doc.h']]], - ['mi_5fregister_5foutput',['mi_register_output',['../group__extended.html#gae5b17ff027cd2150b43a33040250cf3f',1,'mimalloc-doc.h']]], - ['mi_5freserve_5fhuge_5fos_5fpages_5fat',['mi_reserve_huge_os_pages_at',['../group__extended.html#ga7795a13d20087447281858d2c771cca1',1,'mimalloc-doc.h']]], - ['mi_5freserve_5fhuge_5fos_5fpages_5finterleave',['mi_reserve_huge_os_pages_interleave',['../group__extended.html#ga3132f521fb756fc0e8ec0b74fb58df50',1,'mimalloc-doc.h']]], - ['mi_5frezalloc',['mi_rezalloc',['../group__zeroinit.html#ga8c292e142110229a2980b37ab036dbc6',1,'mimalloc-doc.h']]], - ['mi_5frezalloc_5faligned',['mi_rezalloc_aligned',['../group__zeroinit.html#gacd71a7bce96aab38ae6de17af2eb2cf0',1,'mimalloc-doc.h']]], - ['mi_5frezalloc_5faligned_5fat',['mi_rezalloc_aligned_at',['../group__zeroinit.html#gae8b358c417e61d5307da002702b0a8e1',1,'mimalloc-doc.h']]], - ['mi_5fsmall_5fsize_5fmax',['MI_SMALL_SIZE_MAX',['../group__extended.html#ga1ea64283508718d9d645c38efc2f4305',1,'mimalloc-doc.h']]], - ['mi_5fstats_5fmerge',['mi_stats_merge',['../group__extended.html#ga854b1de8cb067c7316286c28b2fcd3d1',1,'mimalloc-doc.h']]], - ['mi_5fstats_5fprint',['mi_stats_print',['../group__extended.html#ga2d126e5c62d3badc35445e5d84166df2',1,'mimalloc-doc.h']]], - ['mi_5fstats_5fprint_5fout',['mi_stats_print_out',['../group__extended.html#ga537f13b299ddf801e49a5a94fde02c79',1,'mimalloc-doc.h']]], - ['mi_5fstats_5freset',['mi_stats_reset',['../group__extended.html#ga3bb8468b8cfcc6e2a61d98aee85c5f99',1,'mimalloc-doc.h']]], - ['mi_5fstl_5fallocator',['mi_stl_allocator',['../group__cpp.html#structmi__stl__allocator',1,'']]], - ['mi_5fstrdup',['mi_strdup',['../group__malloc.html#gac7cffe13f1f458ed16789488bf92b9b2',1,'mimalloc-doc.h']]], - ['mi_5fstrndup',['mi_strndup',['../group__malloc.html#gaaabf971c2571891433477e2d21a35266',1,'mimalloc-doc.h']]], - ['mi_5fthread_5fdone',['mi_thread_done',['../group__extended.html#ga0ae4581e85453456a0d658b2b98bf7bf',1,'mimalloc-doc.h']]], - ['mi_5fthread_5finit',['mi_thread_init',['../group__extended.html#gaf8e73efc2cbca9ebfdfb166983a04c17',1,'mimalloc-doc.h']]], - ['mi_5fthread_5fstats_5fprint_5fout',['mi_thread_stats_print_out',['../group__extended.html#gab1dac8476c46cb9eecab767eb40c1525',1,'mimalloc-doc.h']]], - ['mi_5fusable_5fsize',['mi_usable_size',['../group__extended.html#ga089c859d9eddc5f9b4bd946cd53cebee',1,'mimalloc-doc.h']]], - ['mi_5fvalloc',['mi_valloc',['../group__posix.html#ga73baaf5951f5165ba0763d0c06b6a93b',1,'mimalloc-doc.h']]], - ['mi_5fzalloc',['mi_zalloc',['../group__malloc.html#gafdd9d8bb2986e668ba9884f28af38000',1,'mimalloc-doc.h']]], - ['mi_5fzalloc_5faligned',['mi_zalloc_aligned',['../group__aligned.html#ga0cadbcf5b89a7b6fb171bc8df8734819',1,'mimalloc-doc.h']]], - ['mi_5fzalloc_5faligned_5fat',['mi_zalloc_aligned_at',['../group__aligned.html#ga5f8c2353766db522565e642fafd8a3f8',1,'mimalloc-doc.h']]], - ['mi_5fzalloc_5fsmall',['mi_zalloc_small',['../group__extended.html#ga220f29f40a44404b0061c15bc1c31152',1,'mimalloc-doc.h']]], - ['mi_5fzalloc_5ftp',['mi_zalloc_tp',['../group__typed.html#gac77a61bdaf680a803785fe307820b48c',1,'mimalloc-doc.h']]] + ['mi_5f_5fposix_5fmemalign_12',['mi__posix_memalign',['../group__posix.html#gad5a69c8fea96aa2b7a7c818c2130090a',1,'mimalloc-doc.h']]], + ['mi_5faligned_5falloc_13',['mi_aligned_alloc',['../group__posix.html#ga1326d2e4388630b5f81ca7206318b8e5',1,'mimalloc-doc.h']]], + ['mi_5falignment_5fmax_14',['MI_ALIGNMENT_MAX',['../group__aligned.html#ga83c03016066b438f51a8095e9140be06',1,'mimalloc-doc.h']]], + ['mi_5fblock_5fvisit_5ffun_15',['mi_block_visit_fun',['../group__analysis.html#gadfa01e2900f0e5d515ad5506b26f6d65',1,'mimalloc-doc.h']]], + ['mi_5fcalloc_16',['mi_calloc',['../group__malloc.html#ga97fedb4f7107c592fd7f0f0a8949a57d',1,'mimalloc-doc.h']]], + ['mi_5fcalloc_5faligned_17',['mi_calloc_aligned',['../group__aligned.html#ga53dddb4724042a90315b94bc268fb4c9',1,'mimalloc-doc.h']]], + ['mi_5fcalloc_5faligned_5fat_18',['mi_calloc_aligned_at',['../group__aligned.html#ga08647c4593f3b2eef24a919a73eba3a3',1,'mimalloc-doc.h']]], + ['mi_5fcalloc_5ftp_19',['mi_calloc_tp',['../group__typed.html#gae80c47c9d4cab10961fff1a8ac98fc07',1,'mimalloc-doc.h']]], + ['mi_5fcfree_20',['mi_cfree',['../group__posix.html#ga705dc7a64bffacfeeb0141501a5c35d7',1,'mimalloc-doc.h']]], + ['mi_5fcheck_5fowned_21',['mi_check_owned',['../group__analysis.html#ga628c237489c2679af84a4d0d143b3dd5',1,'mimalloc-doc.h']]], + ['mi_5fcollect_22',['mi_collect',['../group__extended.html#ga421430e2226d7d468529cec457396756',1,'mimalloc-doc.h']]], + ['mi_5fdeferred_5ffree_5ffun_23',['mi_deferred_free_fun',['../group__extended.html#ga299dae78d25ce112e384a98b7309c5be',1,'mimalloc-doc.h']]], + ['mi_5ferror_5ffun_24',['mi_error_fun',['../group__extended.html#ga251d369cda3f1c2a955c555486ed90e5',1,'mimalloc-doc.h']]], + ['mi_5fexpand_25',['mi_expand',['../group__malloc.html#gaaee66a1d483c3e28f585525fb96707e4',1,'mimalloc-doc.h']]], + ['mi_5ffree_26',['mi_free',['../group__malloc.html#gaf2c7b89c327d1f60f59e68b9ea644d95',1,'mimalloc-doc.h']]], + ['mi_5ffree_5faligned_27',['mi_free_aligned',['../group__posix.html#ga0d28d5cf61e6bfbb18c63092939fe5c9',1,'mimalloc-doc.h']]], + ['mi_5ffree_5fsize_28',['mi_free_size',['../group__posix.html#gae01389eedab8d67341ff52e2aad80ebb',1,'mimalloc-doc.h']]], + ['mi_5ffree_5fsize_5faligned_29',['mi_free_size_aligned',['../group__posix.html#ga72e9d7ffb5fe94d69bc722c8506e27bc',1,'mimalloc-doc.h']]], + ['mi_5fgood_5fsize_30',['mi_good_size',['../group__extended.html#gac057927cd06c854b45fe7847e921bd47',1,'mimalloc-doc.h']]], + ['mi_5fheap_5farea_5ft_31',['mi_heap_area_t',['../group__analysis.html#structmi__heap__area__t',1,'']]], + ['mi_5fheap_5fcalloc_32',['mi_heap_calloc',['../group__heap.html#gaa6702b3c48e9e53e50e81b36f5011d55',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fcalloc_5faligned_33',['mi_heap_calloc_aligned',['../group__heap.html#ga4af03a6e2b93fae77424d93f889705c3',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fcalloc_5faligned_5fat_34',['mi_heap_calloc_aligned_at',['../group__heap.html#ga08ca6419a5c057a4d965868998eef487',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fcalloc_5ftp_35',['mi_heap_calloc_tp',['../group__typed.html#ga4e5d1f1707c90e5f55e023ac5f45fe74',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fcheck_5fowned_36',['mi_heap_check_owned',['../group__analysis.html#ga0d67c1789faaa15ff366c024fcaf6377',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fcollect_37',['mi_heap_collect',['../group__heap.html#ga7922f7495cde30b1984d0e6072419298',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fcontains_5fblock_38',['mi_heap_contains_block',['../group__analysis.html#gaa862aa8ed8d57d84cae41fc1022d71af',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fdelete_39',['mi_heap_delete',['../group__heap.html#ga2ab1af8d438819b55319c7ef51d1e409',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fdestroy_40',['mi_heap_destroy',['../group__heap.html#ga9f9c0844edb9717f4feacd79116b8e0d',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fget_5fbacking_41',['mi_heap_get_backing',['../group__heap.html#ga5d03fbe062ffcf38f0f417fd968357fc',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fget_5fdefault_42',['mi_heap_get_default',['../group__heap.html#ga8db4cbb87314a989a9a187464d6b5e05',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fmalloc_43',['mi_heap_malloc',['../group__heap.html#ga9cbed01e42c0647907295de92c3fa296',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fmalloc_5faligned_44',['mi_heap_malloc_aligned',['../group__heap.html#gab5b87e1805306f70df38789fcfcf6653',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fmalloc_5faligned_5fat_45',['mi_heap_malloc_aligned_at',['../group__heap.html#ga23acd7680fb0976dde3783254c6c874b',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fmalloc_5fsmall_46',['mi_heap_malloc_small',['../group__heap.html#gaa1a1c7a1f4da6826b5a25b70ef878368',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fmalloc_5ftp_47',['mi_heap_malloc_tp',['../group__typed.html#ga653bcb24ac495bc19940ecd6898f9cd7',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fmallocn_48',['mi_heap_mallocn',['../group__heap.html#ga851da6c43fe0b71c1376cee8aef90db0',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fmallocn_5ftp_49',['mi_heap_mallocn_tp',['../group__typed.html#ga6b75cb9c4b9c647661d0924552dc6e83',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fnew_50',['mi_heap_new',['../group__heap.html#ga766f672ba56f2fbfeb9d9dbb0b7f6b11',1,'mimalloc-doc.h']]], + ['mi_5fheap_5frealloc_51',['mi_heap_realloc',['../group__heap.html#gaaef3395f66be48f37bdc8322509c5d81',1,'mimalloc-doc.h']]], + ['mi_5fheap_5frealloc_5faligned_52',['mi_heap_realloc_aligned',['../group__heap.html#gafc603b696bd14cae6da28658f950d98c',1,'mimalloc-doc.h']]], + ['mi_5fheap_5frealloc_5faligned_5fat_53',['mi_heap_realloc_aligned_at',['../group__heap.html#gaf96c788a1bf553fe2d371de9365e047c',1,'mimalloc-doc.h']]], + ['mi_5fheap_5freallocf_54',['mi_heap_reallocf',['../group__heap.html#ga4a21070eb4e7cce018133c8d5f4b0527',1,'mimalloc-doc.h']]], + ['mi_5fheap_5freallocn_55',['mi_heap_reallocn',['../group__heap.html#gac74e94ad9b0c9b57c1c4d88b8825b7a8',1,'mimalloc-doc.h']]], + ['mi_5fheap_5freallocn_5ftp_56',['mi_heap_reallocn_tp',['../group__typed.html#gaf213d5422ec35e7f6caad827c79bc948',1,'mimalloc-doc.h']]], + ['mi_5fheap_5frealpath_57',['mi_heap_realpath',['../group__heap.html#ga00e95ba1e01acac3cfd95bb7a357a6f0',1,'mimalloc-doc.h']]], + ['mi_5fheap_5frecalloc_58',['mi_heap_recalloc',['../group__zeroinit.html#ga8648c5fbb22a80f0262859099f06dfbd',1,'mimalloc-doc.h']]], + ['mi_5fheap_5frecalloc_5faligned_59',['mi_heap_recalloc_aligned',['../group__zeroinit.html#ga9f3f999396c8f77ca5e80e7b40ac29e3',1,'mimalloc-doc.h']]], + ['mi_5fheap_5frecalloc_5faligned_5fat_60',['mi_heap_recalloc_aligned_at',['../group__zeroinit.html#ga496452c96f1de8c500be9fddf52edaf7',1,'mimalloc-doc.h']]], + ['mi_5fheap_5frecalloc_5ftp_61',['mi_heap_recalloc_tp',['../group__typed.html#ga3e50a1600958fcaf1a7f3560c9174f9e',1,'mimalloc-doc.h']]], + ['mi_5fheap_5frezalloc_62',['mi_heap_rezalloc',['../group__zeroinit.html#gacfad83f14eb5d6a42a497a898e19fc76',1,'mimalloc-doc.h']]], + ['mi_5fheap_5frezalloc_5faligned_63',['mi_heap_rezalloc_aligned',['../group__zeroinit.html#ga375fa8a611c51905e592d5d467c49664',1,'mimalloc-doc.h']]], + ['mi_5fheap_5frezalloc_5faligned_5fat_64',['mi_heap_rezalloc_aligned_at',['../group__zeroinit.html#gac90da54fa7e5d10bdc97ce0b51dce2eb',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fset_5fdefault_65',['mi_heap_set_default',['../group__heap.html#gab8631ec88c8d26641b68b5d25dcd4422',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fstrdup_66',['mi_heap_strdup',['../group__heap.html#ga139d6b09dbf50c3c2523d0f4d1cfdeb5',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fstrndup_67',['mi_heap_strndup',['../group__heap.html#ga8e3dbd46650dd26573cf307a2c8f1f5a',1,'mimalloc-doc.h']]], + ['mi_5fheap_5ft_68',['mi_heap_t',['../group__heap.html#ga34a47cde5a5b38c29f1aa3c5e76943c2',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fvisit_5fblocks_69',['mi_heap_visit_blocks',['../group__analysis.html#ga70c46687dc6e9dc98b232b02646f8bed',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fzalloc_70',['mi_heap_zalloc',['../group__heap.html#ga903104592c8ed53417a3762da6241133',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fzalloc_5faligned_71',['mi_heap_zalloc_aligned',['../group__heap.html#gaa450a59c6c7ae5fdbd1c2b80a8329ef0',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fzalloc_5faligned_5fat_72',['mi_heap_zalloc_aligned_at',['../group__heap.html#ga45fb43a62776fbebbdf1edd99b527954',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fzalloc_5ftp_73',['mi_heap_zalloc_tp',['../group__typed.html#gad6e87e86e994aa14416ae9b5d4c188fe',1,'mimalloc-doc.h']]], + ['mi_5fis_5fin_5fheap_5fregion_74',['mi_is_in_heap_region',['../group__extended.html#ga5f071b10d4df1c3658e04e7fd67a94e6',1,'mimalloc-doc.h']]], + ['mi_5fis_5fredirected_75',['mi_is_redirected',['../group__extended.html#gaad25050b19f30cd79397b227e0157a3f',1,'mimalloc-doc.h']]], + ['mi_5fmalloc_76',['mi_malloc',['../group__malloc.html#ga3406e8b168bc74c8637b11571a6da83a',1,'mimalloc-doc.h']]], + ['mi_5fmalloc_5faligned_77',['mi_malloc_aligned',['../group__aligned.html#ga68930196751fa2cca9e1fd0d71bade56',1,'mimalloc-doc.h']]], + ['mi_5fmalloc_5faligned_5fat_78',['mi_malloc_aligned_at',['../group__aligned.html#ga5850da130c936bd77db039dcfbc8295d',1,'mimalloc-doc.h']]], + ['mi_5fmalloc_5fsize_79',['mi_malloc_size',['../group__posix.html#ga4531c9e775bb3ae12db57c1ba8a5d7de',1,'mimalloc-doc.h']]], + ['mi_5fmalloc_5fsmall_80',['mi_malloc_small',['../group__extended.html#ga7136c2e55cb22c98ecf95d08d6debb99',1,'mimalloc-doc.h']]], + ['mi_5fmalloc_5ftp_81',['mi_malloc_tp',['../group__typed.html#ga0619a62c5fd886f1016030abe91f0557',1,'mimalloc-doc.h']]], + ['mi_5fmalloc_5fusable_5fsize_82',['mi_malloc_usable_size',['../group__posix.html#ga06d07cf357bbac5c73ba5d0c0c421e17',1,'mimalloc-doc.h']]], + ['mi_5fmallocn_83',['mi_mallocn',['../group__malloc.html#ga0b05e2bf0f73e7401ae08597ff782ac6',1,'mimalloc-doc.h']]], + ['mi_5fmallocn_5ftp_84',['mi_mallocn_tp',['../group__typed.html#gae5cb6e0fafc9f23169c5622e077afe8b',1,'mimalloc-doc.h']]], + ['mi_5fmanage_5fos_5fmemory_85',['mi_manage_os_memory',['../group__extended.html#ga4c6486a1fdcd7a423b5f25fe4be8e0cf',1,'mimalloc-doc.h']]], + ['mi_5fmemalign_86',['mi_memalign',['../group__posix.html#gaab7fa71ea93b96873f5d9883db57d40e',1,'mimalloc-doc.h']]], + ['mi_5fnew_87',['mi_new',['../group__cpp.html#gaad048a9fce3d02c5909cd05c6ec24545',1,'mimalloc-doc.h']]], + ['mi_5fnew_5faligned_88',['mi_new_aligned',['../group__cpp.html#gaef2c2bdb4f70857902d3c8903ac095f3',1,'mimalloc-doc.h']]], + ['mi_5fnew_5faligned_5fnothrow_89',['mi_new_aligned_nothrow',['../group__cpp.html#gab5e29558926d934c3f1cae8c815f942c',1,'mimalloc-doc.h']]], + ['mi_5fnew_5fn_90',['mi_new_n',['../group__cpp.html#gae7bc4f56cd57ed3359060ff4f38bda81',1,'mimalloc-doc.h']]], + ['mi_5fnew_5fnothrow_91',['mi_new_nothrow',['../group__cpp.html#gaeaded64eda71ed6b1d569d3e723abc4a',1,'mimalloc-doc.h']]], + ['mi_5fnew_5frealloc_92',['mi_new_realloc',['../group__cpp.html#gaab78a32f55149e9fbf432d5288e38e1e',1,'mimalloc-doc.h']]], + ['mi_5fnew_5freallocn_93',['mi_new_reallocn',['../group__cpp.html#ga756f4b2bc6a7ecd0a90baea8e90c7907',1,'mimalloc-doc.h']]], + ['mi_5foption_5fdisable_94',['mi_option_disable',['../group__options.html#gaebf6ff707a2e688ebb1a2296ca564054',1,'mimalloc-doc.h']]], + ['mi_5foption_5feager_5fcommit_95',['mi_option_eager_commit',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca1e8de72c93da7ff22d91e1e27b52ac2b',1,'mimalloc-doc.h']]], + ['mi_5foption_5feager_5fcommit_5fdelay_96',['mi_option_eager_commit_delay',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca17a190c25be381142d87e0468c4c068c',1,'mimalloc-doc.h']]], + ['mi_5foption_5feager_5fregion_5fcommit_97',['mi_option_eager_region_commit',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca32ce97ece29f69e82579679cf8a307ad',1,'mimalloc-doc.h']]], + ['mi_5foption_5fenable_98',['mi_option_enable',['../group__options.html#ga04180ae41b0d601421dd62ced40ca050',1,'mimalloc-doc.h']]], + ['mi_5foption_5fget_99',['mi_option_get',['../group__options.html#ga7e8af195cc81d3fa64ccf2662caa565a',1,'mimalloc-doc.h']]], + ['mi_5foption_5fis_5fenabled_100',['mi_option_is_enabled',['../group__options.html#ga459ad98f18b3fc9275474807fe0ca188',1,'mimalloc-doc.h']]], + ['mi_5foption_5flarge_5fos_5fpages_101',['mi_option_large_os_pages',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca4192d491200d0055df0554d4cf65054e',1,'mimalloc-doc.h']]], + ['mi_5foption_5fos_5ftag_102',['mi_option_os_tag',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca4b74ae2a69e445de6c2361b73c1d14bf',1,'mimalloc-doc.h']]], + ['mi_5foption_5fpage_5freset_103',['mi_option_page_reset',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884cada854dd272c66342f18a93ee254a2968',1,'mimalloc-doc.h']]], + ['mi_5foption_5freserve_5fhuge_5fos_5fpages_104',['mi_option_reserve_huge_os_pages',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884caca7ed041be3b0b9d0b82432c7bf41af2',1,'mimalloc-doc.h']]], + ['mi_5foption_5freserve_5fhuge_5fos_5fpages_5fat_105',['mi_option_reserve_huge_os_pages_at',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884caa13e7926d4339d2aa6fbf61d4473fd5c',1,'mimalloc-doc.h']]], + ['mi_5foption_5freset_5fdecommits_106',['mi_option_reset_decommits',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884cac81ee965b130fa81238913a3c239d536',1,'mimalloc-doc.h']]], + ['mi_5foption_5freset_5fdelay_107',['mi_option_reset_delay',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca154fe170131d5212cff57e22b99523c5',1,'mimalloc-doc.h']]], + ['mi_5foption_5fsegment_5fcache_108',['mi_option_segment_cache',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca2ecbe7ef32f5c84de3739aa4f0b805a1',1,'mimalloc-doc.h']]], + ['mi_5foption_5fsegment_5freset_109',['mi_option_segment_reset',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884cafb121d30d87591850d5410ccc3a95c6d',1,'mimalloc-doc.h']]], + ['mi_5foption_5fset_110',['mi_option_set',['../group__options.html#gaf84921c32375e25754dc2ee6a911fa60',1,'mimalloc-doc.h']]], + ['mi_5foption_5fset_5fdefault_111',['mi_option_set_default',['../group__options.html#ga7ef623e440e6e5545cb08c94e71e4b90',1,'mimalloc-doc.h']]], + ['mi_5foption_5fset_5fenabled_112',['mi_option_set_enabled',['../group__options.html#ga9a13d05fcb77489cb06d4d017ebd8bed',1,'mimalloc-doc.h']]], + ['mi_5foption_5fset_5fenabled_5fdefault_113',['mi_option_set_enabled_default',['../group__options.html#ga65518b69ec5d32336b50e07f74b3f629',1,'mimalloc-doc.h']]], + ['mi_5foption_5fshow_5ferrors_114',['mi_option_show_errors',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884cafbf4822e5c00732c5984b32a032837f0',1,'mimalloc-doc.h']]], + ['mi_5foption_5fshow_5fstats_115',['mi_option_show_stats',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca0957ef73b2550764b4840edf48422fda',1,'mimalloc-doc.h']]], + ['mi_5foption_5ft_116',['mi_option_t',['../group__options.html#gafebf7ed116adb38ae5218bc3ce06884c',1,'mimalloc-doc.h']]], + ['mi_5foption_5fuse_5fnuma_5fnodes_117',['mi_option_use_numa_nodes',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca0ac33a18f6b659fcfaf44efb0bab1b74',1,'mimalloc-doc.h']]], + ['mi_5foption_5fverbose_118',['mi_option_verbose',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca7c8b7bf5281c581bad64f5daa6442777',1,'mimalloc-doc.h']]], + ['mi_5foutput_5ffun_119',['mi_output_fun',['../group__extended.html#gad823d23444a4b77a40f66bf075a98a0c',1,'mimalloc-doc.h']]], + ['mi_5fposix_5fmemalign_120',['mi_posix_memalign',['../group__posix.html#gacff84f226ba9feb2031b8992e5579447',1,'mimalloc-doc.h']]], + ['mi_5fprocess_5finfo_121',['mi_process_info',['../group__extended.html#ga7d862c2affd5790381da14eb102a364d',1,'mimalloc-doc.h']]], + ['mi_5fpvalloc_122',['mi_pvalloc',['../group__posix.html#gaeb325c39b887d3b90d85d1eb1712fb1e',1,'mimalloc-doc.h']]], + ['mi_5frealloc_123',['mi_realloc',['../group__malloc.html#gaf11eb497da57bdfb2de65eb191c69db6',1,'mimalloc-doc.h']]], + ['mi_5frealloc_5faligned_124',['mi_realloc_aligned',['../group__aligned.html#ga4028d1cf4aa4c87c880747044a8322ae',1,'mimalloc-doc.h']]], + ['mi_5frealloc_5faligned_5fat_125',['mi_realloc_aligned_at',['../group__aligned.html#gaf66a9ae6c6f08bd6be6fb6ea771faffb',1,'mimalloc-doc.h']]], + ['mi_5freallocarr_126',['mi_reallocarr',['../group__posix.html#ga7e1934d60a3e697950eeb48e042bfad5',1,'mimalloc-doc.h']]], + ['mi_5freallocarray_127',['mi_reallocarray',['../group__posix.html#ga48fad8648a2f1dab9c87ea9448a52088',1,'mimalloc-doc.h']]], + ['mi_5freallocf_128',['mi_reallocf',['../group__malloc.html#gafe68ac7c5e24a65cd55c9d6b152211a0',1,'mimalloc-doc.h']]], + ['mi_5freallocn_129',['mi_reallocn',['../group__malloc.html#ga61d57b4144ba24fba5c1e9b956d13853',1,'mimalloc-doc.h']]], + ['mi_5freallocn_5ftp_130',['mi_reallocn_tp',['../group__typed.html#ga1158b49a55dfa81f58a4426a7578f523',1,'mimalloc-doc.h']]], + ['mi_5frealpath_131',['mi_realpath',['../group__malloc.html#ga08cec32dd5bbe7da91c78d19f1b5bebe',1,'mimalloc-doc.h']]], + ['mi_5frecalloc_132',['mi_recalloc',['../group__malloc.html#ga23a0fbb452b5dce8e31fab1a1958cacc',1,'mimalloc-doc.h']]], + ['mi_5frecalloc_5faligned_133',['mi_recalloc_aligned',['../group__zeroinit.html#ga3e7e5c291acf1c7fd7ffd9914a9f945f',1,'mimalloc-doc.h']]], + ['mi_5frecalloc_5faligned_5fat_134',['mi_recalloc_aligned_at',['../group__zeroinit.html#ga4ff5e92ad73585418a072c9d059e5cf9',1,'mimalloc-doc.h']]], + ['mi_5fregister_5fdeferred_5ffree_135',['mi_register_deferred_free',['../group__extended.html#ga3460a6ca91af97be4058f523d3cb8ece',1,'mimalloc-doc.h']]], + ['mi_5fregister_5ferror_136',['mi_register_error',['../group__extended.html#gaa1d55e0e894be240827e5d87ec3a1f45',1,'mimalloc-doc.h']]], + ['mi_5fregister_5foutput_137',['mi_register_output',['../group__extended.html#gae5b17ff027cd2150b43a33040250cf3f',1,'mimalloc-doc.h']]], + ['mi_5freserve_5fhuge_5fos_5fpages_5fat_138',['mi_reserve_huge_os_pages_at',['../group__extended.html#ga7795a13d20087447281858d2c771cca1',1,'mimalloc-doc.h']]], + ['mi_5freserve_5fhuge_5fos_5fpages_5finterleave_139',['mi_reserve_huge_os_pages_interleave',['../group__extended.html#ga3132f521fb756fc0e8ec0b74fb58df50',1,'mimalloc-doc.h']]], + ['mi_5freserve_5fos_5fmemory_140',['mi_reserve_os_memory',['../group__extended.html#ga00ec3324b6b2591c7fe3677baa30a767',1,'mimalloc-doc.h']]], + ['mi_5frezalloc_141',['mi_rezalloc',['../group__zeroinit.html#ga8c292e142110229a2980b37ab036dbc6',1,'mimalloc-doc.h']]], + ['mi_5frezalloc_5faligned_142',['mi_rezalloc_aligned',['../group__zeroinit.html#gacd71a7bce96aab38ae6de17af2eb2cf0',1,'mimalloc-doc.h']]], + ['mi_5frezalloc_5faligned_5fat_143',['mi_rezalloc_aligned_at',['../group__zeroinit.html#gae8b358c417e61d5307da002702b0a8e1',1,'mimalloc-doc.h']]], + ['mi_5fsmall_5fsize_5fmax_144',['MI_SMALL_SIZE_MAX',['../group__extended.html#ga1ea64283508718d9d645c38efc2f4305',1,'mimalloc-doc.h']]], + ['mi_5fstats_5fmerge_145',['mi_stats_merge',['../group__extended.html#ga854b1de8cb067c7316286c28b2fcd3d1',1,'mimalloc-doc.h']]], + ['mi_5fstats_5fprint_146',['mi_stats_print',['../group__extended.html#ga2d126e5c62d3badc35445e5d84166df2',1,'mimalloc-doc.h']]], + ['mi_5fstats_5fprint_5fout_147',['mi_stats_print_out',['../group__extended.html#ga537f13b299ddf801e49a5a94fde02c79',1,'mimalloc-doc.h']]], + ['mi_5fstats_5freset_148',['mi_stats_reset',['../group__extended.html#ga3bb8468b8cfcc6e2a61d98aee85c5f99',1,'mimalloc-doc.h']]], + ['mi_5fstl_5fallocator_149',['mi_stl_allocator',['../group__cpp.html#structmi__stl__allocator',1,'']]], + ['mi_5fstrdup_150',['mi_strdup',['../group__malloc.html#gac7cffe13f1f458ed16789488bf92b9b2',1,'mimalloc-doc.h']]], + ['mi_5fstrndup_151',['mi_strndup',['../group__malloc.html#gaaabf971c2571891433477e2d21a35266',1,'mimalloc-doc.h']]], + ['mi_5fthread_5fdone_152',['mi_thread_done',['../group__extended.html#ga0ae4581e85453456a0d658b2b98bf7bf',1,'mimalloc-doc.h']]], + ['mi_5fthread_5finit_153',['mi_thread_init',['../group__extended.html#gaf8e73efc2cbca9ebfdfb166983a04c17',1,'mimalloc-doc.h']]], + ['mi_5fthread_5fstats_5fprint_5fout_154',['mi_thread_stats_print_out',['../group__extended.html#gab1dac8476c46cb9eecab767eb40c1525',1,'mimalloc-doc.h']]], + ['mi_5fusable_5fsize_155',['mi_usable_size',['../group__extended.html#ga089c859d9eddc5f9b4bd946cd53cebee',1,'mimalloc-doc.h']]], + ['mi_5fvalloc_156',['mi_valloc',['../group__posix.html#ga73baaf5951f5165ba0763d0c06b6a93b',1,'mimalloc-doc.h']]], + ['mi_5fzalloc_157',['mi_zalloc',['../group__malloc.html#gafdd9d8bb2986e668ba9884f28af38000',1,'mimalloc-doc.h']]], + ['mi_5fzalloc_5faligned_158',['mi_zalloc_aligned',['../group__aligned.html#ga0cadbcf5b89a7b6fb171bc8df8734819',1,'mimalloc-doc.h']]], + ['mi_5fzalloc_5faligned_5fat_159',['mi_zalloc_aligned_at',['../group__aligned.html#ga5f8c2353766db522565e642fafd8a3f8',1,'mimalloc-doc.h']]], + ['mi_5fzalloc_5fsmall_160',['mi_zalloc_small',['../group__extended.html#ga220f29f40a44404b0061c15bc1c31152',1,'mimalloc-doc.h']]], + ['mi_5fzalloc_5ftp_161',['mi_zalloc_tp',['../group__typed.html#gac77a61bdaf680a803785fe307820b48c',1,'mimalloc-doc.h']]] ]; diff --git a/docs/search/all_7.html b/docs/search/all_7.html index 9cd0196..8ddbf6c 100644 --- a/docs/search/all_7.html +++ b/docs/search/all_7.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/all_7.js b/docs/search/all_7.js index df03c8d..8f296aa 100644 --- a/docs/search/all_7.js +++ b/docs/search/all_7.js @@ -1,4 +1,4 @@ var searchData= [ - ['overriding_20malloc',['Overriding Malloc',['../overrides.html',1,'']]] + ['overriding_20malloc_162',['Overriding Malloc',['../overrides.html',1,'']]] ]; diff --git a/docs/search/all_8.html b/docs/search/all_8.html index 1e8fb9c..83c55ae 100644 --- a/docs/search/all_8.html +++ b/docs/search/all_8.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/all_8.js b/docs/search/all_8.js index 0651bcc..a9caa77 100644 --- a/docs/search/all_8.js +++ b/docs/search/all_8.js @@ -1,5 +1,5 @@ var searchData= [ - ['performance',['Performance',['../bench.html',1,'']]], - ['posix',['Posix',['../group__posix.html',1,'']]] + ['performance_163',['Performance',['../bench.html',1,'']]], + ['posix_164',['Posix',['../group__posix.html',1,'']]] ]; diff --git a/docs/search/all_9.html b/docs/search/all_9.html index 27df366..1e263c1 100644 --- a/docs/search/all_9.html +++ b/docs/search/all_9.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/all_9.js b/docs/search/all_9.js index cd78624..f6b4ba3 100644 --- a/docs/search/all_9.js +++ b/docs/search/all_9.js @@ -1,5 +1,5 @@ var searchData= [ - ['runtime_20options',['Runtime Options',['../group__options.html',1,'']]], - ['reserved',['reserved',['../group__analysis.html#ae848a3e6840414891035423948ca0383',1,'mi_heap_area_t']]] + ['reserved_165',['reserved',['../group__analysis.html#ae848a3e6840414891035423948ca0383',1,'mi_heap_area_t']]], + ['runtime_20options_166',['Runtime Options',['../group__options.html',1,'']]] ]; diff --git a/docs/search/all_a.html b/docs/search/all_a.html index 63f9254..3a6cac1 100644 --- a/docs/search/all_a.html +++ b/docs/search/all_a.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/all_a.js b/docs/search/all_a.js index 647887f..699b545 100644 --- a/docs/search/all_a.js +++ b/docs/search/all_a.js @@ -1,4 +1,4 @@ var searchData= [ - ['typed_20macros',['Typed Macros',['../group__typed.html',1,'']]] + ['typed_20macros_167',['Typed Macros',['../group__typed.html',1,'']]] ]; diff --git a/docs/search/all_b.html b/docs/search/all_b.html index 44ae3e4..130deb4 100644 --- a/docs/search/all_b.html +++ b/docs/search/all_b.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/all_b.js b/docs/search/all_b.js index 2bc3fb6..73a2671 100644 --- a/docs/search/all_b.js +++ b/docs/search/all_b.js @@ -1,5 +1,5 @@ var searchData= [ - ['used',['used',['../group__analysis.html#ab820302c5cd0df133eb8e51650a008b4',1,'mi_heap_area_t']]], - ['using_20the_20library',['Using the library',['../using.html',1,'']]] + ['used_168',['used',['../group__analysis.html#ab820302c5cd0df133eb8e51650a008b4',1,'mi_heap_area_t']]], + ['using_20the_20library_169',['Using the library',['../using.html',1,'']]] ]; diff --git a/docs/search/all_c.html b/docs/search/all_c.html index 3de1586..3dd5af0 100644 --- a/docs/search/all_c.html +++ b/docs/search/all_c.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/all_c.js b/docs/search/all_c.js index 2b9b4ce..192fb1c 100644 --- a/docs/search/all_c.js +++ b/docs/search/all_c.js @@ -1,4 +1,4 @@ var searchData= [ - ['zero_20initialized_20re_2dallocation',['Zero initialized re-allocation',['../group__zeroinit.html',1,'']]] + ['zero_20initialized_20re_2dallocation_170',['Zero initialized re-allocation',['../group__zeroinit.html',1,'']]] ]; diff --git a/docs/search/classes_0.html b/docs/search/classes_0.html index b3c6ec6..af8159e 100644 --- a/docs/search/classes_0.html +++ b/docs/search/classes_0.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/classes_0.js b/docs/search/classes_0.js index 0010dd9..e3770fb 100644 --- a/docs/search/classes_0.js +++ b/docs/search/classes_0.js @@ -1,5 +1,5 @@ var searchData= [ - ['mi_5fheap_5farea_5ft',['mi_heap_area_t',['../group__analysis.html#structmi__heap__area__t',1,'']]], - ['mi_5fstl_5fallocator',['mi_stl_allocator',['../group__cpp.html#structmi__stl__allocator',1,'']]] + ['mi_5fheap_5farea_5ft_171',['mi_heap_area_t',['../group__analysis.html#structmi__heap__area__t',1,'']]], + ['mi_5fstl_5fallocator_172',['mi_stl_allocator',['../group__cpp.html#structmi__stl__allocator',1,'']]] ]; diff --git a/docs/search/enums_0.html b/docs/search/enums_0.html index 7040a9c..141fff5 100644 --- a/docs/search/enums_0.html +++ b/docs/search/enums_0.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/enums_0.js b/docs/search/enums_0.js index f0c1ba5..6f1f383 100644 --- a/docs/search/enums_0.js +++ b/docs/search/enums_0.js @@ -1,4 +1,4 @@ var searchData= [ - ['mi_5foption_5ft',['mi_option_t',['../group__options.html#gafebf7ed116adb38ae5218bc3ce06884c',1,'mimalloc-doc.h']]] + ['mi_5foption_5ft_296',['mi_option_t',['../group__options.html#gafebf7ed116adb38ae5218bc3ce06884c',1,'mimalloc-doc.h']]] ]; diff --git a/docs/search/enumvalues_0.html b/docs/search/enumvalues_0.html index 78895c7..0d131d9 100644 --- a/docs/search/enumvalues_0.html +++ b/docs/search/enumvalues_0.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/enumvalues_0.js b/docs/search/enumvalues_0.js index 7054b6d..1aca63b 100644 --- a/docs/search/enumvalues_0.js +++ b/docs/search/enumvalues_0.js @@ -1,4 +1,4 @@ var searchData= [ - ['_5fmi_5foption_5flast',['_mi_option_last',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca5b4357b74be0d87568036c32eb1a2e4a',1,'mimalloc-doc.h']]] + ['_5fmi_5foption_5flast_297',['_mi_option_last',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca5b4357b74be0d87568036c32eb1a2e4a',1,'mimalloc-doc.h']]] ]; diff --git a/docs/search/enumvalues_1.html b/docs/search/enumvalues_1.html index 9b02a4b..cd9187a 100644 --- a/docs/search/enumvalues_1.html +++ b/docs/search/enumvalues_1.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/enumvalues_1.js b/docs/search/enumvalues_1.js index 3b71270..bd525bb 100644 --- a/docs/search/enumvalues_1.js +++ b/docs/search/enumvalues_1.js @@ -1,18 +1,19 @@ var searchData= [ - ['mi_5foption_5feager_5fcommit',['mi_option_eager_commit',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca1e8de72c93da7ff22d91e1e27b52ac2b',1,'mimalloc-doc.h']]], - ['mi_5foption_5feager_5fcommit_5fdelay',['mi_option_eager_commit_delay',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca17a190c25be381142d87e0468c4c068c',1,'mimalloc-doc.h']]], - ['mi_5foption_5feager_5fregion_5fcommit',['mi_option_eager_region_commit',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca32ce97ece29f69e82579679cf8a307ad',1,'mimalloc-doc.h']]], - ['mi_5foption_5flarge_5fos_5fpages',['mi_option_large_os_pages',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca4192d491200d0055df0554d4cf65054e',1,'mimalloc-doc.h']]], - ['mi_5foption_5fos_5ftag',['mi_option_os_tag',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca4b74ae2a69e445de6c2361b73c1d14bf',1,'mimalloc-doc.h']]], - ['mi_5foption_5fpage_5freset',['mi_option_page_reset',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884cada854dd272c66342f18a93ee254a2968',1,'mimalloc-doc.h']]], - ['mi_5foption_5freserve_5fhuge_5fos_5fpages',['mi_option_reserve_huge_os_pages',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884caca7ed041be3b0b9d0b82432c7bf41af2',1,'mimalloc-doc.h']]], - ['mi_5foption_5freset_5fdecommits',['mi_option_reset_decommits',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884cac81ee965b130fa81238913a3c239d536',1,'mimalloc-doc.h']]], - ['mi_5foption_5freset_5fdelay',['mi_option_reset_delay',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca154fe170131d5212cff57e22b99523c5',1,'mimalloc-doc.h']]], - ['mi_5foption_5fsegment_5fcache',['mi_option_segment_cache',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca2ecbe7ef32f5c84de3739aa4f0b805a1',1,'mimalloc-doc.h']]], - ['mi_5foption_5fsegment_5freset',['mi_option_segment_reset',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884cafb121d30d87591850d5410ccc3a95c6d',1,'mimalloc-doc.h']]], - ['mi_5foption_5fshow_5ferrors',['mi_option_show_errors',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884cafbf4822e5c00732c5984b32a032837f0',1,'mimalloc-doc.h']]], - ['mi_5foption_5fshow_5fstats',['mi_option_show_stats',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca0957ef73b2550764b4840edf48422fda',1,'mimalloc-doc.h']]], - ['mi_5foption_5fuse_5fnuma_5fnodes',['mi_option_use_numa_nodes',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca0ac33a18f6b659fcfaf44efb0bab1b74',1,'mimalloc-doc.h']]], - ['mi_5foption_5fverbose',['mi_option_verbose',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca7c8b7bf5281c581bad64f5daa6442777',1,'mimalloc-doc.h']]] + ['mi_5foption_5feager_5fcommit_298',['mi_option_eager_commit',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca1e8de72c93da7ff22d91e1e27b52ac2b',1,'mimalloc-doc.h']]], + ['mi_5foption_5feager_5fcommit_5fdelay_299',['mi_option_eager_commit_delay',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca17a190c25be381142d87e0468c4c068c',1,'mimalloc-doc.h']]], + ['mi_5foption_5feager_5fregion_5fcommit_300',['mi_option_eager_region_commit',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca32ce97ece29f69e82579679cf8a307ad',1,'mimalloc-doc.h']]], + ['mi_5foption_5flarge_5fos_5fpages_301',['mi_option_large_os_pages',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca4192d491200d0055df0554d4cf65054e',1,'mimalloc-doc.h']]], + ['mi_5foption_5fos_5ftag_302',['mi_option_os_tag',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca4b74ae2a69e445de6c2361b73c1d14bf',1,'mimalloc-doc.h']]], + ['mi_5foption_5fpage_5freset_303',['mi_option_page_reset',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884cada854dd272c66342f18a93ee254a2968',1,'mimalloc-doc.h']]], + ['mi_5foption_5freserve_5fhuge_5fos_5fpages_304',['mi_option_reserve_huge_os_pages',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884caca7ed041be3b0b9d0b82432c7bf41af2',1,'mimalloc-doc.h']]], + ['mi_5foption_5freserve_5fhuge_5fos_5fpages_5fat_305',['mi_option_reserve_huge_os_pages_at',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884caa13e7926d4339d2aa6fbf61d4473fd5c',1,'mimalloc-doc.h']]], + ['mi_5foption_5freset_5fdecommits_306',['mi_option_reset_decommits',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884cac81ee965b130fa81238913a3c239d536',1,'mimalloc-doc.h']]], + ['mi_5foption_5freset_5fdelay_307',['mi_option_reset_delay',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca154fe170131d5212cff57e22b99523c5',1,'mimalloc-doc.h']]], + ['mi_5foption_5fsegment_5fcache_308',['mi_option_segment_cache',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca2ecbe7ef32f5c84de3739aa4f0b805a1',1,'mimalloc-doc.h']]], + ['mi_5foption_5fsegment_5freset_309',['mi_option_segment_reset',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884cafb121d30d87591850d5410ccc3a95c6d',1,'mimalloc-doc.h']]], + ['mi_5foption_5fshow_5ferrors_310',['mi_option_show_errors',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884cafbf4822e5c00732c5984b32a032837f0',1,'mimalloc-doc.h']]], + ['mi_5foption_5fshow_5fstats_311',['mi_option_show_stats',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca0957ef73b2550764b4840edf48422fda',1,'mimalloc-doc.h']]], + ['mi_5foption_5fuse_5fnuma_5fnodes_312',['mi_option_use_numa_nodes',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca0ac33a18f6b659fcfaf44efb0bab1b74',1,'mimalloc-doc.h']]], + ['mi_5foption_5fverbose_313',['mi_option_verbose',['../group__options.html#ggafebf7ed116adb38ae5218bc3ce06884ca7c8b7bf5281c581bad64f5daa6442777',1,'mimalloc-doc.h']]] ]; diff --git a/docs/search/functions_0.html b/docs/search/functions_0.html index bc73761..eb4c501 100644 --- a/docs/search/functions_0.html +++ b/docs/search/functions_0.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/functions_0.js b/docs/search/functions_0.js index b188b27..b44917a 100644 --- a/docs/search/functions_0.js +++ b/docs/search/functions_0.js @@ -1,113 +1,116 @@ var searchData= [ - ['mi_5f_5fposix_5fmemalign',['mi__posix_memalign',['../group__posix.html#gad5a69c8fea96aa2b7a7c818c2130090a',1,'mimalloc-doc.h']]], - ['mi_5faligned_5falloc',['mi_aligned_alloc',['../group__posix.html#ga1326d2e4388630b5f81ca7206318b8e5',1,'mimalloc-doc.h']]], - ['mi_5fcalloc',['mi_calloc',['../group__malloc.html#ga97fedb4f7107c592fd7f0f0a8949a57d',1,'mimalloc-doc.h']]], - ['mi_5fcalloc_5faligned',['mi_calloc_aligned',['../group__aligned.html#ga53dddb4724042a90315b94bc268fb4c9',1,'mimalloc-doc.h']]], - ['mi_5fcalloc_5faligned_5fat',['mi_calloc_aligned_at',['../group__aligned.html#ga08647c4593f3b2eef24a919a73eba3a3',1,'mimalloc-doc.h']]], - ['mi_5fcfree',['mi_cfree',['../group__posix.html#ga705dc7a64bffacfeeb0141501a5c35d7',1,'mimalloc-doc.h']]], - ['mi_5fcheck_5fowned',['mi_check_owned',['../group__analysis.html#ga628c237489c2679af84a4d0d143b3dd5',1,'mimalloc-doc.h']]], - ['mi_5fcollect',['mi_collect',['../group__extended.html#ga421430e2226d7d468529cec457396756',1,'mimalloc-doc.h']]], - ['mi_5fexpand',['mi_expand',['../group__malloc.html#gaaee66a1d483c3e28f585525fb96707e4',1,'mimalloc-doc.h']]], - ['mi_5ffree',['mi_free',['../group__malloc.html#gaf2c7b89c327d1f60f59e68b9ea644d95',1,'mimalloc-doc.h']]], - ['mi_5ffree_5faligned',['mi_free_aligned',['../group__posix.html#ga0d28d5cf61e6bfbb18c63092939fe5c9',1,'mimalloc-doc.h']]], - ['mi_5ffree_5fsize',['mi_free_size',['../group__posix.html#gae01389eedab8d67341ff52e2aad80ebb',1,'mimalloc-doc.h']]], - ['mi_5ffree_5fsize_5faligned',['mi_free_size_aligned',['../group__posix.html#ga72e9d7ffb5fe94d69bc722c8506e27bc',1,'mimalloc-doc.h']]], - ['mi_5fgood_5fsize',['mi_good_size',['../group__extended.html#gac057927cd06c854b45fe7847e921bd47',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fcalloc',['mi_heap_calloc',['../group__heap.html#gaa6702b3c48e9e53e50e81b36f5011d55',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fcalloc_5faligned',['mi_heap_calloc_aligned',['../group__heap.html#ga4af03a6e2b93fae77424d93f889705c3',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fcalloc_5faligned_5fat',['mi_heap_calloc_aligned_at',['../group__heap.html#ga08ca6419a5c057a4d965868998eef487',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fcheck_5fowned',['mi_heap_check_owned',['../group__analysis.html#ga0d67c1789faaa15ff366c024fcaf6377',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fcollect',['mi_heap_collect',['../group__heap.html#ga7922f7495cde30b1984d0e6072419298',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fcontains_5fblock',['mi_heap_contains_block',['../group__analysis.html#gaa862aa8ed8d57d84cae41fc1022d71af',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fdelete',['mi_heap_delete',['../group__heap.html#ga2ab1af8d438819b55319c7ef51d1e409',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fdestroy',['mi_heap_destroy',['../group__heap.html#ga9f9c0844edb9717f4feacd79116b8e0d',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fget_5fbacking',['mi_heap_get_backing',['../group__heap.html#ga5d03fbe062ffcf38f0f417fd968357fc',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fget_5fdefault',['mi_heap_get_default',['../group__heap.html#ga8db4cbb87314a989a9a187464d6b5e05',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fmalloc',['mi_heap_malloc',['../group__heap.html#ga9cbed01e42c0647907295de92c3fa296',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fmalloc_5faligned',['mi_heap_malloc_aligned',['../group__heap.html#gab5b87e1805306f70df38789fcfcf6653',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fmalloc_5faligned_5fat',['mi_heap_malloc_aligned_at',['../group__heap.html#ga23acd7680fb0976dde3783254c6c874b',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fmalloc_5fsmall',['mi_heap_malloc_small',['../group__heap.html#gaa1a1c7a1f4da6826b5a25b70ef878368',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fmallocn',['mi_heap_mallocn',['../group__heap.html#ga851da6c43fe0b71c1376cee8aef90db0',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fnew',['mi_heap_new',['../group__heap.html#ga766f672ba56f2fbfeb9d9dbb0b7f6b11',1,'mimalloc-doc.h']]], - ['mi_5fheap_5frealloc',['mi_heap_realloc',['../group__heap.html#gaaef3395f66be48f37bdc8322509c5d81',1,'mimalloc-doc.h']]], - ['mi_5fheap_5frealloc_5faligned',['mi_heap_realloc_aligned',['../group__heap.html#gafc603b696bd14cae6da28658f950d98c',1,'mimalloc-doc.h']]], - ['mi_5fheap_5frealloc_5faligned_5fat',['mi_heap_realloc_aligned_at',['../group__heap.html#gaf96c788a1bf553fe2d371de9365e047c',1,'mimalloc-doc.h']]], - ['mi_5fheap_5freallocf',['mi_heap_reallocf',['../group__heap.html#ga4a21070eb4e7cce018133c8d5f4b0527',1,'mimalloc-doc.h']]], - ['mi_5fheap_5freallocn',['mi_heap_reallocn',['../group__heap.html#gac74e94ad9b0c9b57c1c4d88b8825b7a8',1,'mimalloc-doc.h']]], - ['mi_5fheap_5frealpath',['mi_heap_realpath',['../group__heap.html#ga00e95ba1e01acac3cfd95bb7a357a6f0',1,'mimalloc-doc.h']]], - ['mi_5fheap_5frecalloc',['mi_heap_recalloc',['../group__zeroinit.html#ga8648c5fbb22a80f0262859099f06dfbd',1,'mimalloc-doc.h']]], - ['mi_5fheap_5frecalloc_5faligned',['mi_heap_recalloc_aligned',['../group__zeroinit.html#ga9f3f999396c8f77ca5e80e7b40ac29e3',1,'mimalloc-doc.h']]], - ['mi_5fheap_5frecalloc_5faligned_5fat',['mi_heap_recalloc_aligned_at',['../group__zeroinit.html#ga496452c96f1de8c500be9fddf52edaf7',1,'mimalloc-doc.h']]], - ['mi_5fheap_5frezalloc',['mi_heap_rezalloc',['../group__zeroinit.html#gacfad83f14eb5d6a42a497a898e19fc76',1,'mimalloc-doc.h']]], - ['mi_5fheap_5frezalloc_5faligned',['mi_heap_rezalloc_aligned',['../group__zeroinit.html#ga375fa8a611c51905e592d5d467c49664',1,'mimalloc-doc.h']]], - ['mi_5fheap_5frezalloc_5faligned_5fat',['mi_heap_rezalloc_aligned_at',['../group__zeroinit.html#gac90da54fa7e5d10bdc97ce0b51dce2eb',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fset_5fdefault',['mi_heap_set_default',['../group__heap.html#gab8631ec88c8d26641b68b5d25dcd4422',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fstrdup',['mi_heap_strdup',['../group__heap.html#ga139d6b09dbf50c3c2523d0f4d1cfdeb5',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fstrndup',['mi_heap_strndup',['../group__heap.html#ga8e3dbd46650dd26573cf307a2c8f1f5a',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fvisit_5fblocks',['mi_heap_visit_blocks',['../group__analysis.html#ga70c46687dc6e9dc98b232b02646f8bed',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fzalloc',['mi_heap_zalloc',['../group__heap.html#ga903104592c8ed53417a3762da6241133',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fzalloc_5faligned',['mi_heap_zalloc_aligned',['../group__heap.html#gaa450a59c6c7ae5fdbd1c2b80a8329ef0',1,'mimalloc-doc.h']]], - ['mi_5fheap_5fzalloc_5faligned_5fat',['mi_heap_zalloc_aligned_at',['../group__heap.html#ga45fb43a62776fbebbdf1edd99b527954',1,'mimalloc-doc.h']]], - ['mi_5fis_5fin_5fheap_5fregion',['mi_is_in_heap_region',['../group__extended.html#ga5f071b10d4df1c3658e04e7fd67a94e6',1,'mimalloc-doc.h']]], - ['mi_5fis_5fredirected',['mi_is_redirected',['../group__extended.html#gaad25050b19f30cd79397b227e0157a3f',1,'mimalloc-doc.h']]], - ['mi_5fmalloc',['mi_malloc',['../group__malloc.html#ga3406e8b168bc74c8637b11571a6da83a',1,'mimalloc-doc.h']]], - ['mi_5fmalloc_5faligned',['mi_malloc_aligned',['../group__aligned.html#ga68930196751fa2cca9e1fd0d71bade56',1,'mimalloc-doc.h']]], - ['mi_5fmalloc_5faligned_5fat',['mi_malloc_aligned_at',['../group__aligned.html#ga5850da130c936bd77db039dcfbc8295d',1,'mimalloc-doc.h']]], - ['mi_5fmalloc_5fsize',['mi_malloc_size',['../group__posix.html#ga4531c9e775bb3ae12db57c1ba8a5d7de',1,'mimalloc-doc.h']]], - ['mi_5fmalloc_5fsmall',['mi_malloc_small',['../group__extended.html#ga7136c2e55cb22c98ecf95d08d6debb99',1,'mimalloc-doc.h']]], - ['mi_5fmalloc_5fusable_5fsize',['mi_malloc_usable_size',['../group__posix.html#ga06d07cf357bbac5c73ba5d0c0c421e17',1,'mimalloc-doc.h']]], - ['mi_5fmallocn',['mi_mallocn',['../group__malloc.html#ga0b05e2bf0f73e7401ae08597ff782ac6',1,'mimalloc-doc.h']]], - ['mi_5fmemalign',['mi_memalign',['../group__posix.html#gaab7fa71ea93b96873f5d9883db57d40e',1,'mimalloc-doc.h']]], - ['mi_5fnew',['mi_new',['../group__cpp.html#gaad048a9fce3d02c5909cd05c6ec24545',1,'mimalloc-doc.h']]], - ['mi_5fnew_5faligned',['mi_new_aligned',['../group__cpp.html#gaef2c2bdb4f70857902d3c8903ac095f3',1,'mimalloc-doc.h']]], - ['mi_5fnew_5faligned_5fnothrow',['mi_new_aligned_nothrow',['../group__cpp.html#gab5e29558926d934c3f1cae8c815f942c',1,'mimalloc-doc.h']]], - ['mi_5fnew_5fn',['mi_new_n',['../group__cpp.html#gae7bc4f56cd57ed3359060ff4f38bda81',1,'mimalloc-doc.h']]], - ['mi_5fnew_5fnothrow',['mi_new_nothrow',['../group__cpp.html#gaeaded64eda71ed6b1d569d3e723abc4a',1,'mimalloc-doc.h']]], - ['mi_5fnew_5frealloc',['mi_new_realloc',['../group__cpp.html#gaab78a32f55149e9fbf432d5288e38e1e',1,'mimalloc-doc.h']]], - ['mi_5fnew_5freallocn',['mi_new_reallocn',['../group__cpp.html#ga756f4b2bc6a7ecd0a90baea8e90c7907',1,'mimalloc-doc.h']]], - ['mi_5foption_5fdisable',['mi_option_disable',['../group__options.html#gaebf6ff707a2e688ebb1a2296ca564054',1,'mimalloc-doc.h']]], - ['mi_5foption_5fenable',['mi_option_enable',['../group__options.html#ga04180ae41b0d601421dd62ced40ca050',1,'mimalloc-doc.h']]], - ['mi_5foption_5fget',['mi_option_get',['../group__options.html#ga7e8af195cc81d3fa64ccf2662caa565a',1,'mimalloc-doc.h']]], - ['mi_5foption_5fis_5fenabled',['mi_option_is_enabled',['../group__options.html#ga459ad98f18b3fc9275474807fe0ca188',1,'mimalloc-doc.h']]], - ['mi_5foption_5fset',['mi_option_set',['../group__options.html#gaf84921c32375e25754dc2ee6a911fa60',1,'mimalloc-doc.h']]], - ['mi_5foption_5fset_5fdefault',['mi_option_set_default',['../group__options.html#ga7ef623e440e6e5545cb08c94e71e4b90',1,'mimalloc-doc.h']]], - ['mi_5foption_5fset_5fenabled',['mi_option_set_enabled',['../group__options.html#ga9a13d05fcb77489cb06d4d017ebd8bed',1,'mimalloc-doc.h']]], - ['mi_5foption_5fset_5fenabled_5fdefault',['mi_option_set_enabled_default',['../group__options.html#ga65518b69ec5d32336b50e07f74b3f629',1,'mimalloc-doc.h']]], - ['mi_5fposix_5fmemalign',['mi_posix_memalign',['../group__posix.html#gacff84f226ba9feb2031b8992e5579447',1,'mimalloc-doc.h']]], - ['mi_5fprocess_5finfo',['mi_process_info',['../group__extended.html#ga7d862c2affd5790381da14eb102a364d',1,'mimalloc-doc.h']]], - ['mi_5fpvalloc',['mi_pvalloc',['../group__posix.html#gaeb325c39b887d3b90d85d1eb1712fb1e',1,'mimalloc-doc.h']]], - ['mi_5frealloc',['mi_realloc',['../group__malloc.html#gaf11eb497da57bdfb2de65eb191c69db6',1,'mimalloc-doc.h']]], - ['mi_5frealloc_5faligned',['mi_realloc_aligned',['../group__aligned.html#ga4028d1cf4aa4c87c880747044a8322ae',1,'mimalloc-doc.h']]], - ['mi_5frealloc_5faligned_5fat',['mi_realloc_aligned_at',['../group__aligned.html#gaf66a9ae6c6f08bd6be6fb6ea771faffb',1,'mimalloc-doc.h']]], - ['mi_5freallocarray',['mi_reallocarray',['../group__posix.html#ga48fad8648a2f1dab9c87ea9448a52088',1,'mimalloc-doc.h']]], - ['mi_5freallocf',['mi_reallocf',['../group__malloc.html#gafe68ac7c5e24a65cd55c9d6b152211a0',1,'mimalloc-doc.h']]], - ['mi_5freallocn',['mi_reallocn',['../group__malloc.html#ga61d57b4144ba24fba5c1e9b956d13853',1,'mimalloc-doc.h']]], - ['mi_5frealpath',['mi_realpath',['../group__malloc.html#ga08cec32dd5bbe7da91c78d19f1b5bebe',1,'mimalloc-doc.h']]], - ['mi_5frecalloc',['mi_recalloc',['../group__malloc.html#ga23a0fbb452b5dce8e31fab1a1958cacc',1,'mimalloc-doc.h']]], - ['mi_5frecalloc_5faligned',['mi_recalloc_aligned',['../group__zeroinit.html#ga3e7e5c291acf1c7fd7ffd9914a9f945f',1,'mimalloc-doc.h']]], - ['mi_5frecalloc_5faligned_5fat',['mi_recalloc_aligned_at',['../group__zeroinit.html#ga4ff5e92ad73585418a072c9d059e5cf9',1,'mimalloc-doc.h']]], - ['mi_5fregister_5fdeferred_5ffree',['mi_register_deferred_free',['../group__extended.html#ga3460a6ca91af97be4058f523d3cb8ece',1,'mimalloc-doc.h']]], - ['mi_5fregister_5ferror',['mi_register_error',['../group__extended.html#gaa1d55e0e894be240827e5d87ec3a1f45',1,'mimalloc-doc.h']]], - ['mi_5fregister_5foutput',['mi_register_output',['../group__extended.html#gae5b17ff027cd2150b43a33040250cf3f',1,'mimalloc-doc.h']]], - ['mi_5freserve_5fhuge_5fos_5fpages_5fat',['mi_reserve_huge_os_pages_at',['../group__extended.html#ga7795a13d20087447281858d2c771cca1',1,'mimalloc-doc.h']]], - ['mi_5freserve_5fhuge_5fos_5fpages_5finterleave',['mi_reserve_huge_os_pages_interleave',['../group__extended.html#ga3132f521fb756fc0e8ec0b74fb58df50',1,'mimalloc-doc.h']]], - ['mi_5frezalloc',['mi_rezalloc',['../group__zeroinit.html#ga8c292e142110229a2980b37ab036dbc6',1,'mimalloc-doc.h']]], - ['mi_5frezalloc_5faligned',['mi_rezalloc_aligned',['../group__zeroinit.html#gacd71a7bce96aab38ae6de17af2eb2cf0',1,'mimalloc-doc.h']]], - ['mi_5frezalloc_5faligned_5fat',['mi_rezalloc_aligned_at',['../group__zeroinit.html#gae8b358c417e61d5307da002702b0a8e1',1,'mimalloc-doc.h']]], - ['mi_5fstats_5fmerge',['mi_stats_merge',['../group__extended.html#ga854b1de8cb067c7316286c28b2fcd3d1',1,'mimalloc-doc.h']]], - ['mi_5fstats_5fprint',['mi_stats_print',['../group__extended.html#ga2d126e5c62d3badc35445e5d84166df2',1,'mimalloc-doc.h']]], - ['mi_5fstats_5fprint_5fout',['mi_stats_print_out',['../group__extended.html#ga537f13b299ddf801e49a5a94fde02c79',1,'mimalloc-doc.h']]], - ['mi_5fstats_5freset',['mi_stats_reset',['../group__extended.html#ga3bb8468b8cfcc6e2a61d98aee85c5f99',1,'mimalloc-doc.h']]], - ['mi_5fstrdup',['mi_strdup',['../group__malloc.html#gac7cffe13f1f458ed16789488bf92b9b2',1,'mimalloc-doc.h']]], - ['mi_5fstrndup',['mi_strndup',['../group__malloc.html#gaaabf971c2571891433477e2d21a35266',1,'mimalloc-doc.h']]], - ['mi_5fthread_5fdone',['mi_thread_done',['../group__extended.html#ga0ae4581e85453456a0d658b2b98bf7bf',1,'mimalloc-doc.h']]], - ['mi_5fthread_5finit',['mi_thread_init',['../group__extended.html#gaf8e73efc2cbca9ebfdfb166983a04c17',1,'mimalloc-doc.h']]], - ['mi_5fthread_5fstats_5fprint_5fout',['mi_thread_stats_print_out',['../group__extended.html#gab1dac8476c46cb9eecab767eb40c1525',1,'mimalloc-doc.h']]], - ['mi_5fusable_5fsize',['mi_usable_size',['../group__extended.html#ga089c859d9eddc5f9b4bd946cd53cebee',1,'mimalloc-doc.h']]], - ['mi_5fvalloc',['mi_valloc',['../group__posix.html#ga73baaf5951f5165ba0763d0c06b6a93b',1,'mimalloc-doc.h']]], - ['mi_5fzalloc',['mi_zalloc',['../group__malloc.html#gafdd9d8bb2986e668ba9884f28af38000',1,'mimalloc-doc.h']]], - ['mi_5fzalloc_5faligned',['mi_zalloc_aligned',['../group__aligned.html#ga0cadbcf5b89a7b6fb171bc8df8734819',1,'mimalloc-doc.h']]], - ['mi_5fzalloc_5faligned_5fat',['mi_zalloc_aligned_at',['../group__aligned.html#ga5f8c2353766db522565e642fafd8a3f8',1,'mimalloc-doc.h']]], - ['mi_5fzalloc_5fsmall',['mi_zalloc_small',['../group__extended.html#ga220f29f40a44404b0061c15bc1c31152',1,'mimalloc-doc.h']]] + ['mi_5f_5fposix_5fmemalign_173',['mi__posix_memalign',['../group__posix.html#gad5a69c8fea96aa2b7a7c818c2130090a',1,'mimalloc-doc.h']]], + ['mi_5faligned_5falloc_174',['mi_aligned_alloc',['../group__posix.html#ga1326d2e4388630b5f81ca7206318b8e5',1,'mimalloc-doc.h']]], + ['mi_5fcalloc_175',['mi_calloc',['../group__malloc.html#ga97fedb4f7107c592fd7f0f0a8949a57d',1,'mimalloc-doc.h']]], + ['mi_5fcalloc_5faligned_176',['mi_calloc_aligned',['../group__aligned.html#ga53dddb4724042a90315b94bc268fb4c9',1,'mimalloc-doc.h']]], + ['mi_5fcalloc_5faligned_5fat_177',['mi_calloc_aligned_at',['../group__aligned.html#ga08647c4593f3b2eef24a919a73eba3a3',1,'mimalloc-doc.h']]], + ['mi_5fcfree_178',['mi_cfree',['../group__posix.html#ga705dc7a64bffacfeeb0141501a5c35d7',1,'mimalloc-doc.h']]], + ['mi_5fcheck_5fowned_179',['mi_check_owned',['../group__analysis.html#ga628c237489c2679af84a4d0d143b3dd5',1,'mimalloc-doc.h']]], + ['mi_5fcollect_180',['mi_collect',['../group__extended.html#ga421430e2226d7d468529cec457396756',1,'mimalloc-doc.h']]], + ['mi_5fexpand_181',['mi_expand',['../group__malloc.html#gaaee66a1d483c3e28f585525fb96707e4',1,'mimalloc-doc.h']]], + ['mi_5ffree_182',['mi_free',['../group__malloc.html#gaf2c7b89c327d1f60f59e68b9ea644d95',1,'mimalloc-doc.h']]], + ['mi_5ffree_5faligned_183',['mi_free_aligned',['../group__posix.html#ga0d28d5cf61e6bfbb18c63092939fe5c9',1,'mimalloc-doc.h']]], + ['mi_5ffree_5fsize_184',['mi_free_size',['../group__posix.html#gae01389eedab8d67341ff52e2aad80ebb',1,'mimalloc-doc.h']]], + ['mi_5ffree_5fsize_5faligned_185',['mi_free_size_aligned',['../group__posix.html#ga72e9d7ffb5fe94d69bc722c8506e27bc',1,'mimalloc-doc.h']]], + ['mi_5fgood_5fsize_186',['mi_good_size',['../group__extended.html#gac057927cd06c854b45fe7847e921bd47',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fcalloc_187',['mi_heap_calloc',['../group__heap.html#gaa6702b3c48e9e53e50e81b36f5011d55',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fcalloc_5faligned_188',['mi_heap_calloc_aligned',['../group__heap.html#ga4af03a6e2b93fae77424d93f889705c3',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fcalloc_5faligned_5fat_189',['mi_heap_calloc_aligned_at',['../group__heap.html#ga08ca6419a5c057a4d965868998eef487',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fcheck_5fowned_190',['mi_heap_check_owned',['../group__analysis.html#ga0d67c1789faaa15ff366c024fcaf6377',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fcollect_191',['mi_heap_collect',['../group__heap.html#ga7922f7495cde30b1984d0e6072419298',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fcontains_5fblock_192',['mi_heap_contains_block',['../group__analysis.html#gaa862aa8ed8d57d84cae41fc1022d71af',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fdelete_193',['mi_heap_delete',['../group__heap.html#ga2ab1af8d438819b55319c7ef51d1e409',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fdestroy_194',['mi_heap_destroy',['../group__heap.html#ga9f9c0844edb9717f4feacd79116b8e0d',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fget_5fbacking_195',['mi_heap_get_backing',['../group__heap.html#ga5d03fbe062ffcf38f0f417fd968357fc',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fget_5fdefault_196',['mi_heap_get_default',['../group__heap.html#ga8db4cbb87314a989a9a187464d6b5e05',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fmalloc_197',['mi_heap_malloc',['../group__heap.html#ga9cbed01e42c0647907295de92c3fa296',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fmalloc_5faligned_198',['mi_heap_malloc_aligned',['../group__heap.html#gab5b87e1805306f70df38789fcfcf6653',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fmalloc_5faligned_5fat_199',['mi_heap_malloc_aligned_at',['../group__heap.html#ga23acd7680fb0976dde3783254c6c874b',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fmalloc_5fsmall_200',['mi_heap_malloc_small',['../group__heap.html#gaa1a1c7a1f4da6826b5a25b70ef878368',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fmallocn_201',['mi_heap_mallocn',['../group__heap.html#ga851da6c43fe0b71c1376cee8aef90db0',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fnew_202',['mi_heap_new',['../group__heap.html#ga766f672ba56f2fbfeb9d9dbb0b7f6b11',1,'mimalloc-doc.h']]], + ['mi_5fheap_5frealloc_203',['mi_heap_realloc',['../group__heap.html#gaaef3395f66be48f37bdc8322509c5d81',1,'mimalloc-doc.h']]], + ['mi_5fheap_5frealloc_5faligned_204',['mi_heap_realloc_aligned',['../group__heap.html#gafc603b696bd14cae6da28658f950d98c',1,'mimalloc-doc.h']]], + ['mi_5fheap_5frealloc_5faligned_5fat_205',['mi_heap_realloc_aligned_at',['../group__heap.html#gaf96c788a1bf553fe2d371de9365e047c',1,'mimalloc-doc.h']]], + ['mi_5fheap_5freallocf_206',['mi_heap_reallocf',['../group__heap.html#ga4a21070eb4e7cce018133c8d5f4b0527',1,'mimalloc-doc.h']]], + ['mi_5fheap_5freallocn_207',['mi_heap_reallocn',['../group__heap.html#gac74e94ad9b0c9b57c1c4d88b8825b7a8',1,'mimalloc-doc.h']]], + ['mi_5fheap_5frealpath_208',['mi_heap_realpath',['../group__heap.html#ga00e95ba1e01acac3cfd95bb7a357a6f0',1,'mimalloc-doc.h']]], + ['mi_5fheap_5frecalloc_209',['mi_heap_recalloc',['../group__zeroinit.html#ga8648c5fbb22a80f0262859099f06dfbd',1,'mimalloc-doc.h']]], + ['mi_5fheap_5frecalloc_5faligned_210',['mi_heap_recalloc_aligned',['../group__zeroinit.html#ga9f3f999396c8f77ca5e80e7b40ac29e3',1,'mimalloc-doc.h']]], + ['mi_5fheap_5frecalloc_5faligned_5fat_211',['mi_heap_recalloc_aligned_at',['../group__zeroinit.html#ga496452c96f1de8c500be9fddf52edaf7',1,'mimalloc-doc.h']]], + ['mi_5fheap_5frezalloc_212',['mi_heap_rezalloc',['../group__zeroinit.html#gacfad83f14eb5d6a42a497a898e19fc76',1,'mimalloc-doc.h']]], + ['mi_5fheap_5frezalloc_5faligned_213',['mi_heap_rezalloc_aligned',['../group__zeroinit.html#ga375fa8a611c51905e592d5d467c49664',1,'mimalloc-doc.h']]], + ['mi_5fheap_5frezalloc_5faligned_5fat_214',['mi_heap_rezalloc_aligned_at',['../group__zeroinit.html#gac90da54fa7e5d10bdc97ce0b51dce2eb',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fset_5fdefault_215',['mi_heap_set_default',['../group__heap.html#gab8631ec88c8d26641b68b5d25dcd4422',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fstrdup_216',['mi_heap_strdup',['../group__heap.html#ga139d6b09dbf50c3c2523d0f4d1cfdeb5',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fstrndup_217',['mi_heap_strndup',['../group__heap.html#ga8e3dbd46650dd26573cf307a2c8f1f5a',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fvisit_5fblocks_218',['mi_heap_visit_blocks',['../group__analysis.html#ga70c46687dc6e9dc98b232b02646f8bed',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fzalloc_219',['mi_heap_zalloc',['../group__heap.html#ga903104592c8ed53417a3762da6241133',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fzalloc_5faligned_220',['mi_heap_zalloc_aligned',['../group__heap.html#gaa450a59c6c7ae5fdbd1c2b80a8329ef0',1,'mimalloc-doc.h']]], + ['mi_5fheap_5fzalloc_5faligned_5fat_221',['mi_heap_zalloc_aligned_at',['../group__heap.html#ga45fb43a62776fbebbdf1edd99b527954',1,'mimalloc-doc.h']]], + ['mi_5fis_5fin_5fheap_5fregion_222',['mi_is_in_heap_region',['../group__extended.html#ga5f071b10d4df1c3658e04e7fd67a94e6',1,'mimalloc-doc.h']]], + ['mi_5fis_5fredirected_223',['mi_is_redirected',['../group__extended.html#gaad25050b19f30cd79397b227e0157a3f',1,'mimalloc-doc.h']]], + ['mi_5fmalloc_224',['mi_malloc',['../group__malloc.html#ga3406e8b168bc74c8637b11571a6da83a',1,'mimalloc-doc.h']]], + ['mi_5fmalloc_5faligned_225',['mi_malloc_aligned',['../group__aligned.html#ga68930196751fa2cca9e1fd0d71bade56',1,'mimalloc-doc.h']]], + ['mi_5fmalloc_5faligned_5fat_226',['mi_malloc_aligned_at',['../group__aligned.html#ga5850da130c936bd77db039dcfbc8295d',1,'mimalloc-doc.h']]], + ['mi_5fmalloc_5fsize_227',['mi_malloc_size',['../group__posix.html#ga4531c9e775bb3ae12db57c1ba8a5d7de',1,'mimalloc-doc.h']]], + ['mi_5fmalloc_5fsmall_228',['mi_malloc_small',['../group__extended.html#ga7136c2e55cb22c98ecf95d08d6debb99',1,'mimalloc-doc.h']]], + ['mi_5fmalloc_5fusable_5fsize_229',['mi_malloc_usable_size',['../group__posix.html#ga06d07cf357bbac5c73ba5d0c0c421e17',1,'mimalloc-doc.h']]], + ['mi_5fmallocn_230',['mi_mallocn',['../group__malloc.html#ga0b05e2bf0f73e7401ae08597ff782ac6',1,'mimalloc-doc.h']]], + ['mi_5fmanage_5fos_5fmemory_231',['mi_manage_os_memory',['../group__extended.html#ga4c6486a1fdcd7a423b5f25fe4be8e0cf',1,'mimalloc-doc.h']]], + ['mi_5fmemalign_232',['mi_memalign',['../group__posix.html#gaab7fa71ea93b96873f5d9883db57d40e',1,'mimalloc-doc.h']]], + ['mi_5fnew_233',['mi_new',['../group__cpp.html#gaad048a9fce3d02c5909cd05c6ec24545',1,'mimalloc-doc.h']]], + ['mi_5fnew_5faligned_234',['mi_new_aligned',['../group__cpp.html#gaef2c2bdb4f70857902d3c8903ac095f3',1,'mimalloc-doc.h']]], + ['mi_5fnew_5faligned_5fnothrow_235',['mi_new_aligned_nothrow',['../group__cpp.html#gab5e29558926d934c3f1cae8c815f942c',1,'mimalloc-doc.h']]], + ['mi_5fnew_5fn_236',['mi_new_n',['../group__cpp.html#gae7bc4f56cd57ed3359060ff4f38bda81',1,'mimalloc-doc.h']]], + ['mi_5fnew_5fnothrow_237',['mi_new_nothrow',['../group__cpp.html#gaeaded64eda71ed6b1d569d3e723abc4a',1,'mimalloc-doc.h']]], + ['mi_5fnew_5frealloc_238',['mi_new_realloc',['../group__cpp.html#gaab78a32f55149e9fbf432d5288e38e1e',1,'mimalloc-doc.h']]], + ['mi_5fnew_5freallocn_239',['mi_new_reallocn',['../group__cpp.html#ga756f4b2bc6a7ecd0a90baea8e90c7907',1,'mimalloc-doc.h']]], + ['mi_5foption_5fdisable_240',['mi_option_disable',['../group__options.html#gaebf6ff707a2e688ebb1a2296ca564054',1,'mimalloc-doc.h']]], + ['mi_5foption_5fenable_241',['mi_option_enable',['../group__options.html#ga04180ae41b0d601421dd62ced40ca050',1,'mimalloc-doc.h']]], + ['mi_5foption_5fget_242',['mi_option_get',['../group__options.html#ga7e8af195cc81d3fa64ccf2662caa565a',1,'mimalloc-doc.h']]], + ['mi_5foption_5fis_5fenabled_243',['mi_option_is_enabled',['../group__options.html#ga459ad98f18b3fc9275474807fe0ca188',1,'mimalloc-doc.h']]], + ['mi_5foption_5fset_244',['mi_option_set',['../group__options.html#gaf84921c32375e25754dc2ee6a911fa60',1,'mimalloc-doc.h']]], + ['mi_5foption_5fset_5fdefault_245',['mi_option_set_default',['../group__options.html#ga7ef623e440e6e5545cb08c94e71e4b90',1,'mimalloc-doc.h']]], + ['mi_5foption_5fset_5fenabled_246',['mi_option_set_enabled',['../group__options.html#ga9a13d05fcb77489cb06d4d017ebd8bed',1,'mimalloc-doc.h']]], + ['mi_5foption_5fset_5fenabled_5fdefault_247',['mi_option_set_enabled_default',['../group__options.html#ga65518b69ec5d32336b50e07f74b3f629',1,'mimalloc-doc.h']]], + ['mi_5fposix_5fmemalign_248',['mi_posix_memalign',['../group__posix.html#gacff84f226ba9feb2031b8992e5579447',1,'mimalloc-doc.h']]], + ['mi_5fprocess_5finfo_249',['mi_process_info',['../group__extended.html#ga7d862c2affd5790381da14eb102a364d',1,'mimalloc-doc.h']]], + ['mi_5fpvalloc_250',['mi_pvalloc',['../group__posix.html#gaeb325c39b887d3b90d85d1eb1712fb1e',1,'mimalloc-doc.h']]], + ['mi_5frealloc_251',['mi_realloc',['../group__malloc.html#gaf11eb497da57bdfb2de65eb191c69db6',1,'mimalloc-doc.h']]], + ['mi_5frealloc_5faligned_252',['mi_realloc_aligned',['../group__aligned.html#ga4028d1cf4aa4c87c880747044a8322ae',1,'mimalloc-doc.h']]], + ['mi_5frealloc_5faligned_5fat_253',['mi_realloc_aligned_at',['../group__aligned.html#gaf66a9ae6c6f08bd6be6fb6ea771faffb',1,'mimalloc-doc.h']]], + ['mi_5freallocarr_254',['mi_reallocarr',['../group__posix.html#ga7e1934d60a3e697950eeb48e042bfad5',1,'mimalloc-doc.h']]], + ['mi_5freallocarray_255',['mi_reallocarray',['../group__posix.html#ga48fad8648a2f1dab9c87ea9448a52088',1,'mimalloc-doc.h']]], + ['mi_5freallocf_256',['mi_reallocf',['../group__malloc.html#gafe68ac7c5e24a65cd55c9d6b152211a0',1,'mimalloc-doc.h']]], + ['mi_5freallocn_257',['mi_reallocn',['../group__malloc.html#ga61d57b4144ba24fba5c1e9b956d13853',1,'mimalloc-doc.h']]], + ['mi_5frealpath_258',['mi_realpath',['../group__malloc.html#ga08cec32dd5bbe7da91c78d19f1b5bebe',1,'mimalloc-doc.h']]], + ['mi_5frecalloc_259',['mi_recalloc',['../group__malloc.html#ga23a0fbb452b5dce8e31fab1a1958cacc',1,'mimalloc-doc.h']]], + ['mi_5frecalloc_5faligned_260',['mi_recalloc_aligned',['../group__zeroinit.html#ga3e7e5c291acf1c7fd7ffd9914a9f945f',1,'mimalloc-doc.h']]], + ['mi_5frecalloc_5faligned_5fat_261',['mi_recalloc_aligned_at',['../group__zeroinit.html#ga4ff5e92ad73585418a072c9d059e5cf9',1,'mimalloc-doc.h']]], + ['mi_5fregister_5fdeferred_5ffree_262',['mi_register_deferred_free',['../group__extended.html#ga3460a6ca91af97be4058f523d3cb8ece',1,'mimalloc-doc.h']]], + ['mi_5fregister_5ferror_263',['mi_register_error',['../group__extended.html#gaa1d55e0e894be240827e5d87ec3a1f45',1,'mimalloc-doc.h']]], + ['mi_5fregister_5foutput_264',['mi_register_output',['../group__extended.html#gae5b17ff027cd2150b43a33040250cf3f',1,'mimalloc-doc.h']]], + ['mi_5freserve_5fhuge_5fos_5fpages_5fat_265',['mi_reserve_huge_os_pages_at',['../group__extended.html#ga7795a13d20087447281858d2c771cca1',1,'mimalloc-doc.h']]], + ['mi_5freserve_5fhuge_5fos_5fpages_5finterleave_266',['mi_reserve_huge_os_pages_interleave',['../group__extended.html#ga3132f521fb756fc0e8ec0b74fb58df50',1,'mimalloc-doc.h']]], + ['mi_5freserve_5fos_5fmemory_267',['mi_reserve_os_memory',['../group__extended.html#ga00ec3324b6b2591c7fe3677baa30a767',1,'mimalloc-doc.h']]], + ['mi_5frezalloc_268',['mi_rezalloc',['../group__zeroinit.html#ga8c292e142110229a2980b37ab036dbc6',1,'mimalloc-doc.h']]], + ['mi_5frezalloc_5faligned_269',['mi_rezalloc_aligned',['../group__zeroinit.html#gacd71a7bce96aab38ae6de17af2eb2cf0',1,'mimalloc-doc.h']]], + ['mi_5frezalloc_5faligned_5fat_270',['mi_rezalloc_aligned_at',['../group__zeroinit.html#gae8b358c417e61d5307da002702b0a8e1',1,'mimalloc-doc.h']]], + ['mi_5fstats_5fmerge_271',['mi_stats_merge',['../group__extended.html#ga854b1de8cb067c7316286c28b2fcd3d1',1,'mimalloc-doc.h']]], + ['mi_5fstats_5fprint_272',['mi_stats_print',['../group__extended.html#ga2d126e5c62d3badc35445e5d84166df2',1,'mimalloc-doc.h']]], + ['mi_5fstats_5fprint_5fout_273',['mi_stats_print_out',['../group__extended.html#ga537f13b299ddf801e49a5a94fde02c79',1,'mimalloc-doc.h']]], + ['mi_5fstats_5freset_274',['mi_stats_reset',['../group__extended.html#ga3bb8468b8cfcc6e2a61d98aee85c5f99',1,'mimalloc-doc.h']]], + ['mi_5fstrdup_275',['mi_strdup',['../group__malloc.html#gac7cffe13f1f458ed16789488bf92b9b2',1,'mimalloc-doc.h']]], + ['mi_5fstrndup_276',['mi_strndup',['../group__malloc.html#gaaabf971c2571891433477e2d21a35266',1,'mimalloc-doc.h']]], + ['mi_5fthread_5fdone_277',['mi_thread_done',['../group__extended.html#ga0ae4581e85453456a0d658b2b98bf7bf',1,'mimalloc-doc.h']]], + ['mi_5fthread_5finit_278',['mi_thread_init',['../group__extended.html#gaf8e73efc2cbca9ebfdfb166983a04c17',1,'mimalloc-doc.h']]], + ['mi_5fthread_5fstats_5fprint_5fout_279',['mi_thread_stats_print_out',['../group__extended.html#gab1dac8476c46cb9eecab767eb40c1525',1,'mimalloc-doc.h']]], + ['mi_5fusable_5fsize_280',['mi_usable_size',['../group__extended.html#ga089c859d9eddc5f9b4bd946cd53cebee',1,'mimalloc-doc.h']]], + ['mi_5fvalloc_281',['mi_valloc',['../group__posix.html#ga73baaf5951f5165ba0763d0c06b6a93b',1,'mimalloc-doc.h']]], + ['mi_5fzalloc_282',['mi_zalloc',['../group__malloc.html#gafdd9d8bb2986e668ba9884f28af38000',1,'mimalloc-doc.h']]], + ['mi_5fzalloc_5faligned_283',['mi_zalloc_aligned',['../group__aligned.html#ga0cadbcf5b89a7b6fb171bc8df8734819',1,'mimalloc-doc.h']]], + ['mi_5fzalloc_5faligned_5fat_284',['mi_zalloc_aligned_at',['../group__aligned.html#ga5f8c2353766db522565e642fafd8a3f8',1,'mimalloc-doc.h']]], + ['mi_5fzalloc_5fsmall_285',['mi_zalloc_small',['../group__extended.html#ga220f29f40a44404b0061c15bc1c31152',1,'mimalloc-doc.h']]] ]; diff --git a/docs/search/groups_0.html b/docs/search/groups_0.html index 194bb7b..c600b49 100644 --- a/docs/search/groups_0.html +++ b/docs/search/groups_0.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/groups_0.js b/docs/search/groups_0.js index bbb4b54..0ed99b8 100644 --- a/docs/search/groups_0.js +++ b/docs/search/groups_0.js @@ -1,4 +1,4 @@ var searchData= [ - ['aligned_20allocation',['Aligned Allocation',['../group__aligned.html',1,'']]] + ['aligned_20allocation_314',['Aligned Allocation',['../group__aligned.html',1,'']]] ]; diff --git a/docs/search/groups_1.html b/docs/search/groups_1.html index ed9b5c6..2eb3550 100644 --- a/docs/search/groups_1.html +++ b/docs/search/groups_1.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/groups_1.js b/docs/search/groups_1.js index b258fac..f27c584 100644 --- a/docs/search/groups_1.js +++ b/docs/search/groups_1.js @@ -1,4 +1,4 @@ var searchData= [ - ['basic_20allocation',['Basic Allocation',['../group__malloc.html',1,'']]] + ['basic_20allocation_315',['Basic Allocation',['../group__malloc.html',1,'']]] ]; diff --git a/docs/search/groups_2.html b/docs/search/groups_2.html index 17d4e06..12f4af7 100644 --- a/docs/search/groups_2.html +++ b/docs/search/groups_2.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/groups_2.js b/docs/search/groups_2.js index 2918576..6da64b6 100644 --- a/docs/search/groups_2.js +++ b/docs/search/groups_2.js @@ -1,4 +1,4 @@ var searchData= [ - ['c_2b_2b_20wrappers',['C++ wrappers',['../group__cpp.html',1,'']]] + ['c_2b_2b_20wrappers_316',['C++ wrappers',['../group__cpp.html',1,'']]] ]; diff --git a/docs/search/groups_3.html b/docs/search/groups_3.html index 7d4a624..5e235b5 100644 --- a/docs/search/groups_3.html +++ b/docs/search/groups_3.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/groups_3.js b/docs/search/groups_3.js index 68c73db..cdfbe64 100644 --- a/docs/search/groups_3.js +++ b/docs/search/groups_3.js @@ -1,4 +1,4 @@ var searchData= [ - ['extended_20functions',['Extended Functions',['../group__extended.html',1,'']]] + ['extended_20functions_317',['Extended Functions',['../group__extended.html',1,'']]] ]; diff --git a/docs/search/groups_4.html b/docs/search/groups_4.html index 5e5ae2a..99405e1 100644 --- a/docs/search/groups_4.html +++ b/docs/search/groups_4.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/groups_4.js b/docs/search/groups_4.js index e7e4093..687f1ea 100644 --- a/docs/search/groups_4.js +++ b/docs/search/groups_4.js @@ -1,5 +1,5 @@ var searchData= [ - ['heap_20introspection',['Heap Introspection',['../group__analysis.html',1,'']]], - ['heap_20allocation',['Heap Allocation',['../group__heap.html',1,'']]] + ['heap_20allocation_318',['Heap Allocation',['../group__heap.html',1,'']]], + ['heap_20introspection_319',['Heap Introspection',['../group__analysis.html',1,'']]] ]; diff --git a/docs/search/groups_5.html b/docs/search/groups_5.html index fbd1460..583f5f5 100644 --- a/docs/search/groups_5.html +++ b/docs/search/groups_5.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/groups_5.js b/docs/search/groups_5.js index 4f00568..43c8b1f 100644 --- a/docs/search/groups_5.js +++ b/docs/search/groups_5.js @@ -1,4 +1,4 @@ var searchData= [ - ['posix',['Posix',['../group__posix.html',1,'']]] + ['posix_320',['Posix',['../group__posix.html',1,'']]] ]; diff --git a/docs/search/groups_6.html b/docs/search/groups_6.html index 277d80e..df6a310 100644 --- a/docs/search/groups_6.html +++ b/docs/search/groups_6.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/groups_6.js b/docs/search/groups_6.js index 2533cb9..3463187 100644 --- a/docs/search/groups_6.js +++ b/docs/search/groups_6.js @@ -1,4 +1,4 @@ var searchData= [ - ['runtime_20options',['Runtime Options',['../group__options.html',1,'']]] + ['runtime_20options_321',['Runtime Options',['../group__options.html',1,'']]] ]; diff --git a/docs/search/groups_7.html b/docs/search/groups_7.html index 6a24e7c..8964e05 100644 --- a/docs/search/groups_7.html +++ b/docs/search/groups_7.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/groups_7.js b/docs/search/groups_7.js index 647887f..aa150e9 100644 --- a/docs/search/groups_7.js +++ b/docs/search/groups_7.js @@ -1,4 +1,4 @@ var searchData= [ - ['typed_20macros',['Typed Macros',['../group__typed.html',1,'']]] + ['typed_20macros_322',['Typed Macros',['../group__typed.html',1,'']]] ]; diff --git a/docs/search/groups_8.html b/docs/search/groups_8.html index 81ac950..7987ca3 100644 --- a/docs/search/groups_8.html +++ b/docs/search/groups_8.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/groups_8.js b/docs/search/groups_8.js index 2b9b4ce..f9c29fe 100644 --- a/docs/search/groups_8.js +++ b/docs/search/groups_8.js @@ -1,4 +1,4 @@ var searchData= [ - ['zero_20initialized_20re_2dallocation',['Zero initialized re-allocation',['../group__zeroinit.html',1,'']]] + ['zero_20initialized_20re_2dallocation_323',['Zero initialized re-allocation',['../group__zeroinit.html',1,'']]] ]; diff --git a/docs/search/nomatches.html b/docs/search/nomatches.html index 4377320..2b9360b 100644 --- a/docs/search/nomatches.html +++ b/docs/search/nomatches.html @@ -1,5 +1,6 @@ - + + diff --git a/docs/search/pages_0.html b/docs/search/pages_0.html index 3d06b05..8517b48 100644 --- a/docs/search/pages_0.html +++ b/docs/search/pages_0.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/pages_0.js b/docs/search/pages_0.js index 33f3d05..07922da 100644 --- a/docs/search/pages_0.js +++ b/docs/search/pages_0.js @@ -1,4 +1,4 @@ var searchData= [ - ['building',['Building',['../build.html',1,'']]] + ['building_324',['Building',['../build.html',1,'']]] ]; diff --git a/docs/search/pages_1.html b/docs/search/pages_1.html index 06f1e40..a0fb679 100644 --- a/docs/search/pages_1.html +++ b/docs/search/pages_1.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/pages_1.js b/docs/search/pages_1.js index 0f2757c..6433dae 100644 --- a/docs/search/pages_1.js +++ b/docs/search/pages_1.js @@ -1,4 +1,4 @@ var searchData= [ - ['environment_20options',['Environment Options',['../environment.html',1,'']]] + ['environment_20options_325',['Environment Options',['../environment.html',1,'']]] ]; diff --git a/docs/search/pages_2.html b/docs/search/pages_2.html index 703f781..084edfd 100644 --- a/docs/search/pages_2.html +++ b/docs/search/pages_2.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/pages_2.js b/docs/search/pages_2.js index df03c8d..7577377 100644 --- a/docs/search/pages_2.js +++ b/docs/search/pages_2.js @@ -1,4 +1,4 @@ var searchData= [ - ['overriding_20malloc',['Overriding Malloc',['../overrides.html',1,'']]] + ['overriding_20malloc_326',['Overriding Malloc',['../overrides.html',1,'']]] ]; diff --git a/docs/search/pages_3.html b/docs/search/pages_3.html index 299228a..c0b45b0 100644 --- a/docs/search/pages_3.html +++ b/docs/search/pages_3.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/pages_3.js b/docs/search/pages_3.js index d745403..d62a3cf 100644 --- a/docs/search/pages_3.js +++ b/docs/search/pages_3.js @@ -1,4 +1,4 @@ var searchData= [ - ['performance',['Performance',['../bench.html',1,'']]] + ['performance_327',['Performance',['../bench.html',1,'']]] ]; diff --git a/docs/search/pages_4.html b/docs/search/pages_4.html index 021d277..0f05c2e 100644 --- a/docs/search/pages_4.html +++ b/docs/search/pages_4.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/pages_4.js b/docs/search/pages_4.js index b47682a..4e4e64d 100644 --- a/docs/search/pages_4.js +++ b/docs/search/pages_4.js @@ -1,4 +1,4 @@ var searchData= [ - ['using_20the_20library',['Using the library',['../using.html',1,'']]] + ['using_20the_20library_328',['Using the library',['../using.html',1,'']]] ]; diff --git a/docs/search/search.css b/docs/search/search.css index 10bd4b5..d30e027 100644 --- a/docs/search/search.css +++ b/docs/search/search.css @@ -131,7 +131,7 @@ span.SelectionMark { a.SelectItem { display: block; outline-style: none; - color: #000000; + color: #000000; text-decoration: none; padding-left: 6px; padding-right: 12px; @@ -139,7 +139,7 @@ a.SelectItem { a.SelectItem:focus, a.SelectItem:active { - color: #000000; + color: #000000; outline-style: none; text-decoration: none; } @@ -173,7 +173,7 @@ iframe#MSearchResults { #SRIndex { - clear:both; + clear:both; padding-bottom: 15px; } @@ -192,7 +192,7 @@ body.SRPage { } .SRChildren { - padding-left: 3ex; padding-bottom: .5em + padding-left: 3ex; padding-bottom: .5em } .SRPage .SRChildren { @@ -200,7 +200,7 @@ body.SRPage { } .SRSymbol { - font-weight: bold; + font-weight: bold; color: #121414; font-family: Arial, Verdana, sans-serif; text-decoration: none; @@ -209,7 +209,7 @@ body.SRPage { a.SRScope { display: block; - color: #121414; + color: #121414; font-family: Arial, Verdana, sans-serif; text-decoration: none; outline: none; @@ -270,4 +270,3 @@ DIV.searchresults { .searchpages { margin-top: 10px; } - diff --git a/docs/search/search.js b/docs/search/search.js index a554ab9..fb226f7 100644 --- a/docs/search/search.js +++ b/docs/search/search.js @@ -1,25 +1,26 @@ /* - @licstart The following is the entire license notice for the - JavaScript code in this file. + @licstart The following is the entire license notice for the JavaScript code in this file. - Copyright (C) 1997-2017 by Dimitri van Heesch + The MIT License (MIT) - This program is free software; you can redistribute it and/or modify - it under the terms of the GNU General Public License as published by - the Free Software Foundation; either version 2 of the License, or - (at your option) any later version. + Copyright (C) 1997-2020 by Dimitri van Heesch - This program is distributed in the hope that it will be useful, - but WITHOUT ANY WARRANTY; without even the implied warranty of - MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - GNU General Public License for more details. + Permission is hereby granted, free of charge, to any person obtaining a copy of this software + and associated documentation files (the "Software"), to deal in the Software without restriction, + including without limitation the rights to use, copy, modify, merge, publish, distribute, + sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is + furnished to do so, subject to the following conditions: - You should have received a copy of the GNU General Public License along - with this program; if not, write to the Free Software Foundation, Inc., - 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. + The above copyright notice and this permission notice shall be included in all copies or + substantial portions of the Software. - @licend The above is the entire license notice - for the JavaScript code in this file + THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING + BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND + NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, + DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, + OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. + + @licend The above is the entire license notice for the JavaScript code in this file */ function convertToId(search) { @@ -79,9 +80,10 @@ function getYPos(item) storing this instance. Is needed to be able to set timeouts. resultPath - path to use for external files */ -function SearchBox(name, resultsPath, inFrame, label) +function SearchBox(name, resultsPath, inFrame, label, extension) { if (!name || !resultsPath) { alert("Missing parameters to SearchBox."); } + if (!extension || extension == "") { extension = ".html"; } // ---------- Instance variables this.name = name; @@ -96,6 +98,7 @@ function SearchBox(name, resultsPath, inFrame, label) this.searchActive = false; this.insideFrame = inFrame; this.searchLabel = label; + this.extension = extension; // ----------- DOM Elements @@ -200,10 +203,9 @@ function SearchBox(name, resultsPath, inFrame, label) } return; } - else if (window.frames.MSearchResults.searchResults) + else { - var elem = window.frames.MSearchResults.searchResults.NavNext(0); - if (elem) elem.focus(); + window.frames.MSearchResults.postMessage("take_focus", "*"); } } else if (e.keyCode==27) // Escape out of the search field @@ -347,13 +349,13 @@ function SearchBox(name, resultsPath, inFrame, label) if (idx!=-1) { var hexCode=idx.toString(16); - resultsPage = this.resultsPath + '/' + indexSectionNames[this.searchIndex] + '_' + hexCode + '.html'; + resultsPage = this.resultsPath + '/' + indexSectionNames[this.searchIndex] + '_' + hexCode + this.extension; resultsPageWithSearch = resultsPage+'?'+escape(searchValue); hasResultsPage = true; } else // nothing available for this search term { - resultsPage = this.resultsPath + '/nomatches.html'; + resultsPage = this.resultsPath + '/nomatches' + this.extension; resultsPageWithSearch = resultsPage; hasResultsPage = false; } @@ -364,7 +366,7 @@ function SearchBox(name, resultsPath, inFrame, label) if (domPopupSearchResultsWindow.style.display!='block') { var domSearchBox = this.DOMSearchBox(); - this.DOMSearchClose().style.display = 'inline'; + this.DOMSearchClose().style.display = 'inline-block'; if (this.insideFrame) { var domPopupSearchResults = this.DOMPopupSearchResults(); @@ -439,12 +441,12 @@ function SearchResults(name) while (element && element!=parentElement) { - if (element.nodeName == 'DIV' && element.className == 'SRChildren') + if (element.nodeName.toLowerCase() == 'div' && element.className == 'SRChildren') { return element; } - if (element.nodeName == 'DIV' && element.hasChildNodes()) + if (element.nodeName.toLowerCase() == 'div' && element.hasChildNodes()) { element = element.firstChild; } diff --git a/docs/search/searchdata.js b/docs/search/searchdata.js index dd31068..c4c02fa 100644 --- a/docs/search/searchdata.js +++ b/docs/search/searchdata.js @@ -36,4 +36,3 @@ var indexSectionLabels = 7: "Modules", 8: "Pages" }; - diff --git a/docs/search/typedefs_0.html b/docs/search/typedefs_0.html index 3848b20..a4684c4 100644 --- a/docs/search/typedefs_0.html +++ b/docs/search/typedefs_0.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/typedefs_0.js b/docs/search/typedefs_0.js index 44a0a6c..ac67dcd 100644 --- a/docs/search/typedefs_0.js +++ b/docs/search/typedefs_0.js @@ -1,8 +1,8 @@ var searchData= [ - ['mi_5fblock_5fvisit_5ffun',['mi_block_visit_fun',['../group__analysis.html#gadfa01e2900f0e5d515ad5506b26f6d65',1,'mimalloc-doc.h']]], - ['mi_5fdeferred_5ffree_5ffun',['mi_deferred_free_fun',['../group__extended.html#ga299dae78d25ce112e384a98b7309c5be',1,'mimalloc-doc.h']]], - ['mi_5ferror_5ffun',['mi_error_fun',['../group__extended.html#ga251d369cda3f1c2a955c555486ed90e5',1,'mimalloc-doc.h']]], - ['mi_5fheap_5ft',['mi_heap_t',['../group__heap.html#ga34a47cde5a5b38c29f1aa3c5e76943c2',1,'mimalloc-doc.h']]], - ['mi_5foutput_5ffun',['mi_output_fun',['../group__extended.html#gad823d23444a4b77a40f66bf075a98a0c',1,'mimalloc-doc.h']]] + ['mi_5fblock_5fvisit_5ffun_291',['mi_block_visit_fun',['../group__analysis.html#gadfa01e2900f0e5d515ad5506b26f6d65',1,'mimalloc-doc.h']]], + ['mi_5fdeferred_5ffree_5ffun_292',['mi_deferred_free_fun',['../group__extended.html#ga299dae78d25ce112e384a98b7309c5be',1,'mimalloc-doc.h']]], + ['mi_5ferror_5ffun_293',['mi_error_fun',['../group__extended.html#ga251d369cda3f1c2a955c555486ed90e5',1,'mimalloc-doc.h']]], + ['mi_5fheap_5ft_294',['mi_heap_t',['../group__heap.html#ga34a47cde5a5b38c29f1aa3c5e76943c2',1,'mimalloc-doc.h']]], + ['mi_5foutput_5ffun_295',['mi_output_fun',['../group__extended.html#gad823d23444a4b77a40f66bf075a98a0c',1,'mimalloc-doc.h']]] ]; diff --git a/docs/search/variables_0.html b/docs/search/variables_0.html index 12104bc..1e477c0 100644 --- a/docs/search/variables_0.html +++ b/docs/search/variables_0.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/variables_0.js b/docs/search/variables_0.js index 330c800..4c0d772 100644 --- a/docs/search/variables_0.js +++ b/docs/search/variables_0.js @@ -1,5 +1,5 @@ var searchData= [ - ['block_5fsize',['block_size',['../group__analysis.html#a332a6c14d736a99699d5453a1cb04b41',1,'mi_heap_area_t']]], - ['blocks',['blocks',['../group__analysis.html#ae0085e6e1cf059a4eb7767e30e9991b8',1,'mi_heap_area_t']]] + ['block_5fsize_286',['block_size',['../group__analysis.html#a332a6c14d736a99699d5453a1cb04b41',1,'mi_heap_area_t']]], + ['blocks_287',['blocks',['../group__analysis.html#ae0085e6e1cf059a4eb7767e30e9991b8',1,'mi_heap_area_t']]] ]; diff --git a/docs/search/variables_1.html b/docs/search/variables_1.html index b784017..ea73d9a 100644 --- a/docs/search/variables_1.html +++ b/docs/search/variables_1.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/variables_1.js b/docs/search/variables_1.js index af76e9c..449fd61 100644 --- a/docs/search/variables_1.js +++ b/docs/search/variables_1.js @@ -1,4 +1,4 @@ var searchData= [ - ['committed',['committed',['../group__analysis.html#ab47526df656d8837ec3e97f11b83f835',1,'mi_heap_area_t']]] + ['committed_288',['committed',['../group__analysis.html#ab47526df656d8837ec3e97f11b83f835',1,'mi_heap_area_t']]] ]; diff --git a/docs/search/variables_2.html b/docs/search/variables_2.html index 0cb98d3..0580462 100644 --- a/docs/search/variables_2.html +++ b/docs/search/variables_2.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/variables_2.js b/docs/search/variables_2.js index 304ad43..713c68e 100644 --- a/docs/search/variables_2.js +++ b/docs/search/variables_2.js @@ -1,4 +1,4 @@ var searchData= [ - ['reserved',['reserved',['../group__analysis.html#ae848a3e6840414891035423948ca0383',1,'mi_heap_area_t']]] + ['reserved_289',['reserved',['../group__analysis.html#ae848a3e6840414891035423948ca0383',1,'mi_heap_area_t']]] ]; diff --git a/docs/search/variables_3.html b/docs/search/variables_3.html index 1e83bf5..0d69e76 100644 --- a/docs/search/variables_3.html +++ b/docs/search/variables_3.html @@ -1,7 +1,8 @@ - + + - + @@ -10,21 +11,27 @@
    Loading...
    - +
    Searching...
    No Matches
    - +
    diff --git a/docs/search/variables_3.js b/docs/search/variables_3.js index c889d4f..08ec3ba 100644 --- a/docs/search/variables_3.js +++ b/docs/search/variables_3.js @@ -1,4 +1,4 @@ var searchData= [ - ['used',['used',['../group__analysis.html#ab820302c5cd0df133eb8e51650a008b4',1,'mi_heap_area_t']]] + ['used_290',['used',['../group__analysis.html#ab820302c5cd0df133eb8e51650a008b4',1,'mi_heap_area_t']]] ]; diff --git a/docs/tabs.css b/docs/tabs.css index e1f2e0b..a87eade 100644 --- a/docs/tabs.css +++ b/docs/tabs.css @@ -58,4 +58,3 @@ color: #fff; text-shadow: 0px 1px 1px rgba(0, 0, 0, 1.0); } - diff --git a/docs/using.html b/docs/using.html index 047e35e..eea12cf 100644 --- a/docs/using.html +++ b/docs/using.html @@ -3,7 +3,7 @@ - + mi-malloc: Using the library @@ -13,10 +13,6 @@ - @@ -37,21 +33,21 @@ Logo
    mi-malloc -  1.6 +  1.7/2.0
    - - +
    @@ -60,10 +56,10 @@
    - + @@ -73,13 +69,13 @@ var searchBox = new SearchBox("searchBox", "search",false,'Search'); -
    @@ -92,7 +88,7 @@ $(document).ready(function(){initNavTree('using.html','');});
    -
    @@ -103,21 +99,56 @@ $(document).ready(function(){initNavTree('using.html','');});

    Build

    -

    The preferred usage is including <mimalloc.h>, linking with the shared- or static library, and using the mi_malloc API exclusively for allocation. For example,

    gcc -o myprogram -lmimalloc myfile.c

    mimalloc uses only safe OS calls (mmap and VirtualAlloc) and can co-exist with other allocators linked to the same program. If you use cmake, you can simply use:

    find_package(mimalloc 1.0 REQUIRED)

    in your CMakeLists.txt to find a locally installed mimalloc. Then use either:

    target_link_libraries(myapp PUBLIC mimalloc)

    to link with the shared (dynamic) library, or:

    target_link_libraries(myapp PUBLIC mimalloc-static)

    to link with the static library. See test\CMakeLists.txt for an example.

    +

    The preferred usage is including <mimalloc.h>, linking with the shared- or static library, and using the mi_malloc API exclusively for allocation. For example,

    gcc -o myprogram -lmimalloc myfile.c
    +

    mimalloc uses only safe OS calls (mmap and VirtualAlloc) and can co-exist with other allocators linked to the same program. If you use cmake, you can simply use:

    find_package(mimalloc 1.0 REQUIRED)
    +

    in your CMakeLists.txt to find a locally installed mimalloc. Then use either:

    target_link_libraries(myapp PUBLIC mimalloc)
    +

    to link with the shared (dynamic) library, or:

    target_link_libraries(myapp PUBLIC mimalloc-static)
    +

    to link with the static library. See test\CMakeLists.txt for an example.

    C++

    -

    For best performance in C++ programs, it is also recommended to override the global new and delete operators. For convience, mimalloc provides mimalloc-new-delete.h which does this for you – just include it in a single(!) source file in your project.

    -

    In C++, mimalloc also provides the mi_stl_allocator struct which implements the std::allocator interface. For example:

    std::vector<some_struct, mi_stl_allocator<some_struct>> vec;
    vec.push_back(some_struct());

    Statistics

    -

    You can pass environment variables to print verbose messages (MIMALLOC_VERBOSE=1) and statistics (MIMALLOC_SHOW_STATS=1) (in the debug version):

    > env MIMALLOC_SHOW_STATS=1 ./cfrac 175451865205073170563711388363
    175451865205073170563711388363 = 374456281610909315237213 * 468551
    heap stats: peak total freed unit
    normal 2: 16.4 kb 17.5 mb 17.5 mb 16 b ok
    normal 3: 16.3 kb 15.2 mb 15.2 mb 24 b ok
    normal 4: 64 b 4.6 kb 4.6 kb 32 b ok
    normal 5: 80 b 118.4 kb 118.4 kb 40 b ok
    normal 6: 48 b 48 b 48 b 48 b ok
    normal 17: 960 b 960 b 960 b 320 b ok
    heap stats: peak total freed unit
    normal: 33.9 kb 32.8 mb 32.8 mb 1 b ok
    huge: 0 b 0 b 0 b 1 b ok
    total: 33.9 kb 32.8 mb 32.8 mb 1 b ok
    malloc requested: 32.8 mb
    committed: 58.2 kb 58.2 kb 58.2 kb 1 b ok
    reserved: 2.0 mb 2.0 mb 2.0 mb 1 b ok
    reset: 0 b 0 b 0 b 1 b ok
    segments: 1 1 1
    -abandoned: 0
    pages: 6 6 6
    -abandoned: 0
    mmaps: 3
    mmap fast: 0
    mmap slow: 1
    threads: 0
    elapsed: 2.022s
    process: user: 1.781s, system: 0.016s, faults: 756, reclaims: 0, rss: 2.7 mb

    The above model of using the mi_ prefixed API is not always possible though in existing programs that already use the standard malloc interface, and another option is to override the standard malloc interface completely and redirect all calls to the mimalloc library instead.

    +

    For best performance in C++ programs, it is also recommended to override the global new and delete operators. For convience, mimalloc provides mimalloc-new-delete.h which does this for you – just include it in a single(!) source file in your project without linking to the mimalloc's library.

    +

    In C++, mimalloc also provides the mi_stl_allocator struct which implements the std::allocator interface. For example:

    std::vector<some_struct, mi_stl_allocator<some_struct>> vec;
    +
    vec.push_back(some_struct());
    +

    Statistics

    +

    You can pass environment variables to print verbose messages (MIMALLOC_VERBOSE=1) and statistics (MIMALLOC_SHOW_STATS=1) (in the debug version):

    > env MIMALLOC_SHOW_STATS=1 ./cfrac 175451865205073170563711388363
    +
    +
    175451865205073170563711388363 = 374456281610909315237213 * 468551
    +
    +
    heap stats: peak total freed unit
    +
    normal 2: 16.4 kb 17.5 mb 17.5 mb 16 b ok
    +
    normal 3: 16.3 kb 15.2 mb 15.2 mb 24 b ok
    +
    normal 4: 64 b 4.6 kb 4.6 kb 32 b ok
    +
    normal 5: 80 b 118.4 kb 118.4 kb 40 b ok
    +
    normal 6: 48 b 48 b 48 b 48 b ok
    +
    normal 17: 960 b 960 b 960 b 320 b ok
    +
    +
    heap stats: peak total freed unit
    +
    normal: 33.9 kb 32.8 mb 32.8 mb 1 b ok
    +
    huge: 0 b 0 b 0 b 1 b ok
    +
    total: 33.9 kb 32.8 mb 32.8 mb 1 b ok
    +
    malloc requested: 32.8 mb
    +
    +
    committed: 58.2 kb 58.2 kb 58.2 kb 1 b ok
    +
    reserved: 2.0 mb 2.0 mb 2.0 mb 1 b ok
    +
    reset: 0 b 0 b 0 b 1 b ok
    +
    segments: 1 1 1
    +
    -abandoned: 0
    +
    pages: 6 6 6
    +
    -abandoned: 0
    +
    mmaps: 3
    +
    mmap fast: 0
    +
    mmap slow: 1
    +
    threads: 0
    +
    elapsed: 2.022s
    +
    process: user: 1.781s, system: 0.016s, faults: 756, reclaims: 0, rss: 2.7 mb
    +

    The above model of using the mi_ prefixed API is not always possible though in existing programs that already use the standard malloc interface, and another option is to override the standard malloc interface completely and redirect all calls to the mimalloc library instead.

    See Overriding Malloc for more info.

    -
    - + + diff --git a/ide/vs2017/mimalloc-override-test.vcxproj b/ide/vs2017/mimalloc-override-test.vcxproj deleted file mode 100644 index faaa00e..0000000 --- a/ide/vs2017/mimalloc-override-test.vcxproj +++ /dev/null @@ -1,190 +0,0 @@ - - - - - Debug - Win32 - - - Release - Win32 - - - Debug - x64 - - - Release - x64 - - - - 15.0 - {FEF7868F-750E-4C21-A04D-22707CC66879} - mimalloc-override-test - 10.0.17134.0 - mimalloc-override-test - - - - Application - true - v141 - - - Application - false - v141 - true - - - Application - true - v141 - - - Application - false - v141 - true - - - - - - - - - - - - - - - - - - - - - $(ProjectDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(ProjectDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - - - $(ProjectDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(ProjectDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - - - $(ProjectDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(ProjectDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - - - $(ProjectDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(ProjectDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - - - - Level3 - Disabled - true - true - ..\..\include - MultiThreadedDebugDLL - false - Default - false - - - Console - kernel32.lib;%(AdditionalDependencies) - - - - - - - - - - Level3 - Disabled - true - true - ..\..\include - MultiThreadedDebugDLL - Sync - Default - false - - - Console - - - kernel32.lib;%(AdditionalDependencies) - - - - - - - - - - Level3 - MaxSpeed - true - true - true - true - ..\..\include - _MBCS;%(PreprocessorDefinitions);NDEBUG - MultiThreadedDLL - - - true - true - Console - kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies) - - - - - - - - - Level3 - MaxSpeed - true - true - true - true - ..\..\include - _MBCS;%(PreprocessorDefinitions);NDEBUG - MultiThreadedDLL - - - true - true - Console - - - kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies) - - - - - - - - - {abb5eae7-b3e6-432e-b636-333449892ea7} - - - - - - - - - \ No newline at end of file diff --git a/ide/vs2017/mimalloc-override-test.vcxproj.filters b/ide/vs2017/mimalloc-override-test.vcxproj.filters deleted file mode 100644 index eb5e70b..0000000 --- a/ide/vs2017/mimalloc-override-test.vcxproj.filters +++ /dev/null @@ -1,22 +0,0 @@ - - - - - {4FC737F1-C7A5-4376-A066-2A32D752A2FF} - cpp;c;cc;cxx;def;odl;idl;hpj;bat;asm;asmx - - - {93995380-89BD-4b04-88EB-625FBE52EBFB} - h;hh;hpp;hxx;hm;inl;inc;ipp;xsd - - - {67DA6AB6-F800-4c08-8B7A-83BB121AAD01} - rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx;tiff;tif;png;wav;mfcribbon-ms - - - - - Source Files - - - \ No newline at end of file diff --git a/ide/vs2017/mimalloc-override.vcxproj b/ide/vs2017/mimalloc-override.vcxproj deleted file mode 100644 index 990d6ca..0000000 --- a/ide/vs2017/mimalloc-override.vcxproj +++ /dev/null @@ -1,254 +0,0 @@ - - - - - Debug - Win32 - - - Release - Win32 - - - Debug - x64 - - - Release - x64 - - - - 15.0 - {ABB5EAE7-B3E6-432E-B636-333449892EA7} - mimalloc-override - 10.0.17134.0 - mimalloc-override - - - - DynamicLibrary - true - v141 - - - DynamicLibrary - false - v141 - - - DynamicLibrary - true - v141 - - - DynamicLibrary - false - v141 - - - - - - - - - - - - - - - - - - - - - $(SolutionDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(SolutionDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - .dll - mimalloc-override - - - $(SolutionDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(SolutionDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - .dll - mimalloc-override - - - $(SolutionDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(SolutionDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - .dll - mimalloc-override - - - $(SolutionDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(SolutionDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - .dll - mimalloc-override - - - - Level3 - Disabled - true - true - ../../include - _CRT_SECURE_NO_WARNINGS;MI_SHARED_LIB;MI_SHARED_LIB_EXPORT;MI_MALLOC_OVERRIDE;%(PreprocessorDefinitions); - MultiThreadedDebugDLL - false - Default - - - $(ProjectDir)\..\..\bin\mimalloc-redirect32.lib;%(AdditionalDependencies) - - - - - Default - false - - - COPY /Y $(ProjectDir)..\..\bin\mimalloc-redirect32.dll $(OutputPath) - - - Copy mimalloc-redirect32.dll to the output directory - - - - - Level3 - Disabled - true - true - ../../include - _CRT_SECURE_NO_WARNINGS;MI_SHARED_LIB;MI_SHARED_LIB_EXPORT;MI_MALLOC_OVERRIDE;%(PreprocessorDefinitions); - MultiThreadedDebugDLL - false - Default - - - $(ProjectDir)\..\..\bin\mimalloc-redirect.lib;bcrypt.lib;%(AdditionalDependencies) - - - - - Default - false - - - COPY /Y $(ProjectDir)..\..\bin\mimalloc-redirect.dll $(OutputPath) - - - copy mimalloc-redirect.dll to the output directory - - - - - Level3 - MaxSpeed - true - true - true - ../../include - _CRT_SECURE_NO_WARNINGS;MI_SHARED_LIB;MI_SHARED_LIB_EXPORT;MI_MALLOC_OVERRIDE;%(PreprocessorDefinitions);NDEBUG - AssemblyAndSourceCode - $(IntDir) - false - MultiThreadedDLL - Default - false - - - true - true - $(ProjectDir)\..\..\bin\mimalloc-redirect32.lib;%(AdditionalDependencies) - - - Default - false - - - COPY /Y $(ProjectDir)..\..\bin\mimalloc-redirect32.dll $(OutputPath) - - - Copy mimalloc-redirect32.dll to the output directory - - - - - Level3 - MaxSpeed - true - true - true - ../../include - _CRT_SECURE_NO_WARNINGS;MI_SHARED_LIB;MI_SHARED_LIB_EXPORT;MI_MALLOC_OVERRIDE;%(PreprocessorDefinitions);NDEBUG - AssemblyAndSourceCode - $(IntDir) - false - MultiThreadedDLL - Default - false - - - true - true - $(ProjectDir)\..\..\bin\mimalloc-redirect.lib;bcrypt.lib;%(AdditionalDependencies) - - - Default - false - - - COPY /Y $(ProjectDir)..\..\bin\mimalloc-redirect.dll $(OutputPath) - - - copy mimalloc-redirect.dll to the output directory - - - - - - - - - - - - - false - false - false - false - - - true - true - true - true - - - - - - - - - - - true - true - true - true - - - - - - - - - - diff --git a/ide/vs2017/mimalloc-override.vcxproj.filters b/ide/vs2017/mimalloc-override.vcxproj.filters deleted file mode 100644 index 0265265..0000000 --- a/ide/vs2017/mimalloc-override.vcxproj.filters +++ /dev/null @@ -1,80 +0,0 @@ - - - - - {4FC737F1-C7A5-4376-A066-2A32D752A2FF} - cpp;c;cc;cxx;def;odl;idl;hpj;bat;asm;asmx - - - {93995380-89BD-4b04-88EB-625FBE52EBFB} - h;hh;hpp;hxx;hm;inl;inc;ipp;xsd - - - - - Header Files - - - Header Files - - - Header Files - - - Header Files - - - Header Files - - - Header Files - - - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - diff --git a/ide/vs2017/mimalloc-test-stress.vcxproj b/ide/vs2017/mimalloc-test-stress.vcxproj deleted file mode 100644 index b8267d0..0000000 --- a/ide/vs2017/mimalloc-test-stress.vcxproj +++ /dev/null @@ -1,159 +0,0 @@ - - - - - Debug - Win32 - - - Release - Win32 - - - Debug - x64 - - - Release - x64 - - - - 15.0 - {FEF7958F-750E-4C21-A04D-22707CC66878} - mimalloc-test-stress - 10.0.17134.0 - mimalloc-test-stress - - - - Application - true - v141 - - - Application - false - v141 - true - - - Application - true - v141 - - - Application - false - v141 - true - - - - - - - - - - - - - - - - - - - - - $(ProjectDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(ProjectDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - - - $(ProjectDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(ProjectDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - - - $(ProjectDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(ProjectDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - - - $(ProjectDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(ProjectDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - - - - Level3 - Disabled - true - true - ..\..\include - - - Console - - - - - Level3 - Disabled - true - true - ..\..\include - - - Console - - - - - Level3 - MaxSpeed - true - true - true - true - ..\..\include - %(PreprocessorDefinitions);NDEBUG - - - true - true - Console - - - - - Level3 - MaxSpeed - true - true - true - true - ..\..\include - %(PreprocessorDefinitions);NDEBUG - - - true - true - Console - - - - - false - false - false - false - - - - - {abb5eae7-b3e6-432e-b636-333449892ea6} - - - - - - \ No newline at end of file diff --git a/ide/vs2017/mimalloc-test-stress.vcxproj.filters b/ide/vs2017/mimalloc-test-stress.vcxproj.filters deleted file mode 100644 index 7c5239e..0000000 --- a/ide/vs2017/mimalloc-test-stress.vcxproj.filters +++ /dev/null @@ -1,22 +0,0 @@ - - - - - {4FC737F1-C7A5-4376-A066-2A32D752A2FF} - cpp;c;cc;cxx;def;odl;idl;hpj;bat;asm;asmx - - - {93995380-89BD-4b04-88EB-625FBE52EBFB} - h;hh;hpp;hxx;hm;inl;inc;ipp;xsd - - - {67DA6AB6-F800-4c08-8B7A-83BB121AAD01} - rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx;tiff;tif;png;wav;mfcribbon-ms - - - - - Source Files - - - \ No newline at end of file diff --git a/ide/vs2017/mimalloc-test.vcxproj b/ide/vs2017/mimalloc-test.vcxproj deleted file mode 100644 index 27c7bb6..0000000 --- a/ide/vs2017/mimalloc-test.vcxproj +++ /dev/null @@ -1,158 +0,0 @@ - - - - - Debug - Win32 - - - Release - Win32 - - - Debug - x64 - - - Release - x64 - - - - 15.0 - {FEF7858F-750E-4C21-A04D-22707CC66878} - mimalloctest - 10.0.17134.0 - mimalloc-test - - - - Application - true - v141 - - - Application - false - v141 - true - - - Application - true - v141 - - - Application - false - v141 - true - - - - - - - - - - - - - - - - - - - - - $(ProjectDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(ProjectDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - - - $(ProjectDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(ProjectDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - - - $(ProjectDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(ProjectDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - - - $(ProjectDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(ProjectDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - - - - Level3 - Disabled - true - true - ..\..\include - stdcpp17 - - - Console - - - - - Level3 - Disabled - true - true - ..\..\include - stdcpp17 - - - Console - - - - - Level3 - MaxSpeed - true - true - true - true - ..\..\include - _MBCS;%(PreprocessorDefinitions);NDEBUG - stdcpp17 - - - true - true - Console - - - - - Level3 - MaxSpeed - true - true - true - true - ..\..\include - _MBCS;%(PreprocessorDefinitions);NDEBUG - stdcpp17 - - - true - true - Console - - - - - {abb5eae7-b3e6-432e-b636-333449892ea6} - - - - - - - - - \ No newline at end of file diff --git a/ide/vs2017/mimalloc-test.vcxproj.filters b/ide/vs2017/mimalloc-test.vcxproj.filters deleted file mode 100644 index fca75e1..0000000 --- a/ide/vs2017/mimalloc-test.vcxproj.filters +++ /dev/null @@ -1,22 +0,0 @@ - - - - - {4FC737F1-C7A5-4376-A066-2A32D752A2FF} - cpp;c;cc;cxx;def;odl;idl;hpj;bat;asm;asmx - - - {93995380-89BD-4b04-88EB-625FBE52EBFB} - h;hh;hpp;hxx;hm;inl;inc;ipp;xsd - - - {67DA6AB6-F800-4c08-8B7A-83BB121AAD01} - rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe;resx;tiff;tif;png;wav;mfcribbon-ms - - - - - Source Files - - - \ No newline at end of file diff --git a/ide/vs2017/mimalloc.sln b/ide/vs2017/mimalloc.sln deleted file mode 100644 index aeab6b88fc35646ae25d86f56d3644f0d3def62e..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 4493 zcmcJS-)@^Q6vnR;Der)?n@*~c0SC-QFMvRIu}#$?ZP#hyRGvtv_)~T2@?^W{BkdJt zk{WC$4LI#?A~^Q>`1$iW1poc>JQ{wXi##i`RcU;uMKw>2Sy?S;mN2F$i791&-q&lV&pd>{p z;_LzvQxYd0p5O#{6Bq*&*%k;OngZMQpch51i#`0lOxXj;bGjrF7Y|BoJ^b?i58I(} z9Pkwf-IEUb?@L+lDk#dF6oq7>5SM(c_t@9mBh$=XJOW%H%`iUl#6O^ZKbfH>C%L6)4}c$ zq91hQ*!oONOJ&kkYPQQo5|l6+QLQBtq8ffRS&Cyke)dW`>Z{j3Xs`OxRcak; z-j03y(c5w&#VxhIw3sBP&Qs#M)m2~pxJ0$qEg`DmSCgeU#^Y^$X|hSK9jfg*sq5Q^ z@21j~a$V>uwT`_(M{!H73N0qdsq>V$zg_j!k4sc*-4deh`>S&Yn=HjK9&hVQlTC8% zxLW6zYw!BfQEDAKtgqfWid)C3LPtwwl3njs;{NujFFm!EOn639Um9A9V_fa*m7c7x z&I1EK3$TO3J;_T-j-7Bmv9m0n_%&M+_Q{?EpJy>!e&++?$C7LcdP`GU{@Nc__K#2w uB3%EvqD!X#glykSd}j&}b_0NH - - - - Debug - Win32 - - - Release - Win32 - - - Debug - x64 - - - Release - x64 - - - - 15.0 - {ABB5EAE7-B3E6-432E-B636-333449892EA6} - mimalloc - 10.0.17134.0 - mimalloc - - - - StaticLibrary - true - v141 - - - StaticLibrary - false - v141 - true - - - StaticLibrary - true - v141 - - - StaticLibrary - false - v141 - true - - - - - - - - - - - - - - - - - - - - - $(SolutionDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(SolutionDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - .lib - mimalloc-static - - - $(SolutionDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(SolutionDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - .lib - mimalloc-static - - - $(SolutionDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(SolutionDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - .lib - mimalloc-static - - - $(SolutionDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(SolutionDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - .lib - mimalloc-static - - - false - - - false - - - false - - - false - - - - Level3 - Disabled - true - true - ../../include - _CRT_SECURE_NO_WARNINGS;MI_DEBUG=3;%(PreprocessorDefinitions); - CompileAsC - false - stdcpp17 - - - - - - - - - - - Level4 - Disabled - true - true - ../../include - _CRT_SECURE_NO_WARNINGS;MI_DEBUG=3;%(PreprocessorDefinitions); - CompileAsC - false - stdcpp17 - - - - - - - - - - - - - - - - - - - Level3 - MaxSpeed - true - true - ../../include - _CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions);NDEBUG - AssemblyAndSourceCode - $(IntDir) - false - false - Default - CompileAsC - true - - - true - true - - - - - - - - - - - Level4 - MaxSpeed - true - true - ../../include - _CRT_SECURE_NO_WARNINGS;%(PreprocessorDefinitions);NDEBUG - AssemblyAndSourceCode - $(IntDir) - false - false - Default - CompileAsC - true - - - true - true - - - - - - - - - - - - - - - - - false - false - false - false - - - true - true - true - true - - - true - true - true - true - - - - - - - - - - true - true - true - true - - - - - - - - - - - - - - - - - - - \ No newline at end of file diff --git a/ide/vs2017/mimalloc.vcxproj.filters b/ide/vs2017/mimalloc.vcxproj.filters deleted file mode 100644 index 4366051..0000000 --- a/ide/vs2017/mimalloc.vcxproj.filters +++ /dev/null @@ -1,83 +0,0 @@ - - - - - {4FC737F1-C7A5-4376-A066-2A32D752A2FF} - cpp;c;cc;cxx;def;odl;idl;hpj;bat;asm;asmx - - - {93995380-89BD-4b04-88EB-625FBE52EBFB} - h;hh;hpp;hxx;hm;inl;inc;ipp;xsd - - - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - - - Header Files - - - Header Files - - - Header Files - - - Header Files - - - Header Files - - - Header Files - - - diff --git a/ide/vs2019/mimalloc-override-test.vcxproj b/ide/vs2019/mimalloc-override-test.vcxproj deleted file mode 100644 index 7a9202f..0000000 --- a/ide/vs2019/mimalloc-override-test.vcxproj +++ /dev/null @@ -1,190 +0,0 @@ - - - - - Debug - Win32 - - - Release - Win32 - - - Debug - x64 - - - Release - x64 - - - - 15.0 - {FEF7868F-750E-4C21-A04D-22707CC66879} - mimalloc-override-test - 10.0 - mimalloc-override-test - - - - Application - true - v142 - - - Application - false - v142 - true - - - Application - true - v142 - - - Application - false - v142 - true - - - - - - - - - - - - - - - - - - - - - $(ProjectDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(ProjectDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - - - $(ProjectDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(ProjectDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - - - $(ProjectDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(ProjectDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - - - $(ProjectDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(ProjectDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - - - - Level3 - Disabled - true - true - ..\..\include - MultiThreadedDebugDLL - Sync - Default - false - - - Console - kernel32.lib;%(AdditionalDependencies) - - - - - - - - - - Level3 - Disabled - true - true - ..\..\include - MultiThreadedDebugDLL - Sync - Default - false - - - Console - - - kernel32.lib;%(AdditionalDependencies) - - - - - - - - - - Level3 - MaxSpeed - true - true - true - true - ..\..\include - _MBCS;%(PreprocessorDefinitions);NDEBUG - MultiThreadedDLL - - - true - true - Console - kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies) - - - - - - - - - Level3 - MaxSpeed - true - true - true - true - ..\..\include - _MBCS;%(PreprocessorDefinitions);NDEBUG - MultiThreadedDLL - - - true - true - Console - - - kernel32.lib;user32.lib;gdi32.lib;winspool.lib;comdlg32.lib;advapi32.lib;shell32.lib;ole32.lib;oleaut32.lib;uuid.lib;odbc32.lib;odbccp32.lib;%(AdditionalDependencies) - - - - - - - - - - - - {abb5eae7-b3e6-432e-b636-333449892ea7} - - - - - - \ No newline at end of file diff --git a/ide/vs2019/mimalloc-override.vcxproj b/ide/vs2019/mimalloc-override.vcxproj deleted file mode 100644 index a0e79fb..0000000 --- a/ide/vs2019/mimalloc-override.vcxproj +++ /dev/null @@ -1,257 +0,0 @@ - - - - - Debug - Win32 - - - Release - Win32 - - - Debug - x64 - - - Release - x64 - - - - 15.0 - {ABB5EAE7-B3E6-432E-B636-333449892EA7} - mimalloc-override - 10.0 - mimalloc-override - - - - DynamicLibrary - true - v142 - - - DynamicLibrary - false - v142 - - - DynamicLibrary - true - v142 - - - DynamicLibrary - false - v142 - - - - - - - - - - - - - - - - - - - - - $(SolutionDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(SolutionDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - .dll - mimalloc-override - - - $(SolutionDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(SolutionDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - .dll - mimalloc-override - - - $(SolutionDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(SolutionDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - .dll - mimalloc-override - - - $(SolutionDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(SolutionDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - .dll - mimalloc-override - - - - Level3 - Disabled - true - true - ../../include - MI_SHARED_LIB;MI_SHARED_LIB_EXPORT;MI_MALLOC_OVERRIDE;%(PreprocessorDefinitions); - MultiThreadedDebugDLL - false - Default - - - $(ProjectDir)\..\..\bin\mimalloc-redirect32.lib;%(AdditionalDependencies) - - - - - Default - false - - - COPY /Y $(ProjectDir)..\..\bin\mimalloc-redirect32.dll $(OutputPath) - - - Copy mimalloc-redirect32.dll to the output directory - - - - - Level3 - Disabled - true - true - ../../include - MI_DEBUG=3;MI_SHARED_LIB;MI_SHARED_LIB_EXPORT;MI_MALLOC_OVERRIDE;%(PreprocessorDefinitions); - MultiThreadedDebugDLL - false - Default - - - $(ProjectDir)\..\..\bin\mimalloc-redirect.lib;%(AdditionalDependencies) - - - - - Default - false - - - COPY /Y $(ProjectDir)..\..\bin\mimalloc-redirect.dll $(OutputPath) - - - copy mimalloc-redirect.dll to the output directory - - - - - Level3 - MaxSpeed - true - true - true - ../../include - MI_SHARED_LIB;MI_SHARED_LIB_EXPORT;MI_MALLOC_OVERRIDE;%(PreprocessorDefinitions);NDEBUG - AssemblyAndSourceCode - $(IntDir) - false - MultiThreadedDLL - Default - false - - - true - true - $(ProjectDir)\..\..\bin\mimalloc-redirect32.lib;%(AdditionalDependencies) - - - Default - false - - - COPY /Y $(ProjectDir)..\..\bin\mimalloc-redirect32.dll $(OutputPath) - - - Copy mimalloc-redirect32.dll to the output directory - - - - - Level3 - MaxSpeed - true - true - true - ../../include - MI_SHARED_LIB;MI_SHARED_LIB_EXPORT;MI_MALLOC_OVERRIDE;%(PreprocessorDefinitions);NDEBUG - AssemblyAndSourceCode - $(IntDir) - false - MultiThreadedDLL - Default - false - - - true - true - $(ProjectDir)\..\..\bin\mimalloc-redirect.lib;%(AdditionalDependencies) - - - Default - false - - - COPY /Y $(ProjectDir)..\..\bin\mimalloc-redirect.dll $(OutputPath) - - - copy mimalloc-redirect.dll to the output directory - - - - - - - - - - - - - false - false - false - false - - - true - true - true - true - - - - - - true - - - - - - - - true - true - true - true - - - - - - - - - - \ No newline at end of file diff --git a/ide/vs2019/mimalloc-override.vcxproj.filters b/ide/vs2019/mimalloc-override.vcxproj.filters deleted file mode 100644 index 8e36f50..0000000 --- a/ide/vs2019/mimalloc-override.vcxproj.filters +++ /dev/null @@ -1,81 +0,0 @@ - - - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - - - Header Files - - - Header Files - - - Header Files - - - Header Files - - - Header Files - - - Header Files - - - - - {f1fccf27-17b9-42dd-ba51-6070baff85c6} - - - {39cb7e38-69d0-43fb-8406-6a0f7cefc3b4} - - - \ No newline at end of file diff --git a/ide/vs2019/mimalloc-test-api.vcxproj b/ide/vs2019/mimalloc-test-api.vcxproj deleted file mode 100644 index 812a9cb..0000000 --- a/ide/vs2019/mimalloc-test-api.vcxproj +++ /dev/null @@ -1,155 +0,0 @@ - - - - - Debug - Win32 - - - Release - Win32 - - - Debug - x64 - - - Release - x64 - - - - 15.0 - {FFF7958F-750E-4C21-A04D-22707CC66878} - mimalloc-test-api - 10.0 - mimalloc-test-api - - - - Application - true - v142 - - - Application - false - v142 - true - - - Application - true - v142 - - - Application - false - v142 - true - - - - - - - - - - - - - - - - - - - - - $(ProjectDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(ProjectDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - - - $(ProjectDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(ProjectDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - - - $(ProjectDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(ProjectDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - - - $(ProjectDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(ProjectDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - - - - Level3 - Disabled - true - true - ..\..\include - - - Console - - - - - Level3 - Disabled - true - true - ..\..\include - - - Console - - - - - Level3 - MaxSpeed - true - true - true - true - ..\..\include - %(PreprocessorDefinitions);NDEBUG - - - true - true - Console - - - - - Level3 - MaxSpeed - true - true - true - true - ..\..\include - %(PreprocessorDefinitions);NDEBUG - - - true - true - Console - - - - - - - - - {abb5eae7-b3e6-432e-b636-333449892ea6} - - - - - - diff --git a/ide/vs2019/mimalloc-test-stress.vcxproj b/ide/vs2019/mimalloc-test-stress.vcxproj deleted file mode 100644 index afbb666..0000000 --- a/ide/vs2019/mimalloc-test-stress.vcxproj +++ /dev/null @@ -1,159 +0,0 @@ - - - - - Debug - Win32 - - - Release - Win32 - - - Debug - x64 - - - Release - x64 - - - - 15.0 - {FEF7958F-750E-4C21-A04D-22707CC66878} - mimalloc-test-stress - 10.0 - mimalloc-test-stress - - - - Application - true - v142 - - - Application - false - v142 - true - - - Application - true - v142 - - - Application - false - v142 - true - - - - - - - - - - - - - - - - - - - - - $(ProjectDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(ProjectDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - - - $(ProjectDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(ProjectDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - - - $(ProjectDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(ProjectDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - - - $(ProjectDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(ProjectDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - - - - Level3 - Disabled - true - true - ..\..\include - - - Console - - - - - Level3 - Disabled - true - true - ..\..\include - - - Console - - - - - Level3 - MaxSpeed - true - true - true - true - ..\..\include - %(PreprocessorDefinitions);NDEBUG - - - true - true - Console - - - - - Level3 - MaxSpeed - true - true - true - true - ..\..\include - %(PreprocessorDefinitions);NDEBUG - - - true - true - Console - - - - - false - false - false - false - - - - - {abb5eae7-b3e6-432e-b636-333449892ea7} - - - - - - \ No newline at end of file diff --git a/ide/vs2019/mimalloc-test.vcxproj b/ide/vs2019/mimalloc-test.vcxproj deleted file mode 100644 index 13af6ab..0000000 --- a/ide/vs2019/mimalloc-test.vcxproj +++ /dev/null @@ -1,158 +0,0 @@ - - - - - Debug - Win32 - - - Release - Win32 - - - Debug - x64 - - - Release - x64 - - - - 15.0 - {FEF7858F-750E-4C21-A04D-22707CC66878} - mimalloctest - 10.0 - mimalloc-test - - - - Application - true - v142 - - - Application - false - v142 - true - - - Application - true - v142 - - - Application - false - v142 - true - - - - - - - - - - - - - - - - - - - - - $(ProjectDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(ProjectDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - - - $(ProjectDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(ProjectDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - - - $(ProjectDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(ProjectDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - - - $(ProjectDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(ProjectDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - - - - Level3 - Disabled - true - true - ..\..\include - stdcpp17 - - - Console - - - - - Level3 - Disabled - true - true - ..\..\include - stdcpp17 - - - Console - - - - - Level3 - MaxSpeed - true - true - true - true - ..\..\include - _MBCS;%(PreprocessorDefinitions);NDEBUG - stdcpp17 - - - true - true - Console - - - - - Level3 - MaxSpeed - true - true - true - true - ..\..\include - _MBCS;%(PreprocessorDefinitions);NDEBUG - stdcpp17 - - - true - true - Console - - - - - {abb5eae7-b3e6-432e-b636-333449892ea6} - - - - - - - - - \ No newline at end of file diff --git a/ide/vs2019/mimalloc.sln b/ide/vs2019/mimalloc.sln deleted file mode 100644 index fcb938a4fe2a83d8aa5e61a3d98f7cee5ac98794..0000000000000000000000000000000000000000 GIT binary patch literal 0 HcmV?d00001 literal 5263 zcmchb%Z}PG7=_m$@eUE)Or>#@8@ViIk%VNrXsc0?+I0rZ$W>KfivDhM&;9EUIEzYhO{-WVtr0n*}PgS&=t2D%M(xa(Jz! zMY+mwA6Qmx(X@2K7!BVEgSuvSG~DC%G*Z9OOjkE_EAWg!54`s6YqV-sFZ4BVU&pY_ zKsQIjyR!HW=k?Y2*^lBNP9h)pkrM*boEpHNnkF!e(1-&Qw>s8#{9e1!#w)bS^1PUj zuj#Y?IDgt;SX+AzqiB+Zi3cJ(ae-r735Zg_fSfK;>p-$r{Z(siku>Gv0kEwrp(&vU7poTe4bS87TuJPbi$(tQ+VGz{Csj9+|)fY4Zceo ze0<6b247$fvkD%@FrT=_-MFrCHxh4YPAu-veZD$u_%qszs%FK@ohEuWFFnLAJ;HeT zKquuot!`yf)S!H!8?WQ|?g>TT(Au`tHDQ*hNtM(sm+Nr4n7V>4W)!20sb0bo93!-g zXUe&DOq2R%kjj@TNnA_3Lw9~DaRj&a`+$0-$`UoHl8C=}E@$&4r;DXgWlUAUuWpp! z7^z=8)1G`ueY;ELOO-?&>rO}6{pf9pBEc;&UrL%dr!FIr)#}TaoGz9|-D0W=es!Y+ z$4H&#OHmu=+A(dnllp#_k<}D-C7%mb5_Rkq9KkIy6-t^or!FHAfBW(!r;DXgx0otD zzj{}&8zneK>NH=9+Bnxv(|UhZOXo|4L>)WMmo!Ik>r^UKSfVE0^?nlZS0-O-G^&hw zN0%=Jmf#qnT|Cpie97F5dlujjVfc_vCo$p zOK^ - - - - Debug - Win32 - - - Release - Win32 - - - Debug - x64 - - - Release - x64 - - - - 15.0 - {ABB5EAE7-B3E6-432E-B636-333449892EA6} - mimalloc - 10.0 - mimalloc - - - - StaticLibrary - true - v142 - - - StaticLibrary - false - v142 - true - - - StaticLibrary - true - v142 - - - StaticLibrary - false - v142 - true - - - - - - - - - - - - - - - - - - - - - $(SolutionDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(SolutionDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - .lib - mimalloc-static - - - $(SolutionDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(SolutionDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - .lib - mimalloc-static - - - $(SolutionDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(SolutionDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - .lib - mimalloc-static - - - $(SolutionDir)..\..\out\msvc-$(Platform)\$(Configuration)\ - $(SolutionDir)..\..\out\msvc-$(Platform)\$(ProjectName)\$(Configuration)\ - .lib - mimalloc-static - - - - Level3 - Disabled - true - true - ../../include - MI_DEBUG=3;%(PreprocessorDefinitions); - CompileAsCpp - false - Default - - - - - - - - - - - Level4 - Disabled - true - true - ../../include - MI_DEBUG=3;%(PreprocessorDefinitions); - CompileAsCpp - false - Default - - - - - - - - - - - - - - - - - - - Level3 - MaxSpeed - true - true - ../../include - %(PreprocessorDefinitions);NDEBUG - AssemblyAndSourceCode - $(IntDir) - false - false - Default - CompileAsCpp - true - Default - - - true - true - - - - - - - - - - - Level3 - MaxSpeed - true - true - ../../include - %(PreprocessorDefinitions);NDEBUG - AssemblyAndSourceCode - $(IntDir) - false - false - Default - CompileAsCpp - true - Default - - - true - true - - - - - - - - - - - - - - - - - false - false - false - false - - - true - true - true - true - - - true - true - true - true - - - - - - true - - - - - - - true - true - true - true - - - - - - - - - - - - - - - - - - - \ No newline at end of file diff --git a/ide/vs2019/mimalloc.vcxproj.filters b/ide/vs2019/mimalloc.vcxproj.filters deleted file mode 100644 index 4704fb2..0000000 --- a/ide/vs2019/mimalloc.vcxproj.filters +++ /dev/null @@ -1,84 +0,0 @@ - - - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - Source Files - - - - - Header Files - - - Header Files - - - Header Files - - - Header Files - - - Header Files - - - Header Files - - - - - {2b556b10-f559-4b2d-896e-142652adbf0c} - - - {852a14ae-6dde-4e95-8077-ca705e97e5af} - - - diff --git a/include/mimalloc-new-delete.h b/include/mimalloc-new-delete.h index fded0c0..c16f4a6 100644 --- a/include/mimalloc-new-delete.h +++ b/include/mimalloc-new-delete.h @@ -1,5 +1,5 @@ /* ---------------------------------------------------------------------------- -Copyright (c) 2018,2019 Microsoft Research, Daan Leijen +Copyright (c) 2018-2020 Microsoft Research, Daan Leijen This is free software; you can redistribute it and/or modify it under the terms of the MIT license. A copy of the license can be found in the file "LICENSE" at the root of this distribution. @@ -22,14 +22,26 @@ terms of the MIT license. A copy of the license can be found in the file #include #include + #if defined(_MSC_VER) && defined(_Ret_notnull_) && defined(_Post_writable_byte_size_) + // stay consistent with VCRT definitions + #define mi_decl_new(n) mi_decl_nodiscard mi_decl_restrict _Ret_notnull_ _Post_writable_byte_size_(n) + #define mi_decl_new_nothrow(n) mi_decl_nodiscard mi_decl_restrict _Ret_maybenull_ _Success_(return != NULL) _Post_writable_byte_size_(n) + #else + #define mi_decl_new(n) mi_decl_nodiscard mi_decl_restrict + #define mi_decl_new_nothrow(n) mi_decl_nodiscard mi_decl_restrict + #endif + void operator delete(void* p) noexcept { mi_free(p); }; void operator delete[](void* p) noexcept { mi_free(p); }; - void* operator new(std::size_t n) noexcept(false) { return mi_new(n); } - void* operator new[](std::size_t n) noexcept(false) { return mi_new(n); } + void operator delete (void* p, const std::nothrow_t&) noexcept { mi_free(p); } + void operator delete[](void* p, const std::nothrow_t&) noexcept { mi_free(p); } - void* operator new (std::size_t n, const std::nothrow_t& tag) noexcept { (void)(tag); return mi_new_nothrow(n); } - void* operator new[](std::size_t n, const std::nothrow_t& tag) noexcept { (void)(tag); return mi_new_nothrow(n); } + mi_decl_new(n) void* operator new(std::size_t n) noexcept(false) { return mi_new(n); } + mi_decl_new(n) void* operator new[](std::size_t n) noexcept(false) { return mi_new(n); } + + mi_decl_new_nothrow(n) void* operator new (std::size_t n, const std::nothrow_t& tag) noexcept { (void)(tag); return mi_new_nothrow(n); } + mi_decl_new_nothrow(n) void* operator new[](std::size_t n, const std::nothrow_t& tag) noexcept { (void)(tag); return mi_new_nothrow(n); } #if (__cplusplus >= 201402L || _MSC_VER >= 1916) void operator delete (void* p, std::size_t n) noexcept { mi_free_size(p,n); }; @@ -41,9 +53,11 @@ terms of the MIT license. A copy of the license can be found in the file void operator delete[](void* p, std::align_val_t al) noexcept { mi_free_aligned(p, static_cast(al)); } void operator delete (void* p, std::size_t n, std::align_val_t al) noexcept { mi_free_size_aligned(p, n, static_cast(al)); }; void operator delete[](void* p, std::size_t n, std::align_val_t al) noexcept { mi_free_size_aligned(p, n, static_cast(al)); }; + void operator delete (void* p, std::align_val_t al, const std::nothrow_t&) noexcept { mi_free_aligned(p, static_cast(al)); } + void operator delete[](void* p, std::align_val_t al, const std::nothrow_t&) noexcept { mi_free_aligned(p, static_cast(al)); } - void* operator new( std::size_t n, std::align_val_t al) noexcept(false) { return mi_new_aligned(n, static_cast(al)); } - void* operator new[]( std::size_t n, std::align_val_t al) noexcept(false) { return mi_new_aligned(n, static_cast(al)); } + void* operator new (std::size_t n, std::align_val_t al) noexcept(false) { return mi_new_aligned(n, static_cast(al)); } + void* operator new[](std::size_t n, std::align_val_t al) noexcept(false) { return mi_new_aligned(n, static_cast(al)); } void* operator new (std::size_t n, std::align_val_t al, const std::nothrow_t&) noexcept { return mi_new_aligned_nothrow(n, static_cast(al)); } void* operator new[](std::size_t n, std::align_val_t al, const std::nothrow_t&) noexcept { return mi_new_aligned_nothrow(n, static_cast(al)); } #endif diff --git a/include/mimalloc-override.h b/include/mimalloc-override.h index 201fb8b..c63b0b9 100644 --- a/include/mimalloc-override.h +++ b/include/mimalloc-override.h @@ -1,5 +1,5 @@ /* ---------------------------------------------------------------------------- -Copyright (c) 2018,2019 Microsoft Research, Daan Leijen +Copyright (c) 2018-2020 Microsoft Research, Daan Leijen This is free software; you can redistribute it and/or modify it under the terms of the MIT license. A copy of the license can be found in the file "LICENSE" at the root of this distribution. @@ -24,7 +24,7 @@ not accidentally mix pointers from different allocators). #define free(p) mi_free(p) #define strdup(s) mi_strdup(s) -#define strndup(s) mi_strndup(s) +#define strndup(s,n) mi_strndup(s,n) #define realpath(f,n) mi_realpath(f,n) // Microsoft extensions @@ -33,7 +33,7 @@ not accidentally mix pointers from different allocators). #define _recalloc(p,n,c) mi_recalloc(p,n,c) #define _strdup(s) mi_strdup(s) -#define _strndup(s) mi_strndup(s) +#define _strndup(s,n) mi_strndup(s,n) #define _wcsdup(s) (wchar_t*)mi_wcsdup((const unsigned short*)(s)) #define _mbsdup(s) mi_mbsdup(s) #define _dupenv_s(b,n,v) mi_dupenv_s(b,n,v) @@ -48,6 +48,7 @@ not accidentally mix pointers from different allocators). #define valloc(n) mi_valloc(n) #define pvalloc(n) mi_pvalloc(n) #define reallocarray(p,s,n) mi_reallocarray(p,s,n) +#define reallocarr(p,s,n) mi_reallocarr(p,s,n) #define memalign(a,n) mi_memalign(a,n) #define aligned_alloc(a,n) mi_aligned_alloc(a,n) #define posix_memalign(p,a,n) mi_posix_memalign(p,a,n) diff --git a/include/mimalloc.h b/include/mimalloc.h index 2574200..f77c2ea 100644 --- a/include/mimalloc.h +++ b/include/mimalloc.h @@ -1,5 +1,5 @@ /* ---------------------------------------------------------------------------- -Copyright (c) 2018-2020, Microsoft Research, Daan Leijen +Copyright (c) 2018-2023, Microsoft Research, Daan Leijen This is free software; you can redistribute it and/or modify it under the terms of the MIT license. A copy of the license can be found in the file "LICENSE" at the root of this distribution. @@ -8,7 +8,7 @@ terms of the MIT license. A copy of the license can be found in the file #ifndef MIMALLOC_H #define MIMALLOC_H -#define MI_MALLOC_VERSION 167 // major + 2 digits minor +#define MI_MALLOC_VERSION 212 // major + 2 digits minor // ------------------------------------------------------ // Compiler specific attributes @@ -26,8 +26,10 @@ terms of the MIT license. A copy of the license can be found in the file #if defined(__cplusplus) && (__cplusplus >= 201703) #define mi_decl_nodiscard [[nodiscard]] -#elif (__GNUC__ >= 4) || defined(__clang__) // includes clang, icc, and clang-cl +#elif (defined(__GNUC__) && (__GNUC__ >= 4)) || defined(__clang__) // includes clang, icc, and clang-cl #define mi_decl_nodiscard __attribute__((warn_unused_result)) +#elif defined(_HAS_NODISCARD) + #define mi_decl_nodiscard _NODISCARD #elif (_MSC_VER >= 1700) #define mi_decl_nodiscard _Check_return_ #else @@ -58,14 +60,12 @@ terms of the MIT license. A copy of the license can be found in the file #define mi_attr_alloc_size2(s1,s2) #define mi_attr_alloc_align(p) #elif defined(__GNUC__) // includes clang and icc - #define mi_cdecl // leads to warnings... __attribute__((cdecl)) - #if !defined(MI_SHARED_LIB) - #define mi_decl_export - #elif defined(MI_SHARED_LIB_EXPORT) + #if defined(MI_SHARED_LIB) && defined(MI_SHARED_LIB_EXPORT) #define mi_decl_export __attribute__((visibility("default"))) #else - #define mi_decl_export + #define mi_decl_export #endif + #define mi_cdecl // leads to warnings... __attribute__((cdecl)) #define mi_decl_restrict #define mi_attr_malloc __attribute__((malloc)) #if (defined(__clang_major__) && (__clang_major__ < 4)) || (__GNUC__ < 5) @@ -97,6 +97,7 @@ terms of the MIT license. A copy of the license can be found in the file #include // size_t #include // bool +#include // INTPTR_MAX #ifdef __cplusplus extern "C" { @@ -159,6 +160,10 @@ mi_decl_export void mi_thread_init(void) mi_attr_noexcept; mi_decl_export void mi_thread_done(void) mi_attr_noexcept; mi_decl_export void mi_thread_stats_print_out(mi_output_fun* out, void* arg) mi_attr_noexcept; +mi_decl_export void mi_process_info(size_t* elapsed_msecs, size_t* user_msecs, size_t* system_msecs, + size_t* current_rss, size_t* peak_rss, + size_t* current_commit, size_t* peak_commit, size_t* page_faults) mi_attr_noexcept; + // ------------------------------------------------------------------------------------- // Aligned allocation // Note that `alignment` always follows `size` for consistency with unaligned @@ -251,8 +256,9 @@ typedef struct mi_heap_area_s { void* blocks; // start of the area containing heap blocks size_t reserved; // bytes reserved for this area (virtual) size_t committed; // current available bytes for this area - size_t used; // bytes in use by allocated blocks + size_t used; // number of allocated blocks size_t block_size; // size in bytes of each block + size_t full_block_size; // size in bytes of a full block including padding and metadata. } mi_heap_area_t; typedef bool (mi_cdecl mi_block_visit_fun)(const mi_heap_t* heap, const mi_heap_area_t* area, void* block, size_t block_size, void* arg); @@ -266,6 +272,23 @@ mi_decl_nodiscard mi_decl_export bool mi_is_redirected(void) mi_attr_noexcept; mi_decl_export int mi_reserve_huge_os_pages_interleave(size_t pages, size_t numa_nodes, size_t timeout_msecs) mi_attr_noexcept; mi_decl_export int mi_reserve_huge_os_pages_at(size_t pages, int numa_node, size_t timeout_msecs) mi_attr_noexcept; +mi_decl_export int mi_reserve_os_memory(size_t size, bool commit, bool allow_large) mi_attr_noexcept; +mi_decl_export bool mi_manage_os_memory(void* start, size_t size, bool is_committed, bool is_large, bool is_zero, int numa_node) mi_attr_noexcept; + +mi_decl_export void mi_debug_show_arenas(void) mi_attr_noexcept; + +// Experimental: heaps associated with specific memory arena's +typedef int mi_arena_id_t; +mi_decl_export void* mi_arena_area(mi_arena_id_t arena_id, size_t* size); +mi_decl_export int mi_reserve_huge_os_pages_at_ex(size_t pages, int numa_node, size_t timeout_msecs, bool exclusive, mi_arena_id_t* arena_id) mi_attr_noexcept; +mi_decl_export int mi_reserve_os_memory_ex(size_t size, bool commit, bool allow_large, bool exclusive, mi_arena_id_t* arena_id) mi_attr_noexcept; +mi_decl_export bool mi_manage_os_memory_ex(void* start, size_t size, bool is_committed, bool is_large, bool is_zero, int numa_node, bool exclusive, mi_arena_id_t* arena_id) mi_attr_noexcept; + +#if MI_MALLOC_VERSION >= 182 +// Create a heap that only allocates in the specified arena +mi_decl_nodiscard mi_decl_export mi_heap_t* mi_heap_new_in_arena(mi_arena_id_t arena_id); +#endif + // deprecated mi_decl_export int mi_reserve_huge_os_pages(size_t pages, double max_secs, size_t* pages_reserved) mi_attr_noexcept; @@ -290,30 +313,45 @@ mi_decl_export int mi_reserve_huge_os_pages(size_t pages, double max_secs, size // ------------------------------------------------------ -// Options, all `false` by default +// Options // ------------------------------------------------------ typedef enum mi_option_e { // stable options - mi_option_show_errors, - mi_option_show_stats, - mi_option_verbose, - // the following options are experimental - mi_option_eager_commit, - mi_option_eager_region_commit, - mi_option_reset_decommits, - mi_option_large_os_pages, // implies eager commit - mi_option_reserve_huge_os_pages, - mi_option_segment_cache, - mi_option_page_reset, - mi_option_abandoned_page_reset, - mi_option_segment_reset, - mi_option_eager_commit_delay, - mi_option_reset_delay, - mi_option_use_numa_nodes, - mi_option_os_tag, - mi_option_max_errors, - _mi_option_last + mi_option_show_errors, // print error messages + mi_option_show_stats, // print statistics on termination + mi_option_verbose, // print verbose messages + // the following options are experimental (see src/options.h) + mi_option_eager_commit, // eager commit segments? (after `eager_commit_delay` segments) (=1) + mi_option_arena_eager_commit, // eager commit arenas? Use 2 to enable just on overcommit systems (=2) + mi_option_purge_decommits, // should a memory purge decommit (or only reset) (=1) + mi_option_allow_large_os_pages, // allow large (2MiB) OS pages, implies eager commit + mi_option_reserve_huge_os_pages, // reserve N huge OS pages (1GiB/page) at startup + mi_option_reserve_huge_os_pages_at, // reserve huge OS pages at a specific NUMA node + mi_option_reserve_os_memory, // reserve specified amount of OS memory in an arena at startup + mi_option_deprecated_segment_cache, + mi_option_deprecated_page_reset, + mi_option_abandoned_page_purge, // immediately purge delayed purges on thread termination + mi_option_deprecated_segment_reset, + mi_option_eager_commit_delay, + mi_option_purge_delay, // memory purging is delayed by N milli seconds; use 0 for immediate purging or -1 for no purging at all. + mi_option_use_numa_nodes, // 0 = use all available numa nodes, otherwise use at most N nodes. + mi_option_limit_os_alloc, // 1 = do not use OS memory for allocation (but only programmatically reserved arenas) + mi_option_os_tag, // tag used for OS logging (macOS only for now) + mi_option_max_errors, // issue at most N error messages + mi_option_max_warnings, // issue at most N warning messages + mi_option_max_segment_reclaim, + mi_option_destroy_on_exit, // if set, release all memory on exit; sometimes used for dynamic unloading but can be unsafe. + mi_option_arena_reserve, // initial memory size in KiB for arena reservation (1GiB on 64-bit) + mi_option_arena_purge_mult, + mi_option_purge_extend_delay, + _mi_option_last, + // legacy option names + mi_option_large_os_pages = mi_option_allow_large_os_pages, + mi_option_eager_region_commit = mi_option_arena_eager_commit, + mi_option_reset_decommits = mi_option_purge_decommits, + mi_option_reset_delay = mi_option_purge_delay, + mi_option_abandoned_page_reset = mi_option_abandoned_page_purge } mi_option_t; @@ -323,7 +361,9 @@ mi_decl_export void mi_option_disable(mi_option_t option); mi_decl_export void mi_option_set_enabled(mi_option_t option, bool enable); mi_decl_export void mi_option_set_enabled_default(mi_option_t option, bool enable); -mi_decl_nodiscard mi_decl_export long mi_option_get(mi_option_t option); +mi_decl_nodiscard mi_decl_export long mi_option_get(mi_option_t option); +mi_decl_nodiscard mi_decl_export long mi_option_get_clamp(mi_option_t option, long min, long max); +mi_decl_nodiscard mi_decl_export size_t mi_option_get_size(mi_option_t option); mi_decl_export void mi_option_set(mi_option_t option, long value); mi_decl_export void mi_option_set_default(mi_option_t option, long value); @@ -337,6 +377,7 @@ mi_decl_export void mi_option_set_default(mi_option_t option, long value); mi_decl_export void mi_cfree(void* p) mi_attr_noexcept; mi_decl_export void* mi__expand(void* p, size_t newsize) mi_attr_noexcept; mi_decl_nodiscard mi_decl_export size_t mi_malloc_size(const void* p) mi_attr_noexcept; +mi_decl_nodiscard mi_decl_export size_t mi_malloc_good_size(size_t size) mi_attr_noexcept; mi_decl_nodiscard mi_decl_export size_t mi_malloc_usable_size(const void *p) mi_attr_noexcept; mi_decl_export int mi_posix_memalign(void** p, size_t alignment, size_t size) mi_attr_noexcept; @@ -346,6 +387,7 @@ mi_decl_nodiscard mi_decl_export mi_decl_restrict void* mi_pvalloc(size_t size) mi_decl_nodiscard mi_decl_export mi_decl_restrict void* mi_aligned_alloc(size_t alignment, size_t size) mi_attr_noexcept mi_attr_malloc mi_attr_alloc_size(2) mi_attr_alloc_align(1); mi_decl_nodiscard mi_decl_export void* mi_reallocarray(void* p, size_t count, size_t size) mi_attr_noexcept mi_attr_alloc_size2(2,3); +mi_decl_nodiscard mi_decl_export int mi_reallocarr(void* p, size_t count, size_t size) mi_attr_noexcept; mi_decl_nodiscard mi_decl_export void* mi_aligned_recalloc(void* p, size_t newcount, size_t size, size_t alignment) mi_attr_noexcept; mi_decl_nodiscard mi_decl_export void* mi_aligned_offset_recalloc(void* p, size_t newcount, size_t size, size_t alignment, size_t offset) mi_attr_noexcept; @@ -368,6 +410,9 @@ mi_decl_nodiscard mi_decl_export mi_decl_restrict void* mi_new_n(size_t count, s mi_decl_nodiscard mi_decl_export void* mi_new_realloc(void* p, size_t newsize) mi_attr_alloc_size(2); mi_decl_nodiscard mi_decl_export void* mi_new_reallocn(void* p, size_t newcount, size_t size) mi_attr_alloc_size2(2, 3); +mi_decl_nodiscard mi_decl_export mi_decl_restrict void* mi_heap_alloc_new(mi_heap_t* heap, size_t size) mi_attr_malloc mi_attr_alloc_size(2); +mi_decl_nodiscard mi_decl_export mi_decl_restrict void* mi_heap_alloc_new_n(mi_heap_t* heap, size_t count, size_t size) mi_attr_malloc mi_attr_alloc_size2(2, 3); + #ifdef __cplusplus } #endif @@ -378,13 +423,14 @@ mi_decl_nodiscard mi_decl_export void* mi_new_reallocn(void* p, size_t newcount, // --------------------------------------------------------------------------------------------- #ifdef __cplusplus +#include // std::size_t #include // PTRDIFF_MAX #if (__cplusplus >= 201103L) || (_MSC_VER > 1900) // C++11 #include // std::true_type #include // std::forward #endif -template struct mi_stl_allocator { +template struct _mi_stl_allocator_common { typedef T value_type; typedef std::size_t size_type; typedef std::ptrdiff_t difference_type; @@ -392,6 +438,27 @@ template struct mi_stl_allocator { typedef value_type const& const_reference; typedef value_type* pointer; typedef value_type const* const_pointer; + + #if ((__cplusplus >= 201103L) || (_MSC_VER > 1900)) // C++11 + using propagate_on_container_copy_assignment = std::true_type; + using propagate_on_container_move_assignment = std::true_type; + using propagate_on_container_swap = std::true_type; + template void construct(U* p, Args&& ...args) { ::new(p) U(std::forward(args)...); } + template void destroy(U* p) mi_attr_noexcept { p->~U(); } + #else + void construct(pointer p, value_type const& val) { ::new(p) value_type(val); } + void destroy(pointer p) { p->~value_type(); } + #endif + + size_type max_size() const mi_attr_noexcept { return (PTRDIFF_MAX/sizeof(value_type)); } + pointer address(reference x) const { return &x; } + const_pointer address(const_reference x) const { return &x; } +}; + +template struct mi_stl_allocator : public _mi_stl_allocator_common { + using typename _mi_stl_allocator_common::size_type; + using typename _mi_stl_allocator_common::value_type; + using typename _mi_stl_allocator_common::pointer; template struct rebind { typedef mi_stl_allocator other; }; mi_stl_allocator() mi_attr_noexcept = default; @@ -408,24 +475,91 @@ template struct mi_stl_allocator { #endif #if ((__cplusplus >= 201103L) || (_MSC_VER > 1900)) // C++11 - using propagate_on_container_copy_assignment = std::true_type; - using propagate_on_container_move_assignment = std::true_type; - using propagate_on_container_swap = std::true_type; - using is_always_equal = std::true_type; - template void construct(U* p, Args&& ...args) { ::new(p) U(std::forward(args)...); } - template void destroy(U* p) mi_attr_noexcept { p->~U(); } - #else - void construct(pointer p, value_type const& val) { ::new(p) value_type(val); } - void destroy(pointer p) { p->~value_type(); } + using is_always_equal = std::true_type; #endif - - size_type max_size() const mi_attr_noexcept { return (PTRDIFF_MAX/sizeof(value_type)); } - pointer address(reference x) const { return &x; } - const_pointer address(const_reference x) const { return &x; } }; template bool operator==(const mi_stl_allocator& , const mi_stl_allocator& ) mi_attr_noexcept { return true; } template bool operator!=(const mi_stl_allocator& , const mi_stl_allocator& ) mi_attr_noexcept { return false; } + + +#if (__cplusplus >= 201103L) || (_MSC_VER >= 1900) // C++11 +#define MI_HAS_HEAP_STL_ALLOCATOR 1 + +#include // std::shared_ptr + +// Common base class for STL allocators in a specific heap +template struct _mi_heap_stl_allocator_common : public _mi_stl_allocator_common { + using typename _mi_stl_allocator_common::size_type; + using typename _mi_stl_allocator_common::value_type; + using typename _mi_stl_allocator_common::pointer; + + _mi_heap_stl_allocator_common(mi_heap_t* hp) : heap(hp) { } /* will not delete nor destroy the passed in heap */ + + #if (__cplusplus >= 201703L) // C++17 + mi_decl_nodiscard T* allocate(size_type count) { return static_cast(mi_heap_alloc_new_n(this->heap.get(), count, sizeof(T))); } + mi_decl_nodiscard T* allocate(size_type count, const void*) { return allocate(count); } + #else + mi_decl_nodiscard pointer allocate(size_type count, const void* = 0) { return static_cast(mi_heap_alloc_new_n(this->heap.get(), count, sizeof(value_type))); } + #endif + + #if ((__cplusplus >= 201103L) || (_MSC_VER > 1900)) // C++11 + using is_always_equal = std::false_type; + #endif + + void collect(bool force) { mi_heap_collect(this->heap.get(), force); } + template bool is_equal(const _mi_heap_stl_allocator_common& x) const { return (this->heap == x.heap); } + +protected: + std::shared_ptr heap; + template friend struct _mi_heap_stl_allocator_common; + + _mi_heap_stl_allocator_common() { + mi_heap_t* hp = mi_heap_new(); + this->heap.reset(hp, (_mi_destroy ? &heap_destroy : &heap_delete)); /* calls heap_delete/destroy when the refcount drops to zero */ + } + _mi_heap_stl_allocator_common(const _mi_heap_stl_allocator_common& x) mi_attr_noexcept : heap(x.heap) { } + template _mi_heap_stl_allocator_common(const _mi_heap_stl_allocator_common& x) mi_attr_noexcept : heap(x.heap) { } + +private: + static void heap_delete(mi_heap_t* hp) { if (hp != NULL) { mi_heap_delete(hp); } } + static void heap_destroy(mi_heap_t* hp) { if (hp != NULL) { mi_heap_destroy(hp); } } +}; + +// STL allocator allocation in a specific heap +template struct mi_heap_stl_allocator : public _mi_heap_stl_allocator_common { + using typename _mi_heap_stl_allocator_common::size_type; + mi_heap_stl_allocator() : _mi_heap_stl_allocator_common() { } // creates fresh heap that is deleted when the destructor is called + mi_heap_stl_allocator(mi_heap_t* hp) : _mi_heap_stl_allocator_common(hp) { } // no delete nor destroy on the passed in heap + template mi_heap_stl_allocator(const mi_heap_stl_allocator& x) mi_attr_noexcept : _mi_heap_stl_allocator_common(x) { } + + mi_heap_stl_allocator select_on_container_copy_construction() const { return *this; } + void deallocate(T* p, size_type) { mi_free(p); } + template struct rebind { typedef mi_heap_stl_allocator other; }; +}; + +template bool operator==(const mi_heap_stl_allocator& x, const mi_heap_stl_allocator& y) mi_attr_noexcept { return (x.is_equal(y)); } +template bool operator!=(const mi_heap_stl_allocator& x, const mi_heap_stl_allocator& y) mi_attr_noexcept { return (!x.is_equal(y)); } + + +// STL allocator allocation in a specific heap, where `free` does nothing and +// the heap is destroyed in one go on destruction -- use with care! +template struct mi_heap_destroy_stl_allocator : public _mi_heap_stl_allocator_common { + using typename _mi_heap_stl_allocator_common::size_type; + mi_heap_destroy_stl_allocator() : _mi_heap_stl_allocator_common() { } // creates fresh heap that is destroyed when the destructor is called + mi_heap_destroy_stl_allocator(mi_heap_t* hp) : _mi_heap_stl_allocator_common(hp) { } // no delete nor destroy on the passed in heap + template mi_heap_destroy_stl_allocator(const mi_heap_destroy_stl_allocator& x) mi_attr_noexcept : _mi_heap_stl_allocator_common(x) { } + + mi_heap_destroy_stl_allocator select_on_container_copy_construction() const { return *this; } + void deallocate(T*, size_type) { /* do nothing as we destroy the heap on destruct. */ } + template struct rebind { typedef mi_heap_destroy_stl_allocator other; }; +}; + +template bool operator==(const mi_heap_destroy_stl_allocator& x, const mi_heap_destroy_stl_allocator& y) mi_attr_noexcept { return (x.is_equal(y)); } +template bool operator!=(const mi_heap_destroy_stl_allocator& x, const mi_heap_destroy_stl_allocator& y) mi_attr_noexcept { return (!x.is_equal(y)); } + +#endif // C++11 + #endif // __cplusplus #endif diff --git a/include/mimalloc-atomic.h b/include/mimalloc/atomic.h similarity index 79% rename from include/mimalloc-atomic.h rename to include/mimalloc/atomic.h index b650607..fe418fa 100644 --- a/include/mimalloc-atomic.h +++ b/include/mimalloc/atomic.h @@ -1,5 +1,5 @@ /* ---------------------------------------------------------------------------- -Copyright (c) 2018,2020 Microsoft Research, Daan Leijen +Copyright (c) 2018-2023 Microsoft Research, Daan Leijen This is free software; you can redistribute it and/or modify it under the terms of the MIT license. A copy of the license can be found in the file "LICENSE" at the root of this distribution. @@ -11,9 +11,9 @@ terms of the MIT license. A copy of the license can be found in the file // -------------------------------------------------------------------------------------------- // Atomics // We need to be portable between C, C++, and MSVC. -// We base the primitives on the C/C++ atomics and create a mimimal wrapper for MSVC in C compilation mode. -// This is why we try to use only `uintptr_t` and `*` as atomic types. -// To gain better insight in the range of used atomics, we use explicitly named memory order operations +// We base the primitives on the C/C++ atomics and create a mimimal wrapper for MSVC in C compilation mode. +// This is why we try to use only `uintptr_t` and `*` as atomic types. +// To gain better insight in the range of used atomics, we use explicitly named memory order operations // instead of passing the memory order as a parameter. // ----------------------------------------------------------------------------------------------- @@ -23,10 +23,15 @@ terms of the MIT license. A copy of the license can be found in the file #define _Atomic(tp) std::atomic #define mi_atomic(name) std::atomic_##name #define mi_memory_order(name) std::memory_order_##name +#if !defined(ATOMIC_VAR_INIT) || (__cplusplus >= 202002L) // c++20, see issue #571 + #define MI_ATOMIC_VAR_INIT(x) x +#else + #define MI_ATOMIC_VAR_INIT(x) ATOMIC_VAR_INIT(x) +#endif #elif defined(_MSC_VER) // Use MSVC C wrapper for C11 atomics #define _Atomic(tp) tp -#define ATOMIC_VAR_INIT(x) x +#define MI_ATOMIC_VAR_INIT(x) x #define mi_atomic(name) mi_atomic_##name #define mi_memory_order(name) mi_memory_order_##name #else @@ -34,6 +39,11 @@ terms of the MIT license. A copy of the license can be found in the file #include #define mi_atomic(name) atomic_##name #define mi_memory_order(name) memory_order_##name +#if !defined(ATOMIC_VAR_INIT) || (__STDC_VERSION__ >= 201710L) // c17, see issue #735 + #define MI_ATOMIC_VAR_INIT(x) x +#else + #define MI_ATOMIC_VAR_INIT(x) ATOMIC_VAR_INIT(x) +#endif #endif // Various defines for all used memory orders in mimalloc @@ -107,18 +117,20 @@ static inline void mi_atomic_maxi64_relaxed(volatile int64_t* p, int64_t x) { } // Used by timers -#define mi_atomic_loadi64_acquire(p) mi_atomic(load_explicit)(p,mi_memory_order(acquire)) -#define mi_atomic_loadi64_relaxed(p) mi_atomic(load_explicit)(p,mi_memory_order(relaxed)) -#define mi_atomic_storei64_release(p,x) mi_atomic(store_explicit)(p,x,mi_memory_order(release)) -#define mi_atomic_storei64_relaxed(p,x) mi_atomic(store_explicit)(p,x,mi_memory_order(relaxed)) +#define mi_atomic_loadi64_acquire(p) mi_atomic(load_explicit)(p,mi_memory_order(acquire)) +#define mi_atomic_loadi64_relaxed(p) mi_atomic(load_explicit)(p,mi_memory_order(relaxed)) +#define mi_atomic_storei64_release(p,x) mi_atomic(store_explicit)(p,x,mi_memory_order(release)) +#define mi_atomic_storei64_relaxed(p,x) mi_atomic(store_explicit)(p,x,mi_memory_order(relaxed)) +#define mi_atomic_casi64_strong_acq_rel(p,e,d) mi_atomic_cas_strong_acq_rel(p,e,d) +#define mi_atomic_addi64_acq_rel(p,i) mi_atomic_add_acq_rel(p,i) #elif defined(_MSC_VER) // MSVC C compilation wrapper that uses Interlocked operations to model C11 atomics. #define WIN32_LEAN_AND_MEAN -#include +#include #include #ifdef _WIN64 typedef LONG64 msc_intptr_t; @@ -173,7 +185,7 @@ static inline uintptr_t mi_atomic_exchange_explicit(_Atomic(uintptr_t)*p, uintpt } static inline void mi_atomic_thread_fence(mi_memory_order mo) { (void)(mo); - _Atomic(uintptr_t)x = 0; + _Atomic(uintptr_t) x = 0; mi_atomic_exchange_explicit(&x, 1, mo); } static inline uintptr_t mi_atomic_load_explicit(_Atomic(uintptr_t) const* p, mi_memory_order mo) { @@ -239,6 +251,21 @@ static inline void mi_atomic_maxi64_relaxed(volatile _Atomic(int64_t)*p, int64_t } while (current < x && _InterlockedCompareExchange64(p, x, current) != current); } +static inline void mi_atomic_addi64_acq_rel(volatile _Atomic(int64_t*)p, int64_t i) { + mi_atomic_addi64_relaxed(p, i); +} + +static inline bool mi_atomic_casi64_strong_acq_rel(volatile _Atomic(int64_t*)p, int64_t* exp, int64_t des) { + int64_t read = _InterlockedCompareExchange64(p, des, *exp); + if (read == *exp) { + return true; + } + else { + *exp = read; + return false; + } +} + // The pointer macros cast to `uintptr_t`. #define mi_atomic_load_ptr_acquire(tp,p) (tp*)mi_atomic_load_acquire((_Atomic(uintptr_t)*)(p)) #define mi_atomic_load_ptr_relaxed(tp,p) (tp*)mi_atomic_load_relaxed((_Atomic(uintptr_t)*)(p)) @@ -269,7 +296,27 @@ static inline intptr_t mi_atomic_subi(_Atomic(intptr_t)*p, intptr_t sub) { return (intptr_t)mi_atomic_addi(p, -sub); } -// Yield +typedef _Atomic(uintptr_t) mi_atomic_once_t; + +// Returns true only on the first invocation +static inline bool mi_atomic_once( mi_atomic_once_t* once ) { + if (mi_atomic_load_relaxed(once) != 0) return false; // quick test + uintptr_t expected = 0; + return mi_atomic_cas_strong_acq_rel(once, &expected, (uintptr_t)1); // try to set to 1 +} + +typedef _Atomic(uintptr_t) mi_atomic_guard_t; + +// Allows only one thread to execute at a time +#define mi_atomic_guard(guard) \ + uintptr_t _mi_guard_expected = 0; \ + for(bool _mi_guard_once = true; \ + _mi_guard_once && mi_atomic_cas_strong_acq_rel(guard,&_mi_guard_expected,(uintptr_t)1); \ + (mi_atomic_store_release(guard,(uintptr_t)0), _mi_guard_once = false) ) + + + +// Yield #if defined(__cplusplus) #include static inline void mi_atomic_yield(void) { @@ -281,17 +328,47 @@ static inline void mi_atomic_yield(void) { static inline void mi_atomic_yield(void) { YieldProcessor(); } +#elif defined(__SSE2__) +#include +static inline void mi_atomic_yield(void) { + _mm_pause(); +} #elif (defined(__GNUC__) || defined(__clang__)) && \ - (defined(__x86_64__) || defined(__i386__) || defined(__arm__) || defined(__aarch64__)) + (defined(__x86_64__) || defined(__i386__) || defined(__arm__) || defined(__armel__) || defined(__ARMEL__) || \ + defined(__aarch64__) || defined(__powerpc__) || defined(__ppc__) || defined(__PPC__)) || defined(__POWERPC__) #if defined(__x86_64__) || defined(__i386__) static inline void mi_atomic_yield(void) { __asm__ volatile ("pause" ::: "memory"); } -#elif defined(__arm__) || defined(__aarch64__) +#elif defined(__aarch64__) static inline void mi_atomic_yield(void) { - __asm__ volatile("yield"); + __asm__ volatile("wfe"); +} +#elif (defined(__arm__) && __ARM_ARCH__ >= 7) +static inline void mi_atomic_yield(void) { + __asm__ volatile("yield" ::: "memory"); +} +#elif defined(__powerpc__) || defined(__ppc__) || defined(__PPC__) || defined(__POWERPC__) +#ifdef __APPLE__ +static inline void mi_atomic_yield(void) { + __asm__ volatile ("or r27,r27,r27" ::: "memory"); +} +#else +static inline void mi_atomic_yield(void) { + __asm__ __volatile__ ("or 27,27,27" ::: "memory"); } #endif +#elif defined(__armel__) || defined(__ARMEL__) +static inline void mi_atomic_yield(void) { + __asm__ volatile ("nop" ::: "memory"); +} +#endif +#elif defined(__sun) +// Fallback for other archs +#include +static inline void mi_atomic_yield(void) { + smt_pause(); +} #elif defined(__wasi__) #include static inline void mi_atomic_yield(void) { @@ -305,4 +382,4 @@ static inline void mi_atomic_yield(void) { #endif -#endif // __MIMALLOC_ATOMIC_H \ No newline at end of file +#endif // __MIMALLOC_ATOMIC_H diff --git a/include/mimalloc-internal.h b/include/mimalloc/internal.h similarity index 50% rename from include/mimalloc-internal.h rename to include/mimalloc/internal.h index d57f65c..00d2626 100644 --- a/include/mimalloc-internal.h +++ b/include/mimalloc/internal.h @@ -1,5 +1,5 @@ /* ---------------------------------------------------------------------------- -Copyright (c) 2018, Microsoft Research, Daan Leijen +Copyright (c) 2018-2023, Microsoft Research, Daan Leijen This is free software; you can redistribute it and/or modify it under the terms of the MIT license. A copy of the license can be found in the file "LICENSE" at the root of this distribution. @@ -8,7 +8,14 @@ terms of the MIT license. A copy of the license can be found in the file #ifndef MIMALLOC_INTERNAL_H #define MIMALLOC_INTERNAL_H -#include "mimalloc-types.h" + +// -------------------------------------------------------------------------- +// This file contains the interal API's of mimalloc and various utility +// functions and macros. +// -------------------------------------------------------------------------- + +#include "mimalloc/types.h" +#include "mimalloc/track.h" #if (MI_DEBUG>0) #define mi_trace_message(...) _mi_trace_message(__VA_ARGS__) @@ -19,10 +26,11 @@ terms of the MIT license. A copy of the license can be found in the file #define MI_CACHE_LINE 64 #if defined(_MSC_VER) #pragma warning(disable:4127) // suppress constant conditional warning (due to MI_SECURE paths) +#pragma warning(disable:26812) // unscoped enum warning #define mi_decl_noinline __declspec(noinline) #define mi_decl_thread __declspec(thread) #define mi_decl_cache_align __declspec(align(MI_CACHE_LINE)) -#elif (defined(__GNUC__) && (__GNUC__>=3)) // includes clang and icc +#elif (defined(__GNUC__) && (__GNUC__ >= 3)) || defined(__clang__) // includes clang and icc #define mi_decl_noinline __attribute__((noinline)) #define mi_decl_thread __thread #define mi_decl_cache_align __attribute__((aligned(MI_CACHE_LINE))) @@ -32,6 +40,21 @@ terms of the MIT license. A copy of the license can be found in the file #define mi_decl_cache_align #endif +#if defined(__EMSCRIPTEN__) && !defined(__wasi__) +#define __wasi__ +#endif + +#if defined(__cplusplus) +#define mi_decl_externc extern "C" +#else +#define mi_decl_externc +#endif + +// pthreads +#if !defined(_WIN32) && !defined(__wasi__) +#define MI_USE_PTHREADS +#include +#endif // "options.c" void _mi_fputs(mi_output_fun* out, void* arg, const char* prefix, const char* message); @@ -44,61 +67,99 @@ void _mi_error_message(int err, const char* fmt, ...); // random.c void _mi_random_init(mi_random_ctx_t* ctx); +void _mi_random_init_weak(mi_random_ctx_t* ctx); +void _mi_random_reinit_if_weak(mi_random_ctx_t * ctx); void _mi_random_split(mi_random_ctx_t* ctx, mi_random_ctx_t* new_ctx); uintptr_t _mi_random_next(mi_random_ctx_t* ctx); uintptr_t _mi_heap_random_next(mi_heap_t* heap); -uintptr_t _os_random_weak(uintptr_t extra_seed); +uintptr_t _mi_os_random_weak(uintptr_t extra_seed); static inline uintptr_t _mi_random_shuffle(uintptr_t x); // init.c -extern mi_stats_t _mi_stats_main; -extern const mi_page_t _mi_page_empty; +extern mi_decl_cache_align mi_stats_t _mi_stats_main; +extern mi_decl_cache_align const mi_page_t _mi_page_empty; bool _mi_is_main_thread(void); -bool _mi_preloading(); // true while the C runtime is not ready +size_t _mi_current_thread_count(void); +bool _mi_preloading(void); // true while the C runtime is not initialized yet +mi_threadid_t _mi_thread_id(void) mi_attr_noexcept; +mi_heap_t* _mi_heap_main_get(void); // statically allocated main backing heap +void _mi_thread_done(mi_heap_t* heap); +void _mi_thread_data_collect(void); // os.c +void _mi_os_init(void); // called from process init +void* _mi_os_alloc(size_t size, mi_memid_t* memid, mi_stats_t* stats); +void _mi_os_free(void* p, size_t size, mi_memid_t memid, mi_stats_t* stats); +void _mi_os_free_ex(void* p, size_t size, bool still_committed, mi_memid_t memid, mi_stats_t* stats); + size_t _mi_os_page_size(void); -void _mi_os_init(void); // called from process init -void* _mi_os_alloc(size_t size, mi_stats_t* stats); // to allocate thread local data -void _mi_os_free(void* p, size_t size, mi_stats_t* stats); // to free thread local data size_t _mi_os_good_alloc_size(size_t size); +bool _mi_os_has_overcommit(void); +bool _mi_os_has_virtual_reserve(void); -// memory.c -void* _mi_mem_alloc_aligned(size_t size, size_t alignment, bool* commit, bool* large, bool* is_zero, size_t* id, mi_os_tld_t* tld); -void _mi_mem_free(void* p, size_t size, size_t id, bool fully_committed, bool any_reset, mi_os_tld_t* tld); +bool _mi_os_purge(void* p, size_t size, mi_stats_t* stats); +bool _mi_os_reset(void* addr, size_t size, mi_stats_t* tld_stats); +bool _mi_os_commit(void* p, size_t size, bool* is_zero, mi_stats_t* stats); +bool _mi_os_decommit(void* addr, size_t size, mi_stats_t* stats); +bool _mi_os_protect(void* addr, size_t size); +bool _mi_os_unprotect(void* addr, size_t size); +bool _mi_os_purge(void* p, size_t size, mi_stats_t* stats); +bool _mi_os_purge_ex(void* p, size_t size, bool allow_reset, mi_stats_t* stats); -bool _mi_mem_reset(void* p, size_t size, mi_os_tld_t* tld); -bool _mi_mem_unreset(void* p, size_t size, bool* is_zero, mi_os_tld_t* tld); -bool _mi_mem_commit(void* p, size_t size, bool* is_zero, mi_os_tld_t* tld); -bool _mi_mem_protect(void* addr, size_t size); -bool _mi_mem_unprotect(void* addr, size_t size); +void* _mi_os_alloc_aligned(size_t size, size_t alignment, bool commit, bool allow_large, mi_memid_t* memid, mi_stats_t* stats); +void* _mi_os_alloc_aligned_at_offset(size_t size, size_t alignment, size_t align_offset, bool commit, bool allow_large, mi_memid_t* memid, mi_stats_t* tld_stats); -void _mi_mem_collect(mi_os_tld_t* tld); +void* _mi_os_get_aligned_hint(size_t try_alignment, size_t size); +bool _mi_os_use_large_page(size_t size, size_t alignment); +size_t _mi_os_large_page_size(void); + +void* _mi_os_alloc_huge_os_pages(size_t pages, int numa_node, mi_msecs_t max_secs, size_t* pages_reserved, size_t* psize, mi_memid_t* memid); + +// arena.c +mi_arena_id_t _mi_arena_id_none(void); +void _mi_arena_free(void* p, size_t size, size_t still_committed_size, mi_memid_t memid, mi_stats_t* stats); +void* _mi_arena_alloc(size_t size, bool commit, bool allow_large, mi_arena_id_t req_arena_id, mi_memid_t* memid, mi_os_tld_t* tld); +void* _mi_arena_alloc_aligned(size_t size, size_t alignment, size_t align_offset, bool commit, bool allow_large, mi_arena_id_t req_arena_id, mi_memid_t* memid, mi_os_tld_t* tld); +bool _mi_arena_memid_is_suitable(mi_memid_t memid, mi_arena_id_t request_arena_id); +bool _mi_arena_contains(const void* p); +void _mi_arena_collect(bool force_purge, mi_stats_t* stats); +void _mi_arena_unsafe_destroy_all(mi_stats_t* stats); + +// "segment-map.c" +void _mi_segment_map_allocated_at(const mi_segment_t* segment); +void _mi_segment_map_freed_at(const mi_segment_t* segment); // "segment.c" -mi_page_t* _mi_segment_page_alloc(mi_heap_t* heap, size_t block_wsize, mi_segments_tld_t* tld, mi_os_tld_t* os_tld); +mi_page_t* _mi_segment_page_alloc(mi_heap_t* heap, size_t block_size, size_t page_alignment, mi_segments_tld_t* tld, mi_os_tld_t* os_tld); void _mi_segment_page_free(mi_page_t* page, bool force, mi_segments_tld_t* tld); void _mi_segment_page_abandon(mi_page_t* page, mi_segments_tld_t* tld); -uint8_t* _mi_segment_page_start(const mi_segment_t* segment, const mi_page_t* page, size_t block_size, size_t* page_size, size_t* pre_size); // page start for any page -void _mi_segment_huge_page_free(mi_segment_t* segment, mi_page_t* page, mi_block_t* block); - +bool _mi_segment_try_reclaim_abandoned( mi_heap_t* heap, bool try_all, mi_segments_tld_t* tld); void _mi_segment_thread_collect(mi_segments_tld_t* tld); + +#if MI_HUGE_PAGE_ABANDON +void _mi_segment_huge_page_free(mi_segment_t* segment, mi_page_t* page, mi_block_t* block); +#else +void _mi_segment_huge_page_reset(mi_segment_t* segment, mi_page_t* page, mi_block_t* block); +#endif + +uint8_t* _mi_segment_page_start(const mi_segment_t* segment, const mi_page_t* page, size_t* page_size); // page start for any page void _mi_abandoned_reclaim_all(mi_heap_t* heap, mi_segments_tld_t* tld); void _mi_abandoned_await_readers(void); - - +void _mi_abandoned_collect(mi_heap_t* heap, bool force, mi_segments_tld_t* tld); // "page.c" -void* _mi_malloc_generic(mi_heap_t* heap, size_t size) mi_attr_noexcept mi_attr_malloc; +void* _mi_malloc_generic(mi_heap_t* heap, size_t size, bool zero, size_t huge_alignment) mi_attr_noexcept mi_attr_malloc; -void _mi_page_retire(mi_page_t* page); // free the page if there are no other pages with many free blocks +void _mi_page_retire(mi_page_t* page) mi_attr_noexcept; // free the page if there are no other pages with many free blocks void _mi_page_unfull(mi_page_t* page); void _mi_page_free(mi_page_t* page, mi_page_queue_t* pq, bool force); // free the page void _mi_page_abandon(mi_page_t* page, mi_page_queue_t* pq); // abandon the page, to be picked up by another thread... -void _mi_heap_delayed_free(mi_heap_t* heap); +void _mi_heap_delayed_free_all(mi_heap_t* heap); +bool _mi_heap_delayed_free_partial(mi_heap_t* heap); void _mi_heap_collect_retired(mi_heap_t* heap, bool force); void _mi_page_use_delayed_free(mi_page_t* page, mi_delayed_t delay, bool override_never); +bool _mi_page_try_use_delayed_free(mi_page_t* page, mi_delayed_t delay, bool override_never); size_t _mi_page_queue_append(mi_heap_t* heap, mi_page_queue_t* pq, mi_page_queue_t* append); void _mi_deferred_free(mi_heap_t* heap, bool force); @@ -107,27 +168,38 @@ void _mi_page_reclaim(mi_heap_t* heap, mi_page_t* page); // callback fro size_t _mi_bin_size(uint8_t bin); // for stats uint8_t _mi_bin(size_t size); // for stats -uint8_t _mi_bsr(uintptr_t x); // bit-scan-right, used on BSD in "os.c" // "heap.c" void _mi_heap_destroy_pages(mi_heap_t* heap); void _mi_heap_collect_abandon(mi_heap_t* heap); void _mi_heap_set_default_direct(mi_heap_t* heap); +bool _mi_heap_memid_is_suitable(mi_heap_t* heap, mi_memid_t memid); +void _mi_heap_unsafe_destroy_all(void); // "stats.c" void _mi_stats_done(mi_stats_t* stats); - mi_msecs_t _mi_clock_now(void); mi_msecs_t _mi_clock_end(mi_msecs_t start); mi_msecs_t _mi_clock_start(void); // "alloc.c" -void* _mi_page_malloc(mi_heap_t* heap, mi_page_t* page, size_t size) mi_attr_noexcept; // called from `_mi_malloc_generic` -void* _mi_heap_malloc_zero(mi_heap_t* heap, size_t size, bool zero); -void* _mi_heap_realloc_zero(mi_heap_t* heap, void* p, size_t newsize, bool zero); +void* _mi_page_malloc(mi_heap_t* heap, mi_page_t* page, size_t size, bool zero) mi_attr_noexcept; // called from `_mi_malloc_generic` +void* _mi_heap_malloc_zero(mi_heap_t* heap, size_t size, bool zero) mi_attr_noexcept; +void* _mi_heap_malloc_zero_ex(mi_heap_t* heap, size_t size, bool zero, size_t huge_alignment) mi_attr_noexcept; // called from `_mi_heap_malloc_aligned` +void* _mi_heap_realloc_zero(mi_heap_t* heap, void* p, size_t newsize, bool zero) mi_attr_noexcept; mi_block_t* _mi_page_ptr_unalign(const mi_segment_t* segment, const mi_page_t* page, const void* p); bool _mi_free_delayed_block(mi_block_t* block); -void _mi_block_zero_init(const mi_page_t* page, void* p, size_t size); +void _mi_free_generic(const mi_segment_t* segment, mi_page_t* page, bool is_local, void* p) mi_attr_noexcept; // for runtime integration +void _mi_padding_shrink(const mi_page_t* page, const mi_block_t* block, const size_t min_size); + +// option.c, c primitives +char _mi_toupper(char c); +int _mi_strnicmp(const char* s, const char* t, size_t n); +void _mi_strlcpy(char* dest, const char* src, size_t dest_size); +void _mi_strlcat(char* dest, const char* src, size_t dest_size); +size_t _mi_strlen(const char* s); +size_t _mi_strnlen(const char* s, size_t max_len); + #if MI_DEBUG>1 bool _mi_page_is_valid(mi_page_t* page); @@ -139,8 +211,11 @@ bool _mi_page_is_valid(mi_page_t* page); // ------------------------------------------------------ #if defined(__GNUC__) || defined(__clang__) -#define mi_unlikely(x) __builtin_expect((x),0) -#define mi_likely(x) __builtin_expect((x),1) +#define mi_unlikely(x) (__builtin_expect(!!(x),false)) +#define mi_likely(x) (__builtin_expect(!!(x),true)) +#elif (defined(__cplusplus) && (__cplusplus >= 202002L)) || (defined(_MSVC_LANG) && _MSVC_LANG >= 202002L) +#define mi_unlikely(x) (x) [[unlikely]] +#define mi_likely(x) (x) [[likely]] #else #define mi_unlikely(x) (x) #define mi_likely(x) (x) @@ -178,11 +253,11 @@ bool _mi_page_is_valid(mi_page_t* page); /* ----------------------------------------------------------- Inlined definitions ----------------------------------------------------------- */ -#define UNUSED(x) (void)(x) +#define MI_UNUSED(x) (void)(x) #if (MI_DEBUG>0) -#define UNUSED_RELEASE(x) +#define MI_UNUSED_RELEASE(x) #else -#define UNUSED_RELEASE(x) UNUSED(x) +#define MI_UNUSED_RELEASE(x) MI_UNUSED(x) #endif #define MI_INIT4(x) x(),x(),x(),x() @@ -194,11 +269,21 @@ bool _mi_page_is_valid(mi_page_t* page); #define MI_INIT256(x) MI_INIT128(x),MI_INIT128(x) +#include +// initialize a local variable to zero; use memset as compilers optimize constant sized memset's +#define _mi_memzero_var(x) memset(&x,0,sizeof(x)) + // Is `x` a power of two? (0 is considered a power of two) static inline bool _mi_is_power_of_two(uintptr_t x) { return ((x & (x - 1)) == 0); } +// Is a pointer aligned? +static inline bool _mi_is_aligned(void* p, size_t alignment) { + mi_assert_internal(alignment != 0); + return (((uintptr_t)p % alignment) == 0); +} + // Align upwards static inline uintptr_t _mi_align_up(uintptr_t sz, size_t alignment) { mi_assert_internal(alignment != 0); @@ -211,6 +296,18 @@ static inline uintptr_t _mi_align_up(uintptr_t sz, size_t alignment) { } } +// Align downwards +static inline uintptr_t _mi_align_down(uintptr_t sz, size_t alignment) { + mi_assert_internal(alignment != 0); + uintptr_t mask = alignment - 1; + if ((alignment & mask) == 0) { // power of two? + return (sz & ~mask); + } + else { + return ((sz / alignment) * alignment); + } +} + // Divide upwards: `s <= _mi_divide_up(s,d)*d < s+d`. static inline uintptr_t _mi_divide_up(uintptr_t size, size_t divider) { mi_assert_internal(divider != 0); @@ -218,13 +315,14 @@ static inline uintptr_t _mi_divide_up(uintptr_t size, size_t divider) { } // Is memory zero initialized? -static inline bool mi_mem_is_zero(void* p, size_t size) { +static inline bool mi_mem_is_zero(const void* p, size_t size) { for (size_t i = 0; i < size; i++) { if (((uint8_t*)p)[i] != 0) return false; } return true; } + // Align a byte size to a size in _machine words_, // i.e. byte size == `wsize*sizeof(void*)`. static inline size_t _mi_wsize_from_size(size_t size) { @@ -232,32 +330,27 @@ static inline size_t _mi_wsize_from_size(size_t size) { return (size + sizeof(uintptr_t) - 1) / sizeof(uintptr_t); } -// Does malloc satisfy the alignment constraints already? -static inline bool mi_malloc_satisfies_alignment(size_t alignment, size_t size) { - return (alignment == sizeof(void*) || (alignment == MI_MAX_ALIGN_SIZE && size > (MI_MAX_ALIGN_SIZE/2))); -} - // Overflow detecting multiply -#if __has_builtin(__builtin_umul_overflow) || __GNUC__ >= 5 +#if __has_builtin(__builtin_umul_overflow) || (defined(__GNUC__) && (__GNUC__ >= 5)) #include // UINT_MAX, ULONG_MAX #if defined(_CLOCK_T) // for Illumos #undef _CLOCK_T #endif static inline bool mi_mul_overflow(size_t count, size_t size, size_t* total) { - #if (SIZE_MAX == UINT_MAX) - return __builtin_umul_overflow(count, size, total); - #elif (SIZE_MAX == ULONG_MAX) - return __builtin_umull_overflow(count, size, total); + #if (SIZE_MAX == ULONG_MAX) + return __builtin_umull_overflow(count, size, (unsigned long *)total); + #elif (SIZE_MAX == UINT_MAX) + return __builtin_umul_overflow(count, size, (unsigned int *)total); #else - return __builtin_umulll_overflow(count, size, total); + return __builtin_umulll_overflow(count, size, (unsigned long long *)total); #endif } #else /* __builtin_umul_overflow is unavailable */ static inline bool mi_mul_overflow(size_t count, size_t size, size_t* total) { #define MI_MUL_NO_OVERFLOW ((size_t)1 << (4*sizeof(size_t))) // sqrt(SIZE_MAX) *total = count * size; - return ((size >= MI_MUL_NO_OVERFLOW || count >= MI_MUL_NO_OVERFLOW) - && size > 0 && (SIZE_MAX / size) < count); + // note: gcc/clang optimize this to directly check the overflow flag + return ((size >= MI_MUL_NO_OVERFLOW || count >= MI_MUL_NO_OVERFLOW) && size > 0 && (SIZE_MAX / size) < count); } #endif @@ -267,8 +360,10 @@ static inline bool mi_count_size_overflow(size_t count, size_t size, size_t* tot *total = size; return false; } - else if (mi_unlikely(mi_mul_overflow(count, size, total))) { + else if mi_unlikely(mi_mul_overflow(count, size, total)) { + #if MI_DEBUG > 0 _mi_error_message(EOVERFLOW, "allocation request is too large (%zu * %zu bytes)\n", count, size); + #endif *total = SIZE_MAX; return true; } @@ -276,87 +371,11 @@ static inline bool mi_count_size_overflow(size_t count, size_t size, size_t* tot } -/* ---------------------------------------------------------------------------------------- -The thread local default heap: `_mi_get_default_heap` returns the thread local heap. -On most platforms (Windows, Linux, FreeBSD, NetBSD, etc), this just returns a -__thread local variable (`_mi_heap_default`). With the initial-exec TLS model this ensures -that the storage will always be available (allocated on the thread stacks). -On some platforms though we cannot use that when overriding `malloc` since the underlying -TLS implementation (or the loader) will call itself `malloc` on a first access and recurse. -We try to circumvent this in an efficient way: -- macOSX : we use an unused TLS slot from the OS allocated slots (MI_TLS_SLOT). On OSX, the - loader itself calls `malloc` even before the modules are initialized. -- OpenBSD: we use an unused slot from the pthread block (MI_TLS_PTHREAD_SLOT_OFS). -- DragonFly: not yet working. +/*---------------------------------------------------------------------------------------- + Heap functions ------------------------------------------------------------------------------------------- */ extern const mi_heap_t _mi_heap_empty; // read-only empty heap, initial value of the thread local default heap -extern bool _mi_process_is_initialized; -#if defined (MI_TLS_RECURSE_GUARD_HOST) -#define MI_MAIN_VIS __declspec(dllexport) -#else -#define MI_MAIN_VIS -#endif -MI_MAIN_VIS mi_heap_t *_mi_heap_main_get(void); // statically allocated main backing heap - - -#if defined(MI_MALLOC_OVERRIDE) -#if defined(__MACH__) // OSX -#define MI_TLS_SLOT 89 // seems unused? -// other possible unused ones are 9, 29, __PTK_FRAMEWORK_JAVASCRIPTCORE_KEY4 (94), __PTK_FRAMEWORK_GC_KEY9 (112) and __PTK_FRAMEWORK_OLDGC_KEY9 (89) -// see -#elif defined(__OpenBSD__) -// use end bytes of a name; goes wrong if anyone uses names > 23 characters (ptrhread specifies 16) -// see -#define MI_TLS_PTHREAD_SLOT_OFS (6*sizeof(int) + 4*sizeof(void*) + 24) -#elif defined(__DragonFly__) -#warning "mimalloc is not working correctly on DragonFly yet." -#define MI_TLS_PTHREAD_SLOT_OFS (4 + 1*sizeof(void*)) // offset `uniqueid` (also used by gdb?) -#endif -#endif - -#if defined(MI_TLS_SLOT) -static inline void* mi_tls_slot(size_t slot) mi_attr_noexcept; // forward declaration -#elif defined(MI_TLS_PTHREAD_SLOT_OFS) -#include -static inline mi_heap_t** mi_tls_pthread_heap_slot(void) { - pthread_t self = pthread_self(); - #if defined(__DragonFly__) - if (self==NULL) { - static mi_heap_t* pheap_main = _mi_heap_main_get(); - return &pheap_main; - } - #endif - return (mi_heap_t**)((uint8_t*)self + MI_TLS_PTHREAD_SLOT_OFS); -} -#elif defined(MI_TLS_PTHREAD) -#include -extern pthread_key_t _mi_heap_default_key; -#else -extern mi_decl_thread mi_heap_t* _mi_heap_default; // default heap to allocate from -#endif - -static inline mi_heap_t* mi_get_default_heap(void) { -#if defined(MI_TLS_SLOT) - mi_heap_t* heap = (mi_heap_t*)mi_tls_slot(MI_TLS_SLOT); - return (mi_unlikely(heap == NULL) ? (mi_heap_t*)&_mi_heap_empty : heap); -#elif defined(MI_TLS_PTHREAD_SLOT_OFS) - mi_heap_t* heap = *mi_tls_pthread_heap_slot(); - return (mi_unlikely(heap == NULL) ? (mi_heap_t*)&_mi_heap_empty : heap); -#elif defined(MI_TLS_PTHREAD) - mi_heap_t* heap = (mi_unlikely(_mi_heap_default_key == (pthread_key_t)(-1)) ? _mi_heap_main_get() : (mi_heap_t*)pthread_getspecific(_mi_heap_default_key)); - return (mi_unlikely(heap == NULL) ? (mi_heap_t*)&_mi_heap_empty : heap); -#else - #if defined(MI_TLS_RECURSE_GUARD) - if (mi_unlikely(!_mi_process_is_initialized)) return _mi_heap_main_get(); - #endif - return _mi_heap_default; -#endif -} - -static inline bool mi_heap_is_default(const mi_heap_t* heap) { - return (heap == mi_get_default_heap()); -} static inline bool mi_heap_is_backing(const mi_heap_t* heap) { return (heap->tld->heap_backing == heap); @@ -384,46 +403,57 @@ static inline mi_page_t* _mi_heap_get_free_small_page(mi_heap_t* heap, size_t si return heap->pages_free_direct[idx]; } -// Get the page belonging to a certain size class -static inline mi_page_t* _mi_get_free_small_page(size_t size) { - return _mi_heap_get_free_small_page(mi_get_default_heap(), size); +// Segment that contains the pointer +// Large aligned blocks may be aligned at N*MI_SEGMENT_SIZE (inside a huge segment > MI_SEGMENT_SIZE), +// and we need align "down" to the segment info which is `MI_SEGMENT_SIZE` bytes before it; +// therefore we align one byte before `p`. +static inline mi_segment_t* _mi_ptr_segment(const void* p) { + mi_assert_internal(p != NULL); + return (mi_segment_t*)(((uintptr_t)p - 1) & ~MI_SEGMENT_MASK); } -// Segment that contains the pointer -static inline mi_segment_t* _mi_ptr_segment(const void* p) { - // mi_assert_internal(p != NULL); - return (mi_segment_t*)((uintptr_t)p & ~MI_SEGMENT_MASK); +static inline mi_page_t* mi_slice_to_page(mi_slice_t* s) { + mi_assert_internal(s->slice_offset== 0 && s->slice_count > 0); + return (mi_page_t*)(s); +} + +static inline mi_slice_t* mi_page_to_slice(mi_page_t* p) { + mi_assert_internal(p->slice_offset== 0 && p->slice_count > 0); + return (mi_slice_t*)(p); } // Segment belonging to a page static inline mi_segment_t* _mi_page_segment(const mi_page_t* page) { - mi_segment_t* segment = _mi_ptr_segment(page); - mi_assert_internal(segment == NULL || page == &segment->pages[page->segment_idx]); + mi_segment_t* segment = _mi_ptr_segment(page); + mi_assert_internal(segment == NULL || ((mi_slice_t*)page >= segment->slices && (mi_slice_t*)page < segment->slices + segment->slice_entries)); return segment; } -// used internally -static inline uintptr_t _mi_segment_page_idx_of(const mi_segment_t* segment, const void* p) { - // if (segment->page_size > MI_SEGMENT_SIZE) return &segment->pages[0]; // huge pages - ptrdiff_t diff = (uint8_t*)p - (uint8_t*)segment; - mi_assert_internal(diff >= 0 && (size_t)diff < MI_SEGMENT_SIZE); - uintptr_t idx = (uintptr_t)diff >> segment->page_shift; - mi_assert_internal(idx < segment->capacity); - mi_assert_internal(segment->page_kind <= MI_PAGE_MEDIUM || idx == 0); - return idx; +static inline mi_slice_t* mi_slice_first(const mi_slice_t* slice) { + mi_slice_t* start = (mi_slice_t*)((uint8_t*)slice - slice->slice_offset); + mi_assert_internal(start >= _mi_ptr_segment(slice)->slices); + mi_assert_internal(start->slice_offset == 0); + mi_assert_internal(start + start->slice_count > slice); + return start; } -// Get the page containing the pointer +// Get the page containing the pointer (performance critical as it is called in mi_free) static inline mi_page_t* _mi_segment_page_of(const mi_segment_t* segment, const void* p) { - uintptr_t idx = _mi_segment_page_idx_of(segment, p); - return &((mi_segment_t*)segment)->pages[idx]; + mi_assert_internal(p > (void*)segment); + ptrdiff_t diff = (uint8_t*)p - (uint8_t*)segment; + mi_assert_internal(diff > 0 && diff <= (ptrdiff_t)MI_SEGMENT_SIZE); + size_t idx = (size_t)diff >> MI_SEGMENT_SLICE_SHIFT; + mi_assert_internal(idx <= segment->slice_entries); + mi_slice_t* slice0 = (mi_slice_t*)&segment->slices[idx]; + mi_slice_t* slice = mi_slice_first(slice0); // adjust to the block that holds the page data + mi_assert_internal(slice->slice_offset == 0); + mi_assert_internal(slice >= segment->slices && slice < segment->slices + segment->slice_entries); + return mi_slice_to_page(slice); } // Quick page start for initialized pages static inline uint8_t* _mi_page_start(const mi_segment_t* segment, const mi_page_t* page, size_t* page_size) { - const size_t bsize = page->xblock_size; - mi_assert_internal(bsize > 0 && (bsize%sizeof(void*)) == 0); - return _mi_segment_page_start(segment, page, bsize, page_size, NULL); + return _mi_segment_page_start(segment, page, page_size); } // Get the page containing the pointer @@ -431,26 +461,38 @@ static inline mi_page_t* _mi_ptr_page(void* p) { return _mi_segment_page_of(_mi_ptr_segment(p), p); } -// Get the block size of a page (special cased for huge objects) +// Get the block size of a page (special case for huge objects) static inline size_t mi_page_block_size(const mi_page_t* page) { const size_t bsize = page->xblock_size; mi_assert_internal(bsize > 0); - if (mi_likely(bsize < MI_HUGE_BLOCK_SIZE)) { + if mi_likely(bsize < MI_HUGE_BLOCK_SIZE) { return bsize; } else { size_t psize; - _mi_segment_page_start(_mi_page_segment(page), page, bsize, &psize, NULL); + _mi_segment_page_start(_mi_page_segment(page), page, &psize); return psize; } } +static inline bool mi_page_is_huge(const mi_page_t* page) { + return (_mi_page_segment(page)->kind == MI_SEGMENT_HUGE); +} + // Get the usable block size of a page without fixed padding. // This may still include internal padding due to alignment and rounding up size classes. static inline size_t mi_page_usable_block_size(const mi_page_t* page) { return mi_page_block_size(page) - MI_PADDING_SIZE; } +// size of a segment +static inline size_t mi_segment_size(mi_segment_t* segment) { + return segment->segment_slices * MI_SEGMENT_SLICE_SIZE; +} + +static inline uint8_t* mi_segment_end(mi_segment_t* segment) { + return (uint8_t*)segment + mi_segment_size(segment); +} // Thread free access static inline mi_block_t* mi_page_thread_free(const mi_page_t* page) { @@ -570,12 +612,13 @@ static inline bool mi_is_in_same_segment(const void* p, const void* q) { } static inline bool mi_is_in_same_page(const void* p, const void* q) { - mi_segment_t* segmentp = _mi_ptr_segment(p); - mi_segment_t* segmentq = _mi_ptr_segment(q); - if (segmentp != segmentq) return false; - uintptr_t idxp = _mi_segment_page_idx_of(segmentp, p); - uintptr_t idxq = _mi_segment_page_idx_of(segmentq, q); - return (idxp == idxq); + mi_segment_t* segment = _mi_ptr_segment(p); + if (_mi_ptr_segment(q) != segment) return false; + // assume q may be invalid // return (_mi_segment_page_of(segment, p) == _mi_segment_page_of(segment, q)); + mi_page_t* page = _mi_segment_page_of(segment, p); + size_t psize; + uint8_t* start = _mi_segment_page_start(segment, page, &psize); + return (start <= (uint8_t*)q && (uint8_t*)q < start + psize); } static inline uintptr_t mi_rotl(uintptr_t x, uintptr_t shift) { @@ -589,30 +632,36 @@ static inline uintptr_t mi_rotr(uintptr_t x, uintptr_t shift) { static inline void* mi_ptr_decode(const void* null, const mi_encoded_t x, const uintptr_t* keys) { void* p = (void*)(mi_rotr(x - keys[0], keys[0]) ^ keys[1]); - return (mi_unlikely(p==null) ? NULL : p); + return (p==null ? NULL : p); } static inline mi_encoded_t mi_ptr_encode(const void* null, const void* p, const uintptr_t* keys) { - uintptr_t x = (uintptr_t)(mi_unlikely(p==NULL) ? null : p); + uintptr_t x = (uintptr_t)(p==NULL ? null : p); return mi_rotl(x ^ keys[1], keys[0]) + keys[0]; } static inline mi_block_t* mi_block_nextx( const void* null, const mi_block_t* block, const uintptr_t* keys ) { + mi_track_mem_defined(block,sizeof(mi_block_t)); + mi_block_t* next; #ifdef MI_ENCODE_FREELIST - return (mi_block_t*)mi_ptr_decode(null, block->next, keys); + next = (mi_block_t*)mi_ptr_decode(null, block->next, keys); #else - UNUSED(keys); UNUSED(null); - return (mi_block_t*)block->next; + MI_UNUSED(keys); MI_UNUSED(null); + next = (mi_block_t*)block->next; #endif + mi_track_mem_noaccess(block,sizeof(mi_block_t)); + return next; } static inline void mi_block_set_nextx(const void* null, mi_block_t* block, const mi_block_t* next, const uintptr_t* keys) { + mi_track_mem_undefined(block,sizeof(mi_block_t)); #ifdef MI_ENCODE_FREELIST block->next = mi_ptr_encode(null, next, keys); #else - UNUSED(keys); UNUSED(null); + MI_UNUSED(keys); MI_UNUSED(null); block->next = (mi_encoded_t)next; #endif + mi_track_mem_noaccess(block,sizeof(mi_block_t)); } static inline mi_block_t* mi_block_next(const mi_page_t* page, const mi_block_t* block) { @@ -620,13 +669,13 @@ static inline mi_block_t* mi_block_next(const mi_page_t* page, const mi_block_t* mi_block_t* next = mi_block_nextx(page,block,page->keys); // check for free list corruption: is `next` at least in the same page? // TODO: check if `next` is `page->block_size` aligned? - if (mi_unlikely(next!=NULL && !mi_is_in_same_page(block, next))) { + if mi_unlikely(next!=NULL && !mi_is_in_same_page(block, next)) { _mi_error_message(EFAULT, "corrupted free list entry of size %zub at %p: value 0x%zx\n", mi_page_block_size(page), block, (uintptr_t)next); next = NULL; } return next; #else - UNUSED(page); + MI_UNUSED(page); return mi_block_nextx(page,block,NULL); #endif } @@ -635,11 +684,80 @@ static inline void mi_block_set_next(const mi_page_t* page, mi_block_t* block, c #ifdef MI_ENCODE_FREELIST mi_block_set_nextx(page,block,next, page->keys); #else - UNUSED(page); + MI_UNUSED(page); mi_block_set_nextx(page,block,next,NULL); #endif } + +// ------------------------------------------------------------------- +// commit mask +// ------------------------------------------------------------------- + +static inline void mi_commit_mask_create_empty(mi_commit_mask_t* cm) { + for (size_t i = 0; i < MI_COMMIT_MASK_FIELD_COUNT; i++) { + cm->mask[i] = 0; + } +} + +static inline void mi_commit_mask_create_full(mi_commit_mask_t* cm) { + for (size_t i = 0; i < MI_COMMIT_MASK_FIELD_COUNT; i++) { + cm->mask[i] = ~((size_t)0); + } +} + +static inline bool mi_commit_mask_is_empty(const mi_commit_mask_t* cm) { + for (size_t i = 0; i < MI_COMMIT_MASK_FIELD_COUNT; i++) { + if (cm->mask[i] != 0) return false; + } + return true; +} + +static inline bool mi_commit_mask_is_full(const mi_commit_mask_t* cm) { + for (size_t i = 0; i < MI_COMMIT_MASK_FIELD_COUNT; i++) { + if (cm->mask[i] != ~((size_t)0)) return false; + } + return true; +} + +// defined in `segment.c`: +size_t _mi_commit_mask_committed_size(const mi_commit_mask_t* cm, size_t total); +size_t _mi_commit_mask_next_run(const mi_commit_mask_t* cm, size_t* idx); + +#define mi_commit_mask_foreach(cm,idx,count) \ + idx = 0; \ + while ((count = _mi_commit_mask_next_run(cm,&idx)) > 0) { + +#define mi_commit_mask_foreach_end() \ + idx += count; \ + } + + + +/* ----------------------------------------------------------- + memory id's +----------------------------------------------------------- */ + +static inline mi_memid_t _mi_memid_create(mi_memkind_t memkind) { + mi_memid_t memid; + _mi_memzero_var(memid); + memid.memkind = memkind; + return memid; +} + +static inline mi_memid_t _mi_memid_none(void) { + return _mi_memid_create(MI_MEM_NONE); +} + +static inline mi_memid_t _mi_memid_create_os(bool committed, bool is_zero, bool is_large) { + mi_memid_t memid = _mi_memid_create(MI_MEM_OS); + memid.initially_committed = committed; + memid.initially_zero = is_zero; + memid.is_pinned = is_large; + return memid; +} + + // ------------------------------------------------------------------- // Fast "random" shuffle // ------------------------------------------------------------------- @@ -671,82 +789,189 @@ static inline uintptr_t _mi_random_shuffle(uintptr_t x) { int _mi_os_numa_node_get(mi_os_tld_t* tld); size_t _mi_os_numa_node_count_get(void); -extern size_t _mi_numa_node_count; +extern _Atomic(size_t) _mi_numa_node_count; static inline int _mi_os_numa_node(mi_os_tld_t* tld) { - if (mi_likely(_mi_numa_node_count == 1)) return 0; + if mi_likely(mi_atomic_load_relaxed(&_mi_numa_node_count) == 1) { return 0; } else return _mi_os_numa_node_get(tld); } static inline size_t _mi_os_numa_node_count(void) { - if (mi_likely(_mi_numa_node_count>0)) return _mi_numa_node_count; + const size_t count = mi_atomic_load_relaxed(&_mi_numa_node_count); + if mi_likely(count > 0) { return count; } else return _mi_os_numa_node_count_get(); } -// ------------------------------------------------------------------- -// Getting the thread id should be performant as it is called in the -// fast path of `_mi_free` and we specialize for various platforms. -// ------------------------------------------------------------------- -#if defined(_WIN32) -#define WIN32_LEAN_AND_MEAN -#include -static inline uintptr_t _mi_thread_id(void) mi_attr_noexcept { - // Windows: works on Intel and ARM in both 32- and 64-bit - return (uintptr_t)NtCurrentTeb(); -} -#elif defined(__GNUC__) && \ - (defined(__x86_64__) || defined(__i386__) || defined(__arm__) || defined(__aarch64__)) +// ----------------------------------------------------------------------- +// Count bits: trailing or leading zeros (with MI_INTPTR_BITS on all zero) +// ----------------------------------------------------------------------- -// TLS register on x86 is in the FS or GS register, see: https://akkadia.org/drepper/tls.pdf -static inline void* mi_tls_slot(size_t slot) mi_attr_noexcept { - void* res; - const size_t ofs = (slot*sizeof(void*)); -#if defined(__i386__) - __asm__("movl %%gs:%1, %0" : "=r" (res) : "m" (*((void**)ofs)) : ); // 32-bit always uses GS -#elif defined(__MACH__) && defined(__x86_64__) - __asm__("movq %%gs:%1, %0" : "=r" (res) : "m" (*((void**)ofs)) : ); // x86_64 macOSX uses GS -#elif defined(__x86_64__) - __asm__("movq %%fs:%1, %0" : "=r" (res) : "m" (*((void**)ofs)) : ); // x86_64 Linux, BSD uses FS -#elif defined(__arm__) - void** tcb; UNUSED(ofs); - __asm__ volatile ("mrc p15, 0, %0, c13, c0, 3\nbic %0, %0, #3" : "=r" (tcb)); - res = tcb[slot]; -#elif defined(__aarch64__) - void** tcb; UNUSED(ofs); - __asm__ volatile ("mrs %0, tpidr_el0" : "=r" (tcb)); - res = tcb[slot]; +#if defined(__GNUC__) + +#include // LONG_MAX +#define MI_HAVE_FAST_BITSCAN +static inline size_t mi_clz(uintptr_t x) { + if (x==0) return MI_INTPTR_BITS; +#if (INTPTR_MAX == LONG_MAX) + return __builtin_clzl(x); +#else + return __builtin_clzll(x); #endif - return res; } - -// setting is only used on macOSX for now -static inline void mi_tls_slot_set(size_t slot, void* value) mi_attr_noexcept { - const size_t ofs = (slot*sizeof(void*)); -#if defined(__i386__) - __asm__("movl %1,%%gs:%0" : "=m" (*((void**)ofs)) : "rn" (value) : ); // 32-bit always uses GS -#elif defined(__MACH__) && defined(__x86_64__) - __asm__("movq %1,%%gs:%0" : "=m" (*((void**)ofs)) : "rn" (value) : ); // x86_64 macOSX uses GS -#elif defined(__x86_64__) - __asm__("movq %1,%%fs:%1" : "=m" (*((void**)ofs)) : "rn" (value) : ); // x86_64 Linux, BSD uses FS -#elif defined(__arm__) - void** tcb; UNUSED(ofs); - __asm__ volatile ("mrc p15, 0, %0, c13, c0, 3\nbic %0, %0, #3" : "=r" (tcb)); - tcb[slot] = value; -#elif defined(__aarch64__) - void** tcb; UNUSED(ofs); - __asm__ volatile ("mrs %0, tpidr_el0" : "=r" (tcb)); - tcb[slot] = value; +static inline size_t mi_ctz(uintptr_t x) { + if (x==0) return MI_INTPTR_BITS; +#if (INTPTR_MAX == LONG_MAX) + return __builtin_ctzl(x); +#else + return __builtin_ctzll(x); #endif } -static inline uintptr_t _mi_thread_id(void) mi_attr_noexcept { - // in all our targets, slot 0 is the pointer to the thread control block - return (uintptr_t)mi_tls_slot(0); +#elif defined(_MSC_VER) + +#include // LONG_MAX +#include // BitScanReverse64 +#define MI_HAVE_FAST_BITSCAN +static inline size_t mi_clz(uintptr_t x) { + if (x==0) return MI_INTPTR_BITS; + unsigned long idx; +#if (INTPTR_MAX == LONG_MAX) + _BitScanReverse(&idx, x); +#else + _BitScanReverse64(&idx, x); +#endif + return ((MI_INTPTR_BITS - 1) - idx); +} +static inline size_t mi_ctz(uintptr_t x) { + if (x==0) return MI_INTPTR_BITS; + unsigned long idx; +#if (INTPTR_MAX == LONG_MAX) + _BitScanForward(&idx, x); +#else + _BitScanForward64(&idx, x); +#endif + return idx; +} + +#else +static inline size_t mi_ctz32(uint32_t x) { + // de Bruijn multiplication, see + static const unsigned char debruijn[32] = { + 0, 1, 28, 2, 29, 14, 24, 3, 30, 22, 20, 15, 25, 17, 4, 8, + 31, 27, 13, 23, 21, 19, 16, 7, 26, 12, 18, 6, 11, 5, 10, 9 + }; + if (x==0) return 32; + return debruijn[((x & -(int32_t)x) * 0x077CB531UL) >> 27]; +} +static inline size_t mi_clz32(uint32_t x) { + // de Bruijn multiplication, see + static const uint8_t debruijn[32] = { + 31, 22, 30, 21, 18, 10, 29, 2, 20, 17, 15, 13, 9, 6, 28, 1, + 23, 19, 11, 3, 16, 14, 7, 24, 12, 4, 8, 25, 5, 26, 27, 0 + }; + if (x==0) return 32; + x |= x >> 1; + x |= x >> 2; + x |= x >> 4; + x |= x >> 8; + x |= x >> 16; + return debruijn[(uint32_t)(x * 0x07C4ACDDUL) >> 27]; +} + +static inline size_t mi_clz(uintptr_t x) { + if (x==0) return MI_INTPTR_BITS; +#if (MI_INTPTR_BITS <= 32) + return mi_clz32((uint32_t)x); +#else + size_t count = mi_clz32((uint32_t)(x >> 32)); + if (count < 32) return count; + return (32 + mi_clz32((uint32_t)x)); +#endif +} +static inline size_t mi_ctz(uintptr_t x) { + if (x==0) return MI_INTPTR_BITS; +#if (MI_INTPTR_BITS <= 32) + return mi_ctz32((uint32_t)x); +#else + size_t count = mi_ctz32((uint32_t)x); + if (count < 32) return count; + return (32 + mi_ctz32((uint32_t)(x>>32))); +#endif +} + +#endif + +// "bit scan reverse": Return index of the highest bit (or MI_INTPTR_BITS if `x` is zero) +static inline size_t mi_bsr(uintptr_t x) { + return (x==0 ? MI_INTPTR_BITS : MI_INTPTR_BITS - 1 - mi_clz(x)); +} + + +// --------------------------------------------------------------------------------- +// Provide our own `_mi_memcpy` for potential performance optimizations. +// +// For now, only on Windows with msvc/clang-cl we optimize to `rep movsb` if +// we happen to run on x86/x64 cpu's that have "fast short rep movsb" (FSRM) support +// (AMD Zen3+ (~2020) or Intel Ice Lake+ (~2017). See also issue #201 and pr #253. +// --------------------------------------------------------------------------------- + +#if !MI_TRACK_ENABLED && defined(_WIN32) && (defined(_M_IX86) || defined(_M_X64)) +#include +extern bool _mi_cpu_has_fsrm; +static inline void _mi_memcpy(void* dst, const void* src, size_t n) { + if (_mi_cpu_has_fsrm) { + __movsb((unsigned char*)dst, (const unsigned char*)src, n); + } + else { + memcpy(dst, src, n); + } +} +static inline void _mi_memzero(void* dst, size_t n) { + if (_mi_cpu_has_fsrm) { + __stosb((unsigned char*)dst, 0, n); + } + else { + memset(dst, 0, n); + } } #else -// otherwise use standard C -static inline uintptr_t _mi_thread_id(void) mi_attr_noexcept { - return (uintptr_t)&_mi_heap_default; +static inline void _mi_memcpy(void* dst, const void* src, size_t n) { + memcpy(dst, src, n); +} +static inline void _mi_memzero(void* dst, size_t n) { + memset(dst, 0, n); +} +#endif + +// ------------------------------------------------------------------------------- +// The `_mi_memcpy_aligned` can be used if the pointers are machine-word aligned +// This is used for example in `mi_realloc`. +// ------------------------------------------------------------------------------- + +#if (defined(__GNUC__) && (__GNUC__ >= 4)) || defined(__clang__) +// On GCC/CLang we provide a hint that the pointers are word aligned. +static inline void _mi_memcpy_aligned(void* dst, const void* src, size_t n) { + mi_assert_internal(((uintptr_t)dst % MI_INTPTR_SIZE == 0) && ((uintptr_t)src % MI_INTPTR_SIZE == 0)); + void* adst = __builtin_assume_aligned(dst, MI_INTPTR_SIZE); + const void* asrc = __builtin_assume_aligned(src, MI_INTPTR_SIZE); + _mi_memcpy(adst, asrc, n); +} + +static inline void _mi_memzero_aligned(void* dst, size_t n) { + mi_assert_internal((uintptr_t)dst % MI_INTPTR_SIZE == 0); + void* adst = __builtin_assume_aligned(dst, MI_INTPTR_SIZE); + _mi_memzero(adst, n); +} +#else +// Default fallback on `_mi_memcpy` +static inline void _mi_memcpy_aligned(void* dst, const void* src, size_t n) { + mi_assert_internal(((uintptr_t)dst % MI_INTPTR_SIZE == 0) && ((uintptr_t)src % MI_INTPTR_SIZE == 0)); + _mi_memcpy(dst, src, n); +} + +static inline void _mi_memzero_aligned(void* dst, size_t n) { + mi_assert_internal((uintptr_t)dst % MI_INTPTR_SIZE == 0); + _mi_memzero(dst, n); } #endif diff --git a/include/mimalloc/prim.h b/include/mimalloc/prim.h new file mode 100644 index 0000000..9e56069 --- /dev/null +++ b/include/mimalloc/prim.h @@ -0,0 +1,323 @@ +/* ---------------------------------------------------------------------------- +Copyright (c) 2018-2023, Microsoft Research, Daan Leijen +This is free software; you can redistribute it and/or modify it under the +terms of the MIT license. A copy of the license can be found in the file +"LICENSE" at the root of this distribution. +-----------------------------------------------------------------------------*/ +#pragma once +#ifndef MIMALLOC_PRIM_H +#define MIMALLOC_PRIM_H + + +// -------------------------------------------------------------------------- +// This file specifies the primitive portability API. +// Each OS/host needs to implement these primitives, see `src/prim` +// for implementations on Window, macOS, WASI, and Linux/Unix. +// +// note: on all primitive functions, we always have result parameters != NUL, and: +// addr != NULL and page aligned +// size > 0 and page aligned +// return value is an error code an int where 0 is success. +// -------------------------------------------------------------------------- + +// OS memory configuration +typedef struct mi_os_mem_config_s { + size_t page_size; // 4KiB + size_t large_page_size; // 2MiB + size_t alloc_granularity; // smallest allocation size (on Windows 64KiB) + bool has_overcommit; // can we reserve more memory than can be actually committed? + bool must_free_whole; // must allocated blocks be freed as a whole (false for mmap, true for VirtualAlloc) + bool has_virtual_reserve; // supports virtual address space reservation? (if true we can reserve virtual address space without using commit or physical memory) +} mi_os_mem_config_t; + +// Initialize +void _mi_prim_mem_init( mi_os_mem_config_t* config ); + +// Free OS memory +int _mi_prim_free(void* addr, size_t size ); + +// Allocate OS memory. Return NULL on error. +// The `try_alignment` is just a hint and the returned pointer does not have to be aligned. +// If `commit` is false, the virtual memory range only needs to be reserved (with no access) +// which will later be committed explicitly using `_mi_prim_commit`. +// `is_zero` is set to true if the memory was zero initialized (as on most OS's) +// pre: !commit => !allow_large +// try_alignment >= _mi_os_page_size() and a power of 2 +int _mi_prim_alloc(size_t size, size_t try_alignment, bool commit, bool allow_large, bool* is_large, bool* is_zero, void** addr); + +// Commit memory. Returns error code or 0 on success. +// For example, on Linux this would make the memory PROT_READ|PROT_WRITE. +// `is_zero` is set to true if the memory was zero initialized (e.g. on Windows) +int _mi_prim_commit(void* addr, size_t size, bool* is_zero); + +// Decommit memory. Returns error code or 0 on success. The `needs_recommit` result is true +// if the memory would need to be re-committed. For example, on Windows this is always true, +// but on Linux we could use MADV_DONTNEED to decommit which does not need a recommit. +// pre: needs_recommit != NULL +int _mi_prim_decommit(void* addr, size_t size, bool* needs_recommit); + +// Reset memory. The range keeps being accessible but the content might be reset. +// Returns error code or 0 on success. +int _mi_prim_reset(void* addr, size_t size); + +// Protect memory. Returns error code or 0 on success. +int _mi_prim_protect(void* addr, size_t size, bool protect); + +// Allocate huge (1GiB) pages possibly associated with a NUMA node. +// `is_zero` is set to true if the memory was zero initialized (as on most OS's) +// pre: size > 0 and a multiple of 1GiB. +// numa_node is either negative (don't care), or a numa node number. +int _mi_prim_alloc_huge_os_pages(void* hint_addr, size_t size, int numa_node, bool* is_zero, void** addr); + +// Return the current NUMA node +size_t _mi_prim_numa_node(void); + +// Return the number of logical NUMA nodes +size_t _mi_prim_numa_node_count(void); + +// Clock ticks +mi_msecs_t _mi_prim_clock_now(void); + +// Return process information (only for statistics) +typedef struct mi_process_info_s { + mi_msecs_t elapsed; + mi_msecs_t utime; + mi_msecs_t stime; + size_t current_rss; + size_t peak_rss; + size_t current_commit; + size_t peak_commit; + size_t page_faults; +} mi_process_info_t; + +void _mi_prim_process_info(mi_process_info_t* pinfo); + +// Default stderr output. (only for warnings etc. with verbose enabled) +// msg != NULL && _mi_strlen(msg) > 0 +void _mi_prim_out_stderr( const char* msg ); + +// Get an environment variable. (only for options) +// name != NULL, result != NULL, result_size >= 64 +bool _mi_prim_getenv(const char* name, char* result, size_t result_size); + + +// Fill a buffer with strong randomness; return `false` on error or if +// there is no strong randomization available. +bool _mi_prim_random_buf(void* buf, size_t buf_len); + +// Called on the first thread start, and should ensure `_mi_thread_done` is called on thread termination. +void _mi_prim_thread_init_auto_done(void); + +// Called on process exit and may take action to clean up resources associated with the thread auto done. +void _mi_prim_thread_done_auto_done(void); + +// Called when the default heap for a thread changes +void _mi_prim_thread_associate_default_heap(mi_heap_t* heap); + + +//------------------------------------------------------------------- +// Thread id: `_mi_prim_thread_id()` +// +// Getting the thread id should be performant as it is called in the +// fast path of `_mi_free` and we specialize for various platforms as +// inlined definitions. Regular code should call `init.c:_mi_thread_id()`. +// We only require _mi_prim_thread_id() to return a unique id +// for each thread (unequal to zero). +//------------------------------------------------------------------- + +// defined in `init.c`; do not use these directly +extern mi_decl_thread mi_heap_t* _mi_heap_default; // default heap to allocate from +extern bool _mi_process_is_initialized; // has mi_process_init been called? + +static inline mi_threadid_t _mi_prim_thread_id(void) mi_attr_noexcept; + +#if defined(_WIN32) + +#define WIN32_LEAN_AND_MEAN +#include +static inline mi_threadid_t _mi_prim_thread_id(void) mi_attr_noexcept { + // Windows: works on Intel and ARM in both 32- and 64-bit + return (uintptr_t)NtCurrentTeb(); +} + +// We use assembly for a fast thread id on the main platforms. The TLS layout depends on +// both the OS and libc implementation so we use specific tests for each main platform. +// If you test on another platform and it works please send a PR :-) +// see also https://akkadia.org/drepper/tls.pdf for more info on the TLS register. +#elif defined(__GNUC__) && ( \ + (defined(__GLIBC__) && (defined(__x86_64__) || defined(__i386__) || defined(__arm__) || defined(__aarch64__))) \ + || (defined(__APPLE__) && (defined(__x86_64__) || defined(__aarch64__))) \ + || (defined(__BIONIC__) && (defined(__x86_64__) || defined(__i386__) || defined(__arm__) || defined(__aarch64__))) \ + || (defined(__FreeBSD__) && (defined(__x86_64__) || defined(__i386__) || defined(__aarch64__))) \ + || (defined(__OpenBSD__) && (defined(__x86_64__) || defined(__i386__) || defined(__aarch64__))) \ + ) + +static inline void* mi_prim_tls_slot(size_t slot) mi_attr_noexcept { + void* res; + const size_t ofs = (slot*sizeof(void*)); + #if defined(__i386__) + __asm__("movl %%gs:%1, %0" : "=r" (res) : "m" (*((void**)ofs)) : ); // x86 32-bit always uses GS + #elif defined(__APPLE__) && defined(__x86_64__) + __asm__("movq %%gs:%1, %0" : "=r" (res) : "m" (*((void**)ofs)) : ); // x86_64 macOSX uses GS + #elif defined(__x86_64__) && (MI_INTPTR_SIZE==4) + __asm__("movl %%fs:%1, %0" : "=r" (res) : "m" (*((void**)ofs)) : ); // x32 ABI + #elif defined(__x86_64__) + __asm__("movq %%fs:%1, %0" : "=r" (res) : "m" (*((void**)ofs)) : ); // x86_64 Linux, BSD uses FS + #elif defined(__arm__) + void** tcb; MI_UNUSED(ofs); + __asm__ volatile ("mrc p15, 0, %0, c13, c0, 3\nbic %0, %0, #3" : "=r" (tcb)); + res = tcb[slot]; + #elif defined(__aarch64__) + void** tcb; MI_UNUSED(ofs); + #if defined(__APPLE__) // M1, issue #343 + __asm__ volatile ("mrs %0, tpidrro_el0\nbic %0, %0, #7" : "=r" (tcb)); + #else + __asm__ volatile ("mrs %0, tpidr_el0" : "=r" (tcb)); + #endif + res = tcb[slot]; + #endif + return res; +} + +// setting a tls slot is only used on macOS for now +static inline void mi_prim_tls_slot_set(size_t slot, void* value) mi_attr_noexcept { + const size_t ofs = (slot*sizeof(void*)); + #if defined(__i386__) + __asm__("movl %1,%%gs:%0" : "=m" (*((void**)ofs)) : "rn" (value) : ); // 32-bit always uses GS + #elif defined(__APPLE__) && defined(__x86_64__) + __asm__("movq %1,%%gs:%0" : "=m" (*((void**)ofs)) : "rn" (value) : ); // x86_64 macOS uses GS + #elif defined(__x86_64__) && (MI_INTPTR_SIZE==4) + __asm__("movl %1,%%fs:%0" : "=m" (*((void**)ofs)) : "rn" (value) : ); // x32 ABI + #elif defined(__x86_64__) + __asm__("movq %1,%%fs:%0" : "=m" (*((void**)ofs)) : "rn" (value) : ); // x86_64 Linux, BSD uses FS + #elif defined(__arm__) + void** tcb; MI_UNUSED(ofs); + __asm__ volatile ("mrc p15, 0, %0, c13, c0, 3\nbic %0, %0, #3" : "=r" (tcb)); + tcb[slot] = value; + #elif defined(__aarch64__) + void** tcb; MI_UNUSED(ofs); + #if defined(__APPLE__) // M1, issue #343 + __asm__ volatile ("mrs %0, tpidrro_el0\nbic %0, %0, #7" : "=r" (tcb)); + #else + __asm__ volatile ("mrs %0, tpidr_el0" : "=r" (tcb)); + #endif + tcb[slot] = value; + #endif +} + +static inline mi_threadid_t _mi_prim_thread_id(void) mi_attr_noexcept { + #if defined(__BIONIC__) + // issue #384, #495: on the Bionic libc (Android), slot 1 is the thread id + // see: https://github.com/aosp-mirror/platform_bionic/blob/c44b1d0676ded732df4b3b21c5f798eacae93228/libc/platform/bionic/tls_defines.h#L86 + return (uintptr_t)mi_prim_tls_slot(1); + #else + // in all our other targets, slot 0 is the thread id + // glibc: https://sourceware.org/git/?p=glibc.git;a=blob_plain;f=sysdeps/x86_64/nptl/tls.h + // apple: https://github.com/apple/darwin-xnu/blob/main/libsyscall/os/tsd.h#L36 + return (uintptr_t)mi_prim_tls_slot(0); + #endif +} + +#else + +// otherwise use portable C, taking the address of a thread local variable (this is still very fast on most platforms). +static inline mi_threadid_t _mi_prim_thread_id(void) mi_attr_noexcept { + return (uintptr_t)&_mi_heap_default; +} + +#endif + + + +/* ---------------------------------------------------------------------------------------- +The thread local default heap: `_mi_prim_get_default_heap()` +This is inlined here as it is on the fast path for allocation functions. + +On most platforms (Windows, Linux, FreeBSD, NetBSD, etc), this just returns a +__thread local variable (`_mi_heap_default`). With the initial-exec TLS model this ensures +that the storage will always be available (allocated on the thread stacks). + +On some platforms though we cannot use that when overriding `malloc` since the underlying +TLS implementation (or the loader) will call itself `malloc` on a first access and recurse. +We try to circumvent this in an efficient way: +- macOSX : we use an unused TLS slot from the OS allocated slots (MI_TLS_SLOT). On OSX, the + loader itself calls `malloc` even before the modules are initialized. +- OpenBSD: we use an unused slot from the pthread block (MI_TLS_PTHREAD_SLOT_OFS). +- DragonFly: defaults are working but seem slow compared to freeBSD (see PR #323) +------------------------------------------------------------------------------------------- */ + +static inline mi_heap_t* mi_prim_get_default_heap(void); + +#if defined(MI_MALLOC_OVERRIDE) +#if defined(__APPLE__) // macOS + #define MI_TLS_SLOT 89 // seems unused? + // #define MI_TLS_RECURSE_GUARD 1 + // other possible unused ones are 9, 29, __PTK_FRAMEWORK_JAVASCRIPTCORE_KEY4 (94), __PTK_FRAMEWORK_GC_KEY9 (112) and __PTK_FRAMEWORK_OLDGC_KEY9 (89) + // see +#elif defined(__OpenBSD__) + // use end bytes of a name; goes wrong if anyone uses names > 23 characters (ptrhread specifies 16) + // see + #define MI_TLS_PTHREAD_SLOT_OFS (6*sizeof(int) + 4*sizeof(void*) + 24) + // #elif defined(__DragonFly__) + // #warning "mimalloc is not working correctly on DragonFly yet." + // #define MI_TLS_PTHREAD_SLOT_OFS (4 + 1*sizeof(void*)) // offset `uniqueid` (also used by gdb?) +#elif defined(__ANDROID__) + // See issue #381 + #define MI_TLS_PTHREAD +#endif +#endif + + +#if defined(MI_TLS_SLOT) + +static inline mi_heap_t* mi_prim_get_default_heap(void) { + mi_heap_t* heap = (mi_heap_t*)mi_prim_tls_slot(MI_TLS_SLOT); + if mi_unlikely(heap == NULL) { + #ifdef __GNUC__ + __asm(""); // prevent conditional load of the address of _mi_heap_empty + #endif + heap = (mi_heap_t*)&_mi_heap_empty; + } + return heap; +} + +#elif defined(MI_TLS_PTHREAD_SLOT_OFS) + +static inline mi_heap_t** mi_prim_tls_pthread_heap_slot(void) { + pthread_t self = pthread_self(); + #if defined(__DragonFly__) + if (self==NULL) return NULL; + #endif + return (mi_heap_t**)((uint8_t*)self + MI_TLS_PTHREAD_SLOT_OFS); +} + +static inline mi_heap_t* mi_prim_get_default_heap(void) { + mi_heap_t** pheap = mi_prim_tls_pthread_heap_slot(); + if mi_unlikely(pheap == NULL) return _mi_heap_main_get(); + mi_heap_t* heap = *pheap; + if mi_unlikely(heap == NULL) return (mi_heap_t*)&_mi_heap_empty; + return heap; +} + +#elif defined(MI_TLS_PTHREAD) + +extern pthread_key_t _mi_heap_default_key; +static inline mi_heap_t* mi_prim_get_default_heap(void) { + mi_heap_t* heap = (mi_unlikely(_mi_heap_default_key == (pthread_key_t)(-1)) ? _mi_heap_main_get() : (mi_heap_t*)pthread_getspecific(_mi_heap_default_key)); + return (mi_unlikely(heap == NULL) ? (mi_heap_t*)&_mi_heap_empty : heap); +} + +#else // default using a thread local variable; used on most platforms. + +static inline mi_heap_t* mi_prim_get_default_heap(void) { + #if defined(MI_TLS_RECURSE_GUARD) + if (mi_unlikely(!_mi_process_is_initialized)) return _mi_heap_main_get(); + #endif + return _mi_heap_default; +} + +#endif // mi_prim_get_default_heap() + + + +#endif // MIMALLOC_PRIM_H diff --git a/include/mimalloc/track.h b/include/mimalloc/track.h new file mode 100644 index 0000000..9545f75 --- /dev/null +++ b/include/mimalloc/track.h @@ -0,0 +1,147 @@ +/* ---------------------------------------------------------------------------- +Copyright (c) 2018-2023, Microsoft Research, Daan Leijen +This is free software; you can redistribute it and/or modify it under the +terms of the MIT license. A copy of the license can be found in the file +"LICENSE" at the root of this distribution. +-----------------------------------------------------------------------------*/ +#pragma once +#ifndef MIMALLOC_TRACK_H +#define MIMALLOC_TRACK_H + +/* ------------------------------------------------------------------------------------------------------ +Track memory ranges with macros for tools like Valgrind address sanitizer, or other memory checkers. +These can be defined for tracking allocation: + + #define mi_track_malloc_size(p,reqsize,size,zero) + #define mi_track_free_size(p,_size) + +The macros are set up such that the size passed to `mi_track_free_size` +always matches the size of `mi_track_malloc_size`. (currently, `size == mi_usable_size(p)`). +The `reqsize` is what the user requested, and `size >= reqsize`. +The `size` is either byte precise (and `size==reqsize`) if `MI_PADDING` is enabled, +or otherwise it is the usable block size which may be larger than the original request. +Use `_mi_block_size_of(void* p)` to get the full block size that was allocated (including padding etc). +The `zero` parameter is `true` if the allocated block is zero initialized. + +Optional: + + #define mi_track_align(p,alignedp,offset,size) + #define mi_track_resize(p,oldsize,newsize) + #define mi_track_init() + +The `mi_track_align` is called right after a `mi_track_malloc` for aligned pointers in a block. +The corresponding `mi_track_free` still uses the block start pointer and original size (corresponding to the `mi_track_malloc`). +The `mi_track_resize` is currently unused but could be called on reallocations within a block. +`mi_track_init` is called at program start. + +The following macros are for tools like asan and valgrind to track whether memory is +defined, undefined, or not accessible at all: + + #define mi_track_mem_defined(p,size) + #define mi_track_mem_undefined(p,size) + #define mi_track_mem_noaccess(p,size) + +-------------------------------------------------------------------------------------------------------*/ + +#if MI_TRACK_VALGRIND +// valgrind tool + +#define MI_TRACK_ENABLED 1 +#define MI_TRACK_HEAP_DESTROY 1 // track free of individual blocks on heap_destroy +#define MI_TRACK_TOOL "valgrind" + +#include +#include + +#define mi_track_malloc_size(p,reqsize,size,zero) VALGRIND_MALLOCLIKE_BLOCK(p,size,MI_PADDING_SIZE /*red zone*/,zero) +#define mi_track_free_size(p,_size) VALGRIND_FREELIKE_BLOCK(p,MI_PADDING_SIZE /*red zone*/) +#define mi_track_resize(p,oldsize,newsize) VALGRIND_RESIZEINPLACE_BLOCK(p,oldsize,newsize,MI_PADDING_SIZE /*red zone*/) +#define mi_track_mem_defined(p,size) VALGRIND_MAKE_MEM_DEFINED(p,size) +#define mi_track_mem_undefined(p,size) VALGRIND_MAKE_MEM_UNDEFINED(p,size) +#define mi_track_mem_noaccess(p,size) VALGRIND_MAKE_MEM_NOACCESS(p,size) + +#elif MI_TRACK_ASAN +// address sanitizer + +#define MI_TRACK_ENABLED 1 +#define MI_TRACK_HEAP_DESTROY 0 +#define MI_TRACK_TOOL "asan" + +#include + +#define mi_track_malloc_size(p,reqsize,size,zero) ASAN_UNPOISON_MEMORY_REGION(p,size) +#define mi_track_free_size(p,size) ASAN_POISON_MEMORY_REGION(p,size) +#define mi_track_mem_defined(p,size) ASAN_UNPOISON_MEMORY_REGION(p,size) +#define mi_track_mem_undefined(p,size) ASAN_UNPOISON_MEMORY_REGION(p,size) +#define mi_track_mem_noaccess(p,size) ASAN_POISON_MEMORY_REGION(p,size) + +#elif MI_TRACK_ETW +// windows event tracing + +#define MI_TRACK_ENABLED 1 +#define MI_TRACK_HEAP_DESTROY 1 +#define MI_TRACK_TOOL "ETW" + +#define WIN32_LEAN_AND_MEAN +#include +#include "../src/prim/windows/etw.h" + +#define mi_track_init() EventRegistermicrosoft_windows_mimalloc(); +#define mi_track_malloc_size(p,reqsize,size,zero) EventWriteETW_MI_ALLOC((UINT64)(p), size) +#define mi_track_free_size(p,size) EventWriteETW_MI_FREE((UINT64)(p), size) + +#else +// no tracking + +#define MI_TRACK_ENABLED 0 +#define MI_TRACK_HEAP_DESTROY 0 +#define MI_TRACK_TOOL "none" + +#define mi_track_malloc_size(p,reqsize,size,zero) +#define mi_track_free_size(p,_size) + +#endif + +// ------------------- +// Utility definitions + +#ifndef mi_track_resize +#define mi_track_resize(p,oldsize,newsize) mi_track_free_size(p,oldsize); mi_track_malloc(p,newsize,false) +#endif + +#ifndef mi_track_align +#define mi_track_align(p,alignedp,offset,size) mi_track_mem_noaccess(p,offset) +#endif + +#ifndef mi_track_init +#define mi_track_init() +#endif + +#ifndef mi_track_mem_defined +#define mi_track_mem_defined(p,size) +#endif + +#ifndef mi_track_mem_undefined +#define mi_track_mem_undefined(p,size) +#endif + +#ifndef mi_track_mem_noaccess +#define mi_track_mem_noaccess(p,size) +#endif + + +#if MI_PADDING +#define mi_track_malloc(p,reqsize,zero) \ + if ((p)!=NULL) { \ + mi_assert_internal(mi_usable_size(p)==(reqsize)); \ + mi_track_malloc_size(p,reqsize,reqsize,zero); \ + } +#else +#define mi_track_malloc(p,reqsize,zero) \ + if ((p)!=NULL) { \ + mi_assert_internal(mi_usable_size(p)>=(reqsize)); \ + mi_track_malloc_size(p,reqsize,mi_usable_size(p),zero); \ + } +#endif + +#endif diff --git a/include/mimalloc-types.h b/include/mimalloc/types.h similarity index 56% rename from include/mimalloc-types.h rename to include/mimalloc/types.h index d9bd14e..2005238 100644 --- a/include/mimalloc-types.h +++ b/include/mimalloc/types.h @@ -1,5 +1,5 @@ /* ---------------------------------------------------------------------------- -Copyright (c) 2018, Microsoft Research, Daan Leijen +Copyright (c) 2018-2023, Microsoft Research, Daan Leijen This is free software; you can redistribute it and/or modify it under the terms of the MIT license. A copy of the license can be found in the file "LICENSE" at the root of this distribution. @@ -8,16 +8,27 @@ terms of the MIT license. A copy of the license can be found in the file #ifndef MIMALLOC_TYPES_H #define MIMALLOC_TYPES_H +// -------------------------------------------------------------------------- +// This file contains the main type definitions for mimalloc: +// mi_heap_t : all data for a thread-local heap, contains +// lists of all managed heap pages. +// mi_segment_t : a larger chunk of memory (32GiB) from where pages +// are allocated. +// mi_page_t : a mimalloc page (usually 64KiB or 512KiB) from +// where objects are allocated. +// -------------------------------------------------------------------------- + + #include // ptrdiff_t #include // uintptr_t, uint16_t, etc -#include // _Atomic +#include "mimalloc/atomic.h" // _Atomic #ifdef _MSC_VER #pragma warning(disable:4214) // bitfield is not int -#endif +#endif // Minimal alignment necessary. On most platforms 16 bytes are needed -// due to SSE registers for example. This must be at least `MI_INTPTR_SIZE` +// due to SSE registers for example. This must be at least `sizeof(void*)` #ifndef MI_MAX_ALIGN_SIZE #define MI_MAX_ALIGN_SIZE 16 // sizeof(max_align_t) #endif @@ -29,6 +40,11 @@ terms of the MIT license. A copy of the license can be found in the file // Define NDEBUG in the release version to disable assertions. // #define NDEBUG +// Define MI_TRACK_ to enable tracking support +// #define MI_TRACK_VALGRIND 1 +// #define MI_TRACK_ASAN 1 +// #define MI_TRACK_ETW 1 + // Define MI_STAT as 1 to maintain statistics; set it to 2 to have detailed statistics (but costs some performance). // #define MI_STAT 1 @@ -55,18 +71,31 @@ terms of the MIT license. A copy of the license can be found in the file #endif // Reserve extra padding at the end of each block to be more resilient against heap block overflows. -// The padding can detect byte-precise buffer overflow on free. -#if !defined(MI_PADDING) && (MI_DEBUG>=1) +// The padding can detect buffer overflow on free. +#if !defined(MI_PADDING) && (MI_SECURE>=3 || MI_DEBUG>=1 || (MI_TRACK_VALGRIND || MI_TRACK_ASAN || MI_TRACK_ETW)) #define MI_PADDING 1 #endif +// Check padding bytes; allows byte-precise buffer overflow detection +#if !defined(MI_PADDING_CHECK) && MI_PADDING && (MI_SECURE>=3 || MI_DEBUG>=1) +#define MI_PADDING_CHECK 1 +#endif + // Encoded free lists allow detection of corrupted free lists // and can detect buffer overflows, modify after free, and double `free`s. -#if (MI_SECURE>=3 || MI_DEBUG>=1 || MI_PADDING > 0) +#if (MI_SECURE>=3 || MI_DEBUG>=1) #define MI_ENCODE_FREELIST 1 #endif + +// We used to abandon huge pages but to eagerly deallocate if freed from another thread, +// but that makes it not possible to visit them during a heap walk or include them in a +// `mi_heap_destroy`. We therefore instead reset/decommit the huge blocks if freed from +// another thread so most memory is available until it gets properly freed by the owning thread. +// #define MI_HUGE_PAGE_ABANDON 1 + + // ------------------------------------------------------ // Platform specific values // ------------------------------------------------------ @@ -83,20 +112,43 @@ terms of the MIT license. A copy of the license can be found in the file // or otherwise one might define an intptr_t type that is larger than a pointer... // ------------------------------------------------------ -#if INTPTR_MAX == 9223372036854775807LL +#if INTPTR_MAX > INT64_MAX +# define MI_INTPTR_SHIFT (4) // assume 128-bit (as on arm CHERI for example) +#elif INTPTR_MAX == INT64_MAX # define MI_INTPTR_SHIFT (3) -#elif INTPTR_MAX == 2147483647LL +#elif INTPTR_MAX == INT32_MAX # define MI_INTPTR_SHIFT (2) #else -#error platform must be 32 or 64 bits +#error platform pointers must be 32, 64, or 128 bits +#endif + +#if SIZE_MAX == UINT64_MAX +# define MI_SIZE_SHIFT (3) +typedef int64_t mi_ssize_t; +#elif SIZE_MAX == UINT32_MAX +# define MI_SIZE_SHIFT (2) +typedef int32_t mi_ssize_t; +#else +#error platform objects must be 32 or 64 bits +#endif + +#if (SIZE_MAX/2) > LONG_MAX +# define MI_ZU(x) x##ULL +# define MI_ZI(x) x##LL +#else +# define MI_ZU(x) x##UL +# define MI_ZI(x) x##L #endif #define MI_INTPTR_SIZE (1< 4 +#define MI_SEGMENT_SHIFT ( 9 + MI_SEGMENT_SLICE_SHIFT) // 32MiB +#else +#define MI_SEGMENT_SHIFT ( 7 + MI_SEGMENT_SLICE_SHIFT) // 4MiB on 32-bit +#endif + +#define MI_SMALL_PAGE_SHIFT (MI_SEGMENT_SLICE_SHIFT) // 64KiB +#define MI_MEDIUM_PAGE_SHIFT ( 3 + MI_SMALL_PAGE_SHIFT) // 512KiB + // Derived constants -#define MI_SEGMENT_SIZE (1UL<= 655360) -#error "define more bins" +#if (MI_MEDIUM_OBJ_WSIZE_MAX >= 655360) +#error "mimalloc internal: define more bins" #endif +// Maximum slice offset (15) +#define MI_MAX_SLICE_OFFSET ((MI_ALIGNMENT_MAX / MI_SEGMENT_SLICE_SIZE) - 1) + // Used as a special value to encode block sizes in 32 bits. -#define MI_HUGE_BLOCK_SIZE ((uint32_t)MI_HUGE_OBJ_SIZE_MAX) +#define MI_HUGE_BLOCK_SIZE ((uint32_t)(2*MI_GiB)) + +// blocks up to this size are always allocated aligned +#define MI_MAX_ALIGN_GUARANTEE (8*MI_MAX_ALIGN_SIZE) + +// Alignments over MI_ALIGNMENT_MAX are allocated in dedicated huge page segments +#define MI_ALIGNMENT_MAX (MI_SEGMENT_SIZE >> 1) + + +// ------------------------------------------------------ +// Mimalloc pages contain allocated blocks +// ------------------------------------------------------ // The free lists use encoded next fields // (Only actually encodes when MI_ENCODED_FREELIST is defined.) -typedef uintptr_t mi_encoded_t; +typedef uintptr_t mi_encoded_t; + +// thread id's +typedef size_t mi_threadid_t; // free lists contain blocks typedef struct mi_block_s { @@ -201,88 +273,176 @@ typedef uintptr_t mi_thread_free_t; // We don't count `freed` (as |free|) but use `used` to reduce // the number of memory accesses in the `mi_page_all_free` function(s). // -// Notes: +// Notes: // - Access is optimized for `mi_free` and `mi_page_alloc` (in `alloc.c`) // - Using `uint16_t` does not seem to slow things down // - The size is 8 words on 64-bit which helps the page index calculations -// (and 10 words on 32-bit, and encoded free lists add 2 words. Sizes 10 +// (and 10 words on 32-bit, and encoded free lists add 2 words. Sizes 10 // and 12 are still good for address calculation) -// - To limit the structure size, the `xblock_size` is 32-bits only; for +// - To limit the structure size, the `xblock_size` is 32-bits only; for // blocks > MI_HUGE_BLOCK_SIZE the size is determined from the segment page size // - `thread_free` uses the bottom bits as a delayed-free flags to optimize // concurrent frees where only the first concurrent free adds to the owning // heap `thread_delayed_free` list (see `alloc.c:mi_free_block_mt`). // The invariant is that no-delayed-free is only set if there is -// at least one block that will be added, or as already been added, to +// at least one block that will be added, or as already been added, to // the owning heap `thread_delayed_free` list. This guarantees that pages // will be freed correctly even if only other threads free blocks. typedef struct mi_page_s { // "owned" by the segment - uint8_t segment_idx; // index in the segment `pages` array, `page == &segment->pages[page->segment_idx]` - uint8_t segment_in_use:1; // `true` if the segment allocated this page - uint8_t is_reset:1; // `true` if the page memory was reset - uint8_t is_committed:1; // `true` if the page virtual memory is committed - uint8_t is_zero_init:1; // `true` if the page was zero initialized + uint32_t slice_count; // slices in this page (0 if not a page) + uint32_t slice_offset; // distance from the actual page data slice (0 if a page) + uint8_t is_committed : 1; // `true` if the page virtual memory is committed + uint8_t is_zero_init : 1; // `true` if the page was initially zero initialized // layout like this to optimize access in `mi_malloc` and `mi_free` uint16_t capacity; // number of blocks committed, must be the first field, see `segment.c:page_clear` uint16_t reserved; // number of blocks reserved in memory mi_page_flags_t flags; // `in_full` and `has_aligned` flags (8 bits) - uint8_t is_zero:1; // `true` if the blocks in the free list are zero initialized - uint8_t retire_expire:7; // expiration count for retired blocks + uint8_t free_is_zero : 1; // `true` if the blocks in the free list are zero initialized + uint8_t retire_expire : 7; // expiration count for retired blocks mi_block_t* free; // list of available free blocks (`malloc` allocates from this list) - #ifdef MI_ENCODE_FREELIST - uintptr_t keys[2]; // two random keys to encode the free lists (see `_mi_block_next`) - #endif uint32_t used; // number of blocks in use (including blocks in `local_free` and `thread_free`) - uint32_t xblock_size; // size available in each block (always `>0`) - + uint32_t xblock_size; // size available in each block (always `>0`) mi_block_t* local_free; // list of deferred free blocks by this thread (migrates to `free`) + + #if (MI_ENCODE_FREELIST || MI_PADDING) + uintptr_t keys[2]; // two random keys to encode the free lists (see `_mi_block_next`) or padding canary + #endif + _Atomic(mi_thread_free_t) xthread_free; // list of deferred free blocks freed by other threads _Atomic(uintptr_t) xheap; - + struct mi_page_s* next; // next page owned by this thread with the same `block_size` struct mi_page_s* prev; // previous page owned by this thread with the same `block_size` + + // 64-bit 9 words, 32-bit 12 words, (+2 for secure) + #if MI_INTPTR_SIZE==8 + uintptr_t padding[1]; + #endif } mi_page_t; +// ------------------------------------------------------ +// Mimalloc segments contain mimalloc pages +// ------------------------------------------------------ + typedef enum mi_page_kind_e { - MI_PAGE_SMALL, // small blocks go into 64kb pages inside a segment - MI_PAGE_MEDIUM, // medium blocks go into 512kb pages inside a segment - MI_PAGE_LARGE, // larger blocks go into a single page spanning a whole segment - MI_PAGE_HUGE // huge blocks (>512kb) are put into a single page in a segment of the exact size (but still 2mb aligned) + MI_PAGE_SMALL, // small blocks go into 64KiB pages inside a segment + MI_PAGE_MEDIUM, // medium blocks go into medium pages inside a segment + MI_PAGE_LARGE, // larger blocks go into a page of just one block + MI_PAGE_HUGE, // huge blocks (> 16 MiB) are put into a single page in a single segment. } mi_page_kind_t; -// Segments are large allocated memory blocks (2mb on 64 bit) from +typedef enum mi_segment_kind_e { + MI_SEGMENT_NORMAL, // MI_SEGMENT_SIZE size with pages inside. + MI_SEGMENT_HUGE, // > MI_LARGE_SIZE_MAX segment with just one huge page inside. +} mi_segment_kind_t; + +// ------------------------------------------------------ +// A segment holds a commit mask where a bit is set if +// the corresponding MI_COMMIT_SIZE area is committed. +// The MI_COMMIT_SIZE must be a multiple of the slice +// size. If it is equal we have the most fine grained +// decommit (but setting it higher can be more efficient). +// The MI_MINIMAL_COMMIT_SIZE is the minimal amount that will +// be committed in one go which can be set higher than +// MI_COMMIT_SIZE for efficiency (while the decommit mask +// is still tracked in fine-grained MI_COMMIT_SIZE chunks) +// ------------------------------------------------------ + +#define MI_MINIMAL_COMMIT_SIZE (1*MI_SEGMENT_SLICE_SIZE) +#define MI_COMMIT_SIZE (MI_SEGMENT_SLICE_SIZE) // 64KiB +#define MI_COMMIT_MASK_BITS (MI_SEGMENT_SIZE / MI_COMMIT_SIZE) +#define MI_COMMIT_MASK_FIELD_BITS MI_SIZE_BITS +#define MI_COMMIT_MASK_FIELD_COUNT (MI_COMMIT_MASK_BITS / MI_COMMIT_MASK_FIELD_BITS) + +#if (MI_COMMIT_MASK_BITS != (MI_COMMIT_MASK_FIELD_COUNT * MI_COMMIT_MASK_FIELD_BITS)) +#error "the segment size must be exactly divisible by the (commit size * size_t bits)" +#endif + +typedef struct mi_commit_mask_s { + size_t mask[MI_COMMIT_MASK_FIELD_COUNT]; +} mi_commit_mask_t; + +typedef mi_page_t mi_slice_t; +typedef int64_t mi_msecs_t; + + +// Memory can reside in arena's, direct OS allocated, or statically allocated. The memid keeps track of this. +typedef enum mi_memkind_e { + MI_MEM_NONE, // not allocated + MI_MEM_EXTERNAL, // not owned by mimalloc but provided externally (via `mi_manage_os_memory` for example) + MI_MEM_STATIC, // allocated in a static area and should not be freed (for arena meta data for example) + MI_MEM_OS, // allocated from the OS + MI_MEM_OS_HUGE, // allocated as huge os pages + MI_MEM_OS_REMAP, // allocated in a remapable area (i.e. using `mremap`) + MI_MEM_ARENA // allocated from an arena (the usual case) +} mi_memkind_t; + +static inline bool mi_memkind_is_os(mi_memkind_t memkind) { + return (memkind >= MI_MEM_OS && memkind <= MI_MEM_OS_REMAP); +} + +typedef struct mi_memid_os_info { + void* base; // actual base address of the block (used for offset aligned allocations) + size_t alignment; // alignment at allocation +} mi_memid_os_info_t; + +typedef struct mi_memid_arena_info { + size_t block_index; // index in the arena + mi_arena_id_t id; // arena id (>= 1) + bool is_exclusive; // the arena can only be used for specific arena allocations +} mi_memid_arena_info_t; + +typedef struct mi_memid_s { + union { + mi_memid_os_info_t os; // only used for MI_MEM_OS + mi_memid_arena_info_t arena; // only used for MI_MEM_ARENA + } mem; + bool is_pinned; // `true` if we cannot decommit/reset/protect in this memory (e.g. when allocated using large OS pages) + bool initially_committed;// `true` if the memory was originally allocated as committed + bool initially_zero; // `true` if the memory was originally zero initialized + mi_memkind_t memkind; +} mi_memid_t; + + +// Segments are large allocated memory blocks (8mb on 64 bit) from // the OS. Inside segments we allocated fixed size _pages_ that // contain blocks. typedef struct mi_segment_s { - // memory fields - size_t memid; // id for the os-level memory manager - bool mem_is_fixed; // `true` if we cannot decommit/reset/protect in this memory (i.e. when allocated using large OS pages) - bool mem_is_committed; // `true` if the whole segment is eagerly committed + // constant fields + mi_memid_t memid; // memory id for arena allocation + bool allow_decommit; + bool allow_purge; + size_t segment_size; // segment fields + mi_msecs_t purge_expire; + mi_commit_mask_t purge_mask; + mi_commit_mask_t commit_mask; + _Atomic(struct mi_segment_s*) abandoned_next; - struct mi_segment_s* next; // must be the first segment field after abandoned_next -- see `segment.c:segment_init` - struct mi_segment_s* prev; - size_t abandoned; // abandoned pages (i.e. the original owning thread stopped) (`abandoned <= used`) - size_t abandoned_visits; // count how often this segment is visited in the abandoned list (to force reclaim it it is too long) + // from here is zero initialized + struct mi_segment_s* next; // the list of freed segments in the cache (must be first field, see `segment.c:mi_segment_init`) + + size_t abandoned; // abandoned pages (i.e. the original owning thread stopped) (`abandoned <= used`) + size_t abandoned_visits; // count how often this segment is visited in the abandoned list (to force reclaim it it is too long) + size_t used; // count of pages in use + uintptr_t cookie; // verify addresses in debug mode: `mi_ptr_cookie(segment) == segment->cookie` - size_t used; // count of pages in use (`used <= capacity`) - size_t capacity; // count of available pages (`#free + used`) - size_t segment_size; // for huge pages this may be different from `MI_SEGMENT_SIZE` - size_t segment_info_size;// space we are using from the first page for segment meta-data and possible guard pages. - uintptr_t cookie; // verify addresses in secure mode: `_mi_ptr_cookie(segment) == segment->cookie` + size_t segment_slices; // for huge segments this may be different from `MI_SLICES_PER_SEGMENT` + size_t segment_info_slices; // initial slices we are using segment info and possible guard pages. // layout like this to optimize access in `mi_free` - size_t page_shift; // `1 << page_shift` == the page sizes == `page->block_size * page->reserved` (unless the first page, then `-segment_info_size`). - _Atomic(uintptr_t) thread_id; // unique id of the thread owning this segment - mi_page_kind_t page_kind; // kind of pages: small, large, or huge - mi_page_t pages[1]; // up to `MI_SMALL_PAGES_PER_SEGMENT` pages + mi_segment_kind_t kind; + size_t slice_entries; // entries in the `slices` array, at most `MI_SLICES_PER_SEGMENT` + _Atomic(mi_threadid_t) thread_id; // unique id of the thread owning this segment + + mi_slice_t slices[MI_SLICES_PER_SEGMENT+1]; // one more for huge blocks with large alignment } mi_segment_t; @@ -316,10 +476,11 @@ typedef struct mi_random_cxt_s { uint32_t input[16]; uint32_t output[16]; int output_available; + bool weak; } mi_random_ctx_t; -// In debug mode there is a padding stucture at the end of the blocks to check for buffer overflows +// In debug mode there is a padding structure at the end of the blocks to check for buffer overflows #if (MI_PADDING) typedef struct mi_padding_s { uint32_t canary; // encoded block value to check validity of the padding (in case of overflow) @@ -341,7 +502,8 @@ struct mi_heap_s { mi_page_t* pages_free_direct[MI_PAGES_DIRECT]; // optimize: array where every entry points a page with possibly free blocks in the corresponding queue for that size. mi_page_queue_t pages[MI_BIN_FULL + 1]; // queue of pages for each size class (or "bin") _Atomic(mi_block_t*) thread_delayed_free; - uintptr_t thread_id; // thread this heap belongs too + mi_threadid_t thread_id; // thread this heap belongs too + mi_arena_id_t arena_id; // arena id if the heap belongs to a specific arena (or 0) uintptr_t cookie; // random cookie to verify pointers (see `_mi_ptr_cookie`) uintptr_t keys[2]; // two random keys used to encode the `thread_delayed_free` list mi_random_ctx_t random; // random number context used for secure allocation @@ -358,9 +520,15 @@ struct mi_heap_s { // Debug // ------------------------------------------------------ +#if !defined(MI_DEBUG_UNINIT) #define MI_DEBUG_UNINIT (0xD0) +#endif +#if !defined(MI_DEBUG_FREED) #define MI_DEBUG_FREED (0xDF) +#endif +#if !defined(MI_DEBUG_PADDING) #define MI_DEBUG_PADDING (0xDE) +#endif #if (MI_DEBUG) // use our own assertion to print without memory allocation @@ -412,23 +580,28 @@ typedef struct mi_stats_s { mi_stat_count_t reserved; mi_stat_count_t committed; mi_stat_count_t reset; + mi_stat_count_t purged; mi_stat_count_t page_committed; mi_stat_count_t segments_abandoned; mi_stat_count_t pages_abandoned; mi_stat_count_t threads; + mi_stat_count_t normal; mi_stat_count_t huge; - mi_stat_count_t giant; + mi_stat_count_t large; mi_stat_count_t malloc; mi_stat_count_t segments_cache; mi_stat_counter_t pages_extended; mi_stat_counter_t mmap_calls; mi_stat_counter_t commit_calls; + mi_stat_counter_t reset_calls; + mi_stat_counter_t purge_calls; mi_stat_counter_t page_no_retire; mi_stat_counter_t searches; + mi_stat_counter_t normal_count; mi_stat_counter_t huge_count; - mi_stat_counter_t giant_count; + mi_stat_counter_t large_count; #if MI_STAT>1 - mi_stat_count_t normal[MI_BIN_HUGE+1]; + mi_stat_count_t normal_bins[MI_BIN_HUGE+1]; #endif } mi_stats_t; @@ -447,6 +620,7 @@ void _mi_stat_counter_increase(mi_stat_counter_t* stat, size_t amount); #define mi_stat_counter_increase(stat,amount) (void)0 #endif +#define mi_heap_stat_counter_increase(heap,stat,amount) mi_stat_counter_increase( (heap)->tld->stats.stat, amount) #define mi_heap_stat_increase(heap,stat,amount) mi_stat_increase( (heap)->tld->stats.stat, amount) #define mi_heap_stat_decrease(heap,stat,amount) mi_stat_decrease( (heap)->tld->stats.stat, amount) @@ -454,13 +628,15 @@ void _mi_stat_counter_increase(mi_stat_counter_t* stat, size_t amount); // Thread Local data // ------------------------------------------------------ -typedef int64_t mi_msecs_t; +// A "span" is is an available range of slices. The span queues keep +// track of slice spans of at most the given `slice_count` (but more than the previous size class). +typedef struct mi_span_queue_s { + mi_slice_t* first; + mi_slice_t* last; + size_t slice_count; +} mi_span_queue_t; -// Queue of segments -typedef struct mi_segment_queue_s { - mi_segment_t* first; - mi_segment_t* last; -} mi_segment_queue_t; +#define MI_SEGMENT_BIN_MAX (35) // 35 == mi_segment_bin(MI_SLICES_PER_SEGMENT) // OS thread local data typedef struct mi_os_tld_s { @@ -468,18 +644,14 @@ typedef struct mi_os_tld_s { mi_stats_t* stats; // points to tld stats } mi_os_tld_t; + // Segments thread local data typedef struct mi_segments_tld_s { - mi_segment_queue_t small_free; // queue of segments with free small pages - mi_segment_queue_t medium_free; // queue of segments with free medium pages - mi_page_queue_t pages_reset; // queue of freed pages that can be reset + mi_span_queue_t spans[MI_SEGMENT_BIN_MAX+1]; // free slice spans inside segments size_t count; // current number of segments; size_t peak_count; // peak number of segments size_t current_size; // current size of all segments size_t peak_size; // peak size of all segments - size_t cache_count; // number of segments in the cache - size_t cache_size; // total size of all segments in the cache - mi_segment_t* cache; // (small) cache of segments mi_stats_t* stats; // points to tld stats mi_os_tld_t* os; // points to os stats } mi_segments_tld_t; diff --git a/mimalloc.pc.in b/mimalloc.pc.in new file mode 100644 index 0000000..36da203 --- /dev/null +++ b/mimalloc.pc.in @@ -0,0 +1,11 @@ +prefix=@CMAKE_INSTALL_PREFIX@ +libdir=@libdir_for_pc_file@ +includedir=@includedir_for_pc_file@ + +Name: @PROJECT_NAME@ +Description: A compact general purpose allocator with excellent performance +Version: @PACKAGE_VERSION@ +URL: https://github.com/microsoft/mimalloc/ +Libs: -L${libdir} -lmimalloc +Libs.private: @pc_libraries@ +Cflags: -I${includedir} diff --git a/readme.md b/readme.md index 9419a65..85d3563 100644 --- a/readme.md +++ b/readme.md @@ -9,22 +9,26 @@ mimalloc (pronounced "me-malloc") is a general purpose allocator with excellent [performance](#performance) characteristics. -Initially developed by Daan Leijen for the run-time systems of the -[Koka](https://github.com/koka-lang/koka) and [Lean](https://github.com/leanprover/lean) languages. -Latest release:`v1.6.7` (2020-09-24). +Initially developed by Daan Leijen for the runtime systems of the +[Koka](https://koka-lang.github.io) and [Lean](https://github.com/leanprover/lean) languages. -It is a drop-in replacement for `malloc` and can be used in other programs +Latest release tag: `v2.1.2` (2023-04-24). +Latest stable tag: `v1.8.2` (2023-04-24). + +mimalloc is a drop-in replacement for `malloc` and can be used in other programs without code changes, for example, on dynamically linked ELF-based systems (Linux, BSD, etc.) you can use it as: ``` -> LD_PRELOAD=/usr/bin/libmimalloc.so myprogram +> LD_PRELOAD=/usr/lib/libmimalloc.so myprogram ``` -It also has an easy way to override the default allocator in [Windows](#override_on_windows). Notable aspects of the design include: +It also includes a robust way to override the default allocator in [Windows](#override_on_windows). Notable aspects of the design include: - __small and consistent__: the library is about 8k LOC using simple and consistent data structures. This makes it very suitable to integrate and adapt in other projects. For runtime systems it provides hooks for a monotonic _heartbeat_ and deferred freeing (for bounded worst-case times with reference counting). + Partly due to its simplicity, mimalloc has been ported to many systems (Windows, macOS, + Linux, WASM, various BSD's, Haiku, MUSL, etc) and has excellent support for dynamic overriding. - __free list sharding__: instead of one big free list (per size class) we have many smaller lists per "mimalloc page" which reduces fragmentation and increases locality -- @@ -34,13 +38,13 @@ It also has an easy way to override the default allocator in [Windows](#override per mimalloc page, but for each page we have multiple free lists. In particular, there is one list for thread-local `free` operations, and another one for concurrent `free` operations. Free-ing from another thread can now be a single CAS without needing - sophisticated coordination between threads. Since there will be + sophisticated coordination between threads. Since there will be thousands of separate free lists, contention is naturally distributed over the heap, and the chance of contending on a single location will be low -- this is quite similar to randomized algorithms like skip lists where adding a random oracle removes the need for a more complex algorithm. -- __eager page reset__: when a "page" becomes empty (with increased chance - due to free list sharding) the memory is marked to the OS as unused ("reset" or "purged") +- __eager page purging__: when a "page" becomes empty (with increased chance + due to free list sharding) the memory is marked to the OS as unused (reset or decommitted) reducing (real) memory pressure and fragmentation, especially in long running programs. - __secure__: _mimalloc_ can be built in secure mode, adding guard pages, @@ -48,75 +52,96 @@ It also has an easy way to override the default allocator in [Windows](#override heap vulnerabilities. The performance penalty is usually around 10% on average over our benchmarks. - __first-class heaps__: efficiently create and use multiple heaps to allocate across different regions. - A heap can be destroyed at once instead of deallocating each object separately. + A heap can be destroyed at once instead of deallocating each object separately. - __bounded__: it does not suffer from _blowup_ \[1\], has bounded worst-case allocation - times (_wcat_), bounded space overhead (~0.2% meta-data, with at most 12.5% waste in allocation sizes), - and has no internal points of contention using only atomic operations. + times (_wcat_) (upto OS primitives), bounded space overhead (~0.2% meta-data, with low + internal fragmentation), and has no internal points of contention using only atomic operations. - __fast__: In our benchmarks (see [below](#performance)), _mimalloc_ outperforms other leading allocators (_jemalloc_, _tcmalloc_, _Hoard_, etc), - and usually uses less memory (up to 25% more in the worst case). A nice property - is that it does consistently well over a wide range of benchmarks. There is also good huge OS page - support for larger server programs. + and often uses less memory. A nice property is that it does consistently well over a wide range + of benchmarks. There is also good huge OS page support for larger server programs. The [documentation](https://microsoft.github.io/mimalloc) gives a full overview of the API. -You can read more on the design of _mimalloc_ in the [technical report](https://www.microsoft.com/en-us/research/publication/mimalloc-free-list-sharding-in-action) which also has detailed benchmark results. +You can read more on the design of _mimalloc_ in the [technical report](https://www.microsoft.com/en-us/research/publication/mimalloc-free-list-sharding-in-action) which also has detailed benchmark results. -Enjoy! +Enjoy! ### Branches -* `master`: latest stable release. -* `dev`: latest development branch. -* `dev-slice`: experimental branch with a different way of managing mimalloc pages that tends - to use less memory than regular mimalloc with similar performance. Give it a try and please - report any significant performance improvement or degradation. +* `master`: latest stable release (based on `dev-slice`). +* `dev`: development branch for mimalloc v1. Use this branch for submitting PR's. +* `dev-slice`: development branch for mimalloc v2. This branch is downstream of `dev`. ### Releases -* 2020-09-24, `v1.6.7`: stable release 1.6: using standard C atomics, passing tsan testing, improved - handling of failing to commit on Windows, add [`mi_process_info`](https://github.com/microsoft/mimalloc/blob/master/include/mimalloc.h#L156) api call. -* 2020-08-06, `v1.6.4`: stable release 1.6: improved error recovery in low-memory situations, - support for IllumOS and Haiku, NUMA support for Vista/XP, improved NUMA detection for AMD Ryzen, ubsan support. -* 2020-05-05, `v1.6.3`: stable release 1.6: improved behavior in out-of-memory situations, improved malloc zones on macOS, - build PIC static libraries by default, add option to abort on out-of-memory, line buffered statistics. -* 2020-04-20, `v1.6.2`: stable release 1.6: fix compilation on Android, MingW, Raspberry, and Conda, - stability fix for Windows 7, fix multiple mimalloc instances in one executable, fix `strnlen` overload, - fix aligned debug padding. -* 2020-02-17, `v1.6.1`: stable release 1.6: minor updates (build with clang-cl, fix alignment issue for small objects). -* 2020-02-09, `v1.6.0`: stable release 1.6: fixed potential memory leak, improved overriding - and thread local support on FreeBSD, NetBSD, DragonFly, and macOSX. New byte-precise - heap block overflow detection in debug mode (besides the double-free detection and free-list - corruption detection). Add `nodiscard` attribute to most allocation functions. - Enable `MIMALLOC_PAGE_RESET` by default. New reclamation strategy for abandoned heap pages - for better memory footprint. -* 2020-02-09, `v1.5.0`: stable release 1.5: improved free performance, small bug fixes. -* 2020-01-22, `v1.4.0`: stable release 1.4: improved performance for delayed OS page reset, -more eager concurrent free, addition of STL allocator, fixed potential memory leak. -* 2020-01-15, `v1.3.0`: stable release 1.3: bug fixes, improved randomness and [stronger -free list encoding](https://github.com/microsoft/mimalloc/blob/783e3377f79ee82af43a0793910a9f2d01ac7863/include/mimalloc-internal.h#L396) in secure mode. -* 2019-12-22, `v1.2.2`: stable release 1.2: minor updates. -* 2019-11-22, `v1.2.0`: stable release 1.2: bug fixes, improved secure mode (free list corruption checks, double free mitigation). Improved dynamic overriding on Windows. -* 2019-10-07, `v1.1.0`: stable release 1.1. -* 2019-09-01, `v1.0.8`: pre-release 8: more robust windows dynamic overriding, initial huge page support. -* 2019-08-10, `v1.0.6`: pre-release 6: various performance improvements. +Note: the `v2.x` version has a new algorithm for managing internal mimalloc pages that tends to reduce memory usage + and fragmentation compared to mimalloc `v1.x` (especially for large workloads). Should otherwise have similar performance + (see [below](#performance)); please report if you observe any significant performance regression. + +* 2023-04-24, `v1.8.2`, `v2.1.2`: Fixes build issues on freeBSD, musl, and C17 (UE 5.1.1). Reduce code size/complexity + by removing regions and segment-cache's and only use arenas with improved memory purging -- this may improve memory + usage as well for larger services. Renamed options for consistency. Improved Valgrind and ASAN checking. + +* 2023-04-03, `v1.8.1`, `v2.1.1`: Fixes build issues on some platforms. + +* 2023-03-29, `v1.8.0`, `v2.1.0`: Improved support dynamic overriding on Windows 11. Improved tracing precision + with [asan](#asan) and [Valgrind](#valgrind), and added Windows event tracing [ETW](#ETW) (contributed by Xinglong He). Created an OS + abstraction layer to make it easier to port and separate platform dependent code (in `src/prim`). Fixed C++ STL compilation on older Microsoft C++ compilers, and various small bug fixes. + +* 2022-12-23, `v1.7.9`, `v2.0.9`: Supports building with [asan](#asan) and improved [Valgrind](#valgrind) support. + Support abitrary large alignments (in particular for `std::pmr` pools). + Added C++ STL allocators attached to a specific heap (thanks @vmarkovtsev). + Heap walks now visit all object (including huge objects). Support Windows nano server containers (by Johannes Schindelin,@dscho). Various small bug fixes. + +* 2022-11-03, `v1.7.7`, `v2.0.7`: Initial support for [Valgrind](#valgrind) for leak testing and heap block overflow + detection. Initial + support for attaching heaps to a speficic memory area (only in v2). Fix `realloc` behavior for zero size blocks, remove restriction to integral multiple of the alignment in `alloc_align`, improved aligned allocation performance, reduced contention with many threads on few processors (thank you @dposluns!), vs2022 support, support `pkg-config`, . + +* 2022-04-14, `v1.7.6`, `v2.0.6`: fix fallback path for aligned OS allocation on Windows, improve Windows aligned allocation + even when compiling with older SDK's, fix dynamic overriding on macOS Monterey, fix MSVC C++ dynamic overriding, fix + warnings under Clang 14, improve performance if many OS threads are created and destroyed, fix statistics for large object + allocations, using MIMALLOC_VERBOSE=1 has no maximum on the number of error messages, various small fixes. + +* 2022-02-14, `v1.7.5`, `v2.0.5` (alpha): fix malloc override on + Windows 11, fix compilation with musl, potentially reduced + committed memory, add `bin/minject` for Windows, + improved wasm support, faster aligned allocation, + various small fixes. + +* [Older release notes](#older-release-notes) Special thanks to: +* [David Carlier](https://devnexen.blogspot.com/) (@devnexen) for his many contributions, and making + mimalloc work better on many less common operating systems, like Haiku, Dragonfly, etc. * Mary Feofanova (@mary3000), Evgeniy Moiseenko, and Manuel Pöter (@mpoeter) for making mimalloc TSAN checkable, and finding memory model bugs using the [genMC] model checker. * Weipeng Liu (@pongba), Zhuowei Li, Junhua Wang, and Jakub Szymanski, for their early support of mimalloc and deployment at large scale services, leading to many improvements in the mimalloc algorithms for large workloads. -* Jason Gibson (@jasongibson) for exhaustive testing on large scale workloads and server environments, and finding complex bugs +* Jason Gibson (@jasongibson) for exhaustive testing on large scale workloads and server environments, and finding complex bugs in (early versions of) `mimalloc`. -* Manuel Pöter (@mpoeter) and Sam Gross (@colesbury) for finding an ABA concurrency issue in abandoned segment reclamation. +* Manuel Pöter (@mpoeter) and Sam Gross(@colesbury) for finding an ABA concurrency issue in abandoned segment reclamation. Sam also created the [no GIL](https://github.com/colesbury/nogil) Python fork which + uses mimalloc internally. + [genMC]: https://plv.mpi-sws.org/genmc/ +### Usage + +mimalloc is used in various large scale low-latency services and programs, for example: + + + + + + + + # Building ## Windows -Open `ide/vs2019/mimalloc.sln` in Visual Studio 2019 and build (or `ide/vs2017/mimalloc.sln`). +Open `ide/vs2019/mimalloc.sln` in Visual Studio 2019 and build. The `mimalloc` project builds a static library (in `out/msvc-x64`), while the `mimalloc-override` project builds a DLL for overriding malloc in the entire program. @@ -165,6 +190,11 @@ Notes: 2. Install CCMake: `sudo apt-get install cmake-curses-gui` +## Single source + +You can also directly build the single `src/static.c` file as part of your project without +needing `cmake` at all. Make sure to also add the mimalloc `include` directory to the include path. + # Using the library @@ -239,47 +269,55 @@ completely and redirect all calls to the _mimalloc_ library instead . ## Environment Options -You can set further options either programmatically (using [`mi_option_set`](https://microsoft.github.io/mimalloc/group__options.html)), -or via environment variables: +You can set further options either programmatically (using [`mi_option_set`](https://microsoft.github.io/mimalloc/group__options.html)), or via environment variables: - `MIMALLOC_SHOW_STATS=1`: show statistics when the program terminates. - `MIMALLOC_VERBOSE=1`: show verbose messages. - `MIMALLOC_SHOW_ERRORS=1`: show error and warning messages. -- `MIMALLOC_PAGE_RESET=0`: by default, mimalloc will reset (or purge) OS pages that are not in use, to signal to the OS - that the underlying physical memory can be reused. This can reduce memory fragmentation in long running (server) - programs. By setting it to `0` this will no longer be done which can improve performance for batch-like programs. - As an alternative, the `MIMALLOC_RESET_DELAY=` can be set higher (100ms by default) to make the page - reset occur less frequently instead of turning it off completely. + +Advanced options: + +- `MIMALLOC_PURGE_DELAY=N`: the delay in `N` milli-seconds (by default `10`) after which mimalloc will purge + OS pages that are not in use. This signals to the OS that the underlying physical memory can be reused which + can reduce memory fragmentation especially in long running (server) programs. Setting `N` to `0` purges immediately when + a page becomes unused which can improve memory usage but also decreases performance. Setting `N` to a higher + value like `100` can improve performance (sometimes by a lot) at the cost of potentially using more memory at times. + Setting it to `-1` disables purging completely. +- `MIMALLOC_ARENA_EAGER_COMMIT=1`: turns on eager commit for the large arenas (usually 1GiB) from which mimalloc + allocates segments and pages. This is by default + only enabled on overcommit systems (e.g. Linux) but enabling it explicitly on other systems (like Windows or macOS) + may improve performance. Note that eager commit only increases the commit but not the actual the peak resident set + (rss) so it is generally ok to enable this. + +Further options for large workloads and services: + - `MIMALLOC_USE_NUMA_NODES=N`: pretend there are at most `N` NUMA nodes. If not set, the actual NUMA nodes are detected at runtime. Setting `N` to 1 may avoid problems in some virtual environments. Also, setting it to a lower number than the actual NUMA nodes is fine and will only cause threads to potentially allocate more memory across actual NUMA nodes (but this can happen in any case as NUMA local allocation is always a best effort but not guaranteed). -- `MIMALLOC_LARGE_OS_PAGES=1`: use large OS pages (2MiB) when available; for some workloads this can significantly +- `MIMALLOC_ALLOW_LARGE_OS_PAGES=1`: use large OS pages (2MiB) when available; for some workloads this can significantly improve performance. Use `MIMALLOC_VERBOSE` to check if the large OS pages are enabled -- usually one needs to explicitly allow large OS pages (as on [Windows][windows-huge] and [Linux][linux-huge]). However, sometimes the OS is very slow to reserve contiguous physical memory for large OS pages so use with care on systems that - can have fragmented memory (for that reason, we generally recommend to use `MIMALLOC_RESERVE_HUGE_OS_PAGES` instead whenever possible). - -- `MIMALLOC_RESERVE_HUGE_OS_PAGES=N`: where N is the number of 1GiB _huge_ OS pages. This reserves the huge pages at + can have fragmented memory (for that reason, we generally recommend to use `MIMALLOC_RESERVE_HUGE_OS_PAGES` instead whenever possible). +- `MIMALLOC_RESERVE_HUGE_OS_PAGES=N`: where `N` is the number of 1GiB _huge_ OS pages. This reserves the huge pages at startup and sometimes this can give a large (latency) performance improvement on big workloads. - Usually it is better to not use - `MIMALLOC_LARGE_OS_PAGES` in combination with this setting. Just like large OS pages, use with care as reserving + Usually it is better to not use `MIMALLOC_ALLOW_LARGE_OS_PAGES=1` in combination with this setting. Just like large + OS pages, use with care as reserving contiguous physical memory can take a long time when memory is fragmented (but reserving the huge pages is done at startup only once). Note that we usually need to explicitly enable huge OS pages (as on [Windows][windows-huge] and [Linux][linux-huge])). With huge OS pages, it may be beneficial to set the setting `MIMALLOC_EAGER_COMMIT_DELAY=N` (`N` is 1 by default) to delay the initial `N` segments (of 4MiB) of a thread to not allocate in the huge OS pages; this prevents threads that are short lived - and allocate just a little to take up space in the huge OS page area (which cannot be reset). + and allocate just a little to take up space in the huge OS page area (which cannot be purged). + The huge pages are usually allocated evenly among NUMA nodes. + We can use `MIMALLOC_RESERVE_HUGE_OS_PAGES_AT=N` where `N` is the numa node (starting at 0) to allocate all + the huge pages at a specific numa node instead. Use caution when using `fork` in combination with either large or huge OS pages: on a fork, the OS uses copy-on-write for all pages in the original process including the huge OS pages. When any memory is now written in that area, the -OS will copy the entire 1GiB huge page (or 2MiB large page) which can cause the memory usage to grow in big increments. +OS will copy the entire 1GiB huge page (or 2MiB large page) which can cause the memory usage to grow in large increments. [linux-huge]: https://access.redhat.com/documentation/en-us/red_hat_enterprise_linux/5/html/tuning_and_optimizing_red_hat_enterprise_linux_for_oracle_9i_and_10g_databases/sect-oracle_9i_and_10g_tuning_guide-large_memory_optimization_big_pages_and_huge_pages-configuring_huge_pages_in_red_hat_enterprise_linux_4_or_5 [windows-huge]: https://docs.microsoft.com/en-us/sql/database-engine/configure-windows/enable-the-lock-pages-in-memory-option-windows?view=sql-server-2017 @@ -311,15 +349,15 @@ When _mimalloc_ is built using debug mode, various checks are done at runtime to - Corrupted free-lists and some forms of use-after-free are detected. -# Overriding Malloc +# Overriding Standard Malloc -Overriding the standard `malloc` can be done either _dynamically_ or _statically_. +Overriding the standard `malloc` (and `new`) can be done either _dynamically_ or _statically_. ## Dynamic override This is the recommended way to override the standard malloc interface. -### Override on Linux, BSD +### Dynamic Override on Linux, BSD On these ELF-based systems we preload the mimalloc shared library so all calls to the standard `malloc` interface are @@ -338,21 +376,20 @@ or run with the debug version to get detailed statistics: > env MIMALLOC_SHOW_STATS=1 LD_PRELOAD=/usr/lib/libmimalloc-debug.so myprogram ``` -### Override on MacOS +### Dynamic Override on MacOS On macOS we can also preload the mimalloc shared library so all calls to the standard `malloc` interface are resolved to the _mimalloc_ library. ``` -> env DYLD_FORCE_FLAT_NAMESPACE=1 DYLD_INSERT_LIBRARIES=/usr/lib/libmimalloc.dylib myprogram +> env DYLD_INSERT_LIBRARIES=/usr/lib/libmimalloc.dylib myprogram ``` Note that certain security restrictions may apply when doing this from the [shell](https://stackoverflow.com/questions/43941322/dyld-insert-libraries-ignored-when-calling-application-through-bash). -(Note: macOS support for dynamic overriding is recent, please report any issues.) -### Override on Windows +### Dynamic Override on Windows Overriding on Windows is robust and has the particular advantage to be able to redirect all malloc/free calls that go through @@ -360,7 +397,7 @@ the (dynamic) C runtime allocator, including those from other DLL's or libraries The overriding on Windows requires that you link your program explicitly with the mimalloc DLL and use the C-runtime library as a DLL (using the `/MD` or `/MDd` switch). -Also, the `mimalloc-redirect.dll` (or `mimalloc-redirect32.dll`) must be available +Also, the `mimalloc-redirect.dll` (or `mimalloc-redirect32.dll`) must be put in the same folder as the main `mimalloc-override.dll` at runtime (as it is a dependency). The redirection DLL ensures that all calls to the C runtime malloc API get redirected to mimalloc (in `mimalloc-override.dll`). @@ -385,13 +422,13 @@ Such patching can be done for example with [CFF Explorer](https://ntcore.com/?pa On Unix-like systems, you can also statically link with _mimalloc_ to override the standard malloc interface. The recommended way is to link the final program with the -_mimalloc_ single object file (`mimalloc-override.o`). We use +_mimalloc_ single object file (`mimalloc.o`). We use an object file instead of a library file as linkers give preference to that over archives to resolve symbols. To ensure that the standard malloc interface resolves to the _mimalloc_ library, link it as the first object file. For example: ``` -> gcc -o myprogram mimalloc-override.o myfile1.c ... +> gcc -o myprogram mimalloc.o myfile1.c ... ``` Another way to override statically that works on all platforms, is to @@ -401,9 +438,99 @@ This is provided by [`mimalloc-override.h`](https://github.com/microsoft/mimallo under your control or otherwise mixing of pointers from different heaps may occur! +## Tools + +Generally, we recommend using the standard allocator with memory tracking tools, but mimalloc +can also be build to support the [address sanitizer][asan] or the excellent [Valgrind] tool. +Moreover, it can be build to support Windows event tracing ([ETW]). +This has a small performance overhead but does allow detecting memory leaks and byte-precise +buffer overflows directly on final executables. See also the `test/test-wrong.c` file to test with various tools. + +### Valgrind + +To build with [valgrind] support, use the `MI_TRACK_VALGRIND=ON` cmake option: + +``` +> cmake ../.. -DMI_TRACK_VALGRIND=ON +``` + +This can also be combined with secure mode or debug mode. +You can then run your programs directly under valgrind: + +``` +> valgrind +``` + +If you rely on overriding `malloc`/`free` by mimalloc (instead of using the `mi_malloc`/`mi_free` API directly), +you also need to tell `valgrind` to not intercept those calls itself, and use: + +``` +> MIMALLOC_SHOW_STATS=1 valgrind --soname-synonyms=somalloc=*mimalloc* -- +``` + +By setting the `MIMALLOC_SHOW_STATS` environment variable you can check that mimalloc is indeed +used and not the standard allocator. Even though the [Valgrind option][valgrind-soname] +is called `--soname-synonyms`, this also +works when overriding with a static library or object file. Unfortunately, it is not possible to +dynamically override mimalloc using `LD_PRELOAD` together with `valgrind`. +See also the `test/test-wrong.c` file to test with `valgrind`. + +Valgrind support is in its initial development -- please report any issues. + +[Valgrind]: https://valgrind.org/ +[valgrind-soname]: https://valgrind.org/docs/manual/manual-core.html#opt.soname-synonyms + +### ASAN + +To build with the address sanitizer, use the `-DMI_TRACK_ASAN=ON` cmake option: + +``` +> cmake ../.. -DMI_TRACK_ASAN=ON +``` + +This can also be combined with secure mode or debug mode. +You can then run your programs as:' + +``` +> ASAN_OPTIONS=verbosity=1 +``` + +When you link a program with an address sanitizer build of mimalloc, you should +generally compile that program too with the address sanitizer enabled. +For example, assuming you build mimalloc in `out/debug`: + +``` +clang -g -o test-wrong -Iinclude test/test-wrong.c out/debug/libmimalloc-asan-debug.a -lpthread -fsanitize=address -fsanitize-recover=address +``` + +Since the address sanitizer redirects the standard allocation functions, on some platforms (macOSX for example) +it is required to compile mimalloc with `-DMI_OVERRIDE=OFF`. +Adress sanitizer support is in its initial development -- please report any issues. + +[asan]: https://github.com/google/sanitizers/wiki/AddressSanitizer + +### ETW + +Event tracing for Windows ([ETW]) provides a high performance way to capture all allocations though +mimalloc and analyze them later. To build with ETW support, use the `-DMI_TRACK_ETW=ON` cmake option. + +You can then capture an allocation trace using the Windows performance recorder (WPR), using the +`src/prim/windows/etw-mimalloc.wprp` profile. In an admin prompt, you can use: +``` +> wpr -start src\prim\windows\etw-mimalloc.wprp -filemode +> +> wpr -stop .etl +``` +and then open `.etl` in the Windows Performance Analyzer (WPA), or +use a tool like [TraceControl] that is specialized for analyzing mimalloc traces. + +[ETW]: https://learn.microsoft.com/en-us/windows-hardware/test/wpt/event-tracing-for-windows +[TraceControl]: https://github.com/xinglonghe/TraceControl + + # Performance -Last update: 2020-01-20 +Last update: 2021-01-30 We tested _mimalloc_ against many other top allocators over a wide range of benchmarks, ranging from various real world programs to @@ -420,10 +547,15 @@ suffering from (too much) underperformance in less common situations. As always, interpret these results with care since some benchmarks test synthetic or uncommon situations that may never apply to your workloads. For example, most -allocators do not do well on `xmalloc-testN` but that includes the best +allocators do not do well on `xmalloc-testN` but that includes even the best industrial allocators like _jemalloc_ and _tcmalloc_ that are used in some of the world's largest systems (like Chrome or FreeBSD). +Also, the benchmarks here do not measure the behaviour on very large and long-running server workloads, +or worst-case latencies of allocation. Much work has gone into `mimalloc` to work well on such +workloads (for example, to reduce virtual memory fragmentation on long-running services) +but such optimizations are not always reflected in the current benchmark suite. + We show here only an overview -- for more specific details and further benchmarks we refer to the [technical report](https://www.microsoft.com/en-us/research/publication/mimalloc-free-list-sharding-in-action). @@ -431,27 +563,28 @@ The benchmark suite is automated and available separately as [mimalloc-bench](https://github.com/daanx/mimalloc-bench). -## Benchmark Results on 36-core Intel +## Benchmark Results on a 16-core AMD 5950x (Zen3) -Testing on a big Amazon EC2 compute instance -([c5.18xlarge](https://aws.amazon.com/ec2/instance-types/#Compute_Optimized)) -consisting of a 72 processor Intel Xeon at 3GHz -with 144GiB ECC memory, running Ubuntu 18.04.1 with glibc 2.27 and GCC 7.4.0. -The measured allocators are _mimalloc_ (xmi, tag:v1.4.0, page reset enabled) -and its secure build as _smi_, -Google's [_tcmalloc_](https://github.com/gperftools/gperftools) (tc, tag:gperftools-2.7) used in Chrome, -Facebook's [_jemalloc_](https://github.com/jemalloc/jemalloc) (je, tag:5.2.1) by Jason Evans used in Firefox and FreeBSD, -the Intel thread building blocks [allocator](https://github.com/intel/tbb) (tbb, tag:2020), -[rpmalloc](https://github.com/mjansson/rpmalloc) (rp,tag:1.4.0) by Mattias Jansson, -the original scalable [_Hoard_](https://github.com/emeryberger/Hoard) (tag:3.13) allocator by Emery Berger \[1], -the memory compacting [_Mesh_](https://github.com/plasma-umass/Mesh) (git:51222e7) allocator by +Testing on the 16-core AMD 5950x processor at 3.4Ghz (4.9Ghz boost), with +with 32GiB memory at 3600Mhz, running Ubuntu 20.04 with glibc 2.31 and GCC 9.3.0. + +We measure three versions of _mimalloc_: the main version `mi` (tag:v1.7.0), +the new v2.0 beta version as `xmi` (tag:v2.0.0), and the main version in secure mode as `smi` (tag:v1.7.0). + +The other allocators are +Google's [_tcmalloc_](https://github.com/gperftools/gperftools) (`tc`, tag:gperftools-2.8.1) used in Chrome, +Facebook's [_jemalloc_](https://github.com/jemalloc/jemalloc) (`je`, tag:5.2.1) by Jason Evans used in Firefox and FreeBSD, +the Intel thread building blocks [allocator](https://github.com/intel/tbb) (`tbb`, tag:v2020.3), +[rpmalloc](https://github.com/mjansson/rpmalloc) (`rp`,tag:1.4.1) by Mattias Jansson, +the original scalable [_Hoard_](https://github.com/emeryberger/Hoard) (git:d880f72) allocator by Emery Berger \[1], +the memory compacting [_Mesh_](https://github.com/plasma-umass/Mesh) (git:67ff31a) allocator by Bobby Powers _et al_ \[8], -and finally the default system allocator (glibc, 2.27) (based on _PtMalloc2_). +and finally the default system allocator (`glibc`, 2.31) (based on _PtMalloc2_). - - + + -Any benchmarks ending in `N` run on all processors in parallel. +Any benchmarks ending in `N` run on all 32 logical cores in parallel. Results are averaged over 10 runs and reported relative to mimalloc (where 1.2 means it took 1.2× longer to run). The legend also contains the _overall relative score_ between the @@ -466,18 +599,17 @@ _jemalloc_. The _leanN_ program is interesting as a large realistic and concurrent workload of the [Lean](https://github.com/leanprover/lean) -theorem prover compiling its own standard library, and there is a 7% +theorem prover compiling its own standard library, and there is a 13% speedup over _tcmalloc_. This is quite significant: if Lean spends 20% of its time in the -allocator that means that _mimalloc_ is 1.3× faster than _tcmalloc_ +allocator that means that _mimalloc_ is 1.6× faster than _tcmalloc_ here. (This is surprising as that is not measured in a pure allocation benchmark like _alloc-test_. We conjecture that we see this outsized improvement here because _mimalloc_ has better locality in the allocation which improves performance for the *other* computations in a program as well). -The single threaded _redis_ benchmark again show that most allocators do well on such workloads where _tcmalloc_ -did best this time. +The single threaded _redis_ benchmark again show that most allocators do well on such workloads. The _larsonN_ server benchmark by Larson and Krishnan \[2] allocates and frees between threads. They observed this behavior (which they call _bleeding_) in actual server applications, and the benchmark simulates this. @@ -501,14 +633,12 @@ The _alloc-test_, by [OLogN Technologies AG](http://ithare.com/testing-memory-allocators-ptmalloc2-tcmalloc-hoard-jemalloc-while-trying-to-simulate-real-world-loads/), is a very allocation intensive benchmark doing millions of allocations in various size classes. The test is scaled such that when an allocator performs almost identically on _alloc-test1_ as _alloc-testN_ it -means that it scales linearly. Here, _tcmalloc_, and -_Hoard_ seem to scale less well and do more than 10% worse on the multi-core version. Even the best industrial -allocators (_tcmalloc_, _jemalloc_, and _tbb_) are more than 10% slower as _mimalloc_ here. +means that it scales linearly. The _sh6bench_ and _sh8bench_ benchmarks are developed by [MicroQuill](http://www.microquill.com/) as part of SmartHeap. In _sh6bench_ _mimalloc_ does much -better than the others (more than 1.5× faster than _jemalloc_). +better than the others (more than 2.5× faster than _jemalloc_). We cannot explain this well but believe it is caused in part by the "reverse" free-ing pattern in _sh6bench_. The _sh8bench_ is a variation with object migration @@ -518,7 +648,7 @@ The _xmalloc-testN_ benchmark by Lever and Boreham \[5] and Christian Eder, simu some threads only allocate, and others only free -- they observed this pattern in larger server applications. Here we see that the _mimalloc_ technique of having non-contended sharded thread free -lists pays off as it outperforms others by a very large margin. Only _rpmalloc_ and _tbb_ also scale well on this benchmark. +lists pays off as it outperforms others by a very large margin. Only _rpmalloc_, _tbb_, and _glibc_ also scale well on this benchmark. The _cache-scratch_ benchmark by Emery Berger \[1], and introduced with the Hoard allocator to test for _passive-false_ sharing of cache lines. @@ -532,16 +662,20 @@ cache line sharing completely, while _Hoard_ and _glibc_ seem to mitigate the effects. Kukanov and Voss \[7] describe in detail how the design of _tbb_ avoids the false cache line sharing. -## On 24-core AMD Epyc -For completeness, here are the results on a -[r5a.12xlarge](https://aws.amazon.com/ec2/instance-types/#Memory_Optimized) instance -having a 48 processor AMD Epyc 7000 at 2.5GHz with 384GiB of memory. -The results are similar to the Intel results but it is interesting to +## On a 36-core Intel Xeon + +For completeness, here are the results on a big Amazon +[c5.18xlarge](https://aws.amazon.com/ec2/instance-types/#Compute_Optimized) instance +consisting of a 2×18-core Intel Xeon (Cascade Lake) at 3.4GHz (boost 3.5GHz) +with 144GiB ECC memory, running Ubuntu 20.04 with glibc 2.31, GCC 9.3.0, and +Clang 10.0.0. This time, the mimalloc allocators (mi, xmi, and smi) were +compiled with the Clang compiler instead of GCC. +The results are similar to the AMD results but it is interesting to see the differences in the _larsonN_, _mstressN_, and _xmalloc-testN_ benchmarks. - - + + ## Peak Working Set @@ -549,14 +683,59 @@ see the differences in the _larsonN_, _mstressN_, and _xmalloc-testN_ benchmarks The following figure shows the peak working set (rss) of the allocators on the benchmarks (on the c5.18xlarge instance). - - + + Note that the _xmalloc-testN_ memory usage should be disregarded as it allocates more the faster the program runs. Similarly, memory usage of -_mstressN_, _rptestN_ and _sh8bench_ can vary depending on scheduling and -speed. Nevertheless, even though _mimalloc_ is fast on these benchmarks we -believe the memory usage is too high and hope to improve. +_larsonN_, _mstressN_, _rptestN_ and _sh8bench_ can vary depending on scheduling and +speed. Nevertheless, we hope to improve the memory usage on _mstressN_ +and _rptestN_ (just as _cfrac_, _larsonN_ and _sh8bench_ have a small working set which skews the results). + + # References @@ -596,7 +775,6 @@ believe the memory usage is too high and hope to improve. In Proceedings of the 2019 ACM SIGPLAN International Symposium on Memory Management, 122–135. ACM. 2019. --> - # Contributing This project welcomes contributions and suggestions. Most contributions require you to agree to a @@ -606,3 +784,44 @@ the rights to use your contribution. For details, visit https://cla.microsoft.co When you submit a pull request, a CLA-bot will automatically determine whether you need to provide a CLA and decorate the PR appropriately (e.g., label, comment). Simply follow the instructions provided by the bot. You will only need to do this once across all repos using our CLA. + + +# Older Release Notes + +* 2021-11-14, `v1.7.3`, `v2.0.3` (beta): improved WASM support, improved macOS support and performance (including + M1), improved performance for v2 for large objects, Python integration improvements, more standard + installation directories, various small fixes. +* 2021-06-17, `v1.7.2`, `v2.0.2` (beta): support M1, better installation layout on Linux, fix + thread_id on Android, prefer 2-6TiB area for aligned allocation to work better on pre-windows 8, various small fixes. +* 2021-04-06, `v1.7.1`, `v2.0.1` (beta): fix bug in arena allocation for huge pages, improved aslr on large allocations, initial M1 support (still experimental). +* 2021-01-31, `v2.0.0`: beta release 2.0: new slice algorithm for managing internal mimalloc pages. +* 2021-01-31, `v1.7.0`: stable release 1.7: support explicit user provided memory regions, more precise statistics, + improve macOS overriding, initial support for Apple M1, improved DragonFly support, faster memcpy on Windows, various small fixes. + +* 2020-09-24, `v1.6.7`: stable release 1.6: using standard C atomics, passing tsan testing, improved + handling of failing to commit on Windows, add [`mi_process_info`](https://github.com/microsoft/mimalloc/blob/master/include/mimalloc.h#L156) api call. +* 2020-08-06, `v1.6.4`: stable release 1.6: improved error recovery in low-memory situations, + support for IllumOS and Haiku, NUMA support for Vista/XP, improved NUMA detection for AMD Ryzen, ubsan support. +* 2020-05-05, `v1.6.3`: stable release 1.6: improved behavior in out-of-memory situations, improved malloc zones on macOS, + build PIC static libraries by default, add option to abort on out-of-memory, line buffered statistics. +* 2020-04-20, `v1.6.2`: stable release 1.6: fix compilation on Android, MingW, Raspberry, and Conda, + stability fix for Windows 7, fix multiple mimalloc instances in one executable, fix `strnlen` overload, + fix aligned debug padding. +* 2020-02-17, `v1.6.1`: stable release 1.6: minor updates (build with clang-cl, fix alignment issue for small objects). +* 2020-02-09, `v1.6.0`: stable release 1.6: fixed potential memory leak, improved overriding + and thread local support on FreeBSD, NetBSD, DragonFly, and macOSX. New byte-precise + heap block overflow detection in debug mode (besides the double-free detection and free-list + corruption detection). Add `nodiscard` attribute to most allocation functions. + Enable `MIMALLOC_PAGE_RESET` by default. New reclamation strategy for abandoned heap pages + for better memory footprint. +* 2020-02-09, `v1.5.0`: stable release 1.5: improved free performance, small bug fixes. +* 2020-01-22, `v1.4.0`: stable release 1.4: improved performance for delayed OS page reset, +more eager concurrent free, addition of STL allocator, fixed potential memory leak. +* 2020-01-15, `v1.3.0`: stable release 1.3: bug fixes, improved randomness and [stronger +free list encoding](https://github.com/microsoft/mimalloc/blob/783e3377f79ee82af43a0793910a9f2d01ac7863/include/mimalloc-internal.h#L396) in secure mode. + +* 2019-12-22, `v1.2.2`: stable release 1.2: minor updates. +* 2019-11-22, `v1.2.0`: stable release 1.2: bug fixes, improved secure mode (free list corruption checks, double free mitigation). Improved dynamic overriding on Windows. +* 2019-10-07, `v1.1.0`: stable release 1.1. +* 2019-09-01, `v1.0.8`: pre-release 8: more robust windows dynamic overriding, initial huge page support. +* 2019-08-10, `v1.0.6`: pre-release 6: various performance improvements. diff --git a/src/alloc-aligned.c b/src/alloc-aligned.c index ca16d36..1cd809f 100644 --- a/src/alloc-aligned.c +++ b/src/alloc-aligned.c @@ -1,118 +1,218 @@ /* ---------------------------------------------------------------------------- -Copyright (c) 2018, Microsoft Research, Daan Leijen +Copyright (c) 2018-2021, Microsoft Research, Daan Leijen This is free software; you can redistribute it and/or modify it under the terms of the MIT license. A copy of the license can be found in the file "LICENSE" at the root of this distribution. -----------------------------------------------------------------------------*/ #include "mimalloc.h" -#include "mimalloc-internal.h" +#include "mimalloc/internal.h" +#include "mimalloc/prim.h" // mi_prim_get_default_heap -#include // memset, memcpy +#include // memset // ------------------------------------------------------ // Aligned Allocation // ------------------------------------------------------ -static void* mi_heap_malloc_zero_aligned_at(mi_heap_t* const heap, const size_t size, const size_t alignment, const size_t offset, const bool zero) mi_attr_noexcept { - // note: we don't require `size > offset`, we just guarantee that - // the address at offset is aligned regardless of the allocated size. - mi_assert(alignment > 0); - if (mi_unlikely(size > PTRDIFF_MAX)) return NULL; // we don't allocate more than PTRDIFF_MAX (see ) - if (mi_unlikely(alignment==0 || !_mi_is_power_of_two(alignment))) return NULL; // require power-of-two (see ) - const uintptr_t align_mask = alignment-1; // for any x, `(x & align_mask) == (x % alignment)` - - // try if there is a small block available with just the right alignment +// Fallback primitive aligned allocation -- split out for better codegen +static mi_decl_noinline void* mi_heap_malloc_zero_aligned_at_fallback(mi_heap_t* const heap, const size_t size, const size_t alignment, const size_t offset, const bool zero) mi_attr_noexcept +{ + mi_assert_internal(size <= PTRDIFF_MAX); + mi_assert_internal(alignment != 0 && _mi_is_power_of_two(alignment)); + + const uintptr_t align_mask = alignment - 1; // for any x, `(x & align_mask) == (x % alignment)` const size_t padsize = size + MI_PADDING_SIZE; - if (mi_likely(padsize <= MI_SMALL_SIZE_MAX)) { - mi_page_t* page = _mi_heap_get_free_small_page(heap,padsize); - const bool is_aligned = (((uintptr_t)page->free+offset) & align_mask)==0; - if (mi_likely(page->free != NULL && is_aligned)) - { - #if MI_STAT>1 - mi_heap_stat_increase( heap, malloc, size); - #endif - void* p = _mi_page_malloc(heap,page,padsize); // TODO: inline _mi_page_malloc - mi_assert_internal(p != NULL); - mi_assert_internal(((uintptr_t)p + offset) % alignment == 0); - if (zero) _mi_block_zero_init(page,p,size); - return p; - } - } // use regular allocation if it is guaranteed to fit the alignment constraints - if (offset==0 && alignment<=padsize && padsize<=MI_MEDIUM_OBJ_SIZE_MAX && (padsize&align_mask)==0) { + if (offset==0 && alignment<=padsize && padsize<=MI_MAX_ALIGN_GUARANTEE && (padsize&align_mask)==0) { void* p = _mi_heap_malloc_zero(heap, size, zero); mi_assert_internal(p == NULL || ((uintptr_t)p % alignment) == 0); return p; } - - // otherwise over-allocate - void* p = _mi_heap_malloc_zero(heap, size + alignment - 1, zero); - if (p == NULL) return NULL; + + void* p; + size_t oversize; + if mi_unlikely(alignment > MI_ALIGNMENT_MAX) { + // use OS allocation for very large alignment and allocate inside a huge page (dedicated segment with 1 page) + // This can support alignments >= MI_SEGMENT_SIZE by ensuring the object can be aligned at a point in the + // first (and single) page such that the segment info is `MI_SEGMENT_SIZE` bytes before it (so it can be found by aligning the pointer down) + if mi_unlikely(offset != 0) { + // todo: cannot support offset alignment for very large alignments yet + #if MI_DEBUG > 0 + _mi_error_message(EOVERFLOW, "aligned allocation with a very large alignment cannot be used with an alignment offset (size %zu, alignment %zu, offset %zu)\n", size, alignment, offset); + #endif + return NULL; + } + oversize = (size <= MI_SMALL_SIZE_MAX ? MI_SMALL_SIZE_MAX + 1 /* ensure we use generic malloc path */ : size); + p = _mi_heap_malloc_zero_ex(heap, oversize, false, alignment); // the page block size should be large enough to align in the single huge page block + // zero afterwards as only the area from the aligned_p may be committed! + if (p == NULL) return NULL; + } + else { + // otherwise over-allocate + oversize = size + alignment - 1; + p = _mi_heap_malloc_zero(heap, oversize, zero); + if (p == NULL) return NULL; + } // .. and align within the allocation - uintptr_t adjust = alignment - (((uintptr_t)p + offset) & align_mask); - mi_assert_internal(adjust <= alignment); - void* aligned_p = (adjust == alignment ? p : (void*)((uintptr_t)p + adjust)); - if (aligned_p != p) mi_page_set_has_aligned(_mi_ptr_page(p), true); + const uintptr_t poffset = ((uintptr_t)p + offset) & align_mask; + const uintptr_t adjust = (poffset == 0 ? 0 : alignment - poffset); + mi_assert_internal(adjust < alignment); + void* aligned_p = (void*)((uintptr_t)p + adjust); + if (aligned_p != p) { + mi_page_t* page = _mi_ptr_page(p); + mi_page_set_has_aligned(page, true); + _mi_padding_shrink(page, (mi_block_t*)p, adjust + size); + } + // todo: expand padding if overallocated ? + + mi_assert_internal(mi_page_usable_block_size(_mi_ptr_page(p)) >= adjust + size); + mi_assert_internal(p == _mi_page_ptr_unalign(_mi_ptr_segment(aligned_p), _mi_ptr_page(aligned_p), aligned_p)); mi_assert_internal(((uintptr_t)aligned_p + offset) % alignment == 0); - mi_assert_internal( p == _mi_page_ptr_unalign(_mi_ptr_segment(aligned_p),_mi_ptr_page(aligned_p),aligned_p) ); + mi_assert_internal(mi_usable_size(aligned_p)>=size); + mi_assert_internal(mi_usable_size(p) == mi_usable_size(aligned_p)+adjust); + + // now zero the block if needed + if (alignment > MI_ALIGNMENT_MAX) { + // for the tracker, on huge aligned allocations only from the start of the large block is defined + mi_track_mem_undefined(aligned_p, size); + if (zero) { + _mi_memzero_aligned(aligned_p, mi_usable_size(aligned_p)); + } + } + + if (p != aligned_p) { + mi_track_align(p,aligned_p,adjust,mi_usable_size(aligned_p)); + } return aligned_p; } +// Primitive aligned allocation +static void* mi_heap_malloc_zero_aligned_at(mi_heap_t* const heap, const size_t size, const size_t alignment, const size_t offset, const bool zero) mi_attr_noexcept +{ + // note: we don't require `size > offset`, we just guarantee that the address at offset is aligned regardless of the allocated size. + if mi_unlikely(alignment == 0 || !_mi_is_power_of_two(alignment)) { // require power-of-two (see ) + #if MI_DEBUG > 0 + _mi_error_message(EOVERFLOW, "aligned allocation requires the alignment to be a power-of-two (size %zu, alignment %zu)\n", size, alignment); + #endif + return NULL; + } -mi_decl_restrict void* mi_heap_malloc_aligned_at(mi_heap_t* heap, size_t size, size_t alignment, size_t offset) mi_attr_noexcept { + if mi_unlikely(size > PTRDIFF_MAX) { // we don't allocate more than PTRDIFF_MAX (see ) + #if MI_DEBUG > 0 + _mi_error_message(EOVERFLOW, "aligned allocation request is too large (size %zu, alignment %zu)\n", size, alignment); + #endif + return NULL; + } + const uintptr_t align_mask = alignment-1; // for any x, `(x & align_mask) == (x % alignment)` + const size_t padsize = size + MI_PADDING_SIZE; // note: cannot overflow due to earlier size > PTRDIFF_MAX check + + // try first if there happens to be a small block available with just the right alignment + if mi_likely(padsize <= MI_SMALL_SIZE_MAX && alignment <= padsize) { + mi_page_t* page = _mi_heap_get_free_small_page(heap, padsize); + const bool is_aligned = (((uintptr_t)page->free+offset) & align_mask)==0; + if mi_likely(page->free != NULL && is_aligned) + { + #if MI_STAT>1 + mi_heap_stat_increase(heap, malloc, size); + #endif + void* p = _mi_page_malloc(heap, page, padsize, zero); // TODO: inline _mi_page_malloc + mi_assert_internal(p != NULL); + mi_assert_internal(((uintptr_t)p + offset) % alignment == 0); + mi_track_malloc(p,size,zero); + return p; + } + } + // fallback + return mi_heap_malloc_zero_aligned_at_fallback(heap, size, alignment, offset, zero); +} + + +// ------------------------------------------------------ +// Optimized mi_heap_malloc_aligned / mi_malloc_aligned +// ------------------------------------------------------ + +mi_decl_nodiscard mi_decl_restrict void* mi_heap_malloc_aligned_at(mi_heap_t* heap, size_t size, size_t alignment, size_t offset) mi_attr_noexcept { return mi_heap_malloc_zero_aligned_at(heap, size, alignment, offset, false); } -mi_decl_restrict void* mi_heap_malloc_aligned(mi_heap_t* heap, size_t size, size_t alignment) mi_attr_noexcept { - return mi_heap_malloc_aligned_at(heap, size, alignment, 0); +mi_decl_nodiscard mi_decl_restrict void* mi_heap_malloc_aligned(mi_heap_t* heap, size_t size, size_t alignment) mi_attr_noexcept { + if mi_unlikely(alignment == 0 || !_mi_is_power_of_two(alignment)) return NULL; + #if !MI_PADDING + // without padding, any small sized allocation is naturally aligned (see also `_mi_segment_page_start`) + if mi_likely(_mi_is_power_of_two(size) && size >= alignment && size <= MI_SMALL_SIZE_MAX) + #else + // with padding, we can only guarantee this for fixed alignments + if mi_likely((alignment == sizeof(void*) || (alignment == MI_MAX_ALIGN_SIZE && size > (MI_MAX_ALIGN_SIZE/2))) + && size <= MI_SMALL_SIZE_MAX) + #endif + { + // fast path for common alignment and size + return mi_heap_malloc_small(heap, size); + } + else { + return mi_heap_malloc_aligned_at(heap, size, alignment, 0); + } } -mi_decl_restrict void* mi_heap_zalloc_aligned_at(mi_heap_t* heap, size_t size, size_t alignment, size_t offset) mi_attr_noexcept { +// ensure a definition is emitted +#if defined(__cplusplus) +static void* _mi_heap_malloc_aligned = (void*)&mi_heap_malloc_aligned; +#endif + +// ------------------------------------------------------ +// Aligned Allocation +// ------------------------------------------------------ + +mi_decl_nodiscard mi_decl_restrict void* mi_heap_zalloc_aligned_at(mi_heap_t* heap, size_t size, size_t alignment, size_t offset) mi_attr_noexcept { return mi_heap_malloc_zero_aligned_at(heap, size, alignment, offset, true); } -mi_decl_restrict void* mi_heap_zalloc_aligned(mi_heap_t* heap, size_t size, size_t alignment) mi_attr_noexcept { +mi_decl_nodiscard mi_decl_restrict void* mi_heap_zalloc_aligned(mi_heap_t* heap, size_t size, size_t alignment) mi_attr_noexcept { return mi_heap_zalloc_aligned_at(heap, size, alignment, 0); } -mi_decl_restrict void* mi_heap_calloc_aligned_at(mi_heap_t* heap, size_t count, size_t size, size_t alignment, size_t offset) mi_attr_noexcept { +mi_decl_nodiscard mi_decl_restrict void* mi_heap_calloc_aligned_at(mi_heap_t* heap, size_t count, size_t size, size_t alignment, size_t offset) mi_attr_noexcept { size_t total; if (mi_count_size_overflow(count, size, &total)) return NULL; return mi_heap_zalloc_aligned_at(heap, total, alignment, offset); } -mi_decl_restrict void* mi_heap_calloc_aligned(mi_heap_t* heap, size_t count, size_t size, size_t alignment) mi_attr_noexcept { +mi_decl_nodiscard mi_decl_restrict void* mi_heap_calloc_aligned(mi_heap_t* heap, size_t count, size_t size, size_t alignment) mi_attr_noexcept { return mi_heap_calloc_aligned_at(heap,count,size,alignment,0); } -mi_decl_restrict void* mi_malloc_aligned_at(size_t size, size_t alignment, size_t offset) mi_attr_noexcept { - return mi_heap_malloc_aligned_at(mi_get_default_heap(), size, alignment, offset); +mi_decl_nodiscard mi_decl_restrict void* mi_malloc_aligned_at(size_t size, size_t alignment, size_t offset) mi_attr_noexcept { + return mi_heap_malloc_aligned_at(mi_prim_get_default_heap(), size, alignment, offset); } -mi_decl_restrict void* mi_malloc_aligned(size_t size, size_t alignment) mi_attr_noexcept { - return mi_heap_malloc_aligned(mi_get_default_heap(), size, alignment); +mi_decl_nodiscard mi_decl_restrict void* mi_malloc_aligned(size_t size, size_t alignment) mi_attr_noexcept { + return mi_heap_malloc_aligned(mi_prim_get_default_heap(), size, alignment); } -mi_decl_restrict void* mi_zalloc_aligned_at(size_t size, size_t alignment, size_t offset) mi_attr_noexcept { - return mi_heap_zalloc_aligned_at(mi_get_default_heap(), size, alignment, offset); +mi_decl_nodiscard mi_decl_restrict void* mi_zalloc_aligned_at(size_t size, size_t alignment, size_t offset) mi_attr_noexcept { + return mi_heap_zalloc_aligned_at(mi_prim_get_default_heap(), size, alignment, offset); } -mi_decl_restrict void* mi_zalloc_aligned(size_t size, size_t alignment) mi_attr_noexcept { - return mi_heap_zalloc_aligned(mi_get_default_heap(), size, alignment); +mi_decl_nodiscard mi_decl_restrict void* mi_zalloc_aligned(size_t size, size_t alignment) mi_attr_noexcept { + return mi_heap_zalloc_aligned(mi_prim_get_default_heap(), size, alignment); } -mi_decl_restrict void* mi_calloc_aligned_at(size_t count, size_t size, size_t alignment, size_t offset) mi_attr_noexcept { - return mi_heap_calloc_aligned_at(mi_get_default_heap(), count, size, alignment, offset); +mi_decl_nodiscard mi_decl_restrict void* mi_calloc_aligned_at(size_t count, size_t size, size_t alignment, size_t offset) mi_attr_noexcept { + return mi_heap_calloc_aligned_at(mi_prim_get_default_heap(), count, size, alignment, offset); } -mi_decl_restrict void* mi_calloc_aligned(size_t count, size_t size, size_t alignment) mi_attr_noexcept { - return mi_heap_calloc_aligned(mi_get_default_heap(), count, size, alignment); +mi_decl_nodiscard mi_decl_restrict void* mi_calloc_aligned(size_t count, size_t size, size_t alignment) mi_attr_noexcept { + return mi_heap_calloc_aligned(mi_prim_get_default_heap(), count, size, alignment); } +// ------------------------------------------------------ +// Aligned re-allocation +// ------------------------------------------------------ + static void* mi_heap_realloc_zero_aligned_at(mi_heap_t* heap, void* p, size_t newsize, size_t alignment, size_t offset, bool zero) mi_attr_noexcept { mi_assert(alignment > 0); if (alignment <= sizeof(uintptr_t)) return _mi_heap_realloc_zero(heap,p,newsize,zero); @@ -123,21 +223,15 @@ static void* mi_heap_realloc_zero_aligned_at(mi_heap_t* heap, void* p, size_t ne return p; // reallocation still fits, is aligned and not more than 50% waste } else { + // note: we don't zero allocate upfront so we only zero initialize the expanded part void* newp = mi_heap_malloc_aligned_at(heap,newsize,alignment,offset); if (newp != NULL) { if (zero && newsize > size) { - const mi_page_t* page = _mi_ptr_page(newp); - if (page->is_zero) { - // already zero initialized - mi_assert_expensive(mi_mem_is_zero(newp,newsize)); - } - else { - // also set last word in the previous allocation to zero to ensure any padding is zero-initialized - size_t start = (size >= sizeof(intptr_t) ? size - sizeof(intptr_t) : 0); - memset((uint8_t*)newp + start, 0, newsize - start); - } + // also set last word in the previous allocation to zero to ensure any padding is zero-initialized + size_t start = (size >= sizeof(intptr_t) ? size - sizeof(intptr_t) : 0); + _mi_memzero((uint8_t*)newp + start, newsize - start); } - memcpy(newp, p, (newsize > size ? size : newsize)); + _mi_memcpy_aligned(newp, p, (newsize > size ? size : newsize)); mi_free(p); // only free if successful } return newp; @@ -151,55 +245,54 @@ static void* mi_heap_realloc_zero_aligned(mi_heap_t* heap, void* p, size_t newsi return mi_heap_realloc_zero_aligned_at(heap,p,newsize,alignment,offset,zero); } -void* mi_heap_realloc_aligned_at(mi_heap_t* heap, void* p, size_t newsize, size_t alignment, size_t offset) mi_attr_noexcept { +mi_decl_nodiscard void* mi_heap_realloc_aligned_at(mi_heap_t* heap, void* p, size_t newsize, size_t alignment, size_t offset) mi_attr_noexcept { return mi_heap_realloc_zero_aligned_at(heap,p,newsize,alignment,offset,false); } -void* mi_heap_realloc_aligned(mi_heap_t* heap, void* p, size_t newsize, size_t alignment) mi_attr_noexcept { +mi_decl_nodiscard void* mi_heap_realloc_aligned(mi_heap_t* heap, void* p, size_t newsize, size_t alignment) mi_attr_noexcept { return mi_heap_realloc_zero_aligned(heap,p,newsize,alignment,false); } -void* mi_heap_rezalloc_aligned_at(mi_heap_t* heap, void* p, size_t newsize, size_t alignment, size_t offset) mi_attr_noexcept { +mi_decl_nodiscard void* mi_heap_rezalloc_aligned_at(mi_heap_t* heap, void* p, size_t newsize, size_t alignment, size_t offset) mi_attr_noexcept { return mi_heap_realloc_zero_aligned_at(heap, p, newsize, alignment, offset, true); } -void* mi_heap_rezalloc_aligned(mi_heap_t* heap, void* p, size_t newsize, size_t alignment) mi_attr_noexcept { +mi_decl_nodiscard void* mi_heap_rezalloc_aligned(mi_heap_t* heap, void* p, size_t newsize, size_t alignment) mi_attr_noexcept { return mi_heap_realloc_zero_aligned(heap, p, newsize, alignment, true); } -void* mi_heap_recalloc_aligned_at(mi_heap_t* heap, void* p, size_t newcount, size_t size, size_t alignment, size_t offset) mi_attr_noexcept { +mi_decl_nodiscard void* mi_heap_recalloc_aligned_at(mi_heap_t* heap, void* p, size_t newcount, size_t size, size_t alignment, size_t offset) mi_attr_noexcept { size_t total; if (mi_count_size_overflow(newcount, size, &total)) return NULL; return mi_heap_rezalloc_aligned_at(heap, p, total, alignment, offset); } -void* mi_heap_recalloc_aligned(mi_heap_t* heap, void* p, size_t newcount, size_t size, size_t alignment) mi_attr_noexcept { +mi_decl_nodiscard void* mi_heap_recalloc_aligned(mi_heap_t* heap, void* p, size_t newcount, size_t size, size_t alignment) mi_attr_noexcept { size_t total; if (mi_count_size_overflow(newcount, size, &total)) return NULL; return mi_heap_rezalloc_aligned(heap, p, total, alignment); } -void* mi_realloc_aligned_at(void* p, size_t newsize, size_t alignment, size_t offset) mi_attr_noexcept { - return mi_heap_realloc_aligned_at(mi_get_default_heap(), p, newsize, alignment, offset); +mi_decl_nodiscard void* mi_realloc_aligned_at(void* p, size_t newsize, size_t alignment, size_t offset) mi_attr_noexcept { + return mi_heap_realloc_aligned_at(mi_prim_get_default_heap(), p, newsize, alignment, offset); } -void* mi_realloc_aligned(void* p, size_t newsize, size_t alignment) mi_attr_noexcept { - return mi_heap_realloc_aligned(mi_get_default_heap(), p, newsize, alignment); +mi_decl_nodiscard void* mi_realloc_aligned(void* p, size_t newsize, size_t alignment) mi_attr_noexcept { + return mi_heap_realloc_aligned(mi_prim_get_default_heap(), p, newsize, alignment); } -void* mi_rezalloc_aligned_at(void* p, size_t newsize, size_t alignment, size_t offset) mi_attr_noexcept { - return mi_heap_rezalloc_aligned_at(mi_get_default_heap(), p, newsize, alignment, offset); +mi_decl_nodiscard void* mi_rezalloc_aligned_at(void* p, size_t newsize, size_t alignment, size_t offset) mi_attr_noexcept { + return mi_heap_rezalloc_aligned_at(mi_prim_get_default_heap(), p, newsize, alignment, offset); } -void* mi_rezalloc_aligned(void* p, size_t newsize, size_t alignment) mi_attr_noexcept { - return mi_heap_rezalloc_aligned(mi_get_default_heap(), p, newsize, alignment); +mi_decl_nodiscard void* mi_rezalloc_aligned(void* p, size_t newsize, size_t alignment) mi_attr_noexcept { + return mi_heap_rezalloc_aligned(mi_prim_get_default_heap(), p, newsize, alignment); } -void* mi_recalloc_aligned_at(void* p, size_t newcount, size_t size, size_t alignment, size_t offset) mi_attr_noexcept { - return mi_heap_recalloc_aligned_at(mi_get_default_heap(), p, newcount, size, alignment, offset); +mi_decl_nodiscard void* mi_recalloc_aligned_at(void* p, size_t newcount, size_t size, size_t alignment, size_t offset) mi_attr_noexcept { + return mi_heap_recalloc_aligned_at(mi_prim_get_default_heap(), p, newcount, size, alignment, offset); } -void* mi_recalloc_aligned(void* p, size_t newcount, size_t size, size_t alignment) mi_attr_noexcept { - return mi_heap_recalloc_aligned(mi_get_default_heap(), p, newcount, size, alignment); +mi_decl_nodiscard void* mi_recalloc_aligned(void* p, size_t newcount, size_t size, size_t alignment) mi_attr_noexcept { + return mi_heap_recalloc_aligned(mi_prim_get_default_heap(), p, newcount, size, alignment); } - diff --git a/src/alloc-override.c b/src/alloc-override.c new file mode 100644 index 0000000..873065d --- /dev/null +++ b/src/alloc-override.c @@ -0,0 +1,297 @@ +/* ---------------------------------------------------------------------------- +Copyright (c) 2018-2021, Microsoft Research, Daan Leijen +This is free software; you can redistribute it and/or modify it under the +terms of the MIT license. A copy of the license can be found in the file +"LICENSE" at the root of this distribution. +-----------------------------------------------------------------------------*/ + +#if !defined(MI_IN_ALLOC_C) +#error "this file should be included from 'alloc.c' (so aliases can work)" +#endif + +#if defined(MI_MALLOC_OVERRIDE) && defined(_WIN32) && !(defined(MI_SHARED_LIB) && defined(_DLL)) +#error "It is only possible to override "malloc" on Windows when building as a DLL (and linking the C runtime as a DLL)" +#endif + +#if defined(MI_MALLOC_OVERRIDE) && !(defined(_WIN32)) + +#if defined(__APPLE__) +#include +mi_decl_externc void vfree(void* p); +mi_decl_externc size_t malloc_size(const void* p); +mi_decl_externc size_t malloc_good_size(size_t size); +#endif + +// helper definition for C override of C++ new +typedef struct mi_nothrow_s { int _tag; } mi_nothrow_t; + +// ------------------------------------------------------ +// Override system malloc +// ------------------------------------------------------ + +#if (defined(__GNUC__) || defined(__clang__)) && !defined(__APPLE__) && !MI_TRACK_ENABLED + // gcc, clang: use aliasing to alias the exported function to one of our `mi_` functions + #if (defined(__GNUC__) && __GNUC__ >= 9) + #pragma GCC diagnostic ignored "-Wattributes" // or we get warnings that nodiscard is ignored on a forward + #define MI_FORWARD(fun) __attribute__((alias(#fun), used, visibility("default"), copy(fun))); + #else + #define MI_FORWARD(fun) __attribute__((alias(#fun), used, visibility("default"))); + #endif + #define MI_FORWARD1(fun,x) MI_FORWARD(fun) + #define MI_FORWARD2(fun,x,y) MI_FORWARD(fun) + #define MI_FORWARD3(fun,x,y,z) MI_FORWARD(fun) + #define MI_FORWARD0(fun,x) MI_FORWARD(fun) + #define MI_FORWARD02(fun,x,y) MI_FORWARD(fun) +#else + // otherwise use forwarding by calling our `mi_` function + #define MI_FORWARD1(fun,x) { return fun(x); } + #define MI_FORWARD2(fun,x,y) { return fun(x,y); } + #define MI_FORWARD3(fun,x,y,z) { return fun(x,y,z); } + #define MI_FORWARD0(fun,x) { fun(x); } + #define MI_FORWARD02(fun,x,y) { fun(x,y); } +#endif + + +#if defined(__APPLE__) && defined(MI_SHARED_LIB_EXPORT) && defined(MI_OSX_INTERPOSE) + // define MI_OSX_IS_INTERPOSED as we should not provide forwarding definitions for + // functions that are interposed (or the interposing does not work) + #define MI_OSX_IS_INTERPOSED + + mi_decl_externc size_t mi_malloc_size_checked(void *p) { + if (!mi_is_in_heap_region(p)) return 0; + return mi_usable_size(p); + } + + // use interposing so `DYLD_INSERT_LIBRARIES` works without `DYLD_FORCE_FLAT_NAMESPACE=1` + // See: + struct mi_interpose_s { + const void* replacement; + const void* target; + }; + #define MI_INTERPOSE_FUN(oldfun,newfun) { (const void*)&newfun, (const void*)&oldfun } + #define MI_INTERPOSE_MI(fun) MI_INTERPOSE_FUN(fun,mi_##fun) + + __attribute__((used)) static struct mi_interpose_s _mi_interposes[] __attribute__((section("__DATA, __interpose"))) = + { + MI_INTERPOSE_MI(malloc), + MI_INTERPOSE_MI(calloc), + MI_INTERPOSE_MI(realloc), + MI_INTERPOSE_MI(strdup), + MI_INTERPOSE_MI(strndup), + MI_INTERPOSE_MI(realpath), + MI_INTERPOSE_MI(posix_memalign), + MI_INTERPOSE_MI(reallocf), + MI_INTERPOSE_MI(valloc), + MI_INTERPOSE_FUN(malloc_size,mi_malloc_size_checked), + MI_INTERPOSE_MI(malloc_good_size), + #if defined(MAC_OS_X_VERSION_10_15) && MAC_OS_X_VERSION_MAX_ALLOWED >= MAC_OS_X_VERSION_10_15 + MI_INTERPOSE_MI(aligned_alloc), + #endif + #ifdef MI_OSX_ZONE + // we interpose malloc_default_zone in alloc-override-osx.c so we can use mi_free safely + MI_INTERPOSE_MI(free), + MI_INTERPOSE_FUN(vfree,mi_free), + #else + // sometimes code allocates from default zone but deallocates using plain free :-( (like NxHashResizeToCapacity ) + MI_INTERPOSE_FUN(free,mi_cfree), // use safe free that checks if pointers are from us + MI_INTERPOSE_FUN(vfree,mi_cfree), + #endif + }; + + #ifdef __cplusplus + extern "C" { + #endif + void _ZdlPv(void* p); // delete + void _ZdaPv(void* p); // delete[] + void _ZdlPvm(void* p, size_t n); // delete + void _ZdaPvm(void* p, size_t n); // delete[] + void* _Znwm(size_t n); // new + void* _Znam(size_t n); // new[] + void* _ZnwmRKSt9nothrow_t(size_t n, mi_nothrow_t tag); // new nothrow + void* _ZnamRKSt9nothrow_t(size_t n, mi_nothrow_t tag); // new[] nothrow + #ifdef __cplusplus + } + #endif + __attribute__((used)) static struct mi_interpose_s _mi_cxx_interposes[] __attribute__((section("__DATA, __interpose"))) = + { + MI_INTERPOSE_FUN(_ZdlPv,mi_free), + MI_INTERPOSE_FUN(_ZdaPv,mi_free), + MI_INTERPOSE_FUN(_ZdlPvm,mi_free_size), + MI_INTERPOSE_FUN(_ZdaPvm,mi_free_size), + MI_INTERPOSE_FUN(_Znwm,mi_new), + MI_INTERPOSE_FUN(_Znam,mi_new), + MI_INTERPOSE_FUN(_ZnwmRKSt9nothrow_t,mi_new_nothrow), + MI_INTERPOSE_FUN(_ZnamRKSt9nothrow_t,mi_new_nothrow), + }; + +#elif defined(_MSC_VER) + // cannot override malloc unless using a dll. + // we just override new/delete which does work in a static library. +#else + // On all other systems forward to our API + mi_decl_export void* malloc(size_t size) MI_FORWARD1(mi_malloc, size) + mi_decl_export void* calloc(size_t size, size_t n) MI_FORWARD2(mi_calloc, size, n) + mi_decl_export void* realloc(void* p, size_t newsize) MI_FORWARD2(mi_realloc, p, newsize) + mi_decl_export void free(void* p) MI_FORWARD0(mi_free, p) +#endif + +#if (defined(__GNUC__) || defined(__clang__)) && !defined(__APPLE__) +#pragma GCC visibility push(default) +#endif + +// ------------------------------------------------------ +// Override new/delete +// This is not really necessary as they usually call +// malloc/free anyway, but it improves performance. +// ------------------------------------------------------ +#ifdef __cplusplus + // ------------------------------------------------------ + // With a C++ compiler we override the new/delete operators. + // see + // ------------------------------------------------------ + #include + + #ifndef MI_OSX_IS_INTERPOSED + void operator delete(void* p) noexcept MI_FORWARD0(mi_free,p) + void operator delete[](void* p) noexcept MI_FORWARD0(mi_free,p) + + void* operator new(std::size_t n) noexcept(false) MI_FORWARD1(mi_new,n) + void* operator new[](std::size_t n) noexcept(false) MI_FORWARD1(mi_new,n) + + void* operator new (std::size_t n, const std::nothrow_t& tag) noexcept { MI_UNUSED(tag); return mi_new_nothrow(n); } + void* operator new[](std::size_t n, const std::nothrow_t& tag) noexcept { MI_UNUSED(tag); return mi_new_nothrow(n); } + + #if (__cplusplus >= 201402L || _MSC_VER >= 1916) + void operator delete (void* p, std::size_t n) noexcept MI_FORWARD02(mi_free_size,p,n) + void operator delete[](void* p, std::size_t n) noexcept MI_FORWARD02(mi_free_size,p,n) + #endif + #endif + + #if (__cplusplus > 201402L && defined(__cpp_aligned_new)) && (!defined(__GNUC__) || (__GNUC__ > 5)) + void operator delete (void* p, std::align_val_t al) noexcept { mi_free_aligned(p, static_cast(al)); } + void operator delete[](void* p, std::align_val_t al) noexcept { mi_free_aligned(p, static_cast(al)); } + void operator delete (void* p, std::size_t n, std::align_val_t al) noexcept { mi_free_size_aligned(p, n, static_cast(al)); }; + void operator delete[](void* p, std::size_t n, std::align_val_t al) noexcept { mi_free_size_aligned(p, n, static_cast(al)); }; + void operator delete (void* p, std::align_val_t al, const std::nothrow_t&) noexcept { mi_free_aligned(p, static_cast(al)); } + void operator delete[](void* p, std::align_val_t al, const std::nothrow_t&) noexcept { mi_free_aligned(p, static_cast(al)); } + + void* operator new( std::size_t n, std::align_val_t al) noexcept(false) { return mi_new_aligned(n, static_cast(al)); } + void* operator new[]( std::size_t n, std::align_val_t al) noexcept(false) { return mi_new_aligned(n, static_cast(al)); } + void* operator new (std::size_t n, std::align_val_t al, const std::nothrow_t&) noexcept { return mi_new_aligned_nothrow(n, static_cast(al)); } + void* operator new[](std::size_t n, std::align_val_t al, const std::nothrow_t&) noexcept { return mi_new_aligned_nothrow(n, static_cast(al)); } + #endif + +#elif (defined(__GNUC__) || defined(__clang__)) + // ------------------------------------------------------ + // Override by defining the mangled C++ names of the operators (as + // used by GCC and CLang). + // See + // ------------------------------------------------------ + + void _ZdlPv(void* p) MI_FORWARD0(mi_free,p) // delete + void _ZdaPv(void* p) MI_FORWARD0(mi_free,p) // delete[] + void _ZdlPvm(void* p, size_t n) MI_FORWARD02(mi_free_size,p,n) + void _ZdaPvm(void* p, size_t n) MI_FORWARD02(mi_free_size,p,n) + void _ZdlPvSt11align_val_t(void* p, size_t al) { mi_free_aligned(p,al); } + void _ZdaPvSt11align_val_t(void* p, size_t al) { mi_free_aligned(p,al); } + void _ZdlPvmSt11align_val_t(void* p, size_t n, size_t al) { mi_free_size_aligned(p,n,al); } + void _ZdaPvmSt11align_val_t(void* p, size_t n, size_t al) { mi_free_size_aligned(p,n,al); } + + #if (MI_INTPTR_SIZE==8) + void* _Znwm(size_t n) MI_FORWARD1(mi_new,n) // new 64-bit + void* _Znam(size_t n) MI_FORWARD1(mi_new,n) // new[] 64-bit + void* _ZnwmRKSt9nothrow_t(size_t n, mi_nothrow_t tag) { MI_UNUSED(tag); return mi_new_nothrow(n); } + void* _ZnamRKSt9nothrow_t(size_t n, mi_nothrow_t tag) { MI_UNUSED(tag); return mi_new_nothrow(n); } + void* _ZnwmSt11align_val_t(size_t n, size_t al) MI_FORWARD2(mi_new_aligned, n, al) + void* _ZnamSt11align_val_t(size_t n, size_t al) MI_FORWARD2(mi_new_aligned, n, al) + void* _ZnwmSt11align_val_tRKSt9nothrow_t(size_t n, size_t al, mi_nothrow_t tag) { MI_UNUSED(tag); return mi_new_aligned_nothrow(n,al); } + void* _ZnamSt11align_val_tRKSt9nothrow_t(size_t n, size_t al, mi_nothrow_t tag) { MI_UNUSED(tag); return mi_new_aligned_nothrow(n,al); } + #elif (MI_INTPTR_SIZE==4) + void* _Znwj(size_t n) MI_FORWARD1(mi_new,n) // new 64-bit + void* _Znaj(size_t n) MI_FORWARD1(mi_new,n) // new[] 64-bit + void* _ZnwjRKSt9nothrow_t(size_t n, mi_nothrow_t tag) { MI_UNUSED(tag); return mi_new_nothrow(n); } + void* _ZnajRKSt9nothrow_t(size_t n, mi_nothrow_t tag) { MI_UNUSED(tag); return mi_new_nothrow(n); } + void* _ZnwjSt11align_val_t(size_t n, size_t al) MI_FORWARD2(mi_new_aligned, n, al) + void* _ZnajSt11align_val_t(size_t n, size_t al) MI_FORWARD2(mi_new_aligned, n, al) + void* _ZnwjSt11align_val_tRKSt9nothrow_t(size_t n, size_t al, mi_nothrow_t tag) { MI_UNUSED(tag); return mi_new_aligned_nothrow(n,al); } + void* _ZnajSt11align_val_tRKSt9nothrow_t(size_t n, size_t al, mi_nothrow_t tag) { MI_UNUSED(tag); return mi_new_aligned_nothrow(n,al); } + #else + #error "define overloads for new/delete for this platform (just for performance, can be skipped)" + #endif +#endif // __cplusplus + +// ------------------------------------------------------ +// Further Posix & Unix functions definitions +// ------------------------------------------------------ + +#ifdef __cplusplus +extern "C" { +#endif + +#ifndef MI_OSX_IS_INTERPOSED + // Forward Posix/Unix calls as well + void* reallocf(void* p, size_t newsize) MI_FORWARD2(mi_reallocf,p,newsize) + size_t malloc_size(const void* p) MI_FORWARD1(mi_usable_size,p) + #if !defined(__ANDROID__) && !defined(__FreeBSD__) + size_t malloc_usable_size(void *p) MI_FORWARD1(mi_usable_size,p) + #else + size_t malloc_usable_size(const void *p) MI_FORWARD1(mi_usable_size,p) + #endif + + // No forwarding here due to aliasing/name mangling issues + void* valloc(size_t size) { return mi_valloc(size); } + void vfree(void* p) { mi_free(p); } + size_t malloc_good_size(size_t size) { return mi_malloc_good_size(size); } + int posix_memalign(void** p, size_t alignment, size_t size) { return mi_posix_memalign(p, alignment, size); } + + // `aligned_alloc` is only available when __USE_ISOC11 is defined. + // Note: it seems __USE_ISOC11 is not defined in musl (and perhaps other libc's) so we only check + // for it if using glibc. + // Note: Conda has a custom glibc where `aligned_alloc` is declared `static inline` and we cannot + // override it, but both _ISOC11_SOURCE and __USE_ISOC11 are undefined in Conda GCC7 or GCC9. + // Fortunately, in the case where `aligned_alloc` is declared as `static inline` it + // uses internally `memalign`, `posix_memalign`, or `_aligned_malloc` so we can avoid overriding it ourselves. + #if !defined(__GLIBC__) || __USE_ISOC11 + void* aligned_alloc(size_t alignment, size_t size) { return mi_aligned_alloc(alignment, size); } + #endif +#endif + +// no forwarding here due to aliasing/name mangling issues +void cfree(void* p) { mi_free(p); } +void* pvalloc(size_t size) { return mi_pvalloc(size); } +void* reallocarray(void* p, size_t count, size_t size) { return mi_reallocarray(p, count, size); } +int reallocarr(void* p, size_t count, size_t size) { return mi_reallocarr(p, count, size); } +void* memalign(size_t alignment, size_t size) { return mi_memalign(alignment, size); } +void* _aligned_malloc(size_t alignment, size_t size) { return mi_aligned_alloc(alignment, size); } + +#if defined(__wasi__) + // forward __libc interface (see PR #667) + void* __libc_malloc(size_t size) MI_FORWARD1(mi_malloc, size) + void* __libc_calloc(size_t count, size_t size) MI_FORWARD2(mi_calloc, count, size) + void* __libc_realloc(void* p, size_t size) MI_FORWARD2(mi_realloc, p, size) + void __libc_free(void* p) MI_FORWARD0(mi_free, p) + void* __libc_memalign(size_t alignment, size_t size) { return mi_memalign(alignment, size); } + +#elif defined(__GLIBC__) && defined(__linux__) + // forward __libc interface (needed for glibc-based Linux distributions) + void* __libc_malloc(size_t size) MI_FORWARD1(mi_malloc,size) + void* __libc_calloc(size_t count, size_t size) MI_FORWARD2(mi_calloc,count,size) + void* __libc_realloc(void* p, size_t size) MI_FORWARD2(mi_realloc,p,size) + void __libc_free(void* p) MI_FORWARD0(mi_free,p) + void __libc_cfree(void* p) MI_FORWARD0(mi_free,p) + + void* __libc_valloc(size_t size) { return mi_valloc(size); } + void* __libc_pvalloc(size_t size) { return mi_pvalloc(size); } + void* __libc_memalign(size_t alignment, size_t size) { return mi_memalign(alignment,size); } + int __posix_memalign(void** p, size_t alignment, size_t size) { return mi_posix_memalign(p,alignment,size); } +#endif + +#ifdef __cplusplus +} +#endif + +#if (defined(__GNUC__) || defined(__clang__)) && !defined(__APPLE__) +#pragma GCC visibility pop +#endif + +#endif // MI_MALLOC_OVERRIDE && !_WIN32 diff --git a/src/alloc-posix.c b/src/alloc-posix.c index 1ba1509..225752f 100644 --- a/src/alloc-posix.c +++ b/src/alloc-posix.c @@ -1,5 +1,5 @@ /* ---------------------------------------------------------------------------- -Copyright (c) 2018,2019, Microsoft Research, Daan Leijen +Copyright (c) 2018-2021, Microsoft Research, Daan Leijen This is free software; you can redistribute it and/or modify it under the terms of the MIT license. A copy of the license can be found in the file "LICENSE" at the root of this distribution. @@ -10,14 +10,14 @@ terms of the MIT license. A copy of the license can be found in the file // for convenience and used when overriding these functions. // ------------------------------------------------------------------------ #include "mimalloc.h" -#include "mimalloc-internal.h" +#include "mimalloc/internal.h" // ------------------------------------------------------ // Posix & Unix functions definitions // ------------------------------------------------------ #include -#include // memcpy +#include // memset #include // getenv #ifdef _MSC_VER @@ -32,14 +32,20 @@ terms of the MIT license. A copy of the license can be found in the file #endif -size_t mi_malloc_size(const void* p) mi_attr_noexcept { +mi_decl_nodiscard size_t mi_malloc_size(const void* p) mi_attr_noexcept { + // if (!mi_is_in_heap_region(p)) return 0; return mi_usable_size(p); } -size_t mi_malloc_usable_size(const void *p) mi_attr_noexcept { +mi_decl_nodiscard size_t mi_malloc_usable_size(const void *p) mi_attr_noexcept { + // if (!mi_is_in_heap_region(p)) return 0; return mi_usable_size(p); } +mi_decl_nodiscard size_t mi_malloc_good_size(size_t size) mi_attr_noexcept { + return mi_good_size(size); +} + void mi_cfree(void* p) mi_attr_noexcept { if (mi_is_in_heap_region(p)) { mi_free(p); @@ -50,65 +56,87 @@ int mi_posix_memalign(void** p, size_t alignment, size_t size) mi_attr_noexcept // Note: The spec dictates we should not modify `*p` on an error. (issue#27) // if (p == NULL) return EINVAL; - if (alignment % sizeof(void*) != 0) return EINVAL; // natural alignment - if (!_mi_is_power_of_two(alignment)) return EINVAL; // not a power of 2 - void* q = (mi_malloc_satisfies_alignment(alignment, size) ? mi_malloc(size) : mi_malloc_aligned(size, alignment)); + if ((alignment % sizeof(void*)) != 0) return EINVAL; // natural alignment + // it is also required that alignment is a power of 2 and > 0; this is checked in `mi_malloc_aligned` + if (alignment==0 || !_mi_is_power_of_two(alignment)) return EINVAL; // not a power of 2 + void* q = mi_malloc_aligned(size, alignment); if (q==NULL && size != 0) return ENOMEM; mi_assert_internal(((uintptr_t)q % alignment) == 0); *p = q; return 0; } -mi_decl_restrict void* mi_memalign(size_t alignment, size_t size) mi_attr_noexcept { - void* p = (mi_malloc_satisfies_alignment(alignment,size) ? mi_malloc(size) : mi_malloc_aligned(size, alignment)); +mi_decl_nodiscard mi_decl_restrict void* mi_memalign(size_t alignment, size_t size) mi_attr_noexcept { + void* p = mi_malloc_aligned(size, alignment); mi_assert_internal(((uintptr_t)p % alignment) == 0); return p; } -mi_decl_restrict void* mi_valloc(size_t size) mi_attr_noexcept { +mi_decl_nodiscard mi_decl_restrict void* mi_valloc(size_t size) mi_attr_noexcept { return mi_memalign( _mi_os_page_size(), size ); } -mi_decl_restrict void* mi_pvalloc(size_t size) mi_attr_noexcept { +mi_decl_nodiscard mi_decl_restrict void* mi_pvalloc(size_t size) mi_attr_noexcept { size_t psize = _mi_os_page_size(); if (size >= SIZE_MAX - psize) return NULL; // overflow size_t asize = _mi_align_up(size, psize); return mi_malloc_aligned(asize, psize); } -mi_decl_restrict void* mi_aligned_alloc(size_t alignment, size_t size) mi_attr_noexcept { - if (alignment==0 || !_mi_is_power_of_two(alignment)) return NULL; - if ((size&(alignment-1)) != 0) return NULL; // C11 requires integral multiple, see - void* p = (mi_malloc_satisfies_alignment(alignment, size) ? mi_malloc(size) : mi_malloc_aligned(size, alignment)); +mi_decl_nodiscard mi_decl_restrict void* mi_aligned_alloc(size_t alignment, size_t size) mi_attr_noexcept { + // C11 requires the size to be an integral multiple of the alignment, see . + // unfortunately, it turns out quite some programs pass a size that is not an integral multiple so skip this check.. + /* if mi_unlikely((size & (alignment - 1)) != 0) { // C11 requires alignment>0 && integral multiple, see + #if MI_DEBUG > 0 + _mi_error_message(EOVERFLOW, "(mi_)aligned_alloc requires the size to be an integral multiple of the alignment (size %zu, alignment %zu)\n", size, alignment); + #endif + return NULL; + } + */ + // C11 also requires alignment to be a power-of-two (and > 0) which is checked in mi_malloc_aligned + void* p = mi_malloc_aligned(size, alignment); mi_assert_internal(((uintptr_t)p % alignment) == 0); return p; } -void* mi_reallocarray( void* p, size_t count, size_t size ) mi_attr_noexcept { // BSD +mi_decl_nodiscard void* mi_reallocarray( void* p, size_t count, size_t size ) mi_attr_noexcept { // BSD void* newp = mi_reallocn(p,count,size); - if (newp==NULL) errno = ENOMEM; + if (newp==NULL) { errno = ENOMEM; } return newp; } +mi_decl_nodiscard int mi_reallocarr( void* p, size_t count, size_t size ) mi_attr_noexcept { // NetBSD + mi_assert(p != NULL); + if (p == NULL) { + errno = EINVAL; + return EINVAL; + } + void** op = (void**)p; + void* newp = mi_reallocarray(*op, count, size); + if mi_unlikely(newp == NULL) { return errno; } + *op = newp; + return 0; +} + void* mi__expand(void* p, size_t newsize) mi_attr_noexcept { // Microsoft void* res = mi_expand(p, newsize); - if (res == NULL) errno = ENOMEM; + if (res == NULL) { errno = ENOMEM; } return res; } -mi_decl_restrict unsigned short* mi_wcsdup(const unsigned short* s) mi_attr_noexcept { +mi_decl_nodiscard mi_decl_restrict unsigned short* mi_wcsdup(const unsigned short* s) mi_attr_noexcept { if (s==NULL) return NULL; size_t len; for(len = 0; s[len] != 0; len++) { } size_t size = (len+1)*sizeof(unsigned short); unsigned short* p = (unsigned short*)mi_malloc(size); if (p != NULL) { - memcpy(p,s,size); + _mi_memcpy(p,s,size); } return p; } -mi_decl_restrict unsigned char* mi_mbsdup(const unsigned char* s) mi_attr_noexcept { +mi_decl_nodiscard mi_decl_restrict unsigned char* mi_mbsdup(const unsigned char* s) mi_attr_noexcept { return (unsigned char*)mi_strdup((const char*)s); } @@ -122,7 +150,7 @@ int mi_dupenv_s(char** buf, size_t* size, const char* name) mi_attr_noexcept { else { *buf = mi_strdup(p); if (*buf==NULL) return ENOMEM; - if (size != NULL) *size = strlen(p); + if (size != NULL) *size = _mi_strlen(p); } return 0; } @@ -148,10 +176,10 @@ int mi_wdupenv_s(unsigned short** buf, size_t* size, const unsigned short* name) #endif } -void* mi_aligned_offset_recalloc(void* p, size_t newcount, size_t size, size_t alignment, size_t offset) mi_attr_noexcept { // Microsoft +mi_decl_nodiscard void* mi_aligned_offset_recalloc(void* p, size_t newcount, size_t size, size_t alignment, size_t offset) mi_attr_noexcept { // Microsoft return mi_recalloc_aligned_at(p, newcount, size, alignment, offset); } -void* mi_aligned_recalloc(void* p, size_t newcount, size_t size, size_t alignment) mi_attr_noexcept { // Microsoft +mi_decl_nodiscard void* mi_aligned_recalloc(void* p, size_t newcount, size_t size, size_t alignment) mi_attr_noexcept { // Microsoft return mi_recalloc_aligned(p, newcount, size, alignment); } diff --git a/src/alloc.c b/src/alloc.c index f31d160..ffc1747 100644 --- a/src/alloc.c +++ b/src/alloc.c @@ -1,19 +1,24 @@ /* ---------------------------------------------------------------------------- -Copyright (c) 2018, Microsoft Research, Daan Leijen +Copyright (c) 2018-2022, Microsoft Research, Daan Leijen This is free software; you can redistribute it and/or modify it under the terms of the MIT license. A copy of the license can be found in the file "LICENSE" at the root of this distribution. -----------------------------------------------------------------------------*/ -#include "AuroraEnvironment.h" +#ifndef _DEFAULT_SOURCE +#define _DEFAULT_SOURCE // for realpath() on Linux +#endif #include "mimalloc.h" -#include "mimalloc-internal.h" -#include "mimalloc-atomic.h" +#include "mimalloc/internal.h" +#include "mimalloc/atomic.h" +#include "mimalloc/prim.h" // _mi_prim_thread_id() +#include // memset, strlen (for mi_strdup) +#include // malloc, abort -#include // memset, memcpy, strlen -#include // malloc, exit - +#define MI_IN_ALLOC_C +#include "alloc-override.c" +#undef MI_IN_ALLOC_C // ------------------------------------------------------ // Allocation @@ -21,134 +26,167 @@ terms of the MIT license. A copy of the license can be found in the file // Fast allocation in a page: just pop from the free list. // Fall back to generic allocation only if the list is empty. -extern inline void* _mi_page_malloc(mi_heap_t* heap, mi_page_t* page, size_t size) mi_attr_noexcept { +extern inline void* _mi_page_malloc(mi_heap_t* heap, mi_page_t* page, size_t size, bool zero) mi_attr_noexcept { mi_assert_internal(page->xblock_size==0||mi_page_block_size(page) >= size); - mi_block_t* block = page->free; - if (mi_unlikely(block == NULL)) { - return _mi_malloc_generic(heap, size); + mi_block_t* const block = page->free; + if mi_unlikely(block == NULL) { + return _mi_malloc_generic(heap, size, zero, 0); } mi_assert_internal(block != NULL && _mi_ptr_page(block) == page); // pop from the free list - page->free = mi_block_next(page, block); page->used++; + page->free = mi_block_next(page, block); mi_assert_internal(page->free == NULL || _mi_ptr_page(page->free) == page); -#if (MI_DEBUG>0) - if (!page->is_zero) { memset(block, MI_DEBUG_UNINIT, size); } + #if MI_DEBUG>3 + if (page->free_is_zero) { + mi_assert_expensive(mi_mem_is_zero(block+1,size - sizeof(*block))); + } + #endif + + // allow use of the block internally + // note: when tracking we need to avoid ever touching the MI_PADDING since + // that is tracked by valgrind etc. as non-accessible (through the red-zone, see `mimalloc/track.h`) + mi_track_mem_undefined(block, mi_page_usable_block_size(page)); + + // zero the block? note: we need to zero the full block size (issue #63) + if mi_unlikely(zero) { + mi_assert_internal(page->xblock_size != 0); // do not call with zero'ing for huge blocks (see _mi_malloc_generic) + mi_assert_internal(page->xblock_size >= MI_PADDING_SIZE); + if (page->free_is_zero) { + block->next = 0; + mi_track_mem_defined(block, page->xblock_size - MI_PADDING_SIZE); + } + else { + _mi_memzero_aligned(block, page->xblock_size - MI_PADDING_SIZE); + } + } + +#if (MI_DEBUG>0) && !MI_TRACK_ENABLED && !MI_TSAN + if (!zero && !mi_page_is_huge(page)) { + memset(block, MI_DEBUG_UNINIT, mi_page_usable_block_size(page)); + } #elif (MI_SECURE!=0) - block->next = 0; // don't leak internal data + if (!zero) { block->next = 0; } // don't leak internal data #endif -#if (MI_STAT>1) + +#if (MI_STAT>0) const size_t bsize = mi_page_usable_block_size(page); - if (bsize <= MI_LARGE_OBJ_SIZE_MAX) { + if (bsize <= MI_MEDIUM_OBJ_SIZE_MAX) { + mi_heap_stat_increase(heap, normal, bsize); + mi_heap_stat_counter_increase(heap, normal_count, 1); +#if (MI_STAT>1) const size_t bin = _mi_bin(bsize); - mi_heap_stat_increase(heap, normal[bin], 1); + mi_heap_stat_increase(heap, normal_bins[bin], 1); +#endif } #endif -#if (MI_PADDING > 0) && defined(MI_ENCODE_FREELIST) + +#if MI_PADDING // && !MI_TRACK_ENABLED mi_padding_t* const padding = (mi_padding_t*)((uint8_t*)block + mi_page_usable_block_size(page)); ptrdiff_t delta = ((uint8_t*)padding - (uint8_t*)block - (size - MI_PADDING_SIZE)); + #if (MI_DEBUG>=2) mi_assert_internal(delta >= 0 && mi_page_usable_block_size(page) >= (size - MI_PADDING_SIZE + delta)); + #endif + mi_track_mem_defined(padding,sizeof(mi_padding_t)); // note: re-enable since mi_page_usable_block_size may set noaccess padding->canary = (uint32_t)(mi_ptr_encode(page,block,page->keys)); padding->delta = (uint32_t)(delta); - uint8_t* fill = (uint8_t*)padding - delta; - const size_t maxpad = (delta > MI_MAX_ALIGN_SIZE ? MI_MAX_ALIGN_SIZE : delta); // set at most N initial padding bytes - for (size_t i = 0; i < maxpad; i++) { fill[i] = MI_DEBUG_PADDING; } + #if MI_PADDING_CHECK + if (!mi_page_is_huge(page)) { + uint8_t* fill = (uint8_t*)padding - delta; + const size_t maxpad = (delta > MI_MAX_ALIGN_SIZE ? MI_MAX_ALIGN_SIZE : delta); // set at most N initial padding bytes + for (size_t i = 0; i < maxpad; i++) { fill[i] = MI_DEBUG_PADDING; } + } + #endif #endif + return block; } -// allocate a small block -extern inline mi_decl_restrict void* mi_heap_malloc_small(mi_heap_t* heap, size_t size) mi_attr_noexcept { - mi_assert(heap!=NULL); - mi_assert(heap->thread_id == 0 || heap->thread_id == _mi_thread_id()); // heaps are thread local +static inline mi_decl_restrict void* mi_heap_malloc_small_zero(mi_heap_t* heap, size_t size, bool zero) mi_attr_noexcept { + mi_assert(heap != NULL); + #if MI_DEBUG + const uintptr_t tid = _mi_thread_id(); + mi_assert(heap->thread_id == 0 || heap->thread_id == tid); // heaps are thread local + #endif mi_assert(size <= MI_SMALL_SIZE_MAX); #if (MI_PADDING) - if (size == 0) { - size = sizeof(void*); - } + if (size == 0) { size = sizeof(void*); } #endif - mi_page_t* page = _mi_heap_get_free_small_page(heap,size + MI_PADDING_SIZE); - void* p = _mi_page_malloc(heap, page, size + MI_PADDING_SIZE); - mi_assert_internal(p==NULL || mi_usable_size(p) >= size); + mi_page_t* page = _mi_heap_get_free_small_page(heap, size + MI_PADDING_SIZE); + void* const p = _mi_page_malloc(heap, page, size + MI_PADDING_SIZE, zero); + mi_track_malloc(p,size,zero); #if MI_STAT>1 if (p != NULL) { - if (!mi_heap_is_initialized(heap)) { heap = mi_get_default_heap(); } + if (!mi_heap_is_initialized(heap)) { heap = mi_prim_get_default_heap(); } mi_heap_stat_increase(heap, malloc, mi_usable_size(p)); } #endif + #if MI_DEBUG>3 + if (p != NULL && zero) { + mi_assert_expensive(mi_mem_is_zero(p, size)); + } + #endif return p; } -extern inline mi_decl_restrict void* mi_malloc_small(size_t size) mi_attr_noexcept { - return mi_heap_malloc_small(mi_get_default_heap(), size); +// allocate a small block +mi_decl_nodiscard extern inline mi_decl_restrict void* mi_heap_malloc_small(mi_heap_t* heap, size_t size) mi_attr_noexcept { + return mi_heap_malloc_small_zero(heap, size, false); +} + +mi_decl_nodiscard extern inline mi_decl_restrict void* mi_malloc_small(size_t size) mi_attr_noexcept { + return mi_heap_malloc_small(mi_prim_get_default_heap(), size); } // The main allocation function -extern inline mi_decl_restrict void* mi_heap_malloc(mi_heap_t* heap, size_t size) mi_attr_noexcept { - if (mi_likely(size <= MI_SMALL_SIZE_MAX)) { - return mi_heap_malloc_small(heap, size); +extern inline void* _mi_heap_malloc_zero_ex(mi_heap_t* heap, size_t size, bool zero, size_t huge_alignment) mi_attr_noexcept { + if mi_likely(size <= MI_SMALL_SIZE_MAX) { + mi_assert_internal(huge_alignment == 0); + return mi_heap_malloc_small_zero(heap, size, zero); } else { mi_assert(heap!=NULL); - mi_assert(heap->thread_id == 0 || heap->thread_id == _mi_thread_id()); // heaps are thread local - void* const p = _mi_malloc_generic(heap, size + MI_PADDING_SIZE); // note: size can overflow but it is detected in malloc_generic - mi_assert_internal(p == NULL || mi_usable_size(p) >= size); + mi_assert(heap->thread_id == 0 || heap->thread_id == _mi_thread_id()); // heaps are thread local + void* const p = _mi_malloc_generic(heap, size + MI_PADDING_SIZE, zero, huge_alignment); // note: size can overflow but it is detected in malloc_generic + mi_track_malloc(p,size,zero); #if MI_STAT>1 if (p != NULL) { - if (!mi_heap_is_initialized(heap)) { heap = mi_get_default_heap(); } + if (!mi_heap_is_initialized(heap)) { heap = mi_prim_get_default_heap(); } mi_heap_stat_increase(heap, malloc, mi_usable_size(p)); } #endif + #if MI_DEBUG>3 + if (p != NULL && zero) { + mi_assert_expensive(mi_mem_is_zero(p, size)); + } + #endif return p; } } -extern inline mi_decl_restrict void* mi_malloc(size_t size) mi_attr_noexcept { - return mi_heap_malloc(mi_get_default_heap(), size); +extern inline void* _mi_heap_malloc_zero(mi_heap_t* heap, size_t size, bool zero) mi_attr_noexcept { + return _mi_heap_malloc_zero_ex(heap, size, zero, 0); } +mi_decl_nodiscard extern inline mi_decl_restrict void* mi_heap_malloc(mi_heap_t* heap, size_t size) mi_attr_noexcept { + return _mi_heap_malloc_zero(heap, size, false); +} -void _mi_block_zero_init(const mi_page_t* page, void* p, size_t size) { - // note: we need to initialize the whole usable block size to zero, not just the requested size, - // or the recalloc/rezalloc functions cannot safely expand in place (see issue #63) - UNUSED(size); - mi_assert_internal(p != NULL); - mi_assert_internal(mi_usable_size(p) >= size); // size can be zero - mi_assert_internal(_mi_ptr_page(p)==page); - if (page->is_zero && size > sizeof(mi_block_t)) { - // already zero initialized memory - ((mi_block_t*)p)->next = 0; // clear the free list pointer - mi_assert_expensive(mi_mem_is_zero(p, mi_usable_size(p))); - } - else { - // otherwise memset - memset(p, 0, mi_usable_size(p)); - } +mi_decl_nodiscard extern inline mi_decl_restrict void* mi_malloc(size_t size) mi_attr_noexcept { + return mi_heap_malloc(mi_prim_get_default_heap(), size); } // zero initialized small block -mi_decl_restrict void* mi_zalloc_small(size_t size) mi_attr_noexcept { - void* p = mi_malloc_small(size); - if (p != NULL) { - _mi_block_zero_init(_mi_ptr_page(p), p, size); // todo: can we avoid getting the page again? - } - return p; +mi_decl_nodiscard mi_decl_restrict void* mi_zalloc_small(size_t size) mi_attr_noexcept { + return mi_heap_malloc_small_zero(mi_prim_get_default_heap(), size, true); } -void* _mi_heap_malloc_zero(mi_heap_t* heap, size_t size, bool zero) { - void* p = mi_heap_malloc(heap,size); - if (zero && p != NULL) { - _mi_block_zero_init(_mi_ptr_page(p),p,size); // todo: can we avoid getting the page again? - } - return p; -} - -extern inline mi_decl_restrict void* mi_heap_zalloc(mi_heap_t* heap, size_t size) mi_attr_noexcept { +mi_decl_nodiscard extern inline mi_decl_restrict void* mi_heap_zalloc(mi_heap_t* heap, size_t size) mi_attr_noexcept { return _mi_heap_malloc_zero(heap, size, true); } -mi_decl_restrict void* mi_zalloc(size_t size) mi_attr_noexcept { - return mi_heap_zalloc(mi_get_default_heap(),size); +mi_decl_nodiscard mi_decl_restrict void* mi_zalloc(size_t size) mi_attr_noexcept { + return mi_heap_zalloc(mi_prim_get_default_heap(),size); } @@ -180,21 +218,24 @@ static mi_decl_noinline bool mi_check_is_double_freex(const mi_page_t* page, con return false; } +#define mi_track_page(page,access) { size_t psize; void* pstart = _mi_page_start(_mi_page_segment(page),page,&psize); mi_track_mem_##access( pstart, psize); } + static inline bool mi_check_is_double_free(const mi_page_t* page, const mi_block_t* block) { + bool is_double_free = false; mi_block_t* n = mi_block_nextx(page, block, page->keys); // pretend it is freed, and get the decoded first field if (((uintptr_t)n & (MI_INTPTR_SIZE-1))==0 && // quick check: aligned pointer? (n==NULL || mi_is_in_same_page(block, n))) // quick check: in same page or NULL? { // Suspicous: decoded value a in block is in the same page (or NULL) -- maybe a double free? // (continue in separate function to improve code generation) - return mi_check_is_double_freex(page, block); + is_double_free = mi_check_is_double_freex(page, block); } - return false; + return is_double_free; } #else static inline bool mi_check_is_double_free(const mi_page_t* page, const mi_block_t* block) { - UNUSED(page); - UNUSED(block); + MI_UNUSED(page); + MI_UNUSED(block); return false; } #endif @@ -203,12 +244,19 @@ static inline bool mi_check_is_double_free(const mi_page_t* page, const mi_block // Check for heap block overflow by setting up padding at the end of the block // --------------------------------------------------------------------------- -#if (MI_PADDING>0) && defined(MI_ENCODE_FREELIST) +#if MI_PADDING // && !MI_TRACK_ENABLED static bool mi_page_decode_padding(const mi_page_t* page, const mi_block_t* block, size_t* delta, size_t* bsize) { *bsize = mi_page_usable_block_size(page); const mi_padding_t* const padding = (mi_padding_t*)((uint8_t*)block + *bsize); + mi_track_mem_defined(padding,sizeof(mi_padding_t)); *delta = padding->delta; - return ((uint32_t)mi_ptr_encode(page,block,page->keys) == padding->canary && *delta <= *bsize); + uint32_t canary = padding->canary; + uintptr_t keys[2]; + keys[0] = page->keys[0]; + keys[1] = page->keys[1]; + bool ok = ((uint32_t)mi_ptr_encode(page,block,keys) == canary && *delta <= *bsize); + mi_track_mem_noaccess(padding,sizeof(mi_padding_t)); + return ok; } // Return the exact usable size of a block. @@ -220,38 +268,11 @@ static size_t mi_page_usable_size_of(const mi_page_t* page, const mi_block_t* bl return (ok ? bsize - delta : 0); } -static bool mi_verify_padding(const mi_page_t* page, const mi_block_t* block, size_t* size, size_t* wrong) { - size_t bsize; - size_t delta; - bool ok = mi_page_decode_padding(page, block, &delta, &bsize); - *size = *wrong = bsize; - if (!ok) return false; - mi_assert_internal(bsize >= delta); - *size = bsize - delta; - uint8_t* fill = (uint8_t*)block + bsize - delta; - const size_t maxpad = (delta > MI_MAX_ALIGN_SIZE ? MI_MAX_ALIGN_SIZE : delta); // check at most the first N padding bytes - for (size_t i = 0; i < maxpad; i++) { - if (fill[i] != MI_DEBUG_PADDING) { - *wrong = bsize - delta + i; - return false; - } - } - return true; -} - -static void mi_check_padding(const mi_page_t* page, const mi_block_t* block) { - size_t size; - size_t wrong; - if (!mi_verify_padding(page,block,&size,&wrong)) { - _mi_error_message(EFAULT, "buffer overflow in heap block %p of size %zu: write after %zu bytes\n", block, size, wrong ); - } -} - // When a non-thread-local block is freed, it becomes part of the thread delayed free // list that is freed later by the owning heap. If the exact usable size is too small to // contain the pointer for the delayed list, then shrink the padding (by decreasing delta) // so it will later not trigger an overflow error in `mi_free_block`. -static void mi_padding_shrink(const mi_page_t* page, const mi_block_t* block, const size_t min_size) { +void _mi_padding_shrink(const mi_page_t* page, const mi_block_t* block, const size_t min_size) { size_t bsize; size_t delta; bool ok = mi_page_decode_padding(page, block, &delta, &bsize); @@ -262,47 +283,150 @@ static void mi_padding_shrink(const mi_page_t* page, const mi_block_t* block, co size_t new_delta = (bsize - min_size); mi_assert_internal(new_delta < bsize); mi_padding_t* padding = (mi_padding_t*)((uint8_t*)block + bsize); + mi_track_mem_defined(padding,sizeof(mi_padding_t)); padding->delta = (uint32_t)new_delta; + mi_track_mem_noaccess(padding,sizeof(mi_padding_t)); } #else -static void mi_check_padding(const mi_page_t* page, const mi_block_t* block) { - UNUSED(page); - UNUSED(block); -} - static size_t mi_page_usable_size_of(const mi_page_t* page, const mi_block_t* block) { - UNUSED(block); + MI_UNUSED(block); return mi_page_usable_block_size(page); } -static void mi_padding_shrink(const mi_page_t* page, const mi_block_t* block, const size_t min_size) { - UNUSED(page); - UNUSED(block); - UNUSED(min_size); +void _mi_padding_shrink(const mi_page_t* page, const mi_block_t* block, const size_t min_size) { + MI_UNUSED(page); + MI_UNUSED(block); + MI_UNUSED(min_size); } #endif +#if MI_PADDING && MI_PADDING_CHECK + +static bool mi_verify_padding(const mi_page_t* page, const mi_block_t* block, size_t* size, size_t* wrong) { + size_t bsize; + size_t delta; + bool ok = mi_page_decode_padding(page, block, &delta, &bsize); + *size = *wrong = bsize; + if (!ok) return false; + mi_assert_internal(bsize >= delta); + *size = bsize - delta; + if (!mi_page_is_huge(page)) { + uint8_t* fill = (uint8_t*)block + bsize - delta; + const size_t maxpad = (delta > MI_MAX_ALIGN_SIZE ? MI_MAX_ALIGN_SIZE : delta); // check at most the first N padding bytes + mi_track_mem_defined(fill, maxpad); + for (size_t i = 0; i < maxpad; i++) { + if (fill[i] != MI_DEBUG_PADDING) { + *wrong = bsize - delta + i; + ok = false; + break; + } + } + mi_track_mem_noaccess(fill, maxpad); + } + return ok; +} + +static void mi_check_padding(const mi_page_t* page, const mi_block_t* block) { + size_t size; + size_t wrong; + if (!mi_verify_padding(page,block,&size,&wrong)) { + _mi_error_message(EFAULT, "buffer overflow in heap block %p of size %zu: write after %zu bytes\n", block, size, wrong ); + } +} + +#else + +static void mi_check_padding(const mi_page_t* page, const mi_block_t* block) { + MI_UNUSED(page); + MI_UNUSED(block); +} + +#endif + +// only maintain stats for smaller objects if requested +#if (MI_STAT>0) +static void mi_stat_free(const mi_page_t* page, const mi_block_t* block) { + #if (MI_STAT < 2) + MI_UNUSED(block); + #endif + mi_heap_t* const heap = mi_heap_get_default(); + const size_t bsize = mi_page_usable_block_size(page); + #if (MI_STAT>1) + const size_t usize = mi_page_usable_size_of(page, block); + mi_heap_stat_decrease(heap, malloc, usize); + #endif + if (bsize <= MI_MEDIUM_OBJ_SIZE_MAX) { + mi_heap_stat_decrease(heap, normal, bsize); + #if (MI_STAT > 1) + mi_heap_stat_decrease(heap, normal_bins[_mi_bin(bsize)], 1); + #endif + } + else if (bsize <= MI_LARGE_OBJ_SIZE_MAX) { + mi_heap_stat_decrease(heap, large, bsize); + } + else { + mi_heap_stat_decrease(heap, huge, bsize); + } +} +#else +static void mi_stat_free(const mi_page_t* page, const mi_block_t* block) { + MI_UNUSED(page); MI_UNUSED(block); +} +#endif + +#if MI_HUGE_PAGE_ABANDON +#if (MI_STAT>0) +// maintain stats for huge objects +static void mi_stat_huge_free(const mi_page_t* page) { + mi_heap_t* const heap = mi_heap_get_default(); + const size_t bsize = mi_page_block_size(page); // to match stats in `page.c:mi_page_huge_alloc` + if (bsize <= MI_LARGE_OBJ_SIZE_MAX) { + mi_heap_stat_decrease(heap, large, bsize); + } + else { + mi_heap_stat_decrease(heap, huge, bsize); + } +} +#else +static void mi_stat_huge_free(const mi_page_t* page) { + MI_UNUSED(page); +} +#endif +#endif + // ------------------------------------------------------ // Free // ------------------------------------------------------ -// multi-threaded free +// multi-threaded free (or free in huge block if compiled with MI_HUGE_PAGE_ABANDON) static mi_decl_noinline void _mi_free_block_mt(mi_page_t* page, mi_block_t* block) { // The padding check may access the non-thread-owned page for the key values. // that is safe as these are constant and the page won't be freed (as the block is not freed yet). mi_check_padding(page, block); - mi_padding_shrink(page, block, sizeof(mi_block_t)); // for small size, ensure we can fit the delayed thread pointers without triggering overflow detection - #if (MI_DEBUG!=0) - memset(block, MI_DEBUG_FREED, mi_usable_size(block)); - #endif - + _mi_padding_shrink(page, block, sizeof(mi_block_t)); // for small size, ensure we can fit the delayed thread pointers without triggering overflow detection + // huge page segments are always abandoned and can be freed immediately - mi_segment_t* const segment = _mi_page_segment(page); - if (segment->page_kind==MI_PAGE_HUGE) { + mi_segment_t* segment = _mi_page_segment(page); + if (segment->kind == MI_SEGMENT_HUGE) { + #if MI_HUGE_PAGE_ABANDON + // huge page segments are always abandoned and can be freed immediately + mi_stat_huge_free(page); _mi_segment_huge_page_free(segment, page, block); return; + #else + // huge pages are special as they occupy the entire segment + // as these are large we reset the memory occupied by the page so it is available to other threads + // (as the owning thread needs to actually free the memory later). + _mi_segment_huge_page_reset(segment, page, block); + #endif } + + #if (MI_DEBUG>0) && !MI_TRACK_ENABLED && !MI_TSAN // note: when tracking, cannot use mi_usable_size with multi-threading + if (segment->kind != MI_SEGMENT_HUGE) { // not for huge segments as we just reset the content + memset(block, MI_DEBUG_FREED, mi_usable_size(block)); + } + #endif // Try to put the block on either the page-local thread free list, or the heap delayed free list. mi_thread_free_t tfreex; @@ -310,7 +434,7 @@ static mi_decl_noinline void _mi_free_block_mt(mi_page_t* page, mi_block_t* bloc mi_thread_free_t tfree = mi_atomic_load_relaxed(&page->xthread_free); do { use_delayed = (mi_tf_delayed(tfree) == MI_USE_DELAYED_FREE); - if (mi_unlikely(use_delayed)) { + if mi_unlikely(use_delayed) { // unlikely: this only happens on the first concurrent free in a page that is in the full list tfreex = mi_tf_set_delayed(tfree,MI_DELAYED_FREEING); } @@ -321,7 +445,7 @@ static mi_decl_noinline void _mi_free_block_mt(mi_page_t* page, mi_block_t* bloc } } while (!mi_atomic_cas_weak_release(&page->xthread_free, &tfree, tfreex)); - if (mi_unlikely(use_delayed)) { + if mi_unlikely(use_delayed) { // racy read on `heap`, but ok because MI_DELAYED_FREEING is set (see `mi_heap_delete` and `mi_heap_collect_abandon`) mi_heap_t* const heap = (mi_heap_t*)(mi_atomic_load_acquire(&page->xheap)); //mi_page_heap(page); mi_assert_internal(heap != NULL); @@ -343,25 +467,27 @@ static mi_decl_noinline void _mi_free_block_mt(mi_page_t* page, mi_block_t* bloc } } - // regular free static inline void _mi_free_block(mi_page_t* page, bool local, mi_block_t* block) { // and push it on the free list - if (mi_likely(local)) { + //const size_t bsize = mi_page_block_size(page); + if mi_likely(local) { // owning thread can free a block directly - if (mi_unlikely(mi_check_is_double_free(page, block))) return; + if mi_unlikely(mi_check_is_double_free(page, block)) return; mi_check_padding(page, block); - #if (MI_DEBUG!=0) - memset(block, MI_DEBUG_FREED, mi_page_block_size(page)); + #if (MI_DEBUG>0) && !MI_TRACK_ENABLED && !MI_TSAN + if (!mi_page_is_huge(page)) { // huge page content may be already decommitted + memset(block, MI_DEBUG_FREED, mi_page_block_size(page)); + } #endif mi_block_set_next(page, block, page->local_free); page->local_free = block; page->used--; - if (mi_unlikely(mi_page_all_free(page))) { + if mi_unlikely(mi_page_all_free(page)) { _mi_page_retire(page); } - else if (mi_unlikely(mi_page_is_in_full(page))) { + else if mi_unlikely(mi_page_is_in_full(page)) { _mi_page_unfull(page); } } @@ -380,85 +506,94 @@ mi_block_t* _mi_page_ptr_unalign(const mi_segment_t* segment, const mi_page_t* p } -static void mi_decl_noinline mi_free_generic(const mi_segment_t* segment, bool local, void* p) { - mi_page_t* const page = _mi_segment_page_of(segment, p); +void mi_decl_noinline _mi_free_generic(const mi_segment_t* segment, mi_page_t* page, bool is_local, void* p) mi_attr_noexcept { mi_block_t* const block = (mi_page_has_aligned(page) ? _mi_page_ptr_unalign(segment, page, p) : (mi_block_t*)p); - _mi_free_block(page, local, block); + mi_stat_free(page, block); // stat_free may access the padding + mi_track_free_size(block, mi_page_usable_size_of(page,block)); + _mi_free_block(page, is_local, block); } // Get the segment data belonging to a pointer // This is just a single `and` in assembly but does further checks in debug mode // (and secure mode) if this was a valid pointer. -static inline mi_segment_t* mi_checked_ptr_segment(const void* p, const char* msg) +static inline mi_segment_t* mi_checked_ptr_segment(const void* p, const char* msg) { - UNUSED(msg); + MI_UNUSED(msg); + mi_assert(p != NULL); + #if (MI_DEBUG>0) - if (mi_unlikely(((uintptr_t)p & (MI_INTPTR_SIZE - 1)) != 0)) { + if mi_unlikely(((uintptr_t)p & (MI_INTPTR_SIZE - 1)) != 0) { _mi_error_message(EINVAL, "%s: invalid (unaligned) pointer: %p\n", msg, p); return NULL; } #endif mi_segment_t* const segment = _mi_ptr_segment(p); - if (mi_unlikely(segment == NULL)) return NULL; // checks also for (p==NULL) + mi_assert_internal(segment != NULL); #if (MI_DEBUG>0) - if (mi_unlikely(!mi_is_in_heap_region(p))) { - _mi_warning_message("%s: pointer might not point to a valid heap region: %p\n" - "(this may still be a valid very large allocation (over 64MiB))\n", msg, p); - if (mi_likely(_mi_ptr_cookie(segment) == segment->cookie)) { - _mi_warning_message("(yes, the previous pointer %p was valid after all)\n", p); + if mi_unlikely(!mi_is_in_heap_region(p)) { + #if (MI_INTPTR_SIZE == 8 && defined(__linux__)) + if (((uintptr_t)p >> 40) != 0x7F) { // linux tends to align large blocks above 0x7F000000000 (issue #640) + #else + { + #endif + _mi_warning_message("%s: pointer might not point to a valid heap region: %p\n" + "(this may still be a valid very large allocation (over 64MiB))\n", msg, p); + if mi_likely(_mi_ptr_cookie(segment) == segment->cookie) { + _mi_warning_message("(yes, the previous pointer %p was valid after all)\n", p); + } } } #endif #if (MI_DEBUG>0 || MI_SECURE>=4) - if (mi_unlikely(_mi_ptr_cookie(segment) != segment->cookie)) { - _mi_error_message(EINVAL, "%s: pointer does not point to a valid heap space: %p\n", p); + if mi_unlikely(_mi_ptr_cookie(segment) != segment->cookie) { + _mi_error_message(EINVAL, "%s: pointer does not point to a valid heap space: %p\n", msg, p); + return NULL; } #endif + return segment; } - // Free a block +// fast path written carefully to prevent spilling on the stack void mi_free(void* p) mi_attr_noexcept { - const mi_segment_t* const segment = mi_checked_ptr_segment(p,"mi_free"); - if (mi_unlikely(segment == NULL)) return; + if mi_unlikely(p == NULL) return; + mi_segment_t* const segment = mi_checked_ptr_segment(p,"mi_free"); + const bool is_local= (_mi_prim_thread_id() == mi_atomic_load_relaxed(&segment->thread_id)); + mi_page_t* const page = _mi_segment_page_of(segment, p); - const uintptr_t tid = _mi_thread_id(); - mi_page_t* const page = _mi_segment_page_of(segment, p); - mi_block_t* const block = (mi_block_t*)p; - -#if (MI_STAT>1) - mi_heap_t* const heap = mi_heap_get_default(); - const size_t bsize = mi_page_usable_block_size(page); - mi_heap_stat_decrease(heap, malloc, bsize); - if (bsize <= MI_LARGE_OBJ_SIZE_MAX) { // huge page stats are accounted for in `_mi_page_retire` - mi_heap_stat_decrease(heap, normal[_mi_bin(bsize)], 1); - } -#endif - - if (mi_likely(tid == segment->thread_id && page->flags.full_aligned == 0)) { // the thread id matches and it is not a full page, nor has aligned blocks - // local, and not full or aligned - if (mi_unlikely(mi_check_is_double_free(page,block))) return; - mi_check_padding(page, block); - #if (MI_DEBUG!=0) - memset(block, MI_DEBUG_FREED, mi_page_block_size(page)); - #endif - mi_block_set_next(page, block, page->local_free); - page->local_free = block; - if (mi_unlikely(--page->used == 0)) { // using this expression generates better code than: page->used--; if (mi_page_all_free(page)) - _mi_page_retire(page); + if mi_likely(is_local) { // thread-local free? + if mi_likely(page->flags.full_aligned == 0) // and it is not a full page (full pages need to move from the full bin), nor has aligned blocks (aligned blocks need to be unaligned) + { + mi_block_t* const block = (mi_block_t*)p; + if mi_unlikely(mi_check_is_double_free(page, block)) return; + mi_check_padding(page, block); + mi_stat_free(page, block); + #if (MI_DEBUG>0) && !MI_TRACK_ENABLED && !MI_TSAN + memset(block, MI_DEBUG_FREED, mi_page_block_size(page)); + #endif + mi_track_free_size(p, mi_page_usable_size_of(page,block)); // faster then mi_usable_size as we already know the page and that p is unaligned + mi_block_set_next(page, block, page->local_free); + page->local_free = block; + if mi_unlikely(--page->used == 0) { // using this expression generates better code than: page->used--; if (mi_page_all_free(page)) + _mi_page_retire(page); + } + } + else { + // page is full or contains (inner) aligned blocks; use generic path + _mi_free_generic(segment, page, true, p); } } else { - // non-local, aligned blocks, or a full page; use the more generic path - // note: recalc page in generic to improve code generation - mi_free_generic(segment, tid == segment->thread_id, p); + // not thread-local; use generic path + _mi_free_generic(segment, page, false, p); } } +// return true if successful bool _mi_free_delayed_block(mi_block_t* block) { // get segment and page const mi_segment_t* const segment = _mi_ptr_segment(block); @@ -471,7 +606,9 @@ bool _mi_free_delayed_block(mi_block_t* block) { // some blocks may end up in the page `thread_free` list with no blocks in the // heap `thread_delayed_free` list which may cause the page to be never freed! // (it would only be freed if we happen to scan it in `mi_page_queue_find_free_ex`) - _mi_page_use_delayed_free(page, MI_USE_DELAYED_FREE, false /* dont overwrite never delayed */); + if (!_mi_page_try_use_delayed_free(page, MI_USE_DELAYED_FREE, false /* dont overwrite never delayed */)) { + return false; + } // collect all other non-local frees to ensure up-to-date `used` count _mi_page_free_collect(page, false); @@ -482,119 +619,127 @@ bool _mi_free_delayed_block(mi_block_t* block) { } // Bytes available in a block -static size_t _mi_usable_size(const void* p, const char* msg) mi_attr_noexcept { - const mi_segment_t* const segment = mi_checked_ptr_segment(p,msg); - if (segment==NULL) return 0; +mi_decl_noinline static size_t mi_page_usable_aligned_size_of(const mi_segment_t* segment, const mi_page_t* page, const void* p) mi_attr_noexcept { + const mi_block_t* block = _mi_page_ptr_unalign(segment, page, p); + const size_t size = mi_page_usable_size_of(page, block); + const ptrdiff_t adjust = (uint8_t*)p - (uint8_t*)block; + mi_assert_internal(adjust >= 0 && (size_t)adjust <= size); + return (size - adjust); +} + +static inline size_t _mi_usable_size(const void* p, const char* msg) mi_attr_noexcept { + if (p == NULL) return 0; + const mi_segment_t* const segment = mi_checked_ptr_segment(p, msg); const mi_page_t* const page = _mi_segment_page_of(segment, p); - const mi_block_t* block = (const mi_block_t*)p; - if (mi_unlikely(mi_page_has_aligned(page))) { - block = _mi_page_ptr_unalign(segment, page, p); - size_t size = mi_page_usable_size_of(page, block); - ptrdiff_t const adjust = (uint8_t*)p - (uint8_t*)block; - mi_assert_internal(adjust >= 0 && (size_t)adjust <= size); - return (size - adjust); - } - else { + if mi_likely(!mi_page_has_aligned(page)) { + const mi_block_t* block = (const mi_block_t*)p; return mi_page_usable_size_of(page, block); } + else { + // split out to separate routine for improved code generation + return mi_page_usable_aligned_size_of(segment, page, p); + } } -size_t mi_usable_size(const void* p) mi_attr_noexcept { +mi_decl_nodiscard size_t mi_usable_size(const void* p) mi_attr_noexcept { return _mi_usable_size(p, "mi_usable_size"); } -// ------------------------------------------------------ -// ensure explicit external inline definitions are emitted! -// ------------------------------------------------------ - -#ifdef __cplusplus -void* _mi_externs[] = { - (void*)&_mi_page_malloc, - (void*)&mi_malloc, - (void*)&mi_malloc_small, - (void*)&mi_heap_malloc, - (void*)&mi_heap_zalloc, - (void*)&mi_heap_malloc_small -}; -#endif - - // ------------------------------------------------------ // Allocation extensions // ------------------------------------------------------ void mi_free_size(void* p, size_t size) mi_attr_noexcept { - UNUSED_RELEASE(size); + MI_UNUSED_RELEASE(size); mi_assert(p == NULL || size <= _mi_usable_size(p,"mi_free_size")); mi_free(p); } void mi_free_size_aligned(void* p, size_t size, size_t alignment) mi_attr_noexcept { - UNUSED_RELEASE(alignment); + MI_UNUSED_RELEASE(alignment); mi_assert(((uintptr_t)p % alignment) == 0); mi_free_size(p,size); } void mi_free_aligned(void* p, size_t alignment) mi_attr_noexcept { - UNUSED_RELEASE(alignment); + MI_UNUSED_RELEASE(alignment); mi_assert(((uintptr_t)p % alignment) == 0); mi_free(p); } -extern inline mi_decl_restrict void* mi_heap_calloc(mi_heap_t* heap, size_t count, size_t size) mi_attr_noexcept { +mi_decl_nodiscard extern inline mi_decl_restrict void* mi_heap_calloc(mi_heap_t* heap, size_t count, size_t size) mi_attr_noexcept { size_t total; if (mi_count_size_overflow(count,size,&total)) return NULL; return mi_heap_zalloc(heap,total); } -mi_decl_restrict void* mi_calloc(size_t count, size_t size) mi_attr_noexcept { - return mi_heap_calloc(mi_get_default_heap(),count,size); +mi_decl_nodiscard mi_decl_restrict void* mi_calloc(size_t count, size_t size) mi_attr_noexcept { + return mi_heap_calloc(mi_prim_get_default_heap(),count,size); } // Uninitialized `calloc` -extern mi_decl_restrict void* mi_heap_mallocn(mi_heap_t* heap, size_t count, size_t size) mi_attr_noexcept { +mi_decl_nodiscard extern mi_decl_restrict void* mi_heap_mallocn(mi_heap_t* heap, size_t count, size_t size) mi_attr_noexcept { size_t total; if (mi_count_size_overflow(count, size, &total)) return NULL; return mi_heap_malloc(heap, total); } -mi_decl_restrict void* mi_mallocn(size_t count, size_t size) mi_attr_noexcept { - return mi_heap_mallocn(mi_get_default_heap(),count,size); +mi_decl_nodiscard mi_decl_restrict void* mi_mallocn(size_t count, size_t size) mi_attr_noexcept { + return mi_heap_mallocn(mi_prim_get_default_heap(),count,size); } -// Expand in place or fail +// Expand (or shrink) in place (or fail) void* mi_expand(void* p, size_t newsize) mi_attr_noexcept { + #if MI_PADDING + // we do not shrink/expand with padding enabled + MI_UNUSED(p); MI_UNUSED(newsize); + return NULL; + #else if (p == NULL) return NULL; - size_t size = _mi_usable_size(p,"mi_expand"); + const size_t size = _mi_usable_size(p,"mi_expand"); if (newsize > size) return NULL; return p; // it fits + #endif } -void* _mi_heap_realloc_zero(mi_heap_t* heap, void* p, size_t newsize, bool zero) { - if (p == NULL) return _mi_heap_malloc_zero(heap,newsize,zero); - size_t size = _mi_usable_size(p,"mi_realloc"); - if (newsize <= size && newsize >= (size / 2)) { +void* _mi_heap_realloc_zero(mi_heap_t* heap, void* p, size_t newsize, bool zero) mi_attr_noexcept { + // if p == NULL then behave as malloc. + // else if size == 0 then reallocate to a zero-sized block (and don't return NULL, just as mi_malloc(0)). + // (this means that returning NULL always indicates an error, and `p` will not have been freed in that case.) + const size_t size = _mi_usable_size(p,"mi_realloc"); // also works if p == NULL (with size 0) + if mi_unlikely(newsize <= size && newsize >= (size / 2) && newsize > 0) { // note: newsize must be > 0 or otherwise we return NULL for realloc(NULL,0) + mi_assert_internal(p!=NULL); + // todo: do not track as the usable size is still the same in the free; adjust potential padding? + // mi_track_resize(p,size,newsize) + // if (newsize < size) { mi_track_mem_noaccess((uint8_t*)p + newsize, size - newsize); } return p; // reallocation still fits and not more than 50% waste } void* newp = mi_heap_malloc(heap,newsize); - if (mi_likely(newp != NULL)) { + if mi_likely(newp != NULL) { if (zero && newsize > size) { // also set last word in the previous allocation to zero to ensure any padding is zero-initialized - size_t start = (size >= sizeof(intptr_t) ? size - sizeof(intptr_t) : 0); - memset((uint8_t*)newp + start, 0, newsize - start); + const size_t start = (size >= sizeof(intptr_t) ? size - sizeof(intptr_t) : 0); + _mi_memzero((uint8_t*)newp + start, newsize - start); + } + else if (newsize == 0) { + ((uint8_t*)newp)[0] = 0; // work around for applications that expect zero-reallocation to be zero initialized (issue #725) + } + if mi_likely(p != NULL) { + const size_t copysize = (newsize > size ? size : newsize); + mi_track_mem_defined(p,copysize); // _mi_useable_size may be too large for byte precise memory tracking.. + _mi_memcpy(newp, p, copysize); + mi_free(p); // only free the original pointer if successful } - memcpy(newp, p, (newsize > size ? size : newsize)); - mi_free(p); // only free if successful } return newp; } -void* mi_heap_realloc(mi_heap_t* heap, void* p, size_t newsize) mi_attr_noexcept { +mi_decl_nodiscard void* mi_heap_realloc(mi_heap_t* heap, void* p, size_t newsize) mi_attr_noexcept { return _mi_heap_realloc_zero(heap, p, newsize, false); } -void* mi_heap_reallocn(mi_heap_t* heap, void* p, size_t count, size_t size) mi_attr_noexcept { +mi_decl_nodiscard void* mi_heap_reallocn(mi_heap_t* heap, void* p, size_t count, size_t size) mi_attr_noexcept { size_t total; if (mi_count_size_overflow(count, size, &total)) return NULL; return mi_heap_realloc(heap, p, total); @@ -602,42 +747,42 @@ void* mi_heap_reallocn(mi_heap_t* heap, void* p, size_t count, size_t size) mi_a // Reallocate but free `p` on errors -void* mi_heap_reallocf(mi_heap_t* heap, void* p, size_t newsize) mi_attr_noexcept { +mi_decl_nodiscard void* mi_heap_reallocf(mi_heap_t* heap, void* p, size_t newsize) mi_attr_noexcept { void* newp = mi_heap_realloc(heap, p, newsize); if (newp==NULL && p!=NULL) mi_free(p); return newp; } -void* mi_heap_rezalloc(mi_heap_t* heap, void* p, size_t newsize) mi_attr_noexcept { +mi_decl_nodiscard void* mi_heap_rezalloc(mi_heap_t* heap, void* p, size_t newsize) mi_attr_noexcept { return _mi_heap_realloc_zero(heap, p, newsize, true); } -void* mi_heap_recalloc(mi_heap_t* heap, void* p, size_t count, size_t size) mi_attr_noexcept { +mi_decl_nodiscard void* mi_heap_recalloc(mi_heap_t* heap, void* p, size_t count, size_t size) mi_attr_noexcept { size_t total; if (mi_count_size_overflow(count, size, &total)) return NULL; return mi_heap_rezalloc(heap, p, total); } -void* mi_realloc(void* p, size_t newsize) mi_attr_noexcept { - return mi_heap_realloc(mi_get_default_heap(),p,newsize); +mi_decl_nodiscard void* mi_realloc(void* p, size_t newsize) mi_attr_noexcept { + return mi_heap_realloc(mi_prim_get_default_heap(),p,newsize); } -void* mi_reallocn(void* p, size_t count, size_t size) mi_attr_noexcept { - return mi_heap_reallocn(mi_get_default_heap(),p,count,size); +mi_decl_nodiscard void* mi_reallocn(void* p, size_t count, size_t size) mi_attr_noexcept { + return mi_heap_reallocn(mi_prim_get_default_heap(),p,count,size); } // Reallocate but free `p` on errors -void* mi_reallocf(void* p, size_t newsize) mi_attr_noexcept { - return mi_heap_reallocf(mi_get_default_heap(),p,newsize); +mi_decl_nodiscard void* mi_reallocf(void* p, size_t newsize) mi_attr_noexcept { + return mi_heap_reallocf(mi_prim_get_default_heap(),p,newsize); } -void* mi_rezalloc(void* p, size_t newsize) mi_attr_noexcept { - return mi_heap_rezalloc(mi_get_default_heap(), p, newsize); +mi_decl_nodiscard void* mi_rezalloc(void* p, size_t newsize) mi_attr_noexcept { + return mi_heap_rezalloc(mi_prim_get_default_heap(), p, newsize); } -void* mi_recalloc(void* p, size_t count, size_t size) mi_attr_noexcept { - return mi_heap_recalloc(mi_get_default_heap(), p, count, size); +mi_decl_nodiscard void* mi_recalloc(void* p, size_t count, size_t size) mi_attr_noexcept { + return mi_heap_recalloc(mi_prim_get_default_heap(), p, count, size); } @@ -647,33 +792,35 @@ void* mi_recalloc(void* p, size_t count, size_t size) mi_attr_noexcept { // ------------------------------------------------------ // `strdup` using mi_malloc -mi_decl_restrict char* mi_heap_strdup(mi_heap_t* heap, const char* s) mi_attr_noexcept { +mi_decl_nodiscard mi_decl_restrict char* mi_heap_strdup(mi_heap_t* heap, const char* s) mi_attr_noexcept { if (s == NULL) return NULL; size_t n = strlen(s); char* t = (char*)mi_heap_malloc(heap,n+1); - if (t != NULL) memcpy(t, s, n + 1); + if (t == NULL) return NULL; + _mi_memcpy(t, s, n); + t[n] = 0; return t; } -mi_decl_restrict char* mi_strdup(const char* s) mi_attr_noexcept { - return mi_heap_strdup(mi_get_default_heap(), s); +mi_decl_nodiscard mi_decl_restrict char* mi_strdup(const char* s) mi_attr_noexcept { + return mi_heap_strdup(mi_prim_get_default_heap(), s); } // `strndup` using mi_malloc -mi_decl_restrict char* mi_heap_strndup(mi_heap_t* heap, const char* s, size_t n) mi_attr_noexcept { +mi_decl_nodiscard mi_decl_restrict char* mi_heap_strndup(mi_heap_t* heap, const char* s, size_t n) mi_attr_noexcept { if (s == NULL) return NULL; const char* end = (const char*)memchr(s, 0, n); // find end of string in the first `n` characters (returns NULL if not found) const size_t m = (end != NULL ? (size_t)(end - s) : n); // `m` is the minimum of `n` or the end-of-string mi_assert_internal(m <= n); char* t = (char*)mi_heap_malloc(heap, m+1); if (t == NULL) return NULL; - memcpy(t, s, m); + _mi_memcpy(t, s, m); t[m] = 0; return t; } -mi_decl_restrict char* mi_strndup(const char* s, size_t n) mi_attr_noexcept { - return mi_heap_strndup(mi_get_default_heap(),s,n); +mi_decl_nodiscard mi_decl_restrict char* mi_strndup(const char* s, size_t n) mi_attr_noexcept { + return mi_heap_strndup(mi_prim_get_default_heap(),s,n); } #ifndef __wasi__ @@ -682,8 +829,8 @@ mi_decl_restrict char* mi_strndup(const char* s, size_t n) mi_attr_noexcept { #ifndef PATH_MAX #define PATH_MAX MAX_PATH #endif -#include -mi_decl_restrict char* mi_heap_realpath(mi_heap_t* heap, const char* fname, char* resolved_name) mi_attr_noexcept { +#include +mi_decl_nodiscard mi_decl_restrict char* mi_heap_realpath(mi_heap_t* heap, const char* fname, char* resolved_name) mi_attr_noexcept { // todo: use GetFullPathNameW to allow longer file names char buf[PATH_MAX]; DWORD res = GetFullPathNameA(fname, PATH_MAX, (resolved_name == NULL ? buf : resolved_name), NULL); @@ -701,8 +848,9 @@ mi_decl_restrict char* mi_heap_realpath(mi_heap_t* heap, const char* fname, char } } #else +/* #include // pathconf -static size_t mi_path_max() { +static size_t mi_path_max(void) { static size_t path_max = 0; if (path_max <= 0) { long m = pathconf("/",_PC_PATH_MAX); @@ -712,25 +860,36 @@ static size_t mi_path_max() { } return path_max; } - +*/ char* mi_heap_realpath(mi_heap_t* heap, const char* fname, char* resolved_name) mi_attr_noexcept { if (resolved_name != NULL) { return realpath(fname,resolved_name); } else { - size_t n = mi_path_max(); + char* rname = realpath(fname, NULL); + if (rname == NULL) return NULL; + char* result = mi_heap_strdup(heap, rname); + free(rname); // use regular free! (which may be redirected to our free but that's ok) + return result; + } + /* + const size_t n = mi_path_max(); char* buf = (char*)mi_malloc(n+1); - if (buf==NULL) return NULL; + if (buf == NULL) { + errno = ENOMEM; + return NULL; + } char* rname = realpath(fname,buf); char* result = mi_heap_strndup(heap,rname,n); // ok if `rname==NULL` mi_free(buf); return result; } + */ } #endif -mi_decl_restrict char* mi_realpath(const char* fname, char* resolved_name) mi_attr_noexcept { - return mi_heap_realpath(mi_get_default_heap(),fname,resolved_name); +mi_decl_nodiscard mi_decl_restrict char* mi_realpath(const char* fname, char* resolved_name) mi_attr_noexcept { + return mi_heap_realpath(mi_prim_get_default_heap(),fname,resolved_name); } #endif @@ -746,9 +905,17 @@ but we call `exit` instead (i.e. not returning). #ifdef __cplusplus #include static bool mi_try_new_handler(bool nothrow) { - std::new_handler h = std::get_new_handler(); + #if defined(_MSC_VER) || (__cplusplus >= 201103L) + std::new_handler h = std::get_new_handler(); + #else + std::new_handler h = std::set_new_handler(); + std::set_new_handler(h); + #endif if (h==NULL) { - if (!nothrow) throw std::bad_alloc(); + _mi_error_message(ENOMEM, "out of memory in 'new'"); + if (!nothrow) { + throw std::bad_alloc(); + } return false; } else { @@ -757,13 +924,13 @@ static bool mi_try_new_handler(bool nothrow) { } } #else -typedef void (*std_new_handler_t)(); +typedef void (*std_new_handler_t)(void); -#if (defined(__GNUC__) || defined(__clang__)) -std_new_handler_t __attribute((weak)) _ZSt15get_new_handlerv() { +#if (defined(__GNUC__) || (defined(__clang__) && !defined(_MSC_VER))) // exclude clang-cl, see issue #631 +std_new_handler_t __attribute__((weak)) _ZSt15get_new_handlerv(void) { return NULL; } -static std_new_handler_t mi_get_new_handler() { +static std_new_handler_t mi_get_new_handler(void) { return _ZSt15get_new_handlerv(); } #else @@ -776,7 +943,10 @@ static std_new_handler_t mi_get_new_handler() { static bool mi_try_new_handler(bool nothrow) { std_new_handler_t h = mi_get_new_handler(); if (h==NULL) { - if (!nothrow) exit(ENOMEM); // cannot throw in plain C, use exit as we are out of memory anyway. + _mi_error_message(ENOMEM, "out of memory in 'new'"); + if (!nothrow) { + abort(); // cannot throw in plain C, use abort + } return false; } else { @@ -786,27 +956,53 @@ static bool mi_try_new_handler(bool nothrow) { } #endif -static mi_decl_noinline void* mi_try_new(size_t size, bool nothrow ) { +mi_decl_export mi_decl_noinline void* mi_heap_try_new(mi_heap_t* heap, size_t size, bool nothrow ) { void* p = NULL; while(p == NULL && mi_try_new_handler(nothrow)) { - p = mi_malloc(size); + p = mi_heap_malloc(heap,size); } return p; } -mi_decl_restrict void* mi_new(size_t size) { - void* p = mi_malloc(size); - if (mi_unlikely(p == NULL)) return mi_try_new(size,false); +static mi_decl_noinline void* mi_try_new(size_t size, bool nothrow) { + return mi_heap_try_new(mi_prim_get_default_heap(), size, nothrow); +} + + +mi_decl_nodiscard mi_decl_restrict void* mi_heap_alloc_new(mi_heap_t* heap, size_t size) { + void* p = mi_heap_malloc(heap,size); + if mi_unlikely(p == NULL) return mi_heap_try_new(heap, size, false); return p; } -mi_decl_restrict void* mi_new_nothrow(size_t size) mi_attr_noexcept { +mi_decl_nodiscard mi_decl_restrict void* mi_new(size_t size) { + return mi_heap_alloc_new(mi_prim_get_default_heap(), size); +} + + +mi_decl_nodiscard mi_decl_restrict void* mi_heap_alloc_new_n(mi_heap_t* heap, size_t count, size_t size) { + size_t total; + if mi_unlikely(mi_count_size_overflow(count, size, &total)) { + mi_try_new_handler(false); // on overflow we invoke the try_new_handler once to potentially throw std::bad_alloc + return NULL; + } + else { + return mi_heap_alloc_new(heap,total); + } +} + +mi_decl_nodiscard mi_decl_restrict void* mi_new_n(size_t count, size_t size) { + return mi_heap_alloc_new_n(mi_prim_get_default_heap(), size, count); +} + + +mi_decl_nodiscard mi_decl_restrict void* mi_new_nothrow(size_t size) mi_attr_noexcept { void* p = mi_malloc(size); - if (mi_unlikely(p == NULL)) return mi_try_new(size, true); + if mi_unlikely(p == NULL) return mi_try_new(size, true); return p; } -mi_decl_restrict void* mi_new_aligned(size_t size, size_t alignment) { +mi_decl_nodiscard mi_decl_restrict void* mi_new_aligned(size_t size, size_t alignment) { void* p; do { p = mi_malloc_aligned(size, alignment); @@ -815,7 +1011,7 @@ mi_decl_restrict void* mi_new_aligned(size_t size, size_t alignment) { return p; } -mi_decl_restrict void* mi_new_aligned_nothrow(size_t size, size_t alignment) mi_attr_noexcept { +mi_decl_nodiscard mi_decl_restrict void* mi_new_aligned_nothrow(size_t size, size_t alignment) mi_attr_noexcept { void* p; do { p = mi_malloc_aligned(size, alignment); @@ -824,18 +1020,7 @@ mi_decl_restrict void* mi_new_aligned_nothrow(size_t size, size_t alignment) mi_ return p; } -mi_decl_restrict void* mi_new_n(size_t count, size_t size) { - size_t total; - if (mi_unlikely(mi_count_size_overflow(count, size, &total))) { - mi_try_new_handler(false); // on overflow we invoke the try_new_handler once to potentially throw std::bad_alloc - return NULL; - } - else { - return mi_new(total); - } -} - -void* mi_new_realloc(void* p, size_t newsize) { +mi_decl_nodiscard void* mi_new_realloc(void* p, size_t newsize) { void* q; do { q = mi_realloc(p, newsize); @@ -843,9 +1028,9 @@ void* mi_new_realloc(void* p, size_t newsize) { return q; } -void* mi_new_reallocn(void* p, size_t newcount, size_t size) { +mi_decl_nodiscard void* mi_new_reallocn(void* p, size_t newcount, size_t size) { size_t total; - if (mi_unlikely(mi_count_size_overflow(newcount, size, &total))) { + if mi_unlikely(mi_count_size_overflow(newcount, size, &total)) { mi_try_new_handler(false); // on overflow we invoke the try_new_handler once to potentially throw std::bad_alloc return NULL; } @@ -853,3 +1038,23 @@ void* mi_new_reallocn(void* p, size_t newcount, size_t size) { return mi_new_realloc(p, total); } } + +// ------------------------------------------------------ +// ensure explicit external inline definitions are emitted! +// ------------------------------------------------------ + +#ifdef __cplusplus +void* _mi_externs[] = { + (void*)&_mi_page_malloc, + (void*)&_mi_heap_malloc_zero, + (void*)&_mi_heap_malloc_zero_ex, + (void*)&mi_malloc, + (void*)&mi_malloc_small, + (void*)&mi_zalloc_small, + (void*)&mi_heap_malloc, + (void*)&mi_heap_zalloc, + (void*)&mi_heap_malloc_small, + // (void*)&mi_heap_alloc_new, + // (void*)&mi_heap_alloc_new_n +}; +#endif diff --git a/src/arena.c b/src/arena.c index 73a7e70..a04a04c 100644 --- a/src/arena.c +++ b/src/arena.c @@ -1,5 +1,5 @@ /* ---------------------------------------------------------------------------- -Copyright (c) 2019, Microsoft Research, Daan Leijen +Copyright (c) 2019-2023, Microsoft Research, Daan Leijen This is free software; you can redistribute it and/or modify it under the terms of the MIT license. A copy of the license can be found in the file "LICENSE" at the root of this distribution. @@ -7,113 +7,207 @@ terms of the MIT license. A copy of the license can be found in the file /* ---------------------------------------------------------------------------- "Arenas" are fixed area's of OS memory from which we can allocate -large blocks (>= MI_ARENA_BLOCK_SIZE, 32MiB). +large blocks (>= MI_ARENA_MIN_BLOCK_SIZE, 4MiB). In contrast to the rest of mimalloc, the arenas are shared between threads and need to be accessed using atomic operations. -Currently arenas are only used to for huge OS page (1GiB) reservations, -otherwise it delegates to direct allocation from the OS. -In the future, we can expose an API to manually add more kinds of arenas -which is sometimes needed for embedded devices or shared memory for example. -(We can also employ this with WASI or `sbrk` systems to reserve large arenas - on demand and be able to reuse them efficiently). +Arenas are used to for huge OS page (1GiB) reservations or for reserving +OS memory upfront which can be improve performance or is sometimes needed +on embedded devices. We can also employ this with WASI or `sbrk` systems +to reserve large arenas upfront and be able to reuse the memory more effectively. -The arena allocation needs to be thread safe and we use an atomic -bitmap to allocate. The current implementation of the bitmap can -only do this within a field (`uintptr_t`) so we can allocate at most -blocks of 2GiB (64*32MiB) and no object can cross the boundary. This -can lead to fragmentation but fortunately most objects will be regions -of 256MiB in practice. +The arena allocation needs to be thread safe and we use an atomic bitmap to allocate. -----------------------------------------------------------------------------*/ #include "mimalloc.h" -#include "mimalloc-internal.h" -#include "mimalloc-atomic.h" +#include "mimalloc/internal.h" +#include "mimalloc/atomic.h" #include // memset +#include // ENOMEM -#include "bitmap.inc.c" // atomic bitmap - - -// os.c -void* _mi_os_alloc_aligned(size_t size, size_t alignment, bool commit, bool* large, mi_os_tld_t* tld); -void _mi_os_free_ex(void* p, size_t size, bool was_committed, mi_stats_t* stats); -void _mi_os_free(void* p, size_t size, mi_stats_t* stats); - -void* _mi_os_alloc_huge_os_pages(size_t pages, int numa_node, mi_msecs_t max_secs, size_t* pages_reserved, size_t* psize); -void _mi_os_free_huge_pages(void* p, size_t size, mi_stats_t* stats); - -bool _mi_os_commit(void* p, size_t size, bool* is_zero, mi_stats_t* stats); +#include "bitmap.h" // atomic bitmap /* ----------------------------------------------------------- Arena allocation ----------------------------------------------------------- */ -#define MI_SEGMENT_ALIGN MI_SEGMENT_SIZE -#define MI_ARENA_BLOCK_SIZE (8*MI_SEGMENT_ALIGN) // 32MiB -#define MI_ARENA_MAX_OBJ_SIZE (MI_BITMAP_FIELD_BITS * MI_ARENA_BLOCK_SIZE) // 2GiB -#define MI_ARENA_MIN_OBJ_SIZE (MI_ARENA_BLOCK_SIZE/2) // 16MiB -#define MI_MAX_ARENAS (64) // not more than 256 (since we use 8 bits in the memid) +// Block info: bit 0 contains the `in_use` bit, the upper bits the +// size in count of arena blocks. +typedef uintptr_t mi_block_info_t; +#define MI_ARENA_BLOCK_SIZE (MI_SEGMENT_SIZE) // 64MiB (must be at least MI_SEGMENT_ALIGN) +#define MI_ARENA_MIN_OBJ_SIZE (MI_ARENA_BLOCK_SIZE/2) // 32MiB +#define MI_MAX_ARENAS (112) // not more than 126 (since we use 7 bits in the memid and an arena index + 1) // A memory arena descriptor typedef struct mi_arena_s { + mi_arena_id_t id; // arena id; 0 for non-specific + mi_memid_t memid; // memid of the memory area _Atomic(uint8_t*) start; // the start of the memory area size_t block_count; // size of the area in arena blocks (of `MI_ARENA_BLOCK_SIZE`) size_t field_count; // number of bitmap fields (where `field_count * MI_BITMAP_FIELD_BITS >= block_count`) + size_t meta_size; // size of the arena structure itself (including its bitmaps) + mi_memid_t meta_memid; // memid of the arena structure itself (OS or static allocation) int numa_node; // associated NUMA node - bool is_zero_init; // is the arena zero initialized? - bool is_committed; // is the memory committed - bool is_large; // large OS page allocated - _Atomic(uintptr_t) search_idx; // optimization to start the search for free blocks + bool exclusive; // only allow allocations if specifically for this arena + bool is_large; // memory area consists of large- or huge OS pages (always committed) + _Atomic(size_t) search_idx; // optimization to start the search for free blocks + _Atomic(mi_msecs_t) purge_expire; // expiration time when blocks should be decommitted from `blocks_decommit`. mi_bitmap_field_t* blocks_dirty; // are the blocks potentially non-zero? - mi_bitmap_field_t* blocks_committed; // if `!is_committed`, are the blocks committed? - mi_bitmap_field_t blocks_inuse[1]; // in-place bitmap of in-use blocks (of size `field_count`) + mi_bitmap_field_t* blocks_committed; // are the blocks committed? (can be NULL for memory that cannot be decommitted) + mi_bitmap_field_t* blocks_purge; // blocks that can be (reset) decommitted. (can be NULL for memory that cannot be (reset) decommitted) + mi_bitmap_field_t blocks_inuse[1]; // in-place bitmap of in-use blocks (of size `field_count`) } mi_arena_t; // The available arenas static mi_decl_cache_align _Atomic(mi_arena_t*) mi_arenas[MI_MAX_ARENAS]; -static mi_decl_cache_align _Atomic(uintptr_t) mi_arena_count; // = 0 +static mi_decl_cache_align _Atomic(size_t) mi_arena_count; // = 0 +//static bool mi_manage_os_memory_ex2(void* start, size_t size, bool is_large, int numa_node, bool exclusive, mi_memid_t memid, mi_arena_id_t* arena_id) mi_attr_noexcept; + /* ----------------------------------------------------------- - Arena allocations get a memory id where the lower 8 bits are - the arena index +1, and the upper bits the block index. + Arena id's + id = arena_index + 1 ----------------------------------------------------------- */ -// Use `0` as a special id for direct OS allocated memory. -#define MI_MEMID_OS 0 - -static size_t mi_arena_id_create(size_t arena_index, mi_bitmap_index_t bitmap_index) { - mi_assert_internal(arena_index < 0xFE); - mi_assert_internal(((bitmap_index << 8) >> 8) == bitmap_index); // no overflow? - return ((bitmap_index << 8) | ((arena_index+1) & 0xFF)); +static size_t mi_arena_id_index(mi_arena_id_t id) { + return (size_t)(id <= 0 ? MI_MAX_ARENAS : id - 1); } -static void mi_arena_id_indices(size_t memid, size_t* arena_index, mi_bitmap_index_t* bitmap_index) { - mi_assert_internal(memid != MI_MEMID_OS); - *arena_index = (memid & 0xFF) - 1; - *bitmap_index = (memid >> 8); +static mi_arena_id_t mi_arena_id_create(size_t arena_index) { + mi_assert_internal(arena_index < MI_MAX_ARENAS); + return (int)arena_index + 1; } +mi_arena_id_t _mi_arena_id_none(void) { + return 0; +} + +static bool mi_arena_id_is_suitable(mi_arena_id_t arena_id, bool arena_is_exclusive, mi_arena_id_t req_arena_id) { + return ((!arena_is_exclusive && req_arena_id == _mi_arena_id_none()) || + (arena_id == req_arena_id)); +} + +bool _mi_arena_memid_is_suitable(mi_memid_t memid, mi_arena_id_t request_arena_id) { + if (memid.memkind == MI_MEM_ARENA) { + return mi_arena_id_is_suitable(memid.mem.arena.id, memid.mem.arena.is_exclusive, request_arena_id); + } + else { + return mi_arena_id_is_suitable(0, false, request_arena_id); + } +} + +bool _mi_arena_memid_is_os_allocated(mi_memid_t memid) { + return (memid.memkind == MI_MEM_OS); +} + +/* ----------------------------------------------------------- + Arena allocations get a (currently) 16-bit memory id where the + lower 8 bits are the arena id, and the upper bits the block index. +----------------------------------------------------------- */ + static size_t mi_block_count_of_size(size_t size) { return _mi_divide_up(size, MI_ARENA_BLOCK_SIZE); } +static size_t mi_arena_block_size(size_t bcount) { + return (bcount * MI_ARENA_BLOCK_SIZE); +} + +static size_t mi_arena_size(mi_arena_t* arena) { + return mi_arena_block_size(arena->block_count); +} + +static mi_memid_t mi_memid_create_arena(mi_arena_id_t id, bool is_exclusive, mi_bitmap_index_t bitmap_index) { + mi_memid_t memid = _mi_memid_create(MI_MEM_ARENA); + memid.mem.arena.id = id; + memid.mem.arena.block_index = bitmap_index; + memid.mem.arena.is_exclusive = is_exclusive; + return memid; +} + +static bool mi_arena_memid_indices(mi_memid_t memid, size_t* arena_index, mi_bitmap_index_t* bitmap_index) { + mi_assert_internal(memid.memkind == MI_MEM_ARENA); + *arena_index = mi_arena_id_index(memid.mem.arena.id); + *bitmap_index = memid.mem.arena.block_index; + return memid.mem.arena.is_exclusive; +} + + + +/* ----------------------------------------------------------- + Special static area for mimalloc internal structures + to avoid OS calls (for example, for the arena metadata) +----------------------------------------------------------- */ + +#define MI_ARENA_STATIC_MAX (MI_INTPTR_SIZE*MI_KiB) // 8 KiB on 64-bit + +static uint8_t mi_arena_static[MI_ARENA_STATIC_MAX]; +static _Atomic(size_t) mi_arena_static_top; + +static void* mi_arena_static_zalloc(size_t size, size_t alignment, mi_memid_t* memid) { + *memid = _mi_memid_none(); + if (size == 0 || size > MI_ARENA_STATIC_MAX) return NULL; + if ((mi_atomic_load_relaxed(&mi_arena_static_top) + size) > MI_ARENA_STATIC_MAX) return NULL; + + // try to claim space + if (alignment == 0) { alignment = 1; } + const size_t oversize = size + alignment - 1; + if (oversize > MI_ARENA_STATIC_MAX) return NULL; + const size_t oldtop = mi_atomic_add_acq_rel(&mi_arena_static_top, oversize); + size_t top = oldtop + oversize; + if (top > MI_ARENA_STATIC_MAX) { + // try to roll back, ok if this fails + mi_atomic_cas_strong_acq_rel(&mi_arena_static_top, &top, oldtop); + return NULL; + } + + // success + *memid = _mi_memid_create(MI_MEM_STATIC); + const size_t start = _mi_align_up(oldtop, alignment); + uint8_t* const p = &mi_arena_static[start]; + _mi_memzero(p, size); + return p; +} + +static void* mi_arena_meta_zalloc(size_t size, mi_memid_t* memid, mi_stats_t* stats) { + *memid = _mi_memid_none(); + + // try static + void* p = mi_arena_static_zalloc(size, MI_ALIGNMENT_MAX, memid); + if (p != NULL) return p; + + // or fall back to the OS + return _mi_os_alloc(size, memid, stats); +} + +static void mi_arena_meta_free(void* p, mi_memid_t memid, size_t size, mi_stats_t* stats) { + if (mi_memkind_is_os(memid.memkind)) { + _mi_os_free(p, size, memid, stats); + } + else { + mi_assert(memid.memkind == MI_MEM_STATIC); + } +} + +static void* mi_arena_block_start(mi_arena_t* arena, mi_bitmap_index_t bindex) { + return (arena->start + mi_arena_block_size(mi_bitmap_index_bit(bindex))); +} + + /* ----------------------------------------------------------- Thread safe allocation in an arena ----------------------------------------------------------- */ -static bool mi_arena_alloc(mi_arena_t* arena, size_t blocks, mi_bitmap_index_t* bitmap_idx) + +// claim the `blocks_inuse` bits +static bool mi_arena_try_claim(mi_arena_t* arena, size_t blocks, mi_bitmap_index_t* bitmap_idx) { - const size_t fcount = arena->field_count; - size_t idx = mi_atomic_load_acquire(&arena->search_idx); // start from last search - for (size_t visited = 0; visited < fcount; visited++, idx++) { - if (idx >= fcount) idx = 0; // wrap around - // try to atomically claim a range of bits - if (mi_bitmap_try_find_claim_field(arena->blocks_inuse, idx, blocks, bitmap_idx)) { - mi_atomic_store_release(&arena->search_idx, idx); // start search from here next time - return true; - } - } + size_t idx = 0; // mi_atomic_load_relaxed(&arena->search_idx); // start from last search; ok to be relaxed as the exact start does not matter + if (_mi_bitmap_try_find_from_claim_across(arena->blocks_inuse, arena->field_count, idx, blocks, bitmap_idx)) { + mi_atomic_store_relaxed(&arena->search_idx, mi_bitmap_index_field(*bitmap_idx)); // start search from found location next time around + return true; + }; return false; } @@ -122,114 +216,412 @@ static bool mi_arena_alloc(mi_arena_t* arena, size_t blocks, mi_bitmap_index_t* Arena Allocation ----------------------------------------------------------- */ -static void* mi_arena_alloc_from(mi_arena_t* arena, size_t arena_index, size_t needed_bcount, - bool* commit, bool* large, bool* is_zero, size_t* memid, mi_os_tld_t* tld) +static mi_decl_noinline void* mi_arena_try_alloc_at(mi_arena_t* arena, size_t arena_index, size_t needed_bcount, + bool commit, mi_memid_t* memid, mi_os_tld_t* tld) { - mi_bitmap_index_t bitmap_index; - if (!mi_arena_alloc(arena, needed_bcount, &bitmap_index)) return NULL; + MI_UNUSED(arena_index); + mi_assert_internal(mi_arena_id_index(arena->id) == arena_index); - // claimed it! set the dirty bits (todo: no need for an atomic op here?) - void* p = arena->start + (mi_bitmap_index_bit(bitmap_index)*MI_ARENA_BLOCK_SIZE); - *memid = mi_arena_id_create(arena_index, bitmap_index); - *is_zero = mi_bitmap_claim(arena->blocks_dirty, arena->field_count, needed_bcount, bitmap_index, NULL); - *large = arena->is_large; - if (arena->is_committed) { - // always committed - *commit = true; + mi_bitmap_index_t bitmap_index; + if (!mi_arena_try_claim(arena, needed_bcount, &bitmap_index)) return NULL; + + // claimed it! + void* p = mi_arena_block_start(arena, bitmap_index); + *memid = mi_memid_create_arena(arena->id, arena->exclusive, bitmap_index); + memid->is_pinned = arena->memid.is_pinned; + + // none of the claimed blocks should be scheduled for a decommit + if (arena->blocks_purge != NULL) { + // this is thread safe as a potential purge only decommits parts that are not yet claimed as used (in `blocks_inuse`). + _mi_bitmap_unclaim_across(arena->blocks_purge, arena->field_count, needed_bcount, bitmap_index); } - else if (*commit) { - // arena not committed as a whole, but commit requested: ensure commit now + + // set the dirty bits (todo: no need for an atomic op here?) + if (arena->memid.initially_zero && arena->blocks_dirty != NULL) { + memid->initially_zero = _mi_bitmap_claim_across(arena->blocks_dirty, arena->field_count, needed_bcount, bitmap_index, NULL); + } + + // set commit state + if (arena->blocks_committed == NULL) { + // always committed + memid->initially_committed = true; + } + else if (commit) { + // commit requested, but the range may not be committed as a whole: ensure it is committed now + memid->initially_committed = true; bool any_uncommitted; - mi_bitmap_claim(arena->blocks_committed, arena->field_count, needed_bcount, bitmap_index, &any_uncommitted); + _mi_bitmap_claim_across(arena->blocks_committed, arena->field_count, needed_bcount, bitmap_index, &any_uncommitted); if (any_uncommitted) { - bool commit_zero; - _mi_os_commit(p, needed_bcount * MI_ARENA_BLOCK_SIZE, &commit_zero, tld->stats); - if (commit_zero) *is_zero = true; + bool commit_zero = false; + if (!_mi_os_commit(p, mi_arena_block_size(needed_bcount), &commit_zero, tld->stats)) { + memid->initially_committed = false; + } + else { + if (commit_zero) { memid->initially_zero = true; } + } } } else { // no need to commit, but check if already fully committed - *commit = mi_bitmap_is_claimed(arena->blocks_committed, arena->field_count, needed_bcount, bitmap_index); + memid->initially_committed = _mi_bitmap_is_claimed_across(arena->blocks_committed, arena->field_count, needed_bcount, bitmap_index); } + return p; } -void* _mi_arena_alloc_aligned(size_t size, size_t alignment, - bool* commit, bool* large, bool* is_zero, - size_t* memid, mi_os_tld_t* tld) +// allocate in a speficic arena +static void* mi_arena_try_alloc_at_id(mi_arena_id_t arena_id, bool match_numa_node, int numa_node, size_t size, size_t alignment, + bool commit, bool allow_large, mi_arena_id_t req_arena_id, mi_memid_t* memid, mi_os_tld_t* tld ) { - mi_assert_internal(commit != NULL && large != NULL && is_zero != NULL && memid != NULL && tld != NULL); - mi_assert_internal(size > 0); - *memid = MI_MEMID_OS; - *is_zero = false; + MI_UNUSED_RELEASE(alignment); + mi_assert_internal(alignment <= MI_SEGMENT_ALIGN); + const size_t bcount = mi_block_count_of_size(size); + const size_t arena_index = mi_arena_id_index(arena_id); + mi_assert_internal(arena_index < mi_atomic_load_relaxed(&mi_arena_count)); + mi_assert_internal(size <= mi_arena_block_size(bcount)); + + // Check arena suitability + mi_arena_t* arena = mi_atomic_load_ptr_acquire(mi_arena_t, &mi_arenas[arena_index]); + if (arena == NULL) return NULL; + if (!allow_large && arena->is_large) return NULL; + if (!mi_arena_id_is_suitable(arena->id, arena->exclusive, req_arena_id)) return NULL; + if (req_arena_id == _mi_arena_id_none()) { // in not specific, check numa affinity + const bool numa_suitable = (numa_node < 0 || arena->numa_node < 0 || arena->numa_node == numa_node); + if (match_numa_node) { if (!numa_suitable) return NULL; } + else { if (numa_suitable) return NULL; } + } - // try to allocate in an arena if the alignment is small enough - // and the object is not too large or too small. - if (alignment <= MI_SEGMENT_ALIGN && - size <= MI_ARENA_MAX_OBJ_SIZE && - size >= MI_ARENA_MIN_OBJ_SIZE) - { - const size_t bcount = mi_block_count_of_size(size); - const int numa_node = _mi_os_numa_node(tld); // current numa node + // try to allocate + void* p = mi_arena_try_alloc_at(arena, arena_index, bcount, commit, memid, tld); + mi_assert_internal(p == NULL || _mi_is_aligned(p, alignment)); + return p; +} - mi_assert_internal(size <= bcount*MI_ARENA_BLOCK_SIZE); + +// allocate from an arena with fallback to the OS +static mi_decl_noinline void* mi_arena_try_alloc(int numa_node, size_t size, size_t alignment, + bool commit, bool allow_large, + mi_arena_id_t req_arena_id, mi_memid_t* memid, mi_os_tld_t* tld ) +{ + MI_UNUSED(alignment); + mi_assert_internal(alignment <= MI_SEGMENT_ALIGN); + const size_t max_arena = mi_atomic_load_relaxed(&mi_arena_count); + if mi_likely(max_arena == 0) return NULL; + + if (req_arena_id != _mi_arena_id_none()) { + // try a specific arena if requested + if (mi_arena_id_index(req_arena_id) < max_arena) { + void* p = mi_arena_try_alloc_at_id(req_arena_id, true, numa_node, size, alignment, commit, allow_large, req_arena_id, memid, tld); + if (p != NULL) return p; + } + } + else { // try numa affine allocation - for (size_t i = 0; i < MI_MAX_ARENAS; i++) { - mi_arena_t* arena = mi_atomic_load_ptr_relaxed(mi_arena_t, &mi_arenas[i]); - if (arena==NULL) break; // end reached - if ((arena->numa_node<0 || arena->numa_node==numa_node) && // numa local? - (*large || !arena->is_large)) // large OS pages allowed, or arena is not large OS pages - { - void* p = mi_arena_alloc_from(arena, i, bcount, commit, large, is_zero, memid, tld); - mi_assert_internal((uintptr_t)p % alignment == 0); + for (size_t i = 0; i < max_arena; i++) { + void* p = mi_arena_try_alloc_at_id(mi_arena_id_create(i), true, numa_node, size, alignment, commit, allow_large, req_arena_id, memid, tld); + if (p != NULL) return p; + } + + // try from another numa node instead.. + if (numa_node >= 0) { // if numa_node was < 0 (no specific affinity requested), all arena's have been tried already + for (size_t i = 0; i < max_arena; i++) { + void* p = mi_arena_try_alloc_at_id(mi_arena_id_create(i), false /* only proceed if not numa local */, numa_node, size, alignment, commit, allow_large, req_arena_id, memid, tld); if (p != NULL) return p; } } - // try from another numa node instead.. - for (size_t i = 0; i < MI_MAX_ARENAS; i++) { - mi_arena_t* arena = mi_atomic_load_ptr_relaxed(mi_arena_t, &mi_arenas[i]); - if (arena==NULL) break; // end reached - if ((arena->numa_node>=0 && arena->numa_node!=numa_node) && // not numa local! - (*large || !arena->is_large)) // large OS pages allowed, or arena is not large OS pages - { - void* p = mi_arena_alloc_from(arena, i, bcount, commit, large, is_zero, memid, tld); - mi_assert_internal((uintptr_t)p % alignment == 0); + } + return NULL; +} + +// try to reserve a fresh arena space +static bool mi_arena_reserve(size_t req_size, bool allow_large, mi_arena_id_t req_arena_id, mi_arena_id_t *arena_id) +{ + if (_mi_preloading()) return false; // use OS only while pre loading + if (req_arena_id != _mi_arena_id_none()) return false; + + const size_t arena_count = mi_atomic_load_acquire(&mi_arena_count); + if (arena_count > (MI_MAX_ARENAS - 4)) return false; + + size_t arena_reserve = mi_option_get_size(mi_option_arena_reserve); + if (arena_reserve == 0) return false; + + if (!_mi_os_has_virtual_reserve()) { + arena_reserve = arena_reserve/4; // be conservative if virtual reserve is not supported (for some embedded systems for example) + } + arena_reserve = _mi_align_up(arena_reserve, MI_ARENA_BLOCK_SIZE); + if (arena_count >= 8 && arena_count <= 128) { + arena_reserve = ((size_t)1<<(arena_count/8)) * arena_reserve; // scale up the arena sizes exponentially + } + if (arena_reserve < req_size) return false; // should be able to at least handle the current allocation size + + // commit eagerly? + bool arena_commit = false; + if (mi_option_get(mi_option_arena_eager_commit) == 2) { arena_commit = _mi_os_has_overcommit(); } + else if (mi_option_get(mi_option_arena_eager_commit) == 1) { arena_commit = true; } + + return (mi_reserve_os_memory_ex(arena_reserve, arena_commit, allow_large, false /* exclusive */, arena_id) == 0); +} + + +void* _mi_arena_alloc_aligned(size_t size, size_t alignment, size_t align_offset, bool commit, bool allow_large, + mi_arena_id_t req_arena_id, mi_memid_t* memid, mi_os_tld_t* tld) +{ + mi_assert_internal(memid != NULL && tld != NULL); + mi_assert_internal(size > 0); + *memid = _mi_memid_none(); + + const int numa_node = _mi_os_numa_node(tld); // current numa node + + // try to allocate in an arena if the alignment is small enough and the object is not too small (as for heap meta data) + if (size >= MI_ARENA_MIN_OBJ_SIZE && alignment <= MI_SEGMENT_ALIGN && align_offset == 0) { + void* p = mi_arena_try_alloc(numa_node, size, alignment, commit, allow_large, req_arena_id, memid, tld); + if (p != NULL) return p; + + // otherwise, try to first eagerly reserve a new arena + if (req_arena_id == _mi_arena_id_none()) { + mi_arena_id_t arena_id = 0; + if (mi_arena_reserve(size, allow_large, req_arena_id, &arena_id)) { + // and try allocate in there + mi_assert_internal(req_arena_id == _mi_arena_id_none()); + p = mi_arena_try_alloc_at_id(arena_id, true, numa_node, size, alignment, commit, allow_large, req_arena_id, memid, tld); if (p != NULL) return p; } } } + // if we cannot use OS allocation, return NULL + if (mi_option_is_enabled(mi_option_limit_os_alloc) || req_arena_id != _mi_arena_id_none()) { + errno = ENOMEM; + return NULL; + } + // finally, fall back to the OS - *is_zero = true; - *memid = MI_MEMID_OS; - return _mi_os_alloc_aligned(size, alignment, *commit, large, tld); + if (align_offset > 0) { + return _mi_os_alloc_aligned_at_offset(size, alignment, align_offset, commit, allow_large, memid, tld->stats); + } + else { + return _mi_os_alloc_aligned(size, alignment, commit, allow_large, memid, tld->stats); + } } -void* _mi_arena_alloc(size_t size, bool* commit, bool* large, bool* is_zero, size_t* memid, mi_os_tld_t* tld) +void* _mi_arena_alloc(size_t size, bool commit, bool allow_large, mi_arena_id_t req_arena_id, mi_memid_t* memid, mi_os_tld_t* tld) { - return _mi_arena_alloc_aligned(size, MI_ARENA_BLOCK_SIZE, commit, large, is_zero, memid, tld); + return _mi_arena_alloc_aligned(size, MI_ARENA_BLOCK_SIZE, 0, commit, allow_large, req_arena_id, memid, tld); } + +void* mi_arena_area(mi_arena_id_t arena_id, size_t* size) { + if (size != NULL) *size = 0; + size_t arena_index = mi_arena_id_index(arena_id); + if (arena_index >= MI_MAX_ARENAS) return NULL; + mi_arena_t* arena = mi_atomic_load_ptr_acquire(mi_arena_t, &mi_arenas[arena_index]); + if (arena == NULL) return NULL; + if (size != NULL) { *size = mi_arena_block_size(arena->block_count); } + return arena->start; +} + + +/* ----------------------------------------------------------- + Arena purge +----------------------------------------------------------- */ + +static long mi_arena_purge_delay(void) { + // <0 = no purging allowed, 0=immediate purging, >0=milli-second delay + return (mi_option_get(mi_option_purge_delay) * mi_option_get(mi_option_arena_purge_mult)); +} + +// reset or decommit in an arena and update the committed/decommit bitmaps +// assumes we own the area (i.e. blocks_in_use is claimed by us) +static void mi_arena_purge(mi_arena_t* arena, size_t bitmap_idx, size_t blocks, mi_stats_t* stats) { + mi_assert_internal(arena->blocks_committed != NULL); + mi_assert_internal(arena->blocks_purge != NULL); + mi_assert_internal(!arena->memid.is_pinned); + const size_t size = mi_arena_block_size(blocks); + void* const p = mi_arena_block_start(arena, bitmap_idx); + bool needs_recommit; + if (_mi_bitmap_is_claimed_across(arena->blocks_committed, arena->field_count, blocks, bitmap_idx)) { + // all blocks are committed, we can purge freely + needs_recommit = _mi_os_purge(p, size, stats); + } + else { + // some blocks are not committed -- this can happen when a partially committed block is freed + // in `_mi_arena_free` and it is conservatively marked as uncommitted but still scheduled for a purge + // we need to ensure we do not try to reset (as that may be invalid for uncommitted memory), + // and also undo the decommit stats (as it was already adjusted) + mi_assert_internal(mi_option_is_enabled(mi_option_purge_decommits)); + needs_recommit = _mi_os_purge_ex(p, size, false /* allow reset? */, stats); + _mi_stat_increase(&stats->committed, size); + } + + // clear the purged blocks + _mi_bitmap_unclaim_across(arena->blocks_purge, arena->field_count, blocks, bitmap_idx); + // update committed bitmap + if (needs_recommit) { + _mi_bitmap_unclaim_across(arena->blocks_committed, arena->field_count, blocks, bitmap_idx); + } +} + +// Schedule a purge. This is usually delayed to avoid repeated decommit/commit calls. +// Note: assumes we (still) own the area as we may purge immediately +static void mi_arena_schedule_purge(mi_arena_t* arena, size_t bitmap_idx, size_t blocks, mi_stats_t* stats) { + mi_assert_internal(arena->blocks_purge != NULL); + const long delay = mi_arena_purge_delay(); + if (delay < 0) return; // is purging allowed at all? + + if (_mi_preloading() || delay == 0) { + // decommit directly + mi_arena_purge(arena, bitmap_idx, blocks, stats); + } + else { + // schedule decommit + mi_msecs_t expire = mi_atomic_loadi64_relaxed(&arena->purge_expire); + if (expire != 0) { + mi_atomic_addi64_acq_rel(&arena->purge_expire, delay/10); // add smallish extra delay + } + else { + mi_atomic_storei64_release(&arena->purge_expire, _mi_clock_now() + delay); + } + _mi_bitmap_claim_across(arena->blocks_purge, arena->field_count, blocks, bitmap_idx, NULL); + } +} + +// purge a range of blocks +// return true if the full range was purged. +// assumes we own the area (i.e. blocks_in_use is claimed by us) +static bool mi_arena_purge_range(mi_arena_t* arena, size_t idx, size_t startidx, size_t bitlen, size_t purge, mi_stats_t* stats) { + const size_t endidx = startidx + bitlen; + size_t bitidx = startidx; + bool all_purged = false; + while (bitidx < endidx) { + // count consequetive ones in the purge mask + size_t count = 0; + while (bitidx + count < endidx && (purge & ((size_t)1 << (bitidx + count))) != 0) { + count++; + } + if (count > 0) { + // found range to be purged + const mi_bitmap_index_t range_idx = mi_bitmap_index_create(idx, bitidx); + mi_arena_purge(arena, range_idx, count, stats); + if (count == bitlen) { + all_purged = true; + } + } + bitidx += (count+1); // +1 to skip the zero bit (or end) + } + return all_purged; +} + +// returns true if anything was purged +static bool mi_arena_try_purge(mi_arena_t* arena, mi_msecs_t now, bool force, mi_stats_t* stats) +{ + if (arena->memid.is_pinned || arena->blocks_purge == NULL) return false; + mi_msecs_t expire = mi_atomic_loadi64_relaxed(&arena->purge_expire); + if (expire == 0) return false; + if (!force && expire > now) return false; + + // reset expire (if not already set concurrently) + mi_atomic_casi64_strong_acq_rel(&arena->purge_expire, &expire, 0); + + // potential purges scheduled, walk through the bitmap + bool any_purged = false; + bool full_purge = true; + for (size_t i = 0; i < arena->field_count; i++) { + size_t purge = mi_atomic_load_relaxed(&arena->blocks_purge[i]); + if (purge != 0) { + size_t bitidx = 0; + while (bitidx < MI_BITMAP_FIELD_BITS) { + // find consequetive range of ones in the purge mask + size_t bitlen = 0; + while (bitidx + bitlen < MI_BITMAP_FIELD_BITS && (purge & ((size_t)1 << (bitidx + bitlen))) != 0) { + bitlen++; + } + // try to claim the longest range of corresponding in_use bits + const mi_bitmap_index_t bitmap_index = mi_bitmap_index_create(i, bitidx); + while( bitlen > 0 ) { + if (_mi_bitmap_try_claim(arena->blocks_inuse, arena->field_count, bitlen, bitmap_index)) { + break; + } + bitlen--; + } + // actual claimed bits at `in_use` + if (bitlen > 0) { + // read purge again now that we have the in_use bits + purge = mi_atomic_load_acquire(&arena->blocks_purge[i]); + if (!mi_arena_purge_range(arena, i, bitidx, bitlen, purge, stats)) { + full_purge = false; + } + any_purged = true; + // release the claimed `in_use` bits again + _mi_bitmap_unclaim(arena->blocks_inuse, arena->field_count, bitlen, bitmap_index); + } + bitidx += (bitlen+1); // +1 to skip the zero (or end) + } // while bitidx + } // purge != 0 + } + // if not fully purged, make sure to purge again in the future + if (!full_purge) { + const long delay = mi_arena_purge_delay(); + mi_msecs_t expected = 0; + mi_atomic_casi64_strong_acq_rel(&arena->purge_expire,&expected,_mi_clock_now() + delay); + } + return any_purged; +} + +static void mi_arenas_try_purge( bool force, bool visit_all, mi_stats_t* stats ) { + if (_mi_preloading() || mi_arena_purge_delay() <= 0) return; // nothing will be scheduled + + const size_t max_arena = mi_atomic_load_acquire(&mi_arena_count); + if (max_arena == 0) return; + + // allow only one thread to purge at a time + static mi_atomic_guard_t purge_guard; + mi_atomic_guard(&purge_guard) + { + mi_msecs_t now = _mi_clock_now(); + size_t max_purge_count = (visit_all ? max_arena : 1); + for (size_t i = 0; i < max_arena; i++) { + mi_arena_t* arena = mi_atomic_load_ptr_acquire(mi_arena_t, &mi_arenas[i]); + if (arena != NULL) { + if (mi_arena_try_purge(arena, now, force, stats)) { + if (max_purge_count <= 1) break; + max_purge_count--; + } + } + } + } +} + + /* ----------------------------------------------------------- Arena free ----------------------------------------------------------- */ -void _mi_arena_free(void* p, size_t size, size_t memid, bool all_committed, mi_stats_t* stats) { +void _mi_arena_free(void* p, size_t size, size_t committed_size, mi_memid_t memid, mi_stats_t* stats) { mi_assert_internal(size > 0 && stats != NULL); + mi_assert_internal(committed_size <= size); if (p==NULL) return; if (size==0) return; - if (memid == MI_MEMID_OS) { + const bool all_committed = (committed_size == size); + + if (mi_memkind_is_os(memid.memkind)) { // was a direct OS allocation, pass through - _mi_os_free_ex(p, size, all_committed, stats); + if (!all_committed && committed_size > 0) { + // if partially committed, adjust the committed stats (as `_mi_os_free` will increase decommit by the full size) + _mi_stat_decrease(&stats->committed, committed_size); + } + _mi_os_free(p, size, memid, stats); } - else { + else if (memid.memkind == MI_MEM_ARENA) { // allocated in an arena size_t arena_idx; size_t bitmap_idx; - mi_arena_id_indices(memid, &arena_idx, &bitmap_idx); + mi_arena_memid_indices(memid, &arena_idx, &bitmap_idx); mi_assert_internal(arena_idx < MI_MAX_ARENAS); - mi_arena_t* arena = mi_atomic_load_ptr_relaxed(mi_arena_t,&mi_arenas[arena_idx]); + mi_arena_t* arena = mi_atomic_load_ptr_acquire(mi_arena_t,&mi_arenas[arena_idx]); mi_assert_internal(arena != NULL); + const size_t blocks = mi_block_count_of_size(size); + + // checks if (arena == NULL) { _mi_error_message(EINVAL, "trying to free from non-existent arena: %p, size %zu, memid: 0x%zx\n", p, size, memid); return; @@ -239,85 +631,271 @@ void _mi_arena_free(void* p, size_t size, size_t memid, bool all_committed, mi_s _mi_error_message(EINVAL, "trying to free from non-existent arena block: %p, size %zu, memid: 0x%zx\n", p, size, memid); return; } - const size_t blocks = mi_block_count_of_size(size); - bool ones = mi_bitmap_unclaim(arena->blocks_inuse, arena->field_count, blocks, bitmap_idx); - if (!ones) { - _mi_error_message(EAGAIN, "trying to free an already freed block: %p, size %zu\n", p, size); + + // need to set all memory to undefined as some parts may still be marked as no_access (like padding etc.) + mi_track_mem_undefined(p,size); + + // potentially decommit + if (arena->memid.is_pinned || arena->blocks_committed == NULL) { + mi_assert_internal(all_committed); + } + else { + mi_assert_internal(arena->blocks_committed != NULL); + mi_assert_internal(arena->blocks_purge != NULL); + + if (!all_committed) { + // mark the entire range as no longer committed (so we recommit the full range when re-using) + _mi_bitmap_unclaim_across(arena->blocks_committed, arena->field_count, blocks, bitmap_idx); + mi_track_mem_noaccess(p,size); + if (committed_size > 0) { + // if partially committed, adjust the committed stats (is it will be recommitted when re-using) + // in the delayed purge, we now need to not count a decommit if the range is not marked as committed. + _mi_stat_decrease(&stats->committed, committed_size); + } + // note: if not all committed, it may be that the purge will reset/decommit the entire range + // that contains already decommitted parts. Since purge consistently uses reset or decommit that + // works (as we should never reset decommitted parts). + } + // (delay) purge the entire range + mi_arena_schedule_purge(arena, bitmap_idx, blocks, stats); + } + + // and make it available to others again + bool all_inuse = _mi_bitmap_unclaim_across(arena->blocks_inuse, arena->field_count, blocks, bitmap_idx); + if (!all_inuse) { + _mi_error_message(EAGAIN, "trying to free an already freed arena block: %p, size %zu\n", p, size); return; }; } + else { + // arena was none, external, or static; nothing to do + mi_assert_internal(memid.memkind < MI_MEM_OS); + } + + // purge expired decommits + mi_arenas_try_purge(false, false, stats); } +// destroy owned arenas; this is unsafe and should only be done using `mi_option_destroy_on_exit` +// for dynamic libraries that are unloaded and need to release all their allocated memory. +static void mi_arenas_unsafe_destroy(void) { + const size_t max_arena = mi_atomic_load_relaxed(&mi_arena_count); + size_t new_max_arena = 0; + for (size_t i = 0; i < max_arena; i++) { + mi_arena_t* arena = mi_atomic_load_ptr_acquire(mi_arena_t, &mi_arenas[i]); + if (arena != NULL) { + if (arena->start != NULL && mi_memkind_is_os(arena->memid.memkind)) { + mi_atomic_store_ptr_release(mi_arena_t, &mi_arenas[i], NULL); + _mi_os_free(arena->start, mi_arena_size(arena), arena->memid, &_mi_stats_main); + } + else { + new_max_arena = i; + } + mi_arena_meta_free(arena, arena->meta_memid, arena->meta_size, &_mi_stats_main); + } + } + + // try to lower the max arena. + size_t expected = max_arena; + mi_atomic_cas_strong_acq_rel(&mi_arena_count, &expected, new_max_arena); +} + +// Purge the arenas; if `force_purge` is true, amenable parts are purged even if not yet expired +void _mi_arena_collect(bool force_purge, mi_stats_t* stats) { + mi_arenas_try_purge(force_purge, true /* visit all */, stats); +} + +// destroy owned arenas; this is unsafe and should only be done using `mi_option_destroy_on_exit` +// for dynamic libraries that are unloaded and need to release all their allocated memory. +void _mi_arena_unsafe_destroy_all(mi_stats_t* stats) { + mi_arenas_unsafe_destroy(); + _mi_arena_collect(true /* force purge */, stats); // purge non-owned arenas +} + +// Is a pointer inside any of our arenas? +bool _mi_arena_contains(const void* p) { + const size_t max_arena = mi_atomic_load_relaxed(&mi_arena_count); + for (size_t i = 0; i < max_arena; i++) { + mi_arena_t* arena = mi_atomic_load_ptr_acquire(mi_arena_t, &mi_arenas[i]); + if (arena != NULL && arena->start <= (const uint8_t*)p && arena->start + mi_arena_block_size(arena->block_count) > (const uint8_t*)p) { + return true; + } + } + return false; +} + + /* ----------------------------------------------------------- Add an arena. ----------------------------------------------------------- */ -static bool mi_arena_add(mi_arena_t* arena) { +static bool mi_arena_add(mi_arena_t* arena, mi_arena_id_t* arena_id) { mi_assert_internal(arena != NULL); mi_assert_internal((uintptr_t)mi_atomic_load_ptr_relaxed(uint8_t,&arena->start) % MI_SEGMENT_ALIGN == 0); mi_assert_internal(arena->block_count > 0); + if (arena_id != NULL) { *arena_id = -1; } - uintptr_t i = mi_atomic_increment_acq_rel(&mi_arena_count); + size_t i = mi_atomic_increment_acq_rel(&mi_arena_count); if (i >= MI_MAX_ARENAS) { mi_atomic_decrement_acq_rel(&mi_arena_count); return false; } + arena->id = mi_arena_id_create(i); mi_atomic_store_ptr_release(mi_arena_t,&mi_arenas[i], arena); + if (arena_id != NULL) { *arena_id = arena->id; } return true; } +static bool mi_manage_os_memory_ex2(void* start, size_t size, bool is_large, int numa_node, bool exclusive, mi_memid_t memid, mi_arena_id_t* arena_id) mi_attr_noexcept +{ + if (arena_id != NULL) *arena_id = _mi_arena_id_none(); + if (size < MI_ARENA_BLOCK_SIZE) return false; + + if (is_large) { + mi_assert_internal(memid.initially_committed && memid.is_pinned); + } + + const size_t bcount = size / MI_ARENA_BLOCK_SIZE; + const size_t fields = _mi_divide_up(bcount, MI_BITMAP_FIELD_BITS); + const size_t bitmaps = (memid.is_pinned ? 2 : 4); + const size_t asize = sizeof(mi_arena_t) + (bitmaps*fields*sizeof(mi_bitmap_field_t)); + mi_memid_t meta_memid; + mi_arena_t* arena = (mi_arena_t*)mi_arena_meta_zalloc(asize, &meta_memid, &_mi_stats_main); // TODO: can we avoid allocating from the OS? + if (arena == NULL) return false; + + // already zero'd due to os_alloc + // _mi_memzero(arena, asize); + arena->id = _mi_arena_id_none(); + arena->memid = memid; + arena->exclusive = exclusive; + arena->meta_size = asize; + arena->meta_memid = meta_memid; + arena->block_count = bcount; + arena->field_count = fields; + arena->start = (uint8_t*)start; + arena->numa_node = numa_node; // TODO: or get the current numa node if -1? (now it allows anyone to allocate on -1) + arena->is_large = is_large; + arena->purge_expire = 0; + arena->search_idx = 0; + arena->blocks_dirty = &arena->blocks_inuse[fields]; // just after inuse bitmap + arena->blocks_committed = (arena->memid.is_pinned ? NULL : &arena->blocks_inuse[2*fields]); // just after dirty bitmap + arena->blocks_purge = (arena->memid.is_pinned ? NULL : &arena->blocks_inuse[3*fields]); // just after committed bitmap + // initialize committed bitmap? + if (arena->blocks_committed != NULL && arena->memid.initially_committed) { + memset((void*)arena->blocks_committed, 0xFF, fields*sizeof(mi_bitmap_field_t)); // cast to void* to avoid atomic warning + } + + // and claim leftover blocks if needed (so we never allocate there) + ptrdiff_t post = (fields * MI_BITMAP_FIELD_BITS) - bcount; + mi_assert_internal(post >= 0); + if (post > 0) { + // don't use leftover bits at the end + mi_bitmap_index_t postidx = mi_bitmap_index_create(fields - 1, MI_BITMAP_FIELD_BITS - post); + _mi_bitmap_claim(arena->blocks_inuse, fields, post, postidx, NULL); + } + return mi_arena_add(arena, arena_id); + +} + +bool mi_manage_os_memory_ex(void* start, size_t size, bool is_committed, bool is_large, bool is_zero, int numa_node, bool exclusive, mi_arena_id_t* arena_id) mi_attr_noexcept { + mi_memid_t memid = _mi_memid_create(MI_MEM_EXTERNAL); + memid.initially_committed = is_committed; + memid.initially_zero = is_zero; + memid.is_pinned = is_large; + return mi_manage_os_memory_ex2(start,size,is_large,numa_node,exclusive,memid, arena_id); +} + +// Reserve a range of regular OS memory +int mi_reserve_os_memory_ex(size_t size, bool commit, bool allow_large, bool exclusive, mi_arena_id_t* arena_id) mi_attr_noexcept { + if (arena_id != NULL) *arena_id = _mi_arena_id_none(); + size = _mi_align_up(size, MI_ARENA_BLOCK_SIZE); // at least one block + mi_memid_t memid; + void* start = _mi_os_alloc_aligned(size, MI_SEGMENT_ALIGN, commit, allow_large, &memid, &_mi_stats_main); + if (start == NULL) return ENOMEM; + const bool is_large = memid.is_pinned; // todo: use separate is_large field? + if (!mi_manage_os_memory_ex2(start, size, is_large, -1 /* numa node */, exclusive, memid, arena_id)) { + _mi_os_free_ex(start, size, commit, memid, &_mi_stats_main); + _mi_verbose_message("failed to reserve %zu k memory\n", _mi_divide_up(size, 1024)); + return ENOMEM; + } + _mi_verbose_message("reserved %zu KiB memory%s\n", _mi_divide_up(size, 1024), is_large ? " (in large os pages)" : ""); + return 0; +} + + +// Manage a range of regular OS memory +bool mi_manage_os_memory(void* start, size_t size, bool is_committed, bool is_large, bool is_zero, int numa_node) mi_attr_noexcept { + return mi_manage_os_memory_ex(start, size, is_committed, is_large, is_zero, numa_node, false /* exclusive? */, NULL); +} + +// Reserve a range of regular OS memory +int mi_reserve_os_memory(size_t size, bool commit, bool allow_large) mi_attr_noexcept { + return mi_reserve_os_memory_ex(size, commit, allow_large, false, NULL); +} + + +/* ----------------------------------------------------------- + Debugging +----------------------------------------------------------- */ + +static size_t mi_debug_show_bitmap(const char* prefix, mi_bitmap_field_t* fields, size_t field_count ) { + size_t inuse_count = 0; + for (size_t i = 0; i < field_count; i++) { + char buf[MI_BITMAP_FIELD_BITS + 1]; + uintptr_t field = mi_atomic_load_relaxed(&fields[i]); + for (size_t bit = 0; bit < MI_BITMAP_FIELD_BITS; bit++) { + bool inuse = ((((uintptr_t)1 << bit) & field) != 0); + if (inuse) inuse_count++; + buf[MI_BITMAP_FIELD_BITS - 1 - bit] = (inuse ? 'x' : '.'); + } + buf[MI_BITMAP_FIELD_BITS] = 0; + _mi_verbose_message("%s%s\n", prefix, buf); + } + return inuse_count; +} + +void mi_debug_show_arenas(void) mi_attr_noexcept { + size_t max_arenas = mi_atomic_load_relaxed(&mi_arena_count); + for (size_t i = 0; i < max_arenas; i++) { + mi_arena_t* arena = mi_atomic_load_ptr_relaxed(mi_arena_t, &mi_arenas[i]); + if (arena == NULL) break; + size_t inuse_count = 0; + _mi_verbose_message("arena %zu: %zu blocks with %zu fields\n", i, arena->block_count, arena->field_count); + inuse_count += mi_debug_show_bitmap(" ", arena->blocks_inuse, arena->field_count); + _mi_verbose_message(" blocks in use ('x'): %zu\n", inuse_count); + } +} + /* ----------------------------------------------------------- Reserve a huge page arena. ----------------------------------------------------------- */ -#include // ENOMEM - // reserve at a specific numa node -int mi_reserve_huge_os_pages_at(size_t pages, int numa_node, size_t timeout_msecs) mi_attr_noexcept { +int mi_reserve_huge_os_pages_at_ex(size_t pages, int numa_node, size_t timeout_msecs, bool exclusive, mi_arena_id_t* arena_id) mi_attr_noexcept { + if (arena_id != NULL) *arena_id = -1; if (pages==0) return 0; if (numa_node < -1) numa_node = -1; if (numa_node >= 0) numa_node = numa_node % _mi_os_numa_node_count(); size_t hsize = 0; size_t pages_reserved = 0; - void* p = _mi_os_alloc_huge_os_pages(pages, numa_node, timeout_msecs, &pages_reserved, &hsize); + mi_memid_t memid; + void* p = _mi_os_alloc_huge_os_pages(pages, numa_node, timeout_msecs, &pages_reserved, &hsize, &memid); if (p==NULL || pages_reserved==0) { - _mi_warning_message("failed to reserve %zu gb huge pages\n", pages); + _mi_warning_message("failed to reserve %zu GiB huge pages\n", pages); return ENOMEM; } - _mi_verbose_message("numa node %i: reserved %zu gb huge pages (of the %zu gb requested)\n", numa_node, pages_reserved, pages); + _mi_verbose_message("numa node %i: reserved %zu GiB huge pages (of the %zu GiB requested)\n", numa_node, pages_reserved, pages); - size_t bcount = mi_block_count_of_size(hsize); - size_t fields = _mi_divide_up(bcount, MI_BITMAP_FIELD_BITS); - size_t asize = sizeof(mi_arena_t) + (2*fields*sizeof(mi_bitmap_field_t)); - mi_arena_t* arena = (mi_arena_t*)_mi_os_alloc(asize, &_mi_stats_main); // TODO: can we avoid allocating from the OS? - if (arena == NULL) { - _mi_os_free_huge_pages(p, hsize, &_mi_stats_main); + if (!mi_manage_os_memory_ex2(p, hsize, true, numa_node, exclusive, memid, arena_id)) { + _mi_os_free(p, hsize, memid, &_mi_stats_main); return ENOMEM; } - arena->block_count = bcount; - arena->field_count = fields; - arena->start = (uint8_t*)p; - arena->numa_node = numa_node; // TODO: or get the current numa node if -1? (now it allows anyone to allocate on -1) - arena->is_large = true; - arena->is_zero_init = true; - arena->is_committed = true; - arena->search_idx = 0; - arena->blocks_dirty = &arena->blocks_inuse[fields]; // just after inuse bitmap - arena->blocks_committed = NULL; - // the bitmaps are already zero initialized due to os_alloc - // just claim leftover blocks if needed - ptrdiff_t post = (fields * MI_BITMAP_FIELD_BITS) - bcount; - mi_assert_internal(post >= 0); - if (post > 0) { - // don't use leftover bits at the end - mi_bitmap_index_t postidx = mi_bitmap_index_create(fields - 1, MI_BITMAP_FIELD_BITS - post); - mi_bitmap_claim(arena->blocks_inuse, fields, post, postidx, NULL); - } - - mi_arena_add(arena); return 0; } +int mi_reserve_huge_os_pages_at(size_t pages, int numa_node, size_t timeout_msecs) mi_attr_noexcept { + return mi_reserve_huge_os_pages_at_ex(pages, numa_node, timeout_msecs, false, NULL); +} // reserve huge pages evenly among the given number of numa nodes (or use the available ones as detected) int mi_reserve_huge_os_pages_interleave(size_t pages, size_t numa_nodes, size_t timeout_msecs) mi_attr_noexcept { @@ -348,10 +926,11 @@ int mi_reserve_huge_os_pages_interleave(size_t pages, size_t numa_nodes, size_t } int mi_reserve_huge_os_pages(size_t pages, double max_secs, size_t* pages_reserved) mi_attr_noexcept { - UNUSED(max_secs); + MI_UNUSED(max_secs); _mi_warning_message("mi_reserve_huge_os_pages is deprecated: use mi_reserve_huge_os_pages_interleave/at instead\n"); if (pages_reserved != NULL) *pages_reserved = 0; int err = mi_reserve_huge_os_pages_interleave(pages, 0, (size_t)(max_secs * 1000.0)); if (err==0 && pages_reserved!=NULL) *pages_reserved = pages; return err; } + diff --git a/src/bitmap.c b/src/bitmap.c new file mode 100644 index 0000000..a13dbe1 --- /dev/null +++ b/src/bitmap.c @@ -0,0 +1,432 @@ +/* ---------------------------------------------------------------------------- +Copyright (c) 2019-2023 Microsoft Research, Daan Leijen +This is free software; you can redistribute it and/or modify it under the +terms of the MIT license. A copy of the license can be found in the file +"LICENSE" at the root of this distribution. +-----------------------------------------------------------------------------*/ + +/* ---------------------------------------------------------------------------- +Concurrent bitmap that can set/reset sequences of bits atomically, +represeted as an array of fields where each field is a machine word (`size_t`) + +There are two api's; the standard one cannot have sequences that cross +between the bitmap fields (and a sequence must be <= MI_BITMAP_FIELD_BITS). + +The `_across` postfixed functions do allow sequences that can cross over +between the fields. (This is used in arena allocation) +---------------------------------------------------------------------------- */ + +#include "mimalloc.h" +#include "mimalloc/internal.h" +#include "bitmap.h" + +/* ----------------------------------------------------------- + Bitmap definition +----------------------------------------------------------- */ + +// The bit mask for a given number of blocks at a specified bit index. +static inline size_t mi_bitmap_mask_(size_t count, size_t bitidx) { + mi_assert_internal(count + bitidx <= MI_BITMAP_FIELD_BITS); + mi_assert_internal(count > 0); + if (count >= MI_BITMAP_FIELD_BITS) return MI_BITMAP_FIELD_FULL; + if (count == 0) return 0; + return ((((size_t)1 << count) - 1) << bitidx); +} + + +/* ----------------------------------------------------------- + Claim a bit sequence atomically +----------------------------------------------------------- */ + +// Try to atomically claim a sequence of `count` bits in a single +// field at `idx` in `bitmap`. Returns `true` on success. +inline bool _mi_bitmap_try_find_claim_field(mi_bitmap_t bitmap, size_t idx, const size_t count, mi_bitmap_index_t* bitmap_idx) +{ + mi_assert_internal(bitmap_idx != NULL); + mi_assert_internal(count <= MI_BITMAP_FIELD_BITS); + mi_assert_internal(count > 0); + mi_bitmap_field_t* field = &bitmap[idx]; + size_t map = mi_atomic_load_relaxed(field); + if (map==MI_BITMAP_FIELD_FULL) return false; // short cut + + // search for 0-bit sequence of length count + const size_t mask = mi_bitmap_mask_(count, 0); + const size_t bitidx_max = MI_BITMAP_FIELD_BITS - count; + +#ifdef MI_HAVE_FAST_BITSCAN + size_t bitidx = mi_ctz(~map); // quickly find the first zero bit if possible +#else + size_t bitidx = 0; // otherwise start at 0 +#endif + size_t m = (mask << bitidx); // invariant: m == mask shifted by bitidx + + // scan linearly for a free range of zero bits + while (bitidx <= bitidx_max) { + const size_t mapm = (map & m); + if (mapm == 0) { // are the mask bits free at bitidx? + mi_assert_internal((m >> bitidx) == mask); // no overflow? + const size_t newmap = (map | m); + mi_assert_internal((newmap^map) >> bitidx == mask); + if (!mi_atomic_cas_strong_acq_rel(field, &map, newmap)) { // TODO: use weak cas here? + // no success, another thread claimed concurrently.. keep going (with updated `map`) + continue; + } + else { + // success, we claimed the bits! + *bitmap_idx = mi_bitmap_index_create(idx, bitidx); + return true; + } + } + else { + // on to the next bit range +#ifdef MI_HAVE_FAST_BITSCAN + mi_assert_internal(mapm != 0); + const size_t shift = (count == 1 ? 1 : (MI_INTPTR_BITS - mi_clz(mapm) - bitidx)); + mi_assert_internal(shift > 0 && shift <= count); +#else + const size_t shift = 1; +#endif + bitidx += shift; + m <<= shift; + } + } + // no bits found + return false; +} + +// Find `count` bits of 0 and set them to 1 atomically; returns `true` on success. +// Starts at idx, and wraps around to search in all `bitmap_fields` fields. +// `count` can be at most MI_BITMAP_FIELD_BITS and will never cross fields. +bool _mi_bitmap_try_find_from_claim(mi_bitmap_t bitmap, const size_t bitmap_fields, const size_t start_field_idx, const size_t count, mi_bitmap_index_t* bitmap_idx) { + size_t idx = start_field_idx; + for (size_t visited = 0; visited < bitmap_fields; visited++, idx++) { + if (idx >= bitmap_fields) { idx = 0; } // wrap + if (_mi_bitmap_try_find_claim_field(bitmap, idx, count, bitmap_idx)) { + return true; + } + } + return false; +} + +// Like _mi_bitmap_try_find_from_claim but with an extra predicate that must be fullfilled +bool _mi_bitmap_try_find_from_claim_pred(mi_bitmap_t bitmap, const size_t bitmap_fields, + const size_t start_field_idx, const size_t count, + mi_bitmap_pred_fun_t pred_fun, void* pred_arg, + mi_bitmap_index_t* bitmap_idx) { + size_t idx = start_field_idx; + for (size_t visited = 0; visited < bitmap_fields; visited++, idx++) { + if (idx >= bitmap_fields) idx = 0; // wrap + if (_mi_bitmap_try_find_claim_field(bitmap, idx, count, bitmap_idx)) { + if (pred_fun == NULL || pred_fun(*bitmap_idx, pred_arg)) { + return true; + } + // predicate returned false, unclaim and look further + _mi_bitmap_unclaim(bitmap, bitmap_fields, count, *bitmap_idx); + } + } + return false; +} + +// Set `count` bits at `bitmap_idx` to 0 atomically +// Returns `true` if all `count` bits were 1 previously. +bool _mi_bitmap_unclaim(mi_bitmap_t bitmap, size_t bitmap_fields, size_t count, mi_bitmap_index_t bitmap_idx) { + const size_t idx = mi_bitmap_index_field(bitmap_idx); + const size_t bitidx = mi_bitmap_index_bit_in_field(bitmap_idx); + const size_t mask = mi_bitmap_mask_(count, bitidx); + mi_assert_internal(bitmap_fields > idx); MI_UNUSED(bitmap_fields); + // mi_assert_internal((bitmap[idx] & mask) == mask); + const size_t prev = mi_atomic_and_acq_rel(&bitmap[idx], ~mask); + return ((prev & mask) == mask); +} + + +// Set `count` bits at `bitmap_idx` to 1 atomically +// Returns `true` if all `count` bits were 0 previously. `any_zero` is `true` if there was at least one zero bit. +bool _mi_bitmap_claim(mi_bitmap_t bitmap, size_t bitmap_fields, size_t count, mi_bitmap_index_t bitmap_idx, bool* any_zero) { + const size_t idx = mi_bitmap_index_field(bitmap_idx); + const size_t bitidx = mi_bitmap_index_bit_in_field(bitmap_idx); + const size_t mask = mi_bitmap_mask_(count, bitidx); + mi_assert_internal(bitmap_fields > idx); MI_UNUSED(bitmap_fields); + //mi_assert_internal(any_zero != NULL || (bitmap[idx] & mask) == 0); + size_t prev = mi_atomic_or_acq_rel(&bitmap[idx], mask); + if (any_zero != NULL) { *any_zero = ((prev & mask) != mask); } + return ((prev & mask) == 0); +} + +// Returns `true` if all `count` bits were 1. `any_ones` is `true` if there was at least one bit set to one. +static bool mi_bitmap_is_claimedx(mi_bitmap_t bitmap, size_t bitmap_fields, size_t count, mi_bitmap_index_t bitmap_idx, bool* any_ones) { + const size_t idx = mi_bitmap_index_field(bitmap_idx); + const size_t bitidx = mi_bitmap_index_bit_in_field(bitmap_idx); + const size_t mask = mi_bitmap_mask_(count, bitidx); + mi_assert_internal(bitmap_fields > idx); MI_UNUSED(bitmap_fields); + const size_t field = mi_atomic_load_relaxed(&bitmap[idx]); + if (any_ones != NULL) { *any_ones = ((field & mask) != 0); } + return ((field & mask) == mask); +} + +// Try to set `count` bits at `bitmap_idx` from 0 to 1 atomically. +// Returns `true` if successful when all previous `count` bits were 0. +bool _mi_bitmap_try_claim(mi_bitmap_t bitmap, size_t bitmap_fields, size_t count, mi_bitmap_index_t bitmap_idx) { + const size_t idx = mi_bitmap_index_field(bitmap_idx); + const size_t bitidx = mi_bitmap_index_bit_in_field(bitmap_idx); + const size_t mask = mi_bitmap_mask_(count, bitidx); + mi_assert_internal(bitmap_fields > idx); MI_UNUSED(bitmap_fields); + size_t expected = mi_atomic_load_relaxed(&bitmap[idx]); + do { + if ((expected & mask) != 0) return false; + } + while (!mi_atomic_cas_strong_acq_rel(&bitmap[idx], &expected, expected | mask)); + mi_assert_internal((expected & mask) == 0); + return true; +} + + +bool _mi_bitmap_is_claimed(mi_bitmap_t bitmap, size_t bitmap_fields, size_t count, mi_bitmap_index_t bitmap_idx) { + return mi_bitmap_is_claimedx(bitmap, bitmap_fields, count, bitmap_idx, NULL); +} + +bool _mi_bitmap_is_any_claimed(mi_bitmap_t bitmap, size_t bitmap_fields, size_t count, mi_bitmap_index_t bitmap_idx) { + bool any_ones; + mi_bitmap_is_claimedx(bitmap, bitmap_fields, count, bitmap_idx, &any_ones); + return any_ones; +} + + +//-------------------------------------------------------------------------- +// the `_across` functions work on bitmaps where sequences can cross over +// between the fields. This is used in arena allocation +//-------------------------------------------------------------------------- + +// Try to atomically claim a sequence of `count` bits starting from the field +// at `idx` in `bitmap` and crossing into subsequent fields. Returns `true` on success. +// Only needs to consider crossing into the next fields (see `mi_bitmap_try_find_from_claim_across`) +static bool mi_bitmap_try_find_claim_field_across(mi_bitmap_t bitmap, size_t bitmap_fields, size_t idx, const size_t count, const size_t retries, mi_bitmap_index_t* bitmap_idx) +{ + mi_assert_internal(bitmap_idx != NULL); + + // check initial trailing zeros + mi_bitmap_field_t* field = &bitmap[idx]; + size_t map = mi_atomic_load_relaxed(field); + const size_t initial = mi_clz(map); // count of initial zeros starting at idx + mi_assert_internal(initial <= MI_BITMAP_FIELD_BITS); + if (initial == 0) return false; + if (initial >= count) return _mi_bitmap_try_find_claim_field(bitmap, idx, count, bitmap_idx); // no need to cross fields (this case won't happen for us) + if (_mi_divide_up(count - initial, MI_BITMAP_FIELD_BITS) >= (bitmap_fields - idx)) return false; // not enough entries + + // scan ahead + size_t found = initial; + size_t mask = 0; // mask bits for the final field + while(found < count) { + field++; + map = mi_atomic_load_relaxed(field); + const size_t mask_bits = (found + MI_BITMAP_FIELD_BITS <= count ? MI_BITMAP_FIELD_BITS : (count - found)); + mi_assert_internal(mask_bits > 0 && mask_bits <= MI_BITMAP_FIELD_BITS); + mask = mi_bitmap_mask_(mask_bits, 0); + if ((map & mask) != 0) return false; // some part is already claimed + found += mask_bits; + } + mi_assert_internal(field < &bitmap[bitmap_fields]); + + // we found a range of contiguous zeros up to the final field; mask contains mask in the final field + // now try to claim the range atomically + mi_bitmap_field_t* const final_field = field; + const size_t final_mask = mask; + mi_bitmap_field_t* const initial_field = &bitmap[idx]; + const size_t initial_idx = MI_BITMAP_FIELD_BITS - initial; + const size_t initial_mask = mi_bitmap_mask_(initial, initial_idx); + + // initial field + size_t newmap; + field = initial_field; + map = mi_atomic_load_relaxed(field); + do { + newmap = (map | initial_mask); + if ((map & initial_mask) != 0) { goto rollback; }; + } while (!mi_atomic_cas_strong_acq_rel(field, &map, newmap)); + + // intermediate fields + while (++field < final_field) { + newmap = MI_BITMAP_FIELD_FULL; + map = 0; + if (!mi_atomic_cas_strong_acq_rel(field, &map, newmap)) { goto rollback; } + } + + // final field + mi_assert_internal(field == final_field); + map = mi_atomic_load_relaxed(field); + do { + newmap = (map | final_mask); + if ((map & final_mask) != 0) { goto rollback; } + } while (!mi_atomic_cas_strong_acq_rel(field, &map, newmap)); + + // claimed! + *bitmap_idx = mi_bitmap_index_create(idx, initial_idx); + return true; + +rollback: + // roll back intermediate fields + // (we just failed to claim `field` so decrement first) + while (--field > initial_field) { + newmap = 0; + map = MI_BITMAP_FIELD_FULL; + mi_assert_internal(mi_atomic_load_relaxed(field) == map); + mi_atomic_store_release(field, newmap); + } + if (field == initial_field) { // (if we failed on the initial field, `field + 1 == initial_field`) + map = mi_atomic_load_relaxed(field); + do { + mi_assert_internal((map & initial_mask) == initial_mask); + newmap = (map & ~initial_mask); + } while (!mi_atomic_cas_strong_acq_rel(field, &map, newmap)); + } + // retry? (we make a recursive call instead of goto to be able to use const declarations) + if (retries <= 2) { + return mi_bitmap_try_find_claim_field_across(bitmap, bitmap_fields, idx, count, retries+1, bitmap_idx); + } + else { + return false; + } +} + + +// Find `count` bits of zeros and set them to 1 atomically; returns `true` on success. +// Starts at idx, and wraps around to search in all `bitmap_fields` fields. +bool _mi_bitmap_try_find_from_claim_across(mi_bitmap_t bitmap, const size_t bitmap_fields, const size_t start_field_idx, const size_t count, mi_bitmap_index_t* bitmap_idx) { + mi_assert_internal(count > 0); + if (count <= 2) { + // we don't bother with crossover fields for small counts + return _mi_bitmap_try_find_from_claim(bitmap, bitmap_fields, start_field_idx, count, bitmap_idx); + } + + // visit the fields + size_t idx = start_field_idx; + for (size_t visited = 0; visited < bitmap_fields; visited++, idx++) { + if (idx >= bitmap_fields) { idx = 0; } // wrap + // first try to claim inside a field + if (count <= MI_BITMAP_FIELD_BITS) { + if (_mi_bitmap_try_find_claim_field(bitmap, idx, count, bitmap_idx)) { + return true; + } + } + // if that fails, then try to claim across fields + if (mi_bitmap_try_find_claim_field_across(bitmap, bitmap_fields, idx, count, 0, bitmap_idx)) { + return true; + } + } + return false; +} + +// Helper for masks across fields; returns the mid count, post_mask may be 0 +static size_t mi_bitmap_mask_across(mi_bitmap_index_t bitmap_idx, size_t bitmap_fields, size_t count, size_t* pre_mask, size_t* mid_mask, size_t* post_mask) { + MI_UNUSED(bitmap_fields); + const size_t bitidx = mi_bitmap_index_bit_in_field(bitmap_idx); + if mi_likely(bitidx + count <= MI_BITMAP_FIELD_BITS) { + *pre_mask = mi_bitmap_mask_(count, bitidx); + *mid_mask = 0; + *post_mask = 0; + mi_assert_internal(mi_bitmap_index_field(bitmap_idx) < bitmap_fields); + return 0; + } + else { + const size_t pre_bits = MI_BITMAP_FIELD_BITS - bitidx; + mi_assert_internal(pre_bits < count); + *pre_mask = mi_bitmap_mask_(pre_bits, bitidx); + count -= pre_bits; + const size_t mid_count = (count / MI_BITMAP_FIELD_BITS); + *mid_mask = MI_BITMAP_FIELD_FULL; + count %= MI_BITMAP_FIELD_BITS; + *post_mask = (count==0 ? 0 : mi_bitmap_mask_(count, 0)); + mi_assert_internal(mi_bitmap_index_field(bitmap_idx) + mid_count + (count==0 ? 0 : 1) < bitmap_fields); + return mid_count; + } +} + +// Set `count` bits at `bitmap_idx` to 0 atomically +// Returns `true` if all `count` bits were 1 previously. +bool _mi_bitmap_unclaim_across(mi_bitmap_t bitmap, size_t bitmap_fields, size_t count, mi_bitmap_index_t bitmap_idx) { + size_t idx = mi_bitmap_index_field(bitmap_idx); + size_t pre_mask; + size_t mid_mask; + size_t post_mask; + size_t mid_count = mi_bitmap_mask_across(bitmap_idx, bitmap_fields, count, &pre_mask, &mid_mask, &post_mask); + bool all_one = true; + mi_bitmap_field_t* field = &bitmap[idx]; + size_t prev = mi_atomic_and_acq_rel(field++, ~pre_mask); // clear first part + if ((prev & pre_mask) != pre_mask) all_one = false; + while(mid_count-- > 0) { + prev = mi_atomic_and_acq_rel(field++, ~mid_mask); // clear mid part + if ((prev & mid_mask) != mid_mask) all_one = false; + } + if (post_mask!=0) { + prev = mi_atomic_and_acq_rel(field, ~post_mask); // clear end part + if ((prev & post_mask) != post_mask) all_one = false; + } + return all_one; +} + +// Set `count` bits at `bitmap_idx` to 1 atomically +// Returns `true` if all `count` bits were 0 previously. `any_zero` is `true` if there was at least one zero bit. +bool _mi_bitmap_claim_across(mi_bitmap_t bitmap, size_t bitmap_fields, size_t count, mi_bitmap_index_t bitmap_idx, bool* pany_zero) { + size_t idx = mi_bitmap_index_field(bitmap_idx); + size_t pre_mask; + size_t mid_mask; + size_t post_mask; + size_t mid_count = mi_bitmap_mask_across(bitmap_idx, bitmap_fields, count, &pre_mask, &mid_mask, &post_mask); + bool all_zero = true; + bool any_zero = false; + _Atomic(size_t)*field = &bitmap[idx]; + size_t prev = mi_atomic_or_acq_rel(field++, pre_mask); + if ((prev & pre_mask) != 0) all_zero = false; + if ((prev & pre_mask) != pre_mask) any_zero = true; + while (mid_count-- > 0) { + prev = mi_atomic_or_acq_rel(field++, mid_mask); + if ((prev & mid_mask) != 0) all_zero = false; + if ((prev & mid_mask) != mid_mask) any_zero = true; + } + if (post_mask!=0) { + prev = mi_atomic_or_acq_rel(field, post_mask); + if ((prev & post_mask) != 0) all_zero = false; + if ((prev & post_mask) != post_mask) any_zero = true; + } + if (pany_zero != NULL) { *pany_zero = any_zero; } + return all_zero; +} + + +// Returns `true` if all `count` bits were 1. +// `any_ones` is `true` if there was at least one bit set to one. +static bool mi_bitmap_is_claimedx_across(mi_bitmap_t bitmap, size_t bitmap_fields, size_t count, mi_bitmap_index_t bitmap_idx, bool* pany_ones) { + size_t idx = mi_bitmap_index_field(bitmap_idx); + size_t pre_mask; + size_t mid_mask; + size_t post_mask; + size_t mid_count = mi_bitmap_mask_across(bitmap_idx, bitmap_fields, count, &pre_mask, &mid_mask, &post_mask); + bool all_ones = true; + bool any_ones = false; + mi_bitmap_field_t* field = &bitmap[idx]; + size_t prev = mi_atomic_load_relaxed(field++); + if ((prev & pre_mask) != pre_mask) all_ones = false; + if ((prev & pre_mask) != 0) any_ones = true; + while (mid_count-- > 0) { + prev = mi_atomic_load_relaxed(field++); + if ((prev & mid_mask) != mid_mask) all_ones = false; + if ((prev & mid_mask) != 0) any_ones = true; + } + if (post_mask!=0) { + prev = mi_atomic_load_relaxed(field); + if ((prev & post_mask) != post_mask) all_ones = false; + if ((prev & post_mask) != 0) any_ones = true; + } + if (pany_ones != NULL) { *pany_ones = any_ones; } + return all_ones; +} + +bool _mi_bitmap_is_claimed_across(mi_bitmap_t bitmap, size_t bitmap_fields, size_t count, mi_bitmap_index_t bitmap_idx) { + return mi_bitmap_is_claimedx_across(bitmap, bitmap_fields, count, bitmap_idx, NULL); +} + +bool _mi_bitmap_is_any_claimed_across(mi_bitmap_t bitmap, size_t bitmap_fields, size_t count, mi_bitmap_index_t bitmap_idx) { + bool any_ones; + mi_bitmap_is_claimedx_across(bitmap, bitmap_fields, count, bitmap_idx, &any_ones); + return any_ones; +} diff --git a/src/bitmap.h b/src/bitmap.h new file mode 100644 index 0000000..0a765c7 --- /dev/null +++ b/src/bitmap.h @@ -0,0 +1,115 @@ +/* ---------------------------------------------------------------------------- +Copyright (c) 2019-2023 Microsoft Research, Daan Leijen +This is free software; you can redistribute it and/or modify it under the +terms of the MIT license. A copy of the license can be found in the file +"LICENSE" at the root of this distribution. +-----------------------------------------------------------------------------*/ + +/* ---------------------------------------------------------------------------- +Concurrent bitmap that can set/reset sequences of bits atomically, +represeted as an array of fields where each field is a machine word (`size_t`) + +There are two api's; the standard one cannot have sequences that cross +between the bitmap fields (and a sequence must be <= MI_BITMAP_FIELD_BITS). +(this is used in region allocation) + +The `_across` postfixed functions do allow sequences that can cross over +between the fields. (This is used in arena allocation) +---------------------------------------------------------------------------- */ +#pragma once +#ifndef MI_BITMAP_H +#define MI_BITMAP_H + +/* ----------------------------------------------------------- + Bitmap definition +----------------------------------------------------------- */ + +#define MI_BITMAP_FIELD_BITS (8*MI_SIZE_SIZE) +#define MI_BITMAP_FIELD_FULL (~((size_t)0)) // all bits set + +// An atomic bitmap of `size_t` fields +typedef _Atomic(size_t) mi_bitmap_field_t; +typedef mi_bitmap_field_t* mi_bitmap_t; + +// A bitmap index is the index of the bit in a bitmap. +typedef size_t mi_bitmap_index_t; + +// Create a bit index. +static inline mi_bitmap_index_t mi_bitmap_index_create(size_t idx, size_t bitidx) { + mi_assert_internal(bitidx < MI_BITMAP_FIELD_BITS); + return (idx*MI_BITMAP_FIELD_BITS) + bitidx; +} + +// Create a bit index. +static inline mi_bitmap_index_t mi_bitmap_index_create_from_bit(size_t full_bitidx) { + return mi_bitmap_index_create(full_bitidx / MI_BITMAP_FIELD_BITS, full_bitidx % MI_BITMAP_FIELD_BITS); +} + +// Get the field index from a bit index. +static inline size_t mi_bitmap_index_field(mi_bitmap_index_t bitmap_idx) { + return (bitmap_idx / MI_BITMAP_FIELD_BITS); +} + +// Get the bit index in a bitmap field +static inline size_t mi_bitmap_index_bit_in_field(mi_bitmap_index_t bitmap_idx) { + return (bitmap_idx % MI_BITMAP_FIELD_BITS); +} + +// Get the full bit index +static inline size_t mi_bitmap_index_bit(mi_bitmap_index_t bitmap_idx) { + return bitmap_idx; +} + +/* ----------------------------------------------------------- + Claim a bit sequence atomically +----------------------------------------------------------- */ + +// Try to atomically claim a sequence of `count` bits in a single +// field at `idx` in `bitmap`. Returns `true` on success. +bool _mi_bitmap_try_find_claim_field(mi_bitmap_t bitmap, size_t idx, const size_t count, mi_bitmap_index_t* bitmap_idx); + +// Starts at idx, and wraps around to search in all `bitmap_fields` fields. +// For now, `count` can be at most MI_BITMAP_FIELD_BITS and will never cross fields. +bool _mi_bitmap_try_find_from_claim(mi_bitmap_t bitmap, const size_t bitmap_fields, const size_t start_field_idx, const size_t count, mi_bitmap_index_t* bitmap_idx); + +// Like _mi_bitmap_try_find_from_claim but with an extra predicate that must be fullfilled +typedef bool (mi_cdecl *mi_bitmap_pred_fun_t)(mi_bitmap_index_t bitmap_idx, void* pred_arg); +bool _mi_bitmap_try_find_from_claim_pred(mi_bitmap_t bitmap, const size_t bitmap_fields, const size_t start_field_idx, const size_t count, mi_bitmap_pred_fun_t pred_fun, void* pred_arg, mi_bitmap_index_t* bitmap_idx); + +// Set `count` bits at `bitmap_idx` to 0 atomically +// Returns `true` if all `count` bits were 1 previously. +bool _mi_bitmap_unclaim(mi_bitmap_t bitmap, size_t bitmap_fields, size_t count, mi_bitmap_index_t bitmap_idx); + +// Try to set `count` bits at `bitmap_idx` from 0 to 1 atomically. +// Returns `true` if successful when all previous `count` bits were 0. +bool _mi_bitmap_try_claim(mi_bitmap_t bitmap, size_t bitmap_fields, size_t count, mi_bitmap_index_t bitmap_idx); + +// Set `count` bits at `bitmap_idx` to 1 atomically +// Returns `true` if all `count` bits were 0 previously. `any_zero` is `true` if there was at least one zero bit. +bool _mi_bitmap_claim(mi_bitmap_t bitmap, size_t bitmap_fields, size_t count, mi_bitmap_index_t bitmap_idx, bool* any_zero); + +bool _mi_bitmap_is_claimed(mi_bitmap_t bitmap, size_t bitmap_fields, size_t count, mi_bitmap_index_t bitmap_idx); +bool _mi_bitmap_is_any_claimed(mi_bitmap_t bitmap, size_t bitmap_fields, size_t count, mi_bitmap_index_t bitmap_idx); + + +//-------------------------------------------------------------------------- +// the `_across` functions work on bitmaps where sequences can cross over +// between the fields. This is used in arena allocation +//-------------------------------------------------------------------------- + +// Find `count` bits of zeros and set them to 1 atomically; returns `true` on success. +// Starts at idx, and wraps around to search in all `bitmap_fields` fields. +bool _mi_bitmap_try_find_from_claim_across(mi_bitmap_t bitmap, const size_t bitmap_fields, const size_t start_field_idx, const size_t count, mi_bitmap_index_t* bitmap_idx); + +// Set `count` bits at `bitmap_idx` to 0 atomically +// Returns `true` if all `count` bits were 1 previously. +bool _mi_bitmap_unclaim_across(mi_bitmap_t bitmap, size_t bitmap_fields, size_t count, mi_bitmap_index_t bitmap_idx); + +// Set `count` bits at `bitmap_idx` to 1 atomically +// Returns `true` if all `count` bits were 0 previously. `any_zero` is `true` if there was at least one zero bit. +bool _mi_bitmap_claim_across(mi_bitmap_t bitmap, size_t bitmap_fields, size_t count, mi_bitmap_index_t bitmap_idx, bool* pany_zero); + +bool _mi_bitmap_is_claimed_across(mi_bitmap_t bitmap, size_t bitmap_fields, size_t count, mi_bitmap_index_t bitmap_idx); +bool _mi_bitmap_is_any_claimed_across(mi_bitmap_t bitmap, size_t bitmap_fields, size_t count, mi_bitmap_index_t bitmap_idx); + +#endif diff --git a/src/bitmap.inc.c b/src/bitmap.inc.c deleted file mode 100644 index 2d6df46..0000000 --- a/src/bitmap.inc.c +++ /dev/null @@ -1,247 +0,0 @@ -/* ---------------------------------------------------------------------------- -Copyright (c) 2019, Microsoft Research, Daan Leijen -This is free software; you can redistribute it and/or modify it under the -terms of the MIT license. A copy of the license can be found in the file -"LICENSE" at the root of this distribution. ------------------------------------------------------------------------------*/ - -/* ---------------------------------------------------------------------------- -This file is meant to be included in other files for efficiency. -It implements a bitmap that can set/reset sequences of bits atomically -and is used to concurrently claim memory ranges. - -A bitmap is an array of fields where each field is a machine word (`uintptr_t`) - -A current limitation is that the bit sequences cannot cross fields -and that the sequence must be smaller or equal to the bits in a field. ----------------------------------------------------------------------------- */ -#pragma once -#ifndef MI_BITMAP_C -#define MI_BITMAP_C - -#include "mimalloc.h" -#include "mimalloc-internal.h" - -/* ----------------------------------------------------------- - Bitmap definition ------------------------------------------------------------ */ - -#define MI_BITMAP_FIELD_BITS (8*MI_INTPTR_SIZE) -#define MI_BITMAP_FIELD_FULL (~((uintptr_t)0)) // all bits set - -// An atomic bitmap of `uintptr_t` fields -typedef _Atomic(uintptr_t) mi_bitmap_field_t; -typedef mi_bitmap_field_t* mi_bitmap_t; - -// A bitmap index is the index of the bit in a bitmap. -typedef size_t mi_bitmap_index_t; - -// Create a bit index. -static inline mi_bitmap_index_t mi_bitmap_index_create(size_t idx, size_t bitidx) { - mi_assert_internal(bitidx < MI_BITMAP_FIELD_BITS); - return (idx*MI_BITMAP_FIELD_BITS) + bitidx; -} - -// Get the field index from a bit index. -static inline size_t mi_bitmap_index_field(mi_bitmap_index_t bitmap_idx) { - return (bitmap_idx / MI_BITMAP_FIELD_BITS); -} - -// Get the bit index in a bitmap field -static inline size_t mi_bitmap_index_bit_in_field(mi_bitmap_index_t bitmap_idx) { - return (bitmap_idx % MI_BITMAP_FIELD_BITS); -} - -// Get the full bit index -static inline size_t mi_bitmap_index_bit(mi_bitmap_index_t bitmap_idx) { - return bitmap_idx; -} - - -// The bit mask for a given number of blocks at a specified bit index. -static inline uintptr_t mi_bitmap_mask_(size_t count, size_t bitidx) { - mi_assert_internal(count + bitidx <= MI_BITMAP_FIELD_BITS); - if (count == MI_BITMAP_FIELD_BITS) return MI_BITMAP_FIELD_FULL; - return ((((uintptr_t)1 << count) - 1) << bitidx); -} - - -/* ----------------------------------------------------------- - Use bit scan forward/reverse to quickly find the first zero bit if it is available ------------------------------------------------------------ */ -#if defined(_MSC_VER) -#define MI_HAVE_BITSCAN -#include -#ifndef MI_64 -#if MI_INTPTR_SIZE==8 -#define MI_64(f) f##64 -#else -#define MI_64(f) f -#endif -#endif - -static inline size_t mi_bsf(uintptr_t x) { - if (x==0) return 8*MI_INTPTR_SIZE; - DWORD idx; - MI_64(_BitScanForward)(&idx, x); - return idx; -} -static inline size_t mi_bsr(uintptr_t x) { - if (x==0) return 8*MI_INTPTR_SIZE; - DWORD idx; - MI_64(_BitScanReverse)(&idx, x); - return idx; -} -#elif defined(__GNUC__) || defined(__clang__) -#include // LONG_MAX -#define MI_HAVE_BITSCAN -#if (INTPTR_MAX == LONG_MAX) -# define MI_L(x) x##l -#else -# define MI_L(x) x##ll -#endif -static inline size_t mi_bsf(uintptr_t x) { - return (x==0 ? 8*MI_INTPTR_SIZE : MI_L(__builtin_ctz)(x)); -} -static inline size_t mi_bsr(uintptr_t x) { - return (x==0 ? 8*MI_INTPTR_SIZE : (8*MI_INTPTR_SIZE - 1) - MI_L(__builtin_clz)(x)); -} -#endif - -/* ----------------------------------------------------------- - Claim a bit sequence atomically ------------------------------------------------------------ */ - -// Try to atomically claim a sequence of `count` bits at in `idx` -// in the bitmap field. Returns `true` on success. -static inline bool mi_bitmap_try_claim_field(mi_bitmap_t bitmap, size_t bitmap_fields, const size_t count, mi_bitmap_index_t bitmap_idx) { - const size_t idx = mi_bitmap_index_field(bitmap_idx); - const size_t bitidx = mi_bitmap_index_bit_in_field(bitmap_idx); - const uintptr_t mask = mi_bitmap_mask_(count, bitidx); - mi_assert_internal(bitmap_fields > idx); UNUSED(bitmap_fields); - mi_assert_internal(bitidx + count <= MI_BITMAP_FIELD_BITS); - - uintptr_t field = mi_atomic_load_relaxed(&bitmap[idx]); - if ((field & mask) == 0) { // free? - if (mi_atomic_cas_strong_acq_rel(&bitmap[idx], &field, (field|mask))) { - // claimed! - return true; - } - } - return false; -} - - -// Try to atomically claim a sequence of `count` bits in a single -// field at `idx` in `bitmap`. Returns `true` on success. -static inline bool mi_bitmap_try_find_claim_field(mi_bitmap_t bitmap, size_t idx, const size_t count, mi_bitmap_index_t* bitmap_idx) -{ - mi_assert_internal(bitmap_idx != NULL); - _Atomic(uintptr_t)* field = &bitmap[idx]; - uintptr_t map = mi_atomic_load_relaxed(field); - if (map==MI_BITMAP_FIELD_FULL) return false; // short cut - - // search for 0-bit sequence of length count - const uintptr_t mask = mi_bitmap_mask_(count, 0); - const size_t bitidx_max = MI_BITMAP_FIELD_BITS - count; - -#ifdef MI_HAVE_BITSCAN - size_t bitidx = mi_bsf(~map); // quickly find the first zero bit if possible -#else - size_t bitidx = 0; // otherwise start at 0 -#endif - uintptr_t m = (mask << bitidx); // invariant: m == mask shifted by bitidx - - // scan linearly for a free range of zero bits - while (bitidx <= bitidx_max) { - if ((map & m) == 0) { // are the mask bits free at bitidx? - mi_assert_internal((m >> bitidx) == mask); // no overflow? - const uintptr_t newmap = map | m; - mi_assert_internal((newmap^map) >> bitidx == mask); - if (!mi_atomic_cas_weak_acq_rel(field, &map, newmap)) { // TODO: use strong cas here? - // no success, another thread claimed concurrently.. keep going (with updated `map`) - continue; - } - else { - // success, we claimed the bits! - *bitmap_idx = mi_bitmap_index_create(idx, bitidx); - return true; - } - } - else { - // on to the next bit range -#ifdef MI_HAVE_BITSCAN - const size_t shift = (count == 1 ? 1 : mi_bsr(map & m) - bitidx + 1); - mi_assert_internal(shift > 0 && shift <= count); -#else - const size_t shift = 1; -#endif - bitidx += shift; - m <<= shift; - } - } - // no bits found - return false; -} - - -// Find `count` bits of 0 and set them to 1 atomically; returns `true` on success. -// For now, `count` can be at most MI_BITMAP_FIELD_BITS and will never span fields. -static inline bool mi_bitmap_try_find_claim(mi_bitmap_t bitmap, size_t bitmap_fields, size_t count, mi_bitmap_index_t* bitmap_idx) { - for (size_t idx = 0; idx < bitmap_fields; idx++) { - if (mi_bitmap_try_find_claim_field(bitmap, idx, count, bitmap_idx)) { - return true; - } - } - return false; -} - -// Set `count` bits at `bitmap_idx` to 0 atomically -// Returns `true` if all `count` bits were 1 previously. -static inline bool mi_bitmap_unclaim(mi_bitmap_t bitmap, size_t bitmap_fields, size_t count, mi_bitmap_index_t bitmap_idx) { - const size_t idx = mi_bitmap_index_field(bitmap_idx); - const size_t bitidx = mi_bitmap_index_bit_in_field(bitmap_idx); - const uintptr_t mask = mi_bitmap_mask_(count, bitidx); - mi_assert_internal(bitmap_fields > idx); UNUSED(bitmap_fields); - // mi_assert_internal((bitmap[idx] & mask) == mask); - uintptr_t prev = mi_atomic_and_acq_rel(&bitmap[idx], ~mask); - return ((prev & mask) == mask); -} - - -// Set `count` bits at `bitmap_idx` to 1 atomically -// Returns `true` if all `count` bits were 0 previously. `any_zero` is `true` if there was at least one zero bit. -static inline bool mi_bitmap_claim(mi_bitmap_t bitmap, size_t bitmap_fields, size_t count, mi_bitmap_index_t bitmap_idx, bool* any_zero) { - const size_t idx = mi_bitmap_index_field(bitmap_idx); - const size_t bitidx = mi_bitmap_index_bit_in_field(bitmap_idx); - const uintptr_t mask = mi_bitmap_mask_(count, bitidx); - mi_assert_internal(bitmap_fields > idx); UNUSED(bitmap_fields); - //mi_assert_internal(any_zero != NULL || (bitmap[idx] & mask) == 0); - uintptr_t prev = mi_atomic_or_acq_rel(&bitmap[idx], mask); - if (any_zero != NULL) *any_zero = ((prev & mask) != mask); - return ((prev & mask) == 0); -} - -// Returns `true` if all `count` bits were 1. `any_ones` is `true` if there was at least one bit set to one. -static inline bool mi_bitmap_is_claimedx(mi_bitmap_t bitmap, size_t bitmap_fields, size_t count, mi_bitmap_index_t bitmap_idx, bool* any_ones) { - const size_t idx = mi_bitmap_index_field(bitmap_idx); - const size_t bitidx = mi_bitmap_index_bit_in_field(bitmap_idx); - const uintptr_t mask = mi_bitmap_mask_(count, bitidx); - mi_assert_internal(bitmap_fields > idx); UNUSED(bitmap_fields); - uintptr_t field = mi_atomic_load_relaxed(&bitmap[idx]); - if (any_ones != NULL) *any_ones = ((field & mask) != 0); - return ((field & mask) == mask); -} - -static inline bool mi_bitmap_is_claimed(mi_bitmap_t bitmap, size_t bitmap_fields, size_t count, mi_bitmap_index_t bitmap_idx) { - return mi_bitmap_is_claimedx(bitmap, bitmap_fields, count, bitmap_idx, NULL); -} - -static inline bool mi_bitmap_is_any_claimed(mi_bitmap_t bitmap, size_t bitmap_fields, size_t count, mi_bitmap_index_t bitmap_idx) { - bool any_ones; - mi_bitmap_is_claimedx(bitmap, bitmap_fields, count, bitmap_idx, &any_ones); - return any_ones; -} - - -#endif diff --git a/src/heap.c b/src/heap.c index b1079e1..58520dd 100644 --- a/src/heap.c +++ b/src/heap.c @@ -1,13 +1,14 @@ /*---------------------------------------------------------------------------- -Copyright (c) 2018, Microsoft Research, Daan Leijen +Copyright (c) 2018-2021, Microsoft Research, Daan Leijen This is free software; you can redistribute it and/or modify it under the terms of the MIT license. A copy of the license can be found in the file "LICENSE" at the root of this distribution. -----------------------------------------------------------------------------*/ #include "mimalloc.h" -#include "mimalloc-internal.h" -#include "mimalloc-atomic.h" +#include "mimalloc/internal.h" +#include "mimalloc/atomic.h" +#include "mimalloc/prim.h" // mi_prim_get_default_heap #include // memset, memcpy @@ -30,15 +31,18 @@ static bool mi_heap_visit_pages(mi_heap_t* heap, heap_page_visitor_fun* fn, void // visit all pages #if MI_DEBUG>1 size_t total = heap->page_count; - #endif size_t count = 0; + #endif + for (size_t i = 0; i <= MI_BIN_FULL; i++) { mi_page_queue_t* pq = &heap->pages[i]; mi_page_t* page = pq->first; while(page != NULL) { mi_page_t* next = page->next; // save next in case the page gets removed from the queue mi_assert_internal(mi_page_heap(page) == heap); + #if MI_DEBUG>1 count++; + #endif if (!fn(heap, pq, page, arg1, arg2)) return false; page = next; // and continue } @@ -50,9 +54,9 @@ static bool mi_heap_visit_pages(mi_heap_t* heap, heap_page_visitor_fun* fn, void #if MI_DEBUG>=2 static bool mi_heap_page_is_valid(mi_heap_t* heap, mi_page_queue_t* pq, mi_page_t* page, void* arg1, void* arg2) { - UNUSED(arg1); - UNUSED(arg2); - UNUSED(pq); + MI_UNUSED(arg1); + MI_UNUSED(arg2); + MI_UNUSED(pq); mi_assert_internal(mi_page_heap(page) == heap); mi_segment_t* segment = _mi_page_segment(page); mi_assert_internal(segment->thread_id == heap->thread_id); @@ -86,13 +90,13 @@ typedef enum mi_collect_e { static bool mi_heap_page_collect(mi_heap_t* heap, mi_page_queue_t* pq, mi_page_t* page, void* arg_collect, void* arg2 ) { - UNUSED(arg2); - UNUSED(heap); + MI_UNUSED(arg2); + MI_UNUSED(heap); mi_assert_internal(mi_heap_page_is_valid(heap, pq, page, NULL, NULL)); mi_collect_t collect = *((mi_collect_t*)arg_collect); _mi_page_free_collect(page, collect >= MI_FORCE); if (mi_page_all_free(page)) { - // no more used blocks, free the page. + // no more used blocks, free the page. // note: this will free retired pages as well. _mi_page_free(page, pq, collect >= MI_FORCE); } @@ -104,57 +108,65 @@ static bool mi_heap_page_collect(mi_heap_t* heap, mi_page_queue_t* pq, mi_page_t } static bool mi_heap_page_never_delayed_free(mi_heap_t* heap, mi_page_queue_t* pq, mi_page_t* page, void* arg1, void* arg2) { - UNUSED(arg1); - UNUSED(arg2); - UNUSED(heap); - UNUSED(pq); + MI_UNUSED(arg1); + MI_UNUSED(arg2); + MI_UNUSED(heap); + MI_UNUSED(pq); _mi_page_use_delayed_free(page, MI_NEVER_DELAYED_FREE, false); return true; // don't break } static void mi_heap_collect_ex(mi_heap_t* heap, mi_collect_t collect) { - if (!mi_heap_is_initialized(heap)) return; - _mi_deferred_free(heap, collect >= MI_FORCE); + if (heap==NULL || !mi_heap_is_initialized(heap)) return; + + const bool force = collect >= MI_FORCE; + _mi_deferred_free(heap, force); // note: never reclaim on collect but leave it to threads that need storage to reclaim - if ( - #ifdef NDEBUG + const bool force_main = + #ifdef NDEBUG collect == MI_FORCE - #else + #else collect >= MI_FORCE - #endif - && _mi_is_main_thread() && mi_heap_is_backing(heap) && !heap->no_reclaim) - { + #endif + && _mi_is_main_thread() && mi_heap_is_backing(heap) && !heap->no_reclaim; + + if (force_main) { // the main thread is abandoned (end-of-program), try to reclaim all abandoned segments. // if all memory is freed by now, all segments should be freed. _mi_abandoned_reclaim_all(heap, &heap->tld->segments); } - + // if abandoning, mark all pages to no longer add to delayed_free if (collect == MI_ABANDON) { mi_heap_visit_pages(heap, &mi_heap_page_never_delayed_free, NULL, NULL); } - // free thread delayed blocks. + // free all current thread delayed blocks. // (if abandoning, after this there are no more thread-delayed references into the pages.) - _mi_heap_delayed_free(heap); + _mi_heap_delayed_free_all(heap); // collect retired pages - _mi_heap_collect_retired(heap, collect >= MI_FORCE); + _mi_heap_collect_retired(heap, force); // collect all pages owned by this thread mi_heap_visit_pages(heap, &mi_heap_page_collect, &collect, NULL); mi_assert_internal( collect != MI_ABANDON || mi_atomic_load_ptr_acquire(mi_block_t,&heap->thread_delayed_free) == NULL ); - // collect segment caches - if (collect >= MI_FORCE) { + // collect abandoned segments (in particular, purge expired parts of segments in the abandoned segment list) + // note: forced purge can be quite expensive if many threads are created/destroyed so we do not force on abandonment + _mi_abandoned_collect(heap, collect == MI_FORCE /* force? */, &heap->tld->segments); + + // collect segment local caches + if (force) { _mi_segment_thread_collect(&heap->tld->segments); } // collect regions on program-exit (or shared library unload) - if (collect >= MI_FORCE && _mi_is_main_thread() && mi_heap_is_backing(heap)) { - _mi_mem_collect(&heap->tld->os); + if (force && _mi_is_main_thread() && mi_heap_is_backing(heap)) { + _mi_thread_data_collect(); // collect thread data cache + _mi_arena_collect(true /* force purge */, &heap->tld->stats); } } @@ -167,7 +179,7 @@ void mi_heap_collect(mi_heap_t* heap, bool force) mi_attr_noexcept { } void mi_collect(bool force) mi_attr_noexcept { - mi_heap_collect(mi_get_default_heap(), force); + mi_heap_collect(mi_prim_get_default_heap(), force); } @@ -177,9 +189,14 @@ void mi_collect(bool force) mi_attr_noexcept { mi_heap_t* mi_heap_get_default(void) { mi_thread_init(); - return mi_get_default_heap(); + return mi_prim_get_default_heap(); } +static bool mi_heap_is_default(const mi_heap_t* heap) { + return (heap == mi_prim_get_default_heap()); +} + + mi_heap_t* mi_heap_get_backing(void) { mi_heap_t* heap = mi_heap_get_default(); mi_assert_internal(heap!=NULL); @@ -189,15 +206,16 @@ mi_heap_t* mi_heap_get_backing(void) { return bheap; } -mi_heap_t* mi_heap_new(void) { +mi_decl_nodiscard mi_heap_t* mi_heap_new_in_arena(mi_arena_id_t arena_id) { mi_heap_t* bheap = mi_heap_get_backing(); mi_heap_t* heap = mi_heap_malloc_tp(bheap, mi_heap_t); // todo: OS allocate in secure mode? - if (heap==NULL) return NULL; - memcpy(heap, &_mi_heap_empty, sizeof(mi_heap_t)); + if (heap == NULL) return NULL; + _mi_memcpy_aligned(heap, &_mi_heap_empty, sizeof(mi_heap_t)); heap->tld = bheap->tld; heap->thread_id = _mi_thread_id(); + heap->arena_id = arena_id; _mi_random_split(&bheap->random, &heap->random); - heap->cookie = _mi_heap_random_next(heap) | 1; + heap->cookie = _mi_heap_random_next(heap) | 1; heap->keys[0] = _mi_heap_random_next(heap); heap->keys[1] = _mi_heap_random_next(heap); heap->no_reclaim = true; // don't reclaim abandoned pages or otherwise destroy is unsafe @@ -207,19 +225,25 @@ mi_heap_t* mi_heap_new(void) { return heap; } +mi_decl_nodiscard mi_heap_t* mi_heap_new(void) { + return mi_heap_new_in_arena(_mi_arena_id_none()); +} + +bool _mi_heap_memid_is_suitable(mi_heap_t* heap, mi_memid_t memid) { + return _mi_arena_memid_is_suitable(memid, heap->arena_id); +} + uintptr_t _mi_heap_random_next(mi_heap_t* heap) { return _mi_random_next(&heap->random); } // zero out the page queues static void mi_heap_reset_pages(mi_heap_t* heap) { + mi_assert_internal(heap != NULL); mi_assert_internal(mi_heap_is_initialized(heap)); // TODO: copy full empty heap instead? memset(&heap->pages_free_direct, 0, sizeof(heap->pages_free_direct)); -#ifdef MI_MEDIUM_DIRECT - memset(&heap->pages_free_medium, 0, sizeof(heap->pages_free_medium)); -#endif - memcpy(&heap->pages, &_mi_heap_empty.pages, sizeof(heap->pages)); + _mi_memcpy_aligned(&heap->pages, &_mi_heap_empty.pages, sizeof(heap->pages)); heap->thread_delayed_free = NULL; heap->page_count = 0; } @@ -228,6 +252,7 @@ static void mi_heap_reset_pages(mi_heap_t* heap) { static void mi_heap_free(mi_heap_t* heap) { mi_assert(heap != NULL); mi_assert_internal(mi_heap_is_initialized(heap)); + if (heap==NULL || !mi_heap_is_initialized(heap)) return; if (mi_heap_is_backing(heap)) return; // dont free the backing heap // reset default @@ -238,7 +263,7 @@ static void mi_heap_free(mi_heap_t* heap) { // remove ourselves from the thread local heaps list // linear search but we expect the number of heaps to be relatively small mi_heap_t* prev = NULL; - mi_heap_t* curr = heap->tld->heaps; + mi_heap_t* curr = heap->tld->heaps; while (curr != heap && curr != NULL) { prev = curr; curr = curr->next; @@ -260,29 +285,32 @@ static void mi_heap_free(mi_heap_t* heap) { ----------------------------------------------------------- */ static bool _mi_heap_page_destroy(mi_heap_t* heap, mi_page_queue_t* pq, mi_page_t* page, void* arg1, void* arg2) { - UNUSED(arg1); - UNUSED(arg2); - UNUSED(heap); - UNUSED(pq); + MI_UNUSED(arg1); + MI_UNUSED(arg2); + MI_UNUSED(heap); + MI_UNUSED(pq); // ensure no more thread_delayed_free will be added _mi_page_use_delayed_free(page, MI_NEVER_DELAYED_FREE, false); // stats const size_t bsize = mi_page_block_size(page); - if (bsize > MI_LARGE_OBJ_SIZE_MAX) { - if (bsize > MI_HUGE_OBJ_SIZE_MAX) { - _mi_stat_decrease(&heap->tld->stats.giant, bsize); + if (bsize > MI_MEDIUM_OBJ_SIZE_MAX) { + if (bsize <= MI_LARGE_OBJ_SIZE_MAX) { + mi_heap_stat_decrease(heap, large, bsize); } else { - _mi_stat_decrease(&heap->tld->stats.huge, bsize); + mi_heap_stat_decrease(heap, huge, bsize); } } -#if (MI_STAT>1) +#if (MI_STAT) _mi_page_free_collect(page, false); // update used count const size_t inuse = page->used; if (bsize <= MI_LARGE_OBJ_SIZE_MAX) { - mi_heap_stat_decrease(heap, normal[_mi_bin(bsize)], inuse); + mi_heap_stat_decrease(heap, normal, bsize * inuse); +#if (MI_STAT>1) + mi_heap_stat_decrease(heap, normal_bins[_mi_bin(bsize)], inuse); +#endif } mi_heap_stat_decrease(heap, malloc, bsize * inuse); // todo: off for aligned blocks... #endif @@ -305,38 +333,64 @@ void _mi_heap_destroy_pages(mi_heap_t* heap) { mi_heap_reset_pages(heap); } +#if MI_TRACK_HEAP_DESTROY +static bool mi_cdecl mi_heap_track_block_free(const mi_heap_t* heap, const mi_heap_area_t* area, void* block, size_t block_size, void* arg) { + MI_UNUSED(heap); MI_UNUSED(area); MI_UNUSED(arg); MI_UNUSED(block_size); + mi_track_free_size(block,mi_usable_size(block)); + return true; +} +#endif + void mi_heap_destroy(mi_heap_t* heap) { mi_assert(heap != NULL); mi_assert(mi_heap_is_initialized(heap)); mi_assert(heap->no_reclaim); mi_assert_expensive(mi_heap_is_valid(heap)); - if (!mi_heap_is_initialized(heap)) return; + if (heap==NULL || !mi_heap_is_initialized(heap)) return; if (!heap->no_reclaim) { // don't free in case it may contain reclaimed pages mi_heap_delete(heap); } else { + // track all blocks as freed + #if MI_TRACK_HEAP_DESTROY + mi_heap_visit_blocks(heap, true, mi_heap_track_block_free, NULL); + #endif // free all pages _mi_heap_destroy_pages(heap); mi_heap_free(heap); } } - +// forcefully destroy all heaps in the current thread +void _mi_heap_unsafe_destroy_all(void) { + mi_heap_t* bheap = mi_heap_get_backing(); + mi_heap_t* curr = bheap->tld->heaps; + while (curr != NULL) { + mi_heap_t* next = curr->next; + if (curr->no_reclaim) { + mi_heap_destroy(curr); + } + else { + _mi_heap_destroy_pages(curr); + } + curr = next; + } +} /* ----------------------------------------------------------- Safe Heap delete ----------------------------------------------------------- */ -// Tranfer the pages from one heap to the other +// Transfer the pages from one heap to the other static void mi_heap_absorb(mi_heap_t* heap, mi_heap_t* from) { mi_assert_internal(heap!=NULL); if (from==NULL || from->page_count == 0) return; // reduce the size of the delayed frees - _mi_heap_delayed_free(from); - - // transfer all pages by appending the queues; this will set a new heap field + _mi_heap_delayed_free_partial(from); + + // transfer all pages by appending the queues; this will set a new heap field // so threads may do delayed frees in either heap for a while. // note: appending waits for each page to not be in the `MI_DELAYED_FREEING` state // so after this only the new heap will get delayed frees @@ -349,15 +403,17 @@ static void mi_heap_absorb(mi_heap_t* heap, mi_heap_t* from) { } mi_assert_internal(from->page_count == 0); - // and do outstanding delayed frees in the `from` heap + // and do outstanding delayed frees in the `from` heap // note: be careful here as the `heap` field in all those pages no longer point to `from`, - // turns out to be ok as `_mi_heap_delayed_free` only visits the list and calls a + // turns out to be ok as `_mi_heap_delayed_free` only visits the list and calls a // the regular `_mi_free_delayed_block` which is safe. - _mi_heap_delayed_free(from); - mi_assert_internal(from->thread_delayed_free == NULL); + _mi_heap_delayed_free_all(from); + #if !defined(_MSC_VER) || (_MSC_VER > 1900) // somehow the following line gives an error in VS2015, issue #353 + mi_assert_internal(mi_atomic_load_ptr_relaxed(mi_block_t,&from->thread_delayed_free) == NULL); + #endif // and reset the `from` heap - mi_heap_reset_pages(from); + mi_heap_reset_pages(from); } // Safe delete a heap without freeing any still allocated blocks in that heap. @@ -366,7 +422,7 @@ void mi_heap_delete(mi_heap_t* heap) mi_assert(heap != NULL); mi_assert(mi_heap_is_initialized(heap)); mi_assert_expensive(mi_heap_is_valid(heap)); - if (!mi_heap_is_initialized(heap)) return; + if (heap==NULL || !mi_heap_is_initialized(heap)) return; if (!mi_heap_is_backing(heap)) { // tranfer still used pages to the backing heap @@ -381,10 +437,11 @@ void mi_heap_delete(mi_heap_t* heap) } mi_heap_t* mi_heap_set_default(mi_heap_t* heap) { + mi_assert(heap != NULL); mi_assert(mi_heap_is_initialized(heap)); - if (!mi_heap_is_initialized(heap)) return NULL; + if (heap==NULL || !mi_heap_is_initialized(heap)) return NULL; mi_assert_expensive(mi_heap_is_valid(heap)); - mi_heap_t* old = mi_get_default_heap(); + mi_heap_t* old = mi_prim_get_default_heap(); _mi_heap_set_default_direct(heap); return old; } @@ -402,20 +459,20 @@ static mi_heap_t* mi_heap_of_block(const void* p) { mi_segment_t* segment = _mi_ptr_segment(p); bool valid = (_mi_ptr_cookie(segment) == segment->cookie); mi_assert_internal(valid); - if (mi_unlikely(!valid)) return NULL; + if mi_unlikely(!valid) return NULL; return mi_page_heap(_mi_segment_page_of(segment,p)); } bool mi_heap_contains_block(mi_heap_t* heap, const void* p) { mi_assert(heap != NULL); - if (!mi_heap_is_initialized(heap)) return false; + if (heap==NULL || !mi_heap_is_initialized(heap)) return false; return (heap == mi_heap_of_block(p)); } static bool mi_heap_page_check_owned(mi_heap_t* heap, mi_page_queue_t* pq, mi_page_t* page, void* p, void* vfound) { - UNUSED(heap); - UNUSED(pq); + MI_UNUSED(heap); + MI_UNUSED(pq); bool* found = (bool*)vfound; mi_segment_t* segment = _mi_page_segment(page); void* start = _mi_page_start(segment, page, NULL); @@ -426,7 +483,7 @@ static bool mi_heap_page_check_owned(mi_heap_t* heap, mi_page_queue_t* pq, mi_pa bool mi_heap_check_owned(mi_heap_t* heap, const void* p) { mi_assert(heap != NULL); - if (!mi_heap_is_initialized(heap)) return false; + if (heap==NULL || !mi_heap_is_initialized(heap)) return false; if (((uintptr_t)p & (MI_INTPTR_SIZE - 1)) != 0) return false; // only aligned pointers bool found = false; mi_heap_visit_pages(heap, &mi_heap_page_check_owned, (void*)p, &found); @@ -434,7 +491,7 @@ bool mi_heap_check_owned(mi_heap_t* heap, const void* p) { } bool mi_check_owned(const void* p) { - return mi_heap_check_owned(mi_get_default_heap(), p); + return mi_heap_check_owned(mi_prim_get_default_heap(), p); } /* ----------------------------------------------------------- @@ -462,13 +519,14 @@ static bool mi_heap_area_visit_blocks(const mi_heap_area_ex_t* xarea, mi_block_v if (page->used == 0) return true; const size_t bsize = mi_page_block_size(page); + const size_t ubsize = mi_page_usable_block_size(page); // without padding size_t psize; uint8_t* pstart = _mi_page_start(_mi_page_segment(page), page, &psize); if (page->capacity == 1) { // optimize page with one block mi_assert_internal(page->used == 1 && page->free == NULL); - return visitor(mi_page_heap(page), area, pstart, bsize, arg); + return visitor(mi_page_heap(page), area, pstart, ubsize, arg); } // create a bitmap of free blocks. @@ -476,9 +534,13 @@ static bool mi_heap_area_visit_blocks(const mi_heap_area_ex_t* xarea, mi_block_v uintptr_t free_map[MI_MAX_BLOCKS / sizeof(uintptr_t)]; memset(free_map, 0, sizeof(free_map)); + #if MI_DEBUG>1 size_t free_count = 0; + #endif for (mi_block_t* block = page->free; block != NULL; block = mi_block_next(page,block)) { + #if MI_DEBUG>1 free_count++; + #endif mi_assert_internal((uint8_t*)block >= pstart && (uint8_t*)block < (pstart + psize)); size_t offset = (uint8_t*)block - pstart; mi_assert_internal(offset % bsize == 0); @@ -491,7 +553,9 @@ static bool mi_heap_area_visit_blocks(const mi_heap_area_ex_t* xarea, mi_block_v mi_assert_internal(page->capacity == (free_count + page->used)); // walk through all blocks skipping the free ones + #if MI_DEBUG>1 size_t used_count = 0; + #endif for (size_t i = 0; i < page->capacity; i++) { size_t bitidx = (i / sizeof(uintptr_t)); size_t bit = i - (bitidx * sizeof(uintptr_t)); @@ -500,9 +564,11 @@ static bool mi_heap_area_visit_blocks(const mi_heap_area_ex_t* xarea, mi_block_v i += (sizeof(uintptr_t) - 1); // skip a run of free blocks } else if ((m & ((uintptr_t)1 << bit)) == 0) { + #if MI_DEBUG>1 used_count++; + #endif uint8_t* block = pstart + (i * bsize); - if (!visitor(mi_page_heap(page), area, block, bsize, arg)) return false; + if (!visitor(mi_page_heap(page), area, block, ubsize, arg)) return false; } } mi_assert_internal(page->used == used_count); @@ -513,17 +579,19 @@ typedef bool (mi_heap_area_visit_fun)(const mi_heap_t* heap, const mi_heap_area_ static bool mi_heap_visit_areas_page(mi_heap_t* heap, mi_page_queue_t* pq, mi_page_t* page, void* vfun, void* arg) { - UNUSED(heap); - UNUSED(pq); + MI_UNUSED(heap); + MI_UNUSED(pq); mi_heap_area_visit_fun* fun = (mi_heap_area_visit_fun*)vfun; mi_heap_area_ex_t xarea; const size_t bsize = mi_page_block_size(page); + const size_t ubsize = mi_page_usable_block_size(page); xarea.page = page; xarea.area.reserved = page->reserved * bsize; xarea.area.committed = page->capacity * bsize; xarea.area.blocks = _mi_page_start(_mi_page_segment(page), page, NULL); - xarea.area.used = page->used; - xarea.area.block_size = bsize; + xarea.area.used = page->used; // number of blocks in use (#553) + xarea.area.block_size = ubsize; + xarea.area.full_block_size = bsize; return fun(heap, &xarea, arg); } diff --git a/src/init.c b/src/init.c index de24f40..b1db14c 100644 --- a/src/init.c +++ b/src/init.c @@ -1,37 +1,43 @@ /* ---------------------------------------------------------------------------- -Copyright (c) 2018, Microsoft Research, Daan Leijen +Copyright (c) 2018-2022, Microsoft Research, Daan Leijen This is free software; you can redistribute it and/or modify it under the terms of the MIT license. A copy of the license can be found in the file "LICENSE" at the root of this distribution. -----------------------------------------------------------------------------*/ #include "mimalloc.h" -#include "mimalloc-internal.h" +#include "mimalloc/internal.h" +#include "mimalloc/prim.h" #include // memcpy, memset #include // atexit + // Empty page used to initialize the small free pages array const mi_page_t _mi_page_empty = { - 0, false, false, false, false, + 0, false, false, false, 0, // capacity 0, // reserved capacity { 0 }, // flags false, // is_zero 0, // retire_expire NULL, // free - #if MI_ENCODE_FREELIST - { 0, 0 }, - #endif 0, // used 0, // xblock_size NULL, // local_free - ATOMIC_VAR_INIT(0), // xthread_free - ATOMIC_VAR_INIT(0), // xheap + #if (MI_PADDING || MI_ENCODE_FREELIST) + { 0, 0 }, + #endif + MI_ATOMIC_VAR_INIT(0), // xthread_free + MI_ATOMIC_VAR_INIT(0), // xheap NULL, NULL + #if MI_INTPTR_SIZE==8 + , { 0 } // padding + #endif }; #define MI_PAGE_EMPTY() ((mi_page_t*)&_mi_page_empty) +#if (MI_SMALL_WSIZE_MAX==128) #if (MI_PADDING>0) && (MI_INTPTR_SIZE >= 8) #define MI_SMALL_PAGES_EMPTY { MI_INIT128(MI_PAGE_EMPTY), MI_PAGE_EMPTY(), MI_PAGE_EMPTY() } #elif (MI_PADDING>0) @@ -39,7 +45,9 @@ const mi_page_t _mi_page_empty = { #else #define MI_SMALL_PAGES_EMPTY { MI_INIT128(MI_PAGE_EMPTY), MI_PAGE_EMPTY() } #endif - +#else +#error "define right initialization sizes corresponding to MI_SMALL_WSIZE_MAX" +#endif // Empty page queues for every bin #define QNULL(sz) { NULL, NULL, (sz)*sizeof(uintptr_t) } @@ -54,8 +62,8 @@ const mi_page_t _mi_page_empty = { QNULL( 10240), QNULL( 12288), QNULL( 14336), QNULL( 16384), QNULL( 20480), QNULL( 24576), QNULL( 28672), QNULL( 32768), /* 56 */ \ QNULL( 40960), QNULL( 49152), QNULL( 57344), QNULL( 65536), QNULL( 81920), QNULL( 98304), QNULL(114688), QNULL(131072), /* 64 */ \ QNULL(163840), QNULL(196608), QNULL(229376), QNULL(262144), QNULL(327680), QNULL(393216), QNULL(458752), QNULL(524288), /* 72 */ \ - QNULL(MI_LARGE_OBJ_WSIZE_MAX + 1 /* 655360, Huge queue */), \ - QNULL(MI_LARGE_OBJ_WSIZE_MAX + 2) /* Full queue */ } + QNULL(MI_MEDIUM_OBJ_WSIZE_MAX + 1 /* 655360, Huge queue */), \ + QNULL(MI_MEDIUM_OBJ_WSIZE_MAX + 2) /* Full queue */ } #define MI_STAT_COUNT_NULL() {0,0,0,0} @@ -73,11 +81,24 @@ const mi_page_t _mi_page_empty = { MI_STAT_COUNT_NULL(), MI_STAT_COUNT_NULL(), \ MI_STAT_COUNT_NULL(), MI_STAT_COUNT_NULL(), \ MI_STAT_COUNT_NULL(), MI_STAT_COUNT_NULL(), \ + MI_STAT_COUNT_NULL(), MI_STAT_COUNT_NULL(), \ MI_STAT_COUNT_NULL(), \ - { 0, 0 }, { 0, 0 }, { 0, 0 }, \ - { 0, 0 }, { 0, 0 }, { 0, 0 }, { 0, 0 } \ + { 0, 0 }, { 0, 0 }, { 0, 0 }, { 0, 0 }, \ + { 0, 0 }, { 0, 0 }, { 0, 0 }, { 0, 0 }, { 0, 0 }, { 0, 0 } \ MI_STAT_COUNT_END_NULL() + +// Empty slice span queues for every bin +#define SQNULL(sz) { NULL, NULL, sz } +#define MI_SEGMENT_SPAN_QUEUES_EMPTY \ + { SQNULL(1), \ + SQNULL( 1), SQNULL( 2), SQNULL( 3), SQNULL( 4), SQNULL( 5), SQNULL( 6), SQNULL( 7), SQNULL( 10), /* 8 */ \ + SQNULL( 12), SQNULL( 14), SQNULL( 16), SQNULL( 20), SQNULL( 24), SQNULL( 28), SQNULL( 32), SQNULL( 40), /* 16 */ \ + SQNULL( 48), SQNULL( 56), SQNULL( 64), SQNULL( 80), SQNULL( 96), SQNULL( 112), SQNULL( 128), SQNULL( 160), /* 24 */ \ + SQNULL( 192), SQNULL( 224), SQNULL( 256), SQNULL( 320), SQNULL( 384), SQNULL( 448), SQNULL( 512), SQNULL( 640), /* 32 */ \ + SQNULL( 768), SQNULL( 896), SQNULL( 1024) /* 35 */ } + + // -------------------------------------------------------- // Statically allocate an empty heap as the initial // thread local value for the default heap, @@ -87,21 +108,38 @@ const mi_page_t _mi_page_empty = { // may lead to allocation itself on some platforms) // -------------------------------------------------------- -const mi_heap_t _mi_heap_empty = { +mi_decl_cache_align const mi_heap_t _mi_heap_empty = { NULL, MI_SMALL_PAGES_EMPTY, MI_PAGE_QUEUES_EMPTY, - ATOMIC_VAR_INIT(NULL), + MI_ATOMIC_VAR_INIT(NULL), 0, // tid 0, // cookie + 0, // arena id { 0, 0 }, // keys - { {0}, {0}, 0 }, + { {0}, {0}, 0, true }, // random 0, // page count MI_BIN_FULL, 0, // page retired min/max NULL, // next false }; +#define tld_empty_stats ((mi_stats_t*)((uint8_t*)&tld_empty + offsetof(mi_tld_t,stats))) +#define tld_empty_os ((mi_os_tld_t*)((uint8_t*)&tld_empty + offsetof(mi_tld_t,os))) + +mi_decl_cache_align static const mi_tld_t tld_empty = { + 0, + false, + NULL, NULL, + { MI_SEGMENT_SPAN_QUEUES_EMPTY, 0, 0, 0, 0, tld_empty_stats, tld_empty_os }, // segments + { 0, tld_empty_stats }, // os + { MI_STATS_NULL } // stats +}; + +mi_threadid_t _mi_thread_id(void) mi_attr_noexcept { + return _mi_prim_thread_id(); +} + // the thread-local default heap for allocation mi_decl_thread mi_heap_t* _mi_heap_default = (mi_heap_t*)&_mi_heap_empty; @@ -109,11 +147,8 @@ extern mi_heap_t _mi_heap_main; static mi_tld_t tld_main = { 0, false, - &_mi_heap_main, &_mi_heap_main, - { { NULL, NULL }, {NULL ,NULL}, {NULL ,NULL, 0}, - 0, 0, 0, 0, 0, 0, NULL, - &tld_main.stats, &tld_main.os - }, // segments + &_mi_heap_main, & _mi_heap_main, + { MI_SEGMENT_SPAN_QUEUES_EMPTY, 0, 0, 0, 0, &tld_main.stats, &tld_main.os }, // segments { 0, &tld_main.stats }, // os { MI_STATS_NULL } // stats }; @@ -122,11 +157,12 @@ mi_heap_t _mi_heap_main = { &tld_main, MI_SMALL_PAGES_EMPTY, MI_PAGE_QUEUES_EMPTY, - ATOMIC_VAR_INIT(NULL), + MI_ATOMIC_VAR_INIT(NULL), 0, // thread id 0, // initial cookie + 0, // arena id { 0, 0 }, // the key of the main heap can be fixed (unlike page keys that need to be secure!) - { {0x846ca68b}, {0}, 0 }, // random + { {0x846ca68b}, {0}, 0, true }, // random 0, // page count MI_BIN_FULL, 0, // page retired min/max NULL, // next heap @@ -141,19 +177,23 @@ mi_stats_t _mi_stats_main = { MI_STATS_NULL }; static void mi_heap_main_init(void) { if (_mi_heap_main.cookie == 0) { _mi_heap_main.thread_id = _mi_thread_id(); - _mi_heap_main.cookie = _os_random_weak((uintptr_t)&mi_heap_main_init); - _mi_random_init(&_mi_heap_main.random); + _mi_heap_main.cookie = 1; + #if defined(_WIN32) && !defined(MI_SHARED_LIB) + _mi_random_init_weak(&_mi_heap_main.random); // prevent allocation failure during bcrypt dll initialization with static linking + #else + _mi_random_init(&_mi_heap_main.random); + #endif + _mi_heap_main.cookie = _mi_heap_random_next(&_mi_heap_main); _mi_heap_main.keys[0] = _mi_heap_random_next(&_mi_heap_main); _mi_heap_main.keys[1] = _mi_heap_random_next(&_mi_heap_main); } } -#if defined(MI_TLS_RECURSE_GUARD_HOST) || !defined(MI_TLS_RECURSE_GUARD) mi_heap_t* _mi_heap_main_get(void) { mi_heap_main_init(); return &_mi_heap_main; } -#endif + /* ----------------------------------------------------------- Initialization and freeing of the thread local heaps @@ -163,34 +203,104 @@ mi_heap_t* _mi_heap_main_get(void) { typedef struct mi_thread_data_s { mi_heap_t heap; // must come first due to cast in `_mi_heap_done` mi_tld_t tld; + mi_memid_t memid; } mi_thread_data_t; + +// Thread meta-data is allocated directly from the OS. For +// some programs that do not use thread pools and allocate and +// destroy many OS threads, this may causes too much overhead +// per thread so we maintain a small cache of recently freed metadata. + +#define TD_CACHE_SIZE (16) +static _Atomic(mi_thread_data_t*) td_cache[TD_CACHE_SIZE]; + +static mi_thread_data_t* mi_thread_data_zalloc(void) { + // try to find thread metadata in the cache + bool is_zero = false; + mi_thread_data_t* td = NULL; + for (int i = 0; i < TD_CACHE_SIZE; i++) { + td = mi_atomic_load_ptr_relaxed(mi_thread_data_t, &td_cache[i]); + if (td != NULL) { + // found cached allocation, try use it + td = mi_atomic_exchange_ptr_acq_rel(mi_thread_data_t, &td_cache[i], NULL); + if (td != NULL) { + break; + } + } + } + + // if that fails, allocate as meta data + if (td == NULL) { + mi_memid_t memid; + td = (mi_thread_data_t*)_mi_os_alloc(sizeof(mi_thread_data_t), &memid, &_mi_stats_main); + if (td == NULL) { + // if this fails, try once more. (issue #257) + td = (mi_thread_data_t*)_mi_os_alloc(sizeof(mi_thread_data_t), &memid, &_mi_stats_main); + if (td == NULL) { + // really out of memory + _mi_error_message(ENOMEM, "unable to allocate thread local heap metadata (%zu bytes)\n", sizeof(mi_thread_data_t)); + } + } + if (td != NULL) { + td->memid = memid; + is_zero = memid.initially_zero; + } + } + + if (td != NULL && !is_zero) { + _mi_memzero_aligned(td, sizeof(*td)); + } + return td; +} + +static void mi_thread_data_free( mi_thread_data_t* tdfree ) { + // try to add the thread metadata to the cache + for (int i = 0; i < TD_CACHE_SIZE; i++) { + mi_thread_data_t* td = mi_atomic_load_ptr_relaxed(mi_thread_data_t, &td_cache[i]); + if (td == NULL) { + mi_thread_data_t* expected = NULL; + if (mi_atomic_cas_ptr_weak_acq_rel(mi_thread_data_t, &td_cache[i], &expected, tdfree)) { + return; + } + } + } + // if that fails, just free it directly + _mi_os_free(tdfree, sizeof(mi_thread_data_t), tdfree->memid, &_mi_stats_main); +} + +void _mi_thread_data_collect(void) { + // free all thread metadata from the cache + for (int i = 0; i < TD_CACHE_SIZE; i++) { + mi_thread_data_t* td = mi_atomic_load_ptr_relaxed(mi_thread_data_t, &td_cache[i]); + if (td != NULL) { + td = mi_atomic_exchange_ptr_acq_rel(mi_thread_data_t, &td_cache[i], NULL); + if (td != NULL) { + _mi_os_free(td, sizeof(mi_thread_data_t), td->memid, &_mi_stats_main); + } + } + } +} + // Initialize the thread local default heap, called from `mi_thread_init` static bool _mi_heap_init(void) { - if (mi_heap_is_initialized(mi_get_default_heap())) return true; + if (mi_heap_is_initialized(mi_prim_get_default_heap())) return true; if (_mi_is_main_thread()) { // mi_assert_internal(_mi_heap_main.thread_id != 0); // can happen on freeBSD where alloc is called before any initialization // the main heap is statically allocated mi_heap_main_init(); _mi_heap_set_default_direct(&_mi_heap_main); - //mi_assert_internal(_mi_heap_default->tld->heap_backing == mi_get_default_heap()); + //mi_assert_internal(_mi_heap_default->tld->heap_backing == mi_prim_get_default_heap()); } else { // use `_mi_os_alloc` to allocate directly from the OS - mi_thread_data_t* td = (mi_thread_data_t*)_mi_os_alloc(sizeof(mi_thread_data_t), &_mi_stats_main); // Todo: more efficient allocation? - if (td == NULL) { - // if this fails, try once more. (issue #257) - td = (mi_thread_data_t*)_mi_os_alloc(sizeof(mi_thread_data_t), &_mi_stats_main); - if (td == NULL) { - // really out of memory - _mi_error_message(ENOMEM, "unable to allocate thread local heap metadata (%zu bytes)\n", sizeof(mi_thread_data_t)); - return false; - } - } - // OS allocated so already zero initialized + mi_thread_data_t* td = mi_thread_data_zalloc(); + if (td == NULL) return false; + mi_tld_t* tld = &td->tld; mi_heap_t* heap = &td->heap; - memcpy(heap, &_mi_heap_empty, sizeof(*heap)); + _mi_memcpy_aligned(tld, &tld_empty, sizeof(*tld)); + _mi_memcpy_aligned(heap, &_mi_heap_empty, sizeof(*heap)); heap->thread_id = _mi_thread_id(); _mi_random_init(&heap->random); heap->cookie = _mi_heap_random_next(heap) | 1; @@ -202,7 +312,7 @@ static bool _mi_heap_init(void) { tld->segments.stats = &tld->stats; tld->segments.os = &tld->os; tld->os.stats = &tld->stats; - _mi_heap_set_default_direct(heap); + _mi_heap_set_default_direct(heap); } return false; } @@ -235,23 +345,26 @@ static bool _mi_heap_done(mi_heap_t* heap) { if (heap != &_mi_heap_main) { _mi_heap_collect_abandon(heap); } - + // merge stats - _mi_stats_done(&heap->tld->stats); + _mi_stats_done(&heap->tld->stats); // free if not the main thread if (heap != &_mi_heap_main) { - mi_assert_internal(heap->tld->segments.count == 0 || heap->thread_id != _mi_thread_id()); - _mi_os_free(heap, sizeof(mi_thread_data_t), &_mi_stats_main); + // the following assertion does not always hold for huge segments as those are always treated + // as abondened: one may allocate it in one thread, but deallocate in another in which case + // the count can be too large or negative. todo: perhaps not count huge segments? see issue #363 + // mi_assert_internal(heap->tld->segments.count == 0 || heap->thread_id != _mi_thread_id()); + mi_thread_data_free((mi_thread_data_t*)heap); } -#if 0 - // never free the main thread even in debug mode; if a dll is linked statically with mimalloc, - // there may still be delete/free calls after the mi_fls_done is called. Issue #207 else { + #if 0 + // never free the main thread even in debug mode; if a dll is linked statically with mimalloc, + // there may still be delete/free calls after the mi_fls_done is called. Issue #207 _mi_heap_destroy_pages(heap); mi_assert_internal(heap->tld->heap_backing == &_mi_heap_main); + #endif } -#endif return false; } @@ -273,57 +386,12 @@ static bool _mi_heap_done(mi_heap_t* heap) { // to set up the thread local keys. // -------------------------------------------------------- -static void _mi_thread_done(mi_heap_t* default_heap); - -#ifdef __wasi__ -// no pthreads in the WebAssembly Standard Interface -#elif !defined(_WIN32) -#define MI_USE_PTHREADS -#endif - -#if defined(_WIN32) && defined(MI_SHARED_LIB) - // nothing to do as it is done in DllMain -#elif defined(_WIN32) && !defined(MI_SHARED_LIB) - // use thread local storage keys to detect thread ending - #include - #include - #if (_WIN32_WINNT < 0x600) // before Windows Vista - WINBASEAPI DWORD WINAPI TlsAlloc( _In_opt_ PFLS_CALLBACK_FUNCTION lpCallback ); - WINBASEAPI PVOID WINAPI TlsGetValue( _In_ DWORD dwFlsIndex ); - WINBASEAPI BOOL WINAPI TlsSetValue( _In_ DWORD dwFlsIndex, _In_opt_ PVOID lpFlsData ); - WINBASEAPI BOOL WINAPI TlsFree(_In_ DWORD dwFlsIndex); - #endif - static DWORD mi_fls_key = (DWORD)(-1); - static void NTAPI mi_fls_done(PVOID value) { - if (value!=NULL) _mi_thread_done((mi_heap_t*)value); - } -#elif defined(MI_USE_PTHREADS) - // use pthread local storage keys to detect thread ending - // (and used with MI_TLS_PTHREADS for the default heap) - #include - pthread_key_t _mi_heap_default_key = (pthread_key_t)(-1); - static void mi_pthread_done(void* value) { - if (value!=NULL) _mi_thread_done((mi_heap_t*)value); - } -#elif defined(__wasi__) -// no pthreads in the WebAssembly Standard Interface -#else - #pragma message("define a way to call mi_thread_done when a thread is done") -#endif - // Set up handlers so `mi_thread_done` is called automatically static void mi_process_setup_auto_thread_done(void) { static bool tls_initialized = false; // fine if it races if (tls_initialized) return; tls_initialized = true; - #if defined(_WIN32) && defined(MI_SHARED_LIB) - // nothing to do as it is done in DllMain - #elif defined(_WIN32) && !defined(MI_SHARED_LIB) - mi_fls_key = TlsAlloc(&mi_fls_done); - #elif defined(MI_USE_PTHREADS) - mi_assert_internal(_mi_heap_default_key == (pthread_key_t)(-1)); - pthread_key_create(&_mi_heap_default_key, &mi_pthread_done); - #endif + _mi_prim_thread_init_auto_done(); _mi_heap_set_default_direct(&_mi_heap_main); } @@ -332,31 +400,52 @@ bool _mi_is_main_thread(void) { return (_mi_heap_main.thread_id==0 || _mi_heap_main.thread_id == _mi_thread_id()); } +static _Atomic(size_t) thread_count = MI_ATOMIC_VAR_INIT(1); + +size_t _mi_current_thread_count(void) { + return mi_atomic_load_relaxed(&thread_count); +} + // This is called from the `mi_malloc_generic` void mi_thread_init(void) mi_attr_noexcept { // ensure our process has started already mi_process_init(); - + // initialize the thread local default heap // (this will call `_mi_heap_set_default_direct` and thus set the // fiber/pthread key to a non-zero value, ensuring `_mi_thread_done` is called) if (_mi_heap_init()) return; // returns true if already initialized _mi_stat_increase(&_mi_stats_main.threads, 1); + mi_atomic_increment_relaxed(&thread_count); //_mi_verbose_message("thread init: 0x%zx\n", _mi_thread_id()); } void mi_thread_done(void) mi_attr_noexcept { - _mi_thread_done(mi_get_default_heap()); + _mi_thread_done(NULL); } -static void _mi_thread_done(mi_heap_t* heap) { - _mi_stat_decrease(&_mi_stats_main.threads, 1); +void _mi_thread_done(mi_heap_t* heap) +{ + // calling with NULL implies using the default heap + if (heap == NULL) { + heap = mi_prim_get_default_heap(); + if (heap == NULL) return; + } + // prevent re-entrancy through heap_done/heap_set_default_direct (issue #699) + if (!mi_heap_is_initialized(heap)) { + return; + } + + // adjust stats + mi_atomic_decrement_relaxed(&thread_count); + _mi_stat_decrease(&_mi_stats_main.threads, 1); + // check thread-id as on Windows shutdown with FLS the main (exit) thread may call this on thread-local heaps... if (heap->thread_id != _mi_thread_id()) return; - + // abandon the thread local heap if (_mi_heap_done(heap)) return; // returns true if already ran } @@ -364,7 +453,7 @@ static void _mi_thread_done(mi_heap_t* heap) { void _mi_heap_set_default_direct(mi_heap_t* heap) { mi_assert_internal(heap != NULL); #if defined(MI_TLS_SLOT) - mi_tls_slot_set(MI_TLS_SLOT,heap); + mi_prim_tls_slot_set(MI_TLS_SLOT,heap); #elif defined(MI_TLS_PTHREAD_SLOT_OFS) *mi_tls_pthread_heap_slot() = heap; #elif defined(MI_TLS_PTHREAD) @@ -375,38 +464,29 @@ void _mi_heap_set_default_direct(mi_heap_t* heap) { // ensure the default heap is passed to `_mi_thread_done` // setting to a non-NULL value also ensures `mi_thread_done` is called. - #if defined(_WIN32) && defined(MI_SHARED_LIB) - // nothing to do as it is done in DllMain - #elif defined(_WIN32) && !defined(MI_SHARED_LIB) - mi_assert_internal(mi_fls_key != 0); - TlsSetValue(mi_fls_key, heap); - #elif defined(MI_USE_PTHREADS) - if (_mi_heap_default_key != (pthread_key_t)(-1)) { // can happen during recursive invocation on freeBSD - pthread_setspecific(_mi_heap_default_key, heap); - } - #endif + _mi_prim_thread_associate_default_heap(heap); } // -------------------------------------------------------- // Run functions on process init/done, and thread init/done // -------------------------------------------------------- -static void mi_process_done(void); +static void mi_cdecl mi_process_done(void); static bool os_preloading = true; // true until this module is initialized static bool mi_redirected = false; // true if malloc redirects to mi_malloc // Returns true if this module has not been initialized; Don't use C runtime routines until it returns false. -bool _mi_preloading(void) { +bool mi_decl_noinline _mi_preloading(void) { return os_preloading; } -bool mi_is_redirected(void) mi_attr_noexcept { +mi_decl_nodiscard bool mi_is_redirected(void) mi_attr_noexcept { return mi_redirected; } // Communicate with the redirection module on Windows -#if defined(_WIN32) && defined(MI_SHARED_LIB) +#if defined(_WIN32) && defined(MI_SHARED_LIB) && !defined(MI_WIN_NOREDIRECT) #ifdef __cplusplus extern "C" { #endif @@ -422,8 +502,8 @@ mi_decl_export void _mi_redirect_entry(DWORD reason) { mi_thread_done(); } } -__declspec(dllimport) bool mi_allocator_init(const char** message); -__declspec(dllimport) void mi_allocator_done(void); +__declspec(dllimport) bool mi_cdecl mi_allocator_init(const char** message); +__declspec(dllimport) void mi_cdecl mi_allocator_done(void); #ifdef __cplusplus } #endif @@ -440,15 +520,18 @@ static void mi_allocator_done(void) { // Called once by the process loader static void mi_process_load(void) { mi_heap_main_init(); - #if defined(MI_TLS_RECURSE_GUARD) + #if defined(__APPLE__) || defined(MI_TLS_RECURSE_GUARD) volatile mi_heap_t* dummy = _mi_heap_default; // access TLS to allocate it before setting tls_initialized to true; - UNUSED(dummy); + if (dummy == NULL) return; // use dummy or otherwise the access may get optimized away (issue #697) #endif os_preloading = false; + mi_assert_internal(_mi_is_main_thread()); + #if !(defined(_WIN32) && defined(MI_SHARED_LIB)) // use Dll process detach (see below) instead of atexit (issue #521) atexit(&mi_process_done); + #endif _mi_options_init(); + mi_process_setup_auto_thread_done(); mi_process_init(); - //mi_stats_reset();- if (mi_redirected) _mi_verbose_message("malloc is redirected.\n"); // show message from the redirector (if present) @@ -457,33 +540,81 @@ static void mi_process_load(void) { if (msg != NULL && (mi_option_is_enabled(mi_option_verbose) || mi_option_is_enabled(mi_option_show_errors))) { _mi_fputs(NULL,NULL,NULL,msg); } + + // reseed random + _mi_random_reinit_if_weak(&_mi_heap_main.random); } +#if defined(_WIN32) && (defined(_M_IX86) || defined(_M_X64)) +#include +mi_decl_cache_align bool _mi_cpu_has_fsrm = false; + +static void mi_detect_cpu_features(void) { + // FSRM for fast rep movsb support (AMD Zen3+ (~2020) or Intel Ice Lake+ (~2017)) + int32_t cpu_info[4]; + __cpuid(cpu_info, 7); + _mi_cpu_has_fsrm = ((cpu_info[3] & (1 << 4)) != 0); // bit 4 of EDX : see +} +#else +static void mi_detect_cpu_features(void) { + // nothing +} +#endif + // Initialize the process; called by thread_init or the process loader void mi_process_init(void) mi_attr_noexcept { // ensure we are called once - if (_mi_process_is_initialized) return; + static mi_atomic_once_t process_init; + #if _MSC_VER < 1920 + mi_heap_main_init(); // vs2017 can dynamically re-initialize _mi_heap_main + #endif + if (!mi_atomic_once(&process_init)) return; _mi_process_is_initialized = true; + _mi_verbose_message("process init: 0x%zx\n", _mi_thread_id()); mi_process_setup_auto_thread_done(); - _mi_verbose_message("process init: 0x%zx\n", _mi_thread_id()); + mi_detect_cpu_features(); _mi_os_init(); mi_heap_main_init(); - #if (MI_DEBUG) + #if MI_DEBUG _mi_verbose_message("debug level : %d\n", MI_DEBUG); #endif _mi_verbose_message("secure level: %d\n", MI_SECURE); + _mi_verbose_message("mem tracking: %s\n", MI_TRACK_TOOL); + #if MI_TSAN + _mi_verbose_message("thread santizer enabled\n"); + #endif mi_thread_init(); + + #if defined(_WIN32) + // On windows, when building as a static lib the FLS cleanup happens to early for the main thread. + // To avoid this, set the FLS value for the main thread to NULL so the fls cleanup + // will not call _mi_thread_done on the (still executing) main thread. See issue #508. + _mi_prim_thread_associate_default_heap(NULL); + #endif + mi_stats_reset(); // only call stat reset *after* thread init (or the heap tld == NULL) + mi_track_init(); if (mi_option_is_enabled(mi_option_reserve_huge_os_pages)) { - size_t pages = mi_option_get(mi_option_reserve_huge_os_pages); - mi_reserve_huge_os_pages_interleave(pages, 0, pages*500); + size_t pages = mi_option_get_clamp(mi_option_reserve_huge_os_pages, 0, 128*1024); + long reserve_at = mi_option_get(mi_option_reserve_huge_os_pages_at); + if (reserve_at != -1) { + mi_reserve_huge_os_pages_at(pages, reserve_at, pages*500); + } else { + mi_reserve_huge_os_pages_interleave(pages, 0, pages*500); + } + } + if (mi_option_is_enabled(mi_option_reserve_os_memory)) { + long ksize = mi_option_get(mi_option_reserve_os_memory); + if (ksize > 0) { + mi_reserve_os_memory((size_t)ksize*MI_KiB, true /* commit? */, true /* allow large pages? */); + } } } // Called when the process is done (through `at_exit`) -static void mi_process_done(void) { +static void mi_cdecl mi_process_done(void) { // only shutdown if we were initialized if (!_mi_process_is_initialized) return; // ensure we are called once @@ -491,22 +622,31 @@ static void mi_process_done(void) { if (process_done) return; process_done = true; - #if defined(_WIN32) && !defined(MI_SHARED_LIB) - TlsSetValue(mi_fls_key, NULL); // don't call main-thread callback - TlsFree(mi_fls_key); // call thread-done on all threads to prevent dangling callback pointer if statically linked with a DLL; Issue #208 - #endif + // release any thread specific resources and ensure _mi_thread_done is called on all but the main thread + _mi_prim_thread_done_auto_done(); - #if (MI_DEBUG != 0) || !defined(MI_SHARED_LIB) - // free all memory if possible on process exit. This is not needed for a stand-alone process - // but should be done if mimalloc is statically linked into another shared library which - // is repeatedly loaded/unloaded, see issue #281. - mi_collect(true /* force */ ); + #ifndef MI_SKIP_COLLECT_ON_EXIT + #if (MI_DEBUG || !defined(MI_SHARED_LIB)) + // free all memory if possible on process exit. This is not needed for a stand-alone process + // but should be done if mimalloc is statically linked into another shared library which + // is repeatedly loaded/unloaded, see issue #281. + mi_collect(true /* force */ ); + #endif #endif + // Forcefully release all retained memory; this can be dangerous in general if overriding regular malloc/free + // since after process_done there might still be other code running that calls `free` (like at_exit routines, + // or C-runtime termination code. + if (mi_option_is_enabled(mi_option_destroy_on_exit)) { + mi_collect(true /* force */); + _mi_heap_unsafe_destroy_all(); // forcefully release all memory held by all heaps (of this thread only!) + _mi_arena_unsafe_destroy_all(& _mi_heap_main_get()->tld->stats); + } + if (mi_option_is_enabled(mi_option_show_stats) || mi_option_is_enabled(mi_option_verbose)) { mi_stats_print(NULL); } - mi_allocator_done(); + mi_allocator_done(); _mi_verbose_message("process done: 0x%zx\n", _mi_heap_main.thread_id); os_preloading = true; // don't call the C runtime anymore } @@ -516,17 +656,40 @@ static void mi_process_done(void) { #if defined(_WIN32) && defined(MI_SHARED_LIB) // Windows DLL: easy to hook into process_init and thread_done __declspec(dllexport) BOOL WINAPI DllMain(HINSTANCE inst, DWORD reason, LPVOID reserved) { - UNUSED(reserved); - UNUSED(inst); + MI_UNUSED(reserved); + MI_UNUSED(inst); if (reason==DLL_PROCESS_ATTACH) { mi_process_load(); } + else if (reason==DLL_PROCESS_DETACH) { + mi_process_done(); + } else if (reason==DLL_THREAD_DETACH) { - if (!mi_is_redirected()) mi_thread_done(); + if (!mi_is_redirected()) { + mi_thread_done(); + } } return TRUE; } +#elif defined(_MSC_VER) + // MSVC: use data section magic for static libraries + // See + static int _mi_process_init(void) { + mi_process_load(); + return 0; + } + typedef int(*_mi_crt_callback_t)(void); + #if defined(_M_X64) || defined(_M_ARM64) + __pragma(comment(linker, "/include:" "_mi_msvc_initu")) + #pragma section(".CRT$XIU", long, read) + #else + __pragma(comment(linker, "/include:" "__mi_msvc_initu")) + #endif + #pragma data_seg(".CRT$XIU") + mi_decl_externc _mi_crt_callback_t _mi_msvc_initu[] = { &_mi_process_init }; + #pragma data_seg() + #elif defined(__cplusplus) // C++: use static initialization to detect process start static bool _mi_process_init(void) { @@ -541,24 +704,6 @@ static void mi_process_done(void) { mi_process_load(); } -#elif defined(_MSC_VER) - // MSVC: use data section magic for static libraries - // See - static int _mi_process_init(void) { - mi_process_load(); - return 0; - } - typedef int(*_crt_cb)(void); - #ifdef _M_X64 - __pragma(comment(linker, "/include:" "_mi_msvc_initu")) - #pragma section(".CRT$XIU", long, read) - #else - __pragma(comment(linker, "/include:" "__mi_msvc_initu")) - #endif - #pragma data_seg(".CRT$XIU") - _crt_cb _mi_msvc_initu[] = { &_mi_process_init }; - #pragma data_seg() - #else #pragma message("define a way to call mi_process_load on your platform") #endif diff --git a/src/options.c b/src/options.c index 9da3a9b..345b560 100644 --- a/src/options.c +++ b/src/options.c @@ -1,35 +1,28 @@ /* ---------------------------------------------------------------------------- -Copyright (c) 2018, Microsoft Research, Daan Leijen +Copyright (c) 2018-2021, Microsoft Research, Daan Leijen This is free software; you can redistribute it and/or modify it under the terms of the MIT license. A copy of the license can be found in the file "LICENSE" at the root of this distribution. -----------------------------------------------------------------------------*/ #include "mimalloc.h" -#include "mimalloc-internal.h" -#include "mimalloc-atomic.h" +#include "mimalloc/internal.h" +#include "mimalloc/atomic.h" +#include "mimalloc/prim.h" // mi_prim_out_stderr -#include -#include // strtol -#include // strncpy, strncat, strlen, strstr -#include // toupper +#include // FILE +#include // abort #include -#ifdef _MSC_VER -#pragma warning(disable:4996) // strncpy, strncat -#endif +static long mi_max_error_count = 16; // stop outputting errors after this (use < 0 for no limit) +static long mi_max_warning_count = 16; // stop outputting warnings after this (use < 0 for no limit) -static uintptr_t mi_max_error_count = 16; // stop outputting errors after this - -static void mi_add_stderr_output(); +static void mi_add_stderr_output(void); int mi_version(void) mi_attr_noexcept { return MI_MALLOC_VERSION; } -#ifdef _WIN32 -#include -#endif // -------------------------------------------------------- // Options @@ -48,46 +41,55 @@ typedef struct mi_option_desc_s { mi_init_t init; // is it initialized yet? (from the environment) mi_option_t option; // for debugging: the option index should match the option const char* name; // option name without `mimalloc_` prefix + const char* legacy_name; // potential legacy option name } mi_option_desc_t; -#define MI_OPTION(opt) mi_option_##opt, #opt -#define MI_OPTION_DESC(opt) {0, UNINIT, MI_OPTION(opt) } +#define MI_OPTION(opt) mi_option_##opt, #opt, NULL +#define MI_OPTION_LEGACY(opt,legacy) mi_option_##opt, #opt, #legacy static mi_option_desc_t options[_mi_option_last] = { // stable options -#if MI_DEBUG || defined(MI_SHOW_ERRORS) + #if MI_DEBUG || defined(MI_SHOW_ERRORS) { 1, UNINIT, MI_OPTION(show_errors) }, -#else + #else { 0, UNINIT, MI_OPTION(show_errors) }, -#endif + #endif { 0, UNINIT, MI_OPTION(show_stats) }, { 0, UNINIT, MI_OPTION(verbose) }, // the following options are experimental and not all combinations make sense. - { 1, UNINIT, MI_OPTION(eager_commit) }, // commit per segment directly (4MiB) (but see also `eager_commit_delay`) - #if defined(_WIN32) || (MI_INTPTR_SIZE <= 4) // and other OS's without overcommit? - { 0, UNINIT, MI_OPTION(eager_region_commit) }, - { 1, UNINIT, MI_OPTION(reset_decommits) }, // reset decommits memory - #else - { 1, UNINIT, MI_OPTION(eager_region_commit) }, - { 0, UNINIT, MI_OPTION(reset_decommits) }, // reset uses MADV_FREE/MADV_DONTNEED - #endif - { 0, UNINIT, MI_OPTION(large_os_pages) }, // use large OS pages, use only with eager commit to prevent fragmentation of VMA's - { 0, UNINIT, MI_OPTION(reserve_huge_os_pages) }, - { 0, UNINIT, MI_OPTION(segment_cache) }, // cache N segments per thread - { 1, UNINIT, MI_OPTION(page_reset) }, // reset page memory on free - { 0, UNINIT, MI_OPTION(abandoned_page_reset) },// reset free page memory when a thread terminates - { 0, UNINIT, MI_OPTION(segment_reset) }, // reset segment memory on free (needs eager commit) + { 1, UNINIT, MI_OPTION(eager_commit) }, // commit per segment directly (4MiB) (but see also `eager_commit_delay`) + { 2, UNINIT, MI_OPTION_LEGACY(arena_eager_commit,eager_region_commit) }, // eager commit arena's? 2 is used to enable this only on an OS that has overcommit (i.e. linux) + { 1, UNINIT, MI_OPTION_LEGACY(purge_decommits,reset_decommits) }, // purge decommits memory (instead of reset) (note: on linux this uses MADV_DONTNEED for decommit) + { 0, UNINIT, MI_OPTION_LEGACY(allow_large_os_pages,large_os_pages) }, // use large OS pages, use only with eager commit to prevent fragmentation of VMA's + { 0, UNINIT, MI_OPTION(reserve_huge_os_pages) }, // per 1GiB huge pages + {-1, UNINIT, MI_OPTION(reserve_huge_os_pages_at) }, // reserve huge pages at node N + { 0, UNINIT, MI_OPTION(reserve_os_memory) }, + { 0, UNINIT, MI_OPTION(deprecated_segment_cache) }, // cache N segments per thread + { 0, UNINIT, MI_OPTION(deprecated_page_reset) }, // reset page memory on free + { 0, UNINIT, MI_OPTION_LEGACY(abandoned_page_purge,abandoned_page_reset) }, // reset free page memory when a thread terminates + { 0, UNINIT, MI_OPTION(deprecated_segment_reset) }, // reset segment memory on free (needs eager commit) #if defined(__NetBSD__) - { 0, UNINIT, MI_OPTION(eager_commit_delay) }, // the first N segments per thread are not eagerly committed + { 0, UNINIT, MI_OPTION(eager_commit_delay) }, // the first N segments per thread are not eagerly committed #else - { 1, UNINIT, MI_OPTION(eager_commit_delay) }, // the first N segments per thread are not eagerly committed (but per page in the segment on demand) + { 1, UNINIT, MI_OPTION(eager_commit_delay) }, // the first N segments per thread are not eagerly committed (but per page in the segment on demand) #endif - { 100, UNINIT, MI_OPTION(reset_delay) }, // reset delay in milli-seconds - { 0, UNINIT, MI_OPTION(use_numa_nodes) }, // 0 = use available numa nodes, otherwise use at most N nodes. - { 100, UNINIT, MI_OPTION(os_tag) }, // only apple specific for now but might serve more or less related purpose - { 16, UNINIT, MI_OPTION(max_errors) } // maximum errors that are output + { 10, UNINIT, MI_OPTION_LEGACY(purge_delay,reset_delay) }, // purge delay in milli-seconds + { 0, UNINIT, MI_OPTION(use_numa_nodes) }, // 0 = use available numa nodes, otherwise use at most N nodes. + { 0, UNINIT, MI_OPTION(limit_os_alloc) }, // 1 = do not use OS memory for allocation (but only reserved arenas) + { 100, UNINIT, MI_OPTION(os_tag) }, // only apple specific for now but might serve more or less related purpose + { 16, UNINIT, MI_OPTION(max_errors) }, // maximum errors that are output + { 16, UNINIT, MI_OPTION(max_warnings) }, // maximum warnings that are output + { 8, UNINIT, MI_OPTION(max_segment_reclaim)}, // max. number of segment reclaims from the abandoned segments per try. + { 0, UNINIT, MI_OPTION(destroy_on_exit)}, // release all OS memory on process exit; careful with dangling pointer or after-exit frees! + #if (MI_INTPTR_SIZE>4) + { 1024L * 1024L, UNINIT, MI_OPTION(arena_reserve) }, // reserve memory N KiB at a time + #else + { 128L * 1024L, UNINIT, MI_OPTION(arena_reserve) }, + #endif + { 10, UNINIT, MI_OPTION(arena_purge_mult) }, // purge delay multiplier for arena's + { 1, UNINIT, MI_OPTION_LEGACY(purge_extend_delay, decommit_extend_delay) }, }; static void mi_option_init(mi_option_desc_t* desc); @@ -98,27 +100,42 @@ void _mi_options_init(void) { mi_add_stderr_output(); // now it safe to use stderr for output for(int i = 0; i < _mi_option_last; i++ ) { mi_option_t option = (mi_option_t)i; - long l = mi_option_get(option); UNUSED(l); // initialize - if (option != mi_option_verbose) { + long l = mi_option_get(option); MI_UNUSED(l); // initialize + // if (option != mi_option_verbose) + { mi_option_desc_t* desc = &options[option]; _mi_verbose_message("option '%s': %ld\n", desc->name, desc->value); } } mi_max_error_count = mi_option_get(mi_option_max_errors); + mi_max_warning_count = mi_option_get(mi_option_max_warnings); } -long mi_option_get(mi_option_t option) { +mi_decl_nodiscard long mi_option_get(mi_option_t option) { mi_assert(option >= 0 && option < _mi_option_last); + if (option < 0 || option >= _mi_option_last) return 0; mi_option_desc_t* desc = &options[option]; mi_assert(desc->option == option); // index should match the option - if (mi_unlikely(desc->init == UNINIT)) { + if mi_unlikely(desc->init == UNINIT) { mi_option_init(desc); } return desc->value; } +mi_decl_nodiscard long mi_option_get_clamp(mi_option_t option, long min, long max) { + long x = mi_option_get(option); + return (x < min ? min : (x > max ? max : x)); +} + +mi_decl_nodiscard size_t mi_option_get_size(mi_option_t option) { + mi_assert_internal(option == mi_option_reserve_os_memory || option == mi_option_arena_reserve); + long x = mi_option_get(option); + return (x < 0 ? 0 : (size_t)x * MI_KiB); +} + void mi_option_set(mi_option_t option, long value) { mi_assert(option >= 0 && option < _mi_option_last); + if (option < 0 || option >= _mi_option_last) return; mi_option_desc_t* desc = &options[option]; mi_assert(desc->option == option); // index should match the option desc->value = value; @@ -127,13 +144,14 @@ void mi_option_set(mi_option_t option, long value) { void mi_option_set_default(mi_option_t option, long value) { mi_assert(option >= 0 && option < _mi_option_last); + if (option < 0 || option >= _mi_option_last) return; mi_option_desc_t* desc = &options[option]; if (desc->init != INITIALIZED) { desc->value = value; } } -bool mi_option_is_enabled(mi_option_t option) { +mi_decl_nodiscard bool mi_option_is_enabled(mi_option_t option) { return (mi_option_get(option) != 0); } @@ -153,16 +171,11 @@ void mi_option_disable(mi_option_t option) { mi_option_set_enabled(option,false); } - -static void mi_out_stderr(const char* msg, void* arg) { - UNUSED(arg); - #ifdef _WIN32 - // on windows with redirection, the C runtime cannot handle locale dependent output - // after the main thread closes so we use direct console output. - if (!_mi_preloading()) { _cputs(msg); } - #else - fputs(msg, stderr); - #endif +static void mi_cdecl mi_out_stderr(const char* msg, void* arg) { + MI_UNUSED(arg); + if (msg != NULL && msg[0] != 0) { + _mi_prim_out_stderr(msg); + } } // Since an output function can be registered earliest in the `main` @@ -170,25 +183,25 @@ static void mi_out_stderr(const char* msg, void* arg) { // an output function is registered it is called immediately with // the output up to that point. #ifndef MI_MAX_DELAY_OUTPUT -#define MI_MAX_DELAY_OUTPUT ((uintptr_t)(32*1024)) +#define MI_MAX_DELAY_OUTPUT ((size_t)(32*1024)) #endif static char out_buf[MI_MAX_DELAY_OUTPUT+1]; -static _Atomic(uintptr_t) out_len; +static _Atomic(size_t) out_len; -static void mi_out_buf(const char* msg, void* arg) { - UNUSED(arg); +static void mi_cdecl mi_out_buf(const char* msg, void* arg) { + MI_UNUSED(arg); if (msg==NULL) return; if (mi_atomic_load_relaxed(&out_len)>=MI_MAX_DELAY_OUTPUT) return; - size_t n = strlen(msg); + size_t n = _mi_strlen(msg); if (n==0) return; // claim space - uintptr_t start = mi_atomic_add_acq_rel(&out_len, n); + size_t start = mi_atomic_add_acq_rel(&out_len, n); if (start >= MI_MAX_DELAY_OUTPUT) return; // check bound if (start+n >= MI_MAX_DELAY_OUTPUT) { n = MI_MAX_DELAY_OUTPUT-start-1; } - memcpy(&out_buf[start], msg, n); + _mi_memcpy(&out_buf[start], msg, n); } static void mi_out_buf_flush(mi_output_fun* out, bool no_more_buf, void* arg) { @@ -207,7 +220,7 @@ static void mi_out_buf_flush(mi_output_fun* out, bool no_more_buf, void* arg) { // Once this module is loaded, switch to this routine // which outputs to stderr and the delayed output buffer. -static void mi_out_buf_stderr(const char* msg, void* arg) { +static void mi_cdecl mi_out_buf_stderr(const char* msg, void* arg) { mi_out_stderr(msg,arg); mi_out_buf(msg,arg); } @@ -236,7 +249,7 @@ void mi_register_output(mi_output_fun* out, void* arg) mi_attr_noexcept { } // add stderr to the delayed output after the module is loaded -static void mi_add_stderr_output() { +static void mi_add_stderr_output(void) { mi_assert_internal(mi_out_default == NULL); mi_out_buf_flush(&mi_out_stderr, false, NULL); // flush current contents to stderr mi_out_default = &mi_out_buf_stderr; // and add stderr to the delayed output @@ -245,30 +258,46 @@ static void mi_add_stderr_output() { // -------------------------------------------------------- // Messages, all end up calling `_mi_fputs`. // -------------------------------------------------------- -static _Atomic(uintptr_t) error_count; // = 0; // when MAX_ERROR_COUNT stop emitting errors and warnings +static _Atomic(size_t) error_count; // = 0; // when >= max_error_count stop emitting errors +static _Atomic(size_t) warning_count; // = 0; // when >= max_warning_count stop emitting warnings // When overriding malloc, we may recurse into mi_vfprintf if an allocation // inside the C runtime causes another message. +// In some cases (like on macOS) the loader already allocates which +// calls into mimalloc; if we then access thread locals (like `recurse`) +// this may crash as the access may call _tlv_bootstrap that tries to +// (recursively) invoke malloc again to allocate space for the thread local +// variables on demand. This is why we use a _mi_preloading test on such +// platforms. However, C code generator may move the initial thread local address +// load before the `if` and we therefore split it out in a separate funcion. static mi_decl_thread bool recurse = false; -static bool mi_recurse_enter(void) { - #ifdef MI_TLS_RECURSE_GUARD - if (_mi_preloading()) return true; - #endif +static mi_decl_noinline bool mi_recurse_enter_prim(void) { if (recurse) return false; recurse = true; return true; } -static void mi_recurse_exit(void) { - #ifdef MI_TLS_RECURSE_GUARD - if (_mi_preloading()) return; - #endif +static mi_decl_noinline void mi_recurse_exit_prim(void) { recurse = false; } +static bool mi_recurse_enter(void) { + #if defined(__APPLE__) || defined(MI_TLS_RECURSE_GUARD) + if (_mi_preloading()) return false; + #endif + return mi_recurse_enter_prim(); +} + +static void mi_recurse_exit(void) { + #if defined(__APPLE__) || defined(MI_TLS_RECURSE_GUARD) + if (_mi_preloading()) return; + #endif + mi_recurse_exit_prim(); +} + void _mi_fputs(mi_output_fun* out, void* arg, const char* prefix, const char* message) { - if (out==NULL || (FILE*)out==stdout || (FILE*)out==stderr) { // TODO: use mi_out_stderr for stderr? + if (out==NULL || (void*)out==(void*)stdout || (void*)out==(void*)stderr) { // TODO: use mi_out_stderr for stderr? if (!mi_recurse_enter()) return; out = mi_out_get_default(&arg); if (prefix != NULL) out(prefix, arg); @@ -299,11 +328,22 @@ void _mi_fprintf( mi_output_fun* out, void* arg, const char* fmt, ... ) { va_end(args); } +static void mi_vfprintf_thread(mi_output_fun* out, void* arg, const char* prefix, const char* fmt, va_list args) { + if (prefix != NULL && _mi_strnlen(prefix,33) <= 32 && !_mi_is_main_thread()) { + char tprefix[64]; + snprintf(tprefix, sizeof(tprefix), "%sthread 0x%llx: ", prefix, (unsigned long long)_mi_thread_id()); + mi_vfprintf(out, arg, tprefix, fmt, args); + } + else { + mi_vfprintf(out, arg, prefix, fmt, args); + } +} + void _mi_trace_message(const char* fmt, ...) { if (mi_option_get(mi_option_verbose) <= 1) return; // only with verbose level 2 or higher va_list args; va_start(args, fmt); - mi_vfprintf(NULL, NULL, "mimalloc: ", fmt, args); + mi_vfprintf_thread(NULL, NULL, "mimalloc: ", fmt, args); va_end(args); } @@ -316,17 +356,21 @@ void _mi_verbose_message(const char* fmt, ...) { } static void mi_show_error_message(const char* fmt, va_list args) { - if (!mi_option_is_enabled(mi_option_show_errors) && !mi_option_is_enabled(mi_option_verbose)) return; - if (mi_atomic_increment_acq_rel(&error_count) > mi_max_error_count) return; - mi_vfprintf(NULL, NULL, "mimalloc: error: ", fmt, args); + if (!mi_option_is_enabled(mi_option_verbose)) { + if (!mi_option_is_enabled(mi_option_show_errors)) return; + if (mi_max_error_count >= 0 && (long)mi_atomic_increment_acq_rel(&error_count) > mi_max_error_count) return; + } + mi_vfprintf_thread(NULL, NULL, "mimalloc: error: ", fmt, args); } void _mi_warning_message(const char* fmt, ...) { - if (!mi_option_is_enabled(mi_option_show_errors) && !mi_option_is_enabled(mi_option_verbose)) return; - if (mi_atomic_increment_acq_rel(&error_count) > mi_max_error_count) return; + if (!mi_option_is_enabled(mi_option_verbose)) { + if (!mi_option_is_enabled(mi_option_show_errors)) return; + if (mi_max_warning_count >= 0 && (long)mi_atomic_increment_acq_rel(&warning_count) > mi_max_warning_count) return; + } va_list args; va_start(args,fmt); - mi_vfprintf(NULL, NULL, "mimalloc: warning: ", fmt, args); + mi_vfprintf_thread(NULL, NULL, "mimalloc: warning: ", fmt, args); va_end(args); } @@ -346,8 +390,8 @@ static mi_error_fun* volatile mi_error_handler; // = NULL static _Atomic(void*) mi_error_arg; // = NULL static void mi_error_default(int err) { - UNUSED(err); -#if (MI_DEBUG>0) + MI_UNUSED(err); +#if (MI_DEBUG>0) if (err==EFAULT) { #ifdef _MSC_VER __debugbreak(); @@ -390,109 +434,97 @@ void _mi_error_message(int err, const char* fmt, ...) { // -------------------------------------------------------- // Initialize options by checking the environment // -------------------------------------------------------- - -static void mi_strlcpy(char* dest, const char* src, size_t dest_size) { - dest[0] = 0; - strncpy(dest, src, dest_size - 1); - dest[dest_size - 1] = 0; +char _mi_toupper(char c) { + if (c >= 'a' && c <= 'z') return (c - 'a' + 'A'); + else return c; } -static void mi_strlcat(char* dest, const char* src, size_t dest_size) { - strncat(dest, src, dest_size - 1); - dest[dest_size - 1] = 0; -} - -static inline int mi_strnicmp(const char* s, const char* t, size_t n) { - if (n==0) return 0; +int _mi_strnicmp(const char* s, const char* t, size_t n) { + if (n == 0) return 0; for (; *s != 0 && *t != 0 && n > 0; s++, t++, n--) { - if (toupper(*s) != toupper(*t)) break; + if (_mi_toupper(*s) != _mi_toupper(*t)) break; } - return (n==0 ? 0 : *s - *t); + return (n == 0 ? 0 : *s - *t); } -#if defined _WIN32 -// On Windows use GetEnvironmentVariable instead of getenv to work -// reliably even when this is invoked before the C runtime is initialized. -// i.e. when `_mi_preloading() == true`. -// Note: on windows, environment names are not case sensitive. -#include -static bool mi_getenv(const char* name, char* result, size_t result_size) { - result[0] = 0; - size_t len = GetEnvironmentVariableA(name, result, (DWORD)result_size); - return (len > 0 && len < result_size); -} -#elif !defined(MI_USE_ENVIRON) || (MI_USE_ENVIRON!=0) -// On Posix systemsr use `environ` to acces environment variables -// even before the C runtime is initialized. -#if defined(__APPLE__) && defined(__has_include) && __has_include() -#include -static char** mi_get_environ(void) { - return (*_NSGetEnviron()); -} -#else -extern char** environ; -static char** mi_get_environ(void) { - return environ; -} -#endif -static bool mi_getenv(const char* name, char* result, size_t result_size) { - if (name==NULL) return false; - const size_t len = strlen(name); - if (len == 0) return false; - char** env = mi_get_environ(); - if (env == NULL) return false; - // compare up to 256 entries - for (int i = 0; i < 256 && env[i] != NULL; i++) { - const char* s = env[i]; - if (mi_strnicmp(name, s, len) == 0 && s[len] == '=') { // case insensitive - // found it - mi_strlcpy(result, s + len + 1, result_size); - return true; - } +void _mi_strlcpy(char* dest, const char* src, size_t dest_size) { + if (dest==NULL || src==NULL || dest_size == 0) return; + // copy until end of src, or when dest is (almost) full + while (*src != 0 && dest_size > 1) { + *dest++ = *src++; + dest_size--; } + // always zero terminate + *dest = 0; +} + +void _mi_strlcat(char* dest, const char* src, size_t dest_size) { + if (dest==NULL || src==NULL || dest_size == 0) return; + // find end of string in the dest buffer + while (*dest != 0 && dest_size > 1) { + dest++; + dest_size--; + } + // and catenate + _mi_strlcpy(dest, src, dest_size); +} + +size_t _mi_strlen(const char* s) { + if (s==NULL) return 0; + size_t len = 0; + while(s[len] != 0) { len++; } + return len; +} + +size_t _mi_strnlen(const char* s, size_t max_len) { + if (s==NULL) return 0; + size_t len = 0; + while(s[len] != 0 && len < max_len) { len++; } + return len; +} + +#ifdef MI_NO_GETENV +static bool mi_getenv(const char* name, char* result, size_t result_size) { + MI_UNUSED(name); + MI_UNUSED(result); + MI_UNUSED(result_size); return false; } -#else -// fallback: use standard C `getenv` but this cannot be used while initializing the C runtime +#else static bool mi_getenv(const char* name, char* result, size_t result_size) { - // cannot call getenv() when still initializing the C runtime. - if (_mi_preloading()) return false; - const char* s = getenv(name); - if (s == NULL) { - // we check the upper case name too. - char buf[64+1]; - size_t len = strlen(name); - if (len >= sizeof(buf)) len = sizeof(buf) - 1; - for (size_t i = 0; i < len; i++) { - buf[i] = toupper(name[i]); - } - buf[len] = 0; - s = getenv(buf); - } - if (s != NULL && strlen(s) < result_size) { - mi_strlcpy(result, s, result_size); - return true; - } - else { - return false; - } + if (name==NULL || result == NULL || result_size < 64) return false; + return _mi_prim_getenv(name,result,result_size); } #endif -static void mi_option_init(mi_option_desc_t* desc) { +// TODO: implement ourselves to reduce dependencies on the C runtime +#include // strtol +#include // strstr + + +static void mi_option_init(mi_option_desc_t* desc) { // Read option value from the environment + char s[64 + 1]; char buf[64+1]; - mi_strlcpy(buf, "mimalloc_", sizeof(buf)); - mi_strlcat(buf, desc->name, sizeof(buf)); - char s[64+1]; - if (mi_getenv(buf, s, sizeof(s))) { - size_t len = strlen(s); - if (len >= sizeof(buf)) len = sizeof(buf) - 1; + _mi_strlcpy(buf, "mimalloc_", sizeof(buf)); + _mi_strlcat(buf, desc->name, sizeof(buf)); + bool found = mi_getenv(buf, s, sizeof(s)); + if (!found && desc->legacy_name != NULL) { + _mi_strlcpy(buf, "mimalloc_", sizeof(buf)); + _mi_strlcat(buf, desc->legacy_name, sizeof(buf)); + found = mi_getenv(buf, s, sizeof(s)); + if (found) { + _mi_warning_message("environment option \"mimalloc_%s\" is deprecated -- use \"mimalloc_%s\" instead.\n", desc->legacy_name, desc->name); + } + } + + if (found) { + size_t len = _mi_strnlen(s, sizeof(buf) - 1); for (size_t i = 0; i < len; i++) { - buf[i] = (char)toupper(s[i]); + buf[i] = _mi_toupper(s[i]); } buf[len] = 0; - if (buf[0]==0 || strstr("1;TRUE;YES;ON", buf) != NULL) { + if (buf[0] == 0 || strstr("1;TRUE;YES;ON", buf) != NULL) { desc->value = 1; desc->init = INITIALIZED; } @@ -503,13 +535,32 @@ static void mi_option_init(mi_option_desc_t* desc) { else { char* end = buf; long value = strtol(buf, &end, 10); + if (desc->option == mi_option_reserve_os_memory || desc->option == mi_option_arena_reserve) { + // this option is interpreted in KiB to prevent overflow of `long` + if (*end == 'K') { end++; } + else if (*end == 'M') { value *= MI_KiB; end++; } + else if (*end == 'G') { value *= MI_MiB; end++; } + else { value = (value + MI_KiB - 1) / MI_KiB; } + if (end[0] == 'I' && end[1] == 'B') { end += 2; } + else if (*end == 'B') { end++; } + } if (*end == 0) { desc->value = value; desc->init = INITIALIZED; } else { - _mi_warning_message("environment option mimalloc_%s has an invalid value: %s\n", desc->name, buf); + // set `init` first to avoid recursion through _mi_warning_message on mimalloc_verbose. desc->init = DEFAULTED; + if (desc->option == mi_option_verbose && desc->value == 0) { + // if the 'mimalloc_verbose' env var has a bogus value we'd never know + // (since the value defaults to 'off') so in that case briefly enable verbose + desc->value = 1; + _mi_warning_message("environment option mimalloc_%s has an invalid value.\n", desc->name); + desc->value = 0; + } + else { + _mi_warning_message("environment option mimalloc_%s has an invalid value.\n", desc->name); + } } } mi_assert_internal(desc->init != UNINIT); diff --git a/src/os.c b/src/os.c index 3bac953..b4f02ba 100644 --- a/src/os.c +++ b/src/os.c @@ -1,584 +1,218 @@ /* ---------------------------------------------------------------------------- -Copyright (c) 2018, Microsoft Research, Daan Leijen +Copyright (c) 2018-2023, Microsoft Research, Daan Leijen This is free software; you can redistribute it and/or modify it under the terms of the MIT license. A copy of the license can be found in the file "LICENSE" at the root of this distribution. -----------------------------------------------------------------------------*/ -#include "AuroraEnvironment.h" - -#ifndef _DEFAULT_SOURCE -#define _DEFAULT_SOURCE // ensure mmap flags are defined -#endif - -#if defined(__sun) -// illumos provides new mman.h api when any of these are defined -// otherwise the old api based on caddr_t which predates the void pointers one. -// stock solaris provides only the former, chose to atomically to discard those -// flags only here rather than project wide tough. -#undef _XOPEN_SOURCE -#undef _POSIX_C_SOURCE -#endif #include "mimalloc.h" -#include "mimalloc-internal.h" -#include "mimalloc-atomic.h" +#include "mimalloc/internal.h" +#include "mimalloc/atomic.h" +#include "mimalloc/prim.h" -#if defined(_AURORA_MEM_STRICT) -#include // std allocation -#endif - -#include // strerror - -#ifdef _MSC_VER -#pragma warning(disable:4996) // strerror -#endif - - -#if defined(_WIN32) -#include -#elif defined(__wasi__) -// stdlib.h is all we need, and has already been included in mimalloc.h -#else -#include // mmap -#include // sysconf -#if defined(__linux__) -#include -#if defined(__GLIBC__) -#include // linux mmap flags -#else -#include -#endif -#endif -#if defined(__APPLE__) -#include -#if !TARGET_IOS_IPHONE && !TARGET_IOS_SIMULATOR -#include -#endif -#endif -#if defined(__HAIKU__) -#define madvise posix_madvise -#define MADV_DONTNEED POSIX_MADV_DONTNEED -#endif -#endif /* ----------------------------------------------------------- Initialization. On windows initializes support for aligned allocation and large OS pages (if MIMALLOC_LARGE_OS_PAGES is true). ----------------------------------------------------------- */ -bool _mi_os_decommit(void* addr, size_t size, mi_stats_t* stats); + +static mi_os_mem_config_t mi_os_mem_config = { + 4096, // page size + 0, // large page size (usually 2MiB) + 4096, // allocation granularity + true, // has overcommit? (if true we use MAP_NORESERVE on mmap systems) + false, // must free whole? (on mmap systems we can free anywhere in a mapped range, but on Windows we must free the entire span) + true // has virtual reserve? (if true we can reserve virtual address space without using commit or physical memory) +}; + +bool _mi_os_has_overcommit(void) { + return mi_os_mem_config.has_overcommit; +} + +bool _mi_os_has_virtual_reserve(void) { + return mi_os_mem_config.has_virtual_reserve; +} + + +// OS (small) page size +size_t _mi_os_page_size(void) { + return mi_os_mem_config.page_size; +} + +// if large OS pages are supported (2 or 4MiB), then return the size, otherwise return the small page size (4KiB) +size_t _mi_os_large_page_size(void) { + return (mi_os_mem_config.large_page_size != 0 ? mi_os_mem_config.large_page_size : _mi_os_page_size()); +} + +bool _mi_os_use_large_page(size_t size, size_t alignment) { + // if we have access, check the size and alignment requirements + if (mi_os_mem_config.large_page_size == 0 || !mi_option_is_enabled(mi_option_allow_large_os_pages)) return false; + return ((size % mi_os_mem_config.large_page_size) == 0 && (alignment % mi_os_mem_config.large_page_size) == 0); +} + +// round to a good OS allocation size (bounded by max 12.5% waste) +size_t _mi_os_good_alloc_size(size_t size) { + size_t align_size; + if (size < 512*MI_KiB) align_size = _mi_os_page_size(); + else if (size < 2*MI_MiB) align_size = 64*MI_KiB; + else if (size < 8*MI_MiB) align_size = 256*MI_KiB; + else if (size < 32*MI_MiB) align_size = 1*MI_MiB; + else align_size = 4*MI_MiB; + if mi_unlikely(size >= (SIZE_MAX - align_size)) return size; // possible overflow? + return _mi_align_up(size, align_size); +} + +void _mi_os_init(void) { + _mi_prim_mem_init(&mi_os_mem_config); +} + + +/* ----------------------------------------------------------- + Util +-------------------------------------------------------------- */ +bool _mi_os_decommit(void* addr, size_t size, mi_stats_t* stats); +bool _mi_os_commit(void* addr, size_t size, bool* is_zero, mi_stats_t* tld_stats); static void* mi_align_up_ptr(void* p, size_t alignment) { return (void*)_mi_align_up((uintptr_t)p, alignment); } -static uintptr_t _mi_align_down(uintptr_t sz, size_t alignment) { - return (sz / alignment) * alignment; -} - static void* mi_align_down_ptr(void* p, size_t alignment) { return (void*)_mi_align_down((uintptr_t)p, alignment); } -// page size (initialized properly in `os_init`) -static size_t os_page_size = 4096; - -// minimal allocation granularity -static size_t os_alloc_granularity = 4096; - -// if non-zero, use large page allocation -static size_t large_os_page_size = 0; - -// OS (small) page size -size_t _mi_os_page_size() { - return os_page_size; -} - -// if large OS pages are supported (2 or 4MiB), then return the size, otherwise return the small page size (4KiB) -size_t _mi_os_large_page_size() { - return (large_os_page_size != 0 ? large_os_page_size : _mi_os_page_size()); -} - -static bool use_large_os_page(size_t size, size_t alignment) { - // if we have access, check the size and alignment requirements - if (large_os_page_size == 0 || !mi_option_is_enabled(mi_option_large_os_pages)) return false; - return ((size % large_os_page_size) == 0 && (alignment % large_os_page_size) == 0); -} - -// round to a good OS allocation size (bounded by max 12.5% waste) -size_t _mi_os_good_alloc_size(size_t size) { - size_t align_size; - if (size < 512*KiB) align_size = _mi_os_page_size(); - else if (size < 2*MiB) align_size = 64*KiB; - else if (size < 8*MiB) align_size = 256*KiB; - else if (size < 32*MiB) align_size = 1*MiB; - else align_size = 4*MiB; - if (size >= (SIZE_MAX - align_size)) return size; // possible overflow? - return _mi_align_up(size, align_size); -} - -#if defined(_WIN32) -// We use VirtualAlloc2 for aligned allocation, but it is only supported on Windows 10 and Windows Server 2016. -// So, we need to look it up dynamically to run on older systems. (use __stdcall for 32-bit compatibility) -// NtAllocateVirtualAllocEx is used for huge OS page allocation (1GiB) -// -// We hide MEM_EXTENDED_PARAMETER to compile with older SDK's. -#include -typedef PVOID (__stdcall *PVirtualAlloc2)(HANDLE, PVOID, SIZE_T, ULONG, ULONG, /* MEM_EXTENDED_PARAMETER* */ void*, ULONG); -typedef NTSTATUS (__stdcall *PNtAllocateVirtualMemoryEx)(HANDLE, PVOID*, SIZE_T*, ULONG, ULONG, /* MEM_EXTENDED_PARAMETER* */ PVOID, ULONG); -static PVirtualAlloc2 pVirtualAlloc2 = NULL; -static PNtAllocateVirtualMemoryEx pNtAllocateVirtualMemoryEx = NULL; - -// Similarly, GetNumaProcesorNodeEx is only supported since Windows 7 -#if (_WIN32_WINNT < 0x601) // before Win7 -typedef struct _PROCESSOR_NUMBER { WORD Group; BYTE Number; BYTE Reserved; } PROCESSOR_NUMBER, *PPROCESSOR_NUMBER; -#endif -typedef VOID (__stdcall *PGetCurrentProcessorNumberEx)(PPROCESSOR_NUMBER ProcNumber); -typedef BOOL (__stdcall *PGetNumaProcessorNodeEx)(PPROCESSOR_NUMBER Processor, PUSHORT NodeNumber); -typedef BOOL (__stdcall* PGetNumaNodeProcessorMaskEx)(USHORT Node, PGROUP_AFFINITY ProcessorMask); -static PGetCurrentProcessorNumberEx pGetCurrentProcessorNumberEx = NULL; -static PGetNumaProcessorNodeEx pGetNumaProcessorNodeEx = NULL; -static PGetNumaNodeProcessorMaskEx pGetNumaNodeProcessorMaskEx = NULL; -static DWORD(__stdcall *pGetCurrentProcessorNumber)() = NULL; L; -static DWORD(__stdcall* pGetLargePageMinimum)() = NULL; -static BOOL(__stdcall* pGetNumaHighestNodeNumber)(PULONG HighestNodeNumber) = NULL; -static BOOL(__stdcall* pGetNumaProcessorNode)(UCHAR Processor, PUCHAR NodeNumber) = NULL; -static BOOL(__stdcall* pGetNumaNodeProcessorMask)(UCHAR Processor, PULONGLONG ProcessorMask) = NULL; -static BOOL(__stdcall* pLookupPrivilegeValueW)(LPCWSTR lpSystemName, - LPCWSTR lpName, - PLUID lpLuid) = NULL; -static BOOL(__stdcall* pAdjustTokenPrivileges)(HANDLE TokenHandle, - BOOL DisableAllPrivileges, - PTOKEN_PRIVILEGES NewState, - DWORD BufferLength, - PTOKEN_PRIVILEGES PreviousState, - PDWORD ReturnLength) = NULL; -static BOOL(__stdcall* pOpenProcessToken)( - HANDLE ProcessHandle, - DWORD DesiredAccess, - PHANDLE TokenHandle) = NULL; - -static bool mi_win_enable_large_os_pages() -{ - if (large_os_page_size > 0) return true; - if (!pGetLargePageMinimum) return false; - - // Try to see if large OS pages are supported - // To use large pages on Windows, we first need access permission - // Set "Lock pages in memory" permission in the group policy editor - // - unsigned long err = 0; - HANDLE token = NULL; - BOOL ok = pOpenProcessToken && - pOpenProcessToken(GetCurrentProcess(), TOKEN_ADJUST_PRIVILEGES | TOKEN_QUERY, &token); - if (ok) { - TOKEN_PRIVILEGES tp; - ok = pLookupPrivilegeValueW && - pLookupPrivilegeValueW(NULL, L"SeLockMemoryPrivilege", &tp.Privileges[0].Luid); - if (ok) { - tp.PrivilegeCount = 1; - tp.Privileges[0].Attributes = SE_PRIVILEGE_ENABLED; - ok = pAdjustTokenPrivileges && - pAdjustTokenPrivileges(token, FALSE, &tp, 0, (PTOKEN_PRIVILEGES)NULL, 0); - if (ok) { - err = GetLastError(); - ok = (err == ERROR_SUCCESS); - if (ok) { - large_os_page_size = pGetLargePageMinimum(); - } - } - } - CloseHandle(token); - } - if (!ok) { - if (err == 0) err = GetLastError(); - _mi_warning_message("cannot enable large OS page support, error %lu\n", err); - } - return (ok!=0); -} - -void _mi_os_init(void) { - // get the page size - SYSTEM_INFO si; - GetSystemInfo(&si); - if (si.dwPageSize > 0) os_page_size = si.dwPageSize; - if (si.dwAllocationGranularity > 0) os_alloc_granularity = si.dwAllocationGranularity; - // get the VirtualAlloc2 function - HINSTANCE hDll; - hDll = LoadLibrary(TEXT("kernelbase.dll")); - if (hDll != NULL) { - // use VirtualAlloc2FromApp if possible as it is available to Windows store apps - pVirtualAlloc2 = (PVirtualAlloc2)(void (*)(void))GetProcAddress(hDll, "VirtualAlloc2FromApp"); - if (pVirtualAlloc2==NULL) pVirtualAlloc2 = (PVirtualAlloc2)(void (*)(void))GetProcAddress(hDll, "VirtualAlloc2"); - } - // NtAllocateVirtualMemoryEx is used for huge page allocation - hDll = LoadLibrary(TEXT("ntdll.dll")); - if (hDll != NULL) { - pNtAllocateVirtualMemoryEx = (PNtAllocateVirtualMemoryEx)(void (*)(void))GetProcAddress(hDll, "NtAllocateVirtualMemoryEx"); - } - // Try to use Win7+ numa API - hDll = LoadLibrary(TEXT("kernel32.dll")); - if (hDll != NULL) { - pGetCurrentProcessorNumberEx = (PGetCurrentProcessorNumberEx)(void (*)(void))GetProcAddress(hDll, "GetCurrentProcessorNumberEx"); - pGetNumaProcessorNodeEx = (PGetNumaProcessorNodeEx)(void (*)(void))GetProcAddress(hDll, "GetNumaProcessorNodeEx"); - pGetNumaNodeProcessorMaskEx = (PGetNumaNodeProcessorMaskEx)(void (*)(void))GetProcAddress(hDll, "GetNumaNodeProcessorMaskEx"); - pGetCurrentProcessorNumber = (DWORD(__stdcall*)())GetProcAddress(hDll, "GetCurrentProcessorNumber"); - pGetLargePageMinimum = (DWORD(__cdecl*)())GetProcAddress(hDll, "GetLargePageMinimum"); - pGetNumaHighestNodeNumber = (BOOL(__stdcall*)(PULONG))GetProcAddress(hDll, "GetNumaHighestNodeNumber"); - pGetNumaProcessorNode = (BOOL(__stdcall*)(UCHAR, PUCHAR))GetProcAddress(hDll, "GetNumaProcessorNode"); - pGetNumaNodeProcessorMask = (BOOL(__stdcall*)(UCHAR, PULONGLONG))GetProcAddress(hDll, "GetNumaNodeProcessorMask"); - } - - hDll = LoadLibrary(TEXT("Advapi32.dll")); - if (hDll != NULL) { - pLookupPrivilegeValueW = (BOOL(__stdcall*)(LPCWSTR, - LPCWSTR, - PLUID))GetProcAddress(hDll, "LookupPrivilegeValueW"); - - pAdjustTokenPrivileges = (BOOL(__stdcall*)(HANDLE, - BOOL, - PTOKEN_PRIVILEGES, - DWORD, - PTOKEN_PRIVILEGES, - PDWORD))GetProcAddress(hDll, "AdjustTokenPrivileges"); - - pOpenProcessToken = (BOOL(__stdcall*)( - HANDLE , - DWORD, - PHANDLE))GetProcAddress(hDll, "OpenProcessToken"); - } - if (mi_option_is_enabled(mi_option_large_os_pages) || mi_option_is_enabled(mi_option_reserve_huge_os_pages)) { - mi_win_enable_large_os_pages(); - } -} -#elif defined(__wasi__) -void _mi_os_init() { - os_page_size = 0x10000; // WebAssembly has a fixed page size: 64KB - os_alloc_granularity = 16; -} -#else -void _mi_os_init() { - // get the page size - long result = sysconf(_SC_PAGESIZE); - if (result > 0) { - os_page_size = (size_t)result; - os_alloc_granularity = os_page_size; - } - large_os_page_size = 2*MiB; // TODO: can we query the OS for this? -} -#endif - /* ----------------------------------------------------------- - Raw allocation on Windows (VirtualAlloc) and Unix's (mmap). ------------------------------------------------------------ */ - -static bool mi_os_mem_free(void* addr, size_t size, bool was_committed, mi_stats_t* stats) -{ - if (addr == NULL || size == 0) return true; // || _mi_os_is_huge_reserved(addr) - bool err = false; -#if defined(_AURORA_MEM_STRICT) - free(addr); - err = 0; -#elif defined(_WIN32) - err = (VirtualFree(addr, 0, MEM_RELEASE) == 0); -#elif defined(__wasi__) - err = 0; // WebAssembly's heap cannot be shrunk -#else - err = (munmap(addr, size) == -1); -#endif - if (was_committed) _mi_stat_decrease(&stats->committed, size); - _mi_stat_decrease(&stats->reserved, size); - if (err) { - _mi_warning_message("munmap failed: %s, addr 0x%8li, size %lu\n", strerror(errno), (size_t)addr, size); - return false; - } - else { - return true; - } -} - -static void* mi_os_get_aligned_hint(size_t try_alignment, size_t size); - -#if defined(_AURORA_MEM_STRICT) - -#elif defined(_WIN32) -static void* mi_win_virtual_allocx(void* addr, size_t size, size_t try_alignment, DWORD flags) { -#if (MI_INTPTR_SIZE >= 8) - // on 64-bit systems, try to use the virtual address area after 4TiB for 4MiB aligned allocations - void* hint; - if (addr == NULL && (hint = mi_os_get_aligned_hint(try_alignment,size)) != NULL) { - void* p = VirtualAlloc(hint, size, flags, PAGE_READWRITE); - if (p != NULL) return p; - DWORD err = GetLastError(); - if (err != ERROR_INVALID_ADDRESS && // If linked with multiple instances, we may have tried to allocate at an already allocated area (#210) - err != ERROR_INVALID_PARAMETER) { // Windows7 instability (#230) - return NULL; - } - // fall through - } -#endif -#if defined(MEM_EXTENDED_PARAMETER_TYPE_BITS) - // on modern Windows try use VirtualAlloc2 for aligned allocation - if (try_alignment > 0 && (try_alignment % _mi_os_page_size()) == 0 && pVirtualAlloc2 != NULL) { - MEM_ADDRESS_REQUIREMENTS reqs = { 0, 0, 0 }; - reqs.Alignment = try_alignment; - MEM_EXTENDED_PARAMETER param = { {0, 0}, {0} }; - param.Type = MemExtendedParameterAddressRequirements; - param.Pointer = &reqs; - return (*pVirtualAlloc2)(GetCurrentProcess(), addr, size, flags, PAGE_READWRITE, ¶m, 1); - } -#endif - // last resort - return VirtualAlloc(addr, size, flags, PAGE_READWRITE); -} - -static void* mi_win_virtual_alloc(void* addr, size_t size, size_t try_alignment, DWORD flags, bool large_only, bool allow_large, bool* is_large) { - mi_assert_internal(!(large_only && !allow_large)); - static _Atomic(uintptr_t) large_page_try_ok; // = 0; - void* p = NULL; - if ((large_only || use_large_os_page(size, try_alignment)) - && allow_large && (flags&MEM_COMMIT)!=0 && (flags&MEM_RESERVE)!=0) { - uintptr_t try_ok = mi_atomic_load_acquire(&large_page_try_ok); - if (!large_only && try_ok > 0) { - // if a large page allocation fails, it seems the calls to VirtualAlloc get very expensive. - // therefore, once a large page allocation failed, we don't try again for `large_page_try_ok` times. - mi_atomic_cas_strong_acq_rel(&large_page_try_ok, &try_ok, try_ok - 1); - } - else { - // large OS pages must always reserve and commit. - *is_large = true; - p = mi_win_virtual_allocx(addr, size, try_alignment, flags | MEM_LARGE_PAGES); - if (large_only) return p; - // fall back to non-large page allocation on error (`p == NULL`). - if (p == NULL) { - mi_atomic_store_release(&large_page_try_ok,10UL); // on error, don't try again for the next N allocations - } - } - } - if (p == NULL) { - *is_large = ((flags&MEM_LARGE_PAGES) != 0); - p = mi_win_virtual_allocx(addr, size, try_alignment, flags); - } - if (p == NULL) { - _mi_warning_message("unable to allocate OS memory (%zu bytes, error code: %i, address: %p, large only: %d, allow large: %d)\n", size, GetLastError(), addr, large_only, allow_large); - } - return p; -} - -#elif defined(__wasi__) -static void* mi_wasm_heap_grow(size_t size, size_t try_alignment) { - uintptr_t base = __builtin_wasm_memory_size(0) * _mi_os_page_size(); - uintptr_t aligned_base = _mi_align_up(base, (uintptr_t) try_alignment); - size_t alloc_size = _mi_align_up( aligned_base - base + size, _mi_os_page_size()); - mi_assert(alloc_size >= size && (alloc_size % _mi_os_page_size()) == 0); - if (alloc_size < size) return NULL; - if (__builtin_wasm_memory_grow(0, alloc_size / _mi_os_page_size()) == SIZE_MAX) { - errno = ENOMEM; - return NULL; - } - return (void*)aligned_base; -} -#else -#define MI_OS_USE_MMAP -static void* mi_unix_mmapx(void* addr, size_t size, size_t try_alignment, int protect_flags, int flags, int fd) { - void* p = NULL; - #if (MI_INTPTR_SIZE >= 8) && !defined(MAP_ALIGNED) - // on 64-bit systems, use the virtual address area after 4TiB for 4MiB aligned allocations - void* hint; - if (addr == NULL && (hint = mi_os_get_aligned_hint(try_alignment, size)) != NULL) { - p = mmap(hint,size,protect_flags,flags,fd,0); - if (p==MAP_FAILED) p = NULL; // fall back to regular mmap - } - #else - UNUSED(try_alignment); - UNUSED(mi_os_get_aligned_hint); - #endif - if (p==NULL) { - p = mmap(addr,size,protect_flags,flags,fd,0); - if (p==MAP_FAILED) p = NULL; - } - return p; -} - -static void* mi_unix_mmap(void* addr, size_t size, size_t try_alignment, int protect_flags, bool large_only, bool allow_large, bool* is_large) { - void* p = NULL; - #if !defined(MAP_ANONYMOUS) - #define MAP_ANONYMOUS MAP_ANON - #endif - #if !defined(MAP_NORESERVE) - #define MAP_NORESERVE 0 - #endif - int flags = MAP_PRIVATE | MAP_ANONYMOUS | MAP_NORESERVE; - int fd = -1; - #if defined(MAP_ALIGNED) // BSD - if (try_alignment > 0) { - size_t n = _mi_bsr(try_alignment); - if (((size_t)1 << n) == try_alignment && n >= 12 && n <= 30) { // alignment is a power of 2 and 4096 <= alignment <= 1GiB - flags |= MAP_ALIGNED(n); - } - } - #endif - #if defined(PROT_MAX) - protect_flags |= PROT_MAX(PROT_READ | PROT_WRITE); // BSD - #endif - #if defined(VM_MAKE_TAG) - // macOS: tracking anonymous page with a specific ID. (All up to 98 are taken officially but LLVM sanitizers had taken 99) - int os_tag = (int)mi_option_get(mi_option_os_tag); - if (os_tag < 100 || os_tag > 255) os_tag = 100; - fd = VM_MAKE_TAG(os_tag); - #endif - if ((large_only || use_large_os_page(size, try_alignment)) && allow_large) { - static _Atomic(uintptr_t) large_page_try_ok; // = 0; - uintptr_t try_ok = mi_atomic_load_acquire(&large_page_try_ok); - if (!large_only && try_ok > 0) { - // If the OS is not configured for large OS pages, or the user does not have - // enough permission, the `mmap` will always fail (but it might also fail for other reasons). - // Therefore, once a large page allocation failed, we don't try again for `large_page_try_ok` times - // to avoid too many failing calls to mmap. - mi_atomic_cas_strong_acq_rel(&large_page_try_ok, &try_ok, try_ok - 1); - } - else { - int lflags = flags & ~MAP_NORESERVE; // using NORESERVE on huge pages seems to fail on Linux - int lfd = fd; - #ifdef MAP_ALIGNED_SUPER - lflags |= MAP_ALIGNED_SUPER; - #endif - #ifdef MAP_HUGETLB - lflags |= MAP_HUGETLB; - #endif - #ifdef MAP_HUGE_1GB - static bool mi_huge_pages_available = true; - if ((size % GiB) == 0 && mi_huge_pages_available) { - lflags |= MAP_HUGE_1GB; - } - else - #endif - { - #ifdef MAP_HUGE_2MB - lflags |= MAP_HUGE_2MB; - #endif - } - #ifdef VM_FLAGS_SUPERPAGE_SIZE_2MB - lfd |= VM_FLAGS_SUPERPAGE_SIZE_2MB; - #endif - if (large_only || lflags != flags) { - // try large OS page allocation - *is_large = true; - p = mi_unix_mmapx(addr, size, try_alignment, protect_flags, lflags, lfd); - #ifdef MAP_HUGE_1GB - if (p == NULL && (lflags & MAP_HUGE_1GB) != 0) { - mi_huge_pages_available = false; // don't try huge 1GiB pages again - _mi_warning_message("unable to allocate huge (1GiB) page, trying large (2MiB) pages instead (error %i)\n", errno); - lflags = ((lflags & ~MAP_HUGE_1GB) | MAP_HUGE_2MB); - p = mi_unix_mmapx(addr, size, try_alignment, protect_flags, lflags, lfd); - } - #endif - if (large_only) return p; - if (p == NULL) { - mi_atomic_store_release(&large_page_try_ok, 10UL); // on error, don't try again for the next N allocations - } - } - } - } - if (p == NULL) { - *is_large = false; - p = mi_unix_mmapx(addr, size, try_alignment, protect_flags, flags, fd); - #if defined(MADV_HUGEPAGE) - // Many Linux systems don't allow MAP_HUGETLB but they support instead - // transparent huge pages (THP). It is not required to call `madvise` with MADV_HUGE - // though since properly aligned allocations will already use large pages if available - // in that case -- in particular for our large regions (in `memory.c`). - // However, some systems only allow THP if called with explicit `madvise`, so - // when large OS pages are enabled for mimalloc, we call `madvice` anyways. - if (allow_large && use_large_os_page(size, try_alignment)) { - if (madvise(p, size, MADV_HUGEPAGE) == 0) { - *is_large = true; // possibly - }; - } - #endif - #if defined(__sun) - if (allow_large && use_large_os_page(size, try_alignment)) { - struct memcntl_mha cmd = {0}; - cmd.mha_pagesize = large_os_page_size; - cmd.mha_cmd = MHA_MAPSIZE_VA; - if (memcntl(p, size, MC_HAT_ADVISE, (caddr_t)&cmd, 0, 0) == 0) { - *is_large = true; - } - } - #endif - } - if (p == NULL) { - _mi_warning_message("unable to allocate OS memory (%zu bytes, error code: %i, address: %p, large only: %d, allow large: %d)\n", size, errno, addr, large_only, allow_large); - } - return p; -} -#endif + aligned hinting +-------------------------------------------------------------- */ // On 64-bit systems, we can do efficient aligned allocation by using -// the 4TiB to 30TiB area to allocate them. -#if (MI_INTPTR_SIZE >= 8) && (defined(_WIN32) || (defined(MI_OS_USE_MMAP) && !defined(MAP_ALIGNED))) -static mi_decl_cache_align _Atomic(uintptr_t) aligned_base; +// the 2TiB to 30TiB area to allocate those. +#if (MI_INTPTR_SIZE >= 8) +static mi_decl_cache_align _Atomic(uintptr_t)aligned_base; + +// Return a MI_SEGMENT_SIZE aligned address that is probably available. +// If this returns NULL, the OS will determine the address but on some OS's that may not be +// properly aligned which can be more costly as it needs to be adjusted afterwards. +// For a size > 1GiB this always returns NULL in order to guarantee good ASLR randomization; +// (otherwise an initial large allocation of say 2TiB has a 50% chance to include (known) addresses +// in the middle of the 2TiB - 6TiB address range (see issue #372)) + +#define MI_HINT_BASE ((uintptr_t)2 << 40) // 2TiB start +#define MI_HINT_AREA ((uintptr_t)4 << 40) // upto 6TiB (since before win8 there is "only" 8TiB available to processes) +#define MI_HINT_MAX ((uintptr_t)30 << 40) // wrap after 30TiB (area after 32TiB is used for huge OS pages) + +void* _mi_os_get_aligned_hint(size_t try_alignment, size_t size) +{ + if (try_alignment <= 1 || try_alignment > MI_SEGMENT_SIZE) return NULL; + size = _mi_align_up(size, MI_SEGMENT_SIZE); + if (size > 1*MI_GiB) return NULL; // guarantee the chance of fixed valid address is at most 1/(MI_HINT_AREA / 1<<30) = 1/4096. + #if (MI_SECURE>0) + size += MI_SEGMENT_SIZE; // put in `MI_SEGMENT_SIZE` virtual gaps between hinted blocks; this splits VLA's but increases guarded areas. + #endif -// Return a 4MiB aligned address that is probably available -static void* mi_os_get_aligned_hint(size_t try_alignment, size_t size) { - if (try_alignment == 0 || try_alignment > MI_SEGMENT_SIZE) return NULL; - if ((size%MI_SEGMENT_SIZE) != 0) return NULL; uintptr_t hint = mi_atomic_add_acq_rel(&aligned_base, size); - if (hint == 0 || hint > ((intptr_t)30<<40)) { // try to wrap around after 30TiB (area after 32TiB is used for huge OS pages) - uintptr_t init = ((uintptr_t)4 << 40); // start at 4TiB area - #if (MI_SECURE>0 || MI_DEBUG==0) // security: randomize start of aligned allocations unless in debug mode - uintptr_t r = _mi_heap_random_next(mi_get_default_heap()); - init = init + (MI_SEGMENT_SIZE * ((r>>17) & 0xFFFFF)); // (randomly 20 bits)*4MiB == 0 to 4TiB + if (hint == 0 || hint > MI_HINT_MAX) { // wrap or initialize + uintptr_t init = MI_HINT_BASE; + #if (MI_SECURE>0 || MI_DEBUG==0) // security: randomize start of aligned allocations unless in debug mode + uintptr_t r = _mi_heap_random_next(mi_prim_get_default_heap()); + init = init + ((MI_SEGMENT_SIZE * ((r>>17) & 0xFFFFF)) % MI_HINT_AREA); // (randomly 20 bits)*4MiB == 0 to 4TiB #endif uintptr_t expected = hint + size; mi_atomic_cas_strong_acq_rel(&aligned_base, &expected, init); - hint = mi_atomic_add_acq_rel(&aligned_base, size); // this may still give 0 or > 30TiB but that is ok, it is a hint after all + hint = mi_atomic_add_acq_rel(&aligned_base, size); // this may still give 0 or > MI_HINT_MAX but that is ok, it is a hint after all } if (hint%try_alignment != 0) return NULL; return (void*)hint; } #else -static void* mi_os_get_aligned_hint(size_t try_alignment, size_t size) { - UNUSED(try_alignment); UNUSED(size); +void* _mi_os_get_aligned_hint(size_t try_alignment, size_t size) { + MI_UNUSED(try_alignment); MI_UNUSED(size); return NULL; } #endif -// Primitive allocation from the OS. -// Note: the `try_alignment` is just a hint and the returned pointer is not guaranteed to be aligned. -static void* mi_os_mem_alloc(size_t size, size_t try_alignment, bool commit, bool allow_large, bool* is_large, mi_stats_t* stats) { - mi_assert_internal(size > 0 && (size % _mi_os_page_size()) == 0); - if (size == 0) return NULL; - if (!commit) allow_large = false; +/* ----------------------------------------------------------- + Free memory +-------------------------------------------------------------- */ - void* p = NULL; - /* - if (commit && allow_large) { - p = _mi_os_try_alloc_from_huge_reserved(size, try_alignment); - if (p != NULL) { - *is_large = true; - return p; +static void mi_os_free_huge_os_pages(void* p, size_t size, mi_stats_t* stats); + +static void mi_os_prim_free(void* addr, size_t size, bool still_committed, mi_stats_t* tld_stats) { + MI_UNUSED(tld_stats); + mi_assert_internal((size % _mi_os_page_size()) == 0); + if (addr == NULL || size == 0) return; // || _mi_os_is_huge_reserved(addr) + int err = _mi_prim_free(addr, size); + if (err != 0) { + _mi_warning_message("unable to free OS memory (error: %d (0x%x), size: 0x%zx bytes, address: %p)\n", err, err, size, addr); + } + mi_stats_t* stats = &_mi_stats_main; + if (still_committed) { _mi_stat_decrease(&stats->committed, size); } + _mi_stat_decrease(&stats->reserved, size); +} + +void _mi_os_free_ex(void* addr, size_t size, bool still_committed, mi_memid_t memid, mi_stats_t* tld_stats) { + if (mi_memkind_is_os(memid.memkind)) { + size_t csize = _mi_os_good_alloc_size(size); + void* base = addr; + // different base? (due to alignment) + if (memid.mem.os.base != NULL) { + mi_assert(memid.mem.os.base <= addr); + mi_assert((uint8_t*)memid.mem.os.base + memid.mem.os.alignment >= (uint8_t*)addr); + base = memid.mem.os.base; + csize += ((uint8_t*)addr - (uint8_t*)memid.mem.os.base); + } + // free it + if (memid.memkind == MI_MEM_OS_HUGE) { + mi_assert(memid.is_pinned); + mi_os_free_huge_os_pages(base, csize, tld_stats); + } + else { + mi_os_prim_free(base, csize, still_committed, tld_stats); } } - */ - #if defined(_AURORA_MEM_STRICT) - return aligned_alloc(try_alignment, size); - #elif defined(_WIN32) - int flags = MEM_RESERVE; - if (commit) flags |= MEM_COMMIT; - p = mi_win_virtual_alloc(NULL, size, try_alignment, flags, false, allow_large, is_large); - #elif defined(__wasi__) - *is_large = false; - p = mi_wasm_heap_grow(size, try_alignment); - #else - int protect_flags = (commit ? (PROT_WRITE | PROT_READ) : PROT_NONE); - p = mi_unix_mmap(NULL, size, try_alignment, protect_flags, false, allow_large, is_large); - #endif + else { + // nothing to do + mi_assert(memid.memkind < MI_MEM_OS); + } +} + +void _mi_os_free(void* p, size_t size, mi_memid_t memid, mi_stats_t* tld_stats) { + _mi_os_free_ex(p, size, true, memid, tld_stats); +} + + +/* ----------------------------------------------------------- + Primitive allocation from the OS. +-------------------------------------------------------------- */ + +// Note: the `try_alignment` is just a hint and the returned pointer is not guaranteed to be aligned. +static void* mi_os_prim_alloc(size_t size, size_t try_alignment, bool commit, bool allow_large, bool* is_large, bool* is_zero, mi_stats_t* stats) { + mi_assert_internal(size > 0 && (size % _mi_os_page_size()) == 0); + mi_assert_internal(is_zero != NULL); + mi_assert_internal(is_large != NULL); + if (size == 0) return NULL; + if (!commit) { allow_large = false; } + if (try_alignment == 0) { try_alignment = 1; } // avoid 0 to ensure there will be no divide by zero when aligning + + *is_zero = false; + void* p = NULL; + int err = _mi_prim_alloc(size, try_alignment, commit, allow_large, is_large, is_zero, &p); + if (err != 0) { + _mi_warning_message("unable to allocate OS memory (error: %d (0x%x), size: 0x%zx bytes, align: 0x%zx, commit: %d, allow large: %d)\n", err, err, size, try_alignment, commit, allow_large); + } mi_stat_counter_increase(stats->mmap_calls, 1); if (p != NULL) { _mi_stat_increase(&stats->reserved, size); - if (commit) { _mi_stat_increase(&stats->committed, size); } + if (commit) { + _mi_stat_increase(&stats->committed, size); + // seems needed for asan (or `mimalloc-test-api` fails) + #ifdef MI_TRACK_ASAN + if (*is_zero) { mi_track_mem_defined(p,size); } + else { mi_track_mem_undefined(p,size); } + #endif + } } return p; } @@ -586,119 +220,150 @@ static void* mi_os_mem_alloc(size_t size, size_t try_alignment, bool commit, boo // Primitive aligned allocation from the OS. // This function guarantees the allocated memory is aligned. -static void* mi_os_mem_alloc_aligned(size_t size, size_t alignment, bool commit, bool allow_large, bool* is_large, mi_stats_t* stats) { +static void* mi_os_prim_alloc_aligned(size_t size, size_t alignment, bool commit, bool allow_large, bool* is_large, bool* is_zero, void** base, mi_stats_t* stats) { mi_assert_internal(alignment >= _mi_os_page_size() && ((alignment & (alignment - 1)) == 0)); mi_assert_internal(size > 0 && (size % _mi_os_page_size()) == 0); + mi_assert_internal(is_large != NULL); + mi_assert_internal(is_zero != NULL); + mi_assert_internal(base != NULL); if (!commit) allow_large = false; if (!(alignment >= _mi_os_page_size() && ((alignment & (alignment - 1)) == 0))) return NULL; size = _mi_align_up(size, _mi_os_page_size()); // try first with a hint (this will be aligned directly on Win 10+ or BSD) - void* p = mi_os_mem_alloc(size, alignment, commit, allow_large, is_large, stats); + void* p = mi_os_prim_alloc(size, alignment, commit, allow_large, is_large, is_zero, stats); if (p == NULL) return NULL; - // if not aligned, free it, overallocate, and unmap around it - if (((uintptr_t)p % alignment != 0)) { - mi_os_mem_free(p, size, commit, stats); + // aligned already? + if (((uintptr_t)p % alignment) == 0) { + *base = p; + } + else { + // if not aligned, free it, overallocate, and unmap around it + _mi_warning_message("unable to allocate aligned OS memory directly, fall back to over-allocation (size: 0x%zx bytes, address: %p, alignment: 0x%zx, commit: %d)\n", size, p, alignment, commit); + mi_os_prim_free(p, size, commit, stats); if (size >= (SIZE_MAX - alignment)) return NULL; // overflow - size_t over_size = size + alignment; + const size_t over_size = size + alignment; -#if defined(_WIN32) && !defined(_AURORA_MEM_STRICT) - // over-allocate and than re-allocate exactly at an aligned address in there. - // this may fail due to threads allocating at the same time so we - // retry this at most 3 times before giving up. - // (we can not decommit around the overallocation on Windows, because we can only - // free the original pointer, not one pointing inside the area) - int flags = MEM_RESERVE; - if (commit) flags |= MEM_COMMIT; - for (int tries = 0; tries < 3; tries++) { - // over-allocate to determine a virtual memory range - p = mi_os_mem_alloc(over_size, alignment, commit, false, is_large, stats); - if (p == NULL) return NULL; // error - if (((uintptr_t)p % alignment) == 0) { - // if p happens to be aligned, just decommit the left-over area - _mi_os_decommit((uint8_t*)p + size, over_size - size, stats); - break; - } - else { - // otherwise free and allocate at an aligned address in there - mi_os_mem_free(p, over_size, commit, stats); - void* aligned_p = mi_align_up_ptr(p, alignment); - p = mi_win_virtual_alloc(aligned_p, size, alignment, flags, false, allow_large, is_large); - if (p == aligned_p) break; // success! - if (p != NULL) { // should not happen? - mi_os_mem_free(p, size, commit, stats); - p = NULL; - } + if (mi_os_mem_config.must_free_whole) { // win32 virtualAlloc cannot free parts of an allocate block + // over-allocate uncommitted (virtual) memory + p = mi_os_prim_alloc(over_size, 1 /*alignment*/, false /* commit? */, false /* allow_large */, is_large, is_zero, stats); + if (p == NULL) return NULL; + + // set p to the aligned part in the full region + // note: this is dangerous on Windows as VirtualFree needs the actual base pointer + // this is handled though by having the `base` field in the memid's + *base = p; // remember the base + p = mi_align_up_ptr(p, alignment); + + // explicitly commit only the aligned part + if (commit) { + _mi_os_commit(p, size, NULL, stats); } } -#else - // overallocate... - p = mi_os_mem_alloc(over_size, alignment, commit, false, is_large, stats); - if (p == NULL) return NULL; - // and selectively unmap parts around the over-allocated area. - void* aligned_p = mi_align_up_ptr(p, alignment); - size_t pre_size = (uint8_t*)aligned_p - (uint8_t*)p; - size_t mid_size = _mi_align_up(size, _mi_os_page_size()); - size_t post_size = over_size - pre_size - mid_size; - mi_assert_internal(pre_size < over_size && post_size < over_size && mid_size >= size); - if (pre_size > 0) mi_os_mem_free(p, pre_size, commit, stats); - if (post_size > 0) mi_os_mem_free((uint8_t*)aligned_p + mid_size, post_size, commit, stats); - // we can return the aligned pointer on `mmap` systems - p = aligned_p; -#endif + else { // mmap can free inside an allocation + // overallocate... + p = mi_os_prim_alloc(over_size, 1, commit, false, is_large, is_zero, stats); + if (p == NULL) return NULL; + + // and selectively unmap parts around the over-allocated area. (noop on sbrk) + void* aligned_p = mi_align_up_ptr(p, alignment); + size_t pre_size = (uint8_t*)aligned_p - (uint8_t*)p; + size_t mid_size = _mi_align_up(size, _mi_os_page_size()); + size_t post_size = over_size - pre_size - mid_size; + mi_assert_internal(pre_size < over_size&& post_size < over_size&& mid_size >= size); + if (pre_size > 0) { mi_os_prim_free(p, pre_size, commit, stats); } + if (post_size > 0) { mi_os_prim_free((uint8_t*)aligned_p + mid_size, post_size, commit, stats); } + // we can return the aligned pointer on `mmap` (and sbrk) systems + p = aligned_p; + *base = aligned_p; // since we freed the pre part, `*base == p`. + } } - mi_assert_internal(p == NULL || (p != NULL && ((uintptr_t)p % alignment) == 0)); + mi_assert_internal(p == NULL || (p != NULL && *base != NULL && ((uintptr_t)p % alignment) == 0)); + return p; +} + + +/* ----------------------------------------------------------- + OS API: alloc and alloc_aligned +----------------------------------------------------------- */ + +void* _mi_os_alloc(size_t size, mi_memid_t* memid, mi_stats_t* tld_stats) { + MI_UNUSED(tld_stats); + *memid = _mi_memid_none(); + mi_stats_t* stats = &_mi_stats_main; + if (size == 0) return NULL; + size = _mi_os_good_alloc_size(size); + bool os_is_large = false; + bool os_is_zero = false; + void* p = mi_os_prim_alloc(size, 0, true, false, &os_is_large, &os_is_zero, stats); + if (p != NULL) { + *memid = _mi_memid_create_os(true, os_is_zero, os_is_large); + } + return p; +} + +void* _mi_os_alloc_aligned(size_t size, size_t alignment, bool commit, bool allow_large, mi_memid_t* memid, mi_stats_t* tld_stats) +{ + MI_UNUSED(&_mi_os_get_aligned_hint); // suppress unused warnings + MI_UNUSED(tld_stats); + *memid = _mi_memid_none(); + if (size == 0) return NULL; + size = _mi_os_good_alloc_size(size); + alignment = _mi_align_up(alignment, _mi_os_page_size()); + + bool os_is_large = false; + bool os_is_zero = false; + void* os_base = NULL; + void* p = mi_os_prim_alloc_aligned(size, alignment, commit, allow_large, &os_is_large, &os_is_zero, &os_base, &_mi_stats_main /*tld->stats*/ ); + if (p != NULL) { + *memid = _mi_memid_create_os(commit, os_is_zero, os_is_large); + memid->mem.os.base = os_base; + memid->mem.os.alignment = alignment; + } return p; } /* ----------------------------------------------------------- - OS API: alloc, free, alloc_aligned + OS aligned allocation with an offset. This is used + for large alignments > MI_ALIGNMENT_MAX. We use a large mimalloc + page where the object can be aligned at an offset from the start of the segment. + As we may need to overallocate, we need to free such pointers using `mi_free_aligned` + to use the actual start of the memory region. ----------------------------------------------------------- */ -void* _mi_os_alloc(size_t size, mi_stats_t* tld_stats) { - UNUSED(tld_stats); - mi_stats_t* stats = &_mi_stats_main; - if (size == 0) return NULL; - size = _mi_os_good_alloc_size(size); - bool is_large = false; - return mi_os_mem_alloc(size, 0, true, false, &is_large, stats); -} - -void _mi_os_free_ex(void* p, size_t size, bool was_committed, mi_stats_t* tld_stats) { - UNUSED(tld_stats); - mi_stats_t* stats = &_mi_stats_main; - if (size == 0 || p == NULL) return; - size = _mi_os_good_alloc_size(size); - mi_os_mem_free(p, size, was_committed, stats); -} - -void _mi_os_free(void* p, size_t size, mi_stats_t* stats) { - _mi_os_free_ex(p, size, true, stats); -} - -void* _mi_os_alloc_aligned(size_t size, size_t alignment, bool commit, bool* large, mi_os_tld_t* tld) -{ - UNUSED(tld); - if (size == 0) return NULL; - size = _mi_os_good_alloc_size(size); - alignment = _mi_align_up(alignment, _mi_os_page_size()); - bool allow_large = false; - if (large != NULL) { - allow_large = *large; - *large = false; +void* _mi_os_alloc_aligned_at_offset(size_t size, size_t alignment, size_t offset, bool commit, bool allow_large, mi_memid_t* memid, mi_stats_t* tld_stats) { + mi_assert(offset <= MI_SEGMENT_SIZE); + mi_assert(offset <= size); + mi_assert((alignment % _mi_os_page_size()) == 0); + *memid = _mi_memid_none(); + if (offset > MI_SEGMENT_SIZE) return NULL; + if (offset == 0) { + // regular aligned allocation + return _mi_os_alloc_aligned(size, alignment, commit, allow_large, memid, tld_stats); + } + else { + // overallocate to align at an offset + const size_t extra = _mi_align_up(offset, alignment) - offset; + const size_t oversize = size + extra; + void* const start = _mi_os_alloc_aligned(oversize, alignment, commit, allow_large, memid, tld_stats); + if (start == NULL) return NULL; + + void* const p = (uint8_t*)start + extra; + mi_assert(_mi_is_aligned((uint8_t*)p + offset, alignment)); + // decommit the overallocation at the start + if (commit && extra > _mi_os_page_size()) { + _mi_os_decommit(start, extra, tld_stats); + } + return p; } - return mi_os_mem_alloc_aligned(size, alignment, commit, allow_large, (large!=NULL?large:&allow_large), &_mi_stats_main /*tld->stats*/ ); } - - /* ----------------------------------------------------------- OS memory API: reset, commit, decommit, protect, unprotect. ----------------------------------------------------------- */ - // OS page align within a given area, either conservative (pages inside the area only), // or not (straddling pages outside the area is possible) static void* mi_os_page_align_areax(bool conservative, void* addr, size_t size, size_t* newsize) { @@ -723,173 +388,117 @@ static void* mi_os_page_align_area_conservative(void* addr, size_t size, size_t* return mi_os_page_align_areax(true, addr, size, newsize); } -static void mi_mprotect_hint(int err) { -#if defined(MI_OS_USE_MMAP) && (MI_SECURE>=2) // guard page around every mimalloc page - if (err == ENOMEM) { - _mi_warning_message("the previous warning may have been caused by a low memory map limit.\n" - " On Linux this is controlled by the vm.max_map_count. For example:\n" - " > sudo sysctl -w vm.max_map_count=262144\n"); +bool _mi_os_commit(void* addr, size_t size, bool* is_zero, mi_stats_t* tld_stats) { + MI_UNUSED(tld_stats); + mi_stats_t* stats = &_mi_stats_main; + if (is_zero != NULL) { *is_zero = false; } + _mi_stat_increase(&stats->committed, size); // use size for precise commit vs. decommit + _mi_stat_counter_increase(&stats->commit_calls, 1); + + // page align range + size_t csize; + void* start = mi_os_page_align_areax(false /* conservative? */, addr, size, &csize); + if (csize == 0) return true; + + // commit + bool os_is_zero = false; + int err = _mi_prim_commit(start, csize, &os_is_zero); + if (err != 0) { + _mi_warning_message("cannot commit OS memory (error: %d (0x%x), address: %p, size: 0x%zx bytes)\n", err, err, start, csize); + return false; } -#else - UNUSED(err); -#endif + if (os_is_zero && is_zero != NULL) { + *is_zero = true; + mi_assert_expensive(mi_mem_is_zero(start, csize)); + } + // note: the following seems required for asan (otherwise `mimalloc-test-stress` fails) + #ifdef MI_TRACK_ASAN + if (os_is_zero) { mi_track_mem_defined(start,csize); } + else { mi_track_mem_undefined(start,csize); } + #endif + return true; } -// Commit/Decommit memory. -// Usually commit is aligned liberal, while decommit is aligned conservative. -// (but not for the reset version where we want commit to be conservative as well) -static bool mi_os_commitx(void* addr, size_t size, bool commit, bool conservative, bool* is_zero, mi_stats_t* stats) { - // page align in the range, commit liberally, decommit conservative - if (is_zero != NULL) { *is_zero = false; } - size_t csize; - void* start = mi_os_page_align_areax(conservative, addr, size, &csize); - if (csize == 0) return true; // || _mi_os_is_huge_reserved(addr)) - int err = 0; - if (commit) { - _mi_stat_increase(&stats->committed, size); // use size for precise commit vs. decommit - _mi_stat_counter_increase(&stats->commit_calls, 1); - } - else { - _mi_stat_decrease(&stats->committed, size); - } +static bool mi_os_decommit_ex(void* addr, size_t size, bool* needs_recommit, mi_stats_t* tld_stats) { + MI_UNUSED(tld_stats); + mi_stats_t* stats = &_mi_stats_main; + mi_assert_internal(needs_recommit!=NULL); + _mi_stat_decrease(&stats->committed, size); - #if defined(_AURORA_MEM_STRICT) - // optional low level control. we can't control the MMIO from the CRT - #elif defined(_WIN32) - if (commit) { - // if the memory was already committed, the call succeeds but it is not zero'd - // *is_zero = true; - void* p = VirtualAlloc(start, csize, MEM_COMMIT, PAGE_READWRITE); - err = (p == start ? 0 : GetLastError()); - } - else { - BOOL ok = VirtualFree(start, csize, MEM_DECOMMIT); - err = (ok ? 0 : GetLastError()); - } - #elif defined(__wasi__) - // WebAssembly guests can't control memory protection - #elif defined(MAP_FIXED) - if (!commit) { - // use mmap with MAP_FIXED to discard the existing memory (and reduce commit charge) - void* p = mmap(start, csize, PROT_NONE, (MAP_FIXED | MAP_PRIVATE | MAP_ANONYMOUS | MAP_NORESERVE), -1, 0); - if (p != start) { err = errno; } - } - else { - // for commit, just change the protection - err = mprotect(start, csize, (PROT_READ | PROT_WRITE)); - if (err != 0) { err = errno; } - } - #else - err = mprotect(start, csize, (commit ? (PROT_READ | PROT_WRITE) : PROT_NONE)); - if (err != 0) { err = errno; } - #endif + // page align + size_t csize; + void* start = mi_os_page_align_area_conservative(addr, size, &csize); + if (csize == 0) return true; + + // decommit + *needs_recommit = true; + int err = _mi_prim_decommit(start,csize,needs_recommit); if (err != 0) { - _mi_warning_message("%s error: start: %p, csize: 0x%x, err: %i\n", commit ? "commit" : "decommit", start, csize, err); - mi_mprotect_hint(err); + _mi_warning_message("cannot decommit OS memory (error: %d (0x%x), address: %p, size: 0x%zx bytes)\n", err, err, start, csize); } mi_assert_internal(err == 0); return (err == 0); } -bool _mi_os_commit(void* addr, size_t size, bool* is_zero, mi_stats_t* tld_stats) { - UNUSED(tld_stats); - mi_stats_t* stats = &_mi_stats_main; - return mi_os_commitx(addr, size, true, false /* liberal */, is_zero, stats); -} - bool _mi_os_decommit(void* addr, size_t size, mi_stats_t* tld_stats) { - UNUSED(tld_stats); - mi_stats_t* stats = &_mi_stats_main; - bool is_zero; - return mi_os_commitx(addr, size, false, true /* conservative */, &is_zero, stats); + bool needs_recommit; + return mi_os_decommit_ex(addr, size, &needs_recommit, tld_stats); } -static bool mi_os_commit_unreset(void* addr, size_t size, bool* is_zero, mi_stats_t* stats) { - return mi_os_commitx(addr, size, true, true /* conservative */, is_zero, stats); -} // Signal to the OS that the address range is no longer in use // but may be used later again. This will release physical memory // pages and reduce swapping while keeping the memory committed. // We page align to a conservative area inside the range to reset. -static bool mi_os_resetx(void* addr, size_t size, bool reset, mi_stats_t* stats) { +bool _mi_os_reset(void* addr, size_t size, mi_stats_t* stats) { // page align conservatively within the range size_t csize; void* start = mi_os_page_align_area_conservative(addr, size, &csize); if (csize == 0) return true; // || _mi_os_is_huge_reserved(addr) - if (reset) _mi_stat_increase(&stats->reset, csize); - else _mi_stat_decrease(&stats->reset, csize); - if (!reset) return true; // nothing to do on unreset! + _mi_stat_increase(&stats->reset, csize); + _mi_stat_counter_increase(&stats->reset_calls, 1); - #if (MI_DEBUG>1) - if (MI_SECURE==0) { - memset(start, 0, csize); // pretend it is eagerly reset - } + #if (MI_DEBUG>1) && !MI_SECURE && !MI_TRACK_ENABLED // && !MI_TSAN + memset(start, 0, csize); // pretend it is eagerly reset #endif - #if defined(_AURORA_MEM_STRICT) - // optional low level control. we can't control the MMIO from the CRT - #elif defined(_WIN32) - // Testing shows that for us (on `malloc-large`) MEM_RESET is 2x faster than DiscardVirtualMemory - void* p = VirtualAlloc(start, csize, MEM_RESET, PAGE_READWRITE); - mi_assert_internal(p == start); - #if 1 - if (p == start && start != NULL) { - VirtualUnlock(start,csize); // VirtualUnlock after MEM_RESET removes the memory from the working set - } - #endif - if (p != start) return false; -#else -#if defined(MADV_FREE) - static _Atomic(uintptr_t) advice = ATOMIC_VAR_INIT(MADV_FREE); - int err = madvise(start, csize, (int)mi_atomic_load_relaxed(&advice)); - if (err != 0 && errno == EINVAL && advice == MADV_FREE) { - // if MADV_FREE is not supported, fall back to MADV_DONTNEED from now on - mi_atomic_store_release(&advice, (uintptr_t)MADV_DONTNEED); - err = madvise(start, csize, MADV_DONTNEED); - } -#elif defined(__wasi__) - int err = 0; -#else - int err = madvise(start, csize, MADV_DONTNEED); -#endif + int err = _mi_prim_reset(start, csize); if (err != 0) { - _mi_warning_message("madvise reset error: start: %p, csize: 0x%x, errno: %i\n", start, csize, errno); + _mi_warning_message("cannot reset OS memory (error: %d (0x%x), address: %p, size: 0x%zx bytes)\n", err, err, start, csize); } - //mi_assert(err == 0); - if (err != 0) return false; -#endif - return true; + return (err == 0); } -// Signal to the OS that the address range is no longer in use -// but may be used later again. This will release physical memory -// pages and reduce swapping while keeping the memory committed. -// We page align to a conservative area inside the range to reset. -bool _mi_os_reset(void* addr, size_t size, mi_stats_t* tld_stats) { - UNUSED(tld_stats); - mi_stats_t* stats = &_mi_stats_main; - if (mi_option_is_enabled(mi_option_reset_decommits)) { - return _mi_os_decommit(addr, size, stats); + +// either resets or decommits memory, returns true if the memory needs +// to be recommitted if it is to be re-used later on. +bool _mi_os_purge_ex(void* p, size_t size, bool allow_reset, mi_stats_t* stats) +{ + if (mi_option_get(mi_option_purge_delay) < 0) return false; // is purging allowed? + _mi_stat_counter_increase(&stats->purge_calls, 1); + _mi_stat_increase(&stats->purged, size); + + if (mi_option_is_enabled(mi_option_purge_decommits) && // should decommit? + !_mi_preloading()) // don't decommit during preloading (unsafe) + { + bool needs_recommit = true; + mi_os_decommit_ex(p, size, &needs_recommit, stats); + return needs_recommit; } else { - return mi_os_resetx(addr, size, true, stats); + if (allow_reset) { // this can sometimes be not allowed if the range is not fully committed + _mi_os_reset(p, size, stats); + } + return false; // needs no recommit } } -bool _mi_os_unreset(void* addr, size_t size, bool* is_zero, mi_stats_t* tld_stats) { - UNUSED(tld_stats); - mi_stats_t* stats = &_mi_stats_main; - if (mi_option_is_enabled(mi_option_reset_decommits)) { - return mi_os_commit_unreset(addr, size, is_zero, stats); // re-commit it (conservatively!) - } - else { - *is_zero = false; - return mi_os_resetx(addr, size, false, stats); - } +// either resets or decommits memory, returns true if the memory needs +// to be recommitted if it is to be re-used later on. +bool _mi_os_purge(void* p, size_t size, mi_stats_t * stats) { + return _mi_os_purge_ex(p, size, true, stats); } - // Protect a region in memory to be not accessible. static bool mi_os_protectx(void* addr, size_t size, bool protect) { // page align conservatively within the range @@ -901,22 +510,9 @@ static bool mi_os_protectx(void* addr, size_t size, bool protect) { _mi_warning_message("cannot mprotect memory allocated in huge OS pages\n"); } */ - int err = 0; -#if defined(_AURORA_MEM_STRICT) - // optional low level control. we can't control the MMIO from the CRT -#elif defined(_WIN32) - DWORD oldprotect = 0; - BOOL ok = VirtualProtect(start, csize, protect ? PAGE_NOACCESS : PAGE_READWRITE, &oldprotect); - err = (ok ? 0 : GetLastError()); -#elif defined(__wasi__) - err = 0; -#else - err = mprotect(start, csize, protect ? PROT_NONE : (PROT_READ | PROT_WRITE)); - if (err != 0) { err = errno; } -#endif + int err = _mi_prim_protect(start,csize,protect); if (err != 0) { - _mi_warning_message("mprotect error: start: %p, csize: 0x%x, err: %i\n", start, csize, err); - mi_mprotect_hint(err); + _mi_warning_message("cannot %s OS memory (error: %d (0x%x), address: %p, size: 0x%zx bytes)\n", (protect ? "protect" : "unprotect"), err, err, start, csize); } return (err == 0); } @@ -931,121 +527,12 @@ bool _mi_os_unprotect(void* addr, size_t size) { -bool _mi_os_shrink(void* p, size_t oldsize, size_t newsize, mi_stats_t* stats) { - // page align conservatively within the range - mi_assert_internal(oldsize > newsize && p != NULL); - if (oldsize < newsize || p == NULL) return false; - if (oldsize == newsize) return true; - - // oldsize and newsize should be page aligned or we cannot shrink precisely - void* addr = (uint8_t*)p + newsize; - size_t size = 0; - void* start = mi_os_page_align_area_conservative(addr, oldsize - newsize, &size); - if (size == 0 || start != addr) return false; - -#if defined(_WIN32) && !defined(_AURORA_MEM_STRICT) - // we cannot shrink on windows, but we can decommit - return _mi_os_decommit(start, size, stats); -#else - return mi_os_mem_free(start, size, true, stats); -#endif -} - - /* ---------------------------------------------------------------------------- Support for allocating huge OS pages (1Gib) that are reserved up-front and possibly associated with a specific NUMA node. (use `numa_node>=0`) -----------------------------------------------------------------------------*/ -#define MI_HUGE_OS_PAGE_SIZE (GiB) +#define MI_HUGE_OS_PAGE_SIZE (MI_GiB) -#if defined(_WIN32) && (MI_INTPTR_SIZE >= 8) -static void* mi_os_alloc_huge_os_pagesx(void* addr, size_t size, int numa_node) -{ - mi_assert_internal(size%GiB == 0); - mi_assert_internal(addr != NULL); - const DWORD flags = MEM_LARGE_PAGES | MEM_COMMIT | MEM_RESERVE; - - mi_win_enable_large_os_pages(); - - #if defined(MEM_EXTENDED_PARAMETER_TYPE_BITS) - MEM_EXTENDED_PARAMETER params[3] = { {{0,0},{0}},{{0,0},{0}},{{0,0},{0}} }; - // on modern Windows try use NtAllocateVirtualMemoryEx for 1GiB huge pages - static bool mi_huge_pages_available = true; - if (pNtAllocateVirtualMemoryEx != NULL && mi_huge_pages_available) { - #ifndef MEM_EXTENDED_PARAMETER_NONPAGED_HUGE - #define MEM_EXTENDED_PARAMETER_NONPAGED_HUGE (0x10) - #endif - params[0].Type = 5; // == MemExtendedParameterAttributeFlags; - params[0].ULong64 = MEM_EXTENDED_PARAMETER_NONPAGED_HUGE; - ULONG param_count = 1; - if (numa_node >= 0) { - param_count++; - params[1].Type = MemExtendedParameterNumaNode; - params[1].ULong = (unsigned)numa_node; - } - SIZE_T psize = size; - void* base = addr; - NTSTATUS err = (*pNtAllocateVirtualMemoryEx)(GetCurrentProcess(), &base, &psize, flags, PAGE_READWRITE, params, param_count); - if (err == 0 && base != NULL) { - return base; - } - else { - // fall back to regular large pages - mi_huge_pages_available = false; // don't try further huge pages - _mi_warning_message("unable to allocate using huge (1gb) pages, trying large (2mb) pages instead (status 0x%lx)\n", err); - } - } - // on modern Windows try use VirtualAlloc2 for numa aware large OS page allocation - if (pVirtualAlloc2 != NULL && numa_node >= 0) { - params[0].Type = MemExtendedParameterNumaNode; - params[0].ULong = (unsigned)numa_node; - return (*pVirtualAlloc2)(GetCurrentProcess(), addr, size, flags, PAGE_READWRITE, params, 1); - } - #else - UNUSED(numa_node); - #endif - // otherwise use regular virtual alloc on older windows - return VirtualAlloc(addr, size, flags, PAGE_READWRITE); -} - -#elif defined(MI_OS_USE_MMAP) && (MI_INTPTR_SIZE >= 8) && !defined(__HAIKU__) -#include -#ifndef MPOL_PREFERRED -#define MPOL_PREFERRED 1 -#endif -#if defined(SYS_mbind) -static long mi_os_mbind(void* start, unsigned long len, unsigned long mode, const unsigned long* nmask, unsigned long maxnode, unsigned flags) { - return syscall(SYS_mbind, start, len, mode, nmask, maxnode, flags); -} -#else -static long mi_os_mbind(void* start, unsigned long len, unsigned long mode, const unsigned long* nmask, unsigned long maxnode, unsigned flags) { - UNUSED(start); UNUSED(len); UNUSED(mode); UNUSED(nmask); UNUSED(maxnode); UNUSED(flags); - return 0; -} -#endif -static void* mi_os_alloc_huge_os_pagesx(void* addr, size_t size, int numa_node) { - mi_assert_internal(size%GiB == 0); - bool is_large = true; - void* p = mi_unix_mmap(addr, size, MI_SEGMENT_SIZE, PROT_READ | PROT_WRITE, true, true, &is_large); - if (p == NULL) return NULL; - if (numa_node >= 0 && numa_node < 8*MI_INTPTR_SIZE) { // at most 64 nodes - uintptr_t numa_mask = (1UL << numa_node); - // TODO: does `mbind` work correctly for huge OS pages? should we - // use `set_mempolicy` before calling mmap instead? - // see: - long err = mi_os_mbind(p, size, MPOL_PREFERRED, &numa_mask, 8*MI_INTPTR_SIZE, 0); - if (err != 0) { - _mi_warning_message("failed to bind huge (1gb) pages to numa node %d: %s\n", numa_node, strerror(errno)); - } - } - return p; -} -#else -static void* mi_os_alloc_huge_os_pagesx(void* addr, size_t size, int numa_node) { - UNUSED(addr); UNUSED(size); UNUSED(numa_node); - return NULL; -} -#endif #if (MI_INTPTR_SIZE >= 8) // To ensure proper alignment, use our own area for huge OS pages @@ -1064,10 +551,10 @@ static uint8_t* mi_os_claim_huge_pages(size_t pages, size_t* total_size) { if (start == 0) { // Initialize the start address after the 32TiB area start = ((uintptr_t)32 << 40); // 32TiB virtual start address -#if (MI_SECURE>0 || MI_DEBUG==0) // security: randomize start of huge pages unless in debug mode - uintptr_t r = _mi_heap_random_next(mi_get_default_heap()); + #if (MI_SECURE>0 || MI_DEBUG==0) // security: randomize start of huge pages unless in debug mode + uintptr_t r = _mi_heap_random_next(mi_prim_get_default_heap()); start = start + ((uintptr_t)MI_HUGE_OS_PAGE_SIZE * ((r>>17) & 0x0FFF)); // (randomly 12bits)*1GiB == between 0 to 4TiB -#endif + #endif } end = start + size; mi_assert_internal(end % MI_SEGMENT_SIZE == 0); @@ -1078,14 +565,15 @@ static uint8_t* mi_os_claim_huge_pages(size_t pages, size_t* total_size) { } #else static uint8_t* mi_os_claim_huge_pages(size_t pages, size_t* total_size) { - UNUSED(pages); + MI_UNUSED(pages); if (total_size != NULL) *total_size = 0; return NULL; } #endif // Allocate MI_SEGMENT_SIZE aligned huge pages -void* _mi_os_alloc_huge_os_pages(size_t pages, int numa_node, mi_msecs_t max_msecs, size_t* pages_reserved, size_t* psize) { +void* _mi_os_alloc_huge_os_pages(size_t pages, int numa_node, mi_msecs_t max_msecs, size_t* pages_reserved, size_t* psize, mi_memid_t* memid) { + *memid = _mi_memid_none(); if (psize != NULL) *psize = 0; if (pages_reserved != NULL) *pages_reserved = 0; size_t size = 0; @@ -1096,23 +584,32 @@ void* _mi_os_alloc_huge_os_pages(size_t pages, int numa_node, mi_msecs_t max_mse // We allocate one page at the time to be able to abort if it takes too long // or to at least allocate as many as available on the system. mi_msecs_t start_t = _mi_clock_start(); - size_t page; - for (page = 0; page < pages; page++) { + size_t page = 0; + bool all_zero = true; + while (page < pages) { // allocate a page + bool is_zero = false; void* addr = start + (page * MI_HUGE_OS_PAGE_SIZE); - void* p = mi_os_alloc_huge_os_pagesx(addr, MI_HUGE_OS_PAGE_SIZE, numa_node); + void* p = NULL; + int err = _mi_prim_alloc_huge_os_pages(addr, MI_HUGE_OS_PAGE_SIZE, numa_node, &is_zero, &p); + if (!is_zero) { all_zero = false; } + if (err != 0) { + _mi_warning_message("unable to allocate huge OS page (error: %d (0x%x), address: %p, size: %zx bytes)\n", err, err, addr, MI_HUGE_OS_PAGE_SIZE); + break; + } // Did we succeed at a contiguous address? if (p != addr) { // no success, issue a warning and break if (p != NULL) { - _mi_warning_message("could not allocate contiguous huge page %zu at %p\n", page, addr); - _mi_os_free(p, MI_HUGE_OS_PAGE_SIZE, &_mi_stats_main); + _mi_warning_message("could not allocate contiguous huge OS page %zu at %p\n", page, addr); + mi_os_prim_free(p, MI_HUGE_OS_PAGE_SIZE, true, &_mi_stats_main); } break; } // success, record it + page++; // increase before timeout check (see issue #711) _mi_stat_increase(&_mi_stats_main.committed, MI_HUGE_OS_PAGE_SIZE); _mi_stat_increase(&_mi_stats_main.reserved, MI_HUGE_OS_PAGE_SIZE); @@ -1126,153 +623,67 @@ void* _mi_os_alloc_huge_os_pages(size_t pages, int numa_node, mi_msecs_t max_mse } } if (elapsed > max_msecs) { - _mi_warning_message("huge page allocation timed out\n"); + _mi_warning_message("huge OS page allocation timed out (after allocating %zu page(s))\n", page); break; } } } mi_assert_internal(page*MI_HUGE_OS_PAGE_SIZE <= size); - if (pages_reserved != NULL) *pages_reserved = page; - if (psize != NULL) *psize = page * MI_HUGE_OS_PAGE_SIZE; + if (pages_reserved != NULL) { *pages_reserved = page; } + if (psize != NULL) { *psize = page * MI_HUGE_OS_PAGE_SIZE; } + if (page != 0) { + mi_assert(start != NULL); + *memid = _mi_memid_create_os(true /* is committed */, all_zero, true /* is_large */); + memid->memkind = MI_MEM_OS_HUGE; + mi_assert(memid->is_pinned); + #ifdef MI_TRACK_ASAN + if (all_zero) { mi_track_mem_defined(start,size); } + #endif + } return (page == 0 ? NULL : start); } // free every huge page in a range individually (as we allocated per page) // note: needed with VirtualAlloc but could potentially be done in one go on mmap'd systems. -void _mi_os_free_huge_pages(void* p, size_t size, mi_stats_t* stats) { +static void mi_os_free_huge_os_pages(void* p, size_t size, mi_stats_t* stats) { if (p==NULL || size==0) return; uint8_t* base = (uint8_t*)p; while (size >= MI_HUGE_OS_PAGE_SIZE) { - _mi_os_free(base, MI_HUGE_OS_PAGE_SIZE, stats); + mi_os_prim_free(base, MI_HUGE_OS_PAGE_SIZE, true, stats); size -= MI_HUGE_OS_PAGE_SIZE; + base += MI_HUGE_OS_PAGE_SIZE; } } /* ---------------------------------------------------------------------------- Support NUMA aware allocation -----------------------------------------------------------------------------*/ -#ifdef _WIN32 -#if defined(AURORA_IS_64BIT) -DWORD __declspec(dllexport) GetCurrentProcessorNumberXP(void) -{ - return pGetCurrentProcessorNumber(); -} -#else -DWORD __declspec(dllexport) __declspec(naked) GetCurrentProcessorNumberXP(void) -{ - __asm { - mov eax, 1 - cpuid - shr ebx, 24 - mov eax, ebx - ret - } -} -#endif - -static size_t mi_os_numa_nodex() { - USHORT numa_node = 0; - if (pGetCurrentProcessorNumberEx != NULL && pGetNumaProcessorNodeEx != NULL) { - // Extended API is supported - PROCESSOR_NUMBER pnum; - (*pGetCurrentProcessorNumberEx)(&pnum); - USHORT nnode = 0; - BOOL ok = (*pGetNumaProcessorNodeEx)(&pnum, &nnode); - if (ok) numa_node = nnode; - } - else - { - // Vista or earlier, use older API that is limited to 64 processors. Issue #277 - DWORD pnum = GetCurrentProcessorNumberXP(); - UCHAR nnode = 0; - BOOL ok = pGetNumaProcessorNode && - pGetNumaProcessorNode((UCHAR)pnum, &nnode); - if (ok) numa_node = nnode; - } - return numa_node; -} - -static size_t mi_os_numa_node_countx(void) { - ULONG numa_max = 0; - if (pGetNumaHighestNodeNumber) { - pGetNumaHighestNodeNumber(&numa_max); - } - // find the highest node number that has actual processors assigned to it. Issue #282 - while(numa_max > 0) { - if (pGetNumaNodeProcessorMaskEx != NULL) { - // Extended API is supported - GROUP_AFFINITY affinity; - if ((*pGetNumaNodeProcessorMaskEx)((USHORT)numa_max, &affinity)) { - if (affinity.Mask != 0) break; // found the maximum non-empty node - } - } - else { - // Vista or earlier, use older API that is limited to 64 processors. - ULONGLONG mask; - if (pGetNumaNodeProcessorMask && - pGetNumaNodeProcessorMask((UCHAR)numa_max, &mask)) { - if (mask != 0) break; // found the maximum non-empty node - }; - } - // max node was invalid or had no processor assigned, try again - numa_max--; - } - return ((size_t)numa_max + 1); -} -#elif defined(__linux__) -#include // getcpu -#include // access - -static size_t mi_os_numa_nodex(void) { -#ifdef SYS_getcpu - unsigned long node = 0; - unsigned long ncpu = 0; - long err = syscall(SYS_getcpu, &ncpu, &node, NULL); - if (err != 0) return 0; - return node; -#else - return 0; -#endif -} -static size_t mi_os_numa_node_countx(void) { - char buf[128]; - unsigned node = 0; - for(node = 0; node < 256; node++) { - // enumerate node entries -- todo: it there a more efficient way to do this? (but ensure there is no allocation) - snprintf(buf, 127, "/sys/devices/system/node/node%u", node + 1); - if (access(buf,R_OK) != 0) break; - } - return (node+1); -} -#else -static size_t mi_os_numa_nodex(void) { - return 0; -} -static size_t mi_os_numa_node_countx(void) { - return 1; -} -#endif - -size_t _mi_numa_node_count = 0; // cache the node count +_Atomic(size_t) _mi_numa_node_count; // = 0 // cache the node count size_t _mi_os_numa_node_count_get(void) { - if (mi_unlikely(_mi_numa_node_count <= 0)) { + size_t count = mi_atomic_load_acquire(&_mi_numa_node_count); + if (count <= 0) { long ncount = mi_option_get(mi_option_use_numa_nodes); // given explicitly? - if (ncount <= 0) ncount = (long)mi_os_numa_node_countx(); // or detect dynamically - _mi_numa_node_count = (size_t)(ncount <= 0 ? 1 : ncount); - _mi_verbose_message("using %zd numa regions\n", _mi_numa_node_count); + if (ncount > 0) { + count = (size_t)ncount; + } + else { + count = _mi_prim_numa_node_count(); // or detect dynamically + if (count == 0) count = 1; + } + mi_atomic_store_release(&_mi_numa_node_count, count); // save it + _mi_verbose_message("using %zd numa regions\n", count); } - mi_assert_internal(_mi_numa_node_count >= 1); - return _mi_numa_node_count; + return count; } int _mi_os_numa_node_get(mi_os_tld_t* tld) { - UNUSED(tld); + MI_UNUSED(tld); size_t numa_count = _mi_os_numa_node_count(); if (numa_count<=1) return 0; // optimize on single numa node systems: always node 0 // never more than the node count and >= 0 - size_t numa_node = mi_os_numa_nodex(); + size_t numa_node = _mi_prim_numa_node(); if (numa_node >= numa_count) { numa_node = numa_node % numa_count; } return (int)numa_node; } diff --git a/src/page-queue.c b/src/page-queue.c index 37719e0..cb54b37 100644 --- a/src/page-queue.c +++ b/src/page-queue.c @@ -1,5 +1,5 @@ /*---------------------------------------------------------------------------- -Copyright (c) 2018, Microsoft Research, Daan Leijen +Copyright (c) 2018-2020, Microsoft Research, Daan Leijen This is free software; you can redistribute it and/or modify it under the terms of the MIT license. A copy of the license can be found in the file "LICENSE" at the root of this distribution. @@ -34,70 +34,26 @@ terms of the MIT license. A copy of the license can be found in the file static inline bool mi_page_queue_is_huge(const mi_page_queue_t* pq) { - return (pq->block_size == (MI_LARGE_OBJ_SIZE_MAX+sizeof(uintptr_t))); + return (pq->block_size == (MI_MEDIUM_OBJ_SIZE_MAX+sizeof(uintptr_t))); } static inline bool mi_page_queue_is_full(const mi_page_queue_t* pq) { - return (pq->block_size == (MI_LARGE_OBJ_SIZE_MAX+(2*sizeof(uintptr_t)))); + return (pq->block_size == (MI_MEDIUM_OBJ_SIZE_MAX+(2*sizeof(uintptr_t)))); } static inline bool mi_page_queue_is_special(const mi_page_queue_t* pq) { - return (pq->block_size > MI_LARGE_OBJ_SIZE_MAX); + return (pq->block_size > MI_MEDIUM_OBJ_SIZE_MAX); } /* ----------------------------------------------------------- Bins ----------------------------------------------------------- */ -// Bit scan reverse: return the index of the highest bit. -static inline uint8_t mi_bsr32(uint32_t x); - -#if defined(_MSC_VER) -#include -static inline uint8_t mi_bsr32(uint32_t x) { - uint32_t idx; - _BitScanReverse((DWORD*)&idx, x); - return (uint8_t)idx; -} -#elif defined(__GNUC__) || defined(__clang__) -static inline uint8_t mi_bsr32(uint32_t x) { - return (31 - __builtin_clz(x)); -} -#else -static inline uint8_t mi_bsr32(uint32_t x) { - // de Bruijn multiplication, see - static const uint8_t debruijn[32] = { - 31, 0, 22, 1, 28, 23, 18, 2, 29, 26, 24, 10, 19, 7, 3, 12, - 30, 21, 27, 17, 25, 9, 6, 11, 20, 16, 8, 5, 15, 4, 14, 13, - }; - x |= x >> 1; - x |= x >> 2; - x |= x >> 4; - x |= x >> 8; - x |= x >> 16; - x++; - return debruijn[(x*0x076be629) >> 27]; -} -#endif - -// Bit scan reverse: return the index of the highest bit. -uint8_t _mi_bsr(uintptr_t x) { - if (x == 0) return 0; -#if MI_INTPTR_SIZE==8 - uint32_t hi = (x >> 32); - return (hi == 0 ? mi_bsr32((uint32_t)x) : 32 + mi_bsr32(hi)); -#elif MI_INTPTR_SIZE==4 - return mi_bsr32(x); -#else -# error "define bsr for non-32 or 64-bit platforms" -#endif -} - // Return the bin for a given field size. // Returns MI_BIN_HUGE if the size is too large. // We use `wsize` for the size in "machine word sizes", // i.e. byte size == `wsize*sizeof(void*)`. -extern inline uint8_t _mi_bin(size_t size) { +static inline uint8_t mi_bin(size_t size) { size_t wsize = _mi_wsize_from_size(size); uint8_t bin; if (wsize <= 1) { @@ -116,16 +72,16 @@ extern inline uint8_t _mi_bin(size_t size) { bin = (uint8_t)wsize; } #endif - else if (wsize > MI_LARGE_OBJ_WSIZE_MAX) { + else if (wsize > MI_MEDIUM_OBJ_WSIZE_MAX) { bin = MI_BIN_HUGE; } else { - #if defined(MI_ALIGN4W) + #if defined(MI_ALIGN4W) if (wsize <= 16) { wsize = (wsize+3)&~3; } // round to 4x word sizes #endif wsize--; // find the highest bit - uint8_t b = mi_bsr32((uint32_t)wsize); + uint8_t b = (uint8_t)mi_bsr(wsize); // note: wsize != 0 // and use the top 3 bits to determine the bin (~12.5% worst internal fragmentation). // - adjust with 3 because we use do not round the first 8 sizes // which each get an exact bin @@ -142,14 +98,18 @@ extern inline uint8_t _mi_bin(size_t size) { Queue of pages with free blocks ----------------------------------------------------------- */ +uint8_t _mi_bin(size_t size) { + return mi_bin(size); +} + size_t _mi_bin_size(uint8_t bin) { return _mi_heap_empty.pages[bin].block_size; } // Good size for allocation size_t mi_good_size(size_t size) mi_attr_noexcept { - if (size <= MI_LARGE_OBJ_SIZE_MAX) { - return _mi_bin_size(_mi_bin(size)); + if (size <= MI_MEDIUM_OBJ_SIZE_MAX) { + return _mi_bin_size(mi_bin(size)); } else { return _mi_align_up(size,_mi_os_page_size()); @@ -178,7 +138,7 @@ static bool mi_heap_contains_queue(const mi_heap_t* heap, const mi_page_queue_t* #endif static mi_page_queue_t* mi_page_queue_of(const mi_page_t* page) { - uint8_t bin = (mi_page_is_in_full(page) ? MI_BIN_FULL : _mi_bin(page->xblock_size)); + uint8_t bin = (mi_page_is_in_full(page) ? MI_BIN_FULL : mi_bin(page->xblock_size)); mi_heap_t* heap = mi_page_heap(page); mi_assert_internal(heap != NULL && bin <= MI_BIN_FULL); mi_page_queue_t* pq = &heap->pages[bin]; @@ -188,7 +148,7 @@ static mi_page_queue_t* mi_page_queue_of(const mi_page_t* page) { } static mi_page_queue_t* mi_heap_page_queue_of(mi_heap_t* heap, const mi_page_t* page) { - uint8_t bin = (mi_page_is_in_full(page) ? MI_BIN_FULL : _mi_bin(page->xblock_size)); + uint8_t bin = (mi_page_is_in_full(page) ? MI_BIN_FULL : mi_bin(page->xblock_size)); mi_assert_internal(bin <= MI_BIN_FULL); mi_page_queue_t* pq = &heap->pages[bin]; mi_assert_internal(mi_page_is_in_full(page) || page->xblock_size == pq->block_size); @@ -221,9 +181,9 @@ static inline void mi_heap_queue_first_update(mi_heap_t* heap, const mi_page_que } else { // find previous size; due to minimal alignment upto 3 previous bins may need to be skipped - uint8_t bin = _mi_bin(size); + uint8_t bin = mi_bin(size); const mi_page_queue_t* prev = pq - 1; - while( bin == _mi_bin(prev->block_size) && prev > &heap->pages[0]) { + while( bin == mi_bin(prev->block_size) && prev > &heap->pages[0]) { prev--; } start = 1 + _mi_wsize_from_size(prev->block_size); @@ -246,8 +206,9 @@ static bool mi_page_queue_is_empty(mi_page_queue_t* queue) { static void mi_page_queue_remove(mi_page_queue_t* queue, mi_page_t* page) { mi_assert_internal(page != NULL); mi_assert_expensive(mi_page_queue_contains(queue, page)); - mi_assert_internal(page->xblock_size == queue->block_size || (page->xblock_size > MI_LARGE_OBJ_SIZE_MAX && mi_page_queue_is_huge(queue)) || (mi_page_is_in_full(page) && mi_page_queue_is_full(queue))); + mi_assert_internal(page->xblock_size == queue->block_size || (page->xblock_size > MI_MEDIUM_OBJ_SIZE_MAX && mi_page_queue_is_huge(queue)) || (mi_page_is_in_full(page) && mi_page_queue_is_full(queue))); mi_heap_t* heap = mi_page_heap(page); + if (page->prev != NULL) page->prev->next = page->next; if (page->next != NULL) page->next->prev = page->prev; if (page == queue->last) queue->last = page->prev; @@ -268,9 +229,11 @@ static void mi_page_queue_remove(mi_page_queue_t* queue, mi_page_t* page) { static void mi_page_queue_push(mi_heap_t* heap, mi_page_queue_t* queue, mi_page_t* page) { mi_assert_internal(mi_page_heap(page) == heap); mi_assert_internal(!mi_page_queue_contains(queue, page)); - mi_assert_internal(_mi_page_segment(page)->page_kind != MI_PAGE_HUGE); + #if MI_HUGE_PAGE_ABANDON + mi_assert_internal(_mi_page_segment(page)->kind != MI_SEGMENT_HUGE); + #endif mi_assert_internal(page->xblock_size == queue->block_size || - (page->xblock_size > MI_LARGE_OBJ_SIZE_MAX && mi_page_queue_is_huge(queue)) || + (page->xblock_size > MI_MEDIUM_OBJ_SIZE_MAX) || (mi_page_is_in_full(page) && mi_page_queue_is_full(queue))); mi_page_set_in_full(page, mi_page_queue_is_full(queue)); @@ -296,6 +259,7 @@ static void mi_page_queue_enqueue_from(mi_page_queue_t* to, mi_page_queue_t* fro mi_assert_internal(page != NULL); mi_assert_expensive(mi_page_queue_contains(from, page)); mi_assert_expensive(!mi_page_queue_contains(to, page)); + mi_assert_internal((page->xblock_size == to->block_size && page->xblock_size == from->block_size) || (page->xblock_size == to->block_size && mi_page_queue_is_full(from)) || (page->xblock_size == from->block_size && mi_page_queue_is_full(to)) || @@ -341,7 +305,7 @@ size_t _mi_page_queue_append(mi_heap_t* heap, mi_page_queue_t* pq, mi_page_queue for (mi_page_t* page = append->first; page != NULL; page = page->next) { // inline `mi_page_set_heap` to avoid wrong assertion during absorption; // in this case it is ok to be delayed freeing since both "to" and "from" heap are still alive. - mi_atomic_store_release(&page->xheap, (uintptr_t)heap); + mi_atomic_store_release(&page->xheap, (uintptr_t)heap); // set the flag to delayed free (not overriding NEVER_DELAYED_FREE) which has as a // side effect that it spins until any DELAYED_FREEING is finished. This ensures // that after appending only the new heap will be used for delayed free operations. diff --git a/src/page.c b/src/page.c index cd96bb9..8ac0a71 100644 --- a/src/page.c +++ b/src/page.c @@ -1,5 +1,5 @@ /*---------------------------------------------------------------------------- -Copyright (c) 2018, Microsoft Research, Daan Leijen +Copyright (c) 2018-2020, Microsoft Research, Daan Leijen This is free software; you can redistribute it and/or modify it under the terms of the MIT license. A copy of the license can be found in the file "LICENSE" at the root of this distribution. @@ -7,13 +7,13 @@ terms of the MIT license. A copy of the license can be found in the file /* ----------------------------------------------------------- The core of the allocator. Every segment contains - pages of a {certain block size. The main function + pages of a certain block size. The main function exported is `mi_malloc_generic`. ----------------------------------------------------------- */ #include "mimalloc.h" -#include "mimalloc-internal.h" -#include "mimalloc-atomic.h" +#include "mimalloc/internal.h" +#include "mimalloc/atomic.h" /* ----------------------------------------------------------- Definition of page queues for each block size @@ -30,7 +30,7 @@ terms of the MIT license. A copy of the license can be found in the file // Index a block in a page static inline mi_block_t* mi_page_block_at(const mi_page_t* page, void* page_start, size_t block_size, size_t i) { - UNUSED(page); + MI_UNUSED(page); mi_assert_internal(page != NULL); mi_assert_internal(i <= page->reserved); return (mi_block_t*)((uint8_t*)page_start + (i * block_size)); @@ -66,6 +66,14 @@ static bool mi_page_list_is_valid(mi_page_t* page, mi_block_t* p) { if (p < start || p >= end) return false; p = mi_block_next(page, p); } +#if MI_DEBUG>3 // generally too expensive to check this + if (page->free_is_zero) { + const size_t ubsize = mi_page_usable_block_size(page); + for (mi_block_t* block = page->free; block != NULL; block = mi_block_next(page, block)) { + mi_assert_expensive(mi_mem_is_zero(block + 1, ubsize - sizeof(mi_block_t))); + } + } +#endif return true; } @@ -74,27 +82,30 @@ static bool mi_page_is_valid_init(mi_page_t* page) { mi_assert_internal(page->used <= page->capacity); mi_assert_internal(page->capacity <= page->reserved); - const size_t bsize = mi_page_block_size(page); mi_segment_t* segment = _mi_page_segment(page); uint8_t* start = _mi_page_start(segment,page,NULL); - mi_assert_internal(start == _mi_segment_page_start(segment,page,bsize,NULL,NULL)); + mi_assert_internal(start == _mi_segment_page_start(segment,page,NULL)); + //const size_t bsize = mi_page_block_size(page); //mi_assert_internal(start + page->capacity*page->block_size == page->top); mi_assert_internal(mi_page_list_is_valid(page,page->free)); mi_assert_internal(mi_page_list_is_valid(page,page->local_free)); #if MI_DEBUG>3 // generally too expensive to check this - if (page->flags.is_zero) { - for(mi_block_t* block = page->free; block != NULL; mi_block_next(page,block)) { - mi_assert_expensive(mi_mem_is_zero(block + 1, page->block_size - sizeof(mi_block_t))); + if (page->free_is_zero) { + const size_t ubsize = mi_page_usable_block_size(page); + for(mi_block_t* block = page->free; block != NULL; block = mi_block_next(page,block)) { + mi_assert_expensive(mi_mem_is_zero(block + 1, ubsize - sizeof(mi_block_t))); } } #endif + #if !MI_TRACK_ENABLED && !MI_TSAN mi_block_t* tfree = mi_page_thread_free(page); mi_assert_internal(mi_page_list_is_valid(page, tfree)); //size_t tfree_count = mi_page_list_count(page, tfree); //mi_assert_internal(tfree_count <= page->thread_freed + 1); + #endif size_t free_count = mi_page_list_count(page, page->free) + mi_page_list_count(page, page->local_free); mi_assert_internal(page->used + free_count == page->capacity); @@ -102,6 +113,8 @@ static bool mi_page_is_valid_init(mi_page_t* page) { return true; } +extern bool _mi_process_is_initialized; // has mi_process_init been called? + bool _mi_page_is_valid(mi_page_t* page) { mi_assert_internal(mi_page_is_valid_init(page)); #if MI_SECURE @@ -109,11 +122,15 @@ bool _mi_page_is_valid(mi_page_t* page) { #endif if (mi_page_heap(page)!=NULL) { mi_segment_t* segment = _mi_page_segment(page); - mi_assert_internal(!_mi_process_is_initialized || segment->thread_id == mi_page_heap(page)->thread_id || segment->thread_id==0); - if (segment->page_kind != MI_PAGE_HUGE) { + + mi_assert_internal(!_mi_process_is_initialized || segment->thread_id==0 || segment->thread_id == mi_page_heap(page)->thread_id); + #if MI_HUGE_PAGE_ABANDON + if (segment->kind != MI_SEGMENT_HUGE) + #endif + { mi_page_queue_t* pq = mi_page_queue_of(page); mi_assert_internal(mi_page_queue_contains(pq, page)); - mi_assert_internal(pq->block_size==mi_page_block_size(page) || mi_page_block_size(page) > MI_LARGE_OBJ_SIZE_MAX || mi_page_is_in_full(page)); + mi_assert_internal(pq->block_size==mi_page_block_size(page) || mi_page_block_size(page) > MI_MEDIUM_OBJ_SIZE_MAX || mi_page_is_in_full(page)); mi_assert_internal(mi_heap_contains_queue(mi_page_heap(page),pq)); } } @@ -122,14 +139,23 @@ bool _mi_page_is_valid(mi_page_t* page) { #endif void _mi_page_use_delayed_free(mi_page_t* page, mi_delayed_t delay, bool override_never) { + while (!_mi_page_try_use_delayed_free(page, delay, override_never)) { + mi_atomic_yield(); + } +} + +bool _mi_page_try_use_delayed_free(mi_page_t* page, mi_delayed_t delay, bool override_never) { mi_thread_free_t tfreex; mi_delayed_t old_delay; - mi_thread_free_t tfree; + mi_thread_free_t tfree; + size_t yield_count = 0; do { tfree = mi_atomic_load_acquire(&page->xthread_free); // note: must acquire as we can break/repeat this loop and not do a CAS; tfreex = mi_tf_set_delayed(tfree, delay); old_delay = mi_tf_delayed(tfree); - if (mi_unlikely(old_delay == MI_DELAYED_FREEING)) { + if mi_unlikely(old_delay == MI_DELAYED_FREEING) { + if (yield_count >= 4) return false; // give up after 4 tries + yield_count++; mi_atomic_yield(); // delay until outstanding MI_DELAYED_FREEING are done. // tfree = mi_tf_set_delayed(tfree, MI_NO_DELAYED_FREE); // will cause CAS to busy fail } @@ -141,6 +167,8 @@ void _mi_page_use_delayed_free(mi_page_t* page, mi_delayed_t delay, bool overrid } } while ((old_delay == MI_DELAYED_FREEING) || !mi_atomic_cas_weak_release(&page->xthread_free, &tfree, tfreex)); + + return true; // success } /* ----------------------------------------------------------- @@ -197,11 +225,11 @@ void _mi_page_free_collect(mi_page_t* page, bool force) { // and the local free list if (page->local_free != NULL) { - if (mi_likely(page->free == NULL)) { + if mi_likely(page->free == NULL) { // usual case page->free = page->local_free; page->local_free = NULL; - page->is_zero = false; + page->free_is_zero = false; } else if (force) { // append -- only on shutdown (force) as this is a linear operation @@ -213,7 +241,7 @@ void _mi_page_free_collect(mi_page_t* page, bool force) { mi_block_set_next(page, tail, page->free); page->free = page->local_free; page->local_free = NULL; - page->is_zero = false; + page->free_is_zero = false; } } @@ -229,10 +257,13 @@ void _mi_page_free_collect(mi_page_t* page, bool force) { // called from segments when reclaiming abandoned pages void _mi_page_reclaim(mi_heap_t* heap, mi_page_t* page) { mi_assert_expensive(mi_page_is_valid_init(page)); + mi_assert_internal(mi_page_heap(page) == heap); mi_assert_internal(mi_page_thread_free_flag(page) != MI_NEVER_DELAYED_FREE); - mi_assert_internal(_mi_page_segment(page)->page_kind != MI_PAGE_HUGE); - mi_assert_internal(!page->is_reset); + #if MI_HUGE_PAGE_ABANDON + mi_assert_internal(_mi_page_segment(page)->kind != MI_SEGMENT_HUGE); + #endif + // TODO: push on full queue immediately if it is full? mi_page_queue_t* pq = mi_page_queue(heap, mi_page_block_size(page)); mi_page_queue_push(heap, pq, page); @@ -240,19 +271,26 @@ void _mi_page_reclaim(mi_heap_t* heap, mi_page_t* page) { } // allocate a fresh page from a segment -static mi_page_t* mi_page_fresh_alloc(mi_heap_t* heap, mi_page_queue_t* pq, size_t block_size) { - mi_assert_internal(pq==NULL||mi_heap_contains_queue(heap, pq)); - mi_assert_internal(pq==NULL||block_size == pq->block_size); - mi_page_t* page = _mi_segment_page_alloc(heap, block_size, &heap->tld->segments, &heap->tld->os); +static mi_page_t* mi_page_fresh_alloc(mi_heap_t* heap, mi_page_queue_t* pq, size_t block_size, size_t page_alignment) { + #if !MI_HUGE_PAGE_ABANDON + mi_assert_internal(pq != NULL); + mi_assert_internal(mi_heap_contains_queue(heap, pq)); + mi_assert_internal(page_alignment > 0 || block_size > MI_MEDIUM_OBJ_SIZE_MAX || block_size == pq->block_size); + #endif + mi_page_t* page = _mi_segment_page_alloc(heap, block_size, page_alignment, &heap->tld->segments, &heap->tld->os); if (page == NULL) { // this may be out-of-memory, or an abandoned page was reclaimed (and in our queue) return NULL; } + mi_assert_internal(page_alignment >0 || block_size > MI_MEDIUM_OBJ_SIZE_MAX || _mi_page_segment(page)->kind != MI_SEGMENT_HUGE); + mi_assert_internal(pq!=NULL || page->xblock_size != 0); + mi_assert_internal(pq!=NULL || mi_page_block_size(page) >= block_size); // a fresh page was found, initialize it - mi_assert_internal(pq==NULL || _mi_page_segment(page)->page_kind != MI_PAGE_HUGE); - mi_page_init(heap, page, block_size, heap->tld); - _mi_stat_increase(&heap->tld->stats.pages, 1); - if (pq!=NULL) mi_page_queue_push(heap, pq, page); // huge pages use pq==NULL + const size_t full_block_size = ((pq == NULL || mi_page_queue_is_huge(pq)) ? mi_page_block_size(page) : block_size); // see also: mi_segment_huge_page_alloc + mi_assert_internal(full_block_size >= block_size); + mi_page_init(heap, page, full_block_size, heap->tld); + mi_heap_stat_increase(heap, pages, 1); + if (pq != NULL) { mi_page_queue_push(heap, pq, page); } mi_assert_expensive(_mi_page_is_valid(page)); return page; } @@ -260,7 +298,7 @@ static mi_page_t* mi_page_fresh_alloc(mi_heap_t* heap, mi_page_queue_t* pq, size // Get a fresh page to use static mi_page_t* mi_page_fresh(mi_heap_t* heap, mi_page_queue_t* pq) { mi_assert_internal(mi_heap_contains_queue(heap, pq)); - mi_page_t* page = mi_page_fresh_alloc(heap, pq, pq->block_size); + mi_page_t* page = mi_page_fresh_alloc(heap, pq, pq->block_size, 0); if (page==NULL) return NULL; mi_assert_internal(pq->block_size==mi_page_block_size(page)); mi_assert_internal(pq==mi_page_queue(heap, mi_page_block_size(page))); @@ -271,10 +309,18 @@ static mi_page_t* mi_page_fresh(mi_heap_t* heap, mi_page_queue_t* pq) { Do any delayed frees (put there by other threads if they deallocated in a full page) ----------------------------------------------------------- */ -void _mi_heap_delayed_free(mi_heap_t* heap) { +void _mi_heap_delayed_free_all(mi_heap_t* heap) { + while (!_mi_heap_delayed_free_partial(heap)) { + mi_atomic_yield(); + } +} + +// returns true if all delayed frees were processed +bool _mi_heap_delayed_free_partial(mi_heap_t* heap) { // take over the list (note: no atomic exchange since it is often NULL) mi_block_t* block = mi_atomic_load_ptr_relaxed(mi_block_t, &heap->thread_delayed_free); while (block != NULL && !mi_atomic_cas_ptr_weak_acq_rel(mi_block_t, &heap->thread_delayed_free, &block, NULL)) { /* nothing */ }; + bool all_freed = true; // and free them all while(block != NULL) { @@ -282,7 +328,9 @@ void _mi_heap_delayed_free(mi_heap_t* heap) { // use internal free instead of regular one to keep stats etc correct if (!_mi_free_delayed_block(block)) { // we might already start delayed freeing while another thread has not yet - // reset the delayed_freeing flag; in that case delay it further by reinserting. + // reset the delayed_freeing flag; in that case delay it further by reinserting the current block + // into the delayed free list + all_freed = false; mi_block_t* dfree = mi_atomic_load_ptr_relaxed(mi_block_t, &heap->thread_delayed_free); do { mi_block_set_nextx(heap, block, dfree, heap->keys); @@ -290,6 +338,7 @@ void _mi_heap_delayed_free(mi_heap_t* heap) { } block = next; } + return all_freed; } /* ----------------------------------------------------------- @@ -342,7 +391,7 @@ void _mi_page_abandon(mi_page_t* page, mi_page_queue_t* pq) { mi_assert_internal(mi_page_thread_free_flag(page)==MI_NEVER_DELAYED_FREE); mi_page_set_heap(page, NULL); -#if MI_DEBUG>1 +#if (MI_DEBUG>1) && !MI_TRACK_ENABLED // check there are no references left.. for (mi_block_t* block = (mi_block_t*)pheap->thread_delayed_free; block != NULL; block = mi_block_nextx(pheap, block, pheap->keys)) { mi_assert_internal(_mi_ptr_page(block) != page); @@ -366,9 +415,11 @@ void _mi_page_free(mi_page_t* page, mi_page_queue_t* pq, bool force) { // no more aligned blocks in here mi_page_set_has_aligned(page, false); + mi_heap_t* heap = mi_page_heap(page); + // remove from the page list // (no need to do _mi_heap_delayed_free first as all blocks are already free) - mi_segments_tld_t* segments_tld = &mi_page_heap(page)->tld->segments; + mi_segments_tld_t* segments_tld = &heap->tld->segments; mi_page_queue_remove(pq, page); // and free it @@ -376,8 +427,9 @@ void _mi_page_free(mi_page_t* page, mi_page_queue_t* pq, bool force) { _mi_segment_page_free(page, force, segments_tld); } -#define MI_MAX_RETIRE_SIZE MI_LARGE_OBJ_SIZE_MAX -#define MI_RETIRE_CYCLES (8) +// Retire parameters +#define MI_MAX_RETIRE_SIZE (MI_MEDIUM_OBJ_SIZE_MAX) +#define MI_RETIRE_CYCLES (16) // Retire a page with no more used blocks // Important to not retire too quickly though as new @@ -385,11 +437,11 @@ void _mi_page_free(mi_page_t* page, mi_page_queue_t* pq, bool force) { // Note: called from `mi_free` and benchmarks often // trigger this due to freeing everything and then // allocating again so careful when changing this. -void _mi_page_retire(mi_page_t* page) { +void _mi_page_retire(mi_page_t* page) mi_attr_noexcept { mi_assert_internal(page != NULL); mi_assert_expensive(_mi_page_is_valid(page)); mi_assert_internal(mi_page_all_free(page)); - + mi_page_set_has_aligned(page, false); // don't retire too often.. @@ -399,10 +451,10 @@ void _mi_page_retire(mi_page_t* page) { // how to check this efficiently though... // for now, we don't retire if it is the only page left of this size class. mi_page_queue_t* pq = mi_page_queue_of(page); - if (mi_likely(page->xblock_size <= MI_MAX_RETIRE_SIZE && !mi_page_is_in_full(page))) { + if mi_likely(page->xblock_size <= MI_MAX_RETIRE_SIZE && !mi_page_queue_is_special(pq)) { // not too large && not full or huge queue? if (pq->last==page && pq->first==page) { // the only page in the queue? mi_stat_counter_increase(_mi_stats_main.page_no_retire,1); - page->retire_expire = (page->xblock_size <= MI_SMALL_OBJ_SIZE_MAX ? MI_RETIRE_CYCLES : MI_RETIRE_CYCLES/4); + page->retire_expire = 1 + (page->xblock_size <= MI_SMALL_OBJ_SIZE_MAX ? MI_RETIRE_CYCLES : MI_RETIRE_CYCLES/4); mi_heap_t* heap = mi_page_heap(page); mi_assert_internal(pq >= heap->pages); const size_t index = pq - heap->pages; @@ -413,7 +465,6 @@ void _mi_page_retire(mi_page_t* page) { return; // dont't free after all } } - _mi_page_free(page, pq, false); } @@ -458,7 +509,7 @@ void _mi_heap_collect_retired(mi_heap_t* heap, bool force) { #define MI_MIN_SLICES (2) static void mi_page_free_list_extend_secure(mi_heap_t* const heap, mi_page_t* const page, const size_t bsize, const size_t extend, mi_stats_t* const stats) { - UNUSED(stats); + MI_UNUSED(stats); #if (MI_SECURE<=2) mi_assert_internal(page->free == NULL); mi_assert_internal(page->local_free == NULL); @@ -516,7 +567,7 @@ static void mi_page_free_list_extend_secure(mi_heap_t* const heap, mi_page_t* co static mi_decl_noinline void mi_page_free_list_extend( mi_page_t* const page, const size_t bsize, const size_t extend, mi_stats_t* const stats) { - UNUSED(stats); + MI_UNUSED(stats); #if (MI_SECURE <= 2) mi_assert_internal(page->free == NULL); mi_assert_internal(page->local_free == NULL); @@ -548,7 +599,7 @@ static mi_decl_noinline void mi_page_free_list_extend( mi_page_t* const page, co #if (MI_SECURE>0) #define MI_MIN_EXTEND (8*MI_SECURE) // extend at least by this many #else -#define MI_MIN_EXTEND (1) +#define MI_MIN_EXTEND (4) #endif // Extend the capacity (up to reserved) by initializing a free list @@ -557,6 +608,7 @@ static mi_decl_noinline void mi_page_free_list_extend( mi_page_t* const page, co // allocations but this did not speed up any benchmark (due to an // extra test in malloc? or cache effects?) static void mi_page_extend_free(mi_heap_t* heap, mi_page_t* page, mi_tld_t* tld) { + MI_UNUSED(tld); mi_assert_expensive(mi_page_is_valid_init(page)); #if (MI_SECURE<=2) mi_assert(page->free == NULL); @@ -566,20 +618,22 @@ static void mi_page_extend_free(mi_heap_t* heap, mi_page_t* page, mi_tld_t* tld) if (page->capacity >= page->reserved) return; size_t page_size; - //uint8_t* page_start = _mi_page_start(_mi_page_segment(page), page, &page_size); mi_stat_counter_increase(tld->stats.pages_extended, 1); // calculate the extend count const size_t bsize = (page->xblock_size < MI_HUGE_BLOCK_SIZE ? page->xblock_size : page_size); size_t extend = page->reserved - page->capacity; + mi_assert_internal(extend > 0); + size_t max_extend = (bsize >= MI_MAX_EXTEND_SIZE ? MI_MIN_EXTEND : MI_MAX_EXTEND_SIZE/(uint32_t)bsize); - if (max_extend < MI_MIN_EXTEND) max_extend = MI_MIN_EXTEND; + if (max_extend < MI_MIN_EXTEND) { max_extend = MI_MIN_EXTEND; } + mi_assert_internal(max_extend > 0); if (extend > max_extend) { // ensure we don't touch memory beyond the page to reduce page commit. // the `lean` benchmark tests this. Going from 1 to 8 increases rss by 50%. - extend = (max_extend==0 ? 1 : max_extend); + extend = max_extend; } mi_assert_internal(extend > 0 && extend + page->capacity <= page->reserved); @@ -595,11 +649,6 @@ static void mi_page_extend_free(mi_heap_t* heap, mi_page_t* page, mi_tld_t* tld) // enable the new free list page->capacity += (uint16_t)extend; mi_stat_increase(tld->stats.page_committed, extend * bsize); - - // extension into zero initialized memory preserves the zero'd free list - if (!page->is_zero_init) { - page->is_zero = false; - } mi_assert_expensive(mi_page_is_valid_init(page)); } @@ -611,17 +660,29 @@ static void mi_page_init(mi_heap_t* heap, mi_page_t* page, size_t block_size, mi mi_assert_internal(block_size > 0); // set fields mi_page_set_heap(page, heap); + page->xblock_size = (block_size < MI_HUGE_BLOCK_SIZE ? (uint32_t)block_size : MI_HUGE_BLOCK_SIZE); // initialize before _mi_segment_page_start size_t page_size; - _mi_segment_page_start(segment, page, block_size, &page_size, NULL); - page->xblock_size = (block_size < MI_HUGE_BLOCK_SIZE ? (uint32_t)block_size : MI_HUGE_BLOCK_SIZE); + const void* page_start = _mi_segment_page_start(segment, page, &page_size); + MI_UNUSED(page_start); + mi_track_mem_noaccess(page_start,page_size); + mi_assert_internal(mi_page_block_size(page) <= page_size); + mi_assert_internal(page_size <= page->slice_count*MI_SEGMENT_SLICE_SIZE); mi_assert_internal(page_size / block_size < (1L<<16)); page->reserved = (uint16_t)(page_size / block_size); - #ifdef MI_ENCODE_FREELIST + mi_assert_internal(page->reserved > 0); + #if (MI_PADDING || MI_ENCODE_FREELIST) page->keys[0] = _mi_heap_random_next(heap); page->keys[1] = _mi_heap_random_next(heap); #endif - page->is_zero = page->is_zero_init; - + page->free_is_zero = page->is_zero_init; + #if MI_DEBUG>2 + if (page->is_zero_init) { + mi_track_mem_defined(page_start, page_size); + mi_assert_expensive(mi_mem_is_zero(page_start, page_size)); + } + #endif + + mi_assert_internal(page->is_committed); mi_assert_internal(page->capacity == 0); mi_assert_internal(page->free == NULL); mi_assert_internal(page->used == 0); @@ -630,7 +691,7 @@ static void mi_page_init(mi_heap_t* heap, mi_page_t* page, size_t block_size, mi mi_assert_internal(page->prev == NULL); mi_assert_internal(page->retire_expire == 0); mi_assert_internal(!mi_page_has_aligned(page)); - #if (MI_ENCODE_FREELIST) + #if (MI_PADDING || MI_ENCODE_FREELIST) mi_assert_internal(page->keys[0] != 0); mi_assert_internal(page->keys[1] != 0); #endif @@ -650,12 +711,16 @@ static void mi_page_init(mi_heap_t* heap, mi_page_t* page, size_t block_size, mi static mi_page_t* mi_page_queue_find_free_ex(mi_heap_t* heap, mi_page_queue_t* pq, bool first_try) { // search through the pages in "next fit" order + #if MI_STAT size_t count = 0; + #endif mi_page_t* page = pq->first; while (page != NULL) { mi_page_t* next = page->next; // remember next + #if MI_STAT count++; + #endif // 0. collect freed blocks by us and other threads _mi_page_free_collect(page, false); @@ -680,14 +745,14 @@ static mi_page_t* mi_page_queue_find_free_ex(mi_heap_t* heap, mi_page_queue_t* p page = next; } // for each page - mi_stat_counter_increase(heap->tld->stats.searches, count); + mi_heap_stat_counter_increase(heap, searches, count); if (page == NULL) { - _mi_heap_collect_retired(heap, false); // perhaps make a page available + _mi_heap_collect_retired(heap, false); // perhaps make a page available? page = mi_page_fresh(heap, pq); if (page == NULL && first_try) { // out-of-memory _or_ an abandoned page with free blocks was reclaimed, try once again - page = mi_page_queue_find_free_ex(heap, pq, false); + page = mi_page_queue_find_free_ex(heap, pq, false); } } else { @@ -705,14 +770,17 @@ static inline mi_page_t* mi_find_free_page(mi_heap_t* heap, size_t size) { mi_page_queue_t* pq = mi_page_queue(heap,size); mi_page_t* page = pq->first; if (page != NULL) { - if ((MI_SECURE >= 3) && page->capacity < page->reserved && ((_mi_heap_random_next(heap) & 1) == 1)) { - // in secure mode, we extend half the time to increase randomness + #if (MI_SECURE>=3) // in secure mode, we extend half the time to increase randomness + if (page->capacity < page->reserved && ((_mi_heap_random_next(heap) & 1) == 1)) { mi_page_extend_free(heap, page, heap->tld); mi_assert_internal(mi_page_immediate_available(page)); } - else { + else + #endif + { _mi_page_free_collect(page,false); } + if (mi_page_immediate_available(page)) { page->retire_expire = 0; return page; // fast path @@ -751,30 +819,46 @@ void mi_register_deferred_free(mi_deferred_free_fun* fn, void* arg) mi_attr_noex General allocation ----------------------------------------------------------- */ -// A huge page is allocated directly without being in a queue. +// Large and huge page allocation. +// Huge pages are allocated directly without being in a queue. // Because huge pages contain just one block, and the segment contains // just that page, we always treat them as abandoned and any thread // that frees the block can free the whole page and segment directly. -static mi_page_t* mi_huge_page_alloc(mi_heap_t* heap, size_t size) { +// Huge pages are also use if the requested alignment is very large (> MI_ALIGNMENT_MAX). +static mi_page_t* mi_large_huge_page_alloc(mi_heap_t* heap, size_t size, size_t page_alignment) { size_t block_size = _mi_os_good_alloc_size(size); - mi_assert_internal(_mi_bin(block_size) == MI_BIN_HUGE); - mi_page_t* page = mi_page_fresh_alloc(heap,NULL,block_size); + mi_assert_internal(mi_bin(block_size) == MI_BIN_HUGE || page_alignment > 0); + bool is_huge = (block_size > MI_LARGE_OBJ_SIZE_MAX || page_alignment > 0); + #if MI_HUGE_PAGE_ABANDON + mi_page_queue_t* pq = (is_huge ? NULL : mi_page_queue(heap, block_size)); + #else + mi_page_queue_t* pq = mi_page_queue(heap, is_huge ? MI_HUGE_BLOCK_SIZE : block_size); // not block_size as that can be low if the page_alignment > 0 + mi_assert_internal(!is_huge || mi_page_queue_is_huge(pq)); + #endif + mi_page_t* page = mi_page_fresh_alloc(heap, pq, block_size, page_alignment); if (page != NULL) { - const size_t bsize = mi_page_block_size(page); // note: not `mi_page_usable_block_size` as `size` includes padding already - mi_assert_internal(bsize >= size); mi_assert_internal(mi_page_immediate_available(page)); - mi_assert_internal(_mi_page_segment(page)->page_kind==MI_PAGE_HUGE); - mi_assert_internal(_mi_page_segment(page)->used==1); - mi_assert_internal(_mi_page_segment(page)->thread_id==0); // abandoned, not in the huge queue - mi_page_set_heap(page, NULL); - - if (bsize > MI_HUGE_OBJ_SIZE_MAX) { - _mi_stat_increase(&heap->tld->stats.giant, bsize); - _mi_stat_counter_increase(&heap->tld->stats.giant_count, 1); + + if (is_huge) { + mi_assert_internal(_mi_page_segment(page)->kind == MI_SEGMENT_HUGE); + mi_assert_internal(_mi_page_segment(page)->used==1); + #if MI_HUGE_PAGE_ABANDON + mi_assert_internal(_mi_page_segment(page)->thread_id==0); // abandoned, not in the huge queue + mi_page_set_heap(page, NULL); + #endif } else { - _mi_stat_increase(&heap->tld->stats.huge, bsize); - _mi_stat_counter_increase(&heap->tld->stats.huge_count, 1); + mi_assert_internal(_mi_page_segment(page)->kind != MI_SEGMENT_HUGE); + } + + const size_t bsize = mi_page_usable_block_size(page); // note: not `mi_page_block_size` to account for padding + if (bsize <= MI_LARGE_OBJ_SIZE_MAX) { + mi_heap_stat_increase(heap, large, bsize); + mi_heap_stat_counter_increase(heap, large_count, 1); + } + else { + mi_heap_stat_increase(heap, huge, bsize); + mi_heap_stat_counter_increase(heap, huge_count, 1); } } return page; @@ -783,54 +867,57 @@ static mi_page_t* mi_huge_page_alloc(mi_heap_t* heap, size_t size) { // Allocate a page // Note: in debug mode the size includes MI_PADDING_SIZE and might have overflowed. -static mi_page_t* mi_find_page(mi_heap_t* heap, size_t size) mi_attr_noexcept { +static mi_page_t* mi_find_page(mi_heap_t* heap, size_t size, size_t huge_alignment) mi_attr_noexcept { // huge allocation? const size_t req_size = size - MI_PADDING_SIZE; // correct for padding_size in case of an overflow on `size` - if (mi_unlikely(req_size > (MI_LARGE_OBJ_SIZE_MAX - MI_PADDING_SIZE) )) { - if (mi_unlikely(req_size > PTRDIFF_MAX)) { // we don't allocate more than PTRDIFF_MAX (see ) + if mi_unlikely(req_size > (MI_MEDIUM_OBJ_SIZE_MAX - MI_PADDING_SIZE) || huge_alignment > 0) { + if mi_unlikely(req_size > PTRDIFF_MAX) { // we don't allocate more than PTRDIFF_MAX (see ) _mi_error_message(EOVERFLOW, "allocation request is too large (%zu bytes)\n", req_size); return NULL; } else { - return mi_huge_page_alloc(heap,size); + return mi_large_huge_page_alloc(heap,size,huge_alignment); } } else { // otherwise find a page with free blocks in our size segregated queues - mi_assert_internal(size >= MI_PADDING_SIZE); + #if MI_PADDING + mi_assert_internal(size >= MI_PADDING_SIZE); + #endif return mi_find_free_page(heap, size); } } // Generic allocation routine if the fast path (`alloc.c:mi_page_malloc`) does not succeed. // Note: in debug mode the size includes MI_PADDING_SIZE and might have overflowed. -void* _mi_malloc_generic(mi_heap_t* heap, size_t size) mi_attr_noexcept +// The `huge_alignment` is normally 0 but is set to a multiple of MI_SEGMENT_SIZE for +// very large requested alignments in which case we use a huge segment. +void* _mi_malloc_generic(mi_heap_t* heap, size_t size, bool zero, size_t huge_alignment) mi_attr_noexcept { mi_assert_internal(heap != NULL); // initialize if necessary - if (mi_unlikely(!mi_heap_is_initialized(heap))) { - mi_thread_init(); // calls `_mi_heap_init` in turn - heap = mi_get_default_heap(); - if (mi_unlikely(!mi_heap_is_initialized(heap))) { return NULL; } + if mi_unlikely(!mi_heap_is_initialized(heap)) { + heap = mi_heap_get_default(); // calls mi_thread_init + if mi_unlikely(!mi_heap_is_initialized(heap)) { return NULL; } } mi_assert_internal(mi_heap_is_initialized(heap)); // call potential deferred free routines _mi_deferred_free(heap, false); - // free delayed frees from other threads - _mi_heap_delayed_free(heap); + // free delayed frees from other threads (but skip contended ones) + _mi_heap_delayed_free_partial(heap); // find (or allocate) a page of the right size - mi_page_t* page = mi_find_page(heap, size); - if (mi_unlikely(page == NULL)) { // first time out of memory, try to collect and retry the allocation once more + mi_page_t* page = mi_find_page(heap, size, huge_alignment); + if mi_unlikely(page == NULL) { // first time out of memory, try to collect and retry the allocation once more mi_heap_collect(heap, true /* force */); - page = mi_find_page(heap, size); + page = mi_find_page(heap, size, huge_alignment); } - if (mi_unlikely(page == NULL)) { // out of memory - const size_t req_size = size - MI_PADDING_SIZE; // correct for padding_size in case of an overflow on `size` + if mi_unlikely(page == NULL) { // out of memory + const size_t req_size = size - MI_PADDING_SIZE; // correct for padding_size in case of an overflow on `size` _mi_error_message(ENOMEM, "unable to allocate memory (%zu bytes)\n", req_size); return NULL; } @@ -838,6 +925,15 @@ void* _mi_malloc_generic(mi_heap_t* heap, size_t size) mi_attr_noexcept mi_assert_internal(mi_page_immediate_available(page)); mi_assert_internal(mi_page_block_size(page) >= size); - // and try again, this time succeeding! (i.e. this should never recurse) - return _mi_page_malloc(heap, page, size); + // and try again, this time succeeding! (i.e. this should never recurse through _mi_page_malloc) + if mi_unlikely(zero && page->xblock_size == 0) { + // note: we cannot call _mi_page_malloc with zeroing for huge blocks; we zero it afterwards in that case. + void* p = _mi_page_malloc(heap, page, size, false); + mi_assert_internal(p != NULL); + _mi_memzero_aligned(p, mi_page_usable_block_size(page)); + return p; + } + else { + return _mi_page_malloc(heap, page, size, zero); + } } diff --git a/src/prim/osx/alloc-override-zone.c b/src/prim/osx/alloc-override-zone.c new file mode 100644 index 0000000..0e0a99d --- /dev/null +++ b/src/prim/osx/alloc-override-zone.c @@ -0,0 +1,458 @@ +/* ---------------------------------------------------------------------------- +Copyright (c) 2018-2022, Microsoft Research, Daan Leijen +This is free software; you can redistribute it and/or modify it under the +terms of the MIT license. A copy of the license can be found in the file +"LICENSE" at the root of this distribution. +-----------------------------------------------------------------------------*/ + +#include "mimalloc.h" +#include "mimalloc/internal.h" + +#if defined(MI_MALLOC_OVERRIDE) + +#if !defined(__APPLE__) +#error "this file should only be included on macOS" +#endif + +/* ------------------------------------------------------ + Override system malloc on macOS + This is done through the malloc zone interface. + It seems to be most robust in combination with interposing + though or otherwise we may get zone errors as there are could + be allocations done by the time we take over the + zone. +------------------------------------------------------ */ + +#include +#include +#include // memset +#include + +#ifdef __cplusplus +extern "C" { +#endif + +#if defined(MAC_OS_X_VERSION_10_6) && (MAC_OS_X_VERSION_MAX_ALLOWED >= MAC_OS_X_VERSION_10_6) +// only available from OSX 10.6 +extern malloc_zone_t* malloc_default_purgeable_zone(void) __attribute__((weak_import)); +#endif + +/* ------------------------------------------------------ + malloc zone members +------------------------------------------------------ */ + +static size_t zone_size(malloc_zone_t* zone, const void* p) { + MI_UNUSED(zone); + if (!mi_is_in_heap_region(p)){ return 0; } // not our pointer, bail out + return mi_usable_size(p); +} + +static void* zone_malloc(malloc_zone_t* zone, size_t size) { + MI_UNUSED(zone); + return mi_malloc(size); +} + +static void* zone_calloc(malloc_zone_t* zone, size_t count, size_t size) { + MI_UNUSED(zone); + return mi_calloc(count, size); +} + +static void* zone_valloc(malloc_zone_t* zone, size_t size) { + MI_UNUSED(zone); + return mi_malloc_aligned(size, _mi_os_page_size()); +} + +static void zone_free(malloc_zone_t* zone, void* p) { + MI_UNUSED(zone); + mi_cfree(p); +} + +static void* zone_realloc(malloc_zone_t* zone, void* p, size_t newsize) { + MI_UNUSED(zone); + return mi_realloc(p, newsize); +} + +static void* zone_memalign(malloc_zone_t* zone, size_t alignment, size_t size) { + MI_UNUSED(zone); + return mi_malloc_aligned(size,alignment); +} + +static void zone_destroy(malloc_zone_t* zone) { + MI_UNUSED(zone); + // todo: ignore for now? +} + +static unsigned zone_batch_malloc(malloc_zone_t* zone, size_t size, void** ps, unsigned count) { + size_t i; + for (i = 0; i < count; i++) { + ps[i] = zone_malloc(zone, size); + if (ps[i] == NULL) break; + } + return i; +} + +static void zone_batch_free(malloc_zone_t* zone, void** ps, unsigned count) { + for(size_t i = 0; i < count; i++) { + zone_free(zone, ps[i]); + ps[i] = NULL; + } +} + +static size_t zone_pressure_relief(malloc_zone_t* zone, size_t size) { + MI_UNUSED(zone); MI_UNUSED(size); + mi_collect(false); + return 0; +} + +static void zone_free_definite_size(malloc_zone_t* zone, void* p, size_t size) { + MI_UNUSED(size); + zone_free(zone,p); +} + +static boolean_t zone_claimed_address(malloc_zone_t* zone, void* p) { + MI_UNUSED(zone); + return mi_is_in_heap_region(p); +} + + +/* ------------------------------------------------------ + Introspection members +------------------------------------------------------ */ + +static kern_return_t intro_enumerator(task_t task, void* p, + unsigned type_mask, vm_address_t zone_address, + memory_reader_t reader, + vm_range_recorder_t recorder) +{ + // todo: enumerate all memory + MI_UNUSED(task); MI_UNUSED(p); MI_UNUSED(type_mask); MI_UNUSED(zone_address); + MI_UNUSED(reader); MI_UNUSED(recorder); + return KERN_SUCCESS; +} + +static size_t intro_good_size(malloc_zone_t* zone, size_t size) { + MI_UNUSED(zone); + return mi_good_size(size); +} + +static boolean_t intro_check(malloc_zone_t* zone) { + MI_UNUSED(zone); + return true; +} + +static void intro_print(malloc_zone_t* zone, boolean_t verbose) { + MI_UNUSED(zone); MI_UNUSED(verbose); + mi_stats_print(NULL); +} + +static void intro_log(malloc_zone_t* zone, void* p) { + MI_UNUSED(zone); MI_UNUSED(p); + // todo? +} + +static void intro_force_lock(malloc_zone_t* zone) { + MI_UNUSED(zone); + // todo? +} + +static void intro_force_unlock(malloc_zone_t* zone) { + MI_UNUSED(zone); + // todo? +} + +static void intro_statistics(malloc_zone_t* zone, malloc_statistics_t* stats) { + MI_UNUSED(zone); + // todo... + stats->blocks_in_use = 0; + stats->size_in_use = 0; + stats->max_size_in_use = 0; + stats->size_allocated = 0; +} + +static boolean_t intro_zone_locked(malloc_zone_t* zone) { + MI_UNUSED(zone); + return false; +} + + +/* ------------------------------------------------------ + At process start, override the default allocator +------------------------------------------------------ */ + +#if defined(__GNUC__) && !defined(__clang__) +#pragma GCC diagnostic ignored "-Wmissing-field-initializers" +#endif + +#if defined(__clang__) +#pragma clang diagnostic ignored "-Wc99-extensions" +#endif + +static malloc_introspection_t mi_introspect = { + .enumerator = &intro_enumerator, + .good_size = &intro_good_size, + .check = &intro_check, + .print = &intro_print, + .log = &intro_log, + .force_lock = &intro_force_lock, + .force_unlock = &intro_force_unlock, +#if defined(MAC_OS_X_VERSION_10_6) && (MAC_OS_X_VERSION_MAX_ALLOWED >= MAC_OS_X_VERSION_10_6) && !defined(__ppc__) + .statistics = &intro_statistics, + .zone_locked = &intro_zone_locked, +#endif +}; + +static malloc_zone_t mi_malloc_zone = { + // note: even with designators, the order is important for C++ compilation + //.reserved1 = NULL, + //.reserved2 = NULL, + .size = &zone_size, + .malloc = &zone_malloc, + .calloc = &zone_calloc, + .valloc = &zone_valloc, + .free = &zone_free, + .realloc = &zone_realloc, + .destroy = &zone_destroy, + .zone_name = "mimalloc", + .batch_malloc = &zone_batch_malloc, + .batch_free = &zone_batch_free, + .introspect = &mi_introspect, +#if defined(MAC_OS_X_VERSION_10_6) && (MAC_OS_X_VERSION_MAX_ALLOWED >= MAC_OS_X_VERSION_10_6) && !defined(__ppc__) + #if defined(MAC_OS_X_VERSION_10_14) && (MAC_OS_X_VERSION_MAX_ALLOWED >= MAC_OS_X_VERSION_10_14) + .version = 10, + #else + .version = 9, + #endif + // switch to version 9+ on OSX 10.6 to support memalign. + .memalign = &zone_memalign, + .free_definite_size = &zone_free_definite_size, + .pressure_relief = &zone_pressure_relief, + #if defined(MAC_OS_X_VERSION_10_14) && (MAC_OS_X_VERSION_MAX_ALLOWED >= MAC_OS_X_VERSION_10_14) + .claimed_address = &zone_claimed_address, + #endif +#else + .version = 4, +#endif +}; + +#ifdef __cplusplus +} +#endif + + +#if defined(MI_OSX_INTERPOSE) && defined(MI_SHARED_LIB_EXPORT) + +// ------------------------------------------------------ +// Override malloc_xxx and malloc_zone_xxx api's to use only +// our mimalloc zone. Since even the loader uses malloc +// on macOS, this ensures that all allocations go through +// mimalloc (as all calls are interposed). +// The main `malloc`, `free`, etc calls are interposed in `alloc-override.c`, +// Here, we also override macOS specific API's like +// `malloc_zone_calloc` etc. see +// ------------------------------------------------------ + +static inline malloc_zone_t* mi_get_default_zone(void) +{ + static bool init; + if mi_unlikely(!init) { + init = true; + malloc_zone_register(&mi_malloc_zone); // by calling register we avoid a zone error on free (see ) + } + return &mi_malloc_zone; +} + +mi_decl_externc int malloc_jumpstart(uintptr_t cookie); +mi_decl_externc void _malloc_fork_prepare(void); +mi_decl_externc void _malloc_fork_parent(void); +mi_decl_externc void _malloc_fork_child(void); + + +static malloc_zone_t* mi_malloc_create_zone(vm_size_t size, unsigned flags) { + MI_UNUSED(size); MI_UNUSED(flags); + return mi_get_default_zone(); +} + +static malloc_zone_t* mi_malloc_default_zone (void) { + return mi_get_default_zone(); +} + +static malloc_zone_t* mi_malloc_default_purgeable_zone(void) { + return mi_get_default_zone(); +} + +static void mi_malloc_destroy_zone(malloc_zone_t* zone) { + MI_UNUSED(zone); + // nothing. +} + +static kern_return_t mi_malloc_get_all_zones (task_t task, memory_reader_t mr, vm_address_t** addresses, unsigned* count) { + MI_UNUSED(task); MI_UNUSED(mr); + if (addresses != NULL) *addresses = NULL; + if (count != NULL) *count = 0; + return KERN_SUCCESS; +} + +static const char* mi_malloc_get_zone_name(malloc_zone_t* zone) { + return (zone == NULL ? mi_malloc_zone.zone_name : zone->zone_name); +} + +static void mi_malloc_set_zone_name(malloc_zone_t* zone, const char* name) { + MI_UNUSED(zone); MI_UNUSED(name); +} + +static int mi_malloc_jumpstart(uintptr_t cookie) { + MI_UNUSED(cookie); + return 1; // or 0 for no error? +} + +static void mi__malloc_fork_prepare(void) { + // nothing +} +static void mi__malloc_fork_parent(void) { + // nothing +} +static void mi__malloc_fork_child(void) { + // nothing +} + +static void mi_malloc_printf(const char* fmt, ...) { + MI_UNUSED(fmt); +} + +static bool zone_check(malloc_zone_t* zone) { + MI_UNUSED(zone); + return true; +} + +static malloc_zone_t* zone_from_ptr(const void* p) { + MI_UNUSED(p); + return mi_get_default_zone(); +} + +static void zone_log(malloc_zone_t* zone, void* p) { + MI_UNUSED(zone); MI_UNUSED(p); +} + +static void zone_print(malloc_zone_t* zone, bool b) { + MI_UNUSED(zone); MI_UNUSED(b); +} + +static void zone_print_ptr_info(void* p) { + MI_UNUSED(p); +} + +static void zone_register(malloc_zone_t* zone) { + MI_UNUSED(zone); +} + +static void zone_unregister(malloc_zone_t* zone) { + MI_UNUSED(zone); +} + +// use interposing so `DYLD_INSERT_LIBRARIES` works without `DYLD_FORCE_FLAT_NAMESPACE=1` +// See: +struct mi_interpose_s { + const void* replacement; + const void* target; +}; +#define MI_INTERPOSE_FUN(oldfun,newfun) { (const void*)&newfun, (const void*)&oldfun } +#define MI_INTERPOSE_MI(fun) MI_INTERPOSE_FUN(fun,mi_##fun) +#define MI_INTERPOSE_ZONE(fun) MI_INTERPOSE_FUN(malloc_##fun,fun) +__attribute__((used)) static const struct mi_interpose_s _mi_zone_interposes[] __attribute__((section("__DATA, __interpose"))) = +{ + + MI_INTERPOSE_MI(malloc_create_zone), + MI_INTERPOSE_MI(malloc_default_purgeable_zone), + MI_INTERPOSE_MI(malloc_default_zone), + MI_INTERPOSE_MI(malloc_destroy_zone), + MI_INTERPOSE_MI(malloc_get_all_zones), + MI_INTERPOSE_MI(malloc_get_zone_name), + MI_INTERPOSE_MI(malloc_jumpstart), + MI_INTERPOSE_MI(malloc_printf), + MI_INTERPOSE_MI(malloc_set_zone_name), + MI_INTERPOSE_MI(_malloc_fork_child), + MI_INTERPOSE_MI(_malloc_fork_parent), + MI_INTERPOSE_MI(_malloc_fork_prepare), + + MI_INTERPOSE_ZONE(zone_batch_free), + MI_INTERPOSE_ZONE(zone_batch_malloc), + MI_INTERPOSE_ZONE(zone_calloc), + MI_INTERPOSE_ZONE(zone_check), + MI_INTERPOSE_ZONE(zone_free), + MI_INTERPOSE_ZONE(zone_from_ptr), + MI_INTERPOSE_ZONE(zone_log), + MI_INTERPOSE_ZONE(zone_malloc), + MI_INTERPOSE_ZONE(zone_memalign), + MI_INTERPOSE_ZONE(zone_print), + MI_INTERPOSE_ZONE(zone_print_ptr_info), + MI_INTERPOSE_ZONE(zone_realloc), + MI_INTERPOSE_ZONE(zone_register), + MI_INTERPOSE_ZONE(zone_unregister), + MI_INTERPOSE_ZONE(zone_valloc) +}; + + +#else + +// ------------------------------------------------------ +// hook into the zone api's without interposing +// This is the official way of adding an allocator but +// it seems less robust than using interpose. +// ------------------------------------------------------ + +static inline malloc_zone_t* mi_get_default_zone(void) +{ + // The first returned zone is the real default + malloc_zone_t** zones = NULL; + unsigned count = 0; + kern_return_t ret = malloc_get_all_zones(0, NULL, (vm_address_t**)&zones, &count); + if (ret == KERN_SUCCESS && count > 0) { + return zones[0]; + } + else { + // fallback + return malloc_default_zone(); + } +} + +#if defined(__clang__) +__attribute__((constructor(0))) +#else +__attribute__((constructor)) // seems not supported by g++-11 on the M1 +#endif +static void _mi_macos_override_malloc(void) { + malloc_zone_t* purgeable_zone = NULL; + + #if defined(MAC_OS_X_VERSION_10_6) && (MAC_OS_X_VERSION_MAX_ALLOWED >= MAC_OS_X_VERSION_10_6) + // force the purgeable zone to exist to avoid strange bugs + if (malloc_default_purgeable_zone) { + purgeable_zone = malloc_default_purgeable_zone(); + } + #endif + + // Register our zone. + // thomcc: I think this is still needed to put us in the zone list. + malloc_zone_register(&mi_malloc_zone); + // Unregister the default zone, this makes our zone the new default + // as that was the last registered. + malloc_zone_t *default_zone = mi_get_default_zone(); + // thomcc: Unsure if the next test is *always* false or just false in the + // cases I've tried. I'm also unsure if the code inside is needed. at all + if (default_zone != &mi_malloc_zone) { + malloc_zone_unregister(default_zone); + + // Reregister the default zone so free and realloc in that zone keep working. + malloc_zone_register(default_zone); + } + + // Unregister, and re-register the purgeable_zone to avoid bugs if it occurs + // earlier than the default zone. + if (purgeable_zone != NULL) { + malloc_zone_unregister(purgeable_zone); + malloc_zone_register(purgeable_zone); + } + +} +#endif // MI_OSX_INTERPOSE + +#endif // MI_MALLOC_OVERRIDE diff --git a/src/prim/osx/prim.c b/src/prim/osx/prim.c new file mode 100644 index 0000000..8a2f4e8 --- /dev/null +++ b/src/prim/osx/prim.c @@ -0,0 +1,9 @@ +/* ---------------------------------------------------------------------------- +Copyright (c) 2018-2023, Microsoft Research, Daan Leijen +This is free software; you can redistribute it and/or modify it under the +terms of the MIT license. A copy of the license can be found in the file +"LICENSE" at the root of this distribution. +-----------------------------------------------------------------------------*/ + +// We use the unix/prim.c with the mmap API on macOSX +#include "../unix/prim.c" diff --git a/src/prim/prim.c b/src/prim/prim.c new file mode 100644 index 0000000..9a597d8 --- /dev/null +++ b/src/prim/prim.c @@ -0,0 +1,24 @@ +/* ---------------------------------------------------------------------------- +Copyright (c) 2018-2023, Microsoft Research, Daan Leijen +This is free software; you can redistribute it and/or modify it under the +terms of the MIT license. A copy of the license can be found in the file +"LICENSE" at the root of this distribution. +-----------------------------------------------------------------------------*/ + +// Select the implementation of the primitives +// depending on the OS. + +#if defined(_WIN32) +#include "windows/prim.c" // VirtualAlloc (Windows) + +#elif defined(__APPLE__) +#include "osx/prim.c" // macOSX (actually defers to mmap in unix/prim.c) + +#elif defined(__wasi__) +#define MI_USE_SBRK +#include "wasi/prim.c" // memory-grow or sbrk (Wasm) + +#else +#include "unix/prim.c" // mmap() (Linux, macOSX, BSD, Illumnos, Haiku, DragonFly, etc.) + +#endif diff --git a/src/prim/readme.md b/src/prim/readme.md new file mode 100644 index 0000000..380dd3a --- /dev/null +++ b/src/prim/readme.md @@ -0,0 +1,9 @@ +## Portability Primitives + +This is the portability layer where all primitives needed from the OS are defined. + +- `include/mimalloc/prim.h`: primitive portability API definition. +- `prim.c`: Selects one of `unix/prim.c`, `wasi/prim.c`, or `windows/prim.c` depending on the host platform + (and on macOS, `osx/prim.c` defers to `unix/prim.c`). + +Note: still work in progress, there may still be places in the sources that still depend on OS ifdef's. \ No newline at end of file diff --git a/src/prim/unix/prim.c b/src/prim/unix/prim.c new file mode 100644 index 0000000..314281f --- /dev/null +++ b/src/prim/unix/prim.c @@ -0,0 +1,859 @@ +/* ---------------------------------------------------------------------------- +Copyright (c) 2018-2023, Microsoft Research, Daan Leijen +This is free software; you can redistribute it and/or modify it under the +terms of the MIT license. A copy of the license can be found in the file +"LICENSE" at the root of this distribution. +-----------------------------------------------------------------------------*/ + +// This file is included in `src/prim/prim.c` + +#ifndef _DEFAULT_SOURCE +#define _DEFAULT_SOURCE // ensure mmap flags and syscall are defined +#endif + +#if defined(__sun) +// illumos provides new mman.h api when any of these are defined +// otherwise the old api based on caddr_t which predates the void pointers one. +// stock solaris provides only the former, chose to atomically to discard those +// flags only here rather than project wide tough. +#undef _XOPEN_SOURCE +#undef _POSIX_C_SOURCE +#endif + +#include "mimalloc.h" +#include "mimalloc/internal.h" +#include "mimalloc/atomic.h" +#include "mimalloc/prim.h" + +#include // mmap +#include // sysconf + +#if defined(__linux__) + #include + #include + #if defined(__GLIBC__) + #include // linux mmap flags + #else + #include + #endif +#elif defined(__APPLE__) + #include + #if !TARGET_IOS_IPHONE && !TARGET_IOS_SIMULATOR + #include + #endif +#elif defined(__FreeBSD__) || defined(__DragonFly__) + #include + #if __FreeBSD_version >= 1200000 + #include + #include + #endif + #include +#endif + +#if !defined(__HAIKU__) && !defined(__APPLE__) && !defined(__CYGWIN__) + #define MI_HAS_SYSCALL_H + #include +#endif + +//------------------------------------------------------------------------------------ +// Use syscalls for some primitives to allow for libraries that override open/read/close etc. +// and do allocation themselves; using syscalls prevents recursion when mimalloc is +// still initializing (issue #713) +//------------------------------------------------------------------------------------ + +#if defined(MI_HAS_SYSCALL_H) && defined(SYS_open) && defined(SYS_close) && defined(SYS_read) && defined(SYS_access) + +static int mi_prim_open(const char* fpath, int open_flags) { + return syscall(SYS_open,fpath,open_flags,0); +} +static ssize_t mi_prim_read(int fd, void* buf, size_t bufsize) { + return syscall(SYS_read,fd,buf,bufsize); +} +static int mi_prim_close(int fd) { + return syscall(SYS_close,fd); +} +static int mi_prim_access(const char *fpath, int mode) { + return syscall(SYS_access,fpath,mode); +} + +#elif !defined(__APPLE__) // avoid unused warnings + +static int mi_prim_open(const char* fpath, int open_flags) { + return open(fpath,open_flags); +} +static ssize_t mi_prim_read(int fd, void* buf, size_t bufsize) { + return read(fd,buf,bufsize); +} +static int mi_prim_close(int fd) { + return close(fd); +} +static int mi_prim_access(const char *fpath, int mode) { + return access(fpath,mode); +} + +#endif + + + +//--------------------------------------------- +// init +//--------------------------------------------- + +static bool unix_detect_overcommit(void) { + bool os_overcommit = true; +#if defined(__linux__) + int fd = mi_prim_open("/proc/sys/vm/overcommit_memory", O_RDONLY); + if (fd >= 0) { + char buf[32]; + ssize_t nread = mi_prim_read(fd, &buf, sizeof(buf)); + mi_prim_close(fd); + // + // 0: heuristic overcommit, 1: always overcommit, 2: never overcommit (ignore NORESERVE) + if (nread >= 1) { + os_overcommit = (buf[0] == '0' || buf[0] == '1'); + } + } +#elif defined(__FreeBSD__) + int val = 0; + size_t olen = sizeof(val); + if (sysctlbyname("vm.overcommit", &val, &olen, NULL, 0) == 0) { + os_overcommit = (val != 0); + } +#else + // default: overcommit is true +#endif + return os_overcommit; +} + +void _mi_prim_mem_init( mi_os_mem_config_t* config ) { + long psize = sysconf(_SC_PAGESIZE); + if (psize > 0) { + config->page_size = (size_t)psize; + config->alloc_granularity = (size_t)psize; + } + config->large_page_size = 2*MI_MiB; // TODO: can we query the OS for this? + config->has_overcommit = unix_detect_overcommit(); + config->must_free_whole = false; // mmap can free in parts + config->has_virtual_reserve = true; // todo: check if this true for NetBSD? (for anonymous mmap with PROT_NONE) +} + + +//--------------------------------------------- +// free +//--------------------------------------------- + +int _mi_prim_free(void* addr, size_t size ) { + bool err = (munmap(addr, size) == -1); + return (err ? errno : 0); +} + + +//--------------------------------------------- +// mmap +//--------------------------------------------- + +static int unix_madvise(void* addr, size_t size, int advice) { + #if defined(__sun) + return madvise((caddr_t)addr, size, advice); // Solaris needs cast (issue #520) + #else + return madvise(addr, size, advice); + #endif +} + +static void* unix_mmap_prim(void* addr, size_t size, size_t try_alignment, int protect_flags, int flags, int fd) { + MI_UNUSED(try_alignment); + void* p = NULL; + #if defined(MAP_ALIGNED) // BSD + if (addr == NULL && try_alignment > 1 && (try_alignment % _mi_os_page_size()) == 0) { + size_t n = mi_bsr(try_alignment); + if (((size_t)1 << n) == try_alignment && n >= 12 && n <= 30) { // alignment is a power of 2 and 4096 <= alignment <= 1GiB + p = mmap(addr, size, protect_flags, flags | MAP_ALIGNED(n), fd, 0); + if (p==MAP_FAILED || !_mi_is_aligned(p,try_alignment)) { + int err = errno; + _mi_warning_message("unable to directly request aligned OS memory (error: %d (0x%x), size: 0x%zx bytes, alignment: 0x%zx, hint address: %p)\n", err, err, size, try_alignment, addr); + } + if (p!=MAP_FAILED) return p; + // fall back to regular mmap + } + } + #elif defined(MAP_ALIGN) // Solaris + if (addr == NULL && try_alignment > 1 && (try_alignment % _mi_os_page_size()) == 0) { + p = mmap((void*)try_alignment, size, protect_flags, flags | MAP_ALIGN, fd, 0); // addr parameter is the required alignment + if (p!=MAP_FAILED) return p; + // fall back to regular mmap + } + #endif + #if (MI_INTPTR_SIZE >= 8) && !defined(MAP_ALIGNED) + // on 64-bit systems, use the virtual address area after 2TiB for 4MiB aligned allocations + if (addr == NULL) { + void* hint = _mi_os_get_aligned_hint(try_alignment, size); + if (hint != NULL) { + p = mmap(hint, size, protect_flags, flags, fd, 0); + if (p==MAP_FAILED || !_mi_is_aligned(p,try_alignment)) { + #if MI_TRACK_ENABLED // asan sometimes does not instrument errno correctly? + int err = 0; + #else + int err = errno; + #endif + _mi_warning_message("unable to directly request hinted aligned OS memory (error: %d (0x%x), size: 0x%zx bytes, alignment: 0x%zx, hint address: %p)\n", err, err, size, try_alignment, hint); + } + if (p!=MAP_FAILED) return p; + // fall back to regular mmap + } + } + #endif + // regular mmap + p = mmap(addr, size, protect_flags, flags, fd, 0); + if (p!=MAP_FAILED) return p; + // failed to allocate + return NULL; +} + +static int unix_mmap_fd(void) { + #if defined(VM_MAKE_TAG) + // macOS: tracking anonymous page with a specific ID. (All up to 98 are taken officially but LLVM sanitizers had taken 99) + int os_tag = (int)mi_option_get(mi_option_os_tag); + if (os_tag < 100 || os_tag > 255) { os_tag = 100; } + return VM_MAKE_TAG(os_tag); + #else + return -1; + #endif +} + +static void* unix_mmap(void* addr, size_t size, size_t try_alignment, int protect_flags, bool large_only, bool allow_large, bool* is_large) { + #if !defined(MAP_ANONYMOUS) + #define MAP_ANONYMOUS MAP_ANON + #endif + #if !defined(MAP_NORESERVE) + #define MAP_NORESERVE 0 + #endif + void* p = NULL; + const int fd = unix_mmap_fd(); + int flags = MAP_PRIVATE | MAP_ANONYMOUS; + if (_mi_os_has_overcommit()) { + flags |= MAP_NORESERVE; + } + #if defined(PROT_MAX) + protect_flags |= PROT_MAX(PROT_READ | PROT_WRITE); // BSD + #endif + // huge page allocation + if ((large_only || _mi_os_use_large_page(size, try_alignment)) && allow_large) { + static _Atomic(size_t) large_page_try_ok; // = 0; + size_t try_ok = mi_atomic_load_acquire(&large_page_try_ok); + if (!large_only && try_ok > 0) { + // If the OS is not configured for large OS pages, or the user does not have + // enough permission, the `mmap` will always fail (but it might also fail for other reasons). + // Therefore, once a large page allocation failed, we don't try again for `large_page_try_ok` times + // to avoid too many failing calls to mmap. + mi_atomic_cas_strong_acq_rel(&large_page_try_ok, &try_ok, try_ok - 1); + } + else { + int lflags = flags & ~MAP_NORESERVE; // using NORESERVE on huge pages seems to fail on Linux + int lfd = fd; + #ifdef MAP_ALIGNED_SUPER + lflags |= MAP_ALIGNED_SUPER; + #endif + #ifdef MAP_HUGETLB + lflags |= MAP_HUGETLB; + #endif + #ifdef MAP_HUGE_1GB + static bool mi_huge_pages_available = true; + if ((size % MI_GiB) == 0 && mi_huge_pages_available) { + lflags |= MAP_HUGE_1GB; + } + else + #endif + { + #ifdef MAP_HUGE_2MB + lflags |= MAP_HUGE_2MB; + #endif + } + #ifdef VM_FLAGS_SUPERPAGE_SIZE_2MB + lfd |= VM_FLAGS_SUPERPAGE_SIZE_2MB; + #endif + if (large_only || lflags != flags) { + // try large OS page allocation + *is_large = true; + p = unix_mmap_prim(addr, size, try_alignment, protect_flags, lflags, lfd); + #ifdef MAP_HUGE_1GB + if (p == NULL && (lflags & MAP_HUGE_1GB) != 0) { + mi_huge_pages_available = false; // don't try huge 1GiB pages again + _mi_warning_message("unable to allocate huge (1GiB) page, trying large (2MiB) pages instead (errno: %i)\n", errno); + lflags = ((lflags & ~MAP_HUGE_1GB) | MAP_HUGE_2MB); + p = unix_mmap_prim(addr, size, try_alignment, protect_flags, lflags, lfd); + } + #endif + if (large_only) return p; + if (p == NULL) { + mi_atomic_store_release(&large_page_try_ok, (size_t)8); // on error, don't try again for the next N allocations + } + } + } + } + // regular allocation + if (p == NULL) { + *is_large = false; + p = unix_mmap_prim(addr, size, try_alignment, protect_flags, flags, fd); + if (p != NULL) { + #if defined(MADV_HUGEPAGE) + // Many Linux systems don't allow MAP_HUGETLB but they support instead + // transparent huge pages (THP). Generally, it is not required to call `madvise` with MADV_HUGE + // though since properly aligned allocations will already use large pages if available + // in that case -- in particular for our large regions (in `memory.c`). + // However, some systems only allow THP if called with explicit `madvise`, so + // when large OS pages are enabled for mimalloc, we call `madvise` anyways. + if (allow_large && _mi_os_use_large_page(size, try_alignment)) { + if (unix_madvise(p, size, MADV_HUGEPAGE) == 0) { + *is_large = true; // possibly + }; + } + #elif defined(__sun) + if (allow_large && _mi_os_use_large_page(size, try_alignment)) { + struct memcntl_mha cmd = {0}; + cmd.mha_pagesize = large_os_page_size; + cmd.mha_cmd = MHA_MAPSIZE_VA; + if (memcntl((caddr_t)p, size, MC_HAT_ADVISE, (caddr_t)&cmd, 0, 0) == 0) { + *is_large = true; + } + } + #endif + } + } + return p; +} + +// Note: the `try_alignment` is just a hint and the returned pointer is not guaranteed to be aligned. +int _mi_prim_alloc(size_t size, size_t try_alignment, bool commit, bool allow_large, bool* is_large, bool* is_zero, void** addr) { + mi_assert_internal(size > 0 && (size % _mi_os_page_size()) == 0); + mi_assert_internal(commit || !allow_large); + mi_assert_internal(try_alignment > 0); + + *is_zero = true; + int protect_flags = (commit ? (PROT_WRITE | PROT_READ) : PROT_NONE); + *addr = unix_mmap(NULL, size, try_alignment, protect_flags, false, allow_large, is_large); + return (*addr != NULL ? 0 : errno); +} + + +//--------------------------------------------- +// Commit/Reset +//--------------------------------------------- + +static void unix_mprotect_hint(int err) { + #if defined(__linux__) && (MI_SECURE>=2) // guard page around every mimalloc page + if (err == ENOMEM) { + _mi_warning_message("The next warning may be caused by a low memory map limit.\n" + " On Linux this is controlled by the vm.max_map_count -- maybe increase it?\n" + " For example: sudo sysctl -w vm.max_map_count=262144\n"); + } + #else + MI_UNUSED(err); + #endif +} + +int _mi_prim_commit(void* start, size_t size, bool* is_zero) { + // commit: ensure we can access the area + // note: we may think that *is_zero can be true since the memory + // was either from mmap PROT_NONE, or from decommit MADV_DONTNEED, but + // we sometimes call commit on a range with still partially committed + // memory and `mprotect` does not zero the range. + *is_zero = false; + int err = mprotect(start, size, (PROT_READ | PROT_WRITE)); + if (err != 0) { + err = errno; + unix_mprotect_hint(err); + } + return err; +} + +int _mi_prim_decommit(void* start, size_t size, bool* needs_recommit) { + int err = 0; + // decommit: use MADV_DONTNEED as it decreases rss immediately (unlike MADV_FREE) + err = unix_madvise(start, size, MADV_DONTNEED); + #if !MI_DEBUG && !MI_SECURE + *needs_recommit = false; + #else + *needs_recommit = true; + mprotect(start, size, PROT_NONE); + #endif + /* + // decommit: use mmap with MAP_FIXED and PROT_NONE to discard the existing memory (and reduce rss) + *needs_recommit = true; + const int fd = unix_mmap_fd(); + void* p = mmap(start, size, PROT_NONE, (MAP_FIXED | MAP_PRIVATE | MAP_ANONYMOUS | MAP_NORESERVE), fd, 0); + if (p != start) { err = errno; } + */ + return err; +} + +int _mi_prim_reset(void* start, size_t size) { + // We try to use `MADV_FREE` as that is the fastest. A drawback though is that it + // will not reduce the `rss` stats in tools like `top` even though the memory is available + // to other processes. With the default `MIMALLOC_PURGE_DECOMMITS=1` we ensure that by + // default `MADV_DONTNEED` is used though. + #if defined(MADV_FREE) + static _Atomic(size_t) advice = MI_ATOMIC_VAR_INIT(MADV_FREE); + int oadvice = (int)mi_atomic_load_relaxed(&advice); + int err; + while ((err = unix_madvise(start, size, oadvice)) != 0 && errno == EAGAIN) { errno = 0; }; + if (err != 0 && errno == EINVAL && oadvice == MADV_FREE) { + // if MADV_FREE is not supported, fall back to MADV_DONTNEED from now on + mi_atomic_store_release(&advice, (size_t)MADV_DONTNEED); + err = unix_madvise(start, size, MADV_DONTNEED); + } + #else + int err = unix_madvise(start, size, MADV_DONTNEED); + #endif + return err; +} + +int _mi_prim_protect(void* start, size_t size, bool protect) { + int err = mprotect(start, size, protect ? PROT_NONE : (PROT_READ | PROT_WRITE)); + if (err != 0) { err = errno; } + unix_mprotect_hint(err); + return err; +} + + + +//--------------------------------------------- +// Huge page allocation +//--------------------------------------------- + +#if (MI_INTPTR_SIZE >= 8) && !defined(__HAIKU__) && !defined(__CYGWIN__) + +#ifndef MPOL_PREFERRED +#define MPOL_PREFERRED 1 +#endif + +#if defined(MI_HAS_SYSCALL_H) && defined(SYS_mbind) +static long mi_prim_mbind(void* start, unsigned long len, unsigned long mode, const unsigned long* nmask, unsigned long maxnode, unsigned flags) { + return syscall(SYS_mbind, start, len, mode, nmask, maxnode, flags); +} +#else +static long mi_prim_mbind(void* start, unsigned long len, unsigned long mode, const unsigned long* nmask, unsigned long maxnode, unsigned flags) { + MI_UNUSED(start); MI_UNUSED(len); MI_UNUSED(mode); MI_UNUSED(nmask); MI_UNUSED(maxnode); MI_UNUSED(flags); + return 0; +} +#endif + +int _mi_prim_alloc_huge_os_pages(void* hint_addr, size_t size, int numa_node, bool* is_zero, void** addr) { + bool is_large = true; + *is_zero = true; + *addr = unix_mmap(hint_addr, size, MI_SEGMENT_SIZE, PROT_READ | PROT_WRITE, true, true, &is_large); + if (*addr != NULL && numa_node >= 0 && numa_node < 8*MI_INTPTR_SIZE) { // at most 64 nodes + unsigned long numa_mask = (1UL << numa_node); + // TODO: does `mbind` work correctly for huge OS pages? should we + // use `set_mempolicy` before calling mmap instead? + // see: + long err = mi_prim_mbind(*addr, size, MPOL_PREFERRED, &numa_mask, 8*MI_INTPTR_SIZE, 0); + if (err != 0) { + err = errno; + _mi_warning_message("failed to bind huge (1GiB) pages to numa node %d (error: %d (0x%x))\n", numa_node, err, err); + } + } + return (*addr != NULL ? 0 : errno); +} + +#else + +int _mi_prim_alloc_huge_os_pages(void* hint_addr, size_t size, int numa_node, bool* is_zero, void** addr) { + MI_UNUSED(hint_addr); MI_UNUSED(size); MI_UNUSED(numa_node); + *is_zero = false; + *addr = NULL; + return ENOMEM; +} + +#endif + +//--------------------------------------------- +// NUMA nodes +//--------------------------------------------- + +#if defined(__linux__) + +#include // snprintf + +size_t _mi_prim_numa_node(void) { + #if defined(MI_HAS_SYSCALL_H) && defined(SYS_getcpu) + unsigned long node = 0; + unsigned long ncpu = 0; + long err = syscall(SYS_getcpu, &ncpu, &node, NULL); + if (err != 0) return 0; + return node; + #else + return 0; + #endif +} + +size_t _mi_prim_numa_node_count(void) { + char buf[128]; + unsigned node = 0; + for(node = 0; node < 256; node++) { + // enumerate node entries -- todo: it there a more efficient way to do this? (but ensure there is no allocation) + snprintf(buf, 127, "/sys/devices/system/node/node%u", node + 1); + if (mi_prim_access(buf,R_OK) != 0) break; + } + return (node+1); +} + +#elif defined(__FreeBSD__) && __FreeBSD_version >= 1200000 + +size_t _mi_prim_numa_node(void) { + domainset_t dom; + size_t node; + int policy; + if (cpuset_getdomain(CPU_LEVEL_CPUSET, CPU_WHICH_PID, -1, sizeof(dom), &dom, &policy) == -1) return 0ul; + for (node = 0; node < MAXMEMDOM; node++) { + if (DOMAINSET_ISSET(node, &dom)) return node; + } + return 0ul; +} + +size_t _mi_prim_numa_node_count(void) { + size_t ndomains = 0; + size_t len = sizeof(ndomains); + if (sysctlbyname("vm.ndomains", &ndomains, &len, NULL, 0) == -1) return 0ul; + return ndomains; +} + +#elif defined(__DragonFly__) + +size_t _mi_prim_numa_node(void) { + // TODO: DragonFly does not seem to provide any userland means to get this information. + return 0ul; +} + +size_t _mi_prim_numa_node_count(void) { + size_t ncpus = 0, nvirtcoresperphys = 0; + size_t len = sizeof(size_t); + if (sysctlbyname("hw.ncpu", &ncpus, &len, NULL, 0) == -1) return 0ul; + if (sysctlbyname("hw.cpu_topology_ht_ids", &nvirtcoresperphys, &len, NULL, 0) == -1) return 0ul; + return nvirtcoresperphys * ncpus; +} + +#else + +size_t _mi_prim_numa_node(void) { + return 0; +} + +size_t _mi_prim_numa_node_count(void) { + return 1; +} + +#endif + +// ---------------------------------------------------------------- +// Clock +// ---------------------------------------------------------------- + +#include + +#if defined(CLOCK_REALTIME) || defined(CLOCK_MONOTONIC) + +mi_msecs_t _mi_prim_clock_now(void) { + struct timespec t; + #ifdef CLOCK_MONOTONIC + clock_gettime(CLOCK_MONOTONIC, &t); + #else + clock_gettime(CLOCK_REALTIME, &t); + #endif + return ((mi_msecs_t)t.tv_sec * 1000) + ((mi_msecs_t)t.tv_nsec / 1000000); +} + +#else + +// low resolution timer +mi_msecs_t _mi_prim_clock_now(void) { + #if !defined(CLOCKS_PER_SEC) || (CLOCKS_PER_SEC == 1000) || (CLOCKS_PER_SEC == 0) + return (mi_msecs_t)clock(); + #elif (CLOCKS_PER_SEC < 1000) + return (mi_msecs_t)clock() * (1000 / (mi_msecs_t)CLOCKS_PER_SEC); + #else + return (mi_msecs_t)clock() / ((mi_msecs_t)CLOCKS_PER_SEC / 1000); + #endif +} + +#endif + + + + +//---------------------------------------------------------------- +// Process info +//---------------------------------------------------------------- + +#if defined(__unix__) || defined(__unix) || defined(unix) || defined(__APPLE__) || defined(__HAIKU__) +#include +#include +#include + +#if defined(__APPLE__) +#include +#endif + +#if defined(__HAIKU__) +#include +#endif + +static mi_msecs_t timeval_secs(const struct timeval* tv) { + return ((mi_msecs_t)tv->tv_sec * 1000L) + ((mi_msecs_t)tv->tv_usec / 1000L); +} + +void _mi_prim_process_info(mi_process_info_t* pinfo) +{ + struct rusage rusage; + getrusage(RUSAGE_SELF, &rusage); + pinfo->utime = timeval_secs(&rusage.ru_utime); + pinfo->stime = timeval_secs(&rusage.ru_stime); +#if !defined(__HAIKU__) + pinfo->page_faults = rusage.ru_majflt; +#endif +#if defined(__HAIKU__) + // Haiku does not have (yet?) a way to + // get these stats per process + thread_info tid; + area_info mem; + ssize_t c; + get_thread_info(find_thread(0), &tid); + while (get_next_area_info(tid.team, &c, &mem) == B_OK) { + pinfo->peak_rss += mem.ram_size; + } + pinfo->page_faults = 0; +#elif defined(__APPLE__) + pinfo->peak_rss = rusage.ru_maxrss; // macos reports in bytes + #ifdef MACH_TASK_BASIC_INFO + struct mach_task_basic_info info; + mach_msg_type_number_t infoCount = MACH_TASK_BASIC_INFO_COUNT; + if (task_info(mach_task_self(), MACH_TASK_BASIC_INFO, (task_info_t)&info, &infoCount) == KERN_SUCCESS) { + pinfo->current_rss = (size_t)info.resident_size; + } + #else + struct task_basic_info info; + mach_msg_type_number_t infoCount = TASK_BASIC_INFO_COUNT; + if (task_info(mach_task_self(), TASK_BASIC_INFO, (task_info_t)&info, &infoCount) == KERN_SUCCESS) { + pinfo->current_rss = (size_t)info.resident_size; + } + #endif +#else + pinfo->peak_rss = rusage.ru_maxrss * 1024; // Linux/BSD report in KiB +#endif + // use defaults for commit +} + +#else + +#ifndef __wasi__ +// WebAssembly instances are not processes +#pragma message("define a way to get process info") +#endif + +void _mi_prim_process_info(mi_process_info_t* pinfo) +{ + // use defaults + MI_UNUSED(pinfo); +} + +#endif + + +//---------------------------------------------------------------- +// Output +//---------------------------------------------------------------- + +void _mi_prim_out_stderr( const char* msg ) { + fputs(msg,stderr); +} + + +//---------------------------------------------------------------- +// Environment +//---------------------------------------------------------------- + +#if !defined(MI_USE_ENVIRON) || (MI_USE_ENVIRON!=0) +// On Posix systemsr use `environ` to access environment variables +// even before the C runtime is initialized. +#if defined(__APPLE__) && defined(__has_include) && __has_include() +#include +static char** mi_get_environ(void) { + return (*_NSGetEnviron()); +} +#else +extern char** environ; +static char** mi_get_environ(void) { + return environ; +} +#endif +bool _mi_prim_getenv(const char* name, char* result, size_t result_size) { + if (name==NULL) return false; + const size_t len = _mi_strlen(name); + if (len == 0) return false; + char** env = mi_get_environ(); + if (env == NULL) return false; + // compare up to 10000 entries + for (int i = 0; i < 10000 && env[i] != NULL; i++) { + const char* s = env[i]; + if (_mi_strnicmp(name, s, len) == 0 && s[len] == '=') { // case insensitive + // found it + _mi_strlcpy(result, s + len + 1, result_size); + return true; + } + } + return false; +} +#else +// fallback: use standard C `getenv` but this cannot be used while initializing the C runtime +bool _mi_prim_getenv(const char* name, char* result, size_t result_size) { + // cannot call getenv() when still initializing the C runtime. + if (_mi_preloading()) return false; + const char* s = getenv(name); + if (s == NULL) { + // we check the upper case name too. + char buf[64+1]; + size_t len = _mi_strnlen(name,sizeof(buf)-1); + for (size_t i = 0; i < len; i++) { + buf[i] = _mi_toupper(name[i]); + } + buf[len] = 0; + s = getenv(buf); + } + if (s == NULL || _mi_strnlen(s,result_size) >= result_size) return false; + _mi_strlcpy(result, s, result_size); + return true; +} +#endif // !MI_USE_ENVIRON + + +//---------------------------------------------------------------- +// Random +//---------------------------------------------------------------- + +#if defined(__APPLE__) + +#include +#if defined(MAC_OS_X_VERSION_10_10) && MAC_OS_X_VERSION_MAX_ALLOWED >= MAC_OS_X_VERSION_10_10 +#include +#include +#endif +bool _mi_prim_random_buf(void* buf, size_t buf_len) { + #if defined(MAC_OS_X_VERSION_10_15) && MAC_OS_X_VERSION_MAX_ALLOWED >= MAC_OS_X_VERSION_10_15 + // We prefere CCRandomGenerateBytes as it returns an error code while arc4random_buf + // may fail silently on macOS. See PR #390, and + return (CCRandomGenerateBytes(buf, buf_len) == kCCSuccess); + #else + // fall back on older macOS + arc4random_buf(buf, buf_len); + return true; + #endif +} + +#elif defined(__ANDROID__) || defined(__DragonFly__) || \ + defined(__FreeBSD__) || defined(__NetBSD__) || defined(__OpenBSD__) || \ + defined(__sun) + +#include +bool _mi_prim_random_buf(void* buf, size_t buf_len) { + arc4random_buf(buf, buf_len); + return true; +} + +#elif defined(__linux__) || defined(__HAIKU__) + +#include +#include +#include +#include + +bool _mi_prim_random_buf(void* buf, size_t buf_len) { + // Modern Linux provides `getrandom` but different distributions either use `sys/random.h` or `linux/random.h` + // and for the latter the actual `getrandom` call is not always defined. + // (see ) + // We therefore use a syscall directly and fall back dynamically to /dev/urandom when needed. + #if defined(MI_HAS_SYSCALL_H) && defined(SYS_getrandom) + #ifndef GRND_NONBLOCK + #define GRND_NONBLOCK (1) + #endif + static _Atomic(uintptr_t) no_getrandom; // = 0 + if (mi_atomic_load_acquire(&no_getrandom)==0) { + ssize_t ret = syscall(SYS_getrandom, buf, buf_len, GRND_NONBLOCK); + if (ret >= 0) return (buf_len == (size_t)ret); + if (errno != ENOSYS) return false; + mi_atomic_store_release(&no_getrandom, (uintptr_t)1); // don't call again, and fall back to /dev/urandom + } + #endif + int flags = O_RDONLY; + #if defined(O_CLOEXEC) + flags |= O_CLOEXEC; + #endif + int fd = mi_prim_open("/dev/urandom", flags); + if (fd < 0) return false; + size_t count = 0; + while(count < buf_len) { + ssize_t ret = mi_prim_read(fd, (char*)buf + count, buf_len - count); + if (ret<=0) { + if (errno!=EAGAIN && errno!=EINTR) break; + } + else { + count += ret; + } + } + mi_prim_close(fd); + return (count==buf_len); +} + +#else + +bool _mi_prim_random_buf(void* buf, size_t buf_len) { + return false; +} + +#endif + + +//---------------------------------------------------------------- +// Thread init/done +//---------------------------------------------------------------- + +#if defined(MI_USE_PTHREADS) + +// use pthread local storage keys to detect thread ending +// (and used with MI_TLS_PTHREADS for the default heap) +pthread_key_t _mi_heap_default_key = (pthread_key_t)(-1); + +static void mi_pthread_done(void* value) { + if (value!=NULL) { + _mi_thread_done((mi_heap_t*)value); + } +} + +void _mi_prim_thread_init_auto_done(void) { + mi_assert_internal(_mi_heap_default_key == (pthread_key_t)(-1)); + pthread_key_create(&_mi_heap_default_key, &mi_pthread_done); +} + +void _mi_prim_thread_done_auto_done(void) { + // nothing to do +} + +void _mi_prim_thread_associate_default_heap(mi_heap_t* heap) { + if (_mi_heap_default_key != (pthread_key_t)(-1)) { // can happen during recursive invocation on freeBSD + pthread_setspecific(_mi_heap_default_key, heap); + } +} + +#else + +void _mi_prim_thread_init_auto_done(void) { + // nothing +} + +void _mi_prim_thread_done_auto_done(void) { + // nothing +} + +void _mi_prim_thread_associate_default_heap(mi_heap_t* heap) { + MI_UNUSED(heap); +} + +#endif diff --git a/src/prim/wasi/prim.c b/src/prim/wasi/prim.c new file mode 100644 index 0000000..50511f0 --- /dev/null +++ b/src/prim/wasi/prim.c @@ -0,0 +1,275 @@ +/* ---------------------------------------------------------------------------- +Copyright (c) 2018-2023, Microsoft Research, Daan Leijen +This is free software; you can redistribute it and/or modify it under the +terms of the MIT license. A copy of the license can be found in the file +"LICENSE" at the root of this distribution. +-----------------------------------------------------------------------------*/ + +// This file is included in `src/prim/prim.c` + +#include "mimalloc.h" +#include "mimalloc/internal.h" +#include "mimalloc/atomic.h" +#include "mimalloc/prim.h" + +//--------------------------------------------- +// Initialize +//--------------------------------------------- + +void _mi_prim_mem_init( mi_os_mem_config_t* config ) { + config->page_size = 64*MI_KiB; // WebAssembly has a fixed page size: 64KiB + config->alloc_granularity = 16; + config->has_overcommit = false; + config->must_free_whole = true; + config->has_virtual_reserve = false; +} + +//--------------------------------------------- +// Free +//--------------------------------------------- + +int _mi_prim_free(void* addr, size_t size ) { + MI_UNUSED(addr); MI_UNUSED(size); + // wasi heap cannot be shrunk + return 0; +} + + +//--------------------------------------------- +// Allocation: sbrk or memory_grow +//--------------------------------------------- + +#if defined(MI_USE_SBRK) + static void* mi_memory_grow( size_t size ) { + void* p = sbrk(size); + if (p == (void*)(-1)) return NULL; + #if !defined(__wasi__) // on wasi this is always zero initialized already (?) + memset(p,0,size); + #endif + return p; + } +#elif defined(__wasi__) + static void* mi_memory_grow( size_t size ) { + size_t base = (size > 0 ? __builtin_wasm_memory_grow(0,_mi_divide_up(size, _mi_os_page_size())) + : __builtin_wasm_memory_size(0)); + if (base == SIZE_MAX) return NULL; + return (void*)(base * _mi_os_page_size()); + } +#endif + +#if defined(MI_USE_PTHREADS) +static pthread_mutex_t mi_heap_grow_mutex = PTHREAD_MUTEX_INITIALIZER; +#endif + +static void* mi_prim_mem_grow(size_t size, size_t try_alignment) { + void* p = NULL; + if (try_alignment <= 1) { + // `sbrk` is not thread safe in general so try to protect it (we could skip this on WASM but leave it in for now) + #if defined(MI_USE_PTHREADS) + pthread_mutex_lock(&mi_heap_grow_mutex); + #endif + p = mi_memory_grow(size); + #if defined(MI_USE_PTHREADS) + pthread_mutex_unlock(&mi_heap_grow_mutex); + #endif + } + else { + void* base = NULL; + size_t alloc_size = 0; + // to allocate aligned use a lock to try to avoid thread interaction + // between getting the current size and actual allocation + // (also, `sbrk` is not thread safe in general) + #if defined(MI_USE_PTHREADS) + pthread_mutex_lock(&mi_heap_grow_mutex); + #endif + { + void* current = mi_memory_grow(0); // get current size + if (current != NULL) { + void* aligned_current = mi_align_up_ptr(current, try_alignment); // and align from there to minimize wasted space + alloc_size = _mi_align_up( ((uint8_t*)aligned_current - (uint8_t*)current) + size, _mi_os_page_size()); + base = mi_memory_grow(alloc_size); + } + } + #if defined(MI_USE_PTHREADS) + pthread_mutex_unlock(&mi_heap_grow_mutex); + #endif + if (base != NULL) { + p = mi_align_up_ptr(base, try_alignment); + if ((uint8_t*)p + size > (uint8_t*)base + alloc_size) { + // another thread used wasm_memory_grow/sbrk in-between and we do not have enough + // space after alignment. Give up (and waste the space as we cannot shrink :-( ) + // (in `mi_os_mem_alloc_aligned` this will fall back to overallocation to align) + p = NULL; + } + } + } + /* + if (p == NULL) { + _mi_warning_message("unable to allocate sbrk/wasm_memory_grow OS memory (%zu bytes, %zu alignment)\n", size, try_alignment); + errno = ENOMEM; + return NULL; + } + */ + mi_assert_internal( p == NULL || try_alignment == 0 || (uintptr_t)p % try_alignment == 0 ); + return p; +} + +// Note: the `try_alignment` is just a hint and the returned pointer is not guaranteed to be aligned. +int _mi_prim_alloc(size_t size, size_t try_alignment, bool commit, bool allow_large, bool* is_large, bool* is_zero, void** addr) { + MI_UNUSED(allow_large); MI_UNUSED(commit); + *is_large = false; + *is_zero = false; + *addr = mi_prim_mem_grow(size, try_alignment); + return (*addr != NULL ? 0 : ENOMEM); +} + + +//--------------------------------------------- +// Commit/Reset/Protect +//--------------------------------------------- + +int _mi_prim_commit(void* addr, size_t size, bool* is_zero) { + MI_UNUSED(addr); MI_UNUSED(size); + *is_zero = false; + return 0; +} + +int _mi_prim_decommit(void* addr, size_t size, bool* needs_recommit) { + MI_UNUSED(addr); MI_UNUSED(size); + *needs_recommit = false; + return 0; +} + +int _mi_prim_reset(void* addr, size_t size) { + MI_UNUSED(addr); MI_UNUSED(size); + return 0; +} + +int _mi_prim_protect(void* addr, size_t size, bool protect) { + MI_UNUSED(addr); MI_UNUSED(size); MI_UNUSED(protect); + return 0; +} + + +//--------------------------------------------- +// Huge pages and NUMA nodes +//--------------------------------------------- + +int _mi_prim_alloc_huge_os_pages(void* hint_addr, size_t size, int numa_node, bool* is_zero, void** addr) { + MI_UNUSED(hint_addr); MI_UNUSED(size); MI_UNUSED(numa_node); + *is_zero = true; + *addr = NULL; + return ENOSYS; +} + +size_t _mi_prim_numa_node(void) { + return 0; +} + +size_t _mi_prim_numa_node_count(void) { + return 1; +} + + +//---------------------------------------------------------------- +// Clock +//---------------------------------------------------------------- + +#include + +#if defined(CLOCK_REALTIME) || defined(CLOCK_MONOTONIC) + +mi_msecs_t _mi_prim_clock_now(void) { + struct timespec t; + #ifdef CLOCK_MONOTONIC + clock_gettime(CLOCK_MONOTONIC, &t); + #else + clock_gettime(CLOCK_REALTIME, &t); + #endif + return ((mi_msecs_t)t.tv_sec * 1000) + ((mi_msecs_t)t.tv_nsec / 1000000); +} + +#else + +// low resolution timer +mi_msecs_t _mi_prim_clock_now(void) { + #if !defined(CLOCKS_PER_SEC) || (CLOCKS_PER_SEC == 1000) || (CLOCKS_PER_SEC == 0) + return (mi_msecs_t)clock(); + #elif (CLOCKS_PER_SEC < 1000) + return (mi_msecs_t)clock() * (1000 / (mi_msecs_t)CLOCKS_PER_SEC); + #else + return (mi_msecs_t)clock() / ((mi_msecs_t)CLOCKS_PER_SEC / 1000); + #endif +} + +#endif + + +//---------------------------------------------------------------- +// Process info +//---------------------------------------------------------------- + +void _mi_prim_process_info(mi_process_info_t* pinfo) +{ + // use defaults + MI_UNUSED(pinfo); +} + + +//---------------------------------------------------------------- +// Output +//---------------------------------------------------------------- + +void _mi_prim_out_stderr( const char* msg ) { + fputs(msg,stderr); +} + + +//---------------------------------------------------------------- +// Environment +//---------------------------------------------------------------- + +bool _mi_prim_getenv(const char* name, char* result, size_t result_size) { + // cannot call getenv() when still initializing the C runtime. + if (_mi_preloading()) return false; + const char* s = getenv(name); + if (s == NULL) { + // we check the upper case name too. + char buf[64+1]; + size_t len = _mi_strnlen(name,sizeof(buf)-1); + for (size_t i = 0; i < len; i++) { + buf[i] = _mi_toupper(name[i]); + } + buf[len] = 0; + s = getenv(buf); + } + if (s == NULL || _mi_strnlen(s,result_size) >= result_size) return false; + _mi_strlcpy(result, s, result_size); + return true; +} + + +//---------------------------------------------------------------- +// Random +//---------------------------------------------------------------- + +bool _mi_prim_random_buf(void* buf, size_t buf_len) { + return false; +} + + +//---------------------------------------------------------------- +// Thread init/done +//---------------------------------------------------------------- + +void _mi_prim_thread_init_auto_done(void) { + // nothing +} + +void _mi_prim_thread_done_auto_done(void) { + // nothing +} + +void _mi_prim_thread_associate_default_heap(mi_heap_t* heap) { + MI_UNUSED(heap); +} diff --git a/src/prim/windows/etw-mimalloc.wprp b/src/prim/windows/etw-mimalloc.wprp new file mode 100644 index 0000000..b00cd7a --- /dev/null +++ b/src/prim/windows/etw-mimalloc.wprp @@ -0,0 +1,61 @@ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + diff --git a/src/prim/windows/etw.h b/src/prim/windows/etw.h new file mode 100644 index 0000000..4e0a092 --- /dev/null +++ b/src/prim/windows/etw.h @@ -0,0 +1,905 @@ +//**********************************************************************` +//* This is an include file generated by Message Compiler. *` +//* *` +//* Copyright (c) Microsoft Corporation. All Rights Reserved. *` +//**********************************************************************` +#pragma once + +//***************************************************************************** +// +// Notes on the ETW event code generated by MC: +// +// - Structures and arrays of structures are treated as an opaque binary blob. +// The caller is responsible for packing the data for the structure into a +// single region of memory, with no padding between values. The macro will +// have an extra parameter for the length of the blob. +// - Arrays of nul-terminated strings must be packed by the caller into a +// single binary blob containing the correct number of strings, with a nul +// after each string. The size of the blob is specified in characters, and +// includes the final nul. +// - Arrays of SID are treated as a single binary blob. The caller is +// responsible for packing the SID values into a single region of memory with +// no padding. +// - The length attribute on the data element in the manifest is significant +// for values with intype win:UnicodeString, win:AnsiString, or win:Binary. +// The length attribute must be specified for win:Binary, and is optional for +// win:UnicodeString and win:AnsiString (if no length is given, the strings +// are assumed to be nul-terminated). For win:UnicodeString, the length is +// measured in characters, not bytes. +// - For an array of win:UnicodeString, win:AnsiString, or win:Binary, the +// length attribute applies to every value in the array, so every value in +// the array must have the same length. The values in the array are provided +// to the macro via a single pointer -- the caller is responsible for packing +// all of the values into a single region of memory with no padding between +// values. +// - Values of type win:CountedUnicodeString, win:CountedAnsiString, and +// win:CountedBinary can be generated and collected on Vista or later. +// However, they may not decode properly without the Windows 10 2018 Fall +// Update. +// - Arrays of type win:CountedUnicodeString, win:CountedAnsiString, and +// win:CountedBinary must be packed by the caller into a single region of +// memory. The format for each item is a UINT16 byte-count followed by that +// many bytes of data. When providing the array to the generated macro, you +// must provide the total size of the packed array data, including the UINT16 +// sizes for each item. In the case of win:CountedUnicodeString, the data +// size is specified in WCHAR (16-bit) units. In the case of +// win:CountedAnsiString and win:CountedBinary, the data size is specified in +// bytes. +// +//***************************************************************************** + +#include +#include +#include + +#ifndef ETW_INLINE + #ifdef _ETW_KM_ + // In kernel mode, save stack space by never inlining templates. + #define ETW_INLINE DECLSPEC_NOINLINE __inline + #else + // In user mode, save code size by inlining templates as appropriate. + #define ETW_INLINE __inline + #endif +#endif // ETW_INLINE + +#if defined(__cplusplus) +extern "C" { +#endif + +// +// MCGEN_DISABLE_PROVIDER_CODE_GENERATION macro: +// Define this macro to have the compiler skip the generated functions in this +// header. +// +#ifndef MCGEN_DISABLE_PROVIDER_CODE_GENERATION + +// +// MCGEN_USE_KERNEL_MODE_APIS macro: +// Controls whether the generated code uses kernel-mode or user-mode APIs. +// - Set to 0 to use Windows user-mode APIs such as EventRegister. +// - Set to 1 to use Windows kernel-mode APIs such as EtwRegister. +// Default is based on whether the _ETW_KM_ macro is defined (i.e. by wdm.h). +// Note that the APIs can also be overridden directly, e.g. by setting the +// MCGEN_EVENTWRITETRANSFER or MCGEN_EVENTREGISTER macros. +// +#ifndef MCGEN_USE_KERNEL_MODE_APIS + #ifdef _ETW_KM_ + #define MCGEN_USE_KERNEL_MODE_APIS 1 + #else + #define MCGEN_USE_KERNEL_MODE_APIS 0 + #endif +#endif // MCGEN_USE_KERNEL_MODE_APIS + +// +// MCGEN_HAVE_EVENTSETINFORMATION macro: +// Controls how McGenEventSetInformation uses the EventSetInformation API. +// - Set to 0 to disable the use of EventSetInformation +// (McGenEventSetInformation will always return an error). +// - Set to 1 to directly invoke MCGEN_EVENTSETINFORMATION. +// - Set to 2 to to locate EventSetInformation at runtime via GetProcAddress +// (user-mode) or MmGetSystemRoutineAddress (kernel-mode). +// Default is determined as follows: +// - If MCGEN_EVENTSETINFORMATION has been customized, set to 1 +// (i.e. use MCGEN_EVENTSETINFORMATION). +// - Else if the target OS version has EventSetInformation, set to 1 +// (i.e. use MCGEN_EVENTSETINFORMATION). +// - Else set to 2 (i.e. try to dynamically locate EventSetInformation). +// Note that an McGenEventSetInformation function will only be generated if one +// or more provider in a manifest has provider traits. +// +#ifndef MCGEN_HAVE_EVENTSETINFORMATION + #ifdef MCGEN_EVENTSETINFORMATION // if MCGEN_EVENTSETINFORMATION has been customized, + #define MCGEN_HAVE_EVENTSETINFORMATION 1 // directly invoke MCGEN_EVENTSETINFORMATION(...). + #elif MCGEN_USE_KERNEL_MODE_APIS // else if using kernel-mode APIs, + #if NTDDI_VERSION >= 0x06040000 // if target OS is Windows 10 or later, + #define MCGEN_HAVE_EVENTSETINFORMATION 1 // directly invoke MCGEN_EVENTSETINFORMATION(...). + #else // else + #define MCGEN_HAVE_EVENTSETINFORMATION 2 // find "EtwSetInformation" via MmGetSystemRoutineAddress. + #endif // else (using user-mode APIs) + #else // if target OS and SDK is Windows 8 or later, + #if WINVER >= 0x0602 && defined(EVENT_FILTER_TYPE_SCHEMATIZED) + #define MCGEN_HAVE_EVENTSETINFORMATION 1 // directly invoke MCGEN_EVENTSETINFORMATION(...). + #else // else + #define MCGEN_HAVE_EVENTSETINFORMATION 2 // find "EventSetInformation" via GetModuleHandleExW/GetProcAddress. + #endif + #endif +#endif // MCGEN_HAVE_EVENTSETINFORMATION + +// +// MCGEN Override Macros +// +// The following override macros may be defined before including this header +// to control the APIs used by this header: +// +// - MCGEN_EVENTREGISTER +// - MCGEN_EVENTUNREGISTER +// - MCGEN_EVENTSETINFORMATION +// - MCGEN_EVENTWRITETRANSFER +// +// If the the macro is undefined, the MC implementation will default to the +// corresponding ETW APIs. For example, if the MCGEN_EVENTREGISTER macro is +// undefined, the EventRegister[MyProviderName] macro will use EventRegister +// in user mode and will use EtwRegister in kernel mode. +// +// To prevent issues from conflicting definitions of these macros, the value +// of the override macro will be used as a suffix in certain internal function +// names. Because of this, the override macros must follow certain rules: +// +// - The macro must be defined before any MC-generated header is included and +// must not be undefined or redefined after any MC-generated header is +// included. Different translation units (i.e. different .c or .cpp files) +// may set the macros to different values, but within a translation unit +// (within a single .c or .cpp file), the macro must be set once and not +// changed. +// - The override must be an object-like macro, not a function-like macro +// (i.e. the override macro must not have a parameter list). +// - The override macro's value must be a simple identifier, i.e. must be +// something that starts with a letter or '_' and contains only letters, +// numbers, and '_' characters. +// - If the override macro's value is the name of a second object-like macro, +// the second object-like macro must follow the same rules. (The override +// macro's value can also be the name of a function-like macro, in which +// case the function-like macro does not need to follow the same rules.) +// +// For example, the following will cause compile errors: +// +// #define MCGEN_EVENTWRITETRANSFER MyNamespace::MyClass::MyFunction // Value has non-identifier characters (colon). +// #define MCGEN_EVENTWRITETRANSFER GetEventWriteFunctionPointer(7) // Value has non-identifier characters (parentheses). +// #define MCGEN_EVENTWRITETRANSFER(h,e,a,r,c,d) EventWrite(h,e,c,d) // Override is defined as a function-like macro. +// #define MY_OBJECT_LIKE_MACRO MyNamespace::MyClass::MyEventWriteFunction +// #define MCGEN_EVENTWRITETRANSFER MY_OBJECT_LIKE_MACRO // Evaluates to something with non-identifier characters (colon). +// +// The following would be ok: +// +// #define MCGEN_EVENTWRITETRANSFER MyEventWriteFunction1 // OK, suffix will be "MyEventWriteFunction1". +// #define MY_OBJECT_LIKE_MACRO MyEventWriteFunction2 +// #define MCGEN_EVENTWRITETRANSFER MY_OBJECT_LIKE_MACRO // OK, suffix will be "MyEventWriteFunction2". +// #define MY_FUNCTION_LIKE_MACRO(h,e,a,r,c,d) MyNamespace::MyClass::MyEventWriteFunction3(h,e,c,d) +// #define MCGEN_EVENTWRITETRANSFER MY_FUNCTION_LIKE_MACRO // OK, suffix will be "MY_FUNCTION_LIKE_MACRO". +// +#ifndef MCGEN_EVENTREGISTER + #if MCGEN_USE_KERNEL_MODE_APIS + #define MCGEN_EVENTREGISTER EtwRegister + #else + #define MCGEN_EVENTREGISTER EventRegister + #endif +#endif // MCGEN_EVENTREGISTER +#ifndef MCGEN_EVENTUNREGISTER + #if MCGEN_USE_KERNEL_MODE_APIS + #define MCGEN_EVENTUNREGISTER EtwUnregister + #else + #define MCGEN_EVENTUNREGISTER EventUnregister + #endif +#endif // MCGEN_EVENTUNREGISTER +#ifndef MCGEN_EVENTSETINFORMATION + #if MCGEN_USE_KERNEL_MODE_APIS + #define MCGEN_EVENTSETINFORMATION EtwSetInformation + #else + #define MCGEN_EVENTSETINFORMATION EventSetInformation + #endif +#endif // MCGEN_EVENTSETINFORMATION +#ifndef MCGEN_EVENTWRITETRANSFER + #if MCGEN_USE_KERNEL_MODE_APIS + #define MCGEN_EVENTWRITETRANSFER EtwWriteTransfer + #else + #define MCGEN_EVENTWRITETRANSFER EventWriteTransfer + #endif +#endif // MCGEN_EVENTWRITETRANSFER + +// +// MCGEN_EVENT_ENABLED macro: +// Override to control how the EventWrite[EventName] macros determine whether +// an event is enabled. The default behavior is for EventWrite[EventName] to +// use the EventEnabled[EventName] macros. +// +#ifndef MCGEN_EVENT_ENABLED +#define MCGEN_EVENT_ENABLED(EventName) EventEnabled##EventName() +#endif + +// +// MCGEN_EVENT_ENABLED_FORCONTEXT macro: +// Override to control how the EventWrite[EventName]_ForContext macros +// determine whether an event is enabled. The default behavior is for +// EventWrite[EventName]_ForContext to use the +// EventEnabled[EventName]_ForContext macros. +// +#ifndef MCGEN_EVENT_ENABLED_FORCONTEXT +#define MCGEN_EVENT_ENABLED_FORCONTEXT(pContext, EventName) EventEnabled##EventName##_ForContext(pContext) +#endif + +// +// MCGEN_ENABLE_CHECK macro: +// Determines whether the specified event would be considered as enabled +// based on the state of the specified context. Slightly faster than calling +// McGenEventEnabled directly. +// +#ifndef MCGEN_ENABLE_CHECK +#define MCGEN_ENABLE_CHECK(Context, Descriptor) (Context.IsEnabled && McGenEventEnabled(&Context, &Descriptor)) +#endif + +#if !defined(MCGEN_TRACE_CONTEXT_DEF) +#define MCGEN_TRACE_CONTEXT_DEF +// This structure is for use by MC-generated code and should not be used directly. +typedef struct _MCGEN_TRACE_CONTEXT +{ + TRACEHANDLE RegistrationHandle; + TRACEHANDLE Logger; // Used as pointer to provider traits. + ULONGLONG MatchAnyKeyword; + ULONGLONG MatchAllKeyword; + ULONG Flags; + ULONG IsEnabled; + UCHAR Level; + UCHAR Reserve; + USHORT EnableBitsCount; + PULONG EnableBitMask; + const ULONGLONG* EnableKeyWords; + const UCHAR* EnableLevel; +} MCGEN_TRACE_CONTEXT, *PMCGEN_TRACE_CONTEXT; +#endif // MCGEN_TRACE_CONTEXT_DEF + +#if !defined(MCGEN_LEVEL_KEYWORD_ENABLED_DEF) +#define MCGEN_LEVEL_KEYWORD_ENABLED_DEF +// +// Determines whether an event with a given Level and Keyword would be +// considered as enabled based on the state of the specified context. +// Note that you may want to use MCGEN_ENABLE_CHECK instead of calling this +// function directly. +// +FORCEINLINE +BOOLEAN +McGenLevelKeywordEnabled( + _In_ PMCGEN_TRACE_CONTEXT EnableInfo, + _In_ UCHAR Level, + _In_ ULONGLONG Keyword + ) +{ + // + // Check if the event Level is lower than the level at which + // the channel is enabled. + // If the event Level is 0 or the channel is enabled at level 0, + // all levels are enabled. + // + + if ((Level <= EnableInfo->Level) || // This also covers the case of Level == 0. + (EnableInfo->Level == 0)) { + + // + // Check if Keyword is enabled + // + + if ((Keyword == (ULONGLONG)0) || + ((Keyword & EnableInfo->MatchAnyKeyword) && + ((Keyword & EnableInfo->MatchAllKeyword) == EnableInfo->MatchAllKeyword))) { + return TRUE; + } + } + + return FALSE; +} +#endif // MCGEN_LEVEL_KEYWORD_ENABLED_DEF + +#if !defined(MCGEN_EVENT_ENABLED_DEF) +#define MCGEN_EVENT_ENABLED_DEF +// +// Determines whether the specified event would be considered as enabled based +// on the state of the specified context. Note that you may want to use +// MCGEN_ENABLE_CHECK instead of calling this function directly. +// +FORCEINLINE +BOOLEAN +McGenEventEnabled( + _In_ PMCGEN_TRACE_CONTEXT EnableInfo, + _In_ PCEVENT_DESCRIPTOR EventDescriptor + ) +{ + return McGenLevelKeywordEnabled(EnableInfo, EventDescriptor->Level, EventDescriptor->Keyword); +} +#endif // MCGEN_EVENT_ENABLED_DEF + +#if !defined(MCGEN_CONTROL_CALLBACK) +#define MCGEN_CONTROL_CALLBACK + +// This function is for use by MC-generated code and should not be used directly. +DECLSPEC_NOINLINE __inline +VOID +__stdcall +McGenControlCallbackV2( + _In_ LPCGUID SourceId, + _In_ ULONG ControlCode, + _In_ UCHAR Level, + _In_ ULONGLONG MatchAnyKeyword, + _In_ ULONGLONG MatchAllKeyword, + _In_opt_ PEVENT_FILTER_DESCRIPTOR FilterData, + _Inout_opt_ PVOID CallbackContext + ) +/*++ + +Routine Description: + + This is the notification callback for Windows Vista and later. + +Arguments: + + SourceId - The GUID that identifies the session that enabled the provider. + + ControlCode - The parameter indicates whether the provider + is being enabled or disabled. + + Level - The level at which the event is enabled. + + MatchAnyKeyword - The bitmask of keywords that the provider uses to + determine the category of events that it writes. + + MatchAllKeyword - This bitmask additionally restricts the category + of events that the provider writes. + + FilterData - The provider-defined data. + + CallbackContext - The context of the callback that is defined when the provider + called EtwRegister to register itself. + +Remarks: + + ETW calls this function to notify provider of enable/disable + +--*/ +{ + PMCGEN_TRACE_CONTEXT Ctx = (PMCGEN_TRACE_CONTEXT)CallbackContext; + ULONG Ix; +#ifndef MCGEN_PRIVATE_ENABLE_CALLBACK_V2 + UNREFERENCED_PARAMETER(SourceId); + UNREFERENCED_PARAMETER(FilterData); +#endif + + if (Ctx == NULL) { + return; + } + + switch (ControlCode) { + + case EVENT_CONTROL_CODE_ENABLE_PROVIDER: + Ctx->Level = Level; + Ctx->MatchAnyKeyword = MatchAnyKeyword; + Ctx->MatchAllKeyword = MatchAllKeyword; + Ctx->IsEnabled = EVENT_CONTROL_CODE_ENABLE_PROVIDER; + + for (Ix = 0; Ix < Ctx->EnableBitsCount; Ix += 1) { + if (McGenLevelKeywordEnabled(Ctx, Ctx->EnableLevel[Ix], Ctx->EnableKeyWords[Ix]) != FALSE) { + Ctx->EnableBitMask[Ix >> 5] |= (1 << (Ix % 32)); + } else { + Ctx->EnableBitMask[Ix >> 5] &= ~(1 << (Ix % 32)); + } + } + break; + + case EVENT_CONTROL_CODE_DISABLE_PROVIDER: + Ctx->IsEnabled = EVENT_CONTROL_CODE_DISABLE_PROVIDER; + Ctx->Level = 0; + Ctx->MatchAnyKeyword = 0; + Ctx->MatchAllKeyword = 0; + if (Ctx->EnableBitsCount > 0) { +#pragma warning(suppress: 26451) // Arithmetic overflow cannot occur, no matter the value of EnableBitCount + RtlZeroMemory(Ctx->EnableBitMask, (((Ctx->EnableBitsCount - 1) / 32) + 1) * sizeof(ULONG)); + } + break; + + default: + break; + } + +#ifdef MCGEN_PRIVATE_ENABLE_CALLBACK_V2 + // + // Call user defined callback + // + MCGEN_PRIVATE_ENABLE_CALLBACK_V2( + SourceId, + ControlCode, + Level, + MatchAnyKeyword, + MatchAllKeyword, + FilterData, + CallbackContext + ); +#endif // MCGEN_PRIVATE_ENABLE_CALLBACK_V2 + + return; +} + +#endif // MCGEN_CONTROL_CALLBACK + +#ifndef _mcgen_PENABLECALLBACK + #if MCGEN_USE_KERNEL_MODE_APIS + #define _mcgen_PENABLECALLBACK PETWENABLECALLBACK + #else + #define _mcgen_PENABLECALLBACK PENABLECALLBACK + #endif +#endif // _mcgen_PENABLECALLBACK + +#if !defined(_mcgen_PASTE2) +// This macro is for use by MC-generated code and should not be used directly. +#define _mcgen_PASTE2(a, b) _mcgen_PASTE2_imp(a, b) +#define _mcgen_PASTE2_imp(a, b) a##b +#endif // _mcgen_PASTE2 + +#if !defined(_mcgen_PASTE3) +// This macro is for use by MC-generated code and should not be used directly. +#define _mcgen_PASTE3(a, b, c) _mcgen_PASTE3_imp(a, b, c) +#define _mcgen_PASTE3_imp(a, b, c) a##b##_##c +#endif // _mcgen_PASTE3 + +// +// Macro validation +// + +// Validate MCGEN_EVENTREGISTER: + +// Trigger an error if MCGEN_EVENTREGISTER is not an unqualified (simple) identifier: +struct _mcgen_PASTE2(MCGEN_EVENTREGISTER_definition_must_be_an_unqualified_identifier_, MCGEN_EVENTREGISTER); + +// Trigger an error if MCGEN_EVENTREGISTER is redefined: +typedef struct _mcgen_PASTE2(MCGEN_EVENTREGISTER_definition_must_be_an_unqualified_identifier_, MCGEN_EVENTREGISTER) + MCGEN_EVENTREGISTER_must_not_be_redefined_between_headers; + +// Trigger an error if MCGEN_EVENTREGISTER is defined as a function-like macro: +typedef void MCGEN_EVENTREGISTER_must_not_be_a_functionLike_macro_MCGEN_EVENTREGISTER; +typedef int _mcgen_PASTE2(MCGEN_EVENTREGISTER_must_not_be_a_functionLike_macro_, MCGEN_EVENTREGISTER); + +// Validate MCGEN_EVENTUNREGISTER: + +// Trigger an error if MCGEN_EVENTUNREGISTER is not an unqualified (simple) identifier: +struct _mcgen_PASTE2(MCGEN_EVENTUNREGISTER_definition_must_be_an_unqualified_identifier_, MCGEN_EVENTUNREGISTER); + +// Trigger an error if MCGEN_EVENTUNREGISTER is redefined: +typedef struct _mcgen_PASTE2(MCGEN_EVENTUNREGISTER_definition_must_be_an_unqualified_identifier_, MCGEN_EVENTUNREGISTER) + MCGEN_EVENTUNREGISTER_must_not_be_redefined_between_headers; + +// Trigger an error if MCGEN_EVENTUNREGISTER is defined as a function-like macro: +typedef void MCGEN_EVENTUNREGISTER_must_not_be_a_functionLike_macro_MCGEN_EVENTUNREGISTER; +typedef int _mcgen_PASTE2(MCGEN_EVENTUNREGISTER_must_not_be_a_functionLike_macro_, MCGEN_EVENTUNREGISTER); + +// Validate MCGEN_EVENTSETINFORMATION: + +// Trigger an error if MCGEN_EVENTSETINFORMATION is not an unqualified (simple) identifier: +struct _mcgen_PASTE2(MCGEN_EVENTSETINFORMATION_definition_must_be_an_unqualified_identifier_, MCGEN_EVENTSETINFORMATION); + +// Trigger an error if MCGEN_EVENTSETINFORMATION is redefined: +typedef struct _mcgen_PASTE2(MCGEN_EVENTSETINFORMATION_definition_must_be_an_unqualified_identifier_, MCGEN_EVENTSETINFORMATION) + MCGEN_EVENTSETINFORMATION_must_not_be_redefined_between_headers; + +// Trigger an error if MCGEN_EVENTSETINFORMATION is defined as a function-like macro: +typedef void MCGEN_EVENTSETINFORMATION_must_not_be_a_functionLike_macro_MCGEN_EVENTSETINFORMATION; +typedef int _mcgen_PASTE2(MCGEN_EVENTSETINFORMATION_must_not_be_a_functionLike_macro_, MCGEN_EVENTSETINFORMATION); + +// Validate MCGEN_EVENTWRITETRANSFER: + +// Trigger an error if MCGEN_EVENTWRITETRANSFER is not an unqualified (simple) identifier: +struct _mcgen_PASTE2(MCGEN_EVENTWRITETRANSFER_definition_must_be_an_unqualified_identifier_, MCGEN_EVENTWRITETRANSFER); + +// Trigger an error if MCGEN_EVENTWRITETRANSFER is redefined: +typedef struct _mcgen_PASTE2(MCGEN_EVENTWRITETRANSFER_definition_must_be_an_unqualified_identifier_, MCGEN_EVENTWRITETRANSFER) + MCGEN_EVENTWRITETRANSFER_must_not_be_redefined_between_headers;; + +// Trigger an error if MCGEN_EVENTWRITETRANSFER is defined as a function-like macro: +typedef void MCGEN_EVENTWRITETRANSFER_must_not_be_a_functionLike_macro_MCGEN_EVENTWRITETRANSFER; +typedef int _mcgen_PASTE2(MCGEN_EVENTWRITETRANSFER_must_not_be_a_functionLike_macro_, MCGEN_EVENTWRITETRANSFER); + +#ifndef McGenEventWrite_def +#define McGenEventWrite_def + +// This macro is for use by MC-generated code and should not be used directly. +#define McGenEventWrite _mcgen_PASTE2(McGenEventWrite_, MCGEN_EVENTWRITETRANSFER) + +// This function is for use by MC-generated code and should not be used directly. +DECLSPEC_NOINLINE __inline +ULONG __stdcall +McGenEventWrite( + _In_ PMCGEN_TRACE_CONTEXT Context, + _In_ PCEVENT_DESCRIPTOR Descriptor, + _In_opt_ LPCGUID ActivityId, + _In_range_(1, 128) ULONG EventDataCount, + _Pre_cap_(EventDataCount) EVENT_DATA_DESCRIPTOR* EventData + ) +{ + const USHORT UNALIGNED* Traits; + + // Some customized MCGEN_EVENTWRITETRANSFER macros might ignore ActivityId. + UNREFERENCED_PARAMETER(ActivityId); + + Traits = (const USHORT UNALIGNED*)(UINT_PTR)Context->Logger; + + if (Traits == NULL) { + EventData[0].Ptr = 0; + EventData[0].Size = 0; + EventData[0].Reserved = 0; + } else { + EventData[0].Ptr = (ULONG_PTR)Traits; + EventData[0].Size = *Traits; + EventData[0].Reserved = 2; // EVENT_DATA_DESCRIPTOR_TYPE_PROVIDER_METADATA + } + + return MCGEN_EVENTWRITETRANSFER( + Context->RegistrationHandle, + Descriptor, + ActivityId, + NULL, + EventDataCount, + EventData); +} +#endif // McGenEventWrite_def + +#if !defined(McGenEventRegisterUnregister) +#define McGenEventRegisterUnregister + +// This macro is for use by MC-generated code and should not be used directly. +#define McGenEventRegister _mcgen_PASTE2(McGenEventRegister_, MCGEN_EVENTREGISTER) + +#pragma warning(push) +#pragma warning(disable:6103) +// This function is for use by MC-generated code and should not be used directly. +DECLSPEC_NOINLINE __inline +ULONG __stdcall +McGenEventRegister( + _In_ LPCGUID ProviderId, + _In_opt_ _mcgen_PENABLECALLBACK EnableCallback, + _In_opt_ PVOID CallbackContext, + _Inout_ PREGHANDLE RegHandle + ) +/*++ + +Routine Description: + + This function registers the provider with ETW. + +Arguments: + + ProviderId - Provider ID to register with ETW. + + EnableCallback - Callback to be used. + + CallbackContext - Context for the callback. + + RegHandle - Pointer to registration handle. + +Remarks: + + Should not be called if the provider is already registered (i.e. should not + be called if *RegHandle != 0). Repeatedly registering a provider is a bug + and may indicate a race condition. However, for compatibility with previous + behavior, this function will return SUCCESS in this case. + +--*/ +{ + ULONG Error; + + if (*RegHandle != 0) + { + Error = 0; // ERROR_SUCCESS + } + else + { + Error = MCGEN_EVENTREGISTER(ProviderId, EnableCallback, CallbackContext, RegHandle); + } + + return Error; +} +#pragma warning(pop) + +// This macro is for use by MC-generated code and should not be used directly. +#define McGenEventUnregister _mcgen_PASTE2(McGenEventUnregister_, MCGEN_EVENTUNREGISTER) + +// This function is for use by MC-generated code and should not be used directly. +DECLSPEC_NOINLINE __inline +ULONG __stdcall +McGenEventUnregister(_Inout_ PREGHANDLE RegHandle) +/*++ + +Routine Description: + + Unregister from ETW and set *RegHandle = 0. + +Arguments: + + RegHandle - the pointer to the provider registration handle + +Remarks: + + If provider has not been registered (i.e. if *RegHandle == 0), + return SUCCESS. It is safe to call McGenEventUnregister even if the + call to McGenEventRegister returned an error. + +--*/ +{ + ULONG Error; + + if(*RegHandle == 0) + { + Error = 0; // ERROR_SUCCESS + } + else + { + Error = MCGEN_EVENTUNREGISTER(*RegHandle); + *RegHandle = (REGHANDLE)0; + } + + return Error; +} + +#endif // McGenEventRegisterUnregister + +#ifndef _mcgen_EVENT_BIT_SET + #if defined(_M_IX86) || defined(_M_X64) + // This macro is for use by MC-generated code and should not be used directly. + #define _mcgen_EVENT_BIT_SET(EnableBits, BitPosition) ((((const unsigned char*)EnableBits)[BitPosition >> 3] & (1u << (BitPosition & 7))) != 0) + #else // CPU type + // This macro is for use by MC-generated code and should not be used directly. + #define _mcgen_EVENT_BIT_SET(EnableBits, BitPosition) ((EnableBits[BitPosition >> 5] & (1u << (BitPosition & 31))) != 0) + #endif // CPU type +#endif // _mcgen_EVENT_BIT_SET + +#endif // MCGEN_DISABLE_PROVIDER_CODE_GENERATION + +//+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ +// Provider "microsoft-windows-mimalloc" event count 2 +//+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ + +// Provider GUID = 138f4dbb-ee04-4899-aa0a-572ad4475779 +EXTERN_C __declspec(selectany) const GUID ETW_MI_Provider = {0x138f4dbb, 0xee04, 0x4899, {0xaa, 0x0a, 0x57, 0x2a, 0xd4, 0x47, 0x57, 0x79}}; + +#ifndef ETW_MI_Provider_Traits +#define ETW_MI_Provider_Traits NULL +#endif // ETW_MI_Provider_Traits + +// +// Event Descriptors +// +EXTERN_C __declspec(selectany) const EVENT_DESCRIPTOR ETW_MI_ALLOC = {0x64, 0x1, 0x0, 0x4, 0x0, 0x0, 0x0}; +#define ETW_MI_ALLOC_value 0x64 +EXTERN_C __declspec(selectany) const EVENT_DESCRIPTOR ETW_MI_FREE = {0x65, 0x1, 0x0, 0x4, 0x0, 0x0, 0x0}; +#define ETW_MI_FREE_value 0x65 + +// +// MCGEN_DISABLE_PROVIDER_CODE_GENERATION macro: +// Define this macro to have the compiler skip the generated functions in this +// header. +// +#ifndef MCGEN_DISABLE_PROVIDER_CODE_GENERATION + +// +// Event Enablement Bits +// These variables are for use by MC-generated code and should not be used directly. +// +EXTERN_C __declspec(selectany) DECLSPEC_CACHEALIGN ULONG microsoft_windows_mimallocEnableBits[1]; +EXTERN_C __declspec(selectany) const ULONGLONG microsoft_windows_mimallocKeywords[1] = {0x0}; +EXTERN_C __declspec(selectany) const unsigned char microsoft_windows_mimallocLevels[1] = {4}; + +// +// Provider context +// +EXTERN_C __declspec(selectany) MCGEN_TRACE_CONTEXT ETW_MI_Provider_Context = {0, (ULONG_PTR)ETW_MI_Provider_Traits, 0, 0, 0, 0, 0, 0, 1, microsoft_windows_mimallocEnableBits, microsoft_windows_mimallocKeywords, microsoft_windows_mimallocLevels}; + +// +// Provider REGHANDLE +// +#define microsoft_windows_mimallocHandle (ETW_MI_Provider_Context.RegistrationHandle) + +// +// This macro is set to 0, indicating that the EventWrite[Name] macros do not +// have an Activity parameter. This is controlled by the -km and -um options. +// +#define ETW_MI_Provider_EventWriteActivity 0 + +// +// Register with ETW using the control GUID specified in the manifest. +// Invoke this macro during module initialization (i.e. program startup, +// DLL process attach, or driver load) to initialize the provider. +// Note that if this function returns an error, the error means that +// will not work, but no action needs to be taken -- even if EventRegister +// returns an error, it is generally safe to use EventWrite and +// EventUnregister macros (they will be no-ops if EventRegister failed). +// +#ifndef EventRegistermicrosoft_windows_mimalloc +#define EventRegistermicrosoft_windows_mimalloc() McGenEventRegister(&ETW_MI_Provider, McGenControlCallbackV2, &ETW_MI_Provider_Context, µsoft_windows_mimallocHandle) +#endif + +// +// Register with ETW using a specific control GUID (i.e. a GUID other than what +// is specified in the manifest). Advanced scenarios only. +// +#ifndef EventRegisterByGuidmicrosoft_windows_mimalloc +#define EventRegisterByGuidmicrosoft_windows_mimalloc(Guid) McGenEventRegister(&(Guid), McGenControlCallbackV2, &ETW_MI_Provider_Context, µsoft_windows_mimallocHandle) +#endif + +// +// Unregister with ETW and close the provider. +// Invoke this macro during module shutdown (i.e. program exit, DLL process +// detach, or driver unload) to unregister the provider. +// Note that you MUST call EventUnregister before DLL or driver unload +// (not optional): failure to unregister a provider before DLL or driver unload +// will result in crashes. +// +#ifndef EventUnregistermicrosoft_windows_mimalloc +#define EventUnregistermicrosoft_windows_mimalloc() McGenEventUnregister(µsoft_windows_mimallocHandle) +#endif + +// +// MCGEN_ENABLE_FORCONTEXT_CODE_GENERATION macro: +// Define this macro to enable support for caller-allocated provider context. +// +#ifdef MCGEN_ENABLE_FORCONTEXT_CODE_GENERATION + +// +// Advanced scenarios: Caller-allocated provider context. +// Use when multiple differently-configured provider handles are needed, +// e.g. for container-aware drivers, one context per container. +// +// Usage: +// +// - Caller enables the feature before including this header, e.g. +// #define MCGEN_ENABLE_FORCONTEXT_CODE_GENERATION 1 +// - Caller allocates memory, e.g. pContext = malloc(sizeof(McGenContext_microsoft_windows_mimalloc)); +// - Caller registers the provider, e.g. EventRegistermicrosoft_windows_mimalloc_ForContext(pContext); +// - Caller writes events, e.g. EventWriteMyEvent_ForContext(pContext, ...); +// - Caller unregisters, e.g. EventUnregistermicrosoft_windows_mimalloc_ForContext(pContext); +// - Caller frees memory, e.g. free(pContext); +// + +typedef struct tagMcGenContext_microsoft_windows_mimalloc { + // The fields of this structure are subject to change and should + // not be accessed directly. To access the provider's REGHANDLE, + // use microsoft_windows_mimallocHandle_ForContext(pContext). + MCGEN_TRACE_CONTEXT Context; + ULONG EnableBits[1]; +} McGenContext_microsoft_windows_mimalloc; + +#define EventRegistermicrosoft_windows_mimalloc_ForContext(pContext) _mcgen_PASTE2(_mcgen_RegisterForContext_microsoft_windows_mimalloc_, MCGEN_EVENTREGISTER)(&ETW_MI_Provider, pContext) +#define EventRegisterByGuidmicrosoft_windows_mimalloc_ForContext(Guid, pContext) _mcgen_PASTE2(_mcgen_RegisterForContext_microsoft_windows_mimalloc_, MCGEN_EVENTREGISTER)(&(Guid), pContext) +#define EventUnregistermicrosoft_windows_mimalloc_ForContext(pContext) McGenEventUnregister(&(pContext)->Context.RegistrationHandle) + +// +// Provider REGHANDLE for caller-allocated context. +// +#define microsoft_windows_mimallocHandle_ForContext(pContext) ((pContext)->Context.RegistrationHandle) + +// This function is for use by MC-generated code and should not be used directly. +// Initialize and register the caller-allocated context. +__inline +ULONG __stdcall +_mcgen_PASTE2(_mcgen_RegisterForContext_microsoft_windows_mimalloc_, MCGEN_EVENTREGISTER)( + _In_ LPCGUID pProviderId, + _Out_ McGenContext_microsoft_windows_mimalloc* pContext) +{ + RtlZeroMemory(pContext, sizeof(*pContext)); + pContext->Context.Logger = (ULONG_PTR)ETW_MI_Provider_Traits; + pContext->Context.EnableBitsCount = 1; + pContext->Context.EnableBitMask = pContext->EnableBits; + pContext->Context.EnableKeyWords = microsoft_windows_mimallocKeywords; + pContext->Context.EnableLevel = microsoft_windows_mimallocLevels; + return McGenEventRegister( + pProviderId, + McGenControlCallbackV2, + &pContext->Context, + &pContext->Context.RegistrationHandle); +} + +// This function is for use by MC-generated code and should not be used directly. +// Trigger a compile error if called with the wrong parameter type. +FORCEINLINE +_Ret_ McGenContext_microsoft_windows_mimalloc* +_mcgen_CheckContextType_microsoft_windows_mimalloc(_In_ McGenContext_microsoft_windows_mimalloc* pContext) +{ + return pContext; +} + +#endif // MCGEN_ENABLE_FORCONTEXT_CODE_GENERATION + +// +// Enablement check macro for event "ETW_MI_ALLOC" +// +#define EventEnabledETW_MI_ALLOC() _mcgen_EVENT_BIT_SET(microsoft_windows_mimallocEnableBits, 0) +#define EventEnabledETW_MI_ALLOC_ForContext(pContext) _mcgen_EVENT_BIT_SET(_mcgen_CheckContextType_microsoft_windows_mimalloc(pContext)->EnableBits, 0) + +// +// Event write macros for event "ETW_MI_ALLOC" +// +#define EventWriteETW_MI_ALLOC(Address, Size) \ + MCGEN_EVENT_ENABLED(ETW_MI_ALLOC) \ + ? _mcgen_TEMPLATE_FOR_ETW_MI_ALLOC(&ETW_MI_Provider_Context, &ETW_MI_ALLOC, Address, Size) : 0 +#define EventWriteETW_MI_ALLOC_AssumeEnabled(Address, Size) \ + _mcgen_TEMPLATE_FOR_ETW_MI_ALLOC(&ETW_MI_Provider_Context, &ETW_MI_ALLOC, Address, Size) +#define EventWriteETW_MI_ALLOC_ForContext(pContext, Address, Size) \ + MCGEN_EVENT_ENABLED_FORCONTEXT(pContext, ETW_MI_ALLOC) \ + ? _mcgen_TEMPLATE_FOR_ETW_MI_ALLOC(&(pContext)->Context, &ETW_MI_ALLOC, Address, Size) : 0 +#define EventWriteETW_MI_ALLOC_ForContextAssumeEnabled(pContext, Address, Size) \ + _mcgen_TEMPLATE_FOR_ETW_MI_ALLOC(&_mcgen_CheckContextType_microsoft_windows_mimalloc(pContext)->Context, &ETW_MI_ALLOC, Address, Size) + +// This macro is for use by MC-generated code and should not be used directly. +#define _mcgen_TEMPLATE_FOR_ETW_MI_ALLOC _mcgen_PASTE2(McTemplateU0xx_, MCGEN_EVENTWRITETRANSFER) + +// +// Enablement check macro for event "ETW_MI_FREE" +// +#define EventEnabledETW_MI_FREE() _mcgen_EVENT_BIT_SET(microsoft_windows_mimallocEnableBits, 0) +#define EventEnabledETW_MI_FREE_ForContext(pContext) _mcgen_EVENT_BIT_SET(_mcgen_CheckContextType_microsoft_windows_mimalloc(pContext)->EnableBits, 0) + +// +// Event write macros for event "ETW_MI_FREE" +// +#define EventWriteETW_MI_FREE(Address, Size) \ + MCGEN_EVENT_ENABLED(ETW_MI_FREE) \ + ? _mcgen_TEMPLATE_FOR_ETW_MI_FREE(&ETW_MI_Provider_Context, &ETW_MI_FREE, Address, Size) : 0 +#define EventWriteETW_MI_FREE_AssumeEnabled(Address, Size) \ + _mcgen_TEMPLATE_FOR_ETW_MI_FREE(&ETW_MI_Provider_Context, &ETW_MI_FREE, Address, Size) +#define EventWriteETW_MI_FREE_ForContext(pContext, Address, Size) \ + MCGEN_EVENT_ENABLED_FORCONTEXT(pContext, ETW_MI_FREE) \ + ? _mcgen_TEMPLATE_FOR_ETW_MI_FREE(&(pContext)->Context, &ETW_MI_FREE, Address, Size) : 0 +#define EventWriteETW_MI_FREE_ForContextAssumeEnabled(pContext, Address, Size) \ + _mcgen_TEMPLATE_FOR_ETW_MI_FREE(&_mcgen_CheckContextType_microsoft_windows_mimalloc(pContext)->Context, &ETW_MI_FREE, Address, Size) + +// This macro is for use by MC-generated code and should not be used directly. +#define _mcgen_TEMPLATE_FOR_ETW_MI_FREE _mcgen_PASTE2(McTemplateU0xx_, MCGEN_EVENTWRITETRANSFER) + +#endif // MCGEN_DISABLE_PROVIDER_CODE_GENERATION + +// +// MCGEN_DISABLE_PROVIDER_CODE_GENERATION macro: +// Define this macro to have the compiler skip the generated functions in this +// header. +// +#ifndef MCGEN_DISABLE_PROVIDER_CODE_GENERATION + +// +// Template Functions +// + +// +// Function for template "ETW_CUSTOM_HEAP_ALLOC_DATA" (and possibly others). +// This function is for use by MC-generated code and should not be used directly. +// +#ifndef McTemplateU0xx_def +#define McTemplateU0xx_def +ETW_INLINE +ULONG +_mcgen_PASTE2(McTemplateU0xx_, MCGEN_EVENTWRITETRANSFER)( + _In_ PMCGEN_TRACE_CONTEXT Context, + _In_ PCEVENT_DESCRIPTOR Descriptor, + _In_ const unsigned __int64 _Arg0, + _In_ const unsigned __int64 _Arg1 + ) +{ +#define McTemplateU0xx_ARGCOUNT 2 + + EVENT_DATA_DESCRIPTOR EventData[McTemplateU0xx_ARGCOUNT + 1]; + + EventDataDescCreate(&EventData[1],&_Arg0, sizeof(const unsigned __int64) ); + + EventDataDescCreate(&EventData[2],&_Arg1, sizeof(const unsigned __int64) ); + + return McGenEventWrite(Context, Descriptor, NULL, McTemplateU0xx_ARGCOUNT + 1, EventData); +} +#endif // McTemplateU0xx_def + +#endif // MCGEN_DISABLE_PROVIDER_CODE_GENERATION + +#if defined(__cplusplus) +} +#endif diff --git a/src/prim/windows/etw.man b/src/prim/windows/etw.man new file mode 100644 index 0000000000000000000000000000000000000000..cfd1f8a9eaacd50af63f1e28f9540aa88c20f90c GIT binary patch literal 3926 zcmeH~T~8B16o${WiT`2c+NGc<*i;EYh$d8xl<0*CS-Mb~vPP(R>hsQY*nU!q z$b})3?##}d?{nTW+uy%xwr*doYaNU1!Vc}sa%7F%g+hVAmL$hwL?4dodnmuAKhUXm0)X9|WHj>XRahh@~SWDIkbduX;B#u6^Q>@U= zDO8U+KXa0*th&%f*z^Udh4ol@uE=Q&`emUsh_CA`FOXgI{i-`XZ9C#bR1yBm=PJ*p z9kVN$J6O;h;8HY>p)RnhY8A#Hb?z)_!y(Iaen(I)@-9CrSSp(;_Jn9I*$S&ATjP1? zVxB>pV@LVsy;^jZr7r$HNAm06TcUiI`l@~F$Mt$E%Shfd3O+h1vFhR9a8yQZ@wpne zr3bI-p=VEdo{)#uWxSVJeYQF|-5tnq>~f+CP~A0&{v=(up=ngEDl>5!$EDwPRaNjW zXj|wbG$OwmwaW-hMvBK%pbm3wpic71O^dzbxT%*13+SP9h- zI~rA5hapTVnk|qmiIVYy{__+x9f7OV4j3`g4;{{8_SWnLBSu2PUc%~`t%Ae^>J`SS zdtZg-r<0xAH*_ALtK;Nv(d9nbKK1jK=Ld)I(jQrKhBjgToR#Wm8{0a}@6ZuEO(lvG=y=Jh{M!4!-$(E)!vYUrf47 znf4W$e&QFOovV_$>J%X*KN>oXI@jt%BJms>IU}I$<7Hr{PChchs%+mx{% zt(fa_PM4r63?1h#YOk~;byc5`>%q>sLHA1gohNq{qOREhxu<y~`}YVhGe0?R_ceQ8vt^BpSNp6kErj_0hUNFyWQ1IOZ|GEgWBPwYFLgFu Oo!*uqEBu%Ae18C_t1cS= literal 0 HcmV?d00001 diff --git a/src/prim/windows/prim.c b/src/prim/windows/prim.c new file mode 100644 index 0000000..d3e4208 --- /dev/null +++ b/src/prim/windows/prim.c @@ -0,0 +1,670 @@ +/* ---------------------------------------------------------------------------- +Copyright (c) 2018-2023, Microsoft Research, Daan Leijen +This is free software; you can redistribute it and/or modify it under the +terms of the MIT license. A copy of the license can be found in the file +"LICENSE" at the root of this distribution. +-----------------------------------------------------------------------------*/ + +// This file is included in `src/prim/prim.c` + +#include "mimalloc.h" +#include "mimalloc/internal.h" +#include "mimalloc/atomic.h" +#include "mimalloc/prim.h" +#include // fputs, stderr + + +//--------------------------------------------- +// Dynamically bind Windows API points for portability +//--------------------------------------------- + +// We use VirtualAlloc2 for aligned allocation, but it is only supported on Windows 10 and Windows Server 2016. +// So, we need to look it up dynamically to run on older systems. (use __stdcall for 32-bit compatibility) +// NtAllocateVirtualAllocEx is used for huge OS page allocation (1GiB) +// We define a minimal MEM_EXTENDED_PARAMETER ourselves in order to be able to compile with older SDK's. +typedef enum MI_MEM_EXTENDED_PARAMETER_TYPE_E { + MiMemExtendedParameterInvalidType = 0, + MiMemExtendedParameterAddressRequirements, + MiMemExtendedParameterNumaNode, + MiMemExtendedParameterPartitionHandle, + MiMemExtendedParameterUserPhysicalHandle, + MiMemExtendedParameterAttributeFlags, + MiMemExtendedParameterMax +} MI_MEM_EXTENDED_PARAMETER_TYPE; + +typedef struct DECLSPEC_ALIGN(8) MI_MEM_EXTENDED_PARAMETER_S { + struct { DWORD64 Type : 8; DWORD64 Reserved : 56; } Type; + union { DWORD64 ULong64; PVOID Pointer; SIZE_T Size; HANDLE Handle; DWORD ULong; } Arg; +} MI_MEM_EXTENDED_PARAMETER; + +typedef struct MI_MEM_ADDRESS_REQUIREMENTS_S { + PVOID LowestStartingAddress; + PVOID HighestEndingAddress; + SIZE_T Alignment; +} MI_MEM_ADDRESS_REQUIREMENTS; + +#define MI_MEM_EXTENDED_PARAMETER_NONPAGED_HUGE 0x00000010 + +#include +typedef PVOID (__stdcall *PVirtualAlloc2)(HANDLE, PVOID, SIZE_T, ULONG, ULONG, MI_MEM_EXTENDED_PARAMETER*, ULONG); +typedef NTSTATUS (__stdcall *PNtAllocateVirtualMemoryEx)(HANDLE, PVOID*, SIZE_T*, ULONG, ULONG, MI_MEM_EXTENDED_PARAMETER*, ULONG); +static PVirtualAlloc2 pVirtualAlloc2 = NULL; +static PNtAllocateVirtualMemoryEx pNtAllocateVirtualMemoryEx = NULL; + +// Similarly, GetNumaProcesorNodeEx is only supported since Windows 7 +typedef struct MI_PROCESSOR_NUMBER_S { WORD Group; BYTE Number; BYTE Reserved; } MI_PROCESSOR_NUMBER; + +typedef VOID(__stdcall* PGetCurrentProcessorNumberEx)(PPROCESSOR_NUMBER ProcNumber); +typedef BOOL(__stdcall* PGetNumaProcessorNodeEx)(PPROCESSOR_NUMBER Processor, PUSHORT NodeNumber); +typedef BOOL(__stdcall* PGetNumaNodeProcessorMaskEx)(USHORT Node, PGROUP_AFFINITY ProcessorMask); +static PGetCurrentProcessorNumberEx pGetCurrentProcessorNumberEx = NULL; +static PGetNumaProcessorNodeEx pGetNumaProcessorNodeEx = NULL; +static PGetNumaNodeProcessorMaskEx pGetNumaNodeProcessorMaskEx = NULL; +static DWORD(__stdcall* pGetCurrentProcessorNumber)() = NULL; +static DWORD(__stdcall* pGetLargePageMinimum)() = NULL; +static BOOL(__stdcall* pGetNumaHighestNodeNumber)(PULONG HighestNodeNumber) = NULL; +static BOOL(__stdcall* pGetNumaProcessorNode)(UCHAR Processor, PUCHAR NodeNumber) = NULL; +static BOOL(__stdcall* pGetNumaNodeProcessorMask)(UCHAR Processor, PULONGLONG ProcessorMask) = NULL; + +static BOOL(__stdcall* pLookupPrivilegeValueW)(LPCWSTR lpSystemName, + LPCWSTR lpName, + PLUID lpLuid) = NULL; +static BOOL(__stdcall* pAdjustTokenPrivileges)(HANDLE TokenHandle, + BOOL DisableAllPrivileges, + PTOKEN_PRIVILEGES NewState, + DWORD BufferLength, + PTOKEN_PRIVILEGES PreviousState, + PDWORD ReturnLength) = NULL; +static BOOL(__stdcall* pOpenProcessToken)( + HANDLE ProcessHandle, + DWORD DesiredAccess, + PHANDLE TokenHandle) = NULL; + + +//--------------------------------------------- +// Enable large page support dynamically (if possible) +//--------------------------------------------- + +static bool win_enable_large_os_pages(size_t* large_page_size) +{ + static bool large_initialized = false; + if (large_initialized) return (_mi_os_large_page_size() > 0); + large_initialized = true; + + // Try to see if large OS pages are supported + // To use large pages on Windows, we first need access permission + // Set "Lock pages in memory" permission in the group policy editor + // + unsigned long err = 0; + HANDLE token = NULL; + BOOL ok = pOpenProcessToken && + pOpenProcessToken(GetCurrentProcess(), TOKEN_ADJUST_PRIVILEGES | TOKEN_QUERY, &token); + if (ok) { + TOKEN_PRIVILEGES tp; + ok = pLookupPrivilegeValueW && + pLookupPrivilegeValueW(NULL, L"SeLockMemoryPrivilege", &tp.Privileges[0].Luid); + if (ok) { + tp.PrivilegeCount = 1; + tp.Privileges[0].Attributes = SE_PRIVILEGE_ENABLED; + ok = pAdjustTokenPrivileges && + pAdjustTokenPrivileges(token, FALSE, &tp, 0, (PTOKEN_PRIVILEGES)NULL, 0); + if (ok) { + err = GetLastError(); + ok = (err == ERROR_SUCCESS); + + if (ok && large_page_size != NULL) { + *large_page_size = pGetLargePageMinimum(); + } + } + } + CloseHandle(token); + } + if (!ok) { + if (err == 0) err = GetLastError(); + _mi_warning_message("cannot enable large OS page support, error %lu\n", err); + } + return (ok != 0); +} + + +//--------------------------------------------- +// Initialize +//--------------------------------------------- + +void _mi_prim_mem_init( mi_os_mem_config_t* config ) +{ + config->has_overcommit = false; + config->must_free_whole = true; + config->has_virtual_reserve = true; + // get the page size + SYSTEM_INFO si; + GetSystemInfo(&si); + if (si.dwPageSize > 0) { config->page_size = si.dwPageSize; } + if (si.dwAllocationGranularity > 0) { config->alloc_granularity = si.dwAllocationGranularity; } + // get the VirtualAlloc2 function + HINSTANCE hDll; + hDll = LoadLibrary(TEXT("kernelbase.dll")); + if (hDll != NULL) { + // use VirtualAlloc2FromApp if possible as it is available to Windows store apps + pVirtualAlloc2 = (PVirtualAlloc2)(void (*)(void))GetProcAddress(hDll, "VirtualAlloc2FromApp"); + if (pVirtualAlloc2==NULL) pVirtualAlloc2 = (PVirtualAlloc2)(void (*)(void))GetProcAddress(hDll, "VirtualAlloc2"); + } + // NtAllocateVirtualMemoryEx is used for huge page allocation + hDll = LoadLibrary(TEXT("ntdll.dll")); + if (hDll != NULL) { + pNtAllocateVirtualMemoryEx = (PNtAllocateVirtualMemoryEx)(void (*)(void))GetProcAddress(hDll, "NtAllocateVirtualMemoryEx"); + } + // Try to use Win7+ numa API + hDll = LoadLibrary(TEXT("kernel32.dll")); + if (hDll != NULL) { + pGetCurrentProcessorNumberEx = (PGetCurrentProcessorNumberEx)(void (*)(void))GetProcAddress(hDll, "GetCurrentProcessorNumberEx"); + pGetNumaProcessorNodeEx = (PGetNumaProcessorNodeEx)(void (*)(void))GetProcAddress(hDll, "GetNumaProcessorNodeEx"); + pGetNumaNodeProcessorMaskEx = (PGetNumaNodeProcessorMaskEx)(void (*)(void))GetProcAddress(hDll, "GetNumaNodeProcessorMaskEx"); + pGetCurrentProcessorNumber = (DWORD(__stdcall*)())GetProcAddress(hDll, "GetCurrentProcessorNumber"); + pGetLargePageMinimum = (DWORD(__cdecl*)())GetProcAddress(hDll, "GetLargePageMinimum"); + pGetNumaHighestNodeNumber = (BOOL(__stdcall*)(PULONG))GetProcAddress(hDll, "GetNumaHighestNodeNumber"); + pGetNumaProcessorNode = (BOOL(__stdcall*)(UCHAR, PUCHAR))GetProcAddress(hDll, "GetNumaProcessorNode"); + pGetNumaNodeProcessorMask = (BOOL(__stdcall*)(UCHAR, PULONGLONG))GetProcAddress(hDll, "GetNumaNodeProcessorMask"); + } + + hDll = LoadLibrary(TEXT("Advapi32.dll")); + if (hDll != NULL) { + pLookupPrivilegeValueW = (BOOL(__stdcall*)(LPCWSTR, + LPCWSTR, + PLUID))GetProcAddress(hDll, "LookupPrivilegeValueW"); + + pAdjustTokenPrivileges = (BOOL(__stdcall*)(HANDLE, + BOOL, + PTOKEN_PRIVILEGES, + DWORD, + PTOKEN_PRIVILEGES, + PDWORD))GetProcAddress(hDll, "AdjustTokenPrivileges"); + + pOpenProcessToken = (BOOL(__stdcall*)( + HANDLE, + DWORD, + PHANDLE))GetProcAddress(hDll, "OpenProcessToken"); + } + + if (mi_option_is_enabled(mi_option_allow_large_os_pages) || mi_option_is_enabled(mi_option_reserve_huge_os_pages)) { + win_enable_large_os_pages(&config->large_page_size); + } +} + + +//--------------------------------------------- +// Free +//--------------------------------------------- + +int _mi_prim_free(void* addr, size_t size ) { + MI_UNUSED(size); + DWORD errcode = 0; + bool err = (VirtualFree(addr, 0, MEM_RELEASE) == 0); + if (err) { errcode = GetLastError(); } + if (errcode == ERROR_INVALID_ADDRESS) { + // In mi_os_mem_alloc_aligned the fallback path may have returned a pointer inside + // the memory region returned by VirtualAlloc; in that case we need to free using + // the start of the region. + MEMORY_BASIC_INFORMATION info = { 0 }; + VirtualQuery(addr, &info, sizeof(info)); + if (info.AllocationBase < addr && ((uint8_t*)addr - (uint8_t*)info.AllocationBase) < (ptrdiff_t)MI_SEGMENT_SIZE) { + errcode = 0; + err = (VirtualFree(info.AllocationBase, 0, MEM_RELEASE) == 0); + if (err) { errcode = GetLastError(); } + } + } + return (int)errcode; +} + + +//--------------------------------------------- +// VirtualAlloc +//--------------------------------------------- + +static void* win_virtual_alloc_prim(void* addr, size_t size, size_t try_alignment, DWORD flags) { + #if (MI_INTPTR_SIZE >= 8) + // on 64-bit systems, try to use the virtual address area after 2TiB for 4MiB aligned allocations + if (addr == NULL) { + void* hint = _mi_os_get_aligned_hint(try_alignment,size); + if (hint != NULL) { + void* p = VirtualAlloc(hint, size, flags, PAGE_READWRITE); + if (p != NULL) return p; + _mi_verbose_message("warning: unable to allocate hinted aligned OS memory (%zu bytes, error code: 0x%x, address: %p, alignment: %zu, flags: 0x%x)\n", size, GetLastError(), hint, try_alignment, flags); + // fall through on error + } + } + #endif + // on modern Windows try use VirtualAlloc2 for aligned allocation + if (try_alignment > 1 && (try_alignment % _mi_os_page_size()) == 0 && pVirtualAlloc2 != NULL) { + MI_MEM_ADDRESS_REQUIREMENTS reqs = { 0, 0, 0 }; + reqs.Alignment = try_alignment; + MI_MEM_EXTENDED_PARAMETER param = { {0, 0}, {0} }; + param.Type.Type = MiMemExtendedParameterAddressRequirements; + param.Arg.Pointer = &reqs; + void* p = (*pVirtualAlloc2)(GetCurrentProcess(), addr, size, flags, PAGE_READWRITE, ¶m, 1); + if (p != NULL) return p; + _mi_warning_message("unable to allocate aligned OS memory (%zu bytes, error code: 0x%x, address: %p, alignment: %zu, flags: 0x%x)\n", size, GetLastError(), addr, try_alignment, flags); + // fall through on error + } + // last resort + return VirtualAlloc(addr, size, flags, PAGE_READWRITE); +} + +static void* win_virtual_alloc(void* addr, size_t size, size_t try_alignment, DWORD flags, bool large_only, bool allow_large, bool* is_large) { + mi_assert_internal(!(large_only && !allow_large)); + static _Atomic(size_t) large_page_try_ok; // = 0; + void* p = NULL; + // Try to allocate large OS pages (2MiB) if allowed or required. + if ((large_only || _mi_os_use_large_page(size, try_alignment)) + && allow_large && (flags&MEM_COMMIT)!=0 && (flags&MEM_RESERVE)!=0) { + size_t try_ok = mi_atomic_load_acquire(&large_page_try_ok); + if (!large_only && try_ok > 0) { + // if a large page allocation fails, it seems the calls to VirtualAlloc get very expensive. + // therefore, once a large page allocation failed, we don't try again for `large_page_try_ok` times. + mi_atomic_cas_strong_acq_rel(&large_page_try_ok, &try_ok, try_ok - 1); + } + else { + // large OS pages must always reserve and commit. + *is_large = true; + p = win_virtual_alloc_prim(addr, size, try_alignment, flags | MEM_LARGE_PAGES); + if (large_only) return p; + // fall back to non-large page allocation on error (`p == NULL`). + if (p == NULL) { + mi_atomic_store_release(&large_page_try_ok,10UL); // on error, don't try again for the next N allocations + } + } + } + // Fall back to regular page allocation + if (p == NULL) { + *is_large = ((flags&MEM_LARGE_PAGES) != 0); + p = win_virtual_alloc_prim(addr, size, try_alignment, flags); + } + //if (p == NULL) { _mi_warning_message("unable to allocate OS memory (%zu bytes, error code: 0x%x, address: %p, alignment: %zu, flags: 0x%x, large only: %d, allow large: %d)\n", size, GetLastError(), addr, try_alignment, flags, large_only, allow_large); } + return p; +} + +int _mi_prim_alloc(size_t size, size_t try_alignment, bool commit, bool allow_large, bool* is_large, bool* is_zero, void** addr) { + mi_assert_internal(size > 0 && (size % _mi_os_page_size()) == 0); + mi_assert_internal(commit || !allow_large); + mi_assert_internal(try_alignment > 0); + *is_zero = true; + int flags = MEM_RESERVE; + if (commit) { flags |= MEM_COMMIT; } + *addr = win_virtual_alloc(NULL, size, try_alignment, flags, false, allow_large, is_large); + return (*addr != NULL ? 0 : (int)GetLastError()); +} + + +//--------------------------------------------- +// Commit/Reset/Protect +//--------------------------------------------- +#ifdef _MSC_VER +#pragma warning(disable:6250) // suppress warning calling VirtualFree without MEM_RELEASE (for decommit) +#endif + +int _mi_prim_commit(void* addr, size_t size, bool* is_zero) { + *is_zero = false; + /* + // zero'ing only happens on an initial commit... but checking upfront seems expensive.. + _MEMORY_BASIC_INFORMATION meminfo; _mi_memzero_var(meminfo); + if (VirtualQuery(addr, &meminfo, size) > 0) { + if ((meminfo.State & MEM_COMMIT) == 0) { + *is_zero = true; + } + } + */ + // commit + void* p = VirtualAlloc(addr, size, MEM_COMMIT, PAGE_READWRITE); + if (p == NULL) return (int)GetLastError(); + return 0; +} + +int _mi_prim_decommit(void* addr, size_t size, bool* needs_recommit) { + BOOL ok = VirtualFree(addr, size, MEM_DECOMMIT); + *needs_recommit = true; // for safety, assume always decommitted even in the case of an error. + return (ok ? 0 : (int)GetLastError()); +} + +int _mi_prim_reset(void* addr, size_t size) { + void* p = VirtualAlloc(addr, size, MEM_RESET, PAGE_READWRITE); + mi_assert_internal(p == addr); + #if 0 + if (p != NULL) { + VirtualUnlock(addr,size); // VirtualUnlock after MEM_RESET removes the memory directly from the working set + } + #endif + return (p != NULL ? 0 : (int)GetLastError()); +} + +int _mi_prim_protect(void* addr, size_t size, bool protect) { + DWORD oldprotect = 0; + BOOL ok = VirtualProtect(addr, size, protect ? PAGE_NOACCESS : PAGE_READWRITE, &oldprotect); + return (ok ? 0 : (int)GetLastError()); +} + + +//--------------------------------------------- +// Huge page allocation +//--------------------------------------------- + +static void* _mi_prim_alloc_huge_os_pagesx(void* hint_addr, size_t size, int numa_node) +{ + const DWORD flags = MEM_LARGE_PAGES | MEM_COMMIT | MEM_RESERVE; + + win_enable_large_os_pages(NULL); + + MI_MEM_EXTENDED_PARAMETER params[3] = { {{0,0},{0}},{{0,0},{0}},{{0,0},{0}} }; + // on modern Windows try use NtAllocateVirtualMemoryEx for 1GiB huge pages + static bool mi_huge_pages_available = true; + if (pNtAllocateVirtualMemoryEx != NULL && mi_huge_pages_available) { + params[0].Type.Type = MiMemExtendedParameterAttributeFlags; + params[0].Arg.ULong64 = MI_MEM_EXTENDED_PARAMETER_NONPAGED_HUGE; + ULONG param_count = 1; + if (numa_node >= 0) { + param_count++; + params[1].Type.Type = MiMemExtendedParameterNumaNode; + params[1].Arg.ULong = (unsigned)numa_node; + } + SIZE_T psize = size; + void* base = hint_addr; + NTSTATUS err = (*pNtAllocateVirtualMemoryEx)(GetCurrentProcess(), &base, &psize, flags, PAGE_READWRITE, params, param_count); + if (err == 0 && base != NULL) { + return base; + } + else { + // fall back to regular large pages + mi_huge_pages_available = false; // don't try further huge pages + _mi_warning_message("unable to allocate using huge (1GiB) pages, trying large (2MiB) pages instead (status 0x%lx)\n", err); + } + } + // on modern Windows try use VirtualAlloc2 for numa aware large OS page allocation + if (pVirtualAlloc2 != NULL && numa_node >= 0) { + params[0].Type.Type = MiMemExtendedParameterNumaNode; + params[0].Arg.ULong = (unsigned)numa_node; + return (*pVirtualAlloc2)(GetCurrentProcess(), hint_addr, size, flags, PAGE_READWRITE, params, 1); + } + + // otherwise use regular virtual alloc on older windows + return VirtualAlloc(hint_addr, size, flags, PAGE_READWRITE); +} + +int _mi_prim_alloc_huge_os_pages(void* hint_addr, size_t size, int numa_node, bool* is_zero, void** addr) { + *is_zero = true; + *addr = _mi_prim_alloc_huge_os_pagesx(hint_addr,size,numa_node); + return (*addr != NULL ? 0 : (int)GetLastError()); +} + + +//--------------------------------------------- +// Numa nodes +//--------------------------------------------- + +size_t _mi_prim_numa_node(void) { + USHORT numa_node = 0; + if (pGetCurrentProcessorNumberEx != NULL && pGetNumaProcessorNodeEx != NULL) { + // Extended API is supported + MI_PROCESSOR_NUMBER pnum; + (*pGetCurrentProcessorNumberEx)(&pnum); + USHORT nnode = 0; + BOOL ok = (*pGetNumaProcessorNodeEx)(&pnum, &nnode); + if (ok) { numa_node = nnode; } + } + else if (pGetNumaProcessorNode != NULL && + pGetCurrentProcessorNumber) { + // Vista or earlier, use older API that is limited to 64 processors. Issue #277 + DWORD pnum = pGetCurrentProcessorNumber(); + UCHAR nnode = 0; + BOOL ok = pGetNumaProcessorNode((UCHAR)pnum, &nnode); + if (ok) { numa_node = nnode; } + } + return numa_node; +} + +size_t _mi_prim_numa_node_count(void) { + ULONG numa_max = 0; + if (pGetNumaHighestNodeNumber) { + pGetNumaHighestNodeNumber(&numa_max); + } + // find the highest node number that has actual processors assigned to it. Issue #282 + while (numa_max > 0) { + if (pGetNumaNodeProcessorMaskEx != NULL) { + // Extended API is supported + GROUP_AFFINITY affinity; + if ((*pGetNumaNodeProcessorMaskEx)((USHORT)numa_max, &affinity)) { + if (affinity.Mask != 0) break; // found the maximum non-empty node + } + } + else { + // Vista or earlier, use older API that is limited to 64 processors. + ULONGLONG mask; + if (pGetNumaNodeProcessorMask && + pGetNumaNodeProcessorMask((UCHAR)numa_max, &mask)) { + if (mask != 0) break; // found the maximum non-empty node + }; + } + // max node was invalid or had no processor assigned, try again + numa_max--; + } + return ((size_t)numa_max + 1); + +} + + +//---------------------------------------------------------------- +// Clock +//---------------------------------------------------------------- + +static mi_msecs_t mi_to_msecs(LARGE_INTEGER t) { + static LARGE_INTEGER mfreq; // = 0 + if (mfreq.QuadPart == 0LL) { + LARGE_INTEGER f; + QueryPerformanceFrequency(&f); + mfreq.QuadPart = f.QuadPart/1000LL; + if (mfreq.QuadPart == 0) mfreq.QuadPart = 1; + } + return (mi_msecs_t)(t.QuadPart / mfreq.QuadPart); +} + +mi_msecs_t _mi_prim_clock_now(void) { + LARGE_INTEGER t; + QueryPerformanceCounter(&t); + return mi_to_msecs(t); +} + + +//---------------------------------------------------------------- +// Process Info +//---------------------------------------------------------------- + +#include +#include + +static mi_msecs_t filetime_msecs(const FILETIME* ftime) { + ULARGE_INTEGER i; + i.LowPart = ftime->dwLowDateTime; + i.HighPart = ftime->dwHighDateTime; + mi_msecs_t msecs = (i.QuadPart / 10000); // FILETIME is in 100 nano seconds + return msecs; +} + +typedef BOOL (WINAPI *PGetProcessMemoryInfo)(HANDLE, PPROCESS_MEMORY_COUNTERS, DWORD); +static PGetProcessMemoryInfo pGetProcessMemoryInfo = NULL; + +void _mi_prim_process_info(mi_process_info_t* pinfo) +{ + FILETIME ct; + FILETIME ut; + FILETIME st; + FILETIME et; + GetProcessTimes(GetCurrentProcess(), &ct, &et, &st, &ut); + pinfo->utime = filetime_msecs(&ut); + pinfo->stime = filetime_msecs(&st); + + // load psapi on demand + if (pGetProcessMemoryInfo == NULL) { + HINSTANCE hDll = LoadLibrary(TEXT("psapi.dll")); + if (hDll != NULL) { + pGetProcessMemoryInfo = (PGetProcessMemoryInfo)(void (*)(void))GetProcAddress(hDll, "GetProcessMemoryInfo"); + } + } + + // get process info + PROCESS_MEMORY_COUNTERS info; + memset(&info, 0, sizeof(info)); + if (pGetProcessMemoryInfo != NULL) { + pGetProcessMemoryInfo(GetCurrentProcess(), &info, sizeof(info)); + } + pinfo->current_rss = (size_t)info.WorkingSetSize; + pinfo->peak_rss = (size_t)info.PeakWorkingSetSize; + pinfo->current_commit = (size_t)info.PagefileUsage; + pinfo->peak_commit = (size_t)info.PeakPagefileUsage; + pinfo->page_faults = (size_t)info.PageFaultCount; +} + +//---------------------------------------------------------------- +// Output +//---------------------------------------------------------------- + +void _mi_prim_out_stderr( const char* msg ) +{ + // on windows with redirection, the C runtime cannot handle locale dependent output + // after the main thread closes so we use direct console output. + if (!_mi_preloading()) { + // _cputs(msg); // _cputs cannot be used at is aborts if it fails to lock the console + static HANDLE hcon = INVALID_HANDLE_VALUE; + static bool hconIsConsole; + if (hcon == INVALID_HANDLE_VALUE) { + CONSOLE_SCREEN_BUFFER_INFO sbi; + hcon = GetStdHandle(STD_ERROR_HANDLE); + hconIsConsole = ((hcon != INVALID_HANDLE_VALUE) && GetConsoleScreenBufferInfo(hcon, &sbi)); + } + const size_t len = _mi_strlen(msg); + if (len > 0 && len < UINT32_MAX) { + DWORD written = 0; + if (hconIsConsole) { + WriteConsoleA(hcon, msg, (DWORD)len, &written, NULL); + } + else if (hcon != INVALID_HANDLE_VALUE) { + // use direct write if stderr was redirected + WriteFile(hcon, msg, (DWORD)len, &written, NULL); + } + else { + // finally fall back to fputs after all + fputs(msg, stderr); + } + } + } +} + + +//---------------------------------------------------------------- +// Environment +//---------------------------------------------------------------- + +// On Windows use GetEnvironmentVariable instead of getenv to work +// reliably even when this is invoked before the C runtime is initialized. +// i.e. when `_mi_preloading() == true`. +// Note: on windows, environment names are not case sensitive. +bool _mi_prim_getenv(const char* name, char* result, size_t result_size) { + result[0] = 0; + size_t len = GetEnvironmentVariableA(name, result, (DWORD)result_size); + return (len > 0 && len < result_size); +} + + + +//---------------------------------------------------------------- +// Random +//---------------------------------------------------------------- + +#if defined(MI_USE_RTLGENRANDOM) // || defined(__cplusplus) +// We prefer to use BCryptGenRandom instead of (the unofficial) RtlGenRandom but when using +// dynamic overriding, we observed it can raise an exception when compiled with C++, and +// sometimes deadlocks when also running under the VS debugger. +// In contrast, issue #623 implies that on Windows Server 2019 we need to use BCryptGenRandom. +// To be continued.. +#pragma comment (lib,"advapi32.lib") +#define RtlGenRandom SystemFunction036 +mi_decl_externc BOOLEAN NTAPI RtlGenRandom(PVOID RandomBuffer, ULONG RandomBufferLength); + +bool _mi_prim_random_buf(void* buf, size_t buf_len) { + return (RtlGenRandom(buf, (ULONG)buf_len) != 0); +} + +#else + +#ifndef BCRYPT_USE_SYSTEM_PREFERRED_RNG +#define BCRYPT_USE_SYSTEM_PREFERRED_RNG 0x00000002 +#endif + +typedef LONG (NTAPI *PBCryptGenRandom)(HANDLE, PUCHAR, ULONG, ULONG); +static PBCryptGenRandom pBCryptGenRandom = NULL; + +bool _mi_prim_random_buf(void* buf, size_t buf_len) { + if (pBCryptGenRandom == NULL) { + HINSTANCE hDll = LoadLibrary(TEXT("bcrypt.dll")); + if (hDll != NULL) { + pBCryptGenRandom = (PBCryptGenRandom)(void (*)(void))GetProcAddress(hDll, "BCryptGenRandom"); + } + if (pBCryptGenRandom == NULL) return false; + } + return (pBCryptGenRandom(NULL, (PUCHAR)buf, (ULONG)buf_len, BCRYPT_USE_SYSTEM_PREFERRED_RNG) >= 0); +} + +#endif // MI_USE_RTLGENRANDOM + +//---------------------------------------------------------------- +// Thread init/done +//---------------------------------------------------------------- + +#if !defined(MI_SHARED_LIB) + +// use thread local storage keys to detect thread ending +#include +#if (_WIN32_WINNT < 0x600) // before Windows Vista +WINBASEAPI DWORD WINAPI FlsAlloc( _In_opt_ PFLS_CALLBACK_FUNCTION lpCallback ); +WINBASEAPI PVOID WINAPI FlsGetValue( _In_ DWORD dwFlsIndex ); +WINBASEAPI BOOL WINAPI FlsSetValue( _In_ DWORD dwFlsIndex, _In_opt_ PVOID lpFlsData ); +WINBASEAPI BOOL WINAPI FlsFree(_In_ DWORD dwFlsIndex); +#endif + +static DWORD mi_fls_key = (DWORD)(-1); + +static void NTAPI mi_fls_done(PVOID value) { + mi_heap_t* heap = (mi_heap_t*)value; + if (heap != NULL) { + _mi_thread_done(heap); + FlsSetValue(mi_fls_key, NULL); // prevent recursion as _mi_thread_done may set it back to the main heap, issue #672 + } +} + +void _mi_prim_thread_init_auto_done(void) { + mi_fls_key = FlsAlloc(&mi_fls_done); +} + +void _mi_prim_thread_done_auto_done(void) { + // call thread-done on all threads (except the main thread) to prevent + // dangling callback pointer if statically linked with a DLL; Issue #208 + FlsFree(mi_fls_key); +} + +void _mi_prim_thread_associate_default_heap(mi_heap_t* heap) { + mi_assert_internal(mi_fls_key != (DWORD)(-1)); + FlsSetValue(mi_fls_key, heap); +} + +#else + +// Dll; nothing to do as in that case thread_done is handled through the DLL_THREAD_DETACH event. + +void _mi_prim_thread_init_auto_done(void) { +} + +void _mi_prim_thread_done_auto_done(void) { +} + +void _mi_prim_thread_associate_default_heap(mi_heap_t* heap) { + MI_UNUSED(heap); +} + +#endif diff --git a/src/prim/windows/readme.md b/src/prim/windows/readme.md new file mode 100644 index 0000000..217c3d1 --- /dev/null +++ b/src/prim/windows/readme.md @@ -0,0 +1,17 @@ +## Primitives: + +- `prim.c` contains Windows primitives for OS allocation. + +## Event Tracing for Windows (ETW) + +- `etw.h` is generated from `etw.man` which contains the manifest for mimalloc events. + (100 is an allocation, 101 is for a free) + +- `etw-mimalloc.wprp` is a profile for the Windows Performance Recorder (WPR). + In an admin prompt, you can use: + ``` + > wpr -start src\prim\windows\etw-mimalloc.wprp -filemode + > + > wpr -stop test.etl + ``` + and then open `test.etl` in the Windows Performance Analyzer (WPA). \ No newline at end of file diff --git a/src/random.c b/src/random.c index 9e0c3f9..147e287 100644 --- a/src/random.c +++ b/src/random.c @@ -1,13 +1,13 @@ /* ---------------------------------------------------------------------------- -Copyright (c) 2019, Microsoft Research, Daan Leijen +Copyright (c) 2019-2021, Microsoft Research, Daan Leijen This is free software; you can redistribute it and/or modify it under the terms of the MIT license. A copy of the license can be found in the file "LICENSE" at the root of this distribution. -----------------------------------------------------------------------------*/ #include "mimalloc.h" -#include "mimalloc-internal.h" - -#include // memset +#include "mimalloc/internal.h" +#include "mimalloc/prim.h" // _mi_prim_random_buf +#include // memset /* ---------------------------------------------------------------------------- We use our own PRNG to keep predictable performance of random number generation @@ -115,7 +115,7 @@ static void chacha_init(mi_random_ctx_t* ctx, const uint8_t key[32], uint64_t no static void chacha_split(mi_random_ctx_t* ctx, uint64_t nonce, mi_random_ctx_t* ctx_new) { memset(ctx_new, 0, sizeof(*ctx_new)); - memcpy(ctx_new->input, ctx->input, sizeof(ctx_new->input)); + _mi_memcpy(ctx_new->input, ctx->input, sizeof(ctx_new->input)); ctx_new->input[12] = 0; ctx_new->input[13] = 0; ctx_new->input[14] = (uint32_t)nonce; @@ -154,30 +154,42 @@ uintptr_t _mi_random_next(mi_random_ctx_t* ctx) { /* ---------------------------------------------------------------------------- -To initialize a fresh random context we rely on the OS: -- Windows : BCryptGenRandom (or RtlGenRandom) -- osX,bsd,wasi: arc4random_buf -- Linux : getrandom,/dev/urandom +To initialize a fresh random context. If we cannot get good randomness, we fall back to weak randomness based on a timer and ASLR. -----------------------------------------------------------------------------*/ unsigned long rng_get_bytes(unsigned char* out, unsigned long outlen, void (*callback)(void)); static bool os_random_buf(void* buf, size_t buf_len) { - rng_get_bytes(buf, buf_len, 0); - return true; + rng_get_bytes(buf, buf_len, 0); + return true; } uintptr_t _os_random_weak(uintptr_t extra_seed) { - uintptr_t x = extra_seed; - rng_get_bytes(&x, sizeof(x), 0); - return x; + uintptr_t x = extra_seed; + rng_get_bytes(&x, sizeof(x), 0); + return x; +} + +static void mi_random_init_ex(mi_random_ctx_t* ctx, bool use_weak) { + uint8_t key[32]; + rng_get_bytes(key, sizeof(key), 0); + ctx->weak = false; + chacha_init(ctx, key, (uintptr_t)ctx /*nonce*/ ); } void _mi_random_init(mi_random_ctx_t* ctx) { - uint8_t key[32]; - (void)os_random_buf(key, sizeof(key)); - chacha_init(ctx, key, (uintptr_t)ctx /*nonce*/ ); + mi_random_init_ex(ctx, false); +} + +void _mi_random_init_weak(mi_random_ctx_t * ctx) { + mi_random_init_ex(ctx, true); +} + +void _mi_random_reinit_if_weak(mi_random_ctx_t * ctx) { + if (ctx->weak) { + _mi_random_init(ctx); + } } /* -------------------------------------------------------- diff --git a/src/region.c b/src/region.c deleted file mode 100644 index b6d0da3..0000000 --- a/src/region.c +++ /dev/null @@ -1,500 +0,0 @@ -/* ---------------------------------------------------------------------------- -Copyright (c) 2019, Microsoft Research, Daan Leijen -This is free software; you can redistribute it and/or modify it under the -terms of the MIT license. A copy of the license can be found in the file -"LICENSE" at the root of this distribution. ------------------------------------------------------------------------------*/ - -/* ---------------------------------------------------------------------------- -This implements a layer between the raw OS memory (VirtualAlloc/mmap/sbrk/..) -and the segment and huge object allocation by mimalloc. There may be multiple -implementations of this (one could be the identity going directly to the OS, -another could be a simple cache etc), but the current one uses large "regions". -In contrast to the rest of mimalloc, the "regions" are shared between threads and -need to be accessed using atomic operations. -We need this memory layer between the raw OS calls because of: -1. on `sbrk` like systems (like WebAssembly) we need our own memory maps in order - to reuse memory effectively. -2. It turns out that for large objects, between 1MiB and 32MiB (?), the cost of - an OS allocation/free is still (much) too expensive relative to the accesses - in that object :-( (`malloc-large` tests this). This means we need a cheaper - way to reuse memory. -3. This layer allows for NUMA aware allocation. - -Possible issues: -- (2) can potentially be addressed too with a small cache per thread which is much - simpler. Generally though that requires shrinking of huge pages, and may overuse - memory per thread. (and is not compatible with `sbrk`). -- Since the current regions are per-process, we need atomic operations to - claim blocks which may be contended -- In the worst case, we need to search the whole region map (16KiB for 256GiB) - linearly. At what point will direct OS calls be faster? Is there a way to - do this better without adding too much complexity? ------------------------------------------------------------------------------*/ -#include "mimalloc.h" -#include "mimalloc-internal.h" -#include "mimalloc-atomic.h" - -#include // memset - -#include "bitmap.inc.c" - -// Internal raw OS interface -size_t _mi_os_large_page_size(); -bool _mi_os_protect(void* addr, size_t size); -bool _mi_os_unprotect(void* addr, size_t size); -bool _mi_os_commit(void* p, size_t size, bool* is_zero, mi_stats_t* stats); -bool _mi_os_decommit(void* p, size_t size, mi_stats_t* stats); -bool _mi_os_reset(void* p, size_t size, mi_stats_t* stats); -bool _mi_os_unreset(void* p, size_t size, bool* is_zero, mi_stats_t* stats); - -// arena.c -void _mi_arena_free(void* p, size_t size, size_t memid, bool all_committed, mi_stats_t* stats); -void* _mi_arena_alloc(size_t size, bool* commit, bool* large, bool* is_zero, size_t* memid, mi_os_tld_t* tld); -void* _mi_arena_alloc_aligned(size_t size, size_t alignment, bool* commit, bool* large, bool* is_zero, size_t* memid, mi_os_tld_t* tld); - - - -// Constants -#if (MI_INTPTR_SIZE==8) -#define MI_HEAP_REGION_MAX_SIZE (256 * GiB) // 64KiB for the region map -#elif (MI_INTPTR_SIZE==4) -#define MI_HEAP_REGION_MAX_SIZE (3 * GiB) // ~ KiB for the region map -#else -#error "define the maximum heap space allowed for regions on this platform" -#endif - -#define MI_SEGMENT_ALIGN MI_SEGMENT_SIZE - -#define MI_REGION_MAX_BLOCKS MI_BITMAP_FIELD_BITS -#define MI_REGION_SIZE (MI_SEGMENT_SIZE * MI_BITMAP_FIELD_BITS) // 256MiB (64MiB on 32 bits) -#define MI_REGION_MAX (MI_HEAP_REGION_MAX_SIZE / MI_REGION_SIZE) // 1024 (48 on 32 bits) -#define MI_REGION_MAX_OBJ_BLOCKS (MI_REGION_MAX_BLOCKS/4) // 64MiB -#define MI_REGION_MAX_OBJ_SIZE (MI_REGION_MAX_OBJ_BLOCKS*MI_SEGMENT_SIZE) - -// Region info -typedef union mi_region_info_u { - uintptr_t value; - struct { - bool valid; // initialized? - bool is_large; // allocated in fixed large/huge OS pages - short numa_node; // the associated NUMA node (where -1 means no associated node) - } x; -} mi_region_info_t; - - -// A region owns a chunk of REGION_SIZE (256MiB) (virtual) memory with -// a bit map with one bit per MI_SEGMENT_SIZE (4MiB) block. -typedef struct mem_region_s { - _Atomic(uintptr_t) info; // mi_region_info_t.value - _Atomic(void*) start; // start of the memory area - mi_bitmap_field_t in_use; // bit per in-use block - mi_bitmap_field_t dirty; // track if non-zero per block - mi_bitmap_field_t commit; // track if committed per block - mi_bitmap_field_t reset; // track if reset per block - _Atomic(uintptr_t) arena_memid; // if allocated from a (huge page) arena - uintptr_t padding; // round to 8 fields -} mem_region_t; - -// The region map -static mem_region_t regions[MI_REGION_MAX]; - -// Allocated regions -static _Atomic(uintptr_t) regions_count; // = 0; - - -/* ---------------------------------------------------------------------------- -Utility functions ------------------------------------------------------------------------------*/ - -// Blocks (of 4MiB) needed for the given size. -static size_t mi_region_block_count(size_t size) { - return _mi_divide_up(size, MI_SEGMENT_SIZE); -} - -/* -// Return a rounded commit/reset size such that we don't fragment large OS pages into small ones. -static size_t mi_good_commit_size(size_t size) { - if (size > (SIZE_MAX - _mi_os_large_page_size())) return size; - return _mi_align_up(size, _mi_os_large_page_size()); -} -*/ - -// Return if a pointer points into a region reserved by us. -bool mi_is_in_heap_region(const void* p) mi_attr_noexcept { - if (p==NULL) return false; - size_t count = mi_atomic_load_relaxed(®ions_count); - for (size_t i = 0; i < count; i++) { - uint8_t* start = (uint8_t*)mi_atomic_load_ptr_relaxed(uint8_t, ®ions[i].start); - if (start != NULL && (uint8_t*)p >= start && (uint8_t*)p < start + MI_REGION_SIZE) return true; - } - return false; -} - - -static void* mi_region_blocks_start(const mem_region_t* region, mi_bitmap_index_t bit_idx) { - uint8_t* start = (uint8_t*)mi_atomic_load_ptr_acquire(uint8_t, &((mem_region_t*)region)->start); - mi_assert_internal(start != NULL); - return (start + (bit_idx * MI_SEGMENT_SIZE)); -} - -static size_t mi_memid_create(mem_region_t* region, mi_bitmap_index_t bit_idx) { - mi_assert_internal(bit_idx < MI_BITMAP_FIELD_BITS); - size_t idx = region - regions; - mi_assert_internal(®ions[idx] == region); - return (idx*MI_BITMAP_FIELD_BITS + bit_idx)<<1; -} - -static size_t mi_memid_create_from_arena(size_t arena_memid) { - return (arena_memid << 1) | 1; -} - - -static bool mi_memid_is_arena(size_t id, mem_region_t** region, mi_bitmap_index_t* bit_idx, size_t* arena_memid) { - if ((id&1)==1) { - if (arena_memid != NULL) *arena_memid = (id>>1); - return true; - } - else { - size_t idx = (id >> 1) / MI_BITMAP_FIELD_BITS; - *bit_idx = (mi_bitmap_index_t)(id>>1) % MI_BITMAP_FIELD_BITS; - *region = ®ions[idx]; - return false; - } -} - - -/* ---------------------------------------------------------------------------- - Allocate a region is allocated from the OS (or an arena) ------------------------------------------------------------------------------*/ - -static bool mi_region_try_alloc_os(size_t blocks, bool commit, bool allow_large, mem_region_t** region, mi_bitmap_index_t* bit_idx, mi_os_tld_t* tld) -{ - // not out of regions yet? - if (mi_atomic_load_relaxed(®ions_count) >= MI_REGION_MAX - 1) return false; - - // try to allocate a fresh region from the OS - bool region_commit = (commit && mi_option_is_enabled(mi_option_eager_region_commit)); - bool region_large = (commit && allow_large); - bool is_zero = false; - size_t arena_memid = 0; - void* const start = _mi_arena_alloc_aligned(MI_REGION_SIZE, MI_SEGMENT_ALIGN, ®ion_commit, ®ion_large, &is_zero, &arena_memid, tld); - if (start == NULL) return false; - mi_assert_internal(!(region_large && !allow_large)); - mi_assert_internal(!region_large || region_commit); - - // claim a fresh slot - const uintptr_t idx = mi_atomic_increment_acq_rel(®ions_count); - if (idx >= MI_REGION_MAX) { - mi_atomic_decrement_acq_rel(®ions_count); - _mi_arena_free(start, MI_REGION_SIZE, arena_memid, region_commit, tld->stats); - _mi_warning_message("maximum regions used: %zu GiB (perhaps recompile with a larger setting for MI_HEAP_REGION_MAX_SIZE)", _mi_divide_up(MI_HEAP_REGION_MAX_SIZE, GiB)); - return false; - } - - // allocated, initialize and claim the initial blocks - mem_region_t* r = ®ions[idx]; - r->arena_memid = arena_memid; - mi_atomic_store_release(&r->in_use, (uintptr_t)0); - mi_atomic_store_release(&r->dirty, (is_zero ? 0 : MI_BITMAP_FIELD_FULL)); - mi_atomic_store_release(&r->commit, (region_commit ? MI_BITMAP_FIELD_FULL : 0)); - mi_atomic_store_release(&r->reset, (uintptr_t)0); - *bit_idx = 0; - mi_bitmap_claim(&r->in_use, 1, blocks, *bit_idx, NULL); - mi_atomic_store_ptr_release(void,&r->start, start); - - // and share it - mi_region_info_t info; - info.value = 0; // initialize the full union to zero - info.x.valid = true; - info.x.is_large = region_large; - info.x.numa_node = (short)_mi_os_numa_node(tld); - mi_atomic_store_release(&r->info, info.value); // now make it available to others - *region = r; - return true; -} - -/* ---------------------------------------------------------------------------- - Try to claim blocks in suitable regions ------------------------------------------------------------------------------*/ - -static bool mi_region_is_suitable(const mem_region_t* region, int numa_node, bool allow_large ) { - // initialized at all? - mi_region_info_t info; - info.value = mi_atomic_load_relaxed(&((mem_region_t*)region)->info); - if (info.value==0) return false; - - // numa correct - if (numa_node >= 0) { // use negative numa node to always succeed - int rnode = info.x.numa_node; - if (rnode >= 0 && rnode != numa_node) return false; - } - - // check allow-large - if (!allow_large && info.x.is_large) return false; - - return true; -} - - -static bool mi_region_try_claim(int numa_node, size_t blocks, bool allow_large, mem_region_t** region, mi_bitmap_index_t* bit_idx, mi_os_tld_t* tld) -{ - // try all regions for a free slot - const size_t count = mi_atomic_load_relaxed(®ions_count); // monotonic, so ok to be relaxed - size_t idx = tld->region_idx; // Or start at 0 to reuse low addresses? Starting at 0 seems to increase latency though - for (size_t visited = 0; visited < count; visited++, idx++) { - if (idx >= count) idx = 0; // wrap around - mem_region_t* r = ®ions[idx]; - // if this region suits our demand (numa node matches, large OS page matches) - if (mi_region_is_suitable(r, numa_node, allow_large)) { - // then try to atomically claim a segment(s) in this region - if (mi_bitmap_try_find_claim_field(&r->in_use, 0, blocks, bit_idx)) { - tld->region_idx = idx; // remember the last found position - *region = r; - return true; - } - } - } - return false; -} - - -static void* mi_region_try_alloc(size_t blocks, bool* commit, bool* is_large, bool* is_zero, size_t* memid, mi_os_tld_t* tld) -{ - mi_assert_internal(blocks <= MI_BITMAP_FIELD_BITS); - mem_region_t* region; - mi_bitmap_index_t bit_idx; - const int numa_node = (_mi_os_numa_node_count() <= 1 ? -1 : _mi_os_numa_node(tld)); - // try to claim in existing regions - if (!mi_region_try_claim(numa_node, blocks, *is_large, ®ion, &bit_idx, tld)) { - // otherwise try to allocate a fresh region and claim in there - if (!mi_region_try_alloc_os(blocks, *commit, *is_large, ®ion, &bit_idx, tld)) { - // out of regions or memory - return NULL; - } - } - - // ------------------------------------------------ - // found a region and claimed `blocks` at `bit_idx`, initialize them now - mi_assert_internal(region != NULL); - mi_assert_internal(mi_bitmap_is_claimed(®ion->in_use, 1, blocks, bit_idx)); - - mi_region_info_t info; - info.value = mi_atomic_load_acquire(®ion->info); - uint8_t* start = (uint8_t*)mi_atomic_load_ptr_acquire(uint8_t,®ion->start); - mi_assert_internal(!(info.x.is_large && !*is_large)); - mi_assert_internal(start != NULL); - - *is_zero = mi_bitmap_claim(®ion->dirty, 1, blocks, bit_idx, NULL); - *is_large = info.x.is_large; - *memid = mi_memid_create(region, bit_idx); - void* p = start + (mi_bitmap_index_bit_in_field(bit_idx) * MI_SEGMENT_SIZE); - - // commit - if (*commit) { - // ensure commit - bool any_uncommitted; - mi_bitmap_claim(®ion->commit, 1, blocks, bit_idx, &any_uncommitted); - if (any_uncommitted) { - mi_assert_internal(!info.x.is_large); - bool commit_zero = false; - if (!_mi_mem_commit(p, blocks * MI_SEGMENT_SIZE, &commit_zero, tld)) { - // failed to commit! unclaim and return - mi_bitmap_unclaim(®ion->in_use, 1, blocks, bit_idx); - return NULL; - } - if (commit_zero) *is_zero = true; - } - } - else { - // no need to commit, but check if already fully committed - *commit = mi_bitmap_is_claimed(®ion->commit, 1, blocks, bit_idx); - } - mi_assert_internal(!*commit || mi_bitmap_is_claimed(®ion->commit, 1, blocks, bit_idx)); - - // unreset reset blocks - if (mi_bitmap_is_any_claimed(®ion->reset, 1, blocks, bit_idx)) { - // some blocks are still reset - mi_assert_internal(!info.x.is_large); - mi_assert_internal(!mi_option_is_enabled(mi_option_eager_commit) || *commit || mi_option_get(mi_option_eager_commit_delay) > 0); - mi_bitmap_unclaim(®ion->reset, 1, blocks, bit_idx); - if (*commit || !mi_option_is_enabled(mi_option_reset_decommits)) { // only if needed - bool reset_zero = false; - _mi_mem_unreset(p, blocks * MI_SEGMENT_SIZE, &reset_zero, tld); - if (reset_zero) *is_zero = true; - } - } - mi_assert_internal(!mi_bitmap_is_any_claimed(®ion->reset, 1, blocks, bit_idx)); - - #if (MI_DEBUG>=2) - if (*commit) { ((uint8_t*)p)[0] = 0; } - #endif - - // and return the allocation - mi_assert_internal(p != NULL); - return p; -} - - -/* ---------------------------------------------------------------------------- - Allocation ------------------------------------------------------------------------------*/ - -// Allocate `size` memory aligned at `alignment`. Return non NULL on success, with a given memory `id`. -// (`id` is abstract, but `id = idx*MI_REGION_MAP_BITS + bitidx`) -void* _mi_mem_alloc_aligned(size_t size, size_t alignment, bool* commit, bool* large, bool* is_zero, size_t* memid, mi_os_tld_t* tld) -{ - mi_assert_internal(memid != NULL && tld != NULL); - mi_assert_internal(size > 0); - *memid = 0; - *is_zero = false; - bool default_large = false; - if (large==NULL) large = &default_large; // ensure `large != NULL` - if (size == 0) return NULL; - size = _mi_align_up(size, _mi_os_page_size()); - - // allocate from regions if possible - void* p = NULL; - size_t arena_memid; - const size_t blocks = mi_region_block_count(size); - if (blocks <= MI_REGION_MAX_OBJ_BLOCKS && alignment <= MI_SEGMENT_ALIGN) { - p = mi_region_try_alloc(blocks, commit, large, is_zero, memid, tld); - if (p == NULL) { - _mi_warning_message("unable to allocate from region: size %zu\n", size); - } - } - if (p == NULL) { - // and otherwise fall back to the OS - p = _mi_arena_alloc_aligned(size, alignment, commit, large, is_zero, &arena_memid, tld); - *memid = mi_memid_create_from_arena(arena_memid); - } - - if (p != NULL) { - mi_assert_internal((uintptr_t)p % alignment == 0); -#if (MI_DEBUG>=2) - if (*commit) { ((uint8_t*)p)[0] = 0; } // ensure the memory is committed -#endif - } - return p; -} - - - -/* ---------------------------------------------------------------------------- -Free ------------------------------------------------------------------------------*/ - -// Free previously allocated memory with a given id. -void _mi_mem_free(void* p, size_t size, size_t id, bool full_commit, bool any_reset, mi_os_tld_t* tld) { - mi_assert_internal(size > 0 && tld != NULL); - if (p==NULL) return; - if (size==0) return; - size = _mi_align_up(size, _mi_os_page_size()); - - size_t arena_memid = 0; - mi_bitmap_index_t bit_idx; - mem_region_t* region; - if (mi_memid_is_arena(id,®ion,&bit_idx,&arena_memid)) { - // was a direct arena allocation, pass through - _mi_arena_free(p, size, arena_memid, full_commit, tld->stats); - } - else { - // allocated in a region - mi_assert_internal(size <= MI_REGION_MAX_OBJ_SIZE); if (size > MI_REGION_MAX_OBJ_SIZE) return; - const size_t blocks = mi_region_block_count(size); - mi_assert_internal(blocks + bit_idx <= MI_BITMAP_FIELD_BITS); - mi_region_info_t info; - info.value = mi_atomic_load_acquire(®ion->info); - mi_assert_internal(info.value != 0); - void* blocks_start = mi_region_blocks_start(region, bit_idx); - mi_assert_internal(blocks_start == p); // not a pointer in our area? - mi_assert_internal(bit_idx + blocks <= MI_BITMAP_FIELD_BITS); - if (blocks_start != p || bit_idx + blocks > MI_BITMAP_FIELD_BITS) return; // or `abort`? - - // committed? - if (full_commit && (size % MI_SEGMENT_SIZE) == 0) { - mi_bitmap_claim(®ion->commit, 1, blocks, bit_idx, NULL); - } - - if (any_reset) { - // set the is_reset bits if any pages were reset - mi_bitmap_claim(®ion->reset, 1, blocks, bit_idx, NULL); - } - - // reset the blocks to reduce the working set. - if (!info.x.is_large && mi_option_is_enabled(mi_option_segment_reset) - && (mi_option_is_enabled(mi_option_eager_commit) || - mi_option_is_enabled(mi_option_reset_decommits))) // cannot reset halfway committed segments, use only `option_page_reset` instead - { - bool any_unreset; - mi_bitmap_claim(®ion->reset, 1, blocks, bit_idx, &any_unreset); - if (any_unreset) { - _mi_abandoned_await_readers(); // ensure no more pending write (in case reset = decommit) - _mi_mem_reset(p, blocks * MI_SEGMENT_SIZE, tld); - } - } - - // and unclaim - bool all_unclaimed = mi_bitmap_unclaim(®ion->in_use, 1, blocks, bit_idx); - mi_assert_internal(all_unclaimed); UNUSED(all_unclaimed); - } -} - - -/* ---------------------------------------------------------------------------- - collection ------------------------------------------------------------------------------*/ -void _mi_mem_collect(mi_os_tld_t* tld) { - // free every region that has no segments in use. - uintptr_t rcount = mi_atomic_load_relaxed(®ions_count); - for (size_t i = 0; i < rcount; i++) { - mem_region_t* region = ®ions[i]; - if (mi_atomic_load_relaxed(®ion->info) != 0) { - // if no segments used, try to claim the whole region - uintptr_t m = mi_atomic_load_relaxed(®ion->in_use); - while (m == 0 && !mi_atomic_cas_weak_release(®ion->in_use, &m, MI_BITMAP_FIELD_FULL)) { /* nothing */ }; - if (m == 0) { - // on success, free the whole region - uint8_t* start = (uint8_t*)mi_atomic_load_ptr_acquire(uint8_t,®ions[i].start); - size_t arena_memid = mi_atomic_load_relaxed(®ions[i].arena_memid); - uintptr_t commit = mi_atomic_load_relaxed(®ions[i].commit); - memset(®ions[i], 0, sizeof(mem_region_t)); - // and release the whole region - mi_atomic_store_release(®ion->info, (uintptr_t)0); - if (start != NULL) { // && !_mi_os_is_huge_reserved(start)) { - _mi_abandoned_await_readers(); // ensure no pending reads - _mi_arena_free(start, MI_REGION_SIZE, arena_memid, (~commit == 0), tld->stats); - } - } - } - } -} - - -/* ---------------------------------------------------------------------------- - Other ------------------------------------------------------------------------------*/ - -bool _mi_mem_reset(void* p, size_t size, mi_os_tld_t* tld) { - return _mi_os_reset(p, size, tld->stats); -} - -bool _mi_mem_unreset(void* p, size_t size, bool* is_zero, mi_os_tld_t* tld) { - return _mi_os_unreset(p, size, is_zero, tld->stats); -} - -bool _mi_mem_commit(void* p, size_t size, bool* is_zero, mi_os_tld_t* tld) { - return _mi_os_commit(p, size, is_zero, tld->stats); -} - -bool _mi_mem_decommit(void* p, size_t size, mi_os_tld_t* tld) { - return _mi_os_decommit(p, size, tld->stats); -} - -bool _mi_mem_protect(void* p, size_t size) { - return _mi_os_protect(p, size); -} - -bool _mi_mem_unprotect(void* p, size_t size) { - return _mi_os_unprotect(p, size); -} diff --git a/src/segment-map.c b/src/segment-map.c new file mode 100644 index 0000000..4c2104b --- /dev/null +++ b/src/segment-map.c @@ -0,0 +1,153 @@ +/* ---------------------------------------------------------------------------- +Copyright (c) 2019-2023, Microsoft Research, Daan Leijen +This is free software; you can redistribute it and/or modify it under the +terms of the MIT license. A copy of the license can be found in the file +"LICENSE" at the root of this distribution. +-----------------------------------------------------------------------------*/ + +/* ----------------------------------------------------------- + The following functions are to reliably find the segment or + block that encompasses any pointer p (or NULL if it is not + in any of our segments). + We maintain a bitmap of all memory with 1 bit per MI_SEGMENT_SIZE (64MiB) + set to 1 if it contains the segment meta data. +----------------------------------------------------------- */ +#include "mimalloc.h" +#include "mimalloc/internal.h" +#include "mimalloc/atomic.h" + +#if (MI_INTPTR_SIZE==8) +#define MI_MAX_ADDRESS ((size_t)40 << 40) // 40TB (to include huge page areas) +#else +#define MI_MAX_ADDRESS ((size_t)2 << 30) // 2Gb +#endif + +#define MI_SEGMENT_MAP_BITS (MI_MAX_ADDRESS / MI_SEGMENT_SIZE) +#define MI_SEGMENT_MAP_SIZE (MI_SEGMENT_MAP_BITS / 8) +#define MI_SEGMENT_MAP_WSIZE (MI_SEGMENT_MAP_SIZE / MI_INTPTR_SIZE) + +static _Atomic(uintptr_t) mi_segment_map[MI_SEGMENT_MAP_WSIZE + 1]; // 2KiB per TB with 64MiB segments + +static size_t mi_segment_map_index_of(const mi_segment_t* segment, size_t* bitidx) { + mi_assert_internal(_mi_ptr_segment(segment + 1) == segment); // is it aligned on MI_SEGMENT_SIZE? + if ((uintptr_t)segment >= MI_MAX_ADDRESS) { + *bitidx = 0; + return MI_SEGMENT_MAP_WSIZE; + } + else { + const uintptr_t segindex = ((uintptr_t)segment) / MI_SEGMENT_SIZE; + *bitidx = segindex % MI_INTPTR_BITS; + const size_t mapindex = segindex / MI_INTPTR_BITS; + mi_assert_internal(mapindex < MI_SEGMENT_MAP_WSIZE); + return mapindex; + } +} + +void _mi_segment_map_allocated_at(const mi_segment_t* segment) { + size_t bitidx; + size_t index = mi_segment_map_index_of(segment, &bitidx); + mi_assert_internal(index <= MI_SEGMENT_MAP_WSIZE); + if (index==MI_SEGMENT_MAP_WSIZE) return; + uintptr_t mask = mi_atomic_load_relaxed(&mi_segment_map[index]); + uintptr_t newmask; + do { + newmask = (mask | ((uintptr_t)1 << bitidx)); + } while (!mi_atomic_cas_weak_release(&mi_segment_map[index], &mask, newmask)); +} + +void _mi_segment_map_freed_at(const mi_segment_t* segment) { + size_t bitidx; + size_t index = mi_segment_map_index_of(segment, &bitidx); + mi_assert_internal(index <= MI_SEGMENT_MAP_WSIZE); + if (index == MI_SEGMENT_MAP_WSIZE) return; + uintptr_t mask = mi_atomic_load_relaxed(&mi_segment_map[index]); + uintptr_t newmask; + do { + newmask = (mask & ~((uintptr_t)1 << bitidx)); + } while (!mi_atomic_cas_weak_release(&mi_segment_map[index], &mask, newmask)); +} + +// Determine the segment belonging to a pointer or NULL if it is not in a valid segment. +static mi_segment_t* _mi_segment_of(const void* p) { + if (p == NULL) return NULL; + mi_segment_t* segment = _mi_ptr_segment(p); + mi_assert_internal(segment != NULL); + size_t bitidx; + size_t index = mi_segment_map_index_of(segment, &bitidx); + // fast path: for any pointer to valid small/medium/large object or first MI_SEGMENT_SIZE in huge + const uintptr_t mask = mi_atomic_load_relaxed(&mi_segment_map[index]); + if mi_likely((mask & ((uintptr_t)1 << bitidx)) != 0) { + return segment; // yes, allocated by us + } + if (index==MI_SEGMENT_MAP_WSIZE) return NULL; + + // TODO: maintain max/min allocated range for efficiency for more efficient rejection of invalid pointers? + + // search downwards for the first segment in case it is an interior pointer + // could be slow but searches in MI_INTPTR_SIZE * MI_SEGMENT_SIZE (512MiB) steps trough + // valid huge objects + // note: we could maintain a lowest index to speed up the path for invalid pointers? + size_t lobitidx; + size_t loindex; + uintptr_t lobits = mask & (((uintptr_t)1 << bitidx) - 1); + if (lobits != 0) { + loindex = index; + lobitidx = mi_bsr(lobits); // lobits != 0 + } + else if (index == 0) { + return NULL; + } + else { + mi_assert_internal(index > 0); + uintptr_t lomask = mask; + loindex = index; + do { + loindex--; + lomask = mi_atomic_load_relaxed(&mi_segment_map[loindex]); + } while (lomask != 0 && loindex > 0); + if (lomask == 0) return NULL; + lobitidx = mi_bsr(lomask); // lomask != 0 + } + mi_assert_internal(loindex < MI_SEGMENT_MAP_WSIZE); + // take difference as the addresses could be larger than the MAX_ADDRESS space. + size_t diff = (((index - loindex) * (8*MI_INTPTR_SIZE)) + bitidx - lobitidx) * MI_SEGMENT_SIZE; + segment = (mi_segment_t*)((uint8_t*)segment - diff); + + if (segment == NULL) return NULL; + mi_assert_internal((void*)segment < p); + bool cookie_ok = (_mi_ptr_cookie(segment) == segment->cookie); + mi_assert_internal(cookie_ok); + if mi_unlikely(!cookie_ok) return NULL; + if (((uint8_t*)segment + mi_segment_size(segment)) <= (uint8_t*)p) return NULL; // outside the range + mi_assert_internal(p >= (void*)segment && (uint8_t*)p < (uint8_t*)segment + mi_segment_size(segment)); + return segment; +} + +// Is this a valid pointer in our heap? +static bool mi_is_valid_pointer(const void* p) { + return ((_mi_segment_of(p) != NULL) || (_mi_arena_contains(p))); +} + +mi_decl_nodiscard mi_decl_export bool mi_is_in_heap_region(const void* p) mi_attr_noexcept { + return mi_is_valid_pointer(p); +} + +/* +// Return the full segment range belonging to a pointer +static void* mi_segment_range_of(const void* p, size_t* size) { + mi_segment_t* segment = _mi_segment_of(p); + if (segment == NULL) { + if (size != NULL) *size = 0; + return NULL; + } + else { + if (size != NULL) *size = segment->segment_size; + return segment; + } + mi_assert_expensive(page == NULL || mi_segment_is_valid(_mi_page_segment(page),tld)); + mi_assert_internal(page == NULL || (mi_segment_page_size(_mi_page_segment(page)) - (MI_SECURE == 0 ? 0 : _mi_os_page_size())) >= block_size); + mi_reset_delayed(tld); + mi_assert_internal(page == NULL || mi_page_not_in_queue(page, tld)); + return page; +} +*/ diff --git a/src/segment.c b/src/segment.c index 0daf8dd..28685f2 100644 --- a/src/segment.c +++ b/src/segment.c @@ -1,34 +1,151 @@ /* ---------------------------------------------------------------------------- -Copyright (c) 2018, Microsoft Research, Daan Leijen +Copyright (c) 2018-2020, Microsoft Research, Daan Leijen This is free software; you can redistribute it and/or modify it under the terms of the MIT license. A copy of the license can be found in the file "LICENSE" at the root of this distribution. -----------------------------------------------------------------------------*/ #include "mimalloc.h" -#include "mimalloc-internal.h" -#include "mimalloc-atomic.h" +#include "mimalloc/internal.h" +#include "mimalloc/atomic.h" #include // memset #include -#define MI_PAGE_HUGE_ALIGN (256*1024) +#define MI_PAGE_HUGE_ALIGN (256*1024) + +static void mi_segment_try_purge(mi_segment_t* segment, bool force, mi_stats_t* stats); + + +// ------------------------------------------------------------------- +// commit mask +// ------------------------------------------------------------------- + +static bool mi_commit_mask_all_set(const mi_commit_mask_t* commit, const mi_commit_mask_t* cm) { + for (size_t i = 0; i < MI_COMMIT_MASK_FIELD_COUNT; i++) { + if ((commit->mask[i] & cm->mask[i]) != cm->mask[i]) return false; + } + return true; +} + +static bool mi_commit_mask_any_set(const mi_commit_mask_t* commit, const mi_commit_mask_t* cm) { + for (size_t i = 0; i < MI_COMMIT_MASK_FIELD_COUNT; i++) { + if ((commit->mask[i] & cm->mask[i]) != 0) return true; + } + return false; +} + +static void mi_commit_mask_create_intersect(const mi_commit_mask_t* commit, const mi_commit_mask_t* cm, mi_commit_mask_t* res) { + for (size_t i = 0; i < MI_COMMIT_MASK_FIELD_COUNT; i++) { + res->mask[i] = (commit->mask[i] & cm->mask[i]); + } +} + +static void mi_commit_mask_clear(mi_commit_mask_t* res, const mi_commit_mask_t* cm) { + for (size_t i = 0; i < MI_COMMIT_MASK_FIELD_COUNT; i++) { + res->mask[i] &= ~(cm->mask[i]); + } +} + +static void mi_commit_mask_set(mi_commit_mask_t* res, const mi_commit_mask_t* cm) { + for (size_t i = 0; i < MI_COMMIT_MASK_FIELD_COUNT; i++) { + res->mask[i] |= cm->mask[i]; + } +} + +static void mi_commit_mask_create(size_t bitidx, size_t bitcount, mi_commit_mask_t* cm) { + mi_assert_internal(bitidx < MI_COMMIT_MASK_BITS); + mi_assert_internal((bitidx + bitcount) <= MI_COMMIT_MASK_BITS); + if (bitcount == MI_COMMIT_MASK_BITS) { + mi_assert_internal(bitidx==0); + mi_commit_mask_create_full(cm); + } + else if (bitcount == 0) { + mi_commit_mask_create_empty(cm); + } + else { + mi_commit_mask_create_empty(cm); + size_t i = bitidx / MI_COMMIT_MASK_FIELD_BITS; + size_t ofs = bitidx % MI_COMMIT_MASK_FIELD_BITS; + while (bitcount > 0) { + mi_assert_internal(i < MI_COMMIT_MASK_FIELD_COUNT); + size_t avail = MI_COMMIT_MASK_FIELD_BITS - ofs; + size_t count = (bitcount > avail ? avail : bitcount); + size_t mask = (count >= MI_COMMIT_MASK_FIELD_BITS ? ~((size_t)0) : (((size_t)1 << count) - 1) << ofs); + cm->mask[i] = mask; + bitcount -= count; + ofs = 0; + i++; + } + } +} + +size_t _mi_commit_mask_committed_size(const mi_commit_mask_t* cm, size_t total) { + mi_assert_internal((total%MI_COMMIT_MASK_BITS)==0); + size_t count = 0; + for (size_t i = 0; i < MI_COMMIT_MASK_FIELD_COUNT; i++) { + size_t mask = cm->mask[i]; + if (~mask == 0) { + count += MI_COMMIT_MASK_FIELD_BITS; + } + else { + for (; mask != 0; mask >>= 1) { // todo: use popcount + if ((mask&1)!=0) count++; + } + } + } + // we use total since for huge segments each commit bit may represent a larger size + return ((total / MI_COMMIT_MASK_BITS) * count); +} + + +size_t _mi_commit_mask_next_run(const mi_commit_mask_t* cm, size_t* idx) { + size_t i = (*idx) / MI_COMMIT_MASK_FIELD_BITS; + size_t ofs = (*idx) % MI_COMMIT_MASK_FIELD_BITS; + size_t mask = 0; + // find first ones + while (i < MI_COMMIT_MASK_FIELD_COUNT) { + mask = cm->mask[i]; + mask >>= ofs; + if (mask != 0) { + while ((mask&1) == 0) { + mask >>= 1; + ofs++; + } + break; + } + i++; + ofs = 0; + } + if (i >= MI_COMMIT_MASK_FIELD_COUNT) { + // not found + *idx = MI_COMMIT_MASK_BITS; + return 0; + } + else { + // found, count ones + size_t count = 0; + *idx = (i*MI_COMMIT_MASK_FIELD_BITS) + ofs; + do { + mi_assert_internal(ofs < MI_COMMIT_MASK_FIELD_BITS && (mask&1) == 1); + do { + count++; + mask >>= 1; + } while ((mask&1) == 1); + if ((((*idx + count) % MI_COMMIT_MASK_FIELD_BITS) == 0)) { + i++; + if (i >= MI_COMMIT_MASK_FIELD_COUNT) break; + mask = cm->mask[i]; + ofs = 0; + } + } while ((mask&1) == 1); + mi_assert_internal(count > 0); + return count; + } +} -static uint8_t* mi_segment_raw_page_start(const mi_segment_t* segment, const mi_page_t* page, size_t* page_size); /* -------------------------------------------------------------------------------- Segment allocation - We allocate pages inside bigger "segments" (4mb on 64-bit). This is to avoid - splitting VMA's on Linux and reduce fragmentation on other OS's. - Each thread owns its own segments. - - Currently we have: - - small pages (64kb), 64 in one segment - - medium pages (512kb), 8 in one segment - - large pages (4mb), 1 in one segment - - huge blocks > MI_LARGE_OBJ_SIZE_MAX become large segment with 1 page - - In any case the memory for a segment is virtual and usually committed on demand. - (i.e. we are careful to not touch the memory until we actually allocate a block there) If a thread ends, it "abandons" pages with used blocks and there is an abandoned segment list whose segments can @@ -37,72 +154,84 @@ static uint8_t* mi_segment_raw_page_start(const mi_segment_t* segment, const mi_ /* ----------------------------------------------------------- - Queue of segments containing free pages + Slices ----------------------------------------------------------- */ -#if (MI_DEBUG>=3) -static bool mi_segment_queue_contains(const mi_segment_queue_t* queue, const mi_segment_t* segment) { - mi_assert_internal(segment != NULL); - mi_segment_t* list = queue->first; - while (list != NULL) { - if (list == segment) break; - mi_assert_internal(list->next==NULL || list->next->prev == list); - mi_assert_internal(list->prev==NULL || list->prev->next == list); - list = list->next; - } - return (list == segment); -} -#endif -static bool mi_segment_queue_is_empty(const mi_segment_queue_t* queue) { - return (queue->first == NULL); +static const mi_slice_t* mi_segment_slices_end(const mi_segment_t* segment) { + return &segment->slices[segment->slice_entries]; } -static void mi_segment_queue_remove(mi_segment_queue_t* queue, mi_segment_t* segment) { - mi_assert_expensive(mi_segment_queue_contains(queue, segment)); - if (segment->prev != NULL) segment->prev->next = segment->next; - if (segment->next != NULL) segment->next->prev = segment->prev; - if (segment == queue->first) queue->first = segment->next; - if (segment == queue->last) queue->last = segment->prev; - segment->next = NULL; - segment->prev = NULL; +static uint8_t* mi_slice_start(const mi_slice_t* slice) { + mi_segment_t* segment = _mi_ptr_segment(slice); + mi_assert_internal(slice >= segment->slices && slice < mi_segment_slices_end(segment)); + return ((uint8_t*)segment + ((slice - segment->slices)*MI_SEGMENT_SLICE_SIZE)); } -static void mi_segment_enqueue(mi_segment_queue_t* queue, mi_segment_t* segment) { - mi_assert_expensive(!mi_segment_queue_contains(queue, segment)); - segment->next = NULL; - segment->prev = queue->last; - if (queue->last != NULL) { - mi_assert_internal(queue->last->next == NULL); - queue->last->next = segment; - queue->last = segment; - } - else { - queue->last = queue->first = segment; - } + +/* ----------------------------------------------------------- + Bins +----------------------------------------------------------- */ +// Use bit scan forward to quickly find the first zero bit if it is available + +static inline size_t mi_slice_bin8(size_t slice_count) { + if (slice_count<=1) return slice_count; + mi_assert_internal(slice_count <= MI_SLICES_PER_SEGMENT); + slice_count--; + size_t s = mi_bsr(slice_count); // slice_count > 1 + if (s <= 2) return slice_count + 1; + size_t bin = ((s << 2) | ((slice_count >> (s - 2))&0x03)) - 4; + return bin; } -static mi_segment_queue_t* mi_segment_free_queue_of_kind(mi_page_kind_t kind, mi_segments_tld_t* tld) { - if (kind == MI_PAGE_SMALL) return &tld->small_free; - else if (kind == MI_PAGE_MEDIUM) return &tld->medium_free; - else return NULL; +static inline size_t mi_slice_bin(size_t slice_count) { + mi_assert_internal(slice_count*MI_SEGMENT_SLICE_SIZE <= MI_SEGMENT_SIZE); + mi_assert_internal(mi_slice_bin8(MI_SLICES_PER_SEGMENT) <= MI_SEGMENT_BIN_MAX); + size_t bin = mi_slice_bin8(slice_count); + mi_assert_internal(bin <= MI_SEGMENT_BIN_MAX); + return bin; } -static mi_segment_queue_t* mi_segment_free_queue(const mi_segment_t* segment, mi_segments_tld_t* tld) { - return mi_segment_free_queue_of_kind(segment->page_kind, tld); +static inline size_t mi_slice_index(const mi_slice_t* slice) { + mi_segment_t* segment = _mi_ptr_segment(slice); + ptrdiff_t index = slice - segment->slices; + mi_assert_internal(index >= 0 && index < (ptrdiff_t)segment->slice_entries); + return index; } -// remove from free queue if it is in one -static void mi_segment_remove_from_free_queue(mi_segment_t* segment, mi_segments_tld_t* tld) { - mi_segment_queue_t* queue = mi_segment_free_queue(segment, tld); // may be NULL - bool in_queue = (queue!=NULL && (segment->next != NULL || segment->prev != NULL || queue->first == segment)); - if (in_queue) { - mi_segment_queue_remove(queue, segment); - } + +/* ----------------------------------------------------------- + Slice span queues +----------------------------------------------------------- */ + +static void mi_span_queue_push(mi_span_queue_t* sq, mi_slice_t* slice) { + // todo: or push to the end? + mi_assert_internal(slice->prev == NULL && slice->next==NULL); + slice->prev = NULL; // paranoia + slice->next = sq->first; + sq->first = slice; + if (slice->next != NULL) slice->next->prev = slice; + else sq->last = slice; + slice->xblock_size = 0; // free } -static void mi_segment_insert_in_free_queue(mi_segment_t* segment, mi_segments_tld_t* tld) { - mi_segment_enqueue(mi_segment_free_queue(segment, tld), segment); +static mi_span_queue_t* mi_span_queue_for(size_t slice_count, mi_segments_tld_t* tld) { + size_t bin = mi_slice_bin(slice_count); + mi_span_queue_t* sq = &tld->spans[bin]; + mi_assert_internal(sq->slice_count >= slice_count); + return sq; +} + +static void mi_span_queue_delete(mi_span_queue_t* sq, mi_slice_t* slice) { + mi_assert_internal(slice->xblock_size==0 && slice->slice_count>0 && slice->slice_offset==0); + // should work too if the queue does not contain slice (which can happen during reclaim) + if (slice->prev != NULL) slice->prev->next = slice->next; + if (slice == sq->first) sq->first = slice->next; + if (slice->next != NULL) slice->next->prev = slice->prev; + if (slice == sq->last) sq->last = slice->prev; + slice->prev = NULL; + slice->next = NULL; + slice->xblock_size = 1; // no more free } @@ -110,338 +239,125 @@ static void mi_segment_insert_in_free_queue(mi_segment_t* segment, mi_segments_t Invariant checking ----------------------------------------------------------- */ -#if (MI_DEBUG>=2) -static bool mi_segment_is_in_free_queue(const mi_segment_t* segment, mi_segments_tld_t* tld) { - mi_segment_queue_t* queue = mi_segment_free_queue(segment, tld); - bool in_queue = (queue!=NULL && (segment->next != NULL || segment->prev != NULL || queue->first == segment)); - if (in_queue) { - mi_assert_expensive(mi_segment_queue_contains(queue, segment)); - } - return in_queue; -} -#endif - -static size_t mi_segment_page_size(const mi_segment_t* segment) { - if (segment->capacity > 1) { - mi_assert_internal(segment->page_kind <= MI_PAGE_MEDIUM); - return ((size_t)1 << segment->page_shift); - } - else { - mi_assert_internal(segment->page_kind >= MI_PAGE_LARGE); - return segment->segment_size; - } +static bool mi_slice_is_used(const mi_slice_t* slice) { + return (slice->xblock_size > 0); } -#if (MI_DEBUG>=2) -static bool mi_pages_reset_contains(const mi_page_t* page, mi_segments_tld_t* tld) { - mi_page_t* p = tld->pages_reset.first; - while (p != NULL) { - if (p == page) return true; - p = p->next; +#if (MI_DEBUG>=3) +static bool mi_span_queue_contains(mi_span_queue_t* sq, mi_slice_t* slice) { + for (mi_slice_t* s = sq->first; s != NULL; s = s->next) { + if (s==slice) return true; } return false; } -#endif -#if (MI_DEBUG>=3) -static bool mi_segment_is_valid(const mi_segment_t* segment, mi_segments_tld_t* tld) { +static bool mi_segment_is_valid(mi_segment_t* segment, mi_segments_tld_t* tld) { mi_assert_internal(segment != NULL); mi_assert_internal(_mi_ptr_cookie(segment) == segment->cookie); - mi_assert_internal(segment->used <= segment->capacity); mi_assert_internal(segment->abandoned <= segment->used); - size_t nfree = 0; - for (size_t i = 0; i < segment->capacity; i++) { - const mi_page_t* const page = &segment->pages[i]; - if (!page->segment_in_use) { - nfree++; + mi_assert_internal(segment->thread_id == 0 || segment->thread_id == _mi_thread_id()); + mi_assert_internal(mi_commit_mask_all_set(&segment->commit_mask, &segment->purge_mask)); // can only decommit committed blocks + //mi_assert_internal(segment->segment_info_size % MI_SEGMENT_SLICE_SIZE == 0); + mi_slice_t* slice = &segment->slices[0]; + const mi_slice_t* end = mi_segment_slices_end(segment); + size_t used_count = 0; + mi_span_queue_t* sq; + while(slice < end) { + mi_assert_internal(slice->slice_count > 0); + mi_assert_internal(slice->slice_offset == 0); + size_t index = mi_slice_index(slice); + size_t maxindex = (index + slice->slice_count >= segment->slice_entries ? segment->slice_entries : index + slice->slice_count) - 1; + if (mi_slice_is_used(slice)) { // a page in use, we need at least MAX_SLICE_OFFSET valid back offsets + used_count++; + for (size_t i = 0; i <= MI_MAX_SLICE_OFFSET && index + i <= maxindex; i++) { + mi_assert_internal(segment->slices[index + i].slice_offset == i*sizeof(mi_slice_t)); + mi_assert_internal(i==0 || segment->slices[index + i].slice_count == 0); + mi_assert_internal(i==0 || segment->slices[index + i].xblock_size == 1); + } + // and the last entry as well (for coalescing) + const mi_slice_t* last = slice + slice->slice_count - 1; + if (last > slice && last < mi_segment_slices_end(segment)) { + mi_assert_internal(last->slice_offset == (slice->slice_count-1)*sizeof(mi_slice_t)); + mi_assert_internal(last->slice_count == 0); + mi_assert_internal(last->xblock_size == 1); + } } - if (page->segment_in_use || page->is_reset) { - mi_assert_expensive(!mi_pages_reset_contains(page, tld)); + else { // free range of slices; only last slice needs a valid back offset + mi_slice_t* last = &segment->slices[maxindex]; + if (segment->kind != MI_SEGMENT_HUGE || slice->slice_count <= (segment->slice_entries - segment->segment_info_slices)) { + mi_assert_internal((uint8_t*)slice == (uint8_t*)last - last->slice_offset); + } + mi_assert_internal(slice == last || last->slice_count == 0 ); + mi_assert_internal(last->xblock_size == 0 || (segment->kind==MI_SEGMENT_HUGE && last->xblock_size==1)); + if (segment->kind != MI_SEGMENT_HUGE && segment->thread_id != 0) { // segment is not huge or abandoned + sq = mi_span_queue_for(slice->slice_count,tld); + mi_assert_internal(mi_span_queue_contains(sq,slice)); + } } + slice = &segment->slices[maxindex+1]; } - mi_assert_internal(nfree + segment->used == segment->capacity); - // mi_assert_internal(segment->thread_id == _mi_thread_id() || (segment->thread_id==0)); // or 0 - mi_assert_internal(segment->page_kind == MI_PAGE_HUGE || - (mi_segment_page_size(segment) * segment->capacity == segment->segment_size)); + mi_assert_internal(slice == end); + mi_assert_internal(used_count == segment->used + 1); return true; } #endif -static bool mi_page_not_in_queue(const mi_page_t* page, mi_segments_tld_t* tld) { - mi_assert_internal(page != NULL); - if (page->next != NULL || page->prev != NULL) { - mi_assert_internal(mi_pages_reset_contains(page, tld)); - return false; - } - else { - // both next and prev are NULL, check for singleton list - return (tld->pages_reset.first != page && tld->pages_reset.last != page); - } -} - - -/* ----------------------------------------------------------- - Guard pages ------------------------------------------------------------ */ - -static void mi_segment_protect_range(void* p, size_t size, bool protect) { - if (protect) { - _mi_mem_protect(p, size); - } - else { - _mi_mem_unprotect(p, size); - } -} - -static void mi_segment_protect(mi_segment_t* segment, bool protect, mi_os_tld_t* tld) { - // add/remove guard pages - if (MI_SECURE != 0) { - // in secure mode, we set up a protected page in between the segment info and the page data - const size_t os_psize = _mi_os_page_size(); - mi_assert_internal((segment->segment_info_size - os_psize) >= (sizeof(mi_segment_t) + ((segment->capacity - 1) * sizeof(mi_page_t)))); - mi_assert_internal(((uintptr_t)segment + segment->segment_info_size) % os_psize == 0); - mi_segment_protect_range((uint8_t*)segment + segment->segment_info_size - os_psize, os_psize, protect); - if (MI_SECURE <= 1 || segment->capacity == 1) { - // and protect the last (or only) page too - mi_assert_internal(MI_SECURE <= 1 || segment->page_kind >= MI_PAGE_LARGE); - uint8_t* start = (uint8_t*)segment + segment->segment_size - os_psize; - if (protect && !segment->mem_is_committed) { - if (protect) { - // ensure secure page is committed - if (_mi_mem_commit(start, os_psize, NULL, tld)) { // if this fails that is ok (as it is an unaccessible page) - mi_segment_protect_range(start, os_psize, protect); - } - } - } - else { - mi_segment_protect_range(start, os_psize, protect); - } - } - else { - // or protect every page - const size_t page_size = mi_segment_page_size(segment); - for (size_t i = 0; i < segment->capacity; i++) { - if (segment->pages[i].is_committed) { - mi_segment_protect_range((uint8_t*)segment + (i+1)*page_size - os_psize, os_psize, protect); - } - } - } - } -} - -/* ----------------------------------------------------------- - Page reset ------------------------------------------------------------ */ - -static void mi_page_reset(mi_segment_t* segment, mi_page_t* page, size_t size, mi_segments_tld_t* tld) { - mi_assert_internal(page->is_committed); - if (!mi_option_is_enabled(mi_option_page_reset)) return; - if (segment->mem_is_fixed || page->segment_in_use || !page->is_committed || page->is_reset) return; - size_t psize; - void* start = mi_segment_raw_page_start(segment, page, &psize); - page->is_reset = true; - mi_assert_internal(size <= psize); - size_t reset_size = ((size == 0 || size > psize) ? psize : size); - if (reset_size > 0) _mi_mem_reset(start, reset_size, tld->os); -} - -static bool mi_page_unreset(mi_segment_t* segment, mi_page_t* page, size_t size, mi_segments_tld_t* tld) -{ - mi_assert_internal(page->is_reset); - mi_assert_internal(page->is_committed); - mi_assert_internal(!segment->mem_is_fixed); - if (segment->mem_is_fixed || !page->is_committed || !page->is_reset) return true; - page->is_reset = false; - size_t psize; - uint8_t* start = mi_segment_raw_page_start(segment, page, &psize); - size_t unreset_size = (size == 0 || size > psize ? psize : size); - bool is_zero = false; - bool ok = true; - if (unreset_size > 0) { - ok = _mi_mem_unreset(start, unreset_size, &is_zero, tld->os); - } - if (is_zero) page->is_zero_init = true; - return ok; -} - - -/* ----------------------------------------------------------- - The free page queue ------------------------------------------------------------ */ - -// we re-use the `used` field for the expiration counter. Since this is a -// a 32-bit field while the clock is always 64-bit we need to guard -// against overflow, we use substraction to check for expiry which work -// as long as the reset delay is under (2^30 - 1) milliseconds (~12 days) -static void mi_page_reset_set_expire(mi_page_t* page) { - uint32_t expire = (uint32_t)_mi_clock_now() + mi_option_get(mi_option_reset_delay); - page->used = expire; -} - -static bool mi_page_reset_is_expired(mi_page_t* page, mi_msecs_t now) { - int32_t expire = (int32_t)(page->used); - return (((int32_t)now - expire) >= 0); -} - -static void mi_pages_reset_add(mi_segment_t* segment, mi_page_t* page, mi_segments_tld_t* tld) { - mi_assert_internal(!page->segment_in_use || !page->is_committed); - mi_assert_internal(mi_page_not_in_queue(page,tld)); - mi_assert_expensive(!mi_pages_reset_contains(page, tld)); - mi_assert_internal(_mi_page_segment(page)==segment); - if (!mi_option_is_enabled(mi_option_page_reset)) return; - if (segment->mem_is_fixed || page->segment_in_use || !page->is_committed || page->is_reset) return; - - if (mi_option_get(mi_option_reset_delay) == 0) { - // reset immediately? - mi_page_reset(segment, page, 0, tld); - } - else { - // otherwise push on the delayed page reset queue - mi_page_queue_t* pq = &tld->pages_reset; - // push on top - mi_page_reset_set_expire(page); - page->next = pq->first; - page->prev = NULL; - if (pq->first == NULL) { - mi_assert_internal(pq->last == NULL); - pq->first = pq->last = page; - } - else { - pq->first->prev = page; - pq->first = page; - } - } -} - -static void mi_pages_reset_remove(mi_page_t* page, mi_segments_tld_t* tld) { - if (mi_page_not_in_queue(page,tld)) return; - - mi_page_queue_t* pq = &tld->pages_reset; - mi_assert_internal(pq!=NULL); - mi_assert_internal(!page->segment_in_use); - mi_assert_internal(mi_pages_reset_contains(page, tld)); - if (page->prev != NULL) page->prev->next = page->next; - if (page->next != NULL) page->next->prev = page->prev; - if (page == pq->last) pq->last = page->prev; - if (page == pq->first) pq->first = page->next; - page->next = page->prev = NULL; - page->used = 0; -} - -static void mi_pages_reset_remove_all_in_segment(mi_segment_t* segment, bool force_reset, mi_segments_tld_t* tld) { - if (segment->mem_is_fixed) return; // never reset in huge OS pages - for (size_t i = 0; i < segment->capacity; i++) { - mi_page_t* page = &segment->pages[i]; - if (!page->segment_in_use && page->is_committed && !page->is_reset) { - mi_pages_reset_remove(page, tld); - if (force_reset) { - mi_page_reset(segment, page, 0, tld); - } - } - else { - mi_assert_internal(mi_page_not_in_queue(page,tld)); - } - } -} - -static void mi_reset_delayed(mi_segments_tld_t* tld) { - if (!mi_option_is_enabled(mi_option_page_reset)) return; - mi_msecs_t now = _mi_clock_now(); - mi_page_queue_t* pq = &tld->pages_reset; - // from oldest up to the first that has not expired yet - mi_page_t* page = pq->last; - while (page != NULL && mi_page_reset_is_expired(page,now)) { - mi_page_t* const prev = page->prev; // save previous field - mi_page_reset(_mi_page_segment(page), page, 0, tld); - page->used = 0; - page->prev = page->next = NULL; - page = prev; - } - // discard the reset pages from the queue - pq->last = page; - if (page != NULL){ - page->next = NULL; - } - else { - pq->first = NULL; - } -} - - /* ----------------------------------------------------------- Segment size calculations ----------------------------------------------------------- */ -// Raw start of the page available memory; can be used on uninitialized pages (only `segment_idx` must be set) -// The raw start is not taking aligned block allocation into consideration. -static uint8_t* mi_segment_raw_page_start(const mi_segment_t* segment, const mi_page_t* page, size_t* page_size) { - size_t psize = (segment->page_kind == MI_PAGE_HUGE ? segment->segment_size : (size_t)1 << segment->page_shift); - uint8_t* p = (uint8_t*)segment + page->segment_idx * psize; +static size_t mi_segment_info_size(mi_segment_t* segment) { + return segment->segment_info_slices * MI_SEGMENT_SLICE_SIZE; +} - if (page->segment_idx == 0) { - // the first page starts after the segment info (and possible guard page) - p += segment->segment_info_size; - psize -= segment->segment_info_size; +static uint8_t* _mi_segment_page_start_from_slice(const mi_segment_t* segment, const mi_slice_t* slice, size_t xblock_size, size_t* page_size) +{ + ptrdiff_t idx = slice - segment->slices; + size_t psize = (size_t)slice->slice_count * MI_SEGMENT_SLICE_SIZE; + // make the start not OS page aligned for smaller blocks to avoid page/cache effects + // note: the offset must always be an xblock_size multiple since we assume small allocations + // are aligned (see `mi_heap_malloc_aligned`). + size_t start_offset = 0; + if (xblock_size >= MI_INTPTR_SIZE) { + if (xblock_size <= 64) { start_offset = 3*xblock_size; } + else if (xblock_size <= 512) { start_offset = xblock_size; } } + if (page_size != NULL) { *page_size = psize - start_offset; } + return (uint8_t*)segment + ((idx*MI_SEGMENT_SLICE_SIZE) + start_offset); +} - if (MI_SECURE > 1 || (MI_SECURE == 1 && page->segment_idx == segment->capacity - 1)) { - // secure == 1: the last page has an os guard page at the end - // secure > 1: every page has an os guard page - psize -= _mi_os_page_size(); - } - - if (page_size != NULL) *page_size = psize; - mi_assert_internal(page->xblock_size == 0 || _mi_ptr_page(p) == page); +// Start of the page available memory; can be used on uninitialized pages +uint8_t* _mi_segment_page_start(const mi_segment_t* segment, const mi_page_t* page, size_t* page_size) +{ + const mi_slice_t* slice = mi_page_to_slice((mi_page_t*)page); + uint8_t* p = _mi_segment_page_start_from_slice(segment, slice, page->xblock_size, page_size); + mi_assert_internal(page->xblock_size > 0 || _mi_ptr_page(p) == page); mi_assert_internal(_mi_ptr_segment(p) == segment); return p; } -// Start of the page available memory; can be used on uninitialized pages (only `segment_idx` must be set) -uint8_t* _mi_segment_page_start(const mi_segment_t* segment, const mi_page_t* page, size_t block_size, size_t* page_size, size_t* pre_size) -{ - size_t psize; - uint8_t* p = mi_segment_raw_page_start(segment, page, &psize); - if (pre_size != NULL) *pre_size = 0; - if (page->segment_idx == 0 && block_size > 0 && segment->page_kind <= MI_PAGE_MEDIUM) { - // for small and medium objects, ensure the page start is aligned with the block size (PR#66 by kickunderscore) - size_t adjust = block_size - ((uintptr_t)p % block_size); - if (adjust < block_size) { - p += adjust; - psize -= adjust; - if (pre_size != NULL) *pre_size = adjust; - } - mi_assert_internal((uintptr_t)p % block_size == 0); - } - if (page_size != NULL) *page_size = psize; - mi_assert_internal(page->xblock_size==0 || _mi_ptr_page(p) == page); - mi_assert_internal(_mi_ptr_segment(p) == segment); - return p; -} - -static size_t mi_segment_size(size_t capacity, size_t required, size_t* pre_size, size_t* info_size) -{ - const size_t minsize = sizeof(mi_segment_t) + ((capacity - 1) * sizeof(mi_page_t)) + 16 /* padding */; +static size_t mi_segment_calculate_slices(size_t required, size_t* pre_size, size_t* info_slices) { + size_t page_size = _mi_os_page_size(); + size_t isize = _mi_align_up(sizeof(mi_segment_t), page_size); size_t guardsize = 0; - size_t isize = 0; - - if (MI_SECURE == 0) { - // normally no guard pages - isize = _mi_align_up(minsize, 16 * MI_MAX_ALIGN_SIZE); - } - else { + + if (MI_SECURE>0) { // in secure mode, we set up a protected page in between the segment info // and the page data (and one at the end of the segment) - const size_t page_size = _mi_os_page_size(); - isize = _mi_align_up(minsize, page_size); guardsize = page_size; - required = _mi_align_up(required, page_size); + if (required > 0) { + required = _mi_align_up(required, MI_SEGMENT_SLICE_SIZE) + page_size; + } } - if (info_size != NULL) *info_size = isize; - if (pre_size != NULL) *pre_size = isize + guardsize; - return (required==0 ? MI_SEGMENT_SIZE : _mi_align_up( required + isize + 2*guardsize, MI_PAGE_HUGE_ALIGN) ); + if (pre_size != NULL) *pre_size = isize; + isize = _mi_align_up(isize + guardsize, MI_SEGMENT_SLICE_SIZE); + if (info_slices != NULL) *info_slices = isize / MI_SEGMENT_SLICE_SIZE; + size_t segment_size = (required==0 ? MI_SEGMENT_SIZE : _mi_align_up( required + isize + guardsize, MI_SEGMENT_SLICE_SIZE) ); + mi_assert_internal(segment_size % MI_SEGMENT_SLICE_SIZE == 0); + return (segment_size / MI_SEGMENT_SLICE_SIZE); } @@ -460,91 +376,418 @@ static void mi_segments_track_size(long segment_size, mi_segments_tld_t* tld) { if (tld->current_size > tld->peak_size) tld->peak_size = tld->current_size; } -static void mi_segment_os_free(mi_segment_t* segment, size_t segment_size, mi_segments_tld_t* tld) { +static void mi_segment_os_free(mi_segment_t* segment, mi_segments_tld_t* tld) { segment->thread_id = 0; - mi_segments_track_size(-((long)segment_size),tld); - if (MI_SECURE != 0) { - mi_assert_internal(!segment->mem_is_fixed); - mi_segment_protect(segment, false, tld->os); // ensure no more guard pages are set + _mi_segment_map_freed_at(segment); + mi_segments_track_size(-((long)mi_segment_size(segment)),tld); + if (MI_SECURE>0) { + // _mi_os_unprotect(segment, mi_segment_size(segment)); // ensure no more guard pages are set + // unprotect the guard pages; we cannot just unprotect the whole segment size as part may be decommitted + size_t os_pagesize = _mi_os_page_size(); + _mi_os_unprotect((uint8_t*)segment + mi_segment_info_size(segment) - os_pagesize, os_pagesize); + uint8_t* end = (uint8_t*)segment + mi_segment_size(segment) - os_pagesize; + _mi_os_unprotect(end, os_pagesize); } - bool any_reset = false; - bool fully_committed = true; - for (size_t i = 0; i < segment->capacity; i++) { - mi_page_t* page = &segment->pages[i]; - if (!page->is_committed) { fully_committed = false; } - if (page->is_reset) { any_reset = true; } - } - if (any_reset && mi_option_is_enabled(mi_option_reset_decommits)) { - fully_committed = false; - } - _mi_mem_free(segment, segment_size, segment->memid, fully_committed, any_reset, tld->os); + // purge delayed decommits now? (no, leave it to the arena) + // mi_segment_try_purge(segment,true,tld->stats); + + const size_t size = mi_segment_size(segment); + const size_t csize = _mi_commit_mask_committed_size(&segment->commit_mask, size); + + _mi_abandoned_await_readers(); // wait until safe to free + _mi_arena_free(segment, mi_segment_size(segment), csize, segment->memid, tld->stats); } - -// The thread local segment cache is limited to be at most 1/8 of the peak size of segments in use, -#define MI_SEGMENT_CACHE_FRACTION (8) - -// note: returned segment may be partially reset -static mi_segment_t* mi_segment_cache_pop(size_t segment_size, mi_segments_tld_t* tld) { - if (segment_size != 0 && segment_size != MI_SEGMENT_SIZE) return NULL; - mi_segment_t* segment = tld->cache; - if (segment == NULL) return NULL; - tld->cache_count--; - tld->cache = segment->next; - segment->next = NULL; - mi_assert_internal(segment->segment_size == MI_SEGMENT_SIZE); - _mi_stat_decrease(&tld->stats->segments_cache, 1); - return segment; -} - -static bool mi_segment_cache_full(mi_segments_tld_t* tld) -{ - // if (tld->count == 1 && tld->cache_count==0) return false; // always cache at least the final segment of a thread - size_t max_cache = mi_option_get(mi_option_segment_cache); - if (tld->cache_count < max_cache - && tld->cache_count < (1 + (tld->peak_count / MI_SEGMENT_CACHE_FRACTION)) // at least allow a 1 element cache - ) { - return false; - } - // take the opportunity to reduce the segment cache if it is too large (now) - // TODO: this never happens as we check against peak usage, should we use current usage instead? - while (tld->cache_count > max_cache) { //(1 + (tld->peak_count / MI_SEGMENT_CACHE_FRACTION))) { - mi_segment_t* segment = mi_segment_cache_pop(0,tld); - mi_assert_internal(segment != NULL); - if (segment != NULL) mi_segment_os_free(segment, segment->segment_size, tld); - } - return true; -} - -static bool mi_segment_cache_push(mi_segment_t* segment, mi_segments_tld_t* tld) { - mi_assert_internal(!mi_segment_is_in_free_queue(segment, tld)); - mi_assert_internal(segment->next == NULL); - if (segment->segment_size != MI_SEGMENT_SIZE || mi_segment_cache_full(tld)) { - return false; - } - mi_assert_internal(segment->segment_size == MI_SEGMENT_SIZE); - segment->next = tld->cache; - tld->cache = segment; - tld->cache_count++; - _mi_stat_increase(&tld->stats->segments_cache,1); - return true; -} - -// called by threads that are terminating to free cached segments +// called by threads that are terminating void _mi_segment_thread_collect(mi_segments_tld_t* tld) { - mi_segment_t* segment; - while ((segment = mi_segment_cache_pop(0,tld)) != NULL) { - mi_segment_os_free(segment, segment->segment_size, tld); + MI_UNUSED(tld); + // nothing to do +} + + +/* ----------------------------------------------------------- + Commit/Decommit ranges +----------------------------------------------------------- */ + +static void mi_segment_commit_mask(mi_segment_t* segment, bool conservative, uint8_t* p, size_t size, uint8_t** start_p, size_t* full_size, mi_commit_mask_t* cm) { + mi_assert_internal(_mi_ptr_segment(p + 1) == segment); + mi_assert_internal(segment->kind != MI_SEGMENT_HUGE); + mi_commit_mask_create_empty(cm); + if (size == 0 || size > MI_SEGMENT_SIZE || segment->kind == MI_SEGMENT_HUGE) return; + const size_t segstart = mi_segment_info_size(segment); + const size_t segsize = mi_segment_size(segment); + if (p >= (uint8_t*)segment + segsize) return; + + size_t pstart = (p - (uint8_t*)segment); + mi_assert_internal(pstart + size <= segsize); + + size_t start; + size_t end; + if (conservative) { + // decommit conservative + start = _mi_align_up(pstart, MI_COMMIT_SIZE); + end = _mi_align_down(pstart + size, MI_COMMIT_SIZE); + mi_assert_internal(start >= segstart); + mi_assert_internal(end <= segsize); } - mi_assert_internal(tld->cache_count == 0); - mi_assert_internal(tld->cache == NULL); -#if MI_DEBUG>=2 - if (!_mi_is_main_thread()) { - mi_assert_internal(tld->pages_reset.first == NULL); - mi_assert_internal(tld->pages_reset.last == NULL); + else { + // commit liberal + start = _mi_align_down(pstart, MI_MINIMAL_COMMIT_SIZE); + end = _mi_align_up(pstart + size, MI_MINIMAL_COMMIT_SIZE); } -#endif + if (pstart >= segstart && start < segstart) { // note: the mask is also calculated for an initial commit of the info area + start = segstart; + } + if (end > segsize) { + end = segsize; + } + + mi_assert_internal(start <= pstart && (pstart + size) <= end); + mi_assert_internal(start % MI_COMMIT_SIZE==0 && end % MI_COMMIT_SIZE == 0); + *start_p = (uint8_t*)segment + start; + *full_size = (end > start ? end - start : 0); + if (*full_size == 0) return; + + size_t bitidx = start / MI_COMMIT_SIZE; + mi_assert_internal(bitidx < MI_COMMIT_MASK_BITS); + + size_t bitcount = *full_size / MI_COMMIT_SIZE; // can be 0 + if (bitidx + bitcount > MI_COMMIT_MASK_BITS) { + _mi_warning_message("commit mask overflow: idx=%zu count=%zu start=%zx end=%zx p=0x%p size=%zu fullsize=%zu\n", bitidx, bitcount, start, end, p, size, *full_size); + } + mi_assert_internal((bitidx + bitcount) <= MI_COMMIT_MASK_BITS); + mi_commit_mask_create(bitidx, bitcount, cm); +} + +static bool mi_segment_commit(mi_segment_t* segment, uint8_t* p, size_t size, mi_stats_t* stats) { + mi_assert_internal(mi_commit_mask_all_set(&segment->commit_mask, &segment->purge_mask)); + + // commit liberal + uint8_t* start = NULL; + size_t full_size = 0; + mi_commit_mask_t mask; + mi_segment_commit_mask(segment, false /* conservative? */, p, size, &start, &full_size, &mask); + if (mi_commit_mask_is_empty(&mask) || full_size == 0) return true; + + if (!mi_commit_mask_all_set(&segment->commit_mask, &mask)) { + // committing + bool is_zero = false; + mi_commit_mask_t cmask; + mi_commit_mask_create_intersect(&segment->commit_mask, &mask, &cmask); + _mi_stat_decrease(&_mi_stats_main.committed, _mi_commit_mask_committed_size(&cmask, MI_SEGMENT_SIZE)); // adjust for overlap + if (!_mi_os_commit(start, full_size, &is_zero, stats)) return false; + mi_commit_mask_set(&segment->commit_mask, &mask); + } + + // increase purge expiration when using part of delayed purges -- we assume more allocations are coming soon. + if (mi_commit_mask_any_set(&segment->purge_mask, &mask)) { + segment->purge_expire = _mi_clock_now() + mi_option_get(mi_option_purge_delay); + } + + // always clear any delayed purges in our range (as they are either committed now) + mi_commit_mask_clear(&segment->purge_mask, &mask); + return true; +} + +static bool mi_segment_ensure_committed(mi_segment_t* segment, uint8_t* p, size_t size, mi_stats_t* stats) { + mi_assert_internal(mi_commit_mask_all_set(&segment->commit_mask, &segment->purge_mask)); + // note: assumes commit_mask is always full for huge segments as otherwise the commit mask bits can overflow + if (mi_commit_mask_is_full(&segment->commit_mask) && mi_commit_mask_is_empty(&segment->purge_mask)) return true; // fully committed + mi_assert_internal(segment->kind != MI_SEGMENT_HUGE); + return mi_segment_commit(segment, p, size, stats); +} + +static bool mi_segment_purge(mi_segment_t* segment, uint8_t* p, size_t size, mi_stats_t* stats) { + mi_assert_internal(mi_commit_mask_all_set(&segment->commit_mask, &segment->purge_mask)); + if (!segment->allow_purge) return true; + + // purge conservative + uint8_t* start = NULL; + size_t full_size = 0; + mi_commit_mask_t mask; + mi_segment_commit_mask(segment, true /* conservative? */, p, size, &start, &full_size, &mask); + if (mi_commit_mask_is_empty(&mask) || full_size==0) return true; + + if (mi_commit_mask_any_set(&segment->commit_mask, &mask)) { + // purging + mi_assert_internal((void*)start != (void*)segment); + mi_assert_internal(segment->allow_decommit); + const bool decommitted = _mi_os_purge(start, full_size, stats); // reset or decommit + if (decommitted) { + mi_commit_mask_t cmask; + mi_commit_mask_create_intersect(&segment->commit_mask, &mask, &cmask); + _mi_stat_increase(&_mi_stats_main.committed, full_size - _mi_commit_mask_committed_size(&cmask, MI_SEGMENT_SIZE)); // adjust for double counting + mi_commit_mask_clear(&segment->commit_mask, &mask); + } + } + + // always clear any scheduled purges in our range + mi_commit_mask_clear(&segment->purge_mask, &mask); + return true; +} + +static void mi_segment_schedule_purge(mi_segment_t* segment, uint8_t* p, size_t size, mi_stats_t* stats) { + if (!segment->allow_purge) return; + + if (mi_option_get(mi_option_purge_delay) == 0) { + mi_segment_purge(segment, p, size, stats); + } + else { + // register for future purge in the purge mask + uint8_t* start = NULL; + size_t full_size = 0; + mi_commit_mask_t mask; + mi_segment_commit_mask(segment, true /*conservative*/, p, size, &start, &full_size, &mask); + if (mi_commit_mask_is_empty(&mask) || full_size==0) return; + + // update delayed commit + mi_assert_internal(segment->purge_expire > 0 || mi_commit_mask_is_empty(&segment->purge_mask)); + mi_commit_mask_t cmask; + mi_commit_mask_create_intersect(&segment->commit_mask, &mask, &cmask); // only purge what is committed; span_free may try to decommit more + mi_commit_mask_set(&segment->purge_mask, &cmask); + mi_msecs_t now = _mi_clock_now(); + if (segment->purge_expire == 0) { + // no previous purgess, initialize now + segment->purge_expire = now + mi_option_get(mi_option_purge_delay); + } + else if (segment->purge_expire <= now) { + // previous purge mask already expired + if (segment->purge_expire + mi_option_get(mi_option_purge_extend_delay) <= now) { + mi_segment_try_purge(segment, true, stats); + } + else { + segment->purge_expire = now + mi_option_get(mi_option_purge_extend_delay); // (mi_option_get(mi_option_purge_delay) / 8); // wait a tiny bit longer in case there is a series of free's + } + } + else { + // previous purge mask is not yet expired, increase the expiration by a bit. + segment->purge_expire += mi_option_get(mi_option_purge_extend_delay); + } + } +} + +static void mi_segment_try_purge(mi_segment_t* segment, bool force, mi_stats_t* stats) { + if (!segment->allow_purge || mi_commit_mask_is_empty(&segment->purge_mask)) return; + mi_msecs_t now = _mi_clock_now(); + if (!force && now < segment->purge_expire) return; + + mi_commit_mask_t mask = segment->purge_mask; + segment->purge_expire = 0; + mi_commit_mask_create_empty(&segment->purge_mask); + + size_t idx; + size_t count; + mi_commit_mask_foreach(&mask, idx, count) { + // if found, decommit that sequence + if (count > 0) { + uint8_t* p = (uint8_t*)segment + (idx*MI_COMMIT_SIZE); + size_t size = count * MI_COMMIT_SIZE; + mi_segment_purge(segment, p, size, stats); + } + } + mi_commit_mask_foreach_end() + mi_assert_internal(mi_commit_mask_is_empty(&segment->purge_mask)); +} + + +/* ----------------------------------------------------------- + Span free +----------------------------------------------------------- */ + +static bool mi_segment_is_abandoned(mi_segment_t* segment) { + return (segment->thread_id == 0); +} + +// note: can be called on abandoned segments +static void mi_segment_span_free(mi_segment_t* segment, size_t slice_index, size_t slice_count, bool allow_purge, mi_segments_tld_t* tld) { + mi_assert_internal(slice_index < segment->slice_entries); + mi_span_queue_t* sq = (segment->kind == MI_SEGMENT_HUGE || mi_segment_is_abandoned(segment) + ? NULL : mi_span_queue_for(slice_count,tld)); + if (slice_count==0) slice_count = 1; + mi_assert_internal(slice_index + slice_count - 1 < segment->slice_entries); + + // set first and last slice (the intermediates can be undetermined) + mi_slice_t* slice = &segment->slices[slice_index]; + slice->slice_count = (uint32_t)slice_count; + mi_assert_internal(slice->slice_count == slice_count); // no overflow? + slice->slice_offset = 0; + if (slice_count > 1) { + mi_slice_t* last = &segment->slices[slice_index + slice_count - 1]; + last->slice_count = 0; + last->slice_offset = (uint32_t)(sizeof(mi_page_t)*(slice_count - 1)); + last->xblock_size = 0; + } + + // perhaps decommit + if (allow_purge) { + mi_segment_schedule_purge(segment, mi_slice_start(slice), slice_count * MI_SEGMENT_SLICE_SIZE, tld->stats); + } + + // and push it on the free page queue (if it was not a huge page) + if (sq != NULL) mi_span_queue_push( sq, slice ); + else slice->xblock_size = 0; // mark huge page as free anyways +} + +/* +// called from reclaim to add existing free spans +static void mi_segment_span_add_free(mi_slice_t* slice, mi_segments_tld_t* tld) { + mi_segment_t* segment = _mi_ptr_segment(slice); + mi_assert_internal(slice->xblock_size==0 && slice->slice_count>0 && slice->slice_offset==0); + size_t slice_index = mi_slice_index(slice); + mi_segment_span_free(segment,slice_index,slice->slice_count,tld); +} +*/ + +static void mi_segment_span_remove_from_queue(mi_slice_t* slice, mi_segments_tld_t* tld) { + mi_assert_internal(slice->slice_count > 0 && slice->slice_offset==0 && slice->xblock_size==0); + mi_assert_internal(_mi_ptr_segment(slice)->kind != MI_SEGMENT_HUGE); + mi_span_queue_t* sq = mi_span_queue_for(slice->slice_count, tld); + mi_span_queue_delete(sq, slice); +} + +// note: can be called on abandoned segments +static mi_slice_t* mi_segment_span_free_coalesce(mi_slice_t* slice, mi_segments_tld_t* tld) { + mi_assert_internal(slice != NULL && slice->slice_count > 0 && slice->slice_offset == 0); + mi_segment_t* segment = _mi_ptr_segment(slice); + bool is_abandoned = mi_segment_is_abandoned(segment); + + // for huge pages, just mark as free but don't add to the queues + if (segment->kind == MI_SEGMENT_HUGE) { + // issue #691: segment->used can be 0 if the huge page block was freed while abandoned (reclaim will get here in that case) + mi_assert_internal((segment->used==0 && slice->xblock_size==0) || segment->used == 1); // decreased right after this call in `mi_segment_page_clear` + slice->xblock_size = 0; // mark as free anyways + // we should mark the last slice `xblock_size=0` now to maintain invariants but we skip it to + // avoid a possible cache miss (and the segment is about to be freed) + return slice; + } + + // otherwise coalesce the span and add to the free span queues + size_t slice_count = slice->slice_count; + mi_slice_t* next = slice + slice->slice_count; + mi_assert_internal(next <= mi_segment_slices_end(segment)); + if (next < mi_segment_slices_end(segment) && next->xblock_size==0) { + // free next block -- remove it from free and merge + mi_assert_internal(next->slice_count > 0 && next->slice_offset==0); + slice_count += next->slice_count; // extend + if (!is_abandoned) { mi_segment_span_remove_from_queue(next, tld); } + } + if (slice > segment->slices) { + mi_slice_t* prev = mi_slice_first(slice - 1); + mi_assert_internal(prev >= segment->slices); + if (prev->xblock_size==0) { + // free previous slice -- remove it from free and merge + mi_assert_internal(prev->slice_count > 0 && prev->slice_offset==0); + slice_count += prev->slice_count; + if (!is_abandoned) { mi_segment_span_remove_from_queue(prev, tld); } + slice = prev; + } + } + + // and add the new free page + mi_segment_span_free(segment, mi_slice_index(slice), slice_count, true, tld); + return slice; +} + + + +/* ----------------------------------------------------------- + Page allocation +----------------------------------------------------------- */ + +// Note: may still return NULL if committing the memory failed +static mi_page_t* mi_segment_span_allocate(mi_segment_t* segment, size_t slice_index, size_t slice_count, mi_segments_tld_t* tld) { + mi_assert_internal(slice_index < segment->slice_entries); + mi_slice_t* const slice = &segment->slices[slice_index]; + mi_assert_internal(slice->xblock_size==0 || slice->xblock_size==1); + + // commit before changing the slice data + if (!mi_segment_ensure_committed(segment, _mi_segment_page_start_from_slice(segment, slice, 0, NULL), slice_count * MI_SEGMENT_SLICE_SIZE, tld->stats)) { + return NULL; // commit failed! + } + + // convert the slices to a page + slice->slice_offset = 0; + slice->slice_count = (uint32_t)slice_count; + mi_assert_internal(slice->slice_count == slice_count); + const size_t bsize = slice_count * MI_SEGMENT_SLICE_SIZE; + slice->xblock_size = (uint32_t)(bsize >= MI_HUGE_BLOCK_SIZE ? MI_HUGE_BLOCK_SIZE : bsize); + mi_page_t* page = mi_slice_to_page(slice); + mi_assert_internal(mi_page_block_size(page) == bsize); + + // set slice back pointers for the first MI_MAX_SLICE_OFFSET entries + size_t extra = slice_count-1; + if (extra > MI_MAX_SLICE_OFFSET) extra = MI_MAX_SLICE_OFFSET; + if (slice_index + extra >= segment->slice_entries) extra = segment->slice_entries - slice_index - 1; // huge objects may have more slices than avaiable entries in the segment->slices + + mi_slice_t* slice_next = slice + 1; + for (size_t i = 1; i <= extra; i++, slice_next++) { + slice_next->slice_offset = (uint32_t)(sizeof(mi_slice_t)*i); + slice_next->slice_count = 0; + slice_next->xblock_size = 1; + } + + // and also for the last one (if not set already) (the last one is needed for coalescing and for large alignments) + // note: the cast is needed for ubsan since the index can be larger than MI_SLICES_PER_SEGMENT for huge allocations (see #543) + mi_slice_t* last = slice + slice_count - 1; + mi_slice_t* end = (mi_slice_t*)mi_segment_slices_end(segment); + if (last > end) last = end; + if (last > slice) { + last->slice_offset = (uint32_t)(sizeof(mi_slice_t) * (last - slice)); + last->slice_count = 0; + last->xblock_size = 1; + } + + // and initialize the page + page->is_committed = true; + segment->used++; + return page; +} + +static void mi_segment_slice_split(mi_segment_t* segment, mi_slice_t* slice, size_t slice_count, mi_segments_tld_t* tld) { + mi_assert_internal(_mi_ptr_segment(slice) == segment); + mi_assert_internal(slice->slice_count >= slice_count); + mi_assert_internal(slice->xblock_size > 0); // no more in free queue + if (slice->slice_count <= slice_count) return; + mi_assert_internal(segment->kind != MI_SEGMENT_HUGE); + size_t next_index = mi_slice_index(slice) + slice_count; + size_t next_count = slice->slice_count - slice_count; + mi_segment_span_free(segment, next_index, next_count, false /* don't purge left-over part */, tld); + slice->slice_count = (uint32_t)slice_count; +} + +static mi_page_t* mi_segments_page_find_and_allocate(size_t slice_count, mi_arena_id_t req_arena_id, mi_segments_tld_t* tld) { + mi_assert_internal(slice_count*MI_SEGMENT_SLICE_SIZE <= MI_LARGE_OBJ_SIZE_MAX); + // search from best fit up + mi_span_queue_t* sq = mi_span_queue_for(slice_count, tld); + if (slice_count == 0) slice_count = 1; + while (sq <= &tld->spans[MI_SEGMENT_BIN_MAX]) { + for (mi_slice_t* slice = sq->first; slice != NULL; slice = slice->next) { + if (slice->slice_count >= slice_count) { + // found one + mi_segment_t* segment = _mi_ptr_segment(slice); + if (_mi_arena_memid_is_suitable(segment->memid, req_arena_id)) { + // found a suitable page span + mi_span_queue_delete(sq, slice); + + if (slice->slice_count > slice_count) { + mi_segment_slice_split(segment, slice, slice_count, tld); + } + mi_assert_internal(slice != NULL && slice->slice_count == slice_count && slice->xblock_size > 0); + mi_page_t* page = mi_segment_span_allocate(segment, mi_slice_index(slice), slice->slice_count, tld); + if (page == NULL) { + // commit failed; return NULL but first restore the slice + mi_segment_span_free_coalesce(slice, tld); + return NULL; + } + return page; + } + } + } + sq++; + } + // could not find a page.. + return NULL; } @@ -552,292 +795,237 @@ void _mi_segment_thread_collect(mi_segments_tld_t* tld) { Segment allocation ----------------------------------------------------------- */ -// Allocate a segment from the OS aligned to `MI_SEGMENT_SIZE` . -static mi_segment_t* mi_segment_init(mi_segment_t* segment, size_t required, mi_page_kind_t page_kind, size_t page_shift, mi_segments_tld_t* tld, mi_os_tld_t* os_tld) +static mi_segment_t* mi_segment_os_alloc( size_t required, size_t page_alignment, bool eager_delayed, mi_arena_id_t req_arena_id, + size_t* psegment_slices, size_t* ppre_size, size_t* pinfo_slices, + bool commit, mi_segments_tld_t* tld, mi_os_tld_t* os_tld) + { - // the segment parameter is non-null if it came from our cache - mi_assert_internal(segment==NULL || (required==0 && page_kind <= MI_PAGE_LARGE)); - - // calculate needed sizes first - size_t capacity; - if (page_kind == MI_PAGE_HUGE) { - mi_assert_internal(page_shift == MI_SEGMENT_SHIFT && required > 0); - capacity = 1; + mi_memid_t memid; + bool allow_large = (!eager_delayed && (MI_SECURE == 0)); // only allow large OS pages once we are no longer lazy + size_t align_offset = 0; + size_t alignment = MI_SEGMENT_ALIGN; + + if (page_alignment > 0) { + // mi_assert_internal(huge_page != NULL); + mi_assert_internal(page_alignment >= MI_SEGMENT_ALIGN); + alignment = page_alignment; + const size_t info_size = (*pinfo_slices) * MI_SEGMENT_SLICE_SIZE; + align_offset = _mi_align_up( info_size, MI_SEGMENT_ALIGN ); + const size_t extra = align_offset - info_size; + // recalculate due to potential guard pages + *psegment_slices = mi_segment_calculate_slices(required + extra, ppre_size, pinfo_slices); } - else { - mi_assert_internal(required == 0); - size_t page_size = (size_t)1 << page_shift; - capacity = MI_SEGMENT_SIZE / page_size; - mi_assert_internal(MI_SEGMENT_SIZE % page_size == 0); - mi_assert_internal(capacity >= 1 && capacity <= MI_SMALL_PAGES_PER_SEGMENT); - } - size_t info_size; - size_t pre_size; - size_t segment_size = mi_segment_size(capacity, required, &pre_size, &info_size); - mi_assert_internal(segment_size >= required); - // Initialize parameters - const bool eager_delayed = (page_kind <= MI_PAGE_MEDIUM && tld->count < (size_t)mi_option_get(mi_option_eager_commit_delay)); - const bool eager = !eager_delayed && mi_option_is_enabled(mi_option_eager_commit); - bool commit = eager; // || (page_kind >= MI_PAGE_LARGE); - bool pages_still_good = false; - bool is_zero = false; - - // Try to get it from our thread local cache first - if (segment != NULL) { - // came from cache - mi_assert_internal(segment->segment_size == segment_size); - if (page_kind <= MI_PAGE_MEDIUM && segment->page_kind == page_kind && segment->segment_size == segment_size) { - pages_still_good = true; - } - else - { - if (MI_SECURE!=0) { - mi_assert_internal(!segment->mem_is_fixed); - mi_segment_protect(segment, false, tld->os); // reset protection if the page kind differs - } - // different page kinds; unreset any reset pages, and unprotect - // TODO: optimize cache pop to return fitting pages if possible? - for (size_t i = 0; i < segment->capacity; i++) { - mi_page_t* page = &segment->pages[i]; - if (page->is_reset) { - if (!commit && mi_option_is_enabled(mi_option_reset_decommits)) { - page->is_reset = false; - } - else { - mi_page_unreset(segment, page, 0, tld); // todo: only unreset the part that was reset? (instead of the full page) - } - } - } - // ensure the initial info is committed - if (segment->capacity < capacity) { - bool commit_zero = false; - bool ok = _mi_mem_commit(segment, pre_size, &commit_zero, tld->os); - if (commit_zero) is_zero = true; - if (!ok) { - return NULL; - } - } - } + const size_t segment_size = (*psegment_slices) * MI_SEGMENT_SLICE_SIZE; + mi_segment_t* segment = (mi_segment_t*)_mi_arena_alloc_aligned(segment_size, alignment, align_offset, commit, allow_large, req_arena_id, &memid, os_tld); + if (segment == NULL) { + return NULL; // failed to allocate } - else { - // Allocate the segment from the OS - size_t memid; - bool mem_large = (!eager_delayed && (MI_SECURE==0)); // only allow large OS pages once we are no longer lazy - segment = (mi_segment_t*)_mi_mem_alloc_aligned(segment_size, MI_SEGMENT_SIZE, &commit, &mem_large, &is_zero, &memid, os_tld); - if (segment == NULL) return NULL; // failed to allocate - if (!commit) { - // ensure the initial info is committed - bool commit_zero = false; - bool ok = _mi_mem_commit(segment, pre_size, &commit_zero, tld->os); - if (commit_zero) is_zero = true; - if (!ok) { - // commit failed; we cannot touch the memory: free the segment directly and return `NULL` - _mi_mem_free(segment, MI_SEGMENT_SIZE, memid, false, false, os_tld); - return NULL; - } - } - segment->memid = memid; - segment->mem_is_fixed = mem_large; - segment->mem_is_committed = commit; - mi_segments_track_size((long)segment_size, tld); + + // ensure metadata part of the segment is committed + mi_commit_mask_t commit_mask; + if (memid.initially_committed) { + mi_commit_mask_create_full(&commit_mask); + } + else { + // at least commit the info slices + const size_t commit_needed = _mi_divide_up((*pinfo_slices)*MI_SEGMENT_SLICE_SIZE, MI_COMMIT_SIZE); + mi_assert_internal(commit_needed>0); + mi_commit_mask_create(0, commit_needed, &commit_mask); + mi_assert_internal(commit_needed*MI_COMMIT_SIZE >= (*pinfo_slices)*MI_SEGMENT_SLICE_SIZE); + if (!_mi_os_commit(segment, commit_needed*MI_COMMIT_SIZE, NULL, tld->stats)) { + _mi_arena_free(segment,segment_size,0,memid,tld->stats); + return NULL; + } } mi_assert_internal(segment != NULL && (uintptr_t)segment % MI_SEGMENT_SIZE == 0); - mi_assert_internal(segment->mem_is_fixed ? segment->mem_is_committed : true); - mi_atomic_store_ptr_release(mi_segment_t, &segment->abandoned_next, NULL); // tsan - if (!pages_still_good) { - // zero the segment info (but not the `mem` fields) - ptrdiff_t ofs = offsetof(mi_segment_t, next); - memset((uint8_t*)segment + ofs, 0, info_size - ofs); - // initialize pages info - for (uint8_t i = 0; i < capacity; i++) { - segment->pages[i].segment_idx = i; - segment->pages[i].is_reset = false; - segment->pages[i].is_committed = commit; - segment->pages[i].is_zero_init = is_zero; - } - } - else { - // zero the segment info but not the pages info (and mem fields) - ptrdiff_t ofs = offsetof(mi_segment_t, next); - memset((uint8_t*)segment + ofs, 0, offsetof(mi_segment_t,pages) - ofs); - } - - // initialize - segment->page_kind = page_kind; - segment->capacity = capacity; - segment->page_shift = page_shift; + segment->memid = memid; + segment->allow_decommit = !memid.is_pinned; + segment->allow_purge = segment->allow_decommit && (mi_option_get(mi_option_purge_delay) >= 0); segment->segment_size = segment_size; - segment->segment_info_size = pre_size; - segment->thread_id = _mi_thread_id(); - segment->cookie = _mi_ptr_cookie(segment); - // _mi_stat_increase(&tld->stats->page_committed, segment->segment_info_size); - - // set protection - mi_segment_protect(segment, true, tld->os); - - // insert in free lists for small and medium pages - if (page_kind <= MI_PAGE_MEDIUM) { - mi_segment_insert_in_free_queue(segment, tld); - } - - //fprintf(stderr,"mimalloc: alloc segment at %p\n", (void*)segment); + segment->commit_mask = commit_mask; + segment->purge_expire = 0; + mi_commit_mask_create_empty(&segment->purge_mask); + mi_atomic_store_ptr_release(mi_segment_t, &segment->abandoned_next, NULL); // tsan + + mi_segments_track_size((long)(segment_size), tld); + _mi_segment_map_allocated_at(segment); return segment; } -static mi_segment_t* mi_segment_alloc(size_t required, mi_page_kind_t page_kind, size_t page_shift, mi_segments_tld_t* tld, mi_os_tld_t* os_tld) { - return mi_segment_init(NULL, required, page_kind, page_shift, tld, os_tld); -} -static void mi_segment_free(mi_segment_t* segment, bool force, mi_segments_tld_t* tld) { - UNUSED(force); - mi_assert(segment != NULL); - // note: don't reset pages even on abandon as the whole segment is freed? (and ready for reuse) - bool force_reset = (force && mi_option_is_enabled(mi_option_abandoned_page_reset)); - mi_pages_reset_remove_all_in_segment(segment, force_reset, tld); - mi_segment_remove_from_free_queue(segment,tld); +// Allocate a segment from the OS aligned to `MI_SEGMENT_SIZE` . +static mi_segment_t* mi_segment_alloc(size_t required, size_t page_alignment, mi_arena_id_t req_arena_id, mi_segments_tld_t* tld, mi_os_tld_t* os_tld, mi_page_t** huge_page) +{ + mi_assert_internal((required==0 && huge_page==NULL) || (required>0 && huge_page != NULL)); + + // calculate needed sizes first + size_t info_slices; + size_t pre_size; + size_t segment_slices = mi_segment_calculate_slices(required, &pre_size, &info_slices); + + // Commit eagerly only if not the first N lazy segments (to reduce impact of many threads that allocate just a little) + const bool eager_delay = (// !_mi_os_has_overcommit() && // never delay on overcommit systems + _mi_current_thread_count() > 1 && // do not delay for the first N threads + tld->count < (size_t)mi_option_get(mi_option_eager_commit_delay)); + const bool eager = !eager_delay && mi_option_is_enabled(mi_option_eager_commit); + bool commit = eager || (required > 0); + + // Allocate the segment from the OS + mi_segment_t* segment = mi_segment_os_alloc(required, page_alignment, eager_delay, req_arena_id, + &segment_slices, &pre_size, &info_slices, commit, tld, os_tld); + if (segment == NULL) return NULL; + + // zero the segment info? -- not always needed as it may be zero initialized from the OS + if (!segment->memid.initially_zero) { + ptrdiff_t ofs = offsetof(mi_segment_t, next); + size_t prefix = offsetof(mi_segment_t, slices) - ofs; + size_t zsize = prefix + (sizeof(mi_slice_t) * (segment_slices + 1)); // one more + _mi_memzero((uint8_t*)segment + ofs, zsize); + } + + // initialize the rest of the segment info + const size_t slice_entries = (segment_slices > MI_SLICES_PER_SEGMENT ? MI_SLICES_PER_SEGMENT : segment_slices); + segment->segment_slices = segment_slices; + segment->segment_info_slices = info_slices; + segment->thread_id = _mi_thread_id(); + segment->cookie = _mi_ptr_cookie(segment); + segment->slice_entries = slice_entries; + segment->kind = (required == 0 ? MI_SEGMENT_NORMAL : MI_SEGMENT_HUGE); - mi_assert_expensive(!mi_segment_queue_contains(&tld->small_free, segment)); - mi_assert_expensive(!mi_segment_queue_contains(&tld->medium_free, segment)); - mi_assert(segment->next == NULL); - mi_assert(segment->prev == NULL); - _mi_stat_decrease(&tld->stats->page_committed, segment->segment_info_size); + // _mi_memzero(segment->slices, sizeof(mi_slice_t)*(info_slices+1)); + _mi_stat_increase(&tld->stats->page_committed, mi_segment_info_size(segment)); - if (!force && mi_segment_cache_push(segment, tld)) { - // it is put in our cache + // set up guard pages + size_t guard_slices = 0; + if (MI_SECURE>0) { + // in secure mode, we set up a protected page in between the segment info + // and the page data, and at the end of the segment. + size_t os_pagesize = _mi_os_page_size(); + mi_assert_internal(mi_segment_info_size(segment) - os_pagesize >= pre_size); + _mi_os_protect((uint8_t*)segment + mi_segment_info_size(segment) - os_pagesize, os_pagesize); + uint8_t* end = (uint8_t*)segment + mi_segment_size(segment) - os_pagesize; + mi_segment_ensure_committed(segment, end, os_pagesize, tld->stats); + _mi_os_protect(end, os_pagesize); + if (slice_entries == segment_slices) segment->slice_entries--; // don't use the last slice :-( + guard_slices = 1; + } + + // reserve first slices for segment info + mi_page_t* page0 = mi_segment_span_allocate(segment, 0, info_slices, tld); + mi_assert_internal(page0!=NULL); if (page0==NULL) return NULL; // cannot fail as we always commit in advance + mi_assert_internal(segment->used == 1); + segment->used = 0; // don't count our internal slices towards usage + + // initialize initial free pages + if (segment->kind == MI_SEGMENT_NORMAL) { // not a huge page + mi_assert_internal(huge_page==NULL); + mi_segment_span_free(segment, info_slices, segment->slice_entries - info_slices, false /* don't purge */, tld); } else { - // otherwise return it to the OS - mi_segment_os_free(segment, segment->segment_size, tld); + mi_assert_internal(huge_page!=NULL); + mi_assert_internal(mi_commit_mask_is_empty(&segment->purge_mask)); + mi_assert_internal(mi_commit_mask_is_full(&segment->commit_mask)); + *huge_page = mi_segment_span_allocate(segment, info_slices, segment_slices - info_slices - guard_slices, tld); + mi_assert_internal(*huge_page != NULL); // cannot fail as we commit in advance } + + mi_assert_expensive(mi_segment_is_valid(segment,tld)); + return segment; } -/* ----------------------------------------------------------- - Free page management inside a segment ------------------------------------------------------------ */ +static void mi_segment_free(mi_segment_t* segment, bool force, mi_segments_tld_t* tld) { + MI_UNUSED(force); + mi_assert_internal(segment != NULL); + mi_assert_internal(segment->next == NULL); + mi_assert_internal(segment->used == 0); -static bool mi_segment_has_free(const mi_segment_t* segment) { - return (segment->used < segment->capacity); -} - -static bool mi_segment_page_claim(mi_segment_t* segment, mi_page_t* page, mi_segments_tld_t* tld) { - mi_assert_internal(_mi_page_segment(page) == segment); - mi_assert_internal(!page->segment_in_use); - mi_pages_reset_remove(page, tld); - // check commit - if (!page->is_committed) { - mi_assert_internal(!segment->mem_is_fixed); - mi_assert_internal(!page->is_reset); - size_t psize; - uint8_t* start = mi_segment_raw_page_start(segment, page, &psize); - bool is_zero = false; - const size_t gsize = (MI_SECURE >= 2 ? _mi_os_page_size() : 0); - bool ok = _mi_mem_commit(start, psize + gsize, &is_zero, tld->os); - if (!ok) return false; // failed to commit! - if (gsize > 0) { mi_segment_protect_range(start + psize, gsize, true); } - if (is_zero) { page->is_zero_init = true; } - page->is_committed = true; - } - // set in-use before doing unreset to prevent delayed reset - page->segment_in_use = true; - segment->used++; - // check reset - if (page->is_reset) { - mi_assert_internal(!segment->mem_is_fixed); - bool ok = mi_page_unreset(segment, page, 0, tld); - if (!ok) { - page->segment_in_use = false; - segment->used--; - return false; + // Remove the free pages + mi_slice_t* slice = &segment->slices[0]; + const mi_slice_t* end = mi_segment_slices_end(segment); + #if MI_DEBUG>1 + size_t page_count = 0; + #endif + while (slice < end) { + mi_assert_internal(slice->slice_count > 0); + mi_assert_internal(slice->slice_offset == 0); + mi_assert_internal(mi_slice_index(slice)==0 || slice->xblock_size == 0); // no more used pages .. + if (slice->xblock_size == 0 && segment->kind != MI_SEGMENT_HUGE) { + mi_segment_span_remove_from_queue(slice, tld); } + #if MI_DEBUG>1 + page_count++; + #endif + slice = slice + slice->slice_count; } - mi_assert_internal(page->segment_in_use); - mi_assert_internal(segment->used <= segment->capacity); - if (segment->used == segment->capacity && segment->page_kind <= MI_PAGE_MEDIUM) { - // if no more free pages, remove from the queue - mi_assert_internal(!mi_segment_has_free(segment)); - mi_segment_remove_from_free_queue(segment, tld); - } - return true; + mi_assert_internal(page_count == 2); // first page is allocated by the segment itself + + // stats + _mi_stat_decrease(&tld->stats->page_committed, mi_segment_info_size(segment)); + + // return it to the OS + mi_segment_os_free(segment, tld); } /* ----------------------------------------------------------- - Free + Page Free ----------------------------------------------------------- */ static void mi_segment_abandon(mi_segment_t* segment, mi_segments_tld_t* tld); -// clear page data; can be called on abandoned segments -static void mi_segment_page_clear(mi_segment_t* segment, mi_page_t* page, bool allow_reset, mi_segments_tld_t* tld) -{ - mi_assert_internal(page->segment_in_use); +// note: can be called on abandoned pages +static mi_slice_t* mi_segment_page_clear(mi_page_t* page, mi_segments_tld_t* tld) { + mi_assert_internal(page->xblock_size > 0); mi_assert_internal(mi_page_all_free(page)); - mi_assert_internal(page->is_committed); - mi_assert_internal(mi_page_not_in_queue(page, tld)); - + mi_segment_t* segment = _mi_ptr_segment(page); + mi_assert_internal(segment->used > 0); + size_t inuse = page->capacity * mi_page_block_size(page); _mi_stat_decrease(&tld->stats->page_committed, inuse); _mi_stat_decrease(&tld->stats->pages, 1); - // calculate the used size from the raw (non-aligned) start of the page - //size_t pre_size; - //_mi_segment_page_start(segment, page, page->block_size, NULL, &pre_size); - //size_t used_size = pre_size + (page->capacity * page->block_size); - - page->is_zero_init = false; - page->segment_in_use = false; - // reset the page memory to reduce memory pressure? - // note: must come after setting `segment_in_use` to false but before block_size becomes 0 - //mi_page_reset(segment, page, 0 /*used_size*/, tld); - - // zero the page data, but not the segment fields and capacity, and block_size (for page size calculations) - uint32_t block_size = page->xblock_size; - uint16_t capacity = page->capacity; - uint16_t reserved = page->reserved; - ptrdiff_t ofs = offsetof(mi_page_t,capacity); - memset((uint8_t*)page + ofs, 0, sizeof(*page) - ofs); - page->capacity = capacity; - page->reserved = reserved; - page->xblock_size = block_size; - segment->used--; - - // add to the free page list for reuse/reset - if (allow_reset) { - mi_pages_reset_add(segment, page, tld); + if (segment->allow_decommit && mi_option_is_enabled(mi_option_deprecated_page_reset)) { + size_t psize; + uint8_t* start = _mi_page_start(segment, page, &psize); + _mi_os_reset(start, psize, tld->stats); } - page->capacity = 0; // after reset these can be zero'd now - page->reserved = 0; + // zero the page data, but not the segment fields + page->is_zero_init = false; + ptrdiff_t ofs = offsetof(mi_page_t, capacity); + _mi_memzero((uint8_t*)page + ofs, sizeof(*page) - ofs); + page->xblock_size = 1; + + // and free it + mi_slice_t* slice = mi_segment_span_free_coalesce(mi_page_to_slice(page), tld); + segment->used--; + // cannot assert segment valid as it is called during reclaim + // mi_assert_expensive(mi_segment_is_valid(segment, tld)); + return slice; } void _mi_segment_page_free(mi_page_t* page, bool force, mi_segments_tld_t* tld) { mi_assert(page != NULL); + mi_segment_t* segment = _mi_page_segment(page); mi_assert_expensive(mi_segment_is_valid(segment,tld)); - mi_reset_delayed(tld); // mark it as free now - mi_segment_page_clear(segment, page, true, tld); + mi_segment_page_clear(page, tld); + mi_assert_expensive(mi_segment_is_valid(segment, tld)); if (segment->used == 0) { // no more used pages; remove from the free list and free the segment mi_segment_free(segment, force, tld); } - else { - if (segment->used == segment->abandoned) { - // only abandoned pages; remove from free list and abandon - mi_segment_abandon(segment,tld); - } - else if (segment->used + 1 == segment->capacity) { - mi_assert_internal(segment->page_kind <= MI_PAGE_MEDIUM); // for now we only support small and medium pages - // move back to segments free list - mi_segment_insert_in_free_queue(segment,tld); - } + else if (segment->used == segment->abandoned) { + // only abandoned pages; remove from free list and abandon + mi_segment_abandon(segment,tld); } } @@ -846,7 +1034,7 @@ void _mi_segment_page_free(mi_page_t* page, bool force, mi_segments_tld_t* tld) Abandonment When threads terminate, they can leave segments with -live blocks (reached through other threads). Such segments +live blocks (reachable through other threads). Such segments are "abandoned" and will be reclaimed by other threads to reuse their pages and/or free them eventually @@ -854,18 +1042,18 @@ We maintain a global list of abandoned segments that are reclaimed on demand. Since this is shared among threads the implementation needs to avoid the A-B-A problem on popping abandoned segments: -We use tagged pointers to avoid accidentially identifying +We use tagged pointers to avoid accidentally identifying reused segments, much like stamped references in Java. Secondly, we maintain a reader counter to avoid resetting or decommitting segments that have a pending read operation. Note: the current implementation is one possible design; another way might be to keep track of abandoned segments -in the regions. This would have the advantage of keeping +in the arenas/segment_cache's. This would have the advantage of keeping all concurrent code in one place and not needing to deal with ABA issues. The drawback is that it is unclear how to scan abandoned segments efficiently in that case as they -would be spread among all other segments in the regions. +would be spread among all other segments in the arenas. ----------------------------------------------------------- */ // Use the bottom 20-bits (on 64-bit) of the aligned segment pointers @@ -892,19 +1080,19 @@ static mi_decl_cache_align _Atomic(mi_segment_t*) abandoned_visited; // = static mi_decl_cache_align _Atomic(mi_tagged_segment_t) abandoned; // = NULL // Maintain these for debug purposes (these counts may be a bit off) -static mi_decl_cache_align _Atomic(uintptr_t) abandoned_count; -static mi_decl_cache_align _Atomic(uintptr_t) abandoned_visited_count; +static mi_decl_cache_align _Atomic(size_t) abandoned_count; +static mi_decl_cache_align _Atomic(size_t) abandoned_visited_count; // We also maintain a count of current readers of the abandoned list // in order to prevent resetting/decommitting segment memory if it might // still be read. -static mi_decl_cache_align _Atomic(uintptr_t) abandoned_readers; // = 0 +static mi_decl_cache_align _Atomic(size_t) abandoned_readers; // = 0 // Push on the visited list static void mi_abandoned_visited_push(mi_segment_t* segment) { mi_assert_internal(segment->thread_id == 0); mi_assert_internal(mi_atomic_load_ptr_relaxed(mi_segment_t,&segment->abandoned_next) == NULL); - mi_assert_internal(segment->next == NULL && segment->prev == NULL); + mi_assert_internal(segment->next == NULL); mi_assert_internal(segment->used > 0); mi_segment_t* anext = mi_atomic_load_ptr_relaxed(mi_segment_t, &abandoned_visited); do { @@ -927,7 +1115,7 @@ static bool mi_abandoned_visited_revisit(void) mi_tagged_segment_t afirst; mi_tagged_segment_t ts = mi_atomic_load_relaxed(&abandoned); if (mi_tagged_segment_ptr(ts)==NULL) { - uintptr_t count = mi_atomic_load_relaxed(&abandoned_visited_count); + size_t count = mi_atomic_load_relaxed(&abandoned_visited_count); afirst = mi_tagged_segment(first, ts); if (mi_atomic_cas_strong_acq_rel(&abandoned, &ts, afirst)) { mi_atomic_add_relaxed(&abandoned_count, count); @@ -946,7 +1134,7 @@ static bool mi_abandoned_visited_revisit(void) // and atomically prepend to the abandoned list // (no need to increase the readers as we don't access the abandoned segments) mi_tagged_segment_t anext = mi_atomic_load_relaxed(&abandoned); - uintptr_t count; + size_t count; do { count = mi_atomic_load_relaxed(&abandoned_visited_count); mi_atomic_store_ptr_release(mi_segment_t, &last->abandoned_next, mi_tagged_segment_ptr(anext)); @@ -961,7 +1149,7 @@ static bool mi_abandoned_visited_revisit(void) static void mi_abandoned_push(mi_segment_t* segment) { mi_assert_internal(segment->thread_id == 0); mi_assert_internal(mi_atomic_load_ptr_relaxed(mi_segment_t, &segment->abandoned_next) == NULL); - mi_assert_internal(segment->next == NULL && segment->prev == NULL); + mi_assert_internal(segment->next == NULL); mi_assert_internal(segment->used > 0); mi_tagged_segment_t next; mi_tagged_segment_t ts = mi_atomic_load_relaxed(&abandoned); @@ -973,8 +1161,9 @@ static void mi_abandoned_push(mi_segment_t* segment) { } // Wait until there are no more pending reads on segments that used to be in the abandoned list +// called for example from `arena.c` before decommitting void _mi_abandoned_await_readers(void) { - uintptr_t n; + size_t n; do { n = mi_atomic_load_acquire(&abandoned_readers); if (n != 0) mi_atomic_yield(); @@ -987,8 +1176,8 @@ static mi_segment_t* mi_abandoned_pop(void) { // Check efficiently if it is empty (or if the visited list needs to be moved) mi_tagged_segment_t ts = mi_atomic_load_relaxed(&abandoned); segment = mi_tagged_segment_ptr(ts); - if (mi_likely(segment == NULL)) { - if (mi_likely(!mi_abandoned_visited_revisit())) { // try to swap in the visited list on NULL + if mi_likely(segment == NULL) { + if mi_likely(!mi_abandoned_visited_revisit()) { // try to swap in the visited list on NULL return NULL; } } @@ -1023,20 +1212,31 @@ static void mi_segment_abandon(mi_segment_t* segment, mi_segments_tld_t* tld) { mi_assert_internal(segment->used == segment->abandoned); mi_assert_internal(segment->used > 0); mi_assert_internal(mi_atomic_load_ptr_relaxed(mi_segment_t, &segment->abandoned_next) == NULL); - mi_assert_expensive(mi_segment_is_valid(segment, tld)); - - // remove the segment from the free page queue if needed - mi_reset_delayed(tld); - mi_pages_reset_remove_all_in_segment(segment, mi_option_is_enabled(mi_option_abandoned_page_reset), tld); - mi_segment_remove_from_free_queue(segment, tld); - mi_assert_internal(segment->next == NULL && segment->prev == NULL); + mi_assert_internal(segment->abandoned_visits == 0); + mi_assert_expensive(mi_segment_is_valid(segment,tld)); + + // remove the free pages from the free page queues + mi_slice_t* slice = &segment->slices[0]; + const mi_slice_t* end = mi_segment_slices_end(segment); + while (slice < end) { + mi_assert_internal(slice->slice_count > 0); + mi_assert_internal(slice->slice_offset == 0); + if (slice->xblock_size == 0) { // a free page + mi_segment_span_remove_from_queue(slice,tld); + slice->xblock_size = 0; // but keep it free + } + slice = slice + slice->slice_count; + } + // perform delayed decommits (forcing is much slower on mstress) + mi_segment_try_purge(segment, mi_option_is_enabled(mi_option_abandoned_page_purge) /* force? */, tld->stats); + // all pages in the segment are abandoned; add it to the abandoned list _mi_stat_increase(&tld->stats->segments_abandoned, 1); - mi_segments_track_size(-((long)segment->segment_size), tld); + mi_segments_track_size(-((long)mi_segment_size(segment)), tld); segment->thread_id = 0; - segment->abandoned_visits = 0; mi_atomic_store_ptr_release(mi_segment_t, &segment->abandoned_next, NULL); + segment->abandoned_visits = 1; // from 0 to 1 to signify it is abandoned mi_abandoned_push(segment); } @@ -1045,9 +1245,10 @@ void _mi_segment_page_abandon(mi_page_t* page, mi_segments_tld_t* tld) { mi_assert_internal(mi_page_thread_free_flag(page)==MI_NEVER_DELAYED_FREE); mi_assert_internal(mi_page_heap(page) == NULL); mi_segment_t* segment = _mi_page_segment(page); - mi_assert_expensive(!mi_pages_reset_contains(page, tld)); - mi_assert_expensive(mi_segment_is_valid(segment, tld)); - segment->abandoned++; + + mi_assert_expensive(mi_segment_is_valid(segment,tld)); + segment->abandoned++; + _mi_stat_increase(&tld->stats->pages_abandoned, 1); mi_assert_internal(segment->abandoned <= segment->used); if (segment->used == segment->abandoned) { @@ -1060,75 +1261,95 @@ void _mi_segment_page_abandon(mi_page_t* page, mi_segments_tld_t* tld) { Reclaim abandoned pages ----------------------------------------------------------- */ -// Possibly clear pages and check if free space is available -static bool mi_segment_check_free(mi_segment_t* segment, size_t block_size, bool* all_pages_free) +static mi_slice_t* mi_slices_start_iterate(mi_segment_t* segment, const mi_slice_t** end) { + mi_slice_t* slice = &segment->slices[0]; + *end = mi_segment_slices_end(segment); + mi_assert_internal(slice->slice_count>0 && slice->xblock_size>0); // segment allocated page + slice = slice + slice->slice_count; // skip the first segment allocated page + return slice; +} + +// Possibly free pages and check if free space is available +static bool mi_segment_check_free(mi_segment_t* segment, size_t slices_needed, size_t block_size, mi_segments_tld_t* tld) { mi_assert_internal(block_size < MI_HUGE_BLOCK_SIZE); + mi_assert_internal(mi_segment_is_abandoned(segment)); bool has_page = false; - size_t pages_used = 0; - size_t pages_used_empty = 0; - for (size_t i = 0; i < segment->capacity; i++) { - mi_page_t* page = &segment->pages[i]; - if (page->segment_in_use) { - pages_used++; + + // for all slices + const mi_slice_t* end; + mi_slice_t* slice = mi_slices_start_iterate(segment, &end); + while (slice < end) { + mi_assert_internal(slice->slice_count > 0); + mi_assert_internal(slice->slice_offset == 0); + if (mi_slice_is_used(slice)) { // used page // ensure used count is up to date and collect potential concurrent frees + mi_page_t* const page = mi_slice_to_page(slice); _mi_page_free_collect(page, false); if (mi_page_all_free(page)) { - // if everything free already, page can be reused for some block size - // note: don't clear the page yet as we can only OS reset it once it is reclaimed - pages_used_empty++; - has_page = true; - } - else if (page->xblock_size == block_size && mi_page_has_any_available(page)) { - // a page has available free blocks of the right size - has_page = true; + // if this page is all free now, free it without adding to any queues (yet) + mi_assert_internal(page->next == NULL && page->prev==NULL); + _mi_stat_decrease(&tld->stats->pages_abandoned, 1); + segment->abandoned--; + slice = mi_segment_page_clear(page, tld); // re-assign slice due to coalesce! + mi_assert_internal(!mi_slice_is_used(slice)); + if (slice->slice_count >= slices_needed) { + has_page = true; + } } + else { + if (page->xblock_size == block_size && mi_page_has_any_available(page)) { + // a page has available free blocks of the right size + has_page = true; + } + } } else { - // whole empty page - has_page = true; + // empty span + if (slice->slice_count >= slices_needed) { + has_page = true; + } } - } - mi_assert_internal(pages_used == segment->used && pages_used >= pages_used_empty); - if (all_pages_free != NULL) { - *all_pages_free = ((pages_used - pages_used_empty) == 0); + slice = slice + slice->slice_count; } return has_page; } - -// Reclaim a segment; returns NULL if the segment was freed +// Reclaim an abandoned segment; returns NULL if the segment was freed // set `right_page_reclaimed` to `true` if it reclaimed a page of the right `block_size` that was not full. static mi_segment_t* mi_segment_reclaim(mi_segment_t* segment, mi_heap_t* heap, size_t requested_block_size, bool* right_page_reclaimed, mi_segments_tld_t* tld) { mi_assert_internal(mi_atomic_load_ptr_relaxed(mi_segment_t, &segment->abandoned_next) == NULL); + mi_assert_expensive(mi_segment_is_valid(segment, tld)); if (right_page_reclaimed != NULL) { *right_page_reclaimed = false; } segment->thread_id = _mi_thread_id(); segment->abandoned_visits = 0; - mi_segments_track_size((long)segment->segment_size, tld); - mi_assert_internal(segment->next == NULL && segment->prev == NULL); - mi_assert_expensive(mi_segment_is_valid(segment, tld)); + mi_segments_track_size((long)mi_segment_size(segment), tld); + mi_assert_internal(segment->next == NULL); _mi_stat_decrease(&tld->stats->segments_abandoned, 1); - - for (size_t i = 0; i < segment->capacity; i++) { - mi_page_t* page = &segment->pages[i]; - if (page->segment_in_use) { - mi_assert_internal(!page->is_reset); + + // for all slices + const mi_slice_t* end; + mi_slice_t* slice = mi_slices_start_iterate(segment, &end); + while (slice < end) { + mi_assert_internal(slice->slice_count > 0); + mi_assert_internal(slice->slice_offset == 0); + if (mi_slice_is_used(slice)) { + // in use: reclaim the page in our heap + mi_page_t* page = mi_slice_to_page(slice); mi_assert_internal(page->is_committed); - mi_assert_internal(mi_page_not_in_queue(page, tld)); mi_assert_internal(mi_page_thread_free_flag(page)==MI_NEVER_DELAYED_FREE); mi_assert_internal(mi_page_heap(page) == NULL); - segment->abandoned--; - mi_assert(page->next == NULL); + mi_assert_internal(page->next == NULL && page->prev==NULL); _mi_stat_decrease(&tld->stats->pages_abandoned, 1); - // set the heap again and allow heap thread delayed free again. + segment->abandoned--; + // set the heap again and allow delayed free again mi_page_set_heap(page, heap); _mi_page_use_delayed_free(page, MI_USE_DELAYED_FREE, true); // override never (after heap is set) - // TODO: should we not collect again given that we just collected in `check_free`? _mi_page_free_collect(page, false); // ensure used count is up to date if (mi_page_all_free(page)) { - // if everything free already, clear the page directly - mi_segment_page_clear(segment, page, true, tld); // reset is ok now + // if everything free by now, free the page + slice = mi_segment_page_clear(page, tld); // set slice again due to coalesceing } else { // otherwise reclaim it into the heap @@ -1138,21 +1359,21 @@ static mi_segment_t* mi_segment_reclaim(mi_segment_t* segment, mi_heap_t* heap, } } } - else if (page->is_committed && !page->is_reset) { // not in-use, and not reset yet - // note: do not reset as this includes pages that were not touched before - // mi_pages_reset_add(segment, page, tld); + else { + // the span is free, add it to our page queues + slice = mi_segment_span_free_coalesce(slice, tld); // set slice again due to coalesceing } + mi_assert_internal(slice->slice_count>0 && slice->slice_offset==0); + slice = slice + slice->slice_count; } - mi_assert_internal(segment->abandoned == 0); - if (segment->used == 0) { + + mi_assert(segment->abandoned == 0); + if (segment->used == 0) { // due to page_clear mi_assert_internal(right_page_reclaimed == NULL || !(*right_page_reclaimed)); mi_segment_free(segment, false, tld); return NULL; } else { - if (segment->page_kind <= MI_PAGE_MEDIUM && mi_segment_has_free(segment)) { - mi_segment_insert_in_free_queue(segment, tld); - } return segment; } } @@ -1165,16 +1386,18 @@ void _mi_abandoned_reclaim_all(mi_heap_t* heap, mi_segments_tld_t* tld) { } } -static mi_segment_t* mi_segment_try_reclaim(mi_heap_t* heap, size_t block_size, mi_page_kind_t page_kind, bool* reclaimed, mi_segments_tld_t* tld) +static mi_segment_t* mi_segment_try_reclaim(mi_heap_t* heap, size_t needed_slices, size_t block_size, bool* reclaimed, mi_segments_tld_t* tld) { *reclaimed = false; mi_segment_t* segment; - int max_tries = 8; // limit the work to bound allocation times + long max_tries = mi_option_get_clamp(mi_option_max_segment_reclaim, 8, 1024); // limit the work to bound allocation times while ((max_tries-- > 0) && ((segment = mi_abandoned_pop()) != NULL)) { segment->abandoned_visits++; - bool all_pages_free; - bool has_page = mi_segment_check_free(segment,block_size,&all_pages_free); // try to free up pages (due to concurrent frees) - if (all_pages_free) { + // todo: an arena exclusive heap will potentially visit many abandoned unsuitable segments + // and push them into the visited list and use many tries. Perhaps we can skip non-suitable ones in a better way? + bool is_suitable = _mi_heap_memid_is_suitable(heap, segment->memid); + bool has_page = mi_segment_check_free(segment,needed_slices,block_size,tld); // try to free up pages (due to concurrent frees) + if (segment->used == 0) { // free the segment (by forced reclaim) to make it available to other threads. // note1: we prefer to free a segment as that might lead to reclaiming another // segment that is still partially used. @@ -1182,18 +1405,19 @@ static mi_segment_t* mi_segment_try_reclaim(mi_heap_t* heap, size_t block_size, // freeing but that would violate some invariants temporarily) mi_segment_reclaim(segment, heap, 0, NULL, tld); } - else if (has_page && segment->page_kind == page_kind) { - // found a free page of the right kind, or page of the right block_size with free space + else if (has_page && is_suitable) { + // found a large enough free span, or a page of the right block_size with free space // we return the result of reclaim (which is usually `segment`) as it might free // the segment due to concurrent frees (in which case `NULL` is returned). return mi_segment_reclaim(segment, heap, block_size, reclaimed, tld); } - else if (segment->abandoned_visits >= 3) { - // always reclaim on 3rd visit to limit the list length. + else if (segment->abandoned_visits > 3 && is_suitable) { + // always reclaim on 3rd visit to limit the abandoned queue length. mi_segment_reclaim(segment, heap, 0, NULL, tld); } else { // otherwise, push on the visited list so it gets not looked at too quickly again + mi_segment_try_purge(segment, true /* force? */, tld->stats); // force purge if needed as we may not visit soon again mi_abandoned_visited_push(segment); } } @@ -1201,128 +1425,134 @@ static mi_segment_t* mi_segment_try_reclaim(mi_heap_t* heap, size_t block_size, } +void _mi_abandoned_collect(mi_heap_t* heap, bool force, mi_segments_tld_t* tld) +{ + mi_segment_t* segment; + int max_tries = (force ? 16*1024 : 1024); // limit latency + if (force) { + mi_abandoned_visited_revisit(); + } + while ((max_tries-- > 0) && ((segment = mi_abandoned_pop()) != NULL)) { + mi_segment_check_free(segment,0,0,tld); // try to free up pages (due to concurrent frees) + if (segment->used == 0) { + // free the segment (by forced reclaim) to make it available to other threads. + // note: we could in principle optimize this by skipping reclaim and directly + // freeing but that would violate some invariants temporarily) + mi_segment_reclaim(segment, heap, 0, NULL, tld); + } + else { + // otherwise, purge if needed and push on the visited list + // note: forced purge can be expensive if many threads are destroyed/created as in mstress. + mi_segment_try_purge(segment, force, tld->stats); + mi_abandoned_visited_push(segment); + } + } +} + /* ----------------------------------------------------------- Reclaim or allocate ----------------------------------------------------------- */ -static mi_segment_t* mi_segment_reclaim_or_alloc(mi_heap_t* heap, size_t block_size, mi_page_kind_t page_kind, size_t page_shift, mi_segments_tld_t* tld, mi_os_tld_t* os_tld) +static mi_segment_t* mi_segment_reclaim_or_alloc(mi_heap_t* heap, size_t needed_slices, size_t block_size, mi_segments_tld_t* tld, mi_os_tld_t* os_tld) { - mi_assert_internal(page_kind <= MI_PAGE_LARGE); mi_assert_internal(block_size < MI_HUGE_BLOCK_SIZE); - // 1. try to get a segment from our cache - mi_segment_t* segment = mi_segment_cache_pop(MI_SEGMENT_SIZE, tld); - if (segment != NULL) { - mi_segment_init(segment, 0, page_kind, page_shift, tld, os_tld); - return segment; - } - // 2. try to reclaim an abandoned segment + mi_assert_internal(block_size <= MI_LARGE_OBJ_SIZE_MAX); + + // 1. try to reclaim an abandoned segment bool reclaimed; - segment = mi_segment_try_reclaim(heap, block_size, page_kind, &reclaimed, tld); + mi_segment_t* segment = mi_segment_try_reclaim(heap, needed_slices, block_size, &reclaimed, tld); if (reclaimed) { // reclaimed the right page right into the heap - mi_assert_internal(segment != NULL && segment->page_kind == page_kind && page_kind <= MI_PAGE_LARGE); + mi_assert_internal(segment != NULL); return NULL; // pretend out-of-memory as the page will be in the page queue of the heap with available blocks } else if (segment != NULL) { - // reclaimed a segment with empty pages (of `page_kind`) in it + // reclaimed a segment with a large enough empty span in it return segment; } - // 3. otherwise allocate a fresh segment - return mi_segment_alloc(0, page_kind, page_shift, tld, os_tld); + // 2. otherwise allocate a fresh segment + return mi_segment_alloc(0, 0, heap->arena_id, tld, os_tld, NULL); } /* ----------------------------------------------------------- - Small page allocation + Page allocation ----------------------------------------------------------- */ -static mi_page_t* mi_segment_find_free(mi_segment_t* segment, mi_segments_tld_t* tld) { - mi_assert_internal(mi_segment_has_free(segment)); - mi_assert_expensive(mi_segment_is_valid(segment, tld)); - for (size_t i = 0; i < segment->capacity; i++) { // TODO: use a bitmap instead of search? - mi_page_t* page = &segment->pages[i]; - if (!page->segment_in_use) { - bool ok = mi_segment_page_claim(segment, page, tld); - if (ok) return page; +static mi_page_t* mi_segments_page_alloc(mi_heap_t* heap, mi_page_kind_t page_kind, size_t required, size_t block_size, mi_segments_tld_t* tld, mi_os_tld_t* os_tld) +{ + mi_assert_internal(required <= MI_LARGE_OBJ_SIZE_MAX && page_kind <= MI_PAGE_LARGE); + + // find a free page + size_t page_size = _mi_align_up(required, (required > MI_MEDIUM_PAGE_SIZE ? MI_MEDIUM_PAGE_SIZE : MI_SEGMENT_SLICE_SIZE)); + size_t slices_needed = page_size / MI_SEGMENT_SLICE_SIZE; + mi_assert_internal(slices_needed * MI_SEGMENT_SLICE_SIZE == page_size); + mi_page_t* page = mi_segments_page_find_and_allocate(slices_needed, heap->arena_id, tld); //(required <= MI_SMALL_SIZE_MAX ? 0 : slices_needed), tld); + if (page==NULL) { + // no free page, allocate a new segment and try again + if (mi_segment_reclaim_or_alloc(heap, slices_needed, block_size, tld, os_tld) == NULL) { + // OOM or reclaimed a good page in the heap + return NULL; + } + else { + // otherwise try again + return mi_segments_page_alloc(heap, page_kind, required, block_size, tld, os_tld); } } - mi_assert(false); - return NULL; -} - -// Allocate a page inside a segment. Requires that the page has free pages -static mi_page_t* mi_segment_page_alloc_in(mi_segment_t* segment, mi_segments_tld_t* tld) { - mi_assert_internal(mi_segment_has_free(segment)); - return mi_segment_find_free(segment, tld); -} - -static mi_page_t* mi_segment_page_alloc(mi_heap_t* heap, size_t block_size, mi_page_kind_t kind, size_t page_shift, mi_segments_tld_t* tld, mi_os_tld_t* os_tld) { - // find an available segment the segment free queue - mi_segment_queue_t* const free_queue = mi_segment_free_queue_of_kind(kind, tld); - if (mi_segment_queue_is_empty(free_queue)) { - // possibly allocate or reclaim a fresh segment - mi_segment_t* const segment = mi_segment_reclaim_or_alloc(heap, block_size, kind, page_shift, tld, os_tld); - if (segment == NULL) return NULL; // return NULL if out-of-memory (or reclaimed) - mi_assert_internal(free_queue->first == segment); - mi_assert_internal(segment->page_kind==kind); - mi_assert_internal(segment->used < segment->capacity); - } - mi_assert_internal(free_queue->first != NULL); - mi_page_t* const page = mi_segment_page_alloc_in(free_queue->first, tld); - mi_assert_internal(page != NULL); -#if MI_DEBUG>=2 - // verify it is committed - _mi_segment_page_start(_mi_page_segment(page), page, sizeof(void*), NULL, NULL)[0] = 0; -#endif + mi_assert_internal(page != NULL && page->slice_count*MI_SEGMENT_SLICE_SIZE == page_size); + mi_assert_internal(_mi_ptr_segment(page)->thread_id == _mi_thread_id()); + mi_segment_try_purge(_mi_ptr_segment(page), false, tld->stats); return page; } -static mi_page_t* mi_segment_small_page_alloc(mi_heap_t* heap, size_t block_size, mi_segments_tld_t* tld, mi_os_tld_t* os_tld) { - return mi_segment_page_alloc(heap, block_size, MI_PAGE_SMALL,MI_SMALL_PAGE_SHIFT,tld,os_tld); -} -static mi_page_t* mi_segment_medium_page_alloc(mi_heap_t* heap, size_t block_size, mi_segments_tld_t* tld, mi_os_tld_t* os_tld) { - return mi_segment_page_alloc(heap, block_size, MI_PAGE_MEDIUM, MI_MEDIUM_PAGE_SHIFT, tld, os_tld); -} /* ----------------------------------------------------------- - large page allocation + Huge page allocation ----------------------------------------------------------- */ -static mi_page_t* mi_segment_large_page_alloc(mi_heap_t* heap, size_t block_size, mi_segments_tld_t* tld, mi_os_tld_t* os_tld) { - mi_segment_t* segment = mi_segment_reclaim_or_alloc(heap,block_size,MI_PAGE_LARGE,MI_LARGE_PAGE_SHIFT,tld,os_tld); - if (segment == NULL) return NULL; - mi_page_t* page = mi_segment_find_free(segment, tld); - mi_assert_internal(page != NULL); -#if MI_DEBUG>=2 - _mi_segment_page_start(segment, page, sizeof(void*), NULL, NULL)[0] = 0; -#endif - return page; -} - -static mi_page_t* mi_segment_huge_page_alloc(size_t size, mi_segments_tld_t* tld, mi_os_tld_t* os_tld) +static mi_page_t* mi_segment_huge_page_alloc(size_t size, size_t page_alignment, mi_arena_id_t req_arena_id, mi_segments_tld_t* tld, mi_os_tld_t* os_tld) { - mi_segment_t* segment = mi_segment_alloc(size, MI_PAGE_HUGE, MI_SEGMENT_SHIFT,tld,os_tld); - if (segment == NULL) return NULL; - mi_assert_internal(mi_segment_page_size(segment) - segment->segment_info_size - (2*(MI_SECURE == 0 ? 0 : _mi_os_page_size())) >= size); - segment->thread_id = 0; // huge pages are immediately abandoned - mi_segments_track_size(-(long)segment->segment_size, tld); - mi_page_t* page = mi_segment_find_free(segment, tld); - mi_assert_internal(page != NULL); + mi_page_t* page = NULL; + mi_segment_t* segment = mi_segment_alloc(size,page_alignment,req_arena_id,tld,os_tld,&page); + if (segment == NULL || page==NULL) return NULL; + mi_assert_internal(segment->used==1); + mi_assert_internal(mi_page_block_size(page) >= size); + #if MI_HUGE_PAGE_ABANDON + segment->thread_id = 0; // huge segments are immediately abandoned + #endif + + // for huge pages we initialize the xblock_size as we may + // overallocate to accommodate large alignments. + size_t psize; + uint8_t* start = _mi_segment_page_start(segment, page, &psize); + page->xblock_size = (psize > MI_HUGE_BLOCK_SIZE ? MI_HUGE_BLOCK_SIZE : (uint32_t)psize); + + // decommit the part of the prefix of a page that will not be used; this can be quite large (close to MI_SEGMENT_SIZE) + if (page_alignment > 0 && segment->allow_decommit) { + uint8_t* aligned_p = (uint8_t*)_mi_align_up((uintptr_t)start, page_alignment); + mi_assert_internal(_mi_is_aligned(aligned_p, page_alignment)); + mi_assert_internal(psize - (aligned_p - start) >= size); + uint8_t* decommit_start = start + sizeof(mi_block_t); // for the free list + ptrdiff_t decommit_size = aligned_p - decommit_start; + _mi_os_reset(decommit_start, decommit_size, &_mi_stats_main); // note: cannot use segment_decommit on huge segments + } + return page; } +#if MI_HUGE_PAGE_ABANDON // free huge block from another thread void _mi_segment_huge_page_free(mi_segment_t* segment, mi_page_t* page, mi_block_t* block) { // huge page segments are always abandoned and can be freed immediately by any thread - mi_assert_internal(segment->page_kind==MI_PAGE_HUGE); + mi_assert_internal(segment->kind==MI_SEGMENT_HUGE); mi_assert_internal(segment == _mi_page_segment(page)); mi_assert_internal(mi_atomic_load_relaxed(&segment->thread_id)==0); // claim it and free mi_heap_t* heap = mi_heap_get_default(); // issue #221; don't use the internal get_default_heap as we need to ensure the thread is initialized. // paranoia: if this it the last reference, the cas should always succeed - uintptr_t expected_tid = 0; + size_t expected_tid = 0; if (mi_atomic_cas_strong_acq_rel(&segment->thread_id, &expected_tid, heap->thread_id)) { mi_block_set_next(page, block, page->free); page->free = block; @@ -1330,14 +1560,6 @@ void _mi_segment_huge_page_free(mi_segment_t* segment, mi_page_t* page, mi_block page->is_zero = false; mi_assert(page->used == 0); mi_tld_t* tld = heap->tld; - const size_t bsize = mi_page_usable_block_size(page); - if (bsize > MI_HUGE_OBJ_SIZE_MAX) { - _mi_stat_decrease(&tld->stats.giant, bsize); - } - else { - _mi_stat_decrease(&tld->stats.huge, bsize); - } - mi_segments_track_size((long)segment->segment_size, &tld->segments); _mi_segment_page_free(page, true, &tld->segments); } #if (MI_DEBUG!=0) @@ -1347,27 +1569,51 @@ void _mi_segment_huge_page_free(mi_segment_t* segment, mi_page_t* page, mi_block #endif } -/* ----------------------------------------------------------- - Page allocation ------------------------------------------------------------ */ +#else +// reset memory of a huge block from another thread +void _mi_segment_huge_page_reset(mi_segment_t* segment, mi_page_t* page, mi_block_t* block) { + MI_UNUSED(page); + mi_assert_internal(segment->kind == MI_SEGMENT_HUGE); + mi_assert_internal(segment == _mi_page_segment(page)); + mi_assert_internal(page->used == 1); // this is called just before the free + mi_assert_internal(page->free == NULL); + if (segment->allow_decommit) { + size_t csize = mi_usable_size(block); + if (csize > sizeof(mi_block_t)) { + csize = csize - sizeof(mi_block_t); + uint8_t* p = (uint8_t*)block + sizeof(mi_block_t); + _mi_os_reset(p, csize, &_mi_stats_main); // note: cannot use segment_decommit on huge segments + } + } +} +#endif -mi_page_t* _mi_segment_page_alloc(mi_heap_t* heap, size_t block_size, mi_segments_tld_t* tld, mi_os_tld_t* os_tld) { +/* ----------------------------------------------------------- + Page allocation and free +----------------------------------------------------------- */ +mi_page_t* _mi_segment_page_alloc(mi_heap_t* heap, size_t block_size, size_t page_alignment, mi_segments_tld_t* tld, mi_os_tld_t* os_tld) { mi_page_t* page; - if (block_size <= MI_SMALL_OBJ_SIZE_MAX) { - page = mi_segment_small_page_alloc(heap, block_size, tld, os_tld); + if mi_unlikely(page_alignment > MI_ALIGNMENT_MAX) { + mi_assert_internal(_mi_is_power_of_two(page_alignment)); + mi_assert_internal(page_alignment >= MI_SEGMENT_SIZE); + if (page_alignment < MI_SEGMENT_SIZE) { page_alignment = MI_SEGMENT_SIZE; } + page = mi_segment_huge_page_alloc(block_size,page_alignment,heap->arena_id,tld,os_tld); + } + else if (block_size <= MI_SMALL_OBJ_SIZE_MAX) { + page = mi_segments_page_alloc(heap,MI_PAGE_SMALL,block_size,block_size,tld,os_tld); } else if (block_size <= MI_MEDIUM_OBJ_SIZE_MAX) { - page = mi_segment_medium_page_alloc(heap, block_size, tld, os_tld); + page = mi_segments_page_alloc(heap,MI_PAGE_MEDIUM,MI_MEDIUM_PAGE_SIZE,block_size,tld, os_tld); } else if (block_size <= MI_LARGE_OBJ_SIZE_MAX) { - page = mi_segment_large_page_alloc(heap, block_size, tld, os_tld); + page = mi_segments_page_alloc(heap,MI_PAGE_LARGE,block_size,block_size,tld, os_tld); } else { - page = mi_segment_huge_page_alloc(block_size,tld,os_tld); + page = mi_segment_huge_page_alloc(block_size,page_alignment,heap->arena_id,tld,os_tld); } + mi_assert_internal(page == NULL || _mi_heap_memid_is_suitable(heap, _mi_page_segment(page)->memid)); mi_assert_expensive(page == NULL || mi_segment_is_valid(_mi_page_segment(page),tld)); - mi_assert_internal(page == NULL || (mi_segment_page_size(_mi_page_segment(page)) - (MI_SECURE == 0 ? 0 : _mi_os_page_size())) >= block_size); - mi_reset_delayed(tld); - mi_assert_internal(page == NULL || mi_page_not_in_queue(page, tld)); return page; } + + diff --git a/src/static.c b/src/static.c index d024b01..bc05dd7 100644 --- a/src/static.c +++ b/src/static.c @@ -1,5 +1,5 @@ /* ---------------------------------------------------------------------------- -Copyright (c) 2018, Microsoft Research, Daan Leijen +Copyright (c) 2018-2020, Microsoft Research, Daan Leijen This is free software; you can redistribute it and/or modify it under the terms of the MIT license. A copy of the license can be found in the file "LICENSE" at the root of this distribution. @@ -14,25 +14,27 @@ terms of the MIT license. A copy of the license can be found in the file #endif #include "mimalloc.h" -#include "mimalloc-internal.h" +#include "mimalloc/internal.h" // For a static override we create a single object file // containing the whole library. If it is linked first // it will override all the standard library allocation // functions (on Unix's). -#include "stats.c" -#include "random.c" -#include "os.c" -#include "arena.c" -#include "region.c" -#include "segment.c" -#include "page.c" -#include "heap.c" -#include "alloc.c" +#include "alloc.c" // includes alloc-override.c #include "alloc-aligned.c" #include "alloc-posix.c" -#if MI_OSX_ZONE -#include "alloc-override-osx.c" -#endif +#include "arena.c" +#include "bitmap.c" +#include "heap.c" #include "init.c" #include "options.c" +#include "os.c" +#include "page.c" // includes page-queue.c +#include "random.c" +#include "segment.c" +#include "segment-map.c" +#include "stats.c" +#include "prim/prim.c" +#if MI_OSX_ZONE +#include "prim/osx/alloc-override-zone.c" +#endif diff --git a/src/stats.c b/src/stats.c index 7b18368..300956c 100644 --- a/src/stats.c +++ b/src/stats.c @@ -1,16 +1,15 @@ /* ---------------------------------------------------------------------------- -Copyright (c) 2018, Microsoft Research, Daan Leijen +Copyright (c) 2018-2021, Microsoft Research, Daan Leijen This is free software; you can redistribute it and/or modify it under the terms of the MIT license. A copy of the license can be found in the file "LICENSE" at the root of this distribution. -----------------------------------------------------------------------------*/ -#include "AuroraEnvironment.h" - #include "mimalloc.h" -#include "mimalloc-internal.h" -#include "mimalloc-atomic.h" +#include "mimalloc/internal.h" +#include "mimalloc/atomic.h" +#include "mimalloc/prim.h" -#include // fputs, stderr +#include // snprintf #include // memset #if defined(_MSC_VER) && (_MSC_VER < 1920) @@ -23,7 +22,7 @@ terms of the MIT license. A copy of the license can be found in the file static bool mi_is_in_main(void* stat) { return ((uint8_t*)stat >= (uint8_t*)&_mi_stats_main - && (uint8_t*)stat < ((uint8_t*)&_mi_stats_main + sizeof(mi_stats_t))); + && (uint8_t*)stat < ((uint8_t*)&_mi_stats_main + sizeof(mi_stats_t))); } static void mi_stat_update(mi_stat_count_t* stat, int64_t amount) { @@ -53,7 +52,7 @@ static void mi_stat_update(mi_stat_count_t* stat, int64_t amount) { } } -void _mi_stat_counter_increase(mi_stat_counter_t* stat, size_t amount) { +void _mi_stat_counter_increase(mi_stat_counter_t* stat, size_t amount) { if (mi_is_in_main(stat)) { mi_atomic_addi64_relaxed( &stat->count, 1 ); mi_atomic_addi64_relaxed( &stat->total, (int64_t)amount ); @@ -79,7 +78,7 @@ static void mi_stat_add(mi_stat_count_t* stat, const mi_stat_count_t* src, int64 mi_atomic_addi64_relaxed( &stat->allocated, src->allocated * unit); mi_atomic_addi64_relaxed( &stat->current, src->current * unit); mi_atomic_addi64_relaxed( &stat->freed, src->freed * unit); - // peak scores do not work across threads.. + // peak scores do not work across threads.. mi_atomic_addi64_relaxed( &stat->peak, src->peak * unit); } @@ -97,6 +96,7 @@ static void mi_stats_add(mi_stats_t* stats, const mi_stats_t* src) { mi_stat_add(&stats->reserved, &src->reserved, 1); mi_stat_add(&stats->committed, &src->committed, 1); mi_stat_add(&stats->reset, &src->reset, 1); + mi_stat_add(&stats->purged, &src->purged, 1); mi_stat_add(&stats->page_committed, &src->page_committed, 1); mi_stat_add(&stats->pages_abandoned, &src->pages_abandoned, 1); @@ -105,21 +105,25 @@ static void mi_stats_add(mi_stats_t* stats, const mi_stats_t* src) { mi_stat_add(&stats->malloc, &src->malloc, 1); mi_stat_add(&stats->segments_cache, &src->segments_cache, 1); + mi_stat_add(&stats->normal, &src->normal, 1); mi_stat_add(&stats->huge, &src->huge, 1); - mi_stat_add(&stats->giant, &src->giant, 1); + mi_stat_add(&stats->large, &src->large, 1); mi_stat_counter_add(&stats->pages_extended, &src->pages_extended, 1); mi_stat_counter_add(&stats->mmap_calls, &src->mmap_calls, 1); mi_stat_counter_add(&stats->commit_calls, &src->commit_calls, 1); + mi_stat_counter_add(&stats->reset_calls, &src->reset_calls, 1); + mi_stat_counter_add(&stats->purge_calls, &src->purge_calls, 1); mi_stat_counter_add(&stats->page_no_retire, &src->page_no_retire, 1); mi_stat_counter_add(&stats->searches, &src->searches, 1); + mi_stat_counter_add(&stats->normal_count, &src->normal_count, 1); mi_stat_counter_add(&stats->huge_count, &src->huge_count, 1); - mi_stat_counter_add(&stats->giant_count, &src->giant_count, 1); + mi_stat_counter_add(&stats->large_count, &src->large_count, 1); #if MI_STAT>1 for (size_t i = 0; i <= MI_BIN_HUGE; i++) { - if (src->normal[i].allocated > 0 || src->normal[i].freed > 0) { - mi_stat_add(&stats->normal[i], &src->normal[i], 1); + if (src->normal_bins[i].allocated > 0 || src->normal_bins[i].freed > 0) { + mi_stat_add(&stats->normal_bins[i], &src->normal_bins[i], 1); } } #endif @@ -129,31 +133,35 @@ static void mi_stats_add(mi_stats_t* stats, const mi_stats_t* src) { Display statistics ----------------------------------------------------------- */ -// unit > 0 : size in binary bytes +// unit > 0 : size in binary bytes // unit == 0: count as decimal // unit < 0 : count in binary static void mi_printf_amount(int64_t n, int64_t unit, mi_output_fun* out, void* arg, const char* fmt) { - char buf[32]; + char buf[32]; buf[0] = 0; int len = 32; - const char* suffix = (unit <= 0 ? " " : "b"); + const char* suffix = (unit <= 0 ? " " : "B"); const int64_t base = (unit == 0 ? 1000 : 1024); if (unit>0) n *= unit; const int64_t pos = (n < 0 ? -n : n); if (pos < base) { - snprintf(buf, len, "%d %s ", (int)n, suffix); + if (n!=1 || suffix[0] != 'B') { // skip printing 1 B for the unit column + snprintf(buf, len, "%d %-3s", (int)n, (n==0 ? "" : suffix)); + } } else { int64_t divider = base; - const char* magnitude = "k"; - if (pos >= divider*base) { divider *= base; magnitude = "m"; } - if (pos >= divider*base) { divider *= base; magnitude = "g"; } + const char* magnitude = "K"; + if (pos >= divider*base) { divider *= base; magnitude = "M"; } + if (pos >= divider*base) { divider *= base; magnitude = "G"; } const int64_t tens = (n / (divider/10)); const long whole = (long)(tens/10); const long frac1 = (long)(tens%10); - snprintf(buf, len, "%ld.%ld %s%s", whole, frac1, magnitude, suffix); + char unitdesc[8]; + snprintf(unitdesc, 8, "%s%s%s", magnitude, (base==1024 ? "i" : ""), suffix); + snprintf(buf, len, "%ld.%ld %-3s", whole, (frac1 < 0 ? -frac1 : frac1), unitdesc); } - _mi_fprintf(out, arg, (fmt==NULL ? "%11s" : fmt), buf); + _mi_fprintf(out, arg, (fmt==NULL ? "%12s" : fmt), buf); } @@ -162,29 +170,35 @@ static void mi_print_amount(int64_t n, int64_t unit, mi_output_fun* out, void* a } static void mi_print_count(int64_t n, int64_t unit, mi_output_fun* out, void* arg) { - if (unit==1) _mi_fprintf(out, arg, "%11s"," "); + if (unit==1) _mi_fprintf(out, arg, "%12s"," "); else mi_print_amount(n,0,out,arg); } -static void mi_stat_print(const mi_stat_count_t* stat, const char* msg, int64_t unit, mi_output_fun* out, void* arg ) { +static void mi_stat_print_ex(const mi_stat_count_t* stat, const char* msg, int64_t unit, mi_output_fun* out, void* arg, const char* notok ) { _mi_fprintf(out, arg,"%10s:", msg); - if (unit>0) { + if (unit > 0) { mi_print_amount(stat->peak, unit, out, arg); mi_print_amount(stat->allocated, unit, out, arg); mi_print_amount(stat->freed, unit, out, arg); + mi_print_amount(stat->current, unit, out, arg); mi_print_amount(unit, 1, out, arg); mi_print_count(stat->allocated, unit, out, arg); - if (stat->allocated > stat->freed) - _mi_fprintf(out, arg, " not all freed!\n"); - else + if (stat->allocated > stat->freed) { + _mi_fprintf(out, arg, " "); + _mi_fprintf(out, arg, (notok == NULL ? "not all freed" : notok)); + _mi_fprintf(out, arg, "\n"); + } + else { _mi_fprintf(out, arg, " ok\n"); + } } else if (unit<0) { mi_print_amount(stat->peak, -1, out, arg); mi_print_amount(stat->allocated, -1, out, arg); mi_print_amount(stat->freed, -1, out, arg); + mi_print_amount(stat->current, -1, out, arg); if (unit==-1) { - _mi_fprintf(out, arg, "%22s", ""); + _mi_fprintf(out, arg, "%24s", ""); } else { mi_print_amount(-unit, 1, out, arg); @@ -198,18 +212,31 @@ static void mi_stat_print(const mi_stat_count_t* stat, const char* msg, int64_t else { mi_print_amount(stat->peak, 1, out, arg); mi_print_amount(stat->allocated, 1, out, arg); + _mi_fprintf(out, arg, "%11s", " "); // no freed + mi_print_amount(stat->current, 1, out, arg); _mi_fprintf(out, arg, "\n"); } } +static void mi_stat_print(const mi_stat_count_t* stat, const char* msg, int64_t unit, mi_output_fun* out, void* arg) { + mi_stat_print_ex(stat, msg, unit, out, arg, NULL); +} + +static void mi_stat_peak_print(const mi_stat_count_t* stat, const char* msg, int64_t unit, mi_output_fun* out, void* arg) { + _mi_fprintf(out, arg, "%10s:", msg); + mi_print_amount(stat->peak, unit, out, arg); + _mi_fprintf(out, arg, "\n"); +} + static void mi_stat_counter_print(const mi_stat_counter_t* stat, const char* msg, mi_output_fun* out, void* arg ) { _mi_fprintf(out, arg, "%10s:", msg); mi_print_amount(stat->total, -1, out, arg); _mi_fprintf(out, arg, "\n"); } + static void mi_stat_counter_print_avg(const mi_stat_counter_t* stat, const char* msg, mi_output_fun* out, void* arg) { - const int64_t avg_tens = (stat->count == 0 ? 0 : (stat->total*10 / stat->count)); + const int64_t avg_tens = (stat->count == 0 ? 0 : (stat->total*10 / stat->count)); const long avg_whole = (long)(avg_tens/10); const long avg_frac1 = (long)(avg_tens%10); _mi_fprintf(out, arg, "%10s: %5ld.%ld avg\n", msg, avg_whole, avg_frac1); @@ -217,11 +244,11 @@ static void mi_stat_counter_print_avg(const mi_stat_counter_t* stat, const char* static void mi_print_header(mi_output_fun* out, void* arg ) { - _mi_fprintf(out, arg, "%10s: %10s %10s %10s %10s %10s\n", "heap stats", "peak ", "total ", "freed ", "unit ", "count "); + _mi_fprintf(out, arg, "%10s: %11s %11s %11s %11s %11s %11s\n", "heap stats", "peak ", "total ", "freed ", "current ", "unit ", "count "); } #if MI_STAT>1 -static void mi_stats_print_bins(mi_stat_count_t* all, const mi_stat_count_t* bins, size_t max, const char* fmt, mi_output_fun* out, void* arg) { +static void mi_stats_print_bins(const mi_stat_count_t* bins, size_t max, const char* fmt, mi_output_fun* out, void* arg) { bool found = false; char buf[64]; for (size_t i = 0; i <= max; i++) { @@ -229,12 +256,9 @@ static void mi_stats_print_bins(mi_stat_count_t* all, const mi_stat_count_t* bin found = true; int64_t unit = _mi_bin_size((uint8_t)i); snprintf(buf, 64, "%s %3lu", fmt, (long)i); - mi_stat_add(all, &bins[i], unit); mi_stat_print(&bins[i], buf, unit, out, arg); } } - //snprintf(buf, 64, "%s all", fmt); - //mi_stat_print(all, buf, 1); if (found) { _mi_fprintf(out, arg, "\n"); mi_print_header(out, arg); @@ -252,7 +276,7 @@ typedef struct buffered_s { mi_output_fun* out; // original output function void* arg; // and state char* buf; // local buffer of at least size `count+1` - size_t used; // currently used chars `used <= count` + size_t used; // currently used chars `used <= count` size_t count; // total chars available for output } buffered_t; @@ -262,7 +286,7 @@ static void mi_buffered_flush(buffered_t* buf) { buf->used = 0; } -static void mi_buffered_out(const char* msg, void* arg) { +static void mi_cdecl mi_buffered_out(const char* msg, void* arg) { buffered_t* buf = (buffered_t*)arg; if (msg==NULL || buf==NULL) return; for (const char* src = msg; *src != 0; src++) { @@ -289,23 +313,26 @@ static void _mi_stats_print(mi_stats_t* stats, mi_output_fun* out0, void* arg0) // and print using that mi_print_header(out,arg); #if MI_STAT>1 - mi_stat_count_t normal = { 0,0,0,0 }; - mi_stats_print_bins(&normal, stats->normal, MI_BIN_HUGE, "normal",out,arg); - mi_stat_print(&normal, "normal", 1, out, arg); - mi_stat_print(&stats->huge, "huge", (stats->huge_count.count == 0 ? 1 : -(stats->huge.allocated / stats->huge_count.count)), out, arg); - mi_stat_print(&stats->giant, "giant", (stats->giant_count.count == 0 ? 1 : -(stats->giant.allocated / stats->giant_count.count)), out, arg); - mi_stat_count_t total = { 0,0,0,0 }; - mi_stat_add(&total, &normal, 1); - mi_stat_add(&total, &stats->huge, 1); - mi_stat_add(&total, &stats->giant, 1); - mi_stat_print(&total, "total", 1, out, arg); - _mi_fprintf(out, arg, "malloc requested: "); - mi_print_amount(stats->malloc.allocated, 1, out, arg); - _mi_fprintf(out, arg, "\n\n"); + mi_stats_print_bins(stats->normal_bins, MI_BIN_HUGE, "normal",out,arg); #endif - mi_stat_print(&stats->reserved, "reserved", 1, out, arg); - mi_stat_print(&stats->committed, "committed", 1, out, arg); - mi_stat_print(&stats->reset, "reset", 1, out, arg); + #if MI_STAT + mi_stat_print(&stats->normal, "normal", (stats->normal_count.count == 0 ? 1 : -(stats->normal.allocated / stats->normal_count.count)), out, arg); + mi_stat_print(&stats->large, "large", (stats->large_count.count == 0 ? 1 : -(stats->large.allocated / stats->large_count.count)), out, arg); + mi_stat_print(&stats->huge, "huge", (stats->huge_count.count == 0 ? 1 : -(stats->huge.allocated / stats->huge_count.count)), out, arg); + mi_stat_count_t total = { 0,0,0,0 }; + mi_stat_add(&total, &stats->normal, 1); + mi_stat_add(&total, &stats->large, 1); + mi_stat_add(&total, &stats->huge, 1); + mi_stat_print(&total, "total", 1, out, arg); + #endif + #if MI_STAT>1 + mi_stat_print(&stats->malloc, "malloc req", 1, out, arg); + _mi_fprintf(out, arg, "\n"); + #endif + mi_stat_print_ex(&stats->reserved, "reserved", 1, out, arg, ""); + mi_stat_print_ex(&stats->committed, "committed", 1, out, arg, ""); + mi_stat_peak_print(&stats->reset, "reset", 1, out, arg ); + mi_stat_peak_print(&stats->purged, "purged", 1, out, arg ); mi_stat_print(&stats->page_committed, "touched", 1, out, arg); mi_stat_print(&stats->segments, "segments", -1, out, arg); mi_stat_print(&stats->segments_abandoned, "-abandoned", -1, out, arg); @@ -316,19 +343,22 @@ static void _mi_stats_print(mi_stats_t* stats, mi_output_fun* out0, void* arg0) mi_stat_counter_print(&stats->page_no_retire, "-noretire", out, arg); mi_stat_counter_print(&stats->mmap_calls, "mmaps", out, arg); mi_stat_counter_print(&stats->commit_calls, "commits", out, arg); + mi_stat_counter_print(&stats->reset_calls, "resets", out, arg); + mi_stat_counter_print(&stats->purge_calls, "purges", out, arg); mi_stat_print(&stats->threads, "threads", -1, out, arg); mi_stat_counter_print_avg(&stats->searches, "searches", out, arg); - _mi_fprintf(out, arg, "%10s: %7i\n", "numa nodes", _mi_os_numa_node_count()); - - mi_msecs_t elapsed; - mi_msecs_t user_time; - mi_msecs_t sys_time; + _mi_fprintf(out, arg, "%10s: %5zu\n", "numa nodes", _mi_os_numa_node_count()); + + size_t elapsed; + size_t user_time; + size_t sys_time; size_t current_rss; size_t peak_rss; size_t current_commit; size_t peak_commit; size_t page_faults; - _mi_fprintf(out, arg, "%10s: %7ld.%03ld s\n", "elapsed", elapsed/1000, elapsed%1000); + mi_process_info(&elapsed, &user_time, &sys_time, ¤t_rss, &peak_rss, ¤t_commit, &peak_commit, &page_faults); + _mi_fprintf(out, arg, "%10s: %5ld.%03ld s\n", "elapsed", elapsed/1000, elapsed%1000); _mi_fprintf(out, arg, "%10s: user: %ld.%03ld s, system: %ld.%03ld s, faults: %lu, rss: ", "process", user_time/1000, user_time%1000, sys_time/1000, sys_time%1000, (unsigned long)page_faults ); mi_printf_amount((int64_t)peak_rss, 1, out, arg, "%s"); @@ -336,7 +366,7 @@ static void _mi_stats_print(mi_stats_t* stats, mi_output_fun* out0, void* arg0) _mi_fprintf(out, arg, ", commit: "); mi_printf_amount((int64_t)peak_commit, 1, out, arg, "%s"); } - _mi_fprintf(out, arg, "\n"); + _mi_fprintf(out, arg, "\n"); } static mi_msecs_t mi_process_start; // = 0 @@ -386,43 +416,13 @@ void mi_thread_stats_print_out(mi_output_fun* out, void* arg) mi_attr_noexcept { // ---------------------------------------------------------------- // Basic timer for convenience; use milli-seconds to avoid doubles // ---------------------------------------------------------------- -#ifdef _WIN32 -#include -static mi_msecs_t mi_to_msecs(LARGE_INTEGER t) { - static LARGE_INTEGER mfreq; // = 0 - if (mfreq.QuadPart == 0LL) { - LARGE_INTEGER f; - QueryPerformanceFrequency(&f); - mfreq.QuadPart = f.QuadPart/1000LL; - if (mfreq.QuadPart == 0) mfreq.QuadPart = 1; - } - return (mi_msecs_t)(t.QuadPart / mfreq.QuadPart); -} - -mi_msecs_t _mi_clock_now(void) { - LARGE_INTEGER t; - QueryPerformanceCounter(&t); - return mi_to_msecs(t); -} -#else -#include -#ifdef CLOCK_REALTIME -mi_msecs_t _mi_clock_now(void) { - struct timespec t; - clock_gettime(CLOCK_REALTIME, &t); - return ((mi_msecs_t)t.tv_sec * 1000) + ((mi_msecs_t)t.tv_nsec / 1000000); -} -#else -// low resolution timer -mi_msecs_t _mi_clock_now(void) { - return ((mi_msecs_t)clock() / ((mi_msecs_t)CLOCKS_PER_SEC / 1000)); -} -#endif -#endif - static mi_msecs_t mi_clock_diff; +mi_msecs_t _mi_clock_now(void) { + return _mi_prim_clock_now(); +} + mi_msecs_t _mi_clock_start(void) { if (mi_clock_diff == 0.0) { mi_msecs_t t0 = _mi_clock_now(); @@ -435,3 +435,33 @@ mi_msecs_t _mi_clock_end(mi_msecs_t start) { mi_msecs_t end = _mi_clock_now(); return (end - start - mi_clock_diff); } + + +// -------------------------------------------------------- +// Basic process statistics +// -------------------------------------------------------- + +mi_decl_export void mi_process_info(size_t* elapsed_msecs, size_t* user_msecs, size_t* system_msecs, size_t* current_rss, size_t* peak_rss, size_t* current_commit, size_t* peak_commit, size_t* page_faults) mi_attr_noexcept +{ + mi_process_info_t pinfo; + _mi_memzero_var(pinfo); + pinfo.elapsed = _mi_clock_end(mi_process_start); + pinfo.current_commit = (size_t)(mi_atomic_loadi64_relaxed((_Atomic(int64_t)*)&_mi_stats_main.committed.current)); + pinfo.peak_commit = (size_t)(mi_atomic_loadi64_relaxed((_Atomic(int64_t)*)&_mi_stats_main.committed.peak)); + pinfo.current_rss = pinfo.current_commit; + pinfo.peak_rss = pinfo.peak_commit; + pinfo.utime = 0; + pinfo.stime = 0; + pinfo.page_faults = 0; + + _mi_prim_process_info(&pinfo); + + if (elapsed_msecs!=NULL) *elapsed_msecs = (pinfo.elapsed < 0 ? 0 : (pinfo.elapsed < (mi_msecs_t)PTRDIFF_MAX ? (size_t)pinfo.elapsed : PTRDIFF_MAX)); + if (user_msecs!=NULL) *user_msecs = (pinfo.utime < 0 ? 0 : (pinfo.utime < (mi_msecs_t)PTRDIFF_MAX ? (size_t)pinfo.utime : PTRDIFF_MAX)); + if (system_msecs!=NULL) *system_msecs = (pinfo.stime < 0 ? 0 : (pinfo.stime < (mi_msecs_t)PTRDIFF_MAX ? (size_t)pinfo.stime : PTRDIFF_MAX)); + if (current_rss!=NULL) *current_rss = pinfo.current_rss; + if (peak_rss!=NULL) *peak_rss = pinfo.peak_rss; + if (current_commit!=NULL) *current_commit = pinfo.current_commit; + if (peak_commit!=NULL) *peak_commit = pinfo.peak_commit; + if (page_faults!=NULL) *page_faults = pinfo.page_faults; +} diff --git a/test/CMakeLists.txt b/test/CMakeLists.txt deleted file mode 100644 index 4152f99..0000000 --- a/test/CMakeLists.txt +++ /dev/null @@ -1,46 +0,0 @@ -cmake_minimum_required(VERSION 3.0) -project(mimalloc-test C CXX) - -# Set default build type -if (NOT CMAKE_BUILD_TYPE) - if ("${CMAKE_BINARY_DIR}" MATCHES ".*(D|d)ebug$") - message(STATUS "No build type selected, default to *** Debug ***") - set(CMAKE_BUILD_TYPE "Debug") - else() - message(STATUS "No build type selected, default to *** Release ***") - set(CMAKE_BUILD_TYPE "Release") - endif() -endif() - -# Import mimalloc (if installed) -find_package(mimalloc 1.6 REQUIRED NO_SYSTEM_ENVIRONMENT_PATH) -message(STATUS "Found mimalloc installed at: ${MIMALLOC_TARGET_DIR}") - -# overriding with a dynamic library -add_executable(dynamic-override main-override.c) -target_link_libraries(dynamic-override PUBLIC mimalloc) - -add_executable(dynamic-override-cxx main-override.cpp) -target_link_libraries(dynamic-override-cxx PUBLIC mimalloc) - - -# overriding with a static object file works reliable as the symbols in the -# object file have priority over those in library files -add_executable(static-override-obj main-override.c ${MIMALLOC_TARGET_DIR}/mimalloc.o) -target_include_directories(static-override-obj PUBLIC ${MIMALLOC_TARGET_DIR}/include) -target_link_libraries(static-override-obj PUBLIC pthread) - - -# overriding with a static library works too if using the `mimalloc-override.h` -# header to redefine malloc/free. (the library already overrides new/delete) -add_executable(static-override-static main-override-static.c) -target_link_libraries(static-override-static PUBLIC mimalloc-static) - - -# overriding with a static library: this may not work if the library is linked too late -# on the command line after the C runtime library; but we cannot control that well in CMake -add_executable(static-override main-override.c) -target_link_libraries(static-override PUBLIC mimalloc-static) - -add_executable(static-override-cxx main-override.cpp) -target_link_libraries(static-override-cxx PUBLIC mimalloc-static) diff --git a/test/main-override-static.c b/test/main-override-static.c deleted file mode 100644 index 1efc01d..0000000 --- a/test/main-override-static.c +++ /dev/null @@ -1,168 +0,0 @@ -#include -#include -#include -#include -#include - -#include -#include // redefines malloc etc. - -static void double_free1(); -static void double_free2(); -static void corrupt_free(); -static void block_overflow1(); -static void invalid_free(); -static void test_aslr(void); -static void test_process_info(void); - -int main() { - mi_version(); - - // detect double frees and heap corruption - // double_free1(); - // double_free2(); - // corrupt_free(); - // block_overflow1(); - // test_aslr(); - invalid_free(); - - void* p1 = malloc(78); - void* p2 = malloc(24); - free(p1); - p1 = mi_malloc(8); - //char* s = strdup("hello\n"); - free(p2); - p2 = malloc(16); - p1 = realloc(p1, 32); - free(p1); - free(p2); - //free(s); - //mi_collect(true); - - /* now test if override worked by allocating/freeing across the api's*/ - //p1 = mi_malloc(32); - //free(p1); - //p2 = malloc(32); - //mi_free(p2); - mi_stats_print(NULL); - test_process_info(); - return 0; -} - -static void invalid_free() { - free((void*)0xBADBEEF); - realloc((void*)0xBADBEEF,10); -} - -static void block_overflow1() { - uint8_t* p = (uint8_t*)mi_malloc(17); - p[18] = 0; - free(p); -} - -// The double free samples come ArcHeap [1] by Insu Yun (issue #161) -// [1]: https://arxiv.org/pdf/1903.00503.pdf - -static void double_free1() { - void* p[256]; - //uintptr_t buf[256]; - - p[0] = mi_malloc(622616); - p[1] = mi_malloc(655362); - p[2] = mi_malloc(786432); - mi_free(p[2]); - // [VULN] Double free - mi_free(p[2]); - p[3] = mi_malloc(786456); - // [BUG] Found overlap - // p[3]=0x429b2ea2000 (size=917504), p[1]=0x429b2e42000 (size=786432) - fprintf(stderr, "p3: %p-%p, p1: %p-%p, p2: %p\n", p[3], (uint8_t*)(p[3]) + 786456, p[1], (uint8_t*)(p[1]) + 655362, p[2]); -} - -static void double_free2() { - void* p[256]; - //uintptr_t buf[256]; - // [INFO] Command buffer: 0x327b2000 - // [INFO] Input size: 182 - p[0] = malloc(712352); - p[1] = malloc(786432); - free(p[0]); - // [VULN] Double free - free(p[0]); - p[2] = malloc(786440); - p[3] = malloc(917504); - p[4] = malloc(786440); - // [BUG] Found overlap - // p[4]=0x433f1402000 (size=917504), p[1]=0x433f14c2000 (size=786432) - fprintf(stderr, "p1: %p-%p, p2: %p-%p\n", p[4], (uint8_t*)(p[4]) + 917504, p[1], (uint8_t*)(p[1]) + 786432); -} - - -// Try to corrupt the heap through buffer overflow -#define N 256 -#define SZ 64 - -static void corrupt_free() { - void* p[N]; - // allocate - for (int i = 0; i < N; i++) { - p[i] = malloc(SZ); - } - // free some - for (int i = 0; i < N; i += (N/10)) { - free(p[i]); - p[i] = NULL; - } - // try to corrupt the free list - for (int i = 0; i < N; i++) { - if (p[i] != NULL) { - memset(p[i], 0, SZ+8); - } - } - // allocate more.. trying to trigger an allocation from a corrupted entry - // this may need many allocations to get there (if at all) - for (int i = 0; i < 4096; i++) { - malloc(SZ); - } -} - -static void test_aslr(void) { - void* p[256]; - p[0] = malloc(378200); - p[1] = malloc(1134626); - printf("p1: %p, p2: %p\n", p[0], p[1]); -} - -static void test_process_info(void) { - size_t elapsed = 0; - size_t user_msecs = 0; - size_t system_msecs = 0; - size_t current_rss = 0; - size_t peak_rss = 0; - size_t current_commit = 0; - size_t peak_commit = 0; - size_t page_faults = 0; - for (int i = 0; i < 100000; i++) { - void* p = calloc(100,10); - free(p); - } - mi_process_info(&elapsed, &user_msecs, &system_msecs, ¤t_rss, &peak_rss, ¤t_commit, &peak_commit, &page_faults); - printf("\n\n*** process info: elapsed %3zd.%03zd s, user: %3zd.%03zd s, rss: %zd b, commit: %zd b\n\n", elapsed/1000, elapsed%1000, user_msecs/1000, user_msecs%1000, peak_rss, peak_commit); -} - -static void test_reserved(void) { -#define KiB 1024ULL -#define MiB (KiB*KiB) -#define GiB (MiB*KiB) - mi_reserve_os_memory(4*GiB, false, true); - void* p1 = malloc(100); - void* p2 = malloc(100000); - void* p3 = malloc(2*GiB); - void* p4 = malloc(1*GiB + 100000); - free(p1); - free(p2); - free(p3); - p3 = malloc(1*GiB); - free(p4); -} - diff --git a/test/main-override.c b/test/main-override.c deleted file mode 100644 index 1bec117..0000000 --- a/test/main-override.c +++ /dev/null @@ -1,30 +0,0 @@ -#include -#include -#include -#include - -#include - -int main() { - mi_version(); // ensure mimalloc library is linked - void* p1 = malloc(78); - void* p2 = malloc(24); - free(p1); - p1 = malloc(8); - //char* s = strdup("hello\n"); - free(p2); - p2 = malloc(16); - p1 = realloc(p1, 32); - free(p1); - free(p2); - //free(s); - //mi_collect(true); - - /* now test if override worked by allocating/freeing across the api's*/ - //p1 = mi_malloc(32); - //free(p1); - //p2 = malloc(32); - //mi_free(p2); - mi_stats_print(NULL); - return 0; -} diff --git a/test/main-override.cpp b/test/main-override.cpp deleted file mode 100644 index fe5403d..0000000 --- a/test/main-override.cpp +++ /dev/null @@ -1,209 +0,0 @@ -#include -#include -#include -#include -#include - -#include -#include -#include -#include -#include - -#include -#include -#include - -#ifdef _WIN32 -#include -#endif - -#ifdef _WIN32 -#include -static void msleep(unsigned long msecs) { Sleep(msecs); } -#else -#include -static void msleep(unsigned long msecs) { usleep(msecs * 1000UL); } -#endif - -void heap_thread_free_large(); // issue #221 -void heap_no_delete(); // issue #202 -void heap_late_free(); // issue #204 -void padding_shrink(); // issue #209 -void various_tests(); -void test_mt_shutdown(); - -int main() { - mi_stats_reset(); // ignore earlier allocations - heap_thread_free_large(); - heap_no_delete(); - heap_late_free(); - padding_shrink(); - various_tests(); - //test_mt_shutdown(); - mi_stats_print(NULL); - return 0; -} - -static void* p = malloc(8); - -void free_p() { - free(p); - return; -} - -class Test { -private: - int i; -public: - Test(int x) { i = x; } - ~Test() { } -}; - - -void various_tests() { - atexit(free_p); - void* p1 = malloc(78); - void* p2 = mi_malloc_aligned(16, 24); - free(p1); - p1 = malloc(8); - char* s = mi_strdup("hello\n"); - - //char* s = _strdup("hello\n"); - //char* buf = NULL; - //size_t len; - //_dupenv_s(&buf,&len,"MIMALLOC_VERBOSE"); - //mi_free(buf); - - mi_free(p2); - p2 = malloc(16); - p1 = realloc(p1, 32); - free(p1); - free(p2); - mi_free(s); - Test* t = new Test(42); - delete t; - t = new (std::nothrow) Test(42); - delete t; -} - -class Static { -private: - void* p; -public: - Static() { - p = malloc(64); - return; - } - ~Static() { - free(p); - return; - } -}; - -static Static s = Static(); - - -bool test_stl_allocator1() { - std::vector > vec; - vec.push_back(1); - vec.pop_back(); - return vec.size() == 0; -} - -struct some_struct { int i; int j; double z; }; - -bool test_stl_allocator2() { - std::vector > vec; - vec.push_back(some_struct()); - vec.pop_back(); - return vec.size() == 0; -} - - - -// Issue #202 -void heap_no_delete_worker() { - mi_heap_t* heap = mi_heap_new(); - void* q = mi_heap_malloc(heap, 1024); - // mi_heap_delete(heap); // uncomment to prevent assertion -} - -void heap_no_delete() { - auto t1 = std::thread(heap_no_delete_worker); - t1.join(); -} - - -// Issue #204 -volatile void* global_p; - -void t1main() { - mi_heap_t* heap = mi_heap_new(); - global_p = mi_heap_malloc(heap, 1024); - mi_heap_delete(heap); -} - -void heap_late_free() { - auto t1 = std::thread(t1main); - - msleep(2000); - assert(global_p); - mi_free((void*)global_p); - - t1.join(); -} - -// issue #209 -static void* shared_p; -static void alloc0(/* void* arg */) -{ - shared_p = mi_malloc(8); -} - -void padding_shrink(void) -{ - auto t1 = std::thread(alloc0); - t1.join(); - mi_free(shared_p); -} - - -// Issue #221 -void heap_thread_free_large_worker() { - mi_free(shared_p); -} - -void heap_thread_free_large() { - for (int i = 0; i < 100; i++) { - shared_p = mi_malloc_aligned(2*1024*1024 + 1, 8); - auto t1 = std::thread(heap_thread_free_large_worker); - t1.join(); - } -} - - - -void test_mt_shutdown() -{ - const int threads = 5; - std::vector< std::future< std::vector< char* > > > ts; - - auto fn = [&]() - { - std::vector< char* > ps; - ps.reserve(1000); - for (int i = 0; i < 1000; i++) - ps.emplace_back(new char[1]); - return ps; - }; - - for (int i = 0; i < threads; i++) - ts.emplace_back(std::async(std::launch::async, fn)); - - for (auto& f : ts) - for (auto& p : f.get()) - delete[] p; - - std::cout << "done" << std::endl; -} diff --git a/test/main.c b/test/main.c deleted file mode 100644 index b148f71..0000000 --- a/test/main.c +++ /dev/null @@ -1,46 +0,0 @@ -#include -#include -#include - -void test_heap(void* p_out) { - mi_heap_t* heap = mi_heap_new(); - void* p1 = mi_heap_malloc(heap,32); - void* p2 = mi_heap_malloc(heap,48); - mi_free(p_out); - mi_heap_destroy(heap); - //mi_heap_delete(heap); mi_free(p1); mi_free(p2); -} - -void test_large() { - const size_t N = 1000; - - for (size_t i = 0; i < N; ++i) { - size_t sz = 1ull << 21; - char* a = mi_mallocn_tp(char,sz); - for (size_t k = 0; k < sz; k++) { a[k] = 'x'; } - mi_free(a); - } -} - -int main() { - void* p1 = mi_malloc(16); - void* p2 = mi_malloc(1000000); - mi_free(p1); - mi_free(p2); - p1 = mi_malloc(16); - p2 = mi_malloc(16); - mi_free(p1); - mi_free(p2); - - test_heap(mi_malloc(32)); - - p1 = mi_malloc_aligned(64, 16); - p2 = mi_malloc_aligned(160,24); - mi_free(p2); - mi_free(p1); - //test_large(); - - mi_collect(true); - mi_stats_print(NULL); - return 0; -} diff --git a/test/readme.md b/test/readme.md deleted file mode 100644 index db3524c..0000000 --- a/test/readme.md +++ /dev/null @@ -1,16 +0,0 @@ -Testing allocators is difficult as bugs may only surface after particular -allocation patterns. The main approach to testing _mimalloc_ is therefore -to have extensive internal invariant checking (see `page_is_valid` in `page.c` -for example), which is enabled in debug mode with `-DMI_DEBUG_FULL=ON`. -The main testing strategy is then to run [`mimalloc-bench`][bench] using full -invariant checking to catch any potential problems over a wide range of intensive -allocation benchmarks and programs. - -However, this does not test well for the entire API surface and this is tested -with `test-api.c` when using `make test` (from `out/debug` etc). (This is -not complete yet, please add to it.) - -The `main.c` and `main-override.c` are there to test if building and overriding -from a local install works and therefore these build a separate `test/CMakeLists.txt`. - -[bench]: https://github.com/daanx/mimalloc-bench diff --git a/test/test-api.c b/test/test-api.c deleted file mode 100644 index e5827a9..0000000 --- a/test/test-api.c +++ /dev/null @@ -1,249 +0,0 @@ -/* ---------------------------------------------------------------------------- -Copyright (c) 2018, Microsoft Research, Daan Leijen -This is free software; you can redistribute it and/or modify it under the -terms of the MIT license. A copy of the license can be found in the file -"LICENSE" at the root of this distribution. ------------------------------------------------------------------------------*/ - -/* -Testing allocators is difficult as bugs may only surface after particular -allocation patterns. The main approach to testing _mimalloc_ is therefore -to have extensive internal invariant checking (see `page_is_valid` in `page.c` -for example), which is enabled in debug mode with `-DMI_DEBUG_FULL=ON`. -The main testing is then to run `mimalloc-bench` [1] using full invariant checking -to catch any potential problems over a wide range of intensive allocation bench -marks. - -However, this does not test well for the entire API surface. In this test file -we therefore test the API over various inputs. Please add more tests :-) - -[1] https://github.com/daanx/mimalloc-bench -*/ - -#include -#include -#include -#include -#include - -#ifdef __cplusplus -#include -#endif - -#include "mimalloc.h" -// #include "mimalloc-internal.h" - -// --------------------------------------------------------------------------- -// Test macros: CHECK(name,predicate) and CHECK_BODY(name,body) -// --------------------------------------------------------------------------- -static int ok = 0; -static int failed = 0; - -#define CHECK_BODY(name,body) \ - do { \ - fprintf(stderr,"test: %s... ", name ); \ - bool result = true; \ - do { body } while(false); \ - if (!(result)) { \ - failed++; \ - fprintf(stderr, \ - "\n FAILED: %s:%d:\n %s\n", \ - __FILE__, \ - __LINE__, \ - #body); \ - /* exit(1); */ \ - } \ - else { \ - ok++; \ - fprintf(stderr,"ok.\n"); \ - } \ - } while (false) - -#define CHECK(name,expr) CHECK_BODY(name,{ result = (expr); }) - -// --------------------------------------------------------------------------- -// Test functions -// --------------------------------------------------------------------------- -bool test_heap1(); -bool test_heap2(); -bool test_stl_allocator1(); -bool test_stl_allocator2(); - -// --------------------------------------------------------------------------- -// Main testing -// --------------------------------------------------------------------------- -int main() { - mi_option_disable(mi_option_verbose); - - // --------------------------------------------------- - // Malloc - // --------------------------------------------------- - - CHECK_BODY("malloc-zero",{ - void* p = mi_malloc(0); mi_free(p); - }); - CHECK_BODY("malloc-nomem1",{ - result = (mi_malloc(SIZE_MAX/2) == NULL); - }); - CHECK_BODY("malloc-null",{ - mi_free(NULL); - }); - CHECK_BODY("calloc-overflow",{ - // use (size_t)&mi_calloc to get some number without triggering compiler warnings - result = (mi_calloc((size_t)&mi_calloc,SIZE_MAX/1000) == NULL); - }); - CHECK_BODY("calloc0",{ - result = (mi_usable_size(mi_calloc(0,1000)) <= 16); - }); - - // --------------------------------------------------- - // Extended - // --------------------------------------------------- - CHECK_BODY("posix_memalign1", { - void* p = &p; - int err = mi_posix_memalign(&p, sizeof(void*), 32); - result = ((err==0 && (uintptr_t)p % sizeof(void*) == 0) || p==&p); - mi_free(p); - }); - CHECK_BODY("posix_memalign_no_align", { - void* p = &p; - int err = mi_posix_memalign(&p, 3, 32); - result = (err==EINVAL && p==&p); - }); - CHECK_BODY("posix_memalign_zero", { - void* p = &p; - int err = mi_posix_memalign(&p, sizeof(void*), 0); - mi_free(p); - result = (err==0); - }); - CHECK_BODY("posix_memalign_nopow2", { - void* p = &p; - int err = mi_posix_memalign(&p, 3*sizeof(void*), 32); - result = (err==EINVAL && p==&p); - }); - CHECK_BODY("posix_memalign_nomem", { - void* p = &p; - int err = mi_posix_memalign(&p, sizeof(void*), SIZE_MAX); - result = (err==ENOMEM && p==&p); - }); - - // --------------------------------------------------- - // Aligned API - // --------------------------------------------------- - CHECK_BODY("malloc-aligned1", { - void* p = mi_malloc_aligned(32,32); result = (p != NULL && (uintptr_t)(p) % 32 == 0); mi_free(p); - }); - CHECK_BODY("malloc-aligned2", { - void* p = mi_malloc_aligned(48,32); result = (p != NULL && (uintptr_t)(p) % 32 == 0); mi_free(p); - }); - CHECK_BODY("malloc-aligned3", { - void* p1 = mi_malloc_aligned(48,32); bool result1 = (p1 != NULL && (uintptr_t)(p1) % 32 == 0); - void* p2 = mi_malloc_aligned(48,32); bool result2 = (p2 != NULL && (uintptr_t)(p2) % 32 == 0); - mi_free(p2); - mi_free(p1); - result = (result1&&result2); - }); - CHECK_BODY("malloc-aligned4", { - void* p; - bool ok = true; - for (int i = 0; i < 8 && ok; i++) { - p = mi_malloc_aligned(8, 16); - ok = (p != NULL && (uintptr_t)(p) % 16 == 0); mi_free(p); - } - result = ok; - }); - CHECK_BODY("malloc-aligned5", { - void* p = mi_malloc_aligned(4097,4096); size_t usable = mi_usable_size(p); result = usable >= 4097 && usable < 10000; mi_free(p); - }); - CHECK_BODY("malloc-aligned-at1", { - void* p = mi_malloc_aligned_at(48,32,0); result = (p != NULL && ((uintptr_t)(p) + 0) % 32 == 0); mi_free(p); - }); - CHECK_BODY("malloc-aligned-at2", { - void* p = mi_malloc_aligned_at(50,32,8); result = (p != NULL && ((uintptr_t)(p) + 8) % 32 == 0); mi_free(p); - }); - CHECK_BODY("memalign1", { - void* p; - bool ok = true; - for (int i = 0; i < 8 && ok; i++) { - p = mi_memalign(16,8); - ok = (p != NULL && (uintptr_t)(p) % 16 == 0); mi_free(p); - } - result = ok; - }); - - // --------------------------------------------------- - // Heaps - // --------------------------------------------------- - CHECK("heap_destroy", test_heap1()); - CHECK("heap_delete", test_heap2()); - - //mi_stats_print(NULL); - - // --------------------------------------------------- - // various - // --------------------------------------------------- - CHECK_BODY("realpath", { - char* s = mi_realpath( ".", NULL ); - // printf("realpath: %s\n",s); - mi_free(s); - }); - - CHECK("stl_allocator1", test_stl_allocator1()); - CHECK("stl_allocator2", test_stl_allocator2()); - - // --------------------------------------------------- - // Done - // ---------------------------------------------------[] - fprintf(stderr,"\n\n---------------------------------------------\n" - "succeeded: %i\n" - "failed : %i\n\n", ok, failed); - return failed; -} - -// --------------------------------------------------- -// Larger test functions -// --------------------------------------------------- - -bool test_heap1() { - mi_heap_t* heap = mi_heap_new(); - int* p1 = mi_heap_malloc_tp(heap,int); - int* p2 = mi_heap_malloc_tp(heap,int); - *p1 = *p2 = 43; - mi_heap_destroy(heap); - return true; -} - -bool test_heap2() { - mi_heap_t* heap = mi_heap_new(); - int* p1 = mi_heap_malloc_tp(heap,int); - int* p2 = mi_heap_malloc_tp(heap,int); - mi_heap_delete(heap); - *p1 = 42; - mi_free(p1); - mi_free(p2); - return true; -} - -bool test_stl_allocator1() { -#ifdef __cplusplus - std::vector > vec; - vec.push_back(1); - vec.pop_back(); - return vec.size() == 0; -#else - return true; -#endif -} - -struct some_struct { int i; int j; double z; }; - -bool test_stl_allocator2() { -#ifdef __cplusplus - std::vector > vec; - vec.push_back(some_struct()); - vec.pop_back(); - return vec.size() == 0; -#else - return true; -#endif -} diff --git a/test/test-stress.c b/test/test-stress.c deleted file mode 100644 index 05dbd4b..0000000 --- a/test/test-stress.c +++ /dev/null @@ -1,329 +0,0 @@ -/* ---------------------------------------------------------------------------- -Copyright (c) 2018,2019 Microsoft Research, Daan Leijen -This is free software; you can redistribute it and/or modify it under the -terms of the MIT license. ------------------------------------------------------------------------------*/ - -/* This is a stress test for the allocator, using multiple threads and - transferring objects between threads. It tries to reflect real-world workloads: - - allocation size is distributed linearly in powers of two - - with some fraction extra large (and some extra extra large) - - the allocations are initialized and read again at free - - pointers transfer between threads - - threads are terminated and recreated with some objects surviving in between - - uses deterministic "randomness", but execution can still depend on - (random) thread scheduling. Do not use this test as a benchmark! -*/ - -#include -#include -#include -#include -#include -#include - -// > mimalloc-test-stress [THREADS] [SCALE] [ITER] -// -// argument defaults -static int THREADS = 32; // more repeatable if THREADS <= #processors -static int SCALE = 10; // scaling factor -static int ITER = 50; // N full iterations destructing and re-creating all threads - -// static int THREADS = 8; // more repeatable if THREADS <= #processors -// static int SCALE = 100; // scaling factor - -#define STRESS // undefine for leak test - -static bool allow_large_objects = true; // allow very large objects? -static size_t use_one_size = 0; // use single object size of `N * sizeof(uintptr_t)`? - - -#ifdef USE_STD_MALLOC -#define custom_calloc(n,s) calloc(n,s) -#define custom_realloc(p,s) realloc(p,s) -#define custom_free(p) free(p) -#else -#define custom_calloc(n,s) mi_calloc(n,s) -#define custom_realloc(p,s) mi_realloc(p,s) -#define custom_free(p) mi_free(p) -#endif - -// transfer pointer between threads -#define TRANSFERS (1000) -static volatile void* transfer[TRANSFERS]; - - -#if (UINTPTR_MAX != UINT32_MAX) -const uintptr_t cookie = 0xbf58476d1ce4e5b9UL; -#else -const uintptr_t cookie = 0x1ce4e5b9UL; -#endif - -static void* atomic_exchange_ptr(volatile void** p, void* newval); - -typedef uintptr_t* random_t; - -static uintptr_t pick(random_t r) { - uintptr_t x = *r; -#if (UINTPTR_MAX > UINT32_MAX) - // by Sebastiano Vigna, see: - x ^= x >> 30; - x *= 0xbf58476d1ce4e5b9UL; - x ^= x >> 27; - x *= 0x94d049bb133111ebUL; - x ^= x >> 31; -#else - // by Chris Wellons, see: - x ^= x >> 16; - x *= 0x7feb352dUL; - x ^= x >> 15; - x *= 0x846ca68bUL; - x ^= x >> 16; -#endif - *r = x; - return x; -} - -static bool chance(size_t perc, random_t r) { - return (pick(r) % 100 <= perc); -} - -static void* alloc_items(size_t items, random_t r) { - if (chance(1, r)) { - if (chance(1, r) && allow_large_objects) items *= 10000; // 0.01% giant - else if (chance(10, r) && allow_large_objects) items *= 1000; // 0.1% huge - else items *= 100; // 1% large objects; - } - if (items == 40) items++; // pthreads uses that size for stack increases - if (use_one_size > 0) items = (use_one_size / sizeof(uintptr_t)); - if (items==0) items = 1; - uintptr_t* p = (uintptr_t*)custom_calloc(items,sizeof(uintptr_t)); - if (p != NULL) { - for (uintptr_t i = 0; i < items; i++) { - p[i] = (items - i) ^ cookie; - } - } - return p; -} - -static void free_items(void* p) { - if (p != NULL) { - uintptr_t* q = (uintptr_t*)p; - uintptr_t items = (q[0] ^ cookie); - for (uintptr_t i = 0; i < items; i++) { - if ((q[i] ^ cookie) != items - i) { - fprintf(stderr, "memory corruption at block %p at %zu\n", p, i); - abort(); - } - } - } - custom_free(p); -} - - -static void stress(intptr_t tid) { - //bench_start_thread(); - uintptr_t r = (tid * 43); // rand(); - const size_t max_item_shift = 5; // 128 - const size_t max_item_retained_shift = max_item_shift + 2; - size_t allocs = 100 * ((size_t)SCALE) * (tid % 8 + 1); // some threads do more - size_t retain = allocs / 2; - void** data = NULL; - size_t data_size = 0; - size_t data_top = 0; - void** retained = (void**)custom_calloc(retain,sizeof(void*)); - size_t retain_top = 0; - - while (allocs > 0 || retain > 0) { - if (retain == 0 || (chance(50, &r) && allocs > 0)) { - // 50%+ alloc - allocs--; - if (data_top >= data_size) { - data_size += 100000; - data = (void**)custom_realloc(data, data_size * sizeof(void*)); - } - data[data_top++] = alloc_items(1ULL << (pick(&r) % max_item_shift), &r); - } - else { - // 25% retain - retained[retain_top++] = alloc_items( 1ULL << (pick(&r) % max_item_retained_shift), &r); - retain--; - } - if (chance(66, &r) && data_top > 0) { - // 66% free previous alloc - size_t idx = pick(&r) % data_top; - free_items(data[idx]); - data[idx] = NULL; - } - if (chance(25, &r) && data_top > 0) { - // 25% exchange a local pointer with the (shared) transfer buffer. - size_t data_idx = pick(&r) % data_top; - size_t transfer_idx = pick(&r) % TRANSFERS; - void* p = data[data_idx]; - void* q = atomic_exchange_ptr(&transfer[transfer_idx], p); - data[data_idx] = q; - } - } - // free everything that is left - for (size_t i = 0; i < retain_top; i++) { - free_items(retained[i]); - } - for (size_t i = 0; i < data_top; i++) { - free_items(data[i]); - } - custom_free(retained); - custom_free(data); - //bench_end_thread(); -} - -static void run_os_threads(size_t nthreads, void (*entry)(intptr_t tid)); - -static void test_stress(void) { - uintptr_t r = rand(); - for (int n = 0; n < ITER; n++) { - run_os_threads(THREADS, &stress); - for (int i = 0; i < TRANSFERS; i++) { - if (chance(50, &r) || n + 1 == ITER) { // free all on last run, otherwise free half of the transfers - void* p = atomic_exchange_ptr(&transfer[i], NULL); - free_items(p); - } - } - // mi_collect(false); -#if !defined(NDEBUG) || defined(MI_TSAN) - if ((n + 1) % 10 == 0) { printf("- iterations left: %3d\n", ITER - (n + 1)); } -#endif - } -} - -#ifndef STRESS -static void leak(intptr_t tid) { - uintptr_t r = rand(); - void* p = alloc_items(1 /*pick(&r)%128*/, &r); - if (chance(50, &r)) { - intptr_t i = (pick(&r) % TRANSFERS); - void* q = atomic_exchange_ptr(&transfer[i], p); - free_items(q); - } -} - -static void test_leak(void) { - for (int n = 0; n < ITER; n++) { - run_os_threads(THREADS, &leak); - mi_collect(false); -#ifndef NDEBUG - if ((n + 1) % 10 == 0) { printf("- iterations left: %3d\n", ITER - (n + 1)); } -#endif - } -} -#endif - -int main(int argc, char** argv) { - // > mimalloc-test-stress [THREADS] [SCALE] [ITER] - if (argc >= 2) { - char* end; - long n = strtol(argv[1], &end, 10); - if (n > 0) THREADS = n; - } - if (argc >= 3) { - char* end; - long n = (strtol(argv[2], &end, 10)); - if (n > 0) SCALE = n; - } - if (argc >= 4) { - char* end; - long n = (strtol(argv[3], &end, 10)); - if (n > 0) ITER = n; - } - printf("Using %d threads with a %d%% load-per-thread and %d iterations\n", THREADS, SCALE, ITER); - //int res = mi_reserve_huge_os_pages(4,1); - //printf("(reserve huge: %i\n)", res); - - //bench_start_program(); - - // Run ITER full iterations where half the objects in the transfer buffer survive to the next round. - srand(0x7feb352d); - // mi_stats_reset(); -#ifdef STRESS - test_stress(); -#else - test_leak(); -#endif - - // mi_collect(true); - mi_stats_print(NULL); - //bench_end_program(); - return 0; -} - - -static void (*thread_entry_fun)(intptr_t) = &stress; - -#ifdef _WIN32 - -#include - -static DWORD WINAPI thread_entry(LPVOID param) { - thread_entry_fun((intptr_t)param); - return 0; -} - -static void run_os_threads(size_t nthreads, void (*fun)(intptr_t)) { - thread_entry_fun = fun; - DWORD* tids = (DWORD*)custom_calloc(nthreads,sizeof(DWORD)); - HANDLE* thandles = (HANDLE*)custom_calloc(nthreads,sizeof(HANDLE)); - for (uintptr_t i = 0; i < nthreads; i++) { - thandles[i] = CreateThread(0, 8*1024, &thread_entry, (void*)(i), 0, &tids[i]); - } - for (size_t i = 0; i < nthreads; i++) { - WaitForSingleObject(thandles[i], INFINITE); - } - for (size_t i = 0; i < nthreads; i++) { - CloseHandle(thandles[i]); - } - custom_free(tids); - custom_free(thandles); -} - -static void* atomic_exchange_ptr(volatile void** p, void* newval) { -#if (INTPTR_MAX == INT32_MAX) - return (void*)InterlockedExchange((volatile LONG*)p, (LONG)newval); -#else - return (void*)InterlockedExchange64((volatile LONG64*)p, (LONG64)newval); -#endif -} -#else - -#include - -static void* thread_entry(void* param) { - thread_entry_fun((uintptr_t)param); - return NULL; -} - -static void run_os_threads(size_t nthreads, void (*fun)(intptr_t)) { - thread_entry_fun = fun; - pthread_t* threads = (pthread_t*)custom_calloc(nthreads,sizeof(pthread_t)); - memset(threads, 0, sizeof(pthread_t) * nthreads); - //pthread_setconcurrency(nthreads); - for (uintptr_t i = 0; i < nthreads; i++) { - pthread_create(&threads[i], NULL, &thread_entry, (void*)i); - } - for (size_t i = 0; i < nthreads; i++) { - pthread_join(threads[i], NULL); - } - custom_free(threads); -} - -#ifdef __cplusplus -#include -static void* atomic_exchange_ptr(volatile void** p, void* newval) { - return std::atomic_exchange((volatile std::atomic*)p, newval); -} -#else -#include -static void* atomic_exchange_ptr(volatile void** p, void* newval) { - return atomic_exchange((volatile _Atomic(void*)*)p, newval); -} -#endif - -#endif