H A D | msgencode.c | 68 * A tree of dnames and their offsets in the packet is kept. 73 * It is a binary tree, not a rbtree or balanced tree, as the effort 78 /** left node in tree, all smaller to this */ 80 /** right node in tree, all larger than this */ 83 /** the parent node - not for tree, but zone parent. One less label */ 94 * Find domain name in tree, returns exact and closest match. 95 * @param tree: root of tree. 100 * can be null if the tree i 107 compress_tree_search(struct compress_tree_node** tree, uint8_t* dname, int labs, struct compress_tree_node** match, int* matchlabels, struct compress_tree_node*** insertpt) argument 147 compress_tree_lookup(struct compress_tree_node** tree, uint8_t* dname, int labs, struct compress_tree_node*** insertpt) argument 287 compress_owner(struct ub_packed_rrset_key* key, sldns_buffer* pkt, struct regional* region, struct compress_tree_node** tree, size_t owner_pos, uint16_t* owner_ptr, int owner_labs) argument 336 compress_any_dname(uint8_t* dname, sldns_buffer* pkt, int labs, struct regional* region, struct compress_tree_node** tree) argument 367 compress_rdata(sldns_buffer* pkt, uint8_t* rdata, size_t todolen, struct regional* region, struct compress_tree_node** tree, const sldns_rr_descriptor* desc) argument 449 packed_rrset_encode(struct ub_packed_rrset_key* key, sldns_buffer* pkt, uint16_t* num_rrs, time_t timenow, struct regional* region, int do_data, int do_sig, struct compress_tree_node** tree, sldns_pkt_section s, uint16_t qtype, int dnssec, size_t rr_offset) argument 544 insert_section(struct reply_info* rep, size_t num_rrsets, uint16_t* num_rrs, sldns_buffer* pkt, size_t rrsets_before, time_t timenow, struct regional* region, struct compress_tree_node** tree, sldns_pkt_section s, uint16_t qtype, int dnssec, size_t rr_offset) argument 599 insert_query(struct query_info* qinfo, struct compress_tree_node** tree, sldns_buffer* buffer, struct regional* region) argument 677 struct compress_tree_node* tree = 0; local [all...] |