Lines Matching refs:TRANSITION
680 case TRANSITION:
966 case TRANSITION:
1530 PrintF(file, "elements transition [");
1984 // This method is used to transition to a field. If we are transitioning to a
2245 // An existing property or a map transition was found. Use set property to
2566 // Invalidates a transition target at |key|, and installs |new_descriptors| over
2572 int transition = transitions->Search(key);
2573 if (transition != TransitionArray::kNotFound) {
2574 transitions->GetTarget(transition)->DeprecateTransitionTree();
2609 // This can only be called on roots of transition trees.
2618 int transition = transitions->Search(name);
2619 if (transition == TransitionArray::kNotFound) break;
2620 current = transitions->GetTarget(transition);
2641 // This can only be called on roots of transition trees.
2650 int transition = transitions->Search(name);
2651 if (transition == TransitionArray::kNotFound) break;
2653 Map* next = transitions->GetTarget(transition);
2671 // This method rewrites the transition tree to reflect the new change. To avoid
2674 // (partial) version of the type in the transition tree.
2676 // - Search the root of the transition tree using FindRootMap.
2679 // walk the transition tree.
2686 // - Otherwise, invalidate the outdated transition target from |updated|, and
2687 // replace its transition tree with a new branch for the updated descriptors.
2696 // It's fine to transition from None to anything but double without any
3089 case TRANSITION:
3356 // Only remember the map transition if there is not an already existing
3357 // non-matching element transition.
3397 // A property or a map transition was found. We return all of these result
3883 // transition that matches the object. This achieves what is needed.
3921 // will be tagged since the transition is omitted.
4104 // transition or null descriptor and there are no setters in the prototypes.
4127 case TRANSITION:
4246 case TRANSITION: {
4393 case TRANSITION:
4624 case TRANSITION:
5496 // Do a map transition, other objects with this map may still
6149 // successfully reusing a map transition for a getter. Nevertheless, this is
6389 // If the transition target was not callbacks, fall back to the slow case.
6397 // Reuse transition if adding same accessor with same attributes.
6471 // If not, lookup a transition.
6474 // If there is a transition, try to follow it.
6485 // If there is no transition yet, add a transition to the a new accessor pair
6860 // Since this method is used to rewrite an existing transition tree, it can
7304 // To traverse the transition tree iteratively, we have to store two kinds of
7381 // Traverse the transition tree in postorder without using the C++ stack by
9356 // Clear a possible back pointer in case the transition leads to a dead map.
10267 // Resize the initial map and all maps in its transition tree.
11296 // Transition through the allocation site as well if present.
11583 // Don't cache prototype transition if this map is shared.
12218 // a transition to slow elements is necessary.
12937 // No change is needed to the elements() buffer, the transition
