#include <transitions.h>

Inheritance diagram for v8::internal::TransitionArray:

Collaboration diagram for v8::internal::TransitionArray:

Public Member Functions
Name *	GetKey (int transition_number)

void	SetKey (int transition_number, Name *value)

Object **	GetKeySlot (int transition_number)

int	GetSortedKeyIndex (int transition_number)

Name *	GetSortedKey (int transition_number)

Map *	GetTarget (int transition_number)

void	SetTarget (int transition_number, Map *target)

PropertyDetails	GetTargetDetails (int transition_number)

bool	HasElementsTransition ()

Object *	back_pointer_storage ()

void	set_back_pointer_storage (Object *back_pointer, WriteBarrierMode mode=UPDATE_WRITE_BARRIER)

FixedArray *	GetPrototypeTransitions ()

void	SetPrototypeTransitions (FixedArray *prototype_transitions, WriteBarrierMode mode=UPDATE_WRITE_BARRIER)

Object **	GetPrototypeTransitionsSlot ()

bool	HasPrototypeTransitions ()

int	number_of_transitions ()

int	number_of_entries ()

int	Search (Name *name)

bool	IsSimpleTransition ()

bool	IsFullTransitionArray ()

	STATIC_ASSERT (kSimpleTransitionIndex !=kNotFound)

Public Member Functions inherited from v8::internal::FixedArray
Object *	get (int index)

void	set (int index, Object *value)

bool	is_the_hole (int index)

void	set (int index, Smi *value)

void	set (int index, Object *value, WriteBarrierMode mode)

void	set_undefined (int index)

void	set_null (int index)

void	set_the_hole (int index)

Object **	GetFirstElementAddress ()

bool	ContainsOnlySmisOrHoles ()

Object **	data_start ()

void	FillWithHoles (int from, int to)

void	Shrink (int length)

void	CopyTo (int pos, FixedArray *dest, int dest_pos, int len)

Object **	RawFieldOfElementAt (int index)

void	SwapPairs (FixedArray *numbers, int i, int j)

void	SortPairs (FixedArray *numbers, uint32_t len)

Public Member Functions inherited from v8::internal::FixedArrayBase
int	length () const

void	set_length (int value)

int	synchronized_length () const

void	synchronized_set_length (int value)

Public Member Functions inherited from v8::internal::HeapObject
Map *	map () const

void	set_map (Map *value)

void	set_map_no_write_barrier (Map *value)

Map *	synchronized_map ()

MapWord	synchronized_map_word () const

void	synchronized_set_map (Map *value)

void	synchronized_set_map_no_write_barrier (Map *value)

void	synchronized_set_map_word (MapWord map_word)

MapWord	map_word () const

void	set_map_word (MapWord map_word)

Heap *	GetHeap () const

Isolate *	GetIsolate () const

Address	address ()

void	Iterate (ObjectVisitor *v)

void	IterateBody (InstanceType type, int object_size, ObjectVisitor *v)

int	Size ()

bool	MayContainRawValues ()

int	SizeFromMap (Map *map)

WriteBarrierMode	GetWriteBarrierMode (const DisallowHeapAllocation &promise)

void	HeapObjectShortPrint (OStream &os)

	STATIC_ASSERT (kMapOffset==Internals::kHeapObjectMapOffset)

Public Member Functions inherited from v8::internal::Object
bool	IsObject () const

	INLINE (bool IsFixedArrayBase() const)

	INLINE (bool IsExternal() const)

	INLINE (bool IsAccessorInfo() const)

	INLINE (bool IsStruct() const)

	INLINE (bool IsSpecObject()) const

	INLINE (bool IsSpecFunction()) const

	INLINE (bool IsTemplateInfo()) const

	INLINE (bool IsNameDictionary() const)

	INLINE (bool IsSeededNumberDictionary() const)

	INLINE (bool IsUnseededNumberDictionary() const)

	INLINE (bool IsOrderedHashSet() const)

	INLINE (bool IsOrderedHashMap() const)

bool	IsCallable () const

	INLINE (bool IsUndefined() const)

	INLINE (bool IsNull() const)

	INLINE (bool IsTheHole() const)

	INLINE (bool IsException() const)

	INLINE (bool IsUninitialized() const)

	INLINE (bool IsTrue() const)

	INLINE (bool IsFalse() const)

	INLINE (bool IsArgumentsMarker() const)

	INLINE (bool IsFiller() const)

double	Number ()

	INLINE (bool IsNaN() const)

	INLINE (bool IsMinusZero() const)

bool	ToInt32 (int32_t *value)

bool	ToUint32 (uint32_t *value)

Representation	OptimalRepresentation ()

bool	FitsRepresentation (Representation representation)

Handle< HeapType >	OptimalType (Isolate *isolate, Representation representation)

bool	HasValidElements ()

bool	HasSpecificClassOf (String *name)

bool	BooleanValue ()

Object *	GetHash ()

bool	SameValue (Object *other)

bool	SameValueZero (Object *other)

bool	ToArrayIndex (uint32_t *index)

bool	IsStringObjectWithCharacterAt (uint32_t index)

void	VerifyApiCallResultType ()

