| 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 2119 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2130 Node* cache_array_false0; | 2130 Node* cache_array_false0; |
| 2131 Node* cache_length_false0; | 2131 Node* cache_length_false0; |
| 2132 Node* cache_type_false0; | 2132 Node* cache_type_false0; |
| 2133 Node* efalse0; | 2133 Node* efalse0; |
| 2134 { | 2134 { |
| 2135 // FixedArray case. | 2135 // FixedArray case. |
| 2136 Node* receiver_instance_type = efalse0 = graph()->NewNode( | 2136 Node* receiver_instance_type = efalse0 = graph()->NewNode( |
| 2137 simplified()->LoadField(AccessBuilder::ForMapInstanceType()), | 2137 simplified()->LoadField(AccessBuilder::ForMapInstanceType()), |
| 2138 receiver_map, effect, if_false0); | 2138 receiver_map, effect, if_false0); |
| 2139 | 2139 |
| 2140 STATIC_ASSERT(FIRST_JS_PROXY_TYPE == FIRST_JS_RECEIVER_TYPE); | |
| 2141 cache_type_false0 = graph()->NewNode( | 2140 cache_type_false0 = graph()->NewNode( |
| 2142 common()->Select(kMachAnyTagged, BranchHint::kFalse), | 2141 common()->Select(kMachAnyTagged, BranchHint::kFalse), |
| 2143 graph()->NewNode(machine()->Uint32LessThanOrEqual(), | 2142 graph()->NewNode(machine()->Word32Equal(), receiver_instance_type, |
| 2144 receiver_instance_type, | 2143 jsgraph()->Uint32Constant(JS_PROXY_TYPE)), |
| 2145 jsgraph()->Uint32Constant(LAST_JS_PROXY_TYPE)), | |
| 2146 jsgraph()->ZeroConstant(), // Zero indicagtes proxy. | 2144 jsgraph()->ZeroConstant(), // Zero indicagtes proxy. |
| 2147 jsgraph()->OneConstant()); // One means slow check. | 2145 jsgraph()->OneConstant()); // One means slow check. |
| 2148 | 2146 |
| 2149 cache_array_false0 = cache_type; | 2147 cache_array_false0 = cache_type; |
| 2150 cache_length_false0 = efalse0 = graph()->NewNode( | 2148 cache_length_false0 = efalse0 = graph()->NewNode( |
| 2151 simplified()->LoadField(AccessBuilder::ForFixedArrayLength()), | 2149 simplified()->LoadField(AccessBuilder::ForFixedArrayLength()), |
| 2152 cache_array_false0, efalse0, if_false0); | 2150 cache_array_false0, efalse0, if_false0); |
| 2153 } | 2151 } |
| 2154 | 2152 |
| 2155 control = graph()->NewNode(common()->Merge(2), if_true0, if_false0); | 2153 control = graph()->NewNode(common()->Merge(2), if_true0, if_false0); |
| (...skipping 439 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2595 } | 2593 } |
| 2596 | 2594 |
| 2597 | 2595 |
| 2598 CompilationDependencies* JSTypedLowering::dependencies() const { | 2596 CompilationDependencies* JSTypedLowering::dependencies() const { |
| 2599 return dependencies_; | 2597 return dependencies_; |
| 2600 } | 2598 } |
| 2601 | 2599 |
| 2602 } // namespace compiler | 2600 } // namespace compiler |
| 2603 } // namespace internal | 2601 } // namespace internal |
| 2604 } // namespace v8 | 2602 } // namespace v8 |
| OLD | NEW |