| /arkcompiler/ets_runtime/ecmascript/mem/ |
| D | remembered_set.h | 45 bool Insert(uintptr_t begin, uintptr_t addr) in Insert() argument
47 … return GCBitsetData()->SetBit<AccessType::NON_ATOMIC>((addr - begin) >> TAGGED_TYPE_SIZE_LOG); in Insert()
50 bool InsertRange(uintptr_t begin, uintptr_t addr, uint32_t mask) in InsertRange() argument
52 return GCBitsetData()->SetBitRange((addr - begin) >> TAGGED_TYPE_SIZE_LOG, mask); in InsertRange()
55 bool AtomicInsert(uintptr_t begin, uintptr_t addr) in AtomicInsert() argument
57 return GCBitsetData()->SetBit<AccessType::ATOMIC>((addr - begin) >> TAGGED_TYPE_SIZE_LOG); in AtomicInsert()
60 void ClearBit(uintptr_t begin, uintptr_t addr) in ClearBit() argument
62 GCBitsetData()->ClearBit((addr - begin) >> TAGGED_TYPE_SIZE_LOG); in ClearBit()
65 void ClearRange(uintptr_t begin, uintptr_t start, uintptr_t end) in ClearRange() argument
68 (start - begin) >> TAGGED_TYPE_SIZE_LOG, (end - begin) >> TAGGED_TYPE_SIZE_LOG); in ClearRange()
[all …]
|
| D | allocator-inl.h | 27 …umpPointerAllocator::BumpPointerAllocator(uintptr_t begin, uintptr_t end) : begin_(begin), top_(be… in BumpPointerAllocator() argument
36 void BumpPointerAllocator::Reset(uintptr_t begin, uintptr_t end) in Reset() argument
38 begin_ = begin; in Reset()
39 top_ = begin; in Reset()
46 void BumpPointerAllocator::Reset(uintptr_t begin, uintptr_t end, uintptr_t top) in Reset() argument
48 begin_ = begin; in Reset()
98 auto begin = region->GetBegin(); in AddFree() local
101 bpAllocator_.Reset(begin, end); in AddFree()
123 uintptr_t begin = object->GetBegin(); in Allocate() local
125 uintptr_t remainSize = end - begin - size; in Allocate()
[all …]
|
| /arkcompiler/runtime_core/static_core/runtime/mem/gc/ |
| D | bitmap.h | 134 * @brief Iterates over marked bits in range [begin, end) sequentially.
138 * @param begin - beginning index of the range, inclusive.
144 void IterateOverSetBitsInRange(size_t begin, size_t end, const VisitorType &visitor) in IterateOverSetBitsInRange() argument
146 CheckBitRange(begin, end); in IterateOverSetBitsInRange()
147 if (UNLIKELY(begin == end)) { in IterateOverSetBitsInRange()
151 auto bitmapWord = GetBitmapWord<ATOMIC>(begin); in IterateOverSetBitsInRange()
152 auto offsetWithinWord = GetBitIdxWithinWord(begin); in IterateOverSetBitsInRange()
153 // first word, clear bits before begin in IterateOverSetBitsInRange()
155 auto offsetWordBegin = GetWordIdx(begin) * BITSPERWORD; in IterateOverSetBitsInRange()
200 * @brief Iterates over all bits in range [begin, end) sequentially.
[all …]
|
| D | bitmap.cpp | 30 void Bitmap::ClearBitsInRange(size_t begin, size_t end) in ClearBitsInRange() argument
32 CheckBitRange(begin, end); in ClearBitsInRange()
33 if (GetWordIdx(end) == GetWordIdx(begin)) { // [begin, end] in the same word in ClearBitsInRange()
34 ClearRangeWithinWord(begin, end); in ClearBitsInRange()
38 auto beginRoundup = RoundUp(begin, BITSPERWORD); in ClearBitsInRange()
44 ClearRangeWithinWord(begin, beginRoundup); in ClearBitsInRange()
|
| /arkcompiler/runtime_core/static_core/runtime/mem/gc/g1/ |
| D | collection_set.h | 35 explicit CollectionSet(const Container &set) : collectionSet_(set.begin(), set.end()) in CollectionSet()
59 auto begin() // NOLINT(readability-identifier-naming) in begin() function
61 return collectionSet_.begin(); in begin()
64 auto begin() const // NOLINT(readability-identifier-naming) in begin() function
66 return collectionSet_.begin(); in begin()
98 return Range<PandaVector<Region *>::iterator>(begin(), begin() + tenuredBegin_); in Young()
103 return Range<PandaVector<Region *>::const_iterator>(begin(), begin() + tenuredBegin_); in Young()
108 … return Range<PandaVector<Region *>::iterator>(begin() + tenuredBegin_, begin() + humongousBegin_); in Tenured()
113 …return Range<PandaVector<Region *>::const_iterator>(begin() + tenuredBegin_, begin() + humongousBe… in Tenured()
118 return Range<PandaVector<Region *>::iterator>(begin() + humongousBegin_, end()); in Humongous()
[all …]
|
| /arkcompiler/runtime_core/libpandabase/tests/ |
| D | small_vector_test.cpp | 72 ASSERT_TRUE(std::equal(values.begin(), values.begin() + 5, vector.begin())); in TestVectorGrow()
74 std::copy(values.begin() + 5, values.end(), std::back_inserter(vector)); in TestVectorGrow()
100 std::copy(values.begin(), values.begin() + 4, std::back_inserter(vector)); in TestVectorFind()
103 ASSERT_TRUE(std::equal(vector.begin(), vector.end(), values.begin())); in TestVectorFind()
106 auto it = std::find(vector.begin(), vector.end(), 30); in TestVectorFind()
109 ASSERT_EQ(std::distance(vector.begin(), it), 2); in TestVectorFind()
111 it = std::find(vector.begin(), vector.end(), 50); in TestVectorFind()
127 ASSERT_TRUE(std::equal(const_vector.begin(), const_vector.end(), values.begin())); in TestVectorFind()
137 std::copy(values.begin(), values.begin() + 4, std::back_inserter(vector)); in TestVectorResize()
140 ASSERT_TRUE(std::equal(vector.begin(), vector.end(), values.begin())); in TestVectorResize()
[all …]
|
| D | list_test.cpp | 63 return std::equal(list1.begin(), list1.end(), list2.begin()); in IsEqual()
92 ASSERT_EQ(node, &*list.begin()); in TEST_F()
93 ASSERT_EQ(++list.begin(), list.end()); in TEST_F()
104 list.InsertAfter(list.begin(), *NewNode(2)); in TEST_F()
110 list.EraseAfter(list.begin() + 1); in TEST_F()
113 it = list.begin() + 1; in TEST_F()
130 list2.Splice(list2.before_begin(), list, list.begin() + 1, list.begin() + 5); in TEST_F()
134 list2.Splice(list2.begin(), list, list.before_begin()); in TEST_F()
141 list.EraseAfter(list.begin() + 1, list.begin() + 4); in TEST_F()
175 auto it1 = list1.begin(); in IsEqual()
[all …]
|
| D | bit_vector_test.cpp | 75 // Constant versions of begin and end
76 ASSERT_EQ(cvector.begin(), vector.begin());
80 std::fill(vector.begin(), vector.end(), false);
82 std::fill(vector.begin() + 2, vector.begin() + 15, true);
104 std::copy(values.begin(), values.end(), std::back_inserter(vec1));
106 std::copy(values.begin(), values.end(), std::back_inserter(vec2));
120 std::fill(vector.begin(), vector.end(), true); in TestIteration1()
129 std::fill(vector.begin(), vector.end(), false); in TestIteration1()
149 if (it == vector.begin()) { in TestIteration1()
168 auto it = vector.begin(); in TestIteration2()
[all …]
|
| D | ring_buffer_test.cpp | 29 ASSERT_EQ(buffer.begin(), buffer.end()); in TEST()
48 ASSERT_NE(buffer.begin(), buffer.end()); in TEST()
60 ASSERT_EQ(*buffer.begin(), 1U); in TEST()
64 ASSERT_NE(buffer.begin(), buffer.end()); in TEST()
76 auto [mi, ma] = std::minmax_element(buffer.begin(), buffer.end()); in TEST()
85 ASSERT_EQ(buffer.begin(), buffer.end()); in TEST()
108 ASSERT_NE(buffer.begin(), buffer.end()); in TEST()
117 ASSERT_NE(buffer.begin(), buffer.end()); in TEST()
132 ASSERT_EQ(buffer.begin(), buffer.end()); in TEST()
|
| /arkcompiler/runtime_core/static_core/libpandabase/tests/ |
| D | small_vector_test.cpp | 77 ASSERT_TRUE(std::equal(values.begin(), values.begin() + 5U, vector.begin())); in TestVectorGrow()
79 std::copy(values.begin() + 5U, values.end(), std::back_inserter(vector)); in TestVectorGrow()
102 auto it = std::find(vector.begin(), vector.end(), 30U); in CheckIteration()
105 ASSERT_EQ(std::distance(vector.begin(), it), 2U); in CheckIteration()
106 it = std::find(vector.begin(), vector.end(), 50U); in CheckIteration()
126 std::copy(values.begin(), values.begin() + 4U, std::back_inserter(vector)); in TestVectorIteration()
129 ASSERT_TRUE(std::equal(vector.begin(), vector.end(), values.begin())); in TestVectorIteration()
142 ASSERT_TRUE(std::equal(constVector.begin(), constVector.end(), values.begin())); in TestVectorIteration()
145 std::copy(values.begin() + 4U, values.end(), std::back_inserter(vector)); in TestVectorIteration()
148 ASSERT_TRUE(std::equal(vector.begin(), vector.end(), values.begin())); in TestVectorIteration()
[all …]
|
| D | list_test.cpp | 64 return std::equal(list1.begin(), list1.end(), list2.begin()); in IsEqual()
94 ASSERT_EQ(node, &*list.begin()); in TEST_F()
95 ASSERT_EQ(++list.begin(), list.end()); in TEST_F()
106 list.InsertAfter(list.begin(), *NewNode(2U)); in TEST_F()
112 list.EraseAfter(list.begin() + 1U); in TEST_F()
115 it = list.begin() + 1U; in TEST_F()
133 list2.Splice(list2.before_begin(), list, list.begin() + 1U, list.begin() + 5U); in TEST_F()
137 list2.Splice(list2.begin(), list, list.before_begin()); in TEST_F()
144 list.EraseAfter(list.begin() + 1U, list.begin() + 4U); in TEST_F()
178 auto it1 = list1.begin(); in IsEqual()
[all …]
|
| D | bit_vector_test.cpp | 82 // Constant versions of begin and end in TEST_F()
83 ASSERT_EQ(cvector.begin(), vector.begin()); in TEST_F()
87 std::fill(vector.begin(), vector.end(), false); in TEST_F()
89 std::fill(vector.begin() + 2U, vector.begin() + 15U, true); in TEST_F()
111 std::copy(values.begin(), values.end(), std::back_inserter(vec1)); in TEST_F()
113 std::copy(values.begin(), values.end(), std::back_inserter(vec2)); in TEST_F()
122 auto it = vector.begin(); in CheckIterator()
134 ASSERT_EQ(it, vector.begin()); in CheckIterator()
138 ASSERT_EQ(std::distance(vector.begin(), it), 6U); in CheckIterator()
142 ASSERT_EQ(std::distance(vector.begin(), it), 3U); in CheckIterator()
[all …]
|
| D | ring_buffer_test.cpp | 29 ASSERT_EQ(BUFFER.begin(), BUFFER.end()); in TEST()
48 ASSERT_NE(buffer.begin(), buffer.end()); in TEST()
60 ASSERT_EQ(*buffer.begin(), 1U); in TEST()
64 ASSERT_NE(buffer.begin(), buffer.end()); in TEST()
76 auto [mi, ma] = std::minmax_element(buffer.begin(), buffer.end()); in TEST()
85 ASSERT_EQ(buffer.begin(), buffer.end()); in TEST()
108 ASSERT_NE(buffer.begin(), buffer.end()); in TEST()
117 ASSERT_NE(buffer.begin(), buffer.end()); in TEST()
132 ASSERT_EQ(buffer.begin(), buffer.end()); in TEST()
|
| /arkcompiler/runtime_core/static_core/runtime/tests/ |
| D | collection_set_test.cpp | 70 ASSERT_EQ(1U, std::distance(young.begin(), young.end())); in TEST_F()
71 ASSERT_EQ(&youngRegion, *young.begin()); in TEST_F()
72 ASSERT_EQ(0U, std::distance(tenured.begin(), tenured.end())); in TEST_F()
73 ASSERT_EQ(0U, std::distance(humongous.begin(), humongous.end())); in TEST_F()
91 ASSERT_EQ(1U, std::distance(young.begin(), young.end())); in TEST_F()
92 ASSERT_EQ(&youngRegion, *young.begin()); in TEST_F()
93 ASSERT_EQ(1U, std::distance(tenured.begin(), tenured.end())); in TEST_F()
94 ASSERT_EQ(&tenuredRegion, *tenured.begin()); in TEST_F()
95 ASSERT_EQ(0U, std::distance(humongous.begin(), humongous.end())); in TEST_F()
114 ASSERT_EQ(1U, std::distance(young.begin(), young.end())); in TEST_F()
[all …]
|
| /arkcompiler/ets_runtime/ecmascript/ |
| D | js_function_kind.h | 24 // BEGIN accessors
28 // BEGIN arrow functions
30 // BEGIN async functions
37 // BEGIN base constructors
39 // BEGIN class constructors
42 // BEGIN constructable functions
|
| /arkcompiler/runtime_core/static_core/runtime/mem/ |
| D | object-references-iterator.h | 34 static bool Iterate(ObjectHeader *obj, Handler *handler, void *begin, void *end);
40 … IterateAndDiscoverReferences(GC *gc, ObjectHeader *obj, Handler *handler, void *begin, void *end);
47 static bool Iterate(Class *cls, ObjectHeader *obj, Handler *handler, void *begin, void *end);
53 …terateObjectReferences(ObjectHeader *object, Class *cls, Handler *handler, void *begin, void *end);
59 static bool IterateClassReferences(Class *cls, Handler *handler, void *begin, void *end);
65 …IterateRange(ObjectPointerType *refStart, ObjectPointerType *refEnd, Handler *handler, void *begin,
75 static bool Iterate(ObjectHeader *obj, Handler *handler, void *begin, void *end);
81 … IterateAndDiscoverReferences(GC *gc, ObjectHeader *obj, Handler *handler, void *begin, void *end);
88 static bool Iterate(HClass *cls, ObjectHeader *obj, Handler *handler, void *begin, void *end);
94 …erateObjectReferences(ObjectHeader *object, HClass *cls, Handler *handler, void *begin, void *end);
[all …]
|
| D | object-references-iterator-inl.h | 30 static bool Iterate(coretypes::Array *array, Handler *handler, void *begin, void *end);
54 bool ObjectArrayIterator::Iterate(coretypes::Array *array, Handler *handler, void *begin, void *end) in Iterate() argument
56 ASSERT(IsAligned(ToUintPtr(begin), DEFAULT_ALIGNMENT_IN_BYTES)); in Iterate()
61 auto *p = begin < arrayStart ? arrayStart : reinterpret_cast<T *>(begin); in Iterate()
81 bool ObjectIterator<LANG_TYPE_STATIC>::Iterate(ObjectHeader *obj, Handler *handler, void *begin, vo… in Iterate() argument
85 return Iterate<INTERRUPTIBLE>(cls, obj, handler, begin, end); in Iterate()
105 void *begin, void *end) in IterateAndDiscoverReferences() argument
116 return Iterate<false>(cls, obj, handler, begin, end); in IterateAndDiscoverReferences()
139 …LANG_TYPE_STATIC>::Iterate(Class *cls, ObjectHeader *obj, Handler *handler, void *begin, void *end) in Iterate() argument
143 handler, begin, end); in Iterate()
[all …]
|
| /arkcompiler/ets_runtime/ecmascript/compiler/codegen/maple/mempool/include/ |
| D | maple_sparse_bitvector.h | 177 : allocator(alloc), elementList(allocator.Adapter()), currIter(elementList.begin()) in MapleSparseBitVector()
182 … allocator(alloc), elementList(rhs.elementList, allocator.Adapter()), currIter(elementList.begin()) in MapleSparseBitVector()
187 …or(rhs.allocator), elementList(rhs.elementList, allocator.Adapter()), currIter(elementList.begin()) in MapleSparseBitVector()
247 currIter = elementList.begin();
258 ElementListIterator iter1 = elementList.begin();
259 ElementListConstIterator iter2 = rhs.elementList.begin();
267 currIter = elementList.begin();
295 currIter = elementList.begin();
306 ElementListIterator iter1 = elementList.begin();
307 ElementListConstIterator iter2 = rhs.elementList.begin();
[all …]
|
| /arkcompiler/runtime_core/static_core/plugins/ets/stdlib/escompat/ |
| D | TypedArrays.ets | 126 * @param byteOffset byte offset from begin of the buf
169 * @param byteOffset byte offset from begin of the buf
182 * @param byteOffset byte offset from begin of the buf
195 * @param byteOffset byte offset from begin of the buf
208 * @param byteOffset byte offset from begin of the buf
221 * @param byteOffset byte offset from begin of the buf
451 * @param start start index to begin copy from
466 * @param start start index to begin copy from
481 * @param start start index to begin copy from
496 * @param start start index to begin copy from
[all …]
|
| D | TypedUArrays.ets | 134 * @param byteOffset byte offset from begin of the buf
177 * @param byteOffset byte offset from begin of the buf
188 * @param byteOffset byte offset from begin of the buf
201 * @param byteOffset byte offset from begin of the buf
212 * @param byteOffset byte offset from begin of the buf
225 * @param byteOffset byte offset from begin of the buf
424 * @param start start index to begin copy from
439 * @param start start index to begin copy from
454 * @param start start index to begin copy from
469 * @param start start index to begin copy from
[all …]
|
| /arkcompiler/ets_frontend/ets2panda/util/ |
| D | diagnosticEngine.cpp | 80 merged.insert(merged.end(), vec.begin(), vec.end()); in GetErrorDiagnostic()
89 std::sort(log.begin(), log.end(), [](const auto &lhs, const auto &rhs) { return *lhs < *rhs; }); in PrintAndFlushErrorDiagnostic()
90 …auto last = std::unique(log.begin(), log.end(), [](const auto &lhs, const auto &rhs) { return *lhs… in PrintAndFlushErrorDiagnostic()
92 for (auto it = log.begin(); it != last; ++it) { in PrintAndFlushErrorDiagnostic()
101 std::sort(log.begin(), log.end(), [](const auto &lhs, const auto &rhs) { return *lhs < *rhs; }); in FlushDiagnostic()
103 …std::unique(log.begin(), log.end(), [&](const auto &rhs, const auto &lhs) -> bool { return *rhs ==… in FlushDiagnostic()
104 for (auto it = log.begin(); it != last; it++) { in FlushDiagnostic()
129 for (size_t i = DiagnosticType::BEGIN; i < DiagnosticType::COUNT; ++i) { in IsAnyError()
140 for (size_t i = DiagnosticType::BEGIN; i < DiagnosticType::COUNT; ++i) { in GetAnyError()
|
| /arkcompiler/runtime_core/taihe/test/ani_arraybuffer/author/src/ |
| D | arraybuffer.impl.cpp | 27 return std::accumulate(nums.begin(), nums.end(), 0); in SumArrayU8()
33 std::fill(result.begin(), result.end(), nums); in GetArrayBuffer()
49 return std::accumulate(nums.begin(), nums.end(), 0); in SumArrayI8()
55 std::fill(result.begin(), result.end(), nums); in GetArrayI8()
71 return std::accumulate(nums.begin(), nums.end(), 0); in SumArrayI16()
77 std::fill(result.begin(), result.end(), nums); in GetArrayI16()
93 return std::accumulate(nums.begin(), nums.end(), 0); in SumArrayI32()
99 std::fill(result.begin(), result.end(), nums); in GetArrayI32()
115 return std::accumulate(nums.begin(), nums.end(), 0); in SumArrayI64()
121 std::fill(result.begin(), result.end(), nums); in GetArrayI64()
[all …]
|
| /arkcompiler/runtime_core/static_core/compiler/optimizer/analysis/ |
| D | rpo.h | 51 auto it = std::find(rpoVector_.begin(), rpoVector_.end(), rmBlock); in RemoveBasicBlock()
60 auto it = std::find(rpoVector_.begin(), rpoVector_.end(), curBlock); in AddBasicBlockAfter()
67 auto it = std::find(rpoVector_.begin(), rpoVector_.end(), curBlock); in AddBasicBlockBefore()
74 auto it = std::find(rpoVector_.begin(), rpoVector_.end(), curBlock); in AddVectorAfter()
75 rpoVector_.insert(it + 1, newVector.begin(), newVector.end()); in AddVectorAfter()
|
| /arkcompiler/runtime_core/compiler/optimizer/analysis/ |
| D | rpo.h | 51 auto it = std::find(rpo_vector_.begin(), rpo_vector_.end(), rm_block); in RemoveBasicBlock()
60 auto it = std::find(rpo_vector_.begin(), rpo_vector_.end(), cur_block); in AddBasicBlockAfter()
67 auto it = std::find(rpo_vector_.begin(), rpo_vector_.end(), cur_block); in AddBasicBlockBefore()
74 auto it = std::find(rpo_vector_.begin(), rpo_vector_.end(), cur_block); in AddVectorAfter()
75 rpo_vector_.insert(it + 1, new_vector.begin(), new_vector.end()); in AddVectorAfter()
|
| /arkcompiler/toolchain/websocket/ |
| D | string_utils.h | 27 …str.erase(str.begin(), std::find_if(str.begin(), str.end(), [](unsigned char ch) { return !std::is… in TrimLeft()
44 …std::transform(str.begin(), str.end(), str.begin(), [](unsigned char c) { return std::tolower(c); … in ToLowerCase()
|