| OLD | NEW |
|---|
| (Empty) |
| 1 // Copyright 2013 the V8 project authors. All rights reserved. | |
| 2 // Redistribution and use in source and binary forms, with or without | |
| 3 // modification, are permitted provided that the following conditions are | |
| 4 // met: | |
| 5 // | |
| 6 // * Redistributions of source code must retain the above copyright | |
| 7 // notice, this list of conditions and the following disclaimer. | |
| 8 // * Redistributions in binary form must reproduce the above | |
| 9 // copyright notice, this list of conditions and the following | |
| 10 // disclaimer in the documentation and/or other materials provided | |
| 11 // with the distribution. | |
| 12 // * Neither the name of Google Inc. nor the names of its | |
| 13 // contributors may be used to endorse or promote products derived | |
| 14 // from this software without specific prior written permission. | |
| 15 // | |
| 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
| 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
| 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
| 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
| 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
| 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | |
| 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
| 27 | |
| 28 // Test constant pool array code. | |
| 29 | |
| 30 #include "src/v8.h" | |
| 31 | |
| 32 #include "src/factory.h" | |
| 33 #include "src/objects.h" | |
| 34 #include "test/cctest/cctest.h" | |
| 35 | |
| 36 using namespace v8::internal; | |
| 37 | |
| 38 static ConstantPoolArray::Type kTypes[] = { ConstantPoolArray::INT64, | |
| 39 ConstantPoolArray::CODE_PTR, | |
| 40 ConstantPoolArray::HEAP_PTR, | |
| 41 ConstantPoolArray::INT32 }; | |
| 42 static ConstantPoolArray::LayoutSection kSmall = | |
| 43 ConstantPoolArray::SMALL_SECTION; | |
| 44 static ConstantPoolArray::LayoutSection kExtended = | |
| 45 ConstantPoolArray::EXTENDED_SECTION; | |
| 46 | |
| 47 Code* DummyCode(LocalContext* context) { | |
| 48 CompileRun("function foo() {};"); | |
| 49 i::Handle<i::JSFunction> fun = v8::Utils::OpenHandle( | |
| 50 *v8::Local<v8::Function>::Cast( | |
| 51 (*context)->Global()->Get(v8_str("foo")))); | |
| 52 return fun->code(); | |
| 53 } | |
| 54 | |
| 55 | |
| 56 TEST(ConstantPoolSmall) { | |
| 57 LocalContext context; | |
| 58 Isolate* isolate = CcTest::i_isolate(); | |
| 59 Factory* factory = isolate->factory(); | |
| 60 v8::HandleScope scope(context->GetIsolate()); | |
| 61 | |
| 62 // Check construction. | |
| 63 ConstantPoolArray::NumberOfEntries small(3, 1, 2, 1); | |
| 64 Handle<ConstantPoolArray> array = factory->NewConstantPoolArray(small); | |
| 65 | |
| 66 int expected_counts[] = { 3, 1, 2, 1 }; | |
| 67 int expected_first_idx[] = { 0, 3, 4, 6 }; | |
| 68 int expected_last_idx[] = { 2, 3, 5, 6 }; | |
| 69 for (int i = 0; i < 4; i++) { | |
| 70 CHECK_EQ(expected_counts[i], array->number_of_entries(kTypes[i], kSmall)); | |
| 71 CHECK_EQ(expected_first_idx[i], array->first_index(kTypes[i], kSmall)); | |
| 72 CHECK_EQ(expected_last_idx[i], array->last_index(kTypes[i], kSmall)); | |
| 73 } | |
| 74 CHECK(!array->is_extended_layout()); | |
| 75 | |
| 76 // Check getters and setters. | |
| 77 int64_t big_number = V8_2PART_UINT64_C(0x12345678, 9ABCDEF0); | |
| 78 Handle<Object> object = factory->NewHeapNumber(4.0, IMMUTABLE, TENURED); | |
| 79 Code* code = DummyCode(&context); | |
| 80 array->set(0, big_number); | |
| 81 array->set(1, 0.5); | |
| 82 array->set(2, 3e-24); | |
| 83 array->set(3, code->entry()); | |
| 84 array->set(4, code); | |
| 85 array->set(5, *object); | |
| 86 array->set(6, 50); | |
| 87 CHECK_EQ(big_number, array->get_int64_entry(0)); | |
| 88 CHECK_EQ(0.5, array->get_int64_entry_as_double(1)); | |
| 89 CHECK_EQ(3e-24, array->get_int64_entry_as_double(2)); | |
| 90 CHECK_EQ(code->entry(), array->get_code_ptr_entry(3)); | |
| 91 CHECK_EQ(code, array->get_heap_ptr_entry(4)); | |
| 92 CHECK_EQ(*object, array->get_heap_ptr_entry(5)); | |
| 93 CHECK_EQ(50, array->get_int32_entry(6)); | |
| 94 } | |
| 95 | |
| 96 | |
| 97 TEST(ConstantPoolExtended) { | |
| 98 LocalContext context; | |
| 99 Isolate* isolate = CcTest::i_isolate(); | |
| 100 Factory* factory = isolate->factory(); | |
| 101 v8::HandleScope scope(context->GetIsolate()); | |
| 102 | |
| 103 // Check construction. | |
| 104 ConstantPoolArray::NumberOfEntries small(1, 2, 3, 4); | |
| 105 ConstantPoolArray::NumberOfEntries extended(5, 6, 7, 8); | |
| 106 Handle<ConstantPoolArray> array = | |
| 107 factory->NewExtendedConstantPoolArray(small, extended); | |
| 108 | |
| 109 // Check small section. | |
| 110 int small_counts[] = { 1, 2, 3, 4 }; | |
| 111 int small_first_idx[] = { 0, 1, 3, 6 }; | |
| 112 int small_last_idx[] = { 0, 2, 5, 9 }; | |
| 113 for (int i = 0; i < 4; i++) { | |
| 114 CHECK_EQ(small_counts[i], array->number_of_entries(kTypes[i], kSmall)); | |
| 115 CHECK_EQ(small_first_idx[i], array->first_index(kTypes[i], kSmall)); | |
| 116 CHECK_EQ(small_last_idx[i], array->last_index(kTypes[i], kSmall)); | |
| 117 } | |
| 118 | |
| 119 // Check extended layout. | |
| 120 CHECK(array->is_extended_layout()); | |
| 121 int extended_counts[] = { 5, 6, 7, 8 }; | |
| 122 int extended_first_idx[] = { 10, 15, 21, 28 }; | |
| 123 int extended_last_idx[] = { 14, 20, 27, 35 }; | |
| 124 for (int i = 0; i < 4; i++) { | |
| 125 CHECK_EQ(extended_counts[i], | |
| 126 array->number_of_entries(kTypes[i], kExtended)); | |
| 127 CHECK_EQ(extended_first_idx[i], array->first_index(kTypes[i], kExtended)); | |
| 128 CHECK_EQ(extended_last_idx[i], array->last_index(kTypes[i], kExtended)); | |
| 129 } | |
| 130 | |
| 131 // Check small and large section's don't overlap. | |
| 132 int64_t small_section_int64 = V8_2PART_UINT64_C(0x56781234, DEF09ABC); | |
| 133 Code* small_section_code_ptr = DummyCode(&context); | |
| 134 Handle<Object> small_section_heap_ptr = | |
| 135 factory->NewHeapNumber(4.0, IMMUTABLE, TENURED); | |
| 136 int32_t small_section_int32 = 0xab12cd45; | |
| 137 | |
| 138 int64_t extended_section_int64 = V8_2PART_UINT64_C(0x12345678, 9ABCDEF0); | |
| 139 Code* extended_section_code_ptr = DummyCode(&context); | |
| 140 Handle<Object> extended_section_heap_ptr = | |
| 141 factory->NewHeapNumber(5.0, IMMUTABLE, TENURED); | |
| 142 int32_t extended_section_int32 = 0xef67ab89; | |
| 143 | |
| 144 for (int i = array->first_index(ConstantPoolArray::INT64, kSmall); | |
| 145 i <= array->last_index(ConstantPoolArray::INT32, kSmall); i++) { | |
| 146 if (i <= array->last_index(ConstantPoolArray::INT64, kSmall)) { | |
| 147 array->set(i, small_section_int64); | |
| 148 } else if (i <= array->last_index(ConstantPoolArray::CODE_PTR, kSmall)) { | |
| 149 array->set(i, small_section_code_ptr->entry()); | |
| 150 } else if (i <= array->last_index(ConstantPoolArray::HEAP_PTR, kSmall)) { | |
| 151 array->set(i, *small_section_heap_ptr); | |
| 152 } else { | |
| 153 CHECK(i <= array->last_index(ConstantPoolArray::INT32, kSmall)); | |
| 154 array->set(i, small_section_int32); | |
| 155 } | |
| 156 } | |
| 157 for (int i = array->first_index(ConstantPoolArray::INT64, kExtended); | |
| 158 i <= array->last_index(ConstantPoolArray::INT32, kExtended); i++) { | |
| 159 if (i <= array->last_index(ConstantPoolArray::INT64, kExtended)) { | |
| 160 array->set(i, extended_section_int64); | |
| 161 } else if (i <= array->last_index(ConstantPoolArray::CODE_PTR, kExtended)) { | |
| 162 array->set(i, extended_section_code_ptr->entry()); | |
| 163 } else if (i <= array->last_index(ConstantPoolArray::HEAP_PTR, kExtended)) { | |
| 164 array->set(i, *extended_section_heap_ptr); | |
| 165 } else { | |
| 166 CHECK(i <= array->last_index(ConstantPoolArray::INT32, kExtended)); | |
| 167 array->set(i, extended_section_int32); | |
| 168 } | |
| 169 } | |
| 170 | |
| 171 for (int i = array->first_index(ConstantPoolArray::INT64, kSmall); | |
| 172 i <= array->last_index(ConstantPoolArray::INT32, kSmall); i++) { | |
| 173 if (i <= array->last_index(ConstantPoolArray::INT64, kSmall)) { | |
| 174 CHECK_EQ(small_section_int64, array->get_int64_entry(i)); | |
| 175 } else if (i <= array->last_index(ConstantPoolArray::CODE_PTR, kSmall)) { | |
| 176 CHECK_EQ(small_section_code_ptr->entry(), array->get_code_ptr_entry(i)); | |
| 177 } else if (i <= array->last_index(ConstantPoolArray::HEAP_PTR, kSmall)) { | |
| 178 CHECK_EQ(*small_section_heap_ptr, array->get_heap_ptr_entry(i)); | |
| 179 } else { | |
| 180 CHECK(i <= array->last_index(ConstantPoolArray::INT32, kSmall)); | |
| 181 CHECK_EQ(small_section_int32, array->get_int32_entry(i)); | |
| 182 } | |
| 183 } | |
| 184 for (int i = array->first_index(ConstantPoolArray::INT64, kExtended); | |
| 185 i <= array->last_index(ConstantPoolArray::INT32, kExtended); i++) { | |
| 186 if (i <= array->last_index(ConstantPoolArray::INT64, kExtended)) { | |
| 187 CHECK_EQ(extended_section_int64, array->get_int64_entry(i)); | |
| 188 } else if (i <= array->last_index(ConstantPoolArray::CODE_PTR, kExtended)) { | |
| 189 CHECK_EQ(extended_section_code_ptr->entry(), | |
| 190 array->get_code_ptr_entry(i)); | |
| 191 } else if (i <= array->last_index(ConstantPoolArray::HEAP_PTR, kExtended)) { | |
| 192 CHECK_EQ(*extended_section_heap_ptr, array->get_heap_ptr_entry(i)); | |
| 193 } else { | |
| 194 CHECK(i <= array->last_index(ConstantPoolArray::INT32, kExtended)); | |
| 195 CHECK_EQ(extended_section_int32, array->get_int32_entry(i)); | |
| 196 } | |
| 197 } | |
| 198 } | |
| 199 | |
| 200 | |
| 201 static void CheckIterator(Handle<ConstantPoolArray> array, | |
| 202 ConstantPoolArray::Type type, | |
| 203 int expected_indexes[], | |
| 204 int count) { | |
| 205 int i = 0; | |
| 206 ConstantPoolArray::Iterator iter(*array, type); | |
| 207 while (!iter.is_finished()) { | |
| 208 CHECK_EQ(expected_indexes[i++], iter.next_index()); | |
| 209 } | |
| 210 CHECK_EQ(count, i); | |
| 211 } | |
| 212 | |
| 213 | |
| 214 TEST(ConstantPoolIteratorSmall) { | |
| 215 LocalContext context; | |
| 216 Isolate* isolate = CcTest::i_isolate(); | |
| 217 Factory* factory = isolate->factory(); | |
| 218 v8::HandleScope scope(context->GetIsolate()); | |
| 219 | |
| 220 ConstantPoolArray::NumberOfEntries small(1, 5, 2, 0); | |
| 221 Handle<ConstantPoolArray> array = factory->NewConstantPoolArray(small); | |
| 222 | |
| 223 int expected_int64_indexs[] = { 0 }; | |
| 224 CheckIterator(array, ConstantPoolArray::INT64, expected_int64_indexs, 1); | |
| 225 int expected_code_indexs[] = { 1, 2, 3, 4, 5 }; | |
| 226 CheckIterator(array, ConstantPoolArray::CODE_PTR, expected_code_indexs, 5); | |
| 227 int expected_heap_indexs[] = { 6, 7 }; | |
| 228 CheckIterator(array, ConstantPoolArray::HEAP_PTR, expected_heap_indexs, 2); | |
| 229 int expected_int32_indexs[1]; | |
| 230 CheckIterator(array, ConstantPoolArray::INT32, expected_int32_indexs, 0); | |
| 231 } | |
| 232 | |
| 233 | |
| 234 TEST(ConstantPoolIteratorExtended) { | |
| 235 LocalContext context; | |
| 236 Isolate* isolate = CcTest::i_isolate(); | |
| 237 Factory* factory = isolate->factory(); | |
| 238 v8::HandleScope scope(context->GetIsolate()); | |
| 239 | |
| 240 ConstantPoolArray::NumberOfEntries small(1, 0, 0, 4); | |
| 241 ConstantPoolArray::NumberOfEntries extended(5, 0, 3, 0); | |
| 242 Handle<ConstantPoolArray> array = | |
| 243 factory->NewExtendedConstantPoolArray(small, extended); | |
| 244 | |
| 245 int expected_int64_indexs[] = { 0, 5, 6, 7, 8, 9 }; | |
| 246 CheckIterator(array, ConstantPoolArray::INT64, expected_int64_indexs, 6); | |
| 247 int expected_code_indexs[1]; | |
| 248 CheckIterator(array, ConstantPoolArray::CODE_PTR, expected_code_indexs, 0); | |
| 249 int expected_heap_indexs[] = { 10, 11, 12 }; | |
| 250 CheckIterator(array, ConstantPoolArray::HEAP_PTR, expected_heap_indexs, 3); | |
| 251 int expected_int32_indexs[] = { 1, 2, 3, 4 }; | |
| 252 CheckIterator(array, ConstantPoolArray::INT32, expected_int32_indexs, 4); | |
| 253 } | |
| 254 | |
| 255 | |
| 256 TEST(ConstantPoolPreciseGC) { | |
| 257 LocalContext context; | |
| 258 Isolate* isolate = CcTest::i_isolate(); | |
| 259 Heap* heap = isolate->heap(); | |
| 260 Factory* factory = isolate->factory(); | |
| 261 v8::HandleScope scope(context->GetIsolate()); | |
| 262 | |
| 263 ConstantPoolArray::NumberOfEntries small(1, 0, 0, 1); | |
| 264 Handle<ConstantPoolArray> array = factory->NewConstantPoolArray(small); | |
| 265 | |
| 266 // Check that the store buffer knows which entries are pointers and which are | |
| 267 // not. To do this, make non-pointer entries which look like new space | |
| 268 // pointers but are actually invalid and ensure the GC doesn't try to move | |
| 269 // them. | |
| 270 Handle<HeapObject> object = factory->NewHeapNumber(4.0); | |
| 271 Object* raw_ptr = *object; | |
| 272 // If interpreted as a pointer, this should be right inside the heap number | |
| 273 // which will cause a crash when trying to lookup the 'map' pointer. | |
| 274 intptr_t invalid_ptr = reinterpret_cast<intptr_t>(raw_ptr) + kInt32Size; | |
| 275 int32_t invalid_ptr_int32 = static_cast<int32_t>(invalid_ptr); | |
| 276 int64_t invalid_ptr_int64 = static_cast<int64_t>(invalid_ptr); | |
| 277 array->set(0, invalid_ptr_int64); | |
| 278 array->set(1, invalid_ptr_int32); | |
| 279 | |
| 280 // Ensure we perform a scan on scavenge for the constant pool's page. | |
| 281 MemoryChunk::FromAddress(array->address())->set_scan_on_scavenge(true); | |
| 282 heap->CollectGarbage(NEW_SPACE); | |
| 283 | |
| 284 // Check the object was moved by GC. | |
| 285 CHECK_NE(*object, raw_ptr); | |
| 286 | |
| 287 // Check the non-pointer entries weren't changed. | |
| 288 CHECK_EQ(invalid_ptr_int64, array->get_int64_entry(0)); | |
| 289 CHECK_EQ(invalid_ptr_int32, array->get_int32_entry(1)); | |
| 290 } | |
| 291 | |
| 292 | |
| 293 TEST(ConstantPoolCompacting) { | |
| 294 if (i::FLAG_never_compact) return; | |
| 295 i::FLAG_always_compact = true; | |
| 296 LocalContext context; | |
| 297 Isolate* isolate = CcTest::i_isolate(); | |
| 298 Heap* heap = isolate->heap(); | |
| 299 Factory* factory = isolate->factory(); | |
| 300 v8::HandleScope scope(context->GetIsolate()); | |
| 301 | |
| 302 ConstantPoolArray::NumberOfEntries small(0, 0, 1, 0); | |
| 303 ConstantPoolArray::NumberOfEntries extended(0, 0, 1, 0); | |
| 304 Handle<ConstantPoolArray> array = | |
| 305 factory->NewExtendedConstantPoolArray(small, extended); | |
| 306 | |
| 307 // Start a second old-space page so that the heap pointer added to the | |
| 308 // constant pool array ends up on the an evacuation candidate page. | |
| 309 Page* first_page = heap->old_space()->anchor()->next_page(); | |
| 310 { | |
| 311 HandleScope scope(isolate); | |
| 312 int dummy_array_size = Page::kMaxRegularHeapObjectSize - 92 * KB; | |
| 313 Handle<HeapObject> temp = | |
| 314 factory->NewFixedDoubleArray(dummy_array_size / kDoubleSize, TENURED); | |
| 315 CHECK(heap->InOldSpace(temp->address())); | |
| 316 Handle<HeapObject> heap_ptr = | |
| 317 factory->NewHeapNumber(5.0, IMMUTABLE, TENURED); | |
| 318 CHECK(heap->InOldSpace(heap_ptr->address())); | |
| 319 CHECK(!first_page->Contains(heap_ptr->address())); | |
| 320 array->set(0, *heap_ptr); | |
| 321 array->set(1, *heap_ptr); | |
| 322 } | |
| 323 | |
| 324 // Check heap pointers are correctly updated on GC. | |
| 325 Object* old_ptr = array->get_heap_ptr_entry(0); | |
| 326 Handle<Object> object(old_ptr, isolate); | |
| 327 CHECK_EQ(old_ptr, *object); | |
| 328 CHECK_EQ(old_ptr, array->get_heap_ptr_entry(1)); | |
| 329 | |
| 330 // Force compacting garbage collection. | |
| 331 CHECK(FLAG_always_compact); | |
| 332 heap->CollectAllGarbage(); | |
| 333 | |
| 334 CHECK_NE(old_ptr, *object); | |
| 335 CHECK_EQ(*object, array->get_heap_ptr_entry(0)); | |
| 336 CHECK_EQ(*object, array->get_heap_ptr_entry(1)); | |
| 337 } | |
| OLD | NEW |
|---|
Chromium Code Reviews
Issue 1131783003:
Embedded constant pools. (Closed)
Base URL: https://chromium.googlesource.com/v8/v8.git@master