Home
last modified time | relevance | path

Searched refs:Size (Results 1 – 25 of 64) sorted by relevance

123

/ark/runtime_core/runtime/
Dobject_header_config.h49 using Size = uint32_t;
50 static constexpr Size BITS = 32U;
51 static constexpr Size LOCK_THREADID_SIZE = 13U;
59 using Size = uint64_t;
60 static constexpr Size BITS = 64UL;
61 static constexpr Size LOCK_THREADID_SIZE = 29UL;
69 using Size = uint16_t;
70 static constexpr Size BITS = 16U;
71 static constexpr Size LOCK_THREADID_SIZE = 7U;
Dimtable_builder.cpp23 if (cda->IsInterface() || itable.Size() == 0U) { in Build()
28 for (size_t i = 0; i < itable.Size(); i++) { in Build()
31 ifm_num += methods.Size(); in Build()
46 if (is_interface || itable.Size() == 0U) { in Build()
51 for (size_t i = 0; i < itable.Size(); i++) { in Build()
54 ifm_num += methods.Size(); in Build()
79 for (size_t i = 0; i < itable.Size(); i++) { in UpdateClass()
84 for (size_t j = 0; j < itf_methods.Size(); j++) { in UpdateClass()
Dstring_table.cpp73 size_t StringTable::Size() in Size() function in panda::StringTable
75 return internal_table_.Size() + table_.Size(); in Size()
229 size_t StringTable::Table::Size() in Size() function in panda::StringTable::Table
Dstring_table.h62 size_t Size();
80 size_t Size();
/ark/js_runtime/ecmascript/tests/
Djs_tagged_queue_test.cpp61 EXPECT_TRUE(queue->Size() == 0); in HWTEST_F_L0()
74 EXPECT_EQ(queue2->Size(), 1); in HWTEST_F_L0()
80 EXPECT_EQ(queue3->Size(), 2); in HWTEST_F_L0()
87 EXPECT_EQ(queue4->Size(), 3); in HWTEST_F_L0()
94 EXPECT_EQ(queue5->Size(), 4); in HWTEST_F_L0()
100 EXPECT_EQ(queue5->Size(), 3); in HWTEST_F_L0()
104 EXPECT_EQ(queue5->Size(), 2); in HWTEST_F_L0()
108 EXPECT_EQ(queue5->Size(), 1); in HWTEST_F_L0()
112 EXPECT_EQ(queue5->Size(), 0); in HWTEST_F_L0()
/ark/runtime_core/libpandabase/utils/
Dbit_memory_region.h55 if (bit_ != region_.Size() && !region_.ReadBit(bit_)) { in Iterator()
78 ASSERT(bit_ + n < region_.Size());
102 … for (bit_ += step; bit_ > 0 && bit_ != region_.Size() && !region_.ReadBit(bit_); bit_ += step) { in Next()
105 bit_ = region_.Size(); in Next()
127 return Iterator(*this, Size()); in end()
180 ASSERT(sizeof(T) * BITS_PER_BYTE >= Size()); in ReadAll()
181 return Read(0, Size()); in ReadAll()
241 size_t Size() const in Size() function
248 ASSERT(first < Size()); in Popcount()
249 ASSERT((first + length) <= Size()); in Popcount()
[all …]
Dbit_memory_region-inl.h31 if (Size() >= BITS_PER_WORD) { in Dump()
33 size_t width = BITS_PER_WORD - (BITS_PER_HEX_DIGIT - Size() % BITS_PER_HEX_DIGIT); in Dump()
34 for (ssize_t i = Size() - width; i >= 0; i -= width) { in Dump()
/ark/runtime_core/runtime/tests/
Dstring_table_test.cpp68 ASSERT_EQ(table.Size(), 0); in TEST_F()
82 ASSERT_EQ(table.Size(), 1); in TEST_F()
95 ASSERT_EQ(table.Size(), 1); in TEST_F()
112 ASSERT_EQ(table.Size(), 1); in TEST_F()
131 ASSERT_EQ(table.Size(), ITERATIONS); in TEST_F()
137 auto table_init_size = table->Size(); in TEST_F()
156 ASSERT_GE(table->Size(), table_init_size + 2); in TEST_F()
/ark/runtime_core/runtime/mem/
Dregion_space.cpp35 auto bitmap_data = allocator->Alloc(MarkBitmap::GetBitMapSizeInByte(Size())); in CreateMarkBitmap()
37 mark_bitmap_ = allocator->New<MarkBitmap>(this, Size(), bitmap_data); in CreateMarkBitmap()
99 for (size_t i = 0; i < occupied_.Size(); ++i) { in AllocRegion()
116 while (left + alloc_region_num <= occupied_.Size()) { in AllocLargeRegion()
146 size_t region_num = region->Size() / region_size_; in FreeRegion()
147 ASSERT(region_idx + region_num <= occupied_.Size()); in FreeRegion()
191 PoolManager::GetMmapMemPool()->FreePool(region, region->Size()); in FreeRegion()
/ark/runtime_core/verification/type/
Dtype_set.h68 size_t Size() const in Size() function
70 return Indices_.Size(); in Size()
75 return Size() == 0; in IsEmpty()
80 if (Size() == 1) { in TheOnlyType()
/ark/js_runtime/ecmascript/
Dtagged_hash_table-inl.h37 int TaggedHashTable<Derived>::Size() const in Size() function
79 int size = Size(); in GetAllKeys()
93 size_t size = Size(); in FindEntry()
137 int newSize = RecalculateTableSize(table->Size(), table->EntriesCount() + additionalSize); in Shrink()
138 if (newSize == table->Size()) { in Shrink()
153 int currentSize = Size(); in IsNeedGrowHashTable()
220 if ((newTable == nullptr) || (newTable->Size() < EntriesCount())) { in Rehash()
223 int currentSize = this->Size(); in Rehash()
261 int newSize = ComputeHashTableSize(table->Size() + numOfAddedElements); in GrowHashTable()
328 int size = Size(); in FindInsertIndex()
[all …]
Decma_string.cpp362 ASSERT(str1.Size() <= str2.Size()); in StringsAreEquals()
363 size_t size = str1.Size(); in StringsAreEquals()
379 ASSERT(dst.Size() >= src.Size()); in StringCopy()
380 if (src.Size() < SMALL_STRING_SIZE) { in StringCopy()
381 for (size_t i = 0; i < src.Size(); i++) { in StringCopy()
Dtagged_dictionary.cpp45 int size = Size(); in GetAllKeys()
65 int size = Size(); in GetAllEnumKeys()
161 int size = obj->Size(); in GetAllKeys()
185 int size = obj->Size(); in GetAllEnumKeys()
Djs_for_in_iterator.cpp81 int size = numberDic->Size(); in FastGetAllEnumKeys()
103 int size = dict->Size(); in FastGetAllEnumKeys()
165 int size = nameDic->Size(); in FastGetAllEnumKeys()
235 uint32_t len = visited->Size(); in NextInternal()
Dtagged_queue.h50 uint32_t size = queue->Size(); in Push()
112 inline uint32_t Size() in Size() function
Dfree_object.h72 ACCESSORS(Size, SIZE_OFFSET, SIZE)
/ark/runtime_core/verification/util/
Dequiv_classes.h66 size_t Size = 0; member
105 entry.Size = 0; in DisposeClassIndex()
138 lhs_cls_entry.Size += rhs_cls_entry.Size; in JoinClasses()
162 ++cls_entry.Size; in NewObjIndex()
189 --cls_entry.Size; in DisposeObjIndex()
190 if (cls_entry.Size == 0) { in DisposeObjIndex()
274 return ClsEntry(ObjClass(obj)).Size; in ClassSizeOf()
Dint_set.h59 size_t Size() const in Size() function
61 return repr_->Size(); in Size()
67 if (UNLIKELY(Size() == THRESHOLD && repr_->Type() == ReprType::SMALL)) { in Insert()
79 if (UNLIKELY(Size() >= THRESHOLD)) { in Insert()
279 if (Size() != rhs.Size()) {
314 virtual size_t Size() const = 0;
369 size_t Size() const override in Size() function
376 if (other.Size() < Size()) { in Intersect()
456 size_t sz = Size(); in InsertManyImpl()
470 sz = Size(); in InsertManyImpl()
[all …]
/ark/js_runtime/ecmascript/jobs/
Dmicro_job_queue.cpp74 LOG_ECMA(DEBUG) << "promiseQueue start length: " << promiseQueue->Size(); in EnqueueJob()
77 LOG_ECMA(DEBUG) << "promiseQueue end length: " << newPromiseQueue->Size(); in EnqueueJob()
91 LOG_ECMA(DEBUG) << "promiseQueue start length: " << promiseQueue->Size(); in ExecutePendingJob()
93 LOG_ECMA(DEBUG) << "promiseQueue end length: " << promiseQueue->Size(); in ExecutePendingJob()
/ark/runtime_core/libpandabase/os/
Dmem.h93 auto res = MakeMemReadExec(sp_.Data(), sp_.Size()); in MakeReadExec()
103 auto res = MakeMemReadOnly(sp_.Data(), sp_.Size()); in MakeReadOnly()
113 auto res = MakeMemReadWrite(sp_.Data(), sp_.Size()); in MakeReadWrite()
125 … Span<std::byte> sp(reinterpret_cast<std::byte *>(aligned), sp_.Size() + unaligned - aligned); in Align()
131 return sp_.Size(); in GetSize()
Dstacktrace.cpp280 int Size() const in Size() function in panda::Buf
311 if (res != _URC_END_OF_STACK || buf_wrapper.Size() < 0) { in GetStacktrace()
315 buf.resize(buf_wrapper.Size()); in GetStacktrace()
/ark/runtime_core/runtime/mem/gc/
Dbitmap.h42 size_t Size() const in Size() function
126 IterateOverSetBitsInRange(0, Size(), visitor); in IterateOverSetBits()
137 IterateOverBitsInRange(0, Size(), visitor); in IterateOverBits()
339 ASSERT(bit_offset <= Size()); in CheckBitOffset()
377 ASSERT(begin < Size()); in CheckBitRange()
378 ASSERT(end <= Size()); in CheckBitRange()
423 return Size() * BYTESPERCHUNK; in MemSizeInBytes()
/ark/runtime_core/verification/absint/tests/
Dreg_context_test.cpp65 EXPECT_EQ(ctx3.Size(), 0); in TEST_F()
72 EXPECT_EQ(ctx3.Size(), 1); in TEST_F()
/ark/runtime_core/libpandabase/os/unix/
Dexec.cpp28 ASSERT(args[args.Size() - 1] == nullptr && "The last argument must be nullptr"); in Exec()
/ark/runtime_core/runtime/core/
Dcore_itable_builder.h29 ASSERT(base->GetITable().Size() == 0); in Build()

123