1fa9e4066Sahrens /* 2fa9e4066Sahrens * CDDL HEADER START 3fa9e4066Sahrens * 4fa9e4066Sahrens * The contents of this file are subject to the terms of the 5fa9e4066Sahrens * Common Development and Distribution License, Version 1.0 only 6fa9e4066Sahrens * (the "License"). You may not use this file except in compliance 7fa9e4066Sahrens * with the License. 8fa9e4066Sahrens * 9fa9e4066Sahrens * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE 10fa9e4066Sahrens * or http://www.opensolaris.org/os/licensing. 11fa9e4066Sahrens * See the License for the specific language governing permissions 12fa9e4066Sahrens * and limitations under the License. 13fa9e4066Sahrens * 14fa9e4066Sahrens * When distributing Covered Code, include this CDDL HEADER in each 15fa9e4066Sahrens * file and include the License file at usr/src/OPENSOLARIS.LICENSE. 16fa9e4066Sahrens * If applicable, add the following below this CDDL HEADER, with the 17fa9e4066Sahrens * fields enclosed by brackets "[]" replaced with your own identifying 18fa9e4066Sahrens * information: Portions Copyright [yyyy] [name of copyright owner] 19fa9e4066Sahrens * 20fa9e4066Sahrens * CDDL HEADER END 21fa9e4066Sahrens */ 22fa9e4066Sahrens /* 23fa9e4066Sahrens * Copyright 2005 Sun Microsystems, Inc. All rights reserved. 24fa9e4066Sahrens * Use is subject to license terms. 25fa9e4066Sahrens */ 26fa9e4066Sahrens 27fa9e4066Sahrens #pragma ident "%Z%%M% %I% %E% SMI" 28fa9e4066Sahrens 29fa9e4066Sahrens #include <sys/zfs_context.h> 30fa9e4066Sahrens #include <sys/dbuf.h> 31fa9e4066Sahrens #include <sys/dnode.h> 32fa9e4066Sahrens #include <sys/dmu.h> 33fa9e4066Sahrens #include <sys/dmu_impl.h> 34fa9e4066Sahrens #include <sys/dmu_tx.h> 35fa9e4066Sahrens #include <sys/dmu_objset.h> 36fa9e4066Sahrens #include <sys/dsl_dir.h> 37fa9e4066Sahrens #include <sys/dsl_dataset.h> 38fa9e4066Sahrens #include <sys/spa.h> 39fa9e4066Sahrens #include <sys/zio.h> 40fa9e4066Sahrens #include <sys/dmu_zfetch.h> 41fa9e4066Sahrens 42fa9e4066Sahrens static int free_range_compar(const void *node1, const void *node2); 43fa9e4066Sahrens 44fa9e4066Sahrens static kmem_cache_t *dnode_cache; 45fa9e4066Sahrens 46fa9e4066Sahrens static dnode_phys_t dnode_phys_zero; 47fa9e4066Sahrens 48fa9e4066Sahrens int zfs_default_bs = SPA_MINBLOCKSHIFT; 49fa9e4066Sahrens int zfs_default_ibs = DN_MAX_INDBLKSHIFT; 50fa9e4066Sahrens 51fa9e4066Sahrens /* ARGSUSED */ 52fa9e4066Sahrens static int 53fa9e4066Sahrens dnode_cons(void *arg, void *unused, int kmflag) 54fa9e4066Sahrens { 55fa9e4066Sahrens int i; 56fa9e4066Sahrens dnode_t *dn = arg; 57fa9e4066Sahrens bzero(dn, sizeof (dnode_t)); 58fa9e4066Sahrens 59fa9e4066Sahrens rw_init(&dn->dn_struct_rwlock, NULL, RW_DEFAULT, NULL); 60fa9e4066Sahrens mutex_init(&dn->dn_mtx, NULL, MUTEX_DEFAULT, NULL); 61fa9e4066Sahrens mutex_init(&dn->dn_dbufs_mtx, NULL, MUTEX_DEFAULT, NULL); 62fa9e4066Sahrens refcount_create(&dn->dn_holds); 63fa9e4066Sahrens refcount_create(&dn->dn_tx_holds); 64fa9e4066Sahrens 65fa9e4066Sahrens for (i = 0; i < TXG_SIZE; i++) { 66fa9e4066Sahrens avl_create(&dn->dn_ranges[i], free_range_compar, 67fa9e4066Sahrens sizeof (free_range_t), 68fa9e4066Sahrens offsetof(struct free_range, fr_node)); 69fa9e4066Sahrens list_create(&dn->dn_dirty_dbufs[i], 70fa9e4066Sahrens sizeof (dmu_buf_impl_t), 71fa9e4066Sahrens offsetof(dmu_buf_impl_t, db_dirty_node[i])); 72fa9e4066Sahrens } 73fa9e4066Sahrens 74fa9e4066Sahrens list_create(&dn->dn_dbufs, sizeof (dmu_buf_impl_t), 75fa9e4066Sahrens offsetof(dmu_buf_impl_t, db_link)); 76fa9e4066Sahrens 77fa9e4066Sahrens return (0); 78fa9e4066Sahrens } 79fa9e4066Sahrens 80fa9e4066Sahrens /* ARGSUSED */ 81fa9e4066Sahrens static void 82fa9e4066Sahrens dnode_dest(void *arg, void *unused) 83fa9e4066Sahrens { 84fa9e4066Sahrens int i; 85fa9e4066Sahrens dnode_t *dn = arg; 86fa9e4066Sahrens 87fa9e4066Sahrens rw_destroy(&dn->dn_struct_rwlock); 88fa9e4066Sahrens mutex_destroy(&dn->dn_mtx); 89fa9e4066Sahrens mutex_destroy(&dn->dn_dbufs_mtx); 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]); 95fa9e4066Sahrens list_destroy(&dn->dn_dirty_dbufs[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 116*9c9dc39aSek #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); 159fa9e4066Sahrens ASSERT(IS_DNODE_DNODE(dn->dn_object) || dn->dn_dbuf); 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 } 168*9c9dc39aSek #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_type = BSWAP_8(dnp->dn_type); 182fa9e4066Sahrens dnp->dn_indblkshift = BSWAP_8(dnp->dn_indblkshift); 183fa9e4066Sahrens dnp->dn_nlevels = BSWAP_8(dnp->dn_nlevels); 184fa9e4066Sahrens dnp->dn_nblkptr = BSWAP_8(dnp->dn_nblkptr); 185fa9e4066Sahrens dnp->dn_bonustype = BSWAP_8(dnp->dn_bonustype); 186fa9e4066Sahrens dnp->dn_checksum = BSWAP_8(dnp->dn_checksum); 187fa9e4066Sahrens dnp->dn_compress = BSWAP_8(dnp->dn_compress); 188fa9e4066Sahrens dnp->dn_datablkszsec = BSWAP_16(dnp->dn_datablkszsec); 189fa9e4066Sahrens dnp->dn_bonuslen = BSWAP_16(dnp->dn_bonuslen); 190fa9e4066Sahrens dnp->dn_maxblkid = BSWAP_64(dnp->dn_maxblkid); 191fa9e4066Sahrens dnp->dn_secphys = BSWAP_64(dnp->dn_secphys); 192fa9e4066Sahrens 193fa9e4066Sahrens /* 194fa9e4066Sahrens * dn_nblkptr is only one byte, so it's OK to read it in either 195fa9e4066Sahrens * byte order. We can't read dn_bouslen. 196fa9e4066Sahrens */ 197fa9e4066Sahrens ASSERT(dnp->dn_indblkshift <= SPA_MAXBLOCKSHIFT); 198fa9e4066Sahrens ASSERT(dnp->dn_nblkptr <= DN_MAX_NBLKPTR); 199fa9e4066Sahrens for (i = 0; i < dnp->dn_nblkptr * sizeof (blkptr_t)/8; i++) 200fa9e4066Sahrens buf64[i] = BSWAP_64(buf64[i]); 201fa9e4066Sahrens 202fa9e4066Sahrens /* 203fa9e4066Sahrens * OK to check dn_bonuslen for zero, because it won't matter if 204fa9e4066Sahrens * we have the wrong byte order. This is necessary because the 205fa9e4066Sahrens * dnode dnode is smaller than a regular dnode. 206fa9e4066Sahrens */ 207fa9e4066Sahrens if (dnp->dn_bonuslen != 0) { 208fa9e4066Sahrens /* 209fa9e4066Sahrens * Note that the bonus length calculated here may be 210fa9e4066Sahrens * longer than the actual bonus buffer. This is because 211fa9e4066Sahrens * we always put the bonus buffer after the last block 212fa9e4066Sahrens * pointer (instead of packing it against the end of the 213fa9e4066Sahrens * dnode buffer). 214fa9e4066Sahrens */ 215fa9e4066Sahrens int off = (dnp->dn_nblkptr-1) * sizeof (blkptr_t); 216fa9e4066Sahrens size_t len = DN_MAX_BONUSLEN - off; 217fa9e4066Sahrens dmu_ot[dnp->dn_bonustype].ot_byteswap(dnp->dn_bonus + off, len); 218fa9e4066Sahrens } 219fa9e4066Sahrens } 220fa9e4066Sahrens 221fa9e4066Sahrens void 222fa9e4066Sahrens dnode_buf_byteswap(void *vbuf, size_t size) 223fa9e4066Sahrens { 224fa9e4066Sahrens dnode_phys_t *buf = vbuf; 225fa9e4066Sahrens int i; 226fa9e4066Sahrens 227fa9e4066Sahrens ASSERT3U(sizeof (dnode_phys_t), ==, (1<<DNODE_SHIFT)); 228fa9e4066Sahrens ASSERT((size & (sizeof (dnode_phys_t)-1)) == 0); 229fa9e4066Sahrens 230fa9e4066Sahrens size >>= DNODE_SHIFT; 231fa9e4066Sahrens for (i = 0; i < size; i++) { 232fa9e4066Sahrens dnode_byteswap(buf); 233fa9e4066Sahrens buf++; 234fa9e4066Sahrens } 235fa9e4066Sahrens } 236fa9e4066Sahrens 237fa9e4066Sahrens static int 238fa9e4066Sahrens free_range_compar(const void *node1, const void *node2) 239fa9e4066Sahrens { 240fa9e4066Sahrens const free_range_t *rp1 = node1; 241fa9e4066Sahrens const free_range_t *rp2 = node2; 242fa9e4066Sahrens 243fa9e4066Sahrens if (rp1->fr_blkid < rp2->fr_blkid) 244fa9e4066Sahrens return (-1); 245fa9e4066Sahrens else if (rp1->fr_blkid > rp2->fr_blkid) 246fa9e4066Sahrens return (1); 247fa9e4066Sahrens else return (0); 248fa9e4066Sahrens } 249fa9e4066Sahrens 250fa9e4066Sahrens static void 251fa9e4066Sahrens dnode_setdblksz(dnode_t *dn, int size) 252fa9e4066Sahrens { 253fa9e4066Sahrens ASSERT3U(P2PHASE(size, SPA_MINBLOCKSIZE), ==, 0); 254fa9e4066Sahrens ASSERT3U(size, <=, SPA_MAXBLOCKSIZE); 255fa9e4066Sahrens ASSERT3U(size, >=, SPA_MINBLOCKSIZE); 256fa9e4066Sahrens ASSERT3U(size >> SPA_MINBLOCKSHIFT, <, 257fa9e4066Sahrens 1<<(sizeof (dn->dn_phys->dn_datablkszsec) * 8)); 258fa9e4066Sahrens dn->dn_datablksz = size; 259fa9e4066Sahrens dn->dn_datablkszsec = size >> SPA_MINBLOCKSHIFT; 260fa9e4066Sahrens dn->dn_datablkshift = ISP2(size) ? highbit(size - 1) : 0; 261fa9e4066Sahrens } 262fa9e4066Sahrens 263fa9e4066Sahrens static dnode_t * 264fa9e4066Sahrens dnode_create(objset_impl_t *os, dnode_phys_t *dnp, dmu_buf_impl_t *db, 265fa9e4066Sahrens uint64_t object) 266fa9e4066Sahrens { 267fa9e4066Sahrens dnode_t *dn = kmem_cache_alloc(dnode_cache, KM_SLEEP); 268fa9e4066Sahrens (void) dnode_cons(dn, NULL, 0); /* XXX */ 269fa9e4066Sahrens 270fa9e4066Sahrens dn->dn_objset = os; 271fa9e4066Sahrens dn->dn_object = object; 272fa9e4066Sahrens dn->dn_dbuf = db; 273fa9e4066Sahrens dn->dn_phys = dnp; 274fa9e4066Sahrens 275fa9e4066Sahrens if (dnp->dn_datablkszsec) 276fa9e4066Sahrens dnode_setdblksz(dn, dnp->dn_datablkszsec << SPA_MINBLOCKSHIFT); 277fa9e4066Sahrens dn->dn_indblkshift = dnp->dn_indblkshift; 278fa9e4066Sahrens dn->dn_nlevels = dnp->dn_nlevels; 279fa9e4066Sahrens dn->dn_type = dnp->dn_type; 280fa9e4066Sahrens dn->dn_nblkptr = dnp->dn_nblkptr; 281fa9e4066Sahrens dn->dn_checksum = dnp->dn_checksum; 282fa9e4066Sahrens dn->dn_compress = dnp->dn_compress; 283fa9e4066Sahrens dn->dn_bonustype = dnp->dn_bonustype; 284fa9e4066Sahrens dn->dn_bonuslen = dnp->dn_bonuslen; 285fa9e4066Sahrens dn->dn_maxblkid = dnp->dn_maxblkid; 286fa9e4066Sahrens 287fa9e4066Sahrens dmu_zfetch_init(&dn->dn_zfetch, dn); 288fa9e4066Sahrens 289fa9e4066Sahrens ASSERT(dn->dn_phys->dn_type < DMU_OT_NUMTYPES); 290fa9e4066Sahrens mutex_enter(&os->os_lock); 291fa9e4066Sahrens list_insert_head(&os->os_dnodes, dn); 292fa9e4066Sahrens mutex_exit(&os->os_lock); 293fa9e4066Sahrens 294fa9e4066Sahrens return (dn); 295fa9e4066Sahrens } 296fa9e4066Sahrens 297fa9e4066Sahrens static void 298fa9e4066Sahrens dnode_destroy(dnode_t *dn) 299fa9e4066Sahrens { 300fa9e4066Sahrens objset_impl_t *os = dn->dn_objset; 301fa9e4066Sahrens 302fa9e4066Sahrens mutex_enter(&os->os_lock); 303fa9e4066Sahrens list_remove(&os->os_dnodes, dn); 304fa9e4066Sahrens mutex_exit(&os->os_lock); 305fa9e4066Sahrens 306fa9e4066Sahrens if (dn->dn_dirtyctx_firstset) { 307fa9e4066Sahrens kmem_free(dn->dn_dirtyctx_firstset, 1); 308fa9e4066Sahrens dn->dn_dirtyctx_firstset = NULL; 309fa9e4066Sahrens } 310fa9e4066Sahrens dmu_zfetch_rele(&dn->dn_zfetch); 311fa9e4066Sahrens kmem_cache_free(dnode_cache, dn); 312fa9e4066Sahrens } 313fa9e4066Sahrens 314fa9e4066Sahrens void 315fa9e4066Sahrens dnode_allocate(dnode_t *dn, dmu_object_type_t ot, int blocksize, int ibs, 316fa9e4066Sahrens dmu_object_type_t bonustype, int bonuslen, dmu_tx_t *tx) 317fa9e4066Sahrens { 318fa9e4066Sahrens int i; 319fa9e4066Sahrens 320fa9e4066Sahrens if (blocksize == 0) 321fa9e4066Sahrens blocksize = 1 << zfs_default_bs; 322fa9e4066Sahrens 323fa9e4066Sahrens blocksize = MIN(MAX(blocksize, SPA_MINBLOCKSIZE), SPA_MAXBLOCKSIZE); 324fa9e4066Sahrens 325fa9e4066Sahrens if (ibs == 0) 326fa9e4066Sahrens ibs = zfs_default_ibs; 327fa9e4066Sahrens 328fa9e4066Sahrens ibs = MIN(MAX(ibs, DN_MIN_INDBLKSHIFT), DN_MAX_INDBLKSHIFT); 329fa9e4066Sahrens 330fa9e4066Sahrens dprintf("os=%p obj=%llu txg=%llu blocksize=%d ibs=%d\n", dn->dn_objset, 331fa9e4066Sahrens dn->dn_object, tx->tx_txg, blocksize, ibs); 332fa9e4066Sahrens 333fa9e4066Sahrens ASSERT(dn->dn_type == DMU_OT_NONE); 334fa9e4066Sahrens ASSERT(bcmp(dn->dn_phys, &dnode_phys_zero, sizeof (dnode_phys_t)) == 0); 335fa9e4066Sahrens ASSERT(dn->dn_phys->dn_type == DMU_OT_NONE); 336fa9e4066Sahrens ASSERT(ot != DMU_OT_NONE); 337fa9e4066Sahrens ASSERT3U(ot, <, DMU_OT_NUMTYPES); 338fa9e4066Sahrens ASSERT((bonustype == DMU_OT_NONE && bonuslen == 0) || 339fa9e4066Sahrens (bonustype != DMU_OT_NONE && bonuslen != 0)); 340fa9e4066Sahrens ASSERT3U(bonustype, <, DMU_OT_NUMTYPES); 341fa9e4066Sahrens ASSERT3U(bonuslen, <=, DN_MAX_BONUSLEN); 342fa9e4066Sahrens ASSERT(dn->dn_type == DMU_OT_NONE); 343fa9e4066Sahrens ASSERT3U(dn->dn_maxblkid, ==, 0); 344fa9e4066Sahrens ASSERT3U(dn->dn_allocated_txg, ==, 0); 345fa9e4066Sahrens ASSERT3U(dn->dn_assigned_txg, ==, 0); 346fa9e4066Sahrens ASSERT(refcount_is_zero(&dn->dn_tx_holds)); 347fa9e4066Sahrens ASSERT3U(refcount_count(&dn->dn_holds), <=, 1); 348fa9e4066Sahrens ASSERT3P(list_head(&dn->dn_dbufs), ==, NULL); 349fa9e4066Sahrens 350fa9e4066Sahrens for (i = 0; i < TXG_SIZE; i++) { 351fa9e4066Sahrens ASSERT3U(dn->dn_next_nlevels[i], ==, 0); 352fa9e4066Sahrens ASSERT3U(dn->dn_next_indblkshift[i], ==, 0); 353fa9e4066Sahrens ASSERT3U(dn->dn_dirtyblksz[i], ==, 0); 354fa9e4066Sahrens ASSERT3P(list_head(&dn->dn_dirty_dbufs[i]), ==, NULL); 355fa9e4066Sahrens ASSERT3U(avl_numnodes(&dn->dn_ranges[i]), ==, 0); 356fa9e4066Sahrens } 357fa9e4066Sahrens 358fa9e4066Sahrens dn->dn_type = ot; 359fa9e4066Sahrens dnode_setdblksz(dn, blocksize); 360fa9e4066Sahrens dn->dn_indblkshift = ibs; 361fa9e4066Sahrens dn->dn_nlevels = 1; 362fa9e4066Sahrens dn->dn_nblkptr = 1 + ((DN_MAX_BONUSLEN - bonuslen) >> SPA_BLKPTRSHIFT); 363fa9e4066Sahrens dn->dn_bonustype = bonustype; 364fa9e4066Sahrens dn->dn_bonuslen = bonuslen; 365fa9e4066Sahrens dn->dn_checksum = ZIO_CHECKSUM_INHERIT; 366fa9e4066Sahrens dn->dn_compress = ZIO_COMPRESS_INHERIT; 367fa9e4066Sahrens dn->dn_dirtyctx = 0; 368fa9e4066Sahrens 369fa9e4066Sahrens dn->dn_free_txg = 0; 370fa9e4066Sahrens if (dn->dn_dirtyctx_firstset) { 371fa9e4066Sahrens kmem_free(dn->dn_dirtyctx_firstset, 1); 372fa9e4066Sahrens dn->dn_dirtyctx_firstset = NULL; 373fa9e4066Sahrens } 374fa9e4066Sahrens 375fa9e4066Sahrens dn->dn_allocated_txg = tx->tx_txg; 376fa9e4066Sahrens dnode_setdirty(dn, tx); 377fa9e4066Sahrens } 378fa9e4066Sahrens 379fa9e4066Sahrens void 380fa9e4066Sahrens dnode_reallocate(dnode_t *dn, dmu_object_type_t ot, int blocksize, 381fa9e4066Sahrens dmu_object_type_t bonustype, int bonuslen, dmu_tx_t *tx) 382fa9e4066Sahrens { 383fa9e4066Sahrens dmu_buf_impl_t *db = NULL; 384fa9e4066Sahrens 385fa9e4066Sahrens ASSERT3U(blocksize, >=, SPA_MINBLOCKSIZE); 386fa9e4066Sahrens ASSERT3U(blocksize, <=, SPA_MAXBLOCKSIZE); 387fa9e4066Sahrens ASSERT3U(blocksize % SPA_MINBLOCKSIZE, ==, 0); 388fa9e4066Sahrens ASSERT3P(list_head(&dn->dn_dbufs), ==, NULL); 389fa9e4066Sahrens ASSERT(!(dn->dn_object & DMU_PRIVATE_OBJECT) || dmu_tx_private_ok(tx)); 390fa9e4066Sahrens ASSERT(tx->tx_txg != 0); 391fa9e4066Sahrens ASSERT((bonustype == DMU_OT_NONE && bonuslen == 0) || 392fa9e4066Sahrens (bonustype != DMU_OT_NONE && bonuslen != 0)); 393fa9e4066Sahrens ASSERT3U(bonustype, <, DMU_OT_NUMTYPES); 394fa9e4066Sahrens ASSERT3U(bonuslen, <=, DN_MAX_BONUSLEN); 395fa9e4066Sahrens ASSERT(dn->dn_dirtyblksz[0] == 0); 396fa9e4066Sahrens ASSERT(dn->dn_dirtyblksz[1] == 0); 397fa9e4066Sahrens ASSERT(dn->dn_dirtyblksz[2] == 0); 398fa9e4066Sahrens ASSERT(dn->dn_dirtyblksz[3] == 0); 399fa9e4066Sahrens 400fa9e4066Sahrens /* 401fa9e4066Sahrens * XXX I should really have a generation number to tell if we 402fa9e4066Sahrens * need to do this... 403fa9e4066Sahrens */ 404fa9e4066Sahrens if (blocksize != dn->dn_datablksz || 405fa9e4066Sahrens dn->dn_bonustype != bonustype || dn->dn_bonuslen != bonuslen) { 406fa9e4066Sahrens /* free all old data */ 407fa9e4066Sahrens dnode_free_range(dn, 0, -1ULL, tx); 408fa9e4066Sahrens } 409fa9e4066Sahrens 410fa9e4066Sahrens /* change blocksize */ 411fa9e4066Sahrens rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 412fa9e4066Sahrens dnode_setdblksz(dn, blocksize); 413fa9e4066Sahrens dnode_setdirty(dn, tx); 414fa9e4066Sahrens /* don't need dd_dirty_mtx, dnode is already dirty */ 415fa9e4066Sahrens ASSERT(dn->dn_dirtyblksz[tx->tx_txg&TXG_MASK] != 0); 416fa9e4066Sahrens dn->dn_dirtyblksz[tx->tx_txg&TXG_MASK] = blocksize; 417fa9e4066Sahrens rw_exit(&dn->dn_struct_rwlock); 418fa9e4066Sahrens 419fa9e4066Sahrens /* change type */ 420fa9e4066Sahrens dn->dn_type = ot; 421fa9e4066Sahrens 422fa9e4066Sahrens if (dn->dn_bonuslen != bonuslen) { 423fa9e4066Sahrens /* change bonus size */ 424fa9e4066Sahrens if (bonuslen == 0) 425fa9e4066Sahrens bonuslen = 1; /* XXX */ 426fa9e4066Sahrens db = dbuf_hold_bonus(dn, FTAG); 427fa9e4066Sahrens dbuf_read(db); 428fa9e4066Sahrens mutex_enter(&db->db_mtx); 429fa9e4066Sahrens ASSERT3U(db->db.db_size, ==, dn->dn_bonuslen); 430fa9e4066Sahrens ASSERT(db->db.db_data != NULL); 431fa9e4066Sahrens db->db.db_size = bonuslen; 432fa9e4066Sahrens mutex_exit(&db->db_mtx); 433fa9e4066Sahrens dbuf_dirty(db, tx); 434fa9e4066Sahrens } 435fa9e4066Sahrens 436fa9e4066Sahrens /* change bonus size and type */ 437fa9e4066Sahrens mutex_enter(&dn->dn_mtx); 438fa9e4066Sahrens dn->dn_bonustype = bonustype; 439fa9e4066Sahrens dn->dn_bonuslen = bonuslen; 440fa9e4066Sahrens dn->dn_nblkptr = 1 + ((DN_MAX_BONUSLEN - bonuslen) >> SPA_BLKPTRSHIFT); 441fa9e4066Sahrens dn->dn_checksum = ZIO_CHECKSUM_INHERIT; 442fa9e4066Sahrens dn->dn_compress = ZIO_COMPRESS_INHERIT; 443fa9e4066Sahrens ASSERT3U(dn->dn_nblkptr, <=, DN_MAX_NBLKPTR); 444fa9e4066Sahrens 445fa9e4066Sahrens dn->dn_allocated_txg = tx->tx_txg; 446fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 447fa9e4066Sahrens 448fa9e4066Sahrens if (db) 449fa9e4066Sahrens dbuf_remove_ref(db, FTAG); 450fa9e4066Sahrens } 451fa9e4066Sahrens 452fa9e4066Sahrens void 453fa9e4066Sahrens dnode_special_close(dnode_t *dn) 454fa9e4066Sahrens { 455fa9e4066Sahrens dnode_destroy(dn); 456fa9e4066Sahrens } 457fa9e4066Sahrens 458fa9e4066Sahrens dnode_t * 459fa9e4066Sahrens dnode_special_open(objset_impl_t *os, dnode_phys_t *dnp, uint64_t object) 460fa9e4066Sahrens { 461fa9e4066Sahrens dnode_t *dn = dnode_create(os, dnp, NULL, object); 462*9c9dc39aSek DNODE_VERIFY(dn); 463fa9e4066Sahrens return (dn); 464fa9e4066Sahrens } 465fa9e4066Sahrens 466fa9e4066Sahrens static void 467fa9e4066Sahrens dnode_buf_pageout(dmu_buf_t *db, void *arg) 468fa9e4066Sahrens { 469fa9e4066Sahrens dnode_t **children_dnodes = arg; 470fa9e4066Sahrens int i; 471fa9e4066Sahrens int epb = db->db_size >> DNODE_SHIFT; 472fa9e4066Sahrens 473fa9e4066Sahrens for (i = 0; i < epb; i++) { 474fa9e4066Sahrens dnode_t *dn = children_dnodes[i]; 475fa9e4066Sahrens int n; 476fa9e4066Sahrens 477fa9e4066Sahrens if (dn == NULL) 478fa9e4066Sahrens continue; 479fa9e4066Sahrens #ifdef ZFS_DEBUG 480fa9e4066Sahrens /* 481fa9e4066Sahrens * If there are holds on this dnode, then there should 482fa9e4066Sahrens * be holds on the dnode's containing dbuf as well; thus 483fa9e4066Sahrens * it wouldn't be eligable for eviction and this function 484fa9e4066Sahrens * would not have been called. 485fa9e4066Sahrens */ 486fa9e4066Sahrens ASSERT(refcount_is_zero(&dn->dn_holds)); 487fa9e4066Sahrens ASSERT(list_head(&dn->dn_dbufs) == NULL); 488fa9e4066Sahrens ASSERT(refcount_is_zero(&dn->dn_tx_holds)); 489fa9e4066Sahrens 490fa9e4066Sahrens for (n = 0; n < TXG_SIZE; n++) 491fa9e4066Sahrens ASSERT(dn->dn_dirtyblksz[n] == 0); 492fa9e4066Sahrens #endif 493fa9e4066Sahrens children_dnodes[i] = NULL; 494fa9e4066Sahrens dnode_destroy(dn); 495fa9e4066Sahrens } 496fa9e4066Sahrens kmem_free(children_dnodes, epb * sizeof (dnode_t *)); 497fa9e4066Sahrens } 498fa9e4066Sahrens 499fa9e4066Sahrens /* 500fa9e4066Sahrens * Returns held dnode if the object number is valid, NULL if not. 501fa9e4066Sahrens * Note that this will succeed even for free dnodes. 502fa9e4066Sahrens */ 503fa9e4066Sahrens dnode_t * 504fa9e4066Sahrens dnode_hold_impl(objset_impl_t *os, uint64_t object, int flag, void *ref) 505fa9e4066Sahrens { 506fa9e4066Sahrens int epb, idx; 507fa9e4066Sahrens int drop_struct_lock = FALSE; 508fa9e4066Sahrens uint64_t blk; 509fa9e4066Sahrens dnode_t *mdn, *dn; 510fa9e4066Sahrens dmu_buf_impl_t *db; 511fa9e4066Sahrens dnode_t **children_dnodes; 512fa9e4066Sahrens 513fa9e4066Sahrens if (object == 0 || object >= DN_MAX_OBJECT) 514fa9e4066Sahrens return (NULL); 515fa9e4066Sahrens 516fa9e4066Sahrens mdn = os->os_meta_dnode; 517fa9e4066Sahrens 518*9c9dc39aSek DNODE_VERIFY(mdn); 519fa9e4066Sahrens 520fa9e4066Sahrens if (!RW_WRITE_HELD(&mdn->dn_struct_rwlock)) { 521fa9e4066Sahrens rw_enter(&mdn->dn_struct_rwlock, RW_READER); 522fa9e4066Sahrens drop_struct_lock = TRUE; 523fa9e4066Sahrens } 524fa9e4066Sahrens 525fa9e4066Sahrens blk = dbuf_whichblock(mdn, object * sizeof (dnode_phys_t)); 526fa9e4066Sahrens 527fa9e4066Sahrens db = dbuf_hold(mdn, blk); 528fa9e4066Sahrens if (drop_struct_lock) 529fa9e4066Sahrens rw_exit(&mdn->dn_struct_rwlock); 530fa9e4066Sahrens dbuf_read(db); 531fa9e4066Sahrens 532fa9e4066Sahrens ASSERT3U(db->db.db_size, >=, 1<<DNODE_SHIFT); 533fa9e4066Sahrens epb = db->db.db_size >> DNODE_SHIFT; 534fa9e4066Sahrens 535fa9e4066Sahrens idx = object & (epb-1); 536fa9e4066Sahrens 537fa9e4066Sahrens children_dnodes = dmu_buf_get_user(&db->db); 538fa9e4066Sahrens if (children_dnodes == NULL) { 539fa9e4066Sahrens dnode_t **winner; 540fa9e4066Sahrens children_dnodes = kmem_zalloc(epb * sizeof (dnode_t *), 541fa9e4066Sahrens KM_SLEEP); 542fa9e4066Sahrens if (winner = dmu_buf_set_user(&db->db, children_dnodes, NULL, 543fa9e4066Sahrens dnode_buf_pageout)) { 544fa9e4066Sahrens kmem_free(children_dnodes, epb * sizeof (dnode_t *)); 545fa9e4066Sahrens children_dnodes = winner; 546fa9e4066Sahrens } 547fa9e4066Sahrens } 548fa9e4066Sahrens 549fa9e4066Sahrens if ((dn = children_dnodes[idx]) == NULL) { 550fa9e4066Sahrens dnode_t *winner; 551fa9e4066Sahrens dn = dnode_create(os, (dnode_phys_t *)db->db.db_data+idx, 552fa9e4066Sahrens db, object); 553fa9e4066Sahrens winner = atomic_cas_ptr(&children_dnodes[idx], NULL, dn); 554fa9e4066Sahrens if (winner != NULL) { 555fa9e4066Sahrens dnode_destroy(dn); 556fa9e4066Sahrens dn = winner; 557fa9e4066Sahrens } 558fa9e4066Sahrens } 559fa9e4066Sahrens 560fa9e4066Sahrens mutex_enter(&dn->dn_mtx); 561fa9e4066Sahrens if (dn->dn_free_txg || 562fa9e4066Sahrens ((flag & DNODE_MUST_BE_ALLOCATED) && dn->dn_type == DMU_OT_NONE) || 563fa9e4066Sahrens ((flag & DNODE_MUST_BE_FREE) && dn->dn_type != DMU_OT_NONE)) { 564fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 565fa9e4066Sahrens dbuf_rele(db); 566fa9e4066Sahrens return (NULL); 567fa9e4066Sahrens } 568fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 569fa9e4066Sahrens 570fa9e4066Sahrens if (refcount_add(&dn->dn_holds, ref) == 1) 571fa9e4066Sahrens dbuf_add_ref(db, dn); 572fa9e4066Sahrens 573*9c9dc39aSek DNODE_VERIFY(dn); 574fa9e4066Sahrens ASSERT3P(dn->dn_dbuf, ==, db); 575fa9e4066Sahrens ASSERT3U(dn->dn_object, ==, object); 576fa9e4066Sahrens dbuf_rele(db); 577fa9e4066Sahrens 578fa9e4066Sahrens return (dn); 579fa9e4066Sahrens } 580fa9e4066Sahrens 581fa9e4066Sahrens /* 582fa9e4066Sahrens * Return held dnode if the object is allocated, NULL if not. 583fa9e4066Sahrens */ 584fa9e4066Sahrens dnode_t * 585fa9e4066Sahrens dnode_hold(objset_impl_t *os, uint64_t object, void *ref) 586fa9e4066Sahrens { 587fa9e4066Sahrens return (dnode_hold_impl(os, object, DNODE_MUST_BE_ALLOCATED, ref)); 588fa9e4066Sahrens } 589fa9e4066Sahrens 590fa9e4066Sahrens void 591fa9e4066Sahrens dnode_add_ref(dnode_t *dn, void *ref) 592fa9e4066Sahrens { 593fa9e4066Sahrens ASSERT(refcount_count(&dn->dn_holds) > 0); 594fa9e4066Sahrens (void) refcount_add(&dn->dn_holds, ref); 595fa9e4066Sahrens } 596fa9e4066Sahrens 597fa9e4066Sahrens void 598fa9e4066Sahrens dnode_rele(dnode_t *dn, void *ref) 599fa9e4066Sahrens { 600fa9e4066Sahrens uint64_t refs; 601fa9e4066Sahrens 602fa9e4066Sahrens refs = refcount_remove(&dn->dn_holds, ref); 603fa9e4066Sahrens /* NOTE: the DNODE_DNODE does not have a dn_dbuf */ 604fa9e4066Sahrens if (refs == 0 && dn->dn_dbuf) 605fa9e4066Sahrens dbuf_remove_ref(dn->dn_dbuf, dn); 606fa9e4066Sahrens } 607fa9e4066Sahrens 608fa9e4066Sahrens void 609fa9e4066Sahrens dnode_setdirty(dnode_t *dn, dmu_tx_t *tx) 610fa9e4066Sahrens { 611fa9e4066Sahrens objset_impl_t *os = dn->dn_objset; 612fa9e4066Sahrens uint64_t txg = tx->tx_txg; 613fa9e4066Sahrens 614fa9e4066Sahrens if (IS_DNODE_DNODE(dn->dn_object)) 615fa9e4066Sahrens return; 616fa9e4066Sahrens 617*9c9dc39aSek DNODE_VERIFY(dn); 618fa9e4066Sahrens 619fa9e4066Sahrens #ifdef ZFS_DEBUG 620fa9e4066Sahrens mutex_enter(&dn->dn_mtx); 621fa9e4066Sahrens ASSERT(dn->dn_phys->dn_type || dn->dn_allocated_txg); 622fa9e4066Sahrens /* ASSERT(dn->dn_free_txg == 0 || dn->dn_free_txg >= txg); */ 623fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 624fa9e4066Sahrens #endif 625fa9e4066Sahrens 626fa9e4066Sahrens mutex_enter(&os->os_lock); 627fa9e4066Sahrens 628fa9e4066Sahrens /* 629fa9e4066Sahrens * If we are already marked dirty, we're done. 630fa9e4066Sahrens */ 631fa9e4066Sahrens if (dn->dn_dirtyblksz[txg&TXG_MASK] > 0) { 632fa9e4066Sahrens mutex_exit(&os->os_lock); 633fa9e4066Sahrens return; 634fa9e4066Sahrens } 635fa9e4066Sahrens 636fa9e4066Sahrens ASSERT(!refcount_is_zero(&dn->dn_holds) || list_head(&dn->dn_dbufs)); 637fa9e4066Sahrens ASSERT(dn->dn_datablksz != 0); 638fa9e4066Sahrens dn->dn_dirtyblksz[txg&TXG_MASK] = dn->dn_datablksz; 639fa9e4066Sahrens 640fa9e4066Sahrens dprintf_ds(os->os_dsl_dataset, "obj=%llu txg=%llu\n", 641fa9e4066Sahrens dn->dn_object, txg); 642fa9e4066Sahrens 643fa9e4066Sahrens if (dn->dn_free_txg > 0 && dn->dn_free_txg <= txg) { 644fa9e4066Sahrens list_insert_tail(&os->os_free_dnodes[txg&TXG_MASK], dn); 645fa9e4066Sahrens } else { 646fa9e4066Sahrens list_insert_tail(&os->os_dirty_dnodes[txg&TXG_MASK], dn); 647fa9e4066Sahrens } 648fa9e4066Sahrens 649fa9e4066Sahrens mutex_exit(&os->os_lock); 650fa9e4066Sahrens 651fa9e4066Sahrens /* 652fa9e4066Sahrens * The dnode maintains a hold on its containing dbuf as 653fa9e4066Sahrens * long as there are holds on it. Each instantiated child 654fa9e4066Sahrens * dbuf maintaines a hold on the dnode. When the last child 655fa9e4066Sahrens * drops its hold, the dnode will drop its hold on the 656fa9e4066Sahrens * containing dbuf. We add a "dirty hold" here so that the 657fa9e4066Sahrens * dnode will hang around after we finish processing its 658fa9e4066Sahrens * children. 659fa9e4066Sahrens */ 660fa9e4066Sahrens (void) refcount_add(&dn->dn_holds, (void *)(uintptr_t)tx->tx_txg); 661fa9e4066Sahrens 662fa9e4066Sahrens dbuf_dirty(dn->dn_dbuf, tx); 663fa9e4066Sahrens 664fa9e4066Sahrens dsl_dataset_dirty(os->os_dsl_dataset, tx); 665fa9e4066Sahrens } 666fa9e4066Sahrens 667fa9e4066Sahrens void 668fa9e4066Sahrens dnode_free(dnode_t *dn, dmu_tx_t *tx) 669fa9e4066Sahrens { 670fa9e4066Sahrens dprintf("dn=%p txg=%llu\n", dn, tx->tx_txg); 671fa9e4066Sahrens 672fa9e4066Sahrens /* we should be the only holder... hopefully */ 673fa9e4066Sahrens /* ASSERT3U(refcount_count(&dn->dn_holds), ==, 1); */ 674fa9e4066Sahrens 675fa9e4066Sahrens mutex_enter(&dn->dn_mtx); 676fa9e4066Sahrens if (dn->dn_type == DMU_OT_NONE || dn->dn_free_txg) { 677fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 678fa9e4066Sahrens return; 679fa9e4066Sahrens } 680fa9e4066Sahrens dn->dn_free_txg = tx->tx_txg; 681fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 682fa9e4066Sahrens 683fa9e4066Sahrens /* 684fa9e4066Sahrens * If the dnode is already dirty, it needs to be moved from 685fa9e4066Sahrens * the dirty list to the free list. 686fa9e4066Sahrens */ 687fa9e4066Sahrens mutex_enter(&dn->dn_objset->os_lock); 688fa9e4066Sahrens if (dn->dn_dirtyblksz[tx->tx_txg&TXG_MASK] > 0) { 689fa9e4066Sahrens list_remove( 690fa9e4066Sahrens &dn->dn_objset->os_dirty_dnodes[tx->tx_txg&TXG_MASK], dn); 691fa9e4066Sahrens list_insert_tail( 692fa9e4066Sahrens &dn->dn_objset->os_free_dnodes[tx->tx_txg&TXG_MASK], dn); 693fa9e4066Sahrens mutex_exit(&dn->dn_objset->os_lock); 694fa9e4066Sahrens } else { 695fa9e4066Sahrens mutex_exit(&dn->dn_objset->os_lock); 696fa9e4066Sahrens dnode_setdirty(dn, tx); 697fa9e4066Sahrens } 698fa9e4066Sahrens } 699fa9e4066Sahrens 700fa9e4066Sahrens /* 701fa9e4066Sahrens * Try to change the block size for the indicated dnode. This can only 702fa9e4066Sahrens * succeed if there are no blocks allocated or dirty beyond first block 703fa9e4066Sahrens */ 704fa9e4066Sahrens int 705fa9e4066Sahrens dnode_set_blksz(dnode_t *dn, uint64_t size, int ibs, dmu_tx_t *tx) 706fa9e4066Sahrens { 707fa9e4066Sahrens dmu_buf_impl_t *db, *db_next; 708fa9e4066Sahrens int have_db0 = FALSE; 709fa9e4066Sahrens int err = ENOTSUP; 710fa9e4066Sahrens 711fa9e4066Sahrens if (size == 0) 712fa9e4066Sahrens size = SPA_MINBLOCKSIZE; 713fa9e4066Sahrens if (size > SPA_MAXBLOCKSIZE) 714fa9e4066Sahrens size = SPA_MAXBLOCKSIZE; 715fa9e4066Sahrens else 716fa9e4066Sahrens size = P2ROUNDUP(size, SPA_MINBLOCKSIZE); 717fa9e4066Sahrens 718fa9e4066Sahrens if (ibs == 0) 719fa9e4066Sahrens ibs = dn->dn_indblkshift; 720fa9e4066Sahrens 721fa9e4066Sahrens if (size >> SPA_MINBLOCKSHIFT == dn->dn_datablkszsec && 722fa9e4066Sahrens ibs == dn->dn_indblkshift) 723fa9e4066Sahrens return (0); 724fa9e4066Sahrens 725fa9e4066Sahrens rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 726fa9e4066Sahrens 727fa9e4066Sahrens /* Check for any allocated blocks beyond the first */ 728fa9e4066Sahrens if (dn->dn_phys->dn_maxblkid != 0) 729fa9e4066Sahrens goto end; 730fa9e4066Sahrens 731fa9e4066Sahrens /* 732fa9e4066Sahrens * Any buffers allocated for blocks beyond the first 733fa9e4066Sahrens * must be evictable/evicted, because they're the wrong size. 734fa9e4066Sahrens */ 735fa9e4066Sahrens mutex_enter(&dn->dn_dbufs_mtx); 736fa9e4066Sahrens /* 737fa9e4066Sahrens * Since we have the dn_dbufs_mtx, nothing can be 738fa9e4066Sahrens * removed from dn_dbufs. Since we have dn_struct_rwlock/w, 739fa9e4066Sahrens * nothing can be added to dn_dbufs. 740fa9e4066Sahrens */ 741fa9e4066Sahrens for (db = list_head(&dn->dn_dbufs); db; db = db_next) { 742fa9e4066Sahrens db_next = list_next(&dn->dn_dbufs, db); 743fa9e4066Sahrens 744fa9e4066Sahrens if (db->db_blkid == 0) { 745fa9e4066Sahrens have_db0 = TRUE; 746fa9e4066Sahrens } else if (db->db_blkid != DB_BONUS_BLKID) { 747fa9e4066Sahrens mutex_exit(&dn->dn_dbufs_mtx); 748fa9e4066Sahrens goto end; 749fa9e4066Sahrens } 750fa9e4066Sahrens } 751fa9e4066Sahrens mutex_exit(&dn->dn_dbufs_mtx); 752fa9e4066Sahrens 753fa9e4066Sahrens /* Fast-track if there is no data in the file */ 754fa9e4066Sahrens if (BP_IS_HOLE(&dn->dn_phys->dn_blkptr[0]) && !have_db0) { 755fa9e4066Sahrens dnode_setdblksz(dn, size); 756fa9e4066Sahrens dn->dn_indblkshift = ibs; 757fa9e4066Sahrens dnode_setdirty(dn, tx); 758fa9e4066Sahrens /* don't need dd_dirty_mtx, dnode is already dirty */ 759fa9e4066Sahrens dn->dn_dirtyblksz[tx->tx_txg&TXG_MASK] = size; 760fa9e4066Sahrens dn->dn_next_indblkshift[tx->tx_txg&TXG_MASK] = ibs; 761fa9e4066Sahrens rw_exit(&dn->dn_struct_rwlock); 762fa9e4066Sahrens return (0); 763fa9e4066Sahrens } 764fa9e4066Sahrens 765fa9e4066Sahrens /* obtain the old block */ 766fa9e4066Sahrens db = dbuf_hold(dn, 0); 767fa9e4066Sahrens 768fa9e4066Sahrens /* Not allowed to decrease the size if there is data present */ 769fa9e4066Sahrens if (size < db->db.db_size) { 770fa9e4066Sahrens dbuf_rele(db); 771fa9e4066Sahrens goto end; 772fa9e4066Sahrens } 773fa9e4066Sahrens 774fa9e4066Sahrens dbuf_new_size(db, size, tx); 775fa9e4066Sahrens 776fa9e4066Sahrens dnode_setdblksz(dn, size); 777fa9e4066Sahrens dn->dn_indblkshift = ibs; 778fa9e4066Sahrens /* don't need dd_dirty_mtx, dnode is already dirty */ 779fa9e4066Sahrens dn->dn_dirtyblksz[tx->tx_txg&TXG_MASK] = size; 780fa9e4066Sahrens dn->dn_next_indblkshift[tx->tx_txg&TXG_MASK] = ibs; 781fa9e4066Sahrens dbuf_rele(db); 782fa9e4066Sahrens 783fa9e4066Sahrens err = 0; 784fa9e4066Sahrens end: 785fa9e4066Sahrens rw_exit(&dn->dn_struct_rwlock); 786fa9e4066Sahrens return (err); 787fa9e4066Sahrens } 788fa9e4066Sahrens 789fa9e4066Sahrens uint64_t 790fa9e4066Sahrens dnode_max_nonzero_offset(dnode_t *dn) 791fa9e4066Sahrens { 792fa9e4066Sahrens if (dn->dn_phys->dn_maxblkid == 0 && 793fa9e4066Sahrens BP_IS_HOLE(&dn->dn_phys->dn_blkptr[0])) 794fa9e4066Sahrens return (0); 795fa9e4066Sahrens else 796fa9e4066Sahrens return ((dn->dn_phys->dn_maxblkid+1) * dn->dn_datablksz); 797fa9e4066Sahrens } 798fa9e4066Sahrens 799fa9e4066Sahrens void 800fa9e4066Sahrens dnode_new_blkid(dnode_t *dn, uint64_t blkid, dmu_tx_t *tx) 801fa9e4066Sahrens { 802fa9e4066Sahrens uint64_t txgoff = tx->tx_txg & TXG_MASK; 803fa9e4066Sahrens int drop_struct_lock = FALSE; 804fa9e4066Sahrens int epbs, old_nlevels, new_nlevels; 805fa9e4066Sahrens uint64_t sz; 806fa9e4066Sahrens 807fa9e4066Sahrens if (blkid == DB_BONUS_BLKID) 808fa9e4066Sahrens return; 809fa9e4066Sahrens 810fa9e4066Sahrens if (!RW_WRITE_HELD(&dn->dn_struct_rwlock)) { 811fa9e4066Sahrens rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 812fa9e4066Sahrens drop_struct_lock = TRUE; 813fa9e4066Sahrens } 814fa9e4066Sahrens 815fa9e4066Sahrens if (blkid > dn->dn_maxblkid) 816fa9e4066Sahrens dn->dn_maxblkid = blkid; 817fa9e4066Sahrens 818fa9e4066Sahrens /* 819fa9e4066Sahrens * Compute the number of levels necessary to support the 820fa9e4066Sahrens * new blkid. 821fa9e4066Sahrens */ 822fa9e4066Sahrens new_nlevels = 1; 823fa9e4066Sahrens epbs = dn->dn_indblkshift - SPA_BLKPTRSHIFT; 824fa9e4066Sahrens 825fa9e4066Sahrens for (sz = dn->dn_nblkptr; sz <= blkid && sz >= dn->dn_nblkptr; 826fa9e4066Sahrens sz <<= epbs) 827fa9e4066Sahrens new_nlevels++; 828fa9e4066Sahrens old_nlevels = dn->dn_nlevels; 829fa9e4066Sahrens 830fa9e4066Sahrens if (new_nlevels > dn->dn_next_nlevels[txgoff]) 831fa9e4066Sahrens dn->dn_next_nlevels[txgoff] = new_nlevels; 832fa9e4066Sahrens 833fa9e4066Sahrens if (new_nlevels > old_nlevels) { 834fa9e4066Sahrens dprintf("dn %p increasing nlevels from %u to %u\n", 835fa9e4066Sahrens dn, dn->dn_nlevels, new_nlevels); 836fa9e4066Sahrens dn->dn_nlevels = new_nlevels; 837fa9e4066Sahrens } 838fa9e4066Sahrens 839fa9e4066Sahrens /* 840fa9e4066Sahrens * Dirty the left indirects. 841fa9e4066Sahrens * Note: the caller should have just dnode_use_space()'d one 842fa9e4066Sahrens * data block's worth, so we could subtract that out of 843fa9e4066Sahrens * dn_inflight_data to determine if there is any dirty data 844fa9e4066Sahrens * besides this block. 845fa9e4066Sahrens * We don't strictly need to dirty them unless there's 846fa9e4066Sahrens * *something* in the object (eg. on disk or dirty)... 847fa9e4066Sahrens */ 848fa9e4066Sahrens if (new_nlevels > old_nlevels) { 849fa9e4066Sahrens dmu_buf_impl_t *db = dbuf_hold_level(dn, old_nlevels, 0, FTAG); 850fa9e4066Sahrens dprintf("dn %p dirtying left indirects\n", dn); 851fa9e4066Sahrens dbuf_dirty(db, tx); 852fa9e4066Sahrens dbuf_remove_ref(db, FTAG); 853fa9e4066Sahrens } 854fa9e4066Sahrens #ifdef ZFS_DEBUG 855fa9e4066Sahrens else if (old_nlevels > 1 && new_nlevels > old_nlevels) { 856fa9e4066Sahrens dmu_buf_impl_t *db; 857fa9e4066Sahrens int i; 858fa9e4066Sahrens 859fa9e4066Sahrens for (i = 0; i < dn->dn_nblkptr; i++) { 860fa9e4066Sahrens db = dbuf_hold_level(dn, old_nlevels-1, i, FTAG); 861fa9e4066Sahrens ASSERT(! 862fa9e4066Sahrens list_link_active(&db->db_dirty_node[txgoff])); 863fa9e4066Sahrens dbuf_remove_ref(db, FTAG); 864fa9e4066Sahrens } 865fa9e4066Sahrens } 866fa9e4066Sahrens #endif 867fa9e4066Sahrens 868fa9e4066Sahrens dprintf("dn %p done\n", dn); 869fa9e4066Sahrens 870fa9e4066Sahrens out: 871fa9e4066Sahrens if (drop_struct_lock) 872fa9e4066Sahrens rw_exit(&dn->dn_struct_rwlock); 873fa9e4066Sahrens } 874fa9e4066Sahrens 875fa9e4066Sahrens void 876fa9e4066Sahrens dnode_clear_range(dnode_t *dn, uint64_t blkid, uint64_t nblks, dmu_tx_t *tx) 877fa9e4066Sahrens { 878fa9e4066Sahrens avl_tree_t *tree = &dn->dn_ranges[tx->tx_txg&TXG_MASK]; 879fa9e4066Sahrens avl_index_t where; 880fa9e4066Sahrens free_range_t *rp; 881fa9e4066Sahrens free_range_t rp_tofind; 882fa9e4066Sahrens uint64_t endblk = blkid + nblks; 883fa9e4066Sahrens 884fa9e4066Sahrens ASSERT(MUTEX_HELD(&dn->dn_mtx)); 885fa9e4066Sahrens ASSERT(nblks <= UINT64_MAX - blkid); /* no overflow */ 886fa9e4066Sahrens 887fa9e4066Sahrens dprintf_dnode(dn, "blkid=%llu nblks=%llu txg=%llu\n", 888fa9e4066Sahrens blkid, nblks, tx->tx_txg); 889fa9e4066Sahrens rp_tofind.fr_blkid = blkid; 890fa9e4066Sahrens rp = avl_find(tree, &rp_tofind, &where); 891fa9e4066Sahrens if (rp == NULL) 892fa9e4066Sahrens rp = avl_nearest(tree, where, AVL_BEFORE); 893fa9e4066Sahrens if (rp == NULL) 894fa9e4066Sahrens rp = avl_nearest(tree, where, AVL_AFTER); 895fa9e4066Sahrens 896fa9e4066Sahrens while (rp && (rp->fr_blkid <= blkid + nblks)) { 897fa9e4066Sahrens uint64_t fr_endblk = rp->fr_blkid + rp->fr_nblks; 898fa9e4066Sahrens free_range_t *nrp = AVL_NEXT(tree, rp); 899fa9e4066Sahrens 900fa9e4066Sahrens if (blkid <= rp->fr_blkid && endblk >= fr_endblk) { 901fa9e4066Sahrens /* clear this entire range */ 902fa9e4066Sahrens avl_remove(tree, rp); 903fa9e4066Sahrens kmem_free(rp, sizeof (free_range_t)); 904fa9e4066Sahrens } else if (blkid <= rp->fr_blkid && 905fa9e4066Sahrens endblk > rp->fr_blkid && endblk < fr_endblk) { 906fa9e4066Sahrens /* clear the beginning of this range */ 907fa9e4066Sahrens rp->fr_blkid = endblk; 908fa9e4066Sahrens rp->fr_nblks = fr_endblk - endblk; 909fa9e4066Sahrens } else if (blkid > rp->fr_blkid && blkid < fr_endblk && 910fa9e4066Sahrens endblk >= fr_endblk) { 911fa9e4066Sahrens /* clear the end of this range */ 912fa9e4066Sahrens rp->fr_nblks = blkid - rp->fr_blkid; 913fa9e4066Sahrens } else if (blkid > rp->fr_blkid && endblk < fr_endblk) { 914fa9e4066Sahrens /* clear a chunk out of this range */ 915fa9e4066Sahrens free_range_t *new_rp = 916fa9e4066Sahrens kmem_alloc(sizeof (free_range_t), KM_SLEEP); 917fa9e4066Sahrens 918fa9e4066Sahrens new_rp->fr_blkid = endblk; 919fa9e4066Sahrens new_rp->fr_nblks = fr_endblk - endblk; 920fa9e4066Sahrens avl_insert_here(tree, new_rp, rp, AVL_AFTER); 921fa9e4066Sahrens rp->fr_nblks = blkid - rp->fr_blkid; 922fa9e4066Sahrens } 923fa9e4066Sahrens /* there may be no overlap */ 924fa9e4066Sahrens rp = nrp; 925fa9e4066Sahrens } 926fa9e4066Sahrens } 927fa9e4066Sahrens 928fa9e4066Sahrens void 929fa9e4066Sahrens dnode_free_range(dnode_t *dn, uint64_t off, uint64_t len, dmu_tx_t *tx) 930fa9e4066Sahrens { 931fa9e4066Sahrens dmu_buf_impl_t *db; 932fa9e4066Sahrens uint64_t start, objsize, blkid, nblks; 933fa9e4066Sahrens int blkshift, blksz, tail, head, epbs; 934fa9e4066Sahrens int trunc = FALSE; 935fa9e4066Sahrens 936fa9e4066Sahrens rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 937fa9e4066Sahrens blksz = dn->dn_datablksz; 938fa9e4066Sahrens blkshift = dn->dn_datablkshift; 939fa9e4066Sahrens epbs = dn->dn_indblkshift - SPA_BLKPTRSHIFT; 940fa9e4066Sahrens 941fa9e4066Sahrens /* If the range is past the end of the file, this is a no-op */ 942fa9e4066Sahrens objsize = blksz * (dn->dn_maxblkid+1); 943fa9e4066Sahrens if (off >= objsize) 944fa9e4066Sahrens goto out; 945fa9e4066Sahrens if (len == -1ULL) { 946fa9e4066Sahrens len = UINT64_MAX - off; 947fa9e4066Sahrens trunc = TRUE; 948fa9e4066Sahrens } 949fa9e4066Sahrens 950fa9e4066Sahrens /* 951fa9e4066Sahrens * First, block align the region to free: 952fa9e4066Sahrens */ 953fa9e4066Sahrens if (dn->dn_maxblkid == 0) { 954fa9e4066Sahrens if (off == 0) { 955fa9e4066Sahrens head = 0; 956fa9e4066Sahrens } else { 957fa9e4066Sahrens head = blksz - off; 958fa9e4066Sahrens ASSERT3U(head, >, 0); 959fa9e4066Sahrens } 960fa9e4066Sahrens start = off; 961fa9e4066Sahrens } else { 962fa9e4066Sahrens ASSERT(ISP2(blksz)); 963fa9e4066Sahrens head = P2NPHASE(off, blksz); 964fa9e4066Sahrens start = P2PHASE(off, blksz); 965fa9e4066Sahrens } 966fa9e4066Sahrens /* zero out any partial block data at the start of the range */ 967fa9e4066Sahrens if (head) { 968fa9e4066Sahrens ASSERT3U(start + head, ==, blksz); 969fa9e4066Sahrens if (len < head) 970fa9e4066Sahrens head = len; 971fa9e4066Sahrens if (dbuf_hold_impl(dn, 0, dbuf_whichblock(dn, off), TRUE, 972fa9e4066Sahrens FTAG, &db) == 0) { 973fa9e4066Sahrens caddr_t data; 974fa9e4066Sahrens 975fa9e4066Sahrens /* don't dirty if it isn't on disk and isn't dirty */ 976fa9e4066Sahrens if (db->db_dirtied || 977fa9e4066Sahrens (db->db_blkptr && !BP_IS_HOLE(db->db_blkptr))) { 978fa9e4066Sahrens rw_exit(&dn->dn_struct_rwlock); 979fa9e4066Sahrens dbuf_will_dirty(db, tx); 980fa9e4066Sahrens rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 981fa9e4066Sahrens data = db->db.db_data; 982fa9e4066Sahrens bzero(data + start, head); 983fa9e4066Sahrens } 984fa9e4066Sahrens dbuf_remove_ref(db, FTAG); 985fa9e4066Sahrens } 986fa9e4066Sahrens off += head; 987fa9e4066Sahrens len -= head; 988fa9e4066Sahrens } 989fa9e4066Sahrens /* If the range was less than one block, we are done */ 990fa9e4066Sahrens if (len == 0) 991fa9e4066Sahrens goto out; 992fa9e4066Sahrens 993fa9e4066Sahrens /* If the remaining range is past the end of the file, we are done */ 994fa9e4066Sahrens if (off > dn->dn_maxblkid << blkshift) 995fa9e4066Sahrens goto out; 996fa9e4066Sahrens 997fa9e4066Sahrens if (off + len == UINT64_MAX) 998fa9e4066Sahrens tail = 0; 999fa9e4066Sahrens else 1000fa9e4066Sahrens tail = P2PHASE(len, blksz); 1001fa9e4066Sahrens 1002fa9e4066Sahrens ASSERT3U(P2PHASE(off, blksz), ==, 0); 1003fa9e4066Sahrens /* zero out any partial block data at the end of the range */ 1004fa9e4066Sahrens if (tail) { 1005fa9e4066Sahrens if (len < tail) 1006fa9e4066Sahrens tail = len; 1007fa9e4066Sahrens if (dbuf_hold_impl(dn, 0, dbuf_whichblock(dn, off+len), 1008fa9e4066Sahrens TRUE, FTAG, &db) == 0) { 1009fa9e4066Sahrens /* don't dirty if it isn't on disk and isn't dirty */ 1010fa9e4066Sahrens if (db->db_dirtied || 1011fa9e4066Sahrens (db->db_blkptr && !BP_IS_HOLE(db->db_blkptr))) { 1012fa9e4066Sahrens rw_exit(&dn->dn_struct_rwlock); 1013fa9e4066Sahrens dbuf_will_dirty(db, tx); 1014fa9e4066Sahrens rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 1015fa9e4066Sahrens bzero(db->db.db_data, tail); 1016fa9e4066Sahrens } 1017fa9e4066Sahrens dbuf_remove_ref(db, FTAG); 1018fa9e4066Sahrens } 1019fa9e4066Sahrens len -= tail; 1020fa9e4066Sahrens } 1021fa9e4066Sahrens /* If the range did not include a full block, we are done */ 1022fa9e4066Sahrens if (len == 0) 1023fa9e4066Sahrens goto out; 1024fa9e4066Sahrens 1025fa9e4066Sahrens /* dirty the left indirects */ 1026fa9e4066Sahrens if (dn->dn_nlevels > 1 && off != 0) { 1027fa9e4066Sahrens db = dbuf_hold_level(dn, 1, 1028fa9e4066Sahrens (off - head) >> (blkshift + epbs), FTAG); 1029fa9e4066Sahrens dbuf_will_dirty(db, tx); 1030fa9e4066Sahrens dbuf_remove_ref(db, FTAG); 1031fa9e4066Sahrens } 1032fa9e4066Sahrens 1033fa9e4066Sahrens /* dirty the right indirects */ 1034fa9e4066Sahrens if (dn->dn_nlevels > 1 && !trunc) { 1035fa9e4066Sahrens db = dbuf_hold_level(dn, 1, 1036fa9e4066Sahrens (off + len + tail - 1) >> (blkshift + epbs), FTAG); 1037fa9e4066Sahrens dbuf_will_dirty(db, tx); 1038fa9e4066Sahrens dbuf_remove_ref(db, FTAG); 1039fa9e4066Sahrens } 1040fa9e4066Sahrens 1041fa9e4066Sahrens /* 1042fa9e4066Sahrens * Finally, add this range to the dnode range list, we 1043fa9e4066Sahrens * will finish up this free operation in the syncing phase. 1044fa9e4066Sahrens */ 1045fa9e4066Sahrens ASSERT(IS_P2ALIGNED(off, 1<<blkshift)); 1046fa9e4066Sahrens ASSERT(off + len == UINT64_MAX || IS_P2ALIGNED(len, 1<<blkshift)); 1047fa9e4066Sahrens blkid = off >> blkshift; 1048fa9e4066Sahrens nblks = len >> blkshift; 1049fa9e4066Sahrens 1050fa9e4066Sahrens if (trunc) 1051fa9e4066Sahrens dn->dn_maxblkid = (blkid ? blkid - 1 : 0); 1052fa9e4066Sahrens 1053fa9e4066Sahrens mutex_enter(&dn->dn_mtx); 1054fa9e4066Sahrens dnode_clear_range(dn, blkid, nblks, tx); 1055fa9e4066Sahrens { 1056fa9e4066Sahrens free_range_t *rp, *found; 1057fa9e4066Sahrens avl_index_t where; 1058fa9e4066Sahrens avl_tree_t *tree = &dn->dn_ranges[tx->tx_txg&TXG_MASK]; 1059fa9e4066Sahrens 1060fa9e4066Sahrens /* Add new range to dn_ranges */ 1061fa9e4066Sahrens rp = kmem_alloc(sizeof (free_range_t), KM_SLEEP); 1062fa9e4066Sahrens rp->fr_blkid = blkid; 1063fa9e4066Sahrens rp->fr_nblks = nblks; 1064fa9e4066Sahrens found = avl_find(tree, rp, &where); 1065fa9e4066Sahrens ASSERT(found == NULL); 1066fa9e4066Sahrens avl_insert(tree, rp, where); 1067fa9e4066Sahrens dprintf_dnode(dn, "blkid=%llu nblks=%llu txg=%llu\n", 1068fa9e4066Sahrens blkid, nblks, tx->tx_txg); 1069fa9e4066Sahrens } 1070fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 1071fa9e4066Sahrens 1072fa9e4066Sahrens dbuf_free_range(dn, blkid, nblks, tx); 1073fa9e4066Sahrens dnode_setdirty(dn, tx); 1074fa9e4066Sahrens out: 1075fa9e4066Sahrens rw_exit(&dn->dn_struct_rwlock); 1076fa9e4066Sahrens } 1077fa9e4066Sahrens 1078fa9e4066Sahrens /* return TRUE if this blkid was freed in a recent txg, or FALSE if it wasn't */ 1079fa9e4066Sahrens uint64_t 1080fa9e4066Sahrens dnode_block_freed(dnode_t *dn, uint64_t blkid) 1081fa9e4066Sahrens { 1082fa9e4066Sahrens free_range_t range_tofind; 1083fa9e4066Sahrens void *dp = spa_get_dsl(dn->dn_objset->os_spa); 1084fa9e4066Sahrens int i; 1085fa9e4066Sahrens 1086fa9e4066Sahrens if (blkid == DB_BONUS_BLKID) 1087fa9e4066Sahrens return (FALSE); 1088fa9e4066Sahrens 1089fa9e4066Sahrens /* 1090fa9e4066Sahrens * If we're in the process of opening the pool, dp will not be 1091fa9e4066Sahrens * set yet, but there shouldn't be anything dirty. 1092fa9e4066Sahrens */ 1093fa9e4066Sahrens if (dp == NULL) 1094fa9e4066Sahrens return (FALSE); 1095fa9e4066Sahrens 1096fa9e4066Sahrens if (dn->dn_free_txg) 1097fa9e4066Sahrens return (TRUE); 1098fa9e4066Sahrens 1099fa9e4066Sahrens /* 1100fa9e4066Sahrens * If dn_datablkshift is not set, then there's only a single 1101fa9e4066Sahrens * block, in which case there will never be a free range so it 1102fa9e4066Sahrens * won't matter. 1103fa9e4066Sahrens */ 1104fa9e4066Sahrens range_tofind.fr_blkid = blkid; 1105fa9e4066Sahrens mutex_enter(&dn->dn_mtx); 1106fa9e4066Sahrens for (i = 0; i < TXG_SIZE; i++) { 1107fa9e4066Sahrens free_range_t *range_found; 1108fa9e4066Sahrens avl_index_t idx; 1109fa9e4066Sahrens 1110fa9e4066Sahrens range_found = avl_find(&dn->dn_ranges[i], &range_tofind, &idx); 1111fa9e4066Sahrens if (range_found) { 1112fa9e4066Sahrens ASSERT(range_found->fr_nblks > 0); 1113fa9e4066Sahrens break; 1114fa9e4066Sahrens } 1115fa9e4066Sahrens range_found = avl_nearest(&dn->dn_ranges[i], idx, AVL_BEFORE); 1116fa9e4066Sahrens if (range_found && 1117fa9e4066Sahrens range_found->fr_blkid + range_found->fr_nblks > blkid) 1118fa9e4066Sahrens break; 1119fa9e4066Sahrens } 1120fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 1121fa9e4066Sahrens return (i < TXG_SIZE); 1122fa9e4066Sahrens } 1123fa9e4066Sahrens 1124fa9e4066Sahrens /* call from syncing context when we actually write/free space for this dnode */ 1125fa9e4066Sahrens void 1126fa9e4066Sahrens dnode_diduse_space(dnode_t *dn, int64_t space) 1127fa9e4066Sahrens { 1128fa9e4066Sahrens uint64_t sectors; 1129fa9e4066Sahrens 1130fa9e4066Sahrens dprintf_dnode(dn, "dn=%p dnp=%p secphys=%llu space=%lld\n", 1131fa9e4066Sahrens dn, dn->dn_phys, 1132fa9e4066Sahrens (u_longlong_t)dn->dn_phys->dn_secphys, 1133fa9e4066Sahrens (longlong_t)space); 1134fa9e4066Sahrens 1135fa9e4066Sahrens ASSERT(P2PHASE(space, 1<<DEV_BSHIFT) == 0); 1136fa9e4066Sahrens 1137fa9e4066Sahrens mutex_enter(&dn->dn_mtx); 1138fa9e4066Sahrens if (space > 0) { 1139fa9e4066Sahrens sectors = space >> DEV_BSHIFT; 1140fa9e4066Sahrens ASSERT3U(dn->dn_phys->dn_secphys + sectors, >=, 1141fa9e4066Sahrens dn->dn_phys->dn_secphys); 1142fa9e4066Sahrens dn->dn_phys->dn_secphys += sectors; 1143fa9e4066Sahrens } else { 1144fa9e4066Sahrens sectors = -space >> DEV_BSHIFT; 1145fa9e4066Sahrens ASSERT3U(dn->dn_phys->dn_secphys, >=, sectors); 1146fa9e4066Sahrens dn->dn_phys->dn_secphys -= sectors; 1147fa9e4066Sahrens } 1148fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 1149fa9e4066Sahrens } 1150fa9e4066Sahrens 1151fa9e4066Sahrens /* 1152fa9e4066Sahrens * Call when we think we're going to write/free space in open context. 1153fa9e4066Sahrens * Be conservative (ie. OK to write less than this or free more than 1154fa9e4066Sahrens * this, but don't write more or free less). 1155fa9e4066Sahrens */ 1156fa9e4066Sahrens void 1157fa9e4066Sahrens dnode_willuse_space(dnode_t *dn, int64_t space, dmu_tx_t *tx) 1158fa9e4066Sahrens { 1159fa9e4066Sahrens objset_impl_t *os = dn->dn_objset; 1160fa9e4066Sahrens dsl_dataset_t *ds = os->os_dsl_dataset; 1161fa9e4066Sahrens 1162fa9e4066Sahrens if (space > 0) 1163fa9e4066Sahrens space = spa_get_asize(os->os_spa, space); 1164fa9e4066Sahrens 1165fa9e4066Sahrens if (ds) 1166fa9e4066Sahrens dsl_dir_willuse_space(ds->ds_dir, space, tx); 1167fa9e4066Sahrens 1168fa9e4066Sahrens dmu_tx_willuse_space(tx, space); 1169fa9e4066Sahrens } 1170fa9e4066Sahrens 1171fa9e4066Sahrens static int 1172fa9e4066Sahrens dnode_next_offset_level(dnode_t *dn, boolean_t hole, uint64_t *offset, 1173fa9e4066Sahrens int lvl, uint64_t blkfill) 1174fa9e4066Sahrens { 1175fa9e4066Sahrens dmu_buf_impl_t *db = NULL; 1176fa9e4066Sahrens void *data = NULL; 1177fa9e4066Sahrens uint64_t epbs = dn->dn_phys->dn_indblkshift - SPA_BLKPTRSHIFT; 1178fa9e4066Sahrens uint64_t epb = 1ULL << epbs; 1179fa9e4066Sahrens uint64_t minfill, maxfill; 1180fa9e4066Sahrens int i, error, span; 1181fa9e4066Sahrens 1182fa9e4066Sahrens dprintf("probing object %llu offset %llx level %d of %u\n", 1183fa9e4066Sahrens dn->dn_object, *offset, lvl, dn->dn_phys->dn_nlevels); 1184fa9e4066Sahrens 1185fa9e4066Sahrens if (lvl == dn->dn_phys->dn_nlevels) { 1186fa9e4066Sahrens error = 0; 1187fa9e4066Sahrens epb = dn->dn_phys->dn_nblkptr; 1188fa9e4066Sahrens data = dn->dn_phys->dn_blkptr; 1189fa9e4066Sahrens } else { 1190fa9e4066Sahrens uint64_t blkid = dbuf_whichblock(dn, *offset) >> (epbs * lvl); 1191fa9e4066Sahrens error = dbuf_hold_impl(dn, lvl, blkid, TRUE, FTAG, &db); 1192fa9e4066Sahrens if (error) { 1193fa9e4066Sahrens if (error == ENOENT) 1194fa9e4066Sahrens return (hole ? 0 : ESRCH); 1195fa9e4066Sahrens return (error); 1196fa9e4066Sahrens } 1197fa9e4066Sahrens dbuf_read_havestruct(db); 1198fa9e4066Sahrens data = db->db.db_data; 1199fa9e4066Sahrens } 1200fa9e4066Sahrens 1201fa9e4066Sahrens if (lvl == 0) { 1202fa9e4066Sahrens dnode_phys_t *dnp = data; 1203fa9e4066Sahrens span = DNODE_SHIFT; 1204fa9e4066Sahrens ASSERT(dn->dn_type == DMU_OT_DNODE); 1205fa9e4066Sahrens 1206fa9e4066Sahrens for (i = (*offset >> span) & (blkfill - 1); i < blkfill; i++) { 1207fa9e4066Sahrens if (!dnp[i].dn_type == hole) 1208fa9e4066Sahrens break; 1209fa9e4066Sahrens *offset += 1ULL << span; 1210fa9e4066Sahrens } 1211fa9e4066Sahrens if (i == blkfill) 1212fa9e4066Sahrens error = ESRCH; 1213fa9e4066Sahrens } else { 1214fa9e4066Sahrens blkptr_t *bp = data; 1215fa9e4066Sahrens span = (lvl - 1) * epbs + dn->dn_datablkshift; 1216fa9e4066Sahrens minfill = 0; 1217fa9e4066Sahrens maxfill = blkfill << ((lvl - 1) * epbs); 1218fa9e4066Sahrens 1219fa9e4066Sahrens if (hole) 1220fa9e4066Sahrens maxfill--; 1221fa9e4066Sahrens else 1222fa9e4066Sahrens minfill++; 1223fa9e4066Sahrens 1224fa9e4066Sahrens for (i = (*offset >> span) & ((1ULL << epbs) - 1); 1225fa9e4066Sahrens i < epb; i++) { 1226fa9e4066Sahrens if (bp[i].blk_fill >= minfill && 1227fa9e4066Sahrens bp[i].blk_fill <= maxfill) 1228fa9e4066Sahrens break; 1229fa9e4066Sahrens *offset += 1ULL << span; 1230fa9e4066Sahrens } 1231fa9e4066Sahrens if (i >= epb) 1232fa9e4066Sahrens error = ESRCH; 1233fa9e4066Sahrens } 1234fa9e4066Sahrens 1235fa9e4066Sahrens if (db) 1236fa9e4066Sahrens dbuf_remove_ref(db, FTAG); 1237fa9e4066Sahrens 1238fa9e4066Sahrens return (error); 1239fa9e4066Sahrens } 1240fa9e4066Sahrens 1241fa9e4066Sahrens /* 1242fa9e4066Sahrens * Find the next hole, data, or sparse region at or after *offset. 1243fa9e4066Sahrens * The value 'blkfill' tells us how many items we expect to find 1244fa9e4066Sahrens * in an L0 data block; this value is 1 for normal objects, 1245fa9e4066Sahrens * DNODES_PER_BLOCK for the meta dnode, and some fraction of 1246fa9e4066Sahrens * DNODES_PER_BLOCK when searching for sparse regions thereof. 1247fa9e4066Sahrens * Examples: 1248fa9e4066Sahrens * 1249fa9e4066Sahrens * dnode_next_offset(dn, hole, offset, 1, 1); 1250fa9e4066Sahrens * Finds the next hole/data in a file. 1251fa9e4066Sahrens * Used in dmu_offset_next(). 1252fa9e4066Sahrens * 1253fa9e4066Sahrens * dnode_next_offset(mdn, hole, offset, 0, DNODES_PER_BLOCK); 1254fa9e4066Sahrens * Finds the next free/allocated dnode an objset's meta-dnode. 1255fa9e4066Sahrens * Used in dmu_object_next(). 1256fa9e4066Sahrens * 1257fa9e4066Sahrens * dnode_next_offset(mdn, TRUE, offset, 2, DNODES_PER_BLOCK >> 2); 1258fa9e4066Sahrens * Finds the next L2 meta-dnode bp that's at most 1/4 full. 1259fa9e4066Sahrens * Used in dmu_object_alloc(). 1260fa9e4066Sahrens */ 1261fa9e4066Sahrens int 1262fa9e4066Sahrens dnode_next_offset(dnode_t *dn, boolean_t hole, uint64_t *offset, 1263fa9e4066Sahrens int minlvl, uint64_t blkfill) 1264fa9e4066Sahrens { 1265fa9e4066Sahrens int lvl, maxlvl; 1266fa9e4066Sahrens int error = 0; 1267fa9e4066Sahrens uint64_t initial_offset = *offset; 1268fa9e4066Sahrens 1269fa9e4066Sahrens rw_enter(&dn->dn_struct_rwlock, RW_READER); 1270fa9e4066Sahrens 1271fa9e4066Sahrens if (dn->dn_phys->dn_nlevels == 0) { 1272fa9e4066Sahrens rw_exit(&dn->dn_struct_rwlock); 1273fa9e4066Sahrens return (ESRCH); 1274fa9e4066Sahrens } 1275fa9e4066Sahrens 1276fa9e4066Sahrens if (dn->dn_datablkshift == 0) { 1277fa9e4066Sahrens if (*offset < dn->dn_datablksz) { 1278fa9e4066Sahrens if (hole) 1279fa9e4066Sahrens *offset = dn->dn_datablksz; 1280fa9e4066Sahrens } else { 1281fa9e4066Sahrens error = ESRCH; 1282fa9e4066Sahrens } 1283fa9e4066Sahrens rw_exit(&dn->dn_struct_rwlock); 1284fa9e4066Sahrens return (error); 1285fa9e4066Sahrens } 1286fa9e4066Sahrens 1287fa9e4066Sahrens maxlvl = dn->dn_phys->dn_nlevels; 1288fa9e4066Sahrens 1289fa9e4066Sahrens for (lvl = minlvl; lvl <= maxlvl; lvl++) { 1290fa9e4066Sahrens error = dnode_next_offset_level(dn, hole, offset, lvl, blkfill); 1291fa9e4066Sahrens if (error == 0) 1292fa9e4066Sahrens break; 1293fa9e4066Sahrens } 1294fa9e4066Sahrens 1295fa9e4066Sahrens while (--lvl >= minlvl && error == 0) 1296fa9e4066Sahrens error = dnode_next_offset_level(dn, hole, offset, lvl, blkfill); 1297fa9e4066Sahrens 1298fa9e4066Sahrens rw_exit(&dn->dn_struct_rwlock); 1299fa9e4066Sahrens 1300fa9e4066Sahrens if (initial_offset > *offset) 1301fa9e4066Sahrens return (ESRCH); 1302fa9e4066Sahrens 1303fa9e4066Sahrens return (error); 1304fa9e4066Sahrens } 1305