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 #ifndef V8_HEAP_HEAP_INL_H_ | 5 #ifndef V8_HEAP_HEAP_INL_H_ |
6 #define V8_HEAP_HEAP_INL_H_ | 6 #define V8_HEAP_HEAP_INL_H_ |
7 | 7 |
8 #include <cmath> | 8 #include <cmath> |
9 | 9 |
10 #include "src/base/platform/platform.h" | 10 #include "src/base/platform/platform.h" |
11 #include "src/counters-inl.h" | 11 #include "src/counters-inl.h" |
12 #include "src/heap/heap.h" | 12 #include "src/heap/heap.h" |
13 #include "src/heap/incremental-marking-inl.h" | 13 #include "src/heap/incremental-marking-inl.h" |
14 #include "src/heap/mark-compact.h" | 14 #include "src/heap/mark-compact.h" |
15 #include "src/heap/remembered-set.h" | 15 #include "src/heap/remembered-set.h" |
16 #include "src/heap/spaces-inl.h" | 16 #include "src/heap/spaces-inl.h" |
17 #include "src/heap/store-buffer.h" | 17 #include "src/heap/store-buffer.h" |
18 #include "src/isolate.h" | 18 #include "src/isolate.h" |
19 #include "src/list-inl.h" | 19 #include "src/list-inl.h" |
20 #include "src/log.h" | 20 #include "src/log.h" |
21 #include "src/msan.h" | 21 #include "src/msan.h" |
22 #include "src/objects-inl.h" | 22 #include "src/objects-inl.h" |
23 #include "src/type-feedback-vector-inl.h" | 23 #include "src/type-feedback-vector-inl.h" |
24 | 24 |
25 namespace v8 { | 25 namespace v8 { |
26 namespace internal { | 26 namespace internal { |
27 | 27 |
| 28 AllocationSpace AllocationResult::RetrySpace() { |
| 29 DCHECK(IsRetry()); |
| 30 return static_cast<AllocationSpace>(Smi::cast(object_)->value()); |
| 31 } |
| 32 |
| 33 HeapObject* AllocationResult::ToObjectChecked() { |
| 34 CHECK(!IsRetry()); |
| 35 return HeapObject::cast(object_); |
| 36 } |
| 37 |
28 void PromotionQueue::insert(HeapObject* target, int32_t size, | 38 void PromotionQueue::insert(HeapObject* target, int32_t size, |
29 bool was_marked_black) { | 39 bool was_marked_black) { |
30 if (emergency_stack_ != NULL) { | 40 if (emergency_stack_ != NULL) { |
31 emergency_stack_->Add(Entry(target, size, was_marked_black)); | 41 emergency_stack_->Add(Entry(target, size, was_marked_black)); |
32 return; | 42 return; |
33 } | 43 } |
34 | 44 |
35 if ((rear_ - 1) < limit_) { | 45 if ((rear_ - 1) < limit_) { |
36 RelocateQueueHead(); | 46 RelocateQueueHead(); |
37 emergency_stack_->Add(Entry(target, size, was_marked_black)); | 47 emergency_stack_->Add(Entry(target, size, was_marked_black)); |
(...skipping 804 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
842 | 852 |
843 void VerifySmisVisitor::VisitPointers(Object** start, Object** end) { | 853 void VerifySmisVisitor::VisitPointers(Object** start, Object** end) { |
844 for (Object** current = start; current < end; current++) { | 854 for (Object** current = start; current < end; current++) { |
845 CHECK((*current)->IsSmi()); | 855 CHECK((*current)->IsSmi()); |
846 } | 856 } |
847 } | 857 } |
848 } // namespace internal | 858 } // namespace internal |
849 } // namespace v8 | 859 } // namespace v8 |
850 | 860 |
851 #endif // V8_HEAP_HEAP_INL_H_ | 861 #endif // V8_HEAP_HEAP_INL_H_ |
OLD | NEW |