| /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 AtomicInsert(uintptr_t begin, uintptr_t addr) in AtomicInsert() argument
52 return GCBitsetData()->SetBit<AccessType::ATOMIC>((addr - begin) >> TAGGED_TYPE_SIZE_LOG); in AtomicInsert()
55 void ClearBit(uintptr_t begin, uintptr_t addr) in ClearBit() argument
57 GCBitsetData()->ClearBit((addr - begin) >> TAGGED_TYPE_SIZE_LOG); in ClearBit()
60 void ClearRange(uintptr_t begin, uintptr_t start, uintptr_t end) in ClearRange() argument
63 (start - begin) >> TAGGED_TYPE_SIZE_LOG, (end - begin) >> TAGGED_TYPE_SIZE_LOG); in ClearRange()
66 void AtomicClearRange(uintptr_t begin, uintptr_t start, uintptr_t end) in AtomicClearRange() argument
69 (start - begin) >> TAGGED_TYPE_SIZE_LOG, (end - begin) >> TAGGED_TYPE_SIZE_LOG); in AtomicClearRange()
[all …]
|
| D | allocator-inl.h | 26 …umpPointerAllocator::BumpPointerAllocator(uintptr_t begin, uintptr_t end) : begin_(begin), top_(be… in BumpPointerAllocator() argument
35 void BumpPointerAllocator::Reset(uintptr_t begin, uintptr_t end) in Reset() argument
37 begin_ = begin; in Reset()
38 top_ = begin; in Reset()
43 void BumpPointerAllocator::Reset(uintptr_t begin, uintptr_t end, uintptr_t top) in Reset() argument
45 begin_ = begin; in Reset()
84 auto begin = region->GetBegin(); in AddFree() local
87 bpAllocator_.Reset(begin, end); in AddFree()
106 uintptr_t begin = object->GetBegin(); in Allocate() local
108 uintptr_t remainSize = end - begin - size; in Allocate()
[all …]
|
| D | work_manager.cpp | 171 uintptr_t begin = 0; in AllocateWorkNode() local
173 begin = atomicField->load(std::memory_order_acquire); in AllocateWorkNode()
174 if (begin + totalSize >= spaceEnd_) { in AllocateWorkNode()
176 begin = atomicField->load(std::memory_order_acquire); in AllocateWorkNode()
177 if (begin + totalSize >= spaceEnd_) { in AllocateWorkNode()
183 begin = spaceStart_; in AllocateWorkNode()
186 … result = std::atomic_compare_exchange_strong_explicit(atomicField, &begin, begin + totalSize, in AllocateWorkNode()
189 Stack *stack = reinterpret_cast<Stack *>(begin + sizeof(WorkNode)); in AllocateWorkNode()
190 stack->ResetBegin(begin + sizeof(WorkNode) + sizeof(Stack), begin + totalSize); in AllocateWorkNode()
191 WorkNode *work = reinterpret_cast<WorkNode *>(begin); in AllocateWorkNode()
|
| D | allocator.h | 43 inline BumpPointerAllocator(uintptr_t begin, uintptr_t end);
46 inline void Reset(uintptr_t begin, uintptr_t end);
47 inline void Reset(uintptr_t begin, uintptr_t end, uintptr_t top);
108 inline void ResetBumpPointer(uintptr_t begin, uintptr_t end, uintptr_t top);
110 inline void Free(uintptr_t begin, size_t size, bool isAdd = true);
|
| /arkcompiler/runtime_core/runtime/mem/gc/g1/ |
| D | collection_set.h | 54 auto begin() in begin() function
56 return collection_set_.begin(); in begin()
59 auto begin() const in begin() function
61 return collection_set_.begin(); in begin()
86 return Range<PandaVector<Region *>::iterator>(begin(), begin() + tenured_begin_); in Young()
91 return Range<PandaVector<Region *>::const_iterator>(begin(), begin() + tenured_begin_); in Young()
96 …return Range<PandaVector<Region *>::iterator>(begin() + tenured_begin_, begin() + humongous_begin_… in Tenured()
101 …return Range<PandaVector<Region *>::const_iterator>(begin() + tenured_begin_, begin() + humongous_… in Tenured()
106 return Range<PandaVector<Region *>::iterator>(begin() + humongous_begin_, end()); in Humongous()
111 return Range<PandaVector<Region *>::const_iterator>(begin() + humongous_begin_, end()); in Humongous()
[all …]
|
| /arkcompiler/runtime_core/runtime/mem/gc/ |
| D | bitmap.h | 125 * \brief Iterates over marked bits in range [begin, end) sequentially.
129 * @param begin - beginning index of the range, inclusive.
135 void IterateOverSetBitsInRange(size_t begin, size_t end, const VisitorType &visitor) in IterateOverSetBitsInRange() argument
137 CheckBitRange(begin, end); in IterateOverSetBitsInRange()
138 if (UNLIKELY(begin == end)) { in IterateOverSetBitsInRange()
142 // first word, clear bits before begin in IterateOverSetBitsInRange()
145 size_t begin_index = GetWordIdx(begin); in IterateOverSetBitsInRange()
150 bitmap_word = bitmap_[GetWordIdx(begin)]; in IterateOverSetBitsInRange()
153 auto offset_within_word = GetBitIdxWithinWord(begin); in IterateOverSetBitsInRange()
155 auto offset_word_begin = GetWordIdx(begin) * BITSPERWORD; in IterateOverSetBitsInRange()
[all …]
|
| D | bitmap.cpp | 22 void Bitmap::ClearBitsInRange(size_t begin, size_t end) in ClearBitsInRange() argument
24 CheckBitRange(begin, end); in ClearBitsInRange()
25 if (GetWordIdx(end) == GetWordIdx(begin)) { // [begin, end] in the same word in ClearBitsInRange()
26 ClearRangeWithinWord(begin, end); in ClearBitsInRange()
30 auto begin_roundup = RoundUp(begin, BITSPERWORD); in ClearBitsInRange()
36 ClearRangeWithinWord(begin, begin_roundup); in ClearBitsInRange()
|
| /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 TestVectorIteration()
103 ASSERT_TRUE(std::equal(vector.begin(), vector.end(), values.begin())); in TestVectorIteration()
106 auto it = std::find(vector.begin(), vector.end(), 30); in TestVectorIteration()
109 ASSERT_EQ(std::distance(vector.begin(), it), 2); in TestVectorIteration()
111 it = std::find(vector.begin(), vector.end(), 50); in TestVectorIteration()
127 ASSERT_TRUE(std::equal(const_vector.begin(), const_vector.end(), values.begin())); in TestVectorIteration()
130 std::copy(values.begin() + 4, values.end(), std::back_inserter(vector)); in TestVectorIteration()
133 ASSERT_TRUE(std::equal(vector.begin(), vector.end(), values.begin())); in TestVectorIteration()
[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 TestIteration()
129 std::fill(vector.begin(), vector.end(), false); in TestIteration()
149 if (it == vector.begin()) { in TestIteration()
164 auto it = vector.begin(); in TestIteration()
[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/runtime/tests/ |
| D | collection_set_test.cpp | 65 ASSERT_EQ(1U, std::distance(young.begin(), young.end())); in TEST_F()
66 ASSERT_EQ(&young_region, *young.begin()); in TEST_F()
67 ASSERT_EQ(0U, std::distance(tenured.begin(), tenured.end())); in TEST_F()
68 ASSERT_EQ(0U, std::distance(humongous.begin(), humongous.end())); in TEST_F()
86 ASSERT_EQ(1U, std::distance(young.begin(), young.end())); in TEST_F()
87 ASSERT_EQ(&young_region, *young.begin()); in TEST_F()
88 ASSERT_EQ(1U, std::distance(tenured.begin(), tenured.end())); in TEST_F()
89 ASSERT_EQ(&tenured_region, *tenured.begin()); in TEST_F()
90 ASSERT_EQ(0U, std::distance(humongous.begin(), humongous.end())); in TEST_F()
109 ASSERT_EQ(1U, std::distance(young.begin(), young.end())); in TEST_F()
[all …]
|
| D | histogram_test.cpp | 101 CompareTwoHistogram(hist, Histogram<int>(simple_vector.begin(), simple_vector.end())); in TEST_F()
128 Histogram<int> hist_first(simple_vector_first.begin(), simple_vector_first.end()); in TEST_F()
129 Histogram<int> hist_second(simple_vector_second.begin(), simple_vector_second.end()); in TEST_F()
141 Histogram<int> hist_first(simple_set_first.begin(), simple_set_first.end()); in TEST_F()
142 Histogram<int> hist_second(panda_set_first.begin(), panda_set_first.end()); in TEST_F()
143 Histogram<int> hist_third(simple_vector_second.begin(), simple_vector_second.end()); in TEST_F()
144 Histogram<int> hist_fourth(panda_vector_first.begin(), panda_vector_first.end()); in TEST_F()
157 Histogram<int> hist(simple_vector.begin(), simple_vector.end()); in TEST_F()
|
| /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/verification/util/ |
| D | equiv_classes.h | 209 void Equate(It begin, It end) in Equate() argument
211 if (begin == end) { in Equate()
214 It it = begin; in Equate()
223 Equate(objects.begin(), objects.end()); in Equate()
252 bool IsAllEqual(It begin, It end) in IsAllEqual() argument
254 if (begin == end) { in IsAllEqual()
257 It it = begin; in IsAllEqual()
269 return IsAllEqual(objects.begin(), objects.end()); in IsAllEqual()
354 void Equate(It begin, It end)
356 Base::EquateLazy([this, &begin, end]() -> std::optional<ObjIndex> {
[all …]
|
| D | int_set.h | 65 void Insert(Iter begin, Iter end) in Insert() argument
69 AsSmallRepr().template InsertManyImpl<known_to_be_sorted>(begin, end); in Insert()
72 if (begin != end) { in Insert()
74 … AsLargeRepr().template InsertManyImpl<known_to_be_sorted>(std::move(begin), std::move(end)); in Insert()
79 … AsLargeRepr().template InsertManyImpl<known_to_be_sorted>(std::move(begin), std::move(end)); in Insert()
247 return std::binary_search(repr_.begin(), repr_.end(), x); in Contains()
266 … std::set_intersection(repr_.begin(), repr_.end(), other.repr_.begin(), other.repr_.end(), in Intersect()
286 std::remove_if(repr_.begin(), repr_.end(), in IntersectInPlace()
287 … [&, other_iter = other.repr_.begin(), other_end = other.repr_.end()](T x) mutable { in IntersectInPlace()
297 … repr_.erase(std::remove_if(repr_.begin(), repr_.end(), [&](T x) { return !other.Contains(x); }), in IntersectInPlace()
[all …]
|
| /arkcompiler/runtime_core/verification/util/tests/ |
| D | int_set_property_test.cpp | 97 set.insert(values.begin(), values.end()); in __anon50e355d80302()
99 std::sort(values.begin(), values.end()); in __anon50e355d80302()
100 int_set.Insert<true>(values.begin(), values.end()); in __anon50e355d80302()
102 int_set.Insert(values.begin(), values.end()); in __anon50e355d80302()
121 std::set_intersection(set1.begin(), set1.end(), set2.begin(), set2.end(), in __anon50e355d80402()
122 std::inserter(std_intersection, std_intersection.begin())); in __anon50e355d80402()
146 …std::set_union(set1.begin(), set1.end(), set2.begin(), set2.end(), std::inserter(std_union, std_un… in __anon50e355d80502()
|
| D | int_set_test.cpp | 39 iset.Insert(v.begin(), v.begin() + 2); in TEST_F()
48 iset2.Insert(v.begin(), v.end()); in TEST_F()
70 iset1.Insert(v.begin(), v.begin() + 2); in TEST_F()
72 iset2.Insert(v.begin(), v.end()); in TEST_F()
|
| /arkcompiler/ets_runtime/ecmascript/builtins/tests/ |
| D | builtins_number_test.cpp | 427 … ASSERT_EQ(base::NumberHelper::StringToDouble(sp.begin(), sp.end(), 0, base::IGNORE_TRAILING), 0); in HWTEST_F_L0()
430 … ASSERT_EQ(base::NumberHelper::StringToDouble(sp.begin(), sp.end(), 0, base::IGNORE_TRAILING), 0); in HWTEST_F_L0()
433 … ASSERT_EQ(base::NumberHelper::StringToDouble(sp.begin(), sp.end(), 0, base::IGNORE_TRAILING), 0); in HWTEST_F_L0()
436 … ASSERT_EQ(base::NumberHelper::StringToDouble(sp.begin(), sp.end(), 0, base::IGNORE_TRAILING), 0); in HWTEST_F_L0()
439 …ASSERT_EQ(base::NumberHelper::StringToDouble(sp.begin(), sp.end(), 0, base::IGNORE_TRAILING), 0.4); in HWTEST_F_L0()
442 … ASSERT_EQ(base::NumberHelper::StringToDouble(sp.begin(), sp.end(), 0, base::IGNORE_TRAILING), 10); in HWTEST_F_L0()
445 …ASSERT_EQ(base::NumberHelper::StringToDouble(sp.begin(), sp.end(), 0, base::IGNORE_TRAILING), 1000… in HWTEST_F_L0()
448 …ASSERT_EQ(base::NumberHelper::StringToDouble(sp.begin(), sp.end(), 0, base::IGNORE_TRAILING), 1000… in HWTEST_F_L0()
453 …ASSERT_TRUE(std::isnan(base::NumberHelper::StringToDouble(sp.begin(), sp.end(), 0, base::ALLOW_HEX… in HWTEST_F_L0()
456 ASSERT_EQ(base::NumberHelper::StringToDouble(sp.begin(), sp.end(), 0, base::ALLOW_HEX), 16); in HWTEST_F_L0()
[all …]
|
| /arkcompiler/runtime_core/compiler/optimizer/analysis/ |
| D | loop_analyzer.h | 64 ASSERT(std::find(back_edges_.begin(), back_edges_.end(), block) == back_edges_.end()); in AppendBackEdge()
71 ASSERT(std::find(back_edges_.begin(), back_edges_.end(), new_block) == back_edges_.end()); in ReplaceBackEdge()
72 auto it = std::find(back_edges_.begin(), back_edges_.end(), block); in ReplaceBackEdge()
75 back_edges_[std::distance(back_edges_.begin(), it)] = new_block; in ReplaceBackEdge()
80 auto it = std::find(back_edges_.begin(), back_edges_.end(), block); in HasBackEdge()
86 auto it = std::find(back_edges_.begin(), back_edges_.end(), block); in RemoveBackEdge()
89 back_edges_[std::distance(back_edges_.begin(), it)] = back_edges_.back(); in RemoveBackEdge()
177 …locks.size() == others.size() && std::is_permutation(blocks.begin(), blocks.end(), others.begin()); in IsEqualBlocks()
|
| 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/runtime_core/compiler/tests/ |
| D | graph_comparator.h | 34 for (auto it1 = graph1->GetBlocksRPO().begin(), it2 = graph2->GetBlocksRPO().begin(); in Compare()
41 …return std::equal(graph1->GetBlocksRPO().begin(), graph1->GetBlocksRPO().end(), graph2->GetBlocksR… in Compare()
69 …return std::equal(block1->AllInsts().begin(), block1->AllInsts().end(), block2->AllInsts().begin(), in Compare()
89 auto inst1_begin = inst1->GetInputs().begin(); in Compare()
91 auto inst2_begin = inst2->GetInputs().begin(); in Compare()
269 std::sort(regs1.begin(), regs1.end()); in Compare()
270 std::sort(regs2.begin(), regs2.end()); in Compare()
279 if (!std::equal(sv_st1->GetImmediates()->begin(), sv_st1->GetImmediates()->end(), in Compare()
280 sv_st2->GetImmediates()->begin(), eq_lambda)) { in Compare()
|
| /arkcompiler/runtime_core/tests/verifier-tests/ |
| D | bug_3228.pa | 18 begin:
32 .catch panda.NullPointerException, begin, end, catch_NPE
33 .catchall begin, end, catch_all
|
| /arkcompiler/runtime_core/libpandabase/utils/ |
| D | range.h | 23 Range(It begin, It end) : begin_(begin), end_(end) {} in Range() argument
25 It begin() in begin() function
|
| /arkcompiler/runtime_core/tests/cts-assembly/ |
| D | initobj-bad-02.pa | 22 begin:
36 .catch panda.AbstractMethodError, begin, end, catch_AME
37 .catchall begin, end, catch_all
|