| 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/simplified-lowering.h" | 5 #include "src/compiler/simplified-lowering.h" |
| 6 | 6 |
| 7 #include <limits> | 7 #include <limits> |
| 8 | 8 |
| 9 #include "src/base/bits.h" | 9 #include "src/base/bits.h" |
| 10 #include "src/code-factory.h" | 10 #include "src/code-factory.h" |
| (...skipping 1051 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1062 // same. | 1062 // same. |
| 1063 node->ReplaceUses(replacement); | 1063 node->ReplaceUses(replacement); |
| 1064 } else { | 1064 } else { |
| 1065 // Otherwise, we are replacing a node with a representation change. | 1065 // Otherwise, we are replacing a node with a representation change. |
| 1066 // Such a substitution must be done after all lowering is done, because | 1066 // Such a substitution must be done after all lowering is done, because |
| 1067 // changing the type could confuse the representation change | 1067 // changing the type could confuse the representation change |
| 1068 // insertion for uses of the node. | 1068 // insertion for uses of the node. |
| 1069 replacements_.push_back(node); | 1069 replacements_.push_back(node); |
| 1070 replacements_.push_back(replacement); | 1070 replacements_.push_back(replacement); |
| 1071 } | 1071 } |
| 1072 node->RemoveAllInputs(); // Node is now dead. | 1072 node->NullAllInputs(); // Node is now dead. |
| 1073 } | 1073 } |
| 1074 | 1074 |
| 1075 void PrintUseInfo(Node* node) { | 1075 void PrintUseInfo(Node* node) { |
| 1076 TRACE("#%d:%-20s ", node->id(), node->op()->mnemonic()); | 1076 TRACE("#%d:%-20s ", node->id(), node->op()->mnemonic()); |
| 1077 PrintInfo(GetUseInfo(node)); | 1077 PrintInfo(GetUseInfo(node)); |
| 1078 TRACE("\n"); | 1078 TRACE("\n"); |
| 1079 } | 1079 } |
| 1080 | 1080 |
| 1081 void PrintInfo(MachineTypeUnion info) { | 1081 void PrintInfo(MachineTypeUnion info) { |
| 1082 if (FLAG_trace_representation) { | 1082 if (FLAG_trace_representation) { |
| (...skipping 512 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1595 | 1595 |
| 1596 void SimplifiedLowering::DoStringLessThanOrEqual(Node* node) { | 1596 void SimplifiedLowering::DoStringLessThanOrEqual(Node* node) { |
| 1597 node->set_op(machine()->IntLessThanOrEqual()); | 1597 node->set_op(machine()->IntLessThanOrEqual()); |
| 1598 node->ReplaceInput(0, StringComparison(node, true)); | 1598 node->ReplaceInput(0, StringComparison(node, true)); |
| 1599 node->ReplaceInput(1, jsgraph()->SmiConstant(EQUAL)); | 1599 node->ReplaceInput(1, jsgraph()->SmiConstant(EQUAL)); |
| 1600 } | 1600 } |
| 1601 | 1601 |
| 1602 } // namespace compiler | 1602 } // namespace compiler |
| 1603 } // namespace internal | 1603 } // namespace internal |
| 1604 } // namespace v8 | 1604 } // namespace v8 |
| OLD | NEW |