Home
last modified time | relevance | path

Searched refs:ranges (Results 1 - 25 of 27) sorted by relevance

12

/arkcompiler/runtime_core/static_core/compiler/optimizer/optimizations/regalloc/
H A Dreg_alloc_graph_coloring.cpp32 void RegAllocGraphColoring::FillPhysicalNodes(InterferenceGraph *ig, WorkingRanges *ranges, in FillPhysicalNodes() argument
35 for (auto physicalInterval : ranges->physical) { in FillPhysicalNodes()
43 void RegAllocGraphColoring::BuildIG(InterferenceGraph *ig, WorkingRanges *ranges, bool rematConstants) in BuildIG() argument
45 ig->Reserve(ranges->regular.size() + ranges->physical.size()); in BuildIG()
50 FillPhysicalNodes(ig, ranges, physicalNodes); in BuildIG()
52 for (auto currentInterval : ranges->regular) { in BuildIG()
283 bool RegAllocGraphColoring::AllocateRegisters(InterferenceGraph *ig, WorkingRanges *ranges, WorkingRanges *stackRanges, in AllocateRegisters() argument
287 BuildIG(ig, ranges); in AllocateRegisters()
292 Presplit(ranges); in AllocateRegisters()
321 SparseIG(InterferenceGraph *ig, unsigned regsCount, WorkingRanges *ranges, WorkingRanges *stackRanges) SparseIG() argument
349 SpillInterval(LifeIntervals *interval, WorkingRanges *ranges, WorkingRanges *stackRanges) SpillInterval() argument
452 auto *ranges = isFp ? fpRanges : generalRanges; InitWorkingRanges() local
480 Presplit(WorkingRanges *ranges) Presplit() argument
[all...]
H A Dreg_alloc_graph_coloring.h54 void FillPhysicalNodes(InterferenceGraph *ig, WorkingRanges *ranges, ArenaVector<ColorNode *> &physicalNodes);
55 void BuildIG(InterferenceGraph *ig, WorkingRanges *ranges, bool rematConstants = false);
65 bool AllocateRegisters(InterferenceGraph *ig, WorkingRanges *ranges, WorkingRanges *stackRanges,
71 void Presplit(WorkingRanges *ranges);
72 void SparseIG(InterferenceGraph *ig, unsigned regsCount, WorkingRanges *ranges, WorkingRanges *stackRanges);
73 void SpillInterval(LifeIntervals *interval, WorkingRanges *ranges, WorkingRanges *stackRanges);
/arkcompiler/ets_frontend/ets2panda/lexer/token/
H A DsourceLocation.cpp28 if (ranges.empty()) { in AddCol()
29 ranges.emplace_back(Range {diff}); in AddCol()
33 auto &range = ranges.back(); in AddCol()
38 ranges.emplace_back(Range {diff}); in AddCol()
90 for (const auto &range : entry.ranges) {
H A DsourceLocation.h94 std::vector<Range> ranges {};
/arkcompiler/ets_frontend/es2panda/lexer/token/
H A DsourceLocation.cpp29 if (ranges.empty()) { in AddCol()
30 ranges.emplace_back(Range {diff}); in AddCol()
34 auto &range = ranges.back(); in AddCol()
39 ranges.emplace_back(Range {diff}); in AddCol()
90 for (const auto &range : entry.ranges) {
H A DsourceLocation.h91 std::vector<Range> ranges {};
/arkcompiler/toolchain/tooling/backend/
H A Djs_single_stepper.cpp93 std::list<JSPtStepRange> ranges {}; in GetStepRanges()
95 auto callbackFunc = [table, &ranges](int32_t line) -> bool { in GetStepRanges()
100 ranges.push_back(range); in GetStepRanges()
106 return ranges; in GetStepRanges()
126 std::list<JSPtStepRange> ranges = GetStepRanges(extractor, ptMethod->GetMethodId(), in GetStepper() local
128 return std::make_unique<SingleStepper>(ecmaVm, std::move(ptMethod), std::move(ranges), type); in GetStepper()
/arkcompiler/runtime_core/compiler/optimizer/optimizations/regalloc/
H A Dreg_alloc_graph_coloring.cpp23 void RegAllocGraphColoring::BuildIG(InterferenceGraph *ig, WorkingRanges *ranges) in BuildIG() argument
25 ig->Reserve(ranges->regular.size() + ranges->physical.size()); in BuildIG()
29 for (auto physical_interval : ranges->physical) { in BuildIG()
35 for (auto current_interval : ranges->regular) { in BuildIG()
231 Register RegAllocGraphColoring::AllocateRegisters(InterferenceGraph *ig, WorkingRanges *ranges, const RegisterMap &map) in AllocateRegisters() argument
233 Presplit(ranges); in AllocateRegisters()
235 BuildIG(ig, ranges); in AllocateRegisters()
355 auto *ranges = is_fp ? fp_ranges : general_ranges; in InitWorkingRanges() local
362 AddRange(interval, &ranges in InitWorkingRanges()
383 Presplit(WorkingRanges *ranges) Presplit() argument
[all...]
H A Dreg_alloc_graph_coloring.h63 void BuildIG(InterferenceGraph *ig, WorkingRanges *ranges);
68 Register AllocateRegisters(InterferenceGraph *ig, WorkingRanges *ranges, const RegisterMap &map);
71 void Presplit(WorkingRanges *ranges);
/arkcompiler/runtime_core/static_core/runtime/mem/gc/
H A Dcard_table-inl.h47 inline void CardTable::FillRanges(PandaVector<MemRange> *ranges, const Card *startCard, const Card *endCard) in FillRanges() argument
56 ranges->emplace_back(minAddress_ + (cardPtr - cards_) * CARD_SIZE, in FillRanges()
64 FillRanges(ranges, startCard, ToNativePtr<Card>(ToUintPtr(startCard) + splitSize - 1)); in FillRanges()
68 FillRanges(ranges, ToNativePtr<Card>(ToUintPtr(startCard) + splitSize), endCard); in FillRanges()
70 FillRanges(ranges, ToNativePtr<Card>(ToUintPtr(startCard) + splitSize), endCard); in FillRanges()
H A Dcard_table.h288 inline void FillRanges(PandaVector<MemRange> *ranges, const Card *startCard, const Card *endCard);
/arkcompiler/runtime_core/static_core/compiler/optimizer/analysis/
H A Dbounds_analysis.cpp421 BoundsRange BoundsRange::Union(const ArenaVector<BoundsRange> &ranges) in Union() argument
425 for (const auto &range : ranges) { in Union()
436 BoundsRange::RangePair BoundsRange::NarrowBoundsByNE(BoundsRange::RangePair const &ranges) in NarrowBoundsByNE() argument
438 auto &[left_range, right_range] = ranges; in NarrowBoundsByNE()
461 return ranges; in NarrowBoundsByNE()
464 BoundsRange::RangePair BoundsRange::NarrowBoundsCase1(ConditionCode cc, BoundsRange::RangePair const &ranges) in NarrowBoundsCase1() argument
466 auto &[left_range, right_range] = ranges; in NarrowBoundsCase1()
479 return ranges; in NarrowBoundsCase1()
482 BoundsRange::RangePair BoundsRange::NarrowBoundsCase2(ConditionCode cc, BoundsRange::RangePair const &ranges) in NarrowBoundsCase2() argument
488 return ranges; in NarrowBoundsCase2()
491 NarrowBoundsCase3(ConditionCode cc, BoundsRange::RangePair const &ranges) NarrowBoundsCase3() argument
521 NarrowBoundsCase4(ConditionCode cc, BoundsRange::RangePair const &ranges) NarrowBoundsCase4() argument
539 NarrowBoundsCase5(ConditionCode cc, BoundsRange::RangePair const &ranges) NarrowBoundsCase5() argument
548 NarrowBoundsCase6(ConditionCode cc, BoundsRange::RangePair const &ranges) NarrowBoundsCase6() argument
579 TryNarrowBoundsByCC(ConditionCode cc, BoundsRange::RangePair const &ranges) TryNarrowBoundsByCC() argument
1322 auto ranges = BoundsRange::TryNarrowBoundsByCC(cc, {leftRange, rightRange}); CalcNewBoundsRangeForCompare() local
[all...]
H A Dbounds_analysis.h118 static BoundsRange Union(const ArenaVector<BoundsRange> &ranges);
120 static RangePair NarrowBoundsByNE(RangePair const &ranges);
121 static RangePair NarrowBoundsCase1(ConditionCode cc, RangePair const &ranges);
122 static RangePair NarrowBoundsCase2(ConditionCode cc, RangePair const &ranges);
123 static RangePair NarrowBoundsCase3(ConditionCode cc, RangePair const &ranges);
124 static RangePair NarrowBoundsCase4(ConditionCode cc, RangePair const &ranges);
125 static RangePair NarrowBoundsCase5(ConditionCode cc, RangePair const &ranges);
126 static RangePair NarrowBoundsCase6(ConditionCode cc, RangePair const &ranges);
128 static RangePair TryNarrowBoundsByCC(ConditionCode cc, RangePair const &ranges);
/arkcompiler/runtime_core/static_core/libpandabase/os/
H A Ddebug_info.cpp159 bool IterateDieRanges(F func, const Span<Dwarf_Ranges> &ranges, Dwarf_Addr baseAddr) in IterateDieRanges() argument
161 for (const Dwarf_Ranges &range : ranges) { in IterateDieRanges()
214 Span<Dwarf_Ranges> ranges(buf, count); in IterateDieRanges()
215 return IterateDieRanges(func, ranges, baseAddr); in IterateDieRanges()
308 // Aranges (address ranges) is an entity which help us to find the compilation unit quickly (something like index) in ReadFromFile()
339 auto ranges = &ranges_; in GetSrcLocation() local
341 IterateDieRanges(dbg_, cuDie, [ranges, cu](Dwarf_Addr lowPc, Dwarf_Addr highPc) { in GetSrcLocation()
342 ranges->insert(Range(lowPc, highPc, cu)); in GetSrcLocation()
613 Dwarf_Ranges *ranges = nullptr; in GetDieRangeForPc() local
615 dwarf_get_ranges_a(dbg_, offset, die, &ranges, in GetDieRangeForPc()
624 FindRangeForPc(uintptr_t pc, const Span<Dwarf_Ranges> &ranges, Dwarf_Addr baseAddr, Dwarf_Addr *outLowPc, Dwarf_Addr *outHighPc) FindRangeForPc() argument
[all...]
H A Ddebug_info.h169 bool FindRangeForPc(uintptr_t pc, const Span<Dwarf_Ranges> &ranges, Dwarf_Addr baseAddr, Dwarf_Addr *outLowPc,
/arkcompiler/runtime_core/libpandabase/os/
H A Ddebug_info.cpp142 Span<Dwarf_Ranges> ranges(buf, count); in IterateDieRanges()
143 for (const Dwarf_Ranges &range : ranges) { in IterateDieRanges()
224 // Aranges (address ranges) is an entity which help us to find the compilation unit quickly (something like index) in ReadFromFile()
255 auto ranges = &ranges_; in GetSrcLocation() local
257 IterateDieRanges(dbg_, cu_die, [ranges, cu](Dwarf_Addr low_pc, Dwarf_Addr high_pc) { in GetSrcLocation()
258 ranges->insert(Range(low_pc, high_pc, cu)); in GetSrcLocation()
530 Dwarf_Ranges *ranges = nullptr; in GetDieRangeForPc() local
532 dwarf_get_ranges_a(dbg_, offset, die, &ranges, &count, nullptr, nullptr) == DW_DLV_OK) { in GetDieRangeForPc()
534 AtReturn r([dbg, ranges, count]() { dwarf_ranges_dealloc(dbg, ranges, coun in GetDieRangeForPc()
541 FindRangeForPc(uintptr_t pc, const Span<Dwarf_Ranges> &ranges, Dwarf_Addr base_addr, Dwarf_Addr *out_low_pc, Dwarf_Addr *out_high_pc) FindRangeForPc() argument
[all...]
H A Ddebug_info.h168 bool FindRangeForPc(uintptr_t pc, const Span<Dwarf_Ranges> &ranges, Dwarf_Addr base_addr, Dwarf_Addr *out_low_pc,
/arkcompiler/runtime_core/static_core/runtime/tests/
H A Dbitmap_clear_range_test.cpp44 std::vector<MemRangeTest> ranges {FIRST_RANGE, SECOND_RANGE, THIRD_RANGE, FOURTH_RANGE, FIFTH_RANGE, SIXTH_RANGE}; in TEST_F()
46 for (const auto &range : ranges) { in TEST_F()
/arkcompiler/ets_runtime/ecmascript/compiler/codegen/maple/maple_be/include/cg/
H A Dreg_alloc_lsra.h62 ranges(alloc.Adapter()), in LiveInterval()
73 rangeFinder = ranges.begin(); in InitRangeFinder()
220 return ranges; in GetRanges()
225 return ranges; in GetRanges()
230 return ranges.size(); in GetRangesSize()
292 MapleVector<LinearRange> ranges; member in maplebe::LSRALinearScanRegAllocator::LiveInterval
/arkcompiler/runtime_core/compiler/tests/
H A Dlife_intervals_test.cpp49 void CheckRanges(LifeIntervals *interval, std::initializer_list<std::pair<LifeNumber, LifeNumber>> ranges) in CheckRanges() argument
53 ASSERT_EQ(li_ranges.size(), ranges.size()); in CheckRanges()
56 auto expected_it = std::begin(ranges); in CheckRanges()
57 while (actual_it != li_ranges.end() && expected_it != std::end(ranges)) { in CheckRanges()
/arkcompiler/runtime_core/static_core/compiler/tests/
H A Dlife_intervals_test.cpp51 void CheckRanges(LifeIntervals *interval, std::initializer_list<std::pair<LifeNumber, LifeNumber>> ranges) in CheckRanges() argument
55 ASSERT_EQ(liRanges.size(), ranges.size()); in CheckRanges()
58 auto expectedIt = std::begin(ranges); in CheckRanges()
59 while (actualIt != liRanges.rend() && expectedIt != std::end(ranges)) { in CheckRanges()
67 void CheckSiblingSequence(LifeIntervals *interval, std::initializer_list<std::pair<LifeNumber, LifeNumber>> ranges) in CheckSiblingSequence() argument
69 auto expectedIt = std::begin(ranges); in CheckSiblingSequence()
H A Dbounds_analysis_test.cpp286 ArenaVector<BoundsRange> ranges(GetGraph()->GetAllocator()->Adapter()); in TEST_F()
287 ranges.emplace_back(BoundsRange(-10L, 100U)); in TEST_F()
288 ranges.emplace_back(BoundsRange(-20L, 15U)); in TEST_F()
289 auto range = BoundsRange::Union(ranges); in TEST_F()
292 ranges.clear(); in TEST_F()
294 ranges.emplace_back(BoundsRange(INT64_MIN, -10L)); in TEST_F()
295 ranges.emplace_back(BoundsRange(10U, INT64_MAX)); in TEST_F()
296 range = BoundsRange::Union(ranges); in TEST_F()
/arkcompiler/ets_runtime/ecmascript/compiler/codegen/maple/maple_be/src/cg/
H A Dreg_alloc_lsra.cpp472 * For a live interval, there might be multiple segments of live ranges,
481 if (ranges.empty()) {
482 ranges.emplace_back(from, to);
486 if (from > ranges.back().GetEnd()) {
487 ranges.emplace_back(from, to);
490 DEBUG_ASSERT(to >= ranges.back().GetStart(), "No possible on forward traverse.");
491 if (to >= ranges.back().GetEnd() && from < ranges.back().GetStart()) {
492 ranges.back().SetStart(from);
493 ranges
467 DEBUG_ASSERT(regNO < liveIntervalsArray.size(), �); } void LSRALinearScanRegAllocator::LiveInterval::AddRange(uint32 from, uint32 to) { if (ranges.empty()) { ranges.emplace_back(from, to); return; } if (from > ranges.back().GetEnd()) SetupLiveInterval() argument
[all...]
/arkcompiler/toolchain/tooling/test/
H A Ddebugger_types_test.cpp2347 "functionName":"Create0","ranges":[{"startOffset":0,"endOffset":13,"count":13}],"isBlockCoverage":true}})";
2352 const std::vector<std::unique_ptr<Coverage>> *ranges = functionCoverage->GetRanges();
2353 ASSERT_NE(ranges, nullptr);
2354 EXPECT_EQ((int)ranges->size(), 1);
2368 "functionName":"Create0","ranges":[{"startOffset":0,"endOffset":13,"count":13}],"isBlockCoverage":true}})";
2377 ret = json->GetArray("ranges", &tmpJson);
2417 "ranges":[{"startOffset":0, "endOffset":13, "count":13}],
2440 "ranges": [{"startOffset":0, "endOffset":13, "count":13}],
/arkcompiler/toolchain/tooling/base/
H A Dpt_types.cpp2891 std::unique_ptr<PtJson> ranges; in Create() local
2892 ret = params.GetArray("ranges", &ranges); in Create()
2894 int32_t len = ranges->GetSize(); in Create()
2896 std::unique_ptr<PtJson> arrayEle = ranges->Get(i); in Create()
2900 error += "'ranges' format invalid;"; in Create()
2906 error += "Unknown or wrong type of 'ranges';"; in Create()
2931 std::unique_ptr<PtJson> ranges = PtJson::CreateArray(); in ToJson() local
2935 ranges->Push(ranges_[i]->ToJson()); in ToJson()
2937 result->Add("ranges", range in ToJson()
[all...]

Completed in 23 milliseconds

12