130 		struct zap_leaf_entry *le;  in zap_leaf_byteswap()  local
134 			le = &lc->l_entry;  in zap_leaf_byteswap()
136 			le->le_type =		BSWAP_8(le->le_type);  in zap_leaf_byteswap()
137 			le->le_value_intlen =	BSWAP_8(le->le_value_intlen);  in zap_leaf_byteswap()
138 			le->le_next =		BSWAP_16(le->le_next);  in zap_leaf_byteswap()
139 			le->le_name_chunk =	BSWAP_16(le->le_name_chunk);  in zap_leaf_byteswap()
140 			le->le_name_numints =	BSWAP_16(le->le_name_numints);  in zap_leaf_byteswap()
141 			le->le_value_chunk =	BSWAP_16(le->le_value_chunk);  in zap_leaf_byteswap()
142 			le->le_value_numints =	BSWAP_16(le->le_value_numints);  in zap_leaf_byteswap()
143 			le->le_cd =		BSWAP_32(le->le_cd);  in zap_leaf_byteswap()
144 			le->le_hash =		BSWAP_64(le->le_hash);  in zap_leaf_byteswap()
392 	struct zap_leaf_entry *le;  in zap_leaf_lookup()  local
397 	    *chunkp != CHAIN_END; chunkp = &le->le_next) {  in zap_leaf_lookup()
399 		le = ZAP_LEAF_ENTRY(l, chunk);  in zap_leaf_lookup()
402 		ASSERT3U(le->le_type, ==, ZAP_CHUNK_ENTRY);  in zap_leaf_lookup()
404 		if (le->le_hash != zn->zn_hash)  in zap_leaf_lookup()
414 		if (zap_leaf_array_match(l, zn, le->le_name_chunk,  in zap_leaf_lookup()
415 		    le->le_name_numints)) {  in zap_leaf_lookup()
416 			zeh->zeh_num_integers = le->le_value_numints;  in zap_leaf_lookup()
417 			zeh->zeh_integer_size = le->le_value_intlen;  in zap_leaf_lookup()
418 			zeh->zeh_cd = le->le_cd;  in zap_leaf_lookup()
419 			zeh->zeh_hash = le->le_hash;  in zap_leaf_lookup()
440 	struct zap_leaf_entry *le;  in zap_leaf_lookup_closest()  local
446 		    chunk != CHAIN_END; chunk = le->le_next) {  in zap_leaf_lookup_closest()
447 			le = ZAP_LEAF_ENTRY(l, chunk);  in zap_leaf_lookup_closest()
450 			ASSERT3U(le->le_type, ==, ZAP_CHUNK_ENTRY);  in zap_leaf_lookup_closest()
452 			if (HCD_GTEQ(le->le_hash, le->le_cd, h, cd) &&  in zap_leaf_lookup_closest()
453 			    HCD_GTEQ(besth, bestcd, le->le_hash, le->le_cd)) {  in zap_leaf_lookup_closest()
456 				besth = le->le_hash;  in zap_leaf_lookup_closest()
457 				bestcd = le->le_cd;  in zap_leaf_lookup_closest()
459 				zeh->zeh_num_integers = le->le_value_numints;  in zap_leaf_lookup_closest()
460 				zeh->zeh_integer_size = le->le_value_intlen;  in zap_leaf_lookup_closest()
461 				zeh->zeh_cd = le->le_cd;  in zap_leaf_lookup_closest()
462 				zeh->zeh_hash = le->le_hash;  in zap_leaf_lookup_closest()
477 	struct zap_leaf_entry *le =  in zap_entry_read()  local
479 	ASSERT3U(le->le_type, ==, ZAP_CHUNK_ENTRY);  in zap_entry_read()
481 	if (le->le_value_intlen > integer_size)  in zap_entry_read()
484 	zap_leaf_array_read(zeh->zeh_leaf, le->le_value_chunk,  in zap_entry_read()
485 	    le->le_value_intlen, le->le_value_numints,  in zap_entry_read()
498 	struct zap_leaf_entry *le =  in zap_entry_read_name()  local
500 	ASSERT3U(le->le_type, ==, ZAP_CHUNK_ENTRY);  in zap_entry_read_name()
503 		zap_leaf_array_read(zeh->zeh_leaf, le->le_name_chunk, 8,  in zap_entry_read_name()
504 		    le->le_name_numints, 8, buflen / 8, buf);  in zap_entry_read_name()
506 		zap_leaf_array_read(zeh->zeh_leaf, le->le_name_chunk, 1,  in zap_entry_read_name()
507 		    le->le_name_numints, 1, buflen, buf);  in zap_entry_read_name()
509 	if (le->le_name_numints > buflen)  in zap_entry_read_name()
519 	struct zap_leaf_entry *le = ZAP_LEAF_ENTRY(l, *zeh->zeh_chunkp);  in zap_entry_update()  local
522 	    ZAP_LEAF_ARRAY_NCHUNKS(le->le_value_numints * le->le_value_intlen);  in zap_entry_update()
527 	zap_leaf_array_free(l, &le->le_value_chunk);  in zap_entry_update()
528 	le->le_value_chunk =  in zap_entry_update()
530 	le->le_value_numints = num_integers;  in zap_entry_update()
531 	le->le_value_intlen = integer_size;  in zap_entry_update()
543 	struct zap_leaf_entry *le = ZAP_LEAF_ENTRY(l, entry_chunk);  in zap_entry_remove()  local
544 	ASSERT3U(le->le_type, ==, ZAP_CHUNK_ENTRY);  in zap_entry_remove()
546 	zap_leaf_array_free(l, &le->le_name_chunk);  in zap_entry_remove()
547 	zap_leaf_array_free(l, &le->le_value_chunk);  in zap_entry_remove()
549 	*zeh->zeh_chunkp = le->le_next;  in zap_entry_remove()
561 	struct zap_leaf_entry *le;  in zap_entry_create()  local
577 			    chunk != CHAIN_END; chunk = le->le_next) {  in zap_entry_create()
578 				le = ZAP_LEAF_ENTRY(l, chunk);  in zap_entry_create()
579 				if (le->le_cd > cd)  in zap_entry_create()
581 				if (le->le_hash == h) {  in zap_entry_create()
582 					ASSERT3U(cd, ==, le->le_cd);  in zap_entry_create()
590 				    chunk != CHAIN_END; chunk = le->le_next) {  in zap_entry_create()
591 					le = ZAP_LEAF_ENTRY(l, chunk);  in zap_entry_create()
592 					if (le->le_hash == h &&  in zap_entry_create()
593 					    le->le_cd == cd) {  in zap_entry_create()
614 	le = ZAP_LEAF_ENTRY(l, chunk);  in zap_entry_create()
615 	le->le_type = ZAP_CHUNK_ENTRY;  in zap_entry_create()
616 	le->le_name_chunk = zap_leaf_array_create(l, zn->zn_key_orig,  in zap_entry_create()
618 	le->le_name_numints = zn->zn_key_orig_numints;  in zap_entry_create()
619 	le->le_value_chunk =  in zap_entry_create()
621 	le->le_value_numints = num_integers;  in zap_entry_create()
622 	le->le_value_intlen = integer_size;  in zap_entry_create()
623 	le->le_hash = h;  in zap_entry_create()
624 	le->le_cd = cd;  in zap_entry_create()
634 	zeh->zeh_integer_size = le->le_value_intlen;  in zap_entry_create()
635 	zeh->zeh_cd = le->le_cd;  in zap_entry_create()
636 	zeh->zeh_hash = le->le_hash;  in zap_entry_create()
656 	struct zap_leaf_entry *le;  in zap_entry_normalization_conflict()  local
663 	    chunk != CHAIN_END; chunk = le->le_next) {  in zap_entry_normalization_conflict()
664 		le = ZAP_LEAF_ENTRY(zeh->zeh_leaf, chunk);  in zap_entry_normalization_conflict()
665 		if (le->le_hash != zeh->zeh_hash)  in zap_entry_normalization_conflict()
667 		if (le->le_cd == zeh->zeh_cd)  in zap_entry_normalization_conflict()
675 		    le->le_name_chunk, le->le_name_numints)) {  in zap_entry_normalization_conflict()
693 	struct zap_leaf_entry *le = ZAP_LEAF_ENTRY(l, entry);  in zap_leaf_rehash_entry()  local
702 	for (chunkp = LEAF_HASH_ENTPTR(l, le->le_hash);  in zap_leaf_rehash_entry()
705 		if (le2->le_cd > le->le_cd)  in zap_leaf_rehash_entry()
709 	le->le_next = *chunkp;  in zap_leaf_rehash_entry()
745 	struct zap_leaf_entry *le = ZAP_LEAF_ENTRY(l, entry);  in zap_leaf_transfer_entry()  local
746 	ASSERT3U(le->le_type, ==, ZAP_CHUNK_ENTRY);  in zap_leaf_transfer_entry()
750 	*nle = *le; /* structure assignment */  in zap_leaf_transfer_entry()
754 	nle->le_name_chunk = zap_leaf_transfer_array(l, le->le_name_chunk, nl);  in zap_leaf_transfer_entry()
756 	    zap_leaf_transfer_array(l, le->le_value_chunk, nl);  in zap_leaf_transfer_entry()
797 		struct zap_leaf_entry *le = ZAP_LEAF_ENTRY(l, i);  in zap_leaf_split()  local
798 		if (le->le_type != ZAP_CHUNK_ENTRY)  in zap_leaf_split()
801 		if (le->le_hash & (1ULL << bit))  in zap_leaf_split()
832 			struct zap_leaf_entry *le =  in zap_leaf_stats()  local
835 			n = 1 + ZAP_LEAF_ARRAY_NCHUNKS(le->le_name_numints) +  in zap_leaf_stats()
836 			    ZAP_LEAF_ARRAY_NCHUNKS(le->le_value_numints *  in zap_leaf_stats()
837 			    le->le_value_intlen);  in zap_leaf_stats()
841 			chunk = le->le_next;  in zap_leaf_stats()