HomeSort by: relevance | last modified time | path
    Searched refs:compar (Results 1 - 15 of 15) sorted by relevancy

  /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/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/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 in typeref:typename:int
  /src/lib/libc/gen/
sysctlgetmibinfo.c 82 static int compar(const void *, const void *);
91 compar(const void *a, const void *b) function in typeref:typename:int
165 qsort(h, nlen, sizeof(struct sysctlnode), compar);
350 sizeof(struct sysctlnode), compar);
fts.c 119 int (*compar)(const FTSENT **, const FTSENT **))
138 sp->fts_compar = compar;
180 if (compar) {
193 if (compar && nitems > 1)
  /src/games/atc/
log.c 73 compar(const void *va, const void *vb) function in typeref:typename:int
263 compar);
  /src/games/boggle/boggle/
bog.c 66 static int compar(const void *, const void *);
403 qsort(pword, npwords, sizeof(pword[0]), compar);
702 compar(const void *p, const void *q) function in typeref:typename:int
  /src/usr.bin/xlint/llib/
llib-lstdc 203 size_t size, int (*compar)(const void *, const void *));
205 int (*compar)(const void *, const void *));
llib-lposix 81 size_t size, int (*compar)(const void *, const void *));
216 int (*compar)(const void *, const void *));
  /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/
sanitizer_common_interceptors.inc 3752 scandir_filter_f filter, scandir_compar_f compar) {
3754 COMMON_INTERCEPTOR_ENTER(ctx, scandir, dirp, namelist, filter, compar);
3757 scandir_compar = compar;
3763 compar ? wrapped_scandir_compar : nullptr);
3805 scandir64_filter_f filter, scandir64_compar_f compar) {
3807 COMMON_INTERCEPTOR_ENTER(ctx, scandir64, dirp, namelist, filter, compar);
3810 scandir64_compar = compar;
3817 compar ? wrapped_scandir64_compar : nullptr);
5676 int (*compar)(const void *, const void *)) {
5678 COMMON_INTERCEPTOR_ENTER(ctx, tsearch, key, rootp, compar);
    [all...]

Completed in 23 milliseconds