| 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 26 matching lines...) Expand all Loading... |
| 37 | 37 |
| 38 static const int kSweeperThreadStackSize = 64 * KB; | 38 static const int kSweeperThreadStackSize = 64 * KB; |
| 39 | 39 |
| 40 SweeperThread::SweeperThread(Isolate* isolate) | 40 SweeperThread::SweeperThread(Isolate* isolate) |
| 41 : Thread(Thread::Options("v8:SweeperThread", kSweeperThreadStackSize)), | 41 : Thread(Thread::Options("v8:SweeperThread", kSweeperThreadStackSize)), |
| 42 isolate_(isolate), | 42 isolate_(isolate), |
| 43 heap_(isolate->heap()), | 43 heap_(isolate->heap()), |
| 44 collector_(heap_->mark_compact_collector()), | 44 collector_(heap_->mark_compact_collector()), |
| 45 start_sweeping_semaphore_(0), | 45 start_sweeping_semaphore_(0), |
| 46 end_sweeping_semaphore_(0), | 46 end_sweeping_semaphore_(0), |
| 47 stop_semaphore_(0), | 47 stop_semaphore_(0) { |
| 48 free_list_old_data_space_(heap_->paged_space(OLD_DATA_SPACE)), | 48 ASSERT(!FLAG_job_based_sweeping); |
| 49 free_list_old_pointer_space_(heap_->paged_space(OLD_POINTER_SPACE)), | |
| 50 private_free_list_old_data_space_(heap_->paged_space(OLD_DATA_SPACE)), | |
| 51 private_free_list_old_pointer_space_( | |
| 52 heap_->paged_space(OLD_POINTER_SPACE)) { | |
| 53 NoBarrier_Store(&stop_thread_, static_cast<AtomicWord>(false)); | 49 NoBarrier_Store(&stop_thread_, static_cast<AtomicWord>(false)); |
| 54 } | 50 } |
| 55 | 51 |
| 56 | 52 |
| 57 void SweeperThread::Run() { | 53 void SweeperThread::Run() { |
| 58 Isolate::SetIsolateThreadLocals(isolate_, NULL); | 54 Isolate::SetIsolateThreadLocals(isolate_, NULL); |
| 59 DisallowHeapAllocation no_allocation; | 55 DisallowHeapAllocation no_allocation; |
| 60 DisallowHandleAllocation no_handles; | 56 DisallowHandleAllocation no_handles; |
| 61 DisallowHandleDereference no_deref; | 57 DisallowHandleDereference no_deref; |
| 62 | 58 |
| 63 while (true) { | 59 while (true) { |
| 64 start_sweeping_semaphore_.Wait(); | 60 start_sweeping_semaphore_.Wait(); |
| 65 | 61 |
| 66 if (Acquire_Load(&stop_thread_)) { | 62 if (Acquire_Load(&stop_thread_)) { |
| 67 stop_semaphore_.Signal(); | 63 stop_semaphore_.Signal(); |
| 68 return; | 64 return; |
| 69 } | 65 } |
| 70 | 66 |
| 71 collector_->SweepInParallel(heap_->old_data_space(), | 67 collector_->SweepInParallel(heap_->old_data_space()); |
| 72 &private_free_list_old_data_space_, | 68 collector_->SweepInParallel(heap_->old_pointer_space()); |
| 73 &free_list_old_data_space_); | |
| 74 collector_->SweepInParallel(heap_->old_pointer_space(), | |
| 75 &private_free_list_old_pointer_space_, | |
| 76 &free_list_old_pointer_space_); | |
| 77 end_sweeping_semaphore_.Signal(); | 69 end_sweeping_semaphore_.Signal(); |
| 78 } | 70 } |
| 79 } | 71 } |
| 80 | 72 |
| 81 | 73 |
| 82 intptr_t SweeperThread::StealMemory(PagedSpace* space) { | |
| 83 if (space->identity() == OLD_POINTER_SPACE) { | |
| 84 return space->free_list()->Concatenate(&free_list_old_pointer_space_); | |
| 85 } else if (space->identity() == OLD_DATA_SPACE) { | |
| 86 return space->free_list()->Concatenate(&free_list_old_data_space_); | |
| 87 } | |
| 88 return 0; | |
| 89 } | |
| 90 | |
| 91 | |
| 92 void SweeperThread::Stop() { | 74 void SweeperThread::Stop() { |
| 93 Release_Store(&stop_thread_, static_cast<AtomicWord>(true)); | 75 Release_Store(&stop_thread_, static_cast<AtomicWord>(true)); |
| 94 start_sweeping_semaphore_.Signal(); | 76 start_sweeping_semaphore_.Signal(); |
| 95 stop_semaphore_.Wait(); | 77 stop_semaphore_.Wait(); |
| 96 Join(); | 78 Join(); |
| 97 } | 79 } |
| 98 | 80 |
| 99 | 81 |
| 100 void SweeperThread::StartSweeping() { | 82 void SweeperThread::StartSweeping() { |
| 101 start_sweeping_semaphore_.Signal(); | 83 start_sweeping_semaphore_.Signal(); |
| 102 } | 84 } |
| 103 | 85 |
| 104 | 86 |
| 105 void SweeperThread::WaitForSweeperThread() { | 87 void SweeperThread::WaitForSweeperThread() { |
| 106 end_sweeping_semaphore_.Wait(); | 88 end_sweeping_semaphore_.Wait(); |
| 107 } | 89 } |
| 108 | 90 |
| 109 | 91 |
| 110 int SweeperThread::NumberOfThreads(int max_available) { | 92 int SweeperThread::NumberOfThreads(int max_available) { |
| 111 if (!FLAG_concurrent_sweeping && !FLAG_parallel_sweeping) return 0; | 93 if (!FLAG_concurrent_sweeping && !FLAG_parallel_sweeping) return 0; |
| 112 if (FLAG_sweeper_threads > 0) return FLAG_sweeper_threads; | 94 if (FLAG_sweeper_threads > 0) return FLAG_sweeper_threads; |
| 113 if (FLAG_concurrent_sweeping) return max_available - 1; | 95 if (FLAG_concurrent_sweeping) return max_available - 1; |
| 114 ASSERT(FLAG_parallel_sweeping); | 96 ASSERT(FLAG_parallel_sweeping); |
| 115 return max_available; | 97 return max_available; |
| 116 } | 98 } |
| 117 | 99 |
| 118 } } // namespace v8::internal | 100 } } // namespace v8::internal |
| OLD | NEW |