#include <objects.h>

Inheritance diagram for v8::internal::Dictionary< Derived, Shape, Key >:

Collaboration diagram for v8::internal::Dictionary< Derived, Shape, Key >:

Public Types
enum	SortMode { UNSORTED , SORTED }

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 }

Public Member Functions
Object *	ValueAt (int entry)

void	ValueAtPut (int entry, Object *value)

PropertyDetails	DetailsAt (int entry)

void	DetailsAtPut (int entry, PropertyDetails value)

void	CopyValuesTo (FixedArray *elements)

int	NumberOfElementsFilterAttributes (PropertyAttributes filter)

int	NumberOfEnumElements ()

void	CopyKeysTo (FixedArray *storage, PropertyAttributes filter, SortMode sort_mode)

void	CopyKeysTo (FixedArray *storage, int index, PropertyAttributes filter, SortMode sort_mode)

void	SetNextEnumerationIndex (int index)

int	NextEnumerationIndex ()

Object *	SlowReverseLookup (Object *value)

void	SetEntry (int entry, Handle< Object > key, Handle< Object > value)

void	SetEntry (int entry, Handle< Object > key, Handle< Object > value, PropertyDetails details)

Public Member Functions inherited from v8::internal::HashTable< Derived, Shape, Key >
uint32_t	Hash (Key key)

uint32_t	HashForObject (Key key, Object *object)

int	NumberOfElements ()

int	NumberOfDeletedElements ()

int	Capacity ()

void	ElementAdded ()

void	ElementRemoved ()

void	ElementsRemoved (int n)

Object *	KeyAt (int entry)

bool	IsKey (Object *k)

void	IteratePrefix (ObjectVisitor *visitor)

void	IterateElements (ObjectVisitor *visitor)

	INLINE (static uint32_t GetProbeOffset(uint32_t n))

int	FindEntry (Key key)

int	FindEntry (Isolate *isolate, Key key)

void	Rehash (Key key)

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< Object >	DeleteProperty (Handle< Derived > dictionary, int entry, JSObject::DeleteMode mode)

static MUST_USE_RESULT Handle< Derived >	Shrink (Handle< Derived > dictionary, Key key)

static MUST_USE_RESULT Handle< Derived >	New (Isolate *isolate, int at_least_space_for, PretenureFlag pretenure=NOT_TENURED)

static Handle< Derived >	EnsureCapacity (Handle< Derived > obj, int n, Key key)

static MUST_USE_RESULT Handle< Derived >	Add (Handle< Derived > dictionary, Key key, Handle< Object > value, PropertyDetails details)

Static Public Member Functions inherited from v8::internal::HashTable< Derived, Shape, Key >
static MUST_USE_RESULT Handle< Derived >	New (Isolate *isolate, int at_least_space_for, MinimumCapacity capacity_option=USE_DEFAULT_MINIMUM_CAPACITY, PretenureFlag pretenure=NOT_TENURED)

static int	ComputeCapacity (int at_least_space_for)

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)

Protected Types
typedef HashTable< Derived, Shape, Key >	DerivedHashTable

Static Protected Member Functions
static MUST_USE_RESULT Handle< Derived >	AtPut (Handle< Derived > dictionary, Key key, Handle< Object > value)

static void	AddEntry (Handle< Derived > dictionary, Key key, Handle< Object > value, PropertyDetails details, uint32_t hash)

static void	GenerateNewEnumerationIndices (Handle< Derived > dictionary)

Static Protected Member Functions inherited from v8::internal::HashTable< Derived, Shape, Key >
static int	EntryToIndex (int entry)

static uint32_t	GetProbe (uint32_t hash, uint32_t number, uint32_t size)

static uint32_t	FirstProbe (uint32_t hash, uint32_t size)

static uint32_t	NextProbe (uint32_t last, uint32_t number, uint32_t size)

static MUST_USE_RESULT Handle< Derived >	Shrink (Handle< Derived > table, Key key)

static MUST_USE_RESULT Handle< Derived >	EnsureCapacity (Handle< Derived > table, int n, Key key, PretenureFlag pretenure=NOT_TENURED)

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)

Static Protected Attributes
static const int	kMaxNumberKeyIndex = DerivedHashTable::kPrefixStartIndex

static const int	kNextEnumerationIndexIndex = kMaxNumberKeyIndex + 1

