| OLD | NEW |
| 1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 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 |
| (...skipping 153 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 164 if (code_range_size_ > 0) { | 164 if (code_range_size_ > 0) { |
| 165 // Reserve no more than 1/8 of the memory for the code range. | 165 // Reserve no more than 1/8 of the memory for the code range. |
| 166 code_range_size_ = Min(code_range_size_, max_virtual >> 3); | 166 code_range_size_ = Min(code_range_size_, max_virtual >> 3); |
| 167 } | 167 } |
| 168 } | 168 } |
| 169 | 169 |
| 170 memset(roots_, 0, sizeof(roots_[0]) * kRootListLength); | 170 memset(roots_, 0, sizeof(roots_[0]) * kRootListLength); |
| 171 global_contexts_list_ = NULL; | 171 global_contexts_list_ = NULL; |
| 172 mark_compact_collector_.heap_ = this; | 172 mark_compact_collector_.heap_ = this; |
| 173 external_string_table_.heap_ = this; | 173 external_string_table_.heap_ = this; |
| 174 // Put a dummy entry in the remembered pages so we can find the list the |
| 175 // minidump even if there are no real unmapped pages. |
| 176 RememberUnmappedPage(NULL, false); |
| 174 } | 177 } |
| 175 | 178 |
| 176 | 179 |
| 177 intptr_t Heap::Capacity() { | 180 intptr_t Heap::Capacity() { |
| 178 if (!HasBeenSetUp()) return 0; | 181 if (!HasBeenSetUp()) return 0; |
| 179 | 182 |
| 180 return new_space_.Capacity() + | 183 return new_space_.Capacity() + |
| 181 old_pointer_space_->Capacity() + | 184 old_pointer_space_->Capacity() + |
| 182 old_data_space_->Capacity() + | 185 old_data_space_->Capacity() + |
| 183 code_space_->Capacity() + | 186 code_space_->Capacity() + |
| (...skipping 6945 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 7129 } else { | 7132 } else { |
| 7130 p ^= 0x1d1ed & (Page::kPageSize - 1); // I died. | 7133 p ^= 0x1d1ed & (Page::kPageSize - 1); // I died. |
| 7131 } | 7134 } |
| 7132 remembered_unmapped_pages_[remembered_unmapped_pages_index_] = | 7135 remembered_unmapped_pages_[remembered_unmapped_pages_index_] = |
| 7133 reinterpret_cast<Address>(p); | 7136 reinterpret_cast<Address>(p); |
| 7134 remembered_unmapped_pages_index_++; | 7137 remembered_unmapped_pages_index_++; |
| 7135 remembered_unmapped_pages_index_ %= kRememberedUnmappedPages; | 7138 remembered_unmapped_pages_index_ %= kRememberedUnmappedPages; |
| 7136 } | 7139 } |
| 7137 | 7140 |
| 7138 } } // namespace v8::internal | 7141 } } // namespace v8::internal |
| OLD | NEW |