Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 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 |
| 3 | // found in the LICENSE file. |
| 4 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 5 | #include "src/code-stubs.h" |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 6 | #include "src/compiler/js-graph.h" |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 7 | #include "src/compiler/node-properties.h" |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 8 | #include "src/compiler/typer.h" |
| 9 | |
| 10 | namespace v8 { |
| 11 | namespace internal { |
| 12 | namespace compiler { |
| 13 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 14 | #define CACHED(name, expr) \ |
| 15 | cached_nodes_[name] ? cached_nodes_[name] : (cached_nodes_[name] = (expr)) |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 16 | |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame^] | 17 | Node* JSGraph::AllocateInNewSpaceStubConstant() { |
| 18 | return CACHED(kAllocateInNewSpaceStubConstant, |
| 19 | HeapConstant(isolate()->builtins()->AllocateInNewSpace())); |
| 20 | } |
| 21 | |
| 22 | Node* JSGraph::AllocateInOldSpaceStubConstant() { |
| 23 | return CACHED(kAllocateInOldSpaceStubConstant, |
| 24 | HeapConstant(isolate()->builtins()->AllocateInOldSpace())); |
| 25 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 26 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 27 | Node* JSGraph::CEntryStubConstant(int result_size) { |
| 28 | if (result_size == 1) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 29 | return CACHED(kCEntryStubConstant, |
| 30 | HeapConstant(CEntryStub(isolate(), 1).GetCode())); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 31 | } |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 32 | return HeapConstant(CEntryStub(isolate(), result_size).GetCode()); |
| 33 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 34 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 35 | |
| 36 | Node* JSGraph::EmptyFixedArrayConstant() { |
| 37 | return CACHED(kEmptyFixedArrayConstant, |
| 38 | HeapConstant(factory()->empty_fixed_array())); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 39 | } |
| 40 | |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame^] | 41 | Node* JSGraph::HeapNumberMapConstant() { |
| 42 | return CACHED(kHeapNumberMapConstant, |
| 43 | HeapConstant(factory()->heap_number_map())); |
| 44 | } |
| 45 | |
Ben Murdoch | da12d29 | 2016-06-02 14:46:10 +0100 | [diff] [blame] | 46 | Node* JSGraph::OptimizedOutConstant() { |
| 47 | return CACHED(kOptimizedOutConstant, |
| 48 | HeapConstant(factory()->optimized_out())); |
| 49 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 50 | |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame^] | 51 | Node* JSGraph::StaleRegisterConstant() { |
| 52 | return CACHED(kStaleRegisterConstant, |
| 53 | HeapConstant(factory()->stale_register())); |
| 54 | } |
| 55 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 56 | Node* JSGraph::UndefinedConstant() { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 57 | return CACHED(kUndefinedConstant, HeapConstant(factory()->undefined_value())); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 58 | } |
| 59 | |
| 60 | |
| 61 | Node* JSGraph::TheHoleConstant() { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 62 | return CACHED(kTheHoleConstant, HeapConstant(factory()->the_hole_value())); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 63 | } |
| 64 | |
| 65 | |
| 66 | Node* JSGraph::TrueConstant() { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 67 | return CACHED(kTrueConstant, HeapConstant(factory()->true_value())); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 68 | } |
| 69 | |
| 70 | |
| 71 | Node* JSGraph::FalseConstant() { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 72 | return CACHED(kFalseConstant, HeapConstant(factory()->false_value())); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 73 | } |
| 74 | |
| 75 | |
| 76 | Node* JSGraph::NullConstant() { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 77 | return CACHED(kNullConstant, HeapConstant(factory()->null_value())); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 78 | } |
| 79 | |
| 80 | |
| 81 | Node* JSGraph::ZeroConstant() { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 82 | return CACHED(kZeroConstant, NumberConstant(0.0)); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 83 | } |
| 84 | |
| 85 | |
| 86 | Node* JSGraph::OneConstant() { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 87 | return CACHED(kOneConstant, NumberConstant(1.0)); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 88 | } |
| 89 | |
| 90 | |
| 91 | Node* JSGraph::NaNConstant() { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 92 | return CACHED(kNaNConstant, |
| 93 | NumberConstant(std::numeric_limits<double>::quiet_NaN())); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 94 | } |
| 95 | |
| 96 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 97 | Node* JSGraph::HeapConstant(Handle<HeapObject> value) { |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 98 | Node** loc = cache_.FindHeapConstant(value); |
| 99 | if (*loc == nullptr) { |
| 100 | *loc = graph()->NewNode(common()->HeapConstant(value)); |
| 101 | } |
| 102 | return *loc; |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 103 | } |
| 104 | |
| 105 | |
| 106 | Node* JSGraph::Constant(Handle<Object> value) { |
| 107 | // Dereference the handle to determine if a number constant or other |
| 108 | // canonicalized node can be used. |
| 109 | if (value->IsNumber()) { |
| 110 | return Constant(value->Number()); |
| 111 | } else if (value->IsUndefined()) { |
| 112 | return UndefinedConstant(); |
| 113 | } else if (value->IsTrue()) { |
| 114 | return TrueConstant(); |
| 115 | } else if (value->IsFalse()) { |
| 116 | return FalseConstant(); |
| 117 | } else if (value->IsNull()) { |
| 118 | return NullConstant(); |
| 119 | } else if (value->IsTheHole()) { |
| 120 | return TheHoleConstant(); |
| 121 | } else { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 122 | return HeapConstant(Handle<HeapObject>::cast(value)); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 123 | } |
| 124 | } |
| 125 | |
| 126 | |
| 127 | Node* JSGraph::Constant(double value) { |
| 128 | if (bit_cast<int64_t>(value) == bit_cast<int64_t>(0.0)) return ZeroConstant(); |
| 129 | if (bit_cast<int64_t>(value) == bit_cast<int64_t>(1.0)) return OneConstant(); |
| 130 | return NumberConstant(value); |
| 131 | } |
| 132 | |
| 133 | |
| 134 | Node* JSGraph::Constant(int32_t value) { |
| 135 | if (value == 0) return ZeroConstant(); |
| 136 | if (value == 1) return OneConstant(); |
| 137 | return NumberConstant(value); |
| 138 | } |
| 139 | |
| 140 | |
| 141 | Node* JSGraph::Int32Constant(int32_t value) { |
| 142 | Node** loc = cache_.FindInt32Constant(value); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 143 | if (*loc == nullptr) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 144 | *loc = graph()->NewNode(common()->Int32Constant(value)); |
| 145 | } |
| 146 | return *loc; |
| 147 | } |
| 148 | |
| 149 | |
| 150 | Node* JSGraph::Int64Constant(int64_t value) { |
| 151 | Node** loc = cache_.FindInt64Constant(value); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 152 | if (*loc == nullptr) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 153 | *loc = graph()->NewNode(common()->Int64Constant(value)); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 154 | } |
| 155 | return *loc; |
| 156 | } |
| 157 | |
Ben Murdoch | c561043 | 2016-08-08 18:44:38 +0100 | [diff] [blame^] | 158 | Node* JSGraph::RelocatableInt32Constant(int32_t value, RelocInfo::Mode rmode) { |
| 159 | Node** loc = cache_.FindRelocatableInt32Constant(value); |
| 160 | if (*loc == nullptr) { |
| 161 | *loc = graph()->NewNode(common()->RelocatableInt32Constant(value, rmode)); |
| 162 | } |
| 163 | return *loc; |
| 164 | } |
| 165 | |
| 166 | Node* JSGraph::RelocatableInt64Constant(int64_t value, RelocInfo::Mode rmode) { |
| 167 | Node** loc = cache_.FindRelocatableInt64Constant(value); |
| 168 | if (*loc == nullptr) { |
| 169 | *loc = graph()->NewNode(common()->RelocatableInt64Constant(value, rmode)); |
| 170 | } |
| 171 | return *loc; |
| 172 | } |
| 173 | |
| 174 | Node* JSGraph::RelocatableIntPtrConstant(intptr_t value, |
| 175 | RelocInfo::Mode rmode) { |
| 176 | return kPointerSize == 8 |
| 177 | ? RelocatableInt64Constant(value, rmode) |
| 178 | : RelocatableInt32Constant(static_cast<int>(value), rmode); |
| 179 | } |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 180 | |
| 181 | Node* JSGraph::NumberConstant(double value) { |
| 182 | Node** loc = cache_.FindNumberConstant(value); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 183 | if (*loc == nullptr) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 184 | *loc = graph()->NewNode(common()->NumberConstant(value)); |
| 185 | } |
| 186 | return *loc; |
| 187 | } |
| 188 | |
| 189 | |
| 190 | Node* JSGraph::Float32Constant(float value) { |
| 191 | Node** loc = cache_.FindFloat32Constant(value); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 192 | if (*loc == nullptr) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 193 | *loc = graph()->NewNode(common()->Float32Constant(value)); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 194 | } |
| 195 | return *loc; |
| 196 | } |
| 197 | |
| 198 | |
| 199 | Node* JSGraph::Float64Constant(double value) { |
| 200 | Node** loc = cache_.FindFloat64Constant(value); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 201 | if (*loc == nullptr) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 202 | *loc = graph()->NewNode(common()->Float64Constant(value)); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 203 | } |
| 204 | return *loc; |
| 205 | } |
| 206 | |
| 207 | |
| 208 | Node* JSGraph::ExternalConstant(ExternalReference reference) { |
| 209 | Node** loc = cache_.FindExternalConstant(reference); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 210 | if (*loc == nullptr) { |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 211 | *loc = graph()->NewNode(common()->ExternalConstant(reference)); |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 212 | } |
| 213 | return *loc; |
| 214 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 215 | |
| 216 | |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 217 | Node* JSGraph::ExternalConstant(Runtime::FunctionId function_id) { |
| 218 | return ExternalConstant(ExternalReference(function_id, isolate())); |
| 219 | } |
| 220 | |
| 221 | |
| 222 | Node* JSGraph::EmptyFrameState() { |
| 223 | Node* empty_frame_state = cached_nodes_[kEmptyFrameState]; |
| 224 | if (!empty_frame_state || empty_frame_state->IsDead()) { |
| 225 | Node* state_values = graph()->NewNode(common()->StateValues(0)); |
| 226 | empty_frame_state = graph()->NewNode( |
| 227 | common()->FrameState(BailoutId::None(), |
| 228 | OutputFrameStateCombine::Ignore(), nullptr), |
| 229 | state_values, state_values, state_values, NoContextConstant(), |
| 230 | UndefinedConstant(), graph()->start()); |
| 231 | cached_nodes_[kEmptyFrameState] = empty_frame_state; |
| 232 | } |
| 233 | return empty_frame_state; |
| 234 | } |
| 235 | |
| 236 | |
| 237 | Node* JSGraph::Dead() { |
| 238 | return CACHED(kDead, graph()->NewNode(common()->Dead())); |
| 239 | } |
| 240 | |
| 241 | |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 242 | void JSGraph::GetCachedNodes(NodeVector* nodes) { |
| 243 | cache_.GetCachedNodes(nodes); |
Ben Murdoch | 4a90d5f | 2016-03-22 12:00:34 +0000 | [diff] [blame] | 244 | for (size_t i = 0; i < arraysize(cached_nodes_); i++) { |
| 245 | if (Node* node = cached_nodes_[i]) { |
| 246 | if (!node->IsDead()) nodes->push_back(node); |
| 247 | } |
Emily Bernier | d0a1eb7 | 2015-03-24 16:35:39 -0400 | [diff] [blame] | 248 | } |
| 249 | } |
| 250 | |
Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 251 | } // namespace compiler |
| 252 | } // namespace internal |
| 253 | } // namespace v8 |