| OLD | NEW |
| 1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 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/graph-builder.h" | 5 #include "src/compiler/graph-builder.h" |
| 6 | 6 |
| 7 #include "src/compiler.h" | 7 #include "src/compiler.h" |
| 8 #include "src/compiler/generic-graph.h" | 8 #include "src/compiler/generic-graph.h" |
| 9 #include "src/compiler/generic-node.h" | 9 #include "src/compiler/generic-node.h" |
| 10 #include "src/compiler/generic-node-inl.h" | 10 #include "src/compiler/generic-node-inl.h" |
| (...skipping 27 matching lines...) Expand all Loading... |
| 38 size += kInputBufferSizeIncrement; | 38 size += kInputBufferSizeIncrement; |
| 39 input_buffer_ = local_zone()->NewArray<Node*>(size); | 39 input_buffer_ = local_zone()->NewArray<Node*>(size); |
| 40 } | 40 } |
| 41 return input_buffer_; | 41 return input_buffer_; |
| 42 } | 42 } |
| 43 | 43 |
| 44 | 44 |
| 45 Node* StructuredGraphBuilder::MakeNode(const Operator* op, | 45 Node* StructuredGraphBuilder::MakeNode(const Operator* op, |
| 46 int value_input_count, | 46 int value_input_count, |
| 47 Node** value_inputs, bool incomplete) { | 47 Node** value_inputs, bool incomplete) { |
| 48 DCHECK(op->InputCount() == value_input_count); | 48 DCHECK(op->ValueInputCount() == value_input_count); |
| 49 | 49 |
| 50 bool has_context = OperatorProperties::HasContextInput(op); | 50 bool has_context = OperatorProperties::HasContextInput(op); |
| 51 bool has_framestate = OperatorProperties::HasFrameStateInput(op); | 51 bool has_framestate = OperatorProperties::HasFrameStateInput(op); |
| 52 bool has_control = op->ControlInputCount() == 1; | 52 bool has_control = op->ControlInputCount() == 1; |
| 53 bool has_effect = op->EffectInputCount() == 1; | 53 bool has_effect = op->EffectInputCount() == 1; |
| 54 | 54 |
| 55 DCHECK(op->ControlInputCount() < 2); | 55 DCHECK(op->ControlInputCount() < 2); |
| 56 DCHECK(op->EffectInputCount() < 2); | 56 DCHECK(op->EffectInputCount() < 2); |
| 57 | 57 |
| 58 Node* result = NULL; | 58 Node* result = NULL; |
| (...skipping 213 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 272 if (!dead_control_.is_set()) { | 272 if (!dead_control_.is_set()) { |
| 273 Node* dead_node = graph()->NewNode(common_->Dead()); | 273 Node* dead_node = graph()->NewNode(common_->Dead()); |
| 274 dead_control_.set(dead_node); | 274 dead_control_.set(dead_node); |
| 275 return dead_node; | 275 return dead_node; |
| 276 } | 276 } |
| 277 return dead_control_.get(); | 277 return dead_control_.get(); |
| 278 } | 278 } |
| 279 } | 279 } |
| 280 } | 280 } |
| 281 } // namespace v8::internal::compiler | 281 } // namespace v8::internal::compiler |
| OLD | NEW |