void	ShortPrint (FILE *out=stdout)

void	ShortPrint (StringStream *accumulator)

Static Public Member Functions
static Handle< TransitionArray >	ExtendToFullTransitionArray (Handle< Map > containing_map)

static Handle< TransitionArray >	CopyInsert (Handle< Map > map, Handle< Name > name, Handle< Map > target, SimpleTransitionFlag flag)

static Handle< TransitionArray >	Allocate (Isolate *isolate, int number_of_transitions)

static TransitionArray *	cast (Object *obj)

Static Public Member Functions inherited from v8::internal::FixedArray
static Handle< Object >	get (Handle< FixedArray > array, int index)

static Handle< FixedArray >	CopySize (Handle< FixedArray > array, int new_length, PretenureFlag pretenure=NOT_TENURED)

static MUST_USE_RESULT MaybeHandle< FixedArray >	AddKeysFromArrayLike (Handle< FixedArray > content, Handle< JSObject > array)

static MUST_USE_RESULT MaybeHandle< FixedArray >	UnionOfKeys (Handle< FixedArray > first, Handle< FixedArray > second)

static int	SizeFor (int length)

static int	OffsetOfElementAt (int index)

Static Public Member Functions inherited from v8::internal::HeapObject
static HeapObject *	FromAddress (Address address)

static Object **	RawField (HeapObject *obj, int offset)

static void	UpdateMapCodeCache (Handle< HeapObject > object, Handle< Name > name, Handle< Code > code)

Static Public Member Functions inherited from v8::internal::Object
static Handle< Object >	NewStorageFor (Isolate *isolate, Handle< Object > object, Representation representation)

static Handle< Object >	WrapForRead (Isolate *isolate, Handle< Object > object, Representation representation)

static MaybeHandle< JSReceiver >	ToObject (Isolate *isolate, Handle< Object > object)

static MaybeHandle< JSReceiver >	ToObject (Isolate *isolate, Handle< Object > object, Handle< Context > context)

static MUST_USE_RESULT MaybeHandle< Smi >	ToSmi (Isolate *isolate, Handle< Object > object)

static MUST_USE_RESULT MaybeHandle< Object >	GetProperty (LookupIterator *it)

static MUST_USE_RESULT MaybeHandle< Object >	SetProperty (Handle< Object > object, Handle< Name > key, Handle< Object > value, StrictMode strict_mode, StoreFromKeyed store_mode=MAY_BE_STORE_FROM_KEYED)

static MUST_USE_RESULT MaybeHandle< Object >	SetProperty (LookupIterator *it, Handle< Object > value, StrictMode strict_mode, StoreFromKeyed store_mode, StorePropertyMode data_store_mode=NORMAL_PROPERTY)

static MUST_USE_RESULT MaybeHandle< Object >	WriteToReadOnlyProperty (LookupIterator *it, Handle< Object > value, StrictMode strict_mode)

static Handle< Object >	SetDataProperty (LookupIterator *it, Handle< Object > value)

static MUST_USE_RESULT MaybeHandle< Object >	AddDataProperty (LookupIterator *it, Handle< Object > value, PropertyAttributes attributes, StrictMode strict_mode, StoreFromKeyed store_mode)

static MUST_USE_RESULT MaybeHandle< Object >	GetPropertyOrElement (Handle< Object > object, Handle< Name > key)

static MUST_USE_RESULT MaybeHandle< Object >	GetProperty (Isolate isolate, Handle< Object > object, const char key)

static MUST_USE_RESULT MaybeHandle< Object >	GetProperty (Handle< Object > object, Handle< Name > key)

static MUST_USE_RESULT MaybeHandle< Object >	GetPropertyWithAccessor (Handle< Object > receiver, Handle< Name > name, Handle< JSObject > holder, Handle< Object > structure)

static MUST_USE_RESULT MaybeHandle< Object >	SetPropertyWithAccessor (Handle< Object > receiver, Handle< Name > name, Handle< Object > value, Handle< JSObject > holder, Handle< Object > structure, StrictMode strict_mode)

static MUST_USE_RESULT MaybeHandle< Object >	GetPropertyWithDefinedGetter (Handle< Object > receiver, Handle< JSReceiver > getter)

static MUST_USE_RESULT MaybeHandle< Object >	SetPropertyWithDefinedSetter (Handle< Object > receiver, Handle< JSReceiver > setter, Handle< Object > value)

static MUST_USE_RESULT MaybeHandle< Object >	GetElement (Isolate *isolate, Handle< Object > object, uint32_t index)

static MUST_USE_RESULT MaybeHandle< Object >	GetElementWithReceiver (Isolate *isolate, Handle< Object > object, Handle< Object > receiver, uint32_t index)

static Handle< Smi >	GetOrCreateHash (Isolate *isolate, Handle< Object > object)

Static Public Attributes
static const int	kNotFound = -1

static const int	kBackPointerStorageIndex = 0

static const int	kPrototypeTransitionsIndex = 1

static const int	kFirstIndex = 2

static const int	kSimpleTransitionTarget = 1

static const int	kSimpleTransitionSize = 2

static const int	kSimpleTransitionIndex = 0

