/haiku/src/system/libroot/posix/glibc/arch/sparc/ |
H A D | addmul_1.S | 46 ! 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 D | mul_1.S | 48 ! 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 D | submul_1.S | 45 ! 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/kits/debugger/dwarf/ |
H A D | BaseUnit.cpp | 99 int mid = (lower + upper + 1) / 2; local 100 if (fEntryOffsets[mid] > offset) 101 upper = mid - 1; 103 lower = mid;
|
/haiku/src/apps/debuganalyzer/model/ |
H A D | ThreadModel.cpp | 108 int32 mid = (lower + upper) / 2; local 109 const system_profiler_event_header* header = SchedulingEventAt(mid); 113 lower = mid + 1; 115 upper = mid;
|
H A D | Model.cpp | 364 size_t mid = (lower + upper) / 2; local 365 IORequest* request = fIORequests[mid]; 368 lower = mid + 1; 370 upper = mid; 671 size_t mid = (lower + upper) / 2; local 672 while (mid < upper) { 673 system_profiler_event_header* header = fEvents[mid]; 680 mid++; 687 if (mid == upper) { 688 lower = mid; [all...] |
/haiku/src/kits/debugger/model/ |
H A D | FileSourceCode.cpp | 139 int32 mid = (lower + upper) / 2; 140 if (location <= fSourceLocations[mid]) 141 upper = mid; 143 lower = mid + 1;
|
/haiku/src/servers/registrar/ |
H A D | PriorityMessageQueue.cpp | 121 int32 mid = (lower + upper) / 2; local 122 MessageInfo *info = fMessages.ItemAt(mid); 124 lower = mid + 1; 126 upper = mid;
|
H A D | EventQueue.cpp | 306 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 D | SharedImage.cpp | 106 int32 mid = (lower + upper) / 2; local 107 if (address >= fSymbols[mid]->base + fSymbols[mid]->size) 108 lower = mid + 1; 110 upper = mid;
|
/haiku/src/apps/debuganalyzer/gui/ |
H A D | ListSelectionModel.cpp | 181 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 D | EventQueue.cpp | 131 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 D | SubTitlesSRT.cpp | 190 int32 mid = (lower + upper) / 2; local 192 fSubTitles.ItemAtFast(mid)); 194 upper = mid; 196 lower = mid + 1;
|
/haiku/src/tools/ |
H A D | elf2aout.c | 182 uint32_t mid; local 184 mid = get_mid(xe16toh(e->e_machine), e->e_ident[EI_DATA], e->e_ident[EI_CLASS]); 203 a.a_magic = htoxe32(((uint32_t)mid << 16) | OMAGIC); 237 uint32_t mid; local 239 mid = get_mid(xe16toh(e->e_machine), e->e_ident[EI_DATA], e->e_ident[EI_CLASS]); 258 a.a_magic = htoxe32(((uint32_t)mid << 16) | OMAGIC);
|
/haiku/headers/private/shared/ |
H A D | RangeArray.h | 276 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 D | CLanguageFamilySyntaxHighlightInfo.cpp | 92 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 D | VectorSet.h | 439 int32 mid = (lower + upper) / 2; local 440 int cmp = fCompare(fElements[mid], value); 442 lower = mid + 1; 444 upper = mid;
|
H A D | VectorMap.h | 662 int32 mid = (lower + upper) / 2; local 663 int cmp = fEntryStrategy.Compare(fEntryStrategy.GetKey(fElements[mid]), 666 lower = mid + 1; 668 upper = mid;
|
/haiku/src/add-ons/kernel/file_systems/xfs/ |
H A D | Inode.h | 380 int mid; local 388 mid = (left + right) / 2; 389 uint32 hashval = B_BENDIAN_TO_HOST_INT32(entry[mid].hashval); 391 right = mid; 395 left = mid+1;
|
/haiku/src/system/libroot/posix/glibc/regex/ |
H A D | regex_internal.c | 596 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 D | unicode.c | 134 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 D | unistd.cpp | 79 off_t mid = (lower + upper + 1) / 2; local 80 if (test_size(fd, mid)) 81 lower = mid; 83 upper = mid - 1;
|
/haiku/src/add-ons/kernel/file_systems/btrfs/ |
H A D | BTree.cpp | 99 int low = 0, mid = 0, comp = 0; local 103 mid = (low + high) / 2; 104 other = (const btrfs_key*)(base + mid * entrySize); 107 high = mid; 109 low = mid + 1; 111 *slot = mid; 121 mid--; 123 mid++; 125 if (type == BTREE_EXACT || mid < 0) 128 *slot = mid; [all...] |
/haiku/src/system/libroot/posix/musl/internal/ |
H A D | libm.h | 36 uint32_t mid; member in struct:ldshape::__anon11 51 uint32_t mid; member in struct:ldshape::__anon13
|
/haiku/src/add-ons/kernel/file_systems/reiserfs/ |
H A D | Iterators.cpp | 504 // 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...] |