| 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 30 matching lines...) Expand all Loading... |
| 41 Node* JSGraph::EmptyFixedArrayConstant() { | 41 Node* JSGraph::EmptyFixedArrayConstant() { |
| 42 return CACHED(kEmptyFixedArrayConstant, | 42 return CACHED(kEmptyFixedArrayConstant, |
| 43 HeapConstant(factory()->empty_fixed_array())); | 43 HeapConstant(factory()->empty_fixed_array())); |
| 44 } | 44 } |
| 45 | 45 |
| 46 Node* JSGraph::EmptyLiteralsArrayConstant() { | 46 Node* JSGraph::EmptyLiteralsArrayConstant() { |
| 47 return CACHED(kEmptyLiteralsArrayConstant, | 47 return CACHED(kEmptyLiteralsArrayConstant, |
| 48 HeapConstant(factory()->empty_literals_array())); | 48 HeapConstant(factory()->empty_literals_array())); |
| 49 } | 49 } |
| 50 | 50 |
| 51 Node* JSGraph::EmptyStringConstant() { |
| 52 return CACHED(kEmptyStringConstant, HeapConstant(factory()->empty_string())); |
| 53 } |
| 54 |
| 51 Node* JSGraph::HeapNumberMapConstant() { | 55 Node* JSGraph::HeapNumberMapConstant() { |
| 52 return CACHED(kHeapNumberMapConstant, | 56 return CACHED(kHeapNumberMapConstant, |
| 53 HeapConstant(factory()->heap_number_map())); | 57 HeapConstant(factory()->heap_number_map())); |
| 54 } | 58 } |
| 55 | 59 |
| 56 Node* JSGraph::OptimizedOutConstant() { | 60 Node* JSGraph::OptimizedOutConstant() { |
| 57 return CACHED(kOptimizedOutConstant, | 61 return CACHED(kOptimizedOutConstant, |
| 58 HeapConstant(factory()->optimized_out())); | 62 HeapConstant(factory()->optimized_out())); |
| 59 } | 63 } |
| 60 | 64 |
| (...skipping 182 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 243 for (size_t i = 0; i < arraysize(cached_nodes_); i++) { | 247 for (size_t i = 0; i < arraysize(cached_nodes_); i++) { |
| 244 if (Node* node = cached_nodes_[i]) { | 248 if (Node* node = cached_nodes_[i]) { |
| 245 if (!node->IsDead()) nodes->push_back(node); | 249 if (!node->IsDead()) nodes->push_back(node); |
| 246 } | 250 } |
| 247 } | 251 } |
| 248 } | 252 } |
| 249 | 253 |
| 250 } // namespace compiler | 254 } // namespace compiler |
| 251 } // namespace internal | 255 } // namespace internal |
| 252 } // namespace v8 | 256 } // namespace v8 |
| OLD | NEW |