Lines Matching full:maps
52 MapSet maps_; // The set of known maps for the object.
57 // set of known maps for each object.
105 // If the instruction changes maps uncontrollably, drop everything.
226 MapSet maps = FindMaps(object);
227 if (maps == NULL || maps->size() != 1) return; // Not a constant.
229 Unique<Map> map = maps->at(0);
242 MapSet maps = FindMaps(object);
243 if (maps != NULL) {
244 if (maps->Contains(map)) {
245 if (maps->size() == 1) {
251 maps->Clear();
252 maps->Add(map, phase_->zone());
263 // If the object has known maps, it's definitely a heap object.
281 // If the instruction changes maps, it should be handled above.
287 MapSet maps = FindMaps(instr->value()->ActualValue());
288 if (maps == NULL) return;
289 if (maps->Contains(instr->map())) {
290 if (maps->size() == 1) {
301 MapSet maps = FindMaps(instr->object()->ActualValue());
302 // Can only learn more about an object that already has a known set of maps.
303 if (maps == NULL) return;
304 if (maps->Contains(instr->original_map())) {
306 maps->Remove(instr->original_map());
307 maps->Add(instr->transitioned_map(), phase_->zone());
377 PrintF("%d maps { ", list->size());
408 void Insert(HValue* object, HCheckMaps* check, MapSet maps) {
412 entry->maps_ = maps;
474 // Kill maps for each store contained in these effects.
