OLD | NEW |
---|---|
(Empty) | |
1 // Copyright 2013 the V8 project authors. All rights reserved. | |
2 // Redistribution and use in source and binary forms, with or without | |
3 // modification, are permitted provided that the following conditions are | |
4 // met: | |
5 // | |
6 // * Redistributions of source code must retain the above copyright | |
7 // notice, this list of conditions and the following disclaimer. | |
8 // * Redistributions in binary form must reproduce the above | |
9 // copyright notice, this list of conditions and the following | |
10 // disclaimer in the documentation and/or other materials provided | |
11 // with the distribution. | |
12 // * Neither the name of Google Inc. nor the names of its | |
13 // contributors may be used to endorse or promote products derived | |
14 // from this software without specific prior written permission. | |
15 // | |
16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
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. | |
27 | |
28 #include "hydrogen-mark-deoptimize.h" | |
29 | |
30 namespace v8 { | |
31 namespace internal { | |
32 | |
33 void HMarkDeoptimizeOnUndefinedPhase::Run() { | |
34 const ZoneList<HPhi*>* phi_list = graph()->phi_list(); | |
35 ZoneList<HPhi*> worklist(phi_list->length(), zone()); | |
36 for (int i = 0; i < phi_list->length(); i++) { | |
37 HPhi* phi = phi_list->at(i); | |
38 if (phi->CheckFlag(HValue::kAllowUndefinedAsNaN)) { | |
39 for (HUseIterator it(phi->uses()); !it.Done(); it.Advance()) { | |
40 HValue* use_value = it.value(); | |
41 if (!use_value->CheckFlag(HValue::kAllowUndefinedAsNaN)) { | |
42 // Enqueue to recursively check the phi operands below | |
43 phi->ClearFlag(HValue::kAllowUndefinedAsNaN); | |
44 ASSERT(!worklist.Contains(phi)); | |
45 worklist.Add(phi, zone()); | |
46 break; | |
47 } | |
48 } | |
49 } | |
50 } | |
51 | |
52 // Recursively clear flag for phi operands | |
53 while (!worklist.is_empty()) { | |
Dmitry Lomov (no reviews)
2013/07/29 15:31:48
This fusion of two methods into one using the same
Benedikt Meurer
2013/07/29 19:38:52
Done. Also refactored the common AddToWorklist fun
| |
54 HPhi* phi = worklist.RemoveLast(); | |
55 ASSERT(!phi->CheckFlag(HValue::kAllowUndefinedAsNaN)); | |
56 for (int i = 0; i < phi->OperandCount(); ++i) { | |
57 HValue* input = phi->OperandAt(i); | |
58 if (input->IsPhi() && input->CheckFlag(HValue::kAllowUndefinedAsNaN)) { | |
59 input->ClearFlag(HValue::kAllowUndefinedAsNaN); | |
60 ASSERT(!worklist.Contains(HPhi::cast(input))); | |
61 worklist.Add(HPhi::cast(input), zone()); | |
62 } | |
63 } | |
64 } | |
65 } | |
66 | |
67 } } // namespace v8::internal | |
OLD | NEW |