Lines Matching defs:region

178  * @param region: how to allocate memory for new node.
183 	struct regional* region)
186 		regional_alloc(region, sizeof(struct compress_tree_node));
202  * @param region: how to allocate memory for new node.
211 	struct regional* region, struct compress_tree_node* closest, 
227 			region))) {
292 	struct regional* region, struct compress_tree_node** tree,
325 			owner_pos, region, p, insertpt))
345 	struct regional* region, struct compress_tree_node** tree,
361 		!compress_tree_store(dname, labs, pos, region, p, insertpt))
380 	struct regional* region, struct compress_tree_node** tree,
395 			if((r=compress_any_dname(rdata, pkt, labs, region,
462 	uint16_t* num_rrs, time_t timenow, struct regional* region,
493 			if((r=compress_owner(key, pkt, region, tree,
505 					data->rr_len[j], region, tree, c,
527 					pkt, owner_labs, region, tree,
559 	struct regional* region, struct compress_tree_node** tree,
576 				pkt, num_rrs, timenow, region, 1, 1, tree,
589 				pkt, num_rrs, timenow, region, 1, 0, tree,
600 				pkt, num_rrs, timenow, region, 0, 1, tree,
614 	sldns_buffer* buffer, struct regional* region)
625 		sldns_buffer_position(buffer), region, NULL, tree))
688 	struct regional* region, uint16_t udpsize, int dnssec, int minimise)
710 		if((r=insert_query(qinfo, &tree, buffer, region)) !=
740 			timezero, region, &tree, LDNS_SECTION_ANSWER,
755 		0, timenow, region, &tree, LDNS_SECTION_ANSWER, qinfo->qtype,
772 			rep->an_numrrsets, timenow, region, &tree,
789 				rep->an_numrrsets + rep->ns_numrrsets, timenow, region,
999 	int cached, struct regional* region, uint16_t udpsize, 
1044 	if(!reply_info_encode(qinf, rep, id, flags, pkt, timenow, region,