static const int	kBackPointerStorageOffset = FixedArray::kHeaderSize

static const int	kPrototypeTransitionsOffset

static const int	kTransitionKey = 0

static const int	kTransitionTarget = 1

static const int	kTransitionSize = 2

static const int	kMaxNumberOfTransitions = 1024 + 512

Static Public Attributes inherited from v8::internal::FixedArray
static const int	kMaxSize = 128 * MB * kPointerSize

static const int	kMaxLength = (kMaxSize - kHeaderSize) / kPointerSize

Static Public Attributes inherited from v8::internal::FixedArrayBase
static const int	kLengthOffset = HeapObject::kHeaderSize

static const int	kHeaderSize = kLengthOffset + kPointerSize

Static Public Attributes inherited from v8::internal::HeapObject
static const int	kMapOffset = Object::kHeaderSize

static const int	kHeaderSize = kMapOffset + kPointerSize

Static Public Attributes inherited from v8::internal::Object
static const int	kHeaderSize = 0

Private Member Functions
void	NoIncrementalWriteBarrierSet (int transition_number, Name key, Map target)

void	NoIncrementalWriteBarrierCopyFrom (TransitionArray *origin, int origin_transition, int target_transition)

	DISALLOW_IMPLICIT_CONSTRUCTORS (TransitionArray)

Static Private Member Functions
static int	ToKeyIndex (int transition_number)

static int	ToTargetIndex (int transition_number)

static Handle< TransitionArray >	AllocateSimple (Isolate *isolate, Handle< Map > target)

static Handle< TransitionArray >	NewWith (Handle< Map > map, Handle< Name > name, Handle< Map > target, SimpleTransitionFlag flag)

Additional Inherited Members
Public Types inherited from v8::internal::Object
enum	StoreFromKeyed { MAY_BE_STORE_FROM_KEYED , CERTAINLY_NOT_STORE_FROM_KEYED }

enum	StorePropertyMode { NORMAL_PROPERTY , SUPER_PROPERTY }

Protected Member Functions inherited from v8::internal::HeapObject
void	IteratePointers (ObjectVisitor *v, int start, int end)

void	IteratePointer (ObjectVisitor *v, int offset)

void	IterateNextCodeLink (ObjectVisitor *v, int offset)

Static Protected Member Functions inherited from v8::internal::FixedArray
static void	NoWriteBarrierSet (FixedArray array, int index, Object value)

static void	NoIncrementalWriteBarrierSet (FixedArray array, int index, Object value)

Detailed Description

Definition at line 35 of file transitions.h.

Member Function Documentation

◆ Allocate()

Handle< TransitionArray > v8::internal::TransitionArray::Allocate	(	Isolate *	isolate,
		int	number_of_transitions
	)

static

Definition at line 15 of file transitions.cc.

                                                                              {
   Handle<FixedArray> array =
       isolate->factory()->NewFixedArray(ToKeyIndex(number_of_transitions));
   array->set(kPrototypeTransitionsIndex, Smi::FromInt(0));
   return Handle<TransitionArray>::cast(array);
 }

References v8::internal::Handle< T >::cast(), v8::internal::Isolate::factory(), v8::internal::Smi::FromInt(), kPrototypeTransitionsIndex, number_of_transitions(), and ToKeyIndex().

Referenced by CopyInsert(), v8::internal::EnsureHasTransitionArray(), ExtendToFullTransitionArray(), and NewWith().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ AllocateSimple()

Handle< TransitionArray > v8::internal::TransitionArray::AllocateSimple	(	Isolate *	isolate,
		Handle< Map >	target
	)

staticprivate

Definition at line 24 of file transitions.cc.

                                                                             {
   Handle<FixedArray> array =
       isolate->factory()->NewFixedArray(kSimpleTransitionSize);
   array->set(kSimpleTransitionTarget, *target);
   return Handle<TransitionArray>::cast(array);
 }

References v8::internal::Handle< T >::cast(), v8::internal::Isolate::factory(), kSimpleTransitionSize, and kSimpleTransitionTarget.

Referenced by NewWith().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ back_pointer_storage()

Object * v8::internal::TransitionArray::back_pointer_storage ( )

inline

Definition at line 41 of file transitions-inl.h.

                                               {
   return get(kBackPointerStorageIndex);
 }

References v8::internal::FixedArray::get(), and kBackPointerStorageIndex.

Referenced by CopyInsert(), v8::internal::V8HeapExplorer::ExtractMapReferences(), and v8::internal::Map::GetBackPointer().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ cast()

TransitionArray * v8::internal::TransitionArray::cast ( Object * obj )

inlinestatic

Definition at line 30 of file transitions-inl.h.

                                                      {
   DCHECK(object->IsTransitionArray());
   return reinterpret_cast<TransitionArray*>(object);
 }

References DCHECK.

Referenced by v8::internal::Map::GetBackPointer(), and v8::internal::Map::SetBackPointer().

Here is the caller graph for this function:

◆ CopyInsert()

Handle< TransitionArray > v8::internal::TransitionArray::CopyInsert	(	Handle< Map >	map,
		Handle< Name >	name,
		Handle< Map >	target,
		SimpleTransitionFlag	flag
	)

