Searched refs:currentSize (Results 1 - 8 of 8) sorted by relevance
/arkcompiler/ets_runtime/ecmascript/mem/ |
H A D | shared_mem_controller.cpp | 23 size_t currentSize = sheap_->GetHeapObjectSize(); in RecordAllocationForIdle() local 24 if (sharedSpaceAllocSizeSinceIdle_ == 0 || currentSize < sharedSpaceAllocSizeSinceIdle_) { in RecordAllocationForIdle() 25 sharedSpaceAllocSizeSinceIdle_ = currentSize; in RecordAllocationForIdle() 29 recordedSharedSpaceAllocations_.Push(std::make_pair(currentSize - sharedSpaceAllocSizeSinceIdle_, in RecordAllocationForIdle() 31 sharedSpaceAllocSizeSinceIdle_ = currentSize; in RecordAllocationForIdle()
|
H A D | mem_controller.cpp | 27 size_t MemController::CalculateAllocLimit(size_t currentSize, size_t minSize, size_t maxSize, size_t newSpaceCapacity, in CalculateAllocLimit() argument 30 const uint64_t limit = std::max(static_cast<uint64_t>(currentSize * factor), in CalculateAllocLimit() 31 static_cast<uint64_t>(currentSize) + minAllocLimitGrowingStep_) + in CalculateAllocLimit() 35 const uint64_t halfToMaxSize = (static_cast<uint64_t>(currentSize) + maxSize) / 2; in CalculateAllocLimit()
|
H A D | idle_gc_trigger.cpp | 109 size_t currentSize = oldSpace->GetHeapObjectSize() + hugeObjectSpace->GetHeapObjectSize(); in ReachIdleLocalOldGCThresholds() local 110 if (currentSize >= idleSizeLimit) { in ReachIdleLocalOldGCThresholds()
|
H A D | mem_controller.h | 48 size_t CalculateAllocLimit(size_t currentSize, size_t minSize, size_t maxSize, size_t newSpaceCapacity,
|
/arkcompiler/ets_runtime/ecmascript/tests/ |
H A D | template_map_test.cpp | 246 int currentSize = 128, atLeastSize = 33; in HWTEST_F_L0() local 247 EXPECT_EQ(TemplateMap::RecalculateTableSize(currentSize, atLeastSize), currentSize); in HWTEST_F_L0() local 249 EXPECT_EQ(TemplateMap::RecalculateTableSize(currentSize, atLeastSize - 1), currentSize / 2); in HWTEST_F_L0() local 251 currentSize = TemplateMap::MIN_SIZE * 4; in HWTEST_F_L0() 252 for (int i = currentSize; i >= 0; i--) { in HWTEST_F_L0() 253 EXPECT_EQ(TemplateMap::RecalculateTableSize(currentSize, i), currentSize); in HWTEST_F_L0() local
|
/arkcompiler/ets_runtime/ecmascript/ |
H A D | tagged_hash_table.h | 140 inline static int RecalculateTableSize(int currentSize, int atLeastSize) in RecalculateTableSize() argument 142 // When the filled entries is greater than a quart of currentSize in RecalculateTableSize() 144 if (atLeastSize > (currentSize / 4)) { // 4 : quarter in RecalculateTableSize() 145 return currentSize; in RecalculateTableSize() 152 return currentSize; in RecalculateTableSize() 174 int currentSize = Size(); in IsNeedGrowHashTable() local 179 if (numberFilled + neededFree <= currentSize) { in IsNeedGrowHashTable() 313 int currentSize = this->Size(); in Rehash() local 315 for (int i = 0; i < currentSize; i++) { in Rehash()
|
/arkcompiler/ets_runtime/ecmascript/base/ |
H A D | sort_helper.h | 68 int currentSize = static_cast<int>(tmp_->GetLength()); in GetTempArray() local 69 if (currentSize >= minSize) { in GetTempArray()
|
/arkcompiler/runtime_core/static_core/runtime/mem/ |
H A D | freelist_allocator-inl.h | 123 size_t currentSize = in Alloc() local 125 AllocConfigT::AddToCrossingMap(ToVoidPtr(memoryPointer), currentSize); in Alloc() local 161 size_t currentSize = in FreeUnsafe() local 176 AllocConfigT::RemoveFromCrossingMap(mem, currentSize, nextObject, prevObject, prevSize); in FreeUnsafe() 728 size_t currentSize = current->GetSize(); in FindTheMostSuitableBlockInOrderedList() local 729 if (currentSize < size) { in FindTheMostSuitableBlockInOrderedList() 732 while (currentSize != size) { in FindTheMostSuitableBlockInOrderedList() 745 currentSize = nextSize; in FindTheMostSuitableBlockInOrderedList()
|
Completed in 8 milliseconds