Searched refs:mid (Results 1 - 25 of 37) sorted by relevance

12

/haiku/src/kits/debugger/dwarf/
H A DBaseUnit.cpp98 int mid = (lower + upper + 1) / 2; local
99 if (fEntryOffsets[mid] > offset)
100 upper = mid - 1;
102 lower = mid;
/haiku/src/system/libroot/posix/glibc/arch/sparc/
H A Daddmul_1.S46 ! mid-1 !
47 ! mid-2 !
55 mulx %i3,%i0,%i1 ! mid-1 product
56 mulx %o1,%g5,%l2 ! mid-2 product
59 add %i1,%i0,%i1 ! ...and add it to the mid-1 product
60 addcc %i1,%l2,%i1 ! add mid products
63 sllx %i1,32,%i0 ! align low bits of mid product
67 srlx %i1,32,%i1 ! extract high bits of mid product...
H A Dmul_1.S48 ! mid-1 !
49 ! mid-2 !
57 mulx %i3,%i0,%i1 ! mid-1 product
58 mulx %o1,%g5,%l2 ! mid-2 product
61 add %i1,%i0,%i1 ! ...and add it to the mid-1 product
62 addcc %i1,%l2,%i1 ! add mid products
66 sllx %i1,32,%i0 ! align low bits of mid product
69 srlx %i1,32,%i1 ! extract high bits of mid product...
H A Dsubmul_1.S45 ! mid-1 !
46 ! mid-2 !
54 mulx %i3,%i0,%i1 ! mid-1 product
55 mulx %o1,%g5,%l2 ! mid-2 product
58 add %i1,%i0,%i1 ! ...and add it to the mid-1 product
59 addcc %i1,%l2,%i1 ! add mid products
62 sllx %i1,32,%i0 ! align low bits of mid product
66 srlx %i1,32,%i1 ! extract high bits of mid product...
/haiku/src/apps/debuganalyzer/model/
H A DThreadModel.cpp108 int32 mid = (lower + upper) / 2; local
109 const system_profiler_event_header* header = SchedulingEventAt(mid);
113 lower = mid + 1;
115 upper = mid;
H A DModel.cpp363 size_t mid = (lower + upper) / 2; local
364 IORequest* request = fIORequests[mid];
367 lower = mid + 1;
369 upper = mid;
670 size_t mid = (lower + upper) / 2; local
671 while (mid < upper) {
672 system_profiler_event_header* header = fEvents[mid];
679 mid++;
686 if (mid == upper) {
687 lower = mid;
[all...]
/haiku/src/kits/debugger/model/
H A DFileSourceCode.cpp139 int32 mid = (lower + upper) / 2;
140 if (location <= fSourceLocations[mid])
141 upper = mid;
143 lower = mid + 1;
/haiku/src/servers/registrar/
H A DPriorityMessageQueue.cpp121 int32 mid = (lower + upper) / 2; local
122 MessageInfo *info = fMessages.ItemAt(mid);
124 lower = mid + 1;
126 upper = mid;
H A DEventQueue.cpp306 int32 mid = (lower + upper) / 2; local
307 Event* midEvent = _EventAt(mid);
309 upper = mid; // time < mid:time => time < upper:time
311 lower = mid + 1; // mid:time <= time => lower-1:time <= time
/haiku/src/bin/debug/profile/
H A DSharedImage.cpp104 int32 mid = (lower + upper) / 2; local
105 if (address >= fSymbols[mid]->base + fSymbols[mid]->size)
106 lower = mid + 1;
108 upper = mid;
/haiku/src/apps/debuganalyzer/gui/
H A DListSelectionModel.cpp181 int32 mid = (lower + upper) / 2; local
183 if (fSelectedItems[mid] < itemIndex)
184 lower = mid + 1;
186 upper = mid;
/haiku/src/apps/mediaplayer/support/
H A DEventQueue.cpp131 int32 mid = (lower + upper) / 2; local
132 Event* midEvent = _EventAt(mid);
134 upper = mid;
136 lower = mid + 1;
/haiku/src/apps/mediaplayer/supplier/
H A DSubTitlesSRT.cpp190 int32 mid = (lower + upper) / 2; local
192 fSubTitles.ItemAtFast(mid));
194 upper = mid;
196 lower = mid + 1;
/haiku/src/apps/haikudepot/
H A DList.h262 int32 mid = start + ((end - start) >> 1);
264 if (fCompareContextFunction(context, ItemAtFast(mid)) >= 0)
265 return _BinarySearchBounded(context, mid, end);
266 return _BinarySearchBounded(context, start, mid - 1);
317 int32 mid = start + ((end - start) >> 1);
319 if (fCompareItemsFunction(copyFrom, ItemAtFast(mid)) >= 0)
320 return _AddOrderedBounded(copyFrom, mid, end);
321 return _AddOrderedBounded(copyFrom, start, mid - 1);
/haiku/headers/private/shared/
H A DRangeArray.h276 int32 mid = (lower + upper) / 2; local
277 const RangeType& range = RangeAt(mid);
279 lower = mid + 1;
281 upper = mid;
/haiku/src/kits/debugger/source_language/c_family/
H A DCLanguageFamilySyntaxHighlightInfo.cpp92 int mid = (lower + upper + 1) / 2; local
94 int cmp = token.string.Compare(kLanguageKeywords[mid]);
98 upper = mid - 1;
100 lower = mid;
/haiku/headers/private/kernel/util/
H A DVectorSet.h439 int32 mid = (lower + upper) / 2; local
440 int cmp = fCompare(fElements[mid], value);
442 lower = mid + 1;
444 upper = mid;
H A DVectorMap.h662 int32 mid = (lower + upper) / 2; local
663 int cmp = fEntryStrategy.Compare(fEntryStrategy.GetKey(fElements[mid]),
666 lower = mid + 1;
668 upper = mid;
/haiku/src/libs/libunwind/ia64/
H A DGtables.c91 unsigned long lo, hi, mid; local
97 mid = (lo + hi) / 2;
98 e_addr = table + mid * sizeof (struct ia64_table_entry);
103 hi = mid;
110 lo = mid + 1;
231 unsigned long lo, hi, mid; local
236 mid = (lo + hi) / 2;
237 e = table + mid;
239 hi = mid;
241 lo = mid
[all...]
/haiku/src/system/libroot/posix/glibc/regex/
H A Dregex_internal.c596 int low = 0, high = pstr->valid_len, mid;
599 mid = (high + low) / 2;
600 if (pstr->offsets[mid] > offset)
601 high = mid;
602 else if (pstr->offsets[mid] < offset)
603 low = mid + 1;
608 if (pstr->offsets[mid] < offset)
609 ++mid;
610 pstr->tip_context = re_string_context_at (pstr, mid - 1,
617 && mid
595 int low = 0, high = pstr->valid_len, mid; local
1362 unsigned int idx, right, mid; local
[all...]
/haiku/src/apps/serialconnect/libvterm/src/
H A Dunicode.c134 int mid; local
139 mid = (min + max) / 2;
140 if (ucs > table[mid].last)
141 min = mid + 1;
142 else if (ucs < table[mid].first)
143 max = mid - 1;
/haiku/src/tools/fs_shell/
H A Dunistd.cpp78 off_t mid = (lower + upper + 1) / 2; local
79 if (test_size(fd, mid))
80 lower = mid;
82 upper = mid - 1;
/haiku/src/libs/libunwind/dwarf/
H A DGfind_proc_info-lsb.c912 unsigned long lo, hi, mid; local
917 mid = (lo + hi) / 2;
918 e = table + mid;
921 hi = mid;
923 lo = mid + 1;
945 unsigned long lo, hi, mid; local
953 mid = (lo + hi) / 2;
954 e_addr = table + mid * sizeof (struct table_entry);
959 hi = mid;
961 lo = mid
[all...]
/haiku/src/add-ons/kernel/file_systems/btrfs/
H A DBTree.cpp108 int low = 0, mid = 0, comp = 0; local
112 mid = (low + high) / 2;
113 other = (const btrfs_key*)(base + mid * entrySize);
116 high = mid;
118 low = mid + 1;
120 *slot = mid;
130 mid--;
132 mid++;
134 if (type == BTREE_EXACT || mid < 0)
137 *slot = mid;
[all...]
/haiku/src/add-ons/kernel/file_systems/reiserfs/
H A DIterators.cpp504 // binary search: lower and upper are node indices, mid is a key index
508 int32 mid = (lower + upper) / 2; // lower <= mid < upper <= count local
509 VKey midKey(node->KeyAt(mid));
510 //PRINT((" mid: %3ld: ", mid));
512 if (*k < midKey) // => node index <= mid
513 upper = mid; // lower <= upper < count
514 else // => node index > mid
515 lower = mid
778 int32 mid = (lower + upper + 1) / 2; local
[all...]

Completed in 445 milliseconds

12