OLD | NEW |
1 // Copyright 2015 the V8 project authors. All rights reserved. | 1 // Copyright 2015 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/bytecode-graph-builder.h" | 5 #include "src/compiler/bytecode-graph-builder.h" |
6 | 6 |
7 #include "src/ast/ast.h" | 7 #include "src/ast/ast.h" |
8 #include "src/ast/scopes.h" | 8 #include "src/ast/scopes.h" |
9 #include "src/compilation-info.h" | 9 #include "src/compilation-info.h" |
10 #include "src/compiler/compiler-source-position-table.h" | 10 #include "src/compiler/compiler-source-position-table.h" |
(...skipping 330 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
341 Node* context = effect = graph()->NewNode(guard_op, Context(), effect, entry); | 341 Node* context = effect = graph()->NewNode(guard_op, Context(), effect, entry); |
342 SetContext(context); | 342 SetContext(context); |
343 UpdateEffectDependency(effect); | 343 UpdateEffectDependency(effect); |
344 } | 344 } |
345 | 345 |
346 bool BytecodeGraphBuilder::Environment::StateValuesRequireUpdate( | 346 bool BytecodeGraphBuilder::Environment::StateValuesRequireUpdate( |
347 Node** state_values, Node** values, int count) { | 347 Node** state_values, Node** values, int count) { |
348 if (*state_values == nullptr) { | 348 if (*state_values == nullptr) { |
349 return true; | 349 return true; |
350 } | 350 } |
351 DCHECK_EQ((*state_values)->InputCount(), count); | 351 Node::Inputs inputs = (*state_values)->inputs(); |
| 352 DCHECK_EQ(inputs.count(), count); |
352 for (int i = 0; i < count; i++) { | 353 for (int i = 0; i < count; i++) { |
353 if ((*state_values)->InputAt(i) != values[i]) { | 354 if (inputs[i] != values[i]) { |
354 return true; | 355 return true; |
355 } | 356 } |
356 } | 357 } |
357 return false; | 358 return false; |
358 } | 359 } |
359 | 360 |
360 void BytecodeGraphBuilder::Environment::PrepareForLoopExit( | 361 void BytecodeGraphBuilder::Environment::PrepareForLoopExit( |
361 Node* loop, const BytecodeLoopAssignments& assignments) { | 362 Node* loop, const BytecodeLoopAssignments& assignments) { |
362 DCHECK_EQ(loop->opcode(), IrOpcode::kLoop); | 363 DCHECK_EQ(loop->opcode(), IrOpcode::kLoop); |
363 | 364 |
(...skipping 1902 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2266 it->source_position().ScriptOffset(), start_position_.InliningId())); | 2267 it->source_position().ScriptOffset(), start_position_.InliningId())); |
2267 it->Advance(); | 2268 it->Advance(); |
2268 } else { | 2269 } else { |
2269 DCHECK_GT(it->code_offset(), offset); | 2270 DCHECK_GT(it->code_offset(), offset); |
2270 } | 2271 } |
2271 } | 2272 } |
2272 | 2273 |
2273 } // namespace compiler | 2274 } // namespace compiler |
2274 } // namespace internal | 2275 } // namespace internal |
2275 } // namespace v8 | 2276 } // namespace v8 |
OLD | NEW |