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::HeapNumberMapConstant() { | 41 Node* JSGraph::HeapNumberMapConstant() { |
42 return CACHED(kHeapNumberMapConstant, | 42 return CACHED(kHeapNumberMapConstant, |
43 HeapConstant(factory()->heap_number_map())); | 43 HeapConstant(factory()->heap_number_map())); |
44 } | 44 } |
45 | 45 |
46 Node* JSGraph::OptimizedOutConstant() { | 46 Node* JSGraph::OptimizedOutConstant() { |
47 return CACHED(kOptimizedOutConstant, | 47 return CACHED(kOptimizedOutConstant, |
48 HeapConstant(factory()->optimized_out())); | 48 HeapConstant(factory()->optimized_out())); |
49 } | 49 } |
50 | 50 |
| 51 Node* JSGraph::StaleRegisterConstant() { |
| 52 return CACHED(kStaleRegisterConstant, |
| 53 HeapConstant(factory()->stale_register())); |
| 54 } |
| 55 |
51 Node* JSGraph::UndefinedConstant() { | 56 Node* JSGraph::UndefinedConstant() { |
52 return CACHED(kUndefinedConstant, HeapConstant(factory()->undefined_value())); | 57 return CACHED(kUndefinedConstant, HeapConstant(factory()->undefined_value())); |
53 } | 58 } |
54 | 59 |
55 | 60 |
56 Node* JSGraph::TheHoleConstant() { | 61 Node* JSGraph::TheHoleConstant() { |
57 return CACHED(kTheHoleConstant, HeapConstant(factory()->the_hole_value())); | 62 return CACHED(kTheHoleConstant, HeapConstant(factory()->the_hole_value())); |
58 } | 63 } |
59 | 64 |
60 | 65 |
(...skipping 178 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
239 for (size_t i = 0; i < arraysize(cached_nodes_); i++) { | 244 for (size_t i = 0; i < arraysize(cached_nodes_); i++) { |
240 if (Node* node = cached_nodes_[i]) { | 245 if (Node* node = cached_nodes_[i]) { |
241 if (!node->IsDead()) nodes->push_back(node); | 246 if (!node->IsDead()) nodes->push_back(node); |
242 } | 247 } |
243 } | 248 } |
244 } | 249 } |
245 | 250 |
246 } // namespace compiler | 251 } // namespace compiler |
247 } // namespace internal | 252 } // namespace internal |
248 } // namespace v8 | 253 } // namespace v8 |
OLD | NEW |