| // Copyright (c) 2006-2008 The Chromium Authors. All rights reserved. |
| // Use of this source code is governed by a BSD-style license that can be |
| // found in the LICENSE file. |
| |
| #define _CRT_SECURE_NO_WARNINGS |
| |
| #include "testing/gtest/include/gtest/gtest.h" |
| #include "base/process_util.h" |
| |
| TEST(ProcessUtilTest, EnableLFH) { |
| ASSERT_TRUE(process_util::EnableLowFragmentationHeap()); |
| if (IsDebuggerPresent()) { |
| // Under these conditions, LFH can't be enabled. There's no point to test |
| // anything. |
| const char* no_debug_env = getenv("_NO_DEBUG_HEAP"); |
| if (!no_debug_env || strcmp(no_debug_env, "1")) |
| return; |
| } |
| HANDLE heaps[1024] = { 0 }; |
| unsigned number_heaps = GetProcessHeaps(1024, heaps); |
| EXPECT_GT(number_heaps, 0u); |
| for (unsigned i = 0; i < number_heaps; ++i) { |
| ULONG flag = 0; |
| SIZE_T length; |
| ASSERT_NE(0, HeapQueryInformation(heaps[i], |
| HeapCompatibilityInformation, |
| &flag, |
| sizeof(flag), |
| &length)); |
| // If flag is 0, the heap is a standard heap that does not support |
| // look-asides. If flag is 1, the heap supports look-asides. If flag is 2, |
| // the heap is a low-fragmentation heap (LFH). Note that look-asides are not |
| // supported on the LFH. |
| |
| // We don't have any documented way of querying the HEAP_NO_SERIALIZE flag. |
| EXPECT_LE(flag, 2u); |
| EXPECT_NE(flag, 1u); |
| } |
| } |
| |
| TEST(ProcessUtilTest, CalcFreeMemory) { |
| process_util::ProcessMetrics* metrics = |
| process_util::ProcessMetrics::CreateProcessMetrics(::GetCurrentProcess()); |
| ASSERT_TRUE(NULL != metrics); |
| |
| // Typical values here is ~1900 for total and ~1000 for largest. Obviously |
| // it depends in what other tests have done to this process. |
| process_util::FreeMBytes free_mem1 = {0}; |
| EXPECT_TRUE(metrics->CalculateFreeMemory(&free_mem1)); |
| EXPECT_LT(10u, free_mem1.total); |
| EXPECT_LT(10u, free_mem1.largest); |
| EXPECT_GT(2048u, free_mem1.total); |
| EXPECT_GT(2048u, free_mem1.largest); |
| EXPECT_GE(free_mem1.total, free_mem1.largest); |
| EXPECT_TRUE(NULL != free_mem1.largest_ptr); |
| |
| // Allocate 20M and check again. It should have gone down. |
| const int kAllocMB = 20; |
| char* alloc = new char[kAllocMB * 1024 * 1024]; |
| EXPECT_TRUE(NULL != alloc); |
| |
| size_t expected_total = free_mem1.total - kAllocMB; |
| size_t expected_largest = free_mem1.largest; |
| |
| process_util::FreeMBytes free_mem2 = {0}; |
| EXPECT_TRUE(metrics->CalculateFreeMemory(&free_mem2)); |
| EXPECT_GE(free_mem2.total, free_mem2.largest); |
| EXPECT_GE(expected_total, free_mem2.total); |
| EXPECT_GE(expected_largest, free_mem2.largest); |
| EXPECT_TRUE(NULL != free_mem2.largest_ptr); |
| |
| delete[] alloc; |
| delete metrics; |
| } |
| |