unbound/iterator/iter_fwd.c

58 	if(n1->dclass != n2->dclass) {
59 		if(n1->dclass < n2->dclass)
119 	node->dclass = c;
156 		if(!prev || prev->dclass != node->dclass) {
293 	key.dclass = c;
296 	return forwards_insert_data(fwd, key.dclass, key.name,
347 	key.dclass = qclass;
363 	key.dclass = qclass;
373 		if(!result || result->dclass != qclass)
397 forwards_next_root(struct iter_forwards* fwd, uint16_t* dclass)
402 	if(*dclass == 0) {
409 			*dclass = p->dclass;
413 		*dclass = p->dclass + 1;
414 		return forwards_next_root(fwd, dclass);
423 	key.dclass = *dclass;
437 			*dclass = p->dclass;
441 		*dclass = p->dclass+1;
442 		return forwards_next_root(fwd, dclass);
465 	key.dclass = c;