compare
time_t compare, cert_time;
compare = time(NULL);
compare = *cmp_time;
if (cert_time <= compare)
get_hostkey_index(struct sshkey *key, int compare, struct ssh *ssh)
(compare && sensitive_data.host_certificates[i] &&
(compare && sensitive_data.host_keys[i] &&
(compare && sensitive_data.host_pubkeys[i] &&
int (*compare) /* comparison function */
if (b.compare == NULL) {
b.compare = __bt_defcmp;
b.compare = __bt_defcmp;
t->bt_cmp = b.compare;
btopeninfo.compare = NULL;
b.compare = NULL;
compare(&keydata, &data);
void compare(DBT *, DBT *);
static int compare(const void *, const void *);
pglob->gl_pathc - oldpathc, sizeof(char *), compare);
int (*compare)(size_t pos1, size_t pos2, size_t len, void *context);
(compare) acl_entry_compare);
typedef int (*compare)(const void *, const void *);
static int compare(const void *, const void *);
compare);
hash_Exists(hash_tbl *hashtable, unsigned hashcode, hash_cmpfp compare,
if ((*compare) (key, memberptr->data)) {
hash_Insert(hash_tbl *hashtable, unsigned hashcode, hash_cmpfp compare,
if (hash_Exists(hashtable, hashcode, compare, key)) {
hash_Delete(hash_tbl *hashtable, unsigned hashcode, hash_cmpfp compare,
while (memberptr && (*compare) (key, memberptr->data)) {
if ((*compare) (key, memberptr->data)) {
hash_Lookup(hash_tbl *hashtable, unsigned hashcode, hash_cmpfp compare,
if ((*compare) (key, memberptr->data)) {
static struct ifaddrs *sortifaddrs(struct ifaddrs *list, ifaddrs_cmp compare,
sortifaddrs(struct ifaddrs *list, ifaddrs_cmp compare, struct ifa_queue *q)
list = sortifaddrs(list, compare, q);
right = sortifaddrs(right, compare, q);
} else if (compare(list, right, q) <= 0) {
int (*compare)(struct device *, void *),
int (*compare)(struct device *, void *),
sorted = list_sort_merge(accum[logn], sorted, compare, arg);
list_sort_merge_into(list, accum[max_logn], sorted, compare, arg);
int (*compare)(void *, struct list_head *,
struct list_head **const first = ((*compare)(arg, a, b) <= 0?
int (*compare)(void *, struct list_head *,
(*compare)(arg, a, b) <= 0 ? &a : &b);
int (*compare)(void *, struct list_head *, struct list_head *))
sorted = list_sort_merge(accum[logn], sorted, compare, arg);
qsort(&table[i][0], n, sizeof(PTW_tableentry), &compare);
static void compare(enum bcode_compare);
compare(BCODE_EQUAL);
compare(BCODE_NOT_EQUAL);
compare(BCODE_LESS);
compare(BCODE_NOT_LESS);
compare(BCODE_GREATER);
compare(BCODE_NOT_GREATER);
if (compare(string, p, back) == GREATER)
switch (compare(string, front, back)) {
for (; front < back && compare(string, front, back) == EQUAL; ++front) {
static int compare(wchar_t *, unsigned char *, unsigned char *);
qsort(theunit->numerator, count, sizeof(char *), compare);
qsort(theunit->denominator, count, sizeof(char *), compare);
static int compare(const void *item1, const void *item2);
files_match = !(compare(from_fd, from_name,
if (compare(temp_fd, tempfile, (size_t)temp_sb.st_size, to_fd,
static int compare(int, const char *, size_t, int, const char *, size_t);
qsort(vals, cnt, sizeof(uint16_t), compare);
qsort((void*)mt_array, count, sizeof(struct statfs), compare);
compare = cd9660_compare_filename(iter->isoDirRecord->name,
if (compare == 0) {
int compare;
compare = cd9660_compare_filename(cn_new->isoDirRecord->name,
if (compare == 0)
compare = cd9660_compare_filename(cn_new->node->name,
if (compare < 0)
int compare(NODE *, FTSENT *);
compare(ep, p))
bti.compare = sa_cmp;
bti.compare = uid_compare;
bti.compare = uid_compare;