sbin/unwind/libunbound/util/fptr_wlist.c

255

else if(fptr == &canonical_tree_compare) return 1;

sbin/unwind/libunbound/validator/val_sigcrypt.c

1220

rbtree_init(&sortree1, &canonical_tree_compare);

sbin/unwind/libunbound/validator/val_sigcrypt.c

1221

rbtree_init(&sortree2, &canonical_tree_compare);

sbin/unwind/libunbound/validator/val_sigcrypt.c

1290

rbtree_init(*sortree, &canonical_tree_compare);

sbin/unwind/libunbound/validator/val_sigcrypt.c

1357

rbtree_init(sortree, &canonical_tree_compare);

sbin/unwind/libunbound/validator/val_sigcrypt.h

331

int canonical_tree_compare(const void* k1, const void* k2);

usr.sbin/unbound/util/fptr_wlist.c

255

else if(fptr == &canonical_tree_compare) return 1;

usr.sbin/unbound/validator/val_sigcrypt.c

1220

rbtree_init(&sortree1, &canonical_tree_compare);

usr.sbin/unbound/validator/val_sigcrypt.c

1221

rbtree_init(&sortree2, &canonical_tree_compare);

usr.sbin/unbound/validator/val_sigcrypt.c

1290

rbtree_init(*sortree, &canonical_tree_compare);

usr.sbin/unbound/validator/val_sigcrypt.c

1357

rbtree_init(sortree, &canonical_tree_compare);

usr.sbin/unbound/validator/val_sigcrypt.h

331

int canonical_tree_compare(const void* k1, const void* k2);