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 /* 223f9d6ad7SLin Ling * Copyright (c) 2005, 2010, Oracle and/or its affiliates. All rights reserved. 23*be6fd75aSMatthew Ahrens * Copyright (c) 2013 by Delphix. All rights reserved. 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> 403f9d6ad7SLin Ling #include <sys/arc.h> 41fa9e4066Sahrens 42da6c28aaSamw static uint16_t *zap_leaf_rehash_entry(zap_leaf_t *l, uint16_t entry); 43da6c28aaSamw 44fa9e4066Sahrens #define CHAIN_END 0xffff /* end of the chunk chain */ 45fa9e4066Sahrens 46f65e61c0Sahrens /* half the (current) minimum block size */ 47fa9e4066Sahrens #define MAX_ARRAY_BYTES (8<<10) 48fa9e4066Sahrens 49fa9e4066Sahrens #define LEAF_HASH(l, h) \ 50f65e61c0Sahrens ((ZAP_LEAF_HASH_NUMENTRIES(l)-1) & \ 5166328dd3Sahrens ((h) >> (64 - ZAP_LEAF_HASH_SHIFT(l)-(l)->l_phys->l_hdr.lh_prefix_len))) 52fa9e4066Sahrens 53fa9e4066Sahrens #define LEAF_HASH_ENTPTR(l, h) (&(l)->l_phys->l_hash[LEAF_HASH(l, h)]) 54fa9e4066Sahrens 55fa9e4066Sahrens 56fa9e4066Sahrens static void 57fa9e4066Sahrens zap_memset(void *a, int c, size_t n) 58fa9e4066Sahrens { 59fa9e4066Sahrens char *cp = a; 60fa9e4066Sahrens char *cpend = cp + n; 61fa9e4066Sahrens 62fa9e4066Sahrens while (cp < cpend) 63fa9e4066Sahrens *cp++ = c; 64fa9e4066Sahrens } 65fa9e4066Sahrens 66fa9e4066Sahrens static void 67fa9e4066Sahrens stv(int len, void *addr, uint64_t value) 68fa9e4066Sahrens { 69fa9e4066Sahrens switch (len) { 70fa9e4066Sahrens case 1: 71fa9e4066Sahrens *(uint8_t *)addr = value; 72fa9e4066Sahrens return; 73fa9e4066Sahrens case 2: 74fa9e4066Sahrens *(uint16_t *)addr = value; 75fa9e4066Sahrens return; 76fa9e4066Sahrens case 4: 77fa9e4066Sahrens *(uint32_t *)addr = value; 78fa9e4066Sahrens return; 79fa9e4066Sahrens case 8: 80fa9e4066Sahrens *(uint64_t *)addr = value; 81fa9e4066Sahrens return; 82fa9e4066Sahrens } 83fa9e4066Sahrens ASSERT(!"bad int len"); 84fa9e4066Sahrens } 85fa9e4066Sahrens 86fa9e4066Sahrens static uint64_t 87fa9e4066Sahrens ldv(int len, const void *addr) 88fa9e4066Sahrens { 89fa9e4066Sahrens switch (len) { 90fa9e4066Sahrens case 1: 91fa9e4066Sahrens return (*(uint8_t *)addr); 92fa9e4066Sahrens case 2: 93fa9e4066Sahrens return (*(uint16_t *)addr); 94fa9e4066Sahrens case 4: 95fa9e4066Sahrens return (*(uint32_t *)addr); 96fa9e4066Sahrens case 8: 97fa9e4066Sahrens return (*(uint64_t *)addr); 98fa9e4066Sahrens } 99fa9e4066Sahrens ASSERT(!"bad int len"); 1005ad82045Snd return (0xFEEDFACEDEADBEEFULL); 101fa9e4066Sahrens } 102fa9e4066Sahrens 103fa9e4066Sahrens void 104f65e61c0Sahrens zap_leaf_byteswap(zap_leaf_phys_t *buf, int size) 105fa9e4066Sahrens { 106fa9e4066Sahrens int i; 107f65e61c0Sahrens zap_leaf_t l; 108f65e61c0Sahrens l.l_bs = highbit(size)-1; 109f65e61c0Sahrens l.l_phys = buf; 110fa9e4066Sahrens 11166328dd3Sahrens buf->l_hdr.lh_block_type = BSWAP_64(buf->l_hdr.lh_block_type); 11266328dd3Sahrens buf->l_hdr.lh_prefix = BSWAP_64(buf->l_hdr.lh_prefix); 11366328dd3Sahrens buf->l_hdr.lh_magic = BSWAP_32(buf->l_hdr.lh_magic); 11466328dd3Sahrens buf->l_hdr.lh_nfree = BSWAP_16(buf->l_hdr.lh_nfree); 11566328dd3Sahrens buf->l_hdr.lh_nentries = BSWAP_16(buf->l_hdr.lh_nentries); 11666328dd3Sahrens buf->l_hdr.lh_prefix_len = BSWAP_16(buf->l_hdr.lh_prefix_len); 117fa9e4066Sahrens buf->l_hdr.lh_freelist = BSWAP_16(buf->l_hdr.lh_freelist); 118fa9e4066Sahrens 119f65e61c0Sahrens for (i = 0; i < ZAP_LEAF_HASH_NUMENTRIES(&l); i++) 120fa9e4066Sahrens buf->l_hash[i] = BSWAP_16(buf->l_hash[i]); 121fa9e4066Sahrens 122f65e61c0Sahrens for (i = 0; i < ZAP_LEAF_NUMCHUNKS(&l); i++) { 123f65e61c0Sahrens zap_leaf_chunk_t *lc = &ZAP_LEAF_CHUNK(&l, i); 124fa9e4066Sahrens struct zap_leaf_entry *le; 125fa9e4066Sahrens 126f65e61c0Sahrens switch (lc->l_free.lf_type) { 127f65e61c0Sahrens case ZAP_CHUNK_ENTRY: 128f65e61c0Sahrens le = &lc->l_entry; 129fa9e4066Sahrens 13066328dd3Sahrens le->le_type = BSWAP_8(le->le_type); 131486ae710SMatthew Ahrens le->le_value_intlen = BSWAP_8(le->le_value_intlen); 13266328dd3Sahrens le->le_next = BSWAP_16(le->le_next); 13366328dd3Sahrens le->le_name_chunk = BSWAP_16(le->le_name_chunk); 134486ae710SMatthew Ahrens le->le_name_numints = BSWAP_16(le->le_name_numints); 13566328dd3Sahrens le->le_value_chunk = BSWAP_16(le->le_value_chunk); 136486ae710SMatthew Ahrens le->le_value_numints = BSWAP_16(le->le_value_numints); 13766328dd3Sahrens le->le_cd = BSWAP_32(le->le_cd); 13866328dd3Sahrens le->le_hash = BSWAP_64(le->le_hash); 139fa9e4066Sahrens break; 140f65e61c0Sahrens case ZAP_CHUNK_FREE: 14166328dd3Sahrens lc->l_free.lf_type = BSWAP_8(lc->l_free.lf_type); 14266328dd3Sahrens lc->l_free.lf_next = BSWAP_16(lc->l_free.lf_next); 143fa9e4066Sahrens break; 144f65e61c0Sahrens case ZAP_CHUNK_ARRAY: 14566328dd3Sahrens lc->l_array.la_type = BSWAP_8(lc->l_array.la_type); 14666328dd3Sahrens lc->l_array.la_next = BSWAP_16(lc->l_array.la_next); 147fa9e4066Sahrens /* la_array doesn't need swapping */ 148fa9e4066Sahrens break; 149fa9e4066Sahrens default: 150fa9e4066Sahrens ASSERT(!"bad leaf type"); 151fa9e4066Sahrens } 152fa9e4066Sahrens } 153fa9e4066Sahrens } 154fa9e4066Sahrens 155fa9e4066Sahrens void 156de8267e0Stimh zap_leaf_init(zap_leaf_t *l, boolean_t sort) 157fa9e4066Sahrens { 158fa9e4066Sahrens int i; 159fa9e4066Sahrens 160f65e61c0Sahrens l->l_bs = highbit(l->l_dbuf->db_size)-1; 161fa9e4066Sahrens zap_memset(&l->l_phys->l_hdr, 0, sizeof (struct zap_leaf_header)); 162f65e61c0Sahrens zap_memset(l->l_phys->l_hash, CHAIN_END, 2*ZAP_LEAF_HASH_NUMENTRIES(l)); 163f65e61c0Sahrens for (i = 0; i < ZAP_LEAF_NUMCHUNKS(l); i++) { 164f65e61c0Sahrens ZAP_LEAF_CHUNK(l, i).l_free.lf_type = ZAP_CHUNK_FREE; 165f65e61c0Sahrens ZAP_LEAF_CHUNK(l, i).l_free.lf_next = i+1; 166fa9e4066Sahrens } 167f65e61c0Sahrens ZAP_LEAF_CHUNK(l, ZAP_LEAF_NUMCHUNKS(l)-1).l_free.lf_next = CHAIN_END; 16866328dd3Sahrens l->l_phys->l_hdr.lh_block_type = ZBT_LEAF; 16966328dd3Sahrens l->l_phys->l_hdr.lh_magic = ZAP_LEAF_MAGIC; 17066328dd3Sahrens l->l_phys->l_hdr.lh_nfree = ZAP_LEAF_NUMCHUNKS(l); 171de8267e0Stimh if (sort) 172da6c28aaSamw l->l_phys->l_hdr.lh_flags |= ZLF_ENTRIES_CDSORTED; 173fa9e4066Sahrens } 174fa9e4066Sahrens 175fa9e4066Sahrens /* 176fa9e4066Sahrens * Routines which manipulate leaf chunks (l_chunk[]). 177fa9e4066Sahrens */ 178fa9e4066Sahrens 179fa9e4066Sahrens static uint16_t 180fa9e4066Sahrens zap_leaf_chunk_alloc(zap_leaf_t *l) 181fa9e4066Sahrens { 182fa9e4066Sahrens int chunk; 183fa9e4066Sahrens 18466328dd3Sahrens ASSERT(l->l_phys->l_hdr.lh_nfree > 0); 185fa9e4066Sahrens 186fa9e4066Sahrens chunk = l->l_phys->l_hdr.lh_freelist; 187f65e61c0Sahrens ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l)); 188f65e61c0Sahrens ASSERT3U(ZAP_LEAF_CHUNK(l, chunk).l_free.lf_type, ==, ZAP_CHUNK_FREE); 189fa9e4066Sahrens 190f65e61c0Sahrens l->l_phys->l_hdr.lh_freelist = ZAP_LEAF_CHUNK(l, chunk).l_free.lf_next; 191fa9e4066Sahrens 19266328dd3Sahrens l->l_phys->l_hdr.lh_nfree--; 193fa9e4066Sahrens 194fa9e4066Sahrens return (chunk); 195fa9e4066Sahrens } 196fa9e4066Sahrens 197fa9e4066Sahrens static void 198fa9e4066Sahrens zap_leaf_chunk_free(zap_leaf_t *l, uint16_t chunk) 199fa9e4066Sahrens { 200f65e61c0Sahrens struct zap_leaf_free *zlf = &ZAP_LEAF_CHUNK(l, chunk).l_free; 20166328dd3Sahrens ASSERT3U(l->l_phys->l_hdr.lh_nfree, <, ZAP_LEAF_NUMCHUNKS(l)); 202f65e61c0Sahrens ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l)); 203f65e61c0Sahrens ASSERT(zlf->lf_type != ZAP_CHUNK_FREE); 204fa9e4066Sahrens 205f65e61c0Sahrens zlf->lf_type = ZAP_CHUNK_FREE; 206fa9e4066Sahrens zlf->lf_next = l->l_phys->l_hdr.lh_freelist; 207fa9e4066Sahrens bzero(zlf->lf_pad, sizeof (zlf->lf_pad)); /* help it to compress */ 208fa9e4066Sahrens l->l_phys->l_hdr.lh_freelist = chunk; 209fa9e4066Sahrens 21066328dd3Sahrens l->l_phys->l_hdr.lh_nfree++; 211fa9e4066Sahrens } 212fa9e4066Sahrens 213fa9e4066Sahrens /* 214fa9e4066Sahrens * Routines which manipulate leaf arrays (zap_leaf_array type chunks). 215fa9e4066Sahrens */ 216fa9e4066Sahrens 217fa9e4066Sahrens static uint16_t 21866328dd3Sahrens zap_leaf_array_create(zap_leaf_t *l, const char *buf, 219486ae710SMatthew Ahrens int integer_size, int num_integers) 220fa9e4066Sahrens { 221fa9e4066Sahrens uint16_t chunk_head; 222fa9e4066Sahrens uint16_t *chunkp = &chunk_head; 223fa9e4066Sahrens int byten = 0; 224d5285caeSGeorge Wilson uint64_t value = 0; 225fa9e4066Sahrens int shift = (integer_size-1)*8; 226fa9e4066Sahrens int len = num_integers; 227fa9e4066Sahrens 228fa9e4066Sahrens ASSERT3U(num_integers * integer_size, <, MAX_ARRAY_BYTES); 229fa9e4066Sahrens 230fa9e4066Sahrens while (len > 0) { 231fa9e4066Sahrens uint16_t chunk = zap_leaf_chunk_alloc(l); 232f65e61c0Sahrens struct zap_leaf_array *la = &ZAP_LEAF_CHUNK(l, chunk).l_array; 233fa9e4066Sahrens int i; 234fa9e4066Sahrens 235f65e61c0Sahrens la->la_type = ZAP_CHUNK_ARRAY; 236fa9e4066Sahrens for (i = 0; i < ZAP_LEAF_ARRAY_BYTES; i++) { 237fa9e4066Sahrens if (byten == 0) 238fa9e4066Sahrens value = ldv(integer_size, buf); 239c5608ce5Sahrens la->la_array[i] = value >> shift; 240fa9e4066Sahrens value <<= 8; 241fa9e4066Sahrens if (++byten == integer_size) { 242fa9e4066Sahrens byten = 0; 243fa9e4066Sahrens buf += integer_size; 244fa9e4066Sahrens if (--len == 0) 245fa9e4066Sahrens break; 246fa9e4066Sahrens } 247fa9e4066Sahrens } 248fa9e4066Sahrens 249fa9e4066Sahrens *chunkp = chunk; 250fa9e4066Sahrens chunkp = &la->la_next; 251fa9e4066Sahrens } 252fa9e4066Sahrens *chunkp = CHAIN_END; 253fa9e4066Sahrens 254fa9e4066Sahrens return (chunk_head); 255fa9e4066Sahrens } 256fa9e4066Sahrens 257fa9e4066Sahrens static void 25866328dd3Sahrens zap_leaf_array_free(zap_leaf_t *l, uint16_t *chunkp) 259fa9e4066Sahrens { 260fa9e4066Sahrens uint16_t chunk = *chunkp; 261fa9e4066Sahrens 262fa9e4066Sahrens *chunkp = CHAIN_END; 263fa9e4066Sahrens 264fa9e4066Sahrens while (chunk != CHAIN_END) { 265f65e61c0Sahrens int nextchunk = ZAP_LEAF_CHUNK(l, chunk).l_array.la_next; 266f65e61c0Sahrens ASSERT3U(ZAP_LEAF_CHUNK(l, chunk).l_array.la_type, ==, 267f65e61c0Sahrens ZAP_CHUNK_ARRAY); 268fa9e4066Sahrens zap_leaf_chunk_free(l, chunk); 269fa9e4066Sahrens chunk = nextchunk; 270fa9e4066Sahrens } 271fa9e4066Sahrens } 272fa9e4066Sahrens 273fa9e4066Sahrens /* array_len and buf_len are in integers, not bytes */ 274fa9e4066Sahrens static void 27566328dd3Sahrens zap_leaf_array_read(zap_leaf_t *l, uint16_t chunk, 276fa9e4066Sahrens int array_int_len, int array_len, int buf_int_len, uint64_t buf_len, 277b24ab676SJeff Bonwick void *buf) 278fa9e4066Sahrens { 279fa9e4066Sahrens int len = MIN(array_len, buf_len); 280fa9e4066Sahrens int byten = 0; 281fa9e4066Sahrens uint64_t value = 0; 282b24ab676SJeff Bonwick char *p = buf; 283fa9e4066Sahrens 284fa9e4066Sahrens ASSERT3U(array_int_len, <=, buf_int_len); 285fa9e4066Sahrens 28687e5029aSahrens /* Fast path for one 8-byte integer */ 28787e5029aSahrens if (array_int_len == 8 && buf_int_len == 8 && len == 1) { 288f65e61c0Sahrens struct zap_leaf_array *la = &ZAP_LEAF_CHUNK(l, chunk).l_array; 2899621b9b1Sbonwick uint8_t *ip = la->la_array; 290b24ab676SJeff Bonwick uint64_t *buf64 = buf; 2919621b9b1Sbonwick 2929621b9b1Sbonwick *buf64 = (uint64_t)ip[0] << 56 | (uint64_t)ip[1] << 48 | 2939621b9b1Sbonwick (uint64_t)ip[2] << 40 | (uint64_t)ip[3] << 32 | 2949621b9b1Sbonwick (uint64_t)ip[4] << 24 | (uint64_t)ip[5] << 16 | 2959621b9b1Sbonwick (uint64_t)ip[6] << 8 | (uint64_t)ip[7]; 29687e5029aSahrens return; 29787e5029aSahrens } 29887e5029aSahrens 29987e5029aSahrens /* Fast path for an array of 1-byte integers (eg. the entry name) */ 30087e5029aSahrens if (array_int_len == 1 && buf_int_len == 1 && 30187e5029aSahrens buf_len > array_len + ZAP_LEAF_ARRAY_BYTES) { 30287e5029aSahrens while (chunk != CHAIN_END) { 30387e5029aSahrens struct zap_leaf_array *la = 304f65e61c0Sahrens &ZAP_LEAF_CHUNK(l, chunk).l_array; 305b24ab676SJeff Bonwick bcopy(la->la_array, p, ZAP_LEAF_ARRAY_BYTES); 306b24ab676SJeff Bonwick p += ZAP_LEAF_ARRAY_BYTES; 30787e5029aSahrens chunk = la->la_next; 30887e5029aSahrens } 30987e5029aSahrens return; 31087e5029aSahrens } 31187e5029aSahrens 312fa9e4066Sahrens while (len > 0) { 313f65e61c0Sahrens struct zap_leaf_array *la = &ZAP_LEAF_CHUNK(l, chunk).l_array; 314fa9e4066Sahrens int i; 315fa9e4066Sahrens 316f65e61c0Sahrens ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l)); 317fa9e4066Sahrens for (i = 0; i < ZAP_LEAF_ARRAY_BYTES && len > 0; i++) { 318fa9e4066Sahrens value = (value << 8) | la->la_array[i]; 319fa9e4066Sahrens byten++; 320fa9e4066Sahrens if (byten == array_int_len) { 321b24ab676SJeff Bonwick stv(buf_int_len, p, value); 322fa9e4066Sahrens byten = 0; 323fa9e4066Sahrens len--; 324fa9e4066Sahrens if (len == 0) 325fa9e4066Sahrens return; 326b24ab676SJeff Bonwick p += buf_int_len; 327fa9e4066Sahrens } 328fa9e4066Sahrens } 329fa9e4066Sahrens chunk = la->la_next; 330fa9e4066Sahrens } 331fa9e4066Sahrens } 332fa9e4066Sahrens 333da6c28aaSamw static boolean_t 334486ae710SMatthew Ahrens zap_leaf_array_match(zap_leaf_t *l, zap_name_t *zn, 335486ae710SMatthew Ahrens int chunk, int array_numints) 336fa9e4066Sahrens { 337fa9e4066Sahrens int bseen = 0; 338fa9e4066Sahrens 339b24ab676SJeff Bonwick if (zap_getflags(zn->zn_zap) & ZAP_FLAG_UINT64_KEY) { 340b24ab676SJeff Bonwick uint64_t *thiskey; 341b24ab676SJeff Bonwick boolean_t match; 342b24ab676SJeff Bonwick 343b24ab676SJeff Bonwick ASSERT(zn->zn_key_intlen == sizeof (*thiskey)); 344486ae710SMatthew Ahrens thiskey = kmem_alloc(array_numints * sizeof (*thiskey), 345486ae710SMatthew Ahrens KM_SLEEP); 346b24ab676SJeff Bonwick 347486ae710SMatthew Ahrens zap_leaf_array_read(l, chunk, sizeof (*thiskey), array_numints, 348486ae710SMatthew Ahrens sizeof (*thiskey), array_numints, thiskey); 349b24ab676SJeff Bonwick match = bcmp(thiskey, zn->zn_key_orig, 350486ae710SMatthew Ahrens array_numints * sizeof (*thiskey)) == 0; 351486ae710SMatthew Ahrens kmem_free(thiskey, array_numints * sizeof (*thiskey)); 352b24ab676SJeff Bonwick return (match); 353b24ab676SJeff Bonwick } 354b24ab676SJeff Bonwick 355486ae710SMatthew Ahrens ASSERT(zn->zn_key_intlen == 1); 356da6c28aaSamw if (zn->zn_matchtype == MT_FIRST) { 357486ae710SMatthew Ahrens char *thisname = kmem_alloc(array_numints, KM_SLEEP); 358da6c28aaSamw boolean_t match; 359da6c28aaSamw 360486ae710SMatthew Ahrens zap_leaf_array_read(l, chunk, sizeof (char), array_numints, 361486ae710SMatthew Ahrens sizeof (char), array_numints, thisname); 362da6c28aaSamw match = zap_match(zn, thisname); 363486ae710SMatthew Ahrens kmem_free(thisname, array_numints); 364da6c28aaSamw return (match); 365da6c28aaSamw } 366da6c28aaSamw 367b24ab676SJeff Bonwick /* 368b24ab676SJeff Bonwick * Fast path for exact matching. 369b24ab676SJeff Bonwick * First check that the lengths match, so that we don't read 370b24ab676SJeff Bonwick * past the end of the zn_key_orig array. 371b24ab676SJeff Bonwick */ 372486ae710SMatthew Ahrens if (array_numints != zn->zn_key_orig_numints) 373b24ab676SJeff Bonwick return (B_FALSE); 374486ae710SMatthew Ahrens while (bseen < array_numints) { 375f65e61c0Sahrens struct zap_leaf_array *la = &ZAP_LEAF_CHUNK(l, chunk).l_array; 376486ae710SMatthew Ahrens int toread = MIN(array_numints - bseen, ZAP_LEAF_ARRAY_BYTES); 377f65e61c0Sahrens ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l)); 378b24ab676SJeff Bonwick if (bcmp(la->la_array, (char *)zn->zn_key_orig + bseen, toread)) 379fa9e4066Sahrens break; 380fa9e4066Sahrens chunk = la->la_next; 381fa9e4066Sahrens bseen += toread; 382fa9e4066Sahrens } 383486ae710SMatthew Ahrens return (bseen == array_numints); 384fa9e4066Sahrens } 385fa9e4066Sahrens 386fa9e4066Sahrens /* 387fa9e4066Sahrens * Routines which manipulate leaf entries. 388fa9e4066Sahrens */ 389fa9e4066Sahrens 390fa9e4066Sahrens int 391da6c28aaSamw zap_leaf_lookup(zap_leaf_t *l, zap_name_t *zn, zap_entry_handle_t *zeh) 392fa9e4066Sahrens { 393fa9e4066Sahrens uint16_t *chunkp; 394fa9e4066Sahrens struct zap_leaf_entry *le; 395fa9e4066Sahrens 39666328dd3Sahrens ASSERT3U(l->l_phys->l_hdr.lh_magic, ==, ZAP_LEAF_MAGIC); 397fa9e4066Sahrens 398da6c28aaSamw again: 399da6c28aaSamw for (chunkp = LEAF_HASH_ENTPTR(l, zn->zn_hash); 400fa9e4066Sahrens *chunkp != CHAIN_END; chunkp = &le->le_next) { 401fa9e4066Sahrens uint16_t chunk = *chunkp; 402f65e61c0Sahrens le = ZAP_LEAF_ENTRY(l, chunk); 403fa9e4066Sahrens 404f65e61c0Sahrens ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l)); 405f65e61c0Sahrens ASSERT3U(le->le_type, ==, ZAP_CHUNK_ENTRY); 406fa9e4066Sahrens 407da6c28aaSamw if (le->le_hash != zn->zn_hash) 408fa9e4066Sahrens continue; 409fa9e4066Sahrens 410da6c28aaSamw /* 411da6c28aaSamw * NB: the entry chain is always sorted by cd on 412da6c28aaSamw * normalized zap objects, so this will find the 413da6c28aaSamw * lowest-cd match for MT_FIRST. 414da6c28aaSamw */ 415da6c28aaSamw ASSERT(zn->zn_matchtype == MT_EXACT || 416da6c28aaSamw (l->l_phys->l_hdr.lh_flags & ZLF_ENTRIES_CDSORTED)); 417da6c28aaSamw if (zap_leaf_array_match(l, zn, le->le_name_chunk, 418486ae710SMatthew Ahrens le->le_name_numints)) { 419486ae710SMatthew Ahrens zeh->zeh_num_integers = le->le_value_numints; 420486ae710SMatthew Ahrens zeh->zeh_integer_size = le->le_value_intlen; 421fa9e4066Sahrens zeh->zeh_cd = le->le_cd; 422fa9e4066Sahrens zeh->zeh_hash = le->le_hash; 423fa9e4066Sahrens zeh->zeh_chunkp = chunkp; 42466328dd3Sahrens zeh->zeh_leaf = l; 425fa9e4066Sahrens return (0); 426fa9e4066Sahrens } 427fa9e4066Sahrens } 428fa9e4066Sahrens 429da6c28aaSamw /* 430da6c28aaSamw * NB: we could of course do this in one pass, but that would be 431da6c28aaSamw * a pain. We'll see if MT_BEST is even used much. 432da6c28aaSamw */ 433da6c28aaSamw if (zn->zn_matchtype == MT_BEST) { 434da6c28aaSamw zn->zn_matchtype = MT_FIRST; 435da6c28aaSamw goto again; 436da6c28aaSamw } 437da6c28aaSamw 438*be6fd75aSMatthew Ahrens return (SET_ERROR(ENOENT)); 439fa9e4066Sahrens } 440fa9e4066Sahrens 441fa9e4066Sahrens /* Return (h1,cd1 >= h2,cd2) */ 44287e5029aSahrens #define HCD_GTEQ(h1, cd1, h2, cd2) \ 44387e5029aSahrens ((h1 > h2) ? TRUE : ((h1 == h2 && cd1 >= cd2) ? TRUE : FALSE)) 444fa9e4066Sahrens 445fa9e4066Sahrens int 446fa9e4066Sahrens zap_leaf_lookup_closest(zap_leaf_t *l, 447fa9e4066Sahrens uint64_t h, uint32_t cd, zap_entry_handle_t *zeh) 448fa9e4066Sahrens { 449fa9e4066Sahrens uint16_t chunk; 450fa9e4066Sahrens uint64_t besth = -1ULL; 451b24ab676SJeff Bonwick uint32_t bestcd = -1U; 452f65e61c0Sahrens uint16_t bestlh = ZAP_LEAF_HASH_NUMENTRIES(l)-1; 453fa9e4066Sahrens uint16_t lh; 454fa9e4066Sahrens struct zap_leaf_entry *le; 455fa9e4066Sahrens 45666328dd3Sahrens ASSERT3U(l->l_phys->l_hdr.lh_magic, ==, ZAP_LEAF_MAGIC); 457fa9e4066Sahrens 458fa9e4066Sahrens for (lh = LEAF_HASH(l, h); lh <= bestlh; lh++) { 459fa9e4066Sahrens for (chunk = l->l_phys->l_hash[lh]; 460fa9e4066Sahrens chunk != CHAIN_END; chunk = le->le_next) { 461f65e61c0Sahrens le = ZAP_LEAF_ENTRY(l, chunk); 462fa9e4066Sahrens 463f65e61c0Sahrens ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l)); 464f65e61c0Sahrens ASSERT3U(le->le_type, ==, ZAP_CHUNK_ENTRY); 465fa9e4066Sahrens 46687e5029aSahrens if (HCD_GTEQ(le->le_hash, le->le_cd, h, cd) && 46787e5029aSahrens HCD_GTEQ(besth, bestcd, le->le_hash, le->le_cd)) { 468fa9e4066Sahrens ASSERT3U(bestlh, >=, lh); 469fa9e4066Sahrens bestlh = lh; 470fa9e4066Sahrens besth = le->le_hash; 471fa9e4066Sahrens bestcd = le->le_cd; 472fa9e4066Sahrens 473486ae710SMatthew Ahrens zeh->zeh_num_integers = le->le_value_numints; 474486ae710SMatthew Ahrens zeh->zeh_integer_size = le->le_value_intlen; 475fa9e4066Sahrens zeh->zeh_cd = le->le_cd; 476fa9e4066Sahrens zeh->zeh_hash = le->le_hash; 477fa9e4066Sahrens zeh->zeh_fakechunk = chunk; 478fa9e4066Sahrens zeh->zeh_chunkp = &zeh->zeh_fakechunk; 47966328dd3Sahrens zeh->zeh_leaf = l; 480fa9e4066Sahrens } 481fa9e4066Sahrens } 482fa9e4066Sahrens } 483fa9e4066Sahrens 484b24ab676SJeff Bonwick return (bestcd == -1U ? ENOENT : 0); 485fa9e4066Sahrens } 486fa9e4066Sahrens 487fa9e4066Sahrens int 488fa9e4066Sahrens zap_entry_read(const zap_entry_handle_t *zeh, 489fa9e4066Sahrens uint8_t integer_size, uint64_t num_integers, void *buf) 490fa9e4066Sahrens { 491f65e61c0Sahrens struct zap_leaf_entry *le = 49266328dd3Sahrens ZAP_LEAF_ENTRY(zeh->zeh_leaf, *zeh->zeh_chunkp); 493f65e61c0Sahrens ASSERT3U(le->le_type, ==, ZAP_CHUNK_ENTRY); 494fa9e4066Sahrens 495486ae710SMatthew Ahrens if (le->le_value_intlen > integer_size) 496*be6fd75aSMatthew Ahrens return (SET_ERROR(EINVAL)); 497fa9e4066Sahrens 498486ae710SMatthew Ahrens zap_leaf_array_read(zeh->zeh_leaf, le->le_value_chunk, 499486ae710SMatthew Ahrens le->le_value_intlen, le->le_value_numints, 500486ae710SMatthew Ahrens integer_size, num_integers, buf); 501fa9e4066Sahrens 502fa9e4066Sahrens if (zeh->zeh_num_integers > num_integers) 503*be6fd75aSMatthew Ahrens return (SET_ERROR(EOVERFLOW)); 504fa9e4066Sahrens return (0); 505fa9e4066Sahrens 506fa9e4066Sahrens } 507fa9e4066Sahrens 508fa9e4066Sahrens int 509b24ab676SJeff Bonwick zap_entry_read_name(zap_t *zap, const zap_entry_handle_t *zeh, uint16_t buflen, 510b24ab676SJeff Bonwick char *buf) 511fa9e4066Sahrens { 512f65e61c0Sahrens struct zap_leaf_entry *le = 51366328dd3Sahrens ZAP_LEAF_ENTRY(zeh->zeh_leaf, *zeh->zeh_chunkp); 514f65e61c0Sahrens ASSERT3U(le->le_type, ==, ZAP_CHUNK_ENTRY); 515fa9e4066Sahrens 516b24ab676SJeff Bonwick if (zap_getflags(zap) & ZAP_FLAG_UINT64_KEY) { 517b24ab676SJeff Bonwick zap_leaf_array_read(zeh->zeh_leaf, le->le_name_chunk, 8, 518486ae710SMatthew Ahrens le->le_name_numints, 8, buflen / 8, buf); 519b24ab676SJeff Bonwick } else { 520b24ab676SJeff Bonwick zap_leaf_array_read(zeh->zeh_leaf, le->le_name_chunk, 1, 521486ae710SMatthew Ahrens le->le_name_numints, 1, buflen, buf); 522b24ab676SJeff Bonwick } 523486ae710SMatthew Ahrens if (le->le_name_numints > buflen) 524*be6fd75aSMatthew Ahrens return (SET_ERROR(EOVERFLOW)); 525fa9e4066Sahrens return (0); 526fa9e4066Sahrens } 527fa9e4066Sahrens 528fa9e4066Sahrens int 529fa9e4066Sahrens zap_entry_update(zap_entry_handle_t *zeh, 530fa9e4066Sahrens uint8_t integer_size, uint64_t num_integers, const void *buf) 531fa9e4066Sahrens { 532fa9e4066Sahrens int delta_chunks; 53366328dd3Sahrens zap_leaf_t *l = zeh->zeh_leaf; 53466328dd3Sahrens struct zap_leaf_entry *le = ZAP_LEAF_ENTRY(l, *zeh->zeh_chunkp); 535fa9e4066Sahrens 53666328dd3Sahrens delta_chunks = ZAP_LEAF_ARRAY_NCHUNKS(num_integers * integer_size) - 537486ae710SMatthew Ahrens ZAP_LEAF_ARRAY_NCHUNKS(le->le_value_numints * le->le_value_intlen); 538fa9e4066Sahrens 53966328dd3Sahrens if ((int)l->l_phys->l_hdr.lh_nfree < delta_chunks) 540*be6fd75aSMatthew Ahrens return (SET_ERROR(EAGAIN)); 541fa9e4066Sahrens 54266328dd3Sahrens zap_leaf_array_free(l, &le->le_value_chunk); 543fa9e4066Sahrens le->le_value_chunk = 54466328dd3Sahrens zap_leaf_array_create(l, buf, integer_size, num_integers); 545486ae710SMatthew Ahrens le->le_value_numints = num_integers; 546486ae710SMatthew Ahrens le->le_value_intlen = integer_size; 547fa9e4066Sahrens return (0); 548fa9e4066Sahrens } 549fa9e4066Sahrens 550fa9e4066Sahrens void 551fa9e4066Sahrens zap_entry_remove(zap_entry_handle_t *zeh) 552fa9e4066Sahrens { 553fa9e4066Sahrens uint16_t entry_chunk; 554fa9e4066Sahrens struct zap_leaf_entry *le; 55566328dd3Sahrens zap_leaf_t *l = zeh->zeh_leaf; 556fa9e4066Sahrens 557fa9e4066Sahrens ASSERT3P(zeh->zeh_chunkp, !=, &zeh->zeh_fakechunk); 558fa9e4066Sahrens 559fa9e4066Sahrens entry_chunk = *zeh->zeh_chunkp; 560f65e61c0Sahrens le = ZAP_LEAF_ENTRY(l, entry_chunk); 561f65e61c0Sahrens ASSERT3U(le->le_type, ==, ZAP_CHUNK_ENTRY); 562fa9e4066Sahrens 56366328dd3Sahrens zap_leaf_array_free(l, &le->le_name_chunk); 56466328dd3Sahrens zap_leaf_array_free(l, &le->le_value_chunk); 565fa9e4066Sahrens 566fa9e4066Sahrens *zeh->zeh_chunkp = le->le_next; 567fa9e4066Sahrens zap_leaf_chunk_free(l, entry_chunk); 568fa9e4066Sahrens 56966328dd3Sahrens l->l_phys->l_hdr.lh_nentries--; 570fa9e4066Sahrens } 571fa9e4066Sahrens 572fa9e4066Sahrens int 573b24ab676SJeff Bonwick zap_entry_create(zap_leaf_t *l, zap_name_t *zn, uint32_t cd, 574fa9e4066Sahrens uint8_t integer_size, uint64_t num_integers, const void *buf, 575fa9e4066Sahrens zap_entry_handle_t *zeh) 576fa9e4066Sahrens { 577fa9e4066Sahrens uint16_t chunk; 578fa9e4066Sahrens uint16_t *chunkp; 579fa9e4066Sahrens struct zap_leaf_entry *le; 580b24ab676SJeff Bonwick uint64_t valuelen; 581fa9e4066Sahrens int numchunks; 582b24ab676SJeff Bonwick uint64_t h = zn->zn_hash; 583fa9e4066Sahrens 584fa9e4066Sahrens valuelen = integer_size * num_integers; 585fa9e4066Sahrens 586486ae710SMatthew Ahrens numchunks = 1 + ZAP_LEAF_ARRAY_NCHUNKS(zn->zn_key_orig_numints * 587486ae710SMatthew Ahrens zn->zn_key_intlen) + ZAP_LEAF_ARRAY_NCHUNKS(valuelen); 588f65e61c0Sahrens if (numchunks > ZAP_LEAF_NUMCHUNKS(l)) 589fa9e4066Sahrens return (E2BIG); 590fa9e4066Sahrens 591b24ab676SJeff Bonwick if (cd == ZAP_NEED_CD) { 592da6c28aaSamw /* find the lowest unused cd */ 593da6c28aaSamw if (l->l_phys->l_hdr.lh_flags & ZLF_ENTRIES_CDSORTED) { 594da6c28aaSamw cd = 0; 595da6c28aaSamw 59666328dd3Sahrens for (chunk = *LEAF_HASH_ENTPTR(l, h); 59766328dd3Sahrens chunk != CHAIN_END; chunk = le->le_next) { 59866328dd3Sahrens le = ZAP_LEAF_ENTRY(l, chunk); 599da6c28aaSamw if (le->le_cd > cd) 600fa9e4066Sahrens break; 601da6c28aaSamw if (le->le_hash == h) { 602da6c28aaSamw ASSERT3U(cd, ==, le->le_cd); 603da6c28aaSamw cd++; 60466328dd3Sahrens } 605fa9e4066Sahrens } 606da6c28aaSamw } else { 607da6c28aaSamw /* old unsorted format; do it the O(n^2) way */ 608b24ab676SJeff Bonwick for (cd = 0; ; cd++) { 609da6c28aaSamw for (chunk = *LEAF_HASH_ENTPTR(l, h); 610da6c28aaSamw chunk != CHAIN_END; chunk = le->le_next) { 611da6c28aaSamw le = ZAP_LEAF_ENTRY(l, chunk); 612da6c28aaSamw if (le->le_hash == h && 613da6c28aaSamw le->le_cd == cd) { 614da6c28aaSamw break; 615da6c28aaSamw } 616da6c28aaSamw } 617da6c28aaSamw /* If this cd is not in use, we are good. */ 618da6c28aaSamw if (chunk == CHAIN_END) 619da6c28aaSamw break; 620da6c28aaSamw } 621fa9e4066Sahrens } 622da6c28aaSamw /* 623b24ab676SJeff Bonwick * We would run out of space in a block before we could 624b24ab676SJeff Bonwick * store enough entries to run out of CD values. 625da6c28aaSamw */ 626b24ab676SJeff Bonwick ASSERT3U(cd, <, zap_maxcd(zn->zn_zap)); 627fa9e4066Sahrens } 628fa9e4066Sahrens 62966328dd3Sahrens if (l->l_phys->l_hdr.lh_nfree < numchunks) 630*be6fd75aSMatthew Ahrens return (SET_ERROR(EAGAIN)); 631fa9e4066Sahrens 632fa9e4066Sahrens /* make the entry */ 633fa9e4066Sahrens chunk = zap_leaf_chunk_alloc(l); 634f65e61c0Sahrens le = ZAP_LEAF_ENTRY(l, chunk); 635f65e61c0Sahrens le->le_type = ZAP_CHUNK_ENTRY; 636b24ab676SJeff Bonwick le->le_name_chunk = zap_leaf_array_create(l, zn->zn_key_orig, 637486ae710SMatthew Ahrens zn->zn_key_intlen, zn->zn_key_orig_numints); 638486ae710SMatthew Ahrens le->le_name_numints = zn->zn_key_orig_numints; 639fa9e4066Sahrens le->le_value_chunk = 64066328dd3Sahrens zap_leaf_array_create(l, buf, integer_size, num_integers); 641486ae710SMatthew Ahrens le->le_value_numints = num_integers; 642486ae710SMatthew Ahrens le->le_value_intlen = integer_size; 643fa9e4066Sahrens le->le_hash = h; 644fa9e4066Sahrens le->le_cd = cd; 645fa9e4066Sahrens 646fa9e4066Sahrens /* link it into the hash chain */ 647da6c28aaSamw /* XXX if we did the search above, we could just use that */ 648da6c28aaSamw chunkp = zap_leaf_rehash_entry(l, chunk); 649fa9e4066Sahrens 65066328dd3Sahrens l->l_phys->l_hdr.lh_nentries++; 651fa9e4066Sahrens 65266328dd3Sahrens zeh->zeh_leaf = l; 653fa9e4066Sahrens zeh->zeh_num_integers = num_integers; 654486ae710SMatthew Ahrens zeh->zeh_integer_size = le->le_value_intlen; 655fa9e4066Sahrens zeh->zeh_cd = le->le_cd; 656fa9e4066Sahrens zeh->zeh_hash = le->le_hash; 657fa9e4066Sahrens zeh->zeh_chunkp = chunkp; 658fa9e4066Sahrens 659fa9e4066Sahrens return (0); 660fa9e4066Sahrens } 661fa9e4066Sahrens 662da6c28aaSamw /* 663da6c28aaSamw * Determine if there is another entry with the same normalized form. 664da6c28aaSamw * For performance purposes, either zn or name must be provided (the 665da6c28aaSamw * other can be NULL). Note, there usually won't be any hash 666da6c28aaSamw * conflicts, in which case we don't need the concatenated/normalized 667da6c28aaSamw * form of the name. But all callers have one of these on hand anyway, 668da6c28aaSamw * so might as well take advantage. A cleaner but slower interface 669da6c28aaSamw * would accept neither argument, and compute the normalized name as 670da6c28aaSamw * needed (using zap_name_alloc(zap_entry_read_name(zeh))). 671da6c28aaSamw */ 672da6c28aaSamw boolean_t 673da6c28aaSamw zap_entry_normalization_conflict(zap_entry_handle_t *zeh, zap_name_t *zn, 674da6c28aaSamw const char *name, zap_t *zap) 675da6c28aaSamw { 676da6c28aaSamw uint64_t chunk; 677da6c28aaSamw struct zap_leaf_entry *le; 678da6c28aaSamw boolean_t allocdzn = B_FALSE; 679da6c28aaSamw 680da6c28aaSamw if (zap->zap_normflags == 0) 681da6c28aaSamw return (B_FALSE); 682da6c28aaSamw 683da6c28aaSamw for (chunk = *LEAF_HASH_ENTPTR(zeh->zeh_leaf, zeh->zeh_hash); 684da6c28aaSamw chunk != CHAIN_END; chunk = le->le_next) { 685da6c28aaSamw le = ZAP_LEAF_ENTRY(zeh->zeh_leaf, chunk); 686da6c28aaSamw if (le->le_hash != zeh->zeh_hash) 687da6c28aaSamw continue; 688da6c28aaSamw if (le->le_cd == zeh->zeh_cd) 689da6c28aaSamw continue; 690da6c28aaSamw 691da6c28aaSamw if (zn == NULL) { 692da6c28aaSamw zn = zap_name_alloc(zap, name, MT_FIRST); 693da6c28aaSamw allocdzn = B_TRUE; 694da6c28aaSamw } 695da6c28aaSamw if (zap_leaf_array_match(zeh->zeh_leaf, zn, 696486ae710SMatthew Ahrens le->le_name_chunk, le->le_name_numints)) { 697da6c28aaSamw if (allocdzn) 698da6c28aaSamw zap_name_free(zn); 699da6c28aaSamw return (B_TRUE); 700da6c28aaSamw } 701da6c28aaSamw } 702da6c28aaSamw if (allocdzn) 703da6c28aaSamw zap_name_free(zn); 704da6c28aaSamw return (B_FALSE); 705da6c28aaSamw } 706da6c28aaSamw 707fa9e4066Sahrens /* 708fa9e4066Sahrens * Routines for transferring entries between leafs. 709fa9e4066Sahrens */ 710fa9e4066Sahrens 711da6c28aaSamw static uint16_t * 712fa9e4066Sahrens zap_leaf_rehash_entry(zap_leaf_t *l, uint16_t entry) 713fa9e4066Sahrens { 714f65e61c0Sahrens struct zap_leaf_entry *le = ZAP_LEAF_ENTRY(l, entry); 715da6c28aaSamw struct zap_leaf_entry *le2; 716da6c28aaSamw uint16_t *chunkp; 717da6c28aaSamw 718da6c28aaSamw /* 719da6c28aaSamw * keep the entry chain sorted by cd 720da6c28aaSamw * NB: this will not cause problems for unsorted leafs, though 721da6c28aaSamw * it is unnecessary there. 722da6c28aaSamw */ 723da6c28aaSamw for (chunkp = LEAF_HASH_ENTPTR(l, le->le_hash); 724da6c28aaSamw *chunkp != CHAIN_END; chunkp = &le2->le_next) { 725da6c28aaSamw le2 = ZAP_LEAF_ENTRY(l, *chunkp); 726da6c28aaSamw if (le2->le_cd > le->le_cd) 727da6c28aaSamw break; 728da6c28aaSamw } 729da6c28aaSamw 730da6c28aaSamw le->le_next = *chunkp; 731da6c28aaSamw *chunkp = entry; 732da6c28aaSamw return (chunkp); 733fa9e4066Sahrens } 734fa9e4066Sahrens 735fa9e4066Sahrens static uint16_t 736fa9e4066Sahrens zap_leaf_transfer_array(zap_leaf_t *l, uint16_t chunk, zap_leaf_t *nl) 737fa9e4066Sahrens { 738fa9e4066Sahrens uint16_t new_chunk; 739fa9e4066Sahrens uint16_t *nchunkp = &new_chunk; 740fa9e4066Sahrens 741fa9e4066Sahrens while (chunk != CHAIN_END) { 742fa9e4066Sahrens uint16_t nchunk = zap_leaf_chunk_alloc(nl); 743fa9e4066Sahrens struct zap_leaf_array *nla = 744f65e61c0Sahrens &ZAP_LEAF_CHUNK(nl, nchunk).l_array; 745fa9e4066Sahrens struct zap_leaf_array *la = 746f65e61c0Sahrens &ZAP_LEAF_CHUNK(l, chunk).l_array; 747fa9e4066Sahrens int nextchunk = la->la_next; 748fa9e4066Sahrens 749f65e61c0Sahrens ASSERT3U(chunk, <, ZAP_LEAF_NUMCHUNKS(l)); 750f65e61c0Sahrens ASSERT3U(nchunk, <, ZAP_LEAF_NUMCHUNKS(l)); 751fa9e4066Sahrens 75266328dd3Sahrens *nla = *la; /* structure assignment */ 753fa9e4066Sahrens 754fa9e4066Sahrens zap_leaf_chunk_free(l, chunk); 755fa9e4066Sahrens chunk = nextchunk; 756fa9e4066Sahrens *nchunkp = nchunk; 757fa9e4066Sahrens nchunkp = &nla->la_next; 758fa9e4066Sahrens } 759fa9e4066Sahrens *nchunkp = CHAIN_END; 760fa9e4066Sahrens return (new_chunk); 761fa9e4066Sahrens } 762fa9e4066Sahrens 763fa9e4066Sahrens static void 76466328dd3Sahrens zap_leaf_transfer_entry(zap_leaf_t *l, int entry, zap_leaf_t *nl) 765fa9e4066Sahrens { 766fa9e4066Sahrens struct zap_leaf_entry *le, *nle; 76766328dd3Sahrens uint16_t chunk; 768fa9e4066Sahrens 769f65e61c0Sahrens le = ZAP_LEAF_ENTRY(l, entry); 770f65e61c0Sahrens ASSERT3U(le->le_type, ==, ZAP_CHUNK_ENTRY); 771fa9e4066Sahrens 772fa9e4066Sahrens chunk = zap_leaf_chunk_alloc(nl); 773f65e61c0Sahrens nle = ZAP_LEAF_ENTRY(nl, chunk); 77466328dd3Sahrens *nle = *le; /* structure assignment */ 775fa9e4066Sahrens 776da6c28aaSamw (void) zap_leaf_rehash_entry(nl, chunk); 777fa9e4066Sahrens 778fa9e4066Sahrens nle->le_name_chunk = zap_leaf_transfer_array(l, le->le_name_chunk, nl); 779fa9e4066Sahrens nle->le_value_chunk = 780fa9e4066Sahrens zap_leaf_transfer_array(l, le->le_value_chunk, nl); 781fa9e4066Sahrens 782fa9e4066Sahrens zap_leaf_chunk_free(l, entry); 783fa9e4066Sahrens 78466328dd3Sahrens l->l_phys->l_hdr.lh_nentries--; 78566328dd3Sahrens nl->l_phys->l_hdr.lh_nentries++; 786fa9e4066Sahrens } 787fa9e4066Sahrens 788fa9e4066Sahrens /* 78966328dd3Sahrens * Transfer the entries whose hash prefix ends in 1 to the new leaf. 790fa9e4066Sahrens */ 79166328dd3Sahrens void 792de8267e0Stimh zap_leaf_split(zap_leaf_t *l, zap_leaf_t *nl, boolean_t sort) 793fa9e4066Sahrens { 794fa9e4066Sahrens int i; 79566328dd3Sahrens int bit = 64 - 1 - l->l_phys->l_hdr.lh_prefix_len; 79666328dd3Sahrens 79766328dd3Sahrens /* set new prefix and prefix_len */ 79866328dd3Sahrens l->l_phys->l_hdr.lh_prefix <<= 1; 79966328dd3Sahrens l->l_phys->l_hdr.lh_prefix_len++; 80066328dd3Sahrens nl->l_phys->l_hdr.lh_prefix = l->l_phys->l_hdr.lh_prefix | 1; 80166328dd3Sahrens nl->l_phys->l_hdr.lh_prefix_len = l->l_phys->l_hdr.lh_prefix_len; 802fa9e4066Sahrens 803fa9e4066Sahrens /* break existing hash chains */ 804f65e61c0Sahrens zap_memset(l->l_phys->l_hash, CHAIN_END, 2*ZAP_LEAF_HASH_NUMENTRIES(l)); 805fa9e4066Sahrens 806de8267e0Stimh if (sort) 807da6c28aaSamw l->l_phys->l_hdr.lh_flags |= ZLF_ENTRIES_CDSORTED; 808da6c28aaSamw 80966328dd3Sahrens /* 81066328dd3Sahrens * Transfer entries whose hash bit 'bit' is set to nl; rehash 81166328dd3Sahrens * the remaining entries 81266328dd3Sahrens * 81366328dd3Sahrens * NB: We could find entries via the hashtable instead. That 81466328dd3Sahrens * would be O(hashents+numents) rather than O(numblks+numents), 81566328dd3Sahrens * but this accesses memory more sequentially, and when we're 81666328dd3Sahrens * called, the block is usually pretty full. 81766328dd3Sahrens */ 818f65e61c0Sahrens for (i = 0; i < ZAP_LEAF_NUMCHUNKS(l); i++) { 819f65e61c0Sahrens struct zap_leaf_entry *le = ZAP_LEAF_ENTRY(l, i); 820f65e61c0Sahrens if (le->le_type != ZAP_CHUNK_ENTRY) 821fa9e4066Sahrens continue; 822fa9e4066Sahrens 82366328dd3Sahrens if (le->le_hash & (1ULL << bit)) 82466328dd3Sahrens zap_leaf_transfer_entry(l, i, nl); 82566328dd3Sahrens else 826da6c28aaSamw (void) zap_leaf_rehash_entry(l, i); 827fa9e4066Sahrens } 828fa9e4066Sahrens } 829fa9e4066Sahrens 830fa9e4066Sahrens void 83166328dd3Sahrens zap_leaf_stats(zap_t *zap, zap_leaf_t *l, zap_stats_t *zs) 832fa9e4066Sahrens { 83366328dd3Sahrens int i, n; 834fa9e4066Sahrens 83566328dd3Sahrens n = zap->zap_f.zap_phys->zap_ptrtbl.zt_shift - 83666328dd3Sahrens l->l_phys->l_hdr.lh_prefix_len; 837fa9e4066Sahrens n = MIN(n, ZAP_HISTOGRAM_SIZE-1); 838fa9e4066Sahrens zs->zs_leafs_with_2n_pointers[n]++; 839fa9e4066Sahrens 840fa9e4066Sahrens 84166328dd3Sahrens n = l->l_phys->l_hdr.lh_nentries/5; 84266328dd3Sahrens n = MIN(n, ZAP_HISTOGRAM_SIZE-1); 84366328dd3Sahrens zs->zs_blocks_with_n5_entries[n]++; 844fa9e4066Sahrens 84566328dd3Sahrens n = ((1<<FZAP_BLOCK_SHIFT(zap)) - 84666328dd3Sahrens l->l_phys->l_hdr.lh_nfree * (ZAP_LEAF_ARRAY_BYTES+1))*10 / 84766328dd3Sahrens (1<<FZAP_BLOCK_SHIFT(zap)); 84866328dd3Sahrens n = MIN(n, ZAP_HISTOGRAM_SIZE-1); 84966328dd3Sahrens zs->zs_blocks_n_tenths_full[n]++; 850fa9e4066Sahrens 85166328dd3Sahrens for (i = 0; i < ZAP_LEAF_HASH_NUMENTRIES(l); i++) { 85266328dd3Sahrens int nentries = 0; 85366328dd3Sahrens int chunk = l->l_phys->l_hash[i]; 854fa9e4066Sahrens 85566328dd3Sahrens while (chunk != CHAIN_END) { 85666328dd3Sahrens struct zap_leaf_entry *le = 85766328dd3Sahrens ZAP_LEAF_ENTRY(l, chunk); 858fa9e4066Sahrens 859486ae710SMatthew Ahrens n = 1 + ZAP_LEAF_ARRAY_NCHUNKS(le->le_name_numints) + 860486ae710SMatthew Ahrens ZAP_LEAF_ARRAY_NCHUNKS(le->le_value_numints * 861486ae710SMatthew Ahrens le->le_value_intlen); 862fa9e4066Sahrens n = MIN(n, ZAP_HISTOGRAM_SIZE-1); 86366328dd3Sahrens zs->zs_entries_using_n_chunks[n]++; 864fa9e4066Sahrens 86566328dd3Sahrens chunk = le->le_next; 86666328dd3Sahrens nentries++; 86766328dd3Sahrens } 868fa9e4066Sahrens 86966328dd3Sahrens n = nentries; 87066328dd3Sahrens n = MIN(n, ZAP_HISTOGRAM_SIZE-1); 87166328dd3Sahrens zs->zs_buckets_with_n_entries[n]++; 87266328dd3Sahrens } 873fa9e4066Sahrens } 874