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/change-lowering.h" | 5 #include "src/compiler/change-lowering.h" |
6 | 6 |
7 #include "src/code-factory.h" | 7 #include "src/code-factory.h" |
8 #include "src/compiler/diamond.h" | 8 #include "src/compiler/diamond.h" |
9 #include "src/compiler/js-graph.h" | 9 #include "src/compiler/js-graph.h" |
10 #include "src/compiler/linkage.h" | 10 #include "src/compiler/linkage.h" |
(...skipping 145 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
156 return Replace(AllocateHeapNumberWithValue(val, control)); | 156 return Replace(AllocateHeapNumberWithValue(val, control)); |
157 } | 157 } |
158 | 158 |
159 | 159 |
160 Reduction ChangeLowering::ChangeInt32ToTagged(Node* value, Node* control) { | 160 Reduction ChangeLowering::ChangeInt32ToTagged(Node* value, Node* control) { |
161 if (machine()->Is64()) { | 161 if (machine()->Is64()) { |
162 return Replace(graph()->NewNode( | 162 return Replace(graph()->NewNode( |
163 machine()->Word64Shl(), | 163 machine()->Word64Shl(), |
164 graph()->NewNode(machine()->ChangeInt32ToInt64(), value), | 164 graph()->NewNode(machine()->ChangeInt32ToInt64(), value), |
165 SmiShiftBitsConstant())); | 165 SmiShiftBitsConstant())); |
166 } else if (NodeProperties::GetBounds(value).upper->Is(Type::Signed31())) { | 166 } else if (NodeProperties::GetBounds(value).upper->Is(Type::SignedSmall())) { |
167 return Replace( | 167 return Replace( |
168 graph()->NewNode(machine()->WordShl(), value, SmiShiftBitsConstant())); | 168 graph()->NewNode(machine()->WordShl(), value, SmiShiftBitsConstant())); |
169 } | 169 } |
170 | 170 |
171 Node* add = graph()->NewNode(machine()->Int32AddWithOverflow(), value, value); | 171 Node* add = graph()->NewNode(machine()->Int32AddWithOverflow(), value, value); |
172 Node* ovf = graph()->NewNode(common()->Projection(1), add); | 172 Node* ovf = graph()->NewNode(common()->Projection(1), add); |
173 | 173 |
174 Diamond d(graph(), common(), ovf, BranchHint::kFalse); | 174 Diamond d(graph(), common(), ovf, BranchHint::kFalse); |
175 d.Chain(control); | 175 d.Chain(control); |
176 return Replace( | 176 return Replace( |
(...skipping 102 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
279 } | 279 } |
280 | 280 |
281 | 281 |
282 MachineOperatorBuilder* ChangeLowering::machine() const { | 282 MachineOperatorBuilder* ChangeLowering::machine() const { |
283 return jsgraph()->machine(); | 283 return jsgraph()->machine(); |
284 } | 284 } |
285 | 285 |
286 } // namespace compiler | 286 } // namespace compiler |
287 } // namespace internal | 287 } // namespace internal |
288 } // namespace v8 | 288 } // namespace v8 |
OLD | NEW |