static

Definition at line 88 of file transitions.cc.

                                                                                {
   if (!map->HasTransitionArray()) {
     return TransitionArray::NewWith(map, name, target, flag);
   }
  
   int number_of_transitions = map->transitions()->number_of_transitions();
   int new_size = number_of_transitions;
  
   int insertion_index = map->transitions()->Search(*name);
   if (insertion_index == kNotFound) ++new_size;
  
   Handle<TransitionArray> result = Allocate(map->GetIsolate(), new_size);
  
   // The map's transition array may grown smaller during the allocation above as
   // it was weakly traversed, though it is guaranteed not to disappear. Trim the
   // result copy if needed, and recompute variables.
   DCHECK(map->HasTransitionArray());
   DisallowHeapAllocation no_gc;
   TransitionArray* array = map->transitions();
   if (array->number_of_transitions() != number_of_transitions) {
     DCHECK(array->number_of_transitions() < number_of_transitions);
  
     number_of_transitions = array->number_of_transitions();
     new_size = number_of_transitions;
  
     insertion_index = array->Search(*name);
     if (insertion_index == kNotFound) ++new_size;
  
     result->Shrink(ToKeyIndex(new_size));
   }
  
   if (array->HasPrototypeTransitions()) {
     result->SetPrototypeTransitions(array->GetPrototypeTransitions());
   }
  
   if (insertion_index != kNotFound) {
     for (int i = 0; i < number_of_transitions; ++i) {
       if (i != insertion_index) {
         result->NoIncrementalWriteBarrierCopyFrom(array, i, i);
       }
     }
     result->NoIncrementalWriteBarrierSet(insertion_index, *name, *target);
     result->set_back_pointer_storage(array->back_pointer_storage());
     return result;
   }
  
   insertion_index = 0;
   for (; insertion_index < number_of_transitions; ++insertion_index) {
     if (InsertionPointFound(array->GetKey(insertion_index), *name)) break;
     result->NoIncrementalWriteBarrierCopyFrom(
         array, insertion_index, insertion_index);
   }
  
   result->NoIncrementalWriteBarrierSet(insertion_index, *name, *target);
  
   for (; insertion_index < number_of_transitions; ++insertion_index) {
     result->NoIncrementalWriteBarrierCopyFrom(
         array, insertion_index, insertion_index + 1);
   }
  
   result->set_back_pointer_storage(array->back_pointer_storage());
   return result;
 }

References Allocate(), back_pointer_storage(), DCHECK, v8::internal::flag, v8::internal::HeapObject::GetIsolate(), GetKey(), GetPrototypeTransitions(), HasPrototypeTransitions(), v8::internal::Map::HasTransitionArray(), v8::internal::InsertionPointFound(), kNotFound, v8::internal::HeapObject::map(), name, NewWith(), number_of_transitions(), Search(), and ToKeyIndex().

Referenced by v8::internal::Map::ConnectTransition().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ DISALLOW_IMPLICIT_CONSTRUCTORS()

v8::internal::TransitionArray::DISALLOW_IMPLICIT_CONSTRUCTORS ( TransitionArray )

private

◆ ExtendToFullTransitionArray()

Handle< TransitionArray > v8::internal::TransitionArray::ExtendToFullTransitionArray ( Handle< Map > containing_map )

static

Definition at line 65 of file transitions.cc.

                                 {
   DCHECK(!containing_map->transitions()->IsFullTransitionArray());
   int nof = containing_map->transitions()->number_of_transitions();
  
   // A transition array may shrink during GC.
   Handle<TransitionArray> result = Allocate(containing_map->GetIsolate(), nof);
   DisallowHeapAllocation no_gc;
   int new_nof = containing_map->transitions()->number_of_transitions();
   if (new_nof != nof) {
     DCHECK(new_nof == 0);
     result->Shrink(ToKeyIndex(0));
   } else if (nof == 1) {
     result->NoIncrementalWriteBarrierCopyFrom(
         containing_map->transitions(), kSimpleTransitionIndex, 0);
   }
  
   result->set_back_pointer_storage(
       containing_map->transitions()->back_pointer_storage());
   return result;
 }

References Allocate(), DCHECK, kSimpleTransitionIndex, and ToKeyIndex().

Referenced by v8::internal::EnsureHasTransitionArray().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ GetKey()

Name * v8::internal::TransitionArray::GetKey ( int transition_number )

inline

Definition at line 92 of file transitions-inl.h.

                                                    {
   if (IsSimpleTransition()) {
     Map* target = GetTarget(kSimpleTransitionIndex);
     int descriptor = target->LastAdded();
     Name* key = target->instance_descriptors()->GetKey(descriptor);
     return key;
   }
   DCHECK(transition_number < number_of_transitions());
   return Name::cast(get(ToKeyIndex(transition_number)));
 }

References DCHECK, v8::internal::FixedArray::get(), GetTarget(), IsSimpleTransition(), kSimpleTransitionIndex, v8::internal::Map::LastAdded(), number_of_transitions(), and ToKeyIndex().

