| 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::HeapNumberMapConstant() { |
| 33 return CACHED(kHeapNumberMapConstant, |
| 34 HeapConstant(factory()->heap_number_map())); |
| 35 } |
| 36 |
| 32 Node* JSGraph::OptimizedOutConstant() { | 37 Node* JSGraph::OptimizedOutConstant() { |
| 33 return CACHED(kOptimizedOutConstant, | 38 return CACHED(kOptimizedOutConstant, |
| 34 HeapConstant(factory()->optimized_out())); | 39 HeapConstant(factory()->optimized_out())); |
| 35 } | 40 } |
| 36 | 41 |
| 37 Node* JSGraph::UndefinedConstant() { | 42 Node* JSGraph::UndefinedConstant() { |
| 38 return CACHED(kUndefinedConstant, HeapConstant(factory()->undefined_value())); | 43 return CACHED(kUndefinedConstant, HeapConstant(factory()->undefined_value())); |
| 39 } | 44 } |
| 40 | 45 |
| 41 | 46 |
| (...skipping 186 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 228 for (size_t i = 0; i < arraysize(cached_nodes_); i++) { | 233 for (size_t i = 0; i < arraysize(cached_nodes_); i++) { |
| 229 if (Node* node = cached_nodes_[i]) { | 234 if (Node* node = cached_nodes_[i]) { |
| 230 if (!node->IsDead()) nodes->push_back(node); | 235 if (!node->IsDead()) nodes->push_back(node); |
| 231 } | 236 } |
| 232 } | 237 } |
| 233 } | 238 } |
| 234 | 239 |
| 235 } // namespace compiler | 240 } // namespace compiler |
| 236 } // namespace internal | 241 } // namespace internal |
| 237 } // namespace v8 | 242 } // namespace v8 |
| OLD | NEW |