val_neg_data
struct val_neg_data* data;
data = (struct val_neg_data*)rbtree_previous((rbnode_type*)data);
static struct val_neg_data*
struct val_neg_data* data;
struct val_neg_data* d = (struct val_neg_data*)n;
struct val_neg_data* data;
data = (struct val_neg_data*)rbtree_last(&zone->tree);
struct val_neg_data* data;
struct val_neg_data* data)
struct val_neg_data* data)
struct val_neg_data* data)
void neg_delete_data(struct val_neg_cache* neg, struct val_neg_data* el)
struct val_neg_data* p, *np;
static struct val_neg_data* neg_find_data(struct val_neg_zone* zone,
struct val_neg_data lookfor;
struct val_neg_data* result;
result = (struct val_neg_data*)
res = sizeof(struct val_neg_data) + len;
res += sizeof(struct val_neg_data) + len;
static struct val_neg_data* neg_closest_data_parent(
struct val_neg_data key;
struct val_neg_data* result;
result = (struct val_neg_data*)res;
result = (struct val_neg_data*)res;
static struct val_neg_data* neg_setup_data_node(
struct val_neg_data* el;
el = (struct val_neg_data*)calloc(1, sizeof(*el));
static struct val_neg_data* neg_data_chain(
uint8_t* nm, size_t nm_len, int labs, struct val_neg_data* parent)
struct val_neg_data* el, *first = NULL, *prev = NULL;
struct val_neg_data* p = first, *np;
struct val_neg_data* el, struct ub_packed_rrset_key* nsec)
struct val_neg_data* cur;
cur = (struct val_neg_data*)walk;
struct val_neg_data* x = (struct val_neg_data*)a;
struct val_neg_data* y = (struct val_neg_data*)b;
struct val_neg_data* parent;
struct val_neg_data* el;
struct val_neg_data* p, *np;
neg->use += sizeof(struct val_neg_data) + p->len;
struct val_neg_data* p;
uint8_t* qname, size_t len, int labs, struct val_neg_data** data)
struct val_neg_data key;
*data = (struct val_neg_data*)r;
*data = (struct val_neg_data*)r;
struct val_neg_data* parent;
struct val_neg_data* prev;
struct val_neg_data* next;
void neg_delete_data(struct val_neg_cache* neg, struct val_neg_data* el);
struct val_neg_data;
struct val_neg_data* first;
struct val_neg_data* last;
struct val_neg_data* d;
d = (struct val_neg_data*)walk;
d = (struct val_neg_data*)walk;
d = (struct val_neg_data*)walk;
struct val_neg_data* d;
d = (struct val_neg_data*)rbtree_first(&z->tree);
struct val_neg_data* p, *np;
struct val_neg_data* data)
struct val_neg_data* d;
RBTREE_FOR(d, struct val_neg_data*, &zone->tree) {
static void check_data(struct val_neg_zone* zone, struct val_neg_data* data)
struct val_neg_data* d;
RBTREE_FOR(d, struct val_neg_data*, &zone->tree) {
struct val_neg_data* d;
RBTREE_FOR(d, struct val_neg_data*, &z->tree) {
struct val_neg_data* data;
data = (struct val_neg_data*)rbtree_previous((rbnode_type*)data);
static struct val_neg_data*
struct val_neg_data* data;
struct val_neg_data* d = (struct val_neg_data*)n;
struct val_neg_data* data;
data = (struct val_neg_data*)rbtree_last(&zone->tree);
struct val_neg_data* data;
struct val_neg_data* data)
struct val_neg_data* data)
struct val_neg_data* data)
void neg_delete_data(struct val_neg_cache* neg, struct val_neg_data* el)
struct val_neg_data* p, *np;
static struct val_neg_data* neg_find_data(struct val_neg_zone* zone,
struct val_neg_data lookfor;
struct val_neg_data* result;
result = (struct val_neg_data*)
res = sizeof(struct val_neg_data) + len;
res += sizeof(struct val_neg_data) + len;
static struct val_neg_data* neg_closest_data_parent(
struct val_neg_data key;
struct val_neg_data* result;
result = (struct val_neg_data*)res;
result = (struct val_neg_data*)res;
static struct val_neg_data* neg_setup_data_node(
struct val_neg_data* el;
el = (struct val_neg_data*)calloc(1, sizeof(*el));
static struct val_neg_data* neg_data_chain(
uint8_t* nm, size_t nm_len, int labs, struct val_neg_data* parent)
struct val_neg_data* el, *first = NULL, *prev = NULL;
struct val_neg_data* p = first, *np;
struct val_neg_data* el, struct ub_packed_rrset_key* nsec)
struct val_neg_data* cur;
cur = (struct val_neg_data*)walk;
struct val_neg_data* x = (struct val_neg_data*)a;
struct val_neg_data* y = (struct val_neg_data*)b;
struct val_neg_data* parent;
struct val_neg_data* el;
struct val_neg_data* p, *np;
neg->use += sizeof(struct val_neg_data) + p->len;
struct val_neg_data* p;
uint8_t* qname, size_t len, int labs, struct val_neg_data** data)
struct val_neg_data key;
*data = (struct val_neg_data*)r;
*data = (struct val_neg_data*)r;
struct val_neg_data* parent;
struct val_neg_data* prev;
struct val_neg_data* next;
void neg_delete_data(struct val_neg_cache* neg, struct val_neg_data* el);
struct val_neg_data;
struct val_neg_data* first;
struct val_neg_data* last;