| /* |
| * Copyright (C) 2012-2017 Apple Inc. All rights reserved. |
| * |
| * Redistribution and use in source and binary forms, with or without |
| * modification, are permitted provided that the following conditions |
| * are met: |
| * 1. Redistributions of source code must retain the above copyright |
| * notice, this list of conditions and the following disclaimer. |
| * 2. Redistributions in binary form must reproduce the above copyright |
| * notice, this list of conditions and the following disclaimer in the |
| * documentation and/or other materials provided with the distribution. |
| * |
| * THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS'' |
| * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, |
| * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
| * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS |
| * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
| * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF |
| * THE POSSIBILITY OF SUCH DAMAGE. |
| */ |
| |
| #include "AvailableMemory.h" |
| |
| #include "Environment.h" |
| #include "PerProcess.h" |
| #include "Scavenger.h" |
| #include "Sizes.h" |
| #include <mutex> |
| #if BOS(DARWIN) |
| #if BPLATFORM(IOS) |
| #import <algorithm> |
| #endif |
| #import <dispatch/dispatch.h> |
| #import <mach/host_info.h> |
| #import <mach/mach.h> |
| #import <mach/mach_error.h> |
| #import <math.h> |
| #elif BOS(UNIX) |
| #include <unistd.h> |
| #endif |
| |
| namespace bmalloc { |
| |
| static const size_t availableMemoryGuess = 512 * bmalloc::MB; |
| |
| static size_t computeAvailableMemory() |
| { |
| #if BPLATFORM(IOS_SIMULATOR) |
| // Pretend we have 512MB of memory to make cache sizes behave like on device. |
| return availableMemoryGuess; |
| #elif BOS(DARWIN) |
| host_basic_info_data_t hostInfo; |
| |
| mach_port_t host = mach_host_self(); |
| mach_msg_type_number_t count = HOST_BASIC_INFO_COUNT; |
| kern_return_t r = host_info(host, HOST_BASIC_INFO, (host_info_t)&hostInfo, &count); |
| mach_port_deallocate(mach_task_self(), host); |
| if (r != KERN_SUCCESS) |
| return availableMemoryGuess; |
| |
| if (hostInfo.max_mem > std::numeric_limits<size_t>::max()) |
| return std::numeric_limits<size_t>::max(); |
| |
| size_t sizeAccordingToKernel = static_cast<size_t>(hostInfo.max_mem); |
| #if BPLATFORM(IOS) |
| sizeAccordingToKernel = std::min(sizeAccordingToKernel, 840 * bmalloc::MB); |
| #endif |
| size_t multiple = 128 * bmalloc::MB; |
| |
| // Round up the memory size to a multiple of 128MB because max_mem may not be exactly 512MB |
| // (for example) and we have code that depends on those boundaries. |
| return ((sizeAccordingToKernel + multiple - 1) / multiple) * multiple; |
| #elif BOS(UNIX) |
| long pages = sysconf(_SC_PHYS_PAGES); |
| long pageSize = sysconf(_SC_PAGE_SIZE); |
| if (pages == -1 || pageSize == -1) |
| return availableMemoryGuess; |
| return pages * pageSize; |
| #else |
| return availableMemoryGuess; |
| #endif |
| } |
| |
| size_t availableMemory() |
| { |
| static size_t availableMemory; |
| static std::once_flag onceFlag; |
| std::call_once(onceFlag, [] { |
| availableMemory = computeAvailableMemory(); |
| }); |
| return availableMemory; |
| } |
| |
| #if BPLATFORM(IOS) |
| MemoryStatus memoryStatus() |
| { |
| size_t memoryFootprint; |
| if (PerProcess<Environment>::get()->isDebugHeapEnabled()) { |
| task_vm_info_data_t vmInfo; |
| mach_msg_type_number_t vmSize = TASK_VM_INFO_COUNT; |
| |
| memoryFootprint = 0; |
| if (KERN_SUCCESS == task_info(mach_task_self(), TASK_VM_INFO, (task_info_t)(&vmInfo), &vmSize)) |
| memoryFootprint = static_cast<size_t>(vmInfo.phys_footprint); |
| } else |
| memoryFootprint = PerProcess<Scavenger>::get()->footprint(); |
| |
| double percentInUse = static_cast<double>(memoryFootprint) / static_cast<double>(availableMemory()); |
| double percentAvailableMemoryInUse = std::min(percentInUse, 1.0); |
| |
| return MemoryStatus(memoryFootprint, percentAvailableMemoryInUse); |
| } |
| #endif |
| |
| } // namespace bmalloc |