Additional Inherited Members
Static Public Attributes inherited from v8::internal::HashTable< Derived, Shape, Key >
static const int	kNumberOfElementsIndex = 0

static const int	kNumberOfDeletedElementsIndex = 1

static const int	kCapacityIndex = 2

static const int	kPrefixStartIndex = 3

static const int	kElementsStartIndex

static const int	kEntrySize = Shape::kEntrySize

static const int	kElementsStartOffset

static const int	kCapacityOffset

static const int	kNotFound = -1

static const int	kMaxCapacity

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

Protected Member Functions inherited from v8::internal::HashTable< Derived, Shape, Key >
uint32_t	FindInsertionEntry (uint32_t hash)

void	SetNumberOfElements (int nof)

void	SetNumberOfDeletedElements (int nod)

void	SetCapacity (int capacity)

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)

Detailed Description

template<typename Derived, typename Shape, typename Key>
class v8::internal::Dictionary< Derived, Shape, Key >

Definition at line 3485 of file objects.h.

Member Typedef Documentation

◆ DerivedHashTable

template<typename Derived , typename Shape , typename Key >

typedef HashTable<Derived, Shape, Key> v8::internal::Dictionary< Derived, Shape, Key >::DerivedHashTable

protected

Definition at line 3487 of file objects.h.

Member Enumeration Documentation

◆ SortMode

template<typename Derived , typename Shape , typename Key >

enum v8::internal::Dictionary::SortMode

Enumerator
UNSORTED
SORTED

Definition at line 3535 of file objects.h.

3535 { UNSORTED, SORTED };

v8::internal::Dictionary::SORTED

@ SORTED

Definition: objects.h:3535

v8::internal::Dictionary::UNSORTED

@ UNSORTED

Definition: objects.h:3535

Member Function Documentation

◆ Add()

template<typename Derived , typename Shape , typename Key >

Handle< Derived > v8::internal::Dictionary< Derived, Shape, Key >::Add	(	Handle< Derived >	dictionary,
		Key	key,
		Handle< Object >	value,
		PropertyDetails	details
	)

static

Definition at line 15024 of file objects.cc.

                              {
   // Valdate key is absent.
   SLOW_DCHECK((dictionary->FindEntry(key) == Dictionary::kNotFound));
   // Check whether the dictionary should be extended.
   dictionary = EnsureCapacity(dictionary, 1, key);
  
   AddEntry(dictionary, key, value, details, dictionary->Hash(key));
   return dictionary;
 }

References v8::internal::HashTable< Derived, Shape, Key >::kNotFound, and SLOW_DCHECK.

◆ AddEntry()

template<typename Derived , typename Shape , typename Key >

void v8::internal::Dictionary< Derived, Shape, Key >::AddEntry	(	Handle< Derived >	dictionary,
		Key	key,
		Handle< Object >	value,
		PropertyDetails	details,
		uint32_t	hash
	)

staticprotected

Definition at line 15041 of file objects.cc.

                    {
   // Compute the key object.
   Handle<Object> k = Shape::AsHandle(dictionary->GetIsolate(), key);
  
   uint32_t entry = dictionary->FindInsertionEntry(hash);
   // Insert element at empty or deleted entry
   if (!details.IsDeleted() &&
       details.dictionary_index() == 0 &&
       Shape::kIsEnumerable) {
     // Assign an enumeration index to the property and update
     // SetNextEnumerationIndex.
     int index = dictionary->NextEnumerationIndex();
     details = PropertyDetails(details.attributes(), details.type(), index);
     dictionary->SetNextEnumerationIndex(index + 1);
   }
   dictionary->SetEntry(entry, k, value, details);
   DCHECK((dictionary->KeyAt(entry)->IsNumber() ||
           dictionary->KeyAt(entry)->IsName()));
   dictionary->ElementAdded();
 }

References DCHECK.

◆ AtPut()

template<typename Derived , typename Shape , typename Key >

Handle< Derived > v8::internal::Dictionary< Derived, Shape, Key >::AtPut	(	Handle< Derived >	dictionary,
		Key	key,
		Handle< Object >	value
	)

staticprotected

