sbin/unwind/libunbound/dns64/dns64.c

333

struct name_tree_node* node;

sbin/unwind/libunbound/dns64/dns64.c

334

node = (struct name_tree_node*)calloc(1, sizeof(*node));

sbin/unwind/libunbound/dns64/dns64.c

423

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

sbin/unwind/libunbound/dns64/dns64.c

553

struct name_tree_node* node = name_tree_lookup(&dns64_env->ignore_aaaa,

sbin/unwind/libunbound/iterator/iter_hints.h

75

struct name_tree_node node;

sbin/unwind/libunbound/iterator/iter_priv.c

113

struct name_tree_node* n;

sbin/unwind/libunbound/iterator/iter_priv.c

132

n = (struct name_tree_node*)regional_alloc(priv->region,

sbin/unwind/libunbound/iterator/iter_utils.c

132

free(((struct name_tree_node*)n)->name);

sbin/unwind/libunbound/iterator/iter_utils.c

151

struct name_tree_node* n;

sbin/unwind/libunbound/iterator/iter_utils.c

158

n = (struct name_tree_node*)calloc(1, sizeof(*n));

sbin/unwind/libunbound/services/cache/infra.h

152

struct name_tree_node node;

sbin/unwind/libunbound/util/storage/dnstree.c

155

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

sbin/unwind/libunbound/util/storage/dnstree.c

157

RBTREE_FOR(node, struct name_tree_node*, tree) {

sbin/unwind/libunbound/util/storage/dnstree.c

179

struct name_tree_node* name_tree_find(rbtree_type* tree, uint8_t* name,

sbin/unwind/libunbound/util/storage/dnstree.c

182

struct name_tree_node key;

sbin/unwind/libunbound/util/storage/dnstree.c

188

return (struct name_tree_node*)rbtree_search(tree, &key);

sbin/unwind/libunbound/util/storage/dnstree.c

191

struct name_tree_node* name_tree_lookup(rbtree_type* tree, uint8_t* name,

sbin/unwind/libunbound/util/storage/dnstree.c

195

struct name_tree_node *result;

sbin/unwind/libunbound/util/storage/dnstree.c

196

struct name_tree_node key;

sbin/unwind/libunbound/util/storage/dnstree.c

204

result = (struct name_tree_node*)res;

sbin/unwind/libunbound/util/storage/dnstree.c

208

result = (struct name_tree_node*)res;

sbin/unwind/libunbound/util/storage/dnstree.c

270

struct name_tree_node key;

sbin/unwind/libunbound/util/storage/dnstree.c

272

struct name_tree_node* p;

sbin/unwind/libunbound/util/storage/dnstree.c

278

p = (struct name_tree_node*)n;

sbin/unwind/libunbound/util/storage/dnstree.c

306

p = (struct name_tree_node*)n;

sbin/unwind/libunbound/util/storage/dnstree.c

49

struct name_tree_node* x = (struct name_tree_node*)k1;

sbin/unwind/libunbound/util/storage/dnstree.c

50

struct name_tree_node* y = (struct name_tree_node*)k2;

sbin/unwind/libunbound/util/storage/dnstree.c

97

int name_tree_insert(rbtree_type* tree, struct name_tree_node* node,

sbin/unwind/libunbound/util/storage/dnstree.h

108

int name_tree_insert(rbtree_type* tree, struct name_tree_node* node,

sbin/unwind/libunbound/util/storage/dnstree.h

127

struct name_tree_node* name_tree_find(rbtree_type* tree, uint8_t* name,

sbin/unwind/libunbound/util/storage/dnstree.h

139

struct name_tree_node* name_tree_lookup(rbtree_type* tree, uint8_t* name,

sbin/unwind/libunbound/util/storage/dnstree.h

59

struct name_tree_node* parent;

usr.sbin/unbound/dns64/dns64.c

333

struct name_tree_node* node;

usr.sbin/unbound/dns64/dns64.c

334

node = (struct name_tree_node*)calloc(1, sizeof(*node));

usr.sbin/unbound/dns64/dns64.c

423

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

usr.sbin/unbound/dns64/dns64.c

553

struct name_tree_node* node = name_tree_lookup(&dns64_env->ignore_aaaa,

usr.sbin/unbound/edns-subnet/subnet-whitelist.c

135

struct name_tree_node* n;

usr.sbin/unbound/edns-subnet/subnet-whitelist.c

155

n = (struct name_tree_node*)regional_alloc(whitelist->region,

usr.sbin/unbound/ipsecmod/ipsecmod-whitelist.c

114

free(((struct name_tree_node*)n)->name);

usr.sbin/unbound/ipsecmod/ipsecmod-whitelist.c

123

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

usr.sbin/unbound/ipsecmod/ipsecmod-whitelist.c

59

struct name_tree_node* n;

usr.sbin/unbound/ipsecmod/ipsecmod-whitelist.c

66

n = (struct name_tree_node*)calloc(1, sizeof(*n));

usr.sbin/unbound/iterator/iter_hints.h

75

struct name_tree_node node;

usr.sbin/unbound/iterator/iter_priv.c

113

struct name_tree_node* n;

usr.sbin/unbound/iterator/iter_priv.c

132

n = (struct name_tree_node*)regional_alloc(priv->region,

usr.sbin/unbound/iterator/iter_utils.c

132

free(((struct name_tree_node*)n)->name);

usr.sbin/unbound/iterator/iter_utils.c

151

struct name_tree_node* n;

usr.sbin/unbound/iterator/iter_utils.c

158

n = (struct name_tree_node*)calloc(1, sizeof(*n));

usr.sbin/unbound/services/cache/infra.h

152

struct name_tree_node node;

usr.sbin/unbound/util/storage/dnstree.c

155

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

usr.sbin/unbound/util/storage/dnstree.c

157

RBTREE_FOR(node, struct name_tree_node*, tree) {

usr.sbin/unbound/util/storage/dnstree.c

179

struct name_tree_node* name_tree_find(rbtree_type* tree, uint8_t* name,

usr.sbin/unbound/util/storage/dnstree.c

182

struct name_tree_node key;

usr.sbin/unbound/util/storage/dnstree.c

188

return (struct name_tree_node*)rbtree_search(tree, &key);

usr.sbin/unbound/util/storage/dnstree.c

191

struct name_tree_node* name_tree_lookup(rbtree_type* tree, uint8_t* name,

usr.sbin/unbound/util/storage/dnstree.c

195

struct name_tree_node *result;

usr.sbin/unbound/util/storage/dnstree.c

196

struct name_tree_node key;

usr.sbin/unbound/util/storage/dnstree.c

204

result = (struct name_tree_node*)res;

usr.sbin/unbound/util/storage/dnstree.c

208

result = (struct name_tree_node*)res;

usr.sbin/unbound/util/storage/dnstree.c

270

struct name_tree_node key;

usr.sbin/unbound/util/storage/dnstree.c

272

struct name_tree_node* p;

usr.sbin/unbound/util/storage/dnstree.c

278

p = (struct name_tree_node*)n;

usr.sbin/unbound/util/storage/dnstree.c

306

p = (struct name_tree_node*)n;

usr.sbin/unbound/util/storage/dnstree.c

49

struct name_tree_node* x = (struct name_tree_node*)k1;

usr.sbin/unbound/util/storage/dnstree.c

50

struct name_tree_node* y = (struct name_tree_node*)k2;

usr.sbin/unbound/util/storage/dnstree.c

97

int name_tree_insert(rbtree_type* tree, struct name_tree_node* node,

usr.sbin/unbound/util/storage/dnstree.h

108

int name_tree_insert(rbtree_type* tree, struct name_tree_node* node,

usr.sbin/unbound/util/storage/dnstree.h

127

struct name_tree_node* name_tree_find(rbtree_type* tree, uint8_t* name,

usr.sbin/unbound/util/storage/dnstree.h

139

struct name_tree_node* name_tree_lookup(rbtree_type* tree, uint8_t* name,

usr.sbin/unbound/util/storage/dnstree.h

59

struct name_tree_node* parent;