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 39 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
50 | 50 |
51 Node* JSGraph::EmptyStringConstant() { | 51 Node* JSGraph::EmptyStringConstant() { |
52 return CACHED(kEmptyStringConstant, HeapConstant(factory()->empty_string())); | 52 return CACHED(kEmptyStringConstant, HeapConstant(factory()->empty_string())); |
53 } | 53 } |
54 | 54 |
55 Node* JSGraph::FixedArrayMapConstant() { | 55 Node* JSGraph::FixedArrayMapConstant() { |
56 return CACHED(kFixedArrayMapConstant, | 56 return CACHED(kFixedArrayMapConstant, |
57 HeapConstant(factory()->fixed_array_map())); | 57 HeapConstant(factory()->fixed_array_map())); |
58 } | 58 } |
59 | 59 |
| 60 Node* JSGraph::FixedDoubleArrayMapConstant() { |
| 61 return CACHED(kFixedDoubleArrayMapConstant, |
| 62 HeapConstant(factory()->fixed_double_array_map())); |
| 63 } |
| 64 |
60 Node* JSGraph::HeapNumberMapConstant() { | 65 Node* JSGraph::HeapNumberMapConstant() { |
61 return CACHED(kHeapNumberMapConstant, | 66 return CACHED(kHeapNumberMapConstant, |
62 HeapConstant(factory()->heap_number_map())); | 67 HeapConstant(factory()->heap_number_map())); |
63 } | 68 } |
64 | 69 |
65 Node* JSGraph::OptimizedOutConstant() { | 70 Node* JSGraph::OptimizedOutConstant() { |
66 return CACHED(kOptimizedOutConstant, | 71 return CACHED(kOptimizedOutConstant, |
67 HeapConstant(factory()->optimized_out())); | 72 HeapConstant(factory()->optimized_out())); |
68 } | 73 } |
69 | 74 |
(...skipping 187 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
257 for (size_t i = 0; i < arraysize(cached_nodes_); i++) { | 262 for (size_t i = 0; i < arraysize(cached_nodes_); i++) { |
258 if (Node* node = cached_nodes_[i]) { | 263 if (Node* node = cached_nodes_[i]) { |
259 if (!node->IsDead()) nodes->push_back(node); | 264 if (!node->IsDead()) nodes->push_back(node); |
260 } | 265 } |
261 } | 266 } |
262 } | 267 } |
263 | 268 |
264 } // namespace compiler | 269 } // namespace compiler |
265 } // namespace internal | 270 } // namespace internal |
266 } // namespace v8 | 271 } // namespace v8 |
OLD | NEW |