037ff2b725
This allows us to change the page size without affecting Scavenger heuristics and performance. Bug: chromium:852420 Change-Id: Idcff4296e88e16f9af0ee6ecd00c63d789866fd6 Reviewed-on: https://chromium-review.googlesource.com/c/v8/v8/+/1499494 Commit-Queue: Ulan Degenbaev <ulan@chromium.org> Reviewed-by: Hannes Payer <hpayer@chromium.org> Cr-Commit-Position: refs/heads/master@{#60028}
104 lines
3.3 KiB
C++
104 lines
3.3 KiB
C++
// Copyright 2014 the V8 project authors. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style license that can be
|
|
// found in the LICENSE file.
|
|
|
|
#include <cmath>
|
|
#include <iostream>
|
|
#include <limits>
|
|
|
|
#include "src/handles-inl.h"
|
|
#include "src/heap/heap.h"
|
|
#include "src/heap/spaces-inl.h"
|
|
#include "src/objects-inl.h"
|
|
#include "test/unittests/test-utils.h"
|
|
#include "testing/gtest/include/gtest/gtest.h"
|
|
|
|
namespace v8 {
|
|
namespace internal {
|
|
|
|
typedef TestWithIsolate HeapTest;
|
|
typedef TestWithIsolateAndPointerCompression HeapWithPointerCompressionTest;
|
|
|
|
TEST(Heap, SemiSpaceSize) {
|
|
const size_t MB = static_cast<size_t>(i::MB);
|
|
const size_t pm = i::Heap::kPointerMultiplier;
|
|
ASSERT_EQ(512u * pm, i::Heap::ComputeMaxSemiSpaceSize(0u));
|
|
ASSERT_EQ(512u * pm, i::Heap::ComputeMaxSemiSpaceSize(512u * MB));
|
|
ASSERT_EQ(2048u * pm, i::Heap::ComputeMaxSemiSpaceSize(1024u * MB));
|
|
ASSERT_EQ(5120u * pm, i::Heap::ComputeMaxSemiSpaceSize(2024u * MB));
|
|
ASSERT_EQ(8192u * pm, i::Heap::ComputeMaxSemiSpaceSize(4095u * MB));
|
|
}
|
|
|
|
TEST_F(HeapTest, ASLR) {
|
|
#if V8_TARGET_ARCH_X64
|
|
#if V8_OS_MACOSX
|
|
Heap* heap = i_isolate()->heap();
|
|
std::set<void*> hints;
|
|
for (int i = 0; i < 1000; i++) {
|
|
hints.insert(heap->GetRandomMmapAddr());
|
|
}
|
|
if (hints.size() == 1) {
|
|
EXPECT_TRUE((*hints.begin()) == nullptr);
|
|
EXPECT_TRUE(i::GetRandomMmapAddr() == nullptr);
|
|
} else {
|
|
// It is unlikely that 1000 random samples will collide to less then 500
|
|
// values.
|
|
EXPECT_GT(hints.size(), 500u);
|
|
const uintptr_t kRegionMask = 0xFFFFFFFFu;
|
|
void* first = *hints.begin();
|
|
for (void* hint : hints) {
|
|
uintptr_t diff = reinterpret_cast<uintptr_t>(first) ^
|
|
reinterpret_cast<uintptr_t>(hint);
|
|
EXPECT_LE(diff, kRegionMask);
|
|
}
|
|
}
|
|
#endif // V8_OS_MACOSX
|
|
#endif // V8_TARGET_ARCH_X64
|
|
}
|
|
|
|
TEST_F(HeapTest, ExternalLimitDefault) {
|
|
Heap* heap = i_isolate()->heap();
|
|
EXPECT_EQ(kExternalAllocationSoftLimit,
|
|
heap->isolate()->isolate_data()->external_memory_limit_);
|
|
}
|
|
|
|
TEST_F(HeapTest, ExternalLimitStaysAboveDefaultForExplicitHandling) {
|
|
v8_isolate()->AdjustAmountOfExternalAllocatedMemory(+10 * MB);
|
|
v8_isolate()->AdjustAmountOfExternalAllocatedMemory(-10 * MB);
|
|
Heap* heap = i_isolate()->heap();
|
|
EXPECT_GE(heap->isolate()->isolate_data()->external_memory_limit_,
|
|
kExternalAllocationSoftLimit);
|
|
}
|
|
|
|
#if V8_TARGET_ARCH_64_BIT
|
|
TEST_F(HeapWithPointerCompressionTest, HeapLayout) {
|
|
// Produce some garbage.
|
|
RunJS(
|
|
"let ar = [];"
|
|
"for (let i = 0; i < 100; i++) {"
|
|
" ar.push(Array(i));"
|
|
"}"
|
|
"ar.push(Array(32 * 1024 * 1024));");
|
|
|
|
Address isolate_root = i_isolate()->isolate_root();
|
|
EXPECT_TRUE(IsAligned(isolate_root, size_t{4} * GB));
|
|
|
|
// Check that all memory chunks belong this region.
|
|
base::AddressRegion heap_reservation(isolate_root - size_t{2} * GB,
|
|
size_t{4} * GB);
|
|
|
|
OldGenerationMemoryChunkIterator iter(i_isolate()->heap());
|
|
for (;;) {
|
|
MemoryChunk* chunk = iter.next();
|
|
if (chunk == nullptr) break;
|
|
|
|
Address address = chunk->address();
|
|
size_t size = chunk->area_end() - address;
|
|
EXPECT_TRUE(heap_reservation.contains(address, size));
|
|
}
|
|
}
|
|
#endif // V8_TARGET_ARCH_64_BIT
|
|
|
|
} // namespace internal
|
|
} // namespace v8
|