3584 	int klen, namlen, len, rc;  in dtCompare()  local
3605 	klen = key->namlen;  in dtCompare()
3614 	len = min(klen, len);  in dtCompare()
3618 	klen -= len;  in dtCompare()
3623 	while (klen > 0 && namlen > 0) {  in dtCompare()
3627 		len = min(klen, len);  in dtCompare()
3632 		klen -= len;  in dtCompare()
3638 	return (klen - namlen);  in dtCompare()
3661 	int klen, namlen, len, rc;  in ciCompare()  local
3684 	klen = key->namlen;  in ciCompare()
3711 	len = min(klen, len);  in ciCompare()
3722 	klen -= len;  in ciCompare()
3726 	while (klen > 0 && namlen > 0) {  in ciCompare()
3730 		len = min(klen, len);  in ciCompare()
3743 		klen -= len;  in ciCompare()
3748 	return (klen - namlen);  in ciCompare()
3765 	int klen, namlen;  in ciGetLeafPrefixKey()  local
3797 	klen = 0;  in ciGetLeafPrefixKey()
3801 	     namlen; pl++, pr++, namlen--, klen++, kname++) {  in ciGetLeafPrefixKey()
3804 			key->namlen = klen + 1;  in ciGetLeafPrefixKey()
3812 		key->namlen = klen + 1;  in ciGetLeafPrefixKey()
3814 		key->namlen = klen;  in ciGetLeafPrefixKey()
3899 	int hsi, fsi, klen, len, nextindex;  in dtInsertEntry()  local
3910 	klen = key->namlen;  in dtInsertEntry()
3931 		lh->namlen = klen;  in dtInsertEntry()
3934 			len = min(klen, DTLHDRDATALEN);  in dtInsertEntry()
3941 			len = min(klen, DTLHDRDATALEN_LEGACY);  in dtInsertEntry()
3947 		ih->namlen = klen;  in dtInsertEntry()
3949 		len = min(klen, DTIHDRDATALEN);  in dtInsertEntry()
3959 	klen -= len;  in dtInsertEntry()
3960 	while (klen) {  in dtInsertEntry()
3986 		len = min(klen, DTSLOTDATALEN);  in dtInsertEntry()
3991 		klen -= len;  in dtInsertEntry()