Referenced by v8::internal::MarkCompactCollector::ClearMapTransitions(), CopyInsert(), v8::internal::Map::ExpectedTransitionKey(), GetSortedKey(), NoIncrementalWriteBarrierCopyFrom(), and Search().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ GetKeySlot()

Object ** v8::internal::TransitionArray::GetKeySlot ( int transition_number )

inline

Definition at line 85 of file transitions-inl.h.

                                                           {
   DCHECK(!IsSimpleTransition());
   DCHECK(transition_number < number_of_transitions());
   return RawFieldOfElementAt(ToKeyIndex(transition_number));
 }

References DCHECK, IsSimpleTransition(), number_of_transitions(), v8::internal::FixedArray::RawFieldOfElementAt(), and ToKeyIndex().

Referenced by v8::internal::MarkCompactCollector::ClearMapTransitions(), and v8::internal::StaticMarkingVisitor< StaticVisitor >::MarkTransitionArray().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ GetPrototypeTransitions()

FixedArray * v8::internal::TransitionArray::GetPrototypeTransitions ( )

inline

Definition at line 61 of file transitions-inl.h.

                                                      {
   DCHECK(IsFullTransitionArray());
   Object* prototype_transitions = get(kPrototypeTransitionsIndex);
   return FixedArray::cast(prototype_transitions);
 }

References DCHECK, v8::internal::FixedArray::get(), IsFullTransitionArray(), and kPrototypeTransitionsIndex.

Referenced by v8::internal::TraversableMap::ChildIteratorNext(), CopyInsert(), and v8::internal::V8HeapExplorer::ExtractMapReferences().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ GetPrototypeTransitionsSlot()

Object ** v8::internal::TransitionArray::GetPrototypeTransitionsSlot ( )

inline

Definition at line 79 of file transitions-inl.h.

                                                       {
   return HeapObject::RawField(reinterpret_cast<HeapObject*>(this),
                               kPrototypeTransitionsOffset);
 }

References kPrototypeTransitionsOffset, and v8::internal::HeapObject::RawField().

Referenced by v8::internal::StaticMarkingVisitor< StaticVisitor >::MarkTransitionArray().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ GetSortedKey()

Name* v8::internal::TransitionArray::GetSortedKey ( int transition_number )

inline

Definition at line 43 of file transitions.h.

                                             {
     return GetKey(transition_number);
   }

References GetKey().

Here is the call graph for this function:

◆ GetSortedKeyIndex()

int v8::internal::TransitionArray::GetSortedKeyIndex ( int transition_number )

inline

Definition at line 41 of file transitions.h.

41 { return transition_number; }

◆ GetTarget()

Map * v8::internal::TransitionArray::GetTarget ( int transition_number )

inline

Definition at line 111 of file transitions-inl.h.

                                                      {
   if (IsSimpleTransition()) {
     DCHECK(transition_number == kSimpleTransitionIndex);
     return Map::cast(get(kSimpleTransitionTarget));
   }
   DCHECK(transition_number < number_of_transitions());
   return Map::cast(get(ToTargetIndex(transition_number)));
 }

References DCHECK, v8::internal::FixedArray::get(), IsSimpleTransition(), kSimpleTransitionIndex, kSimpleTransitionTarget, number_of_transitions(), and ToTargetIndex().

Referenced by v8::internal::MarkCompactCollector::ClearMapTransitions(), v8::internal::Map::DeprecateTarget(), v8::internal::Map::DeprecateTransitionTree(), v8::internal::Map::FindLastMatchMap(), v8::internal::Map::FindTransitionToField(), GetKey(), GetTargetDetails(), NoIncrementalWriteBarrierCopyFrom(), and v8::internal::Map::UpdateFieldType().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ GetTargetDetails()

PropertyDetails v8::internal::TransitionArray::GetTargetDetails ( int transition_number )

inline

Definition at line 131 of file transitions-inl.h.

                                                                        {
   Map* map = GetTarget(transition_number);
   return map->GetLastDescriptorDetails();
 }

References v8::internal::Map::GetLastDescriptorDetails(), GetTarget(), and v8::internal::HeapObject::map().

Referenced by v8::internal::Map::ExpectedTransitionKey(), and v8::internal::Map::FindTransitionToField().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ HasElementsTransition()

bool v8::internal::TransitionArray::HasElementsTransition ( )

inline

Definition at line 36 of file transitions-inl.h.

                                             {
   return Search(GetHeap()->elements_transition_symbol()) != kNotFound;
 }

References v8::internal::HeapObject::GetHeap(), kNotFound, and Search().

Here is the call graph for this function:

◆ HasPrototypeTransitions()

bool v8::internal::TransitionArray::HasPrototypeTransitions ( )

inline

Definition at line 55 of file transitions-inl.h.

                                               {
   return IsFullTransitionArray() &&
       get(kPrototypeTransitionsIndex) != Smi::FromInt(0);
 }

References v8::internal::Smi::FromInt(), v8::internal::FixedArray::get(), IsFullTransitionArray(), and kPrototypeTransitionsIndex.

Referenced by v8::internal::TraversableMap::ChildIteratorNext(), CopyInsert(), v8::internal::V8HeapExplorer::ExtractMapReferences(), and v8::internal::StaticMarkingVisitor< StaticVisitor >::MarkTransitionArray().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ IsFullTransitionArray()

