Lines Matching refs:transition
93 // Insert the original transition in index 0.
97 // Search for the correct index to insert the new transition.
113 // If the new transition will be inserted in index 0, move the original
114 // transition to index 1.
184 // The map's transition array may have shrunk during the allocation above as
250 int transition = transitions().SearchSpecial(name, concurrent_access_);
251 if (transition == kNotFound) return Map();
252 return transitions().GetTarget(transition);
389 // Don't cache prototype transition if this map is either shared, or a map of
614 // This function only handles full transition arrays.
638 // Private non-static helper functions (operating on full transition arrays).
640 int TransitionArray::SearchDetails(int transition, PropertyKind kind,
644 DCHECK(transition < nof_transitions);
645 Name key = GetKey(transition);
646 for (; transition < nof_transitions && GetKey(transition) == key;
647 transition++) {
648 Map target = GetTarget(transition);
655 return transition;
660 if (out_insertion_index != nullptr) *out_insertion_index = transition;
664 Map TransitionArray::SearchDetailsAndGetTarget(int transition,
668 DCHECK(transition < nof_transitions);
669 Name key = GetKey(transition);
670 for (; transition < nof_transitions && GetKey(transition) == key;
671 transition++) {
672 Map target = GetTarget(transition);
690 int transition = SearchName(name, false, out_insertion_index);
691 if (transition == kNotFound) return kNotFound;
692 return SearchDetails(transition, kind, attributes, out_insertion_index);
697 int transition = SearchName(name);
698 if (transition == kNotFound) {
701 return SearchDetailsAndGetTarget(transition, kind, attributes);
706 int transition = SearchName(name);
707 if (transition == kNotFound) return;
710 DCHECK(transition < nof_transitions);
711 Name key = GetKey(transition);
712 for (; transition < nof_transitions && GetKey(transition) == key;
713 transition++) {
714 Map target = GetTarget(transition);