Lines Matching refs:transition
727 Map transition =
731 if (transition.is_null()) return Map();
732 new_map = transition;
902 Map transition;
909 // Starting from the next existing elements kind transition try to
927 transition = current;
932 return transition;
939 // Ensure we are requested to search elements kind transition "near the root".
1004 // Check if we can go back in the elements kind transition chain.
1286 // Never even try to cache it in the transition tree, as it is intended
1288 // memory on the map transition tree.
1476 // Creates transition tree starting from |split_map| and adding all descriptors
1502 // invariant since the last map is not yet connected to the transition tree
1520 // Since this method is used to rewrite an existing transition tree, it can
1553 // Ensure we are requested to add elements kind transition "near the root".
1838 Handle<Map> transition;
1839 if (maybe_transition.ToHandle(&transition)) {
1840 InternalIndex descriptor = transition->LastAdded();
1842 DCHECK_EQ(attributes, transition->instance_descriptors(isolate)
1846 return UpdateDescriptorForValue(isolate, transition, descriptor, constness,
1932 Handle<Map> transition;
1933 if (maybe_transition.ToHandle(&transition)) {
1934 DescriptorArray descriptors = transition->instance_descriptors(isolate);
1935 InternalIndex last_descriptor = transition->LastAdded();
1955 return transition;