Lines Matching refs:labels
130 name->labels = 0; \
209 name->labels = 0;
224 if (name->length > 255U || name->labels > 127U)
250 if (nlabels != name->labels || offset != name->length)
313 REQUIRE(name->labels > 0);
363 REQUIRE(name->labels > 0);
410 REQUIRE(name->labels > 0);
432 REQUIRE(name->labels > 0);
443 * Check all but the last of the remaining labels.
445 while (label + 1 < name->labels) {
465 if (name->labels == 0)
483 if (name->labels == 0)
513 if (name->labels == 0)
515 else if (name->labels == 1)
521 tname.labels = 1;
523 for (i = 0; i < name->labels; i++) {
525 if (i == name->labels - 1)
570 *nlabelsp = name1->labels;
578 l1 = name1->labels;
579 l2 = name2->labels;
601 * We dropped bitstring labels, and we don't support any
724 l = name1->labels;
726 if (l != name2->labels)
806 REQUIRE(name1->labels > 0);
809 REQUIRE(name2->labels > 0);
812 l1 = name1->labels;
813 l2 = name2->labels;
842 * If one name had more labels than the other, their common
879 unsigned int nlabels, labels;
883 REQUIRE(name->labels > 0);
885 labels = wname->labels;
886 REQUIRE(labels > 0);
894 dns_name_getlabelsequence(wname, 1, labels - 1, &tname);
904 * How many labels does 'name' have?
909 ENSURE(name->labels <= 128);
911 return (name->labels);
924 REQUIRE(name->labels > 0);
925 REQUIRE(n < name->labels);
931 if (n == name->labels - 1)
947 * Make 'target' refer to the 'n' labels including and following
953 REQUIRE(first <= source->labels);
954 REQUIRE(n <= source->labels - first); /* note first+n could overflow */
958 if (ISC_UNLIKELY(first == source->labels)) {
968 if (ISC_LIKELY(first + n == source->labels))
981 if (first + n == source->labels && n > 0 &&
987 target->labels = n;
1012 target->labels = source->labels;
1016 if (target->offsets != NULL && source->labels > 0) {
1019 source->labels);
1061 name->labels = 0;
1092 unsigned int tlen, nrem, nused, digits = 0, labels, tused;
1141 labels = 0;
1158 labels++;
1190 labels++;
1191 INSIST(labels <= 127);
1192 offsets[labels] = nused;
1194 labels++;
1280 labels++;
1281 INSIST(labels <= 127);
1282 offsets[labels] = nused;
1304 labels++;
1306 INSIST(labels <= 127);
1307 offsets[labels] = nused;
1317 name->labels = labels;
1400 unsigned int labels;
1425 labels = name->labels;
1431 if (labels == 0 && nlen == 0) {
1454 } else if (nlen == 1 && labels == 1 && *ndata == '\0') {
1472 while (labels > 0 && nlen > 0 && trem > 0) {
1473 labels--;
1582 unsigned int labels;
1594 labels = name->labels;
1600 if (nlen == 1 && labels == 1 && *ndata == '\0') {
1617 while (labels > 0 && nlen > 0 && trem > 0) {
1618 labels--;
1686 unsigned int nlen, count, labels;
1714 labels = source->labels;
1721 while (labels > 0 && nlen > 0) {
1722 labels--;
1741 name->labels = source->labels;
1747 if (name->labels > 0 && name->offsets != NULL)
1785 set_name->labels = nlabels;
1792 INSIST(nlabels == name->labels);
1803 unsigned int nused, labels, n, nmax;
1849 labels = 0;
1886 offsets[labels] = nused;
1887 labels++;
1945 name->labels = labels;
2062 unsigned int nrem, labels, prefix_length, length;
2078 if (prefix == NULL || prefix->labels == 0)
2080 if (suffix == NULL || suffix->labels == 0)
2108 labels = 0;
2112 labels += prefix->labels;
2116 labels += suffix->labels;
2142 name->labels = labels;
2149 if (name->labels > 0 && name->offsets != NULL) {
2168 REQUIRE(suffixlabels <= name->labels);
2177 splitlabel = name->labels - suffixlabels;
2214 target->labels = source->labels;
2221 source->labels);
2249 target->ndata = isc_mem_get(mctx, source->length + source->labels);
2256 target->labels = source->labels;
2263 memmove(target->offsets, source->offsets, source->labels);
2283 size += name->labels;
2526 dest->labels = source->labels;
2533 if (dest->labels > 0 && dest->offsets != NULL) {
2535 memmove(dest->offsets, source->offsets, source->labels);
2698 if (name->labels < 1)