Home
last modified time | relevance | path

Searched refs:begin (Results 1 – 25 of 158) sorted by relevance

1234567

/ark/runtime_core/runtime/mem/gc/
Dbitmap.h149 void IterateOverSetBitsInRange(size_t begin, size_t end, const VisitorType &visitor) in IterateOverSetBitsInRange() argument
151 CheckBitRange(begin, end); in IterateOverSetBitsInRange()
152 if (UNLIKELY(begin == end)) { in IterateOverSetBitsInRange()
157 auto bitmap_word = bitmap_[GetWordIdx(begin)]; in IterateOverSetBitsInRange()
158 auto offset_within_word = GetBitIdxWithinWord(begin); in IterateOverSetBitsInRange()
160 auto offset_word_begin = GetWordIdx(begin) * BITSPERWORD; in IterateOverSetBitsInRange()
198 void IterateOverBitsInRange(size_t begin, size_t end, const VisitorType &visitor) in IterateOverBitsInRange() argument
200 CheckBitRange(begin, end); in IterateOverBitsInRange()
201 for (size_t i = begin; i < end; ++i) { in IterateOverBitsInRange()
211 void ClearBitsInRange(size_t begin, size_t end);
[all …]
Dbitmap.cpp22 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()
/ark/js_runtime/ecmascript/mem/
Dallocator-inl.h26 …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()
74 auto begin = region->GetBegin(); in AddFree() local
77 bpAllocator_.Reset(begin, end); in AddFree()
97 uintptr_t begin = object->GetBegin(); in Allocate() local
99 uintptr_t remainSize = end - begin - size; in Allocate()
104 Free(begin + size, remainSize); in Allocate()
105 Region::ObjectAddressToRange(begin)->IncrementAliveObject(size); in Allocate()
[all …]
Dparallel_work_helper.cpp162 uintptr_t begin = 0; in AllocalWorkNode() local
164 begin = atomicField->load(std::memory_order_acquire); in AllocalWorkNode()
165 if (begin + totalSize >= markSpaceEnd_) { in AllocalWorkNode()
167 begin = atomicField->load(std::memory_order_acquire); in AllocalWorkNode()
168 if (begin + totalSize >= markSpaceEnd_) { in AllocalWorkNode()
174 begin = spaceTop_; in AllocalWorkNode()
177 … result = std::atomic_compare_exchange_strong_explicit(atomicField, &begin, begin + totalSize, in AllocalWorkNode()
180 Stack *stack = reinterpret_cast<Stack *>(begin + sizeof(WorkNode)); in AllocalWorkNode()
181 stack->ResetBegin(begin + sizeof(WorkNode) + sizeof(Stack), begin + totalSize); in AllocalWorkNode()
182 WorkNode *work = reinterpret_cast<WorkNode *>(begin); in AllocalWorkNode()
Dmark_stack.h74 void ResetBegin(uintptr_t begin, uintptr_t end) in ResetBegin() argument
76 begin_ = begin; in ResetBegin()
77 top_ = reinterpret_cast<uintptr_t *>(begin); in ResetBegin()
81 void ResetTop(uintptr_t begin, uintptr_t end) in ResetTop() argument
83 begin_ = begin; in ResetTop()
Darea.h22 Area(uintptr_t begin, size_t capacity) in Area() argument
24 : begin_(begin), end_(begin + capacity), next_(nullptr), prev_(nullptr) in Area()
/ark/runtime_core/libpandabase/tests/
Dsmall_vector_test.cpp72 ASSERT_TRUE(std::equal(values.begin(), values.begin() + 5U, vector.begin())); in TestVectorGrow()
74 std::copy(values.begin() + 5U, values.end(), std::back_inserter(vector)); in TestVectorGrow()
100 std::copy(values.begin(), values.begin() + 4U, 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(), 30U); in TestVectorIteration()
109 ASSERT_EQ(std::distance(vector.begin(), it), 2U); in TestVectorIteration()
111 it = std::find(vector.begin(), vector.end(), 50U); in TestVectorIteration()
127 ASSERT_TRUE(std::equal(const_vector.begin(), const_vector.end(), values.begin())); in TestVectorIteration()
130 std::copy(values.begin() + 4U, values.end(), std::back_inserter(vector)); in TestVectorIteration()
133 ASSERT_TRUE(std::equal(vector.begin(), vector.end(), values.begin())); in TestVectorIteration()
[all …]
Dlist_test.cpp60 return std::equal(list1.begin(), list1.end(), list2.begin()); in IsEqual()
89 ASSERT_EQ(node, &*list.begin()); in TEST_F()
90 ASSERT_EQ(++list.begin(), list.end()); in TEST_F()
101 list.InsertAfter(list.begin(), *NewNode(2)); in TEST_F()
107 list.EraseAfter(list.begin() + 1); in TEST_F()
110 it = list.begin() + 1; in TEST_F()
131 list2.Splice(list2.before_begin(), list, list.begin() + 1, list.begin() + 5); in TEST_F()
136 list2.Splice(list2.begin(), list, list.before_begin()); in TEST_F()
143 list.EraseAfter(list.begin() + 1, list.begin() + 4); in TEST_F()
178 auto it1 = list1.begin(); in IsEqual()
[all …]
Dbit_vector_test.cpp76 ASSERT_EQ(cvector.begin(), vector.begin()); in TEST_F()
80 std::fill(vector.begin(), vector.end(), false); in TEST_F()
82 std::fill(vector.begin() + 2, vector.begin() + 15, true); in TEST_F()
104 std::copy(values.begin(), values.end(), std::back_inserter(vec1)); in TEST_F()
106 std::copy(values.begin(), values.end(), std::back_inserter(vec2)); in TEST_F()
118 std::fill(vector.begin(), vector.end(), true); in TestIteration()
127 std::fill(vector.begin(), vector.end(), false); in TestIteration()
147 if (it == vector.begin()) { in TestIteration()
162 auto it = vector.begin(); in TestIteration()
174 ASSERT_EQ(it, vector.begin()); in TestIteration()
[all …]
/ark/runtime_core/verification/util/
Dequiv_classes.h209 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()
353 void Equate(It begin, It end)
355 Base::EquateLazy([this, &begin, end]() -> std::optional<ObjIndex> {
[all …]
Dint_set.h73 void Insert(Iter begin, Iter end) in Insert() argument
78 AsSmallRepr().template InsertManyImpl<known_to_be_sorted>(begin, end); in Insert()
81 if (begin != end) { in Insert()
84 … AsLargeRepr().template InsertManyImpl<known_to_be_sorted>(std::move(begin), std::move(end)); in Insert()
90 … AsLargeRepr().template InsertManyImpl<known_to_be_sorted>(std::move(begin), std::move(end)); in Insert()
239 iterator begin() in begin() function
249 const_iterator begin() const in begin() function
327 iterator begin() in begin() function
337 const_iterator begin() const in begin() function
361 return std::binary_search(repr_.begin(), repr_.end(), x); in Contains()
[all …]
/ark/runtime_core/verification/util/tests/
Dint_set_test.cpp98 set.insert(values.begin(), values.end()); in __anon5171e7bd0302()
100 std::sort(values.begin(), values.end()); in __anon5171e7bd0302()
101 int_set.Insert<true>(values.begin(), values.end()); in __anon5171e7bd0302()
103 int_set.Insert(values.begin(), values.end()); in __anon5171e7bd0302()
122 std::set_intersection(set1.begin(), set1.end(), set2.begin(), set2.end(), in __anon5171e7bd0402()
123 std::inserter(std_intersection, std_intersection.begin())); in __anon5171e7bd0402()
146 …std::set_union(set1.begin(), set1.end(), set2.begin(), set2.end(), std::inserter(std_union, std_un… in __anon5171e7bd0502()
/ark/js_runtime/ecmascript/builtins/tests/
Dbuiltins_number_test.cpp412 … ASSERT_EQ(base::NumberHelper::StringToDouble(sp.begin(), sp.end(), 0, base::IGNORE_TRAILING), 0); in HWTEST_F_L0()
415 … ASSERT_EQ(base::NumberHelper::StringToDouble(sp.begin(), sp.end(), 0, base::IGNORE_TRAILING), 0); in HWTEST_F_L0()
418 … ASSERT_EQ(base::NumberHelper::StringToDouble(sp.begin(), sp.end(), 0, base::IGNORE_TRAILING), 0); in HWTEST_F_L0()
421 … ASSERT_EQ(base::NumberHelper::StringToDouble(sp.begin(), sp.end(), 0, base::IGNORE_TRAILING), 0); in HWTEST_F_L0()
424 …ASSERT_EQ(base::NumberHelper::StringToDouble(sp.begin(), sp.end(), 0, base::IGNORE_TRAILING), 0.4); in HWTEST_F_L0()
427 … ASSERT_EQ(base::NumberHelper::StringToDouble(sp.begin(), sp.end(), 0, base::IGNORE_TRAILING), 10); in HWTEST_F_L0()
430 …ASSERT_EQ(base::NumberHelper::StringToDouble(sp.begin(), sp.end(), 0, base::IGNORE_TRAILING), 1000… in HWTEST_F_L0()
433 …ASSERT_EQ(base::NumberHelper::StringToDouble(sp.begin(), sp.end(), 0, base::IGNORE_TRAILING), 1000… in HWTEST_F_L0()
438 …ASSERT_TRUE(std::isnan(base::NumberHelper::StringToDouble(sp.begin(), sp.end(), 0, base::ALLOW_HEX… in HWTEST_F_L0()
441 ASSERT_EQ(base::NumberHelper::StringToDouble(sp.begin(), sp.end(), 0, base::ALLOW_HEX), 16); in HWTEST_F_L0()
[all …]
/ark/runtime_core/libpandabase/utils/
Dsmall_vector.h273 const_iterator begin() const in begin() function
278 iterator begin() in begin() function
383 …std::for_each(buffer_.data.begin() + size, buffer_.data.begin() + buffer_.size, [](T &v) { v.~T();… in resize()
393 std::for_each(buffer_.data.begin() + buffer_.size, buffer_.data.begin() + size, in resize()
409 …std::for_each(buffer_.data.begin() + size, buffer_.data.begin() + buffer_.size, [](T &v) { v.~T();… in resize()
419 std::for_each(buffer_.data.begin() + buffer_.size, buffer_.data.begin() + size, in resize()
434 … std::for_each(buffer_.data.begin(), buffer_.data.begin() + buffer_.size, [](T &v) { v.~T(); }); in clear()
482 …std::copy(buffer_.data.begin(), buffer_.data.begin() + buffer_.size, std::back_inserter(tmp_vector… in MoveToVector()
491 … std::for_each(buffer_.data.begin(), buffer_.data.begin() + buffer_.size, [](T &v) { v.~T(); }); in Destroy()
Dspan.h55 Span(Iterator begin, Iterator end) : Span(begin, end - begin) {} in Span() argument
71 Iterator begin() in begin() function
77 ConstIterator begin() const in begin() function
127 return ReverseIterator(begin()); in rend()
133 return ConstReverseIterator(begin()); in rend()
/ark/runtime_core/runtime/tests/
Dhistogram_test.cpp101 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()
Dbitmap_test_base.h37 …BitmapVerify(BitmapType *bitmap, void *begin, void *end) : bitmap_(bitmap), begin_(begin), end_(en… in BitmapVerify() argument
107 …auto count_test_fn = [](MemBitmap<kAlignment> *bitmap, object_pointer_type begin, object_pointer_t… in RunTestCount()
111 bitmap->IterateOverMarkedChunkInRange(ToVoidPtr(begin), ToVoidPtr(end), count_fn); in RunTestCount()
120 …auto order_test_fn = [](MemBitmap<kAlignment> *bitmap, object_pointer_type begin, object_pointer_t… in RunTestOrder()
136 bitmap->IterateOverMarkedChunkInRange(ToVoidPtr(begin), ToVoidPtr(end), order_check); in RunTestOrder()
/ark/runtime_core/libpandafile/
Dbytecode_emitter.cpp250 auto it = branches_.begin(); in ReserveSpaceForOffsets()
301 bytecode_.insert(bytecode_.begin() + insn_pc + INSN_SIZE, *extra_bytes_ptr, 0); in DoReserveSpaceForOffset()
305 bytecode_.insert(bytecode_.begin() + insn_pc + INSN_SIZE, *extra_bytes_ptr, 0); in DoReserveSpaceForOffset()
313 bytecode_.insert(bytecode_.begin() + insn_pc + INSN_SIZE, *extra_bytes_ptr, 0); in DoReserveSpaceForOffset()
316 …Emit<Format::IMM16>(bytecode_.begin() + insn_pc, GetLongestConditionalJump(RevertConditionCode(opc… in DoReserveSpaceForOffset()
318 … Emit<Format::IMM32>(bytecode_.begin() + insn_pc + EXTENDED_INSN_SIZE, Opcode::JMP_IMM32, 0); in DoReserveSpaceForOffset()
321 Emit<Format::IMM16>(bytecode_.begin() + insn_pc, GetLongestConditionalJump(opcode), 0); in DoReserveSpaceForOffset()
331 bytecode_.insert(bytecode_.begin() + insn_pc + INSN_SIZE, *extra_bytes_ptr, 0); in DoReserveSpaceForOffset()
334 …Emit<Format::V8_IMM16>(bytecode_.begin() + insn_pc, GetLongestConditionalJump(RevertConditionCode(… in DoReserveSpaceForOffset()
336 … Emit<Format::IMM32>(bytecode_.begin() + insn_pc + EXTENDED_INSN_SIZE, Opcode::JMP_IMM32, 0); in DoReserveSpaceForOffset()
[all …]
/ark/runtime_core/libpandabase/os/unix/
Dnative_stack.cpp68 …std::sregex_token_iterator(kernel_stack.begin(), kernel_stack.end(), split, -1), std::sregex_token… in DumpKernelStack()
121 …set_difference(kernel_tid_.begin(), kernel_tid_.end(), thread_manager_tids_.begin(), thread_manage… in Dump()
122 inserter(dump_tid, dump_tid.begin())); in Dump()
124 for (tid = dump_tid.begin(); tid != dump_tid.end(); ++tid) { in Dump()
178 std::replace(java_name.begin(), java_name.end(), '/', '.'); in ChangeJaveStackFormat()
184 std::replace(java_name.begin(), java_name.end(), '/', '.'); in ChangeJaveStackFormat()
/ark/runtime_core/verification/absint/
Dreg_context.h48 auto result_it = result.Regs_.begin();
49 auto lhs_it = Regs_.begin();
50 auto rhs_it = rhs.Regs_.begin();
63 auto lhs_it = Regs_.begin();
64 auto rhs_it = rhs.Regs_.begin();
96 auto it = Regs_.begin(); in ChangeValuesOfSameOrigin()
/ark/runtime_core/assembler/
Dcontext.cpp30 …token = std::string_view(&*(tokens[number - 1].whole_line.begin() + tokens[number - 1].bound_left), in Make()
132 …token = std::string_view(&*(tokens[number - 1].whole_line.begin() + tokens[number - 1].bound_left), in operator ++()
147 …token = std::string_view(&*(tokens[number - 1].whole_line.begin() + tokens[number - 1].bound_left), in operator ++()
166 …token = std::string_view(&*(tokens[number - 1].whole_line.begin() + tokens[number - 1].bound_left), in operator --()
182 …token = std::string_view(&*(tokens[number - 1].whole_line.begin() + tokens[number - 1].bound_left), in operator --()
Dlexer.cpp165 LOG(DEBUG, ASSEMBLER) << std::string_view(&*(curr_line_->buffer.begin() + curr_line_->pos), in TokenizeString()
175 << std::string_view(&*(f_i.whole_line.begin() + f_i.bound_left), in TokenizeString()
198 std::string_view p(&*(curr_line_->buffer.begin() + beg), end - beg); in LexGetType()
221 size_t begin = curr_line_->pos; in LexString() local
243 … Error::ErrorType::ERR_STRING_MISSING_TERMINATING_CHARACTER, "", begin, curr_line_->pos, in LexString()
274 << std::string_view(&*(curr_line_->buffer.begin() + curr_line_->pos), in LexTokens()
308 … << std::string_view(&*(curr_line_->buffer.begin() + bound_left), bound_right - bound_left) in LexTokens()
340 << std::string_view(&*(curr_line_->buffer.begin() + curr_line_->pos), in LexPreprocess()
368 << std::string_view(&*(curr_line_->buffer.begin() + curr_line_->pos), in LexPreprocess()
Dide_helpers.h38 SourcePosition begin; member
45 << "\"begin\": " << begin.JsonSerialize() << ", " in JsonSerialize()
72 auto it = item_table.begin(); in JsonSerializeProgramItems()
/ark/js_runtime/ecmascript/compiler/
Dscheduler.cpp61 std::iota(dom[idx].begin(), dom[idx].end(), 0); in CalculateDominatorTree()
70 std::iota(curDom.begin(), curDom.end(), 0); in CalculateDominatorTree()
76 … curDom.begin(), curDom.end(), predDom.begin(), predDom.end(), tmp.begin()); in CalculateDominatorTree()
77 tmp.resize(it - tmp.begin()); in CalculateDominatorTree()
81 auto it = std::find(curDom.begin(), curDom.end(), idx); in CalculateDominatorTree()
84 std::sort(curDom.begin(), curDom.end()); in CalculateDominatorTree()
93 auto it = std::remove(dom[idx].begin(), dom[idx].end(), idx); in CalculateDominatorTree()
94 dom[idx].resize(it - dom[idx].begin()); in CalculateDominatorTree()
95 immDom[idx] = *std::max_element(dom[idx].begin(), dom[idx].end(), in CalculateDominatorTree()
172 … std::sort(argList.begin(), argList.end(), [&](const GateRef &lhs, const GateRef &rhs) -> bool { in Run()
/ark/runtime_core/templates/events/
Devents.h.erb31 … std::copy(class_name.begin(), class_name.begin() + std::min(class_name.size(), BUF_SIZE - 1) + 1,
33 …std::copy(method_name.begin(), method_name.begin() + std::min(method_name.size(), BUF_SIZE - 1) + …

1234567