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 /* 22478ed9adSEric 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 32b24ab676SJeff Bonwick #include <sys/zio.h> 33478ed9adSEric Taylor #include <sys/spa.h> 34478ed9adSEric Taylor #include <sys/dmu.h> 35fa9e4066Sahrens #include <sys/zfs_context.h> 36478ed9adSEric Taylor #include <sys/fs/zfs.h> 37fa9e4066Sahrens #include <sys/zap.h> 38fa9e4066Sahrens #include <sys/zap_impl.h> 39fa9e4066Sahrens #include <sys/zap_leaf.h> 40fa9e4066Sahrens 41da6c28aaSamw static uint16_t *zap_leaf_rehash_entry(zap_leaf_t *l, uint16_t entry); 42da6c28aaSamw 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); 130*486ae710SMatthew Ahrens le->le_value_intlen = BSWAP_8(le->le_value_intlen); 13166328dd3Sahrens le->le_next = BSWAP_16(le->le_next); 13266328dd3Sahrens le->le_name_chunk = BSWAP_16(le->le_name_chunk); 133*486ae710SMatthew Ahrens le->le_name_numints = BSWAP_16(le->le_name_numints); 13466328dd3Sahrens le->le_value_chunk = BSWAP_16(le->le_value_chunk); 135*486ae710SMatthew Ahrens le->le_value_numints = BSWAP_16(le->le_value_numints); 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 155de8267e0Stimh zap_leaf_init(zap_leaf_t *l, boolean_t sort) 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); 170de8267e0Stimh if (sort) 171da6c28aaSamw 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, 218*486ae710SMatthew Ahrens 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, 276b24ab676SJeff Bonwick void *buf) 277fa9e4066Sahrens { 278fa9e4066Sahrens int len = MIN(array_len, buf_len); 279fa9e4066Sahrens int byten = 0; 280fa9e4066Sahrens uint64_t value = 0; 281b24ab676SJeff Bonwick char *p = buf; 282fa9e4066Sahrens 283fa9e4066Sahrens ASSERT3U(array_int_len, <=, buf_int_len); 284fa9e4066Sahrens 28587e5029aSahrens /* Fast path for one 8-byte integer */ 28687e5029aSahrens if (array_int_len == 8 && buf_int_len == 8 && len == 1) { 287f65e61c0Sahrens struct zap_leaf_array *la = &ZAP_LEAF_CHUNK(l, chunk).l_array; 2889621b9b1Sbonwick uint8_t *ip = la->la_array; 289b24ab676SJeff Bonwick uint64_t *buf64 = buf; 2909621b9b1Sbonwick 2919621b9b1Sbonwick *buf64 = (uint64_t)ip[0] << 56 | (uint64_t)ip[1] << 48 | 2929621b9b1Sbonwick (uint64_t)ip[2] << 40 | (uint64_t)ip[3] << 32 | 2939621b9b1Sbonwick (uint64_t)ip[4] << 24 | (uint64_t)ip[5] << 16 | 2949621b9b1Sbonwick (uint64_t)ip[6] << 8 | (uint64_t)ip[7]; 29587e5029aSahrens return; 29687e5029aSahrens } 29787e5029aSahrens 29887e5029aSahrens /* Fast path for an array of 1-byte integers (eg. the entry name) */ 29987e5029aSahrens if (array_int_len == 1 && buf_int_len == 1 && 30087e5029aSahrens buf_len > array_len + ZAP_LEAF_ARRAY_BYTES) { 30187e5029aSahrens while (chunk != CHAIN_END) { 30287e5029aSahrens struct zap_leaf_array *la = 303f65e61c0Sahrens &ZAP_LEAF_CHUNK(l, chunk).l_array; 304b24ab676SJeff Bonwick bcopy(la->la_array, p, ZAP_LEAF_ARRAY_BYTES); 305b24ab676SJeff Bonwick p += ZAP_LEAF_ARRAY_BYTES; 30687e5029aSahrens chunk = la->la_next; 30787e5029aSahrens } 30887e5029aSahrens return; 30987e5029aSahrens } 31087e5029aSahrens 311fa9e4066Sahrens while (len > 0) { 312f65e61c0Sahrens struct zap_leaf_array *la = &ZAP_LEAF_CHUNK(l, chunk).l_array; 313fa9e4066Sahrens int i; 314fa9e4066Sahrens 315f65e61c0Sahrens ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l)); 316fa9e4066Sahrens for (i = 0; i < ZAP_LEAF_ARRAY_BYTES && len > 0; i++) { 317fa9e4066Sahrens value = (value << 8) | la->la_array[i]; 318fa9e4066Sahrens byten++; 319fa9e4066Sahrens if (byten == array_int_len) { 320b24ab676SJeff Bonwick stv(buf_int_len, p, value); 321fa9e4066Sahrens byten = 0; 322fa9e4066Sahrens len--; 323fa9e4066Sahrens if (len == 0) 324fa9e4066Sahrens return; 325b24ab676SJeff Bonwick p += buf_int_len; 326fa9e4066Sahrens } 327fa9e4066Sahrens } 328fa9e4066Sahrens chunk = la->la_next; 329fa9e4066Sahrens } 330fa9e4066Sahrens } 331fa9e4066Sahrens 332da6c28aaSamw static boolean_t 333*486ae710SMatthew Ahrens zap_leaf_array_match(zap_leaf_t *l, zap_name_t *zn, 334*486ae710SMatthew Ahrens int chunk, int array_numints) 335fa9e4066Sahrens { 336fa9e4066Sahrens int bseen = 0; 337fa9e4066Sahrens 338b24ab676SJeff Bonwick if (zap_getflags(zn->zn_zap) & ZAP_FLAG_UINT64_KEY) { 339b24ab676SJeff Bonwick uint64_t *thiskey; 340b24ab676SJeff Bonwick boolean_t match; 341b24ab676SJeff Bonwick 342b24ab676SJeff Bonwick ASSERT(zn->zn_key_intlen == sizeof (*thiskey)); 343*486ae710SMatthew Ahrens thiskey = kmem_alloc(array_numints * sizeof (*thiskey), 344*486ae710SMatthew Ahrens KM_SLEEP); 345b24ab676SJeff Bonwick 346*486ae710SMatthew Ahrens zap_leaf_array_read(l, chunk, sizeof (*thiskey), array_numints, 347*486ae710SMatthew Ahrens sizeof (*thiskey), array_numints, thiskey); 348b24ab676SJeff Bonwick match = bcmp(thiskey, zn->zn_key_orig, 349*486ae710SMatthew Ahrens array_numints * sizeof (*thiskey)) == 0; 350*486ae710SMatthew Ahrens kmem_free(thiskey, array_numints * sizeof (*thiskey)); 351b24ab676SJeff Bonwick return (match); 352b24ab676SJeff Bonwick } 353b24ab676SJeff Bonwick 354*486ae710SMatthew Ahrens ASSERT(zn->zn_key_intlen == 1); 355da6c28aaSamw if (zn->zn_matchtype == MT_FIRST) { 356*486ae710SMatthew Ahrens char *thisname = kmem_alloc(array_numints, KM_SLEEP); 357da6c28aaSamw boolean_t match; 358da6c28aaSamw 359*486ae710SMatthew Ahrens zap_leaf_array_read(l, chunk, sizeof (char), array_numints, 360*486ae710SMatthew Ahrens sizeof (char), array_numints, thisname); 361da6c28aaSamw match = zap_match(zn, thisname); 362*486ae710SMatthew Ahrens kmem_free(thisname, array_numints); 363da6c28aaSamw return (match); 364da6c28aaSamw } 365da6c28aaSamw 366b24ab676SJeff Bonwick /* 367b24ab676SJeff Bonwick * Fast path for exact matching. 368b24ab676SJeff Bonwick * First check that the lengths match, so that we don't read 369b24ab676SJeff Bonwick * past the end of the zn_key_orig array. 370b24ab676SJeff Bonwick */ 371*486ae710SMatthew Ahrens if (array_numints != zn->zn_key_orig_numints) 372b24ab676SJeff Bonwick return (B_FALSE); 373*486ae710SMatthew Ahrens while (bseen < array_numints) { 374f65e61c0Sahrens struct zap_leaf_array *la = &ZAP_LEAF_CHUNK(l, chunk).l_array; 375*486ae710SMatthew Ahrens int toread = MIN(array_numints - bseen, ZAP_LEAF_ARRAY_BYTES); 376f65e61c0Sahrens ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l)); 377b24ab676SJeff Bonwick if (bcmp(la->la_array, (char *)zn->zn_key_orig + bseen, toread)) 378fa9e4066Sahrens break; 379fa9e4066Sahrens chunk = la->la_next; 380fa9e4066Sahrens bseen += toread; 381fa9e4066Sahrens } 382*486ae710SMatthew Ahrens return (bseen == array_numints); 383fa9e4066Sahrens } 384fa9e4066Sahrens 385fa9e4066Sahrens /* 386fa9e4066Sahrens * Routines which manipulate leaf entries. 387fa9e4066Sahrens */ 388fa9e4066Sahrens 389fa9e4066Sahrens int 390da6c28aaSamw zap_leaf_lookup(zap_leaf_t *l, zap_name_t *zn, zap_entry_handle_t *zeh) 391fa9e4066Sahrens { 392fa9e4066Sahrens uint16_t *chunkp; 393fa9e4066Sahrens struct zap_leaf_entry *le; 394fa9e4066Sahrens 39566328dd3Sahrens ASSERT3U(l->l_phys->l_hdr.lh_magic, ==, ZAP_LEAF_MAGIC); 396fa9e4066Sahrens 397da6c28aaSamw again: 398da6c28aaSamw for (chunkp = LEAF_HASH_ENTPTR(l, zn->zn_hash); 399fa9e4066Sahrens *chunkp != CHAIN_END; chunkp = &le->le_next) { 400fa9e4066Sahrens uint16_t chunk = *chunkp; 401f65e61c0Sahrens le = ZAP_LEAF_ENTRY(l, chunk); 402fa9e4066Sahrens 403f65e61c0Sahrens ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l)); 404f65e61c0Sahrens ASSERT3U(le->le_type, ==, ZAP_CHUNK_ENTRY); 405fa9e4066Sahrens 406da6c28aaSamw if (le->le_hash != zn->zn_hash) 407fa9e4066Sahrens continue; 408fa9e4066Sahrens 409da6c28aaSamw /* 410da6c28aaSamw * NB: the entry chain is always sorted by cd on 411da6c28aaSamw * normalized zap objects, so this will find the 412da6c28aaSamw * lowest-cd match for MT_FIRST. 413da6c28aaSamw */ 414da6c28aaSamw ASSERT(zn->zn_matchtype == MT_EXACT || 415da6c28aaSamw (l->l_phys->l_hdr.lh_flags & ZLF_ENTRIES_CDSORTED)); 416da6c28aaSamw if (zap_leaf_array_match(l, zn, le->le_name_chunk, 417*486ae710SMatthew Ahrens le->le_name_numints)) { 418*486ae710SMatthew Ahrens zeh->zeh_num_integers = le->le_value_numints; 419*486ae710SMatthew Ahrens zeh->zeh_integer_size = le->le_value_intlen; 420fa9e4066Sahrens zeh->zeh_cd = le->le_cd; 421fa9e4066Sahrens zeh->zeh_hash = le->le_hash; 422fa9e4066Sahrens zeh->zeh_chunkp = chunkp; 42366328dd3Sahrens zeh->zeh_leaf = l; 424fa9e4066Sahrens return (0); 425fa9e4066Sahrens } 426fa9e4066Sahrens } 427fa9e4066Sahrens 428da6c28aaSamw /* 429da6c28aaSamw * NB: we could of course do this in one pass, but that would be 430da6c28aaSamw * a pain. We'll see if MT_BEST is even used much. 431da6c28aaSamw */ 432da6c28aaSamw if (zn->zn_matchtype == MT_BEST) { 433da6c28aaSamw zn->zn_matchtype = MT_FIRST; 434da6c28aaSamw goto again; 435da6c28aaSamw } 436da6c28aaSamw 437fa9e4066Sahrens return (ENOENT); 438fa9e4066Sahrens } 439fa9e4066Sahrens 440fa9e4066Sahrens /* Return (h1,cd1 >= h2,cd2) */ 44187e5029aSahrens #define HCD_GTEQ(h1, cd1, h2, cd2) \ 44287e5029aSahrens ((h1 > h2) ? TRUE : ((h1 == h2 && cd1 >= cd2) ? TRUE : FALSE)) 443fa9e4066Sahrens 444fa9e4066Sahrens int 445fa9e4066Sahrens zap_leaf_lookup_closest(zap_leaf_t *l, 446fa9e4066Sahrens uint64_t h, uint32_t cd, zap_entry_handle_t *zeh) 447fa9e4066Sahrens { 448fa9e4066Sahrens uint16_t chunk; 449fa9e4066Sahrens uint64_t besth = -1ULL; 450b24ab676SJeff Bonwick uint32_t bestcd = -1U; 451f65e61c0Sahrens uint16_t bestlh = ZAP_LEAF_HASH_NUMENTRIES(l)-1; 452fa9e4066Sahrens uint16_t lh; 453fa9e4066Sahrens struct zap_leaf_entry *le; 454fa9e4066Sahrens 45566328dd3Sahrens ASSERT3U(l->l_phys->l_hdr.lh_magic, ==, ZAP_LEAF_MAGIC); 456fa9e4066Sahrens 457fa9e4066Sahrens for (lh = LEAF_HASH(l, h); lh <= bestlh; lh++) { 458fa9e4066Sahrens for (chunk = l->l_phys->l_hash[lh]; 459fa9e4066Sahrens chunk != CHAIN_END; chunk = le->le_next) { 460f65e61c0Sahrens le = ZAP_LEAF_ENTRY(l, chunk); 461fa9e4066Sahrens 462f65e61c0Sahrens ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l)); 463f65e61c0Sahrens ASSERT3U(le->le_type, ==, ZAP_CHUNK_ENTRY); 464fa9e4066Sahrens 46587e5029aSahrens if (HCD_GTEQ(le->le_hash, le->le_cd, h, cd) && 46687e5029aSahrens HCD_GTEQ(besth, bestcd, le->le_hash, le->le_cd)) { 467fa9e4066Sahrens ASSERT3U(bestlh, >=, lh); 468fa9e4066Sahrens bestlh = lh; 469fa9e4066Sahrens besth = le->le_hash; 470fa9e4066Sahrens bestcd = le->le_cd; 471fa9e4066Sahrens 472*486ae710SMatthew Ahrens zeh->zeh_num_integers = le->le_value_numints; 473*486ae710SMatthew Ahrens zeh->zeh_integer_size = le->le_value_intlen; 474fa9e4066Sahrens zeh->zeh_cd = le->le_cd; 475fa9e4066Sahrens zeh->zeh_hash = le->le_hash; 476fa9e4066Sahrens zeh->zeh_fakechunk = chunk; 477fa9e4066Sahrens zeh->zeh_chunkp = &zeh->zeh_fakechunk; 47866328dd3Sahrens zeh->zeh_leaf = l; 479fa9e4066Sahrens } 480fa9e4066Sahrens } 481fa9e4066Sahrens } 482fa9e4066Sahrens 483b24ab676SJeff Bonwick return (bestcd == -1U ? ENOENT : 0); 484fa9e4066Sahrens } 485fa9e4066Sahrens 486fa9e4066Sahrens int 487fa9e4066Sahrens zap_entry_read(const zap_entry_handle_t *zeh, 488fa9e4066Sahrens uint8_t integer_size, uint64_t num_integers, void *buf) 489fa9e4066Sahrens { 490f65e61c0Sahrens struct zap_leaf_entry *le = 49166328dd3Sahrens ZAP_LEAF_ENTRY(zeh->zeh_leaf, *zeh->zeh_chunkp); 492f65e61c0Sahrens ASSERT3U(le->le_type, ==, ZAP_CHUNK_ENTRY); 493fa9e4066Sahrens 494*486ae710SMatthew Ahrens if (le->le_value_intlen > integer_size) 495fa9e4066Sahrens return (EINVAL); 496fa9e4066Sahrens 497*486ae710SMatthew Ahrens zap_leaf_array_read(zeh->zeh_leaf, le->le_value_chunk, 498*486ae710SMatthew Ahrens le->le_value_intlen, le->le_value_numints, 499*486ae710SMatthew Ahrens integer_size, num_integers, buf); 500fa9e4066Sahrens 501fa9e4066Sahrens if (zeh->zeh_num_integers > num_integers) 502fa9e4066Sahrens return (EOVERFLOW); 503fa9e4066Sahrens return (0); 504fa9e4066Sahrens 505fa9e4066Sahrens } 506fa9e4066Sahrens 507fa9e4066Sahrens int 508b24ab676SJeff Bonwick zap_entry_read_name(zap_t *zap, const zap_entry_handle_t *zeh, uint16_t buflen, 509b24ab676SJeff Bonwick char *buf) 510fa9e4066Sahrens { 511f65e61c0Sahrens struct zap_leaf_entry *le = 51266328dd3Sahrens ZAP_LEAF_ENTRY(zeh->zeh_leaf, *zeh->zeh_chunkp); 513f65e61c0Sahrens ASSERT3U(le->le_type, ==, ZAP_CHUNK_ENTRY); 514fa9e4066Sahrens 515b24ab676SJeff Bonwick if (zap_getflags(zap) & ZAP_FLAG_UINT64_KEY) { 516b24ab676SJeff Bonwick zap_leaf_array_read(zeh->zeh_leaf, le->le_name_chunk, 8, 517*486ae710SMatthew Ahrens le->le_name_numints, 8, buflen / 8, buf); 518b24ab676SJeff Bonwick } else { 519b24ab676SJeff Bonwick zap_leaf_array_read(zeh->zeh_leaf, le->le_name_chunk, 1, 520*486ae710SMatthew Ahrens le->le_name_numints, 1, buflen, buf); 521b24ab676SJeff Bonwick } 522*486ae710SMatthew Ahrens if (le->le_name_numints > buflen) 523fa9e4066Sahrens return (EOVERFLOW); 524fa9e4066Sahrens return (0); 525fa9e4066Sahrens } 526fa9e4066Sahrens 527fa9e4066Sahrens int 528fa9e4066Sahrens zap_entry_update(zap_entry_handle_t *zeh, 529fa9e4066Sahrens uint8_t integer_size, uint64_t num_integers, const void *buf) 530fa9e4066Sahrens { 531fa9e4066Sahrens int delta_chunks; 53266328dd3Sahrens zap_leaf_t *l = zeh->zeh_leaf; 53366328dd3Sahrens struct zap_leaf_entry *le = ZAP_LEAF_ENTRY(l, *zeh->zeh_chunkp); 534fa9e4066Sahrens 53566328dd3Sahrens delta_chunks = ZAP_LEAF_ARRAY_NCHUNKS(num_integers * integer_size) - 536*486ae710SMatthew Ahrens ZAP_LEAF_ARRAY_NCHUNKS(le->le_value_numints * le->le_value_intlen); 537fa9e4066Sahrens 53866328dd3Sahrens if ((int)l->l_phys->l_hdr.lh_nfree < delta_chunks) 539fa9e4066Sahrens return (EAGAIN); 540fa9e4066Sahrens 541fa9e4066Sahrens /* 542fa9e4066Sahrens * We should search other chained leaves (via 543fa9e4066Sahrens * zap_entry_remove,create?) otherwise returning EAGAIN will 544fa9e4066Sahrens * just send us into an infinite loop if we have to chain 545fa9e4066Sahrens * another leaf block, rather than being able to split this 546fa9e4066Sahrens * block. 547fa9e4066Sahrens */ 548fa9e4066Sahrens 54966328dd3Sahrens zap_leaf_array_free(l, &le->le_value_chunk); 550fa9e4066Sahrens le->le_value_chunk = 55166328dd3Sahrens zap_leaf_array_create(l, buf, integer_size, num_integers); 552*486ae710SMatthew Ahrens le->le_value_numints = num_integers; 553*486ae710SMatthew Ahrens le->le_value_intlen = integer_size; 554fa9e4066Sahrens return (0); 555fa9e4066Sahrens } 556fa9e4066Sahrens 557fa9e4066Sahrens void 558fa9e4066Sahrens zap_entry_remove(zap_entry_handle_t *zeh) 559fa9e4066Sahrens { 560fa9e4066Sahrens uint16_t entry_chunk; 561fa9e4066Sahrens struct zap_leaf_entry *le; 56266328dd3Sahrens zap_leaf_t *l = zeh->zeh_leaf; 563fa9e4066Sahrens 564fa9e4066Sahrens ASSERT3P(zeh->zeh_chunkp, !=, &zeh->zeh_fakechunk); 565fa9e4066Sahrens 566fa9e4066Sahrens entry_chunk = *zeh->zeh_chunkp; 567f65e61c0Sahrens le = ZAP_LEAF_ENTRY(l, entry_chunk); 568f65e61c0Sahrens ASSERT3U(le->le_type, ==, ZAP_CHUNK_ENTRY); 569fa9e4066Sahrens 57066328dd3Sahrens zap_leaf_array_free(l, &le->le_name_chunk); 57166328dd3Sahrens zap_leaf_array_free(l, &le->le_value_chunk); 572fa9e4066Sahrens 573fa9e4066Sahrens *zeh->zeh_chunkp = le->le_next; 574fa9e4066Sahrens zap_leaf_chunk_free(l, entry_chunk); 575fa9e4066Sahrens 57666328dd3Sahrens l->l_phys->l_hdr.lh_nentries--; 577fa9e4066Sahrens } 578fa9e4066Sahrens 579fa9e4066Sahrens int 580b24ab676SJeff Bonwick zap_entry_create(zap_leaf_t *l, zap_name_t *zn, uint32_t cd, 581fa9e4066Sahrens uint8_t integer_size, uint64_t num_integers, const void *buf, 582fa9e4066Sahrens zap_entry_handle_t *zeh) 583fa9e4066Sahrens { 584fa9e4066Sahrens uint16_t chunk; 585fa9e4066Sahrens uint16_t *chunkp; 586fa9e4066Sahrens struct zap_leaf_entry *le; 587b24ab676SJeff Bonwick uint64_t valuelen; 588fa9e4066Sahrens int numchunks; 589b24ab676SJeff Bonwick uint64_t h = zn->zn_hash; 590fa9e4066Sahrens 591fa9e4066Sahrens valuelen = integer_size * num_integers; 592fa9e4066Sahrens 593*486ae710SMatthew Ahrens numchunks = 1 + ZAP_LEAF_ARRAY_NCHUNKS(zn->zn_key_orig_numints * 594*486ae710SMatthew Ahrens zn->zn_key_intlen) + ZAP_LEAF_ARRAY_NCHUNKS(valuelen); 595f65e61c0Sahrens if (numchunks > ZAP_LEAF_NUMCHUNKS(l)) 596fa9e4066Sahrens return (E2BIG); 597fa9e4066Sahrens 598b24ab676SJeff Bonwick if (cd == ZAP_NEED_CD) { 599da6c28aaSamw /* find the lowest unused cd */ 600da6c28aaSamw if (l->l_phys->l_hdr.lh_flags & ZLF_ENTRIES_CDSORTED) { 601da6c28aaSamw cd = 0; 602da6c28aaSamw 60366328dd3Sahrens for (chunk = *LEAF_HASH_ENTPTR(l, h); 60466328dd3Sahrens chunk != CHAIN_END; chunk = le->le_next) { 60566328dd3Sahrens le = ZAP_LEAF_ENTRY(l, chunk); 606da6c28aaSamw if (le->le_cd > cd) 607fa9e4066Sahrens break; 608da6c28aaSamw if (le->le_hash == h) { 609da6c28aaSamw ASSERT3U(cd, ==, le->le_cd); 610da6c28aaSamw cd++; 61166328dd3Sahrens } 612fa9e4066Sahrens } 613da6c28aaSamw } else { 614da6c28aaSamw /* old unsorted format; do it the O(n^2) way */ 615b24ab676SJeff Bonwick for (cd = 0; ; cd++) { 616da6c28aaSamw for (chunk = *LEAF_HASH_ENTPTR(l, h); 617da6c28aaSamw chunk != CHAIN_END; chunk = le->le_next) { 618da6c28aaSamw le = ZAP_LEAF_ENTRY(l, chunk); 619da6c28aaSamw if (le->le_hash == h && 620da6c28aaSamw le->le_cd == cd) { 621da6c28aaSamw break; 622da6c28aaSamw } 623da6c28aaSamw } 624da6c28aaSamw /* If this cd is not in use, we are good. */ 625da6c28aaSamw if (chunk == CHAIN_END) 626da6c28aaSamw break; 627da6c28aaSamw } 628fa9e4066Sahrens } 629da6c28aaSamw /* 630b24ab676SJeff Bonwick * We would run out of space in a block before we could 631b24ab676SJeff Bonwick * store enough entries to run out of CD values. 632da6c28aaSamw */ 633b24ab676SJeff Bonwick ASSERT3U(cd, <, zap_maxcd(zn->zn_zap)); 634fa9e4066Sahrens } 635fa9e4066Sahrens 63666328dd3Sahrens if (l->l_phys->l_hdr.lh_nfree < numchunks) 637fa9e4066Sahrens return (EAGAIN); 638fa9e4066Sahrens 639fa9e4066Sahrens /* make the entry */ 640fa9e4066Sahrens chunk = zap_leaf_chunk_alloc(l); 641f65e61c0Sahrens le = ZAP_LEAF_ENTRY(l, chunk); 642f65e61c0Sahrens le->le_type = ZAP_CHUNK_ENTRY; 643b24ab676SJeff Bonwick le->le_name_chunk = zap_leaf_array_create(l, zn->zn_key_orig, 644*486ae710SMatthew Ahrens zn->zn_key_intlen, zn->zn_key_orig_numints); 645*486ae710SMatthew Ahrens le->le_name_numints = zn->zn_key_orig_numints; 646fa9e4066Sahrens le->le_value_chunk = 64766328dd3Sahrens zap_leaf_array_create(l, buf, integer_size, num_integers); 648*486ae710SMatthew Ahrens le->le_value_numints = num_integers; 649*486ae710SMatthew Ahrens le->le_value_intlen = integer_size; 650fa9e4066Sahrens le->le_hash = h; 651fa9e4066Sahrens le->le_cd = cd; 652fa9e4066Sahrens 653fa9e4066Sahrens /* link it into the hash chain */ 654da6c28aaSamw /* XXX if we did the search above, we could just use that */ 655da6c28aaSamw chunkp = zap_leaf_rehash_entry(l, chunk); 656fa9e4066Sahrens 65766328dd3Sahrens l->l_phys->l_hdr.lh_nentries++; 658fa9e4066Sahrens 65966328dd3Sahrens zeh->zeh_leaf = l; 660fa9e4066Sahrens zeh->zeh_num_integers = num_integers; 661*486ae710SMatthew Ahrens zeh->zeh_integer_size = le->le_value_intlen; 662fa9e4066Sahrens zeh->zeh_cd = le->le_cd; 663fa9e4066Sahrens zeh->zeh_hash = le->le_hash; 664fa9e4066Sahrens zeh->zeh_chunkp = chunkp; 665fa9e4066Sahrens 666fa9e4066Sahrens return (0); 667fa9e4066Sahrens } 668fa9e4066Sahrens 669da6c28aaSamw /* 670da6c28aaSamw * Determine if there is another entry with the same normalized form. 671da6c28aaSamw * For performance purposes, either zn or name must be provided (the 672da6c28aaSamw * other can be NULL). Note, there usually won't be any hash 673da6c28aaSamw * conflicts, in which case we don't need the concatenated/normalized 674da6c28aaSamw * form of the name. But all callers have one of these on hand anyway, 675da6c28aaSamw * so might as well take advantage. A cleaner but slower interface 676da6c28aaSamw * would accept neither argument, and compute the normalized name as 677da6c28aaSamw * needed (using zap_name_alloc(zap_entry_read_name(zeh))). 678da6c28aaSamw */ 679da6c28aaSamw boolean_t 680da6c28aaSamw zap_entry_normalization_conflict(zap_entry_handle_t *zeh, zap_name_t *zn, 681da6c28aaSamw const char *name, zap_t *zap) 682da6c28aaSamw { 683da6c28aaSamw uint64_t chunk; 684da6c28aaSamw struct zap_leaf_entry *le; 685da6c28aaSamw boolean_t allocdzn = B_FALSE; 686da6c28aaSamw 687da6c28aaSamw if (zap->zap_normflags == 0) 688da6c28aaSamw return (B_FALSE); 689da6c28aaSamw 690da6c28aaSamw for (chunk = *LEAF_HASH_ENTPTR(zeh->zeh_leaf, zeh->zeh_hash); 691da6c28aaSamw chunk != CHAIN_END; chunk = le->le_next) { 692da6c28aaSamw le = ZAP_LEAF_ENTRY(zeh->zeh_leaf, chunk); 693da6c28aaSamw if (le->le_hash != zeh->zeh_hash) 694da6c28aaSamw continue; 695da6c28aaSamw if (le->le_cd == zeh->zeh_cd) 696da6c28aaSamw continue; 697da6c28aaSamw 698da6c28aaSamw if (zn == NULL) { 699da6c28aaSamw zn = zap_name_alloc(zap, name, MT_FIRST); 700da6c28aaSamw allocdzn = B_TRUE; 701da6c28aaSamw } 702da6c28aaSamw if (zap_leaf_array_match(zeh->zeh_leaf, zn, 703*486ae710SMatthew Ahrens le->le_name_chunk, le->le_name_numints)) { 704da6c28aaSamw if (allocdzn) 705da6c28aaSamw zap_name_free(zn); 706da6c28aaSamw return (B_TRUE); 707da6c28aaSamw } 708da6c28aaSamw } 709da6c28aaSamw if (allocdzn) 710da6c28aaSamw zap_name_free(zn); 711da6c28aaSamw return (B_FALSE); 712da6c28aaSamw } 713da6c28aaSamw 714fa9e4066Sahrens /* 715fa9e4066Sahrens * Routines for transferring entries between leafs. 716fa9e4066Sahrens */ 717fa9e4066Sahrens 718da6c28aaSamw static uint16_t * 719fa9e4066Sahrens zap_leaf_rehash_entry(zap_leaf_t *l, uint16_t entry) 720fa9e4066Sahrens { 721f65e61c0Sahrens struct zap_leaf_entry *le = ZAP_LEAF_ENTRY(l, entry); 722da6c28aaSamw struct zap_leaf_entry *le2; 723da6c28aaSamw uint16_t *chunkp; 724da6c28aaSamw 725da6c28aaSamw /* 726da6c28aaSamw * keep the entry chain sorted by cd 727da6c28aaSamw * NB: this will not cause problems for unsorted leafs, though 728da6c28aaSamw * it is unnecessary there. 729da6c28aaSamw */ 730da6c28aaSamw for (chunkp = LEAF_HASH_ENTPTR(l, le->le_hash); 731da6c28aaSamw *chunkp != CHAIN_END; chunkp = &le2->le_next) { 732da6c28aaSamw le2 = ZAP_LEAF_ENTRY(l, *chunkp); 733da6c28aaSamw if (le2->le_cd > le->le_cd) 734da6c28aaSamw break; 735da6c28aaSamw } 736da6c28aaSamw 737da6c28aaSamw le->le_next = *chunkp; 738da6c28aaSamw *chunkp = entry; 739da6c28aaSamw return (chunkp); 740fa9e4066Sahrens } 741fa9e4066Sahrens 742fa9e4066Sahrens static uint16_t 743fa9e4066Sahrens zap_leaf_transfer_array(zap_leaf_t *l, uint16_t chunk, zap_leaf_t *nl) 744fa9e4066Sahrens { 745fa9e4066Sahrens uint16_t new_chunk; 746fa9e4066Sahrens uint16_t *nchunkp = &new_chunk; 747fa9e4066Sahrens 748fa9e4066Sahrens while (chunk != CHAIN_END) { 749fa9e4066Sahrens uint16_t nchunk = zap_leaf_chunk_alloc(nl); 750fa9e4066Sahrens struct zap_leaf_array *nla = 751f65e61c0Sahrens &ZAP_LEAF_CHUNK(nl, nchunk).l_array; 752fa9e4066Sahrens struct zap_leaf_array *la = 753f65e61c0Sahrens &ZAP_LEAF_CHUNK(l, chunk).l_array; 754fa9e4066Sahrens int nextchunk = la->la_next; 755fa9e4066Sahrens 756f65e61c0Sahrens ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l)); 757f65e61c0Sahrens ASSERT3U(nchunk, <, ZAP_LEAF_NUMCHUNKS(l)); 758fa9e4066Sahrens 75966328dd3Sahrens *nla = *la; /* structure assignment */ 760fa9e4066Sahrens 761fa9e4066Sahrens zap_leaf_chunk_free(l, chunk); 762fa9e4066Sahrens chunk = nextchunk; 763fa9e4066Sahrens *nchunkp = nchunk; 764fa9e4066Sahrens nchunkp = &nla->la_next; 765fa9e4066Sahrens } 766fa9e4066Sahrens *nchunkp = CHAIN_END; 767fa9e4066Sahrens return (new_chunk); 768fa9e4066Sahrens } 769fa9e4066Sahrens 770fa9e4066Sahrens static void 77166328dd3Sahrens zap_leaf_transfer_entry(zap_leaf_t *l, int entry, zap_leaf_t *nl) 772fa9e4066Sahrens { 773fa9e4066Sahrens struct zap_leaf_entry *le, *nle; 77466328dd3Sahrens uint16_t chunk; 775fa9e4066Sahrens 776f65e61c0Sahrens le = ZAP_LEAF_ENTRY(l, entry); 777f65e61c0Sahrens ASSERT3U(le->le_type, ==, ZAP_CHUNK_ENTRY); 778fa9e4066Sahrens 779fa9e4066Sahrens chunk = zap_leaf_chunk_alloc(nl); 780f65e61c0Sahrens nle = ZAP_LEAF_ENTRY(nl, chunk); 78166328dd3Sahrens *nle = *le; /* structure assignment */ 782fa9e4066Sahrens 783da6c28aaSamw (void) zap_leaf_rehash_entry(nl, chunk); 784fa9e4066Sahrens 785fa9e4066Sahrens nle->le_name_chunk = zap_leaf_transfer_array(l, le->le_name_chunk, nl); 786fa9e4066Sahrens nle->le_value_chunk = 787fa9e4066Sahrens zap_leaf_transfer_array(l, le->le_value_chunk, nl); 788fa9e4066Sahrens 789fa9e4066Sahrens zap_leaf_chunk_free(l, entry); 790fa9e4066Sahrens 79166328dd3Sahrens l->l_phys->l_hdr.lh_nentries--; 79266328dd3Sahrens nl->l_phys->l_hdr.lh_nentries++; 793fa9e4066Sahrens } 794fa9e4066Sahrens 795fa9e4066Sahrens /* 79666328dd3Sahrens * Transfer the entries whose hash prefix ends in 1 to the new leaf. 797fa9e4066Sahrens */ 79866328dd3Sahrens void 799de8267e0Stimh zap_leaf_split(zap_leaf_t *l, zap_leaf_t *nl, boolean_t sort) 800fa9e4066Sahrens { 801fa9e4066Sahrens int i; 80266328dd3Sahrens int bit = 64 - 1 - l->l_phys->l_hdr.lh_prefix_len; 80366328dd3Sahrens 80466328dd3Sahrens /* set new prefix and prefix_len */ 80566328dd3Sahrens l->l_phys->l_hdr.lh_prefix <<= 1; 80666328dd3Sahrens l->l_phys->l_hdr.lh_prefix_len++; 80766328dd3Sahrens nl->l_phys->l_hdr.lh_prefix = l->l_phys->l_hdr.lh_prefix | 1; 80866328dd3Sahrens nl->l_phys->l_hdr.lh_prefix_len = l->l_phys->l_hdr.lh_prefix_len; 809fa9e4066Sahrens 810fa9e4066Sahrens /* break existing hash chains */ 811f65e61c0Sahrens zap_memset(l->l_phys->l_hash, CHAIN_END, 2*ZAP_LEAF_HASH_NUMENTRIES(l)); 812fa9e4066Sahrens 813de8267e0Stimh if (sort) 814da6c28aaSamw l->l_phys->l_hdr.lh_flags |= ZLF_ENTRIES_CDSORTED; 815da6c28aaSamw 81666328dd3Sahrens /* 81766328dd3Sahrens * Transfer entries whose hash bit 'bit' is set to nl; rehash 81866328dd3Sahrens * the remaining entries 81966328dd3Sahrens * 82066328dd3Sahrens * NB: We could find entries via the hashtable instead. That 82166328dd3Sahrens * would be O(hashents+numents) rather than O(numblks+numents), 82266328dd3Sahrens * but this accesses memory more sequentially, and when we're 82366328dd3Sahrens * called, the block is usually pretty full. 82466328dd3Sahrens */ 825f65e61c0Sahrens for (i = 0; i < ZAP_LEAF_NUMCHUNKS(l); i++) { 826f65e61c0Sahrens struct zap_leaf_entry *le = ZAP_LEAF_ENTRY(l, i); 827f65e61c0Sahrens if (le->le_type != ZAP_CHUNK_ENTRY) 828fa9e4066Sahrens continue; 829fa9e4066Sahrens 83066328dd3Sahrens if (le->le_hash & (1ULL << bit)) 83166328dd3Sahrens zap_leaf_transfer_entry(l, i, nl); 83266328dd3Sahrens else 833da6c28aaSamw (void) zap_leaf_rehash_entry(l, i); 834fa9e4066Sahrens } 835fa9e4066Sahrens } 836fa9e4066Sahrens 837fa9e4066Sahrens void 83866328dd3Sahrens zap_leaf_stats(zap_t *zap, zap_leaf_t *l, zap_stats_t *zs) 839fa9e4066Sahrens { 84066328dd3Sahrens int i, n; 841fa9e4066Sahrens 84266328dd3Sahrens n = zap->zap_f.zap_phys->zap_ptrtbl.zt_shift - 84366328dd3Sahrens l->l_phys->l_hdr.lh_prefix_len; 844fa9e4066Sahrens n = MIN(n, ZAP_HISTOGRAM_SIZE-1); 845fa9e4066Sahrens zs->zs_leafs_with_2n_pointers[n]++; 846fa9e4066Sahrens 847fa9e4066Sahrens 84866328dd3Sahrens n = l->l_phys->l_hdr.lh_nentries/5; 84966328dd3Sahrens n = MIN(n, ZAP_HISTOGRAM_SIZE-1); 85066328dd3Sahrens zs->zs_blocks_with_n5_entries[n]++; 851fa9e4066Sahrens 85266328dd3Sahrens n = ((1<<FZAP_BLOCK_SHIFT(zap)) - 85366328dd3Sahrens l->l_phys->l_hdr.lh_nfree * (ZAP_LEAF_ARRAY_BYTES+1))*10 / 85466328dd3Sahrens (1<<FZAP_BLOCK_SHIFT(zap)); 85566328dd3Sahrens n = MIN(n, ZAP_HISTOGRAM_SIZE-1); 85666328dd3Sahrens zs->zs_blocks_n_tenths_full[n]++; 857fa9e4066Sahrens 85866328dd3Sahrens for (i = 0; i < ZAP_LEAF_HASH_NUMENTRIES(l); i++) { 85966328dd3Sahrens int nentries = 0; 86066328dd3Sahrens int chunk = l->l_phys->l_hash[i]; 861fa9e4066Sahrens 86266328dd3Sahrens while (chunk != CHAIN_END) { 86366328dd3Sahrens struct zap_leaf_entry *le = 86466328dd3Sahrens ZAP_LEAF_ENTRY(l, chunk); 865fa9e4066Sahrens 866*486ae710SMatthew Ahrens n = 1 + ZAP_LEAF_ARRAY_NCHUNKS(le->le_name_numints) + 867*486ae710SMatthew Ahrens ZAP_LEAF_ARRAY_NCHUNKS(le->le_value_numints * 868*486ae710SMatthew Ahrens le->le_value_intlen); 869fa9e4066Sahrens n = MIN(n, ZAP_HISTOGRAM_SIZE-1); 87066328dd3Sahrens zs->zs_entries_using_n_chunks[n]++; 871fa9e4066Sahrens 87266328dd3Sahrens chunk = le->le_next; 87366328dd3Sahrens nentries++; 87466328dd3Sahrens } 875fa9e4066Sahrens 87666328dd3Sahrens n = nentries; 87766328dd3Sahrens n = MIN(n, ZAP_HISTOGRAM_SIZE-1); 87866328dd3Sahrens zs->zs_buckets_with_n_entries[n]++; 87966328dd3Sahrens } 880fa9e4066Sahrens } 881