Lines Matching defs:maps_
68 MapSet maps_; // The set of known maps for the object.
181 DCHECK(old_entry->maps_->size() > 0);
184 new_entry->maps_ = old_entry->maps_;
211 copy->Insert(phi, NULL, pred_entry->maps_, pred_entry->state_);
234 entry->maps_ = new(zone) UniqueSet<Map>(cmp->map(), zone);
242 UniqueSet<Map>* maps = entry->maps_->Copy(zone);
244 entry->maps_ = maps;
259 copy->Insert(left, NULL, re->maps_, re->state_);
262 copy->Insert(right, NULL, le->maps_, le->state_);
266 le->maps_ = re->maps_ = le->maps_->Intersect(re->maps_, zone);
284 entry->maps_ = entry->maps_->Intersect(string_maps(), zone);
291 entry->maps_ = entry->maps_->Subtract(string_maps(), zone);
341 this_entry->maps_ =
342 this_entry->maps_->Union(that_entry->maps_, zone);
348 DCHECK(this_entry->maps_->size() > 0);
368 if (entry->maps_->IsSubset(instr->maps())) {
380 instr->set_maps(entry->maps_->Copy(graph->zone()));
395 entry->maps_, graph->zone());
403 entry->maps_ = intersection;
459 entry->maps_->size(), zone());
460 for (int i = 0; i < entry->maps_->size(); ++i) {
462 Unique<Map> map = entry->maps_->at(i);
479 if (maps->size() == entry->maps_->size()) {
486 entry->maps_ = maps;
507 if (entry == NULL || entry->maps_->size() != 1) return; // Not a constant.
510 Unique<Map> map = entry->maps_->at(0);
559 if (entry->maps_->Contains(instr->map())) {
560 if (entry->maps_->size() != 1) {
594 MapSet intersection = le->maps_->Intersect(re->maps_, zone());
612 if (entry->maps_->IsSubset(string_maps())) {
617 MapSet intersection = entry->maps_->Intersect(string_maps(), zone());
637 if (entry->maps_->Contains(instr->original_map())) {
639 UniqueSet<Map>* maps = entry->maps_->Copy(zone());
662 graph->zone(), value, entry->maps_->Copy(graph->zone()), true, instr);
753 MapSet list = entry->maps_;
789 entry->maps_ = maps;
