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 /* 223b83abddSahrens * Copyright 2006 Sun Microsystems, Inc. All rights reserved. 23fa9e4066Sahrens * Use is subject to license terms. 24fa9e4066Sahrens */ 25fa9e4066Sahrens 26fa9e4066Sahrens #pragma ident "%Z%%M% %I% %E% SMI" 27fa9e4066Sahrens 28fa9e4066Sahrens #include <sys/zfs_context.h> 29fa9e4066Sahrens #include <sys/dbuf.h> 30fa9e4066Sahrens #include <sys/dnode.h> 31fa9e4066Sahrens #include <sys/dmu.h> 32fa9e4066Sahrens #include <sys/dmu_impl.h> 33fa9e4066Sahrens #include <sys/dmu_tx.h> 34fa9e4066Sahrens #include <sys/dmu_objset.h> 35fa9e4066Sahrens #include <sys/dsl_dir.h> 36fa9e4066Sahrens #include <sys/dsl_dataset.h> 37fa9e4066Sahrens #include <sys/spa.h> 38fa9e4066Sahrens #include <sys/zio.h> 39fa9e4066Sahrens #include <sys/dmu_zfetch.h> 40fa9e4066Sahrens 41fa9e4066Sahrens static int free_range_compar(const void *node1, const void *node2); 42fa9e4066Sahrens 43fa9e4066Sahrens static kmem_cache_t *dnode_cache; 44fa9e4066Sahrens 45fa9e4066Sahrens static dnode_phys_t dnode_phys_zero; 46fa9e4066Sahrens 47fa9e4066Sahrens int zfs_default_bs = SPA_MINBLOCKSHIFT; 48fa9e4066Sahrens int zfs_default_ibs = DN_MAX_INDBLKSHIFT; 49fa9e4066Sahrens 50fa9e4066Sahrens /* ARGSUSED */ 51fa9e4066Sahrens static int 52fa9e4066Sahrens dnode_cons(void *arg, void *unused, int kmflag) 53fa9e4066Sahrens { 54fa9e4066Sahrens int i; 55fa9e4066Sahrens dnode_t *dn = arg; 56fa9e4066Sahrens bzero(dn, sizeof (dnode_t)); 57fa9e4066Sahrens 58fa9e4066Sahrens rw_init(&dn->dn_struct_rwlock, NULL, RW_DEFAULT, NULL); 59fa9e4066Sahrens mutex_init(&dn->dn_mtx, NULL, MUTEX_DEFAULT, NULL); 60fa9e4066Sahrens mutex_init(&dn->dn_dbufs_mtx, NULL, MUTEX_DEFAULT, NULL); 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)); 68fa9e4066Sahrens list_create(&dn->dn_dirty_dbufs[i], 69fa9e4066Sahrens sizeof (dmu_buf_impl_t), 70fa9e4066Sahrens offsetof(dmu_buf_impl_t, db_dirty_node[i])); 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); 89fa9e4066Sahrens refcount_destroy(&dn->dn_holds); 90fa9e4066Sahrens refcount_destroy(&dn->dn_tx_holds); 91fa9e4066Sahrens 92fa9e4066Sahrens for (i = 0; i < TXG_SIZE; i++) { 93fa9e4066Sahrens avl_destroy(&dn->dn_ranges[i]); 94fa9e4066Sahrens list_destroy(&dn->dn_dirty_dbufs[i]); 95fa9e4066Sahrens } 96fa9e4066Sahrens 97fa9e4066Sahrens list_destroy(&dn->dn_dbufs); 98fa9e4066Sahrens } 99fa9e4066Sahrens 100fa9e4066Sahrens void 101fa9e4066Sahrens dnode_init(void) 102fa9e4066Sahrens { 103fa9e4066Sahrens dnode_cache = kmem_cache_create("dnode_t", 104fa9e4066Sahrens sizeof (dnode_t), 105fa9e4066Sahrens 0, dnode_cons, dnode_dest, NULL, NULL, NULL, 0); 106fa9e4066Sahrens } 107fa9e4066Sahrens 108fa9e4066Sahrens void 109fa9e4066Sahrens dnode_fini(void) 110fa9e4066Sahrens { 111fa9e4066Sahrens kmem_cache_destroy(dnode_cache); 112fa9e4066Sahrens } 113fa9e4066Sahrens 114fa9e4066Sahrens 1159c9dc39aSek #ifdef ZFS_DEBUG 116fa9e4066Sahrens void 117fa9e4066Sahrens dnode_verify(dnode_t *dn) 118fa9e4066Sahrens { 119fa9e4066Sahrens int drop_struct_lock = FALSE; 120fa9e4066Sahrens 121fa9e4066Sahrens ASSERT(dn->dn_phys); 122fa9e4066Sahrens ASSERT(dn->dn_objset); 123fa9e4066Sahrens 124fa9e4066Sahrens ASSERT(dn->dn_phys->dn_type < DMU_OT_NUMTYPES); 125fa9e4066Sahrens 126fa9e4066Sahrens if (!(zfs_flags & ZFS_DEBUG_DNODE_VERIFY)) 127fa9e4066Sahrens return; 128fa9e4066Sahrens 129fa9e4066Sahrens if (!RW_WRITE_HELD(&dn->dn_struct_rwlock)) { 130fa9e4066Sahrens rw_enter(&dn->dn_struct_rwlock, RW_READER); 131fa9e4066Sahrens drop_struct_lock = TRUE; 132fa9e4066Sahrens } 133fa9e4066Sahrens if (dn->dn_phys->dn_type != DMU_OT_NONE || dn->dn_allocated_txg != 0) { 134fa9e4066Sahrens int i; 135fa9e4066Sahrens ASSERT3U(dn->dn_indblkshift, >=, 0); 136fa9e4066Sahrens ASSERT3U(dn->dn_indblkshift, <=, SPA_MAXBLOCKSHIFT); 137fa9e4066Sahrens if (dn->dn_datablkshift) { 138fa9e4066Sahrens ASSERT3U(dn->dn_datablkshift, >=, SPA_MINBLOCKSHIFT); 139fa9e4066Sahrens ASSERT3U(dn->dn_datablkshift, <=, SPA_MAXBLOCKSHIFT); 140fa9e4066Sahrens ASSERT3U(1<<dn->dn_datablkshift, ==, dn->dn_datablksz); 141fa9e4066Sahrens } 142fa9e4066Sahrens ASSERT3U(dn->dn_nlevels, <=, 30); 143fa9e4066Sahrens ASSERT3U(dn->dn_type, <=, DMU_OT_NUMTYPES); 144fa9e4066Sahrens ASSERT3U(dn->dn_nblkptr, >=, 1); 145fa9e4066Sahrens ASSERT3U(dn->dn_nblkptr, <=, DN_MAX_NBLKPTR); 146fa9e4066Sahrens ASSERT3U(dn->dn_bonuslen, <=, DN_MAX_BONUSLEN); 147fa9e4066Sahrens ASSERT3U(dn->dn_datablksz, ==, 148fa9e4066Sahrens dn->dn_datablkszsec << SPA_MINBLOCKSHIFT); 149fa9e4066Sahrens ASSERT3U(ISP2(dn->dn_datablksz), ==, dn->dn_datablkshift != 0); 150fa9e4066Sahrens ASSERT3U((dn->dn_nblkptr - 1) * sizeof (blkptr_t) + 151fa9e4066Sahrens dn->dn_bonuslen, <=, DN_MAX_BONUSLEN); 152fa9e4066Sahrens for (i = 0; i < TXG_SIZE; i++) { 153fa9e4066Sahrens ASSERT3U(dn->dn_next_nlevels[i], <=, dn->dn_nlevels); 154fa9e4066Sahrens } 155fa9e4066Sahrens } 156fa9e4066Sahrens if (dn->dn_phys->dn_type != DMU_OT_NONE) 157fa9e4066Sahrens ASSERT3U(dn->dn_phys->dn_nlevels, <=, dn->dn_nlevels); 158ea8dc4b6Seschrock ASSERT(dn->dn_object == DMU_META_DNODE_OBJECT || dn->dn_dbuf != NULL); 159fa9e4066Sahrens if (dn->dn_dbuf != NULL) { 160fa9e4066Sahrens ASSERT3P(dn->dn_phys, ==, 161fa9e4066Sahrens (dnode_phys_t *)dn->dn_dbuf->db.db_data + 162fa9e4066Sahrens (dn->dn_object % (dn->dn_dbuf->db.db_size >> DNODE_SHIFT))); 163fa9e4066Sahrens } 164fa9e4066Sahrens if (drop_struct_lock) 165fa9e4066Sahrens rw_exit(&dn->dn_struct_rwlock); 166fa9e4066Sahrens } 1679c9dc39aSek #endif 168fa9e4066Sahrens 169fa9e4066Sahrens void 170fa9e4066Sahrens dnode_byteswap(dnode_phys_t *dnp) 171fa9e4066Sahrens { 172fa9e4066Sahrens uint64_t *buf64 = (void*)&dnp->dn_blkptr; 173fa9e4066Sahrens int i; 174fa9e4066Sahrens 175fa9e4066Sahrens if (dnp->dn_type == DMU_OT_NONE) { 176fa9e4066Sahrens bzero(dnp, sizeof (dnode_phys_t)); 177fa9e4066Sahrens return; 178fa9e4066Sahrens } 179fa9e4066Sahrens 180fa9e4066Sahrens dnp->dn_datablkszsec = BSWAP_16(dnp->dn_datablkszsec); 181fa9e4066Sahrens dnp->dn_bonuslen = BSWAP_16(dnp->dn_bonuslen); 182fa9e4066Sahrens dnp->dn_maxblkid = BSWAP_64(dnp->dn_maxblkid); 18399653d4eSeschrock dnp->dn_used = BSWAP_64(dnp->dn_used); 184fa9e4066Sahrens 185fa9e4066Sahrens /* 186fa9e4066Sahrens * dn_nblkptr is only one byte, so it's OK to read it in either 187fa9e4066Sahrens * byte order. We can't read dn_bouslen. 188fa9e4066Sahrens */ 189fa9e4066Sahrens ASSERT(dnp->dn_indblkshift <= SPA_MAXBLOCKSHIFT); 190fa9e4066Sahrens ASSERT(dnp->dn_nblkptr <= DN_MAX_NBLKPTR); 191fa9e4066Sahrens for (i = 0; i < dnp->dn_nblkptr * sizeof (blkptr_t)/8; i++) 192fa9e4066Sahrens buf64[i] = BSWAP_64(buf64[i]); 193fa9e4066Sahrens 194fa9e4066Sahrens /* 195fa9e4066Sahrens * OK to check dn_bonuslen for zero, because it won't matter if 196fa9e4066Sahrens * we have the wrong byte order. This is necessary because the 197fa9e4066Sahrens * dnode dnode is smaller than a regular dnode. 198fa9e4066Sahrens */ 199fa9e4066Sahrens if (dnp->dn_bonuslen != 0) { 200fa9e4066Sahrens /* 201fa9e4066Sahrens * Note that the bonus length calculated here may be 202fa9e4066Sahrens * longer than the actual bonus buffer. This is because 203fa9e4066Sahrens * we always put the bonus buffer after the last block 204fa9e4066Sahrens * pointer (instead of packing it against the end of the 205fa9e4066Sahrens * dnode buffer). 206fa9e4066Sahrens */ 207fa9e4066Sahrens int off = (dnp->dn_nblkptr-1) * sizeof (blkptr_t); 208fa9e4066Sahrens size_t len = DN_MAX_BONUSLEN - off; 209fa9e4066Sahrens dmu_ot[dnp->dn_bonustype].ot_byteswap(dnp->dn_bonus + off, len); 210fa9e4066Sahrens } 211fa9e4066Sahrens } 212fa9e4066Sahrens 213fa9e4066Sahrens void 214fa9e4066Sahrens dnode_buf_byteswap(void *vbuf, size_t size) 215fa9e4066Sahrens { 216fa9e4066Sahrens dnode_phys_t *buf = vbuf; 217fa9e4066Sahrens int i; 218fa9e4066Sahrens 219fa9e4066Sahrens ASSERT3U(sizeof (dnode_phys_t), ==, (1<<DNODE_SHIFT)); 220fa9e4066Sahrens ASSERT((size & (sizeof (dnode_phys_t)-1)) == 0); 221fa9e4066Sahrens 222fa9e4066Sahrens size >>= DNODE_SHIFT; 223fa9e4066Sahrens for (i = 0; i < size; i++) { 224fa9e4066Sahrens dnode_byteswap(buf); 225fa9e4066Sahrens buf++; 226fa9e4066Sahrens } 227fa9e4066Sahrens } 228fa9e4066Sahrens 229fa9e4066Sahrens static int 230fa9e4066Sahrens free_range_compar(const void *node1, const void *node2) 231fa9e4066Sahrens { 232fa9e4066Sahrens const free_range_t *rp1 = node1; 233fa9e4066Sahrens const free_range_t *rp2 = node2; 234fa9e4066Sahrens 235fa9e4066Sahrens if (rp1->fr_blkid < rp2->fr_blkid) 236fa9e4066Sahrens return (-1); 237fa9e4066Sahrens else if (rp1->fr_blkid > rp2->fr_blkid) 238fa9e4066Sahrens return (1); 239fa9e4066Sahrens else return (0); 240fa9e4066Sahrens } 241fa9e4066Sahrens 242fa9e4066Sahrens static void 243fa9e4066Sahrens dnode_setdblksz(dnode_t *dn, int size) 244fa9e4066Sahrens { 245fa9e4066Sahrens ASSERT3U(P2PHASE(size, SPA_MINBLOCKSIZE), ==, 0); 246fa9e4066Sahrens ASSERT3U(size, <=, SPA_MAXBLOCKSIZE); 247fa9e4066Sahrens ASSERT3U(size, >=, SPA_MINBLOCKSIZE); 248fa9e4066Sahrens ASSERT3U(size >> SPA_MINBLOCKSHIFT, <, 249fa9e4066Sahrens 1<<(sizeof (dn->dn_phys->dn_datablkszsec) * 8)); 250fa9e4066Sahrens dn->dn_datablksz = size; 251fa9e4066Sahrens dn->dn_datablkszsec = size >> SPA_MINBLOCKSHIFT; 252fa9e4066Sahrens dn->dn_datablkshift = ISP2(size) ? highbit(size - 1) : 0; 253fa9e4066Sahrens } 254fa9e4066Sahrens 255fa9e4066Sahrens static dnode_t * 256fa9e4066Sahrens dnode_create(objset_impl_t *os, dnode_phys_t *dnp, dmu_buf_impl_t *db, 257fa9e4066Sahrens uint64_t object) 258fa9e4066Sahrens { 259fa9e4066Sahrens dnode_t *dn = kmem_cache_alloc(dnode_cache, KM_SLEEP); 260fa9e4066Sahrens (void) dnode_cons(dn, NULL, 0); /* XXX */ 261fa9e4066Sahrens 262fa9e4066Sahrens dn->dn_objset = os; 263fa9e4066Sahrens dn->dn_object = object; 264fa9e4066Sahrens dn->dn_dbuf = db; 265fa9e4066Sahrens dn->dn_phys = dnp; 266fa9e4066Sahrens 267fa9e4066Sahrens if (dnp->dn_datablkszsec) 268fa9e4066Sahrens dnode_setdblksz(dn, dnp->dn_datablkszsec << SPA_MINBLOCKSHIFT); 269fa9e4066Sahrens dn->dn_indblkshift = dnp->dn_indblkshift; 270fa9e4066Sahrens dn->dn_nlevels = dnp->dn_nlevels; 271fa9e4066Sahrens dn->dn_type = dnp->dn_type; 272fa9e4066Sahrens dn->dn_nblkptr = dnp->dn_nblkptr; 273fa9e4066Sahrens dn->dn_checksum = dnp->dn_checksum; 274fa9e4066Sahrens dn->dn_compress = dnp->dn_compress; 275fa9e4066Sahrens dn->dn_bonustype = dnp->dn_bonustype; 276fa9e4066Sahrens dn->dn_bonuslen = dnp->dn_bonuslen; 277fa9e4066Sahrens dn->dn_maxblkid = dnp->dn_maxblkid; 278fa9e4066Sahrens 279fa9e4066Sahrens dmu_zfetch_init(&dn->dn_zfetch, dn); 280fa9e4066Sahrens 281fa9e4066Sahrens ASSERT(dn->dn_phys->dn_type < DMU_OT_NUMTYPES); 282fa9e4066Sahrens mutex_enter(&os->os_lock); 283fa9e4066Sahrens list_insert_head(&os->os_dnodes, dn); 284fa9e4066Sahrens mutex_exit(&os->os_lock); 285fa9e4066Sahrens 286fa9e4066Sahrens return (dn); 287fa9e4066Sahrens } 288fa9e4066Sahrens 289fa9e4066Sahrens static void 290fa9e4066Sahrens dnode_destroy(dnode_t *dn) 291fa9e4066Sahrens { 292fa9e4066Sahrens objset_impl_t *os = dn->dn_objset; 293fa9e4066Sahrens 294a2eea2e1Sahrens #ifdef ZFS_DEBUG 295a2eea2e1Sahrens int i; 296a2eea2e1Sahrens 297a2eea2e1Sahrens for (i = 0; i < TXG_SIZE; i++) { 298a2eea2e1Sahrens ASSERT(!list_link_active(&dn->dn_dirty_link[i])); 299a2eea2e1Sahrens ASSERT(NULL == list_head(&dn->dn_dirty_dbufs[i])); 300a2eea2e1Sahrens ASSERT(0 == avl_numnodes(&dn->dn_ranges[i])); 301a2eea2e1Sahrens } 302a2eea2e1Sahrens ASSERT(NULL == list_head(&dn->dn_dbufs)); 303a2eea2e1Sahrens #endif 304a2eea2e1Sahrens 305fa9e4066Sahrens mutex_enter(&os->os_lock); 306fa9e4066Sahrens list_remove(&os->os_dnodes, dn); 307fa9e4066Sahrens mutex_exit(&os->os_lock); 308fa9e4066Sahrens 309fa9e4066Sahrens if (dn->dn_dirtyctx_firstset) { 310fa9e4066Sahrens kmem_free(dn->dn_dirtyctx_firstset, 1); 311fa9e4066Sahrens dn->dn_dirtyctx_firstset = NULL; 312fa9e4066Sahrens } 313fa9e4066Sahrens dmu_zfetch_rele(&dn->dn_zfetch); 314ea8dc4b6Seschrock if (dn->dn_bonus) { 315ea8dc4b6Seschrock mutex_enter(&dn->dn_bonus->db_mtx); 316ea8dc4b6Seschrock dbuf_evict(dn->dn_bonus); 317ea8dc4b6Seschrock dn->dn_bonus = NULL; 318ea8dc4b6Seschrock } 319fa9e4066Sahrens kmem_cache_free(dnode_cache, dn); 320fa9e4066Sahrens } 321fa9e4066Sahrens 322fa9e4066Sahrens void 323fa9e4066Sahrens dnode_allocate(dnode_t *dn, dmu_object_type_t ot, int blocksize, int ibs, 324f676ed34Sahrens dmu_object_type_t bonustype, int bonuslen, dmu_tx_t *tx) 325fa9e4066Sahrens { 326fa9e4066Sahrens int i; 327fa9e4066Sahrens 328fa9e4066Sahrens if (blocksize == 0) 329fa9e4066Sahrens blocksize = 1 << zfs_default_bs; 3303b83abddSahrens else if (blocksize > SPA_MAXBLOCKSIZE) 3313b83abddSahrens blocksize = SPA_MAXBLOCKSIZE; 3323b83abddSahrens else 3333b83abddSahrens blocksize = P2ROUNDUP(blocksize, SPA_MINBLOCKSIZE); 334fa9e4066Sahrens 335fa9e4066Sahrens if (ibs == 0) 336fa9e4066Sahrens ibs = zfs_default_ibs; 337fa9e4066Sahrens 338fa9e4066Sahrens ibs = MIN(MAX(ibs, DN_MIN_INDBLKSHIFT), DN_MAX_INDBLKSHIFT); 339fa9e4066Sahrens 340fa9e4066Sahrens dprintf("os=%p obj=%llu txg=%llu blocksize=%d ibs=%d\n", dn->dn_objset, 341fa9e4066Sahrens dn->dn_object, tx->tx_txg, blocksize, ibs); 342fa9e4066Sahrens 343fa9e4066Sahrens ASSERT(dn->dn_type == DMU_OT_NONE); 344fa9e4066Sahrens ASSERT(bcmp(dn->dn_phys, &dnode_phys_zero, sizeof (dnode_phys_t)) == 0); 345fa9e4066Sahrens ASSERT(dn->dn_phys->dn_type == DMU_OT_NONE); 346fa9e4066Sahrens ASSERT(ot != DMU_OT_NONE); 347fa9e4066Sahrens ASSERT3U(ot, <, DMU_OT_NUMTYPES); 348fa9e4066Sahrens ASSERT((bonustype == DMU_OT_NONE && bonuslen == 0) || 349fa9e4066Sahrens (bonustype != DMU_OT_NONE && bonuslen != 0)); 350fa9e4066Sahrens ASSERT3U(bonustype, <, DMU_OT_NUMTYPES); 351fa9e4066Sahrens ASSERT3U(bonuslen, <=, DN_MAX_BONUSLEN); 352fa9e4066Sahrens ASSERT(dn->dn_type == DMU_OT_NONE); 353fa9e4066Sahrens ASSERT3U(dn->dn_maxblkid, ==, 0); 354fa9e4066Sahrens ASSERT3U(dn->dn_allocated_txg, ==, 0); 355fa9e4066Sahrens ASSERT3U(dn->dn_assigned_txg, ==, 0); 356fa9e4066Sahrens ASSERT(refcount_is_zero(&dn->dn_tx_holds)); 357fa9e4066Sahrens ASSERT3U(refcount_count(&dn->dn_holds), <=, 1); 358fa9e4066Sahrens ASSERT3P(list_head(&dn->dn_dbufs), ==, NULL); 359fa9e4066Sahrens 360fa9e4066Sahrens for (i = 0; i < TXG_SIZE; i++) { 361fa9e4066Sahrens ASSERT3U(dn->dn_next_nlevels[i], ==, 0); 362fa9e4066Sahrens ASSERT3U(dn->dn_next_indblkshift[i], ==, 0); 363c543ec06Sahrens ASSERT3U(dn->dn_next_blksz[i], ==, 0); 364c543ec06Sahrens ASSERT(!list_link_active(&dn->dn_dirty_link[i])); 365fa9e4066Sahrens ASSERT3P(list_head(&dn->dn_dirty_dbufs[i]), ==, NULL); 366fa9e4066Sahrens ASSERT3U(avl_numnodes(&dn->dn_ranges[i]), ==, 0); 367fa9e4066Sahrens } 368fa9e4066Sahrens 369fa9e4066Sahrens dn->dn_type = ot; 370fa9e4066Sahrens dnode_setdblksz(dn, blocksize); 371fa9e4066Sahrens dn->dn_indblkshift = ibs; 372fa9e4066Sahrens dn->dn_nlevels = 1; 373fa9e4066Sahrens dn->dn_nblkptr = 1 + ((DN_MAX_BONUSLEN - bonuslen) >> SPA_BLKPTRSHIFT); 374fa9e4066Sahrens dn->dn_bonustype = bonustype; 375fa9e4066Sahrens dn->dn_bonuslen = bonuslen; 376fa9e4066Sahrens dn->dn_checksum = ZIO_CHECKSUM_INHERIT; 377fa9e4066Sahrens dn->dn_compress = ZIO_COMPRESS_INHERIT; 378fa9e4066Sahrens dn->dn_dirtyctx = 0; 379fa9e4066Sahrens 380fa9e4066Sahrens dn->dn_free_txg = 0; 381fa9e4066Sahrens if (dn->dn_dirtyctx_firstset) { 382fa9e4066Sahrens kmem_free(dn->dn_dirtyctx_firstset, 1); 383fa9e4066Sahrens dn->dn_dirtyctx_firstset = NULL; 384fa9e4066Sahrens } 385fa9e4066Sahrens 386fa9e4066Sahrens dn->dn_allocated_txg = tx->tx_txg; 387f676ed34Sahrens 388fa9e4066Sahrens dnode_setdirty(dn, tx); 389f676ed34Sahrens dn->dn_next_indblkshift[tx->tx_txg & TXG_MASK] = ibs; 390f676ed34Sahrens dn->dn_next_blksz[tx->tx_txg & TXG_MASK] = dn->dn_datablksz; 391fa9e4066Sahrens } 392fa9e4066Sahrens 393fa9e4066Sahrens void 394fa9e4066Sahrens dnode_reallocate(dnode_t *dn, dmu_object_type_t ot, int blocksize, 395fa9e4066Sahrens dmu_object_type_t bonustype, int bonuslen, dmu_tx_t *tx) 396fa9e4066Sahrens { 397c543ec06Sahrens int i; 398*432f72fdSahrens dmu_buf_impl_t *db = NULL; 399c543ec06Sahrens 400fa9e4066Sahrens ASSERT3U(blocksize, >=, SPA_MINBLOCKSIZE); 401fa9e4066Sahrens ASSERT3U(blocksize, <=, SPA_MAXBLOCKSIZE); 402fa9e4066Sahrens ASSERT3U(blocksize % SPA_MINBLOCKSIZE, ==, 0); 403ea8dc4b6Seschrock ASSERT(dn->dn_object != DMU_META_DNODE_OBJECT || dmu_tx_private_ok(tx)); 404fa9e4066Sahrens ASSERT(tx->tx_txg != 0); 405fa9e4066Sahrens ASSERT((bonustype == DMU_OT_NONE && bonuslen == 0) || 406fa9e4066Sahrens (bonustype != DMU_OT_NONE && bonuslen != 0)); 407fa9e4066Sahrens ASSERT3U(bonustype, <, DMU_OT_NUMTYPES); 408fa9e4066Sahrens ASSERT3U(bonuslen, <=, DN_MAX_BONUSLEN); 409c543ec06Sahrens 410c543ec06Sahrens for (i = 0; i < TXG_SIZE; i++) 411c543ec06Sahrens ASSERT(!list_link_active(&dn->dn_dirty_link[i])); 412fa9e4066Sahrens 413ea8dc4b6Seschrock /* clean up any unreferenced dbufs */ 414436b2950Sperrin (void) dnode_evict_dbufs(dn, 0); 415ea8dc4b6Seschrock ASSERT3P(list_head(&dn->dn_dbufs), ==, NULL); 416ea8dc4b6Seschrock 417fa9e4066Sahrens /* 418fa9e4066Sahrens * XXX I should really have a generation number to tell if we 419fa9e4066Sahrens * need to do this... 420fa9e4066Sahrens */ 421fa9e4066Sahrens if (blocksize != dn->dn_datablksz || 422fa9e4066Sahrens dn->dn_bonustype != bonustype || dn->dn_bonuslen != bonuslen) { 423fa9e4066Sahrens /* free all old data */ 424fa9e4066Sahrens dnode_free_range(dn, 0, -1ULL, tx); 425fa9e4066Sahrens } 426fa9e4066Sahrens 427fa9e4066Sahrens /* change blocksize */ 428fa9e4066Sahrens rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 429*432f72fdSahrens if (blocksize != dn->dn_datablksz && 430*432f72fdSahrens (!BP_IS_HOLE(&dn->dn_phys->dn_blkptr[0]) || 431*432f72fdSahrens list_head(&dn->dn_dbufs) != NULL)) { 432*432f72fdSahrens db = dbuf_hold(dn, 0, FTAG); 433*432f72fdSahrens dbuf_new_size(db, blocksize, tx); 434*432f72fdSahrens } 435fa9e4066Sahrens dnode_setdblksz(dn, blocksize); 436fa9e4066Sahrens dnode_setdirty(dn, tx); 437c543ec06Sahrens dn->dn_next_blksz[tx->tx_txg&TXG_MASK] = blocksize; 438fa9e4066Sahrens rw_exit(&dn->dn_struct_rwlock); 439*432f72fdSahrens if (db) { 440*432f72fdSahrens dbuf_rele(db, FTAG); 441*432f72fdSahrens db = NULL; 442*432f72fdSahrens } 443fa9e4066Sahrens 444fa9e4066Sahrens /* change type */ 445fa9e4066Sahrens dn->dn_type = ot; 446fa9e4066Sahrens 447fa9e4066Sahrens if (dn->dn_bonuslen != bonuslen) { 448fa9e4066Sahrens /* change bonus size */ 449fa9e4066Sahrens if (bonuslen == 0) 450fa9e4066Sahrens bonuslen = 1; /* XXX */ 451ea8dc4b6Seschrock rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 452ea8dc4b6Seschrock if (dn->dn_bonus == NULL) 453ea8dc4b6Seschrock dn->dn_bonus = dbuf_create_bonus(dn); 454ea8dc4b6Seschrock db = dn->dn_bonus; 455ea8dc4b6Seschrock rw_exit(&dn->dn_struct_rwlock); 456ea8dc4b6Seschrock if (refcount_add(&db->db_holds, FTAG) == 1) 457ea8dc4b6Seschrock dnode_add_ref(dn, db); 45877ed8509Smaybee VERIFY(0 == dbuf_read(db, NULL, DB_RF_MUST_SUCCEED)); 459fa9e4066Sahrens mutex_enter(&db->db_mtx); 460fa9e4066Sahrens ASSERT3U(db->db.db_size, ==, dn->dn_bonuslen); 461fa9e4066Sahrens ASSERT(db->db.db_data != NULL); 462fa9e4066Sahrens db->db.db_size = bonuslen; 463fa9e4066Sahrens mutex_exit(&db->db_mtx); 464fa9e4066Sahrens dbuf_dirty(db, tx); 465fa9e4066Sahrens } 466fa9e4066Sahrens 467fa9e4066Sahrens /* change bonus size and type */ 468fa9e4066Sahrens mutex_enter(&dn->dn_mtx); 469fa9e4066Sahrens dn->dn_bonustype = bonustype; 470fa9e4066Sahrens dn->dn_bonuslen = bonuslen; 471fa9e4066Sahrens dn->dn_nblkptr = 1 + ((DN_MAX_BONUSLEN - bonuslen) >> SPA_BLKPTRSHIFT); 472fa9e4066Sahrens dn->dn_checksum = ZIO_CHECKSUM_INHERIT; 473fa9e4066Sahrens dn->dn_compress = ZIO_COMPRESS_INHERIT; 474fa9e4066Sahrens ASSERT3U(dn->dn_nblkptr, <=, DN_MAX_NBLKPTR); 475fa9e4066Sahrens 476*432f72fdSahrens /* 477*432f72fdSahrens * NB: we have to do the dbuf_rele after we've changed the 478*432f72fdSahrens * dn_bonuslen, for the sake of dbuf_verify(). 479*432f72fdSahrens */ 480*432f72fdSahrens if (db) 481*432f72fdSahrens dbuf_rele(db, FTAG); 482*432f72fdSahrens 483fa9e4066Sahrens dn->dn_allocated_txg = tx->tx_txg; 484fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 485fa9e4066Sahrens } 486fa9e4066Sahrens 487fa9e4066Sahrens void 488fa9e4066Sahrens dnode_special_close(dnode_t *dn) 489fa9e4066Sahrens { 490ea8dc4b6Seschrock /* 491ea8dc4b6Seschrock * Wait for final references to the dnode to clear. This can 492ea8dc4b6Seschrock * only happen if the arc is asyncronously evicting state that 493ea8dc4b6Seschrock * has a hold on this dnode while we are trying to evict this 494ea8dc4b6Seschrock * dnode. 495ea8dc4b6Seschrock */ 496ea8dc4b6Seschrock while (refcount_count(&dn->dn_holds) > 0) 497ea8dc4b6Seschrock delay(1); 498fa9e4066Sahrens dnode_destroy(dn); 499fa9e4066Sahrens } 500fa9e4066Sahrens 501fa9e4066Sahrens dnode_t * 502fa9e4066Sahrens dnode_special_open(objset_impl_t *os, dnode_phys_t *dnp, uint64_t object) 503fa9e4066Sahrens { 504fa9e4066Sahrens dnode_t *dn = dnode_create(os, dnp, NULL, object); 5059c9dc39aSek DNODE_VERIFY(dn); 506fa9e4066Sahrens return (dn); 507fa9e4066Sahrens } 508fa9e4066Sahrens 509fa9e4066Sahrens static void 510fa9e4066Sahrens dnode_buf_pageout(dmu_buf_t *db, void *arg) 511fa9e4066Sahrens { 512fa9e4066Sahrens dnode_t **children_dnodes = arg; 513fa9e4066Sahrens int i; 514fa9e4066Sahrens int epb = db->db_size >> DNODE_SHIFT; 515fa9e4066Sahrens 516fa9e4066Sahrens for (i = 0; i < epb; i++) { 517fa9e4066Sahrens dnode_t *dn = children_dnodes[i]; 518fa9e4066Sahrens int n; 519fa9e4066Sahrens 520fa9e4066Sahrens if (dn == NULL) 521fa9e4066Sahrens continue; 522fa9e4066Sahrens #ifdef ZFS_DEBUG 523fa9e4066Sahrens /* 524fa9e4066Sahrens * If there are holds on this dnode, then there should 525fa9e4066Sahrens * be holds on the dnode's containing dbuf as well; thus 526fa9e4066Sahrens * it wouldn't be eligable for eviction and this function 527fa9e4066Sahrens * would not have been called. 528fa9e4066Sahrens */ 529fa9e4066Sahrens ASSERT(refcount_is_zero(&dn->dn_holds)); 530fa9e4066Sahrens ASSERT(list_head(&dn->dn_dbufs) == NULL); 531fa9e4066Sahrens ASSERT(refcount_is_zero(&dn->dn_tx_holds)); 532fa9e4066Sahrens 533fa9e4066Sahrens for (n = 0; n < TXG_SIZE; n++) 534c543ec06Sahrens ASSERT(!list_link_active(&dn->dn_dirty_link[n])); 535fa9e4066Sahrens #endif 536fa9e4066Sahrens children_dnodes[i] = NULL; 537fa9e4066Sahrens dnode_destroy(dn); 538fa9e4066Sahrens } 539fa9e4066Sahrens kmem_free(children_dnodes, epb * sizeof (dnode_t *)); 540fa9e4066Sahrens } 541fa9e4066Sahrens 542fa9e4066Sahrens /* 543ea8dc4b6Seschrock * errors: 544ea8dc4b6Seschrock * EINVAL - invalid object number. 545ea8dc4b6Seschrock * EIO - i/o error. 546ea8dc4b6Seschrock * succeeds even for free dnodes. 547fa9e4066Sahrens */ 548ea8dc4b6Seschrock int 549ea8dc4b6Seschrock dnode_hold_impl(objset_impl_t *os, uint64_t object, int flag, 550ea8dc4b6Seschrock void *tag, dnode_t **dnp) 551fa9e4066Sahrens { 552ea8dc4b6Seschrock int epb, idx, err; 553fa9e4066Sahrens int drop_struct_lock = FALSE; 554ea8dc4b6Seschrock int type; 555fa9e4066Sahrens uint64_t blk; 556fa9e4066Sahrens dnode_t *mdn, *dn; 557fa9e4066Sahrens dmu_buf_impl_t *db; 558fa9e4066Sahrens dnode_t **children_dnodes; 559fa9e4066Sahrens 560fa9e4066Sahrens if (object == 0 || object >= DN_MAX_OBJECT) 561ea8dc4b6Seschrock return (EINVAL); 562fa9e4066Sahrens 563fa9e4066Sahrens mdn = os->os_meta_dnode; 564fa9e4066Sahrens 5659c9dc39aSek DNODE_VERIFY(mdn); 566fa9e4066Sahrens 567fa9e4066Sahrens if (!RW_WRITE_HELD(&mdn->dn_struct_rwlock)) { 568fa9e4066Sahrens rw_enter(&mdn->dn_struct_rwlock, RW_READER); 569fa9e4066Sahrens drop_struct_lock = TRUE; 570fa9e4066Sahrens } 571fa9e4066Sahrens 572fa9e4066Sahrens blk = dbuf_whichblock(mdn, object * sizeof (dnode_phys_t)); 573fa9e4066Sahrens 574ea8dc4b6Seschrock db = dbuf_hold(mdn, blk, FTAG); 575fa9e4066Sahrens if (drop_struct_lock) 576fa9e4066Sahrens rw_exit(&mdn->dn_struct_rwlock); 577ea8dc4b6Seschrock if (db == NULL) 578ea8dc4b6Seschrock return (EIO); 579ea8dc4b6Seschrock err = dbuf_read(db, NULL, DB_RF_CANFAIL); 580ea8dc4b6Seschrock if (err) { 581ea8dc4b6Seschrock dbuf_rele(db, FTAG); 582ea8dc4b6Seschrock return (err); 583ea8dc4b6Seschrock } 584fa9e4066Sahrens 585fa9e4066Sahrens ASSERT3U(db->db.db_size, >=, 1<<DNODE_SHIFT); 586fa9e4066Sahrens epb = db->db.db_size >> DNODE_SHIFT; 587fa9e4066Sahrens 588fa9e4066Sahrens idx = object & (epb-1); 589fa9e4066Sahrens 590fa9e4066Sahrens children_dnodes = dmu_buf_get_user(&db->db); 591fa9e4066Sahrens if (children_dnodes == NULL) { 592fa9e4066Sahrens dnode_t **winner; 593fa9e4066Sahrens children_dnodes = kmem_zalloc(epb * sizeof (dnode_t *), 594fa9e4066Sahrens KM_SLEEP); 595fa9e4066Sahrens if (winner = dmu_buf_set_user(&db->db, children_dnodes, NULL, 596fa9e4066Sahrens dnode_buf_pageout)) { 597fa9e4066Sahrens kmem_free(children_dnodes, epb * sizeof (dnode_t *)); 598fa9e4066Sahrens children_dnodes = winner; 599fa9e4066Sahrens } 600fa9e4066Sahrens } 601fa9e4066Sahrens 602fa9e4066Sahrens if ((dn = children_dnodes[idx]) == NULL) { 603fa9e4066Sahrens dnode_t *winner; 604fa9e4066Sahrens dn = dnode_create(os, (dnode_phys_t *)db->db.db_data+idx, 605fa9e4066Sahrens db, object); 606fa9e4066Sahrens winner = atomic_cas_ptr(&children_dnodes[idx], NULL, dn); 607fa9e4066Sahrens if (winner != NULL) { 608fa9e4066Sahrens dnode_destroy(dn); 609fa9e4066Sahrens dn = winner; 610fa9e4066Sahrens } 611fa9e4066Sahrens } 612fa9e4066Sahrens 613fa9e4066Sahrens mutex_enter(&dn->dn_mtx); 614ea8dc4b6Seschrock type = dn->dn_type; 615fa9e4066Sahrens if (dn->dn_free_txg || 616ea8dc4b6Seschrock ((flag & DNODE_MUST_BE_ALLOCATED) && type == DMU_OT_NONE) || 617ea8dc4b6Seschrock ((flag & DNODE_MUST_BE_FREE) && type != DMU_OT_NONE)) { 618fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 619ea8dc4b6Seschrock dbuf_rele(db, FTAG); 620ea8dc4b6Seschrock return (type == DMU_OT_NONE ? ENOENT : EEXIST); 621fa9e4066Sahrens } 622fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 623fa9e4066Sahrens 624ea8dc4b6Seschrock if (refcount_add(&dn->dn_holds, tag) == 1) 625fa9e4066Sahrens dbuf_add_ref(db, dn); 626fa9e4066Sahrens 6279c9dc39aSek DNODE_VERIFY(dn); 628fa9e4066Sahrens ASSERT3P(dn->dn_dbuf, ==, db); 629fa9e4066Sahrens ASSERT3U(dn->dn_object, ==, object); 630ea8dc4b6Seschrock dbuf_rele(db, FTAG); 631fa9e4066Sahrens 632ea8dc4b6Seschrock *dnp = dn; 633ea8dc4b6Seschrock return (0); 634fa9e4066Sahrens } 635fa9e4066Sahrens 636fa9e4066Sahrens /* 637fa9e4066Sahrens * Return held dnode if the object is allocated, NULL if not. 638fa9e4066Sahrens */ 639ea8dc4b6Seschrock int 640ea8dc4b6Seschrock dnode_hold(objset_impl_t *os, uint64_t object, void *tag, dnode_t **dnp) 641fa9e4066Sahrens { 642ea8dc4b6Seschrock return (dnode_hold_impl(os, object, DNODE_MUST_BE_ALLOCATED, tag, dnp)); 643fa9e4066Sahrens } 644fa9e4066Sahrens 645fa9e4066Sahrens void 646ea8dc4b6Seschrock dnode_add_ref(dnode_t *dn, void *tag) 647fa9e4066Sahrens { 648fa9e4066Sahrens ASSERT(refcount_count(&dn->dn_holds) > 0); 649ea8dc4b6Seschrock (void) refcount_add(&dn->dn_holds, tag); 650fa9e4066Sahrens } 651fa9e4066Sahrens 652fa9e4066Sahrens void 653ea8dc4b6Seschrock dnode_rele(dnode_t *dn, void *tag) 654fa9e4066Sahrens { 655fa9e4066Sahrens uint64_t refs; 656fa9e4066Sahrens 657ea8dc4b6Seschrock refs = refcount_remove(&dn->dn_holds, tag); 658fa9e4066Sahrens /* NOTE: the DNODE_DNODE does not have a dn_dbuf */ 659fa9e4066Sahrens if (refs == 0 && dn->dn_dbuf) 660ea8dc4b6Seschrock dbuf_rele(dn->dn_dbuf, dn); 661fa9e4066Sahrens } 662fa9e4066Sahrens 663fa9e4066Sahrens void 664fa9e4066Sahrens dnode_setdirty(dnode_t *dn, dmu_tx_t *tx) 665fa9e4066Sahrens { 666fa9e4066Sahrens objset_impl_t *os = dn->dn_objset; 667fa9e4066Sahrens uint64_t txg = tx->tx_txg; 668fa9e4066Sahrens 669ea8dc4b6Seschrock if (dn->dn_object == DMU_META_DNODE_OBJECT) 670fa9e4066Sahrens return; 671fa9e4066Sahrens 6729c9dc39aSek DNODE_VERIFY(dn); 673fa9e4066Sahrens 674fa9e4066Sahrens #ifdef ZFS_DEBUG 675fa9e4066Sahrens mutex_enter(&dn->dn_mtx); 676fa9e4066Sahrens ASSERT(dn->dn_phys->dn_type || dn->dn_allocated_txg); 677fa9e4066Sahrens /* ASSERT(dn->dn_free_txg == 0 || dn->dn_free_txg >= txg); */ 678fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 679fa9e4066Sahrens #endif 680fa9e4066Sahrens 681fa9e4066Sahrens mutex_enter(&os->os_lock); 682fa9e4066Sahrens 683fa9e4066Sahrens /* 684fa9e4066Sahrens * If we are already marked dirty, we're done. 685fa9e4066Sahrens */ 686c543ec06Sahrens if (list_link_active(&dn->dn_dirty_link[txg & TXG_MASK])) { 687fa9e4066Sahrens mutex_exit(&os->os_lock); 688fa9e4066Sahrens return; 689fa9e4066Sahrens } 690fa9e4066Sahrens 691fa9e4066Sahrens ASSERT(!refcount_is_zero(&dn->dn_holds) || list_head(&dn->dn_dbufs)); 692fa9e4066Sahrens ASSERT(dn->dn_datablksz != 0); 693f676ed34Sahrens ASSERT3U(dn->dn_next_blksz[txg&TXG_MASK], ==, 0); 694fa9e4066Sahrens 695fa9e4066Sahrens dprintf_ds(os->os_dsl_dataset, "obj=%llu txg=%llu\n", 696fa9e4066Sahrens dn->dn_object, txg); 697fa9e4066Sahrens 698fa9e4066Sahrens if (dn->dn_free_txg > 0 && dn->dn_free_txg <= txg) { 699fa9e4066Sahrens list_insert_tail(&os->os_free_dnodes[txg&TXG_MASK], dn); 700fa9e4066Sahrens } else { 701fa9e4066Sahrens list_insert_tail(&os->os_dirty_dnodes[txg&TXG_MASK], dn); 702fa9e4066Sahrens } 703fa9e4066Sahrens 704fa9e4066Sahrens mutex_exit(&os->os_lock); 705fa9e4066Sahrens 706fa9e4066Sahrens /* 707fa9e4066Sahrens * The dnode maintains a hold on its containing dbuf as 708fa9e4066Sahrens * long as there are holds on it. Each instantiated child 709fa9e4066Sahrens * dbuf maintaines a hold on the dnode. When the last child 710fa9e4066Sahrens * drops its hold, the dnode will drop its hold on the 711fa9e4066Sahrens * containing dbuf. We add a "dirty hold" here so that the 712fa9e4066Sahrens * dnode will hang around after we finish processing its 713fa9e4066Sahrens * children. 714fa9e4066Sahrens */ 715ea8dc4b6Seschrock dnode_add_ref(dn, (void *)(uintptr_t)tx->tx_txg); 716fa9e4066Sahrens 717fa9e4066Sahrens dbuf_dirty(dn->dn_dbuf, tx); 718fa9e4066Sahrens 719fa9e4066Sahrens dsl_dataset_dirty(os->os_dsl_dataset, tx); 720fa9e4066Sahrens } 721fa9e4066Sahrens 722fa9e4066Sahrens void 723fa9e4066Sahrens dnode_free(dnode_t *dn, dmu_tx_t *tx) 724fa9e4066Sahrens { 725c543ec06Sahrens int txgoff = tx->tx_txg & TXG_MASK; 726c543ec06Sahrens 727fa9e4066Sahrens dprintf("dn=%p txg=%llu\n", dn, tx->tx_txg); 728fa9e4066Sahrens 729fa9e4066Sahrens /* we should be the only holder... hopefully */ 730fa9e4066Sahrens /* ASSERT3U(refcount_count(&dn->dn_holds), ==, 1); */ 731fa9e4066Sahrens 732fa9e4066Sahrens mutex_enter(&dn->dn_mtx); 733fa9e4066Sahrens if (dn->dn_type == DMU_OT_NONE || dn->dn_free_txg) { 734fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 735fa9e4066Sahrens return; 736fa9e4066Sahrens } 737fa9e4066Sahrens dn->dn_free_txg = tx->tx_txg; 738fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 739fa9e4066Sahrens 740fa9e4066Sahrens /* 741fa9e4066Sahrens * If the dnode is already dirty, it needs to be moved from 742fa9e4066Sahrens * the dirty list to the free list. 743fa9e4066Sahrens */ 744fa9e4066Sahrens mutex_enter(&dn->dn_objset->os_lock); 745c543ec06Sahrens if (list_link_active(&dn->dn_dirty_link[txgoff])) { 746c543ec06Sahrens list_remove(&dn->dn_objset->os_dirty_dnodes[txgoff], dn); 747c543ec06Sahrens list_insert_tail(&dn->dn_objset->os_free_dnodes[txgoff], dn); 748fa9e4066Sahrens mutex_exit(&dn->dn_objset->os_lock); 749fa9e4066Sahrens } else { 750fa9e4066Sahrens mutex_exit(&dn->dn_objset->os_lock); 751fa9e4066Sahrens dnode_setdirty(dn, tx); 752fa9e4066Sahrens } 753fa9e4066Sahrens } 754fa9e4066Sahrens 755fa9e4066Sahrens /* 756fa9e4066Sahrens * Try to change the block size for the indicated dnode. This can only 757fa9e4066Sahrens * succeed if there are no blocks allocated or dirty beyond first block 758fa9e4066Sahrens */ 759fa9e4066Sahrens int 760fa9e4066Sahrens dnode_set_blksz(dnode_t *dn, uint64_t size, int ibs, dmu_tx_t *tx) 761fa9e4066Sahrens { 762fa9e4066Sahrens dmu_buf_impl_t *db, *db_next; 763fa9e4066Sahrens int have_db0 = FALSE; 764fa9e4066Sahrens 765fa9e4066Sahrens if (size == 0) 766fa9e4066Sahrens size = SPA_MINBLOCKSIZE; 767fa9e4066Sahrens if (size > SPA_MAXBLOCKSIZE) 768fa9e4066Sahrens size = SPA_MAXBLOCKSIZE; 769fa9e4066Sahrens else 770fa9e4066Sahrens size = P2ROUNDUP(size, SPA_MINBLOCKSIZE); 771fa9e4066Sahrens 772b143e04bSahrens if (ibs == dn->dn_indblkshift) 773b143e04bSahrens ibs = 0; 774fa9e4066Sahrens 775b143e04bSahrens if (size >> SPA_MINBLOCKSHIFT == dn->dn_datablkszsec && ibs == 0) 776fa9e4066Sahrens return (0); 777fa9e4066Sahrens 778fa9e4066Sahrens rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 779fa9e4066Sahrens 780fa9e4066Sahrens /* Check for any allocated blocks beyond the first */ 781fa9e4066Sahrens if (dn->dn_phys->dn_maxblkid != 0) 782b143e04bSahrens goto fail; 783fa9e4066Sahrens 784fa9e4066Sahrens mutex_enter(&dn->dn_dbufs_mtx); 785fa9e4066Sahrens for (db = list_head(&dn->dn_dbufs); db; db = db_next) { 786fa9e4066Sahrens db_next = list_next(&dn->dn_dbufs, db); 787fa9e4066Sahrens 788fa9e4066Sahrens if (db->db_blkid == 0) { 789fa9e4066Sahrens have_db0 = TRUE; 790fa9e4066Sahrens } else if (db->db_blkid != DB_BONUS_BLKID) { 791fa9e4066Sahrens mutex_exit(&dn->dn_dbufs_mtx); 792b143e04bSahrens goto fail; 793fa9e4066Sahrens } 794fa9e4066Sahrens } 795fa9e4066Sahrens mutex_exit(&dn->dn_dbufs_mtx); 796fa9e4066Sahrens 797b143e04bSahrens if (ibs && dn->dn_nlevels != 1) 798b143e04bSahrens goto fail; 799b143e04bSahrens 800c543ec06Sahrens db = NULL; 801c543ec06Sahrens if (!BP_IS_HOLE(&dn->dn_phys->dn_blkptr[0]) || have_db0) { 802c543ec06Sahrens /* obtain the old block */ 803c543ec06Sahrens db = dbuf_hold(dn, 0, FTAG); 804c543ec06Sahrens dbuf_new_size(db, size, tx); 805fa9e4066Sahrens } 806fa9e4066Sahrens 807fa9e4066Sahrens dnode_setdblksz(dn, size); 808c543ec06Sahrens dnode_setdirty(dn, tx); 809c543ec06Sahrens dn->dn_next_blksz[tx->tx_txg&TXG_MASK] = size; 810b143e04bSahrens if (ibs) { 811b143e04bSahrens dn->dn_indblkshift = ibs; 812b143e04bSahrens dn->dn_next_indblkshift[tx->tx_txg&TXG_MASK] = ibs; 813b143e04bSahrens } 814c543ec06Sahrens 815c543ec06Sahrens if (db) 816c543ec06Sahrens dbuf_rele(db, FTAG); 817fa9e4066Sahrens 818fa9e4066Sahrens rw_exit(&dn->dn_struct_rwlock); 819b143e04bSahrens return (0); 820b143e04bSahrens 821b143e04bSahrens fail: 822b143e04bSahrens rw_exit(&dn->dn_struct_rwlock); 823b143e04bSahrens return (ENOTSUP); 824fa9e4066Sahrens } 825fa9e4066Sahrens 826fa9e4066Sahrens void 827fa9e4066Sahrens dnode_new_blkid(dnode_t *dn, uint64_t blkid, dmu_tx_t *tx) 828fa9e4066Sahrens { 829fa9e4066Sahrens uint64_t txgoff = tx->tx_txg & TXG_MASK; 830fa9e4066Sahrens int drop_struct_lock = FALSE; 831c543ec06Sahrens int epbs, new_nlevels; 832fa9e4066Sahrens uint64_t sz; 833fa9e4066Sahrens 834c543ec06Sahrens ASSERT(blkid != DB_BONUS_BLKID); 835fa9e4066Sahrens 836fa9e4066Sahrens if (!RW_WRITE_HELD(&dn->dn_struct_rwlock)) { 837fa9e4066Sahrens rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 838fa9e4066Sahrens drop_struct_lock = TRUE; 839fa9e4066Sahrens } 840fa9e4066Sahrens 841c543ec06Sahrens if (blkid <= dn->dn_maxblkid) 842c543ec06Sahrens goto out; 843c543ec06Sahrens 844c543ec06Sahrens dn->dn_maxblkid = blkid; 845fa9e4066Sahrens 846fa9e4066Sahrens /* 847c543ec06Sahrens * Compute the number of levels necessary to support the new maxblkid. 848fa9e4066Sahrens */ 849fa9e4066Sahrens new_nlevels = 1; 850fa9e4066Sahrens epbs = dn->dn_indblkshift - SPA_BLKPTRSHIFT; 851c543ec06Sahrens for (sz = dn->dn_nblkptr; 852c543ec06Sahrens sz <= blkid && sz >= dn->dn_nblkptr; sz <<= epbs) 853fa9e4066Sahrens new_nlevels++; 854fa9e4066Sahrens 855c543ec06Sahrens if (new_nlevels > dn->dn_nlevels) { 856c543ec06Sahrens int old_nlevels = dn->dn_nlevels; 857c543ec06Sahrens dmu_buf_impl_t *db; 858fa9e4066Sahrens 859fa9e4066Sahrens dn->dn_nlevels = new_nlevels; 860fa9e4066Sahrens 861c543ec06Sahrens ASSERT3U(new_nlevels, >, dn->dn_next_nlevels[txgoff]); 862c543ec06Sahrens dn->dn_next_nlevels[txgoff] = new_nlevels; 863c543ec06Sahrens 864c543ec06Sahrens /* Dirty the left indirects. */ 865c543ec06Sahrens db = dbuf_hold_level(dn, old_nlevels, 0, FTAG); 866fa9e4066Sahrens dbuf_dirty(db, tx); 867ea8dc4b6Seschrock dbuf_rele(db, FTAG); 868fa9e4066Sahrens 869fa9e4066Sahrens } 870fa9e4066Sahrens 871fa9e4066Sahrens out: 872fa9e4066Sahrens if (drop_struct_lock) 873fa9e4066Sahrens rw_exit(&dn->dn_struct_rwlock); 874fa9e4066Sahrens } 875fa9e4066Sahrens 876fa9e4066Sahrens void 877fa9e4066Sahrens dnode_clear_range(dnode_t *dn, uint64_t blkid, uint64_t nblks, dmu_tx_t *tx) 878fa9e4066Sahrens { 879fa9e4066Sahrens avl_tree_t *tree = &dn->dn_ranges[tx->tx_txg&TXG_MASK]; 880fa9e4066Sahrens avl_index_t where; 881fa9e4066Sahrens free_range_t *rp; 882fa9e4066Sahrens free_range_t rp_tofind; 883fa9e4066Sahrens uint64_t endblk = blkid + nblks; 884fa9e4066Sahrens 885fa9e4066Sahrens ASSERT(MUTEX_HELD(&dn->dn_mtx)); 886fa9e4066Sahrens ASSERT(nblks <= UINT64_MAX - blkid); /* no overflow */ 887fa9e4066Sahrens 888fa9e4066Sahrens dprintf_dnode(dn, "blkid=%llu nblks=%llu txg=%llu\n", 889fa9e4066Sahrens blkid, nblks, tx->tx_txg); 890fa9e4066Sahrens rp_tofind.fr_blkid = blkid; 891fa9e4066Sahrens rp = avl_find(tree, &rp_tofind, &where); 892fa9e4066Sahrens if (rp == NULL) 893fa9e4066Sahrens rp = avl_nearest(tree, where, AVL_BEFORE); 894fa9e4066Sahrens if (rp == NULL) 895fa9e4066Sahrens rp = avl_nearest(tree, where, AVL_AFTER); 896fa9e4066Sahrens 897fa9e4066Sahrens while (rp && (rp->fr_blkid <= blkid + nblks)) { 898fa9e4066Sahrens uint64_t fr_endblk = rp->fr_blkid + rp->fr_nblks; 899fa9e4066Sahrens free_range_t *nrp = AVL_NEXT(tree, rp); 900fa9e4066Sahrens 901fa9e4066Sahrens if (blkid <= rp->fr_blkid && endblk >= fr_endblk) { 902fa9e4066Sahrens /* clear this entire range */ 903fa9e4066Sahrens avl_remove(tree, rp); 904fa9e4066Sahrens kmem_free(rp, sizeof (free_range_t)); 905fa9e4066Sahrens } else if (blkid <= rp->fr_blkid && 906fa9e4066Sahrens endblk > rp->fr_blkid && endblk < fr_endblk) { 907fa9e4066Sahrens /* clear the beginning of this range */ 908fa9e4066Sahrens rp->fr_blkid = endblk; 909fa9e4066Sahrens rp->fr_nblks = fr_endblk - endblk; 910fa9e4066Sahrens } else if (blkid > rp->fr_blkid && blkid < fr_endblk && 911fa9e4066Sahrens endblk >= fr_endblk) { 912fa9e4066Sahrens /* clear the end of this range */ 913fa9e4066Sahrens rp->fr_nblks = blkid - rp->fr_blkid; 914fa9e4066Sahrens } else if (blkid > rp->fr_blkid && endblk < fr_endblk) { 915fa9e4066Sahrens /* clear a chunk out of this range */ 916fa9e4066Sahrens free_range_t *new_rp = 917fa9e4066Sahrens kmem_alloc(sizeof (free_range_t), KM_SLEEP); 918fa9e4066Sahrens 919fa9e4066Sahrens new_rp->fr_blkid = endblk; 920fa9e4066Sahrens new_rp->fr_nblks = fr_endblk - endblk; 921fa9e4066Sahrens avl_insert_here(tree, new_rp, rp, AVL_AFTER); 922fa9e4066Sahrens rp->fr_nblks = blkid - rp->fr_blkid; 923fa9e4066Sahrens } 924fa9e4066Sahrens /* there may be no overlap */ 925fa9e4066Sahrens rp = nrp; 926fa9e4066Sahrens } 927fa9e4066Sahrens } 928fa9e4066Sahrens 929fa9e4066Sahrens void 930fa9e4066Sahrens dnode_free_range(dnode_t *dn, uint64_t off, uint64_t len, dmu_tx_t *tx) 931fa9e4066Sahrens { 932fa9e4066Sahrens dmu_buf_impl_t *db; 933b143e04bSahrens uint64_t blkoff, blkid, nblks; 934b143e04bSahrens int blksz, head; 935fa9e4066Sahrens int trunc = FALSE; 936fa9e4066Sahrens 937fa9e4066Sahrens rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 938fa9e4066Sahrens blksz = dn->dn_datablksz; 939fa9e4066Sahrens 940fa9e4066Sahrens /* If the range is past the end of the file, this is a no-op */ 941b143e04bSahrens if (off >= blksz * (dn->dn_maxblkid+1)) 942fa9e4066Sahrens goto out; 943fa9e4066Sahrens if (len == -1ULL) { 944fa9e4066Sahrens len = UINT64_MAX - off; 945fa9e4066Sahrens trunc = TRUE; 946fa9e4066Sahrens } 947fa9e4066Sahrens 948fa9e4066Sahrens /* 949fa9e4066Sahrens * First, block align the region to free: 950fa9e4066Sahrens */ 951b143e04bSahrens if (ISP2(blksz)) { 952b143e04bSahrens head = P2NPHASE(off, blksz); 953b143e04bSahrens blkoff = P2PHASE(off, blksz); 954b143e04bSahrens } else { 955b143e04bSahrens ASSERT(dn->dn_maxblkid == 0); 956b143e04bSahrens if (off == 0 && len >= blksz) { 957b143e04bSahrens /* Freeing the whole block; don't do any head. */ 958fa9e4066Sahrens head = 0; 959fa9e4066Sahrens } else { 960b143e04bSahrens /* Freeing part of the block. */ 961fa9e4066Sahrens head = blksz - off; 962fa9e4066Sahrens ASSERT3U(head, >, 0); 963fa9e4066Sahrens } 964b143e04bSahrens blkoff = off; 965fa9e4066Sahrens } 966fa9e4066Sahrens /* zero out any partial block data at the start of the range */ 967fa9e4066Sahrens if (head) { 968b143e04bSahrens ASSERT3U(blkoff + 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; 982b143e04bSahrens bzero(data + blkoff, head); 983fa9e4066Sahrens } 984ea8dc4b6Seschrock dbuf_rele(db, FTAG); 985fa9e4066Sahrens } 986fa9e4066Sahrens off += head; 987fa9e4066Sahrens len -= head; 988fa9e4066Sahrens } 989fa9e4066Sahrens 990b143e04bSahrens /* If the range was less than one block, we're done */ 991b143e04bSahrens if (len == 0 || off >= blksz * (dn->dn_maxblkid+1)) 992fa9e4066Sahrens goto out; 993fa9e4066Sahrens 994b143e04bSahrens if (!ISP2(blksz)) { 995b143e04bSahrens /* 996b143e04bSahrens * They are freeing the whole block of a 997b143e04bSahrens * non-power-of-two blocksize file. Skip all the messy 998b143e04bSahrens * math. 999b143e04bSahrens */ 1000b143e04bSahrens ASSERT3U(off, ==, 0); 1001b143e04bSahrens ASSERT3U(len, >=, blksz); 1002b143e04bSahrens blkid = 0; 1003b143e04bSahrens nblks = 1; 1004b143e04bSahrens } else { 1005b143e04bSahrens int tail; 1006b143e04bSahrens int epbs = dn->dn_indblkshift - SPA_BLKPTRSHIFT; 1007b143e04bSahrens int blkshift = dn->dn_datablkshift; 1008b143e04bSahrens 1009b143e04bSahrens /* If the remaining range is past end of file, we're done */ 1010b143e04bSahrens if (off > dn->dn_maxblkid << blkshift) 1011b143e04bSahrens goto out; 1012b143e04bSahrens 1013b143e04bSahrens if (off + len == UINT64_MAX) 1014b143e04bSahrens tail = 0; 1015b143e04bSahrens else 1016b143e04bSahrens tail = P2PHASE(len, blksz); 1017b143e04bSahrens 1018b143e04bSahrens ASSERT3U(P2PHASE(off, blksz), ==, 0); 1019b143e04bSahrens /* zero out any partial block data at the end of the range */ 1020b143e04bSahrens if (tail) { 1021b143e04bSahrens if (len < tail) 1022b143e04bSahrens tail = len; 1023b143e04bSahrens if (dbuf_hold_impl(dn, 0, dbuf_whichblock(dn, off+len), 1024b143e04bSahrens TRUE, FTAG, &db) == 0) { 1025b143e04bSahrens /* don't dirty if not on disk and not dirty */ 1026b143e04bSahrens if (db->db_dirtied || 1027b143e04bSahrens (db->db_blkptr && 1028b143e04bSahrens !BP_IS_HOLE(db->db_blkptr))) { 1029b143e04bSahrens rw_exit(&dn->dn_struct_rwlock); 1030b143e04bSahrens dbuf_will_dirty(db, tx); 1031b143e04bSahrens rw_enter(&dn->dn_struct_rwlock, 1032b143e04bSahrens RW_WRITER); 1033b143e04bSahrens bzero(db->db.db_data, tail); 1034b143e04bSahrens } 1035b143e04bSahrens dbuf_rele(db, FTAG); 1036fa9e4066Sahrens } 1037b143e04bSahrens len -= tail; 1038b143e04bSahrens } 1039b143e04bSahrens /* If the range did not include a full block, we are done */ 1040b143e04bSahrens if (len == 0) 1041b143e04bSahrens goto out; 1042b143e04bSahrens 1043b143e04bSahrens /* dirty the left indirects */ 1044b143e04bSahrens if (dn->dn_nlevels > 1 && off != 0) { 1045b143e04bSahrens db = dbuf_hold_level(dn, 1, 1046b143e04bSahrens (off - head) >> (blkshift + epbs), FTAG); 1047b143e04bSahrens dbuf_will_dirty(db, tx); 1048ea8dc4b6Seschrock dbuf_rele(db, FTAG); 1049fa9e4066Sahrens } 1050fa9e4066Sahrens 1051b143e04bSahrens /* dirty the right indirects */ 1052b143e04bSahrens if (dn->dn_nlevels > 1 && !trunc) { 1053b143e04bSahrens db = dbuf_hold_level(dn, 1, 1054b143e04bSahrens (off + len + tail - 1) >> (blkshift + epbs), FTAG); 1055b143e04bSahrens dbuf_will_dirty(db, tx); 1056b143e04bSahrens dbuf_rele(db, FTAG); 1057b143e04bSahrens } 1058fa9e4066Sahrens 1059b143e04bSahrens /* 1060b143e04bSahrens * Finally, add this range to the dnode range list, we 1061b143e04bSahrens * will finish up this free operation in the syncing phase. 1062b143e04bSahrens */ 1063b143e04bSahrens ASSERT(IS_P2ALIGNED(off, 1<<blkshift)); 1064b143e04bSahrens ASSERT(off + len == UINT64_MAX || 1065b143e04bSahrens IS_P2ALIGNED(len, 1<<blkshift)); 1066b143e04bSahrens blkid = off >> blkshift; 1067b143e04bSahrens nblks = len >> blkshift; 1068b143e04bSahrens 1069b143e04bSahrens if (trunc) 1070b143e04bSahrens dn->dn_maxblkid = (blkid ? blkid - 1 : 0); 1071fa9e4066Sahrens } 1072fa9e4066Sahrens 1073fa9e4066Sahrens mutex_enter(&dn->dn_mtx); 1074fa9e4066Sahrens dnode_clear_range(dn, blkid, nblks, tx); 1075fa9e4066Sahrens { 1076fa9e4066Sahrens free_range_t *rp, *found; 1077fa9e4066Sahrens avl_index_t where; 1078fa9e4066Sahrens avl_tree_t *tree = &dn->dn_ranges[tx->tx_txg&TXG_MASK]; 1079fa9e4066Sahrens 1080fa9e4066Sahrens /* Add new range to dn_ranges */ 1081fa9e4066Sahrens rp = kmem_alloc(sizeof (free_range_t), KM_SLEEP); 1082fa9e4066Sahrens rp->fr_blkid = blkid; 1083fa9e4066Sahrens rp->fr_nblks = nblks; 1084fa9e4066Sahrens found = avl_find(tree, rp, &where); 1085fa9e4066Sahrens ASSERT(found == NULL); 1086fa9e4066Sahrens avl_insert(tree, rp, where); 1087fa9e4066Sahrens dprintf_dnode(dn, "blkid=%llu nblks=%llu txg=%llu\n", 1088fa9e4066Sahrens blkid, nblks, tx->tx_txg); 1089fa9e4066Sahrens } 1090fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 1091fa9e4066Sahrens 1092fa9e4066Sahrens dbuf_free_range(dn, blkid, nblks, tx); 1093fa9e4066Sahrens dnode_setdirty(dn, tx); 1094fa9e4066Sahrens out: 1095fa9e4066Sahrens rw_exit(&dn->dn_struct_rwlock); 1096fa9e4066Sahrens } 1097fa9e4066Sahrens 1098fa9e4066Sahrens /* return TRUE if this blkid was freed in a recent txg, or FALSE if it wasn't */ 1099fa9e4066Sahrens uint64_t 1100fa9e4066Sahrens dnode_block_freed(dnode_t *dn, uint64_t blkid) 1101fa9e4066Sahrens { 1102fa9e4066Sahrens free_range_t range_tofind; 1103fa9e4066Sahrens void *dp = spa_get_dsl(dn->dn_objset->os_spa); 1104fa9e4066Sahrens int i; 1105fa9e4066Sahrens 1106fa9e4066Sahrens if (blkid == DB_BONUS_BLKID) 1107fa9e4066Sahrens return (FALSE); 1108fa9e4066Sahrens 1109fa9e4066Sahrens /* 1110fa9e4066Sahrens * If we're in the process of opening the pool, dp will not be 1111fa9e4066Sahrens * set yet, but there shouldn't be anything dirty. 1112fa9e4066Sahrens */ 1113fa9e4066Sahrens if (dp == NULL) 1114fa9e4066Sahrens return (FALSE); 1115fa9e4066Sahrens 1116fa9e4066Sahrens if (dn->dn_free_txg) 1117fa9e4066Sahrens return (TRUE); 1118fa9e4066Sahrens 1119fa9e4066Sahrens /* 1120fa9e4066Sahrens * If dn_datablkshift is not set, then there's only a single 1121fa9e4066Sahrens * block, in which case there will never be a free range so it 1122fa9e4066Sahrens * won't matter. 1123fa9e4066Sahrens */ 1124fa9e4066Sahrens range_tofind.fr_blkid = blkid; 1125fa9e4066Sahrens mutex_enter(&dn->dn_mtx); 1126fa9e4066Sahrens for (i = 0; i < TXG_SIZE; i++) { 1127fa9e4066Sahrens free_range_t *range_found; 1128fa9e4066Sahrens avl_index_t idx; 1129fa9e4066Sahrens 1130fa9e4066Sahrens range_found = avl_find(&dn->dn_ranges[i], &range_tofind, &idx); 1131fa9e4066Sahrens if (range_found) { 1132fa9e4066Sahrens ASSERT(range_found->fr_nblks > 0); 1133fa9e4066Sahrens break; 1134fa9e4066Sahrens } 1135fa9e4066Sahrens range_found = avl_nearest(&dn->dn_ranges[i], idx, AVL_BEFORE); 1136fa9e4066Sahrens if (range_found && 1137fa9e4066Sahrens range_found->fr_blkid + range_found->fr_nblks > blkid) 1138fa9e4066Sahrens break; 1139fa9e4066Sahrens } 1140fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 1141fa9e4066Sahrens return (i < TXG_SIZE); 1142fa9e4066Sahrens } 1143fa9e4066Sahrens 1144fa9e4066Sahrens /* call from syncing context when we actually write/free space for this dnode */ 1145fa9e4066Sahrens void 114699653d4eSeschrock dnode_diduse_space(dnode_t *dn, int64_t delta) 1147fa9e4066Sahrens { 114899653d4eSeschrock uint64_t space; 114999653d4eSeschrock dprintf_dnode(dn, "dn=%p dnp=%p used=%llu delta=%lld\n", 1150fa9e4066Sahrens dn, dn->dn_phys, 115199653d4eSeschrock (u_longlong_t)dn->dn_phys->dn_used, 115299653d4eSeschrock (longlong_t)delta); 1153fa9e4066Sahrens 1154fa9e4066Sahrens mutex_enter(&dn->dn_mtx); 115599653d4eSeschrock space = DN_USED_BYTES(dn->dn_phys); 115699653d4eSeschrock if (delta > 0) { 115799653d4eSeschrock ASSERT3U(space + delta, >=, space); /* no overflow */ 115899653d4eSeschrock } else { 115999653d4eSeschrock ASSERT3U(space, >=, -delta); /* no underflow */ 116099653d4eSeschrock } 116199653d4eSeschrock space += delta; 116299653d4eSeschrock if (spa_version(dn->dn_objset->os_spa) < ZFS_VERSION_DNODE_BYTES) { 116399653d4eSeschrock ASSERT((dn->dn_phys->dn_flags & DNODE_FLAG_USED_BYTES) == 0); 116499653d4eSeschrock ASSERT3U(P2PHASE(space, 1<<DEV_BSHIFT), ==, 0); 116599653d4eSeschrock dn->dn_phys->dn_used = space >> DEV_BSHIFT; 1166fa9e4066Sahrens } else { 116799653d4eSeschrock dn->dn_phys->dn_used = space; 116899653d4eSeschrock dn->dn_phys->dn_flags |= DNODE_FLAG_USED_BYTES; 1169fa9e4066Sahrens } 1170fa9e4066Sahrens mutex_exit(&dn->dn_mtx); 1171fa9e4066Sahrens } 1172fa9e4066Sahrens 1173fa9e4066Sahrens /* 1174fa9e4066Sahrens * Call when we think we're going to write/free space in open context. 1175fa9e4066Sahrens * Be conservative (ie. OK to write less than this or free more than 1176fa9e4066Sahrens * this, but don't write more or free less). 1177fa9e4066Sahrens */ 1178fa9e4066Sahrens void 1179fa9e4066Sahrens dnode_willuse_space(dnode_t *dn, int64_t space, dmu_tx_t *tx) 1180fa9e4066Sahrens { 1181fa9e4066Sahrens objset_impl_t *os = dn->dn_objset; 1182fa9e4066Sahrens dsl_dataset_t *ds = os->os_dsl_dataset; 1183fa9e4066Sahrens 1184fa9e4066Sahrens if (space > 0) 1185fa9e4066Sahrens space = spa_get_asize(os->os_spa, space); 1186fa9e4066Sahrens 1187fa9e4066Sahrens if (ds) 1188fa9e4066Sahrens dsl_dir_willuse_space(ds->ds_dir, space, tx); 1189fa9e4066Sahrens 1190fa9e4066Sahrens dmu_tx_willuse_space(tx, space); 1191fa9e4066Sahrens } 1192fa9e4066Sahrens 1193fa9e4066Sahrens static int 1194fa9e4066Sahrens dnode_next_offset_level(dnode_t *dn, boolean_t hole, uint64_t *offset, 11956754306eSahrens int lvl, uint64_t blkfill, uint64_t txg) 1196fa9e4066Sahrens { 1197fa9e4066Sahrens dmu_buf_impl_t *db = NULL; 1198fa9e4066Sahrens void *data = NULL; 1199fa9e4066Sahrens uint64_t epbs = dn->dn_phys->dn_indblkshift - SPA_BLKPTRSHIFT; 1200fa9e4066Sahrens uint64_t epb = 1ULL << epbs; 1201fa9e4066Sahrens uint64_t minfill, maxfill; 1202fa9e4066Sahrens int i, error, span; 1203fa9e4066Sahrens 1204fa9e4066Sahrens dprintf("probing object %llu offset %llx level %d of %u\n", 1205fa9e4066Sahrens dn->dn_object, *offset, lvl, dn->dn_phys->dn_nlevels); 1206fa9e4066Sahrens 1207fa9e4066Sahrens if (lvl == dn->dn_phys->dn_nlevels) { 1208fa9e4066Sahrens error = 0; 1209fa9e4066Sahrens epb = dn->dn_phys->dn_nblkptr; 1210fa9e4066Sahrens data = dn->dn_phys->dn_blkptr; 1211fa9e4066Sahrens } else { 1212fa9e4066Sahrens uint64_t blkid = dbuf_whichblock(dn, *offset) >> (epbs * lvl); 1213fa9e4066Sahrens error = dbuf_hold_impl(dn, lvl, blkid, TRUE, FTAG, &db); 1214fa9e4066Sahrens if (error) { 1215fa9e4066Sahrens if (error == ENOENT) 1216fa9e4066Sahrens return (hole ? 0 : ESRCH); 1217fa9e4066Sahrens return (error); 1218fa9e4066Sahrens } 121998572ac1Sahrens error = dbuf_read(db, NULL, DB_RF_CANFAIL | DB_RF_HAVESTRUCT); 122098572ac1Sahrens if (error) { 122198572ac1Sahrens dbuf_rele(db, FTAG); 122298572ac1Sahrens return (error); 122398572ac1Sahrens } 1224fa9e4066Sahrens data = db->db.db_data; 1225fa9e4066Sahrens } 1226fa9e4066Sahrens 12276754306eSahrens if (db && txg && 12286754306eSahrens (db->db_blkptr == NULL || db->db_blkptr->blk_birth <= txg)) { 12296754306eSahrens error = ESRCH; 12306754306eSahrens } else if (lvl == 0) { 1231fa9e4066Sahrens dnode_phys_t *dnp = data; 1232fa9e4066Sahrens span = DNODE_SHIFT; 1233fa9e4066Sahrens ASSERT(dn->dn_type == DMU_OT_DNODE); 1234fa9e4066Sahrens 1235fa9e4066Sahrens for (i = (*offset >> span) & (blkfill - 1); i < blkfill; i++) { 12366754306eSahrens boolean_t newcontents = B_TRUE; 12376754306eSahrens if (txg) { 12386754306eSahrens int j; 12396754306eSahrens newcontents = B_FALSE; 12406754306eSahrens for (j = 0; j < dnp[i].dn_nblkptr; j++) { 12416754306eSahrens if (dnp[i].dn_blkptr[j].blk_birth > txg) 12426754306eSahrens newcontents = B_TRUE; 12436754306eSahrens } 12446754306eSahrens } 12456754306eSahrens if (!dnp[i].dn_type == hole && newcontents) 1246fa9e4066Sahrens break; 1247fa9e4066Sahrens *offset += 1ULL << span; 1248fa9e4066Sahrens } 1249fa9e4066Sahrens if (i == blkfill) 1250fa9e4066Sahrens error = ESRCH; 1251fa9e4066Sahrens } else { 1252fa9e4066Sahrens blkptr_t *bp = data; 1253fa9e4066Sahrens span = (lvl - 1) * epbs + dn->dn_datablkshift; 1254fa9e4066Sahrens minfill = 0; 1255fa9e4066Sahrens maxfill = blkfill << ((lvl - 1) * epbs); 1256fa9e4066Sahrens 1257fa9e4066Sahrens if (hole) 1258fa9e4066Sahrens maxfill--; 1259fa9e4066Sahrens else 1260fa9e4066Sahrens minfill++; 1261fa9e4066Sahrens 1262fa9e4066Sahrens for (i = (*offset >> span) & ((1ULL << epbs) - 1); 1263fa9e4066Sahrens i < epb; i++) { 1264fa9e4066Sahrens if (bp[i].blk_fill >= minfill && 12656754306eSahrens bp[i].blk_fill <= maxfill && 12666754306eSahrens bp[i].blk_birth > txg) 1267fa9e4066Sahrens break; 1268fa9e4066Sahrens *offset += 1ULL << span; 1269fa9e4066Sahrens } 1270fa9e4066Sahrens if (i >= epb) 1271fa9e4066Sahrens error = ESRCH; 1272fa9e4066Sahrens } 1273fa9e4066Sahrens 1274fa9e4066Sahrens if (db) 1275ea8dc4b6Seschrock dbuf_rele(db, FTAG); 1276fa9e4066Sahrens 1277fa9e4066Sahrens return (error); 1278fa9e4066Sahrens } 1279fa9e4066Sahrens 1280fa9e4066Sahrens /* 1281fa9e4066Sahrens * Find the next hole, data, or sparse region at or after *offset. 1282fa9e4066Sahrens * The value 'blkfill' tells us how many items we expect to find 1283fa9e4066Sahrens * in an L0 data block; this value is 1 for normal objects, 1284fa9e4066Sahrens * DNODES_PER_BLOCK for the meta dnode, and some fraction of 1285fa9e4066Sahrens * DNODES_PER_BLOCK when searching for sparse regions thereof. 12866754306eSahrens * 1287fa9e4066Sahrens * Examples: 1288fa9e4066Sahrens * 12896754306eSahrens * dnode_next_offset(dn, hole, offset, 1, 1, 0); 1290fa9e4066Sahrens * Finds the next hole/data in a file. 1291fa9e4066Sahrens * Used in dmu_offset_next(). 1292fa9e4066Sahrens * 12936754306eSahrens * dnode_next_offset(mdn, hole, offset, 0, DNODES_PER_BLOCK, txg); 1294fa9e4066Sahrens * Finds the next free/allocated dnode an objset's meta-dnode. 12956754306eSahrens * Only finds objects that have new contents since txg (ie. 12966754306eSahrens * bonus buffer changes and content removal are ignored). 1297fa9e4066Sahrens * Used in dmu_object_next(). 1298fa9e4066Sahrens * 12996754306eSahrens * dnode_next_offset(mdn, TRUE, offset, 2, DNODES_PER_BLOCK >> 2, 0); 1300fa9e4066Sahrens * Finds the next L2 meta-dnode bp that's at most 1/4 full. 1301fa9e4066Sahrens * Used in dmu_object_alloc(). 1302fa9e4066Sahrens */ 1303fa9e4066Sahrens int 1304fa9e4066Sahrens dnode_next_offset(dnode_t *dn, boolean_t hole, uint64_t *offset, 13056754306eSahrens int minlvl, uint64_t blkfill, uint64_t txg) 1306fa9e4066Sahrens { 1307fa9e4066Sahrens int lvl, maxlvl; 1308fa9e4066Sahrens int error = 0; 1309fa9e4066Sahrens uint64_t initial_offset = *offset; 1310fa9e4066Sahrens 1311fa9e4066Sahrens rw_enter(&dn->dn_struct_rwlock, RW_READER); 1312fa9e4066Sahrens 1313fa9e4066Sahrens if (dn->dn_phys->dn_nlevels == 0) { 1314fa9e4066Sahrens rw_exit(&dn->dn_struct_rwlock); 1315fa9e4066Sahrens return (ESRCH); 1316fa9e4066Sahrens } 1317fa9e4066Sahrens 1318fa9e4066Sahrens if (dn->dn_datablkshift == 0) { 1319fa9e4066Sahrens if (*offset < dn->dn_datablksz) { 1320fa9e4066Sahrens if (hole) 1321fa9e4066Sahrens *offset = dn->dn_datablksz; 1322fa9e4066Sahrens } else { 1323fa9e4066Sahrens error = ESRCH; 1324fa9e4066Sahrens } 1325fa9e4066Sahrens rw_exit(&dn->dn_struct_rwlock); 1326fa9e4066Sahrens return (error); 1327fa9e4066Sahrens } 1328fa9e4066Sahrens 1329fa9e4066Sahrens maxlvl = dn->dn_phys->dn_nlevels; 1330fa9e4066Sahrens 1331fa9e4066Sahrens for (lvl = minlvl; lvl <= maxlvl; lvl++) { 13326754306eSahrens error = dnode_next_offset_level(dn, 13336754306eSahrens hole, offset, lvl, blkfill, txg); 133498572ac1Sahrens if (error != ESRCH) 1335fa9e4066Sahrens break; 1336fa9e4066Sahrens } 1337fa9e4066Sahrens 13386754306eSahrens while (--lvl >= minlvl && error == 0) { 13396754306eSahrens error = dnode_next_offset_level(dn, 13406754306eSahrens hole, offset, lvl, blkfill, txg); 13416754306eSahrens } 1342fa9e4066Sahrens 1343fa9e4066Sahrens rw_exit(&dn->dn_struct_rwlock); 1344fa9e4066Sahrens 134598572ac1Sahrens if (error == 0 && initial_offset > *offset) 134698572ac1Sahrens error = ESRCH; 1347fa9e4066Sahrens 1348fa9e4066Sahrens return (error); 1349fa9e4066Sahrens } 1350