| 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-stubs.h" | 5 #include "src/code-stubs.h" |
| 6 #include "src/compiler/js-graph.h" | 6 #include "src/compiler/js-graph.h" |
| 7 #include "src/compiler/node-properties.h" | 7 #include "src/compiler/node-properties.h" |
| 8 #include "src/compiler/typer.h" | 8 #include "src/compiler/typer.h" |
| 9 | 9 |
| 10 namespace v8 { | 10 namespace v8 { |
| (...skipping 246 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 257 } | 257 } |
| 258 return *loc; | 258 return *loc; |
| 259 } | 259 } |
| 260 | 260 |
| 261 | 261 |
| 262 Node* JSGraph::ExternalConstant(Runtime::FunctionId function_id) { | 262 Node* JSGraph::ExternalConstant(Runtime::FunctionId function_id) { |
| 263 return ExternalConstant(ExternalReference(function_id, isolate())); | 263 return ExternalConstant(ExternalReference(function_id, isolate())); |
| 264 } | 264 } |
| 265 | 265 |
| 266 Node* JSGraph::EmptyStateValues() { | 266 Node* JSGraph::EmptyStateValues() { |
| 267 return CACHED(kEmptyStateValues, graph()->NewNode(common()->StateValues(0))); | 267 return CACHED(kEmptyStateValues, graph()->NewNode(common()->StateValues( |
| 268 0, SparseInputMask::Dense()))); |
| 268 } | 269 } |
| 269 | 270 |
| 270 Node* JSGraph::Dead() { | 271 Node* JSGraph::Dead() { |
| 271 return CACHED(kDead, graph()->NewNode(common()->Dead())); | 272 return CACHED(kDead, graph()->NewNode(common()->Dead())); |
| 272 } | 273 } |
| 273 | 274 |
| 274 | 275 |
| 275 void JSGraph::GetCachedNodes(NodeVector* nodes) { | 276 void JSGraph::GetCachedNodes(NodeVector* nodes) { |
| 276 cache_.GetCachedNodes(nodes); | 277 cache_.GetCachedNodes(nodes); |
| 277 for (size_t i = 0; i < arraysize(cached_nodes_); i++) { | 278 for (size_t i = 0; i < arraysize(cached_nodes_); i++) { |
| 278 if (Node* node = cached_nodes_[i]) { | 279 if (Node* node = cached_nodes_[i]) { |
| 279 if (!node->IsDead()) nodes->push_back(node); | 280 if (!node->IsDead()) nodes->push_back(node); |
| 280 } | 281 } |
| 281 } | 282 } |
| 282 } | 283 } |
| 283 | 284 |
| 284 } // namespace compiler | 285 } // namespace compiler |
| 285 } // namespace internal | 286 } // namespace internal |
| 286 } // namespace v8 | 287 } // namespace v8 |
| OLD | NEW |