Lines Matching defs:Transition
977 case LookupIterator::TRANSITION:
1013 case LookupIterator::TRANSITION:
1142 case LookupIterator::TRANSITION:
2788 os << "elements transition [" << ElementsKindToString(from_kind) << " -> "
3406 // In case of a regular transition.
3440 // This migration is a transition from a map that has run out of property
3463 // Set the new property value and do the map transition.
3581 // Transition from tagged to untagged slot.
3767 // Ensure that no transition was inserted for prototype migrations.
4092 // Generalize all fields and update the transition tree.
4147 Map* transition = TransitionArray::SearchTransition(
4150 if (transition == NULL) return nullptr;
4151 new_map = transition;
4309 case LookupIterator::TRANSITION:
4428 case LookupIterator::TRANSITION:
4574 DCHECK_EQ(LookupIterator::TRANSITION, it->state());
4777 Map* transition = nullptr;
4784 // Starting from the next existing elements kind transition try to
4796 transition = current;
4801 return transition;
4806 // Ensure we are requested to search elements kind transition "near the root".
4917 // Check if we can go back in the elements kind transition chain.
5386 case LookupIterator::TRANSITION:
5499 case LookupIterator::TRANSITION:
5974 case LookupIterator::TRANSITION:
7503 // Do a map transition, other objects with this map may still
7677 Map* transition =
7679 if (transition != NULL) {
7680 Handle<Map> transition_map(transition, isolate);
8603 // Never even try to cache it in the transition tree, as it is intended
8605 // memory on the map transition tree.
8732 Map::TraceTransition("Transition", map, target, key);
8759 Map::TraceTransition("Transition", *parent, *child, *name);
8806 // Creates transition tree starting from |split_map| and adding all descriptors
8829 // invariant since the last map is not yet connected to the transition tree
8846 // Since this method is used to rewrite an existing transition tree, it can
8892 // Ensure we are requested to add elements kind transition "near the root".
9147 Handle<Map> transition(maybe_transition);
9148 int descriptor = transition->LastAdded();
9150 DCHECK_EQ(attributes, transition->instance_descriptors()
9154 return UpdateDescriptorForValue(transition, descriptor, constness, value);
9195 // There is no benefit from reconstructing transition tree for maps without
9244 Handle<Map> transition(maybe_transition, isolate);
9245 DescriptorArray* descriptors = transition->instance_descriptors();
9246 int descriptor = transition->LastAdded();
9262 return transition;
9592 // Check if we need to transition from linear to hash table storage.
12082 // Resize the initial map and all maps in its transition tree.
12474 // Optimize as prototype to detach it from its transition tree.
15008 return "transition";
15020 return "allocation-site-transition-changed";
15592 // No change is needed to the elements() buffer, the transition
18550 void OrderedHashTableIterator<Derived, TableType>::Transition() {
18588 Transition();
18634 OrderedHashTableIterator<JSSetIterator, OrderedHashSet>::Transition();
18651 OrderedHashTableIterator<JSMapIterator, OrderedHashMap>::Transition();
19388 // TODO(dcarney): double->smi and smi->double transition from kConstant
19408 // Only allow a cell to transition once into constant state.
