Lines Matching defs:compress_tree_node

81 struct compress_tree_node {
83 	struct compress_tree_node* left;
85 	struct compress_tree_node* right;
88 	struct compress_tree_node* parent;
111 compress_tree_search(struct compress_tree_node** tree, uint8_t* dname,
112 	int labs, struct compress_tree_node** match, int* matchlabels,
113 	struct compress_tree_node*** insertpt)
116 	struct compress_tree_node* p = *tree;
117 	struct compress_tree_node* close = 0;
118 	struct compress_tree_node** prev = tree;
150 static struct compress_tree_node*
151 compress_tree_lookup(struct compress_tree_node** tree, uint8_t* dname,
152 	int labs, struct compress_tree_node*** insertpt)
154 	struct compress_tree_node* p;
181 static struct compress_tree_node*
185 	struct compress_tree_node* n = (struct compress_tree_node*)
186 		regional_alloc(region, sizeof(struct compress_tree_node));
211 	struct regional* region, struct compress_tree_node* closest, 
212 	struct compress_tree_node** insertpt)
215 	struct compress_tree_node* newnode;
216 	struct compress_tree_node* prevnode = NULL;
257 	struct compress_tree_node* p)
292 	struct regional* region, struct compress_tree_node** tree,
296 	struct compress_tree_node* p;
297 	struct compress_tree_node** insertpt = NULL;
345 	struct regional* region, struct compress_tree_node** tree,
348 	struct compress_tree_node* p;
349 	struct compress_tree_node** insertpt = NULL;
380 	struct regional* region, struct compress_tree_node** tree,
463 	int do_data, int do_sig, struct compress_tree_node** tree,
559 	struct regional* region, struct compress_tree_node** tree,
613 insert_query(struct query_info* qinfo, struct compress_tree_node** tree, 
691 	struct compress_tree_node* tree = 0;