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. 25168404Spjd */ 26168404Spjd 27168404Spjd#include <sys/zfs_context.h> 28168404Spjd#include <sys/dbuf.h> 29168404Spjd#include <sys/dnode.h> 30168404Spjd#include <sys/dmu.h> 31168404Spjd#include <sys/dmu_impl.h> 32168404Spjd#include <sys/dmu_tx.h> 33168404Spjd#include <sys/dmu_objset.h> 34168404Spjd#include <sys/dsl_dir.h> 35168404Spjd#include <sys/dsl_dataset.h> 36168404Spjd#include <sys/spa.h> 37168404Spjd#include <sys/zio.h> 38168404Spjd#include <sys/dmu_zfetch.h> 39265740Sdelphij#include <sys/range_tree.h> 40168404Spjd 41168404Spjdstatic kmem_cache_t *dnode_cache; 42219089Spjd/* 43219089Spjd * Define DNODE_STATS to turn on statistic gathering. By default, it is only 44219089Spjd * turned on when DEBUG is also defined. 45219089Spjd */ 46219089Spjd#ifdef DEBUG 47219089Spjd#define DNODE_STATS 48219089Spjd#endif /* DEBUG */ 49168404Spjd 50219089Spjd#ifdef DNODE_STATS 51219089Spjd#define DNODE_STAT_ADD(stat) ((stat)++) 52219089Spjd#else 53219089Spjd#define DNODE_STAT_ADD(stat) /* nothing */ 54219089Spjd#endif /* DNODE_STATS */ 55219089Spjd 56168404Spjdstatic dnode_phys_t dnode_phys_zero; 57168404Spjd 58168404Spjdint zfs_default_bs = SPA_MINBLOCKSHIFT; 59168404Spjdint zfs_default_ibs = DN_MAX_INDBLKSHIFT; 60168404Spjd 61219089Spjd#ifdef sun 62219089Spjdstatic kmem_cbrc_t dnode_move(void *, void *, size_t, void *); 63219089Spjd#endif 64219089Spjd 65269845Sdelphijstatic int 66269845Sdelphijdbuf_compare(const void *x1, const void *x2) 67269845Sdelphij{ 68269845Sdelphij const dmu_buf_impl_t *d1 = x1; 69269845Sdelphij const dmu_buf_impl_t *d2 = x2; 70269845Sdelphij 71269845Sdelphij if (d1->db_level < d2->db_level) { 72269845Sdelphij return (-1); 73270809Sdelphij } 74270809Sdelphij if (d1->db_level > d2->db_level) { 75269845Sdelphij return (1); 76269845Sdelphij } 77269845Sdelphij 78269845Sdelphij if (d1->db_blkid < d2->db_blkid) { 79269845Sdelphij return (-1); 80270809Sdelphij } 81270809Sdelphij if (d1->db_blkid > d2->db_blkid) { 82269845Sdelphij return (1); 83269845Sdelphij } 84269845Sdelphij 85277588Sdelphij if (d1->db_state == DB_SEARCH) { 86277588Sdelphij ASSERT3S(d2->db_state, !=, DB_SEARCH); 87269845Sdelphij return (-1); 88277588Sdelphij } else if (d2->db_state == DB_SEARCH) { 89277588Sdelphij ASSERT3S(d1->db_state, !=, DB_SEARCH); 90269845Sdelphij return (1); 91269845Sdelphij } 92270809Sdelphij 93270809Sdelphij if ((uintptr_t)d1 < (uintptr_t)d2) { 94270809Sdelphij return (-1); 95270809Sdelphij } 96270809Sdelphij if ((uintptr_t)d1 > (uintptr_t)d2) { 97270809Sdelphij return (1); 98270809Sdelphij } 99270809Sdelphij return (0); 100269845Sdelphij} 101269845Sdelphij 102168404Spjd/* ARGSUSED */ 103168404Spjdstatic int 104168404Spjddnode_cons(void *arg, void *unused, int kmflag) 105168404Spjd{ 106219089Spjd dnode_t *dn = arg; 107168404Spjd int i; 108168404Spjd 109168404Spjd rw_init(&dn->dn_struct_rwlock, NULL, RW_DEFAULT, NULL); 110168404Spjd mutex_init(&dn->dn_mtx, NULL, MUTEX_DEFAULT, NULL); 111168404Spjd mutex_init(&dn->dn_dbufs_mtx, NULL, MUTEX_DEFAULT, NULL); 112208372Smm cv_init(&dn->dn_notxholds, NULL, CV_DEFAULT, NULL); 113208372Smm 114248571Smm /* 115248571Smm * Every dbuf has a reference, and dropping a tracked reference is 116248571Smm * O(number of references), so don't track dn_holds. 117248571Smm */ 118248571Smm refcount_create_untracked(&dn->dn_holds); 119168404Spjd refcount_create(&dn->dn_tx_holds); 120219089Spjd list_link_init(&dn->dn_link); 121168404Spjd 122219089Spjd bzero(&dn->dn_next_nblkptr[0], sizeof (dn->dn_next_nblkptr)); 123219089Spjd bzero(&dn->dn_next_nlevels[0], sizeof (dn->dn_next_nlevels)); 124219089Spjd bzero(&dn->dn_next_indblkshift[0], sizeof (dn->dn_next_indblkshift)); 125219089Spjd bzero(&dn->dn_next_bonustype[0], sizeof (dn->dn_next_bonustype)); 126219089Spjd bzero(&dn->dn_rm_spillblk[0], sizeof (dn->dn_rm_spillblk)); 127219089Spjd bzero(&dn->dn_next_bonuslen[0], sizeof (dn->dn_next_bonuslen)); 128219089Spjd bzero(&dn->dn_next_blksz[0], sizeof (dn->dn_next_blksz)); 129219089Spjd 130168404Spjd for (i = 0; i < TXG_SIZE; i++) { 131219089Spjd list_link_init(&dn->dn_dirty_link[i]); 132265740Sdelphij dn->dn_free_ranges[i] = NULL; 133168404Spjd list_create(&dn->dn_dirty_records[i], 134168404Spjd sizeof (dbuf_dirty_record_t), 135168404Spjd offsetof(dbuf_dirty_record_t, dr_dirty_node)); 136168404Spjd } 137168404Spjd 138219089Spjd dn->dn_allocated_txg = 0; 139219089Spjd dn->dn_free_txg = 0; 140219089Spjd dn->dn_assigned_txg = 0; 141219089Spjd dn->dn_dirtyctx = 0; 142219089Spjd dn->dn_dirtyctx_firstset = NULL; 143219089Spjd dn->dn_bonus = NULL; 144219089Spjd dn->dn_have_spill = B_FALSE; 145219089Spjd dn->dn_zio = NULL; 146219089Spjd dn->dn_oldused = 0; 147219089Spjd dn->dn_oldflags = 0; 148219089Spjd dn->dn_olduid = 0; 149219089Spjd dn->dn_oldgid = 0; 150219089Spjd dn->dn_newuid = 0; 151219089Spjd dn->dn_newgid = 0; 152219089Spjd dn->dn_id_flags = 0; 153219089Spjd 154219089Spjd dn->dn_dbufs_count = 0; 155254753Sdelphij dn->dn_unlisted_l0_blkid = 0; 156269845Sdelphij avl_create(&dn->dn_dbufs, dbuf_compare, sizeof (dmu_buf_impl_t), 157168404Spjd offsetof(dmu_buf_impl_t, db_link)); 158168404Spjd 159219089Spjd dn->dn_moved = 0; 160219089Spjd POINTER_INVALIDATE(&dn->dn_objset); 161168404Spjd return (0); 162168404Spjd} 163168404Spjd 164168404Spjd/* ARGSUSED */ 165168404Spjdstatic void 166168404Spjddnode_dest(void *arg, void *unused) 167168404Spjd{ 168168404Spjd int i; 169168404Spjd dnode_t *dn = arg; 170168404Spjd 171168404Spjd rw_destroy(&dn->dn_struct_rwlock); 172168404Spjd mutex_destroy(&dn->dn_mtx); 173168404Spjd mutex_destroy(&dn->dn_dbufs_mtx); 174208372Smm cv_destroy(&dn->dn_notxholds); 175168404Spjd refcount_destroy(&dn->dn_holds); 176168404Spjd refcount_destroy(&dn->dn_tx_holds); 177219089Spjd ASSERT(!list_link_active(&dn->dn_link)); 178168404Spjd 179168404Spjd for (i = 0; i < TXG_SIZE; i++) { 180219089Spjd ASSERT(!list_link_active(&dn->dn_dirty_link[i])); 181265740Sdelphij ASSERT3P(dn->dn_free_ranges[i], ==, NULL); 182168404Spjd list_destroy(&dn->dn_dirty_records[i]); 183240415Smm ASSERT0(dn->dn_next_nblkptr[i]); 184240415Smm ASSERT0(dn->dn_next_nlevels[i]); 185240415Smm ASSERT0(dn->dn_next_indblkshift[i]); 186240415Smm ASSERT0(dn->dn_next_bonustype[i]); 187240415Smm ASSERT0(dn->dn_rm_spillblk[i]); 188240415Smm ASSERT0(dn->dn_next_bonuslen[i]); 189240415Smm ASSERT0(dn->dn_next_blksz[i]); 190168404Spjd } 191168404Spjd 192240415Smm ASSERT0(dn->dn_allocated_txg); 193240415Smm ASSERT0(dn->dn_free_txg); 194240415Smm ASSERT0(dn->dn_assigned_txg); 195240415Smm ASSERT0(dn->dn_dirtyctx); 196219089Spjd ASSERT3P(dn->dn_dirtyctx_firstset, ==, NULL); 197219089Spjd ASSERT3P(dn->dn_bonus, ==, NULL); 198219089Spjd ASSERT(!dn->dn_have_spill); 199219089Spjd ASSERT3P(dn->dn_zio, ==, NULL); 200240415Smm ASSERT0(dn->dn_oldused); 201240415Smm ASSERT0(dn->dn_oldflags); 202240415Smm ASSERT0(dn->dn_olduid); 203240415Smm ASSERT0(dn->dn_oldgid); 204240415Smm ASSERT0(dn->dn_newuid); 205240415Smm ASSERT0(dn->dn_newgid); 206240415Smm ASSERT0(dn->dn_id_flags); 207219089Spjd 208240415Smm ASSERT0(dn->dn_dbufs_count); 209254753Sdelphij ASSERT0(dn->dn_unlisted_l0_blkid); 210269845Sdelphij avl_destroy(&dn->dn_dbufs); 211168404Spjd} 212168404Spjd 213168404Spjdvoid 214168404Spjddnode_init(void) 215168404Spjd{ 216219089Spjd ASSERT(dnode_cache == NULL); 217168404Spjd dnode_cache = kmem_cache_create("dnode_t", 218168404Spjd sizeof (dnode_t), 219168404Spjd 0, dnode_cons, dnode_dest, NULL, NULL, NULL, 0); 220219089Spjd kmem_cache_set_move(dnode_cache, dnode_move); 221168404Spjd} 222168404Spjd 223168404Spjdvoid 224168404Spjddnode_fini(void) 225168404Spjd{ 226168404Spjd kmem_cache_destroy(dnode_cache); 227219089Spjd dnode_cache = NULL; 228168404Spjd} 229168404Spjd 230168404Spjd 231168404Spjd#ifdef ZFS_DEBUG 232168404Spjdvoid 233168404Spjddnode_verify(dnode_t *dn) 234168404Spjd{ 235168404Spjd int drop_struct_lock = FALSE; 236168404Spjd 237168404Spjd ASSERT(dn->dn_phys); 238168404Spjd ASSERT(dn->dn_objset); 239219089Spjd ASSERT(dn->dn_handle->dnh_dnode == dn); 240168404Spjd 241236884Smm ASSERT(DMU_OT_IS_VALID(dn->dn_phys->dn_type)); 242168404Spjd 243168404Spjd if (!(zfs_flags & ZFS_DEBUG_DNODE_VERIFY)) 244168404Spjd return; 245168404Spjd 246168404Spjd if (!RW_WRITE_HELD(&dn->dn_struct_rwlock)) { 247168404Spjd rw_enter(&dn->dn_struct_rwlock, RW_READER); 248168404Spjd drop_struct_lock = TRUE; 249168404Spjd } 250168404Spjd if (dn->dn_phys->dn_type != DMU_OT_NONE || dn->dn_allocated_txg != 0) { 251168404Spjd int i; 252168404Spjd ASSERT3U(dn->dn_indblkshift, >=, 0); 253168404Spjd ASSERT3U(dn->dn_indblkshift, <=, SPA_MAXBLOCKSHIFT); 254168404Spjd if (dn->dn_datablkshift) { 255168404Spjd ASSERT3U(dn->dn_datablkshift, >=, SPA_MINBLOCKSHIFT); 256168404Spjd ASSERT3U(dn->dn_datablkshift, <=, SPA_MAXBLOCKSHIFT); 257168404Spjd ASSERT3U(1<<dn->dn_datablkshift, ==, dn->dn_datablksz); 258168404Spjd } 259168404Spjd ASSERT3U(dn->dn_nlevels, <=, 30); 260236884Smm ASSERT(DMU_OT_IS_VALID(dn->dn_type)); 261168404Spjd ASSERT3U(dn->dn_nblkptr, >=, 1); 262168404Spjd ASSERT3U(dn->dn_nblkptr, <=, DN_MAX_NBLKPTR); 263168404Spjd ASSERT3U(dn->dn_bonuslen, <=, DN_MAX_BONUSLEN); 264168404Spjd ASSERT3U(dn->dn_datablksz, ==, 265168404Spjd dn->dn_datablkszsec << SPA_MINBLOCKSHIFT); 266168404Spjd ASSERT3U(ISP2(dn->dn_datablksz), ==, dn->dn_datablkshift != 0); 267168404Spjd ASSERT3U((dn->dn_nblkptr - 1) * sizeof (blkptr_t) + 268168404Spjd dn->dn_bonuslen, <=, DN_MAX_BONUSLEN); 269168404Spjd for (i = 0; i < TXG_SIZE; i++) { 270168404Spjd ASSERT3U(dn->dn_next_nlevels[i], <=, dn->dn_nlevels); 271168404Spjd } 272168404Spjd } 273168404Spjd if (dn->dn_phys->dn_type != DMU_OT_NONE) 274168404Spjd ASSERT3U(dn->dn_phys->dn_nlevels, <=, dn->dn_nlevels); 275209962Smm ASSERT(DMU_OBJECT_IS_SPECIAL(dn->dn_object) || dn->dn_dbuf != NULL); 276168404Spjd if (dn->dn_dbuf != NULL) { 277168404Spjd ASSERT3P(dn->dn_phys, ==, 278168404Spjd (dnode_phys_t *)dn->dn_dbuf->db.db_data + 279168404Spjd (dn->dn_object % (dn->dn_dbuf->db.db_size >> DNODE_SHIFT))); 280168404Spjd } 281168404Spjd if (drop_struct_lock) 282168404Spjd rw_exit(&dn->dn_struct_rwlock); 283168404Spjd} 284168404Spjd#endif 285168404Spjd 286168404Spjdvoid 287168404Spjddnode_byteswap(dnode_phys_t *dnp) 288168404Spjd{ 289168404Spjd uint64_t *buf64 = (void*)&dnp->dn_blkptr; 290168404Spjd int i; 291168404Spjd 292168404Spjd if (dnp->dn_type == DMU_OT_NONE) { 293168404Spjd bzero(dnp, sizeof (dnode_phys_t)); 294168404Spjd return; 295168404Spjd } 296168404Spjd 297168404Spjd dnp->dn_datablkszsec = BSWAP_16(dnp->dn_datablkszsec); 298168404Spjd dnp->dn_bonuslen = BSWAP_16(dnp->dn_bonuslen); 299168404Spjd dnp->dn_maxblkid = BSWAP_64(dnp->dn_maxblkid); 300168404Spjd dnp->dn_used = BSWAP_64(dnp->dn_used); 301168404Spjd 302168404Spjd /* 303168404Spjd * dn_nblkptr is only one byte, so it's OK to read it in either 304168404Spjd * byte order. We can't read dn_bouslen. 305168404Spjd */ 306168404Spjd ASSERT(dnp->dn_indblkshift <= SPA_MAXBLOCKSHIFT); 307168404Spjd ASSERT(dnp->dn_nblkptr <= DN_MAX_NBLKPTR); 308168404Spjd for (i = 0; i < dnp->dn_nblkptr * sizeof (blkptr_t)/8; i++) 309168404Spjd buf64[i] = BSWAP_64(buf64[i]); 310168404Spjd 311168404Spjd /* 312168404Spjd * OK to check dn_bonuslen for zero, because it won't matter if 313168404Spjd * we have the wrong byte order. This is necessary because the 314168404Spjd * dnode dnode is smaller than a regular dnode. 315168404Spjd */ 316168404Spjd if (dnp->dn_bonuslen != 0) { 317168404Spjd /* 318168404Spjd * Note that the bonus length calculated here may be 319168404Spjd * longer than the actual bonus buffer. This is because 320168404Spjd * we always put the bonus buffer after the last block 321168404Spjd * pointer (instead of packing it against the end of the 322168404Spjd * dnode buffer). 323168404Spjd */ 324168404Spjd int off = (dnp->dn_nblkptr-1) * sizeof (blkptr_t); 325168404Spjd size_t len = DN_MAX_BONUSLEN - off; 326236884Smm ASSERT(DMU_OT_IS_VALID(dnp->dn_bonustype)); 327236884Smm dmu_object_byteswap_t byteswap = 328236884Smm DMU_OT_BYTESWAP(dnp->dn_bonustype); 329236884Smm dmu_ot_byteswap[byteswap].ob_func(dnp->dn_bonus + off, len); 330168404Spjd } 331219089Spjd 332219089Spjd /* Swap SPILL block if we have one */ 333219089Spjd if (dnp->dn_flags & DNODE_FLAG_SPILL_BLKPTR) 334219089Spjd byteswap_uint64_array(&dnp->dn_spill, sizeof (blkptr_t)); 335219089Spjd 336168404Spjd} 337168404Spjd 338168404Spjdvoid 339168404Spjddnode_buf_byteswap(void *vbuf, size_t size) 340168404Spjd{ 341168404Spjd dnode_phys_t *buf = vbuf; 342168404Spjd int i; 343168404Spjd 344168404Spjd ASSERT3U(sizeof (dnode_phys_t), ==, (1<<DNODE_SHIFT)); 345168404Spjd ASSERT((size & (sizeof (dnode_phys_t)-1)) == 0); 346168404Spjd 347168404Spjd size >>= DNODE_SHIFT; 348168404Spjd for (i = 0; i < size; i++) { 349168404Spjd dnode_byteswap(buf); 350168404Spjd buf++; 351168404Spjd } 352168404Spjd} 353168404Spjd 354185029Spjdvoid 355185029Spjddnode_setbonuslen(dnode_t *dn, int newsize, dmu_tx_t *tx) 356185029Spjd{ 357185029Spjd ASSERT3U(refcount_count(&dn->dn_holds), >=, 1); 358185029Spjd 359185029Spjd dnode_setdirty(dn, tx); 360185029Spjd rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 361185029Spjd ASSERT3U(newsize, <=, DN_MAX_BONUSLEN - 362185029Spjd (dn->dn_nblkptr-1) * sizeof (blkptr_t)); 363185029Spjd dn->dn_bonuslen = newsize; 364185029Spjd if (newsize == 0) 365185029Spjd dn->dn_next_bonuslen[tx->tx_txg & TXG_MASK] = DN_ZERO_BONUSLEN; 366185029Spjd else 367185029Spjd dn->dn_next_bonuslen[tx->tx_txg & TXG_MASK] = dn->dn_bonuslen; 368185029Spjd rw_exit(&dn->dn_struct_rwlock); 369185029Spjd} 370185029Spjd 371219089Spjdvoid 372219089Spjddnode_setbonus_type(dnode_t *dn, dmu_object_type_t newtype, dmu_tx_t *tx) 373219089Spjd{ 374219089Spjd ASSERT3U(refcount_count(&dn->dn_holds), >=, 1); 375219089Spjd dnode_setdirty(dn, tx); 376219089Spjd rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 377219089Spjd dn->dn_bonustype = newtype; 378219089Spjd dn->dn_next_bonustype[tx->tx_txg & TXG_MASK] = dn->dn_bonustype; 379219089Spjd rw_exit(&dn->dn_struct_rwlock); 380219089Spjd} 381219089Spjd 382219089Spjdvoid 383219089Spjddnode_rm_spill(dnode_t *dn, dmu_tx_t *tx) 384219089Spjd{ 385219089Spjd ASSERT3U(refcount_count(&dn->dn_holds), >=, 1); 386219089Spjd ASSERT(RW_WRITE_HELD(&dn->dn_struct_rwlock)); 387219089Spjd dnode_setdirty(dn, tx); 388219089Spjd dn->dn_rm_spillblk[tx->tx_txg&TXG_MASK] = DN_KILL_SPILLBLK; 389219089Spjd dn->dn_have_spill = B_FALSE; 390219089Spjd} 391219089Spjd 392168404Spjdstatic void 393168404Spjddnode_setdblksz(dnode_t *dn, int size) 394168404Spjd{ 395240415Smm ASSERT0(P2PHASE(size, SPA_MINBLOCKSIZE)); 396168404Spjd ASSERT3U(size, <=, SPA_MAXBLOCKSIZE); 397168404Spjd ASSERT3U(size, >=, SPA_MINBLOCKSIZE); 398168404Spjd ASSERT3U(size >> SPA_MINBLOCKSHIFT, <, 399168404Spjd 1<<(sizeof (dn->dn_phys->dn_datablkszsec) * 8)); 400168404Spjd dn->dn_datablksz = size; 401168404Spjd dn->dn_datablkszsec = size >> SPA_MINBLOCKSHIFT; 402265740Sdelphij dn->dn_datablkshift = ISP2(size) ? highbit64(size - 1) : 0; 403168404Spjd} 404168404Spjd 405168404Spjdstatic dnode_t * 406219089Spjddnode_create(objset_t *os, dnode_phys_t *dnp, dmu_buf_impl_t *db, 407219089Spjd uint64_t object, dnode_handle_t *dnh) 408168404Spjd{ 409288549Smav dnode_t *dn; 410168404Spjd 411288549Smav dn = kmem_cache_alloc(dnode_cache, KM_SLEEP); 412219089Spjd ASSERT(!POINTER_IS_VALID(dn->dn_objset)); 413219089Spjd dn->dn_moved = 0; 414219089Spjd 415219089Spjd /* 416219089Spjd * Defer setting dn_objset until the dnode is ready to be a candidate 417219089Spjd * for the dnode_move() callback. 418219089Spjd */ 419168404Spjd dn->dn_object = object; 420168404Spjd dn->dn_dbuf = db; 421219089Spjd dn->dn_handle = dnh; 422168404Spjd dn->dn_phys = dnp; 423168404Spjd 424219089Spjd if (dnp->dn_datablkszsec) { 425168404Spjd dnode_setdblksz(dn, dnp->dn_datablkszsec << SPA_MINBLOCKSHIFT); 426219089Spjd } else { 427219089Spjd dn->dn_datablksz = 0; 428219089Spjd dn->dn_datablkszsec = 0; 429219089Spjd dn->dn_datablkshift = 0; 430219089Spjd } 431168404Spjd dn->dn_indblkshift = dnp->dn_indblkshift; 432168404Spjd dn->dn_nlevels = dnp->dn_nlevels; 433168404Spjd dn->dn_type = dnp->dn_type; 434168404Spjd dn->dn_nblkptr = dnp->dn_nblkptr; 435168404Spjd dn->dn_checksum = dnp->dn_checksum; 436168404Spjd dn->dn_compress = dnp->dn_compress; 437168404Spjd dn->dn_bonustype = dnp->dn_bonustype; 438168404Spjd dn->dn_bonuslen = dnp->dn_bonuslen; 439168404Spjd dn->dn_maxblkid = dnp->dn_maxblkid; 440219089Spjd dn->dn_have_spill = ((dnp->dn_flags & DNODE_FLAG_SPILL_BLKPTR) != 0); 441219089Spjd dn->dn_id_flags = 0; 442168404Spjd 443168404Spjd dmu_zfetch_init(&dn->dn_zfetch, dn); 444168404Spjd 445236884Smm ASSERT(DMU_OT_IS_VALID(dn->dn_phys->dn_type)); 446219089Spjd 447168404Spjd mutex_enter(&os->os_lock); 448288549Smav if (dnh->dnh_dnode != NULL) { 449288549Smav /* Lost the allocation race. */ 450288549Smav mutex_exit(&os->os_lock); 451288549Smav kmem_cache_free(dnode_cache, dn); 452288549Smav return (dnh->dnh_dnode); 453288549Smav } 454288549Smav 455288549Smav /* 456288549Smav * Exclude special dnodes from os_dnodes so an empty os_dnodes 457288549Smav * signifies that the special dnodes have no references from 458288549Smav * their children (the entries in os_dnodes). This allows 459288549Smav * dnode_destroy() to easily determine if the last child has 460288549Smav * been removed and then complete eviction of the objset. 461288549Smav */ 462288549Smav if (!DMU_OBJECT_IS_SPECIAL(object)) 463288549Smav list_insert_head(&os->os_dnodes, dn); 464219089Spjd membar_producer(); 465288549Smav 466219089Spjd /* 467288549Smav * Everything else must be valid before assigning dn_objset 468288549Smav * makes the dnode eligible for dnode_move(). 469219089Spjd */ 470219089Spjd dn->dn_objset = os; 471288549Smav 472288549Smav dnh->dnh_dnode = dn; 473168404Spjd mutex_exit(&os->os_lock); 474168404Spjd 475208373Smm arc_space_consume(sizeof (dnode_t), ARC_SPACE_OTHER); 476168404Spjd return (dn); 477168404Spjd} 478168404Spjd 479219089Spjd/* 480219089Spjd * Caller must be holding the dnode handle, which is released upon return. 481219089Spjd */ 482168404Spjdstatic void 483168404Spjddnode_destroy(dnode_t *dn) 484168404Spjd{ 485219089Spjd objset_t *os = dn->dn_objset; 486288549Smav boolean_t complete_os_eviction = B_FALSE; 487168404Spjd 488219089Spjd ASSERT((dn->dn_id_flags & DN_ID_NEW_EXIST) == 0); 489168404Spjd 490168404Spjd mutex_enter(&os->os_lock); 491219089Spjd POINTER_INVALIDATE(&dn->dn_objset); 492288549Smav if (!DMU_OBJECT_IS_SPECIAL(dn->dn_object)) { 493288549Smav list_remove(&os->os_dnodes, dn); 494288549Smav complete_os_eviction = 495288549Smav list_is_empty(&os->os_dnodes) && 496288549Smav list_link_active(&os->os_evicting_node); 497288549Smav } 498168404Spjd mutex_exit(&os->os_lock); 499168404Spjd 500219089Spjd /* the dnode can no longer move, so we can release the handle */ 501219089Spjd zrl_remove(&dn->dn_handle->dnh_zrlock); 502219089Spjd 503219089Spjd dn->dn_allocated_txg = 0; 504219089Spjd dn->dn_free_txg = 0; 505219089Spjd dn->dn_assigned_txg = 0; 506219089Spjd 507219089Spjd dn->dn_dirtyctx = 0; 508219089Spjd if (dn->dn_dirtyctx_firstset != NULL) { 509168404Spjd kmem_free(dn->dn_dirtyctx_firstset, 1); 510168404Spjd dn->dn_dirtyctx_firstset = NULL; 511168404Spjd } 512219089Spjd if (dn->dn_bonus != NULL) { 513168404Spjd mutex_enter(&dn->dn_bonus->db_mtx); 514168404Spjd dbuf_evict(dn->dn_bonus); 515168404Spjd dn->dn_bonus = NULL; 516168404Spjd } 517219089Spjd dn->dn_zio = NULL; 518219089Spjd 519219089Spjd dn->dn_have_spill = B_FALSE; 520219089Spjd dn->dn_oldused = 0; 521219089Spjd dn->dn_oldflags = 0; 522219089Spjd dn->dn_olduid = 0; 523219089Spjd dn->dn_oldgid = 0; 524219089Spjd dn->dn_newuid = 0; 525219089Spjd dn->dn_newgid = 0; 526219089Spjd dn->dn_id_flags = 0; 527254753Sdelphij dn->dn_unlisted_l0_blkid = 0; 528219089Spjd 529288594Smav dmu_zfetch_fini(&dn->dn_zfetch); 530168404Spjd kmem_cache_free(dnode_cache, dn); 531208373Smm arc_space_return(sizeof (dnode_t), ARC_SPACE_OTHER); 532288549Smav 533288549Smav if (complete_os_eviction) 534288549Smav dmu_objset_evict_done(os); 535168404Spjd} 536168404Spjd 537168404Spjdvoid 538168404Spjddnode_allocate(dnode_t *dn, dmu_object_type_t ot, int blocksize, int ibs, 539168404Spjd dmu_object_type_t bonustype, int bonuslen, dmu_tx_t *tx) 540168404Spjd{ 541168404Spjd int i; 542168404Spjd 543276081Sdelphij ASSERT3U(blocksize, <=, 544276081Sdelphij spa_maxblocksize(dmu_objset_spa(dn->dn_objset))); 545168404Spjd if (blocksize == 0) 546168404Spjd blocksize = 1 << zfs_default_bs; 547168404Spjd else 548168404Spjd blocksize = P2ROUNDUP(blocksize, SPA_MINBLOCKSIZE); 549168404Spjd 550168404Spjd if (ibs == 0) 551168404Spjd ibs = zfs_default_ibs; 552168404Spjd 553168404Spjd ibs = MIN(MAX(ibs, DN_MIN_INDBLKSHIFT), DN_MAX_INDBLKSHIFT); 554168404Spjd 555168404Spjd dprintf("os=%p obj=%llu txg=%llu blocksize=%d ibs=%d\n", dn->dn_objset, 556168404Spjd dn->dn_object, tx->tx_txg, blocksize, ibs); 557168404Spjd 558168404Spjd ASSERT(dn->dn_type == DMU_OT_NONE); 559168404Spjd ASSERT(bcmp(dn->dn_phys, &dnode_phys_zero, sizeof (dnode_phys_t)) == 0); 560168404Spjd ASSERT(dn->dn_phys->dn_type == DMU_OT_NONE); 561168404Spjd ASSERT(ot != DMU_OT_NONE); 562236884Smm ASSERT(DMU_OT_IS_VALID(ot)); 563168404Spjd ASSERT((bonustype == DMU_OT_NONE && bonuslen == 0) || 564219089Spjd (bonustype == DMU_OT_SA && bonuslen == 0) || 565168404Spjd (bonustype != DMU_OT_NONE && bonuslen != 0)); 566236884Smm ASSERT(DMU_OT_IS_VALID(bonustype)); 567168404Spjd ASSERT3U(bonuslen, <=, DN_MAX_BONUSLEN); 568168404Spjd ASSERT(dn->dn_type == DMU_OT_NONE); 569240415Smm ASSERT0(dn->dn_maxblkid); 570240415Smm ASSERT0(dn->dn_allocated_txg); 571240415Smm ASSERT0(dn->dn_assigned_txg); 572168404Spjd ASSERT(refcount_is_zero(&dn->dn_tx_holds)); 573168404Spjd ASSERT3U(refcount_count(&dn->dn_holds), <=, 1); 574269845Sdelphij ASSERT(avl_is_empty(&dn->dn_dbufs)); 575168404Spjd 576168404Spjd for (i = 0; i < TXG_SIZE; i++) { 577240415Smm ASSERT0(dn->dn_next_nblkptr[i]); 578240415Smm ASSERT0(dn->dn_next_nlevels[i]); 579240415Smm ASSERT0(dn->dn_next_indblkshift[i]); 580240415Smm ASSERT0(dn->dn_next_bonuslen[i]); 581240415Smm ASSERT0(dn->dn_next_bonustype[i]); 582240415Smm ASSERT0(dn->dn_rm_spillblk[i]); 583240415Smm ASSERT0(dn->dn_next_blksz[i]); 584168404Spjd ASSERT(!list_link_active(&dn->dn_dirty_link[i])); 585168404Spjd ASSERT3P(list_head(&dn->dn_dirty_records[i]), ==, NULL); 586265740Sdelphij ASSERT3P(dn->dn_free_ranges[i], ==, NULL); 587168404Spjd } 588168404Spjd 589168404Spjd dn->dn_type = ot; 590168404Spjd dnode_setdblksz(dn, blocksize); 591168404Spjd dn->dn_indblkshift = ibs; 592168404Spjd dn->dn_nlevels = 1; 593219089Spjd if (bonustype == DMU_OT_SA) /* Maximize bonus space for SA */ 594219089Spjd dn->dn_nblkptr = 1; 595219089Spjd else 596219089Spjd dn->dn_nblkptr = 1 + 597219089Spjd ((DN_MAX_BONUSLEN - bonuslen) >> SPA_BLKPTRSHIFT); 598168404Spjd dn->dn_bonustype = bonustype; 599168404Spjd dn->dn_bonuslen = bonuslen; 600168404Spjd dn->dn_checksum = ZIO_CHECKSUM_INHERIT; 601168404Spjd dn->dn_compress = ZIO_COMPRESS_INHERIT; 602168404Spjd dn->dn_dirtyctx = 0; 603168404Spjd 604168404Spjd dn->dn_free_txg = 0; 605168404Spjd if (dn->dn_dirtyctx_firstset) { 606168404Spjd kmem_free(dn->dn_dirtyctx_firstset, 1); 607168404Spjd dn->dn_dirtyctx_firstset = NULL; 608168404Spjd } 609168404Spjd 610168404Spjd dn->dn_allocated_txg = tx->tx_txg; 611219089Spjd dn->dn_id_flags = 0; 612168404Spjd 613168404Spjd dnode_setdirty(dn, tx); 614168404Spjd dn->dn_next_indblkshift[tx->tx_txg & TXG_MASK] = ibs; 615185029Spjd dn->dn_next_bonuslen[tx->tx_txg & TXG_MASK] = dn->dn_bonuslen; 616219089Spjd dn->dn_next_bonustype[tx->tx_txg & TXG_MASK] = dn->dn_bonustype; 617168404Spjd dn->dn_next_blksz[tx->tx_txg & TXG_MASK] = dn->dn_datablksz; 618168404Spjd} 619168404Spjd 620168404Spjdvoid 621168404Spjddnode_reallocate(dnode_t *dn, dmu_object_type_t ot, int blocksize, 622168404Spjd dmu_object_type_t bonustype, int bonuslen, dmu_tx_t *tx) 623168404Spjd{ 624200726Sdelphij int nblkptr; 625168404Spjd 626168404Spjd ASSERT3U(blocksize, >=, SPA_MINBLOCKSIZE); 627276081Sdelphij ASSERT3U(blocksize, <=, 628276081Sdelphij spa_maxblocksize(dmu_objset_spa(dn->dn_objset))); 629240415Smm ASSERT0(blocksize % SPA_MINBLOCKSIZE); 630168404Spjd ASSERT(dn->dn_object != DMU_META_DNODE_OBJECT || dmu_tx_private_ok(tx)); 631168404Spjd ASSERT(tx->tx_txg != 0); 632168404Spjd ASSERT((bonustype == DMU_OT_NONE && bonuslen == 0) || 633219089Spjd (bonustype != DMU_OT_NONE && bonuslen != 0) || 634219089Spjd (bonustype == DMU_OT_SA && bonuslen == 0)); 635236884Smm ASSERT(DMU_OT_IS_VALID(bonustype)); 636168404Spjd ASSERT3U(bonuslen, <=, DN_MAX_BONUSLEN); 637168404Spjd 638168404Spjd /* clean up any unreferenced dbufs */ 639185029Spjd dnode_evict_dbufs(dn); 640168404Spjd 641219089Spjd dn->dn_id_flags = 0; 642219089Spjd 643200726Sdelphij rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 644200726Sdelphij dnode_setdirty(dn, tx); 645200726Sdelphij if (dn->dn_datablksz != blocksize) { 646200726Sdelphij /* change blocksize */ 647200726Sdelphij ASSERT(dn->dn_maxblkid == 0 && 648200726Sdelphij (BP_IS_HOLE(&dn->dn_phys->dn_blkptr[0]) || 649200726Sdelphij dnode_block_freed(dn, 0))); 650200726Sdelphij dnode_setdblksz(dn, blocksize); 651200726Sdelphij dn->dn_next_blksz[tx->tx_txg&TXG_MASK] = blocksize; 652168404Spjd } 653200726Sdelphij if (dn->dn_bonuslen != bonuslen) 654200726Sdelphij dn->dn_next_bonuslen[tx->tx_txg&TXG_MASK] = bonuslen; 655219089Spjd 656219089Spjd if (bonustype == DMU_OT_SA) /* Maximize bonus space for SA */ 657219089Spjd nblkptr = 1; 658219089Spjd else 659219089Spjd nblkptr = 1 + ((DN_MAX_BONUSLEN - bonuslen) >> SPA_BLKPTRSHIFT); 660219089Spjd if (dn->dn_bonustype != bonustype) 661219089Spjd dn->dn_next_bonustype[tx->tx_txg&TXG_MASK] = bonustype; 662196703Spjd if (dn->dn_nblkptr != nblkptr) 663196703Spjd dn->dn_next_nblkptr[tx->tx_txg&TXG_MASK] = nblkptr; 664219089Spjd if (dn->dn_phys->dn_flags & DNODE_FLAG_SPILL_BLKPTR) { 665219089Spjd dbuf_rm_spill(dn, tx); 666219089Spjd dnode_rm_spill(dn, tx); 667219089Spjd } 668168404Spjd rw_exit(&dn->dn_struct_rwlock); 669168404Spjd 670168404Spjd /* change type */ 671168404Spjd dn->dn_type = ot; 672168404Spjd 673168404Spjd /* change bonus size and type */ 674168404Spjd mutex_enter(&dn->dn_mtx); 675168404Spjd dn->dn_bonustype = bonustype; 676168404Spjd dn->dn_bonuslen = bonuslen; 677196703Spjd dn->dn_nblkptr = nblkptr; 678168404Spjd dn->dn_checksum = ZIO_CHECKSUM_INHERIT; 679168404Spjd dn->dn_compress = ZIO_COMPRESS_INHERIT; 680168404Spjd ASSERT3U(dn->dn_nblkptr, <=, DN_MAX_NBLKPTR); 681168404Spjd 682196703Spjd /* fix up the bonus db_size */ 683196703Spjd if (dn->dn_bonus) { 684185029Spjd dn->dn_bonus->db.db_size = 685185029Spjd DN_MAX_BONUSLEN - (dn->dn_nblkptr-1) * sizeof (blkptr_t); 686185029Spjd ASSERT(dn->dn_bonuslen <= dn->dn_bonus->db.db_size); 687185029Spjd } 688185029Spjd 689168404Spjd dn->dn_allocated_txg = tx->tx_txg; 690168404Spjd mutex_exit(&dn->dn_mtx); 691168404Spjd} 692168404Spjd 693219089Spjd#ifdef DNODE_STATS 694219089Spjdstatic struct { 695219089Spjd uint64_t dms_dnode_invalid; 696219089Spjd uint64_t dms_dnode_recheck1; 697219089Spjd uint64_t dms_dnode_recheck2; 698219089Spjd uint64_t dms_dnode_special; 699219089Spjd uint64_t dms_dnode_handle; 700219089Spjd uint64_t dms_dnode_rwlock; 701219089Spjd uint64_t dms_dnode_active; 702219089Spjd} dnode_move_stats; 703219089Spjd#endif /* DNODE_STATS */ 704219089Spjd 705219089Spjdstatic void 706219089Spjddnode_move_impl(dnode_t *odn, dnode_t *ndn) 707219089Spjd{ 708219089Spjd int i; 709219089Spjd 710219089Spjd ASSERT(!RW_LOCK_HELD(&odn->dn_struct_rwlock)); 711219089Spjd ASSERT(MUTEX_NOT_HELD(&odn->dn_mtx)); 712219089Spjd ASSERT(MUTEX_NOT_HELD(&odn->dn_dbufs_mtx)); 713219089Spjd ASSERT(!RW_LOCK_HELD(&odn->dn_zfetch.zf_rwlock)); 714219089Spjd 715219089Spjd /* Copy fields. */ 716219089Spjd ndn->dn_objset = odn->dn_objset; 717219089Spjd ndn->dn_object = odn->dn_object; 718219089Spjd ndn->dn_dbuf = odn->dn_dbuf; 719219089Spjd ndn->dn_handle = odn->dn_handle; 720219089Spjd ndn->dn_phys = odn->dn_phys; 721219089Spjd ndn->dn_type = odn->dn_type; 722219089Spjd ndn->dn_bonuslen = odn->dn_bonuslen; 723219089Spjd ndn->dn_bonustype = odn->dn_bonustype; 724219089Spjd ndn->dn_nblkptr = odn->dn_nblkptr; 725219089Spjd ndn->dn_checksum = odn->dn_checksum; 726219089Spjd ndn->dn_compress = odn->dn_compress; 727219089Spjd ndn->dn_nlevels = odn->dn_nlevels; 728219089Spjd ndn->dn_indblkshift = odn->dn_indblkshift; 729219089Spjd ndn->dn_datablkshift = odn->dn_datablkshift; 730219089Spjd ndn->dn_datablkszsec = odn->dn_datablkszsec; 731219089Spjd ndn->dn_datablksz = odn->dn_datablksz; 732219089Spjd ndn->dn_maxblkid = odn->dn_maxblkid; 733219089Spjd bcopy(&odn->dn_next_nblkptr[0], &ndn->dn_next_nblkptr[0], 734219089Spjd sizeof (odn->dn_next_nblkptr)); 735219089Spjd bcopy(&odn->dn_next_nlevels[0], &ndn->dn_next_nlevels[0], 736219089Spjd sizeof (odn->dn_next_nlevels)); 737219089Spjd bcopy(&odn->dn_next_indblkshift[0], &ndn->dn_next_indblkshift[0], 738219089Spjd sizeof (odn->dn_next_indblkshift)); 739219089Spjd bcopy(&odn->dn_next_bonustype[0], &ndn->dn_next_bonustype[0], 740219089Spjd sizeof (odn->dn_next_bonustype)); 741219089Spjd bcopy(&odn->dn_rm_spillblk[0], &ndn->dn_rm_spillblk[0], 742219089Spjd sizeof (odn->dn_rm_spillblk)); 743219089Spjd bcopy(&odn->dn_next_bonuslen[0], &ndn->dn_next_bonuslen[0], 744219089Spjd sizeof (odn->dn_next_bonuslen)); 745219089Spjd bcopy(&odn->dn_next_blksz[0], &ndn->dn_next_blksz[0], 746219089Spjd sizeof (odn->dn_next_blksz)); 747219089Spjd for (i = 0; i < TXG_SIZE; i++) { 748219089Spjd list_move_tail(&ndn->dn_dirty_records[i], 749219089Spjd &odn->dn_dirty_records[i]); 750219089Spjd } 751265740Sdelphij bcopy(&odn->dn_free_ranges[0], &ndn->dn_free_ranges[0], 752265740Sdelphij sizeof (odn->dn_free_ranges)); 753219089Spjd ndn->dn_allocated_txg = odn->dn_allocated_txg; 754219089Spjd ndn->dn_free_txg = odn->dn_free_txg; 755219089Spjd ndn->dn_assigned_txg = odn->dn_assigned_txg; 756219089Spjd ndn->dn_dirtyctx = odn->dn_dirtyctx; 757219089Spjd ndn->dn_dirtyctx_firstset = odn->dn_dirtyctx_firstset; 758219089Spjd ASSERT(refcount_count(&odn->dn_tx_holds) == 0); 759219089Spjd refcount_transfer(&ndn->dn_holds, &odn->dn_holds); 760269845Sdelphij ASSERT(avl_is_empty(&ndn->dn_dbufs)); 761269845Sdelphij avl_swap(&ndn->dn_dbufs, &odn->dn_dbufs); 762219089Spjd ndn->dn_dbufs_count = odn->dn_dbufs_count; 763254753Sdelphij ndn->dn_unlisted_l0_blkid = odn->dn_unlisted_l0_blkid; 764219089Spjd ndn->dn_bonus = odn->dn_bonus; 765219089Spjd ndn->dn_have_spill = odn->dn_have_spill; 766219089Spjd ndn->dn_zio = odn->dn_zio; 767219089Spjd ndn->dn_oldused = odn->dn_oldused; 768219089Spjd ndn->dn_oldflags = odn->dn_oldflags; 769219089Spjd ndn->dn_olduid = odn->dn_olduid; 770219089Spjd ndn->dn_oldgid = odn->dn_oldgid; 771219089Spjd ndn->dn_newuid = odn->dn_newuid; 772219089Spjd ndn->dn_newgid = odn->dn_newgid; 773219089Spjd ndn->dn_id_flags = odn->dn_id_flags; 774219089Spjd dmu_zfetch_init(&ndn->dn_zfetch, NULL); 775219089Spjd list_move_tail(&ndn->dn_zfetch.zf_stream, &odn->dn_zfetch.zf_stream); 776219089Spjd ndn->dn_zfetch.zf_dnode = odn->dn_zfetch.zf_dnode; 777219089Spjd 778219089Spjd /* 779219089Spjd * Update back pointers. Updating the handle fixes the back pointer of 780219089Spjd * every descendant dbuf as well as the bonus dbuf. 781219089Spjd */ 782219089Spjd ASSERT(ndn->dn_handle->dnh_dnode == odn); 783219089Spjd ndn->dn_handle->dnh_dnode = ndn; 784219089Spjd if (ndn->dn_zfetch.zf_dnode == odn) { 785219089Spjd ndn->dn_zfetch.zf_dnode = ndn; 786219089Spjd } 787219089Spjd 788219089Spjd /* 789219089Spjd * Invalidate the original dnode by clearing all of its back pointers. 790219089Spjd */ 791219089Spjd odn->dn_dbuf = NULL; 792219089Spjd odn->dn_handle = NULL; 793269845Sdelphij avl_create(&odn->dn_dbufs, dbuf_compare, sizeof (dmu_buf_impl_t), 794219089Spjd offsetof(dmu_buf_impl_t, db_link)); 795219089Spjd odn->dn_dbufs_count = 0; 796254753Sdelphij odn->dn_unlisted_l0_blkid = 0; 797219089Spjd odn->dn_bonus = NULL; 798219089Spjd odn->dn_zfetch.zf_dnode = NULL; 799219089Spjd 800219089Spjd /* 801219089Spjd * Set the low bit of the objset pointer to ensure that dnode_move() 802219089Spjd * recognizes the dnode as invalid in any subsequent callback. 803219089Spjd */ 804219089Spjd POINTER_INVALIDATE(&odn->dn_objset); 805219089Spjd 806219089Spjd /* 807219089Spjd * Satisfy the destructor. 808219089Spjd */ 809219089Spjd for (i = 0; i < TXG_SIZE; i++) { 810219089Spjd list_create(&odn->dn_dirty_records[i], 811219089Spjd sizeof (dbuf_dirty_record_t), 812219089Spjd offsetof(dbuf_dirty_record_t, dr_dirty_node)); 813265740Sdelphij odn->dn_free_ranges[i] = NULL; 814219089Spjd odn->dn_next_nlevels[i] = 0; 815219089Spjd odn->dn_next_indblkshift[i] = 0; 816219089Spjd odn->dn_next_bonustype[i] = 0; 817219089Spjd odn->dn_rm_spillblk[i] = 0; 818219089Spjd odn->dn_next_bonuslen[i] = 0; 819219089Spjd odn->dn_next_blksz[i] = 0; 820219089Spjd } 821219089Spjd odn->dn_allocated_txg = 0; 822219089Spjd odn->dn_free_txg = 0; 823219089Spjd odn->dn_assigned_txg = 0; 824219089Spjd odn->dn_dirtyctx = 0; 825219089Spjd odn->dn_dirtyctx_firstset = NULL; 826219089Spjd odn->dn_have_spill = B_FALSE; 827219089Spjd odn->dn_zio = NULL; 828219089Spjd odn->dn_oldused = 0; 829219089Spjd odn->dn_oldflags = 0; 830219089Spjd odn->dn_olduid = 0; 831219089Spjd odn->dn_oldgid = 0; 832219089Spjd odn->dn_newuid = 0; 833219089Spjd odn->dn_newgid = 0; 834219089Spjd odn->dn_id_flags = 0; 835219089Spjd 836219089Spjd /* 837219089Spjd * Mark the dnode. 838219089Spjd */ 839219089Spjd ndn->dn_moved = 1; 840219089Spjd odn->dn_moved = (uint8_t)-1; 841219089Spjd} 842219089Spjd 843219089Spjd#ifdef sun 844219089Spjd#ifdef _KERNEL 845219089Spjd/*ARGSUSED*/ 846219089Spjdstatic kmem_cbrc_t 847219089Spjddnode_move(void *buf, void *newbuf, size_t size, void *arg) 848219089Spjd{ 849219089Spjd dnode_t *odn = buf, *ndn = newbuf; 850219089Spjd objset_t *os; 851219089Spjd int64_t refcount; 852219089Spjd uint32_t dbufs; 853219089Spjd 854219089Spjd /* 855219089Spjd * The dnode is on the objset's list of known dnodes if the objset 856219089Spjd * pointer is valid. We set the low bit of the objset pointer when 857219089Spjd * freeing the dnode to invalidate it, and the memory patterns written 858219089Spjd * by kmem (baddcafe and deadbeef) set at least one of the two low bits. 859219089Spjd * A newly created dnode sets the objset pointer last of all to indicate 860219089Spjd * that the dnode is known and in a valid state to be moved by this 861219089Spjd * function. 862219089Spjd */ 863219089Spjd os = odn->dn_objset; 864219089Spjd if (!POINTER_IS_VALID(os)) { 865219089Spjd DNODE_STAT_ADD(dnode_move_stats.dms_dnode_invalid); 866219089Spjd return (KMEM_CBRC_DONT_KNOW); 867219089Spjd } 868219089Spjd 869219089Spjd /* 870219089Spjd * Ensure that the objset does not go away during the move. 871219089Spjd */ 872219089Spjd rw_enter(&os_lock, RW_WRITER); 873219089Spjd if (os != odn->dn_objset) { 874219089Spjd rw_exit(&os_lock); 875219089Spjd DNODE_STAT_ADD(dnode_move_stats.dms_dnode_recheck1); 876219089Spjd return (KMEM_CBRC_DONT_KNOW); 877219089Spjd } 878219089Spjd 879219089Spjd /* 880219089Spjd * If the dnode is still valid, then so is the objset. We know that no 881219089Spjd * valid objset can be freed while we hold os_lock, so we can safely 882219089Spjd * ensure that the objset remains in use. 883219089Spjd */ 884219089Spjd mutex_enter(&os->os_lock); 885219089Spjd 886219089Spjd /* 887219089Spjd * Recheck the objset pointer in case the dnode was removed just before 888219089Spjd * acquiring the lock. 889219089Spjd */ 890219089Spjd if (os != odn->dn_objset) { 891219089Spjd mutex_exit(&os->os_lock); 892219089Spjd rw_exit(&os_lock); 893219089Spjd DNODE_STAT_ADD(dnode_move_stats.dms_dnode_recheck2); 894219089Spjd return (KMEM_CBRC_DONT_KNOW); 895219089Spjd } 896219089Spjd 897219089Spjd /* 898219089Spjd * At this point we know that as long as we hold os->os_lock, the dnode 899219089Spjd * cannot be freed and fields within the dnode can be safely accessed. 900219089Spjd * The objset listing this dnode cannot go away as long as this dnode is 901219089Spjd * on its list. 902219089Spjd */ 903219089Spjd rw_exit(&os_lock); 904219089Spjd if (DMU_OBJECT_IS_SPECIAL(odn->dn_object)) { 905219089Spjd mutex_exit(&os->os_lock); 906219089Spjd DNODE_STAT_ADD(dnode_move_stats.dms_dnode_special); 907219089Spjd return (KMEM_CBRC_NO); 908219089Spjd } 909219089Spjd ASSERT(odn->dn_dbuf != NULL); /* only "special" dnodes have no parent */ 910219089Spjd 911219089Spjd /* 912219089Spjd * Lock the dnode handle to prevent the dnode from obtaining any new 913219089Spjd * holds. This also prevents the descendant dbufs and the bonus dbuf 914219089Spjd * from accessing the dnode, so that we can discount their holds. The 915219089Spjd * handle is safe to access because we know that while the dnode cannot 916219089Spjd * go away, neither can its handle. Once we hold dnh_zrlock, we can 917219089Spjd * safely move any dnode referenced only by dbufs. 918219089Spjd */ 919219089Spjd if (!zrl_tryenter(&odn->dn_handle->dnh_zrlock)) { 920219089Spjd mutex_exit(&os->os_lock); 921219089Spjd DNODE_STAT_ADD(dnode_move_stats.dms_dnode_handle); 922219089Spjd return (KMEM_CBRC_LATER); 923219089Spjd } 924219089Spjd 925219089Spjd /* 926219089Spjd * Ensure a consistent view of the dnode's holds and the dnode's dbufs. 927219089Spjd * We need to guarantee that there is a hold for every dbuf in order to 928219089Spjd * determine whether the dnode is actively referenced. Falsely matching 929219089Spjd * a dbuf to an active hold would lead to an unsafe move. It's possible 930219089Spjd * that a thread already having an active dnode hold is about to add a 931219089Spjd * dbuf, and we can't compare hold and dbuf counts while the add is in 932219089Spjd * progress. 933219089Spjd */ 934219089Spjd if (!rw_tryenter(&odn->dn_struct_rwlock, RW_WRITER)) { 935219089Spjd zrl_exit(&odn->dn_handle->dnh_zrlock); 936219089Spjd mutex_exit(&os->os_lock); 937219089Spjd DNODE_STAT_ADD(dnode_move_stats.dms_dnode_rwlock); 938219089Spjd return (KMEM_CBRC_LATER); 939219089Spjd } 940219089Spjd 941219089Spjd /* 942219089Spjd * A dbuf may be removed (evicted) without an active dnode hold. In that 943219089Spjd * case, the dbuf count is decremented under the handle lock before the 944219089Spjd * dbuf's hold is released. This order ensures that if we count the hold 945219089Spjd * after the dbuf is removed but before its hold is released, we will 946219089Spjd * treat the unmatched hold as active and exit safely. If we count the 947219089Spjd * hold before the dbuf is removed, the hold is discounted, and the 948219089Spjd * removal is blocked until the move completes. 949219089Spjd */ 950219089Spjd refcount = refcount_count(&odn->dn_holds); 951219089Spjd ASSERT(refcount >= 0); 952219089Spjd dbufs = odn->dn_dbufs_count; 953219089Spjd 954219089Spjd /* We can't have more dbufs than dnode holds. */ 955219089Spjd ASSERT3U(dbufs, <=, refcount); 956219089Spjd DTRACE_PROBE3(dnode__move, dnode_t *, odn, int64_t, refcount, 957219089Spjd uint32_t, dbufs); 958219089Spjd 959219089Spjd if (refcount > dbufs) { 960219089Spjd rw_exit(&odn->dn_struct_rwlock); 961219089Spjd zrl_exit(&odn->dn_handle->dnh_zrlock); 962219089Spjd mutex_exit(&os->os_lock); 963219089Spjd DNODE_STAT_ADD(dnode_move_stats.dms_dnode_active); 964219089Spjd return (KMEM_CBRC_LATER); 965219089Spjd } 966219089Spjd 967219089Spjd rw_exit(&odn->dn_struct_rwlock); 968219089Spjd 969219089Spjd /* 970219089Spjd * At this point we know that anyone with a hold on the dnode is not 971219089Spjd * actively referencing it. The dnode is known and in a valid state to 972219089Spjd * move. We're holding the locks needed to execute the critical section. 973219089Spjd */ 974219089Spjd dnode_move_impl(odn, ndn); 975219089Spjd 976219089Spjd list_link_replace(&odn->dn_link, &ndn->dn_link); 977219089Spjd /* If the dnode was safe to move, the refcount cannot have changed. */ 978219089Spjd ASSERT(refcount == refcount_count(&ndn->dn_holds)); 979219089Spjd ASSERT(dbufs == ndn->dn_dbufs_count); 980219089Spjd zrl_exit(&ndn->dn_handle->dnh_zrlock); /* handle has moved */ 981219089Spjd mutex_exit(&os->os_lock); 982219089Spjd 983219089Spjd return (KMEM_CBRC_YES); 984219089Spjd} 985219089Spjd#endif /* _KERNEL */ 986219089Spjd#endif /* sun */ 987219089Spjd 988168404Spjdvoid 989219089Spjddnode_special_close(dnode_handle_t *dnh) 990168404Spjd{ 991219089Spjd dnode_t *dn = dnh->dnh_dnode; 992219089Spjd 993168404Spjd /* 994168404Spjd * Wait for final references to the dnode to clear. This can 995168404Spjd * only happen if the arc is asyncronously evicting state that 996168404Spjd * has a hold on this dnode while we are trying to evict this 997168404Spjd * dnode. 998168404Spjd */ 999168404Spjd while (refcount_count(&dn->dn_holds) > 0) 1000168404Spjd delay(1); 1001288549Smav ASSERT(dn->dn_dbuf == NULL || 1002288549Smav dmu_buf_get_user(&dn->dn_dbuf->db) == NULL); 1003219089Spjd zrl_add(&dnh->dnh_zrlock); 1004219089Spjd dnode_destroy(dn); /* implicit zrl_remove() */ 1005219089Spjd zrl_destroy(&dnh->dnh_zrlock); 1006219089Spjd dnh->dnh_dnode = NULL; 1007168404Spjd} 1008168404Spjd 1009288549Smavvoid 1010219089Spjddnode_special_open(objset_t *os, dnode_phys_t *dnp, uint64_t object, 1011219089Spjd dnode_handle_t *dnh) 1012168404Spjd{ 1013288549Smav dnode_t *dn; 1014288549Smav 1015288549Smav dn = dnode_create(os, dnp, NULL, object, dnh); 1016219089Spjd zrl_init(&dnh->dnh_zrlock); 1017168404Spjd DNODE_VERIFY(dn); 1018168404Spjd} 1019168404Spjd 1020168404Spjdstatic void 1021288549Smavdnode_buf_pageout(void *dbu) 1022168404Spjd{ 1023288549Smav dnode_children_t *children_dnodes = dbu; 1024168404Spjd int i; 1025168404Spjd 1026288549Smav for (i = 0; i < children_dnodes->dnc_count; i++) { 1027219089Spjd dnode_handle_t *dnh = &children_dnodes->dnc_children[i]; 1028219089Spjd dnode_t *dn; 1029168404Spjd 1030219089Spjd /* 1031219089Spjd * The dnode handle lock guards against the dnode moving to 1032219089Spjd * another valid address, so there is no need here to guard 1033219089Spjd * against changes to or from NULL. 1034219089Spjd */ 1035219089Spjd if (dnh->dnh_dnode == NULL) { 1036219089Spjd zrl_destroy(&dnh->dnh_zrlock); 1037168404Spjd continue; 1038219089Spjd } 1039219089Spjd 1040219089Spjd zrl_add(&dnh->dnh_zrlock); 1041219089Spjd dn = dnh->dnh_dnode; 1042168404Spjd /* 1043168404Spjd * If there are holds on this dnode, then there should 1044168404Spjd * be holds on the dnode's containing dbuf as well; thus 1045219089Spjd * it wouldn't be eligible for eviction and this function 1046168404Spjd * would not have been called. 1047168404Spjd */ 1048168404Spjd ASSERT(refcount_is_zero(&dn->dn_holds)); 1049168404Spjd ASSERT(refcount_is_zero(&dn->dn_tx_holds)); 1050168404Spjd 1051219089Spjd dnode_destroy(dn); /* implicit zrl_remove() */ 1052219089Spjd zrl_destroy(&dnh->dnh_zrlock); 1053219089Spjd dnh->dnh_dnode = NULL; 1054168404Spjd } 1055219089Spjd kmem_free(children_dnodes, sizeof (dnode_children_t) + 1056288549Smav children_dnodes->dnc_count * sizeof (dnode_handle_t)); 1057168404Spjd} 1058168404Spjd 1059168404Spjd/* 1060168404Spjd * errors: 1061168404Spjd * EINVAL - invalid object number. 1062168404Spjd * EIO - i/o error. 1063168404Spjd * succeeds even for free dnodes. 1064168404Spjd */ 1065168404Spjdint 1066219089Spjddnode_hold_impl(objset_t *os, uint64_t object, int flag, 1067168404Spjd void *tag, dnode_t **dnp) 1068168404Spjd{ 1069168404Spjd int epb, idx, err; 1070168404Spjd int drop_struct_lock = FALSE; 1071168404Spjd int type; 1072168404Spjd uint64_t blk; 1073168404Spjd dnode_t *mdn, *dn; 1074168404Spjd dmu_buf_impl_t *db; 1075219089Spjd dnode_children_t *children_dnodes; 1076219089Spjd dnode_handle_t *dnh; 1077168404Spjd 1078185029Spjd /* 1079185029Spjd * If you are holding the spa config lock as writer, you shouldn't 1080219089Spjd * be asking the DMU to do *anything* unless it's the root pool 1081219089Spjd * which may require us to read from the root filesystem while 1082219089Spjd * holding some (not all) of the locks as writer. 1083185029Spjd */ 1084219089Spjd ASSERT(spa_config_held(os->os_spa, SCL_ALL, RW_WRITER) == 0 || 1085219089Spjd (spa_is_root(os->os_spa) && 1086219089Spjd spa_config_held(os->os_spa, SCL_STATE, RW_WRITER))); 1087185029Spjd 1088209962Smm if (object == DMU_USERUSED_OBJECT || object == DMU_GROUPUSED_OBJECT) { 1089209962Smm dn = (object == DMU_USERUSED_OBJECT) ? 1090219089Spjd DMU_USERUSED_DNODE(os) : DMU_GROUPUSED_DNODE(os); 1091209962Smm if (dn == NULL) 1092249195Smm return (SET_ERROR(ENOENT)); 1093209962Smm type = dn->dn_type; 1094209962Smm if ((flag & DNODE_MUST_BE_ALLOCATED) && type == DMU_OT_NONE) 1095249195Smm return (SET_ERROR(ENOENT)); 1096209962Smm if ((flag & DNODE_MUST_BE_FREE) && type != DMU_OT_NONE) 1097249195Smm return (SET_ERROR(EEXIST)); 1098209962Smm DNODE_VERIFY(dn); 1099209962Smm (void) refcount_add(&dn->dn_holds, tag); 1100209962Smm *dnp = dn; 1101209962Smm return (0); 1102209962Smm } 1103209962Smm 1104168404Spjd if (object == 0 || object >= DN_MAX_OBJECT) 1105249195Smm return (SET_ERROR(EINVAL)); 1106168404Spjd 1107219089Spjd mdn = DMU_META_DNODE(os); 1108219089Spjd ASSERT(mdn->dn_object == DMU_META_DNODE_OBJECT); 1109168404Spjd 1110168404Spjd DNODE_VERIFY(mdn); 1111168404Spjd 1112168404Spjd if (!RW_WRITE_HELD(&mdn->dn_struct_rwlock)) { 1113168404Spjd rw_enter(&mdn->dn_struct_rwlock, RW_READER); 1114168404Spjd drop_struct_lock = TRUE; 1115168404Spjd } 1116168404Spjd 1117288571Smav blk = dbuf_whichblock(mdn, 0, object * sizeof (dnode_phys_t)); 1118168404Spjd 1119168404Spjd db = dbuf_hold(mdn, blk, FTAG); 1120168404Spjd if (drop_struct_lock) 1121168404Spjd rw_exit(&mdn->dn_struct_rwlock); 1122168404Spjd if (db == NULL) 1123249195Smm return (SET_ERROR(EIO)); 1124168404Spjd err = dbuf_read(db, NULL, DB_RF_CANFAIL); 1125168404Spjd if (err) { 1126168404Spjd dbuf_rele(db, FTAG); 1127168404Spjd return (err); 1128168404Spjd } 1129168404Spjd 1130168404Spjd ASSERT3U(db->db.db_size, >=, 1<<DNODE_SHIFT); 1131168404Spjd epb = db->db.db_size >> DNODE_SHIFT; 1132168404Spjd 1133168404Spjd idx = object & (epb-1); 1134168404Spjd 1135219089Spjd ASSERT(DB_DNODE(db)->dn_type == DMU_OT_DNODE); 1136168404Spjd children_dnodes = dmu_buf_get_user(&db->db); 1137168404Spjd if (children_dnodes == NULL) { 1138219089Spjd int i; 1139219089Spjd dnode_children_t *winner; 1140230256Spluknet children_dnodes = kmem_zalloc(sizeof (dnode_children_t) + 1141270127Sdelphij epb * sizeof (dnode_handle_t), KM_SLEEP); 1142219089Spjd children_dnodes->dnc_count = epb; 1143219089Spjd dnh = &children_dnodes->dnc_children[0]; 1144219089Spjd for (i = 0; i < epb; i++) { 1145219089Spjd zrl_init(&dnh[i].dnh_zrlock); 1146219089Spjd } 1147288549Smav dmu_buf_init_user(&children_dnodes->dnc_dbu, 1148288549Smav dnode_buf_pageout, NULL); 1149288549Smav winner = dmu_buf_set_user(&db->db, &children_dnodes->dnc_dbu); 1150288549Smav if (winner != NULL) { 1151269218Sdelphij 1152269218Sdelphij for (i = 0; i < epb; i++) { 1153269218Sdelphij zrl_destroy(&dnh[i].dnh_zrlock); 1154269218Sdelphij } 1155269218Sdelphij 1156219089Spjd kmem_free(children_dnodes, sizeof (dnode_children_t) + 1157270127Sdelphij epb * sizeof (dnode_handle_t)); 1158168404Spjd children_dnodes = winner; 1159168404Spjd } 1160168404Spjd } 1161219089Spjd ASSERT(children_dnodes->dnc_count == epb); 1162168404Spjd 1163219089Spjd dnh = &children_dnodes->dnc_children[idx]; 1164219089Spjd zrl_add(&dnh->dnh_zrlock); 1165288549Smav dn = dnh->dnh_dnode; 1166288549Smav if (dn == NULL) { 1167219089Spjd dnode_phys_t *phys = (dnode_phys_t *)db->db.db_data+idx; 1168185029Spjd 1169219089Spjd dn = dnode_create(os, phys, db, object, dnh); 1170168404Spjd } 1171168404Spjd 1172168404Spjd mutex_enter(&dn->dn_mtx); 1173168404Spjd type = dn->dn_type; 1174168404Spjd if (dn->dn_free_txg || 1175168404Spjd ((flag & DNODE_MUST_BE_ALLOCATED) && type == DMU_OT_NONE) || 1176209962Smm ((flag & DNODE_MUST_BE_FREE) && 1177219089Spjd (type != DMU_OT_NONE || !refcount_is_zero(&dn->dn_holds)))) { 1178168404Spjd mutex_exit(&dn->dn_mtx); 1179219089Spjd zrl_remove(&dnh->dnh_zrlock); 1180168404Spjd dbuf_rele(db, FTAG); 1181168404Spjd return (type == DMU_OT_NONE ? ENOENT : EEXIST); 1182168404Spjd } 1183288549Smav if (refcount_add(&dn->dn_holds, tag) == 1) 1184288549Smav dbuf_add_ref(db, dnh); 1185168404Spjd mutex_exit(&dn->dn_mtx); 1186168404Spjd 1187219089Spjd /* Now we can rely on the hold to prevent the dnode from moving. */ 1188219089Spjd zrl_remove(&dnh->dnh_zrlock); 1189168404Spjd 1190168404Spjd DNODE_VERIFY(dn); 1191168404Spjd ASSERT3P(dn->dn_dbuf, ==, db); 1192168404Spjd ASSERT3U(dn->dn_object, ==, object); 1193168404Spjd dbuf_rele(db, FTAG); 1194168404Spjd 1195168404Spjd *dnp = dn; 1196168404Spjd return (0); 1197168404Spjd} 1198168404Spjd 1199168404Spjd/* 1200168404Spjd * Return held dnode if the object is allocated, NULL if not. 1201168404Spjd */ 1202168404Spjdint 1203219089Spjddnode_hold(objset_t *os, uint64_t object, void *tag, dnode_t **dnp) 1204168404Spjd{ 1205168404Spjd return (dnode_hold_impl(os, object, DNODE_MUST_BE_ALLOCATED, tag, dnp)); 1206168404Spjd} 1207168404Spjd 1208185029Spjd/* 1209185029Spjd * Can only add a reference if there is already at least one 1210185029Spjd * reference on the dnode. Returns FALSE if unable to add a 1211185029Spjd * new reference. 1212185029Spjd */ 1213185029Spjdboolean_t 1214168404Spjddnode_add_ref(dnode_t *dn, void *tag) 1215168404Spjd{ 1216185029Spjd mutex_enter(&dn->dn_mtx); 1217185029Spjd if (refcount_is_zero(&dn->dn_holds)) { 1218185029Spjd mutex_exit(&dn->dn_mtx); 1219185029Spjd return (FALSE); 1220185029Spjd } 1221185029Spjd VERIFY(1 < refcount_add(&dn->dn_holds, tag)); 1222185029Spjd mutex_exit(&dn->dn_mtx); 1223185029Spjd return (TRUE); 1224168404Spjd} 1225168404Spjd 1226168404Spjdvoid 1227168404Spjddnode_rele(dnode_t *dn, void *tag) 1228168404Spjd{ 1229288541Smav mutex_enter(&dn->dn_mtx); 1230288541Smav dnode_rele_and_unlock(dn, tag); 1231288541Smav} 1232288541Smav 1233288541Smavvoid 1234288541Smavdnode_rele_and_unlock(dnode_t *dn, void *tag) 1235288541Smav{ 1236168404Spjd uint64_t refs; 1237219089Spjd /* Get while the hold prevents the dnode from moving. */ 1238219089Spjd dmu_buf_impl_t *db = dn->dn_dbuf; 1239219089Spjd dnode_handle_t *dnh = dn->dn_handle; 1240168404Spjd 1241168404Spjd refs = refcount_remove(&dn->dn_holds, tag); 1242185029Spjd mutex_exit(&dn->dn_mtx); 1243219089Spjd 1244219089Spjd /* 1245219089Spjd * It's unsafe to release the last hold on a dnode by dnode_rele() or 1246219089Spjd * indirectly by dbuf_rele() while relying on the dnode handle to 1247219089Spjd * prevent the dnode from moving, since releasing the last hold could 1248219089Spjd * result in the dnode's parent dbuf evicting its dnode handles. For 1249219089Spjd * that reason anyone calling dnode_rele() or dbuf_rele() without some 1250219089Spjd * other direct or indirect hold on the dnode must first drop the dnode 1251219089Spjd * handle. 1252219089Spjd */ 1253219089Spjd ASSERT(refs > 0 || dnh->dnh_zrlock.zr_owner != curthread); 1254219089Spjd 1255168404Spjd /* NOTE: the DNODE_DNODE does not have a dn_dbuf */ 1256219089Spjd if (refs == 0 && db != NULL) { 1257219089Spjd /* 1258219089Spjd * Another thread could add a hold to the dnode handle in 1259219089Spjd * dnode_hold_impl() while holding the parent dbuf. Since the 1260219089Spjd * hold on the parent dbuf prevents the handle from being 1261219089Spjd * destroyed, the hold on the handle is OK. We can't yet assert 1262219089Spjd * that the handle has zero references, but that will be 1263219089Spjd * asserted anyway when the handle gets destroyed. 1264219089Spjd */ 1265219089Spjd dbuf_rele(db, dnh); 1266219089Spjd } 1267168404Spjd} 1268168404Spjd 1269168404Spjdvoid 1270168404Spjddnode_setdirty(dnode_t *dn, dmu_tx_t *tx) 1271168404Spjd{ 1272219089Spjd objset_t *os = dn->dn_objset; 1273168404Spjd uint64_t txg = tx->tx_txg; 1274168404Spjd 1275209962Smm if (DMU_OBJECT_IS_SPECIAL(dn->dn_object)) { 1276209962Smm dsl_dataset_dirty(os->os_dsl_dataset, tx); 1277168404Spjd return; 1278209962Smm } 1279168404Spjd 1280168404Spjd DNODE_VERIFY(dn); 1281168404Spjd 1282168404Spjd#ifdef ZFS_DEBUG 1283168404Spjd mutex_enter(&dn->dn_mtx); 1284168404Spjd ASSERT(dn->dn_phys->dn_type || dn->dn_allocated_txg); 1285219089Spjd ASSERT(dn->dn_free_txg == 0 || dn->dn_free_txg >= txg); 1286168404Spjd mutex_exit(&dn->dn_mtx); 1287168404Spjd#endif 1288168404Spjd 1289219089Spjd /* 1290219089Spjd * Determine old uid/gid when necessary 1291219089Spjd */ 1292219089Spjd dmu_objset_userquota_get_ids(dn, B_TRUE, tx); 1293219089Spjd 1294168404Spjd mutex_enter(&os->os_lock); 1295168404Spjd 1296168404Spjd /* 1297168404Spjd * If we are already marked dirty, we're done. 1298168404Spjd */ 1299168404Spjd if (list_link_active(&dn->dn_dirty_link[txg & TXG_MASK])) { 1300168404Spjd mutex_exit(&os->os_lock); 1301168404Spjd return; 1302168404Spjd } 1303168404Spjd 1304269845Sdelphij ASSERT(!refcount_is_zero(&dn->dn_holds) || 1305269845Sdelphij !avl_is_empty(&dn->dn_dbufs)); 1306168404Spjd ASSERT(dn->dn_datablksz != 0); 1307240415Smm ASSERT0(dn->dn_next_bonuslen[txg&TXG_MASK]); 1308240415Smm ASSERT0(dn->dn_next_blksz[txg&TXG_MASK]); 1309240415Smm ASSERT0(dn->dn_next_bonustype[txg&TXG_MASK]); 1310168404Spjd 1311168404Spjd dprintf_ds(os->os_dsl_dataset, "obj=%llu txg=%llu\n", 1312168404Spjd dn->dn_object, txg); 1313168404Spjd 1314168404Spjd if (dn->dn_free_txg > 0 && dn->dn_free_txg <= txg) { 1315168404Spjd list_insert_tail(&os->os_free_dnodes[txg&TXG_MASK], dn); 1316168404Spjd } else { 1317168404Spjd list_insert_tail(&os->os_dirty_dnodes[txg&TXG_MASK], dn); 1318168404Spjd } 1319168404Spjd 1320168404Spjd mutex_exit(&os->os_lock); 1321168404Spjd 1322168404Spjd /* 1323168404Spjd * The dnode maintains a hold on its containing dbuf as 1324168404Spjd * long as there are holds on it. Each instantiated child 1325219089Spjd * dbuf maintains a hold on the dnode. When the last child 1326168404Spjd * drops its hold, the dnode will drop its hold on the 1327168404Spjd * containing dbuf. We add a "dirty hold" here so that the 1328168404Spjd * dnode will hang around after we finish processing its 1329168404Spjd * children. 1330168404Spjd */ 1331185029Spjd VERIFY(dnode_add_ref(dn, (void *)(uintptr_t)tx->tx_txg)); 1332168404Spjd 1333168404Spjd (void) dbuf_dirty(dn->dn_dbuf, tx); 1334168404Spjd 1335168404Spjd dsl_dataset_dirty(os->os_dsl_dataset, tx); 1336168404Spjd} 1337168404Spjd 1338168404Spjdvoid 1339168404Spjddnode_free(dnode_t *dn, dmu_tx_t *tx) 1340168404Spjd{ 1341168404Spjd int txgoff = tx->tx_txg & TXG_MASK; 1342168404Spjd 1343168404Spjd dprintf("dn=%p txg=%llu\n", dn, tx->tx_txg); 1344168404Spjd 1345168404Spjd /* we should be the only holder... hopefully */ 1346168404Spjd /* ASSERT3U(refcount_count(&dn->dn_holds), ==, 1); */ 1347168404Spjd 1348168404Spjd mutex_enter(&dn->dn_mtx); 1349168404Spjd if (dn->dn_type == DMU_OT_NONE || dn->dn_free_txg) { 1350168404Spjd mutex_exit(&dn->dn_mtx); 1351168404Spjd return; 1352168404Spjd } 1353168404Spjd dn->dn_free_txg = tx->tx_txg; 1354168404Spjd mutex_exit(&dn->dn_mtx); 1355168404Spjd 1356168404Spjd /* 1357168404Spjd * If the dnode is already dirty, it needs to be moved from 1358168404Spjd * the dirty list to the free list. 1359168404Spjd */ 1360168404Spjd mutex_enter(&dn->dn_objset->os_lock); 1361168404Spjd if (list_link_active(&dn->dn_dirty_link[txgoff])) { 1362168404Spjd list_remove(&dn->dn_objset->os_dirty_dnodes[txgoff], dn); 1363168404Spjd list_insert_tail(&dn->dn_objset->os_free_dnodes[txgoff], dn); 1364168404Spjd mutex_exit(&dn->dn_objset->os_lock); 1365168404Spjd } else { 1366168404Spjd mutex_exit(&dn->dn_objset->os_lock); 1367168404Spjd dnode_setdirty(dn, tx); 1368168404Spjd } 1369168404Spjd} 1370168404Spjd 1371168404Spjd/* 1372168404Spjd * Try to change the block size for the indicated dnode. This can only 1373168404Spjd * succeed if there are no blocks allocated or dirty beyond first block 1374168404Spjd */ 1375168404Spjdint 1376168404Spjddnode_set_blksz(dnode_t *dn, uint64_t size, int ibs, dmu_tx_t *tx) 1377168404Spjd{ 1378269845Sdelphij dmu_buf_impl_t *db; 1379185029Spjd int err; 1380168404Spjd 1381276081Sdelphij ASSERT3U(size, <=, spa_maxblocksize(dmu_objset_spa(dn->dn_objset))); 1382168404Spjd if (size == 0) 1383168404Spjd size = SPA_MINBLOCKSIZE; 1384168404Spjd else 1385168404Spjd size = P2ROUNDUP(size, SPA_MINBLOCKSIZE); 1386168404Spjd 1387168404Spjd if (ibs == dn->dn_indblkshift) 1388168404Spjd ibs = 0; 1389168404Spjd 1390168404Spjd if (size >> SPA_MINBLOCKSHIFT == dn->dn_datablkszsec && ibs == 0) 1391168404Spjd return (0); 1392168404Spjd 1393168404Spjd rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 1394168404Spjd 1395168404Spjd /* Check for any allocated blocks beyond the first */ 1396262093Savg if (dn->dn_maxblkid != 0) 1397168404Spjd goto fail; 1398168404Spjd 1399168404Spjd mutex_enter(&dn->dn_dbufs_mtx); 1400269845Sdelphij for (db = avl_first(&dn->dn_dbufs); db != NULL; 1401269845Sdelphij db = AVL_NEXT(&dn->dn_dbufs, db)) { 1402219089Spjd if (db->db_blkid != 0 && db->db_blkid != DMU_BONUS_BLKID && 1403219089Spjd db->db_blkid != DMU_SPILL_BLKID) { 1404168404Spjd mutex_exit(&dn->dn_dbufs_mtx); 1405168404Spjd goto fail; 1406168404Spjd } 1407168404Spjd } 1408168404Spjd mutex_exit(&dn->dn_dbufs_mtx); 1409168404Spjd 1410168404Spjd if (ibs && dn->dn_nlevels != 1) 1411168404Spjd goto fail; 1412168404Spjd 1413185029Spjd /* resize the old block */ 1414288571Smav err = dbuf_hold_impl(dn, 0, 0, TRUE, FALSE, FTAG, &db); 1415185029Spjd if (err == 0) 1416168404Spjd dbuf_new_size(db, size, tx); 1417185029Spjd else if (err != ENOENT) 1418185029Spjd goto fail; 1419168404Spjd 1420168404Spjd dnode_setdblksz(dn, size); 1421168404Spjd dnode_setdirty(dn, tx); 1422168404Spjd dn->dn_next_blksz[tx->tx_txg&TXG_MASK] = size; 1423168404Spjd if (ibs) { 1424168404Spjd dn->dn_indblkshift = ibs; 1425168404Spjd dn->dn_next_indblkshift[tx->tx_txg&TXG_MASK] = ibs; 1426168404Spjd } 1427185029Spjd /* rele after we have fixed the blocksize in the dnode */ 1428168404Spjd if (db) 1429168404Spjd dbuf_rele(db, FTAG); 1430168404Spjd 1431168404Spjd rw_exit(&dn->dn_struct_rwlock); 1432168404Spjd return (0); 1433168404Spjd 1434168404Spjdfail: 1435168404Spjd rw_exit(&dn->dn_struct_rwlock); 1436249195Smm return (SET_ERROR(ENOTSUP)); 1437168404Spjd} 1438168404Spjd 1439185029Spjd/* read-holding callers must not rely on the lock being continuously held */ 1440168404Spjdvoid 1441185029Spjddnode_new_blkid(dnode_t *dn, uint64_t blkid, dmu_tx_t *tx, boolean_t have_read) 1442168404Spjd{ 1443168404Spjd uint64_t txgoff = tx->tx_txg & TXG_MASK; 1444168404Spjd int epbs, new_nlevels; 1445168404Spjd uint64_t sz; 1446168404Spjd 1447219089Spjd ASSERT(blkid != DMU_BONUS_BLKID); 1448168404Spjd 1449185029Spjd ASSERT(have_read ? 1450185029Spjd RW_READ_HELD(&dn->dn_struct_rwlock) : 1451185029Spjd RW_WRITE_HELD(&dn->dn_struct_rwlock)); 1452185029Spjd 1453185029Spjd /* 1454185029Spjd * if we have a read-lock, check to see if we need to do any work 1455185029Spjd * before upgrading to a write-lock. 1456185029Spjd */ 1457185029Spjd if (have_read) { 1458185029Spjd if (blkid <= dn->dn_maxblkid) 1459185029Spjd return; 1460185029Spjd 1461185029Spjd if (!rw_tryupgrade(&dn->dn_struct_rwlock)) { 1462185029Spjd rw_exit(&dn->dn_struct_rwlock); 1463185029Spjd rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 1464185029Spjd } 1465168404Spjd } 1466168404Spjd 1467168404Spjd if (blkid <= dn->dn_maxblkid) 1468168404Spjd goto out; 1469168404Spjd 1470168404Spjd dn->dn_maxblkid = blkid; 1471168404Spjd 1472168404Spjd /* 1473168404Spjd * Compute the number of levels necessary to support the new maxblkid. 1474168404Spjd */ 1475168404Spjd new_nlevels = 1; 1476168404Spjd epbs = dn->dn_indblkshift - SPA_BLKPTRSHIFT; 1477168404Spjd for (sz = dn->dn_nblkptr; 1478168404Spjd sz <= blkid && sz >= dn->dn_nblkptr; sz <<= epbs) 1479168404Spjd new_nlevels++; 1480168404Spjd 1481168404Spjd if (new_nlevels > dn->dn_nlevels) { 1482168404Spjd int old_nlevels = dn->dn_nlevels; 1483168404Spjd dmu_buf_impl_t *db; 1484168404Spjd list_t *list; 1485168404Spjd dbuf_dirty_record_t *new, *dr, *dr_next; 1486168404Spjd 1487168404Spjd dn->dn_nlevels = new_nlevels; 1488168404Spjd 1489168404Spjd ASSERT3U(new_nlevels, >, dn->dn_next_nlevels[txgoff]); 1490168404Spjd dn->dn_next_nlevels[txgoff] = new_nlevels; 1491168404Spjd 1492168404Spjd /* dirty the left indirects */ 1493168404Spjd db = dbuf_hold_level(dn, old_nlevels, 0, FTAG); 1494219089Spjd ASSERT(db != NULL); 1495168404Spjd new = dbuf_dirty(db, tx); 1496168404Spjd dbuf_rele(db, FTAG); 1497168404Spjd 1498168404Spjd /* transfer the dirty records to the new indirect */ 1499168404Spjd mutex_enter(&dn->dn_mtx); 1500168404Spjd mutex_enter(&new->dt.di.dr_mtx); 1501168404Spjd list = &dn->dn_dirty_records[txgoff]; 1502168404Spjd for (dr = list_head(list); dr; dr = dr_next) { 1503168404Spjd dr_next = list_next(&dn->dn_dirty_records[txgoff], dr); 1504168404Spjd if (dr->dr_dbuf->db_level != new_nlevels-1 && 1505219089Spjd dr->dr_dbuf->db_blkid != DMU_BONUS_BLKID && 1506219089Spjd dr->dr_dbuf->db_blkid != DMU_SPILL_BLKID) { 1507168404Spjd ASSERT(dr->dr_dbuf->db_level == old_nlevels-1); 1508168404Spjd list_remove(&dn->dn_dirty_records[txgoff], dr); 1509168404Spjd list_insert_tail(&new->dt.di.dr_children, dr); 1510168404Spjd dr->dr_parent = new; 1511168404Spjd } 1512168404Spjd } 1513168404Spjd mutex_exit(&new->dt.di.dr_mtx); 1514168404Spjd mutex_exit(&dn->dn_mtx); 1515168404Spjd } 1516168404Spjd 1517168404Spjdout: 1518185029Spjd if (have_read) 1519185029Spjd rw_downgrade(&dn->dn_struct_rwlock); 1520168404Spjd} 1521168404Spjd 1522285202Savgstatic void 1523285202Savgdnode_dirty_l1(dnode_t *dn, uint64_t l1blkid, dmu_tx_t *tx) 1524285202Savg{ 1525285202Savg dmu_buf_impl_t *db = dbuf_hold_level(dn, 1, l1blkid, FTAG); 1526285202Savg if (db != NULL) { 1527285202Savg dmu_buf_will_dirty(&db->db, tx); 1528285202Savg dbuf_rele(db, FTAG); 1529285202Savg } 1530285202Savg} 1531285202Savg 1532168404Spjdvoid 1533168404Spjddnode_free_range(dnode_t *dn, uint64_t off, uint64_t len, dmu_tx_t *tx) 1534168404Spjd{ 1535168404Spjd dmu_buf_impl_t *db; 1536168404Spjd uint64_t blkoff, blkid, nblks; 1537185029Spjd int blksz, blkshift, head, tail; 1538168404Spjd int trunc = FALSE; 1539185029Spjd int epbs; 1540168404Spjd 1541168404Spjd rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 1542168404Spjd blksz = dn->dn_datablksz; 1543185029Spjd blkshift = dn->dn_datablkshift; 1544185029Spjd epbs = dn->dn_indblkshift - SPA_BLKPTRSHIFT; 1545168404Spjd 1546254753Sdelphij if (len == DMU_OBJECT_END) { 1547168404Spjd len = UINT64_MAX - off; 1548168404Spjd trunc = TRUE; 1549168404Spjd } 1550168404Spjd 1551168404Spjd /* 1552168404Spjd * First, block align the region to free: 1553168404Spjd */ 1554168404Spjd if (ISP2(blksz)) { 1555168404Spjd head = P2NPHASE(off, blksz); 1556168404Spjd blkoff = P2PHASE(off, blksz); 1557185029Spjd if ((off >> blkshift) > dn->dn_maxblkid) 1558185029Spjd goto out; 1559168404Spjd } else { 1560168404Spjd ASSERT(dn->dn_maxblkid == 0); 1561168404Spjd if (off == 0 && len >= blksz) { 1562263397Sdelphij /* 1563263397Sdelphij * Freeing the whole block; fast-track this request. 1564263397Sdelphij * Note that we won't dirty any indirect blocks, 1565263397Sdelphij * which is fine because we will be freeing the entire 1566263397Sdelphij * file and thus all indirect blocks will be freed 1567263397Sdelphij * by free_children(). 1568263397Sdelphij */ 1569185029Spjd blkid = 0; 1570185029Spjd nblks = 1; 1571185029Spjd goto done; 1572185029Spjd } else if (off >= blksz) { 1573185029Spjd /* Freeing past end-of-data */ 1574185029Spjd goto out; 1575168404Spjd } else { 1576168404Spjd /* Freeing part of the block. */ 1577168404Spjd head = blksz - off; 1578168404Spjd ASSERT3U(head, >, 0); 1579168404Spjd } 1580168404Spjd blkoff = off; 1581168404Spjd } 1582168404Spjd /* zero out any partial block data at the start of the range */ 1583168404Spjd if (head) { 1584168404Spjd ASSERT3U(blkoff + head, ==, blksz); 1585168404Spjd if (len < head) 1586168404Spjd head = len; 1587288571Smav if (dbuf_hold_impl(dn, 0, dbuf_whichblock(dn, 0, off), 1588288571Smav TRUE, FALSE, FTAG, &db) == 0) { 1589168404Spjd caddr_t data; 1590168404Spjd 1591168404Spjd /* don't dirty if it isn't on disk and isn't dirty */ 1592168404Spjd if (db->db_last_dirty || 1593168404Spjd (db->db_blkptr && !BP_IS_HOLE(db->db_blkptr))) { 1594168404Spjd rw_exit(&dn->dn_struct_rwlock); 1595263397Sdelphij dmu_buf_will_dirty(&db->db, tx); 1596168404Spjd rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 1597168404Spjd data = db->db.db_data; 1598168404Spjd bzero(data + blkoff, head); 1599168404Spjd } 1600168404Spjd dbuf_rele(db, FTAG); 1601168404Spjd } 1602168404Spjd off += head; 1603168404Spjd len -= head; 1604168404Spjd } 1605168404Spjd 1606168404Spjd /* If the range was less than one block, we're done */ 1607185029Spjd if (len == 0) 1608168404Spjd goto out; 1609168404Spjd 1610185029Spjd /* If the remaining range is past end of file, we're done */ 1611185029Spjd if ((off >> blkshift) > dn->dn_maxblkid) 1612185029Spjd goto out; 1613168404Spjd 1614185029Spjd ASSERT(ISP2(blksz)); 1615185029Spjd if (trunc) 1616185029Spjd tail = 0; 1617185029Spjd else 1618185029Spjd tail = P2PHASE(len, blksz); 1619168404Spjd 1620240415Smm ASSERT0(P2PHASE(off, blksz)); 1621185029Spjd /* zero out any partial block data at the end of the range */ 1622185029Spjd if (tail) { 1623185029Spjd if (len < tail) 1624185029Spjd tail = len; 1625288571Smav if (dbuf_hold_impl(dn, 0, dbuf_whichblock(dn, 0, off+len), 1626288571Smav TRUE, FALSE, FTAG, &db) == 0) { 1627185029Spjd /* don't dirty if not on disk and not dirty */ 1628185029Spjd if (db->db_last_dirty || 1629185029Spjd (db->db_blkptr && !BP_IS_HOLE(db->db_blkptr))) { 1630185029Spjd rw_exit(&dn->dn_struct_rwlock); 1631263397Sdelphij dmu_buf_will_dirty(&db->db, tx); 1632185029Spjd rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 1633185029Spjd bzero(db->db.db_data, tail); 1634168404Spjd } 1635185029Spjd dbuf_rele(db, FTAG); 1636168404Spjd } 1637185029Spjd len -= tail; 1638185029Spjd } 1639168404Spjd 1640185029Spjd /* If the range did not include a full block, we are done */ 1641185029Spjd if (len == 0) 1642185029Spjd goto out; 1643185029Spjd 1644185029Spjd ASSERT(IS_P2ALIGNED(off, blksz)); 1645185029Spjd ASSERT(trunc || IS_P2ALIGNED(len, blksz)); 1646185029Spjd blkid = off >> blkshift; 1647185029Spjd nblks = len >> blkshift; 1648185029Spjd if (trunc) 1649185029Spjd nblks += 1; 1650185029Spjd 1651185029Spjd /* 1652285202Savg * Dirty all the indirect blocks in this range. Note that only 1653285202Savg * the first and last indirect blocks can actually be written 1654285202Savg * (if they were partially freed) -- they must be dirtied, even if 1655285202Savg * they do not exist on disk yet. The interior blocks will 1656285202Savg * be freed by free_children(), so they will not actually be written. 1657285202Savg * Even though these interior blocks will not be written, we 1658285202Savg * dirty them for two reasons: 1659285202Savg * 1660285202Savg * - It ensures that the indirect blocks remain in memory until 1661285202Savg * syncing context. (They have already been prefetched by 1662285202Savg * dmu_tx_hold_free(), so we don't have to worry about reading 1663285202Savg * them serially here.) 1664285202Savg * 1665285202Savg * - The dirty space accounting will put pressure on the txg sync 1666285202Savg * mechanism to begin syncing, and to delay transactions if there 1667285202Savg * is a large amount of freeing. Even though these indirect 1668285202Savg * blocks will not be written, we could need to write the same 1669285202Savg * amount of space if we copy the freed BPs into deadlists. 1670185029Spjd */ 1671185029Spjd if (dn->dn_nlevels > 1) { 1672263397Sdelphij uint64_t first, last; 1673185029Spjd 1674185029Spjd first = blkid >> epbs; 1675285202Savg dnode_dirty_l1(dn, first, tx); 1676185029Spjd if (trunc) 1677185029Spjd last = dn->dn_maxblkid >> epbs; 1678185029Spjd else 1679185029Spjd last = (blkid + nblks - 1) >> epbs; 1680285202Savg if (last != first) 1681285202Savg dnode_dirty_l1(dn, last, tx); 1682285202Savg 1683285202Savg int shift = dn->dn_datablkshift + dn->dn_indblkshift - 1684285202Savg SPA_BLKPTRSHIFT; 1685285202Savg for (uint64_t i = first + 1; i < last; i++) { 1686285202Savg /* 1687285202Savg * Set i to the blockid of the next non-hole 1688285202Savg * level-1 indirect block at or after i. Note 1689285202Savg * that dnode_next_offset() operates in terms of 1690285202Savg * level-0-equivalent bytes. 1691285202Savg */ 1692285202Savg uint64_t ibyte = i << shift; 1693285202Savg int err = dnode_next_offset(dn, DNODE_FIND_HAVELOCK, 1694285202Savg &ibyte, 2, 1, 0); 1695285202Savg i = ibyte >> shift; 1696285202Savg if (i >= last) 1697285202Savg break; 1698285202Savg 1699285202Savg /* 1700285202Savg * Normally we should not see an error, either 1701285202Savg * from dnode_next_offset() or dbuf_hold_level() 1702285202Savg * (except for ESRCH from dnode_next_offset). 1703285202Savg * If there is an i/o error, then when we read 1704285202Savg * this block in syncing context, it will use 1705285202Savg * ZIO_FLAG_MUSTSUCCEED, and thus hang/panic according 1706285202Savg * to the "failmode" property. dnode_next_offset() 1707285202Savg * doesn't have a flag to indicate MUSTSUCCEED. 1708285202Savg */ 1709285202Savg if (err != 0) 1710285202Savg break; 1711285202Savg 1712285202Savg dnode_dirty_l1(dn, i, tx); 1713168404Spjd } 1714263397Sdelphij } 1715168404Spjd 1716185029Spjddone: 1717185029Spjd /* 1718185029Spjd * Add this range to the dnode range list. 1719185029Spjd * We will finish up this free operation in the syncing phase. 1720185029Spjd */ 1721168404Spjd mutex_enter(&dn->dn_mtx); 1722265740Sdelphij int txgoff = tx->tx_txg & TXG_MASK; 1723265740Sdelphij if (dn->dn_free_ranges[txgoff] == NULL) { 1724265740Sdelphij dn->dn_free_ranges[txgoff] = 1725265740Sdelphij range_tree_create(NULL, NULL, &dn->dn_mtx); 1726168404Spjd } 1727265740Sdelphij range_tree_clear(dn->dn_free_ranges[txgoff], blkid, nblks); 1728265740Sdelphij range_tree_add(dn->dn_free_ranges[txgoff], blkid, nblks); 1729265740Sdelphij dprintf_dnode(dn, "blkid=%llu nblks=%llu txg=%llu\n", 1730265740Sdelphij blkid, nblks, tx->tx_txg); 1731168404Spjd mutex_exit(&dn->dn_mtx); 1732168404Spjd 1733185029Spjd dbuf_free_range(dn, blkid, blkid + nblks - 1, tx); 1734168404Spjd dnode_setdirty(dn, tx); 1735168404Spjdout: 1736185029Spjd 1737168404Spjd rw_exit(&dn->dn_struct_rwlock); 1738168404Spjd} 1739168404Spjd 1740219089Spjdstatic boolean_t 1741219089Spjddnode_spill_freed(dnode_t *dn) 1742219089Spjd{ 1743219089Spjd int i; 1744219089Spjd 1745219089Spjd mutex_enter(&dn->dn_mtx); 1746219089Spjd for (i = 0; i < TXG_SIZE; i++) { 1747219089Spjd if (dn->dn_rm_spillblk[i] == DN_KILL_SPILLBLK) 1748219089Spjd break; 1749219089Spjd } 1750219089Spjd mutex_exit(&dn->dn_mtx); 1751219089Spjd return (i < TXG_SIZE); 1752219089Spjd} 1753219089Spjd 1754168404Spjd/* return TRUE if this blkid was freed in a recent txg, or FALSE if it wasn't */ 1755168404Spjduint64_t 1756168404Spjddnode_block_freed(dnode_t *dn, uint64_t blkid) 1757168404Spjd{ 1758168404Spjd void *dp = spa_get_dsl(dn->dn_objset->os_spa); 1759168404Spjd int i; 1760168404Spjd 1761219089Spjd if (blkid == DMU_BONUS_BLKID) 1762168404Spjd return (FALSE); 1763168404Spjd 1764168404Spjd /* 1765168404Spjd * If we're in the process of opening the pool, dp will not be 1766168404Spjd * set yet, but there shouldn't be anything dirty. 1767168404Spjd */ 1768168404Spjd if (dp == NULL) 1769168404Spjd return (FALSE); 1770168404Spjd 1771168404Spjd if (dn->dn_free_txg) 1772168404Spjd return (TRUE); 1773168404Spjd 1774219089Spjd if (blkid == DMU_SPILL_BLKID) 1775219089Spjd return (dnode_spill_freed(dn)); 1776219089Spjd 1777168404Spjd mutex_enter(&dn->dn_mtx); 1778168404Spjd for (i = 0; i < TXG_SIZE; i++) { 1779265740Sdelphij if (dn->dn_free_ranges[i] != NULL && 1780265740Sdelphij range_tree_contains(dn->dn_free_ranges[i], blkid, 1)) 1781168404Spjd break; 1782168404Spjd } 1783168404Spjd mutex_exit(&dn->dn_mtx); 1784168404Spjd return (i < TXG_SIZE); 1785168404Spjd} 1786168404Spjd 1787168404Spjd/* call from syncing context when we actually write/free space for this dnode */ 1788168404Spjdvoid 1789168404Spjddnode_diduse_space(dnode_t *dn, int64_t delta) 1790168404Spjd{ 1791168404Spjd uint64_t space; 1792168404Spjd dprintf_dnode(dn, "dn=%p dnp=%p used=%llu delta=%lld\n", 1793168404Spjd dn, dn->dn_phys, 1794168404Spjd (u_longlong_t)dn->dn_phys->dn_used, 1795168404Spjd (longlong_t)delta); 1796168404Spjd 1797168404Spjd mutex_enter(&dn->dn_mtx); 1798168404Spjd space = DN_USED_BYTES(dn->dn_phys); 1799168404Spjd if (delta > 0) { 1800168404Spjd ASSERT3U(space + delta, >=, space); /* no overflow */ 1801168404Spjd } else { 1802168404Spjd ASSERT3U(space, >=, -delta); /* no underflow */ 1803168404Spjd } 1804168404Spjd space += delta; 1805185029Spjd if (spa_version(dn->dn_objset->os_spa) < SPA_VERSION_DNODE_BYTES) { 1806168404Spjd ASSERT((dn->dn_phys->dn_flags & DNODE_FLAG_USED_BYTES) == 0); 1807240415Smm ASSERT0(P2PHASE(space, 1<<DEV_BSHIFT)); 1808168404Spjd dn->dn_phys->dn_used = space >> DEV_BSHIFT; 1809168404Spjd } else { 1810168404Spjd dn->dn_phys->dn_used = space; 1811168404Spjd dn->dn_phys->dn_flags |= DNODE_FLAG_USED_BYTES; 1812168404Spjd } 1813168404Spjd mutex_exit(&dn->dn_mtx); 1814168404Spjd} 1815168404Spjd 1816168404Spjd/* 1817260763Savg * Call when we think we're going to write/free space in open context to track 1818260763Savg * the amount of memory in use by the currently open txg. 1819168404Spjd */ 1820168404Spjdvoid 1821168404Spjddnode_willuse_space(dnode_t *dn, int64_t space, dmu_tx_t *tx) 1822168404Spjd{ 1823219089Spjd objset_t *os = dn->dn_objset; 1824168404Spjd dsl_dataset_t *ds = os->os_dsl_dataset; 1825260763Savg int64_t aspace = spa_get_asize(os->os_spa, space); 1826168404Spjd 1827260763Savg if (ds != NULL) { 1828260763Savg dsl_dir_willuse_space(ds->ds_dir, aspace, tx); 1829260763Savg dsl_pool_dirty_space(dmu_tx_pool(tx), space, tx); 1830260763Savg } 1831168404Spjd 1832260763Savg dmu_tx_willuse_space(tx, aspace); 1833168404Spjd} 1834168404Spjd 1835208775Smm/* 1836251631Sdelphij * Scans a block at the indicated "level" looking for a hole or data, 1837251631Sdelphij * depending on 'flags'. 1838208775Smm * 1839251631Sdelphij * If level > 0, then we are scanning an indirect block looking at its 1840251631Sdelphij * pointers. If level == 0, then we are looking at a block of dnodes. 1841251631Sdelphij * 1842251631Sdelphij * If we don't find what we are looking for in the block, we return ESRCH. 1843251631Sdelphij * Otherwise, return with *offset pointing to the beginning (if searching 1844251631Sdelphij * forwards) or end (if searching backwards) of the range covered by the 1845251631Sdelphij * block pointer we matched on (or dnode). 1846251631Sdelphij * 1847208775Smm * The basic search algorithm used below by dnode_next_offset() is to 1848208775Smm * use this function to search up the block tree (widen the search) until 1849208775Smm * we find something (i.e., we don't return ESRCH) and then search back 1850208775Smm * down the tree (narrow the search) until we reach our original search 1851208775Smm * level. 1852208775Smm */ 1853168404Spjdstatic int 1854185029Spjddnode_next_offset_level(dnode_t *dn, int flags, uint64_t *offset, 1855288571Smav int lvl, uint64_t blkfill, uint64_t txg) 1856168404Spjd{ 1857168404Spjd dmu_buf_impl_t *db = NULL; 1858168404Spjd void *data = NULL; 1859168404Spjd uint64_t epbs = dn->dn_phys->dn_indblkshift - SPA_BLKPTRSHIFT; 1860168404Spjd uint64_t epb = 1ULL << epbs; 1861168404Spjd uint64_t minfill, maxfill; 1862185029Spjd boolean_t hole; 1863185029Spjd int i, inc, error, span; 1864168404Spjd 1865168404Spjd dprintf("probing object %llu offset %llx level %d of %u\n", 1866168404Spjd dn->dn_object, *offset, lvl, dn->dn_phys->dn_nlevels); 1867168404Spjd 1868209962Smm hole = ((flags & DNODE_FIND_HOLE) != 0); 1869185029Spjd inc = (flags & DNODE_FIND_BACKWARDS) ? -1 : 1; 1870185029Spjd ASSERT(txg == 0 || !hole); 1871185029Spjd 1872168404Spjd if (lvl == dn->dn_phys->dn_nlevels) { 1873168404Spjd error = 0; 1874168404Spjd epb = dn->dn_phys->dn_nblkptr; 1875168404Spjd data = dn->dn_phys->dn_blkptr; 1876168404Spjd } else { 1877288571Smav uint64_t blkid = dbuf_whichblock(dn, lvl, *offset); 1878288571Smav error = dbuf_hold_impl(dn, lvl, blkid, TRUE, FALSE, FTAG, &db); 1879168404Spjd if (error) { 1880185029Spjd if (error != ENOENT) 1881185029Spjd return (error); 1882185029Spjd if (hole) 1883185029Spjd return (0); 1884185029Spjd /* 1885185029Spjd * This can only happen when we are searching up 1886185029Spjd * the block tree for data. We don't really need to 1887185029Spjd * adjust the offset, as we will just end up looking 1888185029Spjd * at the pointer to this block in its parent, and its 1889185029Spjd * going to be unallocated, so we will skip over it. 1890185029Spjd */ 1891249195Smm return (SET_ERROR(ESRCH)); 1892168404Spjd } 1893168404Spjd error = dbuf_read(db, NULL, DB_RF_CANFAIL | DB_RF_HAVESTRUCT); 1894168404Spjd if (error) { 1895168404Spjd dbuf_rele(db, FTAG); 1896168404Spjd return (error); 1897168404Spjd } 1898168404Spjd data = db->db.db_data; 1899168404Spjd } 1900168404Spjd 1901263397Sdelphij 1902263397Sdelphij if (db != NULL && txg != 0 && (db->db_blkptr == NULL || 1903263397Sdelphij db->db_blkptr->blk_birth <= txg || 1904263397Sdelphij BP_IS_HOLE(db->db_blkptr))) { 1905185029Spjd /* 1906185029Spjd * This can only happen when we are searching up the tree 1907185029Spjd * and these conditions mean that we need to keep climbing. 1908185029Spjd */ 1909249195Smm error = SET_ERROR(ESRCH); 1910168404Spjd } else if (lvl == 0) { 1911168404Spjd dnode_phys_t *dnp = data; 1912168404Spjd span = DNODE_SHIFT; 1913168404Spjd ASSERT(dn->dn_type == DMU_OT_DNODE); 1914168404Spjd 1915185029Spjd for (i = (*offset >> span) & (blkfill - 1); 1916185029Spjd i >= 0 && i < blkfill; i += inc) { 1917209094Smm if ((dnp[i].dn_type == DMU_OT_NONE) == hole) 1918168404Spjd break; 1919185029Spjd *offset += (1ULL << span) * inc; 1920168404Spjd } 1921185029Spjd if (i < 0 || i == blkfill) 1922249195Smm error = SET_ERROR(ESRCH); 1923168404Spjd } else { 1924168404Spjd blkptr_t *bp = data; 1925208775Smm uint64_t start = *offset; 1926168404Spjd span = (lvl - 1) * epbs + dn->dn_datablkshift; 1927168404Spjd minfill = 0; 1928168404Spjd maxfill = blkfill << ((lvl - 1) * epbs); 1929168404Spjd 1930168404Spjd if (hole) 1931168404Spjd maxfill--; 1932168404Spjd else 1933168404Spjd minfill++; 1934168404Spjd 1935208775Smm *offset = *offset >> span; 1936208775Smm for (i = BF64_GET(*offset, 0, epbs); 1937185029Spjd i >= 0 && i < epb; i += inc) { 1938268649Sdelphij if (BP_GET_FILL(&bp[i]) >= minfill && 1939268649Sdelphij BP_GET_FILL(&bp[i]) <= maxfill && 1940185029Spjd (hole || bp[i].blk_birth > txg)) 1941168404Spjd break; 1942208775Smm if (inc > 0 || *offset > 0) 1943208775Smm *offset += inc; 1944168404Spjd } 1945208775Smm *offset = *offset << span; 1946208775Smm if (inc < 0) { 1947208775Smm /* traversing backwards; position offset at the end */ 1948208775Smm ASSERT3U(*offset, <=, start); 1949208775Smm *offset = MIN(*offset + (1ULL << span) - 1, start); 1950208775Smm } else if (*offset < start) { 1951208775Smm *offset = start; 1952208775Smm } 1953208775Smm if (i < 0 || i >= epb) 1954249195Smm error = SET_ERROR(ESRCH); 1955168404Spjd } 1956168404Spjd 1957168404Spjd if (db) 1958168404Spjd dbuf_rele(db, FTAG); 1959168404Spjd 1960168404Spjd return (error); 1961168404Spjd} 1962168404Spjd 1963168404Spjd/* 1964168404Spjd * Find the next hole, data, or sparse region at or after *offset. 1965168404Spjd * The value 'blkfill' tells us how many items we expect to find 1966168404Spjd * in an L0 data block; this value is 1 for normal objects, 1967168404Spjd * DNODES_PER_BLOCK for the meta dnode, and some fraction of 1968168404Spjd * DNODES_PER_BLOCK when searching for sparse regions thereof. 1969168404Spjd * 1970168404Spjd * Examples: 1971168404Spjd * 1972185029Spjd * dnode_next_offset(dn, flags, offset, 1, 1, 0); 1973185029Spjd * Finds the next/previous hole/data in a file. 1974168404Spjd * Used in dmu_offset_next(). 1975168404Spjd * 1976185029Spjd * dnode_next_offset(mdn, flags, offset, 0, DNODES_PER_BLOCK, txg); 1977168404Spjd * Finds the next free/allocated dnode an objset's meta-dnode. 1978168404Spjd * Only finds objects that have new contents since txg (ie. 1979168404Spjd * bonus buffer changes and content removal are ignored). 1980168404Spjd * Used in dmu_object_next(). 1981168404Spjd * 1982185029Spjd * dnode_next_offset(mdn, DNODE_FIND_HOLE, offset, 2, DNODES_PER_BLOCK >> 2, 0); 1983168404Spjd * Finds the next L2 meta-dnode bp that's at most 1/4 full. 1984168404Spjd * Used in dmu_object_alloc(). 1985168404Spjd */ 1986168404Spjdint 1987185029Spjddnode_next_offset(dnode_t *dn, int flags, uint64_t *offset, 1988168404Spjd int minlvl, uint64_t blkfill, uint64_t txg) 1989168404Spjd{ 1990185029Spjd uint64_t initial_offset = *offset; 1991168404Spjd int lvl, maxlvl; 1992168404Spjd int error = 0; 1993168404Spjd 1994185029Spjd if (!(flags & DNODE_FIND_HAVELOCK)) 1995185029Spjd rw_enter(&dn->dn_struct_rwlock, RW_READER); 1996168404Spjd 1997168404Spjd if (dn->dn_phys->dn_nlevels == 0) { 1998249195Smm error = SET_ERROR(ESRCH); 1999185029Spjd goto out; 2000168404Spjd } 2001168404Spjd 2002168404Spjd if (dn->dn_datablkshift == 0) { 2003168404Spjd if (*offset < dn->dn_datablksz) { 2004185029Spjd if (flags & DNODE_FIND_HOLE) 2005168404Spjd *offset = dn->dn_datablksz; 2006168404Spjd } else { 2007249195Smm error = SET_ERROR(ESRCH); 2008168404Spjd } 2009185029Spjd goto out; 2010168404Spjd } 2011168404Spjd 2012168404Spjd maxlvl = dn->dn_phys->dn_nlevels; 2013168404Spjd 2014168404Spjd for (lvl = minlvl; lvl <= maxlvl; lvl++) { 2015168404Spjd error = dnode_next_offset_level(dn, 2016185029Spjd flags, offset, lvl, blkfill, txg); 2017168404Spjd if (error != ESRCH) 2018168404Spjd break; 2019168404Spjd } 2020168404Spjd 2021185029Spjd while (error == 0 && --lvl >= minlvl) { 2022168404Spjd error = dnode_next_offset_level(dn, 2023185029Spjd flags, offset, lvl, blkfill, txg); 2024168404Spjd } 2025168404Spjd 2026272134Sdelphij /* 2027272134Sdelphij * There's always a "virtual hole" at the end of the object, even 2028272134Sdelphij * if all BP's which physically exist are non-holes. 2029272134Sdelphij */ 2030272134Sdelphij if ((flags & DNODE_FIND_HOLE) && error == ESRCH && txg == 0 && 2031272134Sdelphij minlvl == 1 && blkfill == 1 && !(flags & DNODE_FIND_BACKWARDS)) { 2032272134Sdelphij error = 0; 2033272134Sdelphij } 2034272134Sdelphij 2035185029Spjd if (error == 0 && (flags & DNODE_FIND_BACKWARDS ? 2036185029Spjd initial_offset < *offset : initial_offset > *offset)) 2037249195Smm error = SET_ERROR(ESRCH); 2038185029Spjdout: 2039185029Spjd if (!(flags & DNODE_FIND_HAVELOCK)) 2040185029Spjd rw_exit(&dn->dn_struct_rwlock); 2041168404Spjd 2042168404Spjd return (error); 2043168404Spjd} 2044