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 /* 22f65e61c0Sahrens * Copyright 2006 Sun Microsystems, Inc. All rights reserved. 23fa9e4066Sahrens * Use is subject to license terms. 24fa9e4066Sahrens */ 25fa9e4066Sahrens 26fa9e4066Sahrens #ifndef _SYS_ZAP_LEAF_H 27fa9e4066Sahrens #define _SYS_ZAP_LEAF_H 28fa9e4066Sahrens 29fa9e4066Sahrens #pragma ident "%Z%%M% %I% %E% SMI" 30fa9e4066Sahrens 31fa9e4066Sahrens #ifdef __cplusplus 32fa9e4066Sahrens extern "C" { 33fa9e4066Sahrens #endif 34fa9e4066Sahrens 35fa9e4066Sahrens struct zap; 36fa9e4066Sahrens 37fa9e4066Sahrens #define ZAP_LEAF_MAGIC 0x2AB1EAF 38fa9e4066Sahrens 39fa9e4066Sahrens /* chunk size = 24 bytes */ 40f65e61c0Sahrens #define ZAP_LEAF_CHUNKSIZE 24 41fa9e4066Sahrens 42f65e61c0Sahrens /* 43f65e61c0Sahrens * The amount of space available for chunks is: 44f65e61c0Sahrens * block size (1<<l->l_bs) - hash entry size (2) * number of hash 45f65e61c0Sahrens * entries - header space (2*chunksize) 46f65e61c0Sahrens */ 47f65e61c0Sahrens #define ZAP_LEAF_NUMCHUNKS(l) \ 48f65e61c0Sahrens (((1<<(l)->l_bs) - 2*ZAP_LEAF_HASH_NUMENTRIES(l)) / \ 49f65e61c0Sahrens ZAP_LEAF_CHUNKSIZE - 2) 50f65e61c0Sahrens 51f65e61c0Sahrens /* 52f65e61c0Sahrens * The amount of space within the chunk available for the array is: 53f65e61c0Sahrens * chunk size - space for type (1) - space for next pointer (2) 54f65e61c0Sahrens */ 55f65e61c0Sahrens #define ZAP_LEAF_ARRAY_BYTES (ZAP_LEAF_CHUNKSIZE - 3) 56f65e61c0Sahrens 57*66328dd3Sahrens #define ZAP_LEAF_ARRAY_NCHUNKS(bytes) \ 58*66328dd3Sahrens (((bytes)+ZAP_LEAF_ARRAY_BYTES-1)/ZAP_LEAF_ARRAY_BYTES) 59*66328dd3Sahrens 60*66328dd3Sahrens /* 61*66328dd3Sahrens * Low water mark: when there are only this many chunks free, start 62*66328dd3Sahrens * growing the ptrtbl. Ideally, this should be larger than a 63*66328dd3Sahrens * "reasonably-sized" entry. 20 chunks is more than enough for the 64*66328dd3Sahrens * largest directory entry (MAXNAMELEN (256) byte name, 8-byte value), 65*66328dd3Sahrens * while still being only around 3% for 16k blocks. 66*66328dd3Sahrens */ 67*66328dd3Sahrens #define ZAP_LEAF_LOW_WATER (20) 68*66328dd3Sahrens 69f65e61c0Sahrens /* 70f65e61c0Sahrens * The leaf hash table has block size / 2^5 (32) number of entries, 71f65e61c0Sahrens * which should be more than enough for the maximum number of entries, 72f65e61c0Sahrens * which is less than block size / CHUNKSIZE (24) / minimum number of 73f65e61c0Sahrens * chunks per entry (3). 74f65e61c0Sahrens */ 75f65e61c0Sahrens #define ZAP_LEAF_HASH_SHIFT(l) ((l)->l_bs - 5) 76f65e61c0Sahrens #define ZAP_LEAF_HASH_NUMENTRIES(l) (1 << ZAP_LEAF_HASH_SHIFT(l)) 77fa9e4066Sahrens 78f65e61c0Sahrens /* 79f65e61c0Sahrens * The chunks start immediately after the hash table. The end of the 80f65e61c0Sahrens * hash table is at l_hash + HASH_NUMENTRIES, which we simply cast to a 81f65e61c0Sahrens * chunk_t. 82f65e61c0Sahrens */ 83f65e61c0Sahrens #define ZAP_LEAF_CHUNK(l, idx) \ 84f65e61c0Sahrens ((zap_leaf_chunk_t *) \ 85f65e61c0Sahrens ((l)->l_phys->l_hash + ZAP_LEAF_HASH_NUMENTRIES(l)))[idx] 86f65e61c0Sahrens #define ZAP_LEAF_ENTRY(l, idx) (&ZAP_LEAF_CHUNK(l, idx).l_entry) 87f65e61c0Sahrens 88f65e61c0Sahrens typedef enum zap_chunk_type { 89f65e61c0Sahrens ZAP_CHUNK_FREE = 253, 90f65e61c0Sahrens ZAP_CHUNK_ENTRY = 252, 91f65e61c0Sahrens ZAP_CHUNK_ARRAY = 251, 92f65e61c0Sahrens ZAP_CHUNK_TYPE_MAX = 250 93f65e61c0Sahrens } zap_chunk_type_t; 94fa9e4066Sahrens 95fa9e4066Sahrens /* 96fa9e4066Sahrens * TAKE NOTE: 97fa9e4066Sahrens * If zap_leaf_phys_t is modified, zap_leaf_byteswap() must be modified. 98fa9e4066Sahrens */ 99fa9e4066Sahrens typedef struct zap_leaf_phys { 100fa9e4066Sahrens struct zap_leaf_header { 101*66328dd3Sahrens uint64_t lh_block_type; /* ZBT_LEAF */ 102*66328dd3Sahrens uint64_t lh_pad1; 103*66328dd3Sahrens uint64_t lh_prefix; /* hash prefix of this leaf */ 104*66328dd3Sahrens uint32_t lh_magic; /* ZAP_LEAF_MAGIC */ 105*66328dd3Sahrens uint16_t lh_nfree; /* number free chunks */ 106*66328dd3Sahrens uint16_t lh_nentries; /* number of entries */ 107*66328dd3Sahrens uint16_t lh_prefix_len; /* num bits used to id this */ 108fa9e4066Sahrens 109fa9e4066Sahrens /* above is accessable to zap, below is zap_leaf private */ 110fa9e4066Sahrens 111fa9e4066Sahrens uint16_t lh_freelist; /* chunk head of free list */ 112fa9e4066Sahrens uint8_t lh_pad2[12]; 113fa9e4066Sahrens } l_hdr; /* 2 24-byte chunks */ 114fa9e4066Sahrens 115f65e61c0Sahrens /* 116f65e61c0Sahrens * The header is followed by a hash table with 117f65e61c0Sahrens * ZAP_LEAF_HASH_NUMENTRIES(zap) entries. The hash table is 118f65e61c0Sahrens * followed by an array of ZAP_LEAF_NUMCHUNKS(zap) 119f65e61c0Sahrens * zap_leaf_chunk structures. These structures are accessed 120f65e61c0Sahrens * with the ZAP_LEAF_CHUNK() macro. 121f65e61c0Sahrens */ 122f65e61c0Sahrens 123f65e61c0Sahrens uint16_t l_hash[1]; 124fa9e4066Sahrens } zap_leaf_phys_t; 125fa9e4066Sahrens 126f65e61c0Sahrens typedef union zap_leaf_chunk { 127f65e61c0Sahrens struct zap_leaf_entry { 128f65e61c0Sahrens uint8_t le_type; /* always ZAP_CHUNK_ENTRY */ 129f65e61c0Sahrens uint8_t le_int_size; /* size of ints */ 130f65e61c0Sahrens uint16_t le_next; /* next entry in hash chain */ 131f65e61c0Sahrens uint16_t le_name_chunk; /* first chunk of the name */ 132f65e61c0Sahrens uint16_t le_name_length; /* bytes in name, incl null */ 133f65e61c0Sahrens uint16_t le_value_chunk; /* first chunk of the value */ 134f65e61c0Sahrens uint16_t le_value_length; /* value length in ints */ 135f65e61c0Sahrens uint32_t le_cd; /* collision differentiator */ 136f65e61c0Sahrens uint64_t le_hash; /* hash value of the name */ 137f65e61c0Sahrens } l_entry; 138f65e61c0Sahrens struct zap_leaf_array { 139f65e61c0Sahrens uint8_t la_type; /* always ZAP_CHUNK_ARRAY */ 140f65e61c0Sahrens uint8_t la_array[ZAP_LEAF_ARRAY_BYTES]; 141f65e61c0Sahrens uint16_t la_next; /* next blk or CHAIN_END */ 142f65e61c0Sahrens } l_array; 143f65e61c0Sahrens struct zap_leaf_free { 144f65e61c0Sahrens uint8_t lf_type; /* always ZAP_CHUNK_FREE */ 145f65e61c0Sahrens uint8_t lf_pad[ZAP_LEAF_ARRAY_BYTES]; 146f65e61c0Sahrens uint16_t lf_next; /* next in free list, or CHAIN_END */ 147f65e61c0Sahrens } l_free; 148f65e61c0Sahrens } zap_leaf_chunk_t; 149f65e61c0Sahrens 150fa9e4066Sahrens typedef struct zap_leaf { 151fa9e4066Sahrens krwlock_t l_rwlock; /* only used on head of chain */ 152fa9e4066Sahrens uint64_t l_blkid; /* 1<<ZAP_BLOCK_SHIFT byte block off */ 153f65e61c0Sahrens int l_bs; /* block size shift */ 154fa9e4066Sahrens dmu_buf_t *l_dbuf; 155fa9e4066Sahrens zap_leaf_phys_t *l_phys; 156fa9e4066Sahrens } zap_leaf_t; 157fa9e4066Sahrens 158fa9e4066Sahrens 159fa9e4066Sahrens typedef struct zap_entry_handle { 160fa9e4066Sahrens /* below is set by zap_leaf.c and is public to zap.c */ 161fa9e4066Sahrens uint64_t zeh_num_integers; 162fa9e4066Sahrens uint64_t zeh_hash; 163fa9e4066Sahrens uint32_t zeh_cd; 164fa9e4066Sahrens uint8_t zeh_integer_size; 165fa9e4066Sahrens 166fa9e4066Sahrens /* below is private to zap_leaf.c */ 167fa9e4066Sahrens uint16_t zeh_fakechunk; 168fa9e4066Sahrens uint16_t *zeh_chunkp; 169*66328dd3Sahrens zap_leaf_t *zeh_leaf; 170fa9e4066Sahrens } zap_entry_handle_t; 171fa9e4066Sahrens 172fa9e4066Sahrens /* 173fa9e4066Sahrens * Return a handle to the named entry, or ENOENT if not found. The hash 174fa9e4066Sahrens * value must equal zap_hash(name). 175fa9e4066Sahrens */ 176fa9e4066Sahrens extern int zap_leaf_lookup(zap_leaf_t *l, 177fa9e4066Sahrens const char *name, uint64_t h, zap_entry_handle_t *zeh); 178fa9e4066Sahrens 179fa9e4066Sahrens /* 180fa9e4066Sahrens * Return a handle to the entry with this hash+cd, or the entry with the 181fa9e4066Sahrens * next closest hash+cd. 182fa9e4066Sahrens */ 183fa9e4066Sahrens extern int zap_leaf_lookup_closest(zap_leaf_t *l, 184fa9e4066Sahrens uint64_t hash, uint32_t cd, zap_entry_handle_t *zeh); 185fa9e4066Sahrens 186fa9e4066Sahrens /* 187fa9e4066Sahrens * Read the first num_integers in the attribute. Integer size 188fa9e4066Sahrens * conversion will be done without sign extension. Return EINVAL if 189fa9e4066Sahrens * integer_size is too small. Return EOVERFLOW if there are more than 190fa9e4066Sahrens * num_integers in the attribute. 191fa9e4066Sahrens */ 192fa9e4066Sahrens extern int zap_entry_read(const zap_entry_handle_t *zeh, 193fa9e4066Sahrens uint8_t integer_size, uint64_t num_integers, void *buf); 194fa9e4066Sahrens 195fa9e4066Sahrens extern int zap_entry_read_name(const zap_entry_handle_t *zeh, 196fa9e4066Sahrens uint16_t buflen, char *buf); 197fa9e4066Sahrens 198fa9e4066Sahrens /* 199fa9e4066Sahrens * Replace the value of an existing entry. 200fa9e4066Sahrens * 201fa9e4066Sahrens * zap_entry_update may fail if it runs out of space (ENOSPC). 202fa9e4066Sahrens */ 203fa9e4066Sahrens extern int zap_entry_update(zap_entry_handle_t *zeh, 204fa9e4066Sahrens uint8_t integer_size, uint64_t num_integers, const void *buf); 205fa9e4066Sahrens 206fa9e4066Sahrens /* 207fa9e4066Sahrens * Remove an entry. 208fa9e4066Sahrens */ 209fa9e4066Sahrens extern void zap_entry_remove(zap_entry_handle_t *zeh); 210fa9e4066Sahrens 211fa9e4066Sahrens /* 212fa9e4066Sahrens * Create an entry. An equal entry must not exist, and this entry must 213fa9e4066Sahrens * belong in this leaf (according to its hash value). Fills in the 214fa9e4066Sahrens * entry handle on success. Returns 0 on success or ENOSPC on failure. 215fa9e4066Sahrens */ 216fa9e4066Sahrens extern int zap_entry_create(zap_leaf_t *l, 217fa9e4066Sahrens const char *name, uint64_t h, uint32_t cd, 218fa9e4066Sahrens uint8_t integer_size, uint64_t num_integers, const void *buf, 219fa9e4066Sahrens zap_entry_handle_t *zeh); 220fa9e4066Sahrens 221fa9e4066Sahrens /* 222fa9e4066Sahrens * Other stuff. 223fa9e4066Sahrens */ 224fa9e4066Sahrens 225fa9e4066Sahrens extern void zap_leaf_init(zap_leaf_t *l); 226f65e61c0Sahrens extern void zap_leaf_byteswap(zap_leaf_phys_t *buf, int len); 227*66328dd3Sahrens extern void zap_leaf_split(zap_leaf_t *l, zap_leaf_t *nl); 228*66328dd3Sahrens extern void zap_leaf_stats(zap_t *zap, zap_leaf_t *l, zap_stats_t *zs); 229fa9e4066Sahrens 230fa9e4066Sahrens #ifdef __cplusplus 231fa9e4066Sahrens } 232fa9e4066Sahrens #endif 233fa9e4066Sahrens 234fa9e4066Sahrens #endif /* _SYS_ZAP_LEAF_H */ 235