Lines Matching refs:labels
139 name->labels = 0; \
235 name->labels = 0;
299 REQUIRE(name->labels > 0);
349 REQUIRE(name->labels > 0);
396 REQUIRE(name->labels > 0);
418 REQUIRE(name->labels > 0);
429 * Check all but the last of the remaining labels.
431 while (label + 1 < name->labels) {
483 if (name->labels == 0)
496 if (name->labels == 0)
528 if (name->labels == 0)
530 else if (name->labels == 1)
535 tname.labels = 1;
537 for (i = 0; i < name->labels; i++) {
539 if (i == name->labels - 1)
585 l1 = name1->labels;
586 l2 = name2->labels;
603 * We dropped bitstring labels, and we don't support any
695 l = name1->labels;
697 if (l != name2->labels)
761 REQUIRE(name1->labels > 0);
764 REQUIRE(name2->labels > 0);
767 l1 = name1->labels;
768 l2 = name2->labels;
797 * If one name had more labels than the other, their common
834 unsigned int nlabels, labels;
838 REQUIRE(name->labels > 0);
840 labels = wname->labels;
841 REQUIRE(labels > 0);
845 dns_name_getlabelsequence(wname, 1, labels - 1, &tname);
855 * How many labels does 'name' have?
860 ENSURE(name->labels <= 128);
862 return (name->labels);
875 REQUIRE(name->labels > 0);
876 REQUIRE(n < name->labels);
882 if (n == name->labels - 1)
898 * Make 'target' refer to the 'n' labels including and following
904 REQUIRE(first <= source->labels);
905 REQUIRE(n <= source->labels - first); /* note first+n could overflow */
910 if (first == source->labels)
915 if (first + n == source->labels)
923 if (first + n == source->labels && n > 0 &&
929 target->labels = n;
954 target->labels = source->labels;
958 if (target->offsets != NULL && source->labels > 0) {
961 source->labels);
1002 name->labels = 0;
1033 unsigned int tlen, nrem, nused, digits = 0, labels, tused;
1082 labels = 0;
1099 labels++;
1131 labels++;
1132 INSIST(labels <= 127);
1133 offsets[labels] = nused;
1135 labels++;
1221 labels++;
1222 INSIST(labels <= 127);
1223 offsets[labels] = nused;
1245 labels++;
1247 INSIST(labels <= 127);
1248 offsets[labels] = nused;
1258 name->labels = labels;
1340 unsigned int labels;
1365 labels = name->labels;
1371 if (labels == 0 && nlen == 0) {
1394 } else if (nlen == 1 && labels == 1 && *ndata == '\0') {
1412 while (labels > 0 && nlen > 0 && trem > 0) {
1413 labels--;
1517 unsigned int labels;
1529 labels = name->labels;
1535 if (nlen == 1 && labels == 1 && *ndata == '\0') {
1552 while (labels > 0 && nlen > 0 && trem > 0) {
1553 labels--;
1621 unsigned int nlen, count, labels;
1649 labels = source->labels;
1656 while (labels > 0 && nlen > 0) {
1657 labels--;
1676 name->labels = source->labels;
1682 if (name->labels > 0 && name->offsets != NULL)
1721 set_name->labels = nlabels;
1728 INSIST(nlabels == name->labels);
1739 unsigned int nused, labels, n, nmax;
1785 labels = 0;
1822 offsets[labels] = nused;
1823 labels++;
1887 name->labels = labels;
1994 unsigned int nrem, labels, prefix_length, length;
2010 if (prefix == NULL || prefix->labels == 0)
2012 if (suffix == NULL || suffix->labels == 0)
2040 labels = 0;
2044 labels += prefix->labels;
2048 labels += suffix->labels;
2079 name->labels = labels;
2086 if (name->labels > 0 && name->offsets != NULL) {
2105 REQUIRE(suffixlabels < name->labels);
2116 splitlabel = name->labels - suffixlabels;
2153 target->labels = source->labels;
2160 source->labels);
2188 target->ndata = isc_mem_get(mctx, source->length + source->labels);
2195 target->labels = source->labels;
2202 memcpy(target->offsets, source->offsets, source->labels);
2222 size += name->labels;
2456 dest->labels = source->labels;
2463 if (dest->labels > 0 && dest->offsets != NULL) {
2465 memcpy(dest->offsets, source->offsets, source->labels);