Searched refs:compar (Results 1 - 25 of 27) sorted by relevance

12

/freebsd-10.0-release/lib/libc/stdlib/
H A Dbsearch.c56 bsearch(key, base0, nmemb, size, compar)
61 int (*compar)(const void *, const void *);
70 cmp = (*compar)(key, p);
H A Dtfind.c28 tfind(vkey, vrootp, compar)
31 int (*compar)(const void *, const void *);
41 if ((r = (*compar)(vkey, (*rootp)->key)) == 0) /* T2: */
H A Dlsearch.c23 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)
48 if (compar(key, ep) == 0)
H A Dtsearch.c28 tsearch(vkey, vrootp, compar)
31 int (*compar)(const void *, const void *);
42 if ((r = (*compar)(vkey, (*rootp)->key)) == 0) /* T2: */
H A Dheapsort.c80 if (child_i < nmemb && compar(child, child + size) < 0) { \
85 if (compar(child, par) <= 0) \
93 * action is the call to the compar function, a considerable optimization
111 if (child_i < nmemb && compar(child, child + size) < 0) { \
123 if (child_i == 1 || compar(k, par) < 0) { \
139 heapsort(vbase, nmemb, size, compar)
142 int (*compar)(const void *, const void *);
H A Dtdelete.c32 * compar: function to carry out node comparisons
36 int (*compar)(const void *, const void *))
45 while ((cmp = (*compar)(vkey, (*rootp)->key)) != 0) {
/freebsd-10.0-release/sys/libkern/
H A Dbsearch.c56 bsearch(key, base0, nmemb, size, compar)
61 register int (*compar)(const void *, const void *);
70 cmp = (*compar)(key, p);
/freebsd-10.0-release/contrib/binutils/libiberty/
H A Dbsearch.c33 @deftypefn Supplemental void* bsearch (const void *@var{key}, const void *@var{base}, size_t @var{nmemb}, size_t @var{size}, int (*@var{compar})(const void *, const void *))
38 should be sorted in ascending order according to the @var{compar}
72 register int (*compar)(const void *, const void *))
80 cmp = (*compar)(key, p);
/freebsd-10.0-release/contrib/gcclibs/libiberty/
H A Dbsearch.c33 @deftypefn Supplemental void* bsearch (const void *@var{key}, const void *@var{base}, size_t @var{nmemb}, size_t @var{size}, int (*@var{compar})(const void *, const void *))
38 should be sorted in ascending order according to the @var{compar}
72 register int (*compar)(const void *, const void *))
80 cmp = (*compar)(key, p);
/freebsd-10.0-release/crypto/heimdal/lib/roken/
H A Dtsearch.c41 int (*compar)(const void *, const void *))
52 if ((r = (*compar)(vkey, (*rootp)->key)) == 0) /* T2: */
113 * compar: function to carry out node comparisons
117 int (*compar)(const void *, const void *))
126 while ((cmp = (*compar)(vkey, (*rootp)->key)) != 0) {
163 int (*compar)(const void *, const void *))
173 if ((r = (*compar)(vkey, (*rootp)->key)) == 0) /* T2: */
/freebsd-10.0-release/usr.bin/systat/
H A Dpigs.c57 int compar(const void *, const void *);
94 qsort(pt, nproc, sizeof (struct p_times), compar);
189 compar(const void *a, const void *b) function
/freebsd-10.0-release/sys/cddl/contrib/opensolaris/uts/common/sys/
H A Davl.h147 * compar - function to compare two nodes, it must return exactly: -1, 0, or +1
153 int (*compar) (const void *, const void *), size_t size, size_t offset);
/freebsd-10.0-release/contrib/ofed/management/libibcommon/src/
H A Dsysfs.c176 int (*compar)(const struct dirent **, const struct dirent **))
280 if (cnt && compar)
282 (int (*)(const void *, const void *))compar);
/freebsd-10.0-release/contrib/ofed/management/libibcommon/include/infiniband/
H A Dcommon.h135 int (*compar)(const struct dirent **, const struct dirent **));
/freebsd-10.0-release/sys/sys/
H A Dlibkern.h107 int (*compar)(const void *, const void *));
109 int (*compar)(void *, const void *, const void *));
/freebsd-10.0-release/usr.sbin/nscd/
H A Dhashtable.h187 int (*compar) (const void *, const void *)) \
190 the_entry->field.size, sizeof(type), compar)); \
/freebsd-10.0-release/usr.sbin/lpr/common_source/
H A Dcommon.c73 static int compar(const void *_p1, const void *_p2);
180 qsort(queue, nitems, sizeof(struct jobqueue *), compar);
194 compar(const void *p1, const void *p2) function
/freebsd-10.0-release/usr.bin/xlint/llib/
H A Dllib-lstdc203 size_t size, int (*compar)(const void *, const void *));
205 int (*compar)(const void *, const void *));
H A Dllib-lposix83 size_t size, int (*compar)(const void *, const void *));
216 int (*compar)(const void *, const void *));
/freebsd-10.0-release/lib/libc/gen/
H A Dfts-compat.c123 __fts_open_44bsd(argv, options, compar)
126 int (*compar)(const FTSENT * const *, const FTSENT * const *);
146 sp->fts_compar = compar;
190 if (compar) {
203 if (compar && nitems > 1)
H A Dfts.c113 fts_open(argv, options, compar)
116 int (*compar)(const FTSENT * const *, const FTSENT * const *);
140 sp->fts_compar = compar;
184 if (compar) {
197 if (compar && nitems > 1)
/freebsd-10.0-release/cddl/contrib/opensolaris/common/avl/
H A Davl.c870 avl_create(avl_tree_t *tree, int (*compar) (const void *, const void *),
874 ASSERT(compar);
881 tree->avl_compar = compar;
/freebsd-10.0-release/sys/cddl/contrib/opensolaris/common/avl/
H A Davl.c870 avl_create(avl_tree_t *tree, int (*compar) (const void *, const void *),
874 ASSERT(compar);
881 tree->avl_compar = compar;
/freebsd-10.0-release/contrib/ntp/include/
H A Dl_stdlib.h270 int P((*compar)(void *, void *)));
/freebsd-10.0-release/contrib/dialog/
H A Dfselect.c347 compar(const void *a, const void *b) function
495 compar);
501 compar);

Completed in 407 milliseconds

12