Searched refs:endIdx (Results 1 - 5 of 5) sorted by relevance
| /arkcompiler/ets_runtime/ecmascript/ |
| H A D | js_array.cpp | 577 const JSHandle<JSTaggedValue> &fn, int64_t startIdx, int64_t endIdx) in SortElementsByMergeSort()
579 if (startIdx >= endIdx) in SortElementsByMergeSort()
582 int64_t middleIdx = startIdx + (endIdx - startIdx) / 2; // 2: half in SortElementsByMergeSort()
584 SortElementsByMergeSort(thread, elements, fn, middleIdx + 1, endIdx); in SortElementsByMergeSort()
585 MergeSortedElements(thread, elements, fn, startIdx, middleIdx, endIdx); in SortElementsByMergeSort()
590 int64_t middleIdx, int64_t endIdx) in MergeSortedElements()
593 int64_t rightLength = endIdx - middleIdx; in MergeSortedElements()
576 SortElementsByMergeSort(JSThread *thread, const JSHandle<TaggedArray> &elements, const JSHandle<JSTaggedValue> &fn, int64_t startIdx, int64_t endIdx) SortElementsByMergeSort() argument
588 MergeSortedElements(JSThread *thread, const JSHandle<TaggedArray> &elements, const JSHandle<JSTaggedValue> &fn, int64_t startIdx, int64_t middleIdx, int64_t endIdx) MergeSortedElements() argument
|
| H A D | js_array.h | 125 const JSHandle<JSTaggedValue> &fn, int64_t startIdx, int64_t endIdx);
127 const JSHandle<JSTaggedValue> &fn, int64_t startIdx, int64_t middleIdx, int64_t endIdx);
|
| /arkcompiler/ets_runtime/ecmascript/compiler/codegen/maple/maple_be/include/be/ |
| H A D | switch_lowerer.h | 58 maple::RangeGotoNode *BuildRangeGotoNode(maple::int32 startIdx, maple::int32 endIdx);
|
| /arkcompiler/ets_runtime/ecmascript/compiler/codegen/maple/maple_be/src/be/ |
| H A D | switch_lowerer.cpp | 104 RangeGotoNode *SwitchLowerer::BuildRangeGotoNode(int32 startIdx, int32 endIdx) in BuildRangeGotoNode() argument
114 for (int32 i = startIdx + 1; i <= endIdx; ++i) { in BuildRangeGotoNode()
|
| /arkcompiler/ets_runtime/ecmascript/compiler/assembler/aarch64/ |
| H A D | assembler_aarch64.cpp | 507 int endIdx = -1; in TrySequenceOfOnes() local
518 endIdx = shift; in TrySequenceOfOnes()
522 if (startIdx == -1 || endIdx == -1) { in TrySequenceOfOnes()
533 if (startIdx > endIdx) { in TrySequenceOfOnes()
534 std::swap(startIdx, endIdx); in TrySequenceOfOnes()
545 if ((shift < startIdx || endIdx < shift) && himm != outside) { in TrySequenceOfOnes()
552 } else if (shift > startIdx && shift < endIdx && himm != inside) { in TrySequenceOfOnes()
|
Completed in 6 milliseconds