Home
last modified time | relevance | path

Searched refs:kEntrySize (Results 1 – 25 of 26) sorted by relevance

12

/external/v8/src/objects/
Dhash-table.h163 static const int kEntrySize = Shape::kEntrySize; variable
164 STATIC_ASSERT(kEntrySize > 0);
172 (FixedArray::kMaxLength - kElementsStartIndex) / kEntrySize;
182 return (entry * kEntrySize) + kElementsStartIndex; in EntryToIndex()
211 static const int kMaxRegularEntry = kMaxRegularCapacity / kEntrySize;
269 static const int kEntrySize = 2; variable
344 static const int kEntrySize = 1; variable
Ddescriptor-array.h152 static const int kEntrySize = 3; variable
177 return kFirstIndex + (descriptor_number * kEntrySize) + kEntryDetailsIndex; in ToDetailsIndex()
182 return kFirstIndex + (descriptor_number * kEntrySize) + kEntryKeyIndex; in ToKeyIndex()
186 return kFirstIndex + (descriptor_number * kEntrySize) + kEntryValueIndex; in ToValueIndex()
Ddictionary.h95 STATIC_ASSERT(Dictionary::kEntrySize == 3); in DetailsAt()
104 STATIC_ASSERT(Dictionary::kEntrySize == 3); in DetailsAtPut()
118 static const int kEntrySize = 3; variable
207 static const int kEntrySize = 1; // Overrides NameDictionaryShape::kEntrySize variable
247 static const int kEntrySize = 3; variable
256 static const int kEntrySize = 2; variable
Dordered-hash-table.h132 return kHashTableStartIndex + NumberOfBuckets() + (entry * kEntrySize); in EntryToIndex()
190 static const int kEntrySize = entrysize + 1; variable
195 (1 + (kEntrySize * kLoadFactor));
449 DCHECK_LE(static_cast<unsigned>(relative_index), Derived::kEntrySize); in GetDataEntry()
506 return capacity * Derived::kEntrySize * kPointerSize; in DataTableSizeFor()
523 int offset_in_datatable = entry * Derived::kEntrySize * kPointerSize; in GetDataEntryOffset()
548 static const int kEntrySize = 1; variable
568 static const int kEntrySize = 2; variable
Dstring-table.h48 static const int kEntrySize = 1; variable
102 static const int kEntrySize = 1; variable
Dordered-hash-table.cc30 kHashTableStartIndex + num_buckets + (capacity * kEntrySize), pretenure); in Allocate()
132 int index = kHashTableStartIndex + nof_buckets + (i * kEntrySize); in ConvertToKeysArray()
344 capacity * Derived::kEntrySize); in Initialize()
347 for (int j = 0; j < Derived::kEntrySize; j++) { in Initialize()
363 for (int j = 0; j < Derived::kEntrySize; j++) { in Initialize()
454 for (int j = 0; j < Derived::kEntrySize; j++) { in Delete()
489 for (int i = 0; i < Derived::kEntrySize; ++i) { in Rehash()
Dcompilation-cache.h37 static const int kEntrySize = 3; variable
/external/bsdiff/
Dendsley_patch_writer_unittest.cc151 size_t kEntrySize = 1000; // must be even for this test. in TEST_F() local
153 size_t kNewSize = kEntrySize * kNumEntries; // 3 MB in TEST_F()
164 ControlEntry entry(kEntrySize / 2, kEntrySize / 2, -1); in TEST_F()
/external/v8/src/
Dtransitions.h251 static const int kEntrySize = 2; variable
255 return kFirstIndex + (transition_number * kEntrySize) + kEntryKeyIndex; in ToKeyIndex()
259 return kFirstIndex + (transition_number * kEntrySize) + kEntryTargetIndex; in ToTargetIndex()
Ddateparser.h267 static const int kEntrySize = kValueOffset + 1; variable
268 static const int8_t array[][kEntrySize];
Ddateparser.cc120 array[][DateParser::KeywordTable::kEntrySize] = {
Dtransitions-inl.h204 return (length() - kFirstIndex) / kEntrySize; in Capacity()
Dfeedback-vector.cc1226 index < types->length(); index += SimpleNumberDictionary::kEntrySize) { in GetSourcePositions()
1276 index += SimpleNumberDictionary::kEntrySize) { in ConvertToJSObject()
Dobjects-debug.cc1358 for (int offset = 0; offset < Derived::kEntrySize; offset++) { in SmallOrderedHashTableVerify()
1366 for (int offset = 0; offset < Derived::kEntrySize; offset++) { in SmallOrderedHashTableVerify()
1374 for (int offset = 0; offset < Derived::kEntrySize; offset++) { in SmallOrderedHashTableVerify()
Dobjects-inl.h1688 return (length() - kFirstIndex) / kEntrySize; in number_of_descriptors_storage()
2925 DCHECK(Dictionary::kEntrySize == 2 || Dictionary::kEntrySize == 3); in SetEntry()
Dobjects-body-descriptors-inl.h241 for (int j = 0; j < Derived::kEntrySize; j++) { in IterateBody()
Dcode-stub-assembler.cc3423 static const int kDataTableLength = kCapacity * CollectionType::kEntrySize; in AllocateOrderedHashTable()
3485 capacity, IntPtrConstant(CollectionType::kEntrySize * kPointerSize)); in AllocateSmallOrderedHashTable()
3598 IntPtrConstant(CollectionType::kEntrySize)), in FindOrderedHashTableEntry()
7549 IntPtrMul(entry, IntPtrConstant(Dictionary::kEntrySize)); in EntryToIndex()
7959 TNode<IntPtrT> factor = IntPtrConstant(Array::kEntrySize); in LookupLinear()
7972 -Array::kEntrySize, INTPTR_PARAMETERS, IndexAdvanceMode::kPre); in LookupLinear()
8001 TNode<Int32T> entry_size = Int32Constant(Array::kEntrySize); in EntryIndexToIndex()
8146 DescriptorArray::kEntrySize, INTPTR_PARAMETERS, in DescriptorArrayForEach()
Dobjects.cc15675 NumberDictionary::kEntrySize; in ShouldConvertToSlowElements()
15738 NumberDictionary::kEntrySize; in ShouldConvertToFastElements()
16791 for (int j = 0; j < Shape::kEntrySize; j++) { in Rehash()
16818 Object* temp[Shape::kEntrySize]; in Swap()
16819 for (int j = 0; j < Shape::kEntrySize; j++) { in Swap()
16822 for (int j = 0; j < Shape::kEntrySize; j++) { in Swap()
16825 for (int j = 0; j < Shape::kEntrySize; j++) { in Swap()
17724 for (int i = 0; i < kEntrySize; i++) { in Age()
17741 for (int i = 0; i < kEntrySize; i++) { in Remove()
17797 DCHECK(Shape::kEntrySize != 3 || in DeleteEntry()
[all …]
Delements.cc2043 NumberDictionary::kEntrySize * in DeleteCommon()
2070 NumberDictionary::kEntrySize > in DeleteCommon()
/external/skia/src/codec/
DSkJpegCodec.cpp84 const uint32_t kEntrySize = 12; in is_orientation_marker() local
85 const auto max = SkTo<uint32_t>((data_length - offset - 2) / kEntrySize); in is_orientation_marker()
93 for (uint32_t i = 0; i < numEntries; i++, data += kEntrySize) { in is_orientation_marker()
/external/skqp/src/codec/
DSkJpegCodec.cpp84 const uint32_t kEntrySize = 12; in is_orientation_marker() local
85 const auto max = SkTo<uint32_t>((data_length - offset - 2) / kEntrySize); in is_orientation_marker()
93 for (uint32_t i = 0; i < numEntries; i++, data += kEntrySize) { in is_orientation_marker()
/external/v8/src/ic/
Daccessor-assembler.cc107 const int kEntrySize = 2; in HandlePolymorphicCase() local
114 SmiConstant(min_feedback_capacity * kEntrySize))); in HandlePolymorphicCase()
118 int map_index = i * kEntrySize; in HandlePolymorphicCase()
119 int handler_index = i * kEntrySize + 1; in HandlePolymorphicCase()
146 Node* start_index = IntPtrConstant(kUnrolledIterations * kEntrySize); in HandlePolymorphicCase()
166 kEntrySize, INTPTR_PARAMETERS, IndexAdvanceMode::kPost); in HandlePolymorphicCase()
334 IntPtrMul(descriptor, IntPtrConstant(DescriptorArray::kEntrySize)); in LoadDescriptorValueOrFieldType()
971 Node* factor = IntPtrConstant(DescriptorArray::kEntrySize); in HandleStoreICTransitionMapHandlerCase()
/external/v8/src/builtins/
Dbuiltins-collections-gen.cc1123 IntPtrMul(var_index.value(), IntPtrConstant(TableType::kEntrySize)), in NextSkipHoles()
1292 IntPtrMul(occupancy, IntPtrConstant(OrderedHashMap::kEntrySize)), in StoreOrderedHashMapNewEntry()
1460 IntPtrMul(occupancy, IntPtrConstant(OrderedHashSet::kEntrySize)), in StoreOrderedHashSetNewEntry()
2159 IntPtrMul(entry, IntPtrConstant(EphemeronHashTable::kEntrySize)), in KeyIndexFromEntry()
/external/v8/src/heap/
Dmark-compact.cc2011 trim * TransitionArray::kEntrySize); in CompactTransitionArray()
2029 to_trim * DescriptorArray::kEntrySize); in TrimDescriptorArray()
/external/v8/src/compiler/
Djs-call-reducer.cc3688 node, OrderedHashMap::kEntrySize, factory()->empty_ordered_hash_map(), in ReduceJSCall()
3700 node, OrderedHashSet::kEntrySize, factory()->empty_ordered_hash_set(), in ReduceJSCall()

12