Definition at line 15001 of file objects.cc.

                                                                {
   int entry = dictionary->FindEntry(key);
  
   // If the entry is present set the value;
   if (entry != Dictionary::kNotFound) {
     dictionary->ValueAtPut(entry, *value);
     return dictionary;
   }
  
   // Check whether the dictionary should be extended.
   dictionary = EnsureCapacity(dictionary, 1, key);
 #ifdef DEBUG
   USE(Shape::AsHandle(dictionary->GetIsolate(), key));
 #endif
   PropertyDetails details = PropertyDetails(NONE, NORMAL, 0);
  
   AddEntry(dictionary, key, value, details, dictionary->Hash(key));
   return dictionary;
 }

References v8::internal::HashTable< Derived, Shape, Key >::kNotFound, NONE, v8::internal::NORMAL, and USE().

Here is the call graph for this function:

◆ CopyKeysTo() [1/2]

template<typename Derived , typename Shape , typename Key >

void v8::internal::Dictionary< Derived, Shape, Key >::CopyKeysTo	(	FixedArray *	storage,
		int	index,
		PropertyAttributes	filter,
		SortMode	sort_mode
	)

◆ CopyKeysTo() [2/2]

template<typename Derived , typename Shape , typename Key >

void v8::internal::Dictionary< Derived, Shape, Key >::CopyKeysTo	(	FixedArray *	storage,
		PropertyAttributes	filter,
		SortMode	sort_mode
	)

Referenced by v8::internal::JSObject::GetOwnElementKeys().

Here is the caller graph for this function:

◆ CopyValuesTo()

template<typename Derived , typename Shape , typename Key >

void v8::internal::Dictionary< Derived, Shape, Key >::CopyValuesTo ( FixedArray * elements )

Definition at line 13087 of file objects.cc.

                                                                        {
   int pos = 0;
   int capacity = DerivedHashTable::Capacity();
   DisallowHeapAllocation no_gc;
   WriteBarrierMode mode = elements->GetWriteBarrierMode(no_gc);
   for (int i = 0; i < capacity; i++) {
     Object* k =  Dictionary::KeyAt(i);
     if (Dictionary::IsKey(k)) {
       elements->set(pos++, ValueAt(i), mode);
     }
   }
   DCHECK(pos == elements->length());
 }

References DCHECK, v8::internal::HeapObject::GetWriteBarrierMode(), v8::internal::HashTable< Derived, Shape, Key >::IsKey(), v8::internal::HashTable< Derived, Shape, Key >::KeyAt(), v8::internal::FixedArrayBase::length(), mode(), and v8::internal::FixedArray::set().

Here is the call graph for this function:

◆ DeleteProperty()

template<typename Derived , typename Shape , typename Key >

Handle< Object > v8::internal::Dictionary< Derived, Shape, Key >::DeleteProperty	(	Handle< Derived >	dictionary,
		int	entry,
		JSObject::DeleteMode	mode
	)

static

Definition at line 14982 of file objects.cc.

                              {
   Factory* factory = dictionary->GetIsolate()->factory();
   PropertyDetails details = dictionary->DetailsAt(entry);
   // Ignore attributes if forcing a deletion.
   if (!details.IsConfigurable() && mode != JSReceiver::FORCE_DELETION) {
     return factory->false_value();
   }
  
   dictionary->SetEntry(
       entry, factory->the_hole_value(), factory->the_hole_value());
   dictionary->ElementRemoved();
   return factory->true_value();
 }

References v8::internal::JSReceiver::FORCE_DELETION, and mode().

Here is the call graph for this function:

◆ DetailsAt()

template<typename Derived , typename Shape , typename Key >

PropertyDetails v8::internal::Dictionary< Derived, Shape, Key >::DetailsAt ( int entry )

inline

Definition at line 3501 of file objects.h.

                                        {
     DCHECK(entry >= 0);  // Not found is -1, which is not caught by get().
     return PropertyDetails(
         Smi::cast(this->get(DerivedHashTable::EntryToIndex(entry) + 2)));
   }

References DCHECK.

Referenced by v8::internal::FreezeDictionary(), v8::internal::JSObject::GetAccessor(), v8::internal::RUNTIME_FUNCTION(), v8::internal::JSObject::SetNormalizedProperty(), and v8::internal::UpdateGetterSetterInDictionary().

Here is the caller graph for this function:

◆ DetailsAtPut()

template<typename Derived , typename Shape , typename Key >

void v8::internal::Dictionary< Derived, Shape, Key >::DetailsAtPut	(	int	entry,
		PropertyDetails	value
	)

