Home
last modified time | relevance | path

Searched refs:intersection (Results 1 - 13 of 13) sorted by relevance

/arkcompiler/runtime_core/static_core/compiler/optimizer/optimizations/regalloc/
H A Dreg_alloc_linear_scan.cpp339 auto setFixedUsage = [this, &currentInterval](const auto &interval, LifeNumber intersection) { in GetFreeRegister()
340 // If intersection is equal to the current_interval's begin in GetFreeRegister()
344 if (intersection == currentInterval->GetBegin()) { in GetFreeRegister()
346 [[maybe_unused]] bool succ = interval->FindRangeCoveringPosition(intersection, &range); in GetFreeRegister()
348 if (range.GetBegin() == intersection) { in GetFreeRegister()
353 regsUsePositions_[interval->GetReg()] = intersection; in GetFreeRegister()
355 auto setInactiveUsage = [this](const auto &interval, LifeNumber intersection) { in GetFreeRegister()
358 regUse = std::min<size_t>(intersection, regUse); in GetFreeRegister()
387 auto setFixedUsage = [this, currentInterval](const auto &interval, LifeNumber intersection) { in GetBlockedRegister()
388 // If intersection i in GetBlockedRegister()
532 auto intersection = currentInterval->GetFirstIntersectionWith(fixedInterval); HandleFixedIntervalIntersection() local
[all...]
H A Dreg_alloc_linear_scan.h177 auto intersection = interval->GetFirstIntersectionWith(current); in EnumerateIntersectedIntervals() local
178 if (intersection != INVALID_LIFE_NUMBER) { in EnumerateIntersectedIntervals()
179 callback(interval, intersection); in EnumerateIntersectedIntervals()
/arkcompiler/runtime_core/static_core/verification/util/
H A Dset_operations.h86 S intersection = SetIntersection(lhs, rhs); in SetDifference() local
100 Arg intersection = SetIntersection(arg, sum); in SetDifference() local
103 if (intersection.count(elt) == 0) { in SetDifference()
/arkcompiler/runtime_core/compiler/optimizer/optimizations/regalloc/
H A Dreg_alloc_graph_coloring.cpp56 auto intersection = current_interval->GetFirstIntersectionWith(physical_interval); in BuildIG() local
59 // Try to find first intersection excluding the range blocking registers during a call. in BuildIG()
60 if (intersection == current_interval->GetBegin()) { in BuildIG()
61 intersection = current_interval->GetFirstIntersectionWith(physical_interval, intersection + 1U); in BuildIG()
64 if (intersection != INVALID_LIFE_NUMBER) { in BuildIG()
/arkcompiler/runtime_core/static_core/compiler/optimizer/analysis/
H A Dliveness_analyzer.h422 auto intersection = GetFirstIntersectionWith(other); in IntersectsWith() local
426 // interval's range was created for it. Try to find next intersection in IntersectsWith()
431 // skip intersection in IntersectsWith()
432 if (intersection == GetBegin()) { in IntersectsWith()
433 intersection = GetFirstIntersectionWith(other, intersection + 1U); in IntersectsWith()
436 return intersection != INVALID_LIFE_NUMBER; in IntersectsWith()
H A Dalias_analysis.cpp416 // Find the intersection in CheckMemAddress()
417 const Pointer *intersection = nullptr; in CheckMemAddress() local
420 intersection = &alias; in CheckMemAddress()
425 // The only common intersection in CheckMemAddress()
426 if (intersection != nullptr && aliases1.size() == 1 && aliases2.size() == 1) { in CheckMemAddress()
427 return SingleIntersectionAliasing(p1, p2, intersection); in CheckMemAddress()
429 // Empty intersection: check that both addresses are not parameters in CheckMemAddress()
430 if (intersection == nullptr) { in CheckMemAddress()
475 AliasType AliasAnalysis::SingleIntersectionAliasing(const Pointer &p1, const Pointer &p2, const Pointer *intersection) in SingleIntersectionAliasing() argument
501 if (intersection in SingleIntersectionAliasing()
[all...]
H A Dalias_analysis.h425 static AliasType SingleIntersectionAliasing(const Pointer &p1, const Pointer &p2, const Pointer *intersection);
/arkcompiler/runtime_core/static_core/tests/vm-benchmarks/src/vmb/
H A Dreport.py125 for t in tests1.intersection(tests2):
408 for lib in set(r1.keys()).intersection(set(r2.keys())):
437 opts = opts1.intersection(opts2)
447 for lib in set(opt1.keys()).intersection(set(opt2.keys())):
510 for t in set(gc_tests_1).intersection(set(gc_tests_2)):
H A Ddoclet.py356 if skip_tags and set.intersection(tags, skip_tags):
358 if tags_filter and not set.intersection(tags, tags_filter):
/arkcompiler/ets_runtime/ecmascript/compiler/
H A Drange_analysis.cpp172 auto intersected = value.intersection(largerRange); in VisitIndexCheck()
274 return range.intersection(GetRangeOfCompare(condition, value, flag)); in TryGetRangeOfBranch()
H A Dnumber_gate_info.h146 RangeInfo intersection(const RangeInfo &rhs) const in intersection() function in panda::ecmascript::kungfu::RangeInfo
/arkcompiler/runtime_core/static_core/plugins/ets/tests/scripts/micro-benchmarks/
H A Drun_micro_benchmarks.py267 new_passed = skipset.intersection(set(passed_tests)) - set(failed_tests)
/arkcompiler/ets_frontend/es2panda/test/compiler/js/
H A Dcocos_worker_test.js16290 static intersection(t, e, i) {
[all...]

Completed in 41 milliseconds