| 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 3409 matching lines...) Expand 10 before | Expand all | Expand 10 after  Loading... | 
|  3420  |  3420  | 
|  3421   slots_buffer_allocator_.DeallocateChain(&migration_slots_buffer_); |  3421   slots_buffer_allocator_.DeallocateChain(&migration_slots_buffer_); | 
|  3422   ASSERT(migration_slots_buffer_ == NULL); |  3422   ASSERT(migration_slots_buffer_ == NULL); | 
|  3423   for (int i = 0; i < npages; i++) { |  3423   for (int i = 0; i < npages; i++) { | 
|  3424     Page* p = evacuation_candidates_[i]; |  3424     Page* p = evacuation_candidates_[i]; | 
|  3425     if (!p->IsEvacuationCandidate()) continue; |  3425     if (!p->IsEvacuationCandidate()) continue; | 
|  3426     PagedSpace* space = static_cast<PagedSpace*>(p->owner()); |  3426     PagedSpace* space = static_cast<PagedSpace*>(p->owner()); | 
|  3427     space->Free(p->area_start(), p->area_size()); |  3427     space->Free(p->area_start(), p->area_size()); | 
|  3428     p->set_scan_on_scavenge(false); |  3428     p->set_scan_on_scavenge(false); | 
|  3429     slots_buffer_allocator_.DeallocateChain(p->slots_buffer_address()); |  3429     slots_buffer_allocator_.DeallocateChain(p->slots_buffer_address()); | 
|  3430     p->ClearEvacuationCandidate(); |  | 
|  3431     p->ResetLiveBytes(); |  3430     p->ResetLiveBytes(); | 
|  3432     space->ReleasePage(p); |  3431     space->ReleasePage(p); | 
|  3433   } |  3432   } | 
|  3434   evacuation_candidates_.Rewind(0); |  3433   evacuation_candidates_.Rewind(0); | 
|  3435   compacting_ = false; |  3434   compacting_ = false; | 
|  3436 } |  3435 } | 
|  3437  |  3436  | 
|  3438  |  3437  | 
|  3439 static const int kStartTableEntriesPerLine = 5; |  3438 static const int kStartTableEntriesPerLine = 5; | 
|  3440 static const int kStartTableLines = 171; |  3439 static const int kStartTableLines = 171; | 
| (...skipping 690 matching lines...) Expand 10 before | Expand all | Expand 10 after  Loading... | 
|  4131   while (buffer != NULL) { |  4130   while (buffer != NULL) { | 
|  4132     SlotsBuffer* next_buffer = buffer->next(); |  4131     SlotsBuffer* next_buffer = buffer->next(); | 
|  4133     DeallocateBuffer(buffer); |  4132     DeallocateBuffer(buffer); | 
|  4134     buffer = next_buffer; |  4133     buffer = next_buffer; | 
|  4135   } |  4134   } | 
|  4136   *buffer_address = NULL; |  4135   *buffer_address = NULL; | 
|  4137 } |  4136 } | 
|  4138  |  4137  | 
|  4139  |  4138  | 
|  4140 } }  // namespace v8::internal |  4139 } }  // namespace v8::internal | 
| OLD | NEW |