inline

Definition at line 3508 of file objects.h.

                                                       {
     this->set(DerivedHashTable::EntryToIndex(entry) + 2, value.AsSmi());
   }

References v8::internal::Smi::value().

Referenced by v8::internal::FreezeDictionary(), v8::internal::JSObject::SetNormalizedProperty(), and v8::internal::UpdateGetterSetterInDictionary().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ EnsureCapacity()

template<typename Derived , typename Shape , typename Key >

Handle< Derived > v8::internal::Dictionary< Derived, Shape, Key >::EnsureCapacity	(	Handle< Derived >	obj,
		int	n,
		Key	key
	)

static

Definition at line 14969 of file objects.cc.

                                                 {
   // Check whether there are enough enumeration indices to add n elements.
   if (Shape::kIsEnumerable &&
       !PropertyDetails::IsValidIndex(dictionary->NextEnumerationIndex() + n)) {
     // If not, we generate new indices for the properties.
     GenerateNewEnumerationIndices(dictionary);
   }
   return DerivedHashTable::EnsureCapacity(dictionary, n, key);
 }

◆ GenerateNewEnumerationIndices()

template<typename Derived , typename Shape , typename Key >

void v8::internal::Dictionary< Derived, Shape, Key >::GenerateNewEnumerationIndices ( Handle< Derived > dictionary )

staticprotected

Definition at line 14916 of file objects.cc.

                                 {
   Factory* factory = dictionary->GetIsolate()->factory();
   int length = dictionary->NumberOfElements();
  
   // Allocate and initialize iteration order array.
   Handle<FixedArray> iteration_order = factory->NewFixedArray(length);
   for (int i = 0; i < length; i++) {
     iteration_order->set(i, Smi::FromInt(i));
   }
  
   // Allocate array with enumeration order.
   Handle<FixedArray> enumeration_order = factory->NewFixedArray(length);
  
   // Fill the enumeration order array with property details.
   int capacity = dictionary->Capacity();
   int pos = 0;
   for (int i = 0; i < capacity; i++) {
     if (dictionary->IsKey(dictionary->KeyAt(i))) {
       int index = dictionary->DetailsAt(i).dictionary_index();
       enumeration_order->set(pos++, Smi::FromInt(index));
     }
   }
  
   // Sort the arrays wrt. enumeration order.
   iteration_order->SortPairs(*enumeration_order, enumeration_order->length());
  
   // Overwrite the enumeration_order with the enumeration indices.
   for (int i = 0; i < length; i++) {
     int index = Smi::cast(iteration_order->get(i))->value();
     int enum_index = PropertyDetails::kInitialIndex + i;
     enumeration_order->set(index, Smi::FromInt(enum_index));
   }
  
   // Update the dictionary with new indices.
   capacity = dictionary->Capacity();
   pos = 0;
   for (int i = 0; i < capacity; i++) {
     if (dictionary->IsKey(dictionary->KeyAt(i))) {
       int enum_index = Smi::cast(enumeration_order->get(pos++))->value();
       PropertyDetails details = dictionary->DetailsAt(i);
       PropertyDetails new_details = PropertyDetails(
           details.attributes(), details.type(), enum_index);
       dictionary->DetailsAtPut(i, new_details);
     }
   }
  
   // Set the next enumeration index.
   dictionary->SetNextEnumerationIndex(PropertyDetails::kInitialIndex+length);
 }

References v8::internal::Smi::FromInt(), and v8::internal::FixedArrayBase::length().

Here is the call graph for this function:

◆ New()

template<typename Derived , typename Shape , typename Key >

Handle< Derived > v8::internal::Dictionary< Derived, Shape, Key >::New	(	Isolate *	isolate,
		int	at_least_space_for,
		PretenureFlag	pretenure = `NOT_TENURED`
	)

static

Definition at line 14899 of file objects.cc.

                              {
   DCHECK(0 <= at_least_space_for);
   Handle<Derived> dict = DerivedHashTable::New(isolate,
                                                at_least_space_for,
                                                USE_DEFAULT_MINIMUM_CAPACITY,
                                                pretenure);
  
   // Initialize the next enumeration index.
   dict->SetNextEnumerationIndex(PropertyDetails::kInitialIndex);
   return dict;
 }

References DCHECK, and v8::internal::USE_DEFAULT_MINIMUM_CAPACITY.

