lib/libc/stdlib/qsort.c

119

pl > (char *)a && CMP(thunk, pl - es, pl) > 0;

lib/libc/stdlib/qsort.c

141

while (pb <= pc && (cmp_result = CMP(thunk, pb, a)) <= 0) {

lib/libc/stdlib/qsort.c

149

while (pb <= pc && (cmp_result = CMP(thunk, pc, a)) >= 0) {

lib/libc/stdlib/qsort.c

167

pl > (char *)a && CMP(thunk, pl - es, pl) > 0;

lib/libc/stdlib/qsort.c

95

return CMP(thunk, a, b) < 0 ?

lib/libc/stdlib/qsort.c

96

(CMP(thunk, b, c) < 0 ? b : (CMP(thunk, a, c) < 0 ? c : a ))

lib/libc/stdlib/qsort.c

97

:(CMP(thunk, b, c) > 0 ? b : (CMP(thunk, a, c) < 0 ? a : c ));

sys/libkern/qsort.c

115

for (pl = pm; pl > (char *)a && CMP(thunk, pl - es, pl) > 0;

sys/libkern/qsort.c

137

while (pb <= pc && (r = CMP(thunk, pb, a)) <= 0) {

sys/libkern/qsort.c

145

while (pb <= pc && (r = CMP(thunk, pc, a)) >= 0) {

sys/libkern/qsort.c

162

for (pl = pm; pl > (char *)a && CMP(thunk, pl - es, pl) > 0;

sys/libkern/qsort.c

94

return CMP(thunk, a, b) < 0 ?

sys/libkern/qsort.c

95

(CMP(thunk, b, c) < 0 ? b : (CMP(thunk, a, c) < 0 ? c : a ))

sys/libkern/qsort.c

96

:(CMP(thunk, b, c) > 0 ? b : (CMP(thunk, a, c) < 0 ? a : c ));

usr.sbin/nscd/hashtable.h

156

#define HASHTABLE_GENERATE(name, entry_, type, field, HASH, CMP) \

usr.sbin/nscd/hashtable.h

173

sizeof(type), CMP); \

usr.sbin/nscd/hashtable.h

180

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