1fa9e4066Sahrens /* 2fa9e4066Sahrens * CDDL HEADER START 3fa9e4066Sahrens * 4fa9e4066Sahrens * The contents of this file are subject to the terms of the 5f65e61c0Sahrens * Common Development and Distribution License (the "License"). 6f65e61c0Sahrens * You may not use this file except in compliance with the License. 7fa9e4066Sahrens * 8fa9e4066Sahrens * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE 9fa9e4066Sahrens * or http://www.opensolaris.org/os/licensing. 10fa9e4066Sahrens * See the License for the specific language governing permissions 11fa9e4066Sahrens * and limitations under the License. 12fa9e4066Sahrens * 13fa9e4066Sahrens * When distributing Covered Code, include this CDDL HEADER in each 14fa9e4066Sahrens * file and include the License file at usr/src/OPENSOLARIS.LICENSE. 15fa9e4066Sahrens * If applicable, add the following below this CDDL HEADER, with the 16fa9e4066Sahrens * fields enclosed by brackets "[]" replaced with your own identifying 17fa9e4066Sahrens * information: Portions Copyright [yyyy] [name of copyright owner] 18fa9e4066Sahrens * 19fa9e4066Sahrens * CDDL HEADER END 20fa9e4066Sahrens */ 21fa9e4066Sahrens /* 22*da6c28aaSamw * Copyright 2007 Sun Microsystems, Inc. All rights reserved. 23fa9e4066Sahrens * Use is subject to license terms. 24fa9e4066Sahrens */ 25fa9e4066Sahrens 26fa9e4066Sahrens #pragma ident "%Z%%M% %I% %E% SMI" 27fa9e4066Sahrens 28fa9e4066Sahrens /* 29fa9e4066Sahrens * The 512-byte leaf is broken into 32 16-byte chunks. 30fa9e4066Sahrens * chunk number n means l_chunk[n], even though the header precedes it. 31fa9e4066Sahrens * the names are stored null-terminated. 32fa9e4066Sahrens */ 33fa9e4066Sahrens 34fa9e4066Sahrens #include <sys/zfs_context.h> 35fa9e4066Sahrens #include <sys/zap.h> 36fa9e4066Sahrens #include <sys/zap_impl.h> 37fa9e4066Sahrens #include <sys/zap_leaf.h> 38fa9e4066Sahrens #include <sys/spa.h> 39fa9e4066Sahrens #include <sys/dmu.h> 40fa9e4066Sahrens 41*da6c28aaSamw static uint16_t *zap_leaf_rehash_entry(zap_leaf_t *l, uint16_t entry); 42*da6c28aaSamw 43fa9e4066Sahrens #define CHAIN_END 0xffff /* end of the chunk chain */ 44fa9e4066Sahrens 45f65e61c0Sahrens /* half the (current) minimum block size */ 46fa9e4066Sahrens #define MAX_ARRAY_BYTES (8<<10) 47fa9e4066Sahrens 48fa9e4066Sahrens #define LEAF_HASH(l, h) \ 49f65e61c0Sahrens ((ZAP_LEAF_HASH_NUMENTRIES(l)-1) & \ 5066328dd3Sahrens ((h) >> (64 - ZAP_LEAF_HASH_SHIFT(l)-(l)->l_phys->l_hdr.lh_prefix_len))) 51fa9e4066Sahrens 52fa9e4066Sahrens #define LEAF_HASH_ENTPTR(l, h) (&(l)->l_phys->l_hash[LEAF_HASH(l, h)]) 53fa9e4066Sahrens 54fa9e4066Sahrens 55fa9e4066Sahrens static void 56fa9e4066Sahrens zap_memset(void *a, int c, size_t n) 57fa9e4066Sahrens { 58fa9e4066Sahrens char *cp = a; 59fa9e4066Sahrens char *cpend = cp + n; 60fa9e4066Sahrens 61fa9e4066Sahrens while (cp < cpend) 62fa9e4066Sahrens *cp++ = c; 63fa9e4066Sahrens } 64fa9e4066Sahrens 65fa9e4066Sahrens static void 66fa9e4066Sahrens stv(int len, void *addr, uint64_t value) 67fa9e4066Sahrens { 68fa9e4066Sahrens switch (len) { 69fa9e4066Sahrens case 1: 70fa9e4066Sahrens *(uint8_t *)addr = value; 71fa9e4066Sahrens return; 72fa9e4066Sahrens case 2: 73fa9e4066Sahrens *(uint16_t *)addr = value; 74fa9e4066Sahrens return; 75fa9e4066Sahrens case 4: 76fa9e4066Sahrens *(uint32_t *)addr = value; 77fa9e4066Sahrens return; 78fa9e4066Sahrens case 8: 79fa9e4066Sahrens *(uint64_t *)addr = value; 80fa9e4066Sahrens return; 81fa9e4066Sahrens } 82fa9e4066Sahrens ASSERT(!"bad int len"); 83fa9e4066Sahrens } 84fa9e4066Sahrens 85fa9e4066Sahrens static uint64_t 86fa9e4066Sahrens ldv(int len, const void *addr) 87fa9e4066Sahrens { 88fa9e4066Sahrens switch (len) { 89fa9e4066Sahrens case 1: 90fa9e4066Sahrens return (*(uint8_t *)addr); 91fa9e4066Sahrens case 2: 92fa9e4066Sahrens return (*(uint16_t *)addr); 93fa9e4066Sahrens case 4: 94fa9e4066Sahrens return (*(uint32_t *)addr); 95fa9e4066Sahrens case 8: 96fa9e4066Sahrens return (*(uint64_t *)addr); 97fa9e4066Sahrens } 98fa9e4066Sahrens ASSERT(!"bad int len"); 995ad82045Snd return (0xFEEDFACEDEADBEEFULL); 100fa9e4066Sahrens } 101fa9e4066Sahrens 102fa9e4066Sahrens void 103f65e61c0Sahrens zap_leaf_byteswap(zap_leaf_phys_t *buf, int size) 104fa9e4066Sahrens { 105fa9e4066Sahrens int i; 106f65e61c0Sahrens zap_leaf_t l; 107f65e61c0Sahrens l.l_bs = highbit(size)-1; 108f65e61c0Sahrens l.l_phys = buf; 109fa9e4066Sahrens 11066328dd3Sahrens buf->l_hdr.lh_block_type = BSWAP_64(buf->l_hdr.lh_block_type); 11166328dd3Sahrens buf->l_hdr.lh_prefix = BSWAP_64(buf->l_hdr.lh_prefix); 11266328dd3Sahrens buf->l_hdr.lh_magic = BSWAP_32(buf->l_hdr.lh_magic); 11366328dd3Sahrens buf->l_hdr.lh_nfree = BSWAP_16(buf->l_hdr.lh_nfree); 11466328dd3Sahrens buf->l_hdr.lh_nentries = BSWAP_16(buf->l_hdr.lh_nentries); 11566328dd3Sahrens buf->l_hdr.lh_prefix_len = BSWAP_16(buf->l_hdr.lh_prefix_len); 116fa9e4066Sahrens buf->l_hdr.lh_freelist = BSWAP_16(buf->l_hdr.lh_freelist); 117fa9e4066Sahrens 118f65e61c0Sahrens for (i = 0; i < ZAP_LEAF_HASH_NUMENTRIES(&l); i++) 119fa9e4066Sahrens buf->l_hash[i] = BSWAP_16(buf->l_hash[i]); 120fa9e4066Sahrens 121f65e61c0Sahrens for (i = 0; i < ZAP_LEAF_NUMCHUNKS(&l); i++) { 122f65e61c0Sahrens zap_leaf_chunk_t *lc = &ZAP_LEAF_CHUNK(&l, i); 123fa9e4066Sahrens struct zap_leaf_entry *le; 124fa9e4066Sahrens 125f65e61c0Sahrens switch (lc->l_free.lf_type) { 126f65e61c0Sahrens case ZAP_CHUNK_ENTRY: 127f65e61c0Sahrens le = &lc->l_entry; 128fa9e4066Sahrens 12966328dd3Sahrens le->le_type = BSWAP_8(le->le_type); 13066328dd3Sahrens le->le_int_size = BSWAP_8(le->le_int_size); 13166328dd3Sahrens le->le_next = BSWAP_16(le->le_next); 13266328dd3Sahrens le->le_name_chunk = BSWAP_16(le->le_name_chunk); 13366328dd3Sahrens le->le_name_length = BSWAP_16(le->le_name_length); 13466328dd3Sahrens le->le_value_chunk = BSWAP_16(le->le_value_chunk); 13566328dd3Sahrens le->le_value_length = BSWAP_16(le->le_value_length); 13666328dd3Sahrens le->le_cd = BSWAP_32(le->le_cd); 13766328dd3Sahrens le->le_hash = BSWAP_64(le->le_hash); 138fa9e4066Sahrens break; 139f65e61c0Sahrens case ZAP_CHUNK_FREE: 14066328dd3Sahrens lc->l_free.lf_type = BSWAP_8(lc->l_free.lf_type); 14166328dd3Sahrens lc->l_free.lf_next = BSWAP_16(lc->l_free.lf_next); 142fa9e4066Sahrens break; 143f65e61c0Sahrens case ZAP_CHUNK_ARRAY: 14466328dd3Sahrens lc->l_array.la_type = BSWAP_8(lc->l_array.la_type); 14566328dd3Sahrens lc->l_array.la_next = BSWAP_16(lc->l_array.la_next); 146fa9e4066Sahrens /* la_array doesn't need swapping */ 147fa9e4066Sahrens break; 148fa9e4066Sahrens default: 149fa9e4066Sahrens ASSERT(!"bad leaf type"); 150fa9e4066Sahrens } 151fa9e4066Sahrens } 152fa9e4066Sahrens } 153fa9e4066Sahrens 154fa9e4066Sahrens void 155*da6c28aaSamw zap_leaf_init(zap_leaf_t *l, int version) 156fa9e4066Sahrens { 157fa9e4066Sahrens int i; 158fa9e4066Sahrens 159f65e61c0Sahrens l->l_bs = highbit(l->l_dbuf->db_size)-1; 160fa9e4066Sahrens zap_memset(&l->l_phys->l_hdr, 0, sizeof (struct zap_leaf_header)); 161f65e61c0Sahrens zap_memset(l->l_phys->l_hash, CHAIN_END, 2*ZAP_LEAF_HASH_NUMENTRIES(l)); 162f65e61c0Sahrens for (i = 0; i < ZAP_LEAF_NUMCHUNKS(l); i++) { 163f65e61c0Sahrens ZAP_LEAF_CHUNK(l, i).l_free.lf_type = ZAP_CHUNK_FREE; 164f65e61c0Sahrens ZAP_LEAF_CHUNK(l, i).l_free.lf_next = i+1; 165fa9e4066Sahrens } 166f65e61c0Sahrens ZAP_LEAF_CHUNK(l, ZAP_LEAF_NUMCHUNKS(l)-1).l_free.lf_next = CHAIN_END; 16766328dd3Sahrens l->l_phys->l_hdr.lh_block_type = ZBT_LEAF; 16866328dd3Sahrens l->l_phys->l_hdr.lh_magic = ZAP_LEAF_MAGIC; 16966328dd3Sahrens l->l_phys->l_hdr.lh_nfree = ZAP_LEAF_NUMCHUNKS(l); 170*da6c28aaSamw if (version >= SPA_VERSION_NORMALIZATION) 171*da6c28aaSamw l->l_phys->l_hdr.lh_flags |= ZLF_ENTRIES_CDSORTED; 172fa9e4066Sahrens } 173fa9e4066Sahrens 174fa9e4066Sahrens /* 175fa9e4066Sahrens * Routines which manipulate leaf chunks (l_chunk[]). 176fa9e4066Sahrens */ 177fa9e4066Sahrens 178fa9e4066Sahrens static uint16_t 179fa9e4066Sahrens zap_leaf_chunk_alloc(zap_leaf_t *l) 180fa9e4066Sahrens { 181fa9e4066Sahrens int chunk; 182fa9e4066Sahrens 18366328dd3Sahrens ASSERT(l->l_phys->l_hdr.lh_nfree > 0); 184fa9e4066Sahrens 185fa9e4066Sahrens chunk = l->l_phys->l_hdr.lh_freelist; 186f65e61c0Sahrens ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l)); 187f65e61c0Sahrens ASSERT3U(ZAP_LEAF_CHUNK(l, chunk).l_free.lf_type, ==, ZAP_CHUNK_FREE); 188fa9e4066Sahrens 189f65e61c0Sahrens l->l_phys->l_hdr.lh_freelist = ZAP_LEAF_CHUNK(l, chunk).l_free.lf_next; 190fa9e4066Sahrens 19166328dd3Sahrens l->l_phys->l_hdr.lh_nfree--; 192fa9e4066Sahrens 193fa9e4066Sahrens return (chunk); 194fa9e4066Sahrens } 195fa9e4066Sahrens 196fa9e4066Sahrens static void 197fa9e4066Sahrens zap_leaf_chunk_free(zap_leaf_t *l, uint16_t chunk) 198fa9e4066Sahrens { 199f65e61c0Sahrens struct zap_leaf_free *zlf = &ZAP_LEAF_CHUNK(l, chunk).l_free; 20066328dd3Sahrens ASSERT3U(l->l_phys->l_hdr.lh_nfree, <, ZAP_LEAF_NUMCHUNKS(l)); 201f65e61c0Sahrens ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l)); 202f65e61c0Sahrens ASSERT(zlf->lf_type != ZAP_CHUNK_FREE); 203fa9e4066Sahrens 204f65e61c0Sahrens zlf->lf_type = ZAP_CHUNK_FREE; 205fa9e4066Sahrens zlf->lf_next = l->l_phys->l_hdr.lh_freelist; 206fa9e4066Sahrens bzero(zlf->lf_pad, sizeof (zlf->lf_pad)); /* help it to compress */ 207fa9e4066Sahrens l->l_phys->l_hdr.lh_freelist = chunk; 208fa9e4066Sahrens 20966328dd3Sahrens l->l_phys->l_hdr.lh_nfree++; 210fa9e4066Sahrens } 211fa9e4066Sahrens 212fa9e4066Sahrens /* 213fa9e4066Sahrens * Routines which manipulate leaf arrays (zap_leaf_array type chunks). 214fa9e4066Sahrens */ 215fa9e4066Sahrens 216fa9e4066Sahrens static uint16_t 21766328dd3Sahrens zap_leaf_array_create(zap_leaf_t *l, const char *buf, 218fa9e4066Sahrens int integer_size, int num_integers) 219fa9e4066Sahrens { 220fa9e4066Sahrens uint16_t chunk_head; 221fa9e4066Sahrens uint16_t *chunkp = &chunk_head; 222fa9e4066Sahrens int byten = 0; 223fa9e4066Sahrens uint64_t value; 224fa9e4066Sahrens int shift = (integer_size-1)*8; 225fa9e4066Sahrens int len = num_integers; 226fa9e4066Sahrens 227fa9e4066Sahrens ASSERT3U(num_integers * integer_size, <, MAX_ARRAY_BYTES); 228fa9e4066Sahrens 229fa9e4066Sahrens while (len > 0) { 230fa9e4066Sahrens uint16_t chunk = zap_leaf_chunk_alloc(l); 231f65e61c0Sahrens struct zap_leaf_array *la = &ZAP_LEAF_CHUNK(l, chunk).l_array; 232fa9e4066Sahrens int i; 233fa9e4066Sahrens 234f65e61c0Sahrens la->la_type = ZAP_CHUNK_ARRAY; 235fa9e4066Sahrens for (i = 0; i < ZAP_LEAF_ARRAY_BYTES; i++) { 236fa9e4066Sahrens if (byten == 0) 237fa9e4066Sahrens value = ldv(integer_size, buf); 238c5608ce5Sahrens la->la_array[i] = value >> shift; 239fa9e4066Sahrens value <<= 8; 240fa9e4066Sahrens if (++byten == integer_size) { 241fa9e4066Sahrens byten = 0; 242fa9e4066Sahrens buf += integer_size; 243fa9e4066Sahrens if (--len == 0) 244fa9e4066Sahrens break; 245fa9e4066Sahrens } 246fa9e4066Sahrens } 247fa9e4066Sahrens 248fa9e4066Sahrens *chunkp = chunk; 249fa9e4066Sahrens chunkp = &la->la_next; 250fa9e4066Sahrens } 251fa9e4066Sahrens *chunkp = CHAIN_END; 252fa9e4066Sahrens 253fa9e4066Sahrens return (chunk_head); 254fa9e4066Sahrens } 255fa9e4066Sahrens 256fa9e4066Sahrens static void 25766328dd3Sahrens zap_leaf_array_free(zap_leaf_t *l, uint16_t *chunkp) 258fa9e4066Sahrens { 259fa9e4066Sahrens uint16_t chunk = *chunkp; 260fa9e4066Sahrens 261fa9e4066Sahrens *chunkp = CHAIN_END; 262fa9e4066Sahrens 263fa9e4066Sahrens while (chunk != CHAIN_END) { 264f65e61c0Sahrens int nextchunk = ZAP_LEAF_CHUNK(l, chunk).l_array.la_next; 265f65e61c0Sahrens ASSERT3U(ZAP_LEAF_CHUNK(l, chunk).l_array.la_type, ==, 266f65e61c0Sahrens ZAP_CHUNK_ARRAY); 267fa9e4066Sahrens zap_leaf_chunk_free(l, chunk); 268fa9e4066Sahrens chunk = nextchunk; 269fa9e4066Sahrens } 270fa9e4066Sahrens } 271fa9e4066Sahrens 272fa9e4066Sahrens /* array_len and buf_len are in integers, not bytes */ 273fa9e4066Sahrens static void 27466328dd3Sahrens zap_leaf_array_read(zap_leaf_t *l, uint16_t chunk, 275fa9e4066Sahrens int array_int_len, int array_len, int buf_int_len, uint64_t buf_len, 276fa9e4066Sahrens char *buf) 277fa9e4066Sahrens { 278fa9e4066Sahrens int len = MIN(array_len, buf_len); 279fa9e4066Sahrens int byten = 0; 280fa9e4066Sahrens uint64_t value = 0; 281fa9e4066Sahrens 282fa9e4066Sahrens ASSERT3U(array_int_len, <=, buf_int_len); 283fa9e4066Sahrens 28487e5029aSahrens /* Fast path for one 8-byte integer */ 28587e5029aSahrens if (array_int_len == 8 && buf_int_len == 8 && len == 1) { 286f65e61c0Sahrens struct zap_leaf_array *la = &ZAP_LEAF_CHUNK(l, chunk).l_array; 2879621b9b1Sbonwick uint8_t *ip = la->la_array; 28887e5029aSahrens uint64_t *buf64 = (uint64_t *)buf; 2899621b9b1Sbonwick 2909621b9b1Sbonwick *buf64 = (uint64_t)ip[0] << 56 | (uint64_t)ip[1] << 48 | 2919621b9b1Sbonwick (uint64_t)ip[2] << 40 | (uint64_t)ip[3] << 32 | 2929621b9b1Sbonwick (uint64_t)ip[4] << 24 | (uint64_t)ip[5] << 16 | 2939621b9b1Sbonwick (uint64_t)ip[6] << 8 | (uint64_t)ip[7]; 29487e5029aSahrens return; 29587e5029aSahrens } 29687e5029aSahrens 29787e5029aSahrens /* Fast path for an array of 1-byte integers (eg. the entry name) */ 29887e5029aSahrens if (array_int_len == 1 && buf_int_len == 1 && 29987e5029aSahrens buf_len > array_len + ZAP_LEAF_ARRAY_BYTES) { 30087e5029aSahrens while (chunk != CHAIN_END) { 30187e5029aSahrens struct zap_leaf_array *la = 302f65e61c0Sahrens &ZAP_LEAF_CHUNK(l, chunk).l_array; 30387e5029aSahrens bcopy(la->la_array, buf, ZAP_LEAF_ARRAY_BYTES); 30487e5029aSahrens buf += ZAP_LEAF_ARRAY_BYTES; 30587e5029aSahrens chunk = la->la_next; 30687e5029aSahrens } 30787e5029aSahrens return; 30887e5029aSahrens } 30987e5029aSahrens 310fa9e4066Sahrens while (len > 0) { 311f65e61c0Sahrens struct zap_leaf_array *la = &ZAP_LEAF_CHUNK(l, chunk).l_array; 312fa9e4066Sahrens int i; 313fa9e4066Sahrens 314f65e61c0Sahrens ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l)); 315fa9e4066Sahrens for (i = 0; i < ZAP_LEAF_ARRAY_BYTES && len > 0; i++) { 316fa9e4066Sahrens value = (value << 8) | la->la_array[i]; 317fa9e4066Sahrens byten++; 318fa9e4066Sahrens if (byten == array_int_len) { 319fa9e4066Sahrens stv(buf_int_len, buf, value); 320fa9e4066Sahrens byten = 0; 321fa9e4066Sahrens len--; 322fa9e4066Sahrens if (len == 0) 323fa9e4066Sahrens return; 324fa9e4066Sahrens buf += buf_int_len; 325fa9e4066Sahrens } 326fa9e4066Sahrens } 327fa9e4066Sahrens chunk = la->la_next; 328fa9e4066Sahrens } 329fa9e4066Sahrens } 330fa9e4066Sahrens 331fa9e4066Sahrens /* 332fa9e4066Sahrens * Only to be used on 8-bit arrays. 333fa9e4066Sahrens * array_len is actual len in bytes (not encoded le_value_length). 334*da6c28aaSamw * namenorm is null-terminated. 335fa9e4066Sahrens */ 336*da6c28aaSamw static boolean_t 337*da6c28aaSamw zap_leaf_array_match(zap_leaf_t *l, zap_name_t *zn, int chunk, int array_len) 338fa9e4066Sahrens { 339fa9e4066Sahrens int bseen = 0; 340fa9e4066Sahrens 341*da6c28aaSamw if (zn->zn_matchtype == MT_FIRST) { 342*da6c28aaSamw char *thisname = kmem_alloc(array_len, KM_SLEEP); 343*da6c28aaSamw boolean_t match; 344*da6c28aaSamw 345*da6c28aaSamw zap_leaf_array_read(l, chunk, 1, array_len, 1, 346*da6c28aaSamw array_len, thisname); 347*da6c28aaSamw match = zap_match(zn, thisname); 348*da6c28aaSamw kmem_free(thisname, array_len); 349*da6c28aaSamw return (match); 350*da6c28aaSamw } 351*da6c28aaSamw 352*da6c28aaSamw /* Fast path for exact matching */ 353fa9e4066Sahrens while (bseen < array_len) { 354f65e61c0Sahrens struct zap_leaf_array *la = &ZAP_LEAF_CHUNK(l, chunk).l_array; 355fa9e4066Sahrens int toread = MIN(array_len - bseen, ZAP_LEAF_ARRAY_BYTES); 356f65e61c0Sahrens ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l)); 357*da6c28aaSamw if (bcmp(la->la_array, zn->zn_name_orij + bseen, toread)) 358fa9e4066Sahrens break; 359fa9e4066Sahrens chunk = la->la_next; 360fa9e4066Sahrens bseen += toread; 361fa9e4066Sahrens } 362fa9e4066Sahrens return (bseen == array_len); 363fa9e4066Sahrens } 364fa9e4066Sahrens 365fa9e4066Sahrens /* 366fa9e4066Sahrens * Routines which manipulate leaf entries. 367fa9e4066Sahrens */ 368fa9e4066Sahrens 369fa9e4066Sahrens int 370*da6c28aaSamw zap_leaf_lookup(zap_leaf_t *l, zap_name_t *zn, zap_entry_handle_t *zeh) 371fa9e4066Sahrens { 372fa9e4066Sahrens uint16_t *chunkp; 373fa9e4066Sahrens struct zap_leaf_entry *le; 374fa9e4066Sahrens 37566328dd3Sahrens ASSERT3U(l->l_phys->l_hdr.lh_magic, ==, ZAP_LEAF_MAGIC); 376fa9e4066Sahrens 377*da6c28aaSamw again: 378*da6c28aaSamw for (chunkp = LEAF_HASH_ENTPTR(l, zn->zn_hash); 379fa9e4066Sahrens *chunkp != CHAIN_END; chunkp = &le->le_next) { 380fa9e4066Sahrens uint16_t chunk = *chunkp; 381f65e61c0Sahrens le = ZAP_LEAF_ENTRY(l, chunk); 382fa9e4066Sahrens 383f65e61c0Sahrens ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l)); 384f65e61c0Sahrens ASSERT3U(le->le_type, ==, ZAP_CHUNK_ENTRY); 385fa9e4066Sahrens 386*da6c28aaSamw if (le->le_hash != zn->zn_hash) 387fa9e4066Sahrens continue; 388fa9e4066Sahrens 389*da6c28aaSamw /* 390*da6c28aaSamw * NB: the entry chain is always sorted by cd on 391*da6c28aaSamw * normalized zap objects, so this will find the 392*da6c28aaSamw * lowest-cd match for MT_FIRST. 393*da6c28aaSamw */ 394*da6c28aaSamw ASSERT(zn->zn_matchtype == MT_EXACT || 395*da6c28aaSamw (l->l_phys->l_hdr.lh_flags & ZLF_ENTRIES_CDSORTED)); 396*da6c28aaSamw if (zap_leaf_array_match(l, zn, le->le_name_chunk, 397*da6c28aaSamw le->le_name_length)) { 398fa9e4066Sahrens zeh->zeh_num_integers = le->le_value_length; 399fa9e4066Sahrens zeh->zeh_integer_size = le->le_int_size; 400fa9e4066Sahrens zeh->zeh_cd = le->le_cd; 401fa9e4066Sahrens zeh->zeh_hash = le->le_hash; 402fa9e4066Sahrens zeh->zeh_chunkp = chunkp; 40366328dd3Sahrens zeh->zeh_leaf = l; 404fa9e4066Sahrens return (0); 405fa9e4066Sahrens } 406fa9e4066Sahrens } 407fa9e4066Sahrens 408*da6c28aaSamw /* 409*da6c28aaSamw * NB: we could of course do this in one pass, but that would be 410*da6c28aaSamw * a pain. We'll see if MT_BEST is even used much. 411*da6c28aaSamw */ 412*da6c28aaSamw if (zn->zn_matchtype == MT_BEST) { 413*da6c28aaSamw zn->zn_matchtype = MT_FIRST; 414*da6c28aaSamw goto again; 415*da6c28aaSamw } 416*da6c28aaSamw 417fa9e4066Sahrens return (ENOENT); 418fa9e4066Sahrens } 419fa9e4066Sahrens 420fa9e4066Sahrens /* Return (h1,cd1 >= h2,cd2) */ 42187e5029aSahrens #define HCD_GTEQ(h1, cd1, h2, cd2) \ 42287e5029aSahrens ((h1 > h2) ? TRUE : ((h1 == h2 && cd1 >= cd2) ? TRUE : FALSE)) 423fa9e4066Sahrens 424fa9e4066Sahrens int 425fa9e4066Sahrens zap_leaf_lookup_closest(zap_leaf_t *l, 426fa9e4066Sahrens uint64_t h, uint32_t cd, zap_entry_handle_t *zeh) 427fa9e4066Sahrens { 428fa9e4066Sahrens uint16_t chunk; 429fa9e4066Sahrens uint64_t besth = -1ULL; 430fa9e4066Sahrens uint32_t bestcd = ZAP_MAXCD; 431f65e61c0Sahrens uint16_t bestlh = ZAP_LEAF_HASH_NUMENTRIES(l)-1; 432fa9e4066Sahrens uint16_t lh; 433fa9e4066Sahrens struct zap_leaf_entry *le; 434fa9e4066Sahrens 43566328dd3Sahrens ASSERT3U(l->l_phys->l_hdr.lh_magic, ==, ZAP_LEAF_MAGIC); 436fa9e4066Sahrens 437fa9e4066Sahrens for (lh = LEAF_HASH(l, h); lh <= bestlh; lh++) { 438fa9e4066Sahrens for (chunk = l->l_phys->l_hash[lh]; 439fa9e4066Sahrens chunk != CHAIN_END; chunk = le->le_next) { 440f65e61c0Sahrens le = ZAP_LEAF_ENTRY(l, chunk); 441fa9e4066Sahrens 442f65e61c0Sahrens ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l)); 443f65e61c0Sahrens ASSERT3U(le->le_type, ==, ZAP_CHUNK_ENTRY); 444fa9e4066Sahrens 44587e5029aSahrens if (HCD_GTEQ(le->le_hash, le->le_cd, h, cd) && 44687e5029aSahrens HCD_GTEQ(besth, bestcd, le->le_hash, le->le_cd)) { 447fa9e4066Sahrens ASSERT3U(bestlh, >=, lh); 448fa9e4066Sahrens bestlh = lh; 449fa9e4066Sahrens besth = le->le_hash; 450fa9e4066Sahrens bestcd = le->le_cd; 451fa9e4066Sahrens 452fa9e4066Sahrens zeh->zeh_num_integers = le->le_value_length; 453fa9e4066Sahrens zeh->zeh_integer_size = le->le_int_size; 454fa9e4066Sahrens zeh->zeh_cd = le->le_cd; 455fa9e4066Sahrens zeh->zeh_hash = le->le_hash; 456fa9e4066Sahrens zeh->zeh_fakechunk = chunk; 457fa9e4066Sahrens zeh->zeh_chunkp = &zeh->zeh_fakechunk; 45866328dd3Sahrens zeh->zeh_leaf = l; 459fa9e4066Sahrens } 460fa9e4066Sahrens } 461fa9e4066Sahrens } 462fa9e4066Sahrens 463fa9e4066Sahrens return (bestcd == ZAP_MAXCD ? ENOENT : 0); 464fa9e4066Sahrens } 465fa9e4066Sahrens 466fa9e4066Sahrens int 467fa9e4066Sahrens zap_entry_read(const zap_entry_handle_t *zeh, 468fa9e4066Sahrens uint8_t integer_size, uint64_t num_integers, void *buf) 469fa9e4066Sahrens { 470f65e61c0Sahrens struct zap_leaf_entry *le = 47166328dd3Sahrens ZAP_LEAF_ENTRY(zeh->zeh_leaf, *zeh->zeh_chunkp); 472f65e61c0Sahrens ASSERT3U(le->le_type, ==, ZAP_CHUNK_ENTRY); 473fa9e4066Sahrens 474fa9e4066Sahrens if (le->le_int_size > integer_size) 475fa9e4066Sahrens return (EINVAL); 476fa9e4066Sahrens 47766328dd3Sahrens zap_leaf_array_read(zeh->zeh_leaf, le->le_value_chunk, le->le_int_size, 478fa9e4066Sahrens le->le_value_length, integer_size, num_integers, buf); 479fa9e4066Sahrens 480fa9e4066Sahrens if (zeh->zeh_num_integers > num_integers) 481fa9e4066Sahrens return (EOVERFLOW); 482fa9e4066Sahrens return (0); 483fa9e4066Sahrens 484fa9e4066Sahrens } 485fa9e4066Sahrens 486fa9e4066Sahrens int 487fa9e4066Sahrens zap_entry_read_name(const zap_entry_handle_t *zeh, uint16_t buflen, char *buf) 488fa9e4066Sahrens { 489f65e61c0Sahrens struct zap_leaf_entry *le = 49066328dd3Sahrens ZAP_LEAF_ENTRY(zeh->zeh_leaf, *zeh->zeh_chunkp); 491f65e61c0Sahrens ASSERT3U(le->le_type, ==, ZAP_CHUNK_ENTRY); 492fa9e4066Sahrens 49366328dd3Sahrens zap_leaf_array_read(zeh->zeh_leaf, le->le_name_chunk, 1, 494fa9e4066Sahrens le->le_name_length, 1, buflen, buf); 495fa9e4066Sahrens if (le->le_name_length > buflen) 496fa9e4066Sahrens return (EOVERFLOW); 497fa9e4066Sahrens return (0); 498fa9e4066Sahrens } 499fa9e4066Sahrens 500fa9e4066Sahrens int 501fa9e4066Sahrens zap_entry_update(zap_entry_handle_t *zeh, 502fa9e4066Sahrens uint8_t integer_size, uint64_t num_integers, const void *buf) 503fa9e4066Sahrens { 504fa9e4066Sahrens int delta_chunks; 50566328dd3Sahrens zap_leaf_t *l = zeh->zeh_leaf; 50666328dd3Sahrens struct zap_leaf_entry *le = ZAP_LEAF_ENTRY(l, *zeh->zeh_chunkp); 507fa9e4066Sahrens 50866328dd3Sahrens delta_chunks = ZAP_LEAF_ARRAY_NCHUNKS(num_integers * integer_size) - 50966328dd3Sahrens ZAP_LEAF_ARRAY_NCHUNKS(le->le_value_length * le->le_int_size); 510fa9e4066Sahrens 51166328dd3Sahrens if ((int)l->l_phys->l_hdr.lh_nfree < delta_chunks) 512fa9e4066Sahrens return (EAGAIN); 513fa9e4066Sahrens 514fa9e4066Sahrens /* 515fa9e4066Sahrens * We should search other chained leaves (via 516fa9e4066Sahrens * zap_entry_remove,create?) otherwise returning EAGAIN will 517fa9e4066Sahrens * just send us into an infinite loop if we have to chain 518fa9e4066Sahrens * another leaf block, rather than being able to split this 519fa9e4066Sahrens * block. 520fa9e4066Sahrens */ 521fa9e4066Sahrens 52266328dd3Sahrens zap_leaf_array_free(l, &le->le_value_chunk); 523fa9e4066Sahrens le->le_value_chunk = 52466328dd3Sahrens zap_leaf_array_create(l, buf, integer_size, num_integers); 525f65e61c0Sahrens le->le_value_length = num_integers; 526fa9e4066Sahrens le->le_int_size = integer_size; 527fa9e4066Sahrens return (0); 528fa9e4066Sahrens } 529fa9e4066Sahrens 530fa9e4066Sahrens void 531fa9e4066Sahrens zap_entry_remove(zap_entry_handle_t *zeh) 532fa9e4066Sahrens { 533fa9e4066Sahrens uint16_t entry_chunk; 534fa9e4066Sahrens struct zap_leaf_entry *le; 53566328dd3Sahrens zap_leaf_t *l = zeh->zeh_leaf; 536fa9e4066Sahrens 537fa9e4066Sahrens ASSERT3P(zeh->zeh_chunkp, !=, &zeh->zeh_fakechunk); 538fa9e4066Sahrens 539fa9e4066Sahrens entry_chunk = *zeh->zeh_chunkp; 540f65e61c0Sahrens le = ZAP_LEAF_ENTRY(l, entry_chunk); 541f65e61c0Sahrens ASSERT3U(le->le_type, ==, ZAP_CHUNK_ENTRY); 542fa9e4066Sahrens 54366328dd3Sahrens zap_leaf_array_free(l, &le->le_name_chunk); 54466328dd3Sahrens zap_leaf_array_free(l, &le->le_value_chunk); 545fa9e4066Sahrens 546fa9e4066Sahrens *zeh->zeh_chunkp = le->le_next; 547fa9e4066Sahrens zap_leaf_chunk_free(l, entry_chunk); 548fa9e4066Sahrens 54966328dd3Sahrens l->l_phys->l_hdr.lh_nentries--; 550fa9e4066Sahrens } 551fa9e4066Sahrens 552fa9e4066Sahrens int 553fa9e4066Sahrens zap_entry_create(zap_leaf_t *l, const char *name, uint64_t h, uint32_t cd, 554fa9e4066Sahrens uint8_t integer_size, uint64_t num_integers, const void *buf, 555fa9e4066Sahrens zap_entry_handle_t *zeh) 556fa9e4066Sahrens { 557fa9e4066Sahrens uint16_t chunk; 558fa9e4066Sahrens uint16_t *chunkp; 559fa9e4066Sahrens struct zap_leaf_entry *le; 560fa9e4066Sahrens uint64_t namelen, valuelen; 561fa9e4066Sahrens int numchunks; 562fa9e4066Sahrens 563fa9e4066Sahrens valuelen = integer_size * num_integers; 564fa9e4066Sahrens namelen = strlen(name) + 1; 565fa9e4066Sahrens ASSERT(namelen >= 2); 566fa9e4066Sahrens 56766328dd3Sahrens numchunks = 1 + ZAP_LEAF_ARRAY_NCHUNKS(namelen) + 56866328dd3Sahrens ZAP_LEAF_ARRAY_NCHUNKS(valuelen); 569f65e61c0Sahrens if (numchunks > ZAP_LEAF_NUMCHUNKS(l)) 570fa9e4066Sahrens return (E2BIG); 571fa9e4066Sahrens 572fa9e4066Sahrens if (cd == ZAP_MAXCD) { 573*da6c28aaSamw /* find the lowest unused cd */ 574*da6c28aaSamw if (l->l_phys->l_hdr.lh_flags & ZLF_ENTRIES_CDSORTED) { 575*da6c28aaSamw cd = 0; 576*da6c28aaSamw 57766328dd3Sahrens for (chunk = *LEAF_HASH_ENTPTR(l, h); 57866328dd3Sahrens chunk != CHAIN_END; chunk = le->le_next) { 57966328dd3Sahrens le = ZAP_LEAF_ENTRY(l, chunk); 580*da6c28aaSamw if (le->le_cd > cd) 581fa9e4066Sahrens break; 582*da6c28aaSamw if (le->le_hash == h) { 583*da6c28aaSamw ASSERT3U(cd, ==, le->le_cd); 584*da6c28aaSamw cd++; 58566328dd3Sahrens } 586fa9e4066Sahrens } 587*da6c28aaSamw } else { 588*da6c28aaSamw /* old unsorted format; do it the O(n^2) way */ 589*da6c28aaSamw for (cd = 0; cd < ZAP_MAXCD; cd++) { 590*da6c28aaSamw for (chunk = *LEAF_HASH_ENTPTR(l, h); 591*da6c28aaSamw chunk != CHAIN_END; chunk = le->le_next) { 592*da6c28aaSamw le = ZAP_LEAF_ENTRY(l, chunk); 593*da6c28aaSamw if (le->le_hash == h && 594*da6c28aaSamw le->le_cd == cd) { 595*da6c28aaSamw break; 596*da6c28aaSamw } 597*da6c28aaSamw } 598*da6c28aaSamw /* If this cd is not in use, we are good. */ 599*da6c28aaSamw if (chunk == CHAIN_END) 600*da6c28aaSamw break; 601*da6c28aaSamw } 602fa9e4066Sahrens } 603*da6c28aaSamw /* 604*da6c28aaSamw * we would run out of space in a block before we could 605*da6c28aaSamw * have ZAP_MAXCD entries 606*da6c28aaSamw */ 607*da6c28aaSamw ASSERT3U(cd, <, ZAP_MAXCD); 608fa9e4066Sahrens } 609fa9e4066Sahrens 61066328dd3Sahrens if (l->l_phys->l_hdr.lh_nfree < numchunks) 611fa9e4066Sahrens return (EAGAIN); 612fa9e4066Sahrens 613fa9e4066Sahrens /* make the entry */ 614fa9e4066Sahrens chunk = zap_leaf_chunk_alloc(l); 615f65e61c0Sahrens le = ZAP_LEAF_ENTRY(l, chunk); 616f65e61c0Sahrens le->le_type = ZAP_CHUNK_ENTRY; 61766328dd3Sahrens le->le_name_chunk = zap_leaf_array_create(l, name, 1, namelen); 618fa9e4066Sahrens le->le_name_length = namelen; 619fa9e4066Sahrens le->le_value_chunk = 62066328dd3Sahrens zap_leaf_array_create(l, buf, integer_size, num_integers); 621f65e61c0Sahrens le->le_value_length = num_integers; 622fa9e4066Sahrens le->le_int_size = integer_size; 623fa9e4066Sahrens le->le_hash = h; 624fa9e4066Sahrens le->le_cd = cd; 625fa9e4066Sahrens 626fa9e4066Sahrens /* link it into the hash chain */ 627*da6c28aaSamw /* XXX if we did the search above, we could just use that */ 628*da6c28aaSamw chunkp = zap_leaf_rehash_entry(l, chunk); 629fa9e4066Sahrens 63066328dd3Sahrens l->l_phys->l_hdr.lh_nentries++; 631fa9e4066Sahrens 63266328dd3Sahrens zeh->zeh_leaf = l; 633fa9e4066Sahrens zeh->zeh_num_integers = num_integers; 634fa9e4066Sahrens zeh->zeh_integer_size = le->le_int_size; 635fa9e4066Sahrens zeh->zeh_cd = le->le_cd; 636fa9e4066Sahrens zeh->zeh_hash = le->le_hash; 637fa9e4066Sahrens zeh->zeh_chunkp = chunkp; 638fa9e4066Sahrens 639fa9e4066Sahrens return (0); 640fa9e4066Sahrens } 641fa9e4066Sahrens 642*da6c28aaSamw /* 643*da6c28aaSamw * Determine if there is another entry with the same normalized form. 644*da6c28aaSamw * For performance purposes, either zn or name must be provided (the 645*da6c28aaSamw * other can be NULL). Note, there usually won't be any hash 646*da6c28aaSamw * conflicts, in which case we don't need the concatenated/normalized 647*da6c28aaSamw * form of the name. But all callers have one of these on hand anyway, 648*da6c28aaSamw * so might as well take advantage. A cleaner but slower interface 649*da6c28aaSamw * would accept neither argument, and compute the normalized name as 650*da6c28aaSamw * needed (using zap_name_alloc(zap_entry_read_name(zeh))). 651*da6c28aaSamw */ 652*da6c28aaSamw boolean_t 653*da6c28aaSamw zap_entry_normalization_conflict(zap_entry_handle_t *zeh, zap_name_t *zn, 654*da6c28aaSamw const char *name, zap_t *zap) 655*da6c28aaSamw { 656*da6c28aaSamw uint64_t chunk; 657*da6c28aaSamw struct zap_leaf_entry *le; 658*da6c28aaSamw boolean_t allocdzn = B_FALSE; 659*da6c28aaSamw 660*da6c28aaSamw if (zap->zap_normflags == 0) 661*da6c28aaSamw return (B_FALSE); 662*da6c28aaSamw 663*da6c28aaSamw for (chunk = *LEAF_HASH_ENTPTR(zeh->zeh_leaf, zeh->zeh_hash); 664*da6c28aaSamw chunk != CHAIN_END; chunk = le->le_next) { 665*da6c28aaSamw le = ZAP_LEAF_ENTRY(zeh->zeh_leaf, chunk); 666*da6c28aaSamw if (le->le_hash != zeh->zeh_hash) 667*da6c28aaSamw continue; 668*da6c28aaSamw if (le->le_cd == zeh->zeh_cd) 669*da6c28aaSamw continue; 670*da6c28aaSamw 671*da6c28aaSamw if (zn == NULL) { 672*da6c28aaSamw zn = zap_name_alloc(zap, name, MT_FIRST); 673*da6c28aaSamw allocdzn = B_TRUE; 674*da6c28aaSamw } 675*da6c28aaSamw if (zap_leaf_array_match(zeh->zeh_leaf, zn, 676*da6c28aaSamw le->le_name_chunk, le->le_name_length)) { 677*da6c28aaSamw if (allocdzn) 678*da6c28aaSamw zap_name_free(zn); 679*da6c28aaSamw return (B_TRUE); 680*da6c28aaSamw } 681*da6c28aaSamw } 682*da6c28aaSamw if (allocdzn) 683*da6c28aaSamw zap_name_free(zn); 684*da6c28aaSamw return (B_FALSE); 685*da6c28aaSamw } 686*da6c28aaSamw 687fa9e4066Sahrens /* 688fa9e4066Sahrens * Routines for transferring entries between leafs. 689fa9e4066Sahrens */ 690fa9e4066Sahrens 691*da6c28aaSamw static uint16_t * 692fa9e4066Sahrens zap_leaf_rehash_entry(zap_leaf_t *l, uint16_t entry) 693fa9e4066Sahrens { 694f65e61c0Sahrens struct zap_leaf_entry *le = ZAP_LEAF_ENTRY(l, entry); 695*da6c28aaSamw struct zap_leaf_entry *le2; 696*da6c28aaSamw uint16_t *chunkp; 697*da6c28aaSamw 698*da6c28aaSamw /* 699*da6c28aaSamw * keep the entry chain sorted by cd 700*da6c28aaSamw * NB: this will not cause problems for unsorted leafs, though 701*da6c28aaSamw * it is unnecessary there. 702*da6c28aaSamw */ 703*da6c28aaSamw for (chunkp = LEAF_HASH_ENTPTR(l, le->le_hash); 704*da6c28aaSamw *chunkp != CHAIN_END; chunkp = &le2->le_next) { 705*da6c28aaSamw le2 = ZAP_LEAF_ENTRY(l, *chunkp); 706*da6c28aaSamw if (le2->le_cd > le->le_cd) 707*da6c28aaSamw break; 708*da6c28aaSamw } 709*da6c28aaSamw 710*da6c28aaSamw le->le_next = *chunkp; 711*da6c28aaSamw *chunkp = entry; 712*da6c28aaSamw return (chunkp); 713fa9e4066Sahrens } 714fa9e4066Sahrens 715fa9e4066Sahrens static uint16_t 716fa9e4066Sahrens zap_leaf_transfer_array(zap_leaf_t *l, uint16_t chunk, zap_leaf_t *nl) 717fa9e4066Sahrens { 718fa9e4066Sahrens uint16_t new_chunk; 719fa9e4066Sahrens uint16_t *nchunkp = &new_chunk; 720fa9e4066Sahrens 721fa9e4066Sahrens while (chunk != CHAIN_END) { 722fa9e4066Sahrens uint16_t nchunk = zap_leaf_chunk_alloc(nl); 723fa9e4066Sahrens struct zap_leaf_array *nla = 724f65e61c0Sahrens &ZAP_LEAF_CHUNK(nl, nchunk).l_array; 725fa9e4066Sahrens struct zap_leaf_array *la = 726f65e61c0Sahrens &ZAP_LEAF_CHUNK(l, chunk).l_array; 727fa9e4066Sahrens int nextchunk = la->la_next; 728fa9e4066Sahrens 729f65e61c0Sahrens ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l)); 730f65e61c0Sahrens ASSERT3U(nchunk, <, ZAP_LEAF_NUMCHUNKS(l)); 731fa9e4066Sahrens 73266328dd3Sahrens *nla = *la; /* structure assignment */ 733fa9e4066Sahrens 734fa9e4066Sahrens zap_leaf_chunk_free(l, chunk); 735fa9e4066Sahrens chunk = nextchunk; 736fa9e4066Sahrens *nchunkp = nchunk; 737fa9e4066Sahrens nchunkp = &nla->la_next; 738fa9e4066Sahrens } 739fa9e4066Sahrens *nchunkp = CHAIN_END; 740fa9e4066Sahrens return (new_chunk); 741fa9e4066Sahrens } 742fa9e4066Sahrens 743fa9e4066Sahrens static void 74466328dd3Sahrens zap_leaf_transfer_entry(zap_leaf_t *l, int entry, zap_leaf_t *nl) 745fa9e4066Sahrens { 746fa9e4066Sahrens struct zap_leaf_entry *le, *nle; 74766328dd3Sahrens uint16_t chunk; 748fa9e4066Sahrens 749f65e61c0Sahrens le = ZAP_LEAF_ENTRY(l, entry); 750f65e61c0Sahrens ASSERT3U(le->le_type, ==, ZAP_CHUNK_ENTRY); 751fa9e4066Sahrens 752fa9e4066Sahrens chunk = zap_leaf_chunk_alloc(nl); 753f65e61c0Sahrens nle = ZAP_LEAF_ENTRY(nl, chunk); 75466328dd3Sahrens *nle = *le; /* structure assignment */ 755fa9e4066Sahrens 756*da6c28aaSamw (void) zap_leaf_rehash_entry(nl, chunk); 757fa9e4066Sahrens 758fa9e4066Sahrens nle->le_name_chunk = zap_leaf_transfer_array(l, le->le_name_chunk, nl); 759fa9e4066Sahrens nle->le_value_chunk = 760fa9e4066Sahrens zap_leaf_transfer_array(l, le->le_value_chunk, nl); 761fa9e4066Sahrens 762fa9e4066Sahrens zap_leaf_chunk_free(l, entry); 763fa9e4066Sahrens 76466328dd3Sahrens l->l_phys->l_hdr.lh_nentries--; 76566328dd3Sahrens nl->l_phys->l_hdr.lh_nentries++; 766fa9e4066Sahrens } 767fa9e4066Sahrens 768fa9e4066Sahrens /* 76966328dd3Sahrens * Transfer the entries whose hash prefix ends in 1 to the new leaf. 770fa9e4066Sahrens */ 77166328dd3Sahrens void 772*da6c28aaSamw zap_leaf_split(zap_leaf_t *l, zap_leaf_t *nl, int version) 773fa9e4066Sahrens { 774fa9e4066Sahrens int i; 77566328dd3Sahrens int bit = 64 - 1 - l->l_phys->l_hdr.lh_prefix_len; 77666328dd3Sahrens 77766328dd3Sahrens /* set new prefix and prefix_len */ 77866328dd3Sahrens l->l_phys->l_hdr.lh_prefix <<= 1; 77966328dd3Sahrens l->l_phys->l_hdr.lh_prefix_len++; 78066328dd3Sahrens nl->l_phys->l_hdr.lh_prefix = l->l_phys->l_hdr.lh_prefix | 1; 78166328dd3Sahrens nl->l_phys->l_hdr.lh_prefix_len = l->l_phys->l_hdr.lh_prefix_len; 782fa9e4066Sahrens 783fa9e4066Sahrens /* break existing hash chains */ 784f65e61c0Sahrens zap_memset(l->l_phys->l_hash, CHAIN_END, 2*ZAP_LEAF_HASH_NUMENTRIES(l)); 785fa9e4066Sahrens 786*da6c28aaSamw if (version >= SPA_VERSION_NORMALIZATION) 787*da6c28aaSamw l->l_phys->l_hdr.lh_flags |= ZLF_ENTRIES_CDSORTED; 788*da6c28aaSamw 78966328dd3Sahrens /* 79066328dd3Sahrens * Transfer entries whose hash bit 'bit' is set to nl; rehash 79166328dd3Sahrens * the remaining entries 79266328dd3Sahrens * 79366328dd3Sahrens * NB: We could find entries via the hashtable instead. That 79466328dd3Sahrens * would be O(hashents+numents) rather than O(numblks+numents), 79566328dd3Sahrens * but this accesses memory more sequentially, and when we're 79666328dd3Sahrens * called, the block is usually pretty full. 79766328dd3Sahrens */ 798f65e61c0Sahrens for (i = 0; i < ZAP_LEAF_NUMCHUNKS(l); i++) { 799f65e61c0Sahrens struct zap_leaf_entry *le = ZAP_LEAF_ENTRY(l, i); 800f65e61c0Sahrens if (le->le_type != ZAP_CHUNK_ENTRY) 801fa9e4066Sahrens continue; 802fa9e4066Sahrens 80366328dd3Sahrens if (le->le_hash & (1ULL << bit)) 80466328dd3Sahrens zap_leaf_transfer_entry(l, i, nl); 80566328dd3Sahrens else 806*da6c28aaSamw (void) zap_leaf_rehash_entry(l, i); 807fa9e4066Sahrens } 808fa9e4066Sahrens } 809fa9e4066Sahrens 810fa9e4066Sahrens void 81166328dd3Sahrens zap_leaf_stats(zap_t *zap, zap_leaf_t *l, zap_stats_t *zs) 812fa9e4066Sahrens { 81366328dd3Sahrens int i, n; 814fa9e4066Sahrens 81566328dd3Sahrens n = zap->zap_f.zap_phys->zap_ptrtbl.zt_shift - 81666328dd3Sahrens l->l_phys->l_hdr.lh_prefix_len; 817fa9e4066Sahrens n = MIN(n, ZAP_HISTOGRAM_SIZE-1); 818fa9e4066Sahrens zs->zs_leafs_with_2n_pointers[n]++; 819fa9e4066Sahrens 820fa9e4066Sahrens 82166328dd3Sahrens n = l->l_phys->l_hdr.lh_nentries/5; 82266328dd3Sahrens n = MIN(n, ZAP_HISTOGRAM_SIZE-1); 82366328dd3Sahrens zs->zs_blocks_with_n5_entries[n]++; 824fa9e4066Sahrens 82566328dd3Sahrens n = ((1<<FZAP_BLOCK_SHIFT(zap)) - 82666328dd3Sahrens l->l_phys->l_hdr.lh_nfree * (ZAP_LEAF_ARRAY_BYTES+1))*10 / 82766328dd3Sahrens (1<<FZAP_BLOCK_SHIFT(zap)); 82866328dd3Sahrens n = MIN(n, ZAP_HISTOGRAM_SIZE-1); 82966328dd3Sahrens zs->zs_blocks_n_tenths_full[n]++; 830fa9e4066Sahrens 83166328dd3Sahrens for (i = 0; i < ZAP_LEAF_HASH_NUMENTRIES(l); i++) { 83266328dd3Sahrens int nentries = 0; 83366328dd3Sahrens int chunk = l->l_phys->l_hash[i]; 834fa9e4066Sahrens 83566328dd3Sahrens while (chunk != CHAIN_END) { 83666328dd3Sahrens struct zap_leaf_entry *le = 83766328dd3Sahrens ZAP_LEAF_ENTRY(l, chunk); 838fa9e4066Sahrens 83966328dd3Sahrens n = 1 + ZAP_LEAF_ARRAY_NCHUNKS(le->le_name_length) + 84066328dd3Sahrens ZAP_LEAF_ARRAY_NCHUNKS(le->le_value_length * 84166328dd3Sahrens le->le_int_size); 842fa9e4066Sahrens n = MIN(n, ZAP_HISTOGRAM_SIZE-1); 84366328dd3Sahrens zs->zs_entries_using_n_chunks[n]++; 844fa9e4066Sahrens 84566328dd3Sahrens chunk = le->le_next; 84666328dd3Sahrens nentries++; 84766328dd3Sahrens } 848fa9e4066Sahrens 84966328dd3Sahrens n = nentries; 85066328dd3Sahrens n = MIN(n, ZAP_HISTOGRAM_SIZE-1); 85166328dd3Sahrens zs->zs_buckets_with_n_entries[n]++; 85266328dd3Sahrens } 853fa9e4066Sahrens } 854