sbin/unwind/libunbound/iterator/iter_fwd.c

114

struct iter_forward_zone* node = (struct iter_forward_zone*)malloc(

sbin/unwind/libunbound/iterator/iter_fwd.c

115

sizeof(struct iter_forward_zone));

sbin/unwind/libunbound/iterator/iter_fwd.c

142

static struct iter_forward_zone*

sbin/unwind/libunbound/iterator/iter_fwd.c

145

struct iter_forward_zone key;

sbin/unwind/libunbound/iterator/iter_fwd.c

150

return (struct iter_forward_zone*)rbtree_search(fwd->tree, &key);

sbin/unwind/libunbound/iterator/iter_fwd.c

165

struct iter_forward_zone* node, *prev = NULL, *p;

sbin/unwind/libunbound/iterator/iter_fwd.c

167

RBTREE_FOR(node, struct iter_forward_zone*, fwd->tree) {

sbin/unwind/libunbound/iterator/iter_fwd.c

312

struct iter_forward_zone key;

sbin/unwind/libunbound/iterator/iter_fwd.c

420

struct iter_forward_zone* res;

sbin/unwind/libunbound/iterator/iter_fwd.c

421

struct iter_forward_zone key;

sbin/unwind/libunbound/iterator/iter_fwd.c

429

res = (struct iter_forward_zone*)rbtree_search(fwd->tree, &key);

sbin/unwind/libunbound/iterator/iter_fwd.c

441

struct iter_forward_zone *result;

sbin/unwind/libunbound/iterator/iter_fwd.c

442

struct iter_forward_zone key;

sbin/unwind/libunbound/iterator/iter_fwd.c

452

result = (struct iter_forward_zone*)res;

sbin/unwind/libunbound/iterator/iter_fwd.c

456

result = (struct iter_forward_zone*)res;

sbin/unwind/libunbound/iterator/iter_fwd.c

487

struct iter_forward_zone key;

sbin/unwind/libunbound/iterator/iter_fwd.c

489

struct iter_forward_zone* p;

sbin/unwind/libunbound/iterator/iter_fwd.c

495

p = (struct iter_forward_zone*)n;

sbin/unwind/libunbound/iterator/iter_fwd.c

523

p = (struct iter_forward_zone*)n;

sbin/unwind/libunbound/iterator/iter_fwd.c

548

struct iter_forward_zone* p;

sbin/unwind/libunbound/iterator/iter_fwd.c

554

RBTREE_FOR(p, struct iter_forward_zone*, fwd->tree) {

sbin/unwind/libunbound/iterator/iter_fwd.c

56

struct iter_forward_zone* n1 = (struct iter_forward_zone*)k1;

sbin/unwind/libunbound/iterator/iter_fwd.c

565

struct iter_forward_zone *z;

sbin/unwind/libunbound/iterator/iter_fwd.c

57

struct iter_forward_zone* n2 = (struct iter_forward_zone*)k2;

sbin/unwind/libunbound/iterator/iter_fwd.c

585

struct iter_forward_zone *z;

sbin/unwind/libunbound/iterator/iter_fwd.c

621

struct iter_forward_zone *z;

sbin/unwind/libunbound/iterator/iter_fwd.c

78

static void fwd_zone_free(struct iter_forward_zone* n)

sbin/unwind/libunbound/iterator/iter_fwd.c

88

struct iter_forward_zone* node = (struct iter_forward_zone*)n;

sbin/unwind/libunbound/iterator/iter_fwd.h

88

struct iter_forward_zone* parent;

usr.sbin/unbound/daemon/remote.c

3316

struct iter_forward_zone* z;

usr.sbin/unbound/daemon/remote.c

3320

RBTREE_FOR(z, struct iter_forward_zone*, fwds->tree) {

usr.sbin/unbound/iterator/iter_fwd.c

114

struct iter_forward_zone* node = (struct iter_forward_zone*)malloc(

usr.sbin/unbound/iterator/iter_fwd.c

115

sizeof(struct iter_forward_zone));

usr.sbin/unbound/iterator/iter_fwd.c

142

static struct iter_forward_zone*

usr.sbin/unbound/iterator/iter_fwd.c

145

struct iter_forward_zone key;

usr.sbin/unbound/iterator/iter_fwd.c

150

return (struct iter_forward_zone*)rbtree_search(fwd->tree, &key);

usr.sbin/unbound/iterator/iter_fwd.c

165

struct iter_forward_zone* node, *prev = NULL, *p;

usr.sbin/unbound/iterator/iter_fwd.c

167

RBTREE_FOR(node, struct iter_forward_zone*, fwd->tree) {

usr.sbin/unbound/iterator/iter_fwd.c

312

struct iter_forward_zone key;

usr.sbin/unbound/iterator/iter_fwd.c

420

struct iter_forward_zone* res;

usr.sbin/unbound/iterator/iter_fwd.c

421

struct iter_forward_zone key;

usr.sbin/unbound/iterator/iter_fwd.c

429

res = (struct iter_forward_zone*)rbtree_search(fwd->tree, &key);

usr.sbin/unbound/iterator/iter_fwd.c

441

struct iter_forward_zone *result;

usr.sbin/unbound/iterator/iter_fwd.c

442

struct iter_forward_zone key;

usr.sbin/unbound/iterator/iter_fwd.c

452

result = (struct iter_forward_zone*)res;

usr.sbin/unbound/iterator/iter_fwd.c

456

result = (struct iter_forward_zone*)res;

usr.sbin/unbound/iterator/iter_fwd.c

487

struct iter_forward_zone key;

usr.sbin/unbound/iterator/iter_fwd.c

489

struct iter_forward_zone* p;

usr.sbin/unbound/iterator/iter_fwd.c

495

p = (struct iter_forward_zone*)n;

usr.sbin/unbound/iterator/iter_fwd.c

523

p = (struct iter_forward_zone*)n;

usr.sbin/unbound/iterator/iter_fwd.c

548

struct iter_forward_zone* p;

usr.sbin/unbound/iterator/iter_fwd.c

554

RBTREE_FOR(p, struct iter_forward_zone*, fwd->tree) {

usr.sbin/unbound/iterator/iter_fwd.c

56

struct iter_forward_zone* n1 = (struct iter_forward_zone*)k1;

usr.sbin/unbound/iterator/iter_fwd.c

565

struct iter_forward_zone *z;

usr.sbin/unbound/iterator/iter_fwd.c

57

struct iter_forward_zone* n2 = (struct iter_forward_zone*)k2;

usr.sbin/unbound/iterator/iter_fwd.c

585

struct iter_forward_zone *z;

usr.sbin/unbound/iterator/iter_fwd.c

621

struct iter_forward_zone *z;

usr.sbin/unbound/iterator/iter_fwd.c

78

static void fwd_zone_free(struct iter_forward_zone* n)

usr.sbin/unbound/iterator/iter_fwd.c

88

struct iter_forward_zone* node = (struct iter_forward_zone*)n;

usr.sbin/unbound/iterator/iter_fwd.h

88

struct iter_forward_zone* parent;