OLD | NEW |
1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 the V8 project authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #include "src/v8.h" | 5 #include "src/v8.h" |
6 | 6 |
7 #include "src/accessors.h" | 7 #include "src/accessors.h" |
8 #include "src/api.h" | 8 #include "src/api.h" |
9 #include "src/base/bits.h" | 9 #include "src/base/bits.h" |
10 #include "src/base/once.h" | 10 #include "src/base/once.h" |
(...skipping 4533 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
4544 case LO_SPACE: | 4544 case LO_SPACE: |
4545 return lo_space_->SlowContains(addr); | 4545 return lo_space_->SlowContains(addr); |
4546 case INVALID_SPACE: | 4546 case INVALID_SPACE: |
4547 break; | 4547 break; |
4548 } | 4548 } |
4549 UNREACHABLE(); | 4549 UNREACHABLE(); |
4550 return false; | 4550 return false; |
4551 } | 4551 } |
4552 | 4552 |
4553 | 4553 |
| 4554 bool Heap::RootIsImmortalImmovable(int root_index) { |
| 4555 switch (root_index) { |
| 4556 #define CASE(name) \ |
| 4557 case Heap::k##name##RootIndex: \ |
| 4558 return true; |
| 4559 IMMORTAL_IMMOVABLE_ROOT_LIST(CASE); |
| 4560 #undef CASE |
| 4561 default: |
| 4562 return false; |
| 4563 } |
| 4564 } |
| 4565 |
| 4566 |
4554 #ifdef VERIFY_HEAP | 4567 #ifdef VERIFY_HEAP |
4555 void Heap::Verify() { | 4568 void Heap::Verify() { |
4556 CHECK(HasBeenSetUp()); | 4569 CHECK(HasBeenSetUp()); |
4557 HandleScope scope(isolate()); | 4570 HandleScope scope(isolate()); |
4558 | 4571 |
4559 store_buffer()->Verify(); | 4572 store_buffer()->Verify(); |
4560 | 4573 |
4561 if (mark_compact_collector()->sweeping_in_progress()) { | 4574 if (mark_compact_collector()->sweeping_in_progress()) { |
4562 // We have to wait here for the sweeper threads to have an iterable heap. | 4575 // We have to wait here for the sweeper threads to have an iterable heap. |
4563 mark_compact_collector()->EnsureSweepingCompleted(); | 4576 mark_compact_collector()->EnsureSweepingCompleted(); |
(...skipping 1675 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
6239 static_cast<int>(object_sizes_last_time_[index])); | 6252 static_cast<int>(object_sizes_last_time_[index])); |
6240 CODE_AGE_LIST_COMPLETE(ADJUST_LAST_TIME_OBJECT_COUNT) | 6253 CODE_AGE_LIST_COMPLETE(ADJUST_LAST_TIME_OBJECT_COUNT) |
6241 #undef ADJUST_LAST_TIME_OBJECT_COUNT | 6254 #undef ADJUST_LAST_TIME_OBJECT_COUNT |
6242 | 6255 |
6243 MemCopy(object_counts_last_time_, object_counts_, sizeof(object_counts_)); | 6256 MemCopy(object_counts_last_time_, object_counts_, sizeof(object_counts_)); |
6244 MemCopy(object_sizes_last_time_, object_sizes_, sizeof(object_sizes_)); | 6257 MemCopy(object_sizes_last_time_, object_sizes_, sizeof(object_sizes_)); |
6245 ClearObjectStats(); | 6258 ClearObjectStats(); |
6246 } | 6259 } |
6247 } | 6260 } |
6248 } // namespace v8::internal | 6261 } // namespace v8::internal |
OLD | NEW |