/third_party/node/deps/v8/src/heap/cppgc/ |
D | gc-info-table.cc | 27 constexpr size_t kEntrySize = sizeof(GCInfo); variable 28 static_assert(v8::base::bits::IsPowerOfTwo(kEntrySize), 76 return RoundUp(GCInfoTable::kMaxIndex * kEntrySize, in MaxTableSize() 83 constexpr size_t memory_wanted = kInitialWantedLimit * kEntrySize; in InitialTableLimit() 85 RoundUp(memory_wanted, page_allocator_->AllocatePageSize()) / kEntrySize; in InitialTableLimit() 94 const size_t old_committed_size = limit_ * kEntrySize; in Resize() 95 const size_t new_committed_size = new_limit * kEntrySize; in Resize()
|
D | object-allocator.cc | 33 static constexpr auto kEntrySize = AgeTable::kCardSizeInBytes; in MarkRangeAsYoung() local 39 ? RoundDown(offset_begin, kEntrySize) in MarkRangeAsYoung() 40 : RoundUp(offset_begin, kEntrySize); in MarkRangeAsYoung() 42 ? RoundUp(offset_end, kEntrySize) in MarkRangeAsYoung() 43 : RoundDown(offset_end, kEntrySize); in MarkRangeAsYoung() 53 if (begin != page->PayloadStart() && !IsAligned(offset_begin, kEntrySize)) in MarkRangeAsYoung() 55 if (end != page->PayloadEnd() && !IsAligned(offset_end, kEntrySize)) in MarkRangeAsYoung()
|
/third_party/node/deps/v8/src/codegen/ |
D | external-reference-table.h | 53 static constexpr uint32_t kEntrySize = variable 55 static constexpr uint32_t kSizeInBytes = kSize * kEntrySize + 2 * kUInt32Size; 66 return i * kEntrySize; in OffsetOfEntry() 73 DCHECK_EQ(offset % kEntrySize, 0); in NameFromOffset() 75 int index = offset / kEntrySize; in NameFromOffset() 102 STATIC_ASSERT(sizeof(Address) == kEntrySize);
|
/third_party/node/deps/v8/src/objects/ |
D | hash-table.h | 169 static const int kEntrySize = Shape::kEntrySize; in EXPORT_TEMPLATE_DECLARE() local 170 STATIC_ASSERT(kEntrySize > 0); in EXPORT_TEMPLATE_DECLARE() 178 (FixedArray::kMaxLength - kElementsStartIndex) / kEntrySize; in EXPORT_TEMPLATE_DECLARE() 190 return (entry.as_int() * kEntrySize) + kElementsStartIndex; in EXPORT_TEMPLATE_DECLARE() 195 return InternalIndex((index - kElementsStartIndex) / kEntrySize); in EXPORT_TEMPLATE_DECLARE() 253 static const int kMaxRegularEntry = kMaxRegularCapacity / kEntrySize; in EXPORT_TEMPLATE_DECLARE() 322 static const int kEntrySize = 2; variable 421 static const int kEntrySize = 1; variable 449 static const int kEntrySize = 2; variable 489 static const int kEntrySize = 2; variable
|
D | descriptor-array.h | 165 return kDescriptorsOffset + descriptor * kEntrySize * kTaggedSize; in OffsetOfDescriptorAt() 183 static const int kEntrySize = 3; variable 206 return (descriptor_number * kEntrySize) + kEntryDetailsIndex; in ToDetailsIndex() 211 return (descriptor_number * kEntrySize) + kEntryKeyIndex; in ToKeyIndex() 215 return (descriptor_number * kEntrySize) + kEntryValueIndex; in ToValueIndex()
|
D | ordered-hash-table.h | 141 static const int kEntrySize = entrysize + 1; variable 199 (1 + (kEntrySize * kLoadFactor)); in MaxCapacity() 237 return HashTableStartIndex() + NumberOfBuckets() + (entry * kEntrySize); in EntryToIndexRaw() 608 return capacity * Derived::kEntrySize * kTaggedSize; in DataTableSizeFor() 627 int offset_in_datatable = entry * Derived::kEntrySize * kTaggedSize; in GetDataEntryOffset() 656 static const int kEntrySize = 1; variable 689 static const int kEntrySize = 2; variable 917 static const int kEntrySize = 3; variable
|
D | dictionary.h | 127 static const int kEntrySize = 3; variable 212 static const int kEntrySize = 1; // Overrides NameDictionaryShape::kEntrySize variable 269 static const int kEntrySize = 3; variable 276 static const int kEntrySize = 2; variable
|
D | dictionary-inl.h | 158 DCHECK(Dictionary::kEntrySize == 2 || Dictionary::kEntrySize == 3); in SetEntry() 178 STATIC_ASSERT(Dictionary::kEntrySize == 3); in DetailsAt() 189 STATIC_ASSERT(Dictionary::kEntrySize == 3); in DetailsAtPut()
|
D | transitions.h | 286 static const int kEntrySize = 2; variable 290 return kFirstIndex + (transition_number * kEntrySize) + kEntryKeyIndex; in ToKeyIndex() 294 return kFirstIndex + (transition_number * kEntrySize) + kEntryTargetIndex; in ToTargetIndex()
|
D | string-set.h | 23 static const int kEntrySize = 1; variable
|
D | feedback-vector.h | 897 return number_of_entries * kEntrySize; in SizeFor() 902 return entry * kEntrySize; in MapIndexForEntry() 907 return (entry * kEntrySize) + kHandlerOffset; in HandlerIndexForEntry() 910 static constexpr int kEntrySize = 2; variable
|
D | compilation-cache-table.cc | 282 STATIC_ASSERT(CompilationCacheShape::kEntrySize == 3); in LookupEval() 333 STATIC_ASSERT(CompilationCacheShape::kEntrySize == 3); in PutEval() 412 for (int i = 0; i < kEntrySize; i++) { in RemoveEntry()
|
D | compilation-cache-table.h | 47 static const int kEntrySize = 3; variable
|
D | ordered-hash-table.cc | 35 HashTableStartIndex() + num_buckets + (capacity * kEntrySize), in Allocate() 213 int index = HashTableStartIndex() + nof_buckets + (i * kEntrySize); in ConvertToKeysArray() 690 capacity * Derived::kEntrySize); in Initialize() 702 for (int j = 0; j < Derived::kEntrySize; j++) { in Initialize() 890 for (int j = 0; j < Derived::kEntrySize; j++) { in Delete() 943 for (int i = 0; i < Derived::kEntrySize; ++i) { in Rehash()
|
D | ordered-hash-table-inl.h | 72 DCHECK_LE(static_cast<unsigned>(relative_index), Derived::kEntrySize); in GetDataEntry()
|
D | transitions-inl.h | 332 return (length() - kFirstIndex) / kEntrySize; in Capacity()
|
D | feedback-vector.cc | 1379 index < types->length(); index += SimpleNumberDictionary::kEntrySize) { in GetSourcePositions() 1487 index_ += kEntrySize; in AdvancePolymorphic() 1490 index_ += kEntrySize; in AdvancePolymorphic()
|
D | objects.cc | 4432 number_of_all_descriptors() * kEntrySize); in Initialize() 5756 for (int j = 1; j < Shape::kEntrySize; j++) { in Rehash() 5783 Object temp[Shape::kEntrySize]; in Swap() 5785 for (int j = 0; j < Shape::kEntrySize; j++) { in Swap() 5789 for (int j = 1; j < Shape::kEntrySize; j++) { in Swap() 5793 for (int j = 1; j < Shape::kEntrySize; j++) { in Swap() 6070 DCHECK(Shape::kEntrySize != 3 || in DeleteEntry() 6091 if (Shape::kEntrySize == 3) dictionary->DetailsAtPut(entry, details); in AtPut()
|
D | js-objects-inl.h | 910 NumberDictionary::kEntrySize; in ACCESSORS()
|
/third_party/skia/src/codec/ |
D | SkParseEncodedOrigin.cpp | 20 const uint32_t kEntrySize = 12; in parse_encoded_origin() local 21 const auto max = SkTo<uint32_t>((data_length - offset - 2) / kEntrySize); in parse_encoded_origin() 32 for (uint32_t i = 0; i < numEntries; i++, data += kEntrySize) { in parse_encoded_origin()
|
/third_party/node/deps/v8/src/date/ |
D | dateparser.h | 266 static const int kEntrySize = kValueOffset + 1; variable 267 static const int8_t array[][kEntrySize];
|
D | dateparser.cc | 120 DateParser::KeywordTable::array[][DateParser::KeywordTable::kEntrySize] = {
|
/third_party/node/deps/v8/src/diagnostics/ |
D | objects-debug.cc | 1352 for (int offset = 0; offset < Derived::kEntrySize; offset++) { in SmallOrderedHashTableVerify() 1360 for (int offset = 0; offset < Derived::kEntrySize; offset++) { in SmallOrderedHashTableVerify() 1373 for (int offset = 0; offset < kEntrySize; offset++) { in SmallOrderedHashMapVerify() 1386 for (int offset = 0; offset < kEntrySize; offset++) { in SmallOrderedHashSetVerify() 1400 for (int offset = 0; offset < kEntrySize; offset++) { in SmallOrderedNameDictionaryVerify()
|
D | disassembler.cc | 154 if (offset_in_extref_table % ExternalReferenceTable::kEntrySize != 0) { in RootRelativeName()
|
/third_party/node/deps/v8/src/builtins/ |
D | builtins-collections-gen.cc | 803 IntPtrConstant(CollectionType::kEntrySize)), in FindOrderedHashTableEntry() 1558 IntPtrMul(var_index.value(), IntPtrConstant(TableType::kEntrySize)), in NextSkipHoles() 1730 IntPtrMul(occupancy, IntPtrConstant(OrderedHashMap::kEntrySize)), in StoreOrderedHashMapNewEntry() 1902 IntPtrMul(occupancy, IntPtrConstant(OrderedHashSet::kEntrySize)), in StoreOrderedHashSetNewEntry() 2612 IntPtrMul(entry, IntPtrConstant(EphemeronHashTable::kEntrySize)), in KeyIndexFromEntry()
|