bool v8::internal::TransitionArray::IsFullTransitionArray ( )

inline

Definition at line 107 of file transitions.h.

                                {
     return length() > kFirstIndex ||
         (length() == kFirstIndex && !IsSimpleTransition());
   }

References IsSimpleTransition(), kFirstIndex, and v8::internal::FixedArrayBase::length().

Referenced by GetPrototypeTransitions(), HasPrototypeTransitions(), and SetPrototypeTransitions().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ IsSimpleTransition()

bool v8::internal::TransitionArray::IsSimpleTransition ( )

inline

Definition at line 96 of file transitions.h.

                             {
     return length() == kSimpleTransitionSize &&
         get(kSimpleTransitionTarget)->IsHeapObject() &&
         // The IntrusivePrototypeTransitionIterator may have set the map of the
         // prototype transitions array to a smi. In that case, there are
         // prototype transitions, hence this transition array is a full
         // transition array.
         HeapObject::cast(get(kSimpleTransitionTarget))->map()->IsMap() &&
         get(kSimpleTransitionTarget)->IsMap();
   }

References v8::internal::FixedArray::get(), kSimpleTransitionSize, kSimpleTransitionTarget, and v8::internal::FixedArrayBase::length().

Referenced by v8::internal::MarkCompactCollector::ClearMapTransitions(), v8::internal::Map::ExpectedTransitionKey(), v8::internal::V8HeapExplorer::ExtractMapReferences(), GetKey(), GetKeySlot(), GetTarget(), IsFullTransitionArray(), v8::internal::StaticMarkingVisitor< StaticVisitor >::MarkTransitionArray(), number_of_transitions(), Search(), SetKey(), and SetTarget().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ NewWith()

Handle< TransitionArray > v8::internal::TransitionArray::NewWith	(	Handle< Map >	map,
		Handle< Name >	name,
		Handle< Map >	target,
		SimpleTransitionFlag	flag
	)

staticprivate

Definition at line 47 of file transitions.cc.

                                                                             {
   Handle<TransitionArray> result;
   Isolate* isolate = name->GetIsolate();
  
   if (flag == SIMPLE_TRANSITION) {
     result = AllocateSimple(isolate, target);
   } else {
     result = Allocate(isolate, 1);
     result->NoIncrementalWriteBarrierSet(0, *name, *target);
   }
   result->set_back_pointer_storage(map->GetBackPointer());
   return result;
 }

References Allocate(), AllocateSimple(), v8::internal::flag, v8::internal::Map::GetBackPointer(), v8::internal::HeapObject::map(), name, and v8::internal::SIMPLE_TRANSITION.

Referenced by CopyInsert().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ NoIncrementalWriteBarrierCopyFrom()

void v8::internal::TransitionArray::NoIncrementalWriteBarrierCopyFrom	(	TransitionArray *	origin,
		int	origin_transition,
		int	target_transition
	)

inlineprivate

Definition at line 33 of file transitions.cc.

                                                                                {
   NoIncrementalWriteBarrierSet(target_transition,
                                origin->GetKey(origin_transition),
                                origin->GetTarget(origin_transition));
 }

References GetKey(), GetTarget(), and NoIncrementalWriteBarrierSet().

Here is the call graph for this function:

◆ NoIncrementalWriteBarrierSet()

void v8::internal::TransitionArray::NoIncrementalWriteBarrierSet	(	int	transition_number,
		Name *	key,
		Map *	target
	)

inlineprivate

Definition at line 147 of file transitions-inl.h.

                                                                 {
   FixedArray::NoIncrementalWriteBarrierSet(
       this, ToKeyIndex(transition_number), key);
   FixedArray::NoIncrementalWriteBarrierSet(
       this, ToTargetIndex(transition_number), target);
 }

References v8::internal::FixedArray::NoIncrementalWriteBarrierSet(), ToKeyIndex(), and ToTargetIndex().

Referenced by NoIncrementalWriteBarrierCopyFrom().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ number_of_entries()

int v8::internal::TransitionArray::number_of_entries ( )

inline

Definition at line 73 of file transitions.h.

73 { return number_of_transitions(); }

References number_of_transitions().

Here is the call graph for this function:

◆ number_of_transitions()

int v8::internal::TransitionArray::number_of_transitions ( )

inline

Definition at line 67 of file transitions.h.

                               {
     if (IsSimpleTransition()) return 1;
     int len = length();
     return len <= kFirstIndex ? 0 : (len - kFirstIndex) / kTransitionSize;
   }

References IsSimpleTransition(), kFirstIndex, kTransitionSize, and v8::internal::FixedArrayBase::length().

Referenced by Allocate(), v8::internal::MarkCompactCollector::ClearMapTransitions(), CopyInsert(), v8::internal::Map::DeprecateTransitionTree(), GetKey(), GetKeySlot(), GetTarget(), v8::internal::StaticMarkingVisitor< StaticVisitor >::MarkTransitionArray(), number_of_entries(), SetKey(), SetTarget(), and v8::internal::Map::UpdateFieldType().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ Search()

