Buckets:
arudradey/ml-cpu-storage / emsdk /upstream /emscripten /cache /sysroot /include /mimalloc-new-delete.h
| /* ---------------------------------------------------------------------------- | |
| 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. | |
| -----------------------------------------------------------------------------*/ | |
| // ---------------------------------------------------------------------------- | |
| // This header provides convenient overrides for the new and | |
| // delete operations in C++. | |
| // | |
| // This header should be included in only one source file! | |
| // | |
| // On Windows, or when linking dynamically with mimalloc, these | |
| // can be more performant than the standard new-delete operations. | |
| // See <https://en.cppreference.com/w/cpp/memory/new/operator_new> | |
| // --------------------------------------------------------------------------- | |
| // stay consistent with VCRT definitions | |
| void operator delete(void* p) noexcept { mi_free(p); }; | |
| void operator delete[](void* p) noexcept { mi_free(p); }; | |
| 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); } | |
| 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); } | |
| void operator delete (void* p, std::size_t n) noexcept { mi_free_size(p,n); }; | |
| void operator delete[](void* p, std::size_t n) noexcept { mi_free_size(p,n); }; | |
| void operator delete (void* p, std::align_val_t al) noexcept { mi_free_aligned(p, static_cast<size_t>(al)); } | |
| void operator delete[](void* p, std::align_val_t al) noexcept { mi_free_aligned(p, static_cast<size_t>(al)); } | |
| void operator delete (void* p, std::size_t n, std::align_val_t al) noexcept { mi_free_size_aligned(p, n, static_cast<size_t>(al)); }; | |
| void operator delete[](void* p, std::size_t n, std::align_val_t al) noexcept { mi_free_size_aligned(p, n, static_cast<size_t>(al)); }; | |
| void operator delete (void* p, std::align_val_t al, const std::nothrow_t&) noexcept { mi_free_aligned(p, static_cast<size_t>(al)); } | |
| void operator delete[](void* p, std::align_val_t al, const std::nothrow_t&) noexcept { mi_free_aligned(p, static_cast<size_t>(al)); } | |
| void* operator new (std::size_t n, std::align_val_t al) noexcept(false) { return mi_new_aligned(n, static_cast<size_t>(al)); } | |
| void* operator new[](std::size_t n, std::align_val_t al) noexcept(false) { return mi_new_aligned(n, static_cast<size_t>(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<size_t>(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<size_t>(al)); } | |
Xet Storage Details
- Size:
- 4.04 kB
- Xet hash:
- 5d1da627c35263778329f757feda7e55ee41b499ebe1d3f620daf08d33a8b352
·
Xet efficiently stores files, intelligently splitting them into unique chunks and accelerating uploads and downloads. More info.