sbin/unwind/libunbound/validator/val_sigcrypt.c

1015

struct canon_rr* r1 = (struct canon_rr*)k1;

sbin/unwind/libunbound/validator/val_sigcrypt.c

1016

struct canon_rr* r2 = (struct canon_rr*)k2;

sbin/unwind/libunbound/validator/val_sigcrypt.c

1032

rbtree_type* sortree, struct canon_rr* rrs)

sbin/unwind/libunbound/validator/val_sigcrypt.c

1194

struct canon_rr *rrs1, *rrs2, *p1, *p2;

sbin/unwind/libunbound/validator/val_sigcrypt.c

1227

rrs1 = regional_alloc(region, sizeof(struct canon_rr)*d1->count);

sbin/unwind/libunbound/validator/val_sigcrypt.c

1228

rrs2 = regional_alloc(region, sizeof(struct canon_rr)*d2->count);

sbin/unwind/libunbound/validator/val_sigcrypt.c

1238

p1 = (struct canon_rr*)rbtree_first(&sortree1);

sbin/unwind/libunbound/validator/val_sigcrypt.c

1239

p2 = (struct canon_rr*)rbtree_first(&sortree2);

sbin/unwind/libunbound/validator/val_sigcrypt.c

1240

while(p1 != (struct canon_rr*)RBTREE_NULL &&

sbin/unwind/libunbound/validator/val_sigcrypt.c

1241

p2 != (struct canon_rr*)RBTREE_NULL) {

sbin/unwind/libunbound/validator/val_sigcrypt.c

1249

p1 = (struct canon_rr*)rbtree_next(&p1->node);

sbin/unwind/libunbound/validator/val_sigcrypt.c

1250

p2 = (struct canon_rr*)rbtree_next(&p2->node);

sbin/unwind/libunbound/validator/val_sigcrypt.c

1278

struct canon_rr* walk;

sbin/unwind/libunbound/validator/val_sigcrypt.c

1279

struct canon_rr* rrs;

sbin/unwind/libunbound/validator/val_sigcrypt.c

1288

rrs = regional_alloc(region, sizeof(struct canon_rr)*d->count);

sbin/unwind/libunbound/validator/val_sigcrypt.c

1301

RBTREE_FOR(walk, struct canon_rr*, (*sortree)) {

sbin/unwind/libunbound/validator/val_sigcrypt.c

1347

struct canon_rr* walk;

sbin/unwind/libunbound/validator/val_sigcrypt.c

1348

struct canon_rr* rrs;

sbin/unwind/libunbound/validator/val_sigcrypt.c

1356

rrs = regional_alloc(region, sizeof(struct canon_rr)*d->count);

sbin/unwind/libunbound/validator/val_sigcrypt.c

1364

RBTREE_FOR(walk, struct canon_rr*, sortree) {

usr.sbin/unbound/validator/val_sigcrypt.c

1015

struct canon_rr* r1 = (struct canon_rr*)k1;

usr.sbin/unbound/validator/val_sigcrypt.c

1016

struct canon_rr* r2 = (struct canon_rr*)k2;

usr.sbin/unbound/validator/val_sigcrypt.c

1032

rbtree_type* sortree, struct canon_rr* rrs)

usr.sbin/unbound/validator/val_sigcrypt.c

1194

struct canon_rr *rrs1, *rrs2, *p1, *p2;

usr.sbin/unbound/validator/val_sigcrypt.c

1227

rrs1 = regional_alloc(region, sizeof(struct canon_rr)*d1->count);

usr.sbin/unbound/validator/val_sigcrypt.c

1228

rrs2 = regional_alloc(region, sizeof(struct canon_rr)*d2->count);

usr.sbin/unbound/validator/val_sigcrypt.c

1238

p1 = (struct canon_rr*)rbtree_first(&sortree1);

usr.sbin/unbound/validator/val_sigcrypt.c

1239

p2 = (struct canon_rr*)rbtree_first(&sortree2);

usr.sbin/unbound/validator/val_sigcrypt.c

1240

while(p1 != (struct canon_rr*)RBTREE_NULL &&

usr.sbin/unbound/validator/val_sigcrypt.c

1241

p2 != (struct canon_rr*)RBTREE_NULL) {

usr.sbin/unbound/validator/val_sigcrypt.c

1249

p1 = (struct canon_rr*)rbtree_next(&p1->node);

usr.sbin/unbound/validator/val_sigcrypt.c

1250

p2 = (struct canon_rr*)rbtree_next(&p2->node);

usr.sbin/unbound/validator/val_sigcrypt.c

1278

struct canon_rr* walk;

usr.sbin/unbound/validator/val_sigcrypt.c

1279

struct canon_rr* rrs;

usr.sbin/unbound/validator/val_sigcrypt.c

1288

rrs = regional_alloc(region, sizeof(struct canon_rr)*d->count);

usr.sbin/unbound/validator/val_sigcrypt.c

1301

RBTREE_FOR(walk, struct canon_rr*, (*sortree)) {

usr.sbin/unbound/validator/val_sigcrypt.c

1347

struct canon_rr* walk;

usr.sbin/unbound/validator/val_sigcrypt.c

1348

struct canon_rr* rrs;

usr.sbin/unbound/validator/val_sigcrypt.c

1356

rrs = regional_alloc(region, sizeof(struct canon_rr)*d->count);

usr.sbin/unbound/validator/val_sigcrypt.c

1364

RBTREE_FOR(walk, struct canon_rr*, sortree) {