Searched refs:compar (Results 1 - 10 of 10) sorted by relevance
/barrelfish-master/lib/libc/stdlib/ |
H A D | qsort_r.c | 14 qsort_b(void *base, size_t nel, size_t width, qsort_block compar) argument 16 qsort_r(base, nel, width, compar, 18 GET_BLOCK_FUNCTION(compar));
|
H A D | bsearch.c | 41 #define COMPAR(x,y) CALL_BLOCK(compar, x, y) 43 #define COMPAR(x,y) compar(x, y) 65 DECLARE_BLOCK(int, compar, const void *, const void *)) 69 int (*compar)(const void *, const void *))
|
H A D | tfind.c | 34 int (*compar)(const void *, const void *)) 44 if ((r = (*compar)(vkey, (*rootp)->key)) == 0) /* T2: */
|
H A D | lsearch.c | 23 int (*compar)(const void *, const void *)) 26 return (lwork(key, base, nelp, width, compar, 1)); 30 int (*compar)(const void *, const void *)) 33 return (lwork(key, base, nelp, width, compar, 0)); 38 int (*compar)(const void *, const void *), int addelem) 44 if (compar(key, ep) == 0)
|
H A D | heapsort.c | 47 #define COMPAR(x, y) CALL_BLOCK(compar, x, y) 50 #define COMPAR(x, y) compar(x, y) 103 * action is the call to the compar function, a considerable optimization 156 heapsort_b(void *vbase, size_t nmemb, size_t size, heapsort_block compar) argument 160 int (*compar)(const void *, const void *))
|
H A D | tsearch.c | 37 int (*compar)(const void *, const void *)) 70 cmp = compar(key, (*leaf)->key);
|
H A D | tdelete.c | 71 int (*compar)(const void *, const void *)) 96 cmp = compar(key, (*leaf)->key);
|
/barrelfish-master/lib/libc/tests/stdlib/ |
H A D | tsearch_test.c | 54 compar(const void *a, const void *b) function 89 ATF_CHECK(tdelete(&key, &root, compar) != NULL); 93 tdelete(&key, &root, compar)); 99 *(int **)tfind(&key, &root, compar)); 101 ATF_CHECK_EQ(NULL, tfind(&key, &root, compar)); 107 *(int **)tsearch(&key, &root, compar)); 110 &keys[key], &root, compar)); 121 ATF_CHECK(tdelete(&key, &root, compar) != NULL);
|
/barrelfish-master/lib/libc/locale/ |
H A D | collate.c | 233 int next, compar, l; local 243 compar = *key - *p->str; 244 if (compar == 0) { 246 compar = wcsncmp(key, p->str, l); 247 if (compar == 0) { 252 if (compar > 0) 265 int next, compar; local 275 compar = key - p->val; 276 if (compar == 0) 278 if (compar > [all...] |
/barrelfish-master/usr/bench/thc_v_flounder/ |
H A D | empty.c | 269 static int compar(const void *a, const void *b) { function 339 qsort(&timings[SKIP], ITERATIONS-SKIP, sizeof(cycles_t), &compar);
|
Completed in 99 milliseconds