1168404Spjd/* 2168404Spjd * CDDL HEADER START 3168404Spjd * 4168404Spjd * The contents of this file are subject to the terms of the 5168404Spjd * Common Development and Distribution License (the "License"). 6168404Spjd * You may not use this file except in compliance with the License. 7168404Spjd * 8168404Spjd * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE 9168404Spjd * or http://www.opensolaris.org/os/licensing. 10168404Spjd * See the License for the specific language governing permissions 11168404Spjd * and limitations under the License. 12168404Spjd * 13168404Spjd * When distributing Covered Code, include this CDDL HEADER in each 14168404Spjd * file and include the License file at usr/src/OPENSOLARIS.LICENSE. 15168404Spjd * If applicable, add the following below this CDDL HEADER, with the 16168404Spjd * fields enclosed by brackets "[]" replaced with your own identifying 17168404Spjd * information: Portions Copyright [yyyy] [name of copyright owner] 18168404Spjd * 19168404Spjd * CDDL HEADER END 20168404Spjd */ 21168404Spjd/* 22219089Spjd * Copyright (c) 2005, 2010, Oracle and/or its affiliates. All rights reserved. 23285202Savg * Copyright (c) 2012, 2015 by Delphix. All rights reserved. 24288549Smav * Copyright (c) 2014 Spectra Logic Corporation, All rights reserved. 25297112Smav * Copyright (c) 2014 Integros [integros.com] 26168404Spjd */ 27168404Spjd 28168404Spjd#include <sys/zfs_context.h> 29168404Spjd#include <sys/dbuf.h> 30168404Spjd#include <sys/dnode.h> 31168404Spjd#include <sys/dmu.h> 32168404Spjd#include <sys/dmu_impl.h> 33168404Spjd#include <sys/dmu_tx.h> 34168404Spjd#include <sys/dmu_objset.h> 35168404Spjd#include <sys/dsl_dir.h> 36168404Spjd#include <sys/dsl_dataset.h> 37168404Spjd#include <sys/spa.h> 38168404Spjd#include <sys/zio.h> 39168404Spjd#include <sys/dmu_zfetch.h> 40265740Sdelphij#include <sys/range_tree.h> 41168404Spjd 42168404Spjdstatic kmem_cache_t *dnode_cache; 43219089Spjd/* 44219089Spjd * Define DNODE_STATS to turn on statistic gathering. By default, it is only 45219089Spjd * turned on when DEBUG is also defined. 46219089Spjd */ 47219089Spjd#ifdef DEBUG 48219089Spjd#define DNODE_STATS 49219089Spjd#endif /* DEBUG */ 50168404Spjd 51219089Spjd#ifdef DNODE_STATS 52219089Spjd#define DNODE_STAT_ADD(stat) ((stat)++) 53219089Spjd#else 54219089Spjd#define DNODE_STAT_ADD(stat) /* nothing */ 55219089Spjd#endif /* DNODE_STATS */ 56219089Spjd 57168404Spjdstatic dnode_phys_t dnode_phys_zero; 58168404Spjd 59168404Spjdint zfs_default_bs = SPA_MINBLOCKSHIFT; 60168404Spjdint zfs_default_ibs = DN_MAX_INDBLKSHIFT; 61168404Spjd 62297077Smav#ifdef illumos 63219089Spjdstatic kmem_cbrc_t dnode_move(void *, void *, size_t, void *); 64219089Spjd#endif 65219089Spjd 66269845Sdelphijstatic int 67269845Sdelphijdbuf_compare(const void *x1, const void *x2) 68269845Sdelphij{ 69269845Sdelphij const dmu_buf_impl_t *d1 = x1; 70269845Sdelphij const dmu_buf_impl_t *d2 = x2; 71269845Sdelphij 72269845Sdelphij if (d1->db_level < d2->db_level) { 73269845Sdelphij return (-1); 74270809Sdelphij } 75270809Sdelphij if (d1->db_level > d2->db_level) { 76269845Sdelphij return (1); 77269845Sdelphij } 78269845Sdelphij 79269845Sdelphij if (d1->db_blkid < d2->db_blkid) { 80269845Sdelphij return (-1); 81270809Sdelphij } 82270809Sdelphij if (d1->db_blkid > d2->db_blkid) { 83269845Sdelphij return (1); 84269845Sdelphij } 85269845Sdelphij 86277588Sdelphij if (d1->db_state == DB_SEARCH) { 87277588Sdelphij ASSERT3S(d2->db_state, !=, DB_SEARCH); 88269845Sdelphij return (-1); 89277588Sdelphij } else if (d2->db_state == DB_SEARCH) { 90277588Sdelphij ASSERT3S(d1->db_state, !=, DB_SEARCH); 91269845Sdelphij return (1); 92269845Sdelphij } 93270809Sdelphij 94270809Sdelphij if ((uintptr_t)d1 < (uintptr_t)d2) { 95270809Sdelphij return (-1); 96270809Sdelphij } 97270809Sdelphij if ((uintptr_t)d1 > (uintptr_t)d2) { 98270809Sdelphij return (1); 99270809Sdelphij } 100270809Sdelphij return (0); 101269845Sdelphij} 102269845Sdelphij 103168404Spjd/* ARGSUSED */ 104168404Spjdstatic int 105168404Spjddnode_cons(void *arg, void *unused, int kmflag) 106168404Spjd{ 107219089Spjd dnode_t *dn = arg; 108168404Spjd int i; 109168404Spjd 110168404Spjd rw_init(&dn->dn_struct_rwlock, NULL, RW_DEFAULT, NULL); 111168404Spjd mutex_init(&dn->dn_mtx, NULL, MUTEX_DEFAULT, NULL); 112168404Spjd mutex_init(&dn->dn_dbufs_mtx, NULL, MUTEX_DEFAULT, NULL); 113208372Smm cv_init(&dn->dn_notxholds, NULL, CV_DEFAULT, NULL); 114208372Smm 115248571Smm /* 116248571Smm * Every dbuf has a reference, and dropping a tracked reference is 117248571Smm * O(number of references), so don't track dn_holds. 118248571Smm */ 119248571Smm refcount_create_untracked(&dn->dn_holds); 120168404Spjd refcount_create(&dn->dn_tx_holds); 121219089Spjd list_link_init(&dn->dn_link); 122168404Spjd 123219089Spjd bzero(&dn->dn_next_nblkptr[0], sizeof (dn->dn_next_nblkptr)); 124219089Spjd bzero(&dn->dn_next_nlevels[0], sizeof (dn->dn_next_nlevels)); 125219089Spjd bzero(&dn->dn_next_indblkshift[0], sizeof (dn->dn_next_indblkshift)); 126219089Spjd bzero(&dn->dn_next_bonustype[0], sizeof (dn->dn_next_bonustype)); 127219089Spjd bzero(&dn->dn_rm_spillblk[0], sizeof (dn->dn_rm_spillblk)); 128219089Spjd bzero(&dn->dn_next_bonuslen[0], sizeof (dn->dn_next_bonuslen)); 129219089Spjd bzero(&dn->dn_next_blksz[0], sizeof (dn->dn_next_blksz)); 130219089Spjd 131168404Spjd for (i = 0; i < TXG_SIZE; i++) { 132219089Spjd list_link_init(&dn->dn_dirty_link[i]); 133265740Sdelphij dn->dn_free_ranges[i] = NULL; 134168404Spjd list_create(&dn->dn_dirty_records[i], 135168404Spjd sizeof (dbuf_dirty_record_t), 136168404Spjd offsetof(dbuf_dirty_record_t, dr_dirty_node)); 137168404Spjd } 138168404Spjd 139219089Spjd dn->dn_allocated_txg = 0; 140219089Spjd dn->dn_free_txg = 0; 141219089Spjd dn->dn_assigned_txg = 0; 142219089Spjd dn->dn_dirtyctx = 0; 143219089Spjd dn->dn_dirtyctx_firstset = NULL; 144219089Spjd dn->dn_bonus = NULL; 145219089Spjd dn->dn_have_spill = B_FALSE; 146219089Spjd dn->dn_zio = NULL; 147219089Spjd dn->dn_oldused = 0; 148219089Spjd dn->dn_oldflags = 0; 149219089Spjd dn->dn_olduid = 0; 150219089Spjd dn->dn_oldgid = 0; 151219089Spjd dn->dn_newuid = 0; 152219089Spjd dn->dn_newgid = 0; 153219089Spjd dn->dn_id_flags = 0; 154219089Spjd 155219089Spjd dn->dn_dbufs_count = 0; 156254753Sdelphij dn->dn_unlisted_l0_blkid = 0; 157269845Sdelphij avl_create(&dn->dn_dbufs, dbuf_compare, sizeof (dmu_buf_impl_t), 158168404Spjd offsetof(dmu_buf_impl_t, db_link)); 159168404Spjd 160219089Spjd dn->dn_moved = 0; 161219089Spjd POINTER_INVALIDATE(&dn->dn_objset); 162168404Spjd return (0); 163168404Spjd} 164168404Spjd 165168404Spjd/* ARGSUSED */ 166168404Spjdstatic void 167168404Spjddnode_dest(void *arg, void *unused) 168168404Spjd{ 169168404Spjd int i; 170168404Spjd dnode_t *dn = arg; 171168404Spjd 172168404Spjd rw_destroy(&dn->dn_struct_rwlock); 173168404Spjd mutex_destroy(&dn->dn_mtx); 174168404Spjd mutex_destroy(&dn->dn_dbufs_mtx); 175208372Smm cv_destroy(&dn->dn_notxholds); 176168404Spjd refcount_destroy(&dn->dn_holds); 177168404Spjd refcount_destroy(&dn->dn_tx_holds); 178219089Spjd ASSERT(!list_link_active(&dn->dn_link)); 179168404Spjd 180168404Spjd for (i = 0; i < TXG_SIZE; i++) { 181219089Spjd ASSERT(!list_link_active(&dn->dn_dirty_link[i])); 182265740Sdelphij ASSERT3P(dn->dn_free_ranges[i], ==, NULL); 183168404Spjd list_destroy(&dn->dn_dirty_records[i]); 184240415Smm ASSERT0(dn->dn_next_nblkptr[i]); 185240415Smm ASSERT0(dn->dn_next_nlevels[i]); 186240415Smm ASSERT0(dn->dn_next_indblkshift[i]); 187240415Smm ASSERT0(dn->dn_next_bonustype[i]); 188240415Smm ASSERT0(dn->dn_rm_spillblk[i]); 189240415Smm ASSERT0(dn->dn_next_bonuslen[i]); 190240415Smm ASSERT0(dn->dn_next_blksz[i]); 191168404Spjd } 192168404Spjd 193240415Smm ASSERT0(dn->dn_allocated_txg); 194240415Smm ASSERT0(dn->dn_free_txg); 195240415Smm ASSERT0(dn->dn_assigned_txg); 196240415Smm ASSERT0(dn->dn_dirtyctx); 197219089Spjd ASSERT3P(dn->dn_dirtyctx_firstset, ==, NULL); 198219089Spjd ASSERT3P(dn->dn_bonus, ==, NULL); 199219089Spjd ASSERT(!dn->dn_have_spill); 200219089Spjd ASSERT3P(dn->dn_zio, ==, NULL); 201240415Smm ASSERT0(dn->dn_oldused); 202240415Smm ASSERT0(dn->dn_oldflags); 203240415Smm ASSERT0(dn->dn_olduid); 204240415Smm ASSERT0(dn->dn_oldgid); 205240415Smm ASSERT0(dn->dn_newuid); 206240415Smm ASSERT0(dn->dn_newgid); 207240415Smm ASSERT0(dn->dn_id_flags); 208219089Spjd 209240415Smm ASSERT0(dn->dn_dbufs_count); 210254753Sdelphij ASSERT0(dn->dn_unlisted_l0_blkid); 211269845Sdelphij avl_destroy(&dn->dn_dbufs); 212168404Spjd} 213168404Spjd 214168404Spjdvoid 215168404Spjddnode_init(void) 216168404Spjd{ 217219089Spjd ASSERT(dnode_cache == NULL); 218168404Spjd dnode_cache = kmem_cache_create("dnode_t", 219168404Spjd sizeof (dnode_t), 220168404Spjd 0, dnode_cons, dnode_dest, NULL, NULL, NULL, 0); 221219089Spjd kmem_cache_set_move(dnode_cache, dnode_move); 222168404Spjd} 223168404Spjd 224168404Spjdvoid 225168404Spjddnode_fini(void) 226168404Spjd{ 227168404Spjd kmem_cache_destroy(dnode_cache); 228219089Spjd dnode_cache = NULL; 229168404Spjd} 230168404Spjd 231168404Spjd 232168404Spjd#ifdef ZFS_DEBUG 233168404Spjdvoid 234168404Spjddnode_verify(dnode_t *dn) 235168404Spjd{ 236168404Spjd int drop_struct_lock = FALSE; 237168404Spjd 238168404Spjd ASSERT(dn->dn_phys); 239168404Spjd ASSERT(dn->dn_objset); 240219089Spjd ASSERT(dn->dn_handle->dnh_dnode == dn); 241168404Spjd 242236884Smm ASSERT(DMU_OT_IS_VALID(dn->dn_phys->dn_type)); 243168404Spjd 244168404Spjd if (!(zfs_flags & ZFS_DEBUG_DNODE_VERIFY)) 245168404Spjd return; 246168404Spjd 247168404Spjd if (!RW_WRITE_HELD(&dn->dn_struct_rwlock)) { 248168404Spjd rw_enter(&dn->dn_struct_rwlock, RW_READER); 249168404Spjd drop_struct_lock = TRUE; 250168404Spjd } 251168404Spjd if (dn->dn_phys->dn_type != DMU_OT_NONE || dn->dn_allocated_txg != 0) { 252168404Spjd int i; 253168404Spjd ASSERT3U(dn->dn_indblkshift, >=, 0); 254168404Spjd ASSERT3U(dn->dn_indblkshift, <=, SPA_MAXBLOCKSHIFT); 255168404Spjd if (dn->dn_datablkshift) { 256168404Spjd ASSERT3U(dn->dn_datablkshift, >=, SPA_MINBLOCKSHIFT); 257168404Spjd ASSERT3U(dn->dn_datablkshift, <=, SPA_MAXBLOCKSHIFT); 258168404Spjd ASSERT3U(1<<dn->dn_datablkshift, ==, dn->dn_datablksz); 259168404Spjd } 260168404Spjd ASSERT3U(dn->dn_nlevels, <=, 30); 261236884Smm ASSERT(DMU_OT_IS_VALID(dn->dn_type)); 262168404Spjd ASSERT3U(dn->dn_nblkptr, >=, 1); 263168404Spjd ASSERT3U(dn->dn_nblkptr, <=, DN_MAX_NBLKPTR); 264168404Spjd ASSERT3U(dn->dn_bonuslen, <=, DN_MAX_BONUSLEN); 265168404Spjd ASSERT3U(dn->dn_datablksz, ==, 266168404Spjd dn->dn_datablkszsec << SPA_MINBLOCKSHIFT); 267168404Spjd ASSERT3U(ISP2(dn->dn_datablksz), ==, dn->dn_datablkshift != 0); 268168404Spjd ASSERT3U((dn->dn_nblkptr - 1) * sizeof (blkptr_t) + 269168404Spjd dn->dn_bonuslen, <=, DN_MAX_BONUSLEN); 270168404Spjd for (i = 0; i < TXG_SIZE; i++) { 271168404Spjd ASSERT3U(dn->dn_next_nlevels[i], <=, dn->dn_nlevels); 272168404Spjd } 273168404Spjd } 274168404Spjd if (dn->dn_phys->dn_type != DMU_OT_NONE) 275168404Spjd ASSERT3U(dn->dn_phys->dn_nlevels, <=, dn->dn_nlevels); 276209962Smm ASSERT(DMU_OBJECT_IS_SPECIAL(dn->dn_object) || dn->dn_dbuf != NULL); 277168404Spjd if (dn->dn_dbuf != NULL) { 278168404Spjd ASSERT3P(dn->dn_phys, ==, 279168404Spjd (dnode_phys_t *)dn->dn_dbuf->db.db_data + 280168404Spjd (dn->dn_object % (dn->dn_dbuf->db.db_size >> DNODE_SHIFT))); 281168404Spjd } 282168404Spjd if (drop_struct_lock) 283168404Spjd rw_exit(&dn->dn_struct_rwlock); 284168404Spjd} 285168404Spjd#endif 286168404Spjd 287168404Spjdvoid 288168404Spjddnode_byteswap(dnode_phys_t *dnp) 289168404Spjd{ 290168404Spjd uint64_t *buf64 = (void*)&dnp->dn_blkptr; 291168404Spjd int i; 292168404Spjd 293168404Spjd if (dnp->dn_type == DMU_OT_NONE) { 294168404Spjd bzero(dnp, sizeof (dnode_phys_t)); 295168404Spjd return; 296168404Spjd } 297168404Spjd 298168404Spjd dnp->dn_datablkszsec = BSWAP_16(dnp->dn_datablkszsec); 299168404Spjd dnp->dn_bonuslen = BSWAP_16(dnp->dn_bonuslen); 300168404Spjd dnp->dn_maxblkid = BSWAP_64(dnp->dn_maxblkid); 301168404Spjd dnp->dn_used = BSWAP_64(dnp->dn_used); 302168404Spjd 303168404Spjd /* 304168404Spjd * dn_nblkptr is only one byte, so it's OK to read it in either 305168404Spjd * byte order. We can't read dn_bouslen. 306168404Spjd */ 307168404Spjd ASSERT(dnp->dn_indblkshift <= SPA_MAXBLOCKSHIFT); 308168404Spjd ASSERT(dnp->dn_nblkptr <= DN_MAX_NBLKPTR); 309168404Spjd for (i = 0; i < dnp->dn_nblkptr * sizeof (blkptr_t)/8; i++) 310168404Spjd buf64[i] = BSWAP_64(buf64[i]); 311168404Spjd 312168404Spjd /* 313168404Spjd * OK to check dn_bonuslen for zero, because it won't matter if 314168404Spjd * we have the wrong byte order. This is necessary because the 315168404Spjd * dnode dnode is smaller than a regular dnode. 316168404Spjd */ 317168404Spjd if (dnp->dn_bonuslen != 0) { 318168404Spjd /* 319168404Spjd * Note that the bonus length calculated here may be 320168404Spjd * longer than the actual bonus buffer. This is because 321168404Spjd * we always put the bonus buffer after the last block 322168404Spjd * pointer (instead of packing it against the end of the 323168404Spjd * dnode buffer). 324168404Spjd */ 325168404Spjd int off = (dnp->dn_nblkptr-1) * sizeof (blkptr_t); 326168404Spjd size_t len = DN_MAX_BONUSLEN - off; 327236884Smm ASSERT(DMU_OT_IS_VALID(dnp->dn_bonustype)); 328236884Smm dmu_object_byteswap_t byteswap = 329236884Smm DMU_OT_BYTESWAP(dnp->dn_bonustype); 330236884Smm dmu_ot_byteswap[byteswap].ob_func(dnp->dn_bonus + off, len); 331168404Spjd } 332219089Spjd 333219089Spjd /* Swap SPILL block if we have one */ 334219089Spjd if (dnp->dn_flags & DNODE_FLAG_SPILL_BLKPTR) 335219089Spjd byteswap_uint64_array(&dnp->dn_spill, sizeof (blkptr_t)); 336219089Spjd 337168404Spjd} 338168404Spjd 339168404Spjdvoid 340168404Spjddnode_buf_byteswap(void *vbuf, size_t size) 341168404Spjd{ 342168404Spjd dnode_phys_t *buf = vbuf; 343168404Spjd int i; 344168404Spjd 345168404Spjd ASSERT3U(sizeof (dnode_phys_t), ==, (1<<DNODE_SHIFT)); 346168404Spjd ASSERT((size & (sizeof (dnode_phys_t)-1)) == 0); 347168404Spjd 348168404Spjd size >>= DNODE_SHIFT; 349168404Spjd for (i = 0; i < size; i++) { 350168404Spjd dnode_byteswap(buf); 351168404Spjd buf++; 352168404Spjd } 353168404Spjd} 354168404Spjd 355185029Spjdvoid 356185029Spjddnode_setbonuslen(dnode_t *dn, int newsize, dmu_tx_t *tx) 357185029Spjd{ 358185029Spjd ASSERT3U(refcount_count(&dn->dn_holds), >=, 1); 359185029Spjd 360185029Spjd dnode_setdirty(dn, tx); 361185029Spjd rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 362185029Spjd ASSERT3U(newsize, <=, DN_MAX_BONUSLEN - 363185029Spjd (dn->dn_nblkptr-1) * sizeof (blkptr_t)); 364185029Spjd dn->dn_bonuslen = newsize; 365185029Spjd if (newsize == 0) 366185029Spjd dn->dn_next_bonuslen[tx->tx_txg & TXG_MASK] = DN_ZERO_BONUSLEN; 367185029Spjd else 368185029Spjd dn->dn_next_bonuslen[tx->tx_txg & TXG_MASK] = dn->dn_bonuslen; 369185029Spjd rw_exit(&dn->dn_struct_rwlock); 370185029Spjd} 371185029Spjd 372219089Spjdvoid 373219089Spjddnode_setbonus_type(dnode_t *dn, dmu_object_type_t newtype, dmu_tx_t *tx) 374219089Spjd{ 375219089Spjd ASSERT3U(refcount_count(&dn->dn_holds), >=, 1); 376219089Spjd dnode_setdirty(dn, tx); 377219089Spjd rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 378219089Spjd dn->dn_bonustype = newtype; 379219089Spjd dn->dn_next_bonustype[tx->tx_txg & TXG_MASK] = dn->dn_bonustype; 380219089Spjd rw_exit(&dn->dn_struct_rwlock); 381219089Spjd} 382219089Spjd 383219089Spjdvoid 384219089Spjddnode_rm_spill(dnode_t *dn, dmu_tx_t *tx) 385219089Spjd{ 386219089Spjd ASSERT3U(refcount_count(&dn->dn_holds), >=, 1); 387219089Spjd ASSERT(RW_WRITE_HELD(&dn->dn_struct_rwlock)); 388219089Spjd dnode_setdirty(dn, tx); 389219089Spjd dn->dn_rm_spillblk[tx->tx_txg&TXG_MASK] = DN_KILL_SPILLBLK; 390219089Spjd dn->dn_have_spill = B_FALSE; 391219089Spjd} 392219089Spjd 393168404Spjdstatic void 394168404Spjddnode_setdblksz(dnode_t *dn, int size) 395168404Spjd{ 396240415Smm ASSERT0(P2PHASE(size, SPA_MINBLOCKSIZE)); 397168404Spjd ASSERT3U(size, <=, SPA_MAXBLOCKSIZE); 398168404Spjd ASSERT3U(size, >=, SPA_MINBLOCKSIZE); 399168404Spjd ASSERT3U(size >> SPA_MINBLOCKSHIFT, <, 400168404Spjd 1<<(sizeof (dn->dn_phys->dn_datablkszsec) * 8)); 401168404Spjd dn->dn_datablksz = size; 402168404Spjd dn->dn_datablkszsec = size >> SPA_MINBLOCKSHIFT; 403265740Sdelphij dn->dn_datablkshift = ISP2(size) ? highbit64(size - 1) : 0; 404168404Spjd} 405168404Spjd 406168404Spjdstatic dnode_t * 407219089Spjddnode_create(objset_t *os, dnode_phys_t *dnp, dmu_buf_impl_t *db, 408219089Spjd uint64_t object, dnode_handle_t *dnh) 409168404Spjd{ 410288549Smav dnode_t *dn; 411168404Spjd 412288549Smav dn = kmem_cache_alloc(dnode_cache, KM_SLEEP); 413219089Spjd ASSERT(!POINTER_IS_VALID(dn->dn_objset)); 414219089Spjd dn->dn_moved = 0; 415219089Spjd 416219089Spjd /* 417219089Spjd * Defer setting dn_objset until the dnode is ready to be a candidate 418219089Spjd * for the dnode_move() callback. 419219089Spjd */ 420168404Spjd dn->dn_object = object; 421168404Spjd dn->dn_dbuf = db; 422219089Spjd dn->dn_handle = dnh; 423168404Spjd dn->dn_phys = dnp; 424168404Spjd 425219089Spjd if (dnp->dn_datablkszsec) { 426168404Spjd dnode_setdblksz(dn, dnp->dn_datablkszsec << SPA_MINBLOCKSHIFT); 427219089Spjd } else { 428219089Spjd dn->dn_datablksz = 0; 429219089Spjd dn->dn_datablkszsec = 0; 430219089Spjd dn->dn_datablkshift = 0; 431219089Spjd } 432168404Spjd dn->dn_indblkshift = dnp->dn_indblkshift; 433168404Spjd dn->dn_nlevels = dnp->dn_nlevels; 434168404Spjd dn->dn_type = dnp->dn_type; 435168404Spjd dn->dn_nblkptr = dnp->dn_nblkptr; 436168404Spjd dn->dn_checksum = dnp->dn_checksum; 437168404Spjd dn->dn_compress = dnp->dn_compress; 438168404Spjd dn->dn_bonustype = dnp->dn_bonustype; 439168404Spjd dn->dn_bonuslen = dnp->dn_bonuslen; 440168404Spjd dn->dn_maxblkid = dnp->dn_maxblkid; 441219089Spjd dn->dn_have_spill = ((dnp->dn_flags & DNODE_FLAG_SPILL_BLKPTR) != 0); 442219089Spjd dn->dn_id_flags = 0; 443168404Spjd 444168404Spjd dmu_zfetch_init(&dn->dn_zfetch, dn); 445168404Spjd 446236884Smm ASSERT(DMU_OT_IS_VALID(dn->dn_phys->dn_type)); 447219089Spjd 448168404Spjd mutex_enter(&os->os_lock); 449288549Smav if (dnh->dnh_dnode != NULL) { 450288549Smav /* Lost the allocation race. */ 451288549Smav mutex_exit(&os->os_lock); 452288549Smav kmem_cache_free(dnode_cache, dn); 453288549Smav return (dnh->dnh_dnode); 454288549Smav } 455288549Smav 456288549Smav /* 457288549Smav * Exclude special dnodes from os_dnodes so an empty os_dnodes 458288549Smav * signifies that the special dnodes have no references from 459288549Smav * their children (the entries in os_dnodes). This allows 460288549Smav * dnode_destroy() to easily determine if the last child has 461288549Smav * been removed and then complete eviction of the objset. 462288549Smav */ 463288549Smav if (!DMU_OBJECT_IS_SPECIAL(object)) 464288549Smav list_insert_head(&os->os_dnodes, dn); 465219089Spjd membar_producer(); 466288549Smav 467219089Spjd /* 468288549Smav * Everything else must be valid before assigning dn_objset 469288549Smav * makes the dnode eligible for dnode_move(). 470219089Spjd */ 471219089Spjd dn->dn_objset = os; 472288549Smav 473288549Smav dnh->dnh_dnode = dn; 474168404Spjd mutex_exit(&os->os_lock); 475168404Spjd 476208373Smm arc_space_consume(sizeof (dnode_t), ARC_SPACE_OTHER); 477168404Spjd return (dn); 478168404Spjd} 479168404Spjd 480219089Spjd/* 481219089Spjd * Caller must be holding the dnode handle, which is released upon return. 482219089Spjd */ 483168404Spjdstatic void 484168404Spjddnode_destroy(dnode_t *dn) 485168404Spjd{ 486219089Spjd objset_t *os = dn->dn_objset; 487288549Smav boolean_t complete_os_eviction = B_FALSE; 488168404Spjd 489219089Spjd ASSERT((dn->dn_id_flags & DN_ID_NEW_EXIST) == 0); 490168404Spjd 491168404Spjd mutex_enter(&os->os_lock); 492219089Spjd POINTER_INVALIDATE(&dn->dn_objset); 493288549Smav if (!DMU_OBJECT_IS_SPECIAL(dn->dn_object)) { 494288549Smav list_remove(&os->os_dnodes, dn); 495288549Smav complete_os_eviction = 496288549Smav list_is_empty(&os->os_dnodes) && 497288549Smav list_link_active(&os->os_evicting_node); 498288549Smav } 499168404Spjd mutex_exit(&os->os_lock); 500168404Spjd 501219089Spjd /* the dnode can no longer move, so we can release the handle */ 502219089Spjd zrl_remove(&dn->dn_handle->dnh_zrlock); 503219089Spjd 504219089Spjd dn->dn_allocated_txg = 0; 505219089Spjd dn->dn_free_txg = 0; 506219089Spjd dn->dn_assigned_txg = 0; 507219089Spjd 508219089Spjd dn->dn_dirtyctx = 0; 509219089Spjd if (dn->dn_dirtyctx_firstset != NULL) { 510168404Spjd kmem_free(dn->dn_dirtyctx_firstset, 1); 511168404Spjd dn->dn_dirtyctx_firstset = NULL; 512168404Spjd } 513219089Spjd if (dn->dn_bonus != NULL) { 514168404Spjd mutex_enter(&dn->dn_bonus->db_mtx); 515307266Smav dbuf_destroy(dn->dn_bonus); 516168404Spjd dn->dn_bonus = NULL; 517168404Spjd } 518219089Spjd dn->dn_zio = NULL; 519219089Spjd 520219089Spjd dn->dn_have_spill = B_FALSE; 521219089Spjd dn->dn_oldused = 0; 522219089Spjd dn->dn_oldflags = 0; 523219089Spjd dn->dn_olduid = 0; 524219089Spjd dn->dn_oldgid = 0; 525219089Spjd dn->dn_newuid = 0; 526219089Spjd dn->dn_newgid = 0; 527219089Spjd dn->dn_id_flags = 0; 528254753Sdelphij dn->dn_unlisted_l0_blkid = 0; 529219089Spjd 530288594Smav dmu_zfetch_fini(&dn->dn_zfetch); 531168404Spjd kmem_cache_free(dnode_cache, dn); 532208373Smm arc_space_return(sizeof (dnode_t), ARC_SPACE_OTHER); 533288549Smav 534288549Smav if (complete_os_eviction) 535288549Smav dmu_objset_evict_done(os); 536168404Spjd} 537168404Spjd 538168404Spjdvoid 539168404Spjddnode_allocate(dnode_t *dn, dmu_object_type_t ot, int blocksize, int ibs, 540168404Spjd dmu_object_type_t bonustype, int bonuslen, dmu_tx_t *tx) 541168404Spjd{ 542168404Spjd int i; 543168404Spjd 544276081Sdelphij ASSERT3U(blocksize, <=, 545276081Sdelphij spa_maxblocksize(dmu_objset_spa(dn->dn_objset))); 546168404Spjd if (blocksize == 0) 547168404Spjd blocksize = 1 << zfs_default_bs; 548168404Spjd else 549168404Spjd blocksize = P2ROUNDUP(blocksize, SPA_MINBLOCKSIZE); 550168404Spjd 551168404Spjd if (ibs == 0) 552168404Spjd ibs = zfs_default_ibs; 553168404Spjd 554168404Spjd ibs = MIN(MAX(ibs, DN_MIN_INDBLKSHIFT), DN_MAX_INDBLKSHIFT); 555168404Spjd 556168404Spjd dprintf("os=%p obj=%llu txg=%llu blocksize=%d ibs=%d\n", dn->dn_objset, 557168404Spjd dn->dn_object, tx->tx_txg, blocksize, ibs); 558168404Spjd 559168404Spjd ASSERT(dn->dn_type == DMU_OT_NONE); 560168404Spjd ASSERT(bcmp(dn->dn_phys, &dnode_phys_zero, sizeof (dnode_phys_t)) == 0); 561168404Spjd ASSERT(dn->dn_phys->dn_type == DMU_OT_NONE); 562168404Spjd ASSERT(ot != DMU_OT_NONE); 563236884Smm ASSERT(DMU_OT_IS_VALID(ot)); 564168404Spjd ASSERT((bonustype == DMU_OT_NONE && bonuslen == 0) || 565219089Spjd (bonustype == DMU_OT_SA && bonuslen == 0) || 566168404Spjd (bonustype != DMU_OT_NONE && bonuslen != 0)); 567236884Smm ASSERT(DMU_OT_IS_VALID(bonustype)); 568168404Spjd ASSERT3U(bonuslen, <=, DN_MAX_BONUSLEN); 569168404Spjd ASSERT(dn->dn_type == DMU_OT_NONE); 570240415Smm ASSERT0(dn->dn_maxblkid); 571240415Smm ASSERT0(dn->dn_allocated_txg); 572240415Smm ASSERT0(dn->dn_assigned_txg); 573168404Spjd ASSERT(refcount_is_zero(&dn->dn_tx_holds)); 574168404Spjd ASSERT3U(refcount_count(&dn->dn_holds), <=, 1); 575269845Sdelphij ASSERT(avl_is_empty(&dn->dn_dbufs)); 576168404Spjd 577168404Spjd for (i = 0; i < TXG_SIZE; i++) { 578240415Smm ASSERT0(dn->dn_next_nblkptr[i]); 579240415Smm ASSERT0(dn->dn_next_nlevels[i]); 580240415Smm ASSERT0(dn->dn_next_indblkshift[i]); 581240415Smm ASSERT0(dn->dn_next_bonuslen[i]); 582240415Smm ASSERT0(dn->dn_next_bonustype[i]); 583240415Smm ASSERT0(dn->dn_rm_spillblk[i]); 584240415Smm ASSERT0(dn->dn_next_blksz[i]); 585168404Spjd ASSERT(!list_link_active(&dn->dn_dirty_link[i])); 586168404Spjd ASSERT3P(list_head(&dn->dn_dirty_records[i]), ==, NULL); 587265740Sdelphij ASSERT3P(dn->dn_free_ranges[i], ==, NULL); 588168404Spjd } 589168404Spjd 590168404Spjd dn->dn_type = ot; 591168404Spjd dnode_setdblksz(dn, blocksize); 592168404Spjd dn->dn_indblkshift = ibs; 593168404Spjd dn->dn_nlevels = 1; 594219089Spjd if (bonustype == DMU_OT_SA) /* Maximize bonus space for SA */ 595219089Spjd dn->dn_nblkptr = 1; 596219089Spjd else 597219089Spjd dn->dn_nblkptr = 1 + 598219089Spjd ((DN_MAX_BONUSLEN - bonuslen) >> SPA_BLKPTRSHIFT); 599168404Spjd dn->dn_bonustype = bonustype; 600168404Spjd dn->dn_bonuslen = bonuslen; 601168404Spjd dn->dn_checksum = ZIO_CHECKSUM_INHERIT; 602168404Spjd dn->dn_compress = ZIO_COMPRESS_INHERIT; 603168404Spjd dn->dn_dirtyctx = 0; 604168404Spjd 605168404Spjd dn->dn_free_txg = 0; 606168404Spjd if (dn->dn_dirtyctx_firstset) { 607168404Spjd kmem_free(dn->dn_dirtyctx_firstset, 1); 608168404Spjd dn->dn_dirtyctx_firstset = NULL; 609168404Spjd } 610168404Spjd 611168404Spjd dn->dn_allocated_txg = tx->tx_txg; 612219089Spjd dn->dn_id_flags = 0; 613168404Spjd 614168404Spjd dnode_setdirty(dn, tx); 615168404Spjd dn->dn_next_indblkshift[tx->tx_txg & TXG_MASK] = ibs; 616185029Spjd dn->dn_next_bonuslen[tx->tx_txg & TXG_MASK] = dn->dn_bonuslen; 617219089Spjd dn->dn_next_bonustype[tx->tx_txg & TXG_MASK] = dn->dn_bonustype; 618168404Spjd dn->dn_next_blksz[tx->tx_txg & TXG_MASK] = dn->dn_datablksz; 619168404Spjd} 620168404Spjd 621168404Spjdvoid 622168404Spjddnode_reallocate(dnode_t *dn, dmu_object_type_t ot, int blocksize, 623168404Spjd dmu_object_type_t bonustype, int bonuslen, dmu_tx_t *tx) 624168404Spjd{ 625200726Sdelphij int nblkptr; 626168404Spjd 627168404Spjd ASSERT3U(blocksize, >=, SPA_MINBLOCKSIZE); 628276081Sdelphij ASSERT3U(blocksize, <=, 629276081Sdelphij spa_maxblocksize(dmu_objset_spa(dn->dn_objset))); 630240415Smm ASSERT0(blocksize % SPA_MINBLOCKSIZE); 631168404Spjd ASSERT(dn->dn_object != DMU_META_DNODE_OBJECT || dmu_tx_private_ok(tx)); 632168404Spjd ASSERT(tx->tx_txg != 0); 633168404Spjd ASSERT((bonustype == DMU_OT_NONE && bonuslen == 0) || 634219089Spjd (bonustype != DMU_OT_NONE && bonuslen != 0) || 635219089Spjd (bonustype == DMU_OT_SA && bonuslen == 0)); 636236884Smm ASSERT(DMU_OT_IS_VALID(bonustype)); 637168404Spjd ASSERT3U(bonuslen, <=, DN_MAX_BONUSLEN); 638168404Spjd 639168404Spjd /* clean up any unreferenced dbufs */ 640185029Spjd dnode_evict_dbufs(dn); 641168404Spjd 642219089Spjd dn->dn_id_flags = 0; 643219089Spjd 644200726Sdelphij rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 645200726Sdelphij dnode_setdirty(dn, tx); 646200726Sdelphij if (dn->dn_datablksz != blocksize) { 647200726Sdelphij /* change blocksize */ 648200726Sdelphij ASSERT(dn->dn_maxblkid == 0 && 649200726Sdelphij (BP_IS_HOLE(&dn->dn_phys->dn_blkptr[0]) || 650200726Sdelphij dnode_block_freed(dn, 0))); 651200726Sdelphij dnode_setdblksz(dn, blocksize); 652200726Sdelphij dn->dn_next_blksz[tx->tx_txg&TXG_MASK] = blocksize; 653168404Spjd } 654200726Sdelphij if (dn->dn_bonuslen != bonuslen) 655200726Sdelphij dn->dn_next_bonuslen[tx->tx_txg&TXG_MASK] = bonuslen; 656219089Spjd 657219089Spjd if (bonustype == DMU_OT_SA) /* Maximize bonus space for SA */ 658219089Spjd nblkptr = 1; 659219089Spjd else 660219089Spjd nblkptr = 1 + ((DN_MAX_BONUSLEN - bonuslen) >> SPA_BLKPTRSHIFT); 661219089Spjd if (dn->dn_bonustype != bonustype) 662219089Spjd dn->dn_next_bonustype[tx->tx_txg&TXG_MASK] = bonustype; 663196703Spjd if (dn->dn_nblkptr != nblkptr) 664196703Spjd dn->dn_next_nblkptr[tx->tx_txg&TXG_MASK] = nblkptr; 665219089Spjd if (dn->dn_phys->dn_flags & DNODE_FLAG_SPILL_BLKPTR) { 666219089Spjd dbuf_rm_spill(dn, tx); 667219089Spjd dnode_rm_spill(dn, tx); 668219089Spjd } 669168404Spjd rw_exit(&dn->dn_struct_rwlock); 670168404Spjd 671168404Spjd /* change type */ 672168404Spjd dn->dn_type = ot; 673168404Spjd 674168404Spjd /* change bonus size and type */ 675168404Spjd mutex_enter(&dn->dn_mtx); 676168404Spjd dn->dn_bonustype = bonustype; 677168404Spjd dn->dn_bonuslen = bonuslen; 678196703Spjd dn->dn_nblkptr = nblkptr; 679168404Spjd dn->dn_checksum = ZIO_CHECKSUM_INHERIT; 680168404Spjd dn->dn_compress = ZIO_COMPRESS_INHERIT; 681168404Spjd ASSERT3U(dn->dn_nblkptr, <=, DN_MAX_NBLKPTR); 682168404Spjd 683196703Spjd /* fix up the bonus db_size */ 684196703Spjd if (dn->dn_bonus) { 685185029Spjd dn->dn_bonus->db.db_size = 686185029Spjd DN_MAX_BONUSLEN - (dn->dn_nblkptr-1) * sizeof (blkptr_t); 687185029Spjd ASSERT(dn->dn_bonuslen <= dn->dn_bonus->db.db_size); 688185029Spjd } 689185029Spjd 690168404Spjd dn->dn_allocated_txg = tx->tx_txg; 691168404Spjd mutex_exit(&dn->dn_mtx); 692168404Spjd} 693168404Spjd 694219089Spjd#ifdef DNODE_STATS 695219089Spjdstatic struct { 696219089Spjd uint64_t dms_dnode_invalid; 697219089Spjd uint64_t dms_dnode_recheck1; 698219089Spjd uint64_t dms_dnode_recheck2; 699219089Spjd uint64_t dms_dnode_special; 700219089Spjd uint64_t dms_dnode_handle; 701219089Spjd uint64_t dms_dnode_rwlock; 702219089Spjd uint64_t dms_dnode_active; 703219089Spjd} dnode_move_stats; 704219089Spjd#endif /* DNODE_STATS */ 705219089Spjd 706219089Spjdstatic void 707219089Spjddnode_move_impl(dnode_t *odn, dnode_t *ndn) 708219089Spjd{ 709219089Spjd int i; 710219089Spjd 711219089Spjd ASSERT(!RW_LOCK_HELD(&odn->dn_struct_rwlock)); 712219089Spjd ASSERT(MUTEX_NOT_HELD(&odn->dn_mtx)); 713219089Spjd ASSERT(MUTEX_NOT_HELD(&odn->dn_dbufs_mtx)); 714219089Spjd ASSERT(!RW_LOCK_HELD(&odn->dn_zfetch.zf_rwlock)); 715219089Spjd 716219089Spjd /* Copy fields. */ 717219089Spjd ndn->dn_objset = odn->dn_objset; 718219089Spjd ndn->dn_object = odn->dn_object; 719219089Spjd ndn->dn_dbuf = odn->dn_dbuf; 720219089Spjd ndn->dn_handle = odn->dn_handle; 721219089Spjd ndn->dn_phys = odn->dn_phys; 722219089Spjd ndn->dn_type = odn->dn_type; 723219089Spjd ndn->dn_bonuslen = odn->dn_bonuslen; 724219089Spjd ndn->dn_bonustype = odn->dn_bonustype; 725219089Spjd ndn->dn_nblkptr = odn->dn_nblkptr; 726219089Spjd ndn->dn_checksum = odn->dn_checksum; 727219089Spjd ndn->dn_compress = odn->dn_compress; 728219089Spjd ndn->dn_nlevels = odn->dn_nlevels; 729219089Spjd ndn->dn_indblkshift = odn->dn_indblkshift; 730219089Spjd ndn->dn_datablkshift = odn->dn_datablkshift; 731219089Spjd ndn->dn_datablkszsec = odn->dn_datablkszsec; 732219089Spjd ndn->dn_datablksz = odn->dn_datablksz; 733219089Spjd ndn->dn_maxblkid = odn->dn_maxblkid; 734219089Spjd bcopy(&odn->dn_next_nblkptr[0], &ndn->dn_next_nblkptr[0], 735219089Spjd sizeof (odn->dn_next_nblkptr)); 736219089Spjd bcopy(&odn->dn_next_nlevels[0], &ndn->dn_next_nlevels[0], 737219089Spjd sizeof (odn->dn_next_nlevels)); 738219089Spjd bcopy(&odn->dn_next_indblkshift[0], &ndn->dn_next_indblkshift[0], 739219089Spjd sizeof (odn->dn_next_indblkshift)); 740219089Spjd bcopy(&odn->dn_next_bonustype[0], &ndn->dn_next_bonustype[0], 741219089Spjd sizeof (odn->dn_next_bonustype)); 742219089Spjd bcopy(&odn->dn_rm_spillblk[0], &ndn->dn_rm_spillblk[0], 743219089Spjd sizeof (odn->dn_rm_spillblk)); 744219089Spjd bcopy(&odn->dn_next_bonuslen[0], &ndn->dn_next_bonuslen[0], 745219089Spjd sizeof (odn->dn_next_bonuslen)); 746219089Spjd bcopy(&odn->dn_next_blksz[0], &ndn->dn_next_blksz[0], 747219089Spjd sizeof (odn->dn_next_blksz)); 748219089Spjd for (i = 0; i < TXG_SIZE; i++) { 749219089Spjd list_move_tail(&ndn->dn_dirty_records[i], 750219089Spjd &odn->dn_dirty_records[i]); 751219089Spjd } 752265740Sdelphij bcopy(&odn->dn_free_ranges[0], &ndn->dn_free_ranges[0], 753265740Sdelphij sizeof (odn->dn_free_ranges)); 754219089Spjd ndn->dn_allocated_txg = odn->dn_allocated_txg; 755219089Spjd ndn->dn_free_txg = odn->dn_free_txg; 756219089Spjd ndn->dn_assigned_txg = odn->dn_assigned_txg; 757219089Spjd ndn->dn_dirtyctx = odn->dn_dirtyctx; 758219089Spjd ndn->dn_dirtyctx_firstset = odn->dn_dirtyctx_firstset; 759219089Spjd ASSERT(refcount_count(&odn->dn_tx_holds) == 0); 760219089Spjd refcount_transfer(&ndn->dn_holds, &odn->dn_holds); 761269845Sdelphij ASSERT(avl_is_empty(&ndn->dn_dbufs)); 762269845Sdelphij avl_swap(&ndn->dn_dbufs, &odn->dn_dbufs); 763219089Spjd ndn->dn_dbufs_count = odn->dn_dbufs_count; 764254753Sdelphij ndn->dn_unlisted_l0_blkid = odn->dn_unlisted_l0_blkid; 765219089Spjd ndn->dn_bonus = odn->dn_bonus; 766219089Spjd ndn->dn_have_spill = odn->dn_have_spill; 767219089Spjd ndn->dn_zio = odn->dn_zio; 768219089Spjd ndn->dn_oldused = odn->dn_oldused; 769219089Spjd ndn->dn_oldflags = odn->dn_oldflags; 770219089Spjd ndn->dn_olduid = odn->dn_olduid; 771219089Spjd ndn->dn_oldgid = odn->dn_oldgid; 772219089Spjd ndn->dn_newuid = odn->dn_newuid; 773219089Spjd ndn->dn_newgid = odn->dn_newgid; 774219089Spjd ndn->dn_id_flags = odn->dn_id_flags; 775219089Spjd dmu_zfetch_init(&ndn->dn_zfetch, NULL); 776219089Spjd list_move_tail(&ndn->dn_zfetch.zf_stream, &odn->dn_zfetch.zf_stream); 777219089Spjd ndn->dn_zfetch.zf_dnode = odn->dn_zfetch.zf_dnode; 778219089Spjd 779219089Spjd /* 780219089Spjd * Update back pointers. Updating the handle fixes the back pointer of 781219089Spjd * every descendant dbuf as well as the bonus dbuf. 782219089Spjd */ 783219089Spjd ASSERT(ndn->dn_handle->dnh_dnode == odn); 784219089Spjd ndn->dn_handle->dnh_dnode = ndn; 785219089Spjd if (ndn->dn_zfetch.zf_dnode == odn) { 786219089Spjd ndn->dn_zfetch.zf_dnode = ndn; 787219089Spjd } 788219089Spjd 789219089Spjd /* 790219089Spjd * Invalidate the original dnode by clearing all of its back pointers. 791219089Spjd */ 792219089Spjd odn->dn_dbuf = NULL; 793219089Spjd odn->dn_handle = NULL; 794269845Sdelphij avl_create(&odn->dn_dbufs, dbuf_compare, sizeof (dmu_buf_impl_t), 795219089Spjd offsetof(dmu_buf_impl_t, db_link)); 796219089Spjd odn->dn_dbufs_count = 0; 797254753Sdelphij odn->dn_unlisted_l0_blkid = 0; 798219089Spjd odn->dn_bonus = NULL; 799219089Spjd odn->dn_zfetch.zf_dnode = NULL; 800219089Spjd 801219089Spjd /* 802219089Spjd * Set the low bit of the objset pointer to ensure that dnode_move() 803219089Spjd * recognizes the dnode as invalid in any subsequent callback. 804219089Spjd */ 805219089Spjd POINTER_INVALIDATE(&odn->dn_objset); 806219089Spjd 807219089Spjd /* 808219089Spjd * Satisfy the destructor. 809219089Spjd */ 810219089Spjd for (i = 0; i < TXG_SIZE; i++) { 811219089Spjd list_create(&odn->dn_dirty_records[i], 812219089Spjd sizeof (dbuf_dirty_record_t), 813219089Spjd offsetof(dbuf_dirty_record_t, dr_dirty_node)); 814265740Sdelphij odn->dn_free_ranges[i] = NULL; 815219089Spjd odn->dn_next_nlevels[i] = 0; 816219089Spjd odn->dn_next_indblkshift[i] = 0; 817219089Spjd odn->dn_next_bonustype[i] = 0; 818219089Spjd odn->dn_rm_spillblk[i] = 0; 819219089Spjd odn->dn_next_bonuslen[i] = 0; 820219089Spjd odn->dn_next_blksz[i] = 0; 821219089Spjd } 822219089Spjd odn->dn_allocated_txg = 0; 823219089Spjd odn->dn_free_txg = 0; 824219089Spjd odn->dn_assigned_txg = 0; 825219089Spjd odn->dn_dirtyctx = 0; 826219089Spjd odn->dn_dirtyctx_firstset = NULL; 827219089Spjd odn->dn_have_spill = B_FALSE; 828219089Spjd odn->dn_zio = NULL; 829219089Spjd odn->dn_oldused = 0; 830219089Spjd odn->dn_oldflags = 0; 831219089Spjd odn->dn_olduid = 0; 832219089Spjd odn->dn_oldgid = 0; 833219089Spjd odn->dn_newuid = 0; 834219089Spjd odn->dn_newgid = 0; 835219089Spjd odn->dn_id_flags = 0; 836219089Spjd 837219089Spjd /* 838219089Spjd * Mark the dnode. 839219089Spjd */ 840219089Spjd ndn->dn_moved = 1; 841219089Spjd odn->dn_moved = (uint8_t)-1; 842219089Spjd} 843219089Spjd 844297077Smav#ifdef illumos 845219089Spjd#ifdef _KERNEL 846219089Spjd/*ARGSUSED*/ 847219089Spjdstatic kmem_cbrc_t 848219089Spjddnode_move(void *buf, void *newbuf, size_t size, void *arg) 849219089Spjd{ 850219089Spjd dnode_t *odn = buf, *ndn = newbuf; 851219089Spjd objset_t *os; 852219089Spjd int64_t refcount; 853219089Spjd uint32_t dbufs; 854219089Spjd 855219089Spjd /* 856219089Spjd * The dnode is on the objset's list of known dnodes if the objset 857219089Spjd * pointer is valid. We set the low bit of the objset pointer when 858219089Spjd * freeing the dnode to invalidate it, and the memory patterns written 859219089Spjd * by kmem (baddcafe and deadbeef) set at least one of the two low bits. 860219089Spjd * A newly created dnode sets the objset pointer last of all to indicate 861219089Spjd * that the dnode is known and in a valid state to be moved by this 862219089Spjd * function. 863219089Spjd */ 864219089Spjd os = odn->dn_objset; 865219089Spjd if (!POINTER_IS_VALID(os)) { 866219089Spjd DNODE_STAT_ADD(dnode_move_stats.dms_dnode_invalid); 867219089Spjd return (KMEM_CBRC_DONT_KNOW); 868219089Spjd } 869219089Spjd 870219089Spjd /* 871219089Spjd * Ensure that the objset does not go away during the move. 872219089Spjd */ 873219089Spjd rw_enter(&os_lock, RW_WRITER); 874219089Spjd if (os != odn->dn_objset) { 875219089Spjd rw_exit(&os_lock); 876219089Spjd DNODE_STAT_ADD(dnode_move_stats.dms_dnode_recheck1); 877219089Spjd return (KMEM_CBRC_DONT_KNOW); 878219089Spjd } 879219089Spjd 880219089Spjd /* 881219089Spjd * If the dnode is still valid, then so is the objset. We know that no 882219089Spjd * valid objset can be freed while we hold os_lock, so we can safely 883219089Spjd * ensure that the objset remains in use. 884219089Spjd */ 885219089Spjd mutex_enter(&os->os_lock); 886219089Spjd 887219089Spjd /* 888219089Spjd * Recheck the objset pointer in case the dnode was removed just before 889219089Spjd * acquiring the lock. 890219089Spjd */ 891219089Spjd if (os != odn->dn_objset) { 892219089Spjd mutex_exit(&os->os_lock); 893219089Spjd rw_exit(&os_lock); 894219089Spjd DNODE_STAT_ADD(dnode_move_stats.dms_dnode_recheck2); 895219089Spjd return (KMEM_CBRC_DONT_KNOW); 896219089Spjd } 897219089Spjd 898219089Spjd /* 899219089Spjd * At this point we know that as long as we hold os->os_lock, the dnode 900219089Spjd * cannot be freed and fields within the dnode can be safely accessed. 901219089Spjd * The objset listing this dnode cannot go away as long as this dnode is 902219089Spjd * on its list. 903219089Spjd */ 904219089Spjd rw_exit(&os_lock); 905219089Spjd if (DMU_OBJECT_IS_SPECIAL(odn->dn_object)) { 906219089Spjd mutex_exit(&os->os_lock); 907219089Spjd DNODE_STAT_ADD(dnode_move_stats.dms_dnode_special); 908219089Spjd return (KMEM_CBRC_NO); 909219089Spjd } 910219089Spjd ASSERT(odn->dn_dbuf != NULL); /* only "special" dnodes have no parent */ 911219089Spjd 912219089Spjd /* 913219089Spjd * Lock the dnode handle to prevent the dnode from obtaining any new 914219089Spjd * holds. This also prevents the descendant dbufs and the bonus dbuf 915219089Spjd * from accessing the dnode, so that we can discount their holds. The 916219089Spjd * handle is safe to access because we know that while the dnode cannot 917219089Spjd * go away, neither can its handle. Once we hold dnh_zrlock, we can 918219089Spjd * safely move any dnode referenced only by dbufs. 919219089Spjd */ 920219089Spjd if (!zrl_tryenter(&odn->dn_handle->dnh_zrlock)) { 921219089Spjd mutex_exit(&os->os_lock); 922219089Spjd DNODE_STAT_ADD(dnode_move_stats.dms_dnode_handle); 923219089Spjd return (KMEM_CBRC_LATER); 924219089Spjd } 925219089Spjd 926219089Spjd /* 927219089Spjd * Ensure a consistent view of the dnode's holds and the dnode's dbufs. 928219089Spjd * We need to guarantee that there is a hold for every dbuf in order to 929219089Spjd * determine whether the dnode is actively referenced. Falsely matching 930219089Spjd * a dbuf to an active hold would lead to an unsafe move. It's possible 931219089Spjd * that a thread already having an active dnode hold is about to add a 932219089Spjd * dbuf, and we can't compare hold and dbuf counts while the add is in 933219089Spjd * progress. 934219089Spjd */ 935219089Spjd if (!rw_tryenter(&odn->dn_struct_rwlock, RW_WRITER)) { 936219089Spjd zrl_exit(&odn->dn_handle->dnh_zrlock); 937219089Spjd mutex_exit(&os->os_lock); 938219089Spjd DNODE_STAT_ADD(dnode_move_stats.dms_dnode_rwlock); 939219089Spjd return (KMEM_CBRC_LATER); 940219089Spjd } 941219089Spjd 942219089Spjd /* 943219089Spjd * A dbuf may be removed (evicted) without an active dnode hold. In that 944219089Spjd * case, the dbuf count is decremented under the handle lock before the 945219089Spjd * dbuf's hold is released. This order ensures that if we count the hold 946219089Spjd * after the dbuf is removed but before its hold is released, we will 947219089Spjd * treat the unmatched hold as active and exit safely. If we count the 948219089Spjd * hold before the dbuf is removed, the hold is discounted, and the 949219089Spjd * removal is blocked until the move completes. 950219089Spjd */ 951219089Spjd refcount = refcount_count(&odn->dn_holds); 952219089Spjd ASSERT(refcount >= 0); 953219089Spjd dbufs = odn->dn_dbufs_count; 954219089Spjd 955219089Spjd /* We can't have more dbufs than dnode holds. */ 956219089Spjd ASSERT3U(dbufs, <=, refcount); 957219089Spjd DTRACE_PROBE3(dnode__move, dnode_t *, odn, int64_t, refcount, 958219089Spjd uint32_t, dbufs); 959219089Spjd 960219089Spjd if (refcount > dbufs) { 961219089Spjd rw_exit(&odn->dn_struct_rwlock); 962219089Spjd zrl_exit(&odn->dn_handle->dnh_zrlock); 963219089Spjd mutex_exit(&os->os_lock); 964219089Spjd DNODE_STAT_ADD(dnode_move_stats.dms_dnode_active); 965219089Spjd return (KMEM_CBRC_LATER); 966219089Spjd } 967219089Spjd 968219089Spjd rw_exit(&odn->dn_struct_rwlock); 969219089Spjd 970219089Spjd /* 971219089Spjd * At this point we know that anyone with a hold on the dnode is not 972219089Spjd * actively referencing it. The dnode is known and in a valid state to 973219089Spjd * move. We're holding the locks needed to execute the critical section. 974219089Spjd */ 975219089Spjd dnode_move_impl(odn, ndn); 976219089Spjd 977219089Spjd list_link_replace(&odn->dn_link, &ndn->dn_link); 978219089Spjd /* If the dnode was safe to move, the refcount cannot have changed. */ 979219089Spjd ASSERT(refcount == refcount_count(&ndn->dn_holds)); 980219089Spjd ASSERT(dbufs == ndn->dn_dbufs_count); 981219089Spjd zrl_exit(&ndn->dn_handle->dnh_zrlock); /* handle has moved */ 982219089Spjd mutex_exit(&os->os_lock); 983219089Spjd 984219089Spjd return (KMEM_CBRC_YES); 985219089Spjd} 986219089Spjd#endif /* _KERNEL */ 987297077Smav#endif /* illumos */ 988219089Spjd 989168404Spjdvoid 990219089Spjddnode_special_close(dnode_handle_t *dnh) 991168404Spjd{ 992219089Spjd dnode_t *dn = dnh->dnh_dnode; 993219089Spjd 994168404Spjd /* 995168404Spjd * Wait for final references to the dnode to clear. This can 996168404Spjd * only happen if the arc is asyncronously evicting state that 997168404Spjd * has a hold on this dnode while we are trying to evict this 998168404Spjd * dnode. 999168404Spjd */ 1000168404Spjd while (refcount_count(&dn->dn_holds) > 0) 1001168404Spjd delay(1); 1002288549Smav ASSERT(dn->dn_dbuf == NULL || 1003288549Smav dmu_buf_get_user(&dn->dn_dbuf->db) == NULL); 1004219089Spjd zrl_add(&dnh->dnh_zrlock); 1005219089Spjd dnode_destroy(dn); /* implicit zrl_remove() */ 1006219089Spjd zrl_destroy(&dnh->dnh_zrlock); 1007219089Spjd dnh->dnh_dnode = NULL; 1008168404Spjd} 1009168404Spjd 1010288549Smavvoid 1011219089Spjddnode_special_open(objset_t *os, dnode_phys_t *dnp, uint64_t object, 1012219089Spjd dnode_handle_t *dnh) 1013168404Spjd{ 1014288549Smav dnode_t *dn; 1015288549Smav 1016288549Smav dn = dnode_create(os, dnp, NULL, object, dnh); 1017219089Spjd zrl_init(&dnh->dnh_zrlock); 1018168404Spjd DNODE_VERIFY(dn); 1019168404Spjd} 1020168404Spjd 1021168404Spjdstatic void 1022288549Smavdnode_buf_pageout(void *dbu) 1023168404Spjd{ 1024288549Smav dnode_children_t *children_dnodes = dbu; 1025168404Spjd int i; 1026168404Spjd 1027288549Smav for (i = 0; i < children_dnodes->dnc_count; i++) { 1028219089Spjd dnode_handle_t *dnh = &children_dnodes->dnc_children[i]; 1029219089Spjd dnode_t *dn; 1030168404Spjd 1031219089Spjd /* 1032219089Spjd * The dnode handle lock guards against the dnode moving to 1033219089Spjd * another valid address, so there is no need here to guard 1034219089Spjd * against changes to or from NULL. 1035219089Spjd */ 1036219089Spjd if (dnh->dnh_dnode == NULL) { 1037219089Spjd zrl_destroy(&dnh->dnh_zrlock); 1038168404Spjd continue; 1039219089Spjd } 1040219089Spjd 1041219089Spjd zrl_add(&dnh->dnh_zrlock); 1042219089Spjd dn = dnh->dnh_dnode; 1043168404Spjd /* 1044168404Spjd * If there are holds on this dnode, then there should 1045168404Spjd * be holds on the dnode's containing dbuf as well; thus 1046219089Spjd * it wouldn't be eligible for eviction and this function 1047168404Spjd * would not have been called. 1048168404Spjd */ 1049168404Spjd ASSERT(refcount_is_zero(&dn->dn_holds)); 1050168404Spjd ASSERT(refcount_is_zero(&dn->dn_tx_holds)); 1051168404Spjd 1052219089Spjd dnode_destroy(dn); /* implicit zrl_remove() */ 1053219089Spjd zrl_destroy(&dnh->dnh_zrlock); 1054219089Spjd dnh->dnh_dnode = NULL; 1055168404Spjd } 1056219089Spjd kmem_free(children_dnodes, sizeof (dnode_children_t) + 1057288549Smav children_dnodes->dnc_count * sizeof (dnode_handle_t)); 1058168404Spjd} 1059168404Spjd 1060168404Spjd/* 1061168404Spjd * errors: 1062168404Spjd * EINVAL - invalid object number. 1063168404Spjd * EIO - i/o error. 1064168404Spjd * succeeds even for free dnodes. 1065168404Spjd */ 1066168404Spjdint 1067219089Spjddnode_hold_impl(objset_t *os, uint64_t object, int flag, 1068168404Spjd void *tag, dnode_t **dnp) 1069168404Spjd{ 1070168404Spjd int epb, idx, err; 1071168404Spjd int drop_struct_lock = FALSE; 1072168404Spjd int type; 1073168404Spjd uint64_t blk; 1074168404Spjd dnode_t *mdn, *dn; 1075168404Spjd dmu_buf_impl_t *db; 1076219089Spjd dnode_children_t *children_dnodes; 1077219089Spjd dnode_handle_t *dnh; 1078168404Spjd 1079185029Spjd /* 1080185029Spjd * If you are holding the spa config lock as writer, you shouldn't 1081219089Spjd * be asking the DMU to do *anything* unless it's the root pool 1082219089Spjd * which may require us to read from the root filesystem while 1083219089Spjd * holding some (not all) of the locks as writer. 1084185029Spjd */ 1085219089Spjd ASSERT(spa_config_held(os->os_spa, SCL_ALL, RW_WRITER) == 0 || 1086219089Spjd (spa_is_root(os->os_spa) && 1087219089Spjd spa_config_held(os->os_spa, SCL_STATE, RW_WRITER))); 1088185029Spjd 1089209962Smm if (object == DMU_USERUSED_OBJECT || object == DMU_GROUPUSED_OBJECT) { 1090209962Smm dn = (object == DMU_USERUSED_OBJECT) ? 1091219089Spjd DMU_USERUSED_DNODE(os) : DMU_GROUPUSED_DNODE(os); 1092209962Smm if (dn == NULL) 1093249195Smm return (SET_ERROR(ENOENT)); 1094209962Smm type = dn->dn_type; 1095209962Smm if ((flag & DNODE_MUST_BE_ALLOCATED) && type == DMU_OT_NONE) 1096249195Smm return (SET_ERROR(ENOENT)); 1097209962Smm if ((flag & DNODE_MUST_BE_FREE) && type != DMU_OT_NONE) 1098249195Smm return (SET_ERROR(EEXIST)); 1099209962Smm DNODE_VERIFY(dn); 1100209962Smm (void) refcount_add(&dn->dn_holds, tag); 1101209962Smm *dnp = dn; 1102209962Smm return (0); 1103209962Smm } 1104209962Smm 1105168404Spjd if (object == 0 || object >= DN_MAX_OBJECT) 1106249195Smm return (SET_ERROR(EINVAL)); 1107168404Spjd 1108219089Spjd mdn = DMU_META_DNODE(os); 1109219089Spjd ASSERT(mdn->dn_object == DMU_META_DNODE_OBJECT); 1110168404Spjd 1111168404Spjd DNODE_VERIFY(mdn); 1112168404Spjd 1113168404Spjd if (!RW_WRITE_HELD(&mdn->dn_struct_rwlock)) { 1114168404Spjd rw_enter(&mdn->dn_struct_rwlock, RW_READER); 1115168404Spjd drop_struct_lock = TRUE; 1116168404Spjd } 1117168404Spjd 1118288571Smav blk = dbuf_whichblock(mdn, 0, object * sizeof (dnode_phys_t)); 1119168404Spjd 1120168404Spjd db = dbuf_hold(mdn, blk, FTAG); 1121168404Spjd if (drop_struct_lock) 1122168404Spjd rw_exit(&mdn->dn_struct_rwlock); 1123168404Spjd if (db == NULL) 1124249195Smm return (SET_ERROR(EIO)); 1125168404Spjd err = dbuf_read(db, NULL, DB_RF_CANFAIL); 1126168404Spjd if (err) { 1127168404Spjd dbuf_rele(db, FTAG); 1128168404Spjd return (err); 1129168404Spjd } 1130168404Spjd 1131168404Spjd ASSERT3U(db->db.db_size, >=, 1<<DNODE_SHIFT); 1132168404Spjd epb = db->db.db_size >> DNODE_SHIFT; 1133168404Spjd 1134168404Spjd idx = object & (epb-1); 1135168404Spjd 1136219089Spjd ASSERT(DB_DNODE(db)->dn_type == DMU_OT_DNODE); 1137168404Spjd children_dnodes = dmu_buf_get_user(&db->db); 1138168404Spjd if (children_dnodes == NULL) { 1139219089Spjd int i; 1140219089Spjd dnode_children_t *winner; 1141230256Spluknet children_dnodes = kmem_zalloc(sizeof (dnode_children_t) + 1142270127Sdelphij epb * sizeof (dnode_handle_t), KM_SLEEP); 1143219089Spjd children_dnodes->dnc_count = epb; 1144219089Spjd dnh = &children_dnodes->dnc_children[0]; 1145219089Spjd for (i = 0; i < epb; i++) { 1146219089Spjd zrl_init(&dnh[i].dnh_zrlock); 1147219089Spjd } 1148288549Smav dmu_buf_init_user(&children_dnodes->dnc_dbu, 1149288549Smav dnode_buf_pageout, NULL); 1150288549Smav winner = dmu_buf_set_user(&db->db, &children_dnodes->dnc_dbu); 1151288549Smav if (winner != NULL) { 1152269218Sdelphij 1153269218Sdelphij for (i = 0; i < epb; i++) { 1154269218Sdelphij zrl_destroy(&dnh[i].dnh_zrlock); 1155269218Sdelphij } 1156269218Sdelphij 1157219089Spjd kmem_free(children_dnodes, sizeof (dnode_children_t) + 1158270127Sdelphij epb * sizeof (dnode_handle_t)); 1159168404Spjd children_dnodes = winner; 1160168404Spjd } 1161168404Spjd } 1162219089Spjd ASSERT(children_dnodes->dnc_count == epb); 1163168404Spjd 1164219089Spjd dnh = &children_dnodes->dnc_children[idx]; 1165219089Spjd zrl_add(&dnh->dnh_zrlock); 1166288549Smav dn = dnh->dnh_dnode; 1167288549Smav if (dn == NULL) { 1168219089Spjd dnode_phys_t *phys = (dnode_phys_t *)db->db.db_data+idx; 1169185029Spjd 1170219089Spjd dn = dnode_create(os, phys, db, object, dnh); 1171168404Spjd } 1172168404Spjd 1173168404Spjd mutex_enter(&dn->dn_mtx); 1174168404Spjd type = dn->dn_type; 1175168404Spjd if (dn->dn_free_txg || 1176168404Spjd ((flag & DNODE_MUST_BE_ALLOCATED) && type == DMU_OT_NONE) || 1177209962Smm ((flag & DNODE_MUST_BE_FREE) && 1178219089Spjd (type != DMU_OT_NONE || !refcount_is_zero(&dn->dn_holds)))) { 1179168404Spjd mutex_exit(&dn->dn_mtx); 1180219089Spjd zrl_remove(&dnh->dnh_zrlock); 1181168404Spjd dbuf_rele(db, FTAG); 1182168404Spjd return (type == DMU_OT_NONE ? ENOENT : EEXIST); 1183168404Spjd } 1184288549Smav if (refcount_add(&dn->dn_holds, tag) == 1) 1185288549Smav dbuf_add_ref(db, dnh); 1186168404Spjd mutex_exit(&dn->dn_mtx); 1187168404Spjd 1188219089Spjd /* Now we can rely on the hold to prevent the dnode from moving. */ 1189219089Spjd zrl_remove(&dnh->dnh_zrlock); 1190168404Spjd 1191168404Spjd DNODE_VERIFY(dn); 1192168404Spjd ASSERT3P(dn->dn_dbuf, ==, db); 1193168404Spjd ASSERT3U(dn->dn_object, ==, object); 1194168404Spjd dbuf_rele(db, FTAG); 1195168404Spjd 1196168404Spjd *dnp = dn; 1197168404Spjd return (0); 1198168404Spjd} 1199168404Spjd 1200168404Spjd/* 1201168404Spjd * Return held dnode if the object is allocated, NULL if not. 1202168404Spjd */ 1203168404Spjdint 1204219089Spjddnode_hold(objset_t *os, uint64_t object, void *tag, dnode_t **dnp) 1205168404Spjd{ 1206168404Spjd return (dnode_hold_impl(os, object, DNODE_MUST_BE_ALLOCATED, tag, dnp)); 1207168404Spjd} 1208168404Spjd 1209185029Spjd/* 1210185029Spjd * Can only add a reference if there is already at least one 1211185029Spjd * reference on the dnode. Returns FALSE if unable to add a 1212185029Spjd * new reference. 1213185029Spjd */ 1214185029Spjdboolean_t 1215168404Spjddnode_add_ref(dnode_t *dn, void *tag) 1216168404Spjd{ 1217185029Spjd mutex_enter(&dn->dn_mtx); 1218185029Spjd if (refcount_is_zero(&dn->dn_holds)) { 1219185029Spjd mutex_exit(&dn->dn_mtx); 1220185029Spjd return (FALSE); 1221185029Spjd } 1222185029Spjd VERIFY(1 < refcount_add(&dn->dn_holds, tag)); 1223185029Spjd mutex_exit(&dn->dn_mtx); 1224185029Spjd return (TRUE); 1225168404Spjd} 1226168404Spjd 1227168404Spjdvoid 1228168404Spjddnode_rele(dnode_t *dn, void *tag) 1229168404Spjd{ 1230288541Smav mutex_enter(&dn->dn_mtx); 1231288541Smav dnode_rele_and_unlock(dn, tag); 1232288541Smav} 1233288541Smav 1234288541Smavvoid 1235288541Smavdnode_rele_and_unlock(dnode_t *dn, void *tag) 1236288541Smav{ 1237168404Spjd uint64_t refs; 1238219089Spjd /* Get while the hold prevents the dnode from moving. */ 1239219089Spjd dmu_buf_impl_t *db = dn->dn_dbuf; 1240219089Spjd dnode_handle_t *dnh = dn->dn_handle; 1241168404Spjd 1242168404Spjd refs = refcount_remove(&dn->dn_holds, tag); 1243185029Spjd mutex_exit(&dn->dn_mtx); 1244219089Spjd 1245219089Spjd /* 1246219089Spjd * It's unsafe to release the last hold on a dnode by dnode_rele() or 1247219089Spjd * indirectly by dbuf_rele() while relying on the dnode handle to 1248219089Spjd * prevent the dnode from moving, since releasing the last hold could 1249219089Spjd * result in the dnode's parent dbuf evicting its dnode handles. For 1250219089Spjd * that reason anyone calling dnode_rele() or dbuf_rele() without some 1251219089Spjd * other direct or indirect hold on the dnode must first drop the dnode 1252219089Spjd * handle. 1253219089Spjd */ 1254219089Spjd ASSERT(refs > 0 || dnh->dnh_zrlock.zr_owner != curthread); 1255219089Spjd 1256168404Spjd /* NOTE: the DNODE_DNODE does not have a dn_dbuf */ 1257219089Spjd if (refs == 0 && db != NULL) { 1258219089Spjd /* 1259219089Spjd * Another thread could add a hold to the dnode handle in 1260219089Spjd * dnode_hold_impl() while holding the parent dbuf. Since the 1261219089Spjd * hold on the parent dbuf prevents the handle from being 1262219089Spjd * destroyed, the hold on the handle is OK. We can't yet assert 1263219089Spjd * that the handle has zero references, but that will be 1264219089Spjd * asserted anyway when the handle gets destroyed. 1265219089Spjd */ 1266219089Spjd dbuf_rele(db, dnh); 1267219089Spjd } 1268168404Spjd} 1269168404Spjd 1270168404Spjdvoid 1271168404Spjddnode_setdirty(dnode_t *dn, dmu_tx_t *tx) 1272168404Spjd{ 1273219089Spjd objset_t *os = dn->dn_objset; 1274168404Spjd uint64_t txg = tx->tx_txg; 1275168404Spjd 1276209962Smm if (DMU_OBJECT_IS_SPECIAL(dn->dn_object)) { 1277209962Smm dsl_dataset_dirty(os->os_dsl_dataset, tx); 1278168404Spjd return; 1279209962Smm } 1280168404Spjd 1281168404Spjd DNODE_VERIFY(dn); 1282168404Spjd 1283168404Spjd#ifdef ZFS_DEBUG 1284168404Spjd mutex_enter(&dn->dn_mtx); 1285168404Spjd ASSERT(dn->dn_phys->dn_type || dn->dn_allocated_txg); 1286219089Spjd ASSERT(dn->dn_free_txg == 0 || dn->dn_free_txg >= txg); 1287168404Spjd mutex_exit(&dn->dn_mtx); 1288168404Spjd#endif 1289168404Spjd 1290219089Spjd /* 1291219089Spjd * Determine old uid/gid when necessary 1292219089Spjd */ 1293219089Spjd dmu_objset_userquota_get_ids(dn, B_TRUE, tx); 1294219089Spjd 1295168404Spjd mutex_enter(&os->os_lock); 1296168404Spjd 1297168404Spjd /* 1298168404Spjd * If we are already marked dirty, we're done. 1299168404Spjd */ 1300168404Spjd if (list_link_active(&dn->dn_dirty_link[txg & TXG_MASK])) { 1301168404Spjd mutex_exit(&os->os_lock); 1302168404Spjd return; 1303168404Spjd } 1304168404Spjd 1305269845Sdelphij ASSERT(!refcount_is_zero(&dn->dn_holds) || 1306269845Sdelphij !avl_is_empty(&dn->dn_dbufs)); 1307168404Spjd ASSERT(dn->dn_datablksz != 0); 1308240415Smm ASSERT0(dn->dn_next_bonuslen[txg&TXG_MASK]); 1309240415Smm ASSERT0(dn->dn_next_blksz[txg&TXG_MASK]); 1310240415Smm ASSERT0(dn->dn_next_bonustype[txg&TXG_MASK]); 1311168404Spjd 1312168404Spjd dprintf_ds(os->os_dsl_dataset, "obj=%llu txg=%llu\n", 1313168404Spjd dn->dn_object, txg); 1314168404Spjd 1315168404Spjd if (dn->dn_free_txg > 0 && dn->dn_free_txg <= txg) { 1316168404Spjd list_insert_tail(&os->os_free_dnodes[txg&TXG_MASK], dn); 1317168404Spjd } else { 1318168404Spjd list_insert_tail(&os->os_dirty_dnodes[txg&TXG_MASK], dn); 1319168404Spjd } 1320168404Spjd 1321168404Spjd mutex_exit(&os->os_lock); 1322168404Spjd 1323168404Spjd /* 1324168404Spjd * The dnode maintains a hold on its containing dbuf as 1325168404Spjd * long as there are holds on it. Each instantiated child 1326219089Spjd * dbuf maintains a hold on the dnode. When the last child 1327168404Spjd * drops its hold, the dnode will drop its hold on the 1328168404Spjd * containing dbuf. We add a "dirty hold" here so that the 1329168404Spjd * dnode will hang around after we finish processing its 1330168404Spjd * children. 1331168404Spjd */ 1332185029Spjd VERIFY(dnode_add_ref(dn, (void *)(uintptr_t)tx->tx_txg)); 1333168404Spjd 1334168404Spjd (void) dbuf_dirty(dn->dn_dbuf, tx); 1335168404Spjd 1336168404Spjd dsl_dataset_dirty(os->os_dsl_dataset, tx); 1337168404Spjd} 1338168404Spjd 1339168404Spjdvoid 1340168404Spjddnode_free(dnode_t *dn, dmu_tx_t *tx) 1341168404Spjd{ 1342168404Spjd int txgoff = tx->tx_txg & TXG_MASK; 1343168404Spjd 1344168404Spjd dprintf("dn=%p txg=%llu\n", dn, tx->tx_txg); 1345168404Spjd 1346168404Spjd /* we should be the only holder... hopefully */ 1347168404Spjd /* ASSERT3U(refcount_count(&dn->dn_holds), ==, 1); */ 1348168404Spjd 1349168404Spjd mutex_enter(&dn->dn_mtx); 1350168404Spjd if (dn->dn_type == DMU_OT_NONE || dn->dn_free_txg) { 1351168404Spjd mutex_exit(&dn->dn_mtx); 1352168404Spjd return; 1353168404Spjd } 1354168404Spjd dn->dn_free_txg = tx->tx_txg; 1355168404Spjd mutex_exit(&dn->dn_mtx); 1356168404Spjd 1357168404Spjd /* 1358168404Spjd * If the dnode is already dirty, it needs to be moved from 1359168404Spjd * the dirty list to the free list. 1360168404Spjd */ 1361168404Spjd mutex_enter(&dn->dn_objset->os_lock); 1362168404Spjd if (list_link_active(&dn->dn_dirty_link[txgoff])) { 1363168404Spjd list_remove(&dn->dn_objset->os_dirty_dnodes[txgoff], dn); 1364168404Spjd list_insert_tail(&dn->dn_objset->os_free_dnodes[txgoff], dn); 1365168404Spjd mutex_exit(&dn->dn_objset->os_lock); 1366168404Spjd } else { 1367168404Spjd mutex_exit(&dn->dn_objset->os_lock); 1368168404Spjd dnode_setdirty(dn, tx); 1369168404Spjd } 1370168404Spjd} 1371168404Spjd 1372168404Spjd/* 1373168404Spjd * Try to change the block size for the indicated dnode. This can only 1374168404Spjd * succeed if there are no blocks allocated or dirty beyond first block 1375168404Spjd */ 1376168404Spjdint 1377168404Spjddnode_set_blksz(dnode_t *dn, uint64_t size, int ibs, dmu_tx_t *tx) 1378168404Spjd{ 1379269845Sdelphij dmu_buf_impl_t *db; 1380185029Spjd int err; 1381168404Spjd 1382276081Sdelphij ASSERT3U(size, <=, spa_maxblocksize(dmu_objset_spa(dn->dn_objset))); 1383168404Spjd if (size == 0) 1384168404Spjd size = SPA_MINBLOCKSIZE; 1385168404Spjd else 1386168404Spjd size = P2ROUNDUP(size, SPA_MINBLOCKSIZE); 1387168404Spjd 1388168404Spjd if (ibs == dn->dn_indblkshift) 1389168404Spjd ibs = 0; 1390168404Spjd 1391168404Spjd if (size >> SPA_MINBLOCKSHIFT == dn->dn_datablkszsec && ibs == 0) 1392168404Spjd return (0); 1393168404Spjd 1394168404Spjd rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 1395168404Spjd 1396168404Spjd /* Check for any allocated blocks beyond the first */ 1397262093Savg if (dn->dn_maxblkid != 0) 1398168404Spjd goto fail; 1399168404Spjd 1400168404Spjd mutex_enter(&dn->dn_dbufs_mtx); 1401269845Sdelphij for (db = avl_first(&dn->dn_dbufs); db != NULL; 1402269845Sdelphij db = AVL_NEXT(&dn->dn_dbufs, db)) { 1403219089Spjd if (db->db_blkid != 0 && db->db_blkid != DMU_BONUS_BLKID && 1404219089Spjd db->db_blkid != DMU_SPILL_BLKID) { 1405168404Spjd mutex_exit(&dn->dn_dbufs_mtx); 1406168404Spjd goto fail; 1407168404Spjd } 1408168404Spjd } 1409168404Spjd mutex_exit(&dn->dn_dbufs_mtx); 1410168404Spjd 1411168404Spjd if (ibs && dn->dn_nlevels != 1) 1412168404Spjd goto fail; 1413168404Spjd 1414185029Spjd /* resize the old block */ 1415288571Smav err = dbuf_hold_impl(dn, 0, 0, TRUE, FALSE, FTAG, &db); 1416185029Spjd if (err == 0) 1417168404Spjd dbuf_new_size(db, size, tx); 1418185029Spjd else if (err != ENOENT) 1419185029Spjd goto fail; 1420168404Spjd 1421168404Spjd dnode_setdblksz(dn, size); 1422168404Spjd dnode_setdirty(dn, tx); 1423168404Spjd dn->dn_next_blksz[tx->tx_txg&TXG_MASK] = size; 1424168404Spjd if (ibs) { 1425168404Spjd dn->dn_indblkshift = ibs; 1426168404Spjd dn->dn_next_indblkshift[tx->tx_txg&TXG_MASK] = ibs; 1427168404Spjd } 1428185029Spjd /* rele after we have fixed the blocksize in the dnode */ 1429168404Spjd if (db) 1430168404Spjd dbuf_rele(db, FTAG); 1431168404Spjd 1432168404Spjd rw_exit(&dn->dn_struct_rwlock); 1433168404Spjd return (0); 1434168404Spjd 1435168404Spjdfail: 1436168404Spjd rw_exit(&dn->dn_struct_rwlock); 1437249195Smm return (SET_ERROR(ENOTSUP)); 1438168404Spjd} 1439168404Spjd 1440185029Spjd/* read-holding callers must not rely on the lock being continuously held */ 1441168404Spjdvoid 1442185029Spjddnode_new_blkid(dnode_t *dn, uint64_t blkid, dmu_tx_t *tx, boolean_t have_read) 1443168404Spjd{ 1444168404Spjd uint64_t txgoff = tx->tx_txg & TXG_MASK; 1445168404Spjd int epbs, new_nlevels; 1446168404Spjd uint64_t sz; 1447168404Spjd 1448219089Spjd ASSERT(blkid != DMU_BONUS_BLKID); 1449168404Spjd 1450185029Spjd ASSERT(have_read ? 1451185029Spjd RW_READ_HELD(&dn->dn_struct_rwlock) : 1452185029Spjd RW_WRITE_HELD(&dn->dn_struct_rwlock)); 1453185029Spjd 1454185029Spjd /* 1455185029Spjd * if we have a read-lock, check to see if we need to do any work 1456185029Spjd * before upgrading to a write-lock. 1457185029Spjd */ 1458185029Spjd if (have_read) { 1459185029Spjd if (blkid <= dn->dn_maxblkid) 1460185029Spjd return; 1461185029Spjd 1462185029Spjd if (!rw_tryupgrade(&dn->dn_struct_rwlock)) { 1463185029Spjd rw_exit(&dn->dn_struct_rwlock); 1464185029Spjd rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 1465185029Spjd } 1466168404Spjd } 1467168404Spjd 1468168404Spjd if (blkid <= dn->dn_maxblkid) 1469168404Spjd goto out; 1470168404Spjd 1471168404Spjd dn->dn_maxblkid = blkid; 1472168404Spjd 1473168404Spjd /* 1474168404Spjd * Compute the number of levels necessary to support the new maxblkid. 1475168404Spjd */ 1476168404Spjd new_nlevels = 1; 1477168404Spjd epbs = dn->dn_indblkshift - SPA_BLKPTRSHIFT; 1478168404Spjd for (sz = dn->dn_nblkptr; 1479168404Spjd sz <= blkid && sz >= dn->dn_nblkptr; sz <<= epbs) 1480168404Spjd new_nlevels++; 1481168404Spjd 1482168404Spjd if (new_nlevels > dn->dn_nlevels) { 1483168404Spjd int old_nlevels = dn->dn_nlevels; 1484168404Spjd dmu_buf_impl_t *db; 1485168404Spjd list_t *list; 1486168404Spjd dbuf_dirty_record_t *new, *dr, *dr_next; 1487168404Spjd 1488168404Spjd dn->dn_nlevels = new_nlevels; 1489168404Spjd 1490168404Spjd ASSERT3U(new_nlevels, >, dn->dn_next_nlevels[txgoff]); 1491168404Spjd dn->dn_next_nlevels[txgoff] = new_nlevels; 1492168404Spjd 1493168404Spjd /* dirty the left indirects */ 1494168404Spjd db = dbuf_hold_level(dn, old_nlevels, 0, FTAG); 1495219089Spjd ASSERT(db != NULL); 1496168404Spjd new = dbuf_dirty(db, tx); 1497168404Spjd dbuf_rele(db, FTAG); 1498168404Spjd 1499168404Spjd /* transfer the dirty records to the new indirect */ 1500168404Spjd mutex_enter(&dn->dn_mtx); 1501168404Spjd mutex_enter(&new->dt.di.dr_mtx); 1502168404Spjd list = &dn->dn_dirty_records[txgoff]; 1503168404Spjd for (dr = list_head(list); dr; dr = dr_next) { 1504168404Spjd dr_next = list_next(&dn->dn_dirty_records[txgoff], dr); 1505168404Spjd if (dr->dr_dbuf->db_level != new_nlevels-1 && 1506219089Spjd dr->dr_dbuf->db_blkid != DMU_BONUS_BLKID && 1507219089Spjd dr->dr_dbuf->db_blkid != DMU_SPILL_BLKID) { 1508168404Spjd ASSERT(dr->dr_dbuf->db_level == old_nlevels-1); 1509168404Spjd list_remove(&dn->dn_dirty_records[txgoff], dr); 1510168404Spjd list_insert_tail(&new->dt.di.dr_children, dr); 1511168404Spjd dr->dr_parent = new; 1512168404Spjd } 1513168404Spjd } 1514168404Spjd mutex_exit(&new->dt.di.dr_mtx); 1515168404Spjd mutex_exit(&dn->dn_mtx); 1516168404Spjd } 1517168404Spjd 1518168404Spjdout: 1519185029Spjd if (have_read) 1520185029Spjd rw_downgrade(&dn->dn_struct_rwlock); 1521168404Spjd} 1522168404Spjd 1523285202Savgstatic void 1524285202Savgdnode_dirty_l1(dnode_t *dn, uint64_t l1blkid, dmu_tx_t *tx) 1525285202Savg{ 1526285202Savg dmu_buf_impl_t *db = dbuf_hold_level(dn, 1, l1blkid, FTAG); 1527285202Savg if (db != NULL) { 1528285202Savg dmu_buf_will_dirty(&db->db, tx); 1529285202Savg dbuf_rele(db, FTAG); 1530285202Savg } 1531285202Savg} 1532285202Savg 1533168404Spjdvoid 1534168404Spjddnode_free_range(dnode_t *dn, uint64_t off, uint64_t len, dmu_tx_t *tx) 1535168404Spjd{ 1536168404Spjd dmu_buf_impl_t *db; 1537168404Spjd uint64_t blkoff, blkid, nblks; 1538185029Spjd int blksz, blkshift, head, tail; 1539168404Spjd int trunc = FALSE; 1540185029Spjd int epbs; 1541168404Spjd 1542168404Spjd rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 1543168404Spjd blksz = dn->dn_datablksz; 1544185029Spjd blkshift = dn->dn_datablkshift; 1545185029Spjd epbs = dn->dn_indblkshift - SPA_BLKPTRSHIFT; 1546168404Spjd 1547254753Sdelphij if (len == DMU_OBJECT_END) { 1548168404Spjd len = UINT64_MAX - off; 1549168404Spjd trunc = TRUE; 1550168404Spjd } 1551168404Spjd 1552168404Spjd /* 1553168404Spjd * First, block align the region to free: 1554168404Spjd */ 1555168404Spjd if (ISP2(blksz)) { 1556168404Spjd head = P2NPHASE(off, blksz); 1557168404Spjd blkoff = P2PHASE(off, blksz); 1558185029Spjd if ((off >> blkshift) > dn->dn_maxblkid) 1559185029Spjd goto out; 1560168404Spjd } else { 1561168404Spjd ASSERT(dn->dn_maxblkid == 0); 1562168404Spjd if (off == 0 && len >= blksz) { 1563263397Sdelphij /* 1564263397Sdelphij * Freeing the whole block; fast-track this request. 1565263397Sdelphij * Note that we won't dirty any indirect blocks, 1566263397Sdelphij * which is fine because we will be freeing the entire 1567263397Sdelphij * file and thus all indirect blocks will be freed 1568263397Sdelphij * by free_children(). 1569263397Sdelphij */ 1570185029Spjd blkid = 0; 1571185029Spjd nblks = 1; 1572185029Spjd goto done; 1573185029Spjd } else if (off >= blksz) { 1574185029Spjd /* Freeing past end-of-data */ 1575185029Spjd goto out; 1576168404Spjd } else { 1577168404Spjd /* Freeing part of the block. */ 1578168404Spjd head = blksz - off; 1579168404Spjd ASSERT3U(head, >, 0); 1580168404Spjd } 1581168404Spjd blkoff = off; 1582168404Spjd } 1583168404Spjd /* zero out any partial block data at the start of the range */ 1584168404Spjd if (head) { 1585168404Spjd ASSERT3U(blkoff + head, ==, blksz); 1586168404Spjd if (len < head) 1587168404Spjd head = len; 1588288571Smav if (dbuf_hold_impl(dn, 0, dbuf_whichblock(dn, 0, off), 1589288571Smav TRUE, FALSE, FTAG, &db) == 0) { 1590168404Spjd caddr_t data; 1591168404Spjd 1592168404Spjd /* don't dirty if it isn't on disk and isn't dirty */ 1593168404Spjd if (db->db_last_dirty || 1594168404Spjd (db->db_blkptr && !BP_IS_HOLE(db->db_blkptr))) { 1595168404Spjd rw_exit(&dn->dn_struct_rwlock); 1596263397Sdelphij dmu_buf_will_dirty(&db->db, tx); 1597168404Spjd rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 1598168404Spjd data = db->db.db_data; 1599168404Spjd bzero(data + blkoff, head); 1600168404Spjd } 1601168404Spjd dbuf_rele(db, FTAG); 1602168404Spjd } 1603168404Spjd off += head; 1604168404Spjd len -= head; 1605168404Spjd } 1606168404Spjd 1607168404Spjd /* If the range was less than one block, we're done */ 1608185029Spjd if (len == 0) 1609168404Spjd goto out; 1610168404Spjd 1611185029Spjd /* If the remaining range is past end of file, we're done */ 1612185029Spjd if ((off >> blkshift) > dn->dn_maxblkid) 1613185029Spjd goto out; 1614168404Spjd 1615185029Spjd ASSERT(ISP2(blksz)); 1616185029Spjd if (trunc) 1617185029Spjd tail = 0; 1618185029Spjd else 1619185029Spjd tail = P2PHASE(len, blksz); 1620168404Spjd 1621240415Smm ASSERT0(P2PHASE(off, blksz)); 1622185029Spjd /* zero out any partial block data at the end of the range */ 1623185029Spjd if (tail) { 1624185029Spjd if (len < tail) 1625185029Spjd tail = len; 1626288571Smav if (dbuf_hold_impl(dn, 0, dbuf_whichblock(dn, 0, off+len), 1627288571Smav TRUE, FALSE, FTAG, &db) == 0) { 1628185029Spjd /* don't dirty if not on disk and not dirty */ 1629185029Spjd if (db->db_last_dirty || 1630185029Spjd (db->db_blkptr && !BP_IS_HOLE(db->db_blkptr))) { 1631185029Spjd rw_exit(&dn->dn_struct_rwlock); 1632263397Sdelphij dmu_buf_will_dirty(&db->db, tx); 1633185029Spjd rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 1634185029Spjd bzero(db->db.db_data, tail); 1635168404Spjd } 1636185029Spjd dbuf_rele(db, FTAG); 1637168404Spjd } 1638185029Spjd len -= tail; 1639185029Spjd } 1640168404Spjd 1641185029Spjd /* If the range did not include a full block, we are done */ 1642185029Spjd if (len == 0) 1643185029Spjd goto out; 1644185029Spjd 1645185029Spjd ASSERT(IS_P2ALIGNED(off, blksz)); 1646185029Spjd ASSERT(trunc || IS_P2ALIGNED(len, blksz)); 1647185029Spjd blkid = off >> blkshift; 1648185029Spjd nblks = len >> blkshift; 1649185029Spjd if (trunc) 1650185029Spjd nblks += 1; 1651185029Spjd 1652185029Spjd /* 1653285202Savg * Dirty all the indirect blocks in this range. Note that only 1654285202Savg * the first and last indirect blocks can actually be written 1655285202Savg * (if they were partially freed) -- they must be dirtied, even if 1656285202Savg * they do not exist on disk yet. The interior blocks will 1657285202Savg * be freed by free_children(), so they will not actually be written. 1658285202Savg * Even though these interior blocks will not be written, we 1659285202Savg * dirty them for two reasons: 1660285202Savg * 1661285202Savg * - It ensures that the indirect blocks remain in memory until 1662285202Savg * syncing context. (They have already been prefetched by 1663285202Savg * dmu_tx_hold_free(), so we don't have to worry about reading 1664285202Savg * them serially here.) 1665285202Savg * 1666285202Savg * - The dirty space accounting will put pressure on the txg sync 1667285202Savg * mechanism to begin syncing, and to delay transactions if there 1668285202Savg * is a large amount of freeing. Even though these indirect 1669285202Savg * blocks will not be written, we could need to write the same 1670285202Savg * amount of space if we copy the freed BPs into deadlists. 1671185029Spjd */ 1672185029Spjd if (dn->dn_nlevels > 1) { 1673263397Sdelphij uint64_t first, last; 1674185029Spjd 1675185029Spjd first = blkid >> epbs; 1676285202Savg dnode_dirty_l1(dn, first, tx); 1677185029Spjd if (trunc) 1678185029Spjd last = dn->dn_maxblkid >> epbs; 1679185029Spjd else 1680185029Spjd last = (blkid + nblks - 1) >> epbs; 1681285202Savg if (last != first) 1682285202Savg dnode_dirty_l1(dn, last, tx); 1683285202Savg 1684285202Savg int shift = dn->dn_datablkshift + dn->dn_indblkshift - 1685285202Savg SPA_BLKPTRSHIFT; 1686285202Savg for (uint64_t i = first + 1; i < last; i++) { 1687285202Savg /* 1688285202Savg * Set i to the blockid of the next non-hole 1689285202Savg * level-1 indirect block at or after i. Note 1690285202Savg * that dnode_next_offset() operates in terms of 1691285202Savg * level-0-equivalent bytes. 1692285202Savg */ 1693285202Savg uint64_t ibyte = i << shift; 1694285202Savg int err = dnode_next_offset(dn, DNODE_FIND_HAVELOCK, 1695285202Savg &ibyte, 2, 1, 0); 1696285202Savg i = ibyte >> shift; 1697285202Savg if (i >= last) 1698285202Savg break; 1699285202Savg 1700285202Savg /* 1701285202Savg * Normally we should not see an error, either 1702285202Savg * from dnode_next_offset() or dbuf_hold_level() 1703285202Savg * (except for ESRCH from dnode_next_offset). 1704285202Savg * If there is an i/o error, then when we read 1705285202Savg * this block in syncing context, it will use 1706285202Savg * ZIO_FLAG_MUSTSUCCEED, and thus hang/panic according 1707285202Savg * to the "failmode" property. dnode_next_offset() 1708285202Savg * doesn't have a flag to indicate MUSTSUCCEED. 1709285202Savg */ 1710285202Savg if (err != 0) 1711285202Savg break; 1712285202Savg 1713285202Savg dnode_dirty_l1(dn, i, tx); 1714168404Spjd } 1715263397Sdelphij } 1716168404Spjd 1717185029Spjddone: 1718185029Spjd /* 1719185029Spjd * Add this range to the dnode range list. 1720185029Spjd * We will finish up this free operation in the syncing phase. 1721185029Spjd */ 1722168404Spjd mutex_enter(&dn->dn_mtx); 1723265740Sdelphij int txgoff = tx->tx_txg & TXG_MASK; 1724265740Sdelphij if (dn->dn_free_ranges[txgoff] == NULL) { 1725265740Sdelphij dn->dn_free_ranges[txgoff] = 1726265740Sdelphij range_tree_create(NULL, NULL, &dn->dn_mtx); 1727168404Spjd } 1728265740Sdelphij range_tree_clear(dn->dn_free_ranges[txgoff], blkid, nblks); 1729265740Sdelphij range_tree_add(dn->dn_free_ranges[txgoff], blkid, nblks); 1730265740Sdelphij dprintf_dnode(dn, "blkid=%llu nblks=%llu txg=%llu\n", 1731265740Sdelphij blkid, nblks, tx->tx_txg); 1732168404Spjd mutex_exit(&dn->dn_mtx); 1733168404Spjd 1734185029Spjd dbuf_free_range(dn, blkid, blkid + nblks - 1, tx); 1735168404Spjd dnode_setdirty(dn, tx); 1736168404Spjdout: 1737185029Spjd 1738168404Spjd rw_exit(&dn->dn_struct_rwlock); 1739168404Spjd} 1740168404Spjd 1741219089Spjdstatic boolean_t 1742219089Spjddnode_spill_freed(dnode_t *dn) 1743219089Spjd{ 1744219089Spjd int i; 1745219089Spjd 1746219089Spjd mutex_enter(&dn->dn_mtx); 1747219089Spjd for (i = 0; i < TXG_SIZE; i++) { 1748219089Spjd if (dn->dn_rm_spillblk[i] == DN_KILL_SPILLBLK) 1749219089Spjd break; 1750219089Spjd } 1751219089Spjd mutex_exit(&dn->dn_mtx); 1752219089Spjd return (i < TXG_SIZE); 1753219089Spjd} 1754219089Spjd 1755168404Spjd/* return TRUE if this blkid was freed in a recent txg, or FALSE if it wasn't */ 1756168404Spjduint64_t 1757168404Spjddnode_block_freed(dnode_t *dn, uint64_t blkid) 1758168404Spjd{ 1759168404Spjd void *dp = spa_get_dsl(dn->dn_objset->os_spa); 1760168404Spjd int i; 1761168404Spjd 1762219089Spjd if (blkid == DMU_BONUS_BLKID) 1763168404Spjd return (FALSE); 1764168404Spjd 1765168404Spjd /* 1766168404Spjd * If we're in the process of opening the pool, dp will not be 1767168404Spjd * set yet, but there shouldn't be anything dirty. 1768168404Spjd */ 1769168404Spjd if (dp == NULL) 1770168404Spjd return (FALSE); 1771168404Spjd 1772168404Spjd if (dn->dn_free_txg) 1773168404Spjd return (TRUE); 1774168404Spjd 1775219089Spjd if (blkid == DMU_SPILL_BLKID) 1776219089Spjd return (dnode_spill_freed(dn)); 1777219089Spjd 1778168404Spjd mutex_enter(&dn->dn_mtx); 1779168404Spjd for (i = 0; i < TXG_SIZE; i++) { 1780265740Sdelphij if (dn->dn_free_ranges[i] != NULL && 1781265740Sdelphij range_tree_contains(dn->dn_free_ranges[i], blkid, 1)) 1782168404Spjd break; 1783168404Spjd } 1784168404Spjd mutex_exit(&dn->dn_mtx); 1785168404Spjd return (i < TXG_SIZE); 1786168404Spjd} 1787168404Spjd 1788168404Spjd/* call from syncing context when we actually write/free space for this dnode */ 1789168404Spjdvoid 1790168404Spjddnode_diduse_space(dnode_t *dn, int64_t delta) 1791168404Spjd{ 1792168404Spjd uint64_t space; 1793168404Spjd dprintf_dnode(dn, "dn=%p dnp=%p used=%llu delta=%lld\n", 1794168404Spjd dn, dn->dn_phys, 1795168404Spjd (u_longlong_t)dn->dn_phys->dn_used, 1796168404Spjd (longlong_t)delta); 1797168404Spjd 1798168404Spjd mutex_enter(&dn->dn_mtx); 1799168404Spjd space = DN_USED_BYTES(dn->dn_phys); 1800168404Spjd if (delta > 0) { 1801168404Spjd ASSERT3U(space + delta, >=, space); /* no overflow */ 1802168404Spjd } else { 1803168404Spjd ASSERT3U(space, >=, -delta); /* no underflow */ 1804168404Spjd } 1805168404Spjd space += delta; 1806185029Spjd if (spa_version(dn->dn_objset->os_spa) < SPA_VERSION_DNODE_BYTES) { 1807168404Spjd ASSERT((dn->dn_phys->dn_flags & DNODE_FLAG_USED_BYTES) == 0); 1808240415Smm ASSERT0(P2PHASE(space, 1<<DEV_BSHIFT)); 1809168404Spjd dn->dn_phys->dn_used = space >> DEV_BSHIFT; 1810168404Spjd } else { 1811168404Spjd dn->dn_phys->dn_used = space; 1812168404Spjd dn->dn_phys->dn_flags |= DNODE_FLAG_USED_BYTES; 1813168404Spjd } 1814168404Spjd mutex_exit(&dn->dn_mtx); 1815168404Spjd} 1816168404Spjd 1817168404Spjd/* 1818260763Savg * Call when we think we're going to write/free space in open context to track 1819260763Savg * the amount of memory in use by the currently open txg. 1820168404Spjd */ 1821168404Spjdvoid 1822168404Spjddnode_willuse_space(dnode_t *dn, int64_t space, dmu_tx_t *tx) 1823168404Spjd{ 1824219089Spjd objset_t *os = dn->dn_objset; 1825168404Spjd dsl_dataset_t *ds = os->os_dsl_dataset; 1826260763Savg int64_t aspace = spa_get_asize(os->os_spa, space); 1827168404Spjd 1828260763Savg if (ds != NULL) { 1829260763Savg dsl_dir_willuse_space(ds->ds_dir, aspace, tx); 1830260763Savg dsl_pool_dirty_space(dmu_tx_pool(tx), space, tx); 1831260763Savg } 1832168404Spjd 1833260763Savg dmu_tx_willuse_space(tx, aspace); 1834168404Spjd} 1835168404Spjd 1836208775Smm/* 1837251631Sdelphij * Scans a block at the indicated "level" looking for a hole or data, 1838251631Sdelphij * depending on 'flags'. 1839208775Smm * 1840251631Sdelphij * If level > 0, then we are scanning an indirect block looking at its 1841251631Sdelphij * pointers. If level == 0, then we are looking at a block of dnodes. 1842251631Sdelphij * 1843251631Sdelphij * If we don't find what we are looking for in the block, we return ESRCH. 1844251631Sdelphij * Otherwise, return with *offset pointing to the beginning (if searching 1845251631Sdelphij * forwards) or end (if searching backwards) of the range covered by the 1846251631Sdelphij * block pointer we matched on (or dnode). 1847251631Sdelphij * 1848208775Smm * The basic search algorithm used below by dnode_next_offset() is to 1849208775Smm * use this function to search up the block tree (widen the search) until 1850208775Smm * we find something (i.e., we don't return ESRCH) and then search back 1851208775Smm * down the tree (narrow the search) until we reach our original search 1852208775Smm * level. 1853208775Smm */ 1854168404Spjdstatic int 1855185029Spjddnode_next_offset_level(dnode_t *dn, int flags, uint64_t *offset, 1856288571Smav int lvl, uint64_t blkfill, uint64_t txg) 1857168404Spjd{ 1858168404Spjd dmu_buf_impl_t *db = NULL; 1859168404Spjd void *data = NULL; 1860168404Spjd uint64_t epbs = dn->dn_phys->dn_indblkshift - SPA_BLKPTRSHIFT; 1861168404Spjd uint64_t epb = 1ULL << epbs; 1862168404Spjd uint64_t minfill, maxfill; 1863185029Spjd boolean_t hole; 1864185029Spjd int i, inc, error, span; 1865168404Spjd 1866168404Spjd dprintf("probing object %llu offset %llx level %d of %u\n", 1867168404Spjd dn->dn_object, *offset, lvl, dn->dn_phys->dn_nlevels); 1868168404Spjd 1869209962Smm hole = ((flags & DNODE_FIND_HOLE) != 0); 1870185029Spjd inc = (flags & DNODE_FIND_BACKWARDS) ? -1 : 1; 1871185029Spjd ASSERT(txg == 0 || !hole); 1872185029Spjd 1873168404Spjd if (lvl == dn->dn_phys->dn_nlevels) { 1874168404Spjd error = 0; 1875168404Spjd epb = dn->dn_phys->dn_nblkptr; 1876168404Spjd data = dn->dn_phys->dn_blkptr; 1877168404Spjd } else { 1878288571Smav uint64_t blkid = dbuf_whichblock(dn, lvl, *offset); 1879288571Smav error = dbuf_hold_impl(dn, lvl, blkid, TRUE, FALSE, FTAG, &db); 1880168404Spjd if (error) { 1881185029Spjd if (error != ENOENT) 1882185029Spjd return (error); 1883185029Spjd if (hole) 1884185029Spjd return (0); 1885185029Spjd /* 1886185029Spjd * This can only happen when we are searching up 1887185029Spjd * the block tree for data. We don't really need to 1888185029Spjd * adjust the offset, as we will just end up looking 1889185029Spjd * at the pointer to this block in its parent, and its 1890185029Spjd * going to be unallocated, so we will skip over it. 1891185029Spjd */ 1892249195Smm return (SET_ERROR(ESRCH)); 1893168404Spjd } 1894168404Spjd error = dbuf_read(db, NULL, DB_RF_CANFAIL | DB_RF_HAVESTRUCT); 1895168404Spjd if (error) { 1896168404Spjd dbuf_rele(db, FTAG); 1897168404Spjd return (error); 1898168404Spjd } 1899168404Spjd data = db->db.db_data; 1900168404Spjd } 1901168404Spjd 1902263397Sdelphij 1903263397Sdelphij if (db != NULL && txg != 0 && (db->db_blkptr == NULL || 1904263397Sdelphij db->db_blkptr->blk_birth <= txg || 1905263397Sdelphij BP_IS_HOLE(db->db_blkptr))) { 1906185029Spjd /* 1907185029Spjd * This can only happen when we are searching up the tree 1908185029Spjd * and these conditions mean that we need to keep climbing. 1909185029Spjd */ 1910249195Smm error = SET_ERROR(ESRCH); 1911168404Spjd } else if (lvl == 0) { 1912168404Spjd dnode_phys_t *dnp = data; 1913168404Spjd span = DNODE_SHIFT; 1914168404Spjd ASSERT(dn->dn_type == DMU_OT_DNODE); 1915168404Spjd 1916185029Spjd for (i = (*offset >> span) & (blkfill - 1); 1917185029Spjd i >= 0 && i < blkfill; i += inc) { 1918209094Smm if ((dnp[i].dn_type == DMU_OT_NONE) == hole) 1919168404Spjd break; 1920185029Spjd *offset += (1ULL << span) * inc; 1921168404Spjd } 1922185029Spjd if (i < 0 || i == blkfill) 1923249195Smm error = SET_ERROR(ESRCH); 1924168404Spjd } else { 1925168404Spjd blkptr_t *bp = data; 1926208775Smm uint64_t start = *offset; 1927168404Spjd span = (lvl - 1) * epbs + dn->dn_datablkshift; 1928168404Spjd minfill = 0; 1929168404Spjd maxfill = blkfill << ((lvl - 1) * epbs); 1930168404Spjd 1931168404Spjd if (hole) 1932168404Spjd maxfill--; 1933168404Spjd else 1934168404Spjd minfill++; 1935168404Spjd 1936208775Smm *offset = *offset >> span; 1937208775Smm for (i = BF64_GET(*offset, 0, epbs); 1938185029Spjd i >= 0 && i < epb; i += inc) { 1939268649Sdelphij if (BP_GET_FILL(&bp[i]) >= minfill && 1940268649Sdelphij BP_GET_FILL(&bp[i]) <= maxfill && 1941185029Spjd (hole || bp[i].blk_birth > txg)) 1942168404Spjd break; 1943208775Smm if (inc > 0 || *offset > 0) 1944208775Smm *offset += inc; 1945168404Spjd } 1946208775Smm *offset = *offset << span; 1947208775Smm if (inc < 0) { 1948208775Smm /* traversing backwards; position offset at the end */ 1949208775Smm ASSERT3U(*offset, <=, start); 1950208775Smm *offset = MIN(*offset + (1ULL << span) - 1, start); 1951208775Smm } else if (*offset < start) { 1952208775Smm *offset = start; 1953208775Smm } 1954208775Smm if (i < 0 || i >= epb) 1955249195Smm error = SET_ERROR(ESRCH); 1956168404Spjd } 1957168404Spjd 1958168404Spjd if (db) 1959168404Spjd dbuf_rele(db, FTAG); 1960168404Spjd 1961168404Spjd return (error); 1962168404Spjd} 1963168404Spjd 1964168404Spjd/* 1965168404Spjd * Find the next hole, data, or sparse region at or after *offset. 1966168404Spjd * The value 'blkfill' tells us how many items we expect to find 1967168404Spjd * in an L0 data block; this value is 1 for normal objects, 1968168404Spjd * DNODES_PER_BLOCK for the meta dnode, and some fraction of 1969168404Spjd * DNODES_PER_BLOCK when searching for sparse regions thereof. 1970168404Spjd * 1971168404Spjd * Examples: 1972168404Spjd * 1973185029Spjd * dnode_next_offset(dn, flags, offset, 1, 1, 0); 1974185029Spjd * Finds the next/previous hole/data in a file. 1975168404Spjd * Used in dmu_offset_next(). 1976168404Spjd * 1977185029Spjd * dnode_next_offset(mdn, flags, offset, 0, DNODES_PER_BLOCK, txg); 1978168404Spjd * Finds the next free/allocated dnode an objset's meta-dnode. 1979168404Spjd * Only finds objects that have new contents since txg (ie. 1980168404Spjd * bonus buffer changes and content removal are ignored). 1981168404Spjd * Used in dmu_object_next(). 1982168404Spjd * 1983185029Spjd * dnode_next_offset(mdn, DNODE_FIND_HOLE, offset, 2, DNODES_PER_BLOCK >> 2, 0); 1984168404Spjd * Finds the next L2 meta-dnode bp that's at most 1/4 full. 1985168404Spjd * Used in dmu_object_alloc(). 1986168404Spjd */ 1987168404Spjdint 1988185029Spjddnode_next_offset(dnode_t *dn, int flags, uint64_t *offset, 1989168404Spjd int minlvl, uint64_t blkfill, uint64_t txg) 1990168404Spjd{ 1991185029Spjd uint64_t initial_offset = *offset; 1992168404Spjd int lvl, maxlvl; 1993168404Spjd int error = 0; 1994168404Spjd 1995185029Spjd if (!(flags & DNODE_FIND_HAVELOCK)) 1996185029Spjd rw_enter(&dn->dn_struct_rwlock, RW_READER); 1997168404Spjd 1998168404Spjd if (dn->dn_phys->dn_nlevels == 0) { 1999249195Smm error = SET_ERROR(ESRCH); 2000185029Spjd goto out; 2001168404Spjd } 2002168404Spjd 2003168404Spjd if (dn->dn_datablkshift == 0) { 2004168404Spjd if (*offset < dn->dn_datablksz) { 2005185029Spjd if (flags & DNODE_FIND_HOLE) 2006168404Spjd *offset = dn->dn_datablksz; 2007168404Spjd } else { 2008249195Smm error = SET_ERROR(ESRCH); 2009168404Spjd } 2010185029Spjd goto out; 2011168404Spjd } 2012168404Spjd 2013168404Spjd maxlvl = dn->dn_phys->dn_nlevels; 2014168404Spjd 2015168404Spjd for (lvl = minlvl; lvl <= maxlvl; lvl++) { 2016168404Spjd error = dnode_next_offset_level(dn, 2017185029Spjd flags, offset, lvl, blkfill, txg); 2018168404Spjd if (error != ESRCH) 2019168404Spjd break; 2020168404Spjd } 2021168404Spjd 2022185029Spjd while (error == 0 && --lvl >= minlvl) { 2023168404Spjd error = dnode_next_offset_level(dn, 2024185029Spjd flags, offset, lvl, blkfill, txg); 2025168404Spjd } 2026168404Spjd 2027272134Sdelphij /* 2028272134Sdelphij * There's always a "virtual hole" at the end of the object, even 2029272134Sdelphij * if all BP's which physically exist are non-holes. 2030272134Sdelphij */ 2031272134Sdelphij if ((flags & DNODE_FIND_HOLE) && error == ESRCH && txg == 0 && 2032272134Sdelphij minlvl == 1 && blkfill == 1 && !(flags & DNODE_FIND_BACKWARDS)) { 2033272134Sdelphij error = 0; 2034272134Sdelphij } 2035272134Sdelphij 2036185029Spjd if (error == 0 && (flags & DNODE_FIND_BACKWARDS ? 2037185029Spjd initial_offset < *offset : initial_offset > *offset)) 2038249195Smm error = SET_ERROR(ESRCH); 2039185029Spjdout: 2040185029Spjd if (!(flags & DNODE_FIND_HAVELOCK)) 2041185029Spjd rw_exit(&dn->dn_struct_rwlock); 2042168404Spjd 2043168404Spjd return (error); 2044168404Spjd} 2045