Lines Matching refs:Transition
156 // Reserve enough space for IC transition state, the longest length is 17.
305 case LookupIterator::TRANSITION:
347 // would transition to.
1178 case LookupIterator::TRANSITION:
1205 case LookupIterator::TRANSITION:
1419 case LookupIterator::TRANSITION:
1529 case LookupIterator::TRANSITION:
1586 // monomorphic type. This benefits global arrays that only transition
1685 case LookupIterator::TRANSITION:
1840 Handle<Map> transition,
1842 int descriptor = transition->LastAdded();
1843 Handle<DescriptorArray> descriptors(transition->instance_descriptors());
1849 DCHECK(!transition->is_access_check_needed());
1859 Map::cast(transition->GetBackPointer())->unused_property_fields() == 0;
1861 FieldIndex index = FieldIndex::ForDescriptor(*transition, descriptor);
1868 bool is_nonexistent = holder->map() == transition->GetBackPointer();
1883 Handle<WeakCell> transition_cell = Map::WeakCellForMap(transition);
1923 case LookupIterator::TRANSITION: {
1930 TRACE_GENERIC_IC("transition from slow");
1935 Handle<Map> transition = lookup->transition_map();
1937 return StoreTransition(receiver_map(), holder, transition,
2050 case LookupIterator::TRANSITION: {
2160 // transition to a different GetNonTransitioningStoreMode IC that handles a
2741 MaybeHandle<Object> BinaryOpIC::Transition(
2876 isolate, ic.Transition(Handle<AllocationSite>::null(), left, right));
2890 ic.Transition(allocation_site, left, right));
2989 // Note: Although a no-op transition is semantically OK, it is hinting at a
2990 // bug somewhere in our state transition machinery.
