3293 	int klen, namlen, len, rc;  in dtCompare()  local
3314 	klen = key->namlen;  in dtCompare()
3323 	len = min(klen, len);  in dtCompare()
3327 	klen -= len;  in dtCompare()
3332 	while (klen > 0 && namlen > 0) {  in dtCompare()
3336 		len = min(klen, len);  in dtCompare()
3341 		klen -= len;  in dtCompare()
3347 	return (klen - namlen);  in dtCompare()
3370 	int klen, namlen, len, rc;  in ciCompare()  local
3393 	klen = key->namlen;  in ciCompare()
3420 	len = min(klen, len);  in ciCompare()
3431 	klen -= len;  in ciCompare()
3435 	while (klen > 0 && namlen > 0) {  in ciCompare()
3439 		len = min(klen, len);  in ciCompare()
3452 		klen -= len;  in ciCompare()
3457 	return (klen - namlen);  in ciCompare()
3474 	int klen, namlen;  in ciGetLeafPrefixKey()  local
3506 	klen = 0;  in ciGetLeafPrefixKey()
3510 	     namlen; pl++, pr++, namlen--, klen++, kname++) {  in ciGetLeafPrefixKey()
3513 			key->namlen = klen + 1;  in ciGetLeafPrefixKey()
3521 		key->namlen = klen + 1;  in ciGetLeafPrefixKey()
3523 		key->namlen = klen;  in ciGetLeafPrefixKey()
3608 	int hsi, fsi, klen, len, nextindex;  in dtInsertEntry()  local
3619 	klen = key->namlen;  in dtInsertEntry()
3640 		lh->namlen = klen;  in dtInsertEntry()
3643 			len = min(klen, DTLHDRDATALEN);  in dtInsertEntry()
3650 			len = min(klen, DTLHDRDATALEN_LEGACY);  in dtInsertEntry()
3656 		ih->namlen = klen;  in dtInsertEntry()
3658 		len = min(klen, DTIHDRDATALEN);  in dtInsertEntry()
3668 	klen -= len;  in dtInsertEntry()
3669 	while (klen) {  in dtInsertEntry()
3695 		len = min(klen, DTSLOTDATALEN);  in dtInsertEntry()
3700 		klen -= len;  in dtInsertEntry()