dnstree.h

Go to the documentation of this file.

/*
 * util/storage/dnstree.h - support for rbtree types suitable for DNS code.
 *
 * Copyright (c) 2008, NLnet Labs. All rights reserved.
 *
 * This software is open source.
 * 
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 
 * Redistributions of source code must retain the above copyright notice,
 * this list of conditions and the following disclaimer.
 * 
 * Redistributions in binary form must reproduce the above copyright notice,
 * this list of conditions and the following disclaimer in the documentation
 * and/or other materials provided with the distribution.
 * 
 * Neither the name of the NLNET LABS nor the names of its contributors may
 * be used to endorse or promote products derived from this software without
 * specific prior written permission.
 * 
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
 * HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
 * TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

 
#ifndef UTIL_STORAGE_DNSTREE_H
#define UTIL_STORAGE_DNSTREE_H
#include "util/rbtree.h"

struct name_tree_node {
    rbnode_type node;
    struct name_tree_node* parent;
    uint8_t* name;
    size_t len;
    int labs;
    uint16_t dclass;
};

struct addr_tree_node {
    rbnode_type node;
    struct addr_tree_node* parent;
    struct sockaddr_storage addr;
    socklen_t addrlen;
    int net;
};

void name_tree_init(rbtree_type* tree);

int name_tree_insert(rbtree_type* tree, struct name_tree_node* node, 
    uint8_t* name, size_t len, int labs, uint16_t dclass);

void name_tree_init_parents(rbtree_type* tree);

struct name_tree_node* name_tree_find(rbtree_type* tree, uint8_t* name, 
    size_t len, int labs, uint16_t dclass);

struct name_tree_node* name_tree_lookup(rbtree_type* tree, uint8_t* name, 
    size_t len, int labs, uint16_t dclass);

int name_tree_next_root(rbtree_type* tree, uint16_t* dclass);

void addr_tree_init(rbtree_type* tree);

int addr_tree_insert(rbtree_type* tree, struct addr_tree_node* node, 
    struct sockaddr_storage* addr, socklen_t addrlen, int net);

void addr_tree_init_parents(rbtree_type* tree);

struct addr_tree_node* addr_tree_lookup(rbtree_type* tree, 
    struct sockaddr_storage* addr, socklen_t addrlen);

struct addr_tree_node* addr_tree_find(rbtree_type* tree, 
    struct sockaddr_storage* addr, socklen_t addrlen, int net);

int name_tree_compare(const void* k1, const void* k2);

int addr_tree_compare(const void* k1, const void* k2);
 
#endif /* UTIL_STORAGE_DNSTREE_H */