Home
last modified time | relevance | path

Searched refs:NumberOfDeletedElements (Results 1 - 12 of 12) sorted by relevance

/third_party/node/deps/v8/src/objects/
H A Dordered-hash-table.cc72 int nod = table->NumberOfDeletedElements(); in EnsureGrowable()
192 int new_entry = nof + table->NumberOfDeletedElements(); in Add()
290 DCHECK_EQ(table->NumberOfDeletedElements(), removed_holes_index); in Rehash()
343 int nod = table.NumberOfDeletedElements(); in Delete()
398 int new_entry = nof + table->NumberOfDeletedElements(); in Add()
464 int new_entry = nof + table->NumberOfDeletedElements(); in Add()
507 int nod = table->NumberOfDeletedElements(); in DeleteEntry()
729 int new_entry = nof + table->NumberOfDeletedElements(); in Add()
772 int new_entry = nof + table->NumberOfDeletedElements(); in Add()
838 int new_entry = nof + table->NumberOfDeletedElements(); in Add()
[all...]
H A Dswiss-name-dictionary.cc29 int nod = table->NumberOfDeletedElements(); in DeleteEntry()
83 NumberOfDeletedElements() != other.NumberOfDeletedElements() || in EqualsForTesting()
H A Dhash-table-inl.h89 int HashTableBase::NumberOfDeletedElements() const { in NumberOfDeletedElements() function in v8::internal::HashTableBase
107 SetNumberOfDeletedElements(NumberOfDeletedElements() + 1); in ElementRemoved()
112 SetNumberOfDeletedElements(NumberOfDeletedElements() + n); in ElementsRemoved()
H A Dordered-hash-table.h61 // [kPrefixSize + 3..(kPrefixSize + 3 + NumberOfDeletedElements() - 1)]:
65 // [kPrefixSize + 3 + NumberOfDeletedElements()..length]: Not used
100 int NumberOfDeletedElements() const { in NumberOfDeletedElements() function in v8::internal::OrderedHashTable
107 return NumberOfElements() + NumberOfDeletedElements(); in UsedCapacity()
193 // NumberOfDeletedElements is set to kClearedTableSentinel when
466 int NumberOfDeletedElements() const { in NumberOfDeletedElements() function in v8::internal::SmallOrderedHashTable
633 int used = NumberOfElements() + NumberOfDeletedElements();
H A Dswiss-name-dictionary-inl.h56 int SwissNameDictionary::NumberOfDeletedElements() { in NumberOfDeletedElements() function in v8::internal::SwissNameDictionary
69 return NumberOfElements() + NumberOfDeletedElements(); in UsedCapacity()
517 int nod = table->NumberOfDeletedElements(); in Add()
H A Dswiss-name-dictionary.h113 inline int NumberOfDeletedElements();
H A Dhash-table.h76 inline int NumberOfDeletedElements() const;
H A Dobjects.cc5874 NumberOfDeletedElements(), in HasSufficientCapacityToAdd()
6390 if ((table->NumberOfDeletedElements() << 1) > table->NumberOfElements()) { in Put()
/third_party/node/deps/v8/src/runtime/
H A Druntime-collections.cc114 DCHECK((table->NumberOfDeletedElements() << 1) > table->NumberOfElements() || in RUNTIME_FUNCTION()
/third_party/node/deps/v8/src/diagnostics/
H A Dobjects-debug.cc1358 for (int entry = NumberOfElements() + NumberOfDeletedElements(); in SmallOrderedHashTableVerify()
1371 for (int entry = NumberOfElements(); entry < NumberOfDeletedElements(); in SmallOrderedHashMapVerify()
1384 for (int entry = NumberOfElements(); entry < NumberOfDeletedElements(); in SmallOrderedHashSetVerify()
1398 for (int entry = NumberOfElements(); entry < NumberOfDeletedElements(); in SmallOrderedNameDictionaryVerify()
1458 CHECK_EQ(seen_deleted, NumberOfDeletedElements()); in SwissNameDictionaryVerify()
H A Dobjects-printer.cc941 os << "\n - deleted: " << table.NumberOfDeletedElements(); in PrintOrderedHashTableHeaderAndBuckets()
960 os << "\n - deleted: " << table.NumberOfDeletedElements(); in PrintHashTableHeader()
1042 os << "\n - deleted: " << this->NumberOfDeletedElements(); in SwissNameDictionaryPrint()
/third_party/node/deps/v8/src/heap/
H A Dobject-stats.cc488 (hash_table.NumberOfElements() + hash_table.NumberOfDeletedElements())) * in RecordHashTableVirtualObjectStats()

Completed in 28 milliseconds