iter_fwd.h

Go to the documentation of this file.

/*
 * iterator/iter_fwd.h - iterative resolver module forward zones.
 *
 * Copyright (c) 2007, 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 ITERATOR_ITER_FWD_H
#define ITERATOR_ITER_FWD_H
#include "util/rbtree.h"
struct config_file;
struct delegpt;

struct iter_forwards {
    rbtree_type* tree;
};

struct iter_forward_zone {
    rbnode_type node;
    uint8_t* name;
    size_t namelen;
    int namelabs;
    struct delegpt* dp;
    struct iter_forward_zone* parent;
    uint16_t dclass;
};

struct iter_forwards* forwards_create(void);

void forwards_delete(struct iter_forwards* fwd);

int forwards_apply_cfg(struct iter_forwards* fwd, struct config_file* cfg);

struct delegpt* forwards_find(struct iter_forwards* fwd, uint8_t* qname,
    uint16_t qclass);

struct delegpt* forwards_lookup(struct iter_forwards* fwd, 
    uint8_t* qname, uint16_t qclass);

struct delegpt* forwards_lookup_root(struct iter_forwards* fwd, 
    uint16_t qclass);

int forwards_next_root(struct iter_forwards* fwd, uint16_t* qclass);

size_t forwards_get_mem(struct iter_forwards* fwd);

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

int forwards_add_zone(struct iter_forwards* fwd, uint16_t c, 
    struct delegpt* dp);

void forwards_delete_zone(struct iter_forwards* fwd, uint16_t c, uint8_t* nm);

int forwards_add_stub_hole(struct iter_forwards* fwd, uint16_t c, uint8_t* nm);

void forwards_delete_stub_hole(struct iter_forwards* fwd, uint16_t c,
    uint8_t* nm);
 
#endif /* ITERATOR_ITER_FWD_H */