◆ NextEnumerationIndex()

template<typename Derived , typename Shape , typename Key >

int v8::internal::Dictionary< Derived, Shape, Key >::NextEnumerationIndex ( )

inline

Definition at line 3552 of file objects.h.

                              {
     return Smi::cast(this->get(kNextEnumerationIndexIndex))->value();
   }

Referenced by v8::internal::JSObject::SetNormalizedProperty().

Here is the caller graph for this function:

◆ NumberOfElementsFilterAttributes()

template<typename Derived , typename Shape , typename Key >

int v8::internal::Dictionary< Derived, Shape, Key >::NumberOfElementsFilterAttributes ( PropertyAttributes filter )

Definition at line 15160 of file objects.cc.

                                {
   int capacity = DerivedHashTable::Capacity();
   int result = 0;
   for (int i = 0; i < capacity; i++) {
     Object* k = DerivedHashTable::KeyAt(i);
     if (DerivedHashTable::IsKey(k) && !FilterKey(k, filter)) {
       PropertyDetails details = DetailsAt(i);
       if (details.IsDeleted()) continue;
       PropertyAttributes attr = details.attributes();
       if ((attr & filter) == 0) result++;
     }
   }
   return result;
 }

References v8::internal::FilterKey().

Referenced by v8::internal::JSObject::GetOwnElementKeys().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ NumberOfEnumElements()

template<typename Derived , typename Shape , typename Key >

int v8::internal::Dictionary< Derived, Shape, Key >::NumberOfEnumElements

Definition at line 15178 of file objects.cc.

                                                           {
   return NumberOfElementsFilterAttributes(
       static_cast<PropertyAttributes>(DONT_ENUM | SYMBOLIC));
 }

References DONT_ENUM, and SYMBOLIC.

◆ SetEntry() [1/2]

template<typename Derived , typename Shape , typename Key >

void v8::internal::Dictionary< Derived, Shape, Key >::SetEntry	(	int	entry,
		Handle< Object >	key,
		Handle< Object >	value
	)

inline

Definition at line 6798 of file objects-inl.h.

                                                                      {
   SetEntry(entry, key, value, PropertyDetails(Smi::FromInt(0)));
 }

References v8::internal::Smi::FromInt().

Referenced by v8::internal::JSObject::SetNormalizedProperty().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ SetEntry() [2/2]

template<typename Derived , typename Shape , typename Key >

void v8::internal::Dictionary< Derived, Shape, Key >::SetEntry	(	int	entry,
		Handle< Object >	key,
		Handle< Object >	value,
		PropertyDetails	details
	)

inline

Definition at line 6806 of file objects-inl.h.

                                                                         {
   DCHECK(!key->IsName() ||
          details.IsDeleted() ||
          details.dictionary_index() > 0);
   int index = DerivedHashTable::EntryToIndex(entry);
   DisallowHeapAllocation no_gc;
   WriteBarrierMode mode = FixedArray::GetWriteBarrierMode(no_gc);
   FixedArray::set(index, *key, mode);
   FixedArray::set(index+1, *value, mode);
   FixedArray::set(index+2, details.AsSmi());
 }

References DCHECK, v8::internal::HeapObject::GetWriteBarrierMode(), mode(), and v8::internal::FixedArray::set().

Here is the call graph for this function:

◆ SetNextEnumerationIndex()

template<typename Derived , typename Shape , typename Key >

void v8::internal::Dictionary< Derived, Shape, Key >::SetNextEnumerationIndex ( int index )

inline

Definition at line 3547 of file objects.h.

                                           {
     DCHECK(index != 0);
     this->set(kNextEnumerationIndexIndex, Smi::FromInt(index));
   }

References DCHECK, and v8::internal::Smi::FromInt().

Referenced by v8::internal::JSObject::SetNormalizedProperty().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ Shrink()

template<typename Derived , typename Shape , typename Key >

static MUST_USE_RESULT Handle<Derived> v8::internal::Dictionary< Derived, Shape, Key >::Shrink	(	Handle< Derived >	dictionary,
		Key	key
	)

inlinestatic

Definition at line 3522 of file objects.h.

                {
     return DerivedHashTable::Shrink(dictionary, key);
   }

◆ SlowReverseLookup()

template<typename Derived , typename Shape , typename Key >

