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*478ed9adSEric Taylor * Copyright 2009 Sun Microsystems, Inc. All rights reserved. 23fa9e4066Sahrens * Use is subject to license terms. 24fa9e4066Sahrens */ 25fa9e4066Sahrens 26fa9e4066Sahrens /* 27fa9e4066Sahrens * The 512-byte leaf is broken into 32 16-byte chunks. 28fa9e4066Sahrens * chunk number n means l_chunk[n], even though the header precedes it. 29fa9e4066Sahrens * the names are stored null-terminated. 30fa9e4066Sahrens */ 31fa9e4066Sahrens 32*478ed9adSEric Taylor #include <sys/spa.h> 33*478ed9adSEric Taylor #include <sys/dmu.h> 34fa9e4066Sahrens #include <sys/zfs_context.h> 35*478ed9adSEric Taylor #include <sys/fs/zfs.h> 36fa9e4066Sahrens #include <sys/zap.h> 37fa9e4066Sahrens #include <sys/zap_impl.h> 38fa9e4066Sahrens #include <sys/zap_leaf.h> 39fa9e4066Sahrens 40da6c28aaSamw static uint16_t *zap_leaf_rehash_entry(zap_leaf_t *l, uint16_t entry); 41da6c28aaSamw 42fa9e4066Sahrens #define CHAIN_END 0xffff /* end of the chunk chain */ 43fa9e4066Sahrens 44f65e61c0Sahrens /* half the (current) minimum block size */ 45fa9e4066Sahrens #define MAX_ARRAY_BYTES (8<<10) 46fa9e4066Sahrens 47fa9e4066Sahrens #define LEAF_HASH(l, h) \ 48f65e61c0Sahrens ((ZAP_LEAF_HASH_NUMENTRIES(l)-1) & \ 4966328dd3Sahrens ((h) >> (64 - ZAP_LEAF_HASH_SHIFT(l)-(l)->l_phys->l_hdr.lh_prefix_len))) 50fa9e4066Sahrens 51fa9e4066Sahrens #define LEAF_HASH_ENTPTR(l, h) (&(l)->l_phys->l_hash[LEAF_HASH(l, h)]) 52fa9e4066Sahrens 53fa9e4066Sahrens 54fa9e4066Sahrens static void 55fa9e4066Sahrens zap_memset(void *a, int c, size_t n) 56fa9e4066Sahrens { 57fa9e4066Sahrens char *cp = a; 58fa9e4066Sahrens char *cpend = cp + n; 59fa9e4066Sahrens 60fa9e4066Sahrens while (cp < cpend) 61fa9e4066Sahrens *cp++ = c; 62fa9e4066Sahrens } 63fa9e4066Sahrens 64fa9e4066Sahrens static void 65fa9e4066Sahrens stv(int len, void *addr, uint64_t value) 66fa9e4066Sahrens { 67fa9e4066Sahrens switch (len) { 68fa9e4066Sahrens case 1: 69fa9e4066Sahrens *(uint8_t *)addr = value; 70fa9e4066Sahrens return; 71fa9e4066Sahrens case 2: 72fa9e4066Sahrens *(uint16_t *)addr = value; 73fa9e4066Sahrens return; 74fa9e4066Sahrens case 4: 75fa9e4066Sahrens *(uint32_t *)addr = value; 76fa9e4066Sahrens return; 77fa9e4066Sahrens case 8: 78fa9e4066Sahrens *(uint64_t *)addr = value; 79fa9e4066Sahrens return; 80fa9e4066Sahrens } 81fa9e4066Sahrens ASSERT(!"bad int len"); 82fa9e4066Sahrens } 83fa9e4066Sahrens 84fa9e4066Sahrens static uint64_t 85fa9e4066Sahrens ldv(int len, const void *addr) 86fa9e4066Sahrens { 87fa9e4066Sahrens switch (len) { 88fa9e4066Sahrens case 1: 89fa9e4066Sahrens return (*(uint8_t *)addr); 90fa9e4066Sahrens case 2: 91fa9e4066Sahrens return (*(uint16_t *)addr); 92fa9e4066Sahrens case 4: 93fa9e4066Sahrens return (*(uint32_t *)addr); 94fa9e4066Sahrens case 8: 95fa9e4066Sahrens return (*(uint64_t *)addr); 96fa9e4066Sahrens } 97fa9e4066Sahrens ASSERT(!"bad int len"); 985ad82045Snd return (0xFEEDFACEDEADBEEFULL); 99fa9e4066Sahrens } 100fa9e4066Sahrens 101fa9e4066Sahrens void 102f65e61c0Sahrens zap_leaf_byteswap(zap_leaf_phys_t *buf, int size) 103fa9e4066Sahrens { 104fa9e4066Sahrens int i; 105f65e61c0Sahrens zap_leaf_t l; 106f65e61c0Sahrens l.l_bs = highbit(size)-1; 107f65e61c0Sahrens l.l_phys = buf; 108fa9e4066Sahrens 10966328dd3Sahrens buf->l_hdr.lh_block_type = BSWAP_64(buf->l_hdr.lh_block_type); 11066328dd3Sahrens buf->l_hdr.lh_prefix = BSWAP_64(buf->l_hdr.lh_prefix); 11166328dd3Sahrens buf->l_hdr.lh_magic = BSWAP_32(buf->l_hdr.lh_magic); 11266328dd3Sahrens buf->l_hdr.lh_nfree = BSWAP_16(buf->l_hdr.lh_nfree); 11366328dd3Sahrens buf->l_hdr.lh_nentries = BSWAP_16(buf->l_hdr.lh_nentries); 11466328dd3Sahrens buf->l_hdr.lh_prefix_len = BSWAP_16(buf->l_hdr.lh_prefix_len); 115fa9e4066Sahrens buf->l_hdr.lh_freelist = BSWAP_16(buf->l_hdr.lh_freelist); 116fa9e4066Sahrens 117f65e61c0Sahrens for (i = 0; i < ZAP_LEAF_HASH_NUMENTRIES(&l); i++) 118fa9e4066Sahrens buf->l_hash[i] = BSWAP_16(buf->l_hash[i]); 119fa9e4066Sahrens 120f65e61c0Sahrens for (i = 0; i < ZAP_LEAF_NUMCHUNKS(&l); i++) { 121f65e61c0Sahrens zap_leaf_chunk_t *lc = &ZAP_LEAF_CHUNK(&l, i); 122fa9e4066Sahrens struct zap_leaf_entry *le; 123fa9e4066Sahrens 124f65e61c0Sahrens switch (lc->l_free.lf_type) { 125f65e61c0Sahrens case ZAP_CHUNK_ENTRY: 126f65e61c0Sahrens le = &lc->l_entry; 127fa9e4066Sahrens 12866328dd3Sahrens le->le_type = BSWAP_8(le->le_type); 12966328dd3Sahrens le->le_int_size = BSWAP_8(le->le_int_size); 13066328dd3Sahrens le->le_next = BSWAP_16(le->le_next); 13166328dd3Sahrens le->le_name_chunk = BSWAP_16(le->le_name_chunk); 13266328dd3Sahrens le->le_name_length = BSWAP_16(le->le_name_length); 13366328dd3Sahrens le->le_value_chunk = BSWAP_16(le->le_value_chunk); 13466328dd3Sahrens le->le_value_length = BSWAP_16(le->le_value_length); 13566328dd3Sahrens le->le_cd = BSWAP_32(le->le_cd); 13666328dd3Sahrens le->le_hash = BSWAP_64(le->le_hash); 137fa9e4066Sahrens break; 138f65e61c0Sahrens case ZAP_CHUNK_FREE: 13966328dd3Sahrens lc->l_free.lf_type = BSWAP_8(lc->l_free.lf_type); 14066328dd3Sahrens lc->l_free.lf_next = BSWAP_16(lc->l_free.lf_next); 141fa9e4066Sahrens break; 142f65e61c0Sahrens case ZAP_CHUNK_ARRAY: 14366328dd3Sahrens lc->l_array.la_type = BSWAP_8(lc->l_array.la_type); 14466328dd3Sahrens lc->l_array.la_next = BSWAP_16(lc->l_array.la_next); 145fa9e4066Sahrens /* la_array doesn't need swapping */ 146fa9e4066Sahrens break; 147fa9e4066Sahrens default: 148fa9e4066Sahrens ASSERT(!"bad leaf type"); 149fa9e4066Sahrens } 150fa9e4066Sahrens } 151fa9e4066Sahrens } 152fa9e4066Sahrens 153fa9e4066Sahrens void 154de8267e0Stimh zap_leaf_init(zap_leaf_t *l, boolean_t sort) 155fa9e4066Sahrens { 156fa9e4066Sahrens int i; 157fa9e4066Sahrens 158f65e61c0Sahrens l->l_bs = highbit(l->l_dbuf->db_size)-1; 159fa9e4066Sahrens zap_memset(&l->l_phys->l_hdr, 0, sizeof (struct zap_leaf_header)); 160f65e61c0Sahrens zap_memset(l->l_phys->l_hash, CHAIN_END, 2*ZAP_LEAF_HASH_NUMENTRIES(l)); 161f65e61c0Sahrens for (i = 0; i < ZAP_LEAF_NUMCHUNKS(l); i++) { 162f65e61c0Sahrens ZAP_LEAF_CHUNK(l, i).l_free.lf_type = ZAP_CHUNK_FREE; 163f65e61c0Sahrens ZAP_LEAF_CHUNK(l, i).l_free.lf_next = i+1; 164fa9e4066Sahrens } 165f65e61c0Sahrens ZAP_LEAF_CHUNK(l, ZAP_LEAF_NUMCHUNKS(l)-1).l_free.lf_next = CHAIN_END; 16666328dd3Sahrens l->l_phys->l_hdr.lh_block_type = ZBT_LEAF; 16766328dd3Sahrens l->l_phys->l_hdr.lh_magic = ZAP_LEAF_MAGIC; 16866328dd3Sahrens l->l_phys->l_hdr.lh_nfree = ZAP_LEAF_NUMCHUNKS(l); 169de8267e0Stimh if (sort) 170da6c28aaSamw l->l_phys->l_hdr.lh_flags |= ZLF_ENTRIES_CDSORTED; 171fa9e4066Sahrens } 172fa9e4066Sahrens 173fa9e4066Sahrens /* 174fa9e4066Sahrens * Routines which manipulate leaf chunks (l_chunk[]). 175fa9e4066Sahrens */ 176fa9e4066Sahrens 177fa9e4066Sahrens static uint16_t 178fa9e4066Sahrens zap_leaf_chunk_alloc(zap_leaf_t *l) 179fa9e4066Sahrens { 180fa9e4066Sahrens int chunk; 181fa9e4066Sahrens 18266328dd3Sahrens ASSERT(l->l_phys->l_hdr.lh_nfree > 0); 183fa9e4066Sahrens 184fa9e4066Sahrens chunk = l->l_phys->l_hdr.lh_freelist; 185f65e61c0Sahrens ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l)); 186f65e61c0Sahrens ASSERT3U(ZAP_LEAF_CHUNK(l, chunk).l_free.lf_type, ==, ZAP_CHUNK_FREE); 187fa9e4066Sahrens 188f65e61c0Sahrens l->l_phys->l_hdr.lh_freelist = ZAP_LEAF_CHUNK(l, chunk).l_free.lf_next; 189fa9e4066Sahrens 19066328dd3Sahrens l->l_phys->l_hdr.lh_nfree--; 191fa9e4066Sahrens 192fa9e4066Sahrens return (chunk); 193fa9e4066Sahrens } 194fa9e4066Sahrens 195fa9e4066Sahrens static void 196fa9e4066Sahrens zap_leaf_chunk_free(zap_leaf_t *l, uint16_t chunk) 197fa9e4066Sahrens { 198f65e61c0Sahrens struct zap_leaf_free *zlf = &ZAP_LEAF_CHUNK(l, chunk).l_free; 19966328dd3Sahrens ASSERT3U(l->l_phys->l_hdr.lh_nfree, <, ZAP_LEAF_NUMCHUNKS(l)); 200f65e61c0Sahrens ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l)); 201f65e61c0Sahrens ASSERT(zlf->lf_type != ZAP_CHUNK_FREE); 202fa9e4066Sahrens 203f65e61c0Sahrens zlf->lf_type = ZAP_CHUNK_FREE; 204fa9e4066Sahrens zlf->lf_next = l->l_phys->l_hdr.lh_freelist; 205fa9e4066Sahrens bzero(zlf->lf_pad, sizeof (zlf->lf_pad)); /* help it to compress */ 206fa9e4066Sahrens l->l_phys->l_hdr.lh_freelist = chunk; 207fa9e4066Sahrens 20866328dd3Sahrens l->l_phys->l_hdr.lh_nfree++; 209fa9e4066Sahrens } 210fa9e4066Sahrens 211fa9e4066Sahrens /* 212fa9e4066Sahrens * Routines which manipulate leaf arrays (zap_leaf_array type chunks). 213fa9e4066Sahrens */ 214fa9e4066Sahrens 215fa9e4066Sahrens static uint16_t 21666328dd3Sahrens zap_leaf_array_create(zap_leaf_t *l, const char *buf, 217fa9e4066Sahrens int integer_size, int num_integers) 218fa9e4066Sahrens { 219fa9e4066Sahrens uint16_t chunk_head; 220fa9e4066Sahrens uint16_t *chunkp = &chunk_head; 221fa9e4066Sahrens int byten = 0; 222fa9e4066Sahrens uint64_t value; 223fa9e4066Sahrens int shift = (integer_size-1)*8; 224fa9e4066Sahrens int len = num_integers; 225fa9e4066Sahrens 226fa9e4066Sahrens ASSERT3U(num_integers * integer_size, <, MAX_ARRAY_BYTES); 227fa9e4066Sahrens 228fa9e4066Sahrens while (len > 0) { 229fa9e4066Sahrens uint16_t chunk = zap_leaf_chunk_alloc(l); 230f65e61c0Sahrens struct zap_leaf_array *la = &ZAP_LEAF_CHUNK(l, chunk).l_array; 231fa9e4066Sahrens int i; 232fa9e4066Sahrens 233f65e61c0Sahrens la->la_type = ZAP_CHUNK_ARRAY; 234fa9e4066Sahrens for (i = 0; i < ZAP_LEAF_ARRAY_BYTES; i++) { 235fa9e4066Sahrens if (byten == 0) 236fa9e4066Sahrens value = ldv(integer_size, buf); 237c5608ce5Sahrens la->la_array[i] = value >> shift; 238fa9e4066Sahrens value <<= 8; 239fa9e4066Sahrens if (++byten == integer_size) { 240fa9e4066Sahrens byten = 0; 241fa9e4066Sahrens buf += integer_size; 242fa9e4066Sahrens if (--len == 0) 243fa9e4066Sahrens break; 244fa9e4066Sahrens } 245fa9e4066Sahrens } 246fa9e4066Sahrens 247fa9e4066Sahrens *chunkp = chunk; 248fa9e4066Sahrens chunkp = &la->la_next; 249fa9e4066Sahrens } 250fa9e4066Sahrens *chunkp = CHAIN_END; 251fa9e4066Sahrens 252fa9e4066Sahrens return (chunk_head); 253fa9e4066Sahrens } 254fa9e4066Sahrens 255fa9e4066Sahrens static void 25666328dd3Sahrens zap_leaf_array_free(zap_leaf_t *l, uint16_t *chunkp) 257fa9e4066Sahrens { 258fa9e4066Sahrens uint16_t chunk = *chunkp; 259fa9e4066Sahrens 260fa9e4066Sahrens *chunkp = CHAIN_END; 261fa9e4066Sahrens 262fa9e4066Sahrens while (chunk != CHAIN_END) { 263f65e61c0Sahrens int nextchunk = ZAP_LEAF_CHUNK(l, chunk).l_array.la_next; 264f65e61c0Sahrens ASSERT3U(ZAP_LEAF_CHUNK(l, chunk).l_array.la_type, ==, 265f65e61c0Sahrens ZAP_CHUNK_ARRAY); 266fa9e4066Sahrens zap_leaf_chunk_free(l, chunk); 267fa9e4066Sahrens chunk = nextchunk; 268fa9e4066Sahrens } 269fa9e4066Sahrens } 270fa9e4066Sahrens 271fa9e4066Sahrens /* array_len and buf_len are in integers, not bytes */ 272fa9e4066Sahrens static void 27366328dd3Sahrens zap_leaf_array_read(zap_leaf_t *l, uint16_t chunk, 274fa9e4066Sahrens int array_int_len, int array_len, int buf_int_len, uint64_t buf_len, 275fa9e4066Sahrens char *buf) 276fa9e4066Sahrens { 277fa9e4066Sahrens int len = MIN(array_len, buf_len); 278fa9e4066Sahrens int byten = 0; 279fa9e4066Sahrens uint64_t value = 0; 280fa9e4066Sahrens 281fa9e4066Sahrens ASSERT3U(array_int_len, <=, buf_int_len); 282fa9e4066Sahrens 28387e5029aSahrens /* Fast path for one 8-byte integer */ 28487e5029aSahrens if (array_int_len == 8 && buf_int_len == 8 && len == 1) { 285f65e61c0Sahrens struct zap_leaf_array *la = &ZAP_LEAF_CHUNK(l, chunk).l_array; 2869621b9b1Sbonwick uint8_t *ip = la->la_array; 28787e5029aSahrens uint64_t *buf64 = (uint64_t *)buf; 2889621b9b1Sbonwick 2899621b9b1Sbonwick *buf64 = (uint64_t)ip[0] << 56 | (uint64_t)ip[1] << 48 | 2909621b9b1Sbonwick (uint64_t)ip[2] << 40 | (uint64_t)ip[3] << 32 | 2919621b9b1Sbonwick (uint64_t)ip[4] << 24 | (uint64_t)ip[5] << 16 | 2929621b9b1Sbonwick (uint64_t)ip[6] << 8 | (uint64_t)ip[7]; 29387e5029aSahrens return; 29487e5029aSahrens } 29587e5029aSahrens 29687e5029aSahrens /* Fast path for an array of 1-byte integers (eg. the entry name) */ 29787e5029aSahrens if (array_int_len == 1 && buf_int_len == 1 && 29887e5029aSahrens buf_len > array_len + ZAP_LEAF_ARRAY_BYTES) { 29987e5029aSahrens while (chunk != CHAIN_END) { 30087e5029aSahrens struct zap_leaf_array *la = 301f65e61c0Sahrens &ZAP_LEAF_CHUNK(l, chunk).l_array; 30287e5029aSahrens bcopy(la->la_array, buf, ZAP_LEAF_ARRAY_BYTES); 30387e5029aSahrens buf += ZAP_LEAF_ARRAY_BYTES; 30487e5029aSahrens chunk = la->la_next; 30587e5029aSahrens } 30687e5029aSahrens return; 30787e5029aSahrens } 30887e5029aSahrens 309fa9e4066Sahrens while (len > 0) { 310f65e61c0Sahrens struct zap_leaf_array *la = &ZAP_LEAF_CHUNK(l, chunk).l_array; 311fa9e4066Sahrens int i; 312fa9e4066Sahrens 313f65e61c0Sahrens ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l)); 314fa9e4066Sahrens for (i = 0; i < ZAP_LEAF_ARRAY_BYTES && len > 0; i++) { 315fa9e4066Sahrens value = (value << 8) | la->la_array[i]; 316fa9e4066Sahrens byten++; 317fa9e4066Sahrens if (byten == array_int_len) { 318fa9e4066Sahrens stv(buf_int_len, buf, value); 319fa9e4066Sahrens byten = 0; 320fa9e4066Sahrens len--; 321fa9e4066Sahrens if (len == 0) 322fa9e4066Sahrens return; 323fa9e4066Sahrens buf += buf_int_len; 324fa9e4066Sahrens } 325fa9e4066Sahrens } 326fa9e4066Sahrens chunk = la->la_next; 327fa9e4066Sahrens } 328fa9e4066Sahrens } 329fa9e4066Sahrens 330fa9e4066Sahrens /* 331fa9e4066Sahrens * Only to be used on 8-bit arrays. 332fa9e4066Sahrens * array_len is actual len in bytes (not encoded le_value_length). 333da6c28aaSamw * namenorm is null-terminated. 334fa9e4066Sahrens */ 335da6c28aaSamw static boolean_t 336da6c28aaSamw zap_leaf_array_match(zap_leaf_t *l, zap_name_t *zn, int chunk, int array_len) 337fa9e4066Sahrens { 338fa9e4066Sahrens int bseen = 0; 339fa9e4066Sahrens 340da6c28aaSamw if (zn->zn_matchtype == MT_FIRST) { 341da6c28aaSamw char *thisname = kmem_alloc(array_len, KM_SLEEP); 342da6c28aaSamw boolean_t match; 343da6c28aaSamw 344da6c28aaSamw zap_leaf_array_read(l, chunk, 1, array_len, 1, 345da6c28aaSamw array_len, thisname); 346da6c28aaSamw match = zap_match(zn, thisname); 347da6c28aaSamw kmem_free(thisname, array_len); 348da6c28aaSamw return (match); 349da6c28aaSamw } 350da6c28aaSamw 351da6c28aaSamw /* Fast path for exact matching */ 352fa9e4066Sahrens while (bseen < array_len) { 353f65e61c0Sahrens struct zap_leaf_array *la = &ZAP_LEAF_CHUNK(l, chunk).l_array; 354fa9e4066Sahrens int toread = MIN(array_len - bseen, ZAP_LEAF_ARRAY_BYTES); 355f65e61c0Sahrens ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l)); 356da6c28aaSamw if (bcmp(la->la_array, zn->zn_name_orij + bseen, toread)) 357fa9e4066Sahrens break; 358fa9e4066Sahrens chunk = la->la_next; 359fa9e4066Sahrens bseen += toread; 360fa9e4066Sahrens } 361fa9e4066Sahrens return (bseen == array_len); 362fa9e4066Sahrens } 363fa9e4066Sahrens 364fa9e4066Sahrens /* 365fa9e4066Sahrens * Routines which manipulate leaf entries. 366fa9e4066Sahrens */ 367fa9e4066Sahrens 368fa9e4066Sahrens int 369da6c28aaSamw zap_leaf_lookup(zap_leaf_t *l, zap_name_t *zn, zap_entry_handle_t *zeh) 370fa9e4066Sahrens { 371fa9e4066Sahrens uint16_t *chunkp; 372fa9e4066Sahrens struct zap_leaf_entry *le; 373fa9e4066Sahrens 37466328dd3Sahrens ASSERT3U(l->l_phys->l_hdr.lh_magic, ==, ZAP_LEAF_MAGIC); 375fa9e4066Sahrens 376da6c28aaSamw again: 377da6c28aaSamw for (chunkp = LEAF_HASH_ENTPTR(l, zn->zn_hash); 378fa9e4066Sahrens *chunkp != CHAIN_END; chunkp = &le->le_next) { 379fa9e4066Sahrens uint16_t chunk = *chunkp; 380f65e61c0Sahrens le = ZAP_LEAF_ENTRY(l, chunk); 381fa9e4066Sahrens 382f65e61c0Sahrens ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l)); 383f65e61c0Sahrens ASSERT3U(le->le_type, ==, ZAP_CHUNK_ENTRY); 384fa9e4066Sahrens 385da6c28aaSamw if (le->le_hash != zn->zn_hash) 386fa9e4066Sahrens continue; 387fa9e4066Sahrens 388da6c28aaSamw /* 389da6c28aaSamw * NB: the entry chain is always sorted by cd on 390da6c28aaSamw * normalized zap objects, so this will find the 391da6c28aaSamw * lowest-cd match for MT_FIRST. 392da6c28aaSamw */ 393da6c28aaSamw ASSERT(zn->zn_matchtype == MT_EXACT || 394da6c28aaSamw (l->l_phys->l_hdr.lh_flags & ZLF_ENTRIES_CDSORTED)); 395da6c28aaSamw if (zap_leaf_array_match(l, zn, le->le_name_chunk, 396da6c28aaSamw le->le_name_length)) { 397fa9e4066Sahrens zeh->zeh_num_integers = le->le_value_length; 398fa9e4066Sahrens zeh->zeh_integer_size = le->le_int_size; 399fa9e4066Sahrens zeh->zeh_cd = le->le_cd; 400fa9e4066Sahrens zeh->zeh_hash = le->le_hash; 401fa9e4066Sahrens zeh->zeh_chunkp = chunkp; 40266328dd3Sahrens zeh->zeh_leaf = l; 403fa9e4066Sahrens return (0); 404fa9e4066Sahrens } 405fa9e4066Sahrens } 406fa9e4066Sahrens 407da6c28aaSamw /* 408da6c28aaSamw * NB: we could of course do this in one pass, but that would be 409da6c28aaSamw * a pain. We'll see if MT_BEST is even used much. 410da6c28aaSamw */ 411da6c28aaSamw if (zn->zn_matchtype == MT_BEST) { 412da6c28aaSamw zn->zn_matchtype = MT_FIRST; 413da6c28aaSamw goto again; 414da6c28aaSamw } 415da6c28aaSamw 416fa9e4066Sahrens return (ENOENT); 417fa9e4066Sahrens } 418fa9e4066Sahrens 419fa9e4066Sahrens /* Return (h1,cd1 >= h2,cd2) */ 42087e5029aSahrens #define HCD_GTEQ(h1, cd1, h2, cd2) \ 42187e5029aSahrens ((h1 > h2) ? TRUE : ((h1 == h2 && cd1 >= cd2) ? TRUE : FALSE)) 422fa9e4066Sahrens 423fa9e4066Sahrens int 424fa9e4066Sahrens zap_leaf_lookup_closest(zap_leaf_t *l, 425fa9e4066Sahrens uint64_t h, uint32_t cd, zap_entry_handle_t *zeh) 426fa9e4066Sahrens { 427fa9e4066Sahrens uint16_t chunk; 428fa9e4066Sahrens uint64_t besth = -1ULL; 429fa9e4066Sahrens uint32_t bestcd = ZAP_MAXCD; 430f65e61c0Sahrens uint16_t bestlh = ZAP_LEAF_HASH_NUMENTRIES(l)-1; 431fa9e4066Sahrens uint16_t lh; 432fa9e4066Sahrens struct zap_leaf_entry *le; 433fa9e4066Sahrens 43466328dd3Sahrens ASSERT3U(l->l_phys->l_hdr.lh_magic, ==, ZAP_LEAF_MAGIC); 435fa9e4066Sahrens 436fa9e4066Sahrens for (lh = LEAF_HASH(l, h); lh <= bestlh; lh++) { 437fa9e4066Sahrens for (chunk = l->l_phys->l_hash[lh]; 438fa9e4066Sahrens chunk != CHAIN_END; chunk = le->le_next) { 439f65e61c0Sahrens le = ZAP_LEAF_ENTRY(l, chunk); 440fa9e4066Sahrens 441f65e61c0Sahrens ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l)); 442f65e61c0Sahrens ASSERT3U(le->le_type, ==, ZAP_CHUNK_ENTRY); 443fa9e4066Sahrens 44487e5029aSahrens if (HCD_GTEQ(le->le_hash, le->le_cd, h, cd) && 44587e5029aSahrens HCD_GTEQ(besth, bestcd, le->le_hash, le->le_cd)) { 446fa9e4066Sahrens ASSERT3U(bestlh, >=, lh); 447fa9e4066Sahrens bestlh = lh; 448fa9e4066Sahrens besth = le->le_hash; 449fa9e4066Sahrens bestcd = le->le_cd; 450fa9e4066Sahrens 451fa9e4066Sahrens zeh->zeh_num_integers = le->le_value_length; 452fa9e4066Sahrens zeh->zeh_integer_size = le->le_int_size; 453fa9e4066Sahrens zeh->zeh_cd = le->le_cd; 454fa9e4066Sahrens zeh->zeh_hash = le->le_hash; 455fa9e4066Sahrens zeh->zeh_fakechunk = chunk; 456fa9e4066Sahrens zeh->zeh_chunkp = &zeh->zeh_fakechunk; 45766328dd3Sahrens zeh->zeh_leaf = l; 458fa9e4066Sahrens } 459fa9e4066Sahrens } 460fa9e4066Sahrens } 461fa9e4066Sahrens 462fa9e4066Sahrens return (bestcd == ZAP_MAXCD ? ENOENT : 0); 463fa9e4066Sahrens } 464fa9e4066Sahrens 465fa9e4066Sahrens int 466fa9e4066Sahrens zap_entry_read(const zap_entry_handle_t *zeh, 467fa9e4066Sahrens uint8_t integer_size, uint64_t num_integers, void *buf) 468fa9e4066Sahrens { 469f65e61c0Sahrens struct zap_leaf_entry *le = 47066328dd3Sahrens ZAP_LEAF_ENTRY(zeh->zeh_leaf, *zeh->zeh_chunkp); 471f65e61c0Sahrens ASSERT3U(le->le_type, ==, ZAP_CHUNK_ENTRY); 472fa9e4066Sahrens 473fa9e4066Sahrens if (le->le_int_size > integer_size) 474fa9e4066Sahrens return (EINVAL); 475fa9e4066Sahrens 47666328dd3Sahrens zap_leaf_array_read(zeh->zeh_leaf, le->le_value_chunk, le->le_int_size, 477fa9e4066Sahrens le->le_value_length, integer_size, num_integers, buf); 478fa9e4066Sahrens 479fa9e4066Sahrens if (zeh->zeh_num_integers > num_integers) 480fa9e4066Sahrens return (EOVERFLOW); 481fa9e4066Sahrens return (0); 482fa9e4066Sahrens 483fa9e4066Sahrens } 484fa9e4066Sahrens 485fa9e4066Sahrens int 486fa9e4066Sahrens zap_entry_read_name(const zap_entry_handle_t *zeh, uint16_t buflen, char *buf) 487fa9e4066Sahrens { 488f65e61c0Sahrens struct zap_leaf_entry *le = 48966328dd3Sahrens ZAP_LEAF_ENTRY(zeh->zeh_leaf, *zeh->zeh_chunkp); 490f65e61c0Sahrens ASSERT3U(le->le_type, ==, ZAP_CHUNK_ENTRY); 491fa9e4066Sahrens 49266328dd3Sahrens zap_leaf_array_read(zeh->zeh_leaf, le->le_name_chunk, 1, 493fa9e4066Sahrens le->le_name_length, 1, buflen, buf); 494fa9e4066Sahrens if (le->le_name_length > buflen) 495fa9e4066Sahrens return (EOVERFLOW); 496fa9e4066Sahrens return (0); 497fa9e4066Sahrens } 498fa9e4066Sahrens 499fa9e4066Sahrens int 500fa9e4066Sahrens zap_entry_update(zap_entry_handle_t *zeh, 501fa9e4066Sahrens uint8_t integer_size, uint64_t num_integers, const void *buf) 502fa9e4066Sahrens { 503fa9e4066Sahrens int delta_chunks; 50466328dd3Sahrens zap_leaf_t *l = zeh->zeh_leaf; 50566328dd3Sahrens struct zap_leaf_entry *le = ZAP_LEAF_ENTRY(l, *zeh->zeh_chunkp); 506fa9e4066Sahrens 50766328dd3Sahrens delta_chunks = ZAP_LEAF_ARRAY_NCHUNKS(num_integers * integer_size) - 50866328dd3Sahrens ZAP_LEAF_ARRAY_NCHUNKS(le->le_value_length * le->le_int_size); 509fa9e4066Sahrens 51066328dd3Sahrens if ((int)l->l_phys->l_hdr.lh_nfree < delta_chunks) 511fa9e4066Sahrens return (EAGAIN); 512fa9e4066Sahrens 513fa9e4066Sahrens /* 514fa9e4066Sahrens * We should search other chained leaves (via 515fa9e4066Sahrens * zap_entry_remove,create?) otherwise returning EAGAIN will 516fa9e4066Sahrens * just send us into an infinite loop if we have to chain 517fa9e4066Sahrens * another leaf block, rather than being able to split this 518fa9e4066Sahrens * block. 519fa9e4066Sahrens */ 520fa9e4066Sahrens 52166328dd3Sahrens zap_leaf_array_free(l, &le->le_value_chunk); 522fa9e4066Sahrens le->le_value_chunk = 52366328dd3Sahrens zap_leaf_array_create(l, buf, integer_size, num_integers); 524f65e61c0Sahrens le->le_value_length = num_integers; 525fa9e4066Sahrens le->le_int_size = integer_size; 526fa9e4066Sahrens return (0); 527fa9e4066Sahrens } 528fa9e4066Sahrens 529fa9e4066Sahrens void 530fa9e4066Sahrens zap_entry_remove(zap_entry_handle_t *zeh) 531fa9e4066Sahrens { 532fa9e4066Sahrens uint16_t entry_chunk; 533fa9e4066Sahrens struct zap_leaf_entry *le; 53466328dd3Sahrens zap_leaf_t *l = zeh->zeh_leaf; 535fa9e4066Sahrens 536fa9e4066Sahrens ASSERT3P(zeh->zeh_chunkp, !=, &zeh->zeh_fakechunk); 537fa9e4066Sahrens 538fa9e4066Sahrens entry_chunk = *zeh->zeh_chunkp; 539f65e61c0Sahrens le = ZAP_LEAF_ENTRY(l, entry_chunk); 540f65e61c0Sahrens ASSERT3U(le->le_type, ==, ZAP_CHUNK_ENTRY); 541fa9e4066Sahrens 54266328dd3Sahrens zap_leaf_array_free(l, &le->le_name_chunk); 54366328dd3Sahrens zap_leaf_array_free(l, &le->le_value_chunk); 544fa9e4066Sahrens 545fa9e4066Sahrens *zeh->zeh_chunkp = le->le_next; 546fa9e4066Sahrens zap_leaf_chunk_free(l, entry_chunk); 547fa9e4066Sahrens 54866328dd3Sahrens l->l_phys->l_hdr.lh_nentries--; 549fa9e4066Sahrens } 550fa9e4066Sahrens 551fa9e4066Sahrens int 552fa9e4066Sahrens zap_entry_create(zap_leaf_t *l, const char *name, uint64_t h, uint32_t cd, 553fa9e4066Sahrens uint8_t integer_size, uint64_t num_integers, const void *buf, 554fa9e4066Sahrens zap_entry_handle_t *zeh) 555fa9e4066Sahrens { 556fa9e4066Sahrens uint16_t chunk; 557fa9e4066Sahrens uint16_t *chunkp; 558fa9e4066Sahrens struct zap_leaf_entry *le; 559fa9e4066Sahrens uint64_t namelen, valuelen; 560fa9e4066Sahrens int numchunks; 561fa9e4066Sahrens 562fa9e4066Sahrens valuelen = integer_size * num_integers; 563fa9e4066Sahrens namelen = strlen(name) + 1; 564fa9e4066Sahrens ASSERT(namelen >= 2); 565fa9e4066Sahrens 56666328dd3Sahrens numchunks = 1 + ZAP_LEAF_ARRAY_NCHUNKS(namelen) + 56766328dd3Sahrens ZAP_LEAF_ARRAY_NCHUNKS(valuelen); 568f65e61c0Sahrens if (numchunks > ZAP_LEAF_NUMCHUNKS(l)) 569fa9e4066Sahrens return (E2BIG); 570fa9e4066Sahrens 571fa9e4066Sahrens if (cd == ZAP_MAXCD) { 572da6c28aaSamw /* find the lowest unused cd */ 573da6c28aaSamw if (l->l_phys->l_hdr.lh_flags & ZLF_ENTRIES_CDSORTED) { 574da6c28aaSamw cd = 0; 575da6c28aaSamw 57666328dd3Sahrens for (chunk = *LEAF_HASH_ENTPTR(l, h); 57766328dd3Sahrens chunk != CHAIN_END; chunk = le->le_next) { 57866328dd3Sahrens le = ZAP_LEAF_ENTRY(l, chunk); 579da6c28aaSamw if (le->le_cd > cd) 580fa9e4066Sahrens break; 581da6c28aaSamw if (le->le_hash == h) { 582da6c28aaSamw ASSERT3U(cd, ==, le->le_cd); 583da6c28aaSamw cd++; 58466328dd3Sahrens } 585fa9e4066Sahrens } 586da6c28aaSamw } else { 587da6c28aaSamw /* old unsorted format; do it the O(n^2) way */ 588da6c28aaSamw for (cd = 0; cd < ZAP_MAXCD; cd++) { 589da6c28aaSamw for (chunk = *LEAF_HASH_ENTPTR(l, h); 590da6c28aaSamw chunk != CHAIN_END; chunk = le->le_next) { 591da6c28aaSamw le = ZAP_LEAF_ENTRY(l, chunk); 592da6c28aaSamw if (le->le_hash == h && 593da6c28aaSamw le->le_cd == cd) { 594da6c28aaSamw break; 595da6c28aaSamw } 596da6c28aaSamw } 597da6c28aaSamw /* If this cd is not in use, we are good. */ 598da6c28aaSamw if (chunk == CHAIN_END) 599da6c28aaSamw break; 600da6c28aaSamw } 601fa9e4066Sahrens } 602da6c28aaSamw /* 603da6c28aaSamw * we would run out of space in a block before we could 604da6c28aaSamw * have ZAP_MAXCD entries 605da6c28aaSamw */ 606da6c28aaSamw ASSERT3U(cd, <, ZAP_MAXCD); 607fa9e4066Sahrens } 608fa9e4066Sahrens 60966328dd3Sahrens if (l->l_phys->l_hdr.lh_nfree < numchunks) 610fa9e4066Sahrens return (EAGAIN); 611fa9e4066Sahrens 612fa9e4066Sahrens /* make the entry */ 613fa9e4066Sahrens chunk = zap_leaf_chunk_alloc(l); 614f65e61c0Sahrens le = ZAP_LEAF_ENTRY(l, chunk); 615f65e61c0Sahrens le->le_type = ZAP_CHUNK_ENTRY; 61666328dd3Sahrens le->le_name_chunk = zap_leaf_array_create(l, name, 1, namelen); 617fa9e4066Sahrens le->le_name_length = namelen; 618fa9e4066Sahrens le->le_value_chunk = 61966328dd3Sahrens zap_leaf_array_create(l, buf, integer_size, num_integers); 620f65e61c0Sahrens le->le_value_length = num_integers; 621fa9e4066Sahrens le->le_int_size = integer_size; 622fa9e4066Sahrens le->le_hash = h; 623fa9e4066Sahrens le->le_cd = cd; 624fa9e4066Sahrens 625fa9e4066Sahrens /* link it into the hash chain */ 626da6c28aaSamw /* XXX if we did the search above, we could just use that */ 627da6c28aaSamw chunkp = zap_leaf_rehash_entry(l, chunk); 628fa9e4066Sahrens 62966328dd3Sahrens l->l_phys->l_hdr.lh_nentries++; 630fa9e4066Sahrens 63166328dd3Sahrens zeh->zeh_leaf = l; 632fa9e4066Sahrens zeh->zeh_num_integers = num_integers; 633fa9e4066Sahrens zeh->zeh_integer_size = le->le_int_size; 634fa9e4066Sahrens zeh->zeh_cd = le->le_cd; 635fa9e4066Sahrens zeh->zeh_hash = le->le_hash; 636fa9e4066Sahrens zeh->zeh_chunkp = chunkp; 637fa9e4066Sahrens 638fa9e4066Sahrens return (0); 639fa9e4066Sahrens } 640fa9e4066Sahrens 641da6c28aaSamw /* 642da6c28aaSamw * Determine if there is another entry with the same normalized form. 643da6c28aaSamw * For performance purposes, either zn or name must be provided (the 644da6c28aaSamw * other can be NULL). Note, there usually won't be any hash 645da6c28aaSamw * conflicts, in which case we don't need the concatenated/normalized 646da6c28aaSamw * form of the name. But all callers have one of these on hand anyway, 647da6c28aaSamw * so might as well take advantage. A cleaner but slower interface 648da6c28aaSamw * would accept neither argument, and compute the normalized name as 649da6c28aaSamw * needed (using zap_name_alloc(zap_entry_read_name(zeh))). 650da6c28aaSamw */ 651da6c28aaSamw boolean_t 652da6c28aaSamw zap_entry_normalization_conflict(zap_entry_handle_t *zeh, zap_name_t *zn, 653da6c28aaSamw const char *name, zap_t *zap) 654da6c28aaSamw { 655da6c28aaSamw uint64_t chunk; 656da6c28aaSamw struct zap_leaf_entry *le; 657da6c28aaSamw boolean_t allocdzn = B_FALSE; 658da6c28aaSamw 659da6c28aaSamw if (zap->zap_normflags == 0) 660da6c28aaSamw return (B_FALSE); 661da6c28aaSamw 662da6c28aaSamw for (chunk = *LEAF_HASH_ENTPTR(zeh->zeh_leaf, zeh->zeh_hash); 663da6c28aaSamw chunk != CHAIN_END; chunk = le->le_next) { 664da6c28aaSamw le = ZAP_LEAF_ENTRY(zeh->zeh_leaf, chunk); 665da6c28aaSamw if (le->le_hash != zeh->zeh_hash) 666da6c28aaSamw continue; 667da6c28aaSamw if (le->le_cd == zeh->zeh_cd) 668da6c28aaSamw continue; 669da6c28aaSamw 670da6c28aaSamw if (zn == NULL) { 671da6c28aaSamw zn = zap_name_alloc(zap, name, MT_FIRST); 672da6c28aaSamw allocdzn = B_TRUE; 673da6c28aaSamw } 674da6c28aaSamw if (zap_leaf_array_match(zeh->zeh_leaf, zn, 675da6c28aaSamw le->le_name_chunk, le->le_name_length)) { 676da6c28aaSamw if (allocdzn) 677da6c28aaSamw zap_name_free(zn); 678da6c28aaSamw return (B_TRUE); 679da6c28aaSamw } 680da6c28aaSamw } 681da6c28aaSamw if (allocdzn) 682da6c28aaSamw zap_name_free(zn); 683da6c28aaSamw return (B_FALSE); 684da6c28aaSamw } 685da6c28aaSamw 686fa9e4066Sahrens /* 687fa9e4066Sahrens * Routines for transferring entries between leafs. 688fa9e4066Sahrens */ 689fa9e4066Sahrens 690da6c28aaSamw static uint16_t * 691fa9e4066Sahrens zap_leaf_rehash_entry(zap_leaf_t *l, uint16_t entry) 692fa9e4066Sahrens { 693f65e61c0Sahrens struct zap_leaf_entry *le = ZAP_LEAF_ENTRY(l, entry); 694da6c28aaSamw struct zap_leaf_entry *le2; 695da6c28aaSamw uint16_t *chunkp; 696da6c28aaSamw 697da6c28aaSamw /* 698da6c28aaSamw * keep the entry chain sorted by cd 699da6c28aaSamw * NB: this will not cause problems for unsorted leafs, though 700da6c28aaSamw * it is unnecessary there. 701da6c28aaSamw */ 702da6c28aaSamw for (chunkp = LEAF_HASH_ENTPTR(l, le->le_hash); 703da6c28aaSamw *chunkp != CHAIN_END; chunkp = &le2->le_next) { 704da6c28aaSamw le2 = ZAP_LEAF_ENTRY(l, *chunkp); 705da6c28aaSamw if (le2->le_cd > le->le_cd) 706da6c28aaSamw break; 707da6c28aaSamw } 708da6c28aaSamw 709da6c28aaSamw le->le_next = *chunkp; 710da6c28aaSamw *chunkp = entry; 711da6c28aaSamw return (chunkp); 712fa9e4066Sahrens } 713fa9e4066Sahrens 714fa9e4066Sahrens static uint16_t 715fa9e4066Sahrens zap_leaf_transfer_array(zap_leaf_t *l, uint16_t chunk, zap_leaf_t *nl) 716fa9e4066Sahrens { 717fa9e4066Sahrens uint16_t new_chunk; 718fa9e4066Sahrens uint16_t *nchunkp = &new_chunk; 719fa9e4066Sahrens 720fa9e4066Sahrens while (chunk != CHAIN_END) { 721fa9e4066Sahrens uint16_t nchunk = zap_leaf_chunk_alloc(nl); 722fa9e4066Sahrens struct zap_leaf_array *nla = 723f65e61c0Sahrens &ZAP_LEAF_CHUNK(nl, nchunk).l_array; 724fa9e4066Sahrens struct zap_leaf_array *la = 725f65e61c0Sahrens &ZAP_LEAF_CHUNK(l, chunk).l_array; 726fa9e4066Sahrens int nextchunk = la->la_next; 727fa9e4066Sahrens 728f65e61c0Sahrens ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l)); 729f65e61c0Sahrens ASSERT3U(nchunk, <, ZAP_LEAF_NUMCHUNKS(l)); 730fa9e4066Sahrens 73166328dd3Sahrens *nla = *la; /* structure assignment */ 732fa9e4066Sahrens 733fa9e4066Sahrens zap_leaf_chunk_free(l, chunk); 734fa9e4066Sahrens chunk = nextchunk; 735fa9e4066Sahrens *nchunkp = nchunk; 736fa9e4066Sahrens nchunkp = &nla->la_next; 737fa9e4066Sahrens } 738fa9e4066Sahrens *nchunkp = CHAIN_END; 739fa9e4066Sahrens return (new_chunk); 740fa9e4066Sahrens } 741fa9e4066Sahrens 742fa9e4066Sahrens static void 74366328dd3Sahrens zap_leaf_transfer_entry(zap_leaf_t *l, int entry, zap_leaf_t *nl) 744fa9e4066Sahrens { 745fa9e4066Sahrens struct zap_leaf_entry *le, *nle; 74666328dd3Sahrens uint16_t chunk; 747fa9e4066Sahrens 748f65e61c0Sahrens le = ZAP_LEAF_ENTRY(l, entry); 749f65e61c0Sahrens ASSERT3U(le->le_type, ==, ZAP_CHUNK_ENTRY); 750fa9e4066Sahrens 751fa9e4066Sahrens chunk = zap_leaf_chunk_alloc(nl); 752f65e61c0Sahrens nle = ZAP_LEAF_ENTRY(nl, chunk); 75366328dd3Sahrens *nle = *le; /* structure assignment */ 754fa9e4066Sahrens 755da6c28aaSamw (void) zap_leaf_rehash_entry(nl, chunk); 756fa9e4066Sahrens 757fa9e4066Sahrens nle->le_name_chunk = zap_leaf_transfer_array(l, le->le_name_chunk, nl); 758fa9e4066Sahrens nle->le_value_chunk = 759fa9e4066Sahrens zap_leaf_transfer_array(l, le->le_value_chunk, nl); 760fa9e4066Sahrens 761fa9e4066Sahrens zap_leaf_chunk_free(l, entry); 762fa9e4066Sahrens 76366328dd3Sahrens l->l_phys->l_hdr.lh_nentries--; 76466328dd3Sahrens nl->l_phys->l_hdr.lh_nentries++; 765fa9e4066Sahrens } 766fa9e4066Sahrens 767fa9e4066Sahrens /* 76866328dd3Sahrens * Transfer the entries whose hash prefix ends in 1 to the new leaf. 769fa9e4066Sahrens */ 77066328dd3Sahrens void 771de8267e0Stimh zap_leaf_split(zap_leaf_t *l, zap_leaf_t *nl, boolean_t sort) 772fa9e4066Sahrens { 773fa9e4066Sahrens int i; 77466328dd3Sahrens int bit = 64 - 1 - l->l_phys->l_hdr.lh_prefix_len; 77566328dd3Sahrens 77666328dd3Sahrens /* set new prefix and prefix_len */ 77766328dd3Sahrens l->l_phys->l_hdr.lh_prefix <<= 1; 77866328dd3Sahrens l->l_phys->l_hdr.lh_prefix_len++; 77966328dd3Sahrens nl->l_phys->l_hdr.lh_prefix = l->l_phys->l_hdr.lh_prefix | 1; 78066328dd3Sahrens nl->l_phys->l_hdr.lh_prefix_len = l->l_phys->l_hdr.lh_prefix_len; 781fa9e4066Sahrens 782fa9e4066Sahrens /* break existing hash chains */ 783f65e61c0Sahrens zap_memset(l->l_phys->l_hash, CHAIN_END, 2*ZAP_LEAF_HASH_NUMENTRIES(l)); 784fa9e4066Sahrens 785de8267e0Stimh if (sort) 786da6c28aaSamw l->l_phys->l_hdr.lh_flags |= ZLF_ENTRIES_CDSORTED; 787da6c28aaSamw 78866328dd3Sahrens /* 78966328dd3Sahrens * Transfer entries whose hash bit 'bit' is set to nl; rehash 79066328dd3Sahrens * the remaining entries 79166328dd3Sahrens * 79266328dd3Sahrens * NB: We could find entries via the hashtable instead. That 79366328dd3Sahrens * would be O(hashents+numents) rather than O(numblks+numents), 79466328dd3Sahrens * but this accesses memory more sequentially, and when we're 79566328dd3Sahrens * called, the block is usually pretty full. 79666328dd3Sahrens */ 797f65e61c0Sahrens for (i = 0; i < ZAP_LEAF_NUMCHUNKS(l); i++) { 798f65e61c0Sahrens struct zap_leaf_entry *le = ZAP_LEAF_ENTRY(l, i); 799f65e61c0Sahrens if (le->le_type != ZAP_CHUNK_ENTRY) 800fa9e4066Sahrens continue; 801fa9e4066Sahrens 80266328dd3Sahrens if (le->le_hash & (1ULL << bit)) 80366328dd3Sahrens zap_leaf_transfer_entry(l, i, nl); 80466328dd3Sahrens else 805da6c28aaSamw (void) zap_leaf_rehash_entry(l, i); 806fa9e4066Sahrens } 807fa9e4066Sahrens } 808fa9e4066Sahrens 809fa9e4066Sahrens void 81066328dd3Sahrens zap_leaf_stats(zap_t *zap, zap_leaf_t *l, zap_stats_t *zs) 811fa9e4066Sahrens { 81266328dd3Sahrens int i, n; 813fa9e4066Sahrens 81466328dd3Sahrens n = zap->zap_f.zap_phys->zap_ptrtbl.zt_shift - 81566328dd3Sahrens l->l_phys->l_hdr.lh_prefix_len; 816fa9e4066Sahrens n = MIN(n, ZAP_HISTOGRAM_SIZE-1); 817fa9e4066Sahrens zs->zs_leafs_with_2n_pointers[n]++; 818fa9e4066Sahrens 819fa9e4066Sahrens 82066328dd3Sahrens n = l->l_phys->l_hdr.lh_nentries/5; 82166328dd3Sahrens n = MIN(n, ZAP_HISTOGRAM_SIZE-1); 82266328dd3Sahrens zs->zs_blocks_with_n5_entries[n]++; 823fa9e4066Sahrens 82466328dd3Sahrens n = ((1<<FZAP_BLOCK_SHIFT(zap)) - 82566328dd3Sahrens l->l_phys->l_hdr.lh_nfree * (ZAP_LEAF_ARRAY_BYTES+1))*10 / 82666328dd3Sahrens (1<<FZAP_BLOCK_SHIFT(zap)); 82766328dd3Sahrens n = MIN(n, ZAP_HISTOGRAM_SIZE-1); 82866328dd3Sahrens zs->zs_blocks_n_tenths_full[n]++; 829fa9e4066Sahrens 83066328dd3Sahrens for (i = 0; i < ZAP_LEAF_HASH_NUMENTRIES(l); i++) { 83166328dd3Sahrens int nentries = 0; 83266328dd3Sahrens int chunk = l->l_phys->l_hash[i]; 833fa9e4066Sahrens 83466328dd3Sahrens while (chunk != CHAIN_END) { 83566328dd3Sahrens struct zap_leaf_entry *le = 83666328dd3Sahrens ZAP_LEAF_ENTRY(l, chunk); 837fa9e4066Sahrens 83866328dd3Sahrens n = 1 + ZAP_LEAF_ARRAY_NCHUNKS(le->le_name_length) + 83966328dd3Sahrens ZAP_LEAF_ARRAY_NCHUNKS(le->le_value_length * 840de8267e0Stimh le->le_int_size); 841fa9e4066Sahrens n = MIN(n, ZAP_HISTOGRAM_SIZE-1); 84266328dd3Sahrens zs->zs_entries_using_n_chunks[n]++; 843fa9e4066Sahrens 84466328dd3Sahrens chunk = le->le_next; 84566328dd3Sahrens nentries++; 84666328dd3Sahrens } 847fa9e4066Sahrens 84866328dd3Sahrens n = nentries; 84966328dd3Sahrens n = MIN(n, ZAP_HISTOGRAM_SIZE-1); 85066328dd3Sahrens zs->zs_buckets_with_n_entries[n]++; 85166328dd3Sahrens } 852fa9e4066Sahrens } 853