27 struct HCheckTableEntry {  struct
179       HCheckTableEntry* old_entry = &entries_[i];  in Copy()
181       HCheckTableEntry* new_entry = &copy->entries_[i];  in Copy()
207         HCheckTableEntry* pred_entry = copy->Find(phi_operand);  in Copy()
224         HCheckTableEntry* entry = copy->Find(object);  in Copy()
226           HCheckTableEntry::State state = cmp->map_is_stable()  in Copy()
227               ? HCheckTableEntry::CHECKED_STABLE  in Copy()
228               : HCheckTableEntry::CHECKED;  in Copy()
244             DCHECK_NE(HCheckTableEntry::UNCHECKED_STABLE, entry->state_);  in Copy()
254         HCheckTableEntry* le = copy->Find(left);  in Copy()
255         HCheckTableEntry* re = copy->Find(right);  in Copy()
266           le->state_ = re->state_ = HCheckTableEntry::StateMerge(  in Copy()
268           DCHECK_NE(HCheckTableEntry::UNCHECKED_STABLE, le->state_);  in Copy()
269           DCHECK_NE(HCheckTableEntry::UNCHECKED_STABLE, re->state_);  in Copy()
275         HCheckTableEntry* entry = copy->Find(object);  in Copy()
280                          HCheckTableEntry::CHECKED);  in Copy()
284             DCHECK_NE(HCheckTableEntry::UNCHECKED_STABLE, entry->state_);  in Copy()
291             DCHECK_NE(HCheckTableEntry::UNCHECKED_STABLE, entry->state_);  in Copy()
320         HCheckTableEntry* this_entry = &entries_[i];  in Merge()
321         HCheckTableEntry* that_entry;  in Merge()
333             (that_entry->state_ == HCheckTableEntry::CHECKED &&  in Merge()
334              this_entry->state_ == HCheckTableEntry::UNCHECKED_STABLE) ||  in Merge()
335             (this_entry->state_ == HCheckTableEntry::CHECKED &&  in Merge()
336              that_entry->state_ == HCheckTableEntry::UNCHECKED_STABLE)) {  in Merge()
342           this_entry->state_ = HCheckTableEntry::StateMerge(  in Merge()
363     HCheckTableEntry* entry = Find(object);  in ReduceCheckMaps()
370           DCHECK_NE(HCheckTableEntry::UNCHECKED_STABLE, entry->state_);  in ReduceCheckMaps()
375         } else if (entry->state_ == HCheckTableEntry::UNCHECKED_STABLE) {  in ReduceCheckMaps()
381           entry->state_ = HCheckTableEntry::CHECKED_STABLE;  in ReduceCheckMaps()
405             entry->state_ == HCheckTableEntry::UNCHECKED_STABLE) {  in ReduceCheckMaps()
406           entry->state_ = HCheckTableEntry::CHECKED_STABLE;  in ReduceCheckMaps()
440       HCheckTableEntry::State state = instr->maps_are_stable()  in ReduceCheckMaps()
441           ? HCheckTableEntry::CHECKED_STABLE  in ReduceCheckMaps()
442           : HCheckTableEntry::CHECKED;  in ReduceCheckMaps()
450     HCheckTableEntry* entry = Find(value);  in ReduceCheckInstanceType()
453         Insert(value, NULL, string_maps(), HCheckTableEntry::CHECKED);  in ReduceCheckInstanceType()
486       if (entry->state_ == HCheckTableEntry::UNCHECKED_STABLE) {  in ReduceCheckInstanceType()
487         entry->state_ = HCheckTableEntry::CHECKED_STABLE;  in ReduceCheckInstanceType()
499         Insert(instr, NULL, maps, HCheckTableEntry::UNCHECKED_STABLE);  in ReduceLoadNamedField()
505     HCheckTableEntry* entry = Find(object);  in ReduceLoadNamedField()
510     bool map_is_stable = (entry->state_ != HCheckTableEntry::CHECKED);  in ReduceLoadNamedField()
532       HCheckTableEntry::State state = c_transition->HasStableMapValue()  in ReduceStoreNamedField()
533           ? HCheckTableEntry::CHECKED_STABLE  in ReduceStoreNamedField()
534           : HCheckTableEntry::CHECKED;  in ReduceStoreNamedField()
541       HCheckTableEntry::State state = c_value->HasStableMapValue()  in ReduceStoreNamedField()
542           ? HCheckTableEntry::CHECKED_STABLE  in ReduceStoreNamedField()
543           : HCheckTableEntry::CHECKED;  in ReduceStoreNamedField()
552     HCheckTableEntry* entry = Find(instr->value()->ActualValue());  in ReduceCompareMap()
583     HCheckTableEntry* le = Find(left);  in ReduceCompareObjectEqAndBranch()
586     HCheckTableEntry* re = Find(right);  in ReduceCompareObjectEqAndBranch()
607     HCheckTableEntry* entry = Find(value);  in ReduceIsStringAndBranch()
629     HCheckTableEntry* entry = Find(object);  in ReduceTransitionElementsKind()
641       HCheckTableEntry::State state =  in ReduceTransitionElementsKind()
642           (entry->state_ == HCheckTableEntry::CHECKED_STABLE &&  in ReduceTransitionElementsKind()
644               ? HCheckTableEntry::CHECKED_STABLE  in ReduceTransitionElementsKind()
645               : HCheckTableEntry::CHECKED;  in ReduceTransitionElementsKind()
655   void EnsureChecked(HCheckTableEntry* entry,  in EnsureChecked()
658     if (entry->state_ != HCheckTableEntry::UNCHECKED_STABLE) return;  in EnsureChecked()
663     entry->state_ = HCheckTableEntry::CHECKED_STABLE;  in EnsureChecked()
677       HCheckTableEntry* entry = &entries_[i];  in KillUnstableEntries()
679       if (entry->state_ == HCheckTableEntry::CHECKED) {  in KillUnstableEntries()
684         entry->state_ = HCheckTableEntry::UNCHECKED_STABLE;  in KillUnstableEntries()
695       HCheckTableEntry* entry = &entries_[i];  in Kill()
726       HCheckTableEntry tmp_entries[kMaxTrackedObjects];  in Compact()
730       MemMove(&tmp_entries[0], &entries_[0], L * sizeof(HCheckTableEntry));  in Compact()
731       MemMove(&entries_[0], &entries_[L], R * sizeof(HCheckTableEntry));  in Compact()
732       MemMove(&entries_[R], &tmp_entries[0], L * sizeof(HCheckTableEntry));  in Compact()
745       HCheckTableEntry* entry = &table->entries_[i];  in Print()
754              HCheckTableEntry::State2String(entry->state_));  in Print()
763   HCheckTableEntry* Find(HValue* object) {  in Find()
766       HCheckTableEntry* entry = &entries_[i];  in Find()
776               HCheckTableEntry::State state) {  in Insert()
783               HCheckTableEntry::State state) {  in Insert()
784     DCHECK(state != HCheckTableEntry::UNCHECKED_STABLE || check == NULL);  in Insert()
785     HCheckTableEntry* entry = &entries_[cursor_++];  in Insert()
802   HCheckTableEntry entries_[kMaxTrackedObjects];