1fa9e4066Sahrens /* 2fa9e4066Sahrens * CDDL HEADER START 3fa9e4066Sahrens * 4fa9e4066Sahrens * The contents of this file are subject to the terms of the 5f65e61c0Sahrens * Common Development and Distribution License (the "License"). 6f65e61c0Sahrens * You may not use this file except in compliance with the License. 7fa9e4066Sahrens * 8fa9e4066Sahrens * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE 9fa9e4066Sahrens * or http://www.opensolaris.org/os/licensing. 10fa9e4066Sahrens * See the License for the specific language governing permissions 11fa9e4066Sahrens * and limitations under the License. 12fa9e4066Sahrens * 13fa9e4066Sahrens * When distributing Covered Code, include this CDDL HEADER in each 14fa9e4066Sahrens * file and include the License file at usr/src/OPENSOLARIS.LICENSE. 15fa9e4066Sahrens * If applicable, add the following below this CDDL HEADER, with the 16fa9e4066Sahrens * fields enclosed by brackets "[]" replaced with your own identifying 17fa9e4066Sahrens * information: Portions Copyright [yyyy] [name of copyright owner] 18fa9e4066Sahrens * 19fa9e4066Sahrens * CDDL HEADER END 20fa9e4066Sahrens */ 21fa9e4066Sahrens /* 225a98e54bSBrendan Gregg - Sun Microsystems * Copyright 2009 Sun Microsystems, Inc. All rights reserved. 23fa9e4066Sahrens * Use is subject to license terms. 24fa9e4066Sahrens */ 25fa9e4066Sahrens 26fa9e4066Sahrens #include <sys/zfs_context.h> 27fa9e4066Sahrens #include <sys/dbuf.h> 28fa9e4066Sahrens #include <sys/dnode.h> 29fa9e4066Sahrens #include <sys/dmu.h> 30fa9e4066Sahrens #include <sys/dmu_impl.h> 31fa9e4066Sahrens #include <sys/dmu_tx.h> 32fa9e4066Sahrens #include <sys/dmu_objset.h> 33fa9e4066Sahrens #include <sys/dsl_dir.h> 34fa9e4066Sahrens #include <sys/dsl_dataset.h> 35fa9e4066Sahrens #include <sys/spa.h> 36fa9e4066Sahrens #include <sys/zio.h> 37fa9e4066Sahrens #include <sys/dmu_zfetch.h> 38fa9e4066Sahrens 39fa9e4066Sahrens static int free_range_compar(const void *node1, const void *node2); 40fa9e4066Sahrens 41fa9e4066Sahrens static kmem_cache_t *dnode_cache; 42fa9e4066Sahrens 43fa9e4066Sahrens static dnode_phys_t dnode_phys_zero; 44fa9e4066Sahrens 45fa9e4066Sahrens int zfs_default_bs = SPA_MINBLOCKSHIFT; 46fa9e4066Sahrens int zfs_default_ibs = DN_MAX_INDBLKSHIFT; 47fa9e4066Sahrens 48fa9e4066Sahrens /* ARGSUSED */ 49fa9e4066Sahrens static int 50fa9e4066Sahrens dnode_cons(void *arg, void *unused, int kmflag) 51fa9e4066Sahrens { 52fa9e4066Sahrens int i; 53fa9e4066Sahrens dnode_t *dn = arg; 54fa9e4066Sahrens bzero(dn, sizeof (dnode_t)); 55fa9e4066Sahrens 56fa9e4066Sahrens rw_init(&dn->dn_struct_rwlock, NULL, RW_DEFAULT, NULL); 57fa9e4066Sahrens mutex_init(&dn->dn_mtx, NULL, MUTEX_DEFAULT, NULL); 58fa9e4066Sahrens mutex_init(&dn->dn_dbufs_mtx, NULL, MUTEX_DEFAULT, NULL); 59b5e70f97SRicardo M. Correia cv_init(&dn->dn_notxholds, NULL, CV_DEFAULT, NULL); 60b5e70f97SRicardo M. Correia 61fa9e4066Sahrens refcount_create(&dn->dn_holds); 62fa9e4066Sahrens refcount_create(&dn->dn_tx_holds); 63fa9e4066Sahrens 64fa9e4066Sahrens for (i = 0; i < TXG_SIZE; i++) { 65fa9e4066Sahrens avl_create(&dn->dn_ranges[i], free_range_compar, 66fa9e4066Sahrens sizeof (free_range_t), 67fa9e4066Sahrens offsetof(struct free_range, fr_node)); 68c717a561Smaybee list_create(&dn->dn_dirty_records[i], 69c717a561Smaybee sizeof (dbuf_dirty_record_t), 70c717a561Smaybee offsetof(dbuf_dirty_record_t, dr_dirty_node)); 71fa9e4066Sahrens } 72fa9e4066Sahrens 73fa9e4066Sahrens list_create(&dn->dn_dbufs, sizeof (dmu_buf_impl_t), 74fa9e4066Sahrens offsetof(dmu_buf_impl_t, db_link)); 75fa9e4066Sahrens 76fa9e4066Sahrens return (0); 77fa9e4066Sahrens } 78fa9e4066Sahrens 79fa9e4066Sahrens /* ARGSUSED */ 80fa9e4066Sahrens static void 81fa9e4066Sahrens dnode_dest(void *arg, void *unused) 82fa9e4066Sahrens { 83fa9e4066Sahrens int i; 84fa9e4066Sahrens dnode_t *dn = arg; 85fa9e4066Sahrens 86fa9e4066Sahrens rw_destroy(&dn->dn_struct_rwlock); 87fa9e4066Sahrens mutex_destroy(&dn->dn_mtx); 88fa9e4066Sahrens mutex_destroy(&dn->dn_dbufs_mtx); 89b5e70f97SRicardo M. Correia cv_destroy(&dn->dn_notxholds); 90fa9e4066Sahrens refcount_destroy(&dn->dn_holds); 91fa9e4066Sahrens refcount_destroy(&dn->dn_tx_holds); 92fa9e4066Sahrens 93fa9e4066Sahrens for (i = 0; i < TXG_SIZE; i++) { 94fa9e4066Sahrens avl_destroy(&dn->dn_ranges[i]); 95c717a561Smaybee list_destroy(&dn->dn_dirty_records[i]); 96fa9e4066Sahrens } 97fa9e4066Sahrens 98fa9e4066Sahrens list_destroy(&dn->dn_dbufs); 99fa9e4066Sahrens } 100fa9e4066Sahrens 101fa9e4066Sahrens void 102fa9e4066Sahrens dnode_init(void) 103fa9e4066Sahrens { 104fa9e4066Sahrens dnode_cache = kmem_cache_create("dnode_t", 105fa9e4066Sahrens sizeof (dnode_t), 106fa9e4066Sahrens 0, dnode_cons, dnode_dest, NULL, NULL, NULL, 0); 107fa9e4066Sahrens } 108fa9e4066Sahrens 109fa9e4066Sahrens void 110fa9e4066Sahrens dnode_fini(void) 111fa9e4066Sahrens { 112fa9e4066Sahrens kmem_cache_destroy(dnode_cache); 113fa9e4066Sahrens } 114fa9e4066Sahrens 115fa9e4066Sahrens 1169c9dc39aSek #ifdef ZFS_DEBUG 117fa9e4066Sahrens void 118fa9e4066Sahrens dnode_verify(dnode_t *dn) 119fa9e4066Sahrens { 120fa9e4066Sahrens int drop_struct_lock = FALSE; 121fa9e4066Sahrens 122fa9e4066Sahrens ASSERT(dn->dn_phys); 123fa9e4066Sahrens ASSERT(dn->dn_objset); 124fa9e4066Sahrens 125fa9e4066Sahrens ASSERT(dn->dn_phys->dn_type < DMU_OT_NUMTYPES); 126fa9e4066Sahrens 127fa9e4066Sahrens if (!(zfs_flags & ZFS_DEBUG_DNODE_VERIFY)) 128fa9e4066Sahrens return; 129fa9e4066Sahrens 130fa9e4066Sahrens if (!RW_WRITE_HELD(&dn->dn_struct_rwlock)) { 131fa9e4066Sahrens rw_enter(&dn->dn_struct_rwlock, RW_READER); 132fa9e4066Sahrens drop_struct_lock = TRUE; 133fa9e4066Sahrens } 134fa9e4066Sahrens if (dn->dn_phys->dn_type != DMU_OT_NONE || dn->dn_allocated_txg != 0) { 135fa9e4066Sahrens int i; 136fa9e4066Sahrens ASSERT3U(dn->dn_indblkshift, >=, 0); 137fa9e4066Sahrens ASSERT3U(dn->dn_indblkshift, <=, SPA_MAXBLOCKSHIFT); 138fa9e4066Sahrens if (dn->dn_datablkshift) { 139fa9e4066Sahrens ASSERT3U(dn->dn_datablkshift, >=, SPA_MINBLOCKSHIFT); 140fa9e4066Sahrens ASSERT3U(dn->dn_datablkshift, <=, SPA_MAXBLOCKSHIFT); 141fa9e4066Sahrens ASSERT3U(1<<dn->dn_datablkshift, ==, dn->dn_datablksz); 142fa9e4066Sahrens } 143fa9e4066Sahrens ASSERT3U(dn->dn_nlevels, <=, 30); 144fa9e4066Sahrens ASSERT3U(dn->dn_type, <=, DMU_OT_NUMTYPES); 145fa9e4066Sahrens ASSERT3U(dn->dn_nblkptr, >=, 1); 146fa9e4066Sahrens ASSERT3U(dn->dn_nblkptr, <=, DN_MAX_NBLKPTR); 147fa9e4066Sahrens ASSERT3U(dn->dn_bonuslen, <=, DN_MAX_BONUSLEN); 148fa9e4066Sahrens ASSERT3U(dn->dn_datablksz, ==, 149fa9e4066Sahrens dn->dn_datablkszsec << SPA_MINBLOCKSHIFT); 150fa9e4066Sahrens ASSERT3U(ISP2(dn->dn_datablksz), ==, dn->dn_datablkshift != 0); 151fa9e4066Sahrens ASSERT3U((dn->dn_nblkptr - 1) * sizeof (blkptr_t) + 152fa9e4066Sahrens dn->dn_bonuslen, <=, DN_MAX_BONUSLEN); 153fa9e4066Sahrens for (i = 0; i < TXG_SIZE; i++) { 154fa9e4066Sahrens ASSERT3U(dn->dn_next_nlevels[i], <=, dn->dn_nlevels); 155fa9e4066Sahrens } 156fa9e4066Sahrens } 157fa9e4066Sahrens if (dn->dn_phys->dn_type != DMU_OT_NONE) 158fa9e4066Sahrens ASSERT3U(dn->dn_phys->dn_nlevels, <=, dn->dn_nlevels); 159ea8dc4b6Seschrock ASSERT(dn->dn_object == DMU_META_DNODE_OBJECT || dn->dn_dbuf != NULL); 160fa9e4066Sahrens if (dn->dn_dbuf != NULL) { 161fa9e4066Sahrens ASSERT3P(dn->dn_phys, ==, 162fa9e4066Sahrens (dnode_phys_t *)dn->dn_dbuf->db.db_data + 163fa9e4066Sahrens (dn->dn_object % (dn->dn_dbuf->db.db_size >> DNODE_SHIFT))); 164fa9e4066Sahrens } 165fa9e4066Sahrens if (drop_struct_lock) 166fa9e4066Sahrens rw_exit(&dn->dn_struct_rwlock); 167fa9e4066Sahrens } 1689c9dc39aSek #endif 169fa9e4066Sahrens 170fa9e4066Sahrens void 171fa9e4066Sahrens dnode_byteswap(dnode_phys_t *dnp) 172fa9e4066Sahrens { 173fa9e4066Sahrens uint64_t *buf64 = (void*)&dnp->dn_blkptr; 174fa9e4066Sahrens int i; 175fa9e4066Sahrens 176fa9e4066Sahrens if (dnp->dn_type == DMU_OT_NONE) { 177fa9e4066Sahrens bzero(dnp, sizeof (dnode_phys_t)); 178fa9e4066Sahrens return; 179fa9e4066Sahrens } 180fa9e4066Sahrens 181fa9e4066Sahrens dnp->dn_datablkszsec = BSWAP_16(dnp->dn_datablkszsec); 182fa9e4066Sahrens dnp->dn_bonuslen = BSWAP_16(dnp->dn_bonuslen); 183fa9e4066Sahrens dnp->dn_maxblkid = BSWAP_64(dnp->dn_maxblkid); 18499653d4eSeschrock dnp->dn_used = BSWAP_64(dnp->dn_used); 185fa9e4066Sahrens 186fa9e4066Sahrens /* 187fa9e4066Sahrens * dn_nblkptr is only one byte, so it's OK to read it in either 188fa9e4066Sahrens * byte order. We can't read dn_bouslen. 189fa9e4066Sahrens */ 190fa9e4066Sahrens ASSERT(dnp->dn_indblkshift <= SPA_MAXBLOCKSHIFT); 191fa9e4066Sahrens ASSERT(dnp->dn_nblkptr <= DN_MAX_NBLKPTR); 192fa9e4066Sahrens for (i = 0; i < dnp->dn_nblkptr * sizeof (blkptr_t)/8; i++) 193fa9e4066Sahrens buf64[i] = BSWAP_64(buf64[i]); 194fa9e4066Sahrens 195fa9e4066Sahrens /* 196fa9e4066Sahrens * OK to check dn_bonuslen for zero, because it won't matter if 197fa9e4066Sahrens * we have the wrong byte order. This is necessary because the 198fa9e4066Sahrens * dnode dnode is smaller than a regular dnode. 199fa9e4066Sahrens */ 200fa9e4066Sahrens if (dnp->dn_bonuslen != 0) { 201fa9e4066Sahrens /* 202fa9e4066Sahrens * Note that the bonus length calculated here may be 203fa9e4066Sahrens * longer than the actual bonus buffer. This is because 204fa9e4066Sahrens * we always put the bonus buffer after the last block 205fa9e4066Sahrens * pointer (instead of packing it against the end of the 206fa9e4066Sahrens * dnode buffer). 207fa9e4066Sahrens */ 208fa9e4066Sahrens int off = (dnp->dn_nblkptr-1) * sizeof (blkptr_t); 209fa9e4066Sahrens size_t len = DN_MAX_BONUSLEN - off; 21087bd5c1eSahrens ASSERT3U(dnp->dn_bonustype, <, DMU_OT_NUMTYPES); 211fa9e4066Sahrens dmu_ot[dnp->dn_bonustype].ot_byteswap(dnp->dn_bonus + off, len); 212fa9e4066Sahrens } 213fa9e4066Sahrens } 214fa9e4066Sahrens 215fa9e4066Sahrens void 216fa9e4066Sahrens dnode_buf_byteswap(void *vbuf, size_t size) 217fa9e4066Sahrens { 218fa9e4066Sahrens dnode_phys_t *buf = vbuf; 219fa9e4066Sahrens int i; 220fa9e4066Sahrens 221fa9e4066Sahrens ASSERT3U(sizeof (dnode_phys_t), ==, (1<<DNODE_SHIFT)); 222fa9e4066Sahrens ASSERT((size & (sizeof (dnode_phys_t)-1)) == 0); 223fa9e4066Sahrens 224fa9e4066Sahrens size >>= DNODE_SHIFT; 225fa9e4066Sahrens for (i = 0; i < size; i++) { 226fa9e4066Sahrens dnode_byteswap(buf); 227fa9e4066Sahrens buf++; 228fa9e4066Sahrens } 229fa9e4066Sahrens } 230fa9e4066Sahrens 231fa9e4066Sahrens static int 232fa9e4066Sahrens free_range_compar(const void *node1, const void *node2) 233fa9e4066Sahrens { 234fa9e4066Sahrens const free_range_t *rp1 = node1; 235fa9e4066Sahrens const free_range_t *rp2 = node2; 236fa9e4066Sahrens 237fa9e4066Sahrens if (rp1->fr_blkid < rp2->fr_blkid) 238fa9e4066Sahrens return (-1); 239fa9e4066Sahrens else if (rp1->fr_blkid > rp2->fr_blkid) 240fa9e4066Sahrens return (1); 241fa9e4066Sahrens else return (0); 242fa9e4066Sahrens } 243fa9e4066Sahrens 2441934e92fSmaybee void 2451934e92fSmaybee dnode_setbonuslen(dnode_t *dn, int newsize, dmu_tx_t *tx) 2461934e92fSmaybee { 2471934e92fSmaybee ASSERT3U(refcount_count(&dn->dn_holds), >=, 1); 2481934e92fSmaybee 2491934e92fSmaybee dnode_setdirty(dn, tx); 2501934e92fSmaybee rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 2511934e92fSmaybee ASSERT3U(newsize, <=, DN_MAX_BONUSLEN - 2521934e92fSmaybee (dn->dn_nblkptr-1) * sizeof (blkptr_t)); 2531934e92fSmaybee dn->dn_bonuslen = newsize; 2541934e92fSmaybee if (newsize == 0) 2551934e92fSmaybee dn->dn_next_bonuslen[tx->tx_txg & TXG_MASK] = DN_ZERO_BONUSLEN; 2561934e92fSmaybee else 2571934e92fSmaybee dn->dn_next_bonuslen[tx->tx_txg & TXG_MASK] = dn->dn_bonuslen; 2581934e92fSmaybee rw_exit(&dn->dn_struct_rwlock); 2591934e92fSmaybee } 2601934e92fSmaybee 261fa9e4066Sahrens static void 262fa9e4066Sahrens dnode_setdblksz(dnode_t *dn, int size) 263fa9e4066Sahrens { 264fa9e4066Sahrens ASSERT3U(P2PHASE(size, SPA_MINBLOCKSIZE), ==, 0); 265fa9e4066Sahrens ASSERT3U(size, <=, SPA_MAXBLOCKSIZE); 266fa9e4066Sahrens ASSERT3U(size, >=, SPA_MINBLOCKSIZE); 267fa9e4066Sahrens ASSERT3U(size >> SPA_MINBLOCKSHIFT, <, 268fa9e4066Sahrens 1<<(sizeof (dn->dn_phys->dn_datablkszsec) * 8)); 269fa9e4066Sahrens dn->dn_datablksz = size; 270fa9e4066Sahrens dn->dn_datablkszsec = size >> SPA_MINBLOCKSHIFT; 271fa9e4066Sahrens dn->dn_datablkshift = ISP2(size) ? highbit(size - 1) : 0; 272fa9e4066Sahrens } 273fa9e4066Sahrens 274fa9e4066Sahrens static dnode_t * 275fa9e4066Sahrens dnode_create(objset_impl_t *os, dnode_phys_t *dnp, dmu_buf_impl_t *db, 276fa9e4066Sahrens uint64_t object) 277fa9e4066Sahrens { 278fa9e4066Sahrens dnode_t *dn = kmem_cache_alloc(dnode_cache, KM_SLEEP); 279fa9e4066Sahrens (void) dnode_cons(dn, NULL, 0); /* XXX */ 280fa9e4066Sahrens 281fa9e4066Sahrens dn->dn_objset = os; 282fa9e4066Sahrens dn->dn_object = object; 283fa9e4066Sahrens dn->dn_dbuf = db; 284fa9e4066Sahrens dn->dn_phys = dnp; 285fa9e4066Sahrens 286fa9e4066Sahrens if (dnp->dn_datablkszsec) 287fa9e4066Sahrens dnode_setdblksz(dn, dnp->dn_datablkszsec << SPA_MINBLOCKSHIFT); 288fa9e4066Sahrens dn->dn_indblkshift = dnp->dn_indblkshift; 289fa9e4066Sahrens dn->dn_nlevels = dnp->dn_nlevels; 290fa9e4066Sahrens dn->dn_type = dnp->dn_type; 291fa9e4066Sahrens dn->dn_nblkptr = dnp->dn_nblkptr; 292fa9e4066Sahrens dn->dn_checksum = dnp->dn_checksum; 293fa9e4066Sahrens dn->dn_compress = dnp->dn_compress; 294fa9e4066Sahrens dn->dn_bonustype = dnp->dn_bonustype; 295fa9e4066Sahrens dn->dn_bonuslen = dnp->dn_bonuslen; 296fa9e4066Sahrens dn->dn_maxblkid = dnp->dn_maxblkid; 297fa9e4066Sahrens 298fa9e4066Sahrens dmu_zfetch_init(&dn->dn_zfetch, dn); 299fa9e4066Sahrens 300fa9e4066Sahrens ASSERT(dn->dn_phys->dn_type < DMU_OT_NUMTYPES); 301fa9e4066Sahrens mutex_enter(&os->os_lock); 302fa9e4066Sahrens list_insert_head(&os->os_dnodes, dn); 303fa9e4066Sahrens mutex_exit(&os->os_lock); 304fa9e4066Sahrens 3055a98e54bSBrendan Gregg - Sun Microsystems arc_space_consume(sizeof (dnode_t), ARC_SPACE_OTHER); 306fa9e4066Sahrens return (dn); 307fa9e4066Sahrens } 308fa9e4066Sahrens 309fa9e4066Sahrens static void 310fa9e4066Sahrens dnode_destroy(dnode_t *dn) 311fa9e4066Sahrens { 312fa9e4066Sahrens objset_impl_t *os = dn->dn_objset; 313fa9e4066Sahrens 314a2eea2e1Sahrens #ifdef ZFS_DEBUG 315a2eea2e1Sahrens int i; 316a2eea2e1Sahrens 317a2eea2e1Sahrens for (i = 0; i < TXG_SIZE; i++) { 318a2eea2e1Sahrens ASSERT(!list_link_active(&dn->dn_dirty_link[i])); 319c717a561Smaybee ASSERT(NULL == list_head(&dn->dn_dirty_records[i])); 320a2eea2e1Sahrens ASSERT(0 == avl_numnodes(&dn->dn_ranges[i])); 321a2eea2e1Sahrens } 322a2eea2e1Sahrens ASSERT(NULL == list_head(&dn->dn_dbufs)); 323a2eea2e1Sahrens #endif 324a2eea2e1Sahrens 325fa9e4066Sahrens mutex_enter(&os->os_lock); 326fa9e4066Sahrens list_remove(&os->os_dnodes, dn); 327fa9e4066Sahrens mutex_exit(&os->os_lock); 328fa9e4066Sahrens 329fa9e4066Sahrens if (dn->dn_dirtyctx_firstset) { 330fa9e4066Sahrens kmem_free(dn->dn_dirtyctx_firstset, 1); 331fa9e4066Sahrens dn->dn_dirtyctx_firstset = NULL; 332fa9e4066Sahrens } 333fa9e4066Sahrens dmu_zfetch_rele(&dn->dn_zfetch); 334ea8dc4b6Seschrock if (dn->dn_bonus) { 335ea8dc4b6Seschrock mutex_enter(&dn->dn_bonus->db_mtx); 336ea8dc4b6Seschrock dbuf_evict(dn->dn_bonus); 337ea8dc4b6Seschrock dn->dn_bonus = NULL; 338ea8dc4b6Seschrock } 339fa9e4066Sahrens kmem_cache_free(dnode_cache, dn); 3405a98e54bSBrendan Gregg - Sun Microsystems arc_space_return(sizeof (dnode_t), ARC_SPACE_OTHER); 341fa9e4066Sahrens } 342fa9e4066Sahrens 343fa9e4066Sahrens void 344fa9e4066Sahrens dnode_allocate(dnode_t *dn, dmu_object_type_t ot, int blocksize, int ibs, 345f676ed34Sahrens dmu_object_type_t bonustype, int bonuslen, dmu_tx_t *tx) 346fa9e4066Sahrens { 347fa9e4066Sahrens int i; 348fa9e4066Sahrens 349fa9e4066Sahrens if (blocksize == 0) 350fa9e4066Sahrens blocksize = 1 << zfs_default_bs; 3513b83abddSahrens else if (blocksize > SPA_MAXBLOCKSIZE) 3523b83abddSahrens blocksize = SPA_MAXBLOCKSIZE; 3533b83abddSahrens else 3543b83abddSahrens blocksize = P2ROUNDUP(blocksize, SPA_MINBLOCKSIZE); 355fa9e4066Sahrens 356fa9e4066Sahrens if (ibs == 0) 357fa9e4066Sahrens ibs = zfs_default_ibs; 358fa9e4066Sahrens 359fa9e4066Sahrens ibs = MIN(MAX(ibs, DN_MIN_INDBLKSHIFT), DN_MAX_INDBLKSHIFT); 360fa9e4066Sahrens 361fa9e4066Sahrens dprintf("os=%p obj=%llu txg=%llu blocksize=%d ibs=%d\n", dn->dn_objset, 362fa9e4066Sahrens dn->dn_object, tx->tx_txg, blocksize, ibs); 363fa9e4066Sahrens 364fa9e4066Sahrens ASSERT(dn->dn_type == DMU_OT_NONE); 365fa9e4066Sahrens ASSERT(bcmp(dn->dn_phys, &dnode_phys_zero, sizeof (dnode_phys_t)) == 0); 366fa9e4066Sahrens ASSERT(dn->dn_phys->dn_type == DMU_OT_NONE); 367fa9e4066Sahrens ASSERT(ot != DMU_OT_NONE); 368fa9e4066Sahrens ASSERT3U(ot, <, DMU_OT_NUMTYPES); 369fa9e4066Sahrens ASSERT((bonustype == DMU_OT_NONE && bonuslen == 0) || 370fa9e4066Sahrens (bonustype != DMU_OT_NONE && bonuslen != 0)); 371fa9e4066Sahrens ASSERT3U(bonustype, <, DMU_OT_NUMTYPES); 372fa9e4066Sahrens ASSERT3U(bonuslen, <=, DN_MAX_BONUSLEN); 373fa9e4066Sahrens ASSERT(dn->dn_type == DMU_OT_NONE); 374fa9e4066Sahrens ASSERT3U(dn->dn_maxblkid, ==, 0); 375fa9e4066Sahrens ASSERT3U(dn->dn_allocated_txg, ==, 0); 376fa9e4066Sahrens ASSERT3U(dn->dn_assigned_txg, ==, 0); 377fa9e4066Sahrens ASSERT(refcount_is_zero(&dn->dn_tx_holds)); 378fa9e4066Sahrens ASSERT3U(refcount_count(&dn->dn_holds), <=, 1); 379fa9e4066Sahrens ASSERT3P(list_head(&dn->dn_dbufs), ==, NULL); 380fa9e4066Sahrens 381fa9e4066Sahrens for (i = 0; i < TXG_SIZE; i++) { 382fa9e4066Sahrens ASSERT3U(dn->dn_next_nlevels[i], ==, 0); 383fa9e4066Sahrens ASSERT3U(dn->dn_next_indblkshift[i], ==, 0); 3841934e92fSmaybee ASSERT3U(dn->dn_next_bonuslen[i], ==, 0); 385c543ec06Sahrens ASSERT3U(dn->dn_next_blksz[i], ==, 0); 386c543ec06Sahrens ASSERT(!list_link_active(&dn->dn_dirty_link[i])); 387c717a561Smaybee ASSERT3P(list_head(&dn->dn_dirty_records[i]), ==, NULL); 388fa9e4066Sahrens ASSERT3U(avl_numnodes(&dn->dn_ranges[i]), ==, 0); 389fa9e4066Sahrens } 390fa9e4066Sahrens 391fa9e4066Sahrens dn->dn_type = ot; 392fa9e4066Sahrens dnode_setdblksz(dn, blocksize); 393fa9e4066Sahrens dn->dn_indblkshift = ibs; 394fa9e4066Sahrens dn->dn_nlevels = 1; 395fa9e4066Sahrens dn->dn_nblkptr = 1 + ((DN_MAX_BONUSLEN - bonuslen) >> SPA_BLKPTRSHIFT); 396fa9e4066Sahrens dn->dn_bonustype = bonustype; 397fa9e4066Sahrens dn->dn_bonuslen = bonuslen; 398fa9e4066Sahrens dn->dn_checksum = ZIO_CHECKSUM_INHERIT; 399fa9e4066Sahrens dn->dn_compress = ZIO_COMPRESS_INHERIT; 400fa9e4066Sahrens dn->dn_dirtyctx = 0; 401fa9e4066Sahrens 402fa9e4066Sahrens dn->dn_free_txg = 0; 403fa9e4066Sahrens if (dn->dn_dirtyctx_firstset) { 404fa9e4066Sahrens kmem_free(dn->dn_dirtyctx_firstset, 1); 405fa9e4066Sahrens dn->dn_dirtyctx_firstset = NULL; 406fa9e4066Sahrens } 407fa9e4066Sahrens 408fa9e4066Sahrens dn->dn_allocated_txg = tx->tx_txg; 409f676ed34Sahrens 410fa9e4066Sahrens dnode_setdirty(dn, tx); 411f676ed34Sahrens dn->dn_next_indblkshift[tx->tx_txg & TXG_MASK] = ibs; 4121934e92fSmaybee dn->dn_next_bonuslen[tx->tx_txg & TXG_MASK] = dn->dn_bonuslen; 413f676ed34Sahrens dn->dn_next_blksz[tx->tx_txg & TXG_MASK] = dn->dn_datablksz; 414fa9e4066Sahrens } 415fa9e4066Sahrens 416fa9e4066Sahrens void 417fa9e4066Sahrens dnode_reallocate(dnode_t *dn, dmu_object_type_t ot, int blocksize, 418fa9e4066Sahrens dmu_object_type_t bonustype, int bonuslen, dmu_tx_t *tx) 419fa9e4066Sahrens { 420*2bf405a2SMark Maybee int nblkptr; 421c543ec06Sahrens 422fa9e4066Sahrens ASSERT3U(blocksize, >=, SPA_MINBLOCKSIZE); 423fa9e4066Sahrens ASSERT3U(blocksize, <=, SPA_MAXBLOCKSIZE); 424fa9e4066Sahrens ASSERT3U(blocksize % SPA_MINBLOCKSIZE, ==, 0); 425ea8dc4b6Seschrock ASSERT(dn->dn_object != DMU_META_DNODE_OBJECT || dmu_tx_private_ok(tx)); 426fa9e4066Sahrens ASSERT(tx->tx_txg != 0); 427fa9e4066Sahrens ASSERT((bonustype == DMU_OT_NONE && bonuslen == 0) || 428fa9e4066Sahrens (bonustype != DMU_OT_NONE && bonuslen != 0)); 429fa9e4066Sahrens ASSERT3U(bonustype, <, DMU_OT_NUMTYPES); 430fa9e4066Sahrens ASSERT3U(bonuslen, <=, DN_MAX_BONUSLEN); 431c543ec06Sahrens 432ea8dc4b6Seschrock /* clean up any unreferenced dbufs */ 4331934e92fSmaybee dnode_evict_dbufs(dn); 434da03de99SMark Maybee 435fa9e4066Sahrens rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 436fa9e4066Sahrens dnode_setdirty(dn, tx); 437*2bf405a2SMark Maybee if (dn->dn_datablksz != blocksize) { 438*2bf405a2SMark Maybee /* change blocksize */ 439*2bf405a2SMark Maybee ASSERT(dn->dn_maxblkid == 0 && 440*2bf405a2SMark Maybee (BP_IS_HOLE(&dn->dn_phys->dn_blkptr[0]) || 441*2bf405a2SMark Maybee dnode_block_freed(dn, 0))); 442*2bf405a2SMark Maybee dnode_setdblksz(dn, blocksize); 443*2bf405a2SMark Maybee dn->dn_next_blksz[tx->tx_txg&TXG_MASK] = blocksize; 444*2bf405a2SMark Maybee } 445*2bf405a2SMark Maybee if (dn->dn_bonuslen != bonuslen) 446*2bf405a2SMark Maybee dn->dn_next_bonuslen[tx->tx_txg&TXG_MASK] = bonuslen; 447*2bf405a2SMark Maybee nblkptr = 1 + ((DN_MAX_BONUSLEN - bonuslen) >> SPA_BLKPTRSHIFT); 448da03de99SMark Maybee if (dn->dn_nblkptr != nblkptr) 449da03de99SMark Maybee dn->dn_next_nblkptr[tx->tx_txg&TXG_MASK] = nblkptr; 450fa9e4066Sahrens rw_exit(&dn->dn_struct_rwlock); 451fa9e4066Sahrens 452fa9e4066Sahrens /* change type */ 453fa9e4066Sahrens dn->dn_type = ot; 454fa9e4066Sahrens 455fa9e4066Sahrens /* change bonus size and type */ 456fa9e4066Sahrens mutex_enter(&dn->dn_mtx); 457fa9e4066Sahrens dn->dn_bonustype = bonustype; 458fa9e4066Sahrens dn->dn_bonuslen = bonuslen; 459da03de99SMark Maybee dn->dn_nblkptr = nblkptr; 460fa9e4066Sahrens dn->dn_checksum = ZIO_CHECKSUM_INHERIT; 461fa9e4066Sahrens dn->dn_compress = ZIO_COMPRESS_INHERIT; 462fa9e4066Sahrens ASSERT3U(dn->dn_nblkptr, <=, DN_MAX_NBLKPTR); 463fa9e4066Sahrens 464da03de99SMark Maybee /* fix up the bonus db_size */ 465da03de99SMark Maybee if (dn->dn_bonus) { 4661934e92fSmaybee dn->dn_bonus->db.db_size = 4671934e92fSmaybee DN_MAX_BONUSLEN - (dn->dn_nblkptr-1) * sizeof (blkptr_t); 4681934e92fSmaybee ASSERT(dn->dn_bonuslen <= dn->dn_bonus->db.db_size); 4691934e92fSmaybee } 470432f72fdSahrens 471fa9e4066Sahrens dn->dn_allocated_txg = tx->tx_txg; 472fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 473fa9e4066Sahrens } 474fa9e4066Sahrens 475fa9e4066Sahrens void 476fa9e4066Sahrens dnode_special_close(dnode_t *dn) 477fa9e4066Sahrens { 478ea8dc4b6Seschrock /* 479ea8dc4b6Seschrock * Wait for final references to the dnode to clear. This can 480ea8dc4b6Seschrock * only happen if the arc is asyncronously evicting state that 481ea8dc4b6Seschrock * has a hold on this dnode while we are trying to evict this 482ea8dc4b6Seschrock * dnode. 483ea8dc4b6Seschrock */ 484ea8dc4b6Seschrock while (refcount_count(&dn->dn_holds) > 0) 485ea8dc4b6Seschrock delay(1); 486fa9e4066Sahrens dnode_destroy(dn); 487fa9e4066Sahrens } 488fa9e4066Sahrens 489fa9e4066Sahrens dnode_t * 490fa9e4066Sahrens dnode_special_open(objset_impl_t *os, dnode_phys_t *dnp, uint64_t object) 491fa9e4066Sahrens { 492fa9e4066Sahrens dnode_t *dn = dnode_create(os, dnp, NULL, object); 4939c9dc39aSek DNODE_VERIFY(dn); 494fa9e4066Sahrens return (dn); 495fa9e4066Sahrens } 496fa9e4066Sahrens 497fa9e4066Sahrens static void 498fa9e4066Sahrens dnode_buf_pageout(dmu_buf_t *db, void *arg) 499fa9e4066Sahrens { 500fa9e4066Sahrens dnode_t **children_dnodes = arg; 501fa9e4066Sahrens int i; 502fa9e4066Sahrens int epb = db->db_size >> DNODE_SHIFT; 503fa9e4066Sahrens 504fa9e4066Sahrens for (i = 0; i < epb; i++) { 505fa9e4066Sahrens dnode_t *dn = children_dnodes[i]; 506fa9e4066Sahrens int n; 507fa9e4066Sahrens 508fa9e4066Sahrens if (dn == NULL) 509fa9e4066Sahrens continue; 510fa9e4066Sahrens #ifdef ZFS_DEBUG 511fa9e4066Sahrens /* 512fa9e4066Sahrens * If there are holds on this dnode, then there should 513fa9e4066Sahrens * be holds on the dnode's containing dbuf as well; thus 514fa9e4066Sahrens * it wouldn't be eligable for eviction and this function 515fa9e4066Sahrens * would not have been called. 516fa9e4066Sahrens */ 517fa9e4066Sahrens ASSERT(refcount_is_zero(&dn->dn_holds)); 518fa9e4066Sahrens ASSERT(list_head(&dn->dn_dbufs) == NULL); 519fa9e4066Sahrens ASSERT(refcount_is_zero(&dn->dn_tx_holds)); 520fa9e4066Sahrens 521fa9e4066Sahrens for (n = 0; n < TXG_SIZE; n++) 522c543ec06Sahrens ASSERT(!list_link_active(&dn->dn_dirty_link[n])); 523fa9e4066Sahrens #endif 524fa9e4066Sahrens children_dnodes[i] = NULL; 525fa9e4066Sahrens dnode_destroy(dn); 526fa9e4066Sahrens } 527fa9e4066Sahrens kmem_free(children_dnodes, epb * sizeof (dnode_t *)); 528fa9e4066Sahrens } 529fa9e4066Sahrens 530fa9e4066Sahrens /* 531ea8dc4b6Seschrock * errors: 532ea8dc4b6Seschrock * EINVAL - invalid object number. 533ea8dc4b6Seschrock * EIO - i/o error. 534ea8dc4b6Seschrock * succeeds even for free dnodes. 535fa9e4066Sahrens */ 536ea8dc4b6Seschrock int 537ea8dc4b6Seschrock dnode_hold_impl(objset_impl_t *os, uint64_t object, int flag, 538ea8dc4b6Seschrock void *tag, dnode_t **dnp) 539fa9e4066Sahrens { 540ea8dc4b6Seschrock int epb, idx, err; 541fa9e4066Sahrens int drop_struct_lock = FALSE; 542ea8dc4b6Seschrock int type; 543fa9e4066Sahrens uint64_t blk; 544fa9e4066Sahrens dnode_t *mdn, *dn; 545fa9e4066Sahrens dmu_buf_impl_t *db; 546fa9e4066Sahrens dnode_t **children_dnodes; 547fa9e4066Sahrens 548e14bb325SJeff Bonwick /* 549e14bb325SJeff Bonwick * If you are holding the spa config lock as writer, you shouldn't 550e14bb325SJeff Bonwick * be asking the DMU to do *anything*. 551e14bb325SJeff Bonwick */ 552e14bb325SJeff Bonwick ASSERT(spa_config_held(os->os_spa, SCL_ALL, RW_WRITER) == 0); 553e14bb325SJeff Bonwick 554fa9e4066Sahrens if (object == 0 || object >= DN_MAX_OBJECT) 555ea8dc4b6Seschrock return (EINVAL); 556fa9e4066Sahrens 557fa9e4066Sahrens mdn = os->os_meta_dnode; 558fa9e4066Sahrens 5599c9dc39aSek DNODE_VERIFY(mdn); 560fa9e4066Sahrens 561fa9e4066Sahrens if (!RW_WRITE_HELD(&mdn->dn_struct_rwlock)) { 562fa9e4066Sahrens rw_enter(&mdn->dn_struct_rwlock, RW_READER); 563fa9e4066Sahrens drop_struct_lock = TRUE; 564fa9e4066Sahrens } 565fa9e4066Sahrens 566fa9e4066Sahrens blk = dbuf_whichblock(mdn, object * sizeof (dnode_phys_t)); 567fa9e4066Sahrens 568ea8dc4b6Seschrock db = dbuf_hold(mdn, blk, FTAG); 569fa9e4066Sahrens if (drop_struct_lock) 570fa9e4066Sahrens rw_exit(&mdn->dn_struct_rwlock); 571ea8dc4b6Seschrock if (db == NULL) 572ea8dc4b6Seschrock return (EIO); 573ea8dc4b6Seschrock err = dbuf_read(db, NULL, DB_RF_CANFAIL); 574ea8dc4b6Seschrock if (err) { 575ea8dc4b6Seschrock dbuf_rele(db, FTAG); 576ea8dc4b6Seschrock return (err); 577ea8dc4b6Seschrock } 578fa9e4066Sahrens 579fa9e4066Sahrens ASSERT3U(db->db.db_size, >=, 1<<DNODE_SHIFT); 580fa9e4066Sahrens epb = db->db.db_size >> DNODE_SHIFT; 581fa9e4066Sahrens 582fa9e4066Sahrens idx = object & (epb-1); 583fa9e4066Sahrens 584fa9e4066Sahrens children_dnodes = dmu_buf_get_user(&db->db); 585fa9e4066Sahrens if (children_dnodes == NULL) { 586fa9e4066Sahrens dnode_t **winner; 587fa9e4066Sahrens children_dnodes = kmem_zalloc(epb * sizeof (dnode_t *), 588fa9e4066Sahrens KM_SLEEP); 589fa9e4066Sahrens if (winner = dmu_buf_set_user(&db->db, children_dnodes, NULL, 590fa9e4066Sahrens dnode_buf_pageout)) { 591fa9e4066Sahrens kmem_free(children_dnodes, epb * sizeof (dnode_t *)); 592fa9e4066Sahrens children_dnodes = winner; 593fa9e4066Sahrens } 594fa9e4066Sahrens } 595fa9e4066Sahrens 596fa9e4066Sahrens if ((dn = children_dnodes[idx]) == NULL) { 5970e8c6158Smaybee dnode_phys_t *dnp = (dnode_phys_t *)db->db.db_data+idx; 598fa9e4066Sahrens dnode_t *winner; 5990e8c6158Smaybee 6000e8c6158Smaybee dn = dnode_create(os, dnp, db, object); 601fa9e4066Sahrens winner = atomic_cas_ptr(&children_dnodes[idx], NULL, dn); 602fa9e4066Sahrens if (winner != NULL) { 603fa9e4066Sahrens dnode_destroy(dn); 604fa9e4066Sahrens dn = winner; 605fa9e4066Sahrens } 606fa9e4066Sahrens } 607fa9e4066Sahrens 608fa9e4066Sahrens mutex_enter(&dn->dn_mtx); 609ea8dc4b6Seschrock type = dn->dn_type; 610fa9e4066Sahrens if (dn->dn_free_txg || 611ea8dc4b6Seschrock ((flag & DNODE_MUST_BE_ALLOCATED) && type == DMU_OT_NONE) || 612ea8dc4b6Seschrock ((flag & DNODE_MUST_BE_FREE) && type != DMU_OT_NONE)) { 613fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 614ea8dc4b6Seschrock dbuf_rele(db, FTAG); 615ea8dc4b6Seschrock return (type == DMU_OT_NONE ? ENOENT : EEXIST); 616fa9e4066Sahrens } 617fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 618fa9e4066Sahrens 619ea8dc4b6Seschrock if (refcount_add(&dn->dn_holds, tag) == 1) 620fa9e4066Sahrens dbuf_add_ref(db, dn); 621fa9e4066Sahrens 6229c9dc39aSek DNODE_VERIFY(dn); 623fa9e4066Sahrens ASSERT3P(dn->dn_dbuf, ==, db); 624fa9e4066Sahrens ASSERT3U(dn->dn_object, ==, object); 625ea8dc4b6Seschrock dbuf_rele(db, FTAG); 626fa9e4066Sahrens 627ea8dc4b6Seschrock *dnp = dn; 628ea8dc4b6Seschrock return (0); 629fa9e4066Sahrens } 630fa9e4066Sahrens 631fa9e4066Sahrens /* 632fa9e4066Sahrens * Return held dnode if the object is allocated, NULL if not. 633fa9e4066Sahrens */ 634ea8dc4b6Seschrock int 635ea8dc4b6Seschrock dnode_hold(objset_impl_t *os, uint64_t object, void *tag, dnode_t **dnp) 636fa9e4066Sahrens { 637ea8dc4b6Seschrock return (dnode_hold_impl(os, object, DNODE_MUST_BE_ALLOCATED, tag, dnp)); 638fa9e4066Sahrens } 639fa9e4066Sahrens 6401934e92fSmaybee /* 6411934e92fSmaybee * Can only add a reference if there is already at least one 6421934e92fSmaybee * reference on the dnode. Returns FALSE if unable to add a 6431934e92fSmaybee * new reference. 6441934e92fSmaybee */ 6451934e92fSmaybee boolean_t 646ea8dc4b6Seschrock dnode_add_ref(dnode_t *dn, void *tag) 647fa9e4066Sahrens { 6481934e92fSmaybee mutex_enter(&dn->dn_mtx); 6491934e92fSmaybee if (refcount_is_zero(&dn->dn_holds)) { 6501934e92fSmaybee mutex_exit(&dn->dn_mtx); 6511934e92fSmaybee return (FALSE); 6521934e92fSmaybee } 6531934e92fSmaybee VERIFY(1 < refcount_add(&dn->dn_holds, tag)); 6541934e92fSmaybee mutex_exit(&dn->dn_mtx); 6551934e92fSmaybee return (TRUE); 656fa9e4066Sahrens } 657fa9e4066Sahrens 658fa9e4066Sahrens void 659ea8dc4b6Seschrock dnode_rele(dnode_t *dn, void *tag) 660fa9e4066Sahrens { 661fa9e4066Sahrens uint64_t refs; 662fa9e4066Sahrens 6631934e92fSmaybee mutex_enter(&dn->dn_mtx); 664ea8dc4b6Seschrock refs = refcount_remove(&dn->dn_holds, tag); 6651934e92fSmaybee mutex_exit(&dn->dn_mtx); 666fa9e4066Sahrens /* NOTE: the DNODE_DNODE does not have a dn_dbuf */ 667fa9e4066Sahrens if (refs == 0 && dn->dn_dbuf) 668ea8dc4b6Seschrock dbuf_rele(dn->dn_dbuf, dn); 669fa9e4066Sahrens } 670fa9e4066Sahrens 671fa9e4066Sahrens void 672fa9e4066Sahrens dnode_setdirty(dnode_t *dn, dmu_tx_t *tx) 673fa9e4066Sahrens { 674fa9e4066Sahrens objset_impl_t *os = dn->dn_objset; 675fa9e4066Sahrens uint64_t txg = tx->tx_txg; 676fa9e4066Sahrens 677ea8dc4b6Seschrock if (dn->dn_object == DMU_META_DNODE_OBJECT) 678fa9e4066Sahrens return; 679fa9e4066Sahrens 6809c9dc39aSek DNODE_VERIFY(dn); 681fa9e4066Sahrens 682fa9e4066Sahrens #ifdef ZFS_DEBUG 683fa9e4066Sahrens mutex_enter(&dn->dn_mtx); 684fa9e4066Sahrens ASSERT(dn->dn_phys->dn_type || dn->dn_allocated_txg); 685fa9e4066Sahrens /* ASSERT(dn->dn_free_txg == 0 || dn->dn_free_txg >= txg); */ 686fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 687fa9e4066Sahrens #endif 688fa9e4066Sahrens 689fa9e4066Sahrens mutex_enter(&os->os_lock); 690fa9e4066Sahrens 691fa9e4066Sahrens /* 692fa9e4066Sahrens * If we are already marked dirty, we're done. 693fa9e4066Sahrens */ 694c543ec06Sahrens if (list_link_active(&dn->dn_dirty_link[txg & TXG_MASK])) { 695fa9e4066Sahrens mutex_exit(&os->os_lock); 696fa9e4066Sahrens return; 697fa9e4066Sahrens } 698fa9e4066Sahrens 699fa9e4066Sahrens ASSERT(!refcount_is_zero(&dn->dn_holds) || list_head(&dn->dn_dbufs)); 700fa9e4066Sahrens ASSERT(dn->dn_datablksz != 0); 7011934e92fSmaybee ASSERT3U(dn->dn_next_bonuslen[txg&TXG_MASK], ==, 0); 702f676ed34Sahrens ASSERT3U(dn->dn_next_blksz[txg&TXG_MASK], ==, 0); 703fa9e4066Sahrens 704fa9e4066Sahrens dprintf_ds(os->os_dsl_dataset, "obj=%llu txg=%llu\n", 705fa9e4066Sahrens dn->dn_object, txg); 706fa9e4066Sahrens 707fa9e4066Sahrens if (dn->dn_free_txg > 0 && dn->dn_free_txg <= txg) { 708fa9e4066Sahrens list_insert_tail(&os->os_free_dnodes[txg&TXG_MASK], dn); 709fa9e4066Sahrens } else { 710fa9e4066Sahrens list_insert_tail(&os->os_dirty_dnodes[txg&TXG_MASK], dn); 711fa9e4066Sahrens } 712fa9e4066Sahrens 713fa9e4066Sahrens mutex_exit(&os->os_lock); 714fa9e4066Sahrens 715fa9e4066Sahrens /* 716fa9e4066Sahrens * The dnode maintains a hold on its containing dbuf as 717fa9e4066Sahrens * long as there are holds on it. Each instantiated child 718fa9e4066Sahrens * dbuf maintaines a hold on the dnode. When the last child 719fa9e4066Sahrens * drops its hold, the dnode will drop its hold on the 720fa9e4066Sahrens * containing dbuf. We add a "dirty hold" here so that the 721fa9e4066Sahrens * dnode will hang around after we finish processing its 722fa9e4066Sahrens * children. 723fa9e4066Sahrens */ 7241934e92fSmaybee VERIFY(dnode_add_ref(dn, (void *)(uintptr_t)tx->tx_txg)); 725fa9e4066Sahrens 726c717a561Smaybee (void) dbuf_dirty(dn->dn_dbuf, tx); 727fa9e4066Sahrens 728fa9e4066Sahrens dsl_dataset_dirty(os->os_dsl_dataset, tx); 729fa9e4066Sahrens } 730fa9e4066Sahrens 731fa9e4066Sahrens void 732fa9e4066Sahrens dnode_free(dnode_t *dn, dmu_tx_t *tx) 733fa9e4066Sahrens { 734c543ec06Sahrens int txgoff = tx->tx_txg & TXG_MASK; 735c543ec06Sahrens 736fa9e4066Sahrens dprintf("dn=%p txg=%llu\n", dn, tx->tx_txg); 737fa9e4066Sahrens 738fa9e4066Sahrens /* we should be the only holder... hopefully */ 739fa9e4066Sahrens /* ASSERT3U(refcount_count(&dn->dn_holds), ==, 1); */ 740fa9e4066Sahrens 741fa9e4066Sahrens mutex_enter(&dn->dn_mtx); 742fa9e4066Sahrens if (dn->dn_type == DMU_OT_NONE || dn->dn_free_txg) { 743fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 744fa9e4066Sahrens return; 745fa9e4066Sahrens } 746fa9e4066Sahrens dn->dn_free_txg = tx->tx_txg; 747fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 748fa9e4066Sahrens 749fa9e4066Sahrens /* 750fa9e4066Sahrens * If the dnode is already dirty, it needs to be moved from 751fa9e4066Sahrens * the dirty list to the free list. 752fa9e4066Sahrens */ 753fa9e4066Sahrens mutex_enter(&dn->dn_objset->os_lock); 754c543ec06Sahrens if (list_link_active(&dn->dn_dirty_link[txgoff])) { 755c543ec06Sahrens list_remove(&dn->dn_objset->os_dirty_dnodes[txgoff], dn); 756c543ec06Sahrens list_insert_tail(&dn->dn_objset->os_free_dnodes[txgoff], dn); 757fa9e4066Sahrens mutex_exit(&dn->dn_objset->os_lock); 758fa9e4066Sahrens } else { 759fa9e4066Sahrens mutex_exit(&dn->dn_objset->os_lock); 760fa9e4066Sahrens dnode_setdirty(dn, tx); 761fa9e4066Sahrens } 762fa9e4066Sahrens } 763fa9e4066Sahrens 764fa9e4066Sahrens /* 765fa9e4066Sahrens * Try to change the block size for the indicated dnode. This can only 766fa9e4066Sahrens * succeed if there are no blocks allocated or dirty beyond first block 767fa9e4066Sahrens */ 768fa9e4066Sahrens int 769fa9e4066Sahrens dnode_set_blksz(dnode_t *dn, uint64_t size, int ibs, dmu_tx_t *tx) 770fa9e4066Sahrens { 771fa9e4066Sahrens dmu_buf_impl_t *db, *db_next; 772cdb0ab79Smaybee int err; 773fa9e4066Sahrens 774fa9e4066Sahrens if (size == 0) 775fa9e4066Sahrens size = SPA_MINBLOCKSIZE; 776fa9e4066Sahrens if (size > SPA_MAXBLOCKSIZE) 777fa9e4066Sahrens size = SPA_MAXBLOCKSIZE; 778fa9e4066Sahrens else 779fa9e4066Sahrens size = P2ROUNDUP(size, SPA_MINBLOCKSIZE); 780fa9e4066Sahrens 781b143e04bSahrens if (ibs == dn->dn_indblkshift) 782b143e04bSahrens ibs = 0; 783fa9e4066Sahrens 784b143e04bSahrens if (size >> SPA_MINBLOCKSHIFT == dn->dn_datablkszsec && ibs == 0) 785fa9e4066Sahrens return (0); 786fa9e4066Sahrens 787fa9e4066Sahrens rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 788fa9e4066Sahrens 789fa9e4066Sahrens /* Check for any allocated blocks beyond the first */ 790fa9e4066Sahrens if (dn->dn_phys->dn_maxblkid != 0) 791b143e04bSahrens goto fail; 792fa9e4066Sahrens 793fa9e4066Sahrens mutex_enter(&dn->dn_dbufs_mtx); 794fa9e4066Sahrens for (db = list_head(&dn->dn_dbufs); db; db = db_next) { 795fa9e4066Sahrens db_next = list_next(&dn->dn_dbufs, db); 796fa9e4066Sahrens 797cdb0ab79Smaybee if (db->db_blkid != 0 && db->db_blkid != DB_BONUS_BLKID) { 798fa9e4066Sahrens mutex_exit(&dn->dn_dbufs_mtx); 799b143e04bSahrens goto fail; 800fa9e4066Sahrens } 801fa9e4066Sahrens } 802fa9e4066Sahrens mutex_exit(&dn->dn_dbufs_mtx); 803fa9e4066Sahrens 804b143e04bSahrens if (ibs && dn->dn_nlevels != 1) 805b143e04bSahrens goto fail; 806b143e04bSahrens 807cdb0ab79Smaybee /* resize the old block */ 808cdb0ab79Smaybee err = dbuf_hold_impl(dn, 0, 0, TRUE, FTAG, &db); 809cdb0ab79Smaybee if (err == 0) 810c543ec06Sahrens dbuf_new_size(db, size, tx); 811cdb0ab79Smaybee else if (err != ENOENT) 812cdb0ab79Smaybee goto fail; 813fa9e4066Sahrens 814fa9e4066Sahrens dnode_setdblksz(dn, size); 815c543ec06Sahrens dnode_setdirty(dn, tx); 816c543ec06Sahrens dn->dn_next_blksz[tx->tx_txg&TXG_MASK] = size; 817b143e04bSahrens if (ibs) { 818b143e04bSahrens dn->dn_indblkshift = ibs; 819b143e04bSahrens dn->dn_next_indblkshift[tx->tx_txg&TXG_MASK] = ibs; 820b143e04bSahrens } 821cdb0ab79Smaybee /* rele after we have fixed the blocksize in the dnode */ 822c543ec06Sahrens if (db) 823c543ec06Sahrens dbuf_rele(db, FTAG); 824fa9e4066Sahrens 825fa9e4066Sahrens rw_exit(&dn->dn_struct_rwlock); 826b143e04bSahrens return (0); 827b143e04bSahrens 828b143e04bSahrens fail: 829b143e04bSahrens rw_exit(&dn->dn_struct_rwlock); 830b143e04bSahrens return (ENOTSUP); 831fa9e4066Sahrens } 832fa9e4066Sahrens 8338346f03fSJonathan W Adams /* read-holding callers must not rely on the lock being continuously held */ 834fa9e4066Sahrens void 8358346f03fSJonathan W Adams dnode_new_blkid(dnode_t *dn, uint64_t blkid, dmu_tx_t *tx, boolean_t have_read) 836fa9e4066Sahrens { 837fa9e4066Sahrens uint64_t txgoff = tx->tx_txg & TXG_MASK; 838c543ec06Sahrens int epbs, new_nlevels; 839fa9e4066Sahrens uint64_t sz; 840fa9e4066Sahrens 841c543ec06Sahrens ASSERT(blkid != DB_BONUS_BLKID); 842fa9e4066Sahrens 8438346f03fSJonathan W Adams ASSERT(have_read ? 8448346f03fSJonathan W Adams RW_READ_HELD(&dn->dn_struct_rwlock) : 8458346f03fSJonathan W Adams RW_WRITE_HELD(&dn->dn_struct_rwlock)); 8468346f03fSJonathan W Adams 8478346f03fSJonathan W Adams /* 8488346f03fSJonathan W Adams * if we have a read-lock, check to see if we need to do any work 8498346f03fSJonathan W Adams * before upgrading to a write-lock. 8508346f03fSJonathan W Adams */ 8518346f03fSJonathan W Adams if (have_read) { 8528346f03fSJonathan W Adams if (blkid <= dn->dn_maxblkid) 8538346f03fSJonathan W Adams return; 8548346f03fSJonathan W Adams 8558346f03fSJonathan W Adams if (!rw_tryupgrade(&dn->dn_struct_rwlock)) { 8568346f03fSJonathan W Adams rw_exit(&dn->dn_struct_rwlock); 8578346f03fSJonathan W Adams rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 8588346f03fSJonathan W Adams } 859fa9e4066Sahrens } 860fa9e4066Sahrens 861c543ec06Sahrens if (blkid <= dn->dn_maxblkid) 862c543ec06Sahrens goto out; 863c543ec06Sahrens 864c543ec06Sahrens dn->dn_maxblkid = blkid; 865fa9e4066Sahrens 866fa9e4066Sahrens /* 867c543ec06Sahrens * Compute the number of levels necessary to support the new maxblkid. 868fa9e4066Sahrens */ 869fa9e4066Sahrens new_nlevels = 1; 870fa9e4066Sahrens epbs = dn->dn_indblkshift - SPA_BLKPTRSHIFT; 871c543ec06Sahrens for (sz = dn->dn_nblkptr; 872c543ec06Sahrens sz <= blkid && sz >= dn->dn_nblkptr; sz <<= epbs) 873fa9e4066Sahrens new_nlevels++; 874fa9e4066Sahrens 875c543ec06Sahrens if (new_nlevels > dn->dn_nlevels) { 876c543ec06Sahrens int old_nlevels = dn->dn_nlevels; 877c543ec06Sahrens dmu_buf_impl_t *db; 878c717a561Smaybee list_t *list; 879c717a561Smaybee dbuf_dirty_record_t *new, *dr, *dr_next; 880fa9e4066Sahrens 881fa9e4066Sahrens dn->dn_nlevels = new_nlevels; 882fa9e4066Sahrens 883c543ec06Sahrens ASSERT3U(new_nlevels, >, dn->dn_next_nlevels[txgoff]); 884c543ec06Sahrens dn->dn_next_nlevels[txgoff] = new_nlevels; 885c543ec06Sahrens 886c717a561Smaybee /* dirty the left indirects */ 887c543ec06Sahrens db = dbuf_hold_level(dn, old_nlevels, 0, FTAG); 888c717a561Smaybee new = dbuf_dirty(db, tx); 889ea8dc4b6Seschrock dbuf_rele(db, FTAG); 890fa9e4066Sahrens 891c717a561Smaybee /* transfer the dirty records to the new indirect */ 892c717a561Smaybee mutex_enter(&dn->dn_mtx); 893c717a561Smaybee mutex_enter(&new->dt.di.dr_mtx); 894c717a561Smaybee list = &dn->dn_dirty_records[txgoff]; 895c717a561Smaybee for (dr = list_head(list); dr; dr = dr_next) { 896c717a561Smaybee dr_next = list_next(&dn->dn_dirty_records[txgoff], dr); 897c717a561Smaybee if (dr->dr_dbuf->db_level != new_nlevels-1 && 898c717a561Smaybee dr->dr_dbuf->db_blkid != DB_BONUS_BLKID) { 899c717a561Smaybee ASSERT(dr->dr_dbuf->db_level == old_nlevels-1); 900c717a561Smaybee list_remove(&dn->dn_dirty_records[txgoff], dr); 901c717a561Smaybee list_insert_tail(&new->dt.di.dr_children, dr); 902c717a561Smaybee dr->dr_parent = new; 903c717a561Smaybee } 904c717a561Smaybee } 905c717a561Smaybee mutex_exit(&new->dt.di.dr_mtx); 906c717a561Smaybee mutex_exit(&dn->dn_mtx); 907fa9e4066Sahrens } 908fa9e4066Sahrens 909fa9e4066Sahrens out: 9108346f03fSJonathan W Adams if (have_read) 9118346f03fSJonathan W Adams rw_downgrade(&dn->dn_struct_rwlock); 912fa9e4066Sahrens } 913fa9e4066Sahrens 914fa9e4066Sahrens void 915fa9e4066Sahrens dnode_clear_range(dnode_t *dn, uint64_t blkid, uint64_t nblks, dmu_tx_t *tx) 916fa9e4066Sahrens { 917fa9e4066Sahrens avl_tree_t *tree = &dn->dn_ranges[tx->tx_txg&TXG_MASK]; 918fa9e4066Sahrens avl_index_t where; 919fa9e4066Sahrens free_range_t *rp; 920fa9e4066Sahrens free_range_t rp_tofind; 921fa9e4066Sahrens uint64_t endblk = blkid + nblks; 922fa9e4066Sahrens 923fa9e4066Sahrens ASSERT(MUTEX_HELD(&dn->dn_mtx)); 924fa9e4066Sahrens ASSERT(nblks <= UINT64_MAX - blkid); /* no overflow */ 925fa9e4066Sahrens 926fa9e4066Sahrens dprintf_dnode(dn, "blkid=%llu nblks=%llu txg=%llu\n", 927fa9e4066Sahrens blkid, nblks, tx->tx_txg); 928fa9e4066Sahrens rp_tofind.fr_blkid = blkid; 929fa9e4066Sahrens rp = avl_find(tree, &rp_tofind, &where); 930fa9e4066Sahrens if (rp == NULL) 931fa9e4066Sahrens rp = avl_nearest(tree, where, AVL_BEFORE); 932fa9e4066Sahrens if (rp == NULL) 933fa9e4066Sahrens rp = avl_nearest(tree, where, AVL_AFTER); 934fa9e4066Sahrens 935fa9e4066Sahrens while (rp && (rp->fr_blkid <= blkid + nblks)) { 936fa9e4066Sahrens uint64_t fr_endblk = rp->fr_blkid + rp->fr_nblks; 937fa9e4066Sahrens free_range_t *nrp = AVL_NEXT(tree, rp); 938fa9e4066Sahrens 939fa9e4066Sahrens if (blkid <= rp->fr_blkid && endblk >= fr_endblk) { 940fa9e4066Sahrens /* clear this entire range */ 941fa9e4066Sahrens avl_remove(tree, rp); 942fa9e4066Sahrens kmem_free(rp, sizeof (free_range_t)); 943fa9e4066Sahrens } else if (blkid <= rp->fr_blkid && 944fa9e4066Sahrens endblk > rp->fr_blkid && endblk < fr_endblk) { 945fa9e4066Sahrens /* clear the beginning of this range */ 946fa9e4066Sahrens rp->fr_blkid = endblk; 947fa9e4066Sahrens rp->fr_nblks = fr_endblk - endblk; 948fa9e4066Sahrens } else if (blkid > rp->fr_blkid && blkid < fr_endblk && 949fa9e4066Sahrens endblk >= fr_endblk) { 950fa9e4066Sahrens /* clear the end of this range */ 951fa9e4066Sahrens rp->fr_nblks = blkid - rp->fr_blkid; 952fa9e4066Sahrens } else if (blkid > rp->fr_blkid && endblk < fr_endblk) { 953fa9e4066Sahrens /* clear a chunk out of this range */ 954fa9e4066Sahrens free_range_t *new_rp = 955fa9e4066Sahrens kmem_alloc(sizeof (free_range_t), KM_SLEEP); 956fa9e4066Sahrens 957fa9e4066Sahrens new_rp->fr_blkid = endblk; 958fa9e4066Sahrens new_rp->fr_nblks = fr_endblk - endblk; 959fa9e4066Sahrens avl_insert_here(tree, new_rp, rp, AVL_AFTER); 960fa9e4066Sahrens rp->fr_nblks = blkid - rp->fr_blkid; 961fa9e4066Sahrens } 962fa9e4066Sahrens /* there may be no overlap */ 963fa9e4066Sahrens rp = nrp; 964fa9e4066Sahrens } 965fa9e4066Sahrens } 966fa9e4066Sahrens 967fa9e4066Sahrens void 968fa9e4066Sahrens dnode_free_range(dnode_t *dn, uint64_t off, uint64_t len, dmu_tx_t *tx) 969fa9e4066Sahrens { 970fa9e4066Sahrens dmu_buf_impl_t *db; 971b143e04bSahrens uint64_t blkoff, blkid, nblks; 972cdb0ab79Smaybee int blksz, blkshift, head, tail; 973fa9e4066Sahrens int trunc = FALSE; 974cdb0ab79Smaybee int epbs; 975fa9e4066Sahrens 976fa9e4066Sahrens rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 977fa9e4066Sahrens blksz = dn->dn_datablksz; 978cdb0ab79Smaybee blkshift = dn->dn_datablkshift; 979cdb0ab79Smaybee epbs = dn->dn_indblkshift - SPA_BLKPTRSHIFT; 980fa9e4066Sahrens 981fa9e4066Sahrens if (len == -1ULL) { 982fa9e4066Sahrens len = UINT64_MAX - off; 983fa9e4066Sahrens trunc = TRUE; 984fa9e4066Sahrens } 985fa9e4066Sahrens 986fa9e4066Sahrens /* 987fa9e4066Sahrens * First, block align the region to free: 988fa9e4066Sahrens */ 989b143e04bSahrens if (ISP2(blksz)) { 990b143e04bSahrens head = P2NPHASE(off, blksz); 991b143e04bSahrens blkoff = P2PHASE(off, blksz); 992cdb0ab79Smaybee if ((off >> blkshift) > dn->dn_maxblkid) 993cdb0ab79Smaybee goto out; 994b143e04bSahrens } else { 995b143e04bSahrens ASSERT(dn->dn_maxblkid == 0); 996b143e04bSahrens if (off == 0 && len >= blksz) { 997cdb0ab79Smaybee /* Freeing the whole block; fast-track this request */ 998cdb0ab79Smaybee blkid = 0; 999cdb0ab79Smaybee nblks = 1; 1000cdb0ab79Smaybee goto done; 10011c8564a7SMark Maybee } else if (off >= blksz) { 1002cdb0ab79Smaybee /* Freeing past end-of-data */ 1003cdb0ab79Smaybee goto out; 1004fa9e4066Sahrens } else { 1005b143e04bSahrens /* Freeing part of the block. */ 1006fa9e4066Sahrens head = blksz - off; 1007fa9e4066Sahrens ASSERT3U(head, >, 0); 1008fa9e4066Sahrens } 1009b143e04bSahrens blkoff = off; 1010fa9e4066Sahrens } 1011fa9e4066Sahrens /* zero out any partial block data at the start of the range */ 1012fa9e4066Sahrens if (head) { 1013b143e04bSahrens ASSERT3U(blkoff + head, ==, blksz); 1014fa9e4066Sahrens if (len < head) 1015fa9e4066Sahrens head = len; 1016fa9e4066Sahrens if (dbuf_hold_impl(dn, 0, dbuf_whichblock(dn, off), TRUE, 1017fa9e4066Sahrens FTAG, &db) == 0) { 1018fa9e4066Sahrens caddr_t data; 1019fa9e4066Sahrens 1020fa9e4066Sahrens /* don't dirty if it isn't on disk and isn't dirty */ 1021c717a561Smaybee if (db->db_last_dirty || 1022fa9e4066Sahrens (db->db_blkptr && !BP_IS_HOLE(db->db_blkptr))) { 1023fa9e4066Sahrens rw_exit(&dn->dn_struct_rwlock); 1024fa9e4066Sahrens dbuf_will_dirty(db, tx); 1025fa9e4066Sahrens rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 1026fa9e4066Sahrens data = db->db.db_data; 1027b143e04bSahrens bzero(data + blkoff, head); 1028fa9e4066Sahrens } 1029ea8dc4b6Seschrock dbuf_rele(db, FTAG); 1030fa9e4066Sahrens } 1031fa9e4066Sahrens off += head; 1032fa9e4066Sahrens len -= head; 1033fa9e4066Sahrens } 1034fa9e4066Sahrens 1035b143e04bSahrens /* If the range was less than one block, we're done */ 1036cdb0ab79Smaybee if (len == 0) 1037fa9e4066Sahrens goto out; 1038fa9e4066Sahrens 1039cdb0ab79Smaybee /* If the remaining range is past end of file, we're done */ 1040cdb0ab79Smaybee if ((off >> blkshift) > dn->dn_maxblkid) 1041cdb0ab79Smaybee goto out; 1042b143e04bSahrens 10431c8564a7SMark Maybee ASSERT(ISP2(blksz)); 1044cdb0ab79Smaybee if (trunc) 1045cdb0ab79Smaybee tail = 0; 1046cdb0ab79Smaybee else 1047cdb0ab79Smaybee tail = P2PHASE(len, blksz); 1048cdb0ab79Smaybee 1049cdb0ab79Smaybee ASSERT3U(P2PHASE(off, blksz), ==, 0); 1050cdb0ab79Smaybee /* zero out any partial block data at the end of the range */ 1051cdb0ab79Smaybee if (tail) { 1052cdb0ab79Smaybee if (len < tail) 1053cdb0ab79Smaybee tail = len; 1054cdb0ab79Smaybee if (dbuf_hold_impl(dn, 0, dbuf_whichblock(dn, off+len), 1055cdb0ab79Smaybee TRUE, FTAG, &db) == 0) { 1056cdb0ab79Smaybee /* don't dirty if not on disk and not dirty */ 1057cdb0ab79Smaybee if (db->db_last_dirty || 1058cdb0ab79Smaybee (db->db_blkptr && !BP_IS_HOLE(db->db_blkptr))) { 1059cdb0ab79Smaybee rw_exit(&dn->dn_struct_rwlock); 1060cdb0ab79Smaybee dbuf_will_dirty(db, tx); 1061cdb0ab79Smaybee rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 1062cdb0ab79Smaybee bzero(db->db.db_data, tail); 1063fa9e4066Sahrens } 1064ea8dc4b6Seschrock dbuf_rele(db, FTAG); 1065fa9e4066Sahrens } 1066cdb0ab79Smaybee len -= tail; 1067cdb0ab79Smaybee } 1068fa9e4066Sahrens 1069cdb0ab79Smaybee /* If the range did not include a full block, we are done */ 1070cdb0ab79Smaybee if (len == 0) 1071cdb0ab79Smaybee goto out; 1072fa9e4066Sahrens 1073cdb0ab79Smaybee ASSERT(IS_P2ALIGNED(off, blksz)); 1074cdb0ab79Smaybee ASSERT(trunc || IS_P2ALIGNED(len, blksz)); 1075cdb0ab79Smaybee blkid = off >> blkshift; 1076cdb0ab79Smaybee nblks = len >> blkshift; 1077cdb0ab79Smaybee if (trunc) 1078cdb0ab79Smaybee nblks += 1; 1079cdb0ab79Smaybee 1080cdb0ab79Smaybee /* 1081cdb0ab79Smaybee * Read in and mark all the level-1 indirects dirty, 1082cdb0ab79Smaybee * so that they will stay in memory until syncing phase. 108356d55a53Smaybee * Always dirty the first and last indirect to make sure 108456d55a53Smaybee * we dirty all the partial indirects. 1085cdb0ab79Smaybee */ 1086cdb0ab79Smaybee if (dn->dn_nlevels > 1) { 1087cdb0ab79Smaybee uint64_t i, first, last; 1088cdb0ab79Smaybee int shift = epbs + dn->dn_datablkshift; 1089b143e04bSahrens 1090cdb0ab79Smaybee first = blkid >> epbs; 109156d55a53Smaybee if (db = dbuf_hold_level(dn, 1, first, FTAG)) { 109256d55a53Smaybee dbuf_will_dirty(db, tx); 109356d55a53Smaybee dbuf_rele(db, FTAG); 109456d55a53Smaybee } 1095b143e04bSahrens if (trunc) 1096cdb0ab79Smaybee last = dn->dn_maxblkid >> epbs; 1097cdb0ab79Smaybee else 1098cdb0ab79Smaybee last = (blkid + nblks - 1) >> epbs; 109956d55a53Smaybee if (last > first && (db = dbuf_hold_level(dn, 1, last, FTAG))) { 110056d55a53Smaybee dbuf_will_dirty(db, tx); 110156d55a53Smaybee dbuf_rele(db, FTAG); 110256d55a53Smaybee } 110356d55a53Smaybee for (i = first + 1; i < last; i++) { 1104cdb0ab79Smaybee uint64_t ibyte = i << shift; 1105cdb0ab79Smaybee int err; 1106cdb0ab79Smaybee 1107cdb0ab79Smaybee err = dnode_next_offset(dn, 1108cdb0ab79Smaybee DNODE_FIND_HAVELOCK, &ibyte, 1, 1, 0); 1109cdb0ab79Smaybee i = ibyte >> shift; 111056d55a53Smaybee if (err == ESRCH || i >= last) 1111cdb0ab79Smaybee break; 1112cdb0ab79Smaybee ASSERT(err == 0); 1113cdb0ab79Smaybee db = dbuf_hold_level(dn, 1, i, FTAG); 1114cdb0ab79Smaybee if (db) { 1115cdb0ab79Smaybee dbuf_will_dirty(db, tx); 1116cdb0ab79Smaybee dbuf_rele(db, FTAG); 1117cdb0ab79Smaybee } 1118cdb0ab79Smaybee } 1119fa9e4066Sahrens } 1120cdb0ab79Smaybee done: 1121cdb0ab79Smaybee /* 1122cdb0ab79Smaybee * Add this range to the dnode range list. 1123cdb0ab79Smaybee * We will finish up this free operation in the syncing phase. 1124cdb0ab79Smaybee */ 1125fa9e4066Sahrens mutex_enter(&dn->dn_mtx); 1126fa9e4066Sahrens dnode_clear_range(dn, blkid, nblks, tx); 1127fa9e4066Sahrens { 1128fa9e4066Sahrens free_range_t *rp, *found; 1129fa9e4066Sahrens avl_index_t where; 1130fa9e4066Sahrens avl_tree_t *tree = &dn->dn_ranges[tx->tx_txg&TXG_MASK]; 1131fa9e4066Sahrens 1132fa9e4066Sahrens /* Add new range to dn_ranges */ 1133fa9e4066Sahrens rp = kmem_alloc(sizeof (free_range_t), KM_SLEEP); 1134fa9e4066Sahrens rp->fr_blkid = blkid; 1135fa9e4066Sahrens rp->fr_nblks = nblks; 1136fa9e4066Sahrens found = avl_find(tree, rp, &where); 1137fa9e4066Sahrens ASSERT(found == NULL); 1138fa9e4066Sahrens avl_insert(tree, rp, where); 1139fa9e4066Sahrens dprintf_dnode(dn, "blkid=%llu nblks=%llu txg=%llu\n", 1140fa9e4066Sahrens blkid, nblks, tx->tx_txg); 1141fa9e4066Sahrens } 1142fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 1143fa9e4066Sahrens 1144cdb0ab79Smaybee dbuf_free_range(dn, blkid, blkid + nblks - 1, tx); 1145fa9e4066Sahrens dnode_setdirty(dn, tx); 1146fa9e4066Sahrens out: 1147cdb0ab79Smaybee if (trunc && dn->dn_maxblkid >= (off >> blkshift)) 1148cdb0ab79Smaybee dn->dn_maxblkid = (off >> blkshift ? (off >> blkshift) - 1 : 0); 1149cdb0ab79Smaybee 1150fa9e4066Sahrens rw_exit(&dn->dn_struct_rwlock); 1151fa9e4066Sahrens } 1152fa9e4066Sahrens 1153fa9e4066Sahrens /* return TRUE if this blkid was freed in a recent txg, or FALSE if it wasn't */ 1154fa9e4066Sahrens uint64_t 1155fa9e4066Sahrens dnode_block_freed(dnode_t *dn, uint64_t blkid) 1156fa9e4066Sahrens { 1157fa9e4066Sahrens free_range_t range_tofind; 1158fa9e4066Sahrens void *dp = spa_get_dsl(dn->dn_objset->os_spa); 1159fa9e4066Sahrens int i; 1160fa9e4066Sahrens 1161fa9e4066Sahrens if (blkid == DB_BONUS_BLKID) 1162fa9e4066Sahrens return (FALSE); 1163fa9e4066Sahrens 1164fa9e4066Sahrens /* 1165fa9e4066Sahrens * If we're in the process of opening the pool, dp will not be 1166fa9e4066Sahrens * set yet, but there shouldn't be anything dirty. 1167fa9e4066Sahrens */ 1168fa9e4066Sahrens if (dp == NULL) 1169fa9e4066Sahrens return (FALSE); 1170fa9e4066Sahrens 1171fa9e4066Sahrens if (dn->dn_free_txg) 1172fa9e4066Sahrens return (TRUE); 1173fa9e4066Sahrens 1174fa9e4066Sahrens range_tofind.fr_blkid = blkid; 1175fa9e4066Sahrens mutex_enter(&dn->dn_mtx); 1176fa9e4066Sahrens for (i = 0; i < TXG_SIZE; i++) { 1177fa9e4066Sahrens free_range_t *range_found; 1178fa9e4066Sahrens avl_index_t idx; 1179fa9e4066Sahrens 1180fa9e4066Sahrens range_found = avl_find(&dn->dn_ranges[i], &range_tofind, &idx); 1181fa9e4066Sahrens if (range_found) { 1182fa9e4066Sahrens ASSERT(range_found->fr_nblks > 0); 1183fa9e4066Sahrens break; 1184fa9e4066Sahrens } 1185fa9e4066Sahrens range_found = avl_nearest(&dn->dn_ranges[i], idx, AVL_BEFORE); 1186fa9e4066Sahrens if (range_found && 1187fa9e4066Sahrens range_found->fr_blkid + range_found->fr_nblks > blkid) 1188fa9e4066Sahrens break; 1189fa9e4066Sahrens } 1190fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 1191fa9e4066Sahrens return (i < TXG_SIZE); 1192fa9e4066Sahrens } 1193fa9e4066Sahrens 1194fa9e4066Sahrens /* call from syncing context when we actually write/free space for this dnode */ 1195fa9e4066Sahrens void 119699653d4eSeschrock dnode_diduse_space(dnode_t *dn, int64_t delta) 1197fa9e4066Sahrens { 119899653d4eSeschrock uint64_t space; 119999653d4eSeschrock dprintf_dnode(dn, "dn=%p dnp=%p used=%llu delta=%lld\n", 1200fa9e4066Sahrens dn, dn->dn_phys, 120199653d4eSeschrock (u_longlong_t)dn->dn_phys->dn_used, 120299653d4eSeschrock (longlong_t)delta); 1203fa9e4066Sahrens 1204fa9e4066Sahrens mutex_enter(&dn->dn_mtx); 120599653d4eSeschrock space = DN_USED_BYTES(dn->dn_phys); 120699653d4eSeschrock if (delta > 0) { 120799653d4eSeschrock ASSERT3U(space + delta, >=, space); /* no overflow */ 120899653d4eSeschrock } else { 120999653d4eSeschrock ASSERT3U(space, >=, -delta); /* no underflow */ 121099653d4eSeschrock } 121199653d4eSeschrock space += delta; 1212e7437265Sahrens if (spa_version(dn->dn_objset->os_spa) < SPA_VERSION_DNODE_BYTES) { 121399653d4eSeschrock ASSERT((dn->dn_phys->dn_flags & DNODE_FLAG_USED_BYTES) == 0); 121499653d4eSeschrock ASSERT3U(P2PHASE(space, 1<<DEV_BSHIFT), ==, 0); 121599653d4eSeschrock dn->dn_phys->dn_used = space >> DEV_BSHIFT; 1216fa9e4066Sahrens } else { 121799653d4eSeschrock dn->dn_phys->dn_used = space; 121899653d4eSeschrock dn->dn_phys->dn_flags |= DNODE_FLAG_USED_BYTES; 1219fa9e4066Sahrens } 1220fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 1221fa9e4066Sahrens } 1222fa9e4066Sahrens 1223fa9e4066Sahrens /* 1224fa9e4066Sahrens * Call when we think we're going to write/free space in open context. 1225fa9e4066Sahrens * Be conservative (ie. OK to write less than this or free more than 1226fa9e4066Sahrens * this, but don't write more or free less). 1227fa9e4066Sahrens */ 1228fa9e4066Sahrens void 1229fa9e4066Sahrens dnode_willuse_space(dnode_t *dn, int64_t space, dmu_tx_t *tx) 1230fa9e4066Sahrens { 1231fa9e4066Sahrens objset_impl_t *os = dn->dn_objset; 1232fa9e4066Sahrens dsl_dataset_t *ds = os->os_dsl_dataset; 1233fa9e4066Sahrens 1234fa9e4066Sahrens if (space > 0) 1235fa9e4066Sahrens space = spa_get_asize(os->os_spa, space); 1236fa9e4066Sahrens 1237fa9e4066Sahrens if (ds) 1238fa9e4066Sahrens dsl_dir_willuse_space(ds->ds_dir, space, tx); 1239fa9e4066Sahrens 1240fa9e4066Sahrens dmu_tx_willuse_space(tx, space); 1241fa9e4066Sahrens } 1242fa9e4066Sahrens 1243fa9e4066Sahrens static int 1244cdb0ab79Smaybee dnode_next_offset_level(dnode_t *dn, int flags, uint64_t *offset, 12456754306eSahrens int lvl, uint64_t blkfill, uint64_t txg) 1246fa9e4066Sahrens { 1247fa9e4066Sahrens dmu_buf_impl_t *db = NULL; 1248fa9e4066Sahrens void *data = NULL; 1249fa9e4066Sahrens uint64_t epbs = dn->dn_phys->dn_indblkshift - SPA_BLKPTRSHIFT; 1250fa9e4066Sahrens uint64_t epb = 1ULL << epbs; 1251fa9e4066Sahrens uint64_t minfill, maxfill; 1252cdb0ab79Smaybee boolean_t hole; 1253cdb0ab79Smaybee int i, inc, error, span; 1254fa9e4066Sahrens 1255fa9e4066Sahrens dprintf("probing object %llu offset %llx level %d of %u\n", 1256fa9e4066Sahrens dn->dn_object, *offset, lvl, dn->dn_phys->dn_nlevels); 1257fa9e4066Sahrens 1258cdb0ab79Smaybee hole = flags & DNODE_FIND_HOLE; 1259cdb0ab79Smaybee inc = (flags & DNODE_FIND_BACKWARDS) ? -1 : 1; 12601c8564a7SMark Maybee ASSERT(txg == 0 || !hole); 1261cdb0ab79Smaybee 1262fa9e4066Sahrens if (lvl == dn->dn_phys->dn_nlevels) { 1263fa9e4066Sahrens error = 0; 1264fa9e4066Sahrens epb = dn->dn_phys->dn_nblkptr; 1265fa9e4066Sahrens data = dn->dn_phys->dn_blkptr; 1266fa9e4066Sahrens } else { 1267fa9e4066Sahrens uint64_t blkid = dbuf_whichblock(dn, *offset) >> (epbs * lvl); 1268fa9e4066Sahrens error = dbuf_hold_impl(dn, lvl, blkid, TRUE, FTAG, &db); 1269fa9e4066Sahrens if (error) { 12701c8564a7SMark Maybee if (error != ENOENT) 12711c8564a7SMark Maybee return (error); 12721c8564a7SMark Maybee if (hole) 12731c8564a7SMark Maybee return (0); 12741c8564a7SMark Maybee /* 12751c8564a7SMark Maybee * This can only happen when we are searching up 12761c8564a7SMark Maybee * the block tree for data. We don't really need to 12771c8564a7SMark Maybee * adjust the offset, as we will just end up looking 12781c8564a7SMark Maybee * at the pointer to this block in its parent, and its 12791c8564a7SMark Maybee * going to be unallocated, so we will skip over it. 12801c8564a7SMark Maybee */ 12811c8564a7SMark Maybee return (ESRCH); 1282fa9e4066Sahrens } 128398572ac1Sahrens error = dbuf_read(db, NULL, DB_RF_CANFAIL | DB_RF_HAVESTRUCT); 128498572ac1Sahrens if (error) { 128598572ac1Sahrens dbuf_rele(db, FTAG); 128698572ac1Sahrens return (error); 128798572ac1Sahrens } 1288fa9e4066Sahrens data = db->db.db_data; 1289fa9e4066Sahrens } 1290fa9e4066Sahrens 12916754306eSahrens if (db && txg && 12926754306eSahrens (db->db_blkptr == NULL || db->db_blkptr->blk_birth <= txg)) { 12931c8564a7SMark Maybee /* 12941c8564a7SMark Maybee * This can only happen when we are searching up the tree 12951c8564a7SMark Maybee * and these conditions mean that we need to keep climbing. 12961c8564a7SMark Maybee */ 12976754306eSahrens error = ESRCH; 12986754306eSahrens } else if (lvl == 0) { 1299fa9e4066Sahrens dnode_phys_t *dnp = data; 1300fa9e4066Sahrens span = DNODE_SHIFT; 1301fa9e4066Sahrens ASSERT(dn->dn_type == DMU_OT_DNODE); 1302fa9e4066Sahrens 1303cdb0ab79Smaybee for (i = (*offset >> span) & (blkfill - 1); 1304cdb0ab79Smaybee i >= 0 && i < blkfill; i += inc) { 13056754306eSahrens boolean_t newcontents = B_TRUE; 13066754306eSahrens if (txg) { 13076754306eSahrens int j; 13086754306eSahrens newcontents = B_FALSE; 13096754306eSahrens for (j = 0; j < dnp[i].dn_nblkptr; j++) { 13106754306eSahrens if (dnp[i].dn_blkptr[j].blk_birth > txg) 13116754306eSahrens newcontents = B_TRUE; 13126754306eSahrens } 13136754306eSahrens } 13146754306eSahrens if (!dnp[i].dn_type == hole && newcontents) 1315fa9e4066Sahrens break; 1316cdb0ab79Smaybee *offset += (1ULL << span) * inc; 1317fa9e4066Sahrens } 1318cdb0ab79Smaybee if (i < 0 || i == blkfill) 1319fa9e4066Sahrens error = ESRCH; 1320fa9e4066Sahrens } else { 1321fa9e4066Sahrens blkptr_t *bp = data; 1322fa9e4066Sahrens span = (lvl - 1) * epbs + dn->dn_datablkshift; 1323fa9e4066Sahrens minfill = 0; 1324fa9e4066Sahrens maxfill = blkfill << ((lvl - 1) * epbs); 1325fa9e4066Sahrens 1326fa9e4066Sahrens if (hole) 1327fa9e4066Sahrens maxfill--; 1328fa9e4066Sahrens else 1329fa9e4066Sahrens minfill++; 1330fa9e4066Sahrens 1331fa9e4066Sahrens for (i = (*offset >> span) & ((1ULL << epbs) - 1); 1332cdb0ab79Smaybee i >= 0 && i < epb; i += inc) { 1333fa9e4066Sahrens if (bp[i].blk_fill >= minfill && 13346754306eSahrens bp[i].blk_fill <= maxfill && 13351c8564a7SMark Maybee (hole || bp[i].blk_birth > txg)) 1336fa9e4066Sahrens break; 13371c8564a7SMark Maybee if (inc < 0 && *offset < (1ULL << span)) 13381c8564a7SMark Maybee *offset = 0; 13391c8564a7SMark Maybee else 13401c8564a7SMark Maybee *offset += (1ULL << span) * inc; 1341fa9e4066Sahrens } 1342cdb0ab79Smaybee if (i < 0 || i == epb) 1343fa9e4066Sahrens error = ESRCH; 1344fa9e4066Sahrens } 1345fa9e4066Sahrens 1346fa9e4066Sahrens if (db) 1347ea8dc4b6Seschrock dbuf_rele(db, FTAG); 1348fa9e4066Sahrens 1349fa9e4066Sahrens return (error); 1350fa9e4066Sahrens } 1351fa9e4066Sahrens 1352fa9e4066Sahrens /* 1353fa9e4066Sahrens * Find the next hole, data, or sparse region at or after *offset. 1354fa9e4066Sahrens * The value 'blkfill' tells us how many items we expect to find 1355fa9e4066Sahrens * in an L0 data block; this value is 1 for normal objects, 1356fa9e4066Sahrens * DNODES_PER_BLOCK for the meta dnode, and some fraction of 1357fa9e4066Sahrens * DNODES_PER_BLOCK when searching for sparse regions thereof. 13586754306eSahrens * 1359fa9e4066Sahrens * Examples: 1360fa9e4066Sahrens * 1361cdb0ab79Smaybee * dnode_next_offset(dn, flags, offset, 1, 1, 0); 1362cdb0ab79Smaybee * Finds the next/previous hole/data in a file. 1363fa9e4066Sahrens * Used in dmu_offset_next(). 1364fa9e4066Sahrens * 1365cdb0ab79Smaybee * dnode_next_offset(mdn, flags, offset, 0, DNODES_PER_BLOCK, txg); 1366fa9e4066Sahrens * Finds the next free/allocated dnode an objset's meta-dnode. 13676754306eSahrens * Only finds objects that have new contents since txg (ie. 13686754306eSahrens * bonus buffer changes and content removal are ignored). 1369fa9e4066Sahrens * Used in dmu_object_next(). 1370fa9e4066Sahrens * 1371cdb0ab79Smaybee * dnode_next_offset(mdn, DNODE_FIND_HOLE, offset, 2, DNODES_PER_BLOCK >> 2, 0); 1372fa9e4066Sahrens * Finds the next L2 meta-dnode bp that's at most 1/4 full. 1373fa9e4066Sahrens * Used in dmu_object_alloc(). 1374fa9e4066Sahrens */ 1375fa9e4066Sahrens int 1376cdb0ab79Smaybee dnode_next_offset(dnode_t *dn, int flags, uint64_t *offset, 13776754306eSahrens int minlvl, uint64_t blkfill, uint64_t txg) 1378fa9e4066Sahrens { 1379cdb0ab79Smaybee uint64_t initial_offset = *offset; 1380fa9e4066Sahrens int lvl, maxlvl; 1381fa9e4066Sahrens int error = 0; 1382fa9e4066Sahrens 1383cdb0ab79Smaybee if (!(flags & DNODE_FIND_HAVELOCK)) 1384cdb0ab79Smaybee rw_enter(&dn->dn_struct_rwlock, RW_READER); 1385fa9e4066Sahrens 1386fa9e4066Sahrens if (dn->dn_phys->dn_nlevels == 0) { 1387cdb0ab79Smaybee error = ESRCH; 1388cdb0ab79Smaybee goto out; 1389fa9e4066Sahrens } 1390fa9e4066Sahrens 1391fa9e4066Sahrens if (dn->dn_datablkshift == 0) { 1392fa9e4066Sahrens if (*offset < dn->dn_datablksz) { 1393cdb0ab79Smaybee if (flags & DNODE_FIND_HOLE) 1394fa9e4066Sahrens *offset = dn->dn_datablksz; 1395fa9e4066Sahrens } else { 1396fa9e4066Sahrens error = ESRCH; 1397fa9e4066Sahrens } 1398cdb0ab79Smaybee goto out; 1399fa9e4066Sahrens } 1400fa9e4066Sahrens 1401fa9e4066Sahrens maxlvl = dn->dn_phys->dn_nlevels; 1402fa9e4066Sahrens 1403fa9e4066Sahrens for (lvl = minlvl; lvl <= maxlvl; lvl++) { 14046754306eSahrens error = dnode_next_offset_level(dn, 1405cdb0ab79Smaybee flags, offset, lvl, blkfill, txg); 140698572ac1Sahrens if (error != ESRCH) 1407fa9e4066Sahrens break; 1408fa9e4066Sahrens } 1409fa9e4066Sahrens 1410cdb0ab79Smaybee while (error == 0 && --lvl >= minlvl) { 14116754306eSahrens error = dnode_next_offset_level(dn, 1412cdb0ab79Smaybee flags, offset, lvl, blkfill, txg); 14136754306eSahrens } 1414fa9e4066Sahrens 1415cdb0ab79Smaybee if (error == 0 && (flags & DNODE_FIND_BACKWARDS ? 1416cdb0ab79Smaybee initial_offset < *offset : initial_offset > *offset)) 141798572ac1Sahrens error = ESRCH; 1418cdb0ab79Smaybee out: 1419cdb0ab79Smaybee if (!(flags & DNODE_FIND_HAVELOCK)) 1420cdb0ab79Smaybee rw_exit(&dn->dn_struct_rwlock); 1421fa9e4066Sahrens 1422fa9e4066Sahrens return (error); 1423fa9e4066Sahrens } 1424