Lines Matching refs:maps_
67 MapSet maps_; // The set of known maps for the object.
180 ASSERT(old_entry->maps_->size() > 0);
183 new_entry->maps_ = old_entry->maps_;
210 copy->Insert(phi, NULL, pred_entry->maps_, pred_entry->state_);
233 entry->maps_ = new(zone) UniqueSet<Map>(cmp->map(), zone);
241 UniqueSet<Map>* maps = entry->maps_->Copy(zone);
243 entry->maps_ = maps;
258 copy->Insert(left, NULL, re->maps_, re->state_);
261 copy->Insert(right, NULL, le->maps_, le->state_);
265 le->maps_ = re->maps_ = le->maps_->Intersect(re->maps_, zone);
283 entry->maps_ = entry->maps_->Intersect(string_maps(), zone);
290 entry->maps_ = entry->maps_->Subtract(string_maps(), zone);
340 this_entry->maps_ =
341 this_entry->maps_->Union(that_entry->maps_, zone);
347 ASSERT(this_entry->maps_->size() > 0);
367 if (entry->maps_->IsSubset(instr->maps())) {
379 instr->set_maps(entry->maps_->Copy(graph->zone()));
394 entry->maps_, graph->zone());
402 entry->maps_ = intersection;
458 entry->maps_->size(), zone());
459 for (int i = 0; i < entry->maps_->size(); ++i) {
461 Unique<Map> map = entry->maps_->at(i);
478 if (maps->size() == entry->maps_->size()) {
485 entry->maps_ = maps;
506 if (entry == NULL || entry->maps_->size() != 1) return; // Not a constant.
509 Unique<Map> map = entry->maps_->at(0);
558 if (entry->maps_->Contains(instr->map())) {
559 if (entry->maps_->size() != 1) {
593 MapSet intersection = le->maps_->Intersect(re->maps_, zone());
611 if (entry->maps_->IsSubset(string_maps())) {
616 MapSet intersection = entry->maps_->Intersect(string_maps(), zone());
633 if (entry->maps_->Contains(instr->original_map())) {
635 UniqueSet<Map>* maps = entry->maps_->Copy(zone());
638 entry->maps_ = maps;
652 graph->zone(), value, entry->maps_->Copy(graph->zone()), true, instr);
743 MapSet list = entry->maps_;
779 entry->maps_ = maps;