int v8::internal::TransitionArray::Search ( Name * name )

inline

Definition at line 137 of file transitions-inl.h.

                                       {
   if (IsSimpleTransition()) {
     Name* key = GetKey(kSimpleTransitionIndex);
     if (key->Equals(name)) return kSimpleTransitionIndex;
     return kNotFound;
   }
   return internal::Search<ALL_ENTRIES>(this, name);
 }

References v8::internal::Name::Equals(), GetKey(), IsSimpleTransition(), kNotFound, kSimpleTransitionIndex, and name.

Referenced by CopyInsert(), v8::internal::Map::DeprecateTarget(), v8::internal::Map::FindLastMatchMap(), v8::internal::Map::FindTransitionToField(), and HasElementsTransition().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ set_back_pointer_storage()

void v8::internal::TransitionArray::set_back_pointer_storage	(	Object *	back_pointer,
		WriteBarrierMode	mode = `UPDATE_WRITE_BARRIER`
	)

inline

Definition at line 46 of file transitions-inl.h.

                                                                       {
   Heap* heap = GetHeap();
   WRITE_FIELD(this, kBackPointerStorageOffset, back_pointer);
   CONDITIONAL_WRITE_BARRIER(
       heap, this, kBackPointerStorageOffset, back_pointer, mode);
 }

References CONDITIONAL_WRITE_BARRIER, v8::internal::HeapObject::GetHeap(), kBackPointerStorageOffset, mode(), and WRITE_FIELD.

Referenced by v8::internal::Map::SetBackPointer().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ SetKey()

void v8::internal::TransitionArray::SetKey	(	int	transition_number,
		Name *	value
	)

inline

Definition at line 104 of file transitions-inl.h.

                                                              {
   DCHECK(!IsSimpleTransition());
   DCHECK(transition_number < number_of_transitions());
   set(ToKeyIndex(transition_number), key);
 }

References DCHECK, IsSimpleTransition(), number_of_transitions(), v8::internal::FixedArray::set(), and ToKeyIndex().

Referenced by v8::internal::MarkCompactCollector::ClearMapTransitions().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ SetPrototypeTransitions()

void v8::internal::TransitionArray::SetPrototypeTransitions	(	FixedArray *	prototype_transitions,
		WriteBarrierMode	mode = `UPDATE_WRITE_BARRIER`
	)

inline

Definition at line 68 of file transitions-inl.h.

                                                                      {
   DCHECK(IsFullTransitionArray());
   DCHECK(transitions->IsFixedArray());
   Heap* heap = GetHeap();
   WRITE_FIELD(this, kPrototypeTransitionsOffset, transitions);
   CONDITIONAL_WRITE_BARRIER(
       heap, this, kPrototypeTransitionsOffset, transitions, mode);
 }

References CONDITIONAL_WRITE_BARRIER, DCHECK, v8::internal::HeapObject::GetHeap(), IsFullTransitionArray(), kPrototypeTransitionsOffset, mode(), and WRITE_FIELD.

Here is the call graph for this function:

◆ SetTarget()

void v8::internal::TransitionArray::SetTarget	(	int	transition_number,
		Map *	target
	)

inline

Definition at line 121 of file transitions-inl.h.

                                                                  {
   if (IsSimpleTransition()) {
     DCHECK(transition_number == kSimpleTransitionIndex);
     return set(kSimpleTransitionTarget, value);
   }
   DCHECK(transition_number < number_of_transitions());
   set(ToTargetIndex(transition_number), value);
 }

References DCHECK, IsSimpleTransition(), kSimpleTransitionIndex, kSimpleTransitionTarget, number_of_transitions(), v8::internal::FixedArray::set(), and ToTargetIndex().

Referenced by v8::internal::MarkCompactCollector::ClearMapTransitions().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ STATIC_ASSERT()

v8::internal::TransitionArray::STATIC_ASSERT ( kSimpleTransitionIndex ! = kNotFound )

◆ ToKeyIndex()

static int v8::internal::TransitionArray::ToKeyIndex ( int transition_number )

inlinestaticprivate

Definition at line 158 of file transitions.h.

                                                {
     return kFirstIndex +
            (transition_number * kTransitionSize) +
            kTransitionKey;
   }

References kFirstIndex, kTransitionKey, and kTransitionSize.

Referenced by Allocate(), CopyInsert(), ExtendToFullTransitionArray(), GetKey(), GetKeySlot(), NoIncrementalWriteBarrierSet(), and SetKey().

Here is the caller graph for this function:

◆ ToTargetIndex()

static int v8::internal::TransitionArray::ToTargetIndex ( int transition_number )

inlinestaticprivate

Definition at line 164 of file transitions.h.

                                                   {
     return kFirstIndex +
            (transition_number * kTransitionSize) +
            kTransitionTarget;
   }

References kFirstIndex, kTransitionSize, and kTransitionTarget.

Referenced by GetTarget(), NoIncrementalWriteBarrierSet(), and SetTarget().

Here is the caller graph for this function:

Member Data Documentation

◆ kBackPointerStorageIndex

const int v8::internal::TransitionArray::kBackPointerStorageIndex = 0

static

