Lines Matching refs:labels
28 * of labels and the 7 higher order bytes store per-label offsets.
50 /** The maximum number of labels in a Name */
112 setlabels(int labels) {
114 offsets |= labels;
130 int labels = src.labels();
133 for (int i = 0; i < labels && i < MAXOFFSETS; i++)
135 dst.setlabels(labels);
154 int labels = getlabels();
155 int newlabels = labels + n;
157 throw new IllegalStateException("too many labels");
164 setoffset(labels + i, pos);
355 throw new WireParseException("too many labels");
402 * Create a new name by removing labels from the beginning of an existing Name
404 * @param n The number of labels to remove from the beginning in the copy
408 int slabels = src.labels();
411 "many labels");
448 int labels = newname.labels() - origin.labels();
449 newname.setlabels(labels);
456 * Generates a new Name with the first n labels replaced by a wildcard
463 "labels");
489 int plabels = labels() - dnameowner.labels();
493 int dlabels = dnametarget.labels();
517 if (labels() == 0)
527 if (labels() == 0)
543 * The number of labels in the name.
546 labels() {
555 int labels = labels();
556 int dlabels = domain.labels();
557 if (dlabels > labels)
559 if (dlabels == labels)
561 return domain.equals(name, offset(labels - dlabels));
592 int labels = labels();
593 if (labels == 0)
595 else if (labels == 1 && name[offset(0)] == 0)
598 for (int i = 0, pos = offset(0); i < labels; i++) {
650 int labels = labels();
651 labels - 1; i++) {
701 int labels = labels();
702 if (labels == 0)
705 for (int i = 0, spos = offset(0), dpos = 0; i < labels; i++) {
734 int labels = labels();
735 for (int i = 0, pos = offset(0); i < labels; i++) {
766 if (d.labels() != labels())
801 int labels = labels();
802 int alabels = arg.labels();
803 int compares = labels > alabels ? alabels : labels;
806 int start = offset(labels - i);
819 return (labels - alabels);
