| 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 20 matching lines...) Expand all Loading... |
| 31 } | 31 } |
| 32 return HeapConstant(CEntryStub(isolate(), result_size).GetCode()); | 32 return HeapConstant(CEntryStub(isolate(), result_size).GetCode()); |
| 33 } | 33 } |
| 34 | 34 |
| 35 | 35 |
| 36 Node* JSGraph::EmptyFixedArrayConstant() { | 36 Node* JSGraph::EmptyFixedArrayConstant() { |
| 37 return CACHED(kEmptyFixedArrayConstant, | 37 return CACHED(kEmptyFixedArrayConstant, |
| 38 HeapConstant(factory()->empty_fixed_array())); | 38 HeapConstant(factory()->empty_fixed_array())); |
| 39 } | 39 } |
| 40 | 40 |
| 41 Node* JSGraph::EmptyLiteralsArrayConstant() { |
| 42 return CACHED(kEmptyLiteralsArrayConstant, |
| 43 HeapConstant(factory()->empty_literals_array())); |
| 44 } |
| 45 |
| 41 Node* JSGraph::HeapNumberMapConstant() { | 46 Node* JSGraph::HeapNumberMapConstant() { |
| 42 return CACHED(kHeapNumberMapConstant, | 47 return CACHED(kHeapNumberMapConstant, |
| 43 HeapConstant(factory()->heap_number_map())); | 48 HeapConstant(factory()->heap_number_map())); |
| 44 } | 49 } |
| 45 | 50 |
| 46 Node* JSGraph::OptimizedOutConstant() { | 51 Node* JSGraph::OptimizedOutConstant() { |
| 47 return CACHED(kOptimizedOutConstant, | 52 return CACHED(kOptimizedOutConstant, |
| 48 HeapConstant(factory()->optimized_out())); | 53 HeapConstant(factory()->optimized_out())); |
| 49 } | 54 } |
| 50 | 55 |
| (...skipping 181 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 232 for (size_t i = 0; i < arraysize(cached_nodes_); i++) { | 237 for (size_t i = 0; i < arraysize(cached_nodes_); i++) { |
| 233 if (Node* node = cached_nodes_[i]) { | 238 if (Node* node = cached_nodes_[i]) { |
| 234 if (!node->IsDead()) nodes->push_back(node); | 239 if (!node->IsDead()) nodes->push_back(node); |
| 235 } | 240 } |
| 236 } | 241 } |
| 237 } | 242 } |
| 238 | 243 |
| 239 } // namespace compiler | 244 } // namespace compiler |
| 240 } // namespace internal | 245 } // namespace internal |
| 241 } // namespace v8 | 246 } // namespace v8 |
| OLD | NEW |