games/atc/log.c

230

qsort(score, num_scores, sizeof (*score), compar);

games/atc/log.c

55

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

games/boggle/boggle/bog.c

357

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

games/boggle/boggle/bog.c

51

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

lib/libc/gen/fts.c

104

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

lib/libc/gen/fts.c

122

sp->fts_compar = compar;

lib/libc/gen/fts.c

166

if (compar) {

lib/libc/gen/fts.c

179

if (compar && nitems > 1)

lib/libc/locale/collate.c

229

int next, compar, l;

lib/libc/locale/collate.c

239

compar = *key - *p->str;

lib/libc/locale/collate.c

240

if (compar == 0) {

lib/libc/locale/collate.c

242

compar = wcsncmp(key, p->str, l);

lib/libc/locale/collate.c

243

if (compar == 0) {

lib/libc/locale/collate.c

248

if (compar > 0)

lib/libc/locale/collate.c

261

int next, compar;

lib/libc/locale/collate.c

271

compar = key - p->val;

lib/libc/locale/collate.c

272

if (compar == 0)

lib/libc/locale/collate.c

274

if (compar > 0)

lib/libc/stdlib/bsearch.c

55

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

lib/libc/stdlib/bsearch.c

64

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

lib/libc/stdlib/heapsort.c

109

if (child_i < nmemb && compar(child, child + size) < 0) { \

lib/libc/stdlib/heapsort.c

121

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

lib/libc/stdlib/heapsort.c

138

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

lib/libc/stdlib/heapsort.c

78

if (child_i < nmemb && compar(child, child + size) < 0) { \

lib/libc/stdlib/heapsort.c

83

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

lib/libc/stdlib/lsearch.c

24

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

lib/libc/stdlib/lsearch.c

27

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

lib/libc/stdlib/lsearch.c

31

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

lib/libc/stdlib/lsearch.c

34

return (lwork(key, base, nelp, width, compar, 0));

lib/libc/stdlib/lsearch.c

39

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

lib/libc/stdlib/lsearch.c

49

if (compar(key, ep) == 0)

lib/libc/stdlib/tdelete.c

30

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

lib/libc/stdlib/tdelete.c

39

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

lib/libc/stdlib/tfind.c

29

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

lib/libc/stdlib/tfind.c

39

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

lib/libc/stdlib/tsearch.c

29

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

lib/libc/stdlib/tsearch.c

40

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

sys/libkern/bsearch.c

55

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

sys/libkern/bsearch.c

64

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

sys/sys/libkern.h

118

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

sys/sys/libkern.h

120

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

usr.bin/systat/pigs.c

102

qsort(pt, nproc + 1, sizeof (struct p_times), compar);

usr.bin/systat/pigs.c

52

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

usr.sbin/lpr/common_source/common.c

164

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

usr.sbin/lpr/common_source/common.c

63

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

usr.sbin/nscd/hashtable.h

184

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

usr.sbin/nscd/hashtable.h

187

the_entry->field.size, sizeof(type), compar)); \