Object * v8::internal::Dictionary< Derived, Shape, Key >::SlowReverseLookup ( Object * value )

Definition at line 15270 of file objects.cc.

                                                                         {
   int capacity = DerivedHashTable::Capacity();
   for (int i = 0; i < capacity; i++) {
     Object* k =  DerivedHashTable::KeyAt(i);
     if (Dictionary::IsKey(k)) {
       Object* e = ValueAt(i);
       if (e->IsPropertyCell()) {
         e = PropertyCell::cast(e)->value();
       }
       if (e == value) return k;
     }
   }
   Heap* heap = Dictionary::GetHeap();
   return heap->undefined_value();
 }

References v8::internal::HeapObject::GetHeap(), and v8::internal::HashTable< Derived, Shape, Key >::IsKey().

Here is the call graph for this function:

◆ ValueAt()

template<typename Derived , typename Shape , typename Key >

Object* v8::internal::Dictionary< Derived, Shape, Key >::ValueAt ( int entry )

inline

Definition at line 3491 of file objects.h.

                              {
     return this->get(DerivedHashTable::EntryToIndex(entry) + 1);
   }

Referenced by v8::internal::CopyDictionaryToDoubleElements(), v8::internal::CopyDictionaryToObjectElements(), v8::internal::V8HeapExplorer::ExtractElementReferences(), v8::internal::V8HeapExplorer::ExtractPropertyReferences(), v8::internal::PropertyICCompiler::FindPreMonomorphic(), v8::internal::FreezeDictionary(), v8::internal::JSObject::GetAccessor(), v8::internal::PatchIncrementalMarkingRecordWriteStubs(), v8::internal::RUNTIME_FUNCTION(), v8::internal::JSObject::SetNormalizedProperty(), v8::internal::JSObject::ShouldConvertToFastDoubleElements(), and v8::internal::UpdateGetterSetterInDictionary().

Here is the caller graph for this function:

◆ ValueAtPut()

template<typename Derived , typename Shape , typename Key >

void v8::internal::Dictionary< Derived, Shape, Key >::ValueAtPut	(	int	entry,
		Object *	value
	)

inline

Definition at line 3496 of file objects.h.

                                             {
     this->set(DerivedHashTable::EntryToIndex(entry) + 1, value);
   }

References v8::internal::Smi::value().

Here is the call graph for this function:

Member Data Documentation

◆ kMaxNumberKeyIndex

template<typename Derived , typename Shape , typename Key >

const int v8::internal::Dictionary< Derived, Shape, Key >::kMaxNumberKeyIndex = DerivedHashTable::kPrefixStartIndex

staticprotected

Definition at line 3603 of file objects.h.

◆ kNextEnumerationIndexIndex

template<typename Derived , typename Shape , typename Key >

const int v8::internal::Dictionary< Derived, Shape, Key >::kNextEnumerationIndexIndex = kMaxNumberKeyIndex + 1

staticprotected

Definition at line 3604 of file objects.h.

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

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

Public Types

Public Member Functions

Static Public Member Functions

Protected Types

Static Protected Member Functions

Static Protected Attributes

Additional Inherited Members

Detailed Description

template<typename Derived, typename Shape, typename Key> class v8::internal::Dictionary< Derived, Shape, Key >

Member Typedef Documentation

◆ DerivedHashTable

Member Enumeration Documentation

◆ SortMode

Member Function Documentation

◆ Add()

◆ AddEntry()

◆ AtPut()

◆ CopyKeysTo() [1/2]

◆ CopyKeysTo() [2/2]

◆ CopyValuesTo()

◆ DeleteProperty()

◆ DetailsAt()

◆ DetailsAtPut()

◆ EnsureCapacity()

◆ GenerateNewEnumerationIndices()

◆ New()

◆ NextEnumerationIndex()

◆ NumberOfElementsFilterAttributes()

◆ NumberOfEnumElements()

◆ SetEntry() [1/2]

◆ SetEntry() [2/2]

◆ SetNextEnumerationIndex()

◆ Shrink()

◆ SlowReverseLookup()

◆ ValueAt()

◆ ValueAtPut()

Member Data Documentation

◆ kMaxNumberKeyIndex

◆ kNextEnumerationIndexIndex

template<typename Derived, typename Shape, typename Key>
class v8::internal::Dictionary< Derived, Shape, Key >