Home
last modified time | relevance | path

Searched refs:newCapacity (Results 1 - 25 of 41) sorted by relevance

12

/arkcompiler/ets_runtime/ecmascript/serializer/
H A Dserialize_chunk.h56 size_t newCapacity = 0;
58 newCapacity = INITIAL_CHUNK_CAPACITY;
60 newCapacity = (end_ - begin_) * CHUNK_CAPACITY_INCREASE_RATE;
62 void *newChunk = malloc(newCapacity);
64 LOG_ECMA_MEM(FATAL) << "malloc failed, current alloc size = " << newCapacity;
69 if (memcpy_s(newChunk, newCapacity, ToVoidPtr(begin_), end_ - begin_) != EOK) {
76 end_ = begin_ + newCapacity;
H A Dserialize_data.h117 size_t newCapacity = bufferCapacity_ * CAPACITY_INCREASE_RATE;
118 newCapacity = std::max(newCapacity, requestedSize);
119 if (newCapacity > sizeLimit_) {
122 uint8_t *newBuffer = reinterpret_cast<uint8_t *>(malloc(newCapacity));
126 if (memcpy_s(newBuffer, newCapacity, buffer_, bufferSize_) != EOK) {
133 bufferCapacity_ = newCapacity;
/arkcompiler/ets_runtime/ecmascript/
H A Dweak_vector.cpp48 JSHandle<WeakVector> WeakVector::Grow(const JSThread *thread, const JSHandle<WeakVector> &old, uint32_t newCapacity) in Grow() argument
51 ASSERT(newCapacity > oldCapacity); in Grow()
56 if (newCapacity > MAX_VECTOR_INDEX) { in Grow()
57 newCapacity = MAX_VECTOR_INDEX; in Grow()
62 VectorToArrayIndex(newCapacity)); in Grow()
102 uint32_t newCapacity = vec->GetCapacity() + DEFAULT_GROW_SIZE; in AppendToFullVec() local
103 JSHandle<WeakVector> newVec = WeakVector::Grow(thread, JSHandle<WeakVector>(vec), newCapacity); in AppendToFullVec()
H A Dtagged_queue.h74 uint32_t newCapacity = capacity + (capacity >> 1U); in Push() local
75 newCapacity = newCapacity < capacity ? MAX_QUEUE_INDEX : newCapacity; in Push()
76 JSHandle<TaggedQueue> newQueue = factory->NewTaggedQueue(newCapacity); in Push()
83 newQueue->SetCapacity(thread, JSTaggedValue(newCapacity)); in Push()
H A Djs_object-inl.h386 uint32_t newCapacity = isNew ? oldCapacity : (oldCapacity + (oldCapacity >> 1U)); in ComputeElementCapacity() local
387 return newCapacity > MIN_ELEMENTS_LENGTH ? newCapacity : MIN_ELEMENTS_LENGTH; in ComputeElementCapacity()
392 uint32_t newCapacity = oldCapacity * 2; in ComputeElementCapacityHighGrowth() local
393 return newCapacity > MIN_ELEMENTS_LENGTH ? newCapacity : MIN_ELEMENTS_LENGTH; in ComputeElementCapacityHighGrowth()
398 uint32_t newCapacity = 0; in ComputeElementCapacityWithHint() local
400 return newCapacity; in ComputeElementCapacityWithHint()
403 newCapacity = hint; in ComputeElementCapacityWithHint()
405 return newCapacity; in ComputeElementCapacityWithHint()
411 uint32_t newCapacity = oldCapacity + thread->GetPropertiesGrowStep(); ComputeNonInlinedFastPropsCapacity() local
[all...]
H A Dlinked_hash_table.cpp103 int newCapacity = ComputeCapacity(table->NumberOfElements() + numberOfAddedElements); in GrowCapacity() local
104 JSHandle<Derived> newTable = Create(thread, newCapacity, in GrowCapacity()
127 int newCapacity = ComputeCapacityWithShrink(table->Capacity(), table->NumberOfElements() + additionalCapacity); in Shrink() local
128 if (newCapacity == table->Capacity()) { in Shrink()
132 JSHandle<Derived> newTable = Create(thread, newCapacity, in Shrink()
H A Dtagged_tree.cpp473 int newCapacity = ComputeCapacity(oldCapacity); in GrowCapacity() local
474 int length = ELEMENTS_START_INDEX + newCapacity * (Derived::ENTRY_SIZE); in GrowCapacity()
476 newTree->SetCapacity(thread, newCapacity); in GrowCapacity()
533 uint32_t newCapacity = static_cast<uint32_t>(oldCapacity - 1) >> 1; in Shrink() local
534 if (newCapacity < static_cast<uint32_t>(Derived::MIN_SHRINK_CAPACITY)) { in Shrink()
538 int length = ELEMENTS_START_INDEX + static_cast<int>(newCapacity) * (Derived::ENTRY_SIZE); in Shrink()
545 newTree->SetCapacity(thread, newCapacity); in Shrink()
H A Dlinked_hash_table.h140 int newCapacity = ComputeCapacity(atLeastSpaceFor); in ComputeCapacityWithShrink() local
141 ASSERT_PRINT(newCapacity > atLeastSpaceFor, "new capacity must greater than atLeastSpaceFor"); in ComputeCapacityWithShrink()
143 if (newCapacity < Derived::MIN_SHRINK_CAPACITY) { in ComputeCapacityWithShrink()
146 return newCapacity; in ComputeCapacityWithShrink()
H A Djs_stable_array.cpp165 uint32_t newCapacity = len - actualDeleteCount + insertCount; in UpdateArrayCapacity() local
169 if (newCapacity > oldCapacity) { in UpdateArrayCapacity()
170 srcElementsHandle.Update(JSObject::GrowElementsCapacity(thread, thisObjHandle, newCapacity)); in UpdateArrayCapacity()
185 if ((oldCapacity > newCapacity) && TaggedArray::ShouldTrim(oldCapacity, newCapacity)) { in UpdateArrayCapacity()
186 srcElementsHandle->Trim(thread, newCapacity); in UpdateArrayCapacity()
188 for (uint32_t idx = newCapacity; idx < len; idx++) { in UpdateArrayCapacity()
206 JSHandle<JSTaggedValue> newLenHandle(thread, JSTaggedValue(newCapacity)); in UpdateArrayCapacity()
320 uint32_t newCapacity = len - actualDeleteCount + insertCount; in Splice() local
321 if (newCapacity > oldCapacit in Splice()
[all...]
H A Dtagged_hash_array.cpp109 uint32_t newCapacity = Capacity << 1; in Resize() local
110 JSTaggedValue newTabValue = Create(thread, newCapacity); in Resize()
122 int newhash = (node->GetHash().GetInt()) & (newCapacity - 1); in Resize()
/arkcompiler/ets_runtime/ecmascript/js_api/
H A Djs_api_stack.h73 uint32_t newCapacity = oldCapacity + (oldCapacity >> 1U); in ComputeCapacity() local
74 return newCapacity > DEFAULT_CAPACITY_LENGTH ? newCapacity : DEFAULT_CAPACITY_LENGTH; in ComputeCapacity()
H A Djs_api_queue.cpp47 uint32_t newCapacity = 0; in GrowCapacity() local
49 newCapacity = ComputeCapacity(capacity); in GrowCapacity()
50 newElements = thread->GetEcmaVM()->GetFactory()->CopyArray(oldElements, oldLength, newCapacity); in GrowCapacity()
52 newCapacity = ComputeCapacity(capacity); in GrowCapacity()
53 newElements = thread->GetEcmaVM()->GetFactory()->CopyQueue(oldElements, newCapacity, front, tail); in GrowCapacity()
163 uint32_t newCapacity = ComputeCapacity(oldCapacity); in OwnKeys() local
167 thread->GetEcmaVM()->GetFactory()->CopyQueue(oldElements, newCapacity, front, tail); in OwnKeys()
182 uint32_t newCapacity = ComputeCapacity(oldCapacity); in OwnEnumKeys() local
186 thread->GetEcmaVM()->GetFactory()->CopyQueue(oldElements, newCapacity, front, tail); in OwnEnumKeys()
H A Djs_api_lightweightset.cpp48 uint32_t newCapacity = capacity << 1U; in Add() local
49 hashArray = thread->GetEcmaVM()->GetFactory()->CopyArray(hashArray, capacity, newCapacity); in Add()
50 valueArray = thread->GetEcmaVM()->GetFactory()->CopyArray(valueArray, capacity, newCapacity); in Add()
148 uint32_t newCapacity = capacity; in EnsureCapacity() local
153 while (newCapacity <= minimumCapacity) { in EnsureCapacity()
154 newCapacity = newCapacity << 1U; in EnsureCapacity()
156 obj->SizeCopy(thread, obj, capacity, newCapacity); in EnsureCapacity()
160 uint32_t capacity, uint32_t newCapacity) in SizeCopy()
164 hashArray = thread->GetEcmaVM()->GetFactory()->CopyArray(hashArray, capacity, newCapacity); in SizeCopy()
159 SizeCopy(const JSThread *thread, const JSHandle<JSAPILightWeightSet> &obj, uint32_t capacity, uint32_t newCapacity) SizeCopy() argument
[all...]
H A Djs_api_deque.h86 uint32_t newCapacity = oldCapacity << 1U; in ComputeCapacity() local
87 return newCapacity > DEFAULT_CAPACITY_LENGTH ? newCapacity : DEFAULT_CAPACITY_LENGTH; in ComputeCapacity()
H A Djs_api_queue.h81 uint32_t newCapacity = oldCapacity + (oldCapacity >> 1U); in ComputeCapacity() local
82 return newCapacity > DEFAULT_CAPACITY_LENGTH ? newCapacity : DEFAULT_CAPACITY_LENGTH; in ComputeCapacity()
H A Djs_api_arraylist.h94 uint32_t newCapacity = oldCapacity + (oldCapacity >> 1U); in ComputeCapacity() local
95 return newCapacity > DEFAULT_CAPACITY_LENGTH ? newCapacity : DEFAULT_CAPACITY_LENGTH; in ComputeCapacity()
H A Djs_api_plain_array.h81 uint32_t newCapacity = oldCapacity + (oldCapacity >> 1U); in ComputeCapacity() local
82 return newCapacity > DEFAULT_CAPACITY_LENGTH ? newCapacity : DEFAULT_CAPACITY_LENGTH; in ComputeCapacity()
H A Djs_api_vector.cpp76 void JSAPIVector::IncreaseCapacityTo(JSThread *thread, const JSHandle<JSAPIVector> &vector, int32_t newCapacity) in IncreaseCapacityTo() argument
78 if (newCapacity < 0) { in IncreaseCapacityTo()
85 uint32_t tempCapacity = static_cast<uint32_t>(newCapacity); in IncreaseCapacityTo()
355 uint32_t newCapacity = oldCapacity * 2; in GrowCapacity() local
356 if (newCapacity < minCapacity) { in GrowCapacity()
357 newCapacity = minCapacity; in GrowCapacity()
360 if (newCapacity > MAX_ARRAY_SIZE) { in GrowCapacity()
361 newCapacity = (minCapacity > MAX_ARRAY_SIZE) ? MAX_VALUE : MAX_ARRAY_SIZE; in GrowCapacity()
364 thread->GetEcmaVM()->GetFactory()->CopyArray(elementData, oldCapacity, newCapacity); in GrowCapacity()
H A Djs_api_deque.cpp98 uint32_t newCapacity = ComputeCapacity(oldCapacity); in GrowCapacity() local
101 thread->GetEcmaVM()->GetFactory()->CopyDeque(oldElements, newCapacity, size, first, last); in GrowCapacity()
205 uint32_t newCapacity = ComputeCapacity(oldCapacity); in OwnKeys() local
209 thread->GetEcmaVM()->GetFactory()->CopyDeque(oldElements, newCapacity, length, firstIndex, lastIndex); in OwnKeys()
224 uint32_t newCapacity = ComputeCapacity(oldCapacity); in OwnEnumKeys() local
228 thread->GetEcmaVM()->GetFactory()->CopyDeque(oldElements, newCapacity, length, firstIndex, lastIndex); in OwnEnumKeys()
H A Djs_api_bitvector.h90 uint32_t newCapacity = oldCapacity + (oldCapacity >> 1U); in ComputeCapacity() local
91 return newCapacity > 0 ? newCapacity : 0; in ComputeCapacity()
H A Djs_api_lightweightmap.h103 uint32_t newCapacity = oldCapacity + (oldCapacity >> 1U); in ComputeCapacity() local
104 return newCapacity > DEFAULT_CAPACITY_LENGTH ? newCapacity : DEFAULT_CAPACITY_LENGTH; in ComputeCapacity()
/arkcompiler/runtime_core/static_core/compiler/optimizer/ir/
H A Dinst.cpp220 void DynamicOperands::Reallocate([[maybe_unused]] size_t newCapacity /* =0 */) in Reallocate()
222 if (newCapacity == 0) { in Reallocate()
224 newCapacity = (((capacity_ != 0U) ? capacity_ : 1U) << 1U) + IMM_2; in Reallocate()
225 } else if (newCapacity <= capacity_) { in Reallocate()
228 auto size = newCapacity * (sizeof(User) + sizeof(Inst *)) + sizeof(Inst *); in Reallocate()
233 *reinterpret_cast<Inst **>(reinterpret_cast<User *>(newStor) + newCapacity) = ownerInst; in Reallocate()
237 capacity_ = newCapacity; in Reallocate()
242 auto *newInputs = reinterpret_cast<Input *>(newStor + sizeof(User) * newCapacity) + 1; in Reallocate()
250 User *newUser = new (reinterpret_cast<User *>(newStor) + newCapacity - i - 1) User(false, i, newCapacity); in Reallocate()
[all...]
/arkcompiler/ets_runtime/ecmascript/mem/
H A Dlinear_space.cpp458 size_t newCapacity = initialCapacity_ * GROWING_FACTOR; in AdjustCapacity() local
459 SetInitialCapacity(std::min(newCapacity, maximumCapacity_)); in AdjustCapacity()
460 if (newCapacity == maximumCapacity_) { in AdjustCapacity()
474 size_t newCapacity = initialCapacity_ / GROWING_FACTOR; in AdjustCapacity() local
475 SetInitialCapacity(std::max(newCapacity, minimumCapacity_)); in AdjustCapacity()
/arkcompiler/ets_runtime/ecmascript/tests/
H A Djs_api_arraylist_test.cpp221 uint32_t newCapacity = JSAPIArrayList::GetCapacity(thread, arrayList); in GetCapacityCommon() local
222 return newCapacity; in GetCapacityCommon()
238 auto newCapacity = GetCapacityCommon(thread, arrayList, addElementNums, currentCapacity); in HWTEST_F_L0() local
239 EXPECT_EQ(newCapacity, currentCapacity); in HWTEST_F_L0()
242 newCapacity = JSAPIArrayList::GetCapacity(thread, arrayList); in HWTEST_F_L0()
243 EXPECT_EQ(newCapacity, currentCapacity + 1230U); in HWTEST_F_L0()
257 auto newCapacity = GetCapacityCommon(thread, arrayList, addElementNums, currentCapacity); in HWTEST_F_L0() local
258 EXPECT_EQ(newCapacity, currentCapacity); in HWTEST_F_L0()
/arkcompiler/runtime_core/static_core/runtime/include/
H A Dthread.h207 uint32_t newCapacity = capacity_ * 3U / 2U; // expand by 1.5 in ExtendIfNeeded() local
208 LockedObjectInfo *newStorage = allocator_.allocate(newCapacity); in ExtendIfNeeded()
214 capacity_ = newCapacity; in ExtendIfNeeded()

Completed in 18 milliseconds

12