| OLD | NEW |
| 1 // Copyright 2006-2010 the V8 project authors. All rights reserved. | 1 // Copyright 2006-2010 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. |
| 12 // * Neither the name of Google Inc. nor the names of its | 12 // * Neither the name of Google Inc. nor the names of its |
| 13 // contributors may be used to endorse or promote products derived | 13 // contributors may be used to endorse or promote products derived |
| 14 // from this software without specific prior written permission. | 14 // from this software without specific prior written permission. |
| 15 // | 15 // |
| 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 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 #include "v8.h" | 28 #include "v8.h" |
| 29 | 29 |
| 30 #include "liveobjectlist-inl.h" |
| 30 #include "macro-assembler.h" | 31 #include "macro-assembler.h" |
| 31 #include "mark-compact.h" | 32 #include "mark-compact.h" |
| 32 #include "platform.h" | 33 #include "platform.h" |
| 33 | 34 |
| 34 namespace v8 { | 35 namespace v8 { |
| 35 namespace internal { | 36 namespace internal { |
| 36 | 37 |
| 37 // For contiguous spaces, top should be in the space (or at the end) and limit | 38 // For contiguous spaces, top should be in the space (or at the end) and limit |
| 38 // should be the end of the space. | 39 // should be the end of the space. |
| 39 #define ASSERT_SEMISPACE_ALLOCATION_INFO(info, space) \ | 40 #define ASSERT_SEMISPACE_ALLOCATION_INFO(info, space) \ |
| (...skipping 2952 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2992 // Cut the chunk out from the chunk list. | 2993 // Cut the chunk out from the chunk list. |
| 2993 current = current->next(); | 2994 current = current->next(); |
| 2994 if (previous == NULL) { | 2995 if (previous == NULL) { |
| 2995 first_chunk_ = current; | 2996 first_chunk_ = current; |
| 2996 } else { | 2997 } else { |
| 2997 previous->set_next(current); | 2998 previous->set_next(current); |
| 2998 } | 2999 } |
| 2999 | 3000 |
| 3000 // Free the chunk. | 3001 // Free the chunk. |
| 3001 heap()->mark_compact_collector()->ReportDeleteIfNeeded(object); | 3002 heap()->mark_compact_collector()->ReportDeleteIfNeeded(object); |
| 3003 LiveObjectList::ProcessNonLive(object); |
| 3004 |
| 3002 size_ -= static_cast<int>(chunk_size); | 3005 size_ -= static_cast<int>(chunk_size); |
| 3003 objects_size_ -= object->Size(); | 3006 objects_size_ -= object->Size(); |
| 3004 page_count_--; | 3007 page_count_--; |
| 3005 ObjectSpace space = kObjectSpaceLoSpace; | 3008 ObjectSpace space = kObjectSpaceLoSpace; |
| 3006 if (executable == EXECUTABLE) space = kObjectSpaceCodeSpace; | 3009 if (executable == EXECUTABLE) space = kObjectSpaceCodeSpace; |
| 3007 heap()->isolate()->memory_allocator()->FreeRawMemory(chunk_address, | 3010 heap()->isolate()->memory_allocator()->FreeRawMemory(chunk_address, |
| 3008 chunk_size, | 3011 chunk_size, |
| 3009 executable); | 3012 executable); |
| 3010 heap()->isolate()->memory_allocator()->PerformAllocationCallback( | 3013 heap()->isolate()->memory_allocator()->PerformAllocationCallback( |
| 3011 space, kAllocationActionFree, size_); | 3014 space, kAllocationActionFree, size_); |
| (...skipping 107 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 3119 for (HeapObject* obj = obj_it.next(); obj != NULL; obj = obj_it.next()) { | 3122 for (HeapObject* obj = obj_it.next(); obj != NULL; obj = obj_it.next()) { |
| 3120 if (obj->IsCode()) { | 3123 if (obj->IsCode()) { |
| 3121 Code* code = Code::cast(obj); | 3124 Code* code = Code::cast(obj); |
| 3122 isolate->code_kind_statistics()[code->kind()] += code->Size(); | 3125 isolate->code_kind_statistics()[code->kind()] += code->Size(); |
| 3123 } | 3126 } |
| 3124 } | 3127 } |
| 3125 } | 3128 } |
| 3126 #endif // DEBUG | 3129 #endif // DEBUG |
| 3127 | 3130 |
| 3128 } } // namespace v8::internal | 3131 } } // namespace v8::internal |
| OLD | NEW |