| 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 |
| (...skipping 2088 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2099 Page* top_page = Page::FromAddress(new_top); | 2099 Page* top_page = Page::FromAddress(new_top); |
| 2100 ASSERT(top_page->is_valid()); | 2100 ASSERT(top_page->is_valid()); |
| 2101 | 2101 |
| 2102 SetAllocationInfo(&allocation_info_, top_page); | 2102 SetAllocationInfo(&allocation_info_, top_page); |
| 2103 allocation_info_.top = new_top; | 2103 allocation_info_.top = new_top; |
| 2104 | 2104 |
| 2105 int new_size = live_maps * Map::kSize; | 2105 int new_size = live_maps * Map::kSize; |
| 2106 accounting_stats_.DeallocateBytes(accounting_stats_.Size()); | 2106 accounting_stats_.DeallocateBytes(accounting_stats_.Size()); |
| 2107 accounting_stats_.AllocateBytes(new_size); | 2107 accounting_stats_.AllocateBytes(new_size); |
| 2108 | 2108 |
| 2109 // Flush allocation watermarks. |
| 2110 for (Page* p = first_page_; p != top_page; p = p->next_page()) { |
| 2111 p->SetAllocationWatermark(p->AllocationTop()); |
| 2112 } |
| 2113 top_page->SetAllocationWatermark(new_top); |
| 2114 |
| 2109 #ifdef DEBUG | 2115 #ifdef DEBUG |
| 2110 if (FLAG_enable_slow_asserts) { | 2116 if (FLAG_enable_slow_asserts) { |
| 2111 intptr_t actual_size = 0; | 2117 intptr_t actual_size = 0; |
| 2112 for (Page* p = first_page_; p != top_page; p = p->next_page()) | 2118 for (Page* p = first_page_; p != top_page; p = p->next_page()) |
| 2113 actual_size += kMapsPerPage * Map::kSize; | 2119 actual_size += kMapsPerPage * Map::kSize; |
| 2114 actual_size += (new_top - top_page->ObjectAreaStart()); | 2120 actual_size += (new_top - top_page->ObjectAreaStart()); |
| 2115 ASSERT(accounting_stats_.Size() == actual_size); | 2121 ASSERT(accounting_stats_.Size() == actual_size); |
| 2116 } | 2122 } |
| 2117 #endif | 2123 #endif |
| 2118 | 2124 |
| (...skipping 228 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2347 } | 2353 } |
| 2348 // Must be small, since an iteration is used for lookup. | 2354 // Must be small, since an iteration is used for lookup. |
| 2349 static const int kMaxComments = 64; | 2355 static const int kMaxComments = 64; |
| 2350 }; | 2356 }; |
| 2351 #endif | 2357 #endif |
| 2352 | 2358 |
| 2353 | 2359 |
| 2354 } } // namespace v8::internal | 2360 } } // namespace v8::internal |
| 2355 | 2361 |
| 2356 #endif // V8_SPACES_H_ | 2362 #endif // V8_SPACES_H_ |
| OLD | NEW |