| 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/code-factory.h" | 5 #include "src/code-factory.h" |
| 6 #include "src/compilation-dependencies.h" | 6 #include "src/compilation-dependencies.h" |
| 7 #include "src/compiler/access-builder.h" | 7 #include "src/compiler/access-builder.h" |
| 8 #include "src/compiler/js-graph.h" | 8 #include "src/compiler/js-graph.h" |
| 9 #include "src/compiler/js-typed-lowering.h" | 9 #include "src/compiler/js-typed-lowering.h" |
| 10 #include "src/compiler/linkage.h" | 10 #include "src/compiler/linkage.h" |
| (...skipping 2153 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2164 Node* cache_array_false0; | 2164 Node* cache_array_false0; |
| 2165 Node* cache_length_false0; | 2165 Node* cache_length_false0; |
| 2166 Node* cache_type_false0; | 2166 Node* cache_type_false0; |
| 2167 Node* efalse0; | 2167 Node* efalse0; |
| 2168 { | 2168 { |
| 2169 // FixedArray case. | 2169 // FixedArray case. |
| 2170 Node* receiver_instance_type = efalse0 = graph()->NewNode( | 2170 Node* receiver_instance_type = efalse0 = graph()->NewNode( |
| 2171 simplified()->LoadField(AccessBuilder::ForMapInstanceType()), | 2171 simplified()->LoadField(AccessBuilder::ForMapInstanceType()), |
| 2172 receiver_map, effect, if_false0); | 2172 receiver_map, effect, if_false0); |
| 2173 | 2173 |
| 2174 STATIC_ASSERT(FIRST_JS_PROXY_TYPE == FIRST_JS_RECEIVER_TYPE); | |
| 2175 cache_type_false0 = graph()->NewNode( | 2174 cache_type_false0 = graph()->NewNode( |
| 2176 common()->Select(kMachAnyTagged, BranchHint::kFalse), | 2175 common()->Select(kMachAnyTagged, BranchHint::kFalse), |
| 2177 graph()->NewNode(machine()->Uint32LessThanOrEqual(), | 2176 graph()->NewNode(machine()->Word32Equal(), receiver_instance_type, |
| 2178 receiver_instance_type, | 2177 jsgraph()->Uint32Constant(JS_PROXY_TYPE)), |
| 2179 jsgraph()->Uint32Constant(LAST_JS_PROXY_TYPE)), | |
| 2180 jsgraph()->ZeroConstant(), // Zero indicagtes proxy. | 2178 jsgraph()->ZeroConstant(), // Zero indicagtes proxy. |
| 2181 jsgraph()->OneConstant()); // One means slow check. | 2179 jsgraph()->OneConstant()); // One means slow check. |
| 2182 | 2180 |
| 2183 cache_array_false0 = cache_type; | 2181 cache_array_false0 = cache_type; |
| 2184 cache_length_false0 = efalse0 = graph()->NewNode( | 2182 cache_length_false0 = efalse0 = graph()->NewNode( |
| 2185 simplified()->LoadField(AccessBuilder::ForFixedArrayLength()), | 2183 simplified()->LoadField(AccessBuilder::ForFixedArrayLength()), |
| 2186 cache_array_false0, efalse0, if_false0); | 2184 cache_array_false0, efalse0, if_false0); |
| 2187 } | 2185 } |
| 2188 | 2186 |
| 2189 control = graph()->NewNode(common()->Merge(2), if_true0, if_false0); | 2187 control = graph()->NewNode(common()->Merge(2), if_true0, if_false0); |
| (...skipping 409 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2599 } | 2597 } |
| 2600 | 2598 |
| 2601 | 2599 |
| 2602 CompilationDependencies* JSTypedLowering::dependencies() const { | 2600 CompilationDependencies* JSTypedLowering::dependencies() const { |
| 2603 return dependencies_; | 2601 return dependencies_; |
| 2604 } | 2602 } |
| 2605 | 2603 |
| 2606 } // namespace compiler | 2604 } // namespace compiler |
| 2607 } // namespace internal | 2605 } // namespace internal |
| 2608 } // namespace v8 | 2606 } // namespace v8 |
| OLD | NEW |