| /arkcompiler/ets_runtime/test/aottest/optimization/ |
| D | optimization.ts | 52 let mid: number = (low + high) >>> 1;
53 if (array[mid] == target) {
54 return mid;
55 } else if (array[mid] < target) {
56 low = mid + 1;
57 } else if (array[mid] > target) {
58 high = mid - 1;
|
| /arkcompiler/ets_runtime/ecmascript/stackmap/ |
| D | ark_stackmap_parser.cpp | 27 int mid = 0; in BinaraySearch() local
30 mid = (slow + high) >> 1; in BinaraySearch()
31 v = callsiteHead[mid].calliteOffsetInTxtSec; in BinaraySearch()
33 return mid; in BinaraySearch()
35 high = mid - 1; in BinaraySearch()
37 slow = mid + 1; in BinaraySearch()
62 int mid = BinaraySearch(callsiteHead, callsiteNum, callSiteAddr); in GetArkDeopt() local
63 if (mid == -1) { in GetArkDeopt()
66 CallsiteHeader *found = callsiteHead + mid; in GetArkDeopt()
169 int mid = BinaraySearch(callsiteHead, callsiteNum, callSiteAddr); in IteratorStackMap() local
[all …]
|
| /arkcompiler/runtime_core/static_core/runtime/tests/ |
| D | mark_word_test.cpp | 175 …void CheckHeavyweightLock(const Monitor::MonitorId mId, bool isMarkedForGc, bool isReadBarrierSet … in CheckHeavyweightLock() argument
179 ASSERT_EQ(mw_.GetMonitorId(), mId) << " seed = " << paramGetter_.GetSeed(); in CheckHeavyweightLock()
205 void DecodeHeavyLock(Monitor::MonitorId mId) in DecodeHeavyLock() argument
207 mw_ = mw_.DecodeFromMonitor(mId); in DecodeHeavyLock()
230 auto mId = paramGetter_.GetMonitorId(); in DecodeAndCheckHeavyLock() local
231 DecodeHeavyLock(mId); in DecodeAndCheckHeavyLock()
232 CheckHeavyweightLock(mId, isMarkedForGc, isReadBarrierSet); in DecodeAndCheckHeavyLock()
457 auto mId = paramGetter.GetMonitorId(); in CheckMarkingWithGC() local
458 wrapper.DecodeHeavyLock(mId); in CheckMarkingWithGC()
461 wrapper.CheckHeavyweightLock(mId, true); in CheckMarkingWithGC()
[all …]
|
| /arkcompiler/ets_runtime/ecmascript/compiler/codegen/maple/maple_be/src/be/ |
| D | switch_lowerer.cpp | 315 /* find the mid-point in switch_items between start and end */ in BuildCodeForSwitchItems()
316 int32 mid = start; in BuildCodeForSwitchItems() local
317 while (stmt->GetCasePair(switchItems[mid].first).first < middleTag) { in BuildCodeForSwitchItems()
318 ++mid; in BuildCodeForSwitchItems()
320 DEBUG_ASSERT(mid >= start, "switch lowering logic mid should greater than or equal start"); in BuildCodeForSwitchItems()
321 DEBUG_ASSERT(mid <= end, "switch lowering logic mid should less than or equal end"); in BuildCodeForSwitchItems()
324 … cmpNode = BuildCmpNode(OP_lt, static_cast<uint32>(switchItems[static_cast<uint64>(mid)].first)); in BuildCodeForSwitchItems()
326 bool leftHighBNdChecked = (stmt->GetCasePair(switchItems.at(mid - 1).first).first + 1 == in BuildCodeForSwitchItems()
327 stmt->GetCasePair(switchItems.at(mid).first).first) || in BuildCodeForSwitchItems()
328 (stmt->GetCasePair(switchItems.at(mid - 1).second).first + 1 == in BuildCodeForSwitchItems()
[all …]
|
| /arkcompiler/ets_runtime/ecmascript/ |
| D | layout_info-inl.h | 139 int mid = low + (high - low) / 2; // 2: half in BinarySearch() local
140 JSTaggedValue midKey = GetSortedKey(mid); in BinarySearch()
143 high = mid - 1; in BinarySearch()
145 low = mid + 1; in BinarySearch()
147 int sortIndex = static_cast<int>(GetSortedIndex(mid)); in BinarySearch()
152 int midLeft = mid; in BinarySearch()
153 int midRight = mid; in BinarySearch()
|
| /arkcompiler/runtime_core/static_core/plugins/ets/templates/stdlib/ |
| D | Array_builtin.erb | 283 const mid = min(left + size - 1, endIndex - 1);
286 // Merge sub array arr[left.....mid] and arr[mid+1....right]
287 if (mid < right) {
288 perform_merge(arr, left, mid, right, comp);
384 const mid = min(left + size - 1, endIndex - 1);
387 // Merge sub array arr[left.....mid] and arr[mid+1....right]
388 if (mid < right) {
389 stringified_perform_merge(arr, arrStr, left, mid, right);
|
| /arkcompiler/ets_runtime/test/moduletest/mapget/ |
| D | mapget.js | 238 let mid = map.entries(); // points to (2, null) variable
239 mid.next();
253 if (!mid.next().done) {
254 throw new Error("Invalid 'mid' iterator");
282 if (!mid.next().done) {
283 throw new Error("Invalid 'mid' iterator");
|
| /arkcompiler/ets_runtime/ecmascript/extractortool/src/ |
| D | source_map.cpp | 217 int32_t mid = (right + left) / 2; in Find() local
218 … if ((targetMap.afterPos_[mid].afterRow == row && targetMap.afterPos_[mid].afterColumn > col) || in Find()
219 targetMap.afterPos_[mid].afterRow > row) { in Find()
220 right = mid - 1; in Find()
222 res = mid; in Find()
223 left = mid + 1; in Find()
|
| /arkcompiler/runtime_core/static_core/compiler/optimizer/analysis/ |
| D | live_registers.h | 96 // Each LifeIntervalsTreeNode stores intervals covering the mid point associated with a node, these…
98 // mid point and every right child stores intervals started after current node's mid point.
|
| D | live_registers.cpp | 110 // 1) intervals covering mid point; in BuildIntervalsTree()
111 // 2) intervals ended before mid point; in BuildIntervalsTree()
112 // 3) intervals started after mid point. in BuildIntervalsTree()
|
| /arkcompiler/runtime_core/static_core/scripts/ |
| D | compiler_bisect.py | 212 mid = len(values) // 2
213 left, right = values[:mid], values[mid:]
|
| /arkcompiler/ets_runtime/ecmascript/js_api/ |
| D | js_api_lightweightset.cpp | 115 int32_t mid = (low + high) >> 1U; in BinarySearchHashes() local
116 uint32_t midVal = (uint32_t)(hashArray->Get(static_cast<uint32_t>(mid)).GetNumber()); in BinarySearchHashes()
118 low = mid + 1; in BinarySearchHashes()
121 return mid; in BinarySearchHashes()
123 high = mid - 1; in BinarySearchHashes()
|
| D | js_api_lightweightmap.cpp | 503 uint32_t mid = static_cast<uint32_t>(low + high) >> 1U; in BinarySearchHashes() local
504 int32_t midHash = array->Get(mid).GetInt(); in BinarySearchHashes()
506 low = static_cast<int32_t>(mid) + 1; in BinarySearchHashes()
509 return mid; in BinarySearchHashes()
511 high = static_cast<int32_t>(mid) - 1; in BinarySearchHashes()
|
| D | js_api_plain_array.cpp | 138 int32_t mid = static_cast<int32_t>(static_cast<uint32_t>(low + high) >> 1U); in BinarySearch() local
139 int32_t midVal = static_cast<int32_t>(array->Get(mid).GetNumber()); in BinarySearch()
141 low = mid + 1; in BinarySearch()
144 return mid; in BinarySearch()
146 high = mid - 1; in BinarySearch()
|
| /arkcompiler/runtime_core/tests/cts-generator/cts-template/ |
| D | jnez.obj.yaml | 150 mid:
186 - values: ["mid"]
222 mid:
258 - values: ["mid"]
|
| D | jeqz.obj.yaml | 150 mid:
186 - values: ["mid"]
222 mid:
258 - values: ["mid"]
|
| D | jeqz.yaml | 398 mid:
434 - values: ["mid"]
|
| D | jgtz.yaml | 408 mid:
444 - values: ["mid"]
|
| D | jnez.yaml | 399 mid:
435 - values: ["mid"]
|
| D | jltz.yaml | 411 mid:
447 - values: ["mid"]
|
| /arkcompiler/runtime_core/static_core/tests/cts-generator/cts-template/ |
| D | jnez.yaml | 359 mid:
391 - values: ["mid"]
|
| D | jgtz.yaml | 368 mid:
400 - values: ["mid"]
|
| D | jeqz.yaml | 358 mid:
390 - values: ["mid"]
|
| D | jltz.yaml | 370 mid:
402 - values: ["mid"]
|
| /arkcompiler/runtime_core/static_core/plugins/ets/stdlib/std/containers/ |
| D | ArrayAsList.sts.stub | 191 sortPart(arr, l, mid, comparator);
192 sortPart(arr, mid, r, comparator);
|