Lines Matching refs:Transition
747 case LookupIterator::TRANSITION:
785 case LookupIterator::TRANSITION:
926 case LookupIterator::TRANSITION:
2063 os << "elements transition [" << ElementsKindToString(from_kind) << " -> "
2817 // Ensure that no transition was inserted for prototype migrations.
2897 // This migration is a transition from a map that has run out of property
2919 // Set the new property value and do the map transition.
3178 // This can only be called on roots of transition trees.
3356 // This method rewrites or completes the transition tree to reflect the new
3359 // any potential new (partial) version of the type in the transition tree.
3361 // - Search the root of the transition tree using FindRootMap.
3365 // |new_attributes|) to walk the transition tree.
3375 // - Otherwise, invalidate the outdated transition target from |target_map|, and
3376 // replace its transition tree with a new branch for the updated descriptors.
3392 // attributes stays unchanged) it's fine to transition from None to anything
3499 Map* transition = TransitionArray::SearchTransition(
3501 if (transition == NULL) break;
3502 Handle<Map> tmp_map(transition, isolate);
3581 // Find the last compatible target map in the transition tree.
3593 Map* transition = TransitionArray::SearchTransition(
3595 if (transition == NULL) break;
3596 Handle<Map> tmp_map(transition, isolate);
3829 // Invalidate a transition target at |key|.
3837 // If |maybe_transition| is not NULL then the transition array already
3838 // contains entry for given descriptor. This means that the transition
3877 // Deprecated part of the transition tree is no longer reachable, so replace
3928 Map* transition = TransitionArray::SearchTransition(
3931 if (transition == NULL) return MaybeHandle<Map>();
3932 new_map = transition;
4133 case LookupIterator::TRANSITION:
4246 case LookupIterator::TRANSITION:
4481 DCHECK_EQ(LookupIterator::TRANSITION, it->state());
4669 Map* transition = nullptr;
4676 transition = current;
4681 return transition == nullptr ? Handle<Map>() : handle(transition);
4796 // Check if we can go back in the elements kind transition chain.
5239 case LookupIterator::TRANSITION:
5453 case LookupIterator::TRANSITION:
6253 case LookupIterator::TRANSITION:
7739 // Do a map transition, other objects with this map may still
7900 Map* transition =
7902 if (transition != NULL) {
7903 Handle<Map> transition_map(transition, isolate);
7975 Map* transition = TransitionArray::SearchSpecial(
7977 if (transition != NULL) {
7978 new_map = handle(transition, isolate);
9095 case LookupIterator::TRANSITION:
9401 Map::TraceTransition("Transition", map, target, key);
9428 Map::TraceTransition("Transition", *parent, *child, *name);
9481 // Creates transition tree starting from |split_map| and adding all descriptors
9504 // invariant since the last map is not yet connected to the transition tree
9521 // Since this method is used to rewrite an existing transition tree, it can
9828 Handle<Map> transition(maybe_transition);
9829 int descriptor = transition->LastAdded();
9831 DCHECK_EQ(attributes, transition->instance_descriptors()
9835 return Map::PrepareForDataProperty(transition, descriptor, value);
9876 // There is no benefit from reconstructing transition tree for maps without
9915 Handle<Map> transition(maybe_transition, isolate);
9916 DescriptorArray* descriptors = transition->instance_descriptors();
9917 int descriptor = transition->LastAdded();
9933 return transition;
12582 // Resize the initial map and all maps in its transition tree.
12915 // Optimize as prototype to detach it from its transition tree.
15446 return "transition";
15458 return "allocation-site-transition-changed";
16069 // No change is needed to the elements() buffer, the transition
18873 void OrderedHashTableIterator<Derived, TableType>::Transition() {
18910 Transition();
18956 OrderedHashTableIterator<JSSetIterator, OrderedHashSet>::Transition();
18973 OrderedHashTableIterator<JSMapIterator, OrderedHashMap>::Transition();
19647 // TODO(dcarney): double->smi and smi->double transition from kConstant
19666 // Only allow a cell to transition once into constant state.
