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 27 matching lines...) Expand all Loading... |
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 ASSERT(!FLAG_job_based_sweeping); |
48 NoBarrier_Store(&stop_thread_, static_cast<AtomicWord>(false)); | 49 NoBarrier_Store(&stop_thread_, static_cast<AtomicWord>(false)); |
49 } | 50 } |
50 | 51 |
51 | 52 |
52 void SweeperThread::Run() { | 53 void SweeperThread::Run() { |
53 Isolate::SetIsolateThreadLocals(isolate_, NULL); | 54 Isolate::SetIsolateThreadLocals(isolate_, NULL); |
54 DisallowHeapAllocation no_allocation; | 55 DisallowHeapAllocation no_allocation; |
55 DisallowHandleAllocation no_handles; | 56 DisallowHandleAllocation no_handles; |
56 DisallowHandleDereference no_deref; | 57 DisallowHandleDereference no_deref; |
57 | 58 |
(...skipping 32 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
90 | 91 |
91 int SweeperThread::NumberOfThreads(int max_available) { | 92 int SweeperThread::NumberOfThreads(int max_available) { |
92 if (!FLAG_concurrent_sweeping && !FLAG_parallel_sweeping) return 0; | 93 if (!FLAG_concurrent_sweeping && !FLAG_parallel_sweeping) return 0; |
93 if (FLAG_sweeper_threads > 0) return FLAG_sweeper_threads; | 94 if (FLAG_sweeper_threads > 0) return FLAG_sweeper_threads; |
94 if (FLAG_concurrent_sweeping) return max_available - 1; | 95 if (FLAG_concurrent_sweeping) return max_available - 1; |
95 ASSERT(FLAG_parallel_sweeping); | 96 ASSERT(FLAG_parallel_sweeping); |
96 return max_available; | 97 return max_available; |
97 } | 98 } |
98 | 99 |
99 } } // namespace v8::internal | 100 } } // namespace v8::internal |
OLD | NEW |