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 11 matching lines...) Expand all Loading... |
22 } | 22 } |
23 return HeapConstant(CEntryStub(isolate(), result_size).GetCode()); | 23 return HeapConstant(CEntryStub(isolate(), result_size).GetCode()); |
24 } | 24 } |
25 | 25 |
26 | 26 |
27 Node* JSGraph::EmptyFixedArrayConstant() { | 27 Node* JSGraph::EmptyFixedArrayConstant() { |
28 return CACHED(kEmptyFixedArrayConstant, | 28 return CACHED(kEmptyFixedArrayConstant, |
29 HeapConstant(factory()->empty_fixed_array())); | 29 HeapConstant(factory()->empty_fixed_array())); |
30 } | 30 } |
31 | 31 |
| 32 Node* JSGraph::OptimizedOutConstant() { |
| 33 return CACHED(kOptimizedOutConstant, |
| 34 HeapConstant(factory()->optimized_out())); |
| 35 } |
32 | 36 |
33 Node* JSGraph::UndefinedConstant() { | 37 Node* JSGraph::UndefinedConstant() { |
34 return CACHED(kUndefinedConstant, HeapConstant(factory()->undefined_value())); | 38 return CACHED(kUndefinedConstant, HeapConstant(factory()->undefined_value())); |
35 } | 39 } |
36 | 40 |
37 | 41 |
38 Node* JSGraph::TheHoleConstant() { | 42 Node* JSGraph::TheHoleConstant() { |
39 return CACHED(kTheHoleConstant, HeapConstant(factory()->the_hole_value())); | 43 return CACHED(kTheHoleConstant, HeapConstant(factory()->the_hole_value())); |
40 } | 44 } |
41 | 45 |
(...skipping 160 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
202 for (size_t i = 0; i < arraysize(cached_nodes_); i++) { | 206 for (size_t i = 0; i < arraysize(cached_nodes_); i++) { |
203 if (Node* node = cached_nodes_[i]) { | 207 if (Node* node = cached_nodes_[i]) { |
204 if (!node->IsDead()) nodes->push_back(node); | 208 if (!node->IsDead()) nodes->push_back(node); |
205 } | 209 } |
206 } | 210 } |
207 } | 211 } |
208 | 212 |
209 } // namespace compiler | 213 } // namespace compiler |
210 } // namespace internal | 214 } // namespace internal |
211 } // namespace v8 | 215 } // namespace v8 |
OLD | NEW |