| /third_party/node/deps/v8/src/objects/ |
| D | swiss-name-dictionary.cc | 27 int nof = table->NumberOfElements(); in DeleteEntry()
45 DCHECK_LE(table->NumberOfElements(), MaxUsableCapacity(new_capacity)); in Rehash()
56 new_table->SetNumberOfElements(table->NumberOfElements()); in Rehash()
82 NumberOfElements() != other.NumberOfElements() || in EqualsForTesting()
189 int nof = table->NumberOfElements(); in Shrink()
223 std::vector<Entry> data(NumberOfElements(), dummy); in Rehash()
|
| D | ordered-hash-table.cc | 71 int nof = table->NumberOfElements(); in EnsureGrowable()
97 int nof = table->NumberOfElements(); in Shrink()
137 if (NumberOfElements() == 0) { in FindEntry()
171 if (table->NumberOfElements() > 0) { in Add()
190 int nof = table->NumberOfElements(); in Add()
204 int length = table->NumberOfElements(); in ConvertToKeysArray()
292 new_table->SetNumberOfElements(table->NumberOfElements()); in Rehash()
342 int nof = table.NumberOfElements(); in Delete()
373 if (table->NumberOfElements() > 0) { in Add()
396 int nof = table->NumberOfElements(); in Add()
[all …]
|
| D | hash-table-inl.h | 85 int HashTableBase::NumberOfElements() const { in NumberOfElements() function
102 SetNumberOfElements(NumberOfElements() + 1); in ElementAdded()
106 SetNumberOfElements(NumberOfElements() - 1); in ElementRemoved()
111 SetNumberOfElements(NumberOfElements() - n); in ElementsRemoved()
|
| D | ordered-hash-table.h | 96 int NumberOfElements() const { in NumberOfElements() function
107 return NumberOfElements() + NumberOfDeletedElements(); in UsedCapacity()
459 int NumberOfElements() const { in NumberOfElements() function
633 int used = NumberOfElements() + NumberOfDeletedElements(); in UsedCapacity()
875 static int NumberOfElements(HeapObject table);
|
| D | string-table.h | 57 int NumberOfElements() const;
|
| D | swiss-name-dictionary-inl.h | 52 int SwissNameDictionary::NumberOfElements() { in NumberOfElements() function
69 return NumberOfElements() + NumberOfDeletedElements(); in UsedCapacity()
516 int nof = table->NumberOfElements(); in Add()
|
| D | script-inl.h | 117 return shared_function_info_table().NumberOfElements() + 1; in shared_function_info_count()
|
| D | module.cc | 315 names.reserve(exports->NumberOfElements()); in GetModuleNamespace()
321 DCHECK_EQ(static_cast<int>(names.size()), exports->NumberOfElements()); in GetModuleNamespace()
|
| D | objects.cc | 2377 return SmallOrderedHashMap::cast(*this).NumberOfElements() == 0; in CanBeRehashed()
2379 return SmallOrderedHashMap::cast(*this).NumberOfElements() == 0; in CanBeRehashed()
2381 return SmallOrderedNameDictionary::cast(*this).NumberOfElements() == 0; in CanBeRehashed()
2421 DCHECK_EQ(0, SmallOrderedHashMap::cast(*this).NumberOfElements()); in RehashBasedOnMap()
2424 DCHECK_EQ(0, SmallOrderedHashSet::cast(*this).NumberOfElements()); in RehashBasedOnMap()
2438 DCHECK_EQ(0, SmallOrderedNameDictionary::cast(*this).NumberOfElements()); in RehashBasedOnMap()
5739 DCHECK_LT(NumberOfElements(), new_table.Capacity()); in Rehash()
5760 new_table.SetNumberOfElements(NumberOfElements()); in Rehash()
5857 int new_nof = table->NumberOfElements() + n; in EnsureCapacity()
5873 return HasSufficientCapacityToAdd(Capacity(), NumberOfElements(), in HasSufficientCapacityToAdd()
[all …]
|
| D | swiss-name-dictionary.h | 112 inline int NumberOfElements();
|
| D | elements.h | 62 virtual size_t NumberOfElements(JSObject holder) = 0;
|
| D | string-table.cc | 337 int StringTable::NumberOfElements() const { in NumberOfElements() function in v8::internal::StringTable
771 isolate->counters()->number_of_symbols()->Set(NumberOfElements()); in UpdateCountersIfOwnedBy()
|
| D | hash-table.h | 73 inline int NumberOfElements() const; in NON_EXPORTED_BASE()
|
| D | keys.cc | 896 if (dictionary->NumberOfElements() == 0) { in GetOwnEnumPropertyDictionaryKeys()
914 isolate->factory()->NewFixedArray(dictionary->NumberOfElements()); in CollectKeysFromDictionary()
|
| D | value-serializer.cc | 844 int length = table->NumberOfElements() * 2; in WriteJSMap()
876 int length = table->NumberOfElements(); in WriteJSSet()
|
| D | js-objects.cc | 3686 number_of_elements = swiss_dictionary->NumberOfElements(); in MigrateSlowToFast()
3689 number_of_elements = dictionary->NumberOfElements(); in MigrateSlowToFast()
3703 iteration_length = dictionary->NumberOfElements(); in MigrateSlowToFast()
4084 return accessor->NumberOfElements(object) == 0; in TestElementsIntegrityLevel()
|
| /third_party/node/deps/v8/src/runtime/ |
| D | runtime-collections.cc | 91 DCHECK(table->NumberOfElements() - 1 <= (table->Capacity() >> 2) && in RUNTIME_FUNCTION()
92 table->NumberOfElements() - 1 >= 16); in RUNTIME_FUNCTION()
114 DCHECK((table->NumberOfDeletedElements() << 1) > table->NumberOfElements() || in RUNTIME_FUNCTION()
|
| D | runtime-classes.cc | 368 if (elements_dictionary->NumberOfElements() > 0) { in AddDescriptorsByTemplate()
378 if (elements_dictionary->NumberOfElements() > 0) { in AddDescriptorsByTemplate()
450 if (elements_dictionary->NumberOfElements() > 0) { in AddDescriptorsByTemplate()
461 if (elements_dictionary->NumberOfElements() > 0) { in AddDescriptorsByTemplate()
|
| D | runtime-test.cc | 1740 EphemeronHashTable::cast(collection->table()).NumberOfElements()); in RUNTIME_FUNCTION()
|
| D | runtime-object.cc | 1615 return Smi::FromInt(table.NumberOfElements()); in RUNTIME_FUNCTION()
|
| /third_party/node/deps/v8/src/diagnostics/ |
| D | objects-debug.cc | 985 if (global_dictionary(kAcquireLoad).NumberOfElements() == 0 && in JSGlobalObjectVerify()
1177 uint32_t nof_elements = static_cast<uint32_t>(dict.NumberOfElements()); in JSArrayVerify()
1344 for (int entry = 0; entry < NumberOfElements(); entry++) { in SmallOrderedHashTableVerify()
1351 for (int entry = 0; entry < NumberOfElements(); entry++) { in SmallOrderedHashTableVerify()
1358 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()
1456 CHECK_EQ(seen_present, NumberOfElements()); in SwissNameDictionaryVerify()
1969 info->number_of_slow_used_properties_ += dict.NumberOfElements(); in IncrementSpillStatistics()
[all …]
|
| D | objects-printer.cc | 940 os << "\n - elements: " << table.NumberOfElements(); in PrintOrderedHashTableHeaderAndBuckets()
959 os << "\n - elements: " << table.NumberOfElements(); in PrintHashTableHeader()
1041 os << "\n - elements: " << this->NumberOfElements(); in SwissNameDictionaryPrint()
|
| /third_party/node/deps/v8/src/snapshot/ |
| D | shared-heap-deserializer.cc | 57 DCHECK_EQ(string_table_size, isolate()->string_table()->NumberOfElements()); in DeserializeStringTable()
|
| D | shared-heap-serializer.cc | 129 sink_.PutInt(string_table->NumberOfElements(), in SerializeStringTable()
|
| /third_party/node/deps/v8/src/heap/ |
| D | object-stats.cc | 488 (hash_table.NumberOfElements() + hash_table.NumberOfDeletedElements())) * in RecordHashTableVirtualObjectStats()
|