OLD | NEW |
1 // Copyright 2015 the V8 project authors. All rights reserved. | 1 // Copyright 2015 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/bytecode-graph-builder.h" | 5 #include "src/compiler/bytecode-graph-builder.h" |
6 | 6 |
7 #include "src/compiler/bytecode-branch-analysis.h" | 7 #include "src/compiler/bytecode-branch-analysis.h" |
8 #include "src/compiler/linkage.h" | 8 #include "src/compiler/linkage.h" |
9 #include "src/compiler/operator-properties.h" | 9 #include "src/compiler/operator-properties.h" |
10 #include "src/interpreter/bytecodes.h" | 10 #include "src/interpreter/bytecodes.h" |
(...skipping 1264 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1275 } | 1275 } |
1276 | 1276 |
1277 void BytecodeGraphBuilder::VisitTestNotEqual() { | 1277 void BytecodeGraphBuilder::VisitTestNotEqual() { |
1278 BuildCompareOp(javascript()->NotEqual()); | 1278 BuildCompareOp(javascript()->NotEqual()); |
1279 } | 1279 } |
1280 | 1280 |
1281 void BytecodeGraphBuilder::VisitTestEqualStrict() { | 1281 void BytecodeGraphBuilder::VisitTestEqualStrict() { |
1282 BuildCompareOp(javascript()->StrictEqual()); | 1282 BuildCompareOp(javascript()->StrictEqual()); |
1283 } | 1283 } |
1284 | 1284 |
1285 void BytecodeGraphBuilder::VisitTestNotEqualStrict() { | |
1286 BuildCompareOp(javascript()->StrictNotEqual()); | |
1287 } | |
1288 | |
1289 void BytecodeGraphBuilder::VisitTestLessThan() { | 1285 void BytecodeGraphBuilder::VisitTestLessThan() { |
1290 BuildCompareOp(javascript()->LessThan()); | 1286 BuildCompareOp(javascript()->LessThan()); |
1291 } | 1287 } |
1292 | 1288 |
1293 void BytecodeGraphBuilder::VisitTestGreaterThan() { | 1289 void BytecodeGraphBuilder::VisitTestGreaterThan() { |
1294 BuildCompareOp(javascript()->GreaterThan()); | 1290 BuildCompareOp(javascript()->GreaterThan()); |
1295 } | 1291 } |
1296 | 1292 |
1297 void BytecodeGraphBuilder::VisitTestLessThanOrEqual() { | 1293 void BytecodeGraphBuilder::VisitTestLessThanOrEqual() { |
1298 BuildCompareOp(javascript()->LessThanOrEqual()); | 1294 BuildCompareOp(javascript()->LessThanOrEqual()); |
(...skipping 458 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1757 // Phi does not exist yet, introduce one. | 1753 // Phi does not exist yet, introduce one. |
1758 value = NewPhi(inputs, value, control); | 1754 value = NewPhi(inputs, value, control); |
1759 value->ReplaceInput(inputs - 1, other); | 1755 value->ReplaceInput(inputs - 1, other); |
1760 } | 1756 } |
1761 return value; | 1757 return value; |
1762 } | 1758 } |
1763 | 1759 |
1764 } // namespace compiler | 1760 } // namespace compiler |
1765 } // namespace internal | 1761 } // namespace internal |
1766 } // namespace v8 | 1762 } // namespace v8 |
OLD | NEW |