| /src/lib/libc/stdlib/ |
| lsearch.c | 55 cmp_fn_t compar)
60 _DIAGASSERT(compar != NULL);
62 return(linear_base(key, base, nelp, width, compar, 1));
67 cmp_fn_t compar)
72 _DIAGASSERT(compar != NULL);
74 return(linear_base(key, __UNCONST(base), nelp, width, compar, 0));
79 cmp_fn_t compar, int add_flag)
85 _DIAGASSERT(compar != NULL);
89 if (!compar(element, key)) /* key found */
|
| tfind.c | 27 int (*compar)(const void *, const void *))
32 _DIAGASSERT(compar != NULL);
40 if ((r = (*compar)(vkey, (*rootp)->key)) == 0) /* T2: */
|
| bsearch.c | 63 int (*compar)(const void *, const void *))
72 _DIAGASSERT(compar != NULL);
76 cmp = (*compar)(key, p);
|
| tsearch.c | 27 int (*compar)(const void *, const void *))
33 _DIAGASSERT(compar != NULL);
41 if ((r = (*compar)(vkey, (*rootp)->key)) == 0) /* T2: */
|
| tdelete.c | 28 int (*compar)(const void *, const void *))
35 _DIAGASSERT(compar != NULL);
40 while ((cmp = (*compar)(vkey, (*rootp)->key)) != 0) {
|
| /src/external/cddl/osnet/sys/util/ |
| qsort.h | 34 int (*compar)(const void *, const void *))
39 kheapsort(base, nmemb, size, compar, tmp);
|
| /src/external/gpl3/binutils/dist/libctf/ |
| ctf-decls.h | 32 int (*compar)(const void *, const void *, void *),
35 qsort_r (base, nmemb, size, compar, arg);
40 int (*compar) (const void *, const void *, void *); member in struct:ctf_qsort_arg
49 return qsort_arg->compar (a, b, qsort_arg->arg);
54 int (*compar)(const void *, const void *, void *),
57 struct ctf_qsort_arg thunk = { compar, arg };
62 int (*compar)(const void *, const void *, void *),
|
| /src/external/gpl3/binutils.old/dist/libctf/ |
| ctf-decls.h | 32 int (*compar)(const void *, const void *, void *),
35 qsort_r (base, nmemb, size, compar, arg);
40 int (*compar) (const void *, const void *, void *); member in struct:ctf_qsort_arg
49 return qsort_arg->compar (a, b, qsort_arg->arg);
54 int (*compar)(const void *, const void *, void *),
57 struct ctf_qsort_arg thunk = { compar, arg };
62 int (*compar)(const void *, const void *, void *),
|
| /src/external/gpl3/binutils/dist/libiberty/ |
| bsearch.c | 35 int (*@var{compar})(const void *, const void *))
40 should be sorted in ascending order according to the @var{compar}
74 int (*compar)(const void *, const void *))
82 cmp = (*compar)(key, p);
|
| bsearch_r.c | 35 int (*@var{compar})(const void *, const void *, void *), void *@var{arg})
40 should be sorted in ascending order according to the @var{compar}
75 int (*compar)(const void *, const void *, void *),
84 cmp = (*compar)(key, p, arg);
|
| /src/external/gpl3/binutils.old/dist/libiberty/ |
| bsearch.c | 35 int (*@var{compar})(const void *, const void *))
40 should be sorted in ascending order according to the @var{compar}
74 int (*compar)(const void *, const void *))
82 cmp = (*compar)(key, p);
|
| bsearch_r.c | 35 int (*@var{compar})(const void *, const void *, void *), void *@var{arg})
40 should be sorted in ascending order according to the @var{compar}
75 int (*compar)(const void *, const void *, void *),
84 cmp = (*compar)(key, p, arg);
|
| /src/external/gpl3/gcc.old/dist/libiberty/ |
| bsearch.c | 35 int (*@var{compar})(const void *, const void *))
40 should be sorted in ascending order according to the @var{compar}
74 int (*compar)(const void *, const void *))
82 cmp = (*compar)(key, p);
|
| bsearch_r.c | 35 int (*@var{compar})(const void *, const void *, void *), void *@var{arg})
40 should be sorted in ascending order according to the @var{compar}
75 int (*compar)(const void *, const void *, void *),
84 cmp = (*compar)(key, p, arg);
|
| /src/external/bsd/nvi/dist/clib/ |
| bsearch.c | 70 bsearch(register const void *key, const void *base0, size_t nmemb, register size_t size, register int (*compar) (const void *, const void *))
79 cmp = (*compar)(key, p);
|
| /src/external/gpl3/gcc.old/dist/libbacktrace/ |
| sort.c | 62 int (*compar) (const void *, const void *))
81 if ((*compar) (base, base + i * size) > 0)
96 backtrace_qsort (base, mid, size, compar);
104 size, compar);
|
| /src/external/gpl2/gettext/dist/gettext-tools/gnulib-lib/ |
| gl_list.c | 229 gl_sortedlist_search (gl_list_t list, gl_listelement_compar_fn compar, const void *elt)
232 ->sortedlist_search (list, compar, elt);
236 gl_sortedlist_search_from_to (gl_list_t list, gl_listelement_compar_fn compar, size_t start_index, size_t end_index, const void *elt)
239 ->sortedlist_search_from_to (list, compar, start_index, end_index,
244 gl_sortedlist_indexof (gl_list_t list, gl_listelement_compar_fn compar, const void *elt)
247 ->sortedlist_indexof (list, compar, elt);
251 gl_sortedlist_indexof_from_to (gl_list_t list, gl_listelement_compar_fn compar, size_t start_index, size_t end_index, const void *elt)
254 ->sortedlist_indexof_from_to (list, compar, start_index, end_index,
259 gl_sortedlist_add (gl_list_t list, gl_listelement_compar_fn compar, const void *elt)
262 ->sortedlist_add (list, compar, elt)
[all...] |
| gl_list.h | 298 The list is assumed to be sorted with COMPAR.
303 gl_listelement_compar_fn compar,
307 The list is assumed to be sorted with COMPAR.
310 of COMPAR invocations.
315 gl_listelement_compar_fn compar,
321 The list is assumed to be sorted with COMPAR.
326 gl_listelement_compar_fn compar,
330 The list is assumed to be sorted with COMPAR.
333 of COMPAR invocations.
338 gl_listelement_compar_fn compar,
[all...] |
| gl_anylinked_list2.h | 892 gl_linked_sortedlist_search (gl_list_t list, gl_listelement_compar_fn compar,
899 int cmp = compar (node->value, elt);
911 gl_listelement_compar_fn compar,
944 int cmp = compar (node->value, elt);
958 gl_linked_sortedlist_indexof (gl_list_t list, gl_listelement_compar_fn compar,
968 int cmp = compar (node->value, elt);
980 gl_listelement_compar_fn compar,
1014 int cmp = compar (node->value, elt);
1029 gl_linked_sortedlist_add (gl_list_t list, gl_listelement_compar_fn compar,
1035 if (compar (node->value, elt) >= 0
[all...] |
| /src/common/lib/libc/stdlib/ |
| heapsort.c | 116 compar(child, child + size, cookie) < 0) { \
121 if (compar(child, par, cookie) <= 0) \
129 * action is the call to the compar function, a considerable optimization
148 compar(child, child + size, cookie) < 0) { \
160 if (child_i == 1 || compar(k, par, cookie) < 0) { \
178 int (*compar)(const void *, const void *, void *), void *cookie,
183 int (*compar)(const void *, const void *, void *), void *cookie)
194 _DIAGASSERT(compar != NULL);
|
| /src/tests/usr.bin/xlint/lint1/ |
| msg_346.c | 71 int (*compar) (const void *, const void *));
|
| /src/external/cddl/osnet/dist/uts/common/sys/ |
| avl.h | 151 * compar - function to compare two nodes, it must return exactly: -1, 0, or +1
157 int (*compar) (const void *, const void *), size_t size, size_t offset);
|
| /src/external/bsd/nsd/dist/simdzone/src/westmere/ |
| type.h | 132 const __m128i compar = _mm_loadu_si128((const __m128i *)(*mnemonic)->key.data); local
133 const __m128i xorthem = _mm_xor_si128(compar, input);
168 const __m128i compar = _mm_loadu_si128((const __m128i *)(*mnemonic)->key.data); local
169 const __m128i xorthem = _mm_xor_si128(compar, input);
|
| /src/usr.sbin/lpr/common_source/ |
| common.c | 117 static int compar(const void *, const void *);
296 qsort(queue, nitems, sizeof(struct queue *), compar);
322 compar(const void *p1, const void *p2) function
|
| /src/lib/libc/gen/ |
| sysctlgetmibinfo.c | 82 static int compar(const void *, const void *);
91 compar(const void *a, const void *b) function
165 qsort(h, nlen, sizeof(struct sysctlnode), compar);
350 sizeof(struct sysctlnode), compar);
|
