Lines Matching refs:local_zone

61 local_zone_out(struct local_zone* z)
75 local_zone_print(struct local_zone* z)
88 	struct local_zone* z;
91 	RBTREE_FOR(z, struct local_zone*, &zones->ztree) {
107 	/* also lock protects the rbnode's in struct local_zone */
115 	struct local_zone* z = (struct local_zone*)n->key;
131 local_zone_delete(struct local_zone* z)
147 	struct local_zone* a = (struct local_zone*)z1;
148 	struct local_zone* b = (struct local_zone*)z2;
183 static struct local_zone*
187 	struct local_zone* z = (struct local_zone*)calloc(1, sizeof(*z));
210 static struct local_zone*
214 	struct local_zone* z = local_zone_create(nm, len, labs, t, c);
225 		struct local_zone* oldz;
245 struct local_zone*
249 	struct local_zone* z;
460 local_zone_find_data(struct local_zone* z, uint8_t* nm, size_t nmlen, int nmlabs)
472 lz_find_create_node(struct local_zone* z, uint8_t* nm, size_t nmlen, 
512 lz_mark_soa_for_zone(struct local_zone* z, struct ub_packed_rrset_key* soa_rrset,
549 local_zone_enter_rr(struct local_zone* z, uint8_t* nm, size_t nmlen,
606 lz_enter_rr_into_zone(struct local_zone* z, const char* rrstr)
645 	struct local_zone* z;
674 	struct local_zone* z;
711 	struct local_zone* z;
789 	struct local_zone* z;
808 	struct local_zone z;
850 	struct local_zone* z;
874 	struct local_zone* z;
997 static struct local_zone* find_closest_parent(struct local_zone* curr,
998 	struct local_zone* prev)
1000 	struct local_zone* p;
1023 	struct local_zone* node, *prev = NULL;
1025 	RBTREE_FOR(node, struct local_zone*, &zones->ztree) {
1071 			struct local_zone* z = local_zones_lookup(zones,
1127 		struct local_zone* z;
1232 struct local_zone* 
1240 struct local_zone* 
1246 	struct local_zone *result;
1247 	struct local_zone key;
1260 	result = (struct local_zone*)res;
1278 struct local_zone* 
1282 	struct local_zone key;
1289 	return (struct local_zone*)rbtree_search(&zones->ztree, &key);
1292 struct local_zone*
1297 	struct local_zone key;
1305 	return (struct local_zone*)node;
1481 local_data_answer(struct local_zone* z, struct module_env* env,
1618 local_zone_does_not_cover(struct local_zone* z, struct query_info* qinfo,
1653 local_zones_zone_answer(struct local_zone* z, struct module_env* env,
1774 lz_inform_print(struct local_zone* z, struct query_info* qinfo,
1857 	struct local_zone* z = NULL;
2016 set_kiddo_parents(struct local_zone* z, struct local_zone* match, 
2017 	struct local_zone* newp)
2022 	struct local_zone* p = z;
2023 	p = (struct local_zone*)rbtree_next(&p->node);
2024 	while(p!=(struct local_zone*)RBTREE_NULL &&
2036 		p = (struct local_zone*)rbtree_next(&p->node);
2040 struct local_zone* local_zones_add_zone(struct local_zones* zones,
2046 	struct local_zone *prev;
2047 	struct local_zone* z = local_zone_create(name, len, labs, tp, dclass);
2075 void local_zones_del_zone(struct local_zones* zones, struct local_zone* z)
2096 	struct local_zone* z;
2140 del_empty_term(struct local_zone* z, struct local_data* d, 
2178 	struct local_zone* z;
2224 /** Get memory usage for local_zone */
2226 local_zone_get_mem(struct local_zone* z)
2237 	struct local_zone* z;
2242 	RBTREE_FOR(z, struct local_zone*, &zones->ztree) {