common/lib/libc/stdlib/heapsort.c

116

compar(child, child + size, cookie) < 0) { \

common/lib/libc/stdlib/heapsort.c

121

if (compar(child, par, cookie) <= 0) \

common/lib/libc/stdlib/heapsort.c

148

compar(child, child + size, cookie) < 0) { \

common/lib/libc/stdlib/heapsort.c

160

if (child_i == 1 || compar(k, par, cookie) < 0) { \

common/lib/libc/stdlib/heapsort.c

178

int (*compar)(const void *, const void *, void *), void *cookie,

common/lib/libc/stdlib/heapsort.c

183

int (*compar)(const void *, const void *, void *), void *cookie)

common/lib/libc/stdlib/heapsort.c

194

_DIAGASSERT(compar != NULL);

games/atc/log.c

263

compar);

games/boggle/boggle/bog.c

403

qsort(pword, npwords, sizeof(pword[0]), compar);

games/boggle/boggle/bog.c

66

static int compar(const void *, const void *);

lib/libc/gen/fts.c

119

int (*compar)(const FTSENT **, const FTSENT **))

lib/libc/gen/fts.c

138

sp->fts_compar = compar;

lib/libc/gen/fts.c

180

if (compar) {

lib/libc/gen/fts.c

193

if (compar && nitems > 1)

lib/libc/gen/sysctlgetmibinfo.c

165

qsort(h, nlen, sizeof(struct sysctlnode), compar);

lib/libc/gen/sysctlgetmibinfo.c

350

sizeof(struct sysctlnode), compar);

lib/libc/gen/sysctlgetmibinfo.c

82

static int compar(const void *, const void *);

lib/libc/stdlib/bsearch.c

63

int (*compar)(const void *, const void *))

lib/libc/stdlib/bsearch.c

72

_DIAGASSERT(compar != NULL);

lib/libc/stdlib/bsearch.c

76

cmp = (*compar)(key, p);

lib/libc/stdlib/lsearch.c

55

cmp_fn_t compar)

lib/libc/stdlib/lsearch.c

60

_DIAGASSERT(compar != NULL);

lib/libc/stdlib/lsearch.c

62

return(linear_base(key, base, nelp, width, compar, 1));

lib/libc/stdlib/lsearch.c

67

cmp_fn_t compar)

lib/libc/stdlib/lsearch.c

72

_DIAGASSERT(compar != NULL);

lib/libc/stdlib/lsearch.c

74

return(linear_base(key, __UNCONST(base), nelp, width, compar, 0));

lib/libc/stdlib/lsearch.c

79

cmp_fn_t compar, int add_flag)

lib/libc/stdlib/lsearch.c

85

_DIAGASSERT(compar != NULL);

lib/libc/stdlib/lsearch.c

89

if (!compar(element, key)) /* key found */

lib/libc/stdlib/tdelete.c

28

int (*compar)(const void *, const void *))

lib/libc/stdlib/tdelete.c

35

_DIAGASSERT(compar != NULL);

lib/libc/stdlib/tdelete.c

40

while ((cmp = (*compar)(vkey, (*rootp)->key)) != 0) {

lib/libc/stdlib/tfind.c

27

int (*compar)(const void *, const void *))

lib/libc/stdlib/tfind.c

32

_DIAGASSERT(compar != NULL);

lib/libc/stdlib/tfind.c

40

if ((r = (*compar)(vkey, (*rootp)->key)) == 0) /* T2: */

lib/libc/stdlib/tsearch.c

27

int (*compar)(const void *, const void *))

lib/libc/stdlib/tsearch.c

33

_DIAGASSERT(compar != NULL);

lib/libc/stdlib/tsearch.c

41

if ((r = (*compar)(vkey, (*rootp)->key)) == 0) /* T2: */

tests/usr.bin/xlint/lint1/msg_346.c

71

int (*compar) (const void *, const void *));

usr.sbin/lpr/common_source/common.c

117

static int compar(const void *, const void *);

usr.sbin/lpr/common_source/common.c

296

qsort(queue, nitems, sizeof(struct queue *), compar);