Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 // Copyright 2006-2010 the V8 project authors. All rights reserved. | 1 // Copyright 2011 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
| 3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
| 4 // met: | 4 // met: |
| 5 // | 5 // |
| 6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
| 7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
| 8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
| 9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
| 10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
| 11 // with the distribution. | 11 // with the distribution. |
| (...skipping 10 matching lines...) Expand all Loading... | |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 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. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 | 27 |
| 28 #ifndef V8_HEAP_INL_H_ | 28 #ifndef V8_HEAP_INL_H_ |
| 29 #define V8_HEAP_INL_H_ | 29 #define V8_HEAP_INL_H_ |
| 30 | 30 |
| 31 #include "heap.h" | 31 #include "heap.h" |
| 32 #include "isolate.h" | |
| 33 #include "list-inl.h" | |
|
Kevin Millikin (Chromium)
2011/05/02 16:37:00
Needed here, was getting it through spaces.h (indi
| |
| 32 #include "objects.h" | 34 #include "objects.h" |
| 33 #include "isolate.h" | |
| 34 #include "v8-counters.h" | 35 #include "v8-counters.h" |
| 35 | 36 |
| 36 namespace v8 { | 37 namespace v8 { |
| 37 namespace internal { | 38 namespace internal { |
| 38 | 39 |
| 39 void PromotionQueue::insert(HeapObject* target, int size) { | 40 void PromotionQueue::insert(HeapObject* target, int size) { |
| 40 *(--rear_) = reinterpret_cast<intptr_t>(target); | 41 *(--rear_) = reinterpret_cast<intptr_t>(target); |
| 41 *(--rear_) = size; | 42 *(--rear_) = size; |
| 42 // Assert no overflow into live objects. | 43 // Assert no overflow into live objects. |
| 43 ASSERT(reinterpret_cast<Address>(rear_) >= HEAP->new_space()->top()); | 44 ASSERT(reinterpret_cast<Address>(rear_) >= HEAP->new_space()->top()); |
| (...skipping 650 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 694 #ifdef DEBUG | 695 #ifdef DEBUG |
| 695 UpdateLiveObjectCount(obj); | 696 UpdateLiveObjectCount(obj); |
| 696 #endif | 697 #endif |
| 697 obj->SetMark(); | 698 obj->SetMark(); |
| 698 } | 699 } |
| 699 | 700 |
| 700 | 701 |
| 701 } } // namespace v8::internal | 702 } } // namespace v8::internal |
| 702 | 703 |
| 703 #endif // V8_HEAP_INL_H_ | 704 #endif // V8_HEAP_INL_H_ |
| OLD | NEW |