/haiku/headers/private/kernel/util/ |
H A D | VectorMap.h | 663 int cmp = fEntryStrategy.Compare(fEntryStrategy.GetKey(fElements[mid]), local 665 if (cmp < 0)
|
/haiku/src/system/kernel/arch/arm64/ |
H A D | arch_asm.S | 215 cmp x2, xzr 246 cmp x3, x2
|
/haiku/headers/compatibility/bsd/sys/ |
H A D | time.h | 37 #define timespeccmp(a, b, cmp) (((a)->tv_sec == (b)->tv_sec) \ 38 ? ((a)->tv_nsec cmp (b)->tv_nsec) : ((a)->tv_sec cmp (b)->tv_sec))
|
/haiku/src/kits/tracker/ |
H A D | PoseView.cpp | 187 int (*cmp)(const BPose*, const BPose*, BPoseView*), 9454 int (*cmp)(const BPose*, const BPose*, BPoseView*), bool returnClosest) 9463 int32 compareResult = (cmp)(result, key, view);
|
/haiku/src/libs/compat/openbsd_wlan/net80211/ |
H A D | ieee80211_node.c | 1833 int cmp; local 1838 cmp = memcmp(macaddr, ni->ni_macaddr, IEEE80211_ADDR_LEN); 1839 if (cmp < 0) 1841 else if (cmp > 0)
|
H A D | ieee80211_regdomain.c | 64 int lim, cmp; local 69 cmp = (*compar)(key, p); 70 if (cmp == 0) 72 if (cmp > 0) { /* key > p: move right */
|
/haiku/src/kits/interface/ |
H A D | ListView.cpp | 1396 BListView::SortItems(int (*cmp)(const void *, const void *)) 1403 fList.SortItems(cmp);
|
H A D | ColumnListView.cpp | 4609 int32 cmp = CompareRows(row, list->ItemAt(middle)); local 4610 if( cmp < 0 ) upper = middle-1; 4611 else if( cmp > 0 ) lower = middle+1;
|
/haiku/src/bin/pkgman/ |
H A D | command_search.cpp | 102 int cmp = fCollator.Compare(a->Name().String(), b->Name().String()); local 103 if (cmp != 0) 104 return cmp;
|
/haiku/headers/os/interface/ |
H A D | ListView.h | 133 void SortItems(int (*cmp)(const void*,
|
/haiku/src/add-ons/kernel/file_systems/bfs/ |
H A D | BPlusTree.cpp | 1076 int32 cmp = _CompareKeys(key, keyLength, searchKey, searchLength); local 1077 if (cmp < 0) { 1080 } else if (cmp > 0) { 3080 off_t cmp; local 3084 cmp = ValueAt(index) - value; 3085 if (cmp < 0) 3087 else if (cmp > 0)
|
/haiku/src/system/libroot/posix/stdlib/ |
H A D | merge.c | 61 #define CMP(x, y) cmp(x, y) 99 mergesort(void *base, size_t nmemb, size_t size, cmp_t cmp) argument 123 setup(list1, list2, nmemb, size, cmp); 256 setup(u_char *list1, u_char *list2, size_t n, size_t size, cmp_t cmp) argument 263 insertionsort(list1, n, size, cmp); 272 insertionsort(list1 + (n - i) * size, i, size, cmp); 327 insertionsort(u_char *a, size_t n, size_t size, cmp_t cmp) argument
|
H A D | qsort.c | 65 #define CMP(t, x, y) (cmp((x), (y))) 68 med3(char *a, char *b, char *c, cmp_t *cmp, void *thunk) argument 80 local_qsort(void *a, size_t n, size_t es, cmp_t *cmp, void *thunk) argument 107 pl = med3(pl, pl + d, pl + 2 * d, cmp, thunk); 108 pm = med3(pm - d, pm, pm + d, cmp, thunk); 109 pn = med3(pn - 2 * d, pn - d, pn, cmp, thunk); 111 pm = med3(pl, pm, pn, cmp, thunk); 166 local_qsort(a, d1 / es, es, cmp, thunk); 170 /* qsort(pn - d2, d2 / es, es, cmp); */ 178 local_qsort(pn - d2, d2 / es, es, cmp, thun 190 qsort(void *a, size_t n, size_t es, cmp_t *cmp) argument [all...] |
H A D | bsearch.c | 62 int cmp; local 67 cmp = COMPAR(key, p); 68 if (cmp == 0) 70 if (cmp > 0) { /* key > p: move right */
|
/haiku/src/system/libnetwork/netresolv/net/ |
H A D | nsdispatch.c | 264 int cmp; local 266 cmp = strcmp(((const ns_mtab *)a)->name, 268 if (cmp) 269 return (cmp);
|
/haiku/src/bin/bfs_tools/ |
H A D | chkindex.cpp | 82 int cmp = (int)a->allocation_group - (int)b->allocation_group; local 83 if (cmp == 0) 84 cmp = (int)a->start - (int)b->start; 85 return cmp;
|
/haiku/src/system/kernel/arch/arm/ |
H A D | arch_asm.S | 59 cmp r0, #0 185 cmp r4, #0 187 cmp r6, r2 /* reached max length? */
|
/haiku/src/system/boot/platform/efi/arch/arm/ |
H A D | entry.S | 27 cmp r9, #0x1a
|
/haiku/src/add-ons/kernel/file_systems/packagefs/util/ |
H A D | TwoKeyAVLTree.h | 504 int cmp = fPrimaryKeyCompare(key, local 507 if (cmp != expectedCmp) { 533 int cmp = fPrimaryKeyCompare(key, fGetPrimaryKey( local 535 if (cmp == 0) { 547 if (cmp < 0) 642 int cmp = fPrimaryKeyCompare(key, fGetPrimaryKey( local 644 if (cmp == 0) { 657 if (cmp < 0)
|
/haiku/src/system/libroot/posix/musl/dirent/ |
H A D | scandir.c | 10 int (*cmp)(const struct dirent **, const struct dirent **)) 43 if (cmp) qsort(names, cnt, sizeof *names, (int (*)(const void *, const void *))cmp);
|
/haiku/src/tests/kits/shared/ |
H A D | MemoryRingIOTest.cpp | 31 ReadCheck(BMemoryRingIO& ring, const void* cmp, size_t size) argument 38 CHK(memcmp(buffer, cmp, size) == 0);
|
/haiku/src/system/libroot/posix/wchar/ |
H A D | wcsncasecmp.c | 14 int cmp = 0; local 17 cmp = towlower(*wcs1) - towlower(*wcs2++); 21 if (cmp != 0 || *wcs1++ == L'\0') 25 return cmp; 35 int cmp = 0; local 38 cmp = towlower_l(*wcs1, locale) - towlower_l(*wcs2++, locale); 42 if (cmp != 0 || *wcs1++ == L'\0') 46 return cmp;
|
H A D | wcscasecmp.c | 14 int cmp; local 17 cmp = towlower(*wcs1) - towlower(*wcs2++); 21 if (cmp != 0 || *wcs1++ == L'\0') 25 return cmp; 35 int cmp; local 38 cmp = towlower_l(*wcs1, locale) - towlower_l(*wcs2++, locale); 40 if (cmp != 0 || *wcs1++ == L'\0') 44 return cmp;
|
/haiku/src/libs/compat/freebsd_network/compat/sys/ |
H A D | time.h | 60 #define timevalcmp(tvp, uvp, cmp) \ 62 ((tvp)->tv_usec cmp (uvp)->tv_usec) : \ 63 ((tvp)->tv_sec cmp (uvp)->tv_sec))
|
/haiku/src/libs/compat/openbsd_wlan/sys/ |
H A D | tree.h | 116 #define SPLAY_PROTOTYPE(name, type, field, cmp) \ 129 if ((cmp)(elm, (head)->sph_root) == 0) \ 158 #define SPLAY_GENERATE(name, type, field, cmp) \ 167 __comp = (cmp)(elm, (head)->sph_root); \ 190 if ((cmp)(elm, (head)->sph_root) == 0) { \ 213 while ((__comp = (cmp)(elm, (head)->sph_root))) { \ 218 if ((cmp)(elm, __tmp) < 0){ \ 228 if ((cmp)(elm, __tmp) > 0){ \ 378 #define RB_PROTOTYPE(name, type, field, cmp) \ 379 RB_PROTOTYPE_INTERNAL(name, type, field, cmp,) [all...] |