4 * The contents of this file are subject to the terms of the
5 * Common Development and Distribution License (the "License").
6 * You may not use this file except in compliance with the License.
8 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
9 * or http://www.opensolaris.org/os/licensing.
10 * See the License for the specific language governing permissions
11 * and limitations under the License.
13 * When distributing Covered Code, include this CDDL HEADER in each
14 * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
15 * If applicable, add the following below this CDDL HEADER, with the
16 * fields enclosed by brackets "[]" replaced with your own identifying
17 * information: Portions Copyright [yyyy] [name of copyright owner]
22 * Copyright (c) 2005, 2010, Oracle and/or its affiliates. All rights reserved.
23 * Copyright (c) 2012, 2014 by Delphix. All rights reserved.
27 * This file contains the top half of the zfs directory structure
28 * implementation. The bottom half is in zap_leaf.c.
30 * The zdir is an extendable hash data structure. There is a table of
31 * pointers to buckets (zap_t->zd_data->zd_leafs). The buckets are
32 * each a constant size and hold a variable number of directory entries.
33 * The buckets (aka "leaf nodes") are implemented in zap_leaf.c.
35 * The pointer table holds a power of 2 number of pointers.
36 * (1<<zap_t->zd_data->zd_phys->zd_prefix_len). The bucket pointed to
37 * by the pointer at index i in the table holds entries whose hash value
38 * has a zd_prefix_len - bit prefix
43 #include <sys/zfs_context.h>
44 #include <sys/zfs_znode.h>
45 #include <sys/fs/zfs.h>
47 #include <sys/refcount.h>
48 #include <sys/zap_impl.h>
49 #include <sys/zap_leaf.h>
51 int fzap_default_block_shift = 14; /* 16k blocksize */
53 static void zap_leaf_pageout(dmu_buf_t *db, void *vl);
54 static uint64_t zap_allocate_blocks(zap_t *zap, int nblocks);
58 fzap_byteswap(void *vbuf, size_t size)
62 block_type = *(uint64_t *)vbuf;
64 if (block_type == ZBT_LEAF || block_type == BSWAP_64(ZBT_LEAF))
65 zap_leaf_byteswap(vbuf, size);
67 /* it's a ptrtbl block */
68 byteswap_uint64_array(vbuf, size);
73 fzap_upgrade(zap_t *zap, dmu_tx_t *tx, zap_flags_t flags)
80 ASSERT(RW_WRITE_HELD(&zap->zap_rwlock));
81 zap->zap_ismicro = FALSE;
83 (void) dmu_buf_update_user(zap->zap_dbuf, zap, zap,
84 &zap->zap_f.zap_phys, zap_evict);
86 mutex_init(&zap->zap_f.zap_num_entries_mtx, 0, 0, 0);
87 zap->zap_f.zap_block_shift = highbit64(zap->zap_dbuf->db_size) - 1;
89 zp = zap->zap_f.zap_phys;
91 * explicitly zero it since it might be coming from an
92 * initialized microzap
94 bzero(zap->zap_dbuf->db_data, zap->zap_dbuf->db_size);
95 zp->zap_block_type = ZBT_HEADER;
96 zp->zap_magic = ZAP_MAGIC;
98 zp->zap_ptrtbl.zt_shift = ZAP_EMBEDDED_PTRTBL_SHIFT(zap);
100 zp->zap_freeblk = 2; /* block 1 will be the first leaf */
101 zp->zap_num_leafs = 1;
102 zp->zap_num_entries = 0;
103 zp->zap_salt = zap->zap_salt;
104 zp->zap_normflags = zap->zap_normflags;
105 zp->zap_flags = flags;
107 /* block 1 will be the first leaf */
108 for (i = 0; i < (1<<zp->zap_ptrtbl.zt_shift); i++)
109 ZAP_EMBEDDED_PTRTBL_ENT(zap, i) = 1;
112 * set up block 1 - the first leaf
114 VERIFY(0 == dmu_buf_hold(zap->zap_objset, zap->zap_object,
115 1<<FZAP_BLOCK_SHIFT(zap), FTAG, &db, DMU_READ_NO_PREFETCH));
116 dmu_buf_will_dirty(db, tx);
118 l = kmem_zalloc(sizeof (zap_leaf_t), KM_SLEEP);
120 l->l_phys = db->db_data;
122 zap_leaf_init(l, zp->zap_normflags != 0);
124 kmem_free(l, sizeof (zap_leaf_t));
125 dmu_buf_rele(db, FTAG);
129 zap_tryupgradedir(zap_t *zap, dmu_tx_t *tx)
131 if (RW_WRITE_HELD(&zap->zap_rwlock))
133 if (rw_tryupgrade(&zap->zap_rwlock)) {
134 dmu_buf_will_dirty(zap->zap_dbuf, tx);
141 * Generic routines for dealing with the pointer & cookie tables.
145 zap_table_grow(zap_t *zap, zap_table_phys_t *tbl,
146 void (*transfer_func)(const uint64_t *src, uint64_t *dst, int n),
150 dmu_buf_t *db_old, *db_new;
152 int bs = FZAP_BLOCK_SHIFT(zap);
153 int hepb = 1<<(bs-4);
154 /* hepb = half the number of entries in a block */
156 ASSERT(RW_WRITE_HELD(&zap->zap_rwlock));
157 ASSERT(tbl->zt_blk != 0);
158 ASSERT(tbl->zt_numblks > 0);
160 if (tbl->zt_nextblk != 0) {
161 newblk = tbl->zt_nextblk;
163 newblk = zap_allocate_blocks(zap, tbl->zt_numblks * 2);
164 tbl->zt_nextblk = newblk;
165 ASSERT0(tbl->zt_blks_copied);
166 dmu_prefetch(zap->zap_objset, zap->zap_object,
167 tbl->zt_blk << bs, tbl->zt_numblks << bs);
171 * Copy the ptrtbl from the old to new location.
174 b = tbl->zt_blks_copied;
175 err = dmu_buf_hold(zap->zap_objset, zap->zap_object,
176 (tbl->zt_blk + b) << bs, FTAG, &db_old, DMU_READ_NO_PREFETCH);
180 /* first half of entries in old[b] go to new[2*b+0] */
181 VERIFY(0 == dmu_buf_hold(zap->zap_objset, zap->zap_object,
182 (newblk + 2*b+0) << bs, FTAG, &db_new, DMU_READ_NO_PREFETCH));
183 dmu_buf_will_dirty(db_new, tx);
184 transfer_func(db_old->db_data, db_new->db_data, hepb);
185 dmu_buf_rele(db_new, FTAG);
187 /* second half of entries in old[b] go to new[2*b+1] */
188 VERIFY(0 == dmu_buf_hold(zap->zap_objset, zap->zap_object,
189 (newblk + 2*b+1) << bs, FTAG, &db_new, DMU_READ_NO_PREFETCH));
190 dmu_buf_will_dirty(db_new, tx);
191 transfer_func((uint64_t *)db_old->db_data + hepb,
192 db_new->db_data, hepb);
193 dmu_buf_rele(db_new, FTAG);
195 dmu_buf_rele(db_old, FTAG);
197 tbl->zt_blks_copied++;
199 dprintf("copied block %llu of %llu\n",
200 tbl->zt_blks_copied, tbl->zt_numblks);
202 if (tbl->zt_blks_copied == tbl->zt_numblks) {
203 (void) dmu_free_range(zap->zap_objset, zap->zap_object,
204 tbl->zt_blk << bs, tbl->zt_numblks << bs, tx);
206 tbl->zt_blk = newblk;
207 tbl->zt_numblks *= 2;
210 tbl->zt_blks_copied = 0;
212 dprintf("finished; numblocks now %llu (%lluk entries)\n",
213 tbl->zt_numblks, 1<<(tbl->zt_shift-10));
220 zap_table_store(zap_t *zap, zap_table_phys_t *tbl, uint64_t idx, uint64_t val,
225 int bs = FZAP_BLOCK_SHIFT(zap);
228 ASSERT(RW_LOCK_HELD(&zap->zap_rwlock));
229 ASSERT(tbl->zt_blk != 0);
231 dprintf("storing %llx at index %llx\n", val, idx);
234 off = idx & ((1<<(bs-3))-1);
236 err = dmu_buf_hold(zap->zap_objset, zap->zap_object,
237 (tbl->zt_blk + blk) << bs, FTAG, &db, DMU_READ_NO_PREFETCH);
240 dmu_buf_will_dirty(db, tx);
242 if (tbl->zt_nextblk != 0) {
243 uint64_t idx2 = idx * 2;
244 uint64_t blk2 = idx2 >> (bs-3);
245 uint64_t off2 = idx2 & ((1<<(bs-3))-1);
248 err = dmu_buf_hold(zap->zap_objset, zap->zap_object,
249 (tbl->zt_nextblk + blk2) << bs, FTAG, &db2,
250 DMU_READ_NO_PREFETCH);
252 dmu_buf_rele(db, FTAG);
255 dmu_buf_will_dirty(db2, tx);
256 ((uint64_t *)db2->db_data)[off2] = val;
257 ((uint64_t *)db2->db_data)[off2+1] = val;
258 dmu_buf_rele(db2, FTAG);
261 ((uint64_t *)db->db_data)[off] = val;
262 dmu_buf_rele(db, FTAG);
268 zap_table_load(zap_t *zap, zap_table_phys_t *tbl, uint64_t idx, uint64_t *valp)
273 int bs = FZAP_BLOCK_SHIFT(zap);
275 ASSERT(RW_LOCK_HELD(&zap->zap_rwlock));
278 off = idx & ((1<<(bs-3))-1);
280 err = dmu_buf_hold(zap->zap_objset, zap->zap_object,
281 (tbl->zt_blk + blk) << bs, FTAG, &db, DMU_READ_NO_PREFETCH);
284 *valp = ((uint64_t *)db->db_data)[off];
285 dmu_buf_rele(db, FTAG);
287 if (tbl->zt_nextblk != 0) {
289 * read the nextblk for the sake of i/o error checking,
290 * so that zap_table_load() will catch errors for
293 blk = (idx*2) >> (bs-3);
295 err = dmu_buf_hold(zap->zap_objset, zap->zap_object,
296 (tbl->zt_nextblk + blk) << bs, FTAG, &db,
297 DMU_READ_NO_PREFETCH);
299 dmu_buf_rele(db, FTAG);
305 * Routines for growing the ptrtbl.
309 zap_ptrtbl_transfer(const uint64_t *src, uint64_t *dst, int n)
312 for (i = 0; i < n; i++) {
313 uint64_t lb = src[i];
320 zap_grow_ptrtbl(zap_t *zap, dmu_tx_t *tx)
323 * The pointer table should never use more hash bits than we
324 * have (otherwise we'd be using useless zero bits to index it).
325 * If we are within 2 bits of running out, stop growing, since
326 * this is already an aberrant condition.
328 if (zap->zap_f.zap_phys->zap_ptrtbl.zt_shift >= zap_hashbits(zap) - 2)
329 return (SET_ERROR(ENOSPC));
331 if (zap->zap_f.zap_phys->zap_ptrtbl.zt_numblks == 0) {
333 * We are outgrowing the "embedded" ptrtbl (the one
334 * stored in the header block). Give it its own entire
335 * block, which will double the size of the ptrtbl.
341 ASSERT3U(zap->zap_f.zap_phys->zap_ptrtbl.zt_shift, ==,
342 ZAP_EMBEDDED_PTRTBL_SHIFT(zap));
343 ASSERT0(zap->zap_f.zap_phys->zap_ptrtbl.zt_blk);
345 newblk = zap_allocate_blocks(zap, 1);
346 err = dmu_buf_hold(zap->zap_objset, zap->zap_object,
347 newblk << FZAP_BLOCK_SHIFT(zap), FTAG, &db_new,
348 DMU_READ_NO_PREFETCH);
351 dmu_buf_will_dirty(db_new, tx);
352 zap_ptrtbl_transfer(&ZAP_EMBEDDED_PTRTBL_ENT(zap, 0),
353 db_new->db_data, 1 << ZAP_EMBEDDED_PTRTBL_SHIFT(zap));
354 dmu_buf_rele(db_new, FTAG);
356 zap->zap_f.zap_phys->zap_ptrtbl.zt_blk = newblk;
357 zap->zap_f.zap_phys->zap_ptrtbl.zt_numblks = 1;
358 zap->zap_f.zap_phys->zap_ptrtbl.zt_shift++;
360 ASSERT3U(1ULL << zap->zap_f.zap_phys->zap_ptrtbl.zt_shift, ==,
361 zap->zap_f.zap_phys->zap_ptrtbl.zt_numblks <<
362 (FZAP_BLOCK_SHIFT(zap)-3));
366 return (zap_table_grow(zap, &zap->zap_f.zap_phys->zap_ptrtbl,
367 zap_ptrtbl_transfer, tx));
372 zap_increment_num_entries(zap_t *zap, int delta, dmu_tx_t *tx)
374 dmu_buf_will_dirty(zap->zap_dbuf, tx);
375 mutex_enter(&zap->zap_f.zap_num_entries_mtx);
376 ASSERT(delta > 0 || zap->zap_f.zap_phys->zap_num_entries >= -delta);
377 zap->zap_f.zap_phys->zap_num_entries += delta;
378 mutex_exit(&zap->zap_f.zap_num_entries_mtx);
382 zap_allocate_blocks(zap_t *zap, int nblocks)
385 ASSERT(RW_WRITE_HELD(&zap->zap_rwlock));
386 newblk = zap->zap_f.zap_phys->zap_freeblk;
387 zap->zap_f.zap_phys->zap_freeblk += nblocks;
392 zap_create_leaf(zap_t *zap, dmu_tx_t *tx)
395 zap_leaf_t *l = kmem_alloc(sizeof (zap_leaf_t), KM_SLEEP);
397 ASSERT(RW_WRITE_HELD(&zap->zap_rwlock));
399 rw_init(&l->l_rwlock, 0, 0, 0);
400 rw_enter(&l->l_rwlock, RW_WRITER);
401 l->l_blkid = zap_allocate_blocks(zap, 1);
405 VERIFY(0 == dmu_buf_hold(zap->zap_objset, zap->zap_object,
406 l->l_blkid << FZAP_BLOCK_SHIFT(zap), NULL, &l->l_dbuf,
407 DMU_READ_NO_PREFETCH));
408 winner = dmu_buf_set_user(l->l_dbuf, l, &l->l_phys, zap_leaf_pageout);
409 ASSERT(winner == NULL);
410 dmu_buf_will_dirty(l->l_dbuf, tx);
412 zap_leaf_init(l, zap->zap_normflags != 0);
414 zap->zap_f.zap_phys->zap_num_leafs++;
420 fzap_count(zap_t *zap, uint64_t *count)
422 ASSERT(!zap->zap_ismicro);
423 mutex_enter(&zap->zap_f.zap_num_entries_mtx); /* unnecessary */
424 *count = zap->zap_f.zap_phys->zap_num_entries;
425 mutex_exit(&zap->zap_f.zap_num_entries_mtx);
430 * Routines for obtaining zap_leaf_t's
434 zap_put_leaf(zap_leaf_t *l)
436 rw_exit(&l->l_rwlock);
437 dmu_buf_rele(l->l_dbuf, NULL);
442 zap_leaf_pageout(dmu_buf_t *db, void *vl)
446 rw_destroy(&l->l_rwlock);
447 kmem_free(l, sizeof (zap_leaf_t));
451 zap_open_leaf(uint64_t blkid, dmu_buf_t *db)
453 zap_leaf_t *l, *winner;
457 l = kmem_alloc(sizeof (zap_leaf_t), KM_SLEEP);
458 rw_init(&l->l_rwlock, 0, 0, 0);
459 rw_enter(&l->l_rwlock, RW_WRITER);
461 l->l_bs = highbit64(db->db_size) - 1;
465 winner = dmu_buf_set_user(db, l, &l->l_phys, zap_leaf_pageout);
467 rw_exit(&l->l_rwlock);
468 if (winner != NULL) {
469 /* someone else set it first */
470 zap_leaf_pageout(NULL, l);
475 * lhr_pad was previously used for the next leaf in the leaf
476 * chain. There should be no chained leafs (as we have removed
479 ASSERT0(l->l_phys->l_hdr.lh_pad1);
482 * There should be more hash entries than there can be
483 * chunks to put in the hash table
485 ASSERT3U(ZAP_LEAF_HASH_NUMENTRIES(l), >, ZAP_LEAF_NUMCHUNKS(l) / 3);
487 /* The chunks should begin at the end of the hash table */
488 ASSERT3P(&ZAP_LEAF_CHUNK(l, 0), ==,
489 &l->l_phys->l_hash[ZAP_LEAF_HASH_NUMENTRIES(l)]);
491 /* The chunks should end at the end of the block */
492 ASSERT3U((uintptr_t)&ZAP_LEAF_CHUNK(l, ZAP_LEAF_NUMCHUNKS(l)) -
493 (uintptr_t)l->l_phys, ==, l->l_dbuf->db_size);
499 zap_get_leaf_byblk(zap_t *zap, uint64_t blkid, dmu_tx_t *tx, krw_t lt,
504 int bs = FZAP_BLOCK_SHIFT(zap);
507 ASSERT(RW_LOCK_HELD(&zap->zap_rwlock));
509 err = dmu_buf_hold(zap->zap_objset, zap->zap_object,
510 blkid << bs, NULL, &db, DMU_READ_NO_PREFETCH);
514 ASSERT3U(db->db_object, ==, zap->zap_object);
515 ASSERT3U(db->db_offset, ==, blkid << bs);
516 ASSERT3U(db->db_size, ==, 1 << bs);
519 l = dmu_buf_get_user(db);
522 l = zap_open_leaf(blkid, db);
524 rw_enter(&l->l_rwlock, lt);
526 * Must lock before dirtying, otherwise l->l_phys could change,
527 * causing ASSERT below to fail.
530 dmu_buf_will_dirty(db, tx);
531 ASSERT3U(l->l_blkid, ==, blkid);
532 ASSERT3P(l->l_dbuf, ==, db);
533 ASSERT3P(l->l_phys, ==, l->l_dbuf->db_data);
534 ASSERT3U(l->l_phys->l_hdr.lh_block_type, ==, ZBT_LEAF);
535 ASSERT3U(l->l_phys->l_hdr.lh_magic, ==, ZAP_LEAF_MAGIC);
542 zap_idx_to_blk(zap_t *zap, uint64_t idx, uint64_t *valp)
544 ASSERT(RW_LOCK_HELD(&zap->zap_rwlock));
546 if (zap->zap_f.zap_phys->zap_ptrtbl.zt_numblks == 0) {
548 (1ULL << zap->zap_f.zap_phys->zap_ptrtbl.zt_shift));
549 *valp = ZAP_EMBEDDED_PTRTBL_ENT(zap, idx);
552 return (zap_table_load(zap, &zap->zap_f.zap_phys->zap_ptrtbl,
558 zap_set_idx_to_blk(zap_t *zap, uint64_t idx, uint64_t blk, dmu_tx_t *tx)
561 ASSERT(RW_WRITE_HELD(&zap->zap_rwlock));
563 if (zap->zap_f.zap_phys->zap_ptrtbl.zt_blk == 0) {
564 ZAP_EMBEDDED_PTRTBL_ENT(zap, idx) = blk;
567 return (zap_table_store(zap, &zap->zap_f.zap_phys->zap_ptrtbl,
573 zap_deref_leaf(zap_t *zap, uint64_t h, dmu_tx_t *tx, krw_t lt, zap_leaf_t **lp)
578 ASSERT(zap->zap_dbuf == NULL ||
579 zap->zap_f.zap_phys == zap->zap_dbuf->db_data);
580 ASSERT3U(zap->zap_f.zap_phys->zap_magic, ==, ZAP_MAGIC);
581 idx = ZAP_HASH_IDX(h, zap->zap_f.zap_phys->zap_ptrtbl.zt_shift);
582 err = zap_idx_to_blk(zap, idx, &blk);
585 err = zap_get_leaf_byblk(zap, blk, tx, lt, lp);
587 ASSERT(err || ZAP_HASH_IDX(h, (*lp)->l_phys->l_hdr.lh_prefix_len) ==
588 (*lp)->l_phys->l_hdr.lh_prefix);
593 zap_expand_leaf(zap_name_t *zn, zap_leaf_t *l, dmu_tx_t *tx, zap_leaf_t **lp)
595 zap_t *zap = zn->zn_zap;
596 uint64_t hash = zn->zn_hash;
598 int prefix_diff, i, err;
600 int old_prefix_len = l->l_phys->l_hdr.lh_prefix_len;
602 ASSERT3U(old_prefix_len, <=, zap->zap_f.zap_phys->zap_ptrtbl.zt_shift);
603 ASSERT(RW_LOCK_HELD(&zap->zap_rwlock));
605 ASSERT3U(ZAP_HASH_IDX(hash, old_prefix_len), ==,
606 l->l_phys->l_hdr.lh_prefix);
608 if (zap_tryupgradedir(zap, tx) == 0 ||
609 old_prefix_len == zap->zap_f.zap_phys->zap_ptrtbl.zt_shift) {
610 /* We failed to upgrade, or need to grow the pointer table */
611 objset_t *os = zap->zap_objset;
612 uint64_t object = zap->zap_object;
616 err = zap_lockdir(os, object, tx, RW_WRITER,
617 FALSE, FALSE, &zn->zn_zap);
621 ASSERT(!zap->zap_ismicro);
623 while (old_prefix_len ==
624 zap->zap_f.zap_phys->zap_ptrtbl.zt_shift) {
625 err = zap_grow_ptrtbl(zap, tx);
630 err = zap_deref_leaf(zap, hash, tx, RW_WRITER, &l);
634 if (l->l_phys->l_hdr.lh_prefix_len != old_prefix_len) {
635 /* it split while our locks were down */
640 ASSERT(RW_WRITE_HELD(&zap->zap_rwlock));
641 ASSERT3U(old_prefix_len, <, zap->zap_f.zap_phys->zap_ptrtbl.zt_shift);
642 ASSERT3U(ZAP_HASH_IDX(hash, old_prefix_len), ==,
643 l->l_phys->l_hdr.lh_prefix);
645 prefix_diff = zap->zap_f.zap_phys->zap_ptrtbl.zt_shift -
646 (old_prefix_len + 1);
647 sibling = (ZAP_HASH_IDX(hash, old_prefix_len + 1) | 1) << prefix_diff;
649 /* check for i/o errors before doing zap_leaf_split */
650 for (i = 0; i < (1ULL<<prefix_diff); i++) {
652 err = zap_idx_to_blk(zap, sibling+i, &blk);
655 ASSERT3U(blk, ==, l->l_blkid);
658 nl = zap_create_leaf(zap, tx);
659 zap_leaf_split(l, nl, zap->zap_normflags != 0);
661 /* set sibling pointers */
662 for (i = 0; i < (1ULL << prefix_diff); i++) {
663 err = zap_set_idx_to_blk(zap, sibling+i, nl->l_blkid, tx);
664 ASSERT0(err); /* we checked for i/o errors above */
667 if (hash & (1ULL << (64 - l->l_phys->l_hdr.lh_prefix_len))) {
668 /* we want the sibling */
680 zap_put_leaf_maybe_grow_ptrtbl(zap_name_t *zn, zap_leaf_t *l, dmu_tx_t *tx)
682 zap_t *zap = zn->zn_zap;
683 int shift = zap->zap_f.zap_phys->zap_ptrtbl.zt_shift;
684 int leaffull = (l->l_phys->l_hdr.lh_prefix_len == shift &&
685 l->l_phys->l_hdr.lh_nfree < ZAP_LEAF_LOW_WATER);
689 if (leaffull || zap->zap_f.zap_phys->zap_ptrtbl.zt_nextblk) {
693 * We are in the middle of growing the pointer table, or
694 * this leaf will soon make us grow it.
696 if (zap_tryupgradedir(zap, tx) == 0) {
697 objset_t *os = zap->zap_objset;
698 uint64_t zapobj = zap->zap_object;
701 err = zap_lockdir(os, zapobj, tx,
702 RW_WRITER, FALSE, FALSE, &zn->zn_zap);
708 /* could have finished growing while our locks were down */
709 if (zap->zap_f.zap_phys->zap_ptrtbl.zt_shift == shift)
710 (void) zap_grow_ptrtbl(zap, tx);
715 fzap_checkname(zap_name_t *zn)
717 if (zn->zn_key_orig_numints * zn->zn_key_intlen > ZAP_MAXNAMELEN)
718 return (SET_ERROR(ENAMETOOLONG));
723 fzap_checksize(uint64_t integer_size, uint64_t num_integers)
725 /* Only integer sizes supported by C */
726 switch (integer_size) {
733 return (SET_ERROR(EINVAL));
736 if (integer_size * num_integers > ZAP_MAXVALUELEN)
743 fzap_check(zap_name_t *zn, uint64_t integer_size, uint64_t num_integers)
747 if ((err = fzap_checkname(zn)) != 0)
749 return (fzap_checksize(integer_size, num_integers));
753 * Routines for manipulating attributes.
756 fzap_lookup(zap_name_t *zn,
757 uint64_t integer_size, uint64_t num_integers, void *buf,
758 char *realname, int rn_len, boolean_t *ncp)
762 zap_entry_handle_t zeh;
764 if ((err = fzap_checkname(zn)) != 0)
767 err = zap_deref_leaf(zn->zn_zap, zn->zn_hash, NULL, RW_READER, &l);
770 err = zap_leaf_lookup(l, zn, &zeh);
772 if ((err = fzap_checksize(integer_size, num_integers)) != 0) {
777 err = zap_entry_read(&zeh, integer_size, num_integers, buf);
778 (void) zap_entry_read_name(zn->zn_zap, &zeh, rn_len, realname);
780 *ncp = zap_entry_normalization_conflict(&zeh,
781 zn, NULL, zn->zn_zap);
790 fzap_add_cd(zap_name_t *zn,
791 uint64_t integer_size, uint64_t num_integers,
792 const void *val, uint32_t cd, dmu_tx_t *tx)
796 zap_entry_handle_t zeh;
797 zap_t *zap = zn->zn_zap;
799 ASSERT(RW_LOCK_HELD(&zap->zap_rwlock));
800 ASSERT(!zap->zap_ismicro);
801 ASSERT(fzap_check(zn, integer_size, num_integers) == 0);
803 err = zap_deref_leaf(zap, zn->zn_hash, tx, RW_WRITER, &l);
807 err = zap_leaf_lookup(l, zn, &zeh);
809 err = SET_ERROR(EEXIST);
815 err = zap_entry_create(l, zn, cd,
816 integer_size, num_integers, val, &zeh);
819 zap_increment_num_entries(zap, 1, tx);
820 } else if (err == EAGAIN) {
821 err = zap_expand_leaf(zn, l, tx, &l);
822 zap = zn->zn_zap; /* zap_expand_leaf() may change zap */
829 zap_put_leaf_maybe_grow_ptrtbl(zn, l, tx);
834 fzap_add(zap_name_t *zn,
835 uint64_t integer_size, uint64_t num_integers,
836 const void *val, dmu_tx_t *tx)
838 int err = fzap_check(zn, integer_size, num_integers);
842 return (fzap_add_cd(zn, integer_size, num_integers,
843 val, ZAP_NEED_CD, tx));
847 fzap_update(zap_name_t *zn,
848 int integer_size, uint64_t num_integers, const void *val, dmu_tx_t *tx)
852 zap_entry_handle_t zeh;
853 zap_t *zap = zn->zn_zap;
855 ASSERT(RW_LOCK_HELD(&zap->zap_rwlock));
856 err = fzap_check(zn, integer_size, num_integers);
860 err = zap_deref_leaf(zap, zn->zn_hash, tx, RW_WRITER, &l);
864 err = zap_leaf_lookup(l, zn, &zeh);
865 create = (err == ENOENT);
866 ASSERT(err == 0 || err == ENOENT);
869 err = zap_entry_create(l, zn, ZAP_NEED_CD,
870 integer_size, num_integers, val, &zeh);
872 zap_increment_num_entries(zap, 1, tx);
874 err = zap_entry_update(&zeh, integer_size, num_integers, val);
878 err = zap_expand_leaf(zn, l, tx, &l);
879 zap = zn->zn_zap; /* zap_expand_leaf() may change zap */
885 zap_put_leaf_maybe_grow_ptrtbl(zn, l, tx);
890 fzap_length(zap_name_t *zn,
891 uint64_t *integer_size, uint64_t *num_integers)
895 zap_entry_handle_t zeh;
897 err = zap_deref_leaf(zn->zn_zap, zn->zn_hash, NULL, RW_READER, &l);
900 err = zap_leaf_lookup(l, zn, &zeh);
905 *integer_size = zeh.zeh_integer_size;
907 *num_integers = zeh.zeh_num_integers;
914 fzap_remove(zap_name_t *zn, dmu_tx_t *tx)
918 zap_entry_handle_t zeh;
920 err = zap_deref_leaf(zn->zn_zap, zn->zn_hash, tx, RW_WRITER, &l);
923 err = zap_leaf_lookup(l, zn, &zeh);
925 zap_entry_remove(&zeh);
926 zap_increment_num_entries(zn->zn_zap, -1, tx);
933 fzap_prefetch(zap_name_t *zn)
936 zap_t *zap = zn->zn_zap;
939 idx = ZAP_HASH_IDX(zn->zn_hash,
940 zap->zap_f.zap_phys->zap_ptrtbl.zt_shift);
941 if (zap_idx_to_blk(zap, idx, &blk) != 0)
943 bs = FZAP_BLOCK_SHIFT(zap);
944 dmu_prefetch(zap->zap_objset, zap->zap_object, blk << bs, 1 << bs);
948 * Helper functions for consumers.
952 zap_create_link(objset_t *os, dmu_object_type_t ot, uint64_t parent_obj,
953 const char *name, dmu_tx_t *tx)
957 VERIFY((new_obj = zap_create(os, ot, DMU_OT_NONE, 0, tx)) > 0);
958 VERIFY(zap_add(os, parent_obj, name, sizeof (uint64_t), 1, &new_obj,
965 zap_value_search(objset_t *os, uint64_t zapobj, uint64_t value, uint64_t mask,
975 za = kmem_alloc(sizeof (zap_attribute_t), KM_SLEEP);
976 for (zap_cursor_init(&zc, os, zapobj);
977 (err = zap_cursor_retrieve(&zc, za)) == 0;
978 zap_cursor_advance(&zc)) {
979 if ((za->za_first_integer & mask) == (value & mask)) {
980 (void) strcpy(name, za->za_name);
984 zap_cursor_fini(&zc);
985 kmem_free(za, sizeof (zap_attribute_t));
990 zap_join(objset_t *os, uint64_t fromobj, uint64_t intoobj, dmu_tx_t *tx)
997 for (zap_cursor_init(&zc, os, fromobj);
998 zap_cursor_retrieve(&zc, &za) == 0;
999 (void) zap_cursor_advance(&zc)) {
1000 if (za.za_integer_length != 8 || za.za_num_integers != 1) {
1001 err = SET_ERROR(EINVAL);
1004 err = zap_add(os, intoobj, za.za_name,
1005 8, 1, &za.za_first_integer, tx);
1009 zap_cursor_fini(&zc);
1014 zap_join_key(objset_t *os, uint64_t fromobj, uint64_t intoobj,
1015 uint64_t value, dmu_tx_t *tx)
1022 for (zap_cursor_init(&zc, os, fromobj);
1023 zap_cursor_retrieve(&zc, &za) == 0;
1024 (void) zap_cursor_advance(&zc)) {
1025 if (za.za_integer_length != 8 || za.za_num_integers != 1) {
1026 err = SET_ERROR(EINVAL);
1029 err = zap_add(os, intoobj, za.za_name,
1034 zap_cursor_fini(&zc);
1039 zap_join_increment(objset_t *os, uint64_t fromobj, uint64_t intoobj,
1047 for (zap_cursor_init(&zc, os, fromobj);
1048 zap_cursor_retrieve(&zc, &za) == 0;
1049 (void) zap_cursor_advance(&zc)) {
1052 if (za.za_integer_length != 8 || za.za_num_integers != 1) {
1053 err = SET_ERROR(EINVAL);
1057 err = zap_lookup(os, intoobj, za.za_name, 8, 1, &delta);
1058 if (err != 0 && err != ENOENT)
1060 delta += za.za_first_integer;
1061 err = zap_update(os, intoobj, za.za_name, 8, 1, &delta, tx);
1065 zap_cursor_fini(&zc);
1070 zap_add_int(objset_t *os, uint64_t obj, uint64_t value, dmu_tx_t *tx)
1074 (void) snprintf(name, sizeof (name), "%llx", (longlong_t)value);
1075 return (zap_add(os, obj, name, 8, 1, &value, tx));
1079 zap_remove_int(objset_t *os, uint64_t obj, uint64_t value, dmu_tx_t *tx)
1083 (void) snprintf(name, sizeof (name), "%llx", (longlong_t)value);
1084 return (zap_remove(os, obj, name, tx));
1088 zap_lookup_int(objset_t *os, uint64_t obj, uint64_t value)
1092 (void) snprintf(name, sizeof (name), "%llx", (longlong_t)value);
1093 return (zap_lookup(os, obj, name, 8, 1, &value));
1097 zap_add_int_key(objset_t *os, uint64_t obj,
1098 uint64_t key, uint64_t value, dmu_tx_t *tx)
1102 (void) snprintf(name, sizeof (name), "%llx", (longlong_t)key);
1103 return (zap_add(os, obj, name, 8, 1, &value, tx));
1107 zap_update_int_key(objset_t *os, uint64_t obj,
1108 uint64_t key, uint64_t value, dmu_tx_t *tx)
1112 (void) snprintf(name, sizeof (name), "%llx", (longlong_t)key);
1113 return (zap_update(os, obj, name, 8, 1, &value, tx));
1117 zap_lookup_int_key(objset_t *os, uint64_t obj, uint64_t key, uint64_t *valuep)
1121 (void) snprintf(name, sizeof (name), "%llx", (longlong_t)key);
1122 return (zap_lookup(os, obj, name, 8, 1, valuep));
1126 zap_increment(objset_t *os, uint64_t obj, const char *name, int64_t delta,
1135 err = zap_lookup(os, obj, name, 8, 1, &value);
1136 if (err != 0 && err != ENOENT)
1140 err = zap_remove(os, obj, name, tx);
1142 err = zap_update(os, obj, name, 8, 1, &value, tx);
1147 zap_increment_int(objset_t *os, uint64_t obj, uint64_t key, int64_t delta,
1152 (void) snprintf(name, sizeof (name), "%llx", (longlong_t)key);
1153 return (zap_increment(os, obj, name, delta, tx));
1157 * Routines for iterating over the attributes.
1161 fzap_cursor_retrieve(zap_t *zap, zap_cursor_t *zc, zap_attribute_t *za)
1164 zap_entry_handle_t zeh;
1167 /* retrieve the next entry at or after zc_hash/zc_cd */
1168 /* if no entry, return ENOENT */
1171 (ZAP_HASH_IDX(zc->zc_hash,
1172 zc->zc_leaf->l_phys->l_hdr.lh_prefix_len) !=
1173 zc->zc_leaf->l_phys->l_hdr.lh_prefix)) {
1174 rw_enter(&zc->zc_leaf->l_rwlock, RW_READER);
1175 zap_put_leaf(zc->zc_leaf);
1180 if (zc->zc_leaf == NULL) {
1181 err = zap_deref_leaf(zap, zc->zc_hash, NULL, RW_READER,
1186 rw_enter(&zc->zc_leaf->l_rwlock, RW_READER);
1190 err = zap_leaf_lookup_closest(l, zc->zc_hash, zc->zc_cd, &zeh);
1192 if (err == ENOENT) {
1194 (1ULL << (64 - l->l_phys->l_hdr.lh_prefix_len)) - 1;
1195 zc->zc_hash = (zc->zc_hash & ~nocare) + nocare + 1;
1197 if (l->l_phys->l_hdr.lh_prefix_len == 0 || zc->zc_hash == 0) {
1198 zc->zc_hash = -1ULL;
1200 zap_put_leaf(zc->zc_leaf);
1207 zc->zc_hash = zeh.zeh_hash;
1208 zc->zc_cd = zeh.zeh_cd;
1209 za->za_integer_length = zeh.zeh_integer_size;
1210 za->za_num_integers = zeh.zeh_num_integers;
1211 if (zeh.zeh_num_integers == 0) {
1212 za->za_first_integer = 0;
1214 err = zap_entry_read(&zeh, 8, 1, &za->za_first_integer);
1215 ASSERT(err == 0 || err == EOVERFLOW);
1217 err = zap_entry_read_name(zap, &zeh,
1218 sizeof (za->za_name), za->za_name);
1221 za->za_normalization_conflict =
1222 zap_entry_normalization_conflict(&zeh,
1223 NULL, za->za_name, zap);
1225 rw_exit(&zc->zc_leaf->l_rwlock);
1230 zap_stats_ptrtbl(zap_t *zap, uint64_t *tbl, int len, zap_stats_t *zs)
1233 uint64_t lastblk = 0;
1236 * NB: if a leaf has more pointers than an entire ptrtbl block
1237 * can hold, then it'll be accounted for more than once, since
1238 * we won't have lastblk.
1240 for (i = 0; i < len; i++) {
1243 if (tbl[i] == lastblk)
1247 err = zap_get_leaf_byblk(zap, tbl[i], NULL, RW_READER, &l);
1249 zap_leaf_stats(zap, l, zs);
1256 fzap_cursor_move_to_key(zap_cursor_t *zc, zap_name_t *zn)
1260 zap_entry_handle_t zeh;
1262 if (zn->zn_key_orig_numints * zn->zn_key_intlen > ZAP_MAXNAMELEN)
1263 return (SET_ERROR(ENAMETOOLONG));
1265 err = zap_deref_leaf(zc->zc_zap, zn->zn_hash, NULL, RW_READER, &l);
1269 err = zap_leaf_lookup(l, zn, &zeh);
1274 zc->zc_hash = zeh.zeh_hash;
1275 zc->zc_cd = zeh.zeh_cd;
1281 fzap_get_stats(zap_t *zap, zap_stats_t *zs)
1283 int bs = FZAP_BLOCK_SHIFT(zap);
1284 zs->zs_blocksize = 1ULL << bs;
1287 * Set zap_phys_t fields
1289 zs->zs_num_leafs = zap->zap_f.zap_phys->zap_num_leafs;
1290 zs->zs_num_entries = zap->zap_f.zap_phys->zap_num_entries;
1291 zs->zs_num_blocks = zap->zap_f.zap_phys->zap_freeblk;
1292 zs->zs_block_type = zap->zap_f.zap_phys->zap_block_type;
1293 zs->zs_magic = zap->zap_f.zap_phys->zap_magic;
1294 zs->zs_salt = zap->zap_f.zap_phys->zap_salt;
1297 * Set zap_ptrtbl fields
1299 zs->zs_ptrtbl_len = 1ULL << zap->zap_f.zap_phys->zap_ptrtbl.zt_shift;
1300 zs->zs_ptrtbl_nextblk = zap->zap_f.zap_phys->zap_ptrtbl.zt_nextblk;
1301 zs->zs_ptrtbl_blks_copied =
1302 zap->zap_f.zap_phys->zap_ptrtbl.zt_blks_copied;
1303 zs->zs_ptrtbl_zt_blk = zap->zap_f.zap_phys->zap_ptrtbl.zt_blk;
1304 zs->zs_ptrtbl_zt_numblks = zap->zap_f.zap_phys->zap_ptrtbl.zt_numblks;
1305 zs->zs_ptrtbl_zt_shift = zap->zap_f.zap_phys->zap_ptrtbl.zt_shift;
1307 if (zap->zap_f.zap_phys->zap_ptrtbl.zt_numblks == 0) {
1308 /* the ptrtbl is entirely in the header block. */
1309 zap_stats_ptrtbl(zap, &ZAP_EMBEDDED_PTRTBL_ENT(zap, 0),
1310 1 << ZAP_EMBEDDED_PTRTBL_SHIFT(zap), zs);
1314 dmu_prefetch(zap->zap_objset, zap->zap_object,
1315 zap->zap_f.zap_phys->zap_ptrtbl.zt_blk << bs,
1316 zap->zap_f.zap_phys->zap_ptrtbl.zt_numblks << bs);
1318 for (b = 0; b < zap->zap_f.zap_phys->zap_ptrtbl.zt_numblks;
1323 err = dmu_buf_hold(zap->zap_objset, zap->zap_object,
1324 (zap->zap_f.zap_phys->zap_ptrtbl.zt_blk + b) << bs,
1325 FTAG, &db, DMU_READ_NO_PREFETCH);
1327 zap_stats_ptrtbl(zap, db->db_data,
1329 dmu_buf_rele(db, FTAG);
1336 fzap_count_write(zap_name_t *zn, int add, uint64_t *towrite,
1337 uint64_t *tooverwrite)
1339 zap_t *zap = zn->zn_zap;
1344 * Account for the header block of the fatzap.
1346 if (!add && dmu_buf_freeable(zap->zap_dbuf)) {
1347 *tooverwrite += zap->zap_dbuf->db_size;
1349 *towrite += zap->zap_dbuf->db_size;
1353 * Account for the pointer table blocks.
1354 * If we are adding we need to account for the following cases :
1355 * - If the pointer table is embedded, this operation could force an
1356 * external pointer table.
1357 * - If this already has an external pointer table this operation
1358 * could extend the table.
1361 if (zap->zap_f.zap_phys->zap_ptrtbl.zt_blk == 0)
1362 *towrite += zap->zap_dbuf->db_size;
1364 *towrite += (zap->zap_dbuf->db_size * 3);
1368 * Now, check if the block containing leaf is freeable
1369 * and account accordingly.
1371 err = zap_deref_leaf(zap, zn->zn_hash, NULL, RW_READER, &l);
1376 if (!add && dmu_buf_freeable(l->l_dbuf)) {
1377 *tooverwrite += l->l_dbuf->db_size;
1380 * If this an add operation, the leaf block could split.
1381 * Hence, we need to account for an additional leaf block.
1383 *towrite += (add ? 2 : 1) * l->l_dbuf->db_size;