Definition at line 118 of file transitions.h.

Referenced by back_pointer_storage().

◆ kBackPointerStorageOffset

const int v8::internal::TransitionArray::kBackPointerStorageOffset = FixedArray::kHeaderSize

static

Definition at line 130 of file transitions.h.

Referenced by set_back_pointer_storage().

◆ kFirstIndex

const int v8::internal::TransitionArray::kFirstIndex = 2

static

Definition at line 122 of file transitions.h.

Referenced by IsFullTransitionArray(), number_of_transitions(), ToKeyIndex(), and ToTargetIndex().

◆ kMaxNumberOfTransitions

const int v8::internal::TransitionArray::kMaxNumberOfTransitions = 1024 + 512

static

Definition at line 154 of file transitions.h.

◆ kNotFound

const int v8::internal::TransitionArray::kNotFound = -1

static

Definition at line 116 of file transitions.h.

◆ kPrototypeTransitionsIndex

const int v8::internal::TransitionArray::kPrototypeTransitionsIndex = 1

static

Definition at line 121 of file transitions.h.

Referenced by Allocate(), GetPrototypeTransitions(), and HasPrototypeTransitions().

◆ kPrototypeTransitionsOffset

const int v8::internal::TransitionArray::kPrototypeTransitionsOffset

static

Initial value:

= kBackPointerStorageOffset +

kPointerSize

v8::internal::kPointerSize

const int kPointerSize

Definition: globals.h:129

Definition at line 133 of file transitions.h.

Referenced by GetPrototypeTransitionsSlot(), and SetPrototypeTransitions().

◆ kSimpleTransitionIndex

const int v8::internal::TransitionArray::kSimpleTransitionIndex = 0

static

Definition at line 127 of file transitions.h.

Referenced by v8::internal::Map::ExpectedTransitionKey(), v8::internal::Map::ExpectedTransitionTarget(), ExtendToFullTransitionArray(), GetKey(), GetTarget(), Search(), and SetTarget().

◆ kSimpleTransitionSize

const int v8::internal::TransitionArray::kSimpleTransitionSize = 2

static

Definition at line 126 of file transitions.h.

Referenced by AllocateSimple(), and IsSimpleTransition().

◆ kSimpleTransitionTarget

const int v8::internal::TransitionArray::kSimpleTransitionTarget = 1

static

Definition at line 125 of file transitions.h.

Referenced by AllocateSimple(), GetTarget(), IsSimpleTransition(), and SetTarget().

◆ kTransitionKey

const int v8::internal::TransitionArray::kTransitionKey = 0

static

Definition at line 137 of file transitions.h.

Referenced by ToKeyIndex().

◆ kTransitionSize

const int v8::internal::TransitionArray::kTransitionSize = 2

static

Definition at line 139 of file transitions.h.

Referenced by v8::internal::Map::CanHaveMoreTransitions(), v8::internal::MarkCompactCollector::ClearMapTransitions(), number_of_transitions(), ToKeyIndex(), and ToTargetIndex().

◆ kTransitionTarget

const int v8::internal::TransitionArray::kTransitionTarget = 1

static

Definition at line 138 of file transitions.h.

Referenced by ToTargetIndex().

The documentation for this class was generated from the following files:

/mnt/V8SourceCode/src/transitions.h
/mnt/V8SourceCode/src/transitions-inl.h
/mnt/V8SourceCode/src/transitions.cc

Public Member Functions

Static Public Member Functions

Static Public Attributes

Private Member Functions

Static Private Member Functions

Additional Inherited Members

Detailed Description

Member Function Documentation

◆ Allocate()

◆ AllocateSimple()

◆ back_pointer_storage()

◆ cast()

◆ CopyInsert()

◆ DISALLOW_IMPLICIT_CONSTRUCTORS()

◆ ExtendToFullTransitionArray()

◆ GetKey()

◆ GetKeySlot()

◆ GetPrototypeTransitions()

◆ GetPrototypeTransitionsSlot()

◆ GetSortedKey()

◆ GetSortedKeyIndex()

◆ GetTarget()

◆ GetTargetDetails()

◆ HasElementsTransition()

◆ HasPrototypeTransitions()

◆ IsFullTransitionArray()

◆ IsSimpleTransition()

◆ NewWith()

◆ NoIncrementalWriteBarrierCopyFrom()

◆ NoIncrementalWriteBarrierSet()

◆ number_of_entries()

◆ number_of_transitions()

◆ Search()

◆ set_back_pointer_storage()

◆ SetKey()

◆ SetPrototypeTransitions()

◆ SetTarget()

◆ STATIC_ASSERT()

◆ ToKeyIndex()

◆ ToTargetIndex()

Member Data Documentation

◆ kBackPointerStorageIndex

◆ kBackPointerStorageOffset

◆ kFirstIndex

◆ kMaxNumberOfTransitions

◆ kNotFound

◆ kPrototypeTransitionsIndex

◆ kPrototypeTransitionsOffset

◆ kSimpleTransitionIndex

◆ kSimpleTransitionSize

◆ kSimpleTransitionTarget

◆ kTransitionKey

◆ kTransitionSize

◆ kTransitionTarget