Home
last modified time | relevance | path

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

/arkcompiler/ets_runtime/ecmascript/serializer/
H A Dserialize_chunk.h55 size_t oldCapacity = end_ - begin_;
57 if (oldCapacity == 0U) {
75 top_ = begin_ + oldCapacity;
/arkcompiler/ets_runtime/ecmascript/js_api/
H A Djs_api_stack.h71 inline static uint32_t ComputeCapacity(uint32_t oldCapacity) in ComputeCapacity() argument
73 uint32_t newCapacity = oldCapacity + (oldCapacity >> 1U); in ComputeCapacity()
H A Djs_api_deque.h84 inline static uint32_t ComputeCapacity(uint32_t oldCapacity) in ComputeCapacity() argument
86 uint32_t newCapacity = oldCapacity << 1U; in ComputeCapacity()
90 uint32_t oldCapacity, uint32_t first, uint32_t last);
H A Djs_api_queue.h79 inline static uint32_t ComputeCapacity(uint32_t oldCapacity) in ComputeCapacity() argument
81 uint32_t newCapacity = oldCapacity + (oldCapacity >> 1U); in ComputeCapacity()
H A Djs_api_arraylist.h92 inline static uint32_t ComputeCapacity(uint32_t oldCapacity) in ComputeCapacity() argument
94 uint32_t newCapacity = oldCapacity + (oldCapacity >> 1U); in ComputeCapacity()
H A Djs_api_plain_array.h79 inline static uint32_t ComputeCapacity(uint32_t oldCapacity) in ComputeCapacity() argument
81 uint32_t newCapacity = oldCapacity + (oldCapacity >> 1U); in ComputeCapacity()
H A Djs_api_deque.cpp94 uint32_t oldCapacity, uint32_t first, uint32_t last) in GrowCapacity()
98 uint32_t newCapacity = ComputeCapacity(oldCapacity); in GrowCapacity()
204 uint32_t oldCapacity = oldElements->GetLength(); in OwnKeys() local
205 uint32_t newCapacity = ComputeCapacity(oldCapacity); in OwnKeys()
223 uint32_t oldCapacity = oldElements->GetLength(); in OwnEnumKeys() local
224 uint32_t newCapacity = ComputeCapacity(oldCapacity); in OwnEnumKeys()
93 GrowCapacity(JSThread *thread, const JSHandle<JSAPIDeque> &deque, uint32_t oldCapacity, uint32_t first, uint32_t last) GrowCapacity() argument
H A Djs_api_bitvector.h88 inline static uint32_t ComputeCapacity(uint32_t oldCapacity) in ComputeCapacity() argument
90 uint32_t newCapacity = oldCapacity + (oldCapacity >> 1U); in ComputeCapacity()
H A Djs_api_lightweightmap.h101 static inline uint32_t ComputeCapacity(uint32_t oldCapacity) in ComputeCapacity() argument
103 uint32_t newCapacity = oldCapacity + (oldCapacity >> 1U); in ComputeCapacity()
H A Djs_api_vector.cpp84 uint32_t oldCapacity = elementData->GetLength(); in IncreaseCapacityTo() local
86 if (oldCapacity < tempCapacity) { in IncreaseCapacityTo()
88 thread->GetEcmaVM()->GetFactory()->CopyArray(elementData, oldCapacity, tempCapacity); in IncreaseCapacityTo()
353 uint32_t oldCapacity = elementData->GetLength(); in GrowCapacity() local
355 uint32_t newCapacity = oldCapacity * 2; in GrowCapacity()
364 thread->GetEcmaVM()->GetFactory()->CopyArray(elementData, oldCapacity, newCapacity); in GrowCapacity()
H A Djs_api_queue.cpp162 uint32_t oldCapacity = oldElements->GetLength(); in OwnKeys() local
163 uint32_t newCapacity = ComputeCapacity(oldCapacity); in OwnKeys()
181 uint32_t oldCapacity = oldElements->GetLength(); in OwnEnumKeys() local
182 uint32_t newCapacity = ComputeCapacity(oldCapacity); in OwnEnumKeys()
H A Djs_api_arraylist.cpp381 uint32_t oldCapacity = oldElements->GetLength(); in GrowCapacity() local
382 if (capacity < oldCapacity) { in GrowCapacity()
387 thread->GetEcmaVM()->GetFactory()->CopyArray(oldElements, oldCapacity, newCapacity); in GrowCapacity()
/arkcompiler/ets_runtime/ecmascript/
H A Djs_object-inl.h384 inline uint32_t JSObject::ComputeElementCapacity(uint32_t oldCapacity, bool isNew) in ComputeElementCapacity() argument
386 uint32_t newCapacity = isNew ? oldCapacity : (oldCapacity + (oldCapacity >> 1U)); in ComputeElementCapacity()
390 inline uint32_t JSObject::ComputeElementCapacityHighGrowth(uint32_t oldCapacity) in ComputeElementCapacityHighGrowth() argument
392 uint32_t newCapacity = oldCapacity * 2; in ComputeElementCapacityHighGrowth()
396 inline uint32_t JSObject::ComputeElementCapacityWithHint(uint32_t oldCapacity, uint32_t hint) in ComputeElementCapacityWithHint() argument
399 if ((oldCapacity >= hint) || (hint < MIN_ELEMENTS_HINT_LENGTH) || (hint >= MAX_ELEMENTS_HINT_LENGTH)) { in ComputeElementCapacityWithHint()
402 if ((hint / oldCapacity) <= ELEMENTS_HINT_FACTOR) { in ComputeElementCapacityWithHint()
408 inline uint32_t JSObject::ComputeNonInlinedFastPropsCapacity(JSThread *thread, uint32_t oldCapacity, in ComputeNonInlinedFastPropsCapacity() argument
[all...]
H A Dtagged_hash_array.cpp105 uint32_t oldCapacity = oldTab->GetLength(); in Resize() local
106 if (oldCapacity >= MAXIMUM_CAPACITY) { in Resize()
113 for (uint32_t j = 0; j < oldCapacity; ++j) { in Resize()
118 RBTreeNode::Divide(thread, newTab, oldValue, j, oldCapacity); in Resize()
125 NodeDisperse(thread, newTab, oldValue.GetTaggedValue(), j, oldCapacity); in Resize()
133 JSTaggedValue nodeVa, int index, int oldCapacity) in NodeDisperse()
142 if (((LinkedNode::Cast(nodeVa.GetTaggedObject())->GetHash().GetInt()) & oldCapacity) == 0) { in NodeDisperse()
165 newTab->Set(thread, index + oldCapacity, hiHead); in NodeDisperse()
132 NodeDisperse(JSThread *thread, const JSHandle<TaggedHashArray> &newTab, JSTaggedValue nodeVa, int index, int oldCapacity) NodeDisperse() argument
H A Dweak_vector.cpp50 uint32_t oldCapacity = old->GetCapacity(); in Grow() local
51 ASSERT(newCapacity > oldCapacity); in Grow()
52 if (oldCapacity == MAX_VECTOR_INDEX) { in Grow()
61 JSHandle<TaggedArray> newVec = factory->CopyArray(JSHandle<TaggedArray>(old), VectorToArrayIndex(oldCapacity), in Grow()
H A Dtagged_hash_array.h64 JSTaggedValue nodeVa, int index, int oldCapacity);
H A Dtagged_tree.cpp468 int oldCapacity = tree->Capacity(); in GrowCapacity() local
469 if (static_cast<int>(nof + 1) <= oldCapacity) { in GrowCapacity()
473 int newCapacity = ComputeCapacity(oldCapacity); in GrowCapacity()
529 int oldCapacity = static_cast<int>(tree->Capacity()); in Shrink() local
530 if (static_cast<int>(tree->NumberOfElements()) >= (oldCapacity + 1) / 4) { // 4: quarter in Shrink()
533 uint32_t newCapacity = static_cast<uint32_t>(oldCapacity - 1) >> 1; in Shrink()
H A Djs_stable_array.cpp163 uint32_t oldCapacity = ElementAccessor::GetElementsLength(thisObjHandle); in UpdateArrayCapacity() local
169 if (newCapacity > oldCapacity) { in UpdateArrayCapacity()
185 if ((oldCapacity > newCapacity) && TaggedArray::ShouldTrim(oldCapacity, newCapacity)) { in UpdateArrayCapacity()
318 uint32_t oldCapacity = ElementAccessor::GetElementsLength(thisObjHandle); in Splice() local
321 if (newCapacity > oldCapacity) { in Splice()
337 if ((oldCapacity > newCapacity) && TaggedArray::ShouldTrim(oldCapacity, newCapacity)) { in Splice()
H A Djs_object.h796 static uint32_t ComputeElementCapacity(uint32_t oldCapacity, bool isNew = false);
797 static uint32_t ComputeElementCapacityHighGrowth(uint32_t oldCapacity);
798 static uint32_t ComputeElementCapacityWithHint(uint32_t oldCapacity, uint32_t hint);
799 static uint32_t ComputeNonInlinedFastPropsCapacity(JSThread *thread, uint32_t oldCapacity,
H A Dtagged_tree.h53 inline static int ComputeCapacity(int oldCapacity) in ComputeCapacity() argument
55 int capacity = (static_cast<uint32_t>(oldCapacity) << 1) + 1; in ComputeCapacity()
H A Dobject_operator.h351 uint32_t ComputeElementCapacity(uint32_t oldCapacity);
H A Dobject_factory.cpp4409 uint32_t oldCapacity = old->GetLength(); in CopyDeque() local
4413 ASSERT(oldCapacity != 0); in CopyDeque()
4414 curIndex = (curIndex + 1) % oldCapacity; in CopyDeque()
4447 uint32_t oldCapacity = old->GetLength(); in CopyQueue() local
4451 ASSERT(oldCapacity != 0); in CopyQueue()
4452 curIndex = (curIndex + 1) % oldCapacity; in CopyQueue()
/arkcompiler/ets_runtime/ecmascript/tests/
H A Dgc_second_test.cpp212 auto oldCapacity = heap->GetOldSpace()->GetInitialCapacity(); in HWTEST_F_L0() local
217 EXPECT_NE(newCapacity, oldCapacity); in HWTEST_F_L0()
H A Djs_api_arraylist_test.cpp236 uint32_t oldCapacity = JSAPIArrayList::GetCapacity(thread, arrayList); in HWTEST_F_L0() local
237 EXPECT_EQ(oldCapacity, JSAPIArrayList::DEFAULT_CAPACITY_LENGTH); in HWTEST_F_L0()
/arkcompiler/ets_runtime/ecmascript/compiler/builtins/
H A Dbuiltins_array_stub_builder.cpp3121 GateRef oldCapacity = GetLengthOfTaggedArray(*srcElements); in Splice() local
3125 BRANCH(Int32GreaterThan(newCapacity, oldCapacity), &grow, &copy); in Splice()
3186 .And(Int32GreaterThan(oldCapacity, newCapacity)) in Splice()
3187 .And(Int32GreaterThan(Int32Sub(newCapacity, oldCapacity), Int32(TaggedArray::MAX_END_UNUSED))) in Splice()

Completed in 36 milliseconds