| OLD | NEW |
| 1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 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 |
| 11 // with the distribution. | 11 // with the distribution. |
| 12 // * Neither the name of Google Inc. nor the names of its | 12 // * Neither the name of Google Inc. nor the names of its |
| 13 // contributors may be used to endorse or promote products derived | 13 // contributors may be used to endorse or promote products derived |
| 14 // from this software without specific prior written permission. | 14 // from this software without specific prior written permission. |
| 15 // | 15 // |
| 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 | 27 |
| 28 #include "marking-thread.h" | 28 #include "hydrogen-mark-unreachable.h" |
| 29 | |
| 30 #include "v8.h" | |
| 31 | |
| 32 #include "isolate.h" | |
| 33 #include "v8threads.h" | |
| 34 | 29 |
| 35 namespace v8 { | 30 namespace v8 { |
| 36 namespace internal { | 31 namespace internal { |
| 37 | 32 |
| 38 MarkingThread::MarkingThread(Isolate* isolate) | |
| 39 : Thread("MarkingThread"), | |
| 40 isolate_(isolate), | |
| 41 heap_(isolate->heap()), | |
| 42 start_marking_semaphore_(0), | |
| 43 end_marking_semaphore_(0), | |
| 44 stop_semaphore_(0) { | |
| 45 NoBarrier_Store(&stop_thread_, static_cast<AtomicWord>(false)); | |
| 46 id_ = NoBarrier_AtomicIncrement(&id_counter_, 1); | |
| 47 } | |
| 48 | 33 |
| 49 | 34 void HMarkUnreachableBlocksPhase::MarkUnreachableBlocks() { |
| 50 Atomic32 MarkingThread::id_counter_ = -1; | 35 // If there is unreachable code in the graph, propagate the unreachable marks |
| 51 | 36 // using a fixed-point iteration. |
| 52 | 37 bool changed = true; |
| 53 void MarkingThread::Run() { | 38 const ZoneList<HBasicBlock*>* blocks = graph()->blocks(); |
| 54 Isolate::SetIsolateThreadLocals(isolate_, NULL); | 39 while (changed) { |
| 55 DisallowHeapAllocation no_allocation; | 40 changed = false; |
| 56 DisallowHandleAllocation no_handles; | 41 for (int i = 0; i < blocks->length(); i++) { |
| 57 DisallowHandleDereference no_deref; | 42 HBasicBlock* block = blocks->at(i); |
| 58 | 43 if (!block->IsReachable()) continue; |
| 59 while (true) { | 44 bool is_reachable = blocks->at(0) == block; |
| 60 start_marking_semaphore_.Wait(); | 45 for (HPredecessorIterator it(block); !it.Done(); it.Advance()) { |
| 61 | 46 HBasicBlock* predecessor = it.Current(); |
| 62 if (Acquire_Load(&stop_thread_)) { | 47 // A block is reachable if one of its predecessors is reachable, |
| 63 stop_semaphore_.Signal(); | 48 // doesn't deoptimize and either is known to transfer control to the |
| 64 return; | 49 // block or has a control flow instruction for which the next block |
| 50 // cannot be determined. |
| 51 if (predecessor->IsReachable() && !predecessor->IsDeoptimizing()) { |
| 52 HBasicBlock* pred_succ; |
| 53 bool known_pred_succ = |
| 54 predecessor->end()->KnownSuccessorBlock(&pred_succ); |
| 55 if (!known_pred_succ || pred_succ == block) { |
| 56 is_reachable = true; |
| 57 break; |
| 58 } |
| 59 } |
| 60 if (block->is_osr_entry()) { |
| 61 is_reachable = true; |
| 62 } |
| 63 } |
| 64 if (!is_reachable) { |
| 65 block->MarkUnreachable(); |
| 66 changed = true; |
| 67 } |
| 65 } | 68 } |
| 66 | |
| 67 end_marking_semaphore_.Signal(); | |
| 68 } | 69 } |
| 69 } | 70 } |
| 70 | 71 |
| 71 | 72 |
| 72 void MarkingThread::Stop() { | 73 void HMarkUnreachableBlocksPhase::Run() { |
| 73 Release_Store(&stop_thread_, static_cast<AtomicWord>(true)); | 74 MarkUnreachableBlocks(); |
| 74 start_marking_semaphore_.Signal(); | |
| 75 stop_semaphore_.Wait(); | |
| 76 Join(); | |
| 77 } | |
| 78 | |
| 79 | |
| 80 void MarkingThread::StartMarking() { | |
| 81 start_marking_semaphore_.Signal(); | |
| 82 } | |
| 83 | |
| 84 | |
| 85 void MarkingThread::WaitForMarkingThread() { | |
| 86 end_marking_semaphore_.Wait(); | |
| 87 } | 75 } |
| 88 | 76 |
| 89 } } // namespace v8::internal | 77 } } // namespace v8::internal |
| OLD | NEW |