3286 	int klen, namlen, len, rc;  in dtCompare()  local
3307 	klen = key->namlen;  in dtCompare()
3316 	len = min(klen, len);  in dtCompare()
3320 	klen -= len;  in dtCompare()
3325 	while (klen > 0 && namlen > 0) {  in dtCompare()
3329 		len = min(klen, len);  in dtCompare()
3334 		klen -= len;  in dtCompare()
3340 	return (klen - namlen);  in dtCompare()
3363 	int klen, namlen, len, rc;  in ciCompare()  local
3386 	klen = key->namlen;  in ciCompare()
3413 	len = min(klen, len);  in ciCompare()
3424 	klen -= len;  in ciCompare()
3428 	while (klen > 0 && namlen > 0) {  in ciCompare()
3432 		len = min(klen, len);  in ciCompare()
3445 		klen -= len;  in ciCompare()
3450 	return (klen - namlen);  in ciCompare()
3467 	int klen, namlen;  in ciGetLeafPrefixKey()  local
3499 	klen = 0;  in ciGetLeafPrefixKey()
3503 	     namlen; pl++, pr++, namlen--, klen++, kname++) {  in ciGetLeafPrefixKey()
3506 			key->namlen = klen + 1;  in ciGetLeafPrefixKey()
3514 		key->namlen = klen + 1;  in ciGetLeafPrefixKey()
3516 		key->namlen = klen;  in ciGetLeafPrefixKey()
3601 	int hsi, fsi, klen, len, nextindex;  in dtInsertEntry()  local
3612 	klen = key->namlen;  in dtInsertEntry()
3633 		lh->namlen = klen;  in dtInsertEntry()
3636 			len = min(klen, DTLHDRDATALEN);  in dtInsertEntry()
3643 			len = min(klen, DTLHDRDATALEN_LEGACY);  in dtInsertEntry()
3649 		ih->namlen = klen;  in dtInsertEntry()
3651 		len = min(klen, DTIHDRDATALEN);  in dtInsertEntry()
3661 	klen -= len;  in dtInsertEntry()
3662 	while (klen) {  in dtInsertEntry()
3688 		len = min(klen, DTSLOTDATALEN);  in dtInsertEntry()
3693 		klen -= len;  in dtInsertEntry()