sbin/unwind/libunbound/util/data/msgencode.c

111

compress_tree_search(struct compress_tree_node** tree, uint8_t* dname,

sbin/unwind/libunbound/util/data/msgencode.c

112

int labs, struct compress_tree_node** match, int* matchlabels,

sbin/unwind/libunbound/util/data/msgencode.c

113

struct compress_tree_node*** insertpt)

sbin/unwind/libunbound/util/data/msgencode.c

116

struct compress_tree_node* p = *tree;

sbin/unwind/libunbound/util/data/msgencode.c

117

struct compress_tree_node* close = 0;

sbin/unwind/libunbound/util/data/msgencode.c

118

struct compress_tree_node** prev = tree;

sbin/unwind/libunbound/util/data/msgencode.c

150

static struct compress_tree_node*

sbin/unwind/libunbound/util/data/msgencode.c

151

compress_tree_lookup(struct compress_tree_node** tree, uint8_t* dname,

sbin/unwind/libunbound/util/data/msgencode.c

152

int labs, struct compress_tree_node*** insertpt)

sbin/unwind/libunbound/util/data/msgencode.c

154

struct compress_tree_node* p;

sbin/unwind/libunbound/util/data/msgencode.c

181

static struct compress_tree_node*

sbin/unwind/libunbound/util/data/msgencode.c

185

struct compress_tree_node* n = (struct compress_tree_node*)

sbin/unwind/libunbound/util/data/msgencode.c

186

regional_alloc(region, sizeof(struct compress_tree_node));

sbin/unwind/libunbound/util/data/msgencode.c

211

struct regional* region, struct compress_tree_node* closest,

sbin/unwind/libunbound/util/data/msgencode.c

212

struct compress_tree_node** insertpt)

sbin/unwind/libunbound/util/data/msgencode.c

215

struct compress_tree_node* newnode;

sbin/unwind/libunbound/util/data/msgencode.c

216

struct compress_tree_node* prevnode = NULL;

sbin/unwind/libunbound/util/data/msgencode.c

257

struct compress_tree_node* p)

sbin/unwind/libunbound/util/data/msgencode.c

292

struct regional* region, struct compress_tree_node** tree,

sbin/unwind/libunbound/util/data/msgencode.c

296

struct compress_tree_node* p;

sbin/unwind/libunbound/util/data/msgencode.c

297

struct compress_tree_node** insertpt = NULL;

sbin/unwind/libunbound/util/data/msgencode.c

345

struct regional* region, struct compress_tree_node** tree,

sbin/unwind/libunbound/util/data/msgencode.c

348

struct compress_tree_node* p;

sbin/unwind/libunbound/util/data/msgencode.c

349

struct compress_tree_node** insertpt = NULL;

sbin/unwind/libunbound/util/data/msgencode.c

380

struct regional* region, struct compress_tree_node** tree,

sbin/unwind/libunbound/util/data/msgencode.c

463

int do_data, int do_sig, struct compress_tree_node** tree,

sbin/unwind/libunbound/util/data/msgencode.c

559

struct regional* region, struct compress_tree_node** tree,

sbin/unwind/libunbound/util/data/msgencode.c

613

insert_query(struct query_info* qinfo, struct compress_tree_node** tree,

sbin/unwind/libunbound/util/data/msgencode.c

691

struct compress_tree_node* tree = 0;

sbin/unwind/libunbound/util/data/msgencode.c

83

struct compress_tree_node* left;

sbin/unwind/libunbound/util/data/msgencode.c

85

struct compress_tree_node* right;

sbin/unwind/libunbound/util/data/msgencode.c

88

struct compress_tree_node* parent;

usr.sbin/unbound/util/data/msgencode.c

111

compress_tree_search(struct compress_tree_node** tree, uint8_t* dname,

usr.sbin/unbound/util/data/msgencode.c

112

int labs, struct compress_tree_node** match, int* matchlabels,

usr.sbin/unbound/util/data/msgencode.c

113

struct compress_tree_node*** insertpt)

usr.sbin/unbound/util/data/msgencode.c

116

struct compress_tree_node* p = *tree;

usr.sbin/unbound/util/data/msgencode.c

117

struct compress_tree_node* close = 0;

usr.sbin/unbound/util/data/msgencode.c

118

struct compress_tree_node** prev = tree;

usr.sbin/unbound/util/data/msgencode.c

150

static struct compress_tree_node*

usr.sbin/unbound/util/data/msgencode.c

151

compress_tree_lookup(struct compress_tree_node** tree, uint8_t* dname,

usr.sbin/unbound/util/data/msgencode.c

152

int labs, struct compress_tree_node*** insertpt)

usr.sbin/unbound/util/data/msgencode.c

154

struct compress_tree_node* p;

usr.sbin/unbound/util/data/msgencode.c

181

static struct compress_tree_node*

usr.sbin/unbound/util/data/msgencode.c

185

struct compress_tree_node* n = (struct compress_tree_node*)

usr.sbin/unbound/util/data/msgencode.c

186

regional_alloc(region, sizeof(struct compress_tree_node));

usr.sbin/unbound/util/data/msgencode.c

211

struct regional* region, struct compress_tree_node* closest,

usr.sbin/unbound/util/data/msgencode.c

212

struct compress_tree_node** insertpt)

usr.sbin/unbound/util/data/msgencode.c

215

struct compress_tree_node* newnode;

usr.sbin/unbound/util/data/msgencode.c

216

struct compress_tree_node* prevnode = NULL;

usr.sbin/unbound/util/data/msgencode.c

257

struct compress_tree_node* p)

usr.sbin/unbound/util/data/msgencode.c

292

struct regional* region, struct compress_tree_node** tree,

usr.sbin/unbound/util/data/msgencode.c

296

struct compress_tree_node* p;

usr.sbin/unbound/util/data/msgencode.c

297

struct compress_tree_node** insertpt = NULL;

usr.sbin/unbound/util/data/msgencode.c

345

struct regional* region, struct compress_tree_node** tree,

usr.sbin/unbound/util/data/msgencode.c

348

struct compress_tree_node* p;

usr.sbin/unbound/util/data/msgencode.c

349

struct compress_tree_node** insertpt = NULL;

usr.sbin/unbound/util/data/msgencode.c

380

struct regional* region, struct compress_tree_node** tree,

usr.sbin/unbound/util/data/msgencode.c

463

int do_data, int do_sig, struct compress_tree_node** tree,

usr.sbin/unbound/util/data/msgencode.c

559

struct regional* region, struct compress_tree_node** tree,

usr.sbin/unbound/util/data/msgencode.c

613

insert_query(struct query_info* qinfo, struct compress_tree_node** tree,

usr.sbin/unbound/util/data/msgencode.c

691

struct compress_tree_node* tree = 0;

usr.sbin/unbound/util/data/msgencode.c

83

struct compress_tree_node* left;

usr.sbin/unbound/util/data/msgencode.c

85

struct compress_tree_node* right;

usr.sbin/unbound/util/data/msgencode.c

88

struct compress_tree_node* parent;