#include <objects.h>

Inheritance diagram for v8::internal::OrderedHashTable< Derived, Iterator, entrysize >:

Collaboration diagram for v8::internal::OrderedHashTable< Derived, Iterator, entrysize >:

Public Member Functions
int	FindEntry (Handle< Object > key, int hash)

int	FindEntry (Handle< Object > key)

int	NumberOfElements ()

int	NumberOfDeletedElements ()

int	UsedCapacity ()

int	NumberOfBuckets ()

int	AddEntry (int hash)

void	RemoveEntry (int entry)

int	EntryToIndex (int entry)

Object *	KeyAt (int entry)

bool	IsObsolete ()

Derived *	NextTable ()

int	RemovedIndexAt (int index)

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< Derived >	Allocate (Isolate *isolate, int capacity, PretenureFlag pretenure=NOT_TENURED)

static Handle< Derived >	EnsureGrowable (Handle< Derived > table)

static Handle< Derived >	Shrink (Handle< Derived > table)

static Handle< Derived >	Clear (Handle< Derived > table)

static Handle< Derived >	Remove (Handle< Derived > table, Handle< Object > key, bool *was_present)

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	kMinCapacity = 4

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	SetNumberOfBuckets (int num)

void	SetNumberOfElements (int num)

void	SetNumberOfDeletedElements (int num)

int	Capacity ()

int	ChainAt (int entry)

int	HashToBucket (int hash)

int	HashToEntry (int hash)

void	SetNextTable (Derived *next_table)

void	SetRemovedIndexAt (int index, int removed_index)

Static Private Member Functions
static Handle< Derived >	Rehash (Handle< Derived > table, int new_capacity)

Static Private Attributes
static const int	kNumberOfBucketsIndex = 0

static const int	kNumberOfElementsIndex = kNumberOfBucketsIndex + 1

static const int	kNumberOfDeletedElementsIndex = kNumberOfElementsIndex + 1

static const int	kHashTableStartIndex = kNumberOfDeletedElementsIndex + 1

static const int	kNextTableIndex = kNumberOfElementsIndex

static const int	kRemovedHolesIndex = kHashTableStartIndex

static const int	kEntrySize = entrysize + 1

static const int	kChainOffset = entrysize

static const int	kLoadFactor = 2

static const int	kMaxCapacity

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

template<class Derived, class Iterator, int entrysize>
class v8::internal::OrderedHashTable< Derived, Iterator, entrysize >

Definition at line 3834 of file objects.h.

Member Function Documentation

◆ AddEntry()

template<class Derived , class Iterator , int entrysize>

template int v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::AddEntry ( int hash )

Definition at line 15571 of file objects.cc.

                                                                      {
   DCHECK(!IsObsolete());
  
   int entry = UsedCapacity();
   int bucket = HashToBucket(hash);
   int index = EntryToIndex(entry);
   Object* chain_entry = get(kHashTableStartIndex + bucket);
   set(kHashTableStartIndex + bucket, Smi::FromInt(entry));
   set(index + kChainOffset, chain_entry);
   SetNumberOfElements(NumberOfElements() + 1);
   return index;
 }

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

Here is the call graph for this function:

◆ Allocate()

template<class Derived , class Iterator , int entrysize>

template Handle< OrderedHashMap > v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::Allocate	(	Isolate *	isolate,
		int	capacity,
		PretenureFlag	pretenure = `NOT_TENURED`
	)

static

Definition at line 15412 of file objects.cc.

                                                              {
   // Capacity must be a power of two, since we depend on being able
   // to divide and multiple by 2 (kLoadFactor) to derive capacity
   // from number of buckets. If we decide to change kLoadFactor
   // to something other than 2, capacity should be stored as another
   // field of this object.
   capacity = base::bits::RoundUpToPowerOfTwo32(Max(kMinCapacity, capacity));
   if (capacity > kMaxCapacity) {
     v8::internal::Heap::FatalProcessOutOfMemory("invalid table size", true);
   }
   int num_buckets = capacity / kLoadFactor;
   Handle<FixedArray> backing_store = isolate->factory()->NewFixedArray(
       kHashTableStartIndex + num_buckets + (capacity * kEntrySize), pretenure);
   backing_store->set_map_no_write_barrier(
       isolate->heap()->ordered_hash_table_map());
   Handle<Derived> table = Handle<Derived>::cast(backing_store);
   for (int i = 0; i < num_buckets; ++i) {
     table->set(kHashTableStartIndex + i, Smi::FromInt(kNotFound));
   }
   table->SetNumberOfBuckets(num_buckets);
   table->SetNumberOfElements(0);
   table->SetNumberOfDeletedElements(0);
   return table;
 }

References v8::internal::Handle< T >::cast(), v8::internal::Isolate::factory(), v8::internal::Heap::FatalProcessOutOfMemory(), v8::internal::Smi::FromInt(), v8::internal::Isolate::heap(), v8::internal::Max(), and v8::base::bits::RoundUpToPowerOfTwo32().

Here is the call graph for this function:

◆ Capacity()

template<class Derived , class Iterator , int entrysize>

int v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::Capacity ( )

inlineprivate

Definition at line 3925 of file objects.h.

                  {
     return NumberOfBuckets() * kLoadFactor;
   }

◆ ChainAt()

template<class Derived , class Iterator , int entrysize>

int v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::ChainAt ( int entry )

inlineprivate

Definition at line 3930 of file objects.h.

                          {
     return Smi::cast(get(EntryToIndex(entry) + kChainOffset))->value();
   }

◆ Clear()

template<class Derived , class Iterator , int entrysize>

template Handle< OrderedHashMap > v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::Clear ( Handle< Derived > table )

static

Definition at line 15468 of file objects.cc.

                            {
   DCHECK(!table->IsObsolete());
  
   Handle<Derived> new_table =
       Allocate(table->GetIsolate(),
                kMinCapacity,
                table->GetHeap()->InNewSpace(*table) ? NOT_TENURED : TENURED);
  
   table->SetNextTable(*new_table);
   table->SetNumberOfDeletedElements(-1);
  
   return new_table;
 }

References DCHECK, v8::internal::NOT_TENURED, and v8::internal::TENURED.

◆ EnsureGrowable()

template<class Derived , class Iterator , int entrysize>

template Handle< OrderedHashMap > v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::EnsureGrowable ( Handle< Derived > table )

static

Definition at line 15440 of file objects.cc.

                            {
   DCHECK(!table->IsObsolete());
  
   int nof = table->NumberOfElements();
   int nod = table->NumberOfDeletedElements();
   int capacity = table->Capacity();
   if ((nof + nod) < capacity) return table;
   // Don't need to grow if we can simply clear out deleted entries instead.
   // Note that we can't compact in place, though, so we always allocate
   // a new table.
   return Rehash(table, (nod < (capacity >> 1)) ? capacity << 1 : capacity);
 }

References DCHECK.

◆ EntryToIndex()

template<class Derived , class Iterator , int entrysize>

int v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::EntryToIndex ( int entry )

inline

Definition at line 3887 of file objects.h.

                               {
     return kHashTableStartIndex + NumberOfBuckets() + (entry * kEntrySize);
   }

◆ FindEntry() [1/2]

template<class Derived , class Iterator , int entrysize>

template int v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::FindEntry ( Handle< Object > key )

Definition at line 15561 of file objects.cc.

                         {
   DisallowHeapAllocation no_gc;
   Object* hash = key->GetHash();
   if (!hash->IsSmi()) return kNotFound;
   return FindEntry(key, Smi::cast(hash)->value());
 }

◆ FindEntry() [2/2]

template<class Derived , class Iterator , int entrysize>

template int v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::FindEntry	(	Handle< Object >	key,
		int	hash
	)

Definition at line 15544 of file objects.cc.

                                   {
   DCHECK(!IsObsolete());
  
   DisallowHeapAllocation no_gc;
   DCHECK(!key->IsTheHole());
   for (int entry = HashToEntry(hash); entry != kNotFound;
        entry = ChainAt(entry)) {
     Object* candidate = KeyAt(entry);
     if (candidate->SameValueZero(*key))
       return entry;
   }
   return kNotFound;
 }

References DCHECK, and v8::internal::Object::SameValueZero().

Here is the call graph for this function:

◆ HashToBucket()

template<class Derived , class Iterator , int entrysize>

int v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::HashToBucket ( int hash )

inlineprivate

Definition at line 3934 of file objects.h.

                              {
     return hash & (NumberOfBuckets() - 1);
   }

◆ HashToEntry()

template<class Derived , class Iterator , int entrysize>

int v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::HashToEntry ( int hash )

inlineprivate

Definition at line 3938 of file objects.h.

                             {
     int bucket = HashToBucket(hash);
     return Smi::cast(get(kHashTableStartIndex + bucket))->value();
   }

◆ IsObsolete()

template<class Derived , class Iterator , int entrysize>

bool v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::IsObsolete ( )

inline

Definition at line 3893 of file objects.h.

                     {
     return !get(kNextTableIndex)->IsSmi();
   }

◆ KeyAt()

template<class Derived , class Iterator , int entrysize>

Object* v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::KeyAt ( int entry )

inline

Definition at line 3891 of file objects.h.

3891 { return get(EntryToIndex(entry)); }

◆ NextTable()

template<class Derived , class Iterator , int entrysize>

Derived* v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::NextTable ( )

inline

Definition at line 3898 of file objects.h.

                        {
     return Derived::cast(get(kNextTableIndex));
   }

◆ NumberOfBuckets()

template<class Derived , class Iterator , int entrysize>

int v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::NumberOfBuckets ( )

inline

Definition at line 3873 of file objects.h.

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

◆ NumberOfDeletedElements()

template<class Derived , class Iterator , int entrysize>

int v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::NumberOfDeletedElements ( )

inline

Definition at line 3867 of file objects.h.

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

◆ NumberOfElements()

template<class Derived , class Iterator , int entrysize>

int v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::NumberOfElements ( )

inline

Definition at line 3863 of file objects.h.

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

◆ Rehash()

template<class Derived , class Iterator , int entrysize>

Handle< Derived > v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::Rehash	(	Handle< Derived >	table,
		int	new_capacity
	)

staticprivate

Definition at line 15499 of file objects.cc.

                                              {
   DCHECK(!table->IsObsolete());
  
   Handle<Derived> new_table =
       Allocate(table->GetIsolate(),
                new_capacity,
                table->GetHeap()->InNewSpace(*table) ? NOT_TENURED : TENURED);
   int nof = table->NumberOfElements();
   int nod = table->NumberOfDeletedElements();
   int new_buckets = new_table->NumberOfBuckets();
   int new_entry = 0;
   int removed_holes_index = 0;
  
   for (int old_entry = 0; old_entry < (nof + nod); ++old_entry) {
     Object* key = table->KeyAt(old_entry);
     if (key->IsTheHole()) {
       table->SetRemovedIndexAt(removed_holes_index++, old_entry);
       continue;
     }
  
     Object* hash = key->GetHash();
     int bucket = Smi::cast(hash)->value() & (new_buckets - 1);
     Object* chain_entry = new_table->get(kHashTableStartIndex + bucket);
     new_table->set(kHashTableStartIndex + bucket, Smi::FromInt(new_entry));
     int new_index = new_table->EntryToIndex(new_entry);
     int old_index = table->EntryToIndex(old_entry);
     for (int i = 0; i < entrysize; ++i) {
       Object* value = table->get(old_index + i);
       new_table->set(new_index + i, value);
     }
     new_table->set(new_index + kChainOffset, chain_entry);
     ++new_entry;
   }
  
   DCHECK_EQ(nod, removed_holes_index);
  
   new_table->SetNumberOfElements(nof);
   table->SetNextTable(*new_table);
  
   return new_table;
 }

References DCHECK, DCHECK_EQ, v8::internal::Smi::FromInt(), v8::internal::Object::GetHash(), v8::internal::NOT_TENURED, and v8::internal::TENURED.

Here is the call graph for this function:

◆ Remove()

template<class Derived , class Iterator , int entrysize>

template Handle< OrderedHashMap > v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::Remove	(	Handle< Derived >	table,
		Handle< Object >	key,
		bool *	was_present
	)

static

Definition at line 15485 of file objects.cc.

                                                                   {
   int entry = table->FindEntry(key);
   if (entry == kNotFound) {
     *was_present = false;
     return table;
   }
   *was_present = true;
   table->RemoveEntry(entry);
   return Shrink(table);
 }

References v8::internal::FixedArray::Shrink().

Here is the call graph for this function:

◆ RemovedIndexAt()

template<class Derived , class Iterator , int entrysize>

int v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::RemovedIndexAt ( int index )

inline

Definition at line 3903 of file objects.h.

                                 {
     return Smi::cast(get(kRemovedHolesIndex + index))->value();
   }

◆ RemoveEntry()

template<class Derived , class Iterator , int entrysize>

template void v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::RemoveEntry ( int entry )

Definition at line 15586 of file objects.cc.

                                                                           {
   DCHECK(!IsObsolete());
  
   int index = EntryToIndex(entry);
   for (int i = 0; i < entrysize; ++i) {
     set_the_hole(index + i);
   }
   SetNumberOfElements(NumberOfElements() - 1);
   SetNumberOfDeletedElements(NumberOfDeletedElements() + 1);
 }

References DCHECK, and v8::internal::FixedArray::set_the_hole().

Here is the call graph for this function:

◆ SetNextTable()

template<class Derived , class Iterator , int entrysize>

void v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::SetNextTable ( Derived * next_table )

inlineprivate

Definition at line 3943 of file objects.h.

                                          {
     set(kNextTableIndex, next_table);
   }

◆ SetNumberOfBuckets()

template<class Derived , class Iterator , int entrysize>

void v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::SetNumberOfBuckets ( int num )

inlineprivate

Definition at line 3913 of file objects.h.

                                    {
     set(kNumberOfBucketsIndex, Smi::FromInt(num));
   }

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

Here is the call graph for this function:

◆ SetNumberOfDeletedElements()

template<class Derived , class Iterator , int entrysize>

void v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::SetNumberOfDeletedElements ( int num )

inlineprivate

Definition at line 3921 of file objects.h.

                                            {
     set(kNumberOfDeletedElementsIndex, Smi::FromInt(num));
   }

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

Here is the call graph for this function:

◆ SetNumberOfElements()

template<class Derived , class Iterator , int entrysize>

void v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::SetNumberOfElements ( int num )

inlineprivate

Definition at line 3917 of file objects.h.

                                     {
     set(kNumberOfElementsIndex, Smi::FromInt(num));
   }

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

Here is the call graph for this function:

◆ SetRemovedIndexAt()

template<class Derived , class Iterator , int entrysize>

void v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::SetRemovedIndexAt	(	int	index,
		int	removed_index
	)

inlineprivate

Definition at line 3947 of file objects.h.

                                                        {
     return set(kRemovedHolesIndex + index, Smi::FromInt(removed_index));
   }

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

Here is the call graph for this function:

◆ Shrink()

template<class Derived , class Iterator , int entrysize>

template Handle< OrderedHashMap > v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::Shrink ( Handle< Derived > table )

static

Definition at line 15456 of file objects.cc.

                            {
   DCHECK(!table->IsObsolete());
  
   int nof = table->NumberOfElements();
   int capacity = table->Capacity();
   if (nof >= (capacity >> 2)) return table;
   return Rehash(table, capacity / 2);
 }

References DCHECK.

◆ UsedCapacity()

template<class Derived , class Iterator , int entrysize>

int v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::UsedCapacity ( )

inline

Definition at line 3871 of file objects.h.

3871 { return NumberOfElements() + NumberOfDeletedElements(); }

Member Data Documentation

◆ kChainOffset

template<class Derived , class Iterator , int entrysize>

const int v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::kChainOffset = entrysize

staticprivate

Definition at line 3960 of file objects.h.

◆ kEntrySize

template<class Derived , class Iterator , int entrysize>

const int v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::kEntrySize = entrysize + 1

staticprivate

Definition at line 3959 of file objects.h.

◆ kHashTableStartIndex

template<class Derived , class Iterator , int entrysize>

const int v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::kHashTableStartIndex = kNumberOfDeletedElementsIndex + 1

staticprivate

Definition at line 3954 of file objects.h.

◆ kLoadFactor

template<class Derived , class Iterator , int entrysize>

const int v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::kLoadFactor = 2

staticprivate

Definition at line 3962 of file objects.h.

◆ kMaxCapacity

template<class Derived , class Iterator , int entrysize>

const int v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::kMaxCapacity

staticprivate

Initial value:

=
      (FixedArray::kMaxLength - kHashTableStartIndex)
      / (1 + (kEntrySize * kLoadFactor))

Definition at line 3963 of file objects.h.

◆ kMinCapacity

template<class Derived , class Iterator , int entrysize>

const int v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::kMinCapacity = 4

static

Definition at line 3908 of file objects.h.

◆ kNextTableIndex

template<class Derived , class Iterator , int entrysize>

const int v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::kNextTableIndex = kNumberOfElementsIndex

staticprivate

Definition at line 3956 of file objects.h.

◆ kNotFound

template<class Derived , class Iterator , int entrysize>

const int v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::kNotFound = -1

static

Definition at line 3907 of file objects.h.

◆ kNumberOfBucketsIndex

template<class Derived , class Iterator , int entrysize>

const int v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::kNumberOfBucketsIndex = 0

staticprivate

Definition at line 3951 of file objects.h.

◆ kNumberOfDeletedElementsIndex

template<class Derived , class Iterator , int entrysize>

const int v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::kNumberOfDeletedElementsIndex = kNumberOfElementsIndex + 1

staticprivate

Definition at line 3953 of file objects.h.

◆ kNumberOfElementsIndex

template<class Derived , class Iterator , int entrysize>

const int v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::kNumberOfElementsIndex = kNumberOfBucketsIndex + 1

staticprivate

Definition at line 3952 of file objects.h.

◆ kRemovedHolesIndex

template<class Derived , class Iterator , int entrysize>

const int v8::internal::OrderedHashTable< Derived, Iterator, entrysize >::kRemovedHolesIndex = kHashTableStartIndex

staticprivate

Definition at line 3957 of file objects.h.

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

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

Public Member Functions

Static Public Member Functions

Static Public Attributes

Private Member Functions

Static Private Member Functions

Static Private Attributes

Additional Inherited Members

Detailed Description

template<class Derived, class Iterator, int entrysize> class v8::internal::OrderedHashTable< Derived, Iterator, entrysize >

Member Function Documentation

◆ AddEntry()

◆ Allocate()

◆ Capacity()

◆ ChainAt()

◆ Clear()

◆ EnsureGrowable()

◆ EntryToIndex()

◆ FindEntry() [1/2]

◆ FindEntry() [2/2]

◆ HashToBucket()

◆ HashToEntry()

◆ IsObsolete()

◆ KeyAt()

◆ NextTable()

◆ NumberOfBuckets()

◆ NumberOfDeletedElements()

◆ NumberOfElements()

◆ Rehash()

◆ Remove()

◆ RemovedIndexAt()

◆ RemoveEntry()

◆ SetNextTable()

◆ SetNumberOfBuckets()

◆ SetNumberOfDeletedElements()

◆ SetNumberOfElements()

◆ SetRemovedIndexAt()

◆ Shrink()

◆ UsedCapacity()

Member Data Documentation

◆ kChainOffset

◆ kEntrySize

◆ kHashTableStartIndex

◆ kLoadFactor

◆ kMaxCapacity

◆ kMinCapacity

◆ kNextTableIndex

◆ kNotFound

◆ kNumberOfBucketsIndex

◆ kNumberOfDeletedElementsIndex

◆ kNumberOfElementsIndex

◆ kRemovedHolesIndex

template<class Derived, class Iterator, int entrysize>
class v8::internal::OrderedHashTable< Derived, Iterator, entrysize >