machenbach@chromium.org | 528ce02 | 2013-09-23 14:09:36 +0000 | [diff] [blame] | 1 | // Copyright 2013 the V8 project authors. All rights reserved. |
| 2 | // Redistribution and use in source and binary forms, with or without |
| 3 | // modification, are permitted provided that the following conditions are |
| 4 | // met: |
| 5 | // |
| 6 | // * Redistributions of source code must retain the above copyright |
| 7 | // notice, this list of conditions and the following disclaimer. |
| 8 | // * Redistributions in binary form must reproduce the above |
| 9 | // copyright notice, this list of conditions and the following |
| 10 | // disclaimer in the documentation and/or other materials provided |
| 11 | // with the distribution. |
| 12 | // * Neither the name of Google Inc. nor the names of its |
| 13 | // contributors may be used to endorse or promote products derived |
| 14 | // from this software without specific prior written permission. |
| 15 | // |
| 16 | // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 17 | // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 18 | // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 19 | // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 20 | // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 21 | // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 22 | // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 | // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 | // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 25 | // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 26 | // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 | |
| 28 | #include "hydrogen-alias-analysis.h" |
| 29 | #include "hydrogen-load-elimination.h" |
| 30 | #include "hydrogen-instructions.h" |
bmeurer@chromium.org | 0fdb2a6 | 2013-10-21 07:19:36 +0000 | [diff] [blame^] | 31 | #include "hydrogen-flow-engine.h" |
machenbach@chromium.org | 528ce02 | 2013-09-23 14:09:36 +0000 | [diff] [blame] | 32 | |
| 33 | namespace v8 { |
| 34 | namespace internal { |
| 35 | |
bmeurer@chromium.org | 0fdb2a6 | 2013-10-21 07:19:36 +0000 | [diff] [blame^] | 36 | #define GLOBAL true |
| 37 | #define TRACE(x) if (FLAG_trace_load_elimination) PrintF x |
| 38 | |
machenbach@chromium.org | 528ce02 | 2013-09-23 14:09:36 +0000 | [diff] [blame] | 39 | static const int kMaxTrackedFields = 16; |
| 40 | static const int kMaxTrackedObjects = 5; |
| 41 | |
| 42 | // An element in the field approximation list. |
| 43 | class HFieldApproximation : public ZoneObject { |
| 44 | public: // Just a data blob. |
| 45 | HValue* object_; |
| 46 | HLoadNamedField* last_load_; |
| 47 | HValue* last_value_; |
| 48 | HFieldApproximation* next_; |
bmeurer@chromium.org | 0fdb2a6 | 2013-10-21 07:19:36 +0000 | [diff] [blame^] | 49 | |
| 50 | // Recursively copy the entire linked list of field approximations. |
| 51 | HFieldApproximation* Copy(Zone* zone) { |
| 52 | if (this == NULL) return NULL; |
| 53 | HFieldApproximation* copy = new(zone) HFieldApproximation(); |
| 54 | copy->object_ = this->object_; |
| 55 | copy->last_load_ = this->last_load_; |
| 56 | copy->last_value_ = this->last_value_; |
| 57 | copy->next_ = this->next_->Copy(zone); |
| 58 | return copy; |
| 59 | } |
machenbach@chromium.org | 528ce02 | 2013-09-23 14:09:36 +0000 | [diff] [blame] | 60 | }; |
| 61 | |
| 62 | |
| 63 | // The main datastructure used during load/store elimination. Each in-object |
| 64 | // field is tracked separately. For each field, store a list of known field |
| 65 | // values for known objects. |
bmeurer@chromium.org | 0fdb2a6 | 2013-10-21 07:19:36 +0000 | [diff] [blame^] | 66 | class HLoadEliminationTable : public ZoneObject { |
machenbach@chromium.org | 528ce02 | 2013-09-23 14:09:36 +0000 | [diff] [blame] | 67 | public: |
| 68 | HLoadEliminationTable(Zone* zone, HAliasAnalyzer* aliasing) |
| 69 | : zone_(zone), fields_(kMaxTrackedFields, zone), aliasing_(aliasing) { } |
| 70 | |
bmeurer@chromium.org | 0fdb2a6 | 2013-10-21 07:19:36 +0000 | [diff] [blame^] | 71 | // The main processing of instructions. |
| 72 | HLoadEliminationTable* Process(HInstruction* instr, Zone* zone) { |
| 73 | switch (instr->opcode()) { |
| 74 | case HValue::kLoadNamedField: { |
| 75 | HLoadNamedField* l = HLoadNamedField::cast(instr); |
| 76 | TRACE((" process L%d field %d (o%d)\n", |
| 77 | instr->id(), |
| 78 | FieldOf(l->access()), |
| 79 | l->object()->ActualValue()->id())); |
| 80 | HValue* result = load(l); |
| 81 | if (result != instr) { |
| 82 | // The load can be replaced with a previous load or a value. |
| 83 | TRACE((" replace L%d -> v%d\n", instr->id(), result->id())); |
| 84 | instr->DeleteAndReplaceWith(result); |
| 85 | } |
| 86 | break; |
| 87 | } |
| 88 | case HValue::kStoreNamedField: { |
| 89 | HStoreNamedField* s = HStoreNamedField::cast(instr); |
| 90 | TRACE((" process S%d field %d (o%d) = v%d\n", |
| 91 | instr->id(), |
| 92 | FieldOf(s->access()), |
| 93 | s->object()->ActualValue()->id(), |
| 94 | s->value()->id())); |
| 95 | HValue* result = store(s); |
| 96 | if (result == NULL) { |
| 97 | // The store is redundant. Remove it. |
| 98 | TRACE((" remove S%d\n", instr->id())); |
| 99 | instr->DeleteAndReplaceWith(NULL); |
| 100 | } |
| 101 | break; |
| 102 | } |
| 103 | default: { |
| 104 | if (instr->CheckGVNFlag(kChangesInobjectFields)) { |
| 105 | TRACE((" kill-all i%d\n", instr->id())); |
| 106 | Kill(); |
| 107 | break; |
| 108 | } |
| 109 | if (instr->CheckGVNFlag(kChangesMaps)) { |
| 110 | TRACE((" kill-maps i%d\n", instr->id())); |
| 111 | KillOffset(JSObject::kMapOffset); |
| 112 | } |
| 113 | if (instr->CheckGVNFlag(kChangesElementsKind)) { |
| 114 | TRACE((" kill-elements-kind i%d\n", instr->id())); |
| 115 | KillOffset(JSObject::kMapOffset); |
| 116 | KillOffset(JSObject::kElementsOffset); |
| 117 | } |
| 118 | if (instr->CheckGVNFlag(kChangesElementsPointer)) { |
| 119 | TRACE((" kill-elements i%d\n", instr->id())); |
| 120 | KillOffset(JSObject::kElementsOffset); |
| 121 | } |
| 122 | if (instr->CheckGVNFlag(kChangesOsrEntries)) { |
| 123 | TRACE((" kill-osr i%d\n", instr->id())); |
| 124 | Kill(); |
| 125 | } |
| 126 | } |
| 127 | // Improvements possible: |
| 128 | // - learn from HCheckMaps for field 0 |
| 129 | // - remove unobservable stores (write-after-write) |
| 130 | // - track cells |
| 131 | // - track globals |
| 132 | // - track roots |
| 133 | } |
| 134 | return this; |
| 135 | } |
| 136 | |
| 137 | // Support for global analysis with HFlowEngine: Copy state to sucessor block. |
| 138 | HLoadEliminationTable* Copy(HBasicBlock* succ, Zone* zone) { |
| 139 | HLoadEliminationTable* copy = |
| 140 | new(zone) HLoadEliminationTable(zone, aliasing_); |
| 141 | copy->EnsureFields(fields_.length()); |
| 142 | for (int i = 0; i < fields_.length(); i++) { |
| 143 | copy->fields_[i] = fields_[i]->Copy(zone); |
| 144 | } |
| 145 | if (FLAG_trace_load_elimination) { |
| 146 | TRACE((" copy-to B%d\n", succ->block_id())); |
| 147 | copy->Print(); |
| 148 | } |
| 149 | return copy; |
| 150 | } |
| 151 | |
| 152 | // Support for global analysis with HFlowEngine: Merge this state with |
| 153 | // the other incoming state. |
| 154 | HLoadEliminationTable* Merge(HBasicBlock* succ, |
| 155 | HLoadEliminationTable* that, Zone* zone) { |
| 156 | if (that->fields_.length() < fields_.length()) { |
| 157 | // Drop fields not in the other table. |
| 158 | fields_.Rewind(that->fields_.length()); |
| 159 | } |
| 160 | for (int i = 0; i < fields_.length(); i++) { |
| 161 | // Merge the field approximations for like fields. |
| 162 | HFieldApproximation* approx = fields_[i]; |
| 163 | HFieldApproximation* prev = NULL; |
| 164 | while (approx != NULL) { |
| 165 | // TODO(titzer): Merging is O(N * M); sort? |
| 166 | HFieldApproximation* other = that->Find(approx->object_, i); |
| 167 | if (other == NULL || !Equal(approx->last_value_, other->last_value_)) { |
| 168 | // Kill an entry that doesn't agree with the other value. |
| 169 | if (prev != NULL) { |
| 170 | prev->next_ = approx->next_; |
| 171 | } else { |
| 172 | fields_[i] = approx->next_; |
| 173 | } |
| 174 | approx = approx->next_; |
| 175 | continue; |
| 176 | } |
| 177 | prev = approx; |
| 178 | approx = approx->next_; |
| 179 | } |
| 180 | } |
| 181 | return this; |
| 182 | } |
| 183 | |
| 184 | friend class HLoadEliminationEffects; // Calls Kill() and others. |
| 185 | friend class HLoadEliminationPhase; |
| 186 | |
| 187 | private: |
machenbach@chromium.org | 528ce02 | 2013-09-23 14:09:36 +0000 | [diff] [blame] | 188 | // Process a load instruction, updating internal table state. If a previous |
| 189 | // load or store for this object and field exists, return the new value with |
| 190 | // which the load should be replaced. Otherwise, return {instr}. |
| 191 | HValue* load(HLoadNamedField* instr) { |
| 192 | int field = FieldOf(instr->access()); |
| 193 | if (field < 0) return instr; |
| 194 | |
| 195 | HValue* object = instr->object()->ActualValue(); |
| 196 | HFieldApproximation* approx = FindOrCreate(object, field); |
| 197 | |
| 198 | if (approx->last_value_ == NULL) { |
| 199 | // Load is not redundant. Fill out a new entry. |
| 200 | approx->last_load_ = instr; |
| 201 | approx->last_value_ = instr; |
| 202 | return instr; |
| 203 | } else { |
| 204 | // Eliminate the load. Reuse previously stored value or load instruction. |
| 205 | return approx->last_value_; |
| 206 | } |
| 207 | } |
| 208 | |
| 209 | // Process a store instruction, updating internal table state. If a previous |
| 210 | // store to the same object and field makes this store redundant (e.g. because |
| 211 | // the stored values are the same), return NULL indicating that this store |
| 212 | // instruction is redundant. Otherwise, return {instr}. |
| 213 | HValue* store(HStoreNamedField* instr) { |
| 214 | int field = FieldOf(instr->access()); |
| 215 | if (field < 0) return instr; |
| 216 | |
| 217 | HValue* object = instr->object()->ActualValue(); |
| 218 | HValue* value = instr->value(); |
| 219 | |
| 220 | // Kill non-equivalent may-alias entries. |
| 221 | KillFieldInternal(object, field, value); |
| 222 | if (instr->has_transition()) { |
| 223 | // A transition store alters the map of the object. |
| 224 | // TODO(titzer): remember the new map (a constant) for the object. |
| 225 | KillFieldInternal(object, FieldOf(JSObject::kMapOffset), NULL); |
| 226 | } |
| 227 | HFieldApproximation* approx = FindOrCreate(object, field); |
| 228 | |
| 229 | if (Equal(approx->last_value_, value)) { |
| 230 | // The store is redundant because the field already has this value. |
| 231 | return NULL; |
| 232 | } else { |
| 233 | // The store is not redundant. Update the entry. |
| 234 | approx->last_load_ = NULL; |
| 235 | approx->last_value_ = value; |
| 236 | return instr; |
| 237 | } |
| 238 | } |
| 239 | |
| 240 | // Kill everything in this table. |
| 241 | void Kill() { |
| 242 | fields_.Rewind(0); |
| 243 | } |
| 244 | |
| 245 | // Kill all entries matching the given offset. |
| 246 | void KillOffset(int offset) { |
| 247 | int field = FieldOf(offset); |
| 248 | if (field >= 0 && field < fields_.length()) { |
| 249 | fields_[field] = NULL; |
| 250 | } |
| 251 | } |
| 252 | |
bmeurer@chromium.org | 0fdb2a6 | 2013-10-21 07:19:36 +0000 | [diff] [blame^] | 253 | // Find an entry for the given object and field pair. |
| 254 | HFieldApproximation* Find(HValue* object, int field) { |
| 255 | // Search for a field approximation for this object. |
| 256 | HFieldApproximation* approx = fields_[field]; |
| 257 | while (approx != NULL) { |
| 258 | if (aliasing_->MustAlias(object, approx->object_)) return approx; |
| 259 | approx = approx->next_; |
machenbach@chromium.org | 528ce02 | 2013-09-23 14:09:36 +0000 | [diff] [blame] | 260 | } |
bmeurer@chromium.org | 0fdb2a6 | 2013-10-21 07:19:36 +0000 | [diff] [blame^] | 261 | return NULL; |
machenbach@chromium.org | 528ce02 | 2013-09-23 14:09:36 +0000 | [diff] [blame] | 262 | } |
| 263 | |
machenbach@chromium.org | 528ce02 | 2013-09-23 14:09:36 +0000 | [diff] [blame] | 264 | // Find or create an entry for the given object and field pair. |
| 265 | HFieldApproximation* FindOrCreate(HValue* object, int field) { |
| 266 | EnsureFields(field + 1); |
| 267 | |
| 268 | // Search for a field approximation for this object. |
| 269 | HFieldApproximation* approx = fields_[field]; |
| 270 | int count = 0; |
| 271 | while (approx != NULL) { |
| 272 | if (aliasing_->MustAlias(object, approx->object_)) return approx; |
| 273 | count++; |
| 274 | approx = approx->next_; |
| 275 | } |
| 276 | |
| 277 | if (count >= kMaxTrackedObjects) { |
| 278 | // Pull the last entry off the end and repurpose it for this object. |
| 279 | approx = ReuseLastApproximation(field); |
| 280 | } else { |
| 281 | // Allocate a new entry. |
| 282 | approx = new(zone_) HFieldApproximation(); |
| 283 | } |
| 284 | |
| 285 | // Insert the entry at the head of the list. |
| 286 | approx->object_ = object; |
| 287 | approx->last_load_ = NULL; |
| 288 | approx->last_value_ = NULL; |
| 289 | approx->next_ = fields_[field]; |
| 290 | fields_[field] = approx; |
| 291 | |
| 292 | return approx; |
| 293 | } |
| 294 | |
| 295 | // Kill all entries for a given field that _may_ alias the given object |
| 296 | // and do _not_ have the given value. |
| 297 | void KillFieldInternal(HValue* object, int field, HValue* value) { |
| 298 | if (field >= fields_.length()) return; // Nothing to do. |
| 299 | |
| 300 | HFieldApproximation* approx = fields_[field]; |
| 301 | HFieldApproximation* prev = NULL; |
| 302 | while (approx != NULL) { |
| 303 | if (aliasing_->MayAlias(object, approx->object_)) { |
| 304 | if (!Equal(approx->last_value_, value)) { |
| 305 | // Kill an aliasing entry that doesn't agree on the value. |
| 306 | if (prev != NULL) { |
| 307 | prev->next_ = approx->next_; |
| 308 | } else { |
| 309 | fields_[field] = approx->next_; |
| 310 | } |
| 311 | approx = approx->next_; |
| 312 | continue; |
| 313 | } |
| 314 | } |
| 315 | prev = approx; |
| 316 | approx = approx->next_; |
| 317 | } |
| 318 | } |
| 319 | |
| 320 | bool Equal(HValue* a, HValue* b) { |
| 321 | if (a == b) return true; |
| 322 | if (a != NULL && b != NULL) return a->Equals(b); |
| 323 | return false; |
| 324 | } |
| 325 | |
| 326 | // Remove the last approximation for a field so that it can be reused. |
| 327 | // We reuse the last entry because it was the first inserted and is thus |
| 328 | // farthest away from the current instruction. |
| 329 | HFieldApproximation* ReuseLastApproximation(int field) { |
| 330 | HFieldApproximation* approx = fields_[field]; |
| 331 | ASSERT(approx != NULL); |
| 332 | |
| 333 | HFieldApproximation* prev = NULL; |
| 334 | while (approx->next_ != NULL) { |
| 335 | prev = approx; |
| 336 | approx = approx->next_; |
| 337 | } |
| 338 | if (prev != NULL) prev->next_ = NULL; |
| 339 | return approx; |
| 340 | } |
| 341 | |
bmeurer@chromium.org | 0fdb2a6 | 2013-10-21 07:19:36 +0000 | [diff] [blame^] | 342 | // Compute the field index for the given object access; -1 if not tracked. |
| 343 | int FieldOf(HObjectAccess access) { |
| 344 | return access.IsInobject() ? FieldOf(access.offset()) : -1; |
machenbach@chromium.org | 528ce02 | 2013-09-23 14:09:36 +0000 | [diff] [blame] | 345 | } |
| 346 | |
bmeurer@chromium.org | 0fdb2a6 | 2013-10-21 07:19:36 +0000 | [diff] [blame^] | 347 | // Compute the field index for the given in-object offset; -1 if not tracked. |
machenbach@chromium.org | 528ce02 | 2013-09-23 14:09:36 +0000 | [diff] [blame] | 348 | int FieldOf(int offset) { |
| 349 | if (offset >= kMaxTrackedFields * kPointerSize) return -1; |
| 350 | ASSERT((offset % kPointerSize) == 0); // Assume aligned accesses. |
| 351 | return offset / kPointerSize; |
| 352 | } |
| 353 | |
bmeurer@chromium.org | 0fdb2a6 | 2013-10-21 07:19:36 +0000 | [diff] [blame^] | 354 | // Ensure internal storage for the given number of fields. |
| 355 | void EnsureFields(int num_fields) { |
| 356 | if (fields_.length() < num_fields) { |
| 357 | fields_.AddBlock(NULL, num_fields - fields_.length(), zone_); |
| 358 | } |
| 359 | } |
| 360 | |
| 361 | // Print this table to stdout. |
| 362 | void Print() { |
| 363 | for (int i = 0; i < fields_.length(); i++) { |
| 364 | PrintF(" field %d: ", i); |
| 365 | for (HFieldApproximation* a = fields_[i]; a != NULL; a = a->next_) { |
| 366 | PrintF("[o%d =", a->object_->id()); |
| 367 | if (a->last_load_ != NULL) PrintF(" L%d", a->last_load_->id()); |
| 368 | if (a->last_value_ != NULL) PrintF(" v%d", a->last_value_->id()); |
| 369 | PrintF("] "); |
| 370 | } |
| 371 | PrintF("\n"); |
| 372 | } |
| 373 | } |
| 374 | |
machenbach@chromium.org | 528ce02 | 2013-09-23 14:09:36 +0000 | [diff] [blame] | 375 | Zone* zone_; |
| 376 | ZoneList<HFieldApproximation*> fields_; |
| 377 | HAliasAnalyzer* aliasing_; |
| 378 | }; |
| 379 | |
| 380 | |
bmeurer@chromium.org | 0fdb2a6 | 2013-10-21 07:19:36 +0000 | [diff] [blame^] | 381 | // Support for HFlowEngine: collect store effects within loops. |
| 382 | class HLoadEliminationEffects : public ZoneObject { |
| 383 | public: |
| 384 | explicit HLoadEliminationEffects(Zone* zone) |
| 385 | : zone_(zone), |
| 386 | maps_stored_(false), |
| 387 | fields_stored_(false), |
| 388 | elements_stored_(false), |
| 389 | stores_(5, zone) { } |
| 390 | |
| 391 | inline bool Disabled() { |
| 392 | return false; // Effects are _not_ disabled. |
machenbach@chromium.org | 528ce02 | 2013-09-23 14:09:36 +0000 | [diff] [blame] | 393 | } |
machenbach@chromium.org | 528ce02 | 2013-09-23 14:09:36 +0000 | [diff] [blame] | 394 | |
bmeurer@chromium.org | 0fdb2a6 | 2013-10-21 07:19:36 +0000 | [diff] [blame^] | 395 | // Process a possibly side-effecting instruction. |
| 396 | void Process(HInstruction* instr, Zone* zone) { |
machenbach@chromium.org | 528ce02 | 2013-09-23 14:09:36 +0000 | [diff] [blame] | 397 | switch (instr->opcode()) { |
bmeurer@chromium.org | 0fdb2a6 | 2013-10-21 07:19:36 +0000 | [diff] [blame^] | 398 | case HValue::kStoreNamedField: { |
| 399 | stores_.Add(HStoreNamedField::cast(instr), zone_); |
machenbach@chromium.org | 528ce02 | 2013-09-23 14:09:36 +0000 | [diff] [blame] | 400 | break; |
| 401 | } |
bmeurer@chromium.org | 0fdb2a6 | 2013-10-21 07:19:36 +0000 | [diff] [blame^] | 402 | case HValue::kOsrEntry: { |
| 403 | // Kill everything. Loads must not be hoisted past the OSR entry. |
| 404 | maps_stored_ = true; |
| 405 | fields_stored_ = true; |
| 406 | elements_stored_ = true; |
machenbach@chromium.org | 528ce02 | 2013-09-23 14:09:36 +0000 | [diff] [blame] | 407 | } |
| 408 | default: { |
bmeurer@chromium.org | 0fdb2a6 | 2013-10-21 07:19:36 +0000 | [diff] [blame^] | 409 | fields_stored_ |= instr->CheckGVNFlag(kChangesInobjectFields); |
| 410 | maps_stored_ |= instr->CheckGVNFlag(kChangesMaps); |
| 411 | maps_stored_ |= instr->CheckGVNFlag(kChangesElementsKind); |
| 412 | elements_stored_ |= instr->CheckGVNFlag(kChangesElementsKind); |
| 413 | elements_stored_ |= instr->CheckGVNFlag(kChangesElementsPointer); |
machenbach@chromium.org | 528ce02 | 2013-09-23 14:09:36 +0000 | [diff] [blame] | 414 | } |
bmeurer@chromium.org | 0fdb2a6 | 2013-10-21 07:19:36 +0000 | [diff] [blame^] | 415 | } |
| 416 | } |
| 417 | |
| 418 | // Apply these effects to the given load elimination table. |
| 419 | void Apply(HLoadEliminationTable* table) { |
| 420 | if (fields_stored_) { |
| 421 | table->Kill(); |
| 422 | return; |
| 423 | } |
| 424 | if (maps_stored_) { |
| 425 | table->KillOffset(JSObject::kMapOffset); |
| 426 | } |
| 427 | if (elements_stored_) { |
| 428 | table->KillOffset(JSObject::kElementsOffset); |
machenbach@chromium.org | 528ce02 | 2013-09-23 14:09:36 +0000 | [diff] [blame] | 429 | } |
| 430 | |
bmeurer@chromium.org | 0fdb2a6 | 2013-10-21 07:19:36 +0000 | [diff] [blame^] | 431 | // Kill non-agreeing fields for each store contained in these effects. |
| 432 | for (int i = 0; i < stores_.length(); i++) { |
| 433 | HStoreNamedField* s = stores_[i]; |
| 434 | int field = table->FieldOf(s->access()); |
| 435 | if (field >= 0) { |
| 436 | table->KillFieldInternal(s->object()->ActualValue(), field, s->value()); |
| 437 | } |
| 438 | } |
| 439 | } |
| 440 | |
| 441 | // Union these effects with the other effects. |
| 442 | void Union(HLoadEliminationEffects* that, Zone* zone) { |
| 443 | maps_stored_ |= that->maps_stored_; |
| 444 | fields_stored_ |= that->fields_stored_; |
| 445 | elements_stored_ |= that->elements_stored_; |
| 446 | for (int i = 0; i < that->stores_.length(); i++) { |
| 447 | stores_.Add(that->stores_[i], zone); |
| 448 | } |
| 449 | } |
| 450 | |
| 451 | private: |
| 452 | Zone* zone_; |
| 453 | bool maps_stored_ : 1; |
| 454 | bool fields_stored_ : 1; |
| 455 | bool elements_stored_ : 1; |
| 456 | ZoneList<HStoreNamedField*> stores_; |
| 457 | }; |
| 458 | |
| 459 | |
| 460 | // The main routine of the analysis phase. Use the HFlowEngine for either a |
| 461 | // local or a global analysis. |
| 462 | void HLoadEliminationPhase::Run() { |
| 463 | HFlowEngine<HLoadEliminationTable, HLoadEliminationEffects> |
| 464 | engine(graph(), zone()); |
| 465 | HAliasAnalyzer aliasing; |
| 466 | HLoadEliminationTable* table = |
| 467 | new(zone()) HLoadEliminationTable(zone(), &aliasing); |
| 468 | |
| 469 | if (GLOBAL) { |
| 470 | // Perform a global analysis. |
| 471 | engine.AnalyzeDominatedBlocks(graph()->blocks()->at(0), table); |
| 472 | } else { |
| 473 | // Perform only local analysis. |
| 474 | for (int i = 0; i < graph()->blocks()->length(); i++) { |
| 475 | table->Kill(); |
| 476 | engine.AnalyzeOneBlock(graph()->blocks()->at(i), table); |
machenbach@chromium.org | 528ce02 | 2013-09-23 14:09:36 +0000 | [diff] [blame] | 477 | } |
| 478 | } |
| 479 | } |
| 480 | |
machenbach@chromium.org | 528ce02 | 2013-09-23 14:09:36 +0000 | [diff] [blame] | 481 | } } // namespace v8::internal |