3598 	int klen, namlen, len, rc;  in dtCompare()  local
3619 	klen = key->namlen;  in dtCompare()
3628 	len = min(klen, len);  in dtCompare()
3632 	klen -= len;  in dtCompare()
3637 	while (klen > 0 && namlen > 0) {  in dtCompare()
3641 		len = min(klen, len);  in dtCompare()
3646 		klen -= len;  in dtCompare()
3652 	return (klen - namlen);  in dtCompare()
3675 	int klen, namlen, len, rc;  in ciCompare()  local
3698 	klen = key->namlen;  in ciCompare()
3725 	len = min(klen, len);  in ciCompare()
3736 	klen -= len;  in ciCompare()
3740 	while (klen > 0 && namlen > 0) {  in ciCompare()
3744 		len = min(klen, len);  in ciCompare()
3757 		klen -= len;  in ciCompare()
3762 	return (klen - namlen);  in ciCompare()
3779 	int klen, namlen;  in ciGetLeafPrefixKey()  local
3811 	klen = 0;  in ciGetLeafPrefixKey()
3815 	     namlen; pl++, pr++, namlen--, klen++, kname++) {  in ciGetLeafPrefixKey()
3818 			key->namlen = klen + 1;  in ciGetLeafPrefixKey()
3826 		key->namlen = klen + 1;  in ciGetLeafPrefixKey()
3828 		key->namlen = klen;  in ciGetLeafPrefixKey()
3913 	int hsi, fsi, klen, len, nextindex;  in dtInsertEntry()  local
3924 	klen = key->namlen;  in dtInsertEntry()
3945 		lh->namlen = klen;  in dtInsertEntry()
3948 			len = min(klen, DTLHDRDATALEN);  in dtInsertEntry()
3955 			len = min(klen, DTLHDRDATALEN_LEGACY);  in dtInsertEntry()
3961 		ih->namlen = klen;  in dtInsertEntry()
3963 		len = min(klen, DTIHDRDATALEN);  in dtInsertEntry()
3973 	klen -= len;  in dtInsertEntry()
3974 	while (klen) {  in dtInsertEntry()
4000 		len = min(klen, DTSLOTDATALEN);  in dtInsertEntry()
4005 		klen -= len;  in dtInsertEntry()