lib/dns/name.c

199 	unsigned int offset, count, length, nlabels;
212 	offset = 0;
215 	while (offset != length) {
220 		if (offsets != NULL && offsets[nlabels] != offset) {
225 		offset += count + 1;
227 		if (offset > length) {
236 	if (nlabels != name->labels || offset != name->length) {
273 	 * Does 'name' end in the root label?
304 	 * Root label.
359 	 * Root label.
422 	unsigned int label;
432 	 * Skip first label.
438 	label = 1;
442 	while (label + 1 < name->labels) {
449 		label++;
556 		 * other extended label types.
813 	 * ended with the root label and the longer one can't have
814 	 * a root label in the middle of it.  Therefore, if we get
884 dns_name_getlabel(const dns_name_t *name, unsigned int n, dns_label_t *label) {
889 	 * Make 'label' refer to the 'n'th least significant label of 'name'.
895 	REQUIRE(label != NULL);
899 	label->base = &name->ndata[offsets[n]];
901 		label->length = name->length - offsets[n];
903 		label->length = offsets[n + 1] - offsets[n];
1060 	unsigned char *ndata, *label = NULL;
1148 			label = ndata;
1167 				*label = count;
1198 				 * This looks like a bitstring label, which
1266 			INSIST(label != NULL);
1267 			*label = count;
1276 			label = origin->ndata;
1281 				n2 = *label++;
1287 					c = *label++;
1390 		 * Special handling for the root label.
1474 			FATAL_ERROR("Unexpected label type %02x", count);
1539 		 * Special handling for the root label.
1597 			FATAL_ERROR("Unexpected label type %02x", count);
1679 			FATAL_ERROR("Unexpected label type %02x", count);
1705 	unsigned int offset, count, length, nlabels;
1711 	offset = 0;
1714 	while (offset != length) {
1716 		offsets[nlabels++] = offset;
1719 		offset += count + 1;
1721 		INSIST(offset <= length);
1731 		set_name->length = offset;
1739 	INSIST(offset == name->length);
1775 	 * a sequence of labels ending with the root label or a compression
1785 	 * We start at octet 1. There is an ordinary single character label "a",
1787 	 * Here there is a label of length 4, which weirdly re-uses the octets
1788 	 * we already examined as the data for the label. It is followed by the
1789 	 * root label,
1834 	 * The cursor steps forwards for each label.
1845 	 * One iteration per label.
1851 			 * Normal label: record its offset, and check bounds on
1898 	 * from the marker up to and including the root label.
1924 	uint16_t offset;
1927 	uint16_t go;   /* Global compression offset */
1942 	 * offset of the previously rendered name is passed to us, write
1953 		offset = *comp_offsetp;
1954 		offset |= 0xc000;
1955 		isc_buffer_putuint16(target, offset);
1970 	offset = target->used; /*XXX*/
1981 	 * If the offset is too high for 14 bit global compression, we're
2010 			dns_compress_add(cctx, name, &gp, offset);
2012 				*comp_offsetp = offset;
2027 		dns_compress_add(cctx, name, name, offset);
2029 			*comp_offsetp = offset;
2630 	 * label length consistent with a trust-anchor-telemetry label.