mirror of
https://github.com/microsoft/mimalloc.git
synced 2025-05-08 00:09:31 +03:00
Clean up unnecessary else statement right after previous return
This commit is contained in:
parent
06f8da4218
commit
ce25fffc69
5 changed files with 19 additions and 33 deletions
|
@ -94,19 +94,17 @@ static void* mi_realloc_zero_aligned_at(void* p, size_t newsize, size_t alignmen
|
||||||
&& (((uintptr_t)p + offset) % alignment) == 0) {
|
&& (((uintptr_t)p + offset) % alignment) == 0) {
|
||||||
return p; // reallocation still fits, is aligned and not more than 50% waste
|
return p; // reallocation still fits, is aligned and not more than 50% waste
|
||||||
}
|
}
|
||||||
else {
|
void* newp = mi_malloc_aligned_at(newsize,alignment,offset);
|
||||||
void* newp = mi_malloc_aligned_at(newsize,alignment,offset);
|
if (newp != NULL) {
|
||||||
if (newp != NULL) {
|
if (zero && newsize > size) {
|
||||||
if (zero && newsize > size) {
|
// also set last word in the previous allocation to zero to ensure any padding is zero-initialized
|
||||||
// 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);
|
||||||
size_t start = (size >= sizeof(intptr_t) ? size - sizeof(intptr_t) : 0);
|
memset((uint8_t*)newp + start, 0, newsize - start);
|
||||||
memset((uint8_t*)newp + start, 0, newsize - start);
|
|
||||||
}
|
|
||||||
memcpy(newp, p, (newsize > size ? size : newsize));
|
|
||||||
mi_free(p); // only free if succesfull
|
|
||||||
}
|
}
|
||||||
return newp;
|
memcpy(newp, p, (newsize > size ? size : newsize));
|
||||||
|
mi_free(p); // only free if succesfull
|
||||||
}
|
}
|
||||||
|
return newp;
|
||||||
}
|
}
|
||||||
|
|
||||||
static void* _mi_realloc_aligned(void* p, size_t newsize, size_t alignment, bool zero) mi_attr_noexcept {
|
static void* _mi_realloc_aligned(void* p, size_t newsize, size_t alignment, bool zero) mi_attr_noexcept {
|
||||||
|
|
|
@ -154,10 +154,8 @@ static malloc_zone_t* mi_get_default_zone()
|
||||||
if (ret == KERN_SUCCESS && count > 0) {
|
if (ret == KERN_SUCCESS && count > 0) {
|
||||||
return zones[0];
|
return zones[0];
|
||||||
}
|
}
|
||||||
else {
|
// fallback
|
||||||
// fallback
|
return malloc_default_zone();
|
||||||
return malloc_default_zone();
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
|
@ -226,4 +224,4 @@ static void __attribute__((constructor)) _mi_macosx_override_malloc()
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
#endif // MI_MALLOC_OVERRIDE
|
#endif // MI_MALLOC_OVERRIDE
|
||||||
|
|
16
src/alloc.c
16
src/alloc.c
|
@ -266,9 +266,7 @@ size_t mi_usable_size(void* p) mi_attr_noexcept {
|
||||||
mi_assert_internal(adjust >= 0 && (size_t)adjust <= size);
|
mi_assert_internal(adjust >= 0 && (size_t)adjust <= size);
|
||||||
return (size - adjust);
|
return (size - adjust);
|
||||||
}
|
}
|
||||||
else {
|
return size;
|
||||||
return size;
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
|
@ -418,9 +416,7 @@ char* mi_heap_realpath(mi_heap_t* heap, const char* fname, char* resolved_name)
|
||||||
else if (resolved_name != NULL) {
|
else if (resolved_name != NULL) {
|
||||||
return resolved_name;
|
return resolved_name;
|
||||||
}
|
}
|
||||||
else {
|
return mi_heap_strndup(heap, buf, PATH_MAX);
|
||||||
return mi_heap_strndup(heap, buf, PATH_MAX);
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
#else
|
#else
|
||||||
#include <limits.h>
|
#include <limits.h>
|
||||||
|
@ -432,11 +428,9 @@ char* mi_heap_realpath(mi_heap_t* heap, const char* fname, char* resolved_name)
|
||||||
if (resolved_name != NULL) {
|
if (resolved_name != NULL) {
|
||||||
return realpath(fname,resolved_name);
|
return realpath(fname,resolved_name);
|
||||||
}
|
}
|
||||||
else {
|
char buf[PATH_MAX+1];
|
||||||
char buf[PATH_MAX+1];
|
char* rname = realpath(fname,buf);
|
||||||
char* rname = realpath(fname,buf);
|
return mi_heap_strndup(heap,rname,PATH_MAX); // ok if `rname==NULL`
|
||||||
return mi_heap_strndup(heap,rname,PATH_MAX); // ok if `rname==NULL`
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
#endif
|
#endif
|
||||||
|
|
||||||
|
|
|
@ -493,9 +493,7 @@ static bool mi_heap_area_visitor(const mi_heap_t* heap, const mi_heap_area_ex_t*
|
||||||
if (args->visit_blocks) {
|
if (args->visit_blocks) {
|
||||||
return mi_heap_area_visit_blocks(xarea, args->visitor, args->arg);
|
return mi_heap_area_visit_blocks(xarea, args->visitor, args->arg);
|
||||||
}
|
}
|
||||||
else {
|
return true;
|
||||||
return true;
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
|
||||||
// Visit all blocks in a heap
|
// Visit all blocks in a heap
|
||||||
|
|
|
@ -150,9 +150,7 @@ size_t mi_good_size(size_t size) mi_attr_noexcept {
|
||||||
if (size <= MI_LARGE_SIZE_MAX) {
|
if (size <= MI_LARGE_SIZE_MAX) {
|
||||||
return _mi_bin_size(_mi_bin(size));
|
return _mi_bin_size(_mi_bin(size));
|
||||||
}
|
}
|
||||||
else {
|
return _mi_align_up(size,_mi_os_page_size());
|
||||||
return _mi_align_up(size,_mi_os_page_size());
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
|
||||||
#if (MI_DEBUG>1)
|
#if (MI_DEBUG>1)
|
||||||
|
|
Loading…
Add table
Reference in a new issue