mirror of
https://github.com/microsoft/mimalloc.git
synced 2025-05-05 23:19:31 +03:00
fix msvc warnings at level 4
This commit is contained in:
parent
6c91c75b14
commit
faca422b71
4 changed files with 23 additions and 15 deletions
|
@ -32,17 +32,17 @@ terms of the MIT license. A copy of the license can be found in the file
|
||||||
#endif
|
#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;
|
//if (!mi_is_in_heap_region(p)) return 0;
|
||||||
return mi_usable_size(p);
|
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;
|
//if (!mi_is_in_heap_region(p)) return 0;
|
||||||
return mi_usable_size(p);
|
return mi_usable_size(p);
|
||||||
}
|
}
|
||||||
|
|
||||||
size_t mi_malloc_good_size(size_t size) mi_attr_noexcept {
|
mi_decl_nodiscard size_t mi_malloc_good_size(size_t size) mi_attr_noexcept {
|
||||||
return mi_good_size(size);
|
return mi_good_size(size);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -65,24 +65,24 @@ int mi_posix_memalign(void** p, size_t alignment, size_t size) mi_attr_noexcept
|
||||||
return 0;
|
return 0;
|
||||||
}
|
}
|
||||||
|
|
||||||
mi_decl_restrict void* mi_memalign(size_t alignment, size_t size) mi_attr_noexcept {
|
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);
|
void* p = mi_malloc_aligned(size, alignment);
|
||||||
mi_assert_internal(((uintptr_t)p % alignment) == 0);
|
mi_assert_internal(((uintptr_t)p % alignment) == 0);
|
||||||
return p;
|
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 );
|
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();
|
size_t psize = _mi_os_page_size();
|
||||||
if (size >= SIZE_MAX - psize) return NULL; // overflow
|
if (size >= SIZE_MAX - psize) return NULL; // overflow
|
||||||
size_t asize = _mi_align_up(size, psize);
|
size_t asize = _mi_align_up(size, psize);
|
||||||
return mi_malloc_aligned(asize, psize);
|
return mi_malloc_aligned(asize, psize);
|
||||||
}
|
}
|
||||||
|
|
||||||
mi_decl_restrict void* mi_aligned_alloc(size_t alignment, size_t size) mi_attr_noexcept {
|
mi_decl_nodiscard mi_decl_restrict void* mi_aligned_alloc(size_t alignment, size_t size) mi_attr_noexcept {
|
||||||
if (mi_unlikely((size&(alignment-1)) != 0)) { // C11 requires alignment>0 && integral multiple, see <https://en.cppreference.com/w/c/memory/aligned_alloc>
|
if (mi_unlikely((size&(alignment-1)) != 0)) { // C11 requires alignment>0 && integral multiple, see <https://en.cppreference.com/w/c/memory/aligned_alloc>
|
||||||
#if MI_DEBUG > 0
|
#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);
|
_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);
|
||||||
|
@ -95,13 +95,13 @@ mi_decl_restrict void* mi_aligned_alloc(size_t alignment, size_t size) mi_attr_n
|
||||||
return p;
|
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);
|
void* newp = mi_reallocn(p,count,size);
|
||||||
if (newp==NULL) { errno = ENOMEM; }
|
if (newp==NULL) { errno = ENOMEM; }
|
||||||
return newp;
|
return newp;
|
||||||
}
|
}
|
||||||
|
|
||||||
int mi_reallocarr( void* p, size_t count, size_t size ) mi_attr_noexcept { // NetBSD
|
mi_decl_nodiscard int mi_reallocarr( void* p, size_t count, size_t size ) mi_attr_noexcept { // NetBSD
|
||||||
mi_assert(p != NULL);
|
mi_assert(p != NULL);
|
||||||
if (p == NULL) {
|
if (p == NULL) {
|
||||||
errno = EINVAL;
|
errno = EINVAL;
|
||||||
|
@ -120,7 +120,7 @@ void* mi__expand(void* p, size_t newsize) mi_attr_noexcept { // Microsoft
|
||||||
return res;
|
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;
|
if (s==NULL) return NULL;
|
||||||
size_t len;
|
size_t len;
|
||||||
for(len = 0; s[len] != 0; len++) { }
|
for(len = 0; s[len] != 0; len++) { }
|
||||||
|
@ -132,7 +132,7 @@ mi_decl_restrict unsigned short* mi_wcsdup(const unsigned short* s) mi_attr_noex
|
||||||
return p;
|
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);
|
return (unsigned char*)mi_strdup((const char*)s);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -172,10 +172,10 @@ int mi_wdupenv_s(unsigned short** buf, size_t* size, const unsigned short* name)
|
||||||
#endif
|
#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);
|
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);
|
return mi_recalloc_aligned(p, newcount, size, alignment);
|
||||||
}
|
}
|
||||||
|
|
|
@ -458,7 +458,7 @@ bool _mi_preloading(void) {
|
||||||
return os_preloading;
|
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;
|
return mi_redirected;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
|
@ -116,6 +116,7 @@ void _mi_options_init(void) {
|
||||||
|
|
||||||
mi_decl_nodiscard 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);
|
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_option_desc_t* desc = &options[option];
|
||||||
mi_assert(desc->option == option); // index should match the option
|
mi_assert(desc->option == option); // index should match the option
|
||||||
if (mi_unlikely(desc->init == UNINIT)) {
|
if (mi_unlikely(desc->init == UNINIT)) {
|
||||||
|
@ -126,6 +127,7 @@ mi_decl_nodiscard long mi_option_get(mi_option_t option) {
|
||||||
|
|
||||||
void mi_option_set(mi_option_t option, long value) {
|
void mi_option_set(mi_option_t option, long value) {
|
||||||
mi_assert(option >= 0 && option < _mi_option_last);
|
mi_assert(option >= 0 && option < _mi_option_last);
|
||||||
|
if (option < 0 || option >= _mi_option_last) return;
|
||||||
mi_option_desc_t* desc = &options[option];
|
mi_option_desc_t* desc = &options[option];
|
||||||
mi_assert(desc->option == option); // index should match the option
|
mi_assert(desc->option == option); // index should match the option
|
||||||
desc->value = value;
|
desc->value = value;
|
||||||
|
@ -134,6 +136,7 @@ void mi_option_set(mi_option_t option, long value) {
|
||||||
|
|
||||||
void mi_option_set_default(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);
|
mi_assert(option >= 0 && option < _mi_option_last);
|
||||||
|
if (option < 0 || option >= _mi_option_last) return;
|
||||||
mi_option_desc_t* desc = &options[option];
|
mi_option_desc_t* desc = &options[option];
|
||||||
if (desc->init != INITIALIZED) {
|
if (desc->init != INITIALIZED) {
|
||||||
desc->value = value;
|
desc->value = value;
|
||||||
|
|
|
@ -191,7 +191,10 @@ static void mi_segment_protect(mi_segment_t* segment, bool protect, mi_os_tld_t*
|
||||||
mi_assert_internal((segment->segment_info_size - os_psize) >= (sizeof(mi_segment_t) + ((segment->capacity - 1) * sizeof(mi_page_t))));
|
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_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);
|
mi_segment_protect_range((uint8_t*)segment + segment->segment_info_size - os_psize, os_psize, protect);
|
||||||
if (MI_SECURE <= 1 || segment->capacity == 1) {
|
#if (MI_SECURE >= 2)
|
||||||
|
if (segment->capacity == 1)
|
||||||
|
#endif
|
||||||
|
{
|
||||||
// and protect the last (or only) page too
|
// and protect the last (or only) page too
|
||||||
mi_assert_internal(MI_SECURE <= 1 || segment->page_kind >= MI_PAGE_LARGE);
|
mi_assert_internal(MI_SECURE <= 1 || segment->page_kind >= MI_PAGE_LARGE);
|
||||||
uint8_t* start = (uint8_t*)segment + segment->segment_size - os_psize;
|
uint8_t* start = (uint8_t*)segment + segment->segment_size - os_psize;
|
||||||
|
@ -207,6 +210,7 @@ static void mi_segment_protect(mi_segment_t* segment, bool protect, mi_os_tld_t*
|
||||||
mi_segment_protect_range(start, os_psize, protect);
|
mi_segment_protect_range(start, os_psize, protect);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
#if (MI_SECURE >= 2)
|
||||||
else {
|
else {
|
||||||
// or protect every page
|
// or protect every page
|
||||||
const size_t page_size = mi_segment_page_size(segment);
|
const size_t page_size = mi_segment_page_size(segment);
|
||||||
|
@ -216,6 +220,7 @@ static void mi_segment_protect(mi_segment_t* segment, bool protect, mi_os_tld_t*
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
#endif
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
Loading…
Add table
Reference in a new issue