| 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/diamond.h" | 5 #include "src/compiler/diamond.h" |
| 6 #include "src/compiler/js-builtin-reducer.h" | 6 #include "src/compiler/js-builtin-reducer.h" |
| 7 #include "src/compiler/js-graph.h" | 7 #include "src/compiler/js-graph.h" |
| 8 #include "src/compiler/node-matchers.h" | 8 #include "src/compiler/node-matchers.h" |
| 9 #include "src/compiler/node-properties.h" | 9 #include "src/compiler/node-properties.h" |
| 10 #include "src/types.h" | 10 #include "src/types.h" |
| (...skipping 132 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 143 // Math.max(a:number) -> a | 143 // Math.max(a:number) -> a |
| 144 return Replace(r.left()); | 144 return Replace(r.left()); |
| 145 } | 145 } |
| 146 if (r.InputsMatchAll(Type::Integral32())) { | 146 if (r.InputsMatchAll(Type::Integral32())) { |
| 147 // Math.max(a:int32, b:int32, ...) | 147 // Math.max(a:int32, b:int32, ...) |
| 148 Node* value = r.GetJSCallInput(0); | 148 Node* value = r.GetJSCallInput(0); |
| 149 for (int i = 1; i < r.GetJSCallArity(); i++) { | 149 for (int i = 1; i < r.GetJSCallArity(); i++) { |
| 150 Node* const input = r.GetJSCallInput(i); | 150 Node* const input = r.GetJSCallInput(i); |
| 151 value = graph()->NewNode( | 151 value = graph()->NewNode( |
| 152 common()->Select(kMachNone), | 152 common()->Select(kMachNone), |
| 153 graph()->NewNode(simplified()->NumberLessThan(), input, value), input, | 153 graph()->NewNode(simplified()->NumberLessThan(), input, value), value, |
| 154 value); | 154 input); |
| 155 } | 155 } |
| 156 return Replace(value); | 156 return Replace(value); |
| 157 } | 157 } |
| 158 return NoChange(); | 158 return NoChange(); |
| 159 } | 159 } |
| 160 | 160 |
| 161 | 161 |
| 162 // ES6 draft 08-24-14, section 20.2.2.19. | 162 // ES6 draft 08-24-14, section 20.2.2.19. |
| 163 Reduction JSBuiltinReducer::ReduceMathImul(Node* node) { | 163 Reduction JSBuiltinReducer::ReduceMathImul(Node* node) { |
| 164 JSCallReduction r(node); | 164 JSCallReduction r(node); |
| (...skipping 80 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 245 } | 245 } |
| 246 | 246 |
| 247 | 247 |
| 248 MachineOperatorBuilder* JSBuiltinReducer::machine() const { | 248 MachineOperatorBuilder* JSBuiltinReducer::machine() const { |
| 249 return jsgraph()->machine(); | 249 return jsgraph()->machine(); |
| 250 } | 250 } |
| 251 | 251 |
| 252 } // namespace compiler | 252 } // namespace compiler |
| 253 } // namespace internal | 253 } // namespace internal |
| 254 } // namespace v8 | 254 } // namespace v8 |
| OLD | NEW |