| OLD | NEW |
| 1 // Copyright 2014 the V8 project authors. All rights reserved. | 1 // Copyright 2014 the V8 project authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #include "src/compiler/js-context-specialization.h" | 5 #include "src/compiler/js-context-specialization.h" |
| 6 #include "src/compiler/js-operator.h" | 6 #include "src/compiler/js-operator.h" |
| 7 #include "src/compiler/node-matchers.h" | 7 #include "src/compiler/node-matchers.h" |
| 8 #include "src/compiler/node-properties.h" | 8 #include "src/compiler/node-properties.h" |
| 9 #include "src/compiler/source-position.h" | 9 #include "src/compiler/source-position.h" |
| 10 #include "test/cctest/cctest.h" | 10 #include "test/cctest/cctest.h" |
| (...skipping 213 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 224 t.graph()->NewNode(t.common()->Return(), add, effect_use, start); | 224 t.graph()->NewNode(t.common()->Return(), add, effect_use, start); |
| 225 Node* end = t.graph()->NewNode(t.common()->End(1), ret); | 225 Node* end = t.graph()->NewNode(t.common()->End(1), ret); |
| 226 USE(end); | 226 USE(end); |
| 227 t.graph()->SetEnd(end); | 227 t.graph()->SetEnd(end); |
| 228 | 228 |
| 229 // Double check the above graph is what we expect, or the test is broken. | 229 // Double check the above graph is what we expect, or the test is broken. |
| 230 CheckEffectInput(effect_in, load); | 230 CheckEffectInput(effect_in, load); |
| 231 CheckEffectInput(load, effect_use); | 231 CheckEffectInput(load, effect_use); |
| 232 | 232 |
| 233 // Perform the reduction on the entire graph. | 233 // Perform the reduction on the entire graph. |
| 234 GraphReducer graph_reducer(t.graph(), t.main_zone()); | 234 GraphReducer graph_reducer(t.main_zone(), t.graph()); |
| 235 graph_reducer.AddReducer(&spec); | 235 graph_reducer.AddReducer(&spec); |
| 236 graph_reducer.ReduceGraph(); | 236 graph_reducer.ReduceGraph(); |
| 237 | 237 |
| 238 // Effects should have been forwarded (not replaced with a value). | 238 // Effects should have been forwarded (not replaced with a value). |
| 239 CheckEffectInput(effect_in, effect_use); | 239 CheckEffectInput(effect_in, effect_use); |
| 240 | 240 |
| 241 // Use of {other_load} should not have been replaced. | 241 // Use of {other_load} should not have been replaced. |
| 242 CHECK_EQ(other_load, other_use->InputAt(0)); | 242 CHECK_EQ(other_load, other_use->InputAt(0)); |
| 243 | 243 |
| 244 Node* replacement = value_use->InputAt(0); | 244 Node* replacement = value_use->InputAt(0); |
| (...skipping 53 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 298 { | 298 { |
| 299 FunctionTester T( | 299 FunctionTester T( |
| 300 "(function() { if (false) { var x = 1; } function inc(a)" | 300 "(function() { if (false) { var x = 1; } function inc(a)" |
| 301 " { return a + x; } return inc; })()"); // x is undefined! | 301 " { return a + x; } return inc; })()"); // x is undefined! |
| 302 | 302 |
| 303 CHECK(T.Call(T.Val(0.0), T.Val(0.0)).ToHandleChecked()->IsNaN()); | 303 CHECK(T.Call(T.Val(0.0), T.Val(0.0)).ToHandleChecked()->IsNaN()); |
| 304 CHECK(T.Call(T.Val(2.0), T.Val(0.0)).ToHandleChecked()->IsNaN()); | 304 CHECK(T.Call(T.Val(2.0), T.Val(0.0)).ToHandleChecked()->IsNaN()); |
| 305 CHECK(T.Call(T.Val(-2.1), T.Val(0.0)).ToHandleChecked()->IsNaN()); | 305 CHECK(T.Call(T.Val(-2.1), T.Val(0.0)).ToHandleChecked()->IsNaN()); |
| 306 } | 306 } |
| 307 } | 307 } |
| OLD | NEW |