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 /* 22*5a98e54bSBrendan 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 305*5a98e54bSBrendan 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); 340*5a98e54bSBrendan 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 { 4201934e92fSmaybee int i, old_nblkptr; 421432f72fdSahrens dmu_buf_impl_t *db = NULL; 422c543ec06Sahrens 423fa9e4066Sahrens ASSERT3U(blocksize, >=, SPA_MINBLOCKSIZE); 424fa9e4066Sahrens ASSERT3U(blocksize, <=, SPA_MAXBLOCKSIZE); 425fa9e4066Sahrens ASSERT3U(blocksize % SPA_MINBLOCKSIZE, ==, 0); 426ea8dc4b6Seschrock ASSERT(dn->dn_object != DMU_META_DNODE_OBJECT || dmu_tx_private_ok(tx)); 427fa9e4066Sahrens ASSERT(tx->tx_txg != 0); 428fa9e4066Sahrens ASSERT((bonustype == DMU_OT_NONE && bonuslen == 0) || 429fa9e4066Sahrens (bonustype != DMU_OT_NONE && bonuslen != 0)); 430fa9e4066Sahrens ASSERT3U(bonustype, <, DMU_OT_NUMTYPES); 431fa9e4066Sahrens ASSERT3U(bonuslen, <=, DN_MAX_BONUSLEN); 432c543ec06Sahrens 433c543ec06Sahrens for (i = 0; i < TXG_SIZE; i++) 434c543ec06Sahrens ASSERT(!list_link_active(&dn->dn_dirty_link[i])); 435fa9e4066Sahrens 436ea8dc4b6Seschrock /* clean up any unreferenced dbufs */ 4371934e92fSmaybee dnode_evict_dbufs(dn); 438ea8dc4b6Seschrock ASSERT3P(list_head(&dn->dn_dbufs), ==, NULL); 439ea8dc4b6Seschrock 440fa9e4066Sahrens /* 441fa9e4066Sahrens * XXX I should really have a generation number to tell if we 442fa9e4066Sahrens * need to do this... 443fa9e4066Sahrens */ 444fa9e4066Sahrens if (blocksize != dn->dn_datablksz || 445fa9e4066Sahrens dn->dn_bonustype != bonustype || dn->dn_bonuslen != bonuslen) { 446fa9e4066Sahrens /* free all old data */ 447fa9e4066Sahrens dnode_free_range(dn, 0, -1ULL, tx); 448fa9e4066Sahrens } 449fa9e4066Sahrens 450fa9e4066Sahrens /* change blocksize */ 451fa9e4066Sahrens rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 452432f72fdSahrens if (blocksize != dn->dn_datablksz && 453432f72fdSahrens (!BP_IS_HOLE(&dn->dn_phys->dn_blkptr[0]) || 454432f72fdSahrens list_head(&dn->dn_dbufs) != NULL)) { 455432f72fdSahrens db = dbuf_hold(dn, 0, FTAG); 456432f72fdSahrens dbuf_new_size(db, blocksize, tx); 457432f72fdSahrens } 458fa9e4066Sahrens dnode_setdblksz(dn, blocksize); 459fa9e4066Sahrens dnode_setdirty(dn, tx); 4601934e92fSmaybee dn->dn_next_bonuslen[tx->tx_txg&TXG_MASK] = bonuslen; 461c543ec06Sahrens dn->dn_next_blksz[tx->tx_txg&TXG_MASK] = blocksize; 462fa9e4066Sahrens rw_exit(&dn->dn_struct_rwlock); 4631934e92fSmaybee if (db) 464432f72fdSahrens dbuf_rele(db, FTAG); 465fa9e4066Sahrens 466fa9e4066Sahrens /* change type */ 467fa9e4066Sahrens dn->dn_type = ot; 468fa9e4066Sahrens 469fa9e4066Sahrens /* change bonus size and type */ 470fa9e4066Sahrens mutex_enter(&dn->dn_mtx); 4711934e92fSmaybee old_nblkptr = dn->dn_nblkptr; 472fa9e4066Sahrens dn->dn_bonustype = bonustype; 473fa9e4066Sahrens dn->dn_bonuslen = bonuslen; 474fa9e4066Sahrens dn->dn_nblkptr = 1 + ((DN_MAX_BONUSLEN - bonuslen) >> SPA_BLKPTRSHIFT); 475fa9e4066Sahrens dn->dn_checksum = ZIO_CHECKSUM_INHERIT; 476fa9e4066Sahrens dn->dn_compress = ZIO_COMPRESS_INHERIT; 477fa9e4066Sahrens ASSERT3U(dn->dn_nblkptr, <=, DN_MAX_NBLKPTR); 478fa9e4066Sahrens 4791934e92fSmaybee /* XXX - for now, we can't make nblkptr smaller */ 4801934e92fSmaybee ASSERT3U(dn->dn_nblkptr, >=, old_nblkptr); 4811934e92fSmaybee 4821934e92fSmaybee /* fix up the bonus db_size if dn_nblkptr has changed */ 4831934e92fSmaybee if (dn->dn_bonus && dn->dn_bonuslen != old_nblkptr) { 4841934e92fSmaybee dn->dn_bonus->db.db_size = 4851934e92fSmaybee DN_MAX_BONUSLEN - (dn->dn_nblkptr-1) * sizeof (blkptr_t); 4861934e92fSmaybee ASSERT(dn->dn_bonuslen <= dn->dn_bonus->db.db_size); 4871934e92fSmaybee } 488432f72fdSahrens 489fa9e4066Sahrens dn->dn_allocated_txg = tx->tx_txg; 490fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 491fa9e4066Sahrens } 492fa9e4066Sahrens 493fa9e4066Sahrens void 494fa9e4066Sahrens dnode_special_close(dnode_t *dn) 495fa9e4066Sahrens { 496ea8dc4b6Seschrock /* 497ea8dc4b6Seschrock * Wait for final references to the dnode to clear. This can 498ea8dc4b6Seschrock * only happen if the arc is asyncronously evicting state that 499ea8dc4b6Seschrock * has a hold on this dnode while we are trying to evict this 500ea8dc4b6Seschrock * dnode. 501ea8dc4b6Seschrock */ 502ea8dc4b6Seschrock while (refcount_count(&dn->dn_holds) > 0) 503ea8dc4b6Seschrock delay(1); 504fa9e4066Sahrens dnode_destroy(dn); 505fa9e4066Sahrens } 506fa9e4066Sahrens 507fa9e4066Sahrens dnode_t * 508fa9e4066Sahrens dnode_special_open(objset_impl_t *os, dnode_phys_t *dnp, uint64_t object) 509fa9e4066Sahrens { 510fa9e4066Sahrens dnode_t *dn = dnode_create(os, dnp, NULL, object); 5119c9dc39aSek DNODE_VERIFY(dn); 512fa9e4066Sahrens return (dn); 513fa9e4066Sahrens } 514fa9e4066Sahrens 515fa9e4066Sahrens static void 516fa9e4066Sahrens dnode_buf_pageout(dmu_buf_t *db, void *arg) 517fa9e4066Sahrens { 518fa9e4066Sahrens dnode_t **children_dnodes = arg; 519fa9e4066Sahrens int i; 520fa9e4066Sahrens int epb = db->db_size >> DNODE_SHIFT; 521fa9e4066Sahrens 522fa9e4066Sahrens for (i = 0; i < epb; i++) { 523fa9e4066Sahrens dnode_t *dn = children_dnodes[i]; 524fa9e4066Sahrens int n; 525fa9e4066Sahrens 526fa9e4066Sahrens if (dn == NULL) 527fa9e4066Sahrens continue; 528fa9e4066Sahrens #ifdef ZFS_DEBUG 529fa9e4066Sahrens /* 530fa9e4066Sahrens * If there are holds on this dnode, then there should 531fa9e4066Sahrens * be holds on the dnode's containing dbuf as well; thus 532fa9e4066Sahrens * it wouldn't be eligable for eviction and this function 533fa9e4066Sahrens * would not have been called. 534fa9e4066Sahrens */ 535fa9e4066Sahrens ASSERT(refcount_is_zero(&dn->dn_holds)); 536fa9e4066Sahrens ASSERT(list_head(&dn->dn_dbufs) == NULL); 537fa9e4066Sahrens ASSERT(refcount_is_zero(&dn->dn_tx_holds)); 538fa9e4066Sahrens 539fa9e4066Sahrens for (n = 0; n < TXG_SIZE; n++) 540c543ec06Sahrens ASSERT(!list_link_active(&dn->dn_dirty_link[n])); 541fa9e4066Sahrens #endif 542fa9e4066Sahrens children_dnodes[i] = NULL; 543fa9e4066Sahrens dnode_destroy(dn); 544fa9e4066Sahrens } 545fa9e4066Sahrens kmem_free(children_dnodes, epb * sizeof (dnode_t *)); 546fa9e4066Sahrens } 547fa9e4066Sahrens 548fa9e4066Sahrens /* 549ea8dc4b6Seschrock * errors: 550ea8dc4b6Seschrock * EINVAL - invalid object number. 551ea8dc4b6Seschrock * EIO - i/o error. 552ea8dc4b6Seschrock * succeeds even for free dnodes. 553fa9e4066Sahrens */ 554ea8dc4b6Seschrock int 555ea8dc4b6Seschrock dnode_hold_impl(objset_impl_t *os, uint64_t object, int flag, 556ea8dc4b6Seschrock void *tag, dnode_t **dnp) 557fa9e4066Sahrens { 558ea8dc4b6Seschrock int epb, idx, err; 559fa9e4066Sahrens int drop_struct_lock = FALSE; 560ea8dc4b6Seschrock int type; 561fa9e4066Sahrens uint64_t blk; 562fa9e4066Sahrens dnode_t *mdn, *dn; 563fa9e4066Sahrens dmu_buf_impl_t *db; 564fa9e4066Sahrens dnode_t **children_dnodes; 565fa9e4066Sahrens 566e14bb325SJeff Bonwick /* 567e14bb325SJeff Bonwick * If you are holding the spa config lock as writer, you shouldn't 568e14bb325SJeff Bonwick * be asking the DMU to do *anything*. 569e14bb325SJeff Bonwick */ 570e14bb325SJeff Bonwick ASSERT(spa_config_held(os->os_spa, SCL_ALL, RW_WRITER) == 0); 571e14bb325SJeff Bonwick 572fa9e4066Sahrens if (object == 0 || object >= DN_MAX_OBJECT) 573ea8dc4b6Seschrock return (EINVAL); 574fa9e4066Sahrens 575fa9e4066Sahrens mdn = os->os_meta_dnode; 576fa9e4066Sahrens 5779c9dc39aSek DNODE_VERIFY(mdn); 578fa9e4066Sahrens 579fa9e4066Sahrens if (!RW_WRITE_HELD(&mdn->dn_struct_rwlock)) { 580fa9e4066Sahrens rw_enter(&mdn->dn_struct_rwlock, RW_READER); 581fa9e4066Sahrens drop_struct_lock = TRUE; 582fa9e4066Sahrens } 583fa9e4066Sahrens 584fa9e4066Sahrens blk = dbuf_whichblock(mdn, object * sizeof (dnode_phys_t)); 585fa9e4066Sahrens 586ea8dc4b6Seschrock db = dbuf_hold(mdn, blk, FTAG); 587fa9e4066Sahrens if (drop_struct_lock) 588fa9e4066Sahrens rw_exit(&mdn->dn_struct_rwlock); 589ea8dc4b6Seschrock if (db == NULL) 590ea8dc4b6Seschrock return (EIO); 591ea8dc4b6Seschrock err = dbuf_read(db, NULL, DB_RF_CANFAIL); 592ea8dc4b6Seschrock if (err) { 593ea8dc4b6Seschrock dbuf_rele(db, FTAG); 594ea8dc4b6Seschrock return (err); 595ea8dc4b6Seschrock } 596fa9e4066Sahrens 597fa9e4066Sahrens ASSERT3U(db->db.db_size, >=, 1<<DNODE_SHIFT); 598fa9e4066Sahrens epb = db->db.db_size >> DNODE_SHIFT; 599fa9e4066Sahrens 600fa9e4066Sahrens idx = object & (epb-1); 601fa9e4066Sahrens 602fa9e4066Sahrens children_dnodes = dmu_buf_get_user(&db->db); 603fa9e4066Sahrens if (children_dnodes == NULL) { 604fa9e4066Sahrens dnode_t **winner; 605fa9e4066Sahrens children_dnodes = kmem_zalloc(epb * sizeof (dnode_t *), 606fa9e4066Sahrens KM_SLEEP); 607fa9e4066Sahrens if (winner = dmu_buf_set_user(&db->db, children_dnodes, NULL, 608fa9e4066Sahrens dnode_buf_pageout)) { 609fa9e4066Sahrens kmem_free(children_dnodes, epb * sizeof (dnode_t *)); 610fa9e4066Sahrens children_dnodes = winner; 611fa9e4066Sahrens } 612fa9e4066Sahrens } 613fa9e4066Sahrens 614fa9e4066Sahrens if ((dn = children_dnodes[idx]) == NULL) { 6150e8c6158Smaybee dnode_phys_t *dnp = (dnode_phys_t *)db->db.db_data+idx; 616fa9e4066Sahrens dnode_t *winner; 6170e8c6158Smaybee 6180e8c6158Smaybee dn = dnode_create(os, dnp, db, object); 619fa9e4066Sahrens winner = atomic_cas_ptr(&children_dnodes[idx], NULL, dn); 620fa9e4066Sahrens if (winner != NULL) { 621fa9e4066Sahrens dnode_destroy(dn); 622fa9e4066Sahrens dn = winner; 623fa9e4066Sahrens } 624fa9e4066Sahrens } 625fa9e4066Sahrens 626fa9e4066Sahrens mutex_enter(&dn->dn_mtx); 627ea8dc4b6Seschrock type = dn->dn_type; 628fa9e4066Sahrens if (dn->dn_free_txg || 629ea8dc4b6Seschrock ((flag & DNODE_MUST_BE_ALLOCATED) && type == DMU_OT_NONE) || 630ea8dc4b6Seschrock ((flag & DNODE_MUST_BE_FREE) && type != DMU_OT_NONE)) { 631fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 632ea8dc4b6Seschrock dbuf_rele(db, FTAG); 633ea8dc4b6Seschrock return (type == DMU_OT_NONE ? ENOENT : EEXIST); 634fa9e4066Sahrens } 635fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 636fa9e4066Sahrens 637ea8dc4b6Seschrock if (refcount_add(&dn->dn_holds, tag) == 1) 638fa9e4066Sahrens dbuf_add_ref(db, dn); 639fa9e4066Sahrens 6409c9dc39aSek DNODE_VERIFY(dn); 641fa9e4066Sahrens ASSERT3P(dn->dn_dbuf, ==, db); 642fa9e4066Sahrens ASSERT3U(dn->dn_object, ==, object); 643ea8dc4b6Seschrock dbuf_rele(db, FTAG); 644fa9e4066Sahrens 645ea8dc4b6Seschrock *dnp = dn; 646ea8dc4b6Seschrock return (0); 647fa9e4066Sahrens } 648fa9e4066Sahrens 649fa9e4066Sahrens /* 650fa9e4066Sahrens * Return held dnode if the object is allocated, NULL if not. 651fa9e4066Sahrens */ 652ea8dc4b6Seschrock int 653ea8dc4b6Seschrock dnode_hold(objset_impl_t *os, uint64_t object, void *tag, dnode_t **dnp) 654fa9e4066Sahrens { 655ea8dc4b6Seschrock return (dnode_hold_impl(os, object, DNODE_MUST_BE_ALLOCATED, tag, dnp)); 656fa9e4066Sahrens } 657fa9e4066Sahrens 6581934e92fSmaybee /* 6591934e92fSmaybee * Can only add a reference if there is already at least one 6601934e92fSmaybee * reference on the dnode. Returns FALSE if unable to add a 6611934e92fSmaybee * new reference. 6621934e92fSmaybee */ 6631934e92fSmaybee boolean_t 664ea8dc4b6Seschrock dnode_add_ref(dnode_t *dn, void *tag) 665fa9e4066Sahrens { 6661934e92fSmaybee mutex_enter(&dn->dn_mtx); 6671934e92fSmaybee if (refcount_is_zero(&dn->dn_holds)) { 6681934e92fSmaybee mutex_exit(&dn->dn_mtx); 6691934e92fSmaybee return (FALSE); 6701934e92fSmaybee } 6711934e92fSmaybee VERIFY(1 < refcount_add(&dn->dn_holds, tag)); 6721934e92fSmaybee mutex_exit(&dn->dn_mtx); 6731934e92fSmaybee return (TRUE); 674fa9e4066Sahrens } 675fa9e4066Sahrens 676fa9e4066Sahrens void 677ea8dc4b6Seschrock dnode_rele(dnode_t *dn, void *tag) 678fa9e4066Sahrens { 679fa9e4066Sahrens uint64_t refs; 680fa9e4066Sahrens 6811934e92fSmaybee mutex_enter(&dn->dn_mtx); 682ea8dc4b6Seschrock refs = refcount_remove(&dn->dn_holds, tag); 6831934e92fSmaybee mutex_exit(&dn->dn_mtx); 684fa9e4066Sahrens /* NOTE: the DNODE_DNODE does not have a dn_dbuf */ 685fa9e4066Sahrens if (refs == 0 && dn->dn_dbuf) 686ea8dc4b6Seschrock dbuf_rele(dn->dn_dbuf, dn); 687fa9e4066Sahrens } 688fa9e4066Sahrens 689fa9e4066Sahrens void 690fa9e4066Sahrens dnode_setdirty(dnode_t *dn, dmu_tx_t *tx) 691fa9e4066Sahrens { 692fa9e4066Sahrens objset_impl_t *os = dn->dn_objset; 693fa9e4066Sahrens uint64_t txg = tx->tx_txg; 694fa9e4066Sahrens 695ea8dc4b6Seschrock if (dn->dn_object == DMU_META_DNODE_OBJECT) 696fa9e4066Sahrens return; 697fa9e4066Sahrens 6989c9dc39aSek DNODE_VERIFY(dn); 699fa9e4066Sahrens 700fa9e4066Sahrens #ifdef ZFS_DEBUG 701fa9e4066Sahrens mutex_enter(&dn->dn_mtx); 702fa9e4066Sahrens ASSERT(dn->dn_phys->dn_type || dn->dn_allocated_txg); 703fa9e4066Sahrens /* ASSERT(dn->dn_free_txg == 0 || dn->dn_free_txg >= txg); */ 704fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 705fa9e4066Sahrens #endif 706fa9e4066Sahrens 707fa9e4066Sahrens mutex_enter(&os->os_lock); 708fa9e4066Sahrens 709fa9e4066Sahrens /* 710fa9e4066Sahrens * If we are already marked dirty, we're done. 711fa9e4066Sahrens */ 712c543ec06Sahrens if (list_link_active(&dn->dn_dirty_link[txg & TXG_MASK])) { 713fa9e4066Sahrens mutex_exit(&os->os_lock); 714fa9e4066Sahrens return; 715fa9e4066Sahrens } 716fa9e4066Sahrens 717fa9e4066Sahrens ASSERT(!refcount_is_zero(&dn->dn_holds) || list_head(&dn->dn_dbufs)); 718fa9e4066Sahrens ASSERT(dn->dn_datablksz != 0); 7191934e92fSmaybee ASSERT3U(dn->dn_next_bonuslen[txg&TXG_MASK], ==, 0); 720f676ed34Sahrens ASSERT3U(dn->dn_next_blksz[txg&TXG_MASK], ==, 0); 721fa9e4066Sahrens 722fa9e4066Sahrens dprintf_ds(os->os_dsl_dataset, "obj=%llu txg=%llu\n", 723fa9e4066Sahrens dn->dn_object, txg); 724fa9e4066Sahrens 725fa9e4066Sahrens if (dn->dn_free_txg > 0 && dn->dn_free_txg <= txg) { 726fa9e4066Sahrens list_insert_tail(&os->os_free_dnodes[txg&TXG_MASK], dn); 727fa9e4066Sahrens } else { 728fa9e4066Sahrens list_insert_tail(&os->os_dirty_dnodes[txg&TXG_MASK], dn); 729fa9e4066Sahrens } 730fa9e4066Sahrens 731fa9e4066Sahrens mutex_exit(&os->os_lock); 732fa9e4066Sahrens 733fa9e4066Sahrens /* 734fa9e4066Sahrens * The dnode maintains a hold on its containing dbuf as 735fa9e4066Sahrens * long as there are holds on it. Each instantiated child 736fa9e4066Sahrens * dbuf maintaines a hold on the dnode. When the last child 737fa9e4066Sahrens * drops its hold, the dnode will drop its hold on the 738fa9e4066Sahrens * containing dbuf. We add a "dirty hold" here so that the 739fa9e4066Sahrens * dnode will hang around after we finish processing its 740fa9e4066Sahrens * children. 741fa9e4066Sahrens */ 7421934e92fSmaybee VERIFY(dnode_add_ref(dn, (void *)(uintptr_t)tx->tx_txg)); 743fa9e4066Sahrens 744c717a561Smaybee (void) dbuf_dirty(dn->dn_dbuf, tx); 745fa9e4066Sahrens 746fa9e4066Sahrens dsl_dataset_dirty(os->os_dsl_dataset, tx); 747fa9e4066Sahrens } 748fa9e4066Sahrens 749fa9e4066Sahrens void 750fa9e4066Sahrens dnode_free(dnode_t *dn, dmu_tx_t *tx) 751fa9e4066Sahrens { 752c543ec06Sahrens int txgoff = tx->tx_txg & TXG_MASK; 753c543ec06Sahrens 754fa9e4066Sahrens dprintf("dn=%p txg=%llu\n", dn, tx->tx_txg); 755fa9e4066Sahrens 756fa9e4066Sahrens /* we should be the only holder... hopefully */ 757fa9e4066Sahrens /* ASSERT3U(refcount_count(&dn->dn_holds), ==, 1); */ 758fa9e4066Sahrens 759fa9e4066Sahrens mutex_enter(&dn->dn_mtx); 760fa9e4066Sahrens if (dn->dn_type == DMU_OT_NONE || dn->dn_free_txg) { 761fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 762fa9e4066Sahrens return; 763fa9e4066Sahrens } 764fa9e4066Sahrens dn->dn_free_txg = tx->tx_txg; 765fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 766fa9e4066Sahrens 767fa9e4066Sahrens /* 768fa9e4066Sahrens * If the dnode is already dirty, it needs to be moved from 769fa9e4066Sahrens * the dirty list to the free list. 770fa9e4066Sahrens */ 771fa9e4066Sahrens mutex_enter(&dn->dn_objset->os_lock); 772c543ec06Sahrens if (list_link_active(&dn->dn_dirty_link[txgoff])) { 773c543ec06Sahrens list_remove(&dn->dn_objset->os_dirty_dnodes[txgoff], dn); 774c543ec06Sahrens list_insert_tail(&dn->dn_objset->os_free_dnodes[txgoff], dn); 775fa9e4066Sahrens mutex_exit(&dn->dn_objset->os_lock); 776fa9e4066Sahrens } else { 777fa9e4066Sahrens mutex_exit(&dn->dn_objset->os_lock); 778fa9e4066Sahrens dnode_setdirty(dn, tx); 779fa9e4066Sahrens } 780fa9e4066Sahrens } 781fa9e4066Sahrens 782fa9e4066Sahrens /* 783fa9e4066Sahrens * Try to change the block size for the indicated dnode. This can only 784fa9e4066Sahrens * succeed if there are no blocks allocated or dirty beyond first block 785fa9e4066Sahrens */ 786fa9e4066Sahrens int 787fa9e4066Sahrens dnode_set_blksz(dnode_t *dn, uint64_t size, int ibs, dmu_tx_t *tx) 788fa9e4066Sahrens { 789fa9e4066Sahrens dmu_buf_impl_t *db, *db_next; 790cdb0ab79Smaybee int err; 791fa9e4066Sahrens 792fa9e4066Sahrens if (size == 0) 793fa9e4066Sahrens size = SPA_MINBLOCKSIZE; 794fa9e4066Sahrens if (size > SPA_MAXBLOCKSIZE) 795fa9e4066Sahrens size = SPA_MAXBLOCKSIZE; 796fa9e4066Sahrens else 797fa9e4066Sahrens size = P2ROUNDUP(size, SPA_MINBLOCKSIZE); 798fa9e4066Sahrens 799b143e04bSahrens if (ibs == dn->dn_indblkshift) 800b143e04bSahrens ibs = 0; 801fa9e4066Sahrens 802b143e04bSahrens if (size >> SPA_MINBLOCKSHIFT == dn->dn_datablkszsec && ibs == 0) 803fa9e4066Sahrens return (0); 804fa9e4066Sahrens 805fa9e4066Sahrens rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 806fa9e4066Sahrens 807fa9e4066Sahrens /* Check for any allocated blocks beyond the first */ 808fa9e4066Sahrens if (dn->dn_phys->dn_maxblkid != 0) 809b143e04bSahrens goto fail; 810fa9e4066Sahrens 811fa9e4066Sahrens mutex_enter(&dn->dn_dbufs_mtx); 812fa9e4066Sahrens for (db = list_head(&dn->dn_dbufs); db; db = db_next) { 813fa9e4066Sahrens db_next = list_next(&dn->dn_dbufs, db); 814fa9e4066Sahrens 815cdb0ab79Smaybee if (db->db_blkid != 0 && db->db_blkid != DB_BONUS_BLKID) { 816fa9e4066Sahrens mutex_exit(&dn->dn_dbufs_mtx); 817b143e04bSahrens goto fail; 818fa9e4066Sahrens } 819fa9e4066Sahrens } 820fa9e4066Sahrens mutex_exit(&dn->dn_dbufs_mtx); 821fa9e4066Sahrens 822b143e04bSahrens if (ibs && dn->dn_nlevels != 1) 823b143e04bSahrens goto fail; 824b143e04bSahrens 825cdb0ab79Smaybee /* resize the old block */ 826cdb0ab79Smaybee err = dbuf_hold_impl(dn, 0, 0, TRUE, FTAG, &db); 827cdb0ab79Smaybee if (err == 0) 828c543ec06Sahrens dbuf_new_size(db, size, tx); 829cdb0ab79Smaybee else if (err != ENOENT) 830cdb0ab79Smaybee goto fail; 831fa9e4066Sahrens 832fa9e4066Sahrens dnode_setdblksz(dn, size); 833c543ec06Sahrens dnode_setdirty(dn, tx); 834c543ec06Sahrens dn->dn_next_blksz[tx->tx_txg&TXG_MASK] = size; 835b143e04bSahrens if (ibs) { 836b143e04bSahrens dn->dn_indblkshift = ibs; 837b143e04bSahrens dn->dn_next_indblkshift[tx->tx_txg&TXG_MASK] = ibs; 838b143e04bSahrens } 839cdb0ab79Smaybee /* rele after we have fixed the blocksize in the dnode */ 840c543ec06Sahrens if (db) 841c543ec06Sahrens dbuf_rele(db, FTAG); 842fa9e4066Sahrens 843fa9e4066Sahrens rw_exit(&dn->dn_struct_rwlock); 844b143e04bSahrens return (0); 845b143e04bSahrens 846b143e04bSahrens fail: 847b143e04bSahrens rw_exit(&dn->dn_struct_rwlock); 848b143e04bSahrens return (ENOTSUP); 849fa9e4066Sahrens } 850fa9e4066Sahrens 8518346f03fSJonathan W Adams /* read-holding callers must not rely on the lock being continuously held */ 852fa9e4066Sahrens void 8538346f03fSJonathan W Adams dnode_new_blkid(dnode_t *dn, uint64_t blkid, dmu_tx_t *tx, boolean_t have_read) 854fa9e4066Sahrens { 855fa9e4066Sahrens uint64_t txgoff = tx->tx_txg & TXG_MASK; 856c543ec06Sahrens int epbs, new_nlevels; 857fa9e4066Sahrens uint64_t sz; 858fa9e4066Sahrens 859c543ec06Sahrens ASSERT(blkid != DB_BONUS_BLKID); 860fa9e4066Sahrens 8618346f03fSJonathan W Adams ASSERT(have_read ? 8628346f03fSJonathan W Adams RW_READ_HELD(&dn->dn_struct_rwlock) : 8638346f03fSJonathan W Adams RW_WRITE_HELD(&dn->dn_struct_rwlock)); 8648346f03fSJonathan W Adams 8658346f03fSJonathan W Adams /* 8668346f03fSJonathan W Adams * if we have a read-lock, check to see if we need to do any work 8678346f03fSJonathan W Adams * before upgrading to a write-lock. 8688346f03fSJonathan W Adams */ 8698346f03fSJonathan W Adams if (have_read) { 8708346f03fSJonathan W Adams if (blkid <= dn->dn_maxblkid) 8718346f03fSJonathan W Adams return; 8728346f03fSJonathan W Adams 8738346f03fSJonathan W Adams if (!rw_tryupgrade(&dn->dn_struct_rwlock)) { 8748346f03fSJonathan W Adams rw_exit(&dn->dn_struct_rwlock); 8758346f03fSJonathan W Adams rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 8768346f03fSJonathan W Adams } 877fa9e4066Sahrens } 878fa9e4066Sahrens 879c543ec06Sahrens if (blkid <= dn->dn_maxblkid) 880c543ec06Sahrens goto out; 881c543ec06Sahrens 882c543ec06Sahrens dn->dn_maxblkid = blkid; 883fa9e4066Sahrens 884fa9e4066Sahrens /* 885c543ec06Sahrens * Compute the number of levels necessary to support the new maxblkid. 886fa9e4066Sahrens */ 887fa9e4066Sahrens new_nlevels = 1; 888fa9e4066Sahrens epbs = dn->dn_indblkshift - SPA_BLKPTRSHIFT; 889c543ec06Sahrens for (sz = dn->dn_nblkptr; 890c543ec06Sahrens sz <= blkid && sz >= dn->dn_nblkptr; sz <<= epbs) 891fa9e4066Sahrens new_nlevels++; 892fa9e4066Sahrens 893c543ec06Sahrens if (new_nlevels > dn->dn_nlevels) { 894c543ec06Sahrens int old_nlevels = dn->dn_nlevels; 895c543ec06Sahrens dmu_buf_impl_t *db; 896c717a561Smaybee list_t *list; 897c717a561Smaybee dbuf_dirty_record_t *new, *dr, *dr_next; 898fa9e4066Sahrens 899fa9e4066Sahrens dn->dn_nlevels = new_nlevels; 900fa9e4066Sahrens 901c543ec06Sahrens ASSERT3U(new_nlevels, >, dn->dn_next_nlevels[txgoff]); 902c543ec06Sahrens dn->dn_next_nlevels[txgoff] = new_nlevels; 903c543ec06Sahrens 904c717a561Smaybee /* dirty the left indirects */ 905c543ec06Sahrens db = dbuf_hold_level(dn, old_nlevels, 0, FTAG); 906c717a561Smaybee new = dbuf_dirty(db, tx); 907ea8dc4b6Seschrock dbuf_rele(db, FTAG); 908fa9e4066Sahrens 909c717a561Smaybee /* transfer the dirty records to the new indirect */ 910c717a561Smaybee mutex_enter(&dn->dn_mtx); 911c717a561Smaybee mutex_enter(&new->dt.di.dr_mtx); 912c717a561Smaybee list = &dn->dn_dirty_records[txgoff]; 913c717a561Smaybee for (dr = list_head(list); dr; dr = dr_next) { 914c717a561Smaybee dr_next = list_next(&dn->dn_dirty_records[txgoff], dr); 915c717a561Smaybee if (dr->dr_dbuf->db_level != new_nlevels-1 && 916c717a561Smaybee dr->dr_dbuf->db_blkid != DB_BONUS_BLKID) { 917c717a561Smaybee ASSERT(dr->dr_dbuf->db_level == old_nlevels-1); 918c717a561Smaybee list_remove(&dn->dn_dirty_records[txgoff], dr); 919c717a561Smaybee list_insert_tail(&new->dt.di.dr_children, dr); 920c717a561Smaybee dr->dr_parent = new; 921c717a561Smaybee } 922c717a561Smaybee } 923c717a561Smaybee mutex_exit(&new->dt.di.dr_mtx); 924c717a561Smaybee mutex_exit(&dn->dn_mtx); 925fa9e4066Sahrens } 926fa9e4066Sahrens 927fa9e4066Sahrens out: 9288346f03fSJonathan W Adams if (have_read) 9298346f03fSJonathan W Adams rw_downgrade(&dn->dn_struct_rwlock); 930fa9e4066Sahrens } 931fa9e4066Sahrens 932fa9e4066Sahrens void 933fa9e4066Sahrens dnode_clear_range(dnode_t *dn, uint64_t blkid, uint64_t nblks, dmu_tx_t *tx) 934fa9e4066Sahrens { 935fa9e4066Sahrens avl_tree_t *tree = &dn->dn_ranges[tx->tx_txg&TXG_MASK]; 936fa9e4066Sahrens avl_index_t where; 937fa9e4066Sahrens free_range_t *rp; 938fa9e4066Sahrens free_range_t rp_tofind; 939fa9e4066Sahrens uint64_t endblk = blkid + nblks; 940fa9e4066Sahrens 941fa9e4066Sahrens ASSERT(MUTEX_HELD(&dn->dn_mtx)); 942fa9e4066Sahrens ASSERT(nblks <= UINT64_MAX - blkid); /* no overflow */ 943fa9e4066Sahrens 944fa9e4066Sahrens dprintf_dnode(dn, "blkid=%llu nblks=%llu txg=%llu\n", 945fa9e4066Sahrens blkid, nblks, tx->tx_txg); 946fa9e4066Sahrens rp_tofind.fr_blkid = blkid; 947fa9e4066Sahrens rp = avl_find(tree, &rp_tofind, &where); 948fa9e4066Sahrens if (rp == NULL) 949fa9e4066Sahrens rp = avl_nearest(tree, where, AVL_BEFORE); 950fa9e4066Sahrens if (rp == NULL) 951fa9e4066Sahrens rp = avl_nearest(tree, where, AVL_AFTER); 952fa9e4066Sahrens 953fa9e4066Sahrens while (rp && (rp->fr_blkid <= blkid + nblks)) { 954fa9e4066Sahrens uint64_t fr_endblk = rp->fr_blkid + rp->fr_nblks; 955fa9e4066Sahrens free_range_t *nrp = AVL_NEXT(tree, rp); 956fa9e4066Sahrens 957fa9e4066Sahrens if (blkid <= rp->fr_blkid && endblk >= fr_endblk) { 958fa9e4066Sahrens /* clear this entire range */ 959fa9e4066Sahrens avl_remove(tree, rp); 960fa9e4066Sahrens kmem_free(rp, sizeof (free_range_t)); 961fa9e4066Sahrens } else if (blkid <= rp->fr_blkid && 962fa9e4066Sahrens endblk > rp->fr_blkid && endblk < fr_endblk) { 963fa9e4066Sahrens /* clear the beginning of this range */ 964fa9e4066Sahrens rp->fr_blkid = endblk; 965fa9e4066Sahrens rp->fr_nblks = fr_endblk - endblk; 966fa9e4066Sahrens } else if (blkid > rp->fr_blkid && blkid < fr_endblk && 967fa9e4066Sahrens endblk >= fr_endblk) { 968fa9e4066Sahrens /* clear the end of this range */ 969fa9e4066Sahrens rp->fr_nblks = blkid - rp->fr_blkid; 970fa9e4066Sahrens } else if (blkid > rp->fr_blkid && endblk < fr_endblk) { 971fa9e4066Sahrens /* clear a chunk out of this range */ 972fa9e4066Sahrens free_range_t *new_rp = 973fa9e4066Sahrens kmem_alloc(sizeof (free_range_t), KM_SLEEP); 974fa9e4066Sahrens 975fa9e4066Sahrens new_rp->fr_blkid = endblk; 976fa9e4066Sahrens new_rp->fr_nblks = fr_endblk - endblk; 977fa9e4066Sahrens avl_insert_here(tree, new_rp, rp, AVL_AFTER); 978fa9e4066Sahrens rp->fr_nblks = blkid - rp->fr_blkid; 979fa9e4066Sahrens } 980fa9e4066Sahrens /* there may be no overlap */ 981fa9e4066Sahrens rp = nrp; 982fa9e4066Sahrens } 983fa9e4066Sahrens } 984fa9e4066Sahrens 985fa9e4066Sahrens void 986fa9e4066Sahrens dnode_free_range(dnode_t *dn, uint64_t off, uint64_t len, dmu_tx_t *tx) 987fa9e4066Sahrens { 988fa9e4066Sahrens dmu_buf_impl_t *db; 989b143e04bSahrens uint64_t blkoff, blkid, nblks; 990cdb0ab79Smaybee int blksz, blkshift, head, tail; 991fa9e4066Sahrens int trunc = FALSE; 992cdb0ab79Smaybee int epbs; 993fa9e4066Sahrens 994fa9e4066Sahrens rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 995fa9e4066Sahrens blksz = dn->dn_datablksz; 996cdb0ab79Smaybee blkshift = dn->dn_datablkshift; 997cdb0ab79Smaybee epbs = dn->dn_indblkshift - SPA_BLKPTRSHIFT; 998fa9e4066Sahrens 999fa9e4066Sahrens if (len == -1ULL) { 1000fa9e4066Sahrens len = UINT64_MAX - off; 1001fa9e4066Sahrens trunc = TRUE; 1002fa9e4066Sahrens } 1003fa9e4066Sahrens 1004fa9e4066Sahrens /* 1005fa9e4066Sahrens * First, block align the region to free: 1006fa9e4066Sahrens */ 1007b143e04bSahrens if (ISP2(blksz)) { 1008b143e04bSahrens head = P2NPHASE(off, blksz); 1009b143e04bSahrens blkoff = P2PHASE(off, blksz); 1010cdb0ab79Smaybee if ((off >> blkshift) > dn->dn_maxblkid) 1011cdb0ab79Smaybee goto out; 1012b143e04bSahrens } else { 1013b143e04bSahrens ASSERT(dn->dn_maxblkid == 0); 1014b143e04bSahrens if (off == 0 && len >= blksz) { 1015cdb0ab79Smaybee /* Freeing the whole block; fast-track this request */ 1016cdb0ab79Smaybee blkid = 0; 1017cdb0ab79Smaybee nblks = 1; 1018cdb0ab79Smaybee goto done; 10191c8564a7SMark Maybee } else if (off >= blksz) { 1020cdb0ab79Smaybee /* Freeing past end-of-data */ 1021cdb0ab79Smaybee goto out; 1022fa9e4066Sahrens } else { 1023b143e04bSahrens /* Freeing part of the block. */ 1024fa9e4066Sahrens head = blksz - off; 1025fa9e4066Sahrens ASSERT3U(head, >, 0); 1026fa9e4066Sahrens } 1027b143e04bSahrens blkoff = off; 1028fa9e4066Sahrens } 1029fa9e4066Sahrens /* zero out any partial block data at the start of the range */ 1030fa9e4066Sahrens if (head) { 1031b143e04bSahrens ASSERT3U(blkoff + head, ==, blksz); 1032fa9e4066Sahrens if (len < head) 1033fa9e4066Sahrens head = len; 1034fa9e4066Sahrens if (dbuf_hold_impl(dn, 0, dbuf_whichblock(dn, off), TRUE, 1035fa9e4066Sahrens FTAG, &db) == 0) { 1036fa9e4066Sahrens caddr_t data; 1037fa9e4066Sahrens 1038fa9e4066Sahrens /* don't dirty if it isn't on disk and isn't dirty */ 1039c717a561Smaybee if (db->db_last_dirty || 1040fa9e4066Sahrens (db->db_blkptr && !BP_IS_HOLE(db->db_blkptr))) { 1041fa9e4066Sahrens rw_exit(&dn->dn_struct_rwlock); 1042fa9e4066Sahrens dbuf_will_dirty(db, tx); 1043fa9e4066Sahrens rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 1044fa9e4066Sahrens data = db->db.db_data; 1045b143e04bSahrens bzero(data + blkoff, head); 1046fa9e4066Sahrens } 1047ea8dc4b6Seschrock dbuf_rele(db, FTAG); 1048fa9e4066Sahrens } 1049fa9e4066Sahrens off += head; 1050fa9e4066Sahrens len -= head; 1051fa9e4066Sahrens } 1052fa9e4066Sahrens 1053b143e04bSahrens /* If the range was less than one block, we're done */ 1054cdb0ab79Smaybee if (len == 0) 1055fa9e4066Sahrens goto out; 1056fa9e4066Sahrens 1057cdb0ab79Smaybee /* If the remaining range is past end of file, we're done */ 1058cdb0ab79Smaybee if ((off >> blkshift) > dn->dn_maxblkid) 1059cdb0ab79Smaybee goto out; 1060b143e04bSahrens 10611c8564a7SMark Maybee ASSERT(ISP2(blksz)); 1062cdb0ab79Smaybee if (trunc) 1063cdb0ab79Smaybee tail = 0; 1064cdb0ab79Smaybee else 1065cdb0ab79Smaybee tail = P2PHASE(len, blksz); 1066cdb0ab79Smaybee 1067cdb0ab79Smaybee ASSERT3U(P2PHASE(off, blksz), ==, 0); 1068cdb0ab79Smaybee /* zero out any partial block data at the end of the range */ 1069cdb0ab79Smaybee if (tail) { 1070cdb0ab79Smaybee if (len < tail) 1071cdb0ab79Smaybee tail = len; 1072cdb0ab79Smaybee if (dbuf_hold_impl(dn, 0, dbuf_whichblock(dn, off+len), 1073cdb0ab79Smaybee TRUE, FTAG, &db) == 0) { 1074cdb0ab79Smaybee /* don't dirty if not on disk and not dirty */ 1075cdb0ab79Smaybee if (db->db_last_dirty || 1076cdb0ab79Smaybee (db->db_blkptr && !BP_IS_HOLE(db->db_blkptr))) { 1077cdb0ab79Smaybee rw_exit(&dn->dn_struct_rwlock); 1078cdb0ab79Smaybee dbuf_will_dirty(db, tx); 1079cdb0ab79Smaybee rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 1080cdb0ab79Smaybee bzero(db->db.db_data, tail); 1081fa9e4066Sahrens } 1082ea8dc4b6Seschrock dbuf_rele(db, FTAG); 1083fa9e4066Sahrens } 1084cdb0ab79Smaybee len -= tail; 1085cdb0ab79Smaybee } 1086fa9e4066Sahrens 1087cdb0ab79Smaybee /* If the range did not include a full block, we are done */ 1088cdb0ab79Smaybee if (len == 0) 1089cdb0ab79Smaybee goto out; 1090fa9e4066Sahrens 1091cdb0ab79Smaybee ASSERT(IS_P2ALIGNED(off, blksz)); 1092cdb0ab79Smaybee ASSERT(trunc || IS_P2ALIGNED(len, blksz)); 1093cdb0ab79Smaybee blkid = off >> blkshift; 1094cdb0ab79Smaybee nblks = len >> blkshift; 1095cdb0ab79Smaybee if (trunc) 1096cdb0ab79Smaybee nblks += 1; 1097cdb0ab79Smaybee 1098cdb0ab79Smaybee /* 1099cdb0ab79Smaybee * Read in and mark all the level-1 indirects dirty, 1100cdb0ab79Smaybee * so that they will stay in memory until syncing phase. 110156d55a53Smaybee * Always dirty the first and last indirect to make sure 110256d55a53Smaybee * we dirty all the partial indirects. 1103cdb0ab79Smaybee */ 1104cdb0ab79Smaybee if (dn->dn_nlevels > 1) { 1105cdb0ab79Smaybee uint64_t i, first, last; 1106cdb0ab79Smaybee int shift = epbs + dn->dn_datablkshift; 1107b143e04bSahrens 1108cdb0ab79Smaybee first = blkid >> epbs; 110956d55a53Smaybee if (db = dbuf_hold_level(dn, 1, first, FTAG)) { 111056d55a53Smaybee dbuf_will_dirty(db, tx); 111156d55a53Smaybee dbuf_rele(db, FTAG); 111256d55a53Smaybee } 1113b143e04bSahrens if (trunc) 1114cdb0ab79Smaybee last = dn->dn_maxblkid >> epbs; 1115cdb0ab79Smaybee else 1116cdb0ab79Smaybee last = (blkid + nblks - 1) >> epbs; 111756d55a53Smaybee if (last > first && (db = dbuf_hold_level(dn, 1, last, FTAG))) { 111856d55a53Smaybee dbuf_will_dirty(db, tx); 111956d55a53Smaybee dbuf_rele(db, FTAG); 112056d55a53Smaybee } 112156d55a53Smaybee for (i = first + 1; i < last; i++) { 1122cdb0ab79Smaybee uint64_t ibyte = i << shift; 1123cdb0ab79Smaybee int err; 1124cdb0ab79Smaybee 1125cdb0ab79Smaybee err = dnode_next_offset(dn, 1126cdb0ab79Smaybee DNODE_FIND_HAVELOCK, &ibyte, 1, 1, 0); 1127cdb0ab79Smaybee i = ibyte >> shift; 112856d55a53Smaybee if (err == ESRCH || i >= last) 1129cdb0ab79Smaybee break; 1130cdb0ab79Smaybee ASSERT(err == 0); 1131cdb0ab79Smaybee db = dbuf_hold_level(dn, 1, i, FTAG); 1132cdb0ab79Smaybee if (db) { 1133cdb0ab79Smaybee dbuf_will_dirty(db, tx); 1134cdb0ab79Smaybee dbuf_rele(db, FTAG); 1135cdb0ab79Smaybee } 1136cdb0ab79Smaybee } 1137fa9e4066Sahrens } 1138cdb0ab79Smaybee done: 1139cdb0ab79Smaybee /* 1140cdb0ab79Smaybee * Add this range to the dnode range list. 1141cdb0ab79Smaybee * We will finish up this free operation in the syncing phase. 1142cdb0ab79Smaybee */ 1143fa9e4066Sahrens mutex_enter(&dn->dn_mtx); 1144fa9e4066Sahrens dnode_clear_range(dn, blkid, nblks, tx); 1145fa9e4066Sahrens { 1146fa9e4066Sahrens free_range_t *rp, *found; 1147fa9e4066Sahrens avl_index_t where; 1148fa9e4066Sahrens avl_tree_t *tree = &dn->dn_ranges[tx->tx_txg&TXG_MASK]; 1149fa9e4066Sahrens 1150fa9e4066Sahrens /* Add new range to dn_ranges */ 1151fa9e4066Sahrens rp = kmem_alloc(sizeof (free_range_t), KM_SLEEP); 1152fa9e4066Sahrens rp->fr_blkid = blkid; 1153fa9e4066Sahrens rp->fr_nblks = nblks; 1154fa9e4066Sahrens found = avl_find(tree, rp, &where); 1155fa9e4066Sahrens ASSERT(found == NULL); 1156fa9e4066Sahrens avl_insert(tree, rp, where); 1157fa9e4066Sahrens dprintf_dnode(dn, "blkid=%llu nblks=%llu txg=%llu\n", 1158fa9e4066Sahrens blkid, nblks, tx->tx_txg); 1159fa9e4066Sahrens } 1160fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 1161fa9e4066Sahrens 1162cdb0ab79Smaybee dbuf_free_range(dn, blkid, blkid + nblks - 1, tx); 1163fa9e4066Sahrens dnode_setdirty(dn, tx); 1164fa9e4066Sahrens out: 1165cdb0ab79Smaybee if (trunc && dn->dn_maxblkid >= (off >> blkshift)) 1166cdb0ab79Smaybee dn->dn_maxblkid = (off >> blkshift ? (off >> blkshift) - 1 : 0); 1167cdb0ab79Smaybee 1168fa9e4066Sahrens rw_exit(&dn->dn_struct_rwlock); 1169fa9e4066Sahrens } 1170fa9e4066Sahrens 1171fa9e4066Sahrens /* return TRUE if this blkid was freed in a recent txg, or FALSE if it wasn't */ 1172fa9e4066Sahrens uint64_t 1173fa9e4066Sahrens dnode_block_freed(dnode_t *dn, uint64_t blkid) 1174fa9e4066Sahrens { 1175fa9e4066Sahrens free_range_t range_tofind; 1176fa9e4066Sahrens void *dp = spa_get_dsl(dn->dn_objset->os_spa); 1177fa9e4066Sahrens int i; 1178fa9e4066Sahrens 1179fa9e4066Sahrens if (blkid == DB_BONUS_BLKID) 1180fa9e4066Sahrens return (FALSE); 1181fa9e4066Sahrens 1182fa9e4066Sahrens /* 1183fa9e4066Sahrens * If we're in the process of opening the pool, dp will not be 1184fa9e4066Sahrens * set yet, but there shouldn't be anything dirty. 1185fa9e4066Sahrens */ 1186fa9e4066Sahrens if (dp == NULL) 1187fa9e4066Sahrens return (FALSE); 1188fa9e4066Sahrens 1189fa9e4066Sahrens if (dn->dn_free_txg) 1190fa9e4066Sahrens return (TRUE); 1191fa9e4066Sahrens 1192fa9e4066Sahrens /* 1193fa9e4066Sahrens * If dn_datablkshift is not set, then there's only a single 1194fa9e4066Sahrens * block, in which case there will never be a free range so it 1195fa9e4066Sahrens * won't matter. 1196fa9e4066Sahrens */ 1197fa9e4066Sahrens range_tofind.fr_blkid = blkid; 1198fa9e4066Sahrens mutex_enter(&dn->dn_mtx); 1199fa9e4066Sahrens for (i = 0; i < TXG_SIZE; i++) { 1200fa9e4066Sahrens free_range_t *range_found; 1201fa9e4066Sahrens avl_index_t idx; 1202fa9e4066Sahrens 1203fa9e4066Sahrens range_found = avl_find(&dn->dn_ranges[i], &range_tofind, &idx); 1204fa9e4066Sahrens if (range_found) { 1205fa9e4066Sahrens ASSERT(range_found->fr_nblks > 0); 1206fa9e4066Sahrens break; 1207fa9e4066Sahrens } 1208fa9e4066Sahrens range_found = avl_nearest(&dn->dn_ranges[i], idx, AVL_BEFORE); 1209fa9e4066Sahrens if (range_found && 1210fa9e4066Sahrens range_found->fr_blkid + range_found->fr_nblks > blkid) 1211fa9e4066Sahrens break; 1212fa9e4066Sahrens } 1213fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 1214fa9e4066Sahrens return (i < TXG_SIZE); 1215fa9e4066Sahrens } 1216fa9e4066Sahrens 1217fa9e4066Sahrens /* call from syncing context when we actually write/free space for this dnode */ 1218fa9e4066Sahrens void 121999653d4eSeschrock dnode_diduse_space(dnode_t *dn, int64_t delta) 1220fa9e4066Sahrens { 122199653d4eSeschrock uint64_t space; 122299653d4eSeschrock dprintf_dnode(dn, "dn=%p dnp=%p used=%llu delta=%lld\n", 1223fa9e4066Sahrens dn, dn->dn_phys, 122499653d4eSeschrock (u_longlong_t)dn->dn_phys->dn_used, 122599653d4eSeschrock (longlong_t)delta); 1226fa9e4066Sahrens 1227fa9e4066Sahrens mutex_enter(&dn->dn_mtx); 122899653d4eSeschrock space = DN_USED_BYTES(dn->dn_phys); 122999653d4eSeschrock if (delta > 0) { 123099653d4eSeschrock ASSERT3U(space + delta, >=, space); /* no overflow */ 123199653d4eSeschrock } else { 123299653d4eSeschrock ASSERT3U(space, >=, -delta); /* no underflow */ 123399653d4eSeschrock } 123499653d4eSeschrock space += delta; 1235e7437265Sahrens if (spa_version(dn->dn_objset->os_spa) < SPA_VERSION_DNODE_BYTES) { 123699653d4eSeschrock ASSERT((dn->dn_phys->dn_flags & DNODE_FLAG_USED_BYTES) == 0); 123799653d4eSeschrock ASSERT3U(P2PHASE(space, 1<<DEV_BSHIFT), ==, 0); 123899653d4eSeschrock dn->dn_phys->dn_used = space >> DEV_BSHIFT; 1239fa9e4066Sahrens } else { 124099653d4eSeschrock dn->dn_phys->dn_used = space; 124199653d4eSeschrock dn->dn_phys->dn_flags |= DNODE_FLAG_USED_BYTES; 1242fa9e4066Sahrens } 1243fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 1244fa9e4066Sahrens } 1245fa9e4066Sahrens 1246fa9e4066Sahrens /* 1247fa9e4066Sahrens * Call when we think we're going to write/free space in open context. 1248fa9e4066Sahrens * Be conservative (ie. OK to write less than this or free more than 1249fa9e4066Sahrens * this, but don't write more or free less). 1250fa9e4066Sahrens */ 1251fa9e4066Sahrens void 1252fa9e4066Sahrens dnode_willuse_space(dnode_t *dn, int64_t space, dmu_tx_t *tx) 1253fa9e4066Sahrens { 1254fa9e4066Sahrens objset_impl_t *os = dn->dn_objset; 1255fa9e4066Sahrens dsl_dataset_t *ds = os->os_dsl_dataset; 1256fa9e4066Sahrens 1257fa9e4066Sahrens if (space > 0) 1258fa9e4066Sahrens space = spa_get_asize(os->os_spa, space); 1259fa9e4066Sahrens 1260fa9e4066Sahrens if (ds) 1261fa9e4066Sahrens dsl_dir_willuse_space(ds->ds_dir, space, tx); 1262fa9e4066Sahrens 1263fa9e4066Sahrens dmu_tx_willuse_space(tx, space); 1264fa9e4066Sahrens } 1265fa9e4066Sahrens 1266fa9e4066Sahrens static int 1267cdb0ab79Smaybee dnode_next_offset_level(dnode_t *dn, int flags, uint64_t *offset, 12686754306eSahrens int lvl, uint64_t blkfill, uint64_t txg) 1269fa9e4066Sahrens { 1270fa9e4066Sahrens dmu_buf_impl_t *db = NULL; 1271fa9e4066Sahrens void *data = NULL; 1272fa9e4066Sahrens uint64_t epbs = dn->dn_phys->dn_indblkshift - SPA_BLKPTRSHIFT; 1273fa9e4066Sahrens uint64_t epb = 1ULL << epbs; 1274fa9e4066Sahrens uint64_t minfill, maxfill; 1275cdb0ab79Smaybee boolean_t hole; 1276cdb0ab79Smaybee int i, inc, error, span; 1277fa9e4066Sahrens 1278fa9e4066Sahrens dprintf("probing object %llu offset %llx level %d of %u\n", 1279fa9e4066Sahrens dn->dn_object, *offset, lvl, dn->dn_phys->dn_nlevels); 1280fa9e4066Sahrens 1281cdb0ab79Smaybee hole = flags & DNODE_FIND_HOLE; 1282cdb0ab79Smaybee inc = (flags & DNODE_FIND_BACKWARDS) ? -1 : 1; 12831c8564a7SMark Maybee ASSERT(txg == 0 || !hole); 1284cdb0ab79Smaybee 1285fa9e4066Sahrens if (lvl == dn->dn_phys->dn_nlevels) { 1286fa9e4066Sahrens error = 0; 1287fa9e4066Sahrens epb = dn->dn_phys->dn_nblkptr; 1288fa9e4066Sahrens data = dn->dn_phys->dn_blkptr; 1289fa9e4066Sahrens } else { 1290fa9e4066Sahrens uint64_t blkid = dbuf_whichblock(dn, *offset) >> (epbs * lvl); 1291fa9e4066Sahrens error = dbuf_hold_impl(dn, lvl, blkid, TRUE, FTAG, &db); 1292fa9e4066Sahrens if (error) { 12931c8564a7SMark Maybee if (error != ENOENT) 12941c8564a7SMark Maybee return (error); 12951c8564a7SMark Maybee if (hole) 12961c8564a7SMark Maybee return (0); 12971c8564a7SMark Maybee /* 12981c8564a7SMark Maybee * This can only happen when we are searching up 12991c8564a7SMark Maybee * the block tree for data. We don't really need to 13001c8564a7SMark Maybee * adjust the offset, as we will just end up looking 13011c8564a7SMark Maybee * at the pointer to this block in its parent, and its 13021c8564a7SMark Maybee * going to be unallocated, so we will skip over it. 13031c8564a7SMark Maybee */ 13041c8564a7SMark Maybee return (ESRCH); 1305fa9e4066Sahrens } 130698572ac1Sahrens error = dbuf_read(db, NULL, DB_RF_CANFAIL | DB_RF_HAVESTRUCT); 130798572ac1Sahrens if (error) { 130898572ac1Sahrens dbuf_rele(db, FTAG); 130998572ac1Sahrens return (error); 131098572ac1Sahrens } 1311fa9e4066Sahrens data = db->db.db_data; 1312fa9e4066Sahrens } 1313fa9e4066Sahrens 13146754306eSahrens if (db && txg && 13156754306eSahrens (db->db_blkptr == NULL || db->db_blkptr->blk_birth <= txg)) { 13161c8564a7SMark Maybee /* 13171c8564a7SMark Maybee * This can only happen when we are searching up the tree 13181c8564a7SMark Maybee * and these conditions mean that we need to keep climbing. 13191c8564a7SMark Maybee */ 13206754306eSahrens error = ESRCH; 13216754306eSahrens } else if (lvl == 0) { 1322fa9e4066Sahrens dnode_phys_t *dnp = data; 1323fa9e4066Sahrens span = DNODE_SHIFT; 1324fa9e4066Sahrens ASSERT(dn->dn_type == DMU_OT_DNODE); 1325fa9e4066Sahrens 1326cdb0ab79Smaybee for (i = (*offset >> span) & (blkfill - 1); 1327cdb0ab79Smaybee i >= 0 && i < blkfill; i += inc) { 13286754306eSahrens boolean_t newcontents = B_TRUE; 13296754306eSahrens if (txg) { 13306754306eSahrens int j; 13316754306eSahrens newcontents = B_FALSE; 13326754306eSahrens for (j = 0; j < dnp[i].dn_nblkptr; j++) { 13336754306eSahrens if (dnp[i].dn_blkptr[j].blk_birth > txg) 13346754306eSahrens newcontents = B_TRUE; 13356754306eSahrens } 13366754306eSahrens } 13376754306eSahrens if (!dnp[i].dn_type == hole && newcontents) 1338fa9e4066Sahrens break; 1339cdb0ab79Smaybee *offset += (1ULL << span) * inc; 1340fa9e4066Sahrens } 1341cdb0ab79Smaybee if (i < 0 || i == blkfill) 1342fa9e4066Sahrens error = ESRCH; 1343fa9e4066Sahrens } else { 1344fa9e4066Sahrens blkptr_t *bp = data; 1345fa9e4066Sahrens span = (lvl - 1) * epbs + dn->dn_datablkshift; 1346fa9e4066Sahrens minfill = 0; 1347fa9e4066Sahrens maxfill = blkfill << ((lvl - 1) * epbs); 1348fa9e4066Sahrens 1349fa9e4066Sahrens if (hole) 1350fa9e4066Sahrens maxfill--; 1351fa9e4066Sahrens else 1352fa9e4066Sahrens minfill++; 1353fa9e4066Sahrens 1354fa9e4066Sahrens for (i = (*offset >> span) & ((1ULL << epbs) - 1); 1355cdb0ab79Smaybee i >= 0 && i < epb; i += inc) { 1356fa9e4066Sahrens if (bp[i].blk_fill >= minfill && 13576754306eSahrens bp[i].blk_fill <= maxfill && 13581c8564a7SMark Maybee (hole || bp[i].blk_birth > txg)) 1359fa9e4066Sahrens break; 13601c8564a7SMark Maybee if (inc < 0 && *offset < (1ULL << span)) 13611c8564a7SMark Maybee *offset = 0; 13621c8564a7SMark Maybee else 13631c8564a7SMark Maybee *offset += (1ULL << span) * inc; 1364fa9e4066Sahrens } 1365cdb0ab79Smaybee if (i < 0 || i == epb) 1366fa9e4066Sahrens error = ESRCH; 1367fa9e4066Sahrens } 1368fa9e4066Sahrens 1369fa9e4066Sahrens if (db) 1370ea8dc4b6Seschrock dbuf_rele(db, FTAG); 1371fa9e4066Sahrens 1372fa9e4066Sahrens return (error); 1373fa9e4066Sahrens } 1374fa9e4066Sahrens 1375fa9e4066Sahrens /* 1376fa9e4066Sahrens * Find the next hole, data, or sparse region at or after *offset. 1377fa9e4066Sahrens * The value 'blkfill' tells us how many items we expect to find 1378fa9e4066Sahrens * in an L0 data block; this value is 1 for normal objects, 1379fa9e4066Sahrens * DNODES_PER_BLOCK for the meta dnode, and some fraction of 1380fa9e4066Sahrens * DNODES_PER_BLOCK when searching for sparse regions thereof. 13816754306eSahrens * 1382fa9e4066Sahrens * Examples: 1383fa9e4066Sahrens * 1384cdb0ab79Smaybee * dnode_next_offset(dn, flags, offset, 1, 1, 0); 1385cdb0ab79Smaybee * Finds the next/previous hole/data in a file. 1386fa9e4066Sahrens * Used in dmu_offset_next(). 1387fa9e4066Sahrens * 1388cdb0ab79Smaybee * dnode_next_offset(mdn, flags, offset, 0, DNODES_PER_BLOCK, txg); 1389fa9e4066Sahrens * Finds the next free/allocated dnode an objset's meta-dnode. 13906754306eSahrens * Only finds objects that have new contents since txg (ie. 13916754306eSahrens * bonus buffer changes and content removal are ignored). 1392fa9e4066Sahrens * Used in dmu_object_next(). 1393fa9e4066Sahrens * 1394cdb0ab79Smaybee * dnode_next_offset(mdn, DNODE_FIND_HOLE, offset, 2, DNODES_PER_BLOCK >> 2, 0); 1395fa9e4066Sahrens * Finds the next L2 meta-dnode bp that's at most 1/4 full. 1396fa9e4066Sahrens * Used in dmu_object_alloc(). 1397fa9e4066Sahrens */ 1398fa9e4066Sahrens int 1399cdb0ab79Smaybee dnode_next_offset(dnode_t *dn, int flags, uint64_t *offset, 14006754306eSahrens int minlvl, uint64_t blkfill, uint64_t txg) 1401fa9e4066Sahrens { 1402cdb0ab79Smaybee uint64_t initial_offset = *offset; 1403fa9e4066Sahrens int lvl, maxlvl; 1404fa9e4066Sahrens int error = 0; 1405fa9e4066Sahrens 1406cdb0ab79Smaybee if (!(flags & DNODE_FIND_HAVELOCK)) 1407cdb0ab79Smaybee rw_enter(&dn->dn_struct_rwlock, RW_READER); 1408fa9e4066Sahrens 1409fa9e4066Sahrens if (dn->dn_phys->dn_nlevels == 0) { 1410cdb0ab79Smaybee error = ESRCH; 1411cdb0ab79Smaybee goto out; 1412fa9e4066Sahrens } 1413fa9e4066Sahrens 1414fa9e4066Sahrens if (dn->dn_datablkshift == 0) { 1415fa9e4066Sahrens if (*offset < dn->dn_datablksz) { 1416cdb0ab79Smaybee if (flags & DNODE_FIND_HOLE) 1417fa9e4066Sahrens *offset = dn->dn_datablksz; 1418fa9e4066Sahrens } else { 1419fa9e4066Sahrens error = ESRCH; 1420fa9e4066Sahrens } 1421cdb0ab79Smaybee goto out; 1422fa9e4066Sahrens } 1423fa9e4066Sahrens 1424fa9e4066Sahrens maxlvl = dn->dn_phys->dn_nlevels; 1425fa9e4066Sahrens 1426fa9e4066Sahrens for (lvl = minlvl; lvl <= maxlvl; lvl++) { 14276754306eSahrens error = dnode_next_offset_level(dn, 1428cdb0ab79Smaybee flags, offset, lvl, blkfill, txg); 142998572ac1Sahrens if (error != ESRCH) 1430fa9e4066Sahrens break; 1431fa9e4066Sahrens } 1432fa9e4066Sahrens 1433cdb0ab79Smaybee while (error == 0 && --lvl >= minlvl) { 14346754306eSahrens error = dnode_next_offset_level(dn, 1435cdb0ab79Smaybee flags, offset, lvl, blkfill, txg); 14366754306eSahrens } 1437fa9e4066Sahrens 1438cdb0ab79Smaybee if (error == 0 && (flags & DNODE_FIND_BACKWARDS ? 1439cdb0ab79Smaybee initial_offset < *offset : initial_offset > *offset)) 144098572ac1Sahrens error = ESRCH; 1441cdb0ab79Smaybee out: 1442cdb0ab79Smaybee if (!(flags & DNODE_FIND_HAVELOCK)) 1443cdb0ab79Smaybee rw_exit(&dn->dn_struct_rwlock); 1444fa9e4066Sahrens 1445fa9e4066Sahrens return (error); 1446fa9e4066Sahrens } 1447