Chromium Code Reviews| 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 74 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 85 | 85 |
| 86 Node* JSGraph::NullConstant() { | 86 Node* JSGraph::NullConstant() { |
| 87 return CACHED(kNullConstant, HeapConstant(factory()->null_value())); | 87 return CACHED(kNullConstant, HeapConstant(factory()->null_value())); |
| 88 } | 88 } |
| 89 | 89 |
| 90 | 90 |
| 91 Node* JSGraph::ZeroConstant() { | 91 Node* JSGraph::ZeroConstant() { |
| 92 return CACHED(kZeroConstant, NumberConstant(0.0)); | 92 return CACHED(kZeroConstant, NumberConstant(0.0)); |
| 93 } | 93 } |
| 94 | 94 |
| 95 Node* JSGraph::MinusZeroConstant() { | |
| 96 return CACHED(kMinusZeroConstant, | |
|
Benedikt Meurer
2016/07/14 11:41:35
Remove this one.
| |
| 97 HeapConstant(factory()->minus_zero_value())); | |
| 98 } | |
| 95 | 99 |
| 96 Node* JSGraph::OneConstant() { | 100 Node* JSGraph::OneConstant() { |
| 97 return CACHED(kOneConstant, NumberConstant(1.0)); | 101 return CACHED(kOneConstant, NumberConstant(1.0)); |
| 98 } | 102 } |
| 99 | 103 |
| 100 | 104 |
| 101 Node* JSGraph::NaNConstant() { | 105 Node* JSGraph::NaNConstant() { |
| 102 return CACHED(kNaNConstant, | 106 return CACHED(kNaNConstant, |
| 103 NumberConstant(std::numeric_limits<double>::quiet_NaN())); | 107 NumberConstant(std::numeric_limits<double>::quiet_NaN())); |
| 104 } | 108 } |
| (...skipping 139 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 244 for (size_t i = 0; i < arraysize(cached_nodes_); i++) { | 248 for (size_t i = 0; i < arraysize(cached_nodes_); i++) { |
| 245 if (Node* node = cached_nodes_[i]) { | 249 if (Node* node = cached_nodes_[i]) { |
| 246 if (!node->IsDead()) nodes->push_back(node); | 250 if (!node->IsDead()) nodes->push_back(node); |
| 247 } | 251 } |
| 248 } | 252 } |
| 249 } | 253 } |
| 250 | 254 |
| 251 } // namespace compiler | 255 } // namespace compiler |
| 252 } // namespace internal | 256 } // namespace internal |
| 253 } // namespace v8 | 257 } // namespace v8 |
| OLD | NEW |