test-alloc.cc 9.51 KB
Newer Older
1
// Copyright 2012 the V8 project authors. All rights reserved.
2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
//     * Redistributions of source code must retain the above copyright
//       notice, this list of conditions and the following disclaimer.
//     * 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.
//     * Neither the name of Google Inc. nor the names of its
//       contributors may be used to endorse or promote products derived
//       from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND 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 THE COPYRIGHT
// OWNER OR 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.

28
#include "src/v8.h"
29 30
#include "test/cctest/cctest.h"

31 32
#include "src/accessors.h"
#include "src/api.h"
33
#include "src/objects-inl.h"
marja's avatar
marja committed
34
#include "src/property.h"
35
#include "test/cctest/heap/heap-tester.h"
36
#include "test/cctest/heap/heap-utils.h"
37

38 39 40
namespace v8 {
namespace internal {
namespace heap {
41

42
AllocationResult HeapTester::AllocateAfterFailures() {
43
  Heap* heap = CcTest::heap();
44 45

  // New space.
46 47
  heap->AllocateByteArray(100).ToObjectChecked();
  heap->AllocateFixedArray(100, NOT_TENURED).ToObjectChecked();
48 49 50

  // Make sure we can allocate through optimized allocation functions
  // for specific kinds.
51
  heap->AllocateFixedArray(100).ToObjectChecked();
52
  heap->AllocateHeapNumber().ToObjectChecked();
53
  Object* object = heap->AllocateJSObject(
54 55
      *CcTest::i_isolate()->object_function()).ToObjectChecked();
  heap->CopyJSObject(JSObject::cast(object)).ToObjectChecked();
56 57

  // Old data space.
58
  heap::SimulateFullSpace(heap->old_space());
59
  heap->AllocateByteArray(100, TENURED).ToObjectChecked();
60

61
  // Old pointer space.
62
  heap::SimulateFullSpace(heap->old_space());
63
  heap->AllocateFixedArray(10000, TENURED).ToObjectChecked();
64

65
  // Large object space.
66 67 68 69 70 71
  static const size_t kLargeObjectSpaceFillerLength =
      3 * (Page::kPageSize / 10);
  static const size_t kLargeObjectSpaceFillerSize =
      FixedArray::SizeFor(kLargeObjectSpaceFillerLength);
  CHECK_GT(kLargeObjectSpaceFillerSize,
           static_cast<size_t>(heap->old_space()->AreaSize()));
72
  while (heap->OldGenerationSpaceAvailable() > kLargeObjectSpaceFillerSize) {
73 74
    heap->AllocateFixedArray(
        kLargeObjectSpaceFillerLength, TENURED).ToObjectChecked();
75
  }
76 77
  heap->AllocateFixedArray(
      kLargeObjectSpaceFillerLength, TENURED).ToObjectChecked();
78 79

  // Map space.
80
  heap::SimulateFullSpace(heap->map_space());
81
  int instance_size = JSObject::kHeaderSize;
82
  heap->AllocateMap(JS_OBJECT_TYPE, instance_size).ToObjectChecked();
83 84

  // Test that we can allocate in old pointer space and code space.
85
  heap::SimulateFullSpace(heap->code_space());
86
  heap->AllocateFixedArray(100, TENURED).ToObjectChecked();
87 88
  Code* illegal = CcTest::i_isolate()->builtins()->builtin(Builtins::kIllegal);
  heap->CopyCode(illegal, illegal->code_data_container()).ToObjectChecked();
89 90

  // Return success.
91
  return heap->true_value();
92 93
}

94
Handle<Object> HeapTester::TestAllocateAfterFailures() {
95 96 97
  // Similar to what the CALL_AND_RETRY macro does in the last-resort case, we
  // are wrapping the allocator function in an AlwaysAllocateScope.  Test that
  // all allocations succeed immediately without any retry.
98
  CcTest::CollectAllAvailableGarbage();
99 100
  AlwaysAllocateScope scope(CcTest::i_isolate());
  return handle(AllocateAfterFailures().ToObjectChecked(), CcTest::i_isolate());
101 102 103
}


104
HEAP_TEST(StressHandles) {
105
  v8::HandleScope scope(CcTest::isolate());
106
  v8::Local<v8::Context> env = v8::Context::New(CcTest::isolate());
107
  env->Enter();
108
  Handle<Object> o = TestAllocateAfterFailures();
109
  CHECK(o->IsTrue(CcTest::i_isolate()));
110 111
  env->Exit();
}
112 113


114
void TestGetter(
115
    v8::Local<v8::Name> name,
116 117 118
    const v8::PropertyCallbackInfo<v8::Value>& info) {
  i::Isolate* isolate = reinterpret_cast<i::Isolate*>(info.GetIsolate());
  HandleScope scope(isolate);
119 120
  info.GetReturnValue().Set(
      v8::Utils::ToLocal(HeapTester::TestAllocateAfterFailures()));
121 122
}

123 124
void TestSetter(v8::Local<v8::Name> name, v8::Local<v8::Value> value,
                const v8::PropertyCallbackInfo<v8::Boolean>& info) {
125 126 127 128 129 130
  UNREACHABLE();
}


Handle<AccessorInfo> TestAccessorInfo(
      Isolate* isolate, PropertyAttributes attributes) {
131
  Handle<String> name = isolate->factory()->NewStringFromStaticChars("get");
132
  return Accessors::MakeAccessor(isolate, name, &TestGetter, &TestSetter);
133
}
134 135 136


TEST(StressJS) {
137
  Isolate* isolate = CcTest::i_isolate();
138
  Factory* factory = isolate->factory();
139
  v8::HandleScope scope(CcTest::isolate());
140
  v8::Local<v8::Context> env = v8::Context::New(CcTest::isolate());
141
  env->Enter();
142 143
  Handle<JSFunction> function =
      factory->NewFunctionForTest(factory->function_string());
144 145
  // Force the creation of an initial map and set the code to
  // something empty.
146
  factory->NewJSObject(function);
147 148
  function->set_code(
      CcTest::i_isolate()->builtins()->builtin(Builtins::kEmptyFunction));
149 150 151
  // Patch the map to have an accessor for "get".
  Handle<Map> map(function->initial_map());
  Handle<DescriptorArray> instance_descriptors(map->instance_descriptors());
152
  CHECK_EQ(0, instance_descriptors->number_of_descriptors());
153

154
  PropertyAttributes attrs = NONE;
155
  Handle<AccessorInfo> foreign = TestAccessorInfo(isolate, attrs);
156
  Map::EnsureDescriptorSlack(map, 1);
157

158 159
  Descriptor d = Descriptor::AccessorConstant(
      Handle<Name>(Name::cast(foreign->name())), foreign, attrs);
160
  map->AppendDescriptor(&d);
161

162
  // Add the Foo constructor the global object.
163 164 165 166 167 168
  CHECK(env->Global()
            ->Set(env, v8::String::NewFromUtf8(CcTest::isolate(), "Foo",
                                               v8::NewStringType::kNormal)
                           .ToLocalChecked(),
                  v8::Utils::CallableToLocal(function))
            .FromJust());
169
  // Call the accessor through JavaScript.
170 171 172 173 174 175 176 177 178
  v8::Local<v8::Value> result =
      v8::Script::Compile(
          env, v8::String::NewFromUtf8(CcTest::isolate(), "(new Foo).get",
                                       v8::NewStringType::kNormal)
                   .ToLocalChecked())
          .ToLocalChecked()
          ->Run(env)
          .ToLocalChecked();
  CHECK_EQ(true, result->BooleanValue(env).FromJust());
179 180
  env->Exit();
}
181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197


// CodeRange test.
// Tests memory management in a CodeRange by allocating and freeing blocks,
// using a pseudorandom generator to choose block sizes geometrically
// distributed between 2 * Page::kPageSize and 2^5 + 1 * Page::kPageSize.
// Ensure that the freed chunks are collected and reused by allocating (in
// total) more than the size of the CodeRange.

// This pseudorandom generator does not need to be particularly good.
// Use the lower half of the V8::Random() generator.
unsigned int Pseudorandom() {
  static uint32_t lo = 2345;
  lo = 18273 * (lo & 0xFFFF) + (lo >> 16);  // Provably not 0.
  return lo & 0xFFFF;
}

198
namespace {
199 200 201 202

// Plain old data class.  Represents a block of allocated memory.
class Block {
 public:
203
  Block(Address base_arg, int size_arg)
204 205
      : base(base_arg), size(size_arg) {}

206
  Address base;
207 208 209
  int size;
};

210
}  // namespace
211 212

TEST(CodeRange) {
213
  const size_t code_range_size = 32*MB;
214 215
  CcTest::InitializeVM();
  CodeRange code_range(reinterpret_cast<Isolate*>(CcTest::isolate()));
216
  code_range.SetUp(code_range_size);
217 218
  size_t current_allocated = 0;
  size_t total_allocated = 0;
219 220
  std::vector<Block> blocks;
  blocks.reserve(1000);
221 222 223 224

  while (total_allocated < 5 * code_range_size) {
    if (current_allocated < code_range_size / 10) {
      // Allocate a block.
225
      // Geometrically distributed sizes, greater than
226
      // kMaxRegularHeapObjectSize (which is greater than code page area).
227
      // TODO(gc): instead of using 3 use some contant based on code_range_size
228
      // kMaxRegularHeapObjectSize.
229 230
      size_t requested = (kMaxRegularHeapObjectSize << (Pseudorandom() % 3)) +
                         Pseudorandom() % 5000 + 1;
231
      size_t allocated = 0;
232 233 234 235 236 237

      // The request size has to be at least 2 code guard pages larger than the
      // actual commit size.
      Address base = code_range.AllocateRawMemory(
          requested, requested - (2 * MemoryAllocator::CodePageGuardSize()),
          &allocated);
238
      CHECK_NOT_NULL(base);
239
      blocks.emplace_back(base, static_cast<int>(allocated));
240 241
      current_allocated += static_cast<int>(allocated);
      total_allocated += static_cast<int>(allocated);
242 243
    } else {
      // Free a block.
244
      size_t index = Pseudorandom() % blocks.size();
245
      code_range.FreeRawMemory(blocks[index].base, blocks[index].size);
246
      current_allocated -= blocks[index].size;
247 248
      if (index < blocks.size() - 1) {
        blocks[index] = blocks.back();
249
      }
250
      blocks.pop_back();
251 252 253
    }
  }
}
254 255 256 257

}  // namespace heap
}  // namespace